HomeSort by: relevance | last modified time | path
    Searched defs:sort (Results 1 - 25 of 45) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
opt-gather.awk 24 function sort(ARRAY, ELEMENTS) function
48 # Sort it and output it
50 sort(record,numrec)
  /src/external/gpl3/gcc.old/dist/gcc/
opt-gather.awk 24 function sort(ARRAY, ELEMENTS) function
48 # Sort it and output it
50 sort(record,numrec)
  /src/sys/external/bsd/drm2/include/linux/
sort.h 1 /* $NetBSD: sort.h,v 1.3 2021/12/19 11:20:41 riastradh Exp $ */
40 sort(void *array, size_t nelem, size_t elemsize, function
  /src/sys/kern/
makesyscalls.sh 1126 function sort(arr, n, i, j, t) { function
1127 # this is going to be bubble sort because I cannot be bothered to
1128 # write a real sort, this whole script is hopefully going to be
1172 sort(funcseenvars, numfuncseenvars)
  /src/external/gpl3/gcc/dist/libstdc++-v3/scripts/
make_graph.py 37 def sort(self, cntnr_list, res_sets): member in class:res_getter.__sorter
44 cntnrs_and_totals.sort(by_total)
101 cntnr_list = self.__sorter().sort(cntnr_list, res_sets)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/scripts/
make_graph.py 37 def sort(self, cntnr_list, res_sets): member in class:res_getter.__sorter
44 cntnrs_and_totals.sort(by_total)
101 cntnr_list = self.__sorter().sort(cntnr_list, res_sets)
  /src/games/mille/
move.c 153 sort(pp->hand);
568 sort(CARD *hand) function
  /src/external/apache2/llvm/dist/llvm/lib/Support/
Statistic.cpp 66 /// Sort statistics by debugtype,name,description.
67 void sort();
135 void StatisticInfo::sort() { function in class:StatisticInfo
182 Stats.sort();
204 Stats.sort();
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
simple_ilist.h 261 /// Sort the list.
263 void sort() { sort(std::less<T>()); } function in class:llvm::simple_ilist
264 template <class Compare> void sort(Compare comp);
292 void simple_ilist<T, Options...>::sort(Compare comp) { function in class:llvm::simple_ilist
306 // Sort the sublists and merge back together.
307 sort(comp);
308 RHS.sort(comp);
  /src/external/bsd/openldap/dist/servers/slapd/
mods.c 288 unsigned sort; local
289 rc = attr_valfind( a, flags, &cvals[i], &sort, NULL );
291 idx[i] = sort;
  /src/external/gpl2/dtc/dist/
dtc.c 67 {"sort", no_argument, NULL, 's'},
169 bool force = false, sort = false; local
241 sort = true;
340 if (sort)
  /src/usr.bin/rdist/
expand.c 68 #define sort() qsort((char *)sortbase, &eargv[eargc] - sortbase, \ macro
203 sort();
242 sort();
250 sort();
406 sort();
  /src/usr.sbin/lpr/pac/
pac.c 71 static int reverse; /* Reverse sort order */
72 static int sort; /* Sort by cost */ variable
135 * Sort by cost.
137 sort++;
245 * Sort the hashed entries by name or footage
392 * or by feet of typesetter film, according to sort.
402 if (sort)
  /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/JITLink/
JITLink.cpp 208 llvm::sort(**Cache, [](const Symbol *LHS, const Symbol *RHS) { member in class:llvm::__anon4372::llvm
236 // For each block, sort its symbols by something approximating
239 llvm::sort(KV.second, [](const Symbol *LHS, const Symbol *RHS) {
259 llvm::sort(SortedBlocks, [](const Block *LHS, const Block *RHS) {
282 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) {
  /src/external/gpl3/gcc/dist/libgcc/
unwind-dw2-fde.h 48 struct fde_vector *sort; member in union:object::__anon14352
  /src/external/gpl3/gcc.old/dist/libgcc/
unwind-dw2-fde.h 48 struct fde_vector *sort; member in union:object::__anon16755
  /src/external/mit/lua/dist/src/
ltablib.c 233 ** macro is used only when 'sort' detects a big imbalance in the result
277 ** index 'b' (according to the order of the sort).
354 /* sort elements 'lo', 'p', and 'up' */
403 static int sort (lua_State *L) { function
425 {"sort", sort},
  /src/external/gpl3/binutils/dist/gprofng/src/
vec.h 156 // Sort the vector according to compare
158 sort (CompareFunc compare, void *arg = NULL) function in class:Vector
403 // For small arrays use insertion sort
427 // Sort the first, middle, and last elements
  /src/external/gpl3/binutils.old/dist/gprofng/src/
vec.h 156 // Sort the vector according to compare
158 sort (CompareFunc compare, void *arg = NULL) function in class:Vector
403 // For small arrays use insertion sort
427 // Sort the first, middle, and last elements
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
algo.h 45 #include <parallel/sort.h>
1574 // sort interface
1579 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1581 { _GLIBCXX_STD_A::sort(__begin, __end); }
1586 sort(_RAIter __begin, _RAIter __end, _Compare __comp, function in namespace:__parallel
1588 { _GLIBCXX_STD_A::sort<_RAIter, _Compare>(__begin, __end,
1595 sort(_RAIter __begin, _RAIter __end, _Compare __comp, function in namespace:__parallel
1608 sort(__begin, __end, __comp, __gnu_parallel::sequential_tag());
1615 sort(_RAIter __begin, _RAIter __end) function in namespace:__parallel
1618 sort(__begin, __end, std::less<_ValueType>()
1625 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1635 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1645 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1655 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1665 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1675 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1685 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1695 sort(_RAIter __begin, _RAIter __end, _Compare __comp) function in namespace:__parallel
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
algo.h 45 #include <parallel/sort.h>
1627 // sort interface
1632 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1634 { _GLIBCXX_STD_A::sort(__begin, __end); }
1639 sort(_RAIter __begin, _RAIter __end, _Compare __comp, function in namespace:__parallel
1641 { _GLIBCXX_STD_A::sort<_RAIter, _Compare>(__begin, __end,
1648 sort(_RAIter __begin, _RAIter __end, _Compare __comp, function in namespace:__parallel
1661 sort(__begin, __end, __comp, __gnu_parallel::sequential_tag());
1668 sort(_RAIter __begin, _RAIter __end) function in namespace:__parallel
1671 sort(__begin, __end, std::less<_ValueType>()
1678 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1688 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1698 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1708 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1718 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1728 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1738 sort(_RAIter __begin, _RAIter __end, function in namespace:__parallel
1748 sort(_RAIter __begin, _RAIter __end, _Compare __comp) function in namespace:__parallel
    [all...]
  /src/external/mpl/bind/dist/lib/dns/
rdataset.c 254 bool shuffle = false, sort = false;
304 * Do we want to sort and/or shuffle this answer?
308 sort = true;
315 if (shuffle || sort) {
320 shuffle = sort = false;
325 if (shuffle || sort) {
360 out[i].key = (sort) ? (*order)(&in[j], order_arg) : 0;
369 if (sort) {
422 if (shuffle || sort) {
440 if (shuffle || sort) {
252 bool shuffle = false, sort = false; local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rdataset.c 320 bool shuffle = false, sort = false; local
372 * Do we want to sort and/or shuffle this answer?
376 sort = true;
383 if ((shuffle || sort)) {
388 shuffle = sort = false;
393 if ((shuffle || sort)) {
428 out[i].key = (sort) ? (*order)(&in[j], order_arg) : 0;
437 if (sort) {
490 if (shuffle || sort) {
508 if (shuffle || sort) {
    [all...]
  /src/usr.bin/mail/
cmd3.c 68 * Sort the passed string vector into ascending dictionary
72 sort(const char **list) function
701 sort(ap);
790 sort(ap);
827 sort(ap);
  /src/usr.bin/diff/
diffreg.c 187 static void sort(struct line *, int);
389 sort(sfile[0], slen[0]);
390 sort(sfile[1], slen[1]);
809 sort(struct line *a, int n) function

Completed in 34 milliseconds

1 2