| /src/external/apache2/llvm/dist/llvm/utils/lit/tests/Inputs/shtest-env/ |
| print_environment.py | 6 sorted_environment = sorted(os.environ.items())
|
| /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/external/bsd/unbound/dist/libunbound/python/examples/ |
| example8-1.py | 46 for k in sorted(result.data.mx_list):
53 for k in sorted(result.data.address_list):
60 for k in sorted(result.data.domain_list):
|
| async-lookup.py | 43 print("Call_back:", sorted(my_data))
45 print("Result:", sorted(result.data.address_list))
|
| mx-lookup.py | 46 for k in sorted(result.data.mx_list):
53 for k in sorted(result.data.address_list):
|
| dns-lookup.py | 43 print("Result:", sorted(result.data.address_list))
|
| dnssec_test.py | 16 print("RRSIGs from answer:", sorted(rrsigs))
19 print("RRSIGs from authority:", sorted(rrsigs))
22 print("NSECs:", sorted(nsecs))
25 print("NSEC3s:", sorted(nsec3s))
|
| ns-lookup.py | 46 for k in sorted(result.data.domain_list):
|
| reverse-lookup.py | 43 print("Result.data:", result.data, sorted(result.data.domain_list))
|
| idn-lookup.py | 49 for k in sorted(result.data.address_list):
56 for k in sorted(result.data.mx_list_idn):
62 for k in sorted(result.data.domain_list_idn):
|
| dnssec-valid.py | 52 print("Result:", sorted(result.data.address_list))
|
| /src/tests/usr.bin/xlint/lint1/ |
| d_typefun.c | 13 int sorted; member in struct:stack_st
|
| /src/crypto/external/apache2/openssl/dist/test/ |
| 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/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/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/usr.bin/make/unit-tests/ |
| varmod-order-string.mk | 3 # Tests for the :O variable modifier, which returns the words, sorted in
6 # Simple words are sorted lexicographically.
20 # Numbers are sorted lexicographically as well.
|
| varmod-order-reverse.mk | 3 # Tests for the :Or variable modifier, which returns the words, sorted in
|
| /src/external/apache2/llvm/dist/llvm/utils/ |
| sort_includes.py | 72 local_headers = sorted(set(local_headers))
73 subproject_headers = sorted(set(subproject_headers))
74 llvm_headers = sorted(set(llvm_headers))
75 system_headers = sorted(set(system_headers))
|
| /src/external/mpl/bind/dist/bin/tests/system/pipelined/ |
| tests.sh | 37 sort <output.$n >output-sorted.$n
38 diff ref output-sorted.$n || {
40 echo_i "diff sorted failed"
56 sort <output.mdig.$n >output-sorted.mdig.$n
57 diff ref output-sorted.mdig.$n || {
59 echo_i "diff sorted failed"
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.multi/ |
| multi-target-info-inferiors.py | 37 all_connections = sorted(gdb.connections(), key=conn_num)
64 all_inferiors = sorted(gdb.inferiors(), key=inf_num)
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.multi/ |
| multi-target-info-inferiors.py | 37 all_connections = sorted(gdb.connections(), key=conn_num)
64 all_inferiors = sorted(gdb.inferiors(), key=inf_num)
|
| /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/crypto/external/bsd/heimdal/dist/lib/wind/ |
| gen-combining.py | 82 s = sorted(trans)
|
