Lines Matching refs:nfreepools
926 uint nfreepools;
942 * increasing order of `nfreepools` values.
1125 allocated arenas first (ascending order based on the nfreepools member).
1257 nfreepools <- number of whole pools that fit after alignment */
1259 arenaobj->nfreepools = ARENA_SIZE / POOL_SIZE;
1260 assert(POOL_SIZE * arenaobj->nfreepools == ARENA_SIZE);
1263 --arenaobj->nfreepools;
1266 arenaobj->ntotalpools = arenaobj->nfreepools;
1466 /* This arena already had the smallest nfreepools
1467 * value, so decreasing nfreepools doesn't change
1473 --usable_arenas->nfreepools;
1474 if (usable_arenas->nfreepools == 0) {
1488 /* nfreepools > 0: it must be that freepools
1533 assert(usable_arenas->nfreepools > 0);
1542 --usable_arenas->nfreepools;
1544 if (usable_arenas->nfreepools == 0) {
1667 uint nf; /* ao->nfreepools */
1692 nf = ++ao->nfreepools;
1703 * nfreepools.
1751 * ao->nfreepools was 0 before, ao isn't
1772 nf <= ao->nextarena->nfreepools) {
1796 while (ao->nextarena != NULL && nf > ao->nextarena->nfreepools) {
1811 assert(ao->nextarena == NULL || nf <= ao->nextarena->nfreepools);
1812 assert(ao->prevarena == NULL || nf > ao->prevarena->nfreepools);
2562 numfreepools += arenas[i].nfreepools;
