Lines Matching defs:nfreepools
1030 uint nfreepools;
1046 * increasing order of `nfreepools` values.
1220 allocated arenas first (ascending order based on the nfreepools member).
1667 nfreepools <- number of whole pools that fit after alignment */
1669 arenaobj->nfreepools = MAX_POOLS_IN_ARENA;
1672 --arenaobj->nfreepools;
1675 arenaobj->ntotalpools = arenaobj->nfreepools;
1829 assert(nfp2lasta[usable_arenas->nfreepools] == NULL);
1830 nfp2lasta[usable_arenas->nfreepools] = usable_arenas;
1834 /* This arena already had the smallest nfreepools value, so decreasing
1835 * nfreepools doesn't change that, and we don't need to rearrange the
1839 assert(usable_arenas->nfreepools > 0);
1840 if (nfp2lasta[usable_arenas->nfreepools] == usable_arenas) {
1842 nfp2lasta[usable_arenas->nfreepools] = NULL;
1845 if (usable_arenas->nfreepools > 1) {
1846 assert(nfp2lasta[usable_arenas->nfreepools - 1] == NULL);
1847 nfp2lasta[usable_arenas->nfreepools - 1] = usable_arenas;
1855 usable_arenas->nfreepools--;
1856 if (UNLIKELY(usable_arenas->nfreepools == 0)) {
1869 /* nfreepools > 0: it must be that freepools
1882 assert(usable_arenas->nfreepools > 0);
1891 --usable_arenas->nfreepools;
1893 if (usable_arenas->nfreepools == 0) {
2061 uint nf = ao->nfreepools;
2070 lastnf->nfreepools == nf &&
2072 nf < lastnf->nextarena->nfreepools)));
2075 nfp2lasta[nf] = (p != NULL && p->nfreepools == nf) ? p : NULL;
2077 ao->nfreepools = ++nf;
2093 * nfreepools.
2146 * ao->nfreepools was 0 before, ao isn't
2207 assert(ao->nextarena == NULL || nf <= ao->nextarena->nfreepools);
2208 assert(ao->prevarena == NULL || nf > ao->prevarena->nfreepools);
3009 numfreepools += arenas[i].nfreepools;