Searched refs:mid_index (Results 1 – 2 of 2) sorted by relevance
163 size_t mid_index = ((max - min)/2) + min; in lc_binary_search_insert_point() local165 if ((lc->list[mid_index]->sort_time > lp->sort_time) || in lc_binary_search_insert_point()166 ((lc->list[mid_index]->sort_time == lp->sort_time) && in lc_binary_search_insert_point()167 (lc->list[mid_index]->sort_tiebreaker > lp->sort_tiebreaker))) { in lc_binary_search_insert_point()168 if (mid_index == min) { in lc_binary_search_insert_point()174 min, mid_index - 1)); in lc_binary_search_insert_point()175 } else if ((lc->list[mid_index]->sort_time < lp->sort_time) || in lc_binary_search_insert_point()176 ((lc->list[mid_index]->sort_time == lp->sort_time) && in lc_binary_search_insert_point()177 (lc->list[mid_index]->sort_tiebreaker < lp->sort_tiebreaker))) { in lc_binary_search_insert_point()178 if (mid_index == max) { in lc_binary_search_insert_point()[all …]
106 int mid_index = 1+low_index; /* formal [1..4]! - index for high long word in mfp_mul() local109 int high_index = 1+mid_index; /* formal [2..5]! - index for high word overflow in mfp_mul()133 if (((c[mid_index] >> 1) + (result_high >> 1) + ((c[mid_index] & result_high & 1) != 0)) & in mfp_mul()138 c[mid_index] += result_high; /* will add a 0 to c[4] once but saves 15 if conditions */ in mfp_mul()