Lines Matching refs:SORT_CMP
97 #ifndef SORT_CMP
98 #define SORT_CMP(x, y) ((x) < (y) ? -1 : ((x) == (y) ? 0 : 1)) macro
142 if (SORT_CMP(x, lx) < 0) in BINARY_INSERTION_FIND()
144 else if (SORT_CMP(x, lx) == 0) in BINARY_INSERTION_FIND()
147 while (SORT_CMP(x, dst[i]) == 0) i++; in BINARY_INSERTION_FIND()
154 const int val = SORT_CMP(x, cx); in BINARY_INSERTION_FIND()
171 } while (SORT_CMP(x, cx) == 0); in BINARY_INSERTION_FIND()
189 if (SORT_CMP(dst[i - 1], dst[i]) <= 0) continue; in BINARY_INSERTION_SORT_START()
227 if (SORT_CMP(dst[size - 2], dst[size - 1]) > 0) in COUNT_RUN()
234 if (SORT_CMP(dst[start], dst[start + 1]) <= 0) in COUNT_RUN()
240 if (SORT_CMP(dst[curr - 1], dst[curr]) > 0) break; in COUNT_RUN()
251 if (SORT_CMP(dst[curr - 1], dst[curr]) <= 0) break; in COUNT_RUN()
356 if (SORT_CMP(storage[i], dst[j]) <= 0) in TIM_SORT_MERGE()
380 if (SORT_CMP(dst[j], storage[i]) > 0) in TIM_SORT_MERGE()
497 #undef SORT_CMP