4  * Use of this source code is governed by a BSD-style license that can be
13     C() : fID(-1) { ++gInstCnt; }  in C()
21     ~C() { --gInstCnt; }  in ~C()
44         return (size_t) list.fAllocator->scratchBlockSize();  in ScratchBlockSize()
49         return list.fAllocator->totalSize();  in TotalSize()
58     REPORTER_ASSERT(reporter, (0 == cnt) == allocator->empty());  in check_allocator_helper()
59     REPORTER_ASSERT(reporter, cnt == allocator->count());  in check_allocator_helper()
63     for (const C& c : allocator->items()) {  in check_allocator_helper()
65         REPORTER_ASSERT(reporter, allocator->item(i).fID == i);  in check_allocator_helper()
71         REPORTER_ASSERT(reporter, cnt-1 == allocator->back().fID);  in check_allocator_helper()
76             allocator->pop_back();  in check_allocator_helper()
78         check_allocator_helper(allocator, cnt - popCnt, 0, reporter);  in check_allocator_helper()
87     REPORTER_ASSERT(reporter, (size_t) allocator->count() == expected.size());  in check_iterator_helper()
90     for (const C& c : cAlloc->items()) {  in check_iterator_helper()
96     // Forward+non-const  in check_iterator_helper()
98     for (C& c : allocator->items()) {  in check_iterator_helper()
105     i = (int) expected.size() - 1;  in check_iterator_helper()
106     for (const C& c : cAlloc->ritems()) {  in check_iterator_helper()
108         --i;  in check_iterator_helper()
110     REPORTER_ASSERT(reporter, i == -1);  in check_iterator_helper()
112     // Reverse+non-const  in check_iterator_helper()
113     i = (int) expected.size() - 1;  in check_iterator_helper()
114     for (C& c : allocator->ritems()) {  in check_iterator_helper()
116         --i;  in check_iterator_helper()
118     REPORTER_ASSERT(reporter, i == -1);  in check_iterator_helper()
121     for (i = 0; i < allocator->count(); ++i) {  in check_iterator_helper()
122         REPORTER_ASSERT(reporter, (uintptr_t) &allocator->item(i) == (uintptr_t) expected[i]);  in check_iterator_helper()
123         REPORTER_ASSERT(reporter, (uintptr_t) &cAlloc->item(i) == (uintptr_t) expected[i]);  in check_iterator_helper()
142     SkASSERT(allocator->empty());  in check_allocator()
147                 allocator->push_back(C(i));  in check_allocator()
150                 allocator->push_back(std::move(C(i)));  in check_allocator()
153                 allocator->push_back() = C(i);  in check_allocator()
156                 allocator->push_back() = std::move(C(i));  in check_allocator()
159                 allocator->emplace_back(i);  in check_allocator()
162         items.push_back(&allocator->back());  in check_allocator()
166     allocator->reset();  in check_allocator()
201     // SkTBlockList guarantees the moved list is empty, but clang-tidy doesn't know about it;  in run_concat_test()
204     REPORTER_ASSERT(reporter, listB.count() == 0); // NOLINT(bugprone-use-after-move)  in run_concat_test()
236     REPORTER_ASSERT(reporter, listB.count() == 0); // NOLINT(bugprone-use-after-move): see above  in run_concat_trivial_test()
276     // (kItemsPerBlock-N) that are still available in the active block  in run_reserve_test()
280     // items-per-block, it will always use that size and not that of the growth policy.  in run_reserve_test()
290     // If we reserve a count < items-per-block, it will use the fixed size from the growth policy.  in run_reserve_test()