Searched refs:sorted (Results 26 - 43 of 43) sorted by relevance

12

/freebsd-current/lib/libc/iconv/
H A Dcitrus_esdb.c257 _citrus_esdb_get_list(char ***rlist, size_t *rnum, bool sorted) argument
292 /* XXX: sorted? */
310 if (!sorted)
/freebsd-current/crypto/openssl/test/
H A Dstack_test.c61 int sorted; member in struct:__anon170
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);
/freebsd-current/sys/contrib/openzfs/cmd/
H A Darc_summary461 """Print all available data from the system in a minimally sorted format.
465 sections = sorted(kstats_dict.keys())
470 lines = sorted(kstats_dict[section])
913 keylist = sorted(spls.keys())
939 keylist = sorted(tunables.keys())
1034 calls = sorted(section_calls.keys())
H A Ddbufstat.in134 for key in sorted(incompat):
162 for key in sorted(cols.keys()):
/freebsd-current/sys/contrib/openzfs/tests/test-runner/bin/
H A Dtest-runner.py.in378 lines = sorted(self.result.stdout + self.result.stderr,
660 for key in sorted(self.tests.keys()):
663 for key in sorted(self.testgroups.keys()):
697 self.testgroups[dirname].tests = sorted(filenames)
732 files = ' '.join(sorted(failed))
804 for test in sorted(self.tests.keys()):
811 for testgroup in sorted(self.testgroups.keys()):
901 for test in sorted(self.tests.keys()):
903 for testgroup in sorted(self.testgroups.keys()):
1003 for p in sorted(option
[all...]
/freebsd-current/contrib/ntp/ntpq/
H A Dntpq-subs.c3015 * All IPv4 addresses sort before any IPv6, addresses are sorted by
3195 mru **sorted; local
3273 sorted = eallocarray(mru_count, sizeof(*sorted));
3274 ppentry = sorted;
3277 INSIST(ppentry < sorted + mru_count);
3283 INSIST(ppentry < sorted + mru_count);
3289 if (ppentry - sorted != (int)mru_count) {
3292 mru_count, (long)(ppentry - sorted));
3293 free(sorted);
[all...]
/freebsd-current/sys/geom/journal/
H A Dg_journal.c801 * It keeps the queue sorted by offset and ensures that there are no doubled
1044 /* Be sure that bios queue is sorted. */
1483 g_journal_read_find(struct bio *head, int sorted, struct bio *pbp, off_t ostart, argument
1497 if (!sorted)
1539 u_int i, sorted = 0; local
1550 sorted = 1;
1556 sorted = 1;
1563 sorted = 1;
1567 sorted = 0;
1572 bp = g_journal_read_find(head, sorted, pb
[all...]
/freebsd-current/sys/contrib/openzfs/lib/libuutil/
H A Duu_list.c315 int sorted = lp->ul_sorted; local
334 if (sorted && cmp > 0) {
/freebsd-current/sys/contrib/libsodium/packaging/dotnet-core/
H A Dprepare.py194 for download in sorted(downloads):
/freebsd-current/tests/atf_python/sys/net/
H A Drtsock.py397 for attr in sorted(self._attrs.keys()):
497 for attr in sorted(self._attrs.keys()):
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_write_set_format_iso9660.c234 /* A sorted list of sub directories. */
729 struct isoent **sorted; member in struct:iso9660::vdd::path_table
2131 free(iso9660->primary.pathtbl[i].sorted);
2137 free(iso9660->joliet.pathtbl[i].sorted);
4214 ptbl = pt[depth].sorted;
4250 ptbl = vdd->pathtbl[depth].sorted;
6917 pt->sorted = NULL;
6926 pt->sorted = enttbl;
6929 enttbl = pt->sorted;
6974 vdd->pathtbl[i].sorted
[all...]
/freebsd-current/usr.sbin/freebsd-update/
H A Dfreebsd-update.sh1669 # sorted by device and inode number.
3341 sort -k 1,1 -t '|' $1.noflags > $1.sorted
3346 join -t '|' $1.sorted - > INDEX-NOTMATCHING
3426 rm $1 $1.noflags $1.sorted $2 INDEX-NOTMATCHING
/freebsd-current/tools/tools/shlib-compat/
H A Dshlib-compat.py175 return sorted(set(self.stack))
1054 names = sorted(ver.names());
/freebsd-current/share/mk/
H A Dsrc.libnames.mk691 # Makefile.depend. These are sorted by directory.
/freebsd-current/crypto/openssl/util/perl/OpenSSL/
H A DOrdinals.pm43 write out the data you want, sorted and filtered according to your rules.
/freebsd-current/contrib/bsnmp/tests/
H A Dcatch.hpp13957 std::vector<TestCase> sorted = unsortedTestCases;
13961 std::sort( sorted.begin(), sorted.end() );
13965 std::shuffle( sorted.begin(), sorted.end(), rng() );
13971 return sorted;
/freebsd-current/sys/contrib/openzfs/contrib/pyzfs/libzfs_core/test/
H A Dtest_libzfs_core.py3189 self.assertEqual(sorted(missing), sorted([snap1, snap2]))
/freebsd-current/contrib/sqlite3/
H A Dsqlite3.c2416 ** to be sorted exceeds the page size times the minimum of the
2439 ** sorted records. However, if SQLite determines based on the declared type
2442 ** is stored in each sorted record and the required column values loaded
2443 ** from the database as records are returned in sorted order. The default
10246 ** virtual table outputs all rows in sorted order, then it is always safe for
10251 ** that the query planner does not need the rows to be returned in sorted order
11581 ** are sorted in the same order in which they were attached (or auto-attached)
16216 ** to be filled with content that is already in sorted order.
16224 #define BTREE_BULKLOAD 0x00000001 /* Used to full index in sorted order */
17135 PgHdr *pDirty; /* Transient list of dirty sorted b
157265 unsigned sorted :1; /* True if really sorted (not just grouped) */ member in struct:WhereInfo
[all...]

Completed in 1119 milliseconds

12