Lines Matching defs:sorted
1519 drmModeAtomicReqPtr sorted;
1536 sorted = drmModeAtomicDuplicate(req);
1537 if (sorted == NULL)
1543 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items),
1546 /* Now the list is sorted, eliminate duplicate property sets. */
1547 for (i = 0; i < sorted->cursor; i++) {
1548 if (sorted->items[i].object_id != last_obj_id) {
1550 last_obj_id = sorted->items[i].object_id;
1553 if (i == sorted->cursor - 1)
1556 if (sorted->items[i].object_id != sorted->items[i + 1].object_id ||
1557 sorted->items[i].property_id != sorted->items[i + 1].property_id)
1560 memmove(&sorted->items[i], &sorted->items[i + 1],
1561 (sorted->cursor - i - 1) * sizeof(*sorted->items));
1562 sorted->cursor--;
1565 for (i = 0; i < sorted->cursor; i++)
1566 sorted->items[i].cursor = i;
1580 props_ptr = drmMalloc(sorted->cursor * sizeof props_ptr[0]);
1586 prop_values_ptr = drmMalloc(sorted->cursor * sizeof prop_values_ptr[0]);
1592 for (i = 0, last_obj_id = 0; i < sorted->cursor; i++) {
1593 if (sorted->items[i].object_id != last_obj_id) {
1595 objs_ptr[obj_idx] = sorted->items[i].object_id;
1600 props_ptr[i] = sorted->items[i].property_id;
1601 prop_values_ptr[i] = sorted->items[i].value;
1619 drmModeAtomicFree(sorted);