| /freebsd/crypto/openssl/test/ |
| H A D | stack_test.c | 60 int unsorted; in test_int_stack() member
109 /* find unsorted -- the pointers are compared */ in test_int_stack()
111 int *val = (finds[i].unsorted == -1) ? ¬present in test_int_stack()
112 : v + finds[i].unsorted; in test_int_stack()
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) { in test_int_stack()
115 TEST_info("int unsorted find %d", i); in test_int_stack()
120 /* find_ex unsorted */ in test_int_stack()
122 int *val = (finds[i].unsorted == -1) ? ¬present in test_int_stack()
123 : v + finds[i].unsorted; in test_int_stack()
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) { in test_int_stack()
[all …]
|
| /freebsd/contrib/ncurses/man/ |
| H A D | MKterminfo.sh | 74 unsorted=unsorted$$
75 trap 'code=$?; rm -f $sorted $temp $unsorted; exit $code' EXIT HUP INT QUIT TERM
76 rm -f $sorted $temp $unsorted
92 " |sed -e 's/^$/../' | tr "\134" "\006" >$unsorted
116 done <$unsorted
|
| /freebsd/contrib/libfido2/udev/ |
| H A D | check.sh | 13 echo unsorted vendor section 1>&2
29 echo "${v}": unsorted product section 1>&2
|
| /freebsd/sys/contrib/device-tree/Bindings/mtd/partitions/ |
| H A D | linux,ubi.yaml | 7 title: Unsorted Block Images
10 UBI ("Unsorted Block Images") is a volume management system for raw
|
| /freebsd/usr.bin/bmake/tests/variables/t0/ |
| H A D | Makefile.test | 2 # A unsorted set of macro expansions. This should be sorted out.
|
| /freebsd/contrib/mandoc/ |
| H A D | manpath.h | 20 * Unsorted list of unique, absolute paths to be searched for manual
|
| /freebsd/contrib/netbsd-tests/usr.sbin/mtree/ |
| H A D | t_mtree.sh | 154 atf_set "descr" "Convert a specfile to mtree -C format, unsorted"
218 atf_set "descr" "Convert a specfile to mtree -D format, unsorted"
|
| /freebsd/sys/contrib/openzfs/module/zstd/lib/compress/ |
| H A D | zstd_lazy.c | 60 * sort one already inserted but unsorted position
84 … /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *larg… in ZSTD_insertDUBT1()
262 /* reach end of unsorted candidates list */ in ZSTD_DUBT_findBestMatch()
266 DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted", in ZSTD_DUBT_findBestMatch()
276 /* nullify last candidate if it's still unsorted in ZSTD_DUBT_findBestMatch()
280 DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u", in ZSTD_DUBT_findBestMatch()
|
| /freebsd/contrib/libdivsufsort/lib/ |
| H A D | trsort.c | 559 saidx_t t, skip, unsorted; in trsort() local
566 unsorted = 0; in trsort()
575 if(budget.count != 0) { unsorted += budget.count; } in trsort()
584 if(unsorted == 0) { break; } in trsort()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CTagsEmitter.cpp | 87 OS << "!_TAG_FILE_SORTED\t1\t/0=unsorted, 1=sorted, 2=foldcase/\n"; in run()
|
| /freebsd/sys/dev/usb/wlan/ |
| H A D | if_uathvar.h | 227 /* unsorted */
|
| /freebsd/lib/libc/posix1e/ |
| H A D | acl_set.c | 48 * (the POSIX.1e semantic code will reject unsorted ACL submission). If it's
|
| /freebsd/sys/dev/sound/usb/ |
| H A D | uaudio_pcm.c | 57 * shouldn't select an unsorted format in ua_chan_setformat()
|
| /freebsd/sys/contrib/zstd/lib/compress/ |
| H A D | zstd_lazy.c | 60 * sort one already inserted but unsorted position
84 … /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *larg… in ZSTD_insertDUBT1()
263 /* reach end of unsorted candidates list */ in ZSTD_DUBT_findBestMatch()
267 DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted", in ZSTD_DUBT_findBestMatch()
277 /* nullify last candidate if it's still unsorted in ZSTD_DUBT_findBestMatch()
281 DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u", in ZSTD_DUBT_findBestMatch()
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Core/ |
| H A D | UniqueCStringMap.h | 159 // Sort the unsorted contents in this map. A typical code flow would be:
|
| /freebsd/sys/contrib/openzfs/module/zfs/ |
| H A D | zap_leaf.c | 622 /* old unsorted format; do it the O(n^2) way */ in zap_entry_create()
733 * NB: this will not cause problems for unsorted leafs, though in zap_leaf_rehash_entry()
|
| /freebsd/sys/cam/ |
| H A D | cam_queue.c | 348 * an unsorted entry, output Heap(index, num_entries).
|
| /freebsd/usr.bin/netstat/ |
| H A D | nhgrp.c | 220 * nexhops groups are received unsorted. Collect everything first, in dump_nhgrp_sysctl()
|
| /freebsd/contrib/ldns/ |
| H A D | rr.c | 1517 ldns_rr_list_sort(ldns_rr_list *unsorted) in ldns_rr_list_sort() argument
1523 if (unsorted) { in ldns_rr_list_sort()
1524 item_count = ldns_rr_list_rr_count(unsorted); in ldns_rr_list_sort()
1541 sortables[i]->original_object = ldns_rr_list_rr(unsorted, i); in ldns_rr_list_sort()
1549 unsorted->_rrs[i] = sortables[i]->original_object; in ldns_rr_list_sort()
|
| H A D | dnssec.c | 1704 ldns_rr_list_sort_nsec3(ldns_rr_list *unsorted) in ldns_rr_list_sort_nsec3() argument
1706 qsort(unsorted->_rrs, in ldns_rr_list_sort_nsec3()
1707 ldns_rr_list_rr_count(unsorted), in ldns_rr_list_sort_nsec3()
|
| /freebsd/contrib/ldns/ldns/ |
| H A D | rr.h | 774 * \param[in] unsorted the rr_list to be sorted
777 void ldns_rr_list_sort(ldns_rr_list *unsorted);
|
| /freebsd/lib/libdevdctl/ |
| H A D | event.h | 256 /** Unsorted table of event types. */
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/ |
| H A D | LineTable.h | 51 /// Unsorted list of line sequences.
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/Process/scripted/ |
| H A D | ScriptedProcess.cpp | 360 // Might be worth showing the unsorted thread list instead of return early. in DoUpdateThreadList()
|
| /freebsd/sys/geom/bde/ |
| H A D | g_bde_lock.c | |