Lines Matching refs:sorted
1486 drmModeAtomicReqPtr sorted;
1503 sorted = drmModeAtomicDuplicate(req);
1504 if (sorted == NULL)
1510 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items),
1513 /* Now the list is sorted, eliminate duplicate property sets. */
1514 for (i = 0; i < sorted->cursor; i++) {
1515 if (sorted->items[i].object_id != last_obj_id) {
1517 last_obj_id = sorted->items[i].object_id;
1520 if (i == sorted->cursor - 1)
1523 if (sorted->items[i].object_id != sorted->items[i + 1].object_id ||
1524 sorted->items[i].property_id != sorted->items[i + 1].property_id)
1527 memmove(&sorted->items[i], &sorted->items[i + 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++) {
1560 if (sorted->items[i].object_id != last_obj_id) {
1562 objs_ptr[obj_idx] = sorted->items[i].object_id;
1567 props_ptr[i] = sorted->items[i].property_id;
1568 prop_values_ptr[i] = sorted->items[i].value;
1586 drmModeAtomicFree(sorted);