sort
nat_foreach(nat_cb_t *f, void *arg, int sort)
if (sort != 0)
static int nat_foreach(nat_cb_t *f, void *arg, int sort);
nat64clat_foreach(nat64clat_cb_t *f, const char *name, uint8_t set, int sort)
if (sort != 0)
int sort);
int sort);
nat64lsn_foreach(nat64lsn_cb_t *f, const char *name, uint8_t set, int sort)
if (sort != 0)
nat64stl_foreach(nat64stl_cb_t *f, const char *name, uint8_t set, int sort)
int sort);
if (sort != 0)
nptv6_foreach(nptv6_cb_t *f, const char *name, uint8_t set, int sort)
if (sort != 0)
int sort);
tables_foreach(table_cb_t *f, void *arg, int sort)
if (sort != 0)
static int tables_foreach(table_cb_t *f, void *arg, int sort);
int16_t sort[AR512_NF_CAL_HIST_MAX];
OS_MEMCPY(sort, calData, AR512_NF_CAL_HIST_MAX*sizeof(int16_t));
if (sort[j] > sort[j-1]) {
int16_t nf = sort[j];
sort[j] = sort[j-1];
sort[j-1] = nf;
return sort[(AR512_NF_CAL_HIST_MAX-1)>>1];
int sort[MLX4_NUM_QP_REGION];
sort[i] = i;
if (dev->caps.reserved_qps_cnt[sort[j]] >
dev->caps.reserved_qps_cnt[sort[j - 1]])
swap(sort[j], sort[j - 1]);
last_base -= dev->caps.reserved_qps_cnt[sort[i]];
dev->caps.reserved_qps_base[sort[i]] = last_base;
dev->caps.reserved_qps_cnt[sort[i]];
sort(deltas.begin(), deltas.end());
int sort = 0;
sort = 1;
if (sort) {
sort(array, elts, s);
sort_bench(int elts, enum sort s)
sort(array, elts, s);
partial_bench(int elts, enum sort s)
sort(array, elts, s);
reverse_bench(int elts, enum sort s)
sort(array, elts, s);
run_bench(enum sort s, enum test t, int runs, int elts)
static enum sort
enum sort s = parse_alg(argv[1]);
sort(int *testarray, int elts, enum sort s)
rand_bench(int elts, enum sort s)
static void sort(struct line *, int);
sort(sfile[0], slen[0]);
sort(sfile[1], slen[1]);
bool sort = false;
sort = true;
if (sort)
tree.sort();
std::sort(property_begin(), property_end(), cmp_properties);
std::sort(child_begin(), child_end(), cmp_children);
c->sort();
root->sort();
void sort();
sort(ap);
sort(ap);
void sort(char **);
sort++;
if (sort)
static int sort; /* Sort by cost */
std::sort(kv.second.begin(), kv.second.end(), [](auto &a, auto &b) {return (a.first < b.first);});