Lines Matching defs:Array

215   void pushBlocks(CacheT *C, uptr ClassId, CompactPtrT *Array, u32 Size) {
222 pushBatchClassBlocks(Sci, Array, Size);
233 if (compactPtrGroupBase(Array[I - 1]) != compactPtrGroupBase(Array[I]))
235 CompactPtrT Cur = Array[I];
238 compactPtrGroupBase(Cur) < compactPtrGroupBase(Array[J - 1])) {
239 Array[J] = Array[J - 1];
242 Array[J] = Cur;
246 pushBlocksImpl(C, ClassId, Sci, Array, Size, SameGroup);
477 void pushBatchClassBlocks(SizeClassInfo *Sci, CompactPtrT *Array, u32 Size)
522 decompactPtr(SizeClassMap::BatchClassId, Array[Size - 1]));
547 decompactPtr(SizeClassMap::BatchClassId, Array[Size - 1]));
551 TB->add(Array[Size - 1]);
569 decompactPtr(SizeClassMap::BatchClassId, Array[I]));
572 CurBatch->add(Array[I]);
581 CurBatch->appendFromArray(&Array[I], AppendSize);
599 // blocks, BGs are sorted and the input `Array` are supposed to be sorted so
606 CompactPtrT *Array, u32 Size, bool SameGroup = false)
628 auto InsertBlocks = [&](BatchGroupT *BG, CompactPtrT *Array, u32 Size) {
646 CurBatch->appendFromArray(&Array[I], AppendSize);
661 compactPtrGroupBase(Array[0]) > Cur->CompactPtrGroupBase) {
667 compactPtrGroupBase(Array[0]) != Cur->CompactPtrGroupBase) {
668 Cur = CreateGroup(compactPtrGroupBase(Array[0]));
679 DCHECK_EQ(compactPtrGroupBase(Array[I]), Cur->CompactPtrGroupBase);
681 InsertBlocks(Cur, Array, Size);
689 if (compactPtrGroupBase(Array[I - 1]) != compactPtrGroupBase(Array[I])) {
690 DCHECK_EQ(compactPtrGroupBase(Array[I - 1]), Cur->CompactPtrGroupBase);
691 InsertBlocks(Cur, Array + I - Count, Count);
694 compactPtrGroupBase(Array[I]) > Cur->CompactPtrGroupBase) {
700 compactPtrGroupBase(Array[I]) != Cur->CompactPtrGroupBase) {
701 Cur = CreateGroup(compactPtrGroupBase(Array[I]));
712 InsertBlocks(Cur, Array + Size - Count, Count);