Searched refs:next_stack_entry (Results 1 – 1 of 1) sorted by relevance
772 int next_stack_entry = 0; in S_qsortsvu() local1173 partition_stack[next_stack_entry].left = pc_right + 1; in S_qsortsvu()1174 partition_stack[next_stack_entry].right = part_right; in S_qsortsvu()1176 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even; in S_qsortsvu()1181 partition_stack[next_stack_entry].left = part_left; in S_qsortsvu()1182 partition_stack[next_stack_entry].right = pc_left - 1; in S_qsortsvu()1184 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even; in S_qsortsvu()1188 qsort_assert(next_stack_entry < QSORT_MAX_STACK); in S_qsortsvu()1189 ++next_stack_entry; in S_qsortsvu()1206 if (next_stack_entry == 0) { in S_qsortsvu()[all …]