Lines Matching defs:it
121 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) {
122 FreePageRun* fpr = *it;
128 free_page_runs_.erase(it++);
155 ++it;
163 auto it = free_page_runs_.rbegin();
164 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) {
175 // If we grow the heap, we can allocate it.
217 it = free_page_runs_.rbegin();
218 DCHECK(it != free_page_runs_.rend());
219 FreePageRun* fpr = *it;
276 // Clear the first page since it is not madvised due to the magic number.
342 // Turn it into a free run.
361 for (auto it = higher_it; it != free_page_runs_.end(); ) {
362 FreePageRun* h = *it;
378 free_page_runs_.erase(it++);
399 for (auto it = lower_it; ; ) {
402 bool to_exit_loop = it == free_page_runs_.begin();
404 FreePageRun* l = *it;
416 free_page_runs_.erase(it--);
443 // Insert it.
562 // Zeroing the data is sometimes faster than prefetching but it increases memory usage
583 // If there's one, use it as the current run.
584 auto it = bt->begin();
585 Run* non_full_run = *it;
588 bt->erase(it);
591 // If there's none, allocate a new run and use it as the current run.
600 // The current run got full. Try to refill it.
614 // Failed to allocate a new run, make sure that it is the dedicated full run.
652 // Caller verifies that it is all 0.
696 // Some slot got freed. Keep it.
700 // Check that the bitmap idx is back at 0 if it's all free.
740 // The slot is already counted. Leave it as is.
768 // Caller verifies that it is all 0.
787 // It's a thread-local run. Just mark the thread-local free bit map and return.
796 // A thread local run will be kept as a thread local even if it's become all free.
803 // It has just become completely free. Free the pages of this run.
823 // It is not completely free. If it wasn't the current run or
824 // already in the non-full run set (i.e., it was full) insert it
1057 // Check the last vector after the loop since it uses a special case for the masked bits.
1268 // it's become all free.
1281 // It has just become completely free. Free the pages of the
1287 // If it was a current run, reuse it.
1289 // If it was full, remove it from the full run set (debug
1303 // If it was in a non full run set, remove it from the set.
1320 // It is not completely free. If it wasn't the current run or
1321 // already in the non-full run set (i.e., it was full) insert
1322 // it into the non-full run set.
1326 // If it was a current run, keep it.
1328 // If it was full, remove it from the full run set (debug
1347 // If it was not full, so leave it in the non full run set.
1502 auto it = free_page_runs_.rbegin();
1503 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) {
1570 // contains a magic number for debugging. Exclude it.
1860 // Fill the alloc bitmap so nobody can successfully allocate from it.
1864 // It doesn't matter which size bracket we use since the main goal is to have the allocation
1976 // Don't verify the dedicated_full_run_ since it doesn't have any real allocations.
2030 // Check that the bulk free bitmap is clean. It's only used during BulkFree().
2039 // If it's a thread local run, then it must be pointed to by an owner thread.
2042 for (auto it = thread_list.begin(); it != thread_list.end(); ++it) {
2043 Thread* thread = *it;
2058 // If it's not thread local, check that the thread local free bitmap is clean.
2062 // Check if it's a current run for the size bucket.
2072 // If the size bucket index does not match, then it must not
2078 // If it's neither a thread local or current run, then it must be
2083 // If it's all free, it must be a free page run rather than a run.
2086 // If it's not full, it must in the non-full run set.
2090 // If it's full, it must in the full run set (debug build only.)
2140 // Reading the page map without a lock is racy but the race is benign since it should only
2150 // Check that it's still empty after we acquired the lock since another thread could have
2194 // contains a magic number for debugging. Exclude it.
