Searched refs:bmin (Results 1 – 2 of 2) sorted by relevance
129 static int count[256], nc, bmin; in r_sort_a() local153 if (c < bmin) in r_sort_a()154 bmin = c; in r_sort_a()169 if (nc == 1 && count[bmin] == n) { in r_sort_a()171 nc = count[bmin] = 0; in r_sort_a()190 for (cp = count + bmin; nc > 0; cp++) { in r_sort_a()228 static int count[256], nc, bmin; in r_sort_b() local245 bmin = 255; in r_sort_b()249 if (c < bmin) in r_sort_b()250 bmin = c; in r_sort_b()[all …]
104 lin bmin = bmid, bmax = bmid; /* Limits of bottom-up search. */ in diag() local135 if (odd && bmin <= d && d <= bmax && bd[d] <= x) in diag()145 bmin > dmin ? bd[--bmin - 1] = LIN_MAX : ++bmin; in diag()147 for (d = bmax; d >= bmin; d -= 2) in diag()221 for (d = bmax; d >= bmin; d -= 2) in diag()282 for (d = bmax; d >= bmin; d -= 2) in diag()