/src/usr.bin/make/unit-tests/ |
varmod-order-shuffle.mk | 38 sorted:= ${WORDS:Ox:O} macro 39 .if ${sorted} != ${WORDS:O} 40 . error ${sorted} != ${WORDS:O}
|
/src/sys/external/bsd/drm2/linux/ |
linux_list_sort.c | 56 * Array of sorted sublists, counting in binary: accumulator[i] 57 * is sorted, and either is NULL or has length 2^i. 64 /* The sorted list we're currently working on. */ 65 struct list_head *sorted; local in function:list_sort 76 list_for_each_safe(sorted, next, list) { 77 /* Pick off a single element, always sorted. */ 78 sorted->next = NULL; 86 sorted = list_sort_merge(accumulator[logn], sorted, 97 * logn = log_2(length(sorted)), and accumulator[logn [all...] |
/src/tests/usr.bin/xlint/lint1/ |
d_typefun.c | 13 int sorted; member in struct:stack_st
|
/src/usr.bin/xlint/lint2/ |
hash.c | 168 struct hte_list sorted = { NULL, 0, 0 }; local in function:symtab_forall_sorted 174 hte_list_add(&sorted, hte); 176 qsort(sorted.items, sorted.len, sizeof(sorted.items[0]), hte_by_name); 178 for (i = 0; i < sorted.len; i++) 179 action(sorted.items[i]); 181 free(sorted.items);
|
/src/sys/arch/powerpc/booke/dev/ |
pq3obio.c | 215 u_int sorted[OBIO_PORTS]; local in function:pq3obio_attach 225 if (lbc->lbc_base < sc->sc_lbcs[sorted[j]].lbc_base) 229 sorted[k] = sorted[k - 1]; 231 sorted[j] = i; 265 struct pq3lbc_softc * const lbc_lo = &sc->sc_lbcs[sorted[i-1]]; 266 struct pq3lbc_softc * const lbc_hi = &sc->sc_lbcs[sorted[i]];
|
/src/usr.bin/col/ |
col.c | 440 static CHAR *sorted; local in function:flush_line 449 if ((sorted = realloc(sorted, 474 sorted[count[c->c_column]++] = *c; 475 c = sorted;
|
/src/sys/arch/i386/stand/efiboot/ |
boot.c | 409 "memmap [{sorted|unsorted|compact}]\n" 756 bool sorted = true; local in function:command_memmap 759 if (*arg == '\0' || strcmp(arg, "sorted") == 0) 760 /* Already sorted is true. */; 762 sorted = false; 767 "must be 'sorted', 'unsorted' or 'compact'.\n"); 771 efi_memory_show_map(sorted, compact);
|
/src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/gr/ |
nouveau_nvkm_engine_gr_gf100.c | 1881 bool sorted; local in function:gf100_gr_oneinit_tiles 1907 sorted = false; 1909 while (!sorted) { 1910 for (sorted = true, i = 0; i < gr->gpc_nr - 1; i++) { 1916 sorted = false;
|
/src/lib/libc/time/ |
Makefile | 863 name-lengths.ck slashed-abbrs.ck sorted.ck \ 924 sorted.ck: backward backzone
|