Searched refs:twotoi (Results 1 – 2 of 2) sorted by relevance
197 int twotoi; /* 2^i */ in computesizes() local201 for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) { in computesizes()204 if (a > twotoi/2) { /* more than half elements present? */ in computesizes()205 n = twotoi; /* optimal size (till now) */ in computesizes()
393 unsigned int twotoi; /* 2^i (candidate for optimal size) */ in computesizes() local398 for (i = 0, twotoi = 1; in computesizes()399 twotoi > 0 && *pna > twotoi / 2; in computesizes()400 i++, twotoi *= 2) { in computesizes()402 if (a > twotoi/2) { /* more than half elements present? */ in computesizes()403 optimal = twotoi; /* optimal size (till now) */ in computesizes()