Lines Matching full:sorted

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