Lines Matching defs:sorted
1200 /* keep it sorted by object_id and property_id */
1260 /* keep it sorted by object_id and property_id */
1582 drmModeAtomicReqPtr sorted;
1599 sorted = drmModeAtomicDuplicate(req);
1600 if (sorted == NULL)
1606 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items),
1609 /* Now the list is sorted, eliminate duplicate property sets. */
1610 for (i = 0; i < sorted->cursor; i++) {
1611 if (sorted->items[i].object_id != last_obj_id) {
1613 last_obj_id = sorted->items[i].object_id;
1616 if (i == sorted->cursor - 1)
1619 if (sorted->items[i].object_id != sorted->items[i + 1].object_id ||
1620 sorted->items[i].property_id != sorted->items[i + 1].property_id)
1623 memmove(&sorted->items[i], &sorted->items[i + 1],
1624 (sorted->cursor - i - 1) * sizeof(*sorted->items));
1625 sorted->cursor--;
1640 props_ptr = drmMalloc(sorted->cursor * sizeof props_ptr[0]);
1646 prop_values_ptr = drmMalloc(sorted->cursor * sizeof prop_values_ptr[0]);
1652 for (i = 0, last_obj_id = 0; i < sorted->cursor; i++) {
1653 if (sorted->items[i].object_id != last_obj_id) {
1655 objs_ptr[obj_idx] = sorted->items[i].object_id;
1660 props_ptr[i] = sorted->items[i].property_id;
1661 prop_values_ptr[i] = sorted->items[i].value;
1679 drmModeAtomicFree(sorted);
