Lines Matching refs:m2
150 char *m1, *m2, *m3; /* median pointers */ in qsort_r() local
285 m2 = b_lim + (nrec / 2) * rsiz; in qsort_r()
289 m2 = med3(b_lim, b_lim + i, b_lim + 2 * i, cmp, arg); in qsort_r()
294 m2 = med3(b_lim + 3 * i, b_lim + 4 * i, b_lim + 5 * i, in qsort_r()
298 m2 = med3(m1, m2, m3, cmp, arg); in qsort_r()
347 if (b_par == m2) { in qsort_r()
350 cv = cmp(b_par, m2, arg); in qsort_r()
355 if (b_dup == m2) { in qsort_r()
356 m2 = b_par; in qsort_r()
366 if (t_par == m2) { in qsort_r()
369 cv = cmp(t_par, m2, arg); in qsort_r()
374 if (t_dup == m2) { in qsort_r()
375 m2 = t_par; in qsort_r()
410 if (m2 < t_par) { in qsort_r()
411 (*swapf)(m2, t_par, loops); in qsort_r()
412 m2 = b_par = t_par; in qsort_r()
413 } else if (m2 > b_par) { in qsort_r()
414 (*swapf)(m2, b_par, loops); in qsort_r()
415 m2 = t_par = b_par; in qsort_r()
417 b_par = t_par = m2; in qsort_r()
420 if (m2 < t_par) { in qsort_r()
423 if (m2 != b_par) { in qsort_r()
424 (*swapf)(m2, b_par, loops); in qsort_r()
426 m2 = t_par; in qsort_r()
442 b_par = m2 - d_bytelength; in qsort_r()
456 t_par = m2 + d_bytelength; in qsort_r()