Home
last modified time | relevance | path

Searched defs:sort (Results 1 – 25 of 49) sorted by relevance

12

/illumos-gate/usr/src/cmd/sort/
H A Dtypes.h248 typedef struct sort { struct
261 sort_statistics_t *m_stats; argument
265 flag_t m_check_if_sorted_only; argument
279 } sort_t; argument
/illumos-gate/usr/src/cmd/sgs/rtld/common/
H A Dtsort.c90 sort_scc(Sort *sort, int fndx, int flag) in sort_scc()
246 visit(Lm_list *lml, Rt_map *lmp, Sort *sort, int flag) in visit()
309 Sort *sort, int flag) in _dep_visit()
390 dep_visit(Lm_list *lml, Rt_map *clmp, uint_t cbflags, Rt_map *lmp, Sort *sort, in dep_visit()
468 trace_find_scc(Sort *sort, Rt_map *lmp) in trace_find_scc()
489 trace_sort(Sort *sort) in trace_sort()
546 r_initfirst(Sort * sort, int end) in r_initfirst()
590 f_initfirst(Sort *sort, int end) in f_initfirst()
631 initorfini(Lm_list *lml, Rt_map *lmp, int flag, Sort *sort) in initorfini()
669 Sort sort = { 0 }; in tsort() local
/freebsd/tools/tools/sortbench/
H A Dsort_bench.c62 enum sort { MERGE, WIKI, QUICK, HEAP, INVALID_ALG }; enum
64 enum sort { MERGE, QUICK, HEAP, INVALID_ALG }; enum
71 sort(int *testarray, int elts, enum sort s) in sort() function
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dsort.h36 #define sort(base, num, size, cmp, swap) do { \ macro
/freebsd/contrib/libcbor/examples/
H A DCMakeLists.txt13 add_executable(sort sort.c) target
/illumos-gate/usr/src/cmd/refer/
H A Drefer0.c22 int sort = 0; variable
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dsimple_ilist.h261 void sort() { sort(std::less<T>()); } sort() function
290 void simple_ilist<T, Options...>::sort(Compare comp) { sort() function
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVRange.cpp127 void LVRange::sort() { in sort() function in LVRange
/freebsd/usr.bin/dtc/
H A Ddtc.cc112 bool sort = false; in main() local
/illumos-gate/usr/src/cmd/ldap/ns_ldap/
H A Dldaplist.c197 const char *sort = NULL; in list() local
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DStatistic.cpp141 void StatisticInfo::sort() { in sort() function in StatisticInfo
/illumos-gate/usr/src/uts/common/fs/zfs/lua/
H A Dltablib.c248 static int sort (lua_State *L) { in sort() function
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dzap_leaf.c152 zap_leaf_init(zap_leaf_t *l, boolean_t sort) in zap_leaf_init()
777 zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort) in zap_leaf_split()
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dzap_leaf.c162 zap_leaf_init(zap_leaf_t *l, boolean_t sort) in zap_leaf_init()
768 zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort) in zap_leaf_split()
/freebsd/usr.sbin/lpr/pac/
H A Dpac.c60 static int sort; /* Sort by cost */ variable
/freebsd/sbin/ipfw/
H A Dnptv6.c417 nptv6_foreach(nptv6_cb_t *f, const char *name, uint8_t set, int sort) in nptv6_foreach()
H A Dnat64clat.c499 nat64clat_foreach(nat64clat_cb_t *f, const char *name, uint8_t set, int sort) in nat64clat_foreach()
H A Dnat64stl.c515 nat64stl_foreach(nat64stl_cb_t *f, const char *name, uint8_t set, int sort) in nat64stl_foreach()
H A Dnat64lsn.c863 nat64lsn_foreach(nat64lsn_cb_t *f, const char *name, uint8_t set, int sort) in nat64lsn_foreach()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dpstl.h559 sort(_ExecutionPolicy&& __policy, _RandomAccessIterator __first, _RandomAccessIterator __last, _Com… in sort() function
571 sort(_ExecutionPolicy&& __policy, _RandomAccessIterator __first, _RandomAccessIterator __last) { in sort() function
/freebsd/contrib/lua/src/
H A Dltablib.c399 static int sort (lua_State *L) { in sort() function
/illumos-gate/usr/src/contrib/ast/src/lib/libcmd/
H A Dcksum.c134 int (*sort)(FTSENT* const*, FTSENT* const*); member
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/rdist/
H A Dexpand.c52 #define sort() qsort((char *)sortbase, &eargv[eargc] - sortbase, \ macro
/freebsd/usr.bin/mail/
H A Dcmd3.c498 sort(char **list) in sort() function
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/ftp/
H A Dglob.c183 sort(void) in sort() function

12