| /xsrc/external/mit/MesaLib.old/dist/src/freedreno/vulkan/ |
| tu_shader.c | 86 struct exec_list sorted; local
87 exec_list_make_empty(&sorted);
93 /* insert the variable into the sorted list */
95 nir_foreach_variable(tmp, &sorted)
105 exec_list_push_tail(&sorted, &var->node);
108 exec_list_move_nodes_to(&sorted, variables);
|
| /xsrc/external/mit/mkfontscale/dist/ |
| list.c | 258 ListPtr *sorted; local
263 sorted = malloc(l * sizeof(ListPtr));
265 if (sorted == NULL)
269 sorted[i++] = n;
271 qsort(sorted, i, sizeof(ListPtr), compareListEntries);
272 n = sorted[0];
274 sorted[i]->next = sorted[i + 1];
276 sorted[i]->next = NULL;
277 free(sorted);
[all...] |
| /xsrc/external/mit/brotli/dist/c/dec/ |
| huffman.c | 108 int symbol; /* symbol index in original or sorted table */
113 int sorted[BROTLI_CODE_LENGTH_CODES]; /* symbols sorted by code length */ local
114 /* offsets in sorted table for each length */
121 /* Generate offsets into sorted symbol table by code length. */
137 sorted[offset[code_lengths[symbol]]--] = symbol;
145 code = ConstructHuffmanCode(0, (uint16_t)sorted[0]);
160 code = ConstructHuffmanCode((uint8_t)bits, (uint16_t)sorted[symbol++]);
176 int symbol; /* symbol index in original or sorted table */
|
| /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/loader/ |
| loadext.c | 155 static NODE *sorted = NULL, *last = NULL; variable
252 sorted = newnode;
396 sorted = NULL;
422 for (node = sorted; node; node = node->n_next) {
429 if (sorted)
430 free_nodes(sorted);
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/drivers/dri/i965/ |
| brw_program.c | 524 uint64_t *sorted[brw->shader_time.num_entries]; local
532 sorted[i] = &scaled[i];
586 qsort(sorted, brw->shader_time.num_entries, sizeof(sorted[0]), compare_time);
592 /* Work back from the sorted pointers times to a time to print. */
593 int i = sorted[s] - scaled;
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/drivers/dri/i965/ |
| brw_program.c | 553 uint64_t *sorted[brw->shader_time.num_entries]; local
561 sorted[i] = &scaled[i];
615 qsort(sorted, brw->shader_time.num_entries, sizeof(sorted[0]), compare_time);
621 /* Work back from the sorted pointers times to a time to print. */
622 int i = sorted[s] - scaled;
|
| /xsrc/external/mit/libXfont2/dist/include/X11/fonts/ |
| fntfilst.h | 102 Bool sorted; member in struct:_FontTable
|
| /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/os-support/bsd/ |
| i386_video.c | 620 RangePtr rp1, rp2, copy, sorted = NULL, minp, prev, minprev; local
646 minp->next = sorted;
647 sorted = minp;
649 return sorted;
693 RangePtr rp1, sorted = NULL; local
696 sorted = sortRangeList(overlap);
698 rp1 = sorted;
702 freeRangeList(sorted);
708 freeRangeList(sorted);
713 freeRangeList(sorted);
[all...] |
| /xsrc/external/mit/bdftopcf/dist/ |
| fntfilst.h | 108 Bool sorted; member in struct:_FontTable
|
| /xsrc/external/mit/libXfont/dist/include/X11/fonts/ |
| fntfilst.h | 108 Bool sorted; member in struct:_FontTable
|
| /xsrc/external/mit/freetype/dist/src/pshinter/ |
| pshalgo.c | 116 PSH_Hint* sorted = table->sort_global; local
122 for ( ; count > 0; count--, sorted++ )
124 hint2 = sorted[0];
137 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
314 /* will be already sorted -- and the sort will be linear */
|
| /xsrc/external/mit/libdrm/dist/ |
| xf86drmMode.c | 1519 drmModeAtomicReqPtr sorted; local
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
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_register_allocation.cpp | 990 /* variables are sorted from small sized to large */
991 /* NOTE: variables are also sorted by ID. this only affects a very small number of shaders
1384 std::vector<IDAndInfo> sorted; local
1387 sorted.emplace_back(var.id, info);
1391 sorted.begin(), sorted.end(),
1408 for (IDAndInfo& var : sorted) {
|
| /xsrc/external/mit/xauth/dist/ |
| process.c | 1198 /* cathegory from the given list and inserts them into the sorted list. */
1200 AuthList *sorted = NULL, *sorted_tail = NULL; local
1212 sorted = sorted_tail = iter; \
1229 *firstp = sorted;
|
