Lines Matching defs:Cur
296 CompactPtrT Cur = Array[I];
298 while (J > 0 && compactPtrGroup(Cur) < compactPtrGroup(Array[J - 1])) {
302 Array[J] = Cur;
806 BatchGroupT *Cur = Region->FreeListInfo.BlockList.front();
808 // In the following, `Cur` always points to the BatchGroup for blocks that
809 // will be pushed next. `Prev` is the element right before `Cur`.
812 while (Cur != nullptr &&
813 compactPtrGroup(Array[0]) > Cur->CompactPtrGroupBase) {
814 Prev = Cur;
815 Cur = Cur->Next;
818 if (Cur == nullptr ||
819 compactPtrGroup(Array[0]) != Cur->CompactPtrGroupBase) {
820 Cur = CreateGroup(compactPtrGroup(Array[0]));
822 Region->FreeListInfo.BlockList.push_front(Cur);
824 Region->FreeListInfo.BlockList.insert(Prev, Cur);
831 DCHECK_EQ(compactPtrGroup(Array[I]), Cur->CompactPtrGroupBase);
833 InsertBlocks(Cur, Array, Size);
842 DCHECK_EQ(compactPtrGroup(Array[I - 1]), Cur->CompactPtrGroupBase);
843 InsertBlocks(Cur, Array + I - Count, Count);
845 while (Cur != nullptr &&
846 compactPtrGroup(Array[I]) > Cur->CompactPtrGroupBase) {
847 Prev = Cur;
848 Cur = Cur->Next;
851 if (Cur == nullptr ||
852 compactPtrGroup(Array[I]) != Cur->CompactPtrGroupBase) {
853 Cur = CreateGroup(compactPtrGroup(Array[I]));
855 Region->FreeListInfo.BlockList.insert(Prev, Cur);
864 InsertBlocks(Cur, Array + Size - Count, Count);
1451 // Prev Cur BG
1458 // Otherwise, `Prev` will be used to extract the `Cur` from the
1462 // Prev Cur BG
1471 // Prev Cur BG
1482 BatchGroupT *Cur = BG;
1490 Cur->BytesInBGAtLastCheckpoint = BytesInBG;
1493 Region->FreeListInfo.BlockList.extract(Prev, Cur);
1496 GroupsToRelease.push_back(Cur);
1631 BatchGroupT *Cur = GroupsToRelease.front();
1635 if (BG->CompactPtrGroupBase == Cur->CompactPtrGroupBase) {
1636 BG->PushedBlocks += Cur->PushedBlocks;
1639 BG->BytesInBGAtLastCheckpoint = Cur->BytesInBGAtLastCheckpoint;
1645 if (Cur->Batches.front()->getCount() == MaxCachedPerBatch) {
1646 BG->Batches.append_back(&Cur->Batches);
1648 TransferBatchT *NonFullBatch = Cur->Batches.front();
1649 Cur->Batches.pop_front();
1651 // The remaining Batches in `Cur` are full.
1652 BG->Batches.append_back(&Cur->Batches);
1680 compactPtr(SizeClassMap::BatchClassId, reinterpret_cast<uptr>(Cur));
1693 // `GroupsToRelease::front()` (which is `Cur` below) before `BG`.
1695 // 1. If `Prev` is nullptr, we simply push `Cur` to the front of
1702 Region->FreeListInfo.BlockList.push_front(Cur);
1704 Region->FreeListInfo.BlockList.insert(Prev, Cur);
1705 DCHECK_EQ(Cur->Next, BG);
1706 Prev = Cur;
1718 for (BatchGroupT *Cur = Prev->Next; Cur != nullptr;
1719 Prev = Cur, Cur = Cur->Next) {
1720 CHECK_LT(Prev->CompactPtrGroupBase, Cur->CompactPtrGroupBase);