Home
last modified time | relevance | path

Searched refs:coll_flags (Results 1 – 4 of 4) sorted by relevance

/titanic_50/usr/src/cmd/sort/common/
H A Dinternal.c52 ssize_t depth, flag_t coll_flags) in offset_is_algorithm() argument
62 if (collate_fcn(X[0], X[i], depth, coll_flags) > 0) { in offset_is_algorithm()
64 ASSERT(collate_fcn(X[0], X[i], depth, coll_flags) <= 0); in offset_is_algorithm()
74 while (collate_fcn(t, X[j - 1], depth, coll_flags) < 0) { in offset_is_algorithm()
91 flag_t coll_flags) in tqs_algorithm() argument
100 coll_flags |= COLL_DATA_ONLY; in tqs_algorithm()
111 offset_is_algorithm(X, n, collate_fcn, 0, coll_flags); in tqs_algorithm()
126 (p = collate_fcn(X[l], X[0], 0, coll_flags)) <= 0) { in tqs_algorithm()
133 (p = collate_fcn(X[r], X[0], 0, coll_flags)) >= 0) { in tqs_algorithm()
160 tqs_algorithm(&X[n - q], q, collate_fcn, coll_flags); in tqs_algorithm()
[all …]
H A Dmerge.c129 stream_t *outstrp, vchar_t field_separator, flag_t coll_flags) in merge_two_streams() argument
175 coll_flags) < 0) { in merge_two_streams()
224 heap_up(stream_t **A, int k, flag_t coll_flags) in heap_up() argument
228 coll_flags) > 0) { in heap_up()
235 heap_down(stream_t **A, int k, int N, flag_t coll_flags) in heap_down() argument
242 &A[j + 1]->s_current, 0, coll_flags) > 0) in heap_down()
245 coll_flags) <= 0) in heap_down()
268 pqueue_insert(stream_t *source, flag_t coll_flags) in pqueue_insert() argument
271 heap_up(pq_queue, pq_N, coll_flags); in pqueue_insert()
275 pqueue_head(flag_t coll_flags) in pqueue_head() argument
[all …]
H A Dconvert.c44 flag_t coll_flags; in convert() local
50 coll_flags = COLL_REVERSE; in convert()
52 coll_flags = 0; in convert()
55 coll_flags |= COLL_UNIQUE; in convert()
H A Dcheck.c113 flag_t coll_flags; in check_if_sorted() local
159 coll_flags = COLL_REVERSE; in check_if_sorted()
161 coll_flags = 0; in check_if_sorted()
163 coll_flags |= COLL_UNIQUE; in check_if_sorted()
192 coll_flags); in check_if_sorted()