Lines Matching full:alloc_xpt
507 // The root of the tree is 'alloc_xpt', which represents all allocation
515 // Any child of 'alloc_xpt' is called a "top-XPt". The XPts at the bottom
523 // alloc_xpt XTrees are bi-directional.
596 static XPt* alloc_xpt;
939 XPt* xpt = alloc_xpt;
1025 while (xpt != alloc_xpt) {
1030 if (space_delta < 0) tl_assert(alloc_xpt->szB >= -space_delta);
1031 alloc_xpt->szB += space_delta;
1355 snapshot->alloc_sxpt = dup_XTree(alloc_xpt, total_szB);
1356 tl_assert( alloc_xpt->szB == heap_szB);
1494 sanity_check_XTree(alloc_xpt, /*parent*/NULL);
2353 tl_assert(n_xpts > 0); // always have alloc_xpt
2364 alloc_xpt->n_children,
2365 ( n_xpts ? alloc_xpt->n_children * 100 / n_xpts : 0));
2520 alloc_xpt = new_XPt(/*ip*/0, /*parent*/NULL);
