Lines Matching refs:poolp
1013 typedef struct pool_header *poolp;
1060 /* Round pointer P down to the closest pool-aligned address <= P, as a poolp */
1061 #define POOL_ADDR(P) ((poolp)_Py_ALIGN_DOWN((P), POOL_SIZE))
1134 Major obscurity: While the usedpools vector is declared to have poolp
1136 poolp entry, the nextpool and prevpool members of a pool_header. The
1141 "acts like" a genuine poolp, but only so long as you only reference its
1151 contains is a fudged-up pointer p such that *if* C believes it's a poolp
1164 #define PTA(x) ((poolp )((uint8_t *)&(usedpools[2*(x)]) - 2*sizeof(block *)))
1167 static poolp usedpools[2 * ((NB_SMALL_SIZE_CLASSES + 7) / 8) * 8] = {
1292 poolp p = (poolp)base;
1684 pymalloc. When the radix tree is used, 'poolp' is unused.
1687 address_in_range(void *p, poolp pool)
1770 address_in_range(void *p, poolp pool)
1790 pymalloc_pool_extend(poolp pool, uint size)
1801 poolp next;
1851 poolp pool = usable_arenas->freepools;
1884 pool = (poolp)usable_arenas->pool_address;
1908 poolp next = usedpools[size + size]; /* == prev */
1967 poolp pool = usedpools[size + size];
2032 insert_to_usedpool(poolp pool)
2037 poolp next = usedpools[size + size];
2038 poolp prev = next->prevpool;
2048 insert_to_freepool(poolp pool)
2050 poolp next = pool->nextpool;
2051 poolp prev = pool->prevpool;
2228 poolp pool = POOL_ADDR(p);
2304 poolp pool;
2935 pool_is_in_list(const poolp target, poolp list)
2937 poolp origlist = list;
3021 poolp p = (poolp)base;