| /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
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/sys/arch/powerpc/booke/dev/ |
| pq3obio.c | 215 u_int sorted[OBIO_PORTS]; local
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/xlint/lint2/ |
| hash.c | 168 struct hte_list sorted = { NULL, 0, 0 }; local
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/crypto/external/bsd/openssl/dist/test/ |
| stack_test.c | 61 int sorted; member in struct:__anon1775
139 /* find sorted -- the value is matched so we don't need to locate it */
141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
142 TEST_info("int sorted find %d", i);
146 /* find_ex sorted */
149 TEST_info("int sorted find_ex present %d", i);
154 TEST_info("int sorted find_ex absent %d", i);
|
| /src/crypto/external/bsd/openssl.old/dist/test/ |
| stack_test.c | 61 int sorted; member in struct:__anon2287
139 /* find sorted -- the value is matched so we don't need to locate it */
141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
142 TEST_info("int sorted find %d", i);
146 /* find_ex sorted */
149 TEST_info("int sorted find_ex present %d", i);
154 TEST_info("int sorted find_ex absent %d", i);
|
| /src/external/apache2/llvm/dist/clang/utils/ |
| FindSpecRefs | 758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
|
| /src/external/bsd/openldap/dist/servers/lloadd/ |
| tier_weighted.c | 134 * Keep it sorted. The only thing RFC 2782 specifies is that weight 0
182 LloadBackend *b, **sorted; local
187 sorted = ch_malloc( tier->t_nbackends * sizeof(LloadBackend *) );
190 sorted[i++] = b;
195 weighted_shuffle( sorted, tier->t_nbackends );
200 checked_lock( &sorted[i]->b_mutex );
201 result = backend_select( sorted[i], op, cp, res, message );
202 checked_unlock( &sorted[i]->b_mutex );
210 ch_free( sorted );
|
| /src/crypto/external/apache2/openssl/dist/test/ |
| stack_test.c | 61 int sorted; member in struct:__anon190
139 /* find sorted -- the value is matched so we don't need to locate it */
141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
142 TEST_info("int sorted find %d", i);
146 /* find_ex sorted */
149 TEST_info("int sorted find_ex present %d", i);
154 TEST_info("int sorted find_ex absent %d", i);
|
| priority_queue_test.c | 55 static size_t values[MAX_SAMPLES], sorted[MAX_SAMPLES], ref[MAX_SAMPLES]; local
69 memset(sorted, 0, sizeof(sorted));
74 memcpy(sorted, values, sizeof(*sorted) * count);
75 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare);
78 memcpy(values, sorted, sizeof(*values) * count);
93 if (!TEST_size_t_eq(*ossl_pqueue_size_t_peek(pq), *sorted)
107 memcpy(sorted, values, sizeof(*sorted) * count)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| splay-tree-utils.cc | 177 std::array<int, ARRAY_SIZE (data)> sorted; local
178 std::copy (data, data + ARRAY_SIZE (data), sorted.begin ());
179 std::sort (sorted.begin (), sorted.end ());
184 for (int value : sorted)
191 ASSERT_EQ (tree.min_node ()->value (), sorted.front ());
202 for (auto it = sorted.rbegin (); it != sorted.rend (); ++it)
209 ASSERT_EQ (tree.max_node ()->value (), sorted.back ());
212 int mid_min = sorted[sorted.size () / 3]
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| splay-tree-utils.cc | 177 std::array<int, ARRAY_SIZE (data)> sorted; local
178 std::copy (data, data + ARRAY_SIZE (data), sorted.begin ());
179 std::sort (sorted.begin (), sorted.end ());
184 for (int value : sorted)
191 ASSERT_EQ (tree.min_node ()->value (), sorted.front ());
202 for (auto it = sorted.rbegin (); it != sorted.rend (); ++it)
209 ASSERT_EQ (tree.max_node ()->value (), sorted.back ());
212 int mid_min = sorted[sorted.size () / 3]
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/stack/ |
| stack.c | 31 int sorted; member in struct:stack_st
42 sk->sorted = 0;
57 ret->sorted = 0;
95 ret->sorted = 0;
281 st->sorted = 0;
344 if (!st->sorted) {
476 st->sorted = 0;
482 if (st != NULL && !st->sorted && st->comp != NULL) {
485 st->sorted = 1; /* empty or single-element stack is considered sorted */
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/stack/ |
| stack.c | 27 int sorted; member in struct:stack_st
38 sk->sorted = 0;
53 ret->sorted = 0;
92 ret->sorted = 0;
282 st->sorted = 0;
340 if (!st->sorted) {
343 st->sorted = 1; /* empty or single-element stack is considered sorted */
462 st->sorted = 0;
468 if (st != NULL && !st->sorted && st->comp != NULL)
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/stack/ |
| stack.c | 29 int sorted; member in struct:stack_st
39 sk->sorted = 0;
253 st->sorted = 0;
303 if (!st->sorted) {
306 st->sorted = 1; /* empty or single-element stack is considered sorted */
397 st->sorted = 0;
403 if (st != NULL && !st->sorted && st->comp != NULL) {
406 st->sorted = 1; /* empty or single-element stack is considered sorted */
[all...] |
| /src/external/gpl3/gcc/dist/libgcc/ |
| unwind-dw2-fde.h | 53 unsigned long sorted : 1; member in struct:object::__anon14353::__anon14354
|
| /src/external/gpl3/gcc.old/dist/libgcc/ |
| unwind-dw2-fde.h | 53 unsigned long sorted : 1; member in struct:object::__anon16756::__anon16757
|
| /src/external/mit/isl/dist/ |
| isl_scheduler.h | 191 * sorted contains a list of node indices sorted according to the
232 int *sorted; member in struct:isl_sched_graph
|
| /src/external/cddl/osnet/dist/lib/libuutil/common/ |
| uu_list.c | 317 int sorted = lp->ul_sorted; local
336 if (sorted && cmp > 0) {
|
| /src/external/gpl3/binutils/dist/gprof/ |
| cg_print.c | 313 Arc *arc, *detached, sorted, *prev; local
316 sorted's parents.
318 *detached the rest of the arcs to be sorted.
319 sorted arc list onto which you insertion sort.
321 sorted.next_parent = 0;
327 /* Consider *arc as disconnected; insert it into sorted. */
328 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
338 /* Reattach sorted arcs to child. */
339 child->cg.parents = sorted.next_parent;
400 Arc *arc, *detached, sorted, *prev local
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| vec.h | 88 sorted = false;
161 sorted = true;
164 // Binary search, vector must be sorted
172 sorted = false;
178 return sorted;
200 bool sorted; member in class:Vector
234 sorted = false;
358 // It is assumed that the vector is SORTED in
|
| /src/external/gpl3/binutils.old/dist/gprof/ |
| cg_print.c | 313 Arc *arc, *detached, sorted, *prev; local
316 sorted's parents.
318 *detached the rest of the arcs to be sorted.
319 sorted arc list onto which you insertion sort.
321 sorted.next_parent = 0;
327 /* Consider *arc as disconnected; insert it into sorted. */
328 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
338 /* Reattach sorted arcs to child. */
339 child->cg.parents = sorted.next_parent;
400 Arc *arc, *detached, sorted, *prev local
[all...] |
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| vec.h | 88 sorted = false;
161 sorted = true;
164 // Binary search, vector must be sorted
172 sorted = false;
178 return sorted;
200 bool sorted; member in class:Vector
234 sorted = false;
358 // It is assumed that the vector is SORTED in
|
| /src/sys/arch/i386/stand/efiboot/ |
| boot.c | 419 "memmap [{sorted|unsorted|compact}]\n"
816 bool sorted = true; local
819 if (*arg == '\0' || strcmp(arg, "sorted") == 0)
820 /* Already sorted is true. */;
822 sorted = false;
827 "must be 'sorted', 'unsorted' or 'compact'.\n");
831 efi_memory_show_map(sorted, compact);
|
