impl/conservative/gc.d

1632                 assert(range.ptop);
1633                 assert(range.pbot <= range.ptop);
1704     void addRange(void *pbot, void *ptop, const TypeInfo ti) nothrow @nogc
1707         debug(PRINTF) printf("%p.Gcx::addRange(%p, %p)\n", &this, pbot, ptop);
1710         ranges.insert(Range(pbot, ptop));
2159         void* ptop;
2267             printf("marking range: [%p..%p] (%#llx)\n", pbot, ptop, cast(long)(ptop - pbot));
2348                         tgt.ptop = tgt.pbot + binsize[bin];
2374                         tgt.ptop = tgt.pbot + (cast(LargeObjectPool*)pool).getSize(pn);
2390                         tgt.ptop = tgt.pbot + (cast(LargeObjectPool*)pool).getSize(pn);
2414                                     assert (arrtop > tgt.pbot && arrtop <= tgt.ptop);
2416                                     tgt.ptop = arrtop;
2420                                     tgt.ptop = tgt.pbot + element_size;
2436             if (rng.pbot < rng.ptop)
2466             if (rng.pbot < rng.ptop)
2494     void markConservative(bool shared_mem)(void *pbot, void *ptop) scope nothrow
2496         if (pbot < ptop)
2497             mark!(false, false, shared_mem)(ScanRange!false(pbot, ptop));
2500     void markPrecise(bool shared_mem)(void *pbot, void *ptop) scope nothrow
2502         if (pbot < ptop)
2503             mark!(true, false, shared_mem)(ScanRange!true(pbot, ptop, null));
2510     void collectRoots(void *pbot, void *ptop) scope nothrow
2515         for (auto p = cast(void**)pbot; cast(void*)p < ptop; p++)
2559             debug(COLLECT_PRINTF) printf("\t\t%p .. %p\n", range.pbot, range.ptop);
2560             markFn(range.pbot, range.ptop);
2586             debug(COLLECT_PRINTF) printf("\t\t%p .. %p\n", range.pbot, range.ptop);
2587             collectRoots(range.pbot, range.ptop);
2739                             //  below ptop even if unaligned
2740                             void *ptop = p + PAGESIZE - size + 1;
2741                             for (size_t i; p < ptop; p += size, i += bitstride)
3290         void** ptop = toscanRoots._p + toscanRoots._length;
3314         assert(pbot < ptop);
3320         debug(PARALLEL_PRINTF) printf("mark %lld roots\n", cast(ulong)(ptop - pbot));
3323             mark!(true, true, true)(ScanRange!true(pbot, ptop, null));
3325             mark!(false, true, true)(ScanRange!false(pbot, ptop));
3486                                               rng.pbot, cast(long) (rng.ptop - rng.pbot));
4359             const ptop = p + PAGESIZE - size + 1;
4366             for (size_t i; p < ptop; p += size, i += bitstride)
4419         // ensure 2 <size> bytes blocks are available below ptop, one
4421         void* ptop = p + PAGESIZE - 2 * size + 1;
4422         for (; p < ptop; p += size)