Lines Matching refs:power
1186 int power; /* node "level" for powersort merge strategy */
1958 * Compute the "power" of the first run. See listsort.txt for details.
1998 * compute the topmost run's "power" (depth in a conceptual binary merge tree)
1999 * and merge adjacent runs on the stack with greater power. See listsort.txt
2016 int power = powerloop(s1, n1, n2, ms->listlen);
2017 while (ms->n > 1 && p[ms->n - 2].power > power) {
2021 assert(ms->n < 2 || p[ms->n - 2].power < power);
2022 p[ms->n - 1].power = power;
2052 * Else if n is an exact power of 2, return 32.
2054 * strictly less than, an exact power of 2.