Lines Matching refs:cursor
1327 uint32_t cursor;
1331 uint32_t cursor;
1345 req->cursor = 0;
1362 new->cursor = old->cursor;
1372 old->cursor * sizeof(*new->items));
1388 if (!augment || augment->cursor == 0)
1391 if (base->cursor + augment->cursor >= base->size_items) {
1395 base->size_items = base->cursor + augment->cursor;
1405 memcpy(&base->items[base->cursor], augment->items,
1406 augment->cursor * sizeof(*augment->items));
1407 for (i = base->cursor; i < base->cursor + augment->cursor; i++)
1408 base->items[i].cursor = i;
1409 base->cursor += augment->cursor;
1418 return req->cursor;
1421 drm_public void drmModeAtomicSetCursor(drmModeAtomicReqPtr req, int cursor)
1424 req->cursor = cursor;
1438 if (req->cursor >= req->size_items) {
1451 req->items[req->cursor].object_id = object_id;
1452 req->items[req->cursor].property_id = property_id;
1453 req->items[req->cursor].value = value;
1454 req->items[req->cursor].cursor = req->cursor;
1455 req->cursor++;
1457 return req->cursor;
1480 return first->cursor - second->cursor;
1500 if (req->cursor == 0)
1510 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items),
1514 for (i = 0; i < sorted->cursor; i++) {
1520 if (i == sorted->cursor - 1)
1528 (sorted->cursor - i - 1) * sizeof(*sorted->items));
1529 sorted->cursor--;
1532 for (i = 0; i < sorted->cursor; i++)
1533 sorted->items[i].cursor = i;
1547 props_ptr = drmMalloc(sorted->cursor * sizeof props_ptr[0]);
1553 prop_values_ptr = drmMalloc(sorted->cursor * sizeof prop_values_ptr[0]);
1559 for (i = 0, last_obj_id = 0; i < sorted->cursor; i++) {