Lines Matching refs:X

48 offset_is_algorithm(line_rec_t **X, ssize_t n,  in offset_is_algorithm()  argument
60 if (collate_fcn(X[0], X[i], depth, coll_flags) > 0) { in offset_is_algorithm()
61 swap((void **)&X[0], (void **)&X[i]); in offset_is_algorithm()
62 ASSERT(collate_fcn(X[0], X[i], depth, coll_flags) <= 0); in offset_is_algorithm()
71 line_rec_t *t = X[i]; in offset_is_algorithm()
72 while (collate_fcn(t, X[j - 1], depth, coll_flags) < 0) { in offset_is_algorithm()
73 X[j] = X[j - 1]; in offset_is_algorithm()
77 X[j] = t; in offset_is_algorithm()
87 tqs_algorithm(line_rec_t **X, ssize_t n, in tqs_algorithm() argument
109 offset_is_algorithm(X, n, collate_fcn, 0, coll_flags); in tqs_algorithm()
117 swap((void **)&X[0], (void **)&X[le]); in tqs_algorithm()
124 (p = collate_fcn(X[l], X[0], 0, coll_flags)) <= 0) { in tqs_algorithm()
126 swap((void **)&X[le++], (void **)&X[l]); in tqs_algorithm()
131 (p = collate_fcn(X[r], X[0], 0, coll_flags)) >= 0) { in tqs_algorithm()
133 swap((void **)&X[r], (void **)&X[re--]); in tqs_algorithm()
140 swap((void **)&X[l++], (void **)&X[r--]); in tqs_algorithm()
147 swap_range(0, l - p, p, X); in tqs_algorithm()
149 swap_range(l, n - p, p, X); in tqs_algorithm()
158 tqs_algorithm(&X[n - q], q, collate_fcn, coll_flags); in tqs_algorithm()
162 tqs_algorithm(X, p, collate_fcn, coll_flags); in tqs_algorithm()
164 X = &X[n - q]; in tqs_algorithm()
183 rqs_algorithm(line_rec_t **X, ssize_t n, ssize_t depth, in rqs_algorithm() argument
206 offset_is_algorithm(X, n, collate_fcn, depth, coll_flags); in rqs_algorithm()
214 swap((void **)&X[0], (void **)&X[le]); in rqs_algorithm()
215 v = X[0]->l_collate.usp[depth]; in rqs_algorithm()
222 (p = *(X[l]->l_collate.usp + depth) - v) <= 0) { in rqs_algorithm()
224 t = X[le]; in rqs_algorithm()
225 X[le] = X[l]; in rqs_algorithm()
226 X[l] = t; in rqs_algorithm()
233 (p = *(X[r]->l_collate.usp + depth) - v) >= 0) { in rqs_algorithm()
235 t = X[r]; in rqs_algorithm()
236 X[r] = X[re]; in rqs_algorithm()
237 X[re] = t; in rqs_algorithm()
246 t = X[l]; in rqs_algorithm()
247 X[l] = X[r]; in rqs_algorithm()
248 X[r] = t; in rqs_algorithm()
257 swap_range(0, l - p, p, X); in rqs_algorithm()
259 swap_range(l, n - p, p, X); in rqs_algorithm()
266 rqs_algorithm(&X[n - p], p, depth, collate_fcn, coll_flags); in rqs_algorithm()
270 rqs_algorithm(X, p, depth, collate_fcn, coll_flags); in rqs_algorithm()
278 if (X[p]->l_collate_length - 1 > depth) { in rqs_algorithm()
283 X = &X[p]; in rqs_algorithm()
291 tqs_algorithm(&X[p], le + n - re - 1, collate_fcn, coll_flags); in rqs_algorithm()