satsolver
0.17.2
|
#include <sys/cdefs.h>
#include <stdlib.h>
Go to the source code of this file.
Macros | |
#define | min(a, b) (a) < (b) ? a : b |
#define | swapcode(TYPE, parmi, parmj, n) |
#define | SWAPINIT(a, es) |
#define | swap(a, b) |
#define | vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype) |
#define | CMP(t, x, y) (cmp((x), (y), (t))) |
Typedefs | |
typedef int | cmp_t (const void *, const void *, void *) |
Functions | |
static char * | med3 (char *, char *, char *, cmp_t *, void *) |
static void | swapfunc (char *, char *, int, int) |
void | sat_sort (void *a, size_t n, size_t es, cmp_t *cmp, void *thunk) |
#define min | ( | a, | |
b | |||
) | (a) < (b) ? a : b |
Definition at line 48 of file qsort_r.c.
Referenced by sat_sort().
#define swapcode | ( | TYPE, | |
parmi, | |||
parmj, | |||
n | |||
) |
Definition at line 53 of file qsort_r.c.
Referenced by swapfunc().
#define SWAPINIT | ( | a, | |
es | |||
) |
Definition at line 64 of file qsort_r.c.
Referenced by sat_sort().
#define swap | ( | a, | |
b | |||
) |
Definition at line 78 of file qsort_r.c.
Referenced by sat_sort().
#define vecswap | ( | a, | |
b, | |||
n | |||
) | if ((n) > 0) swapfunc(a, b, n, swaptype) |
Definition at line 86 of file qsort_r.c.
Referenced by sat_sort().
#define CMP | ( | t, | |
x, | |||
y | |||
) | (cmp((x), (y), (t))) |
Definition at line 88 of file qsort_r.c.
Referenced by med3(), and sat_sort().
|
inlinestatic |
|
inlinestatic |
void sat_sort | ( | void * | a, |
size_t | n, | ||
size_t | es, | ||
cmp_t * | cmp, | ||
void * | thunk | ||
) |
Definition at line 99 of file qsort_r.c.
References CMP, med3(), min, swap, SWAPINIT, and vecswap.
Referenced by create_solutions(), create_transaction_info(), pool_shrink_whatprovides(), prune_to_best_version(), prune_to_highest_prio_per_name(), solver_allruleinfos(), solver_unifyrules(), transaction_all_obs_pkgs(), transaction_classify(), and transaction_classify_pkgs().