lo 50 source3/lib/ldb/common/qsort.c char *lo; lo 63 source3/lib/ldb/common/qsort.c #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top)) lo 64 source3/lib/ldb/common/qsort.c #define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi))) lo 105 source3/lib/ldb/common/qsort.c char *lo = base_ptr; lo 106 source3/lib/ldb/common/qsort.c char *hi = &lo[size * (total_elems - 1)]; lo 123 source3/lib/ldb/common/qsort.c char *mid = lo + size * ((hi - lo) / size >> 1); lo 125 source3/lib/ldb/common/qsort.c if ((*cmp) ((void *) mid, (void *) lo, opaque) < 0) lo 126 source3/lib/ldb/common/qsort.c SWAP (mid, lo, size); lo 131 source3/lib/ldb/common/qsort.c if ((*cmp) ((void *) mid, (void *) lo, opaque) < 0) lo 132 source3/lib/ldb/common/qsort.c SWAP (mid, lo, size); lo 135 source3/lib/ldb/common/qsort.c left_ptr = lo + size; lo 173 source3/lib/ldb/common/qsort.c if ((size_t) (right_ptr - lo) <= max_thresh) lo 177 source3/lib/ldb/common/qsort.c POP (lo, hi); lo 180 source3/lib/ldb/common/qsort.c lo = left_ptr; lo 185 source3/lib/ldb/common/qsort.c else if ((right_ptr - lo) > (hi - left_ptr)) lo 188 source3/lib/ldb/common/qsort.c PUSH (lo, right_ptr); lo 189 source3/lib/ldb/common/qsort.c lo = left_ptr; lo 243 source3/lib/ldb/common/qsort.c char *hi, *lo; lo 245 source3/lib/ldb/common/qsort.c for (hi = lo = trav; (lo -= size) >= tmp_ptr; hi = lo) lo 246 source3/lib/ldb/common/qsort.c *hi = *lo; lo 49 source4/lib/ldb/common/qsort.c char *lo; lo 62 source4/lib/ldb/common/qsort.c #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top)) lo 63 source4/lib/ldb/common/qsort.c #define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi))) lo 104 source4/lib/ldb/common/qsort.c char *lo = base_ptr; lo 105 source4/lib/ldb/common/qsort.c char *hi = &lo[size * (total_elems - 1)]; lo 122 source4/lib/ldb/common/qsort.c char *mid = lo + size * ((hi - lo) / size >> 1); lo 124 source4/lib/ldb/common/qsort.c if ((*cmp) ((void *) mid, (void *) lo, opaque) < 0) lo 125 source4/lib/ldb/common/qsort.c SWAP (mid, lo, size); lo 130 source4/lib/ldb/common/qsort.c if ((*cmp) ((void *) mid, (void *) lo, opaque) < 0) lo 131 source4/lib/ldb/common/qsort.c SWAP (mid, lo, size); lo 134 source4/lib/ldb/common/qsort.c left_ptr = lo + size; lo 172 source4/lib/ldb/common/qsort.c if ((size_t) (right_ptr - lo) <= max_thresh) lo 176 source4/lib/ldb/common/qsort.c POP (lo, hi); lo 179 source4/lib/ldb/common/qsort.c lo = left_ptr; lo 184 source4/lib/ldb/common/qsort.c else if ((right_ptr - lo) > (hi - left_ptr)) lo 187 source4/lib/ldb/common/qsort.c PUSH (lo, right_ptr); lo 188 source4/lib/ldb/common/qsort.c lo = left_ptr; lo 242 source4/lib/ldb/common/qsort.c char *hi, *lo; lo 244 source4/lib/ldb/common/qsort.c for (hi = lo = trav; (lo -= size) >= tmp_ptr; hi = lo) lo 245 source4/lib/ldb/common/qsort.c *hi = *lo;