Lines Matching refs:it
129 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) {
130 FreePageRun* fpr = *it;
136 free_page_runs_.erase(it++);
163 ++it;
171 auto it = free_page_runs_.rbegin();
172 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) {
183 // If we grow the heap, we can allocate it.
225 it = free_page_runs_.rbegin();
226 DCHECK(it != free_page_runs_.rend());
227 FreePageRun* fpr = *it;
284 // Clear the first page since it is not madvised due to the magic number.
350 // Turn it into a free run.
369 for (auto it = higher_it; it != free_page_runs_.end(); ) {
370 FreePageRun* h = *it;
386 free_page_runs_.erase(it++);
407 for (auto it = lower_it; ; ) {
410 bool to_exit_loop = it == free_page_runs_.begin();
412 FreePageRun* l = *it;
424 free_page_runs_.erase(it--);
451 // Insert it.
568 // Zeroing the data is sometimes faster than prefetching but it increases memory usage
590 // If there's one, use it as the current run.
591 auto it = bt->begin();
592 Run* non_full_run = *it;
595 bt->erase(it);
598 // If there's none, allocate a new run and use it as the current run.
607 // The current run got full. Try to refill it.
621 // Failed to allocate a new run, make sure that it is the dedicated full run.
654 // Caller verifies that it is all 0.
691 // Some slot got freed. Keep it.
731 // The slot is already counted. Leave it as is.
759 // Caller verifies that it is all 0.
787 // A thread local run will be kept as a thread local even if it's become all free.
814 // It is not completely free. If it wasn't the current run or
815 // already in the non-full run set (i.e., it was full) insert it
1123 // it's become all free.
1142 // If it was a current run, reuse it.
1144 // If it was full, remove it from the full run set (debug
1158 // If it was in a non full run set, remove it from the set.
1175 // It is not completely free. If it wasn't the current run or
1176 // already in the non-full run set (i.e., it was full) insert
1177 // it into the non-full run set.
1181 // If it was a current run, keep it.
1183 // If it was full, remove it from the full run set (debug
1202 // If it was not full, so leave it in the non full run set.
1357 auto it = free_page_runs_.rbegin();
1358 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) {
1425 // contains a magic number for debugging. Exclude it.
1711 // Set up the dedicated full run so that nobody can successfully allocate from it.
1833 // Don't verify the dedicated_full_run_ since it doesn't have any real allocations.
1889 // If it's a thread local run, then it must be pointed to by an owner thread.
1892 for (auto it = thread_list.begin(); it != thread_list.end(); ++it) {
1893 Thread* thread = *it;
1908 // If it's not thread local, check that the thread local free list is empty.
1912 // Check if it's a current run for the size bracket.
1922 // If the size bucket index does not match, then it must not
1928 // If it's neither a thread local or current run, then it must be
1933 // If it's all free, it must be a free page run rather than a run.
1936 // If it's not full, it must in the non-full run set.
1940 // If it's full, it must in the full run set (debug build only.)
1995 // Reading the page map without a lock is racy but the race is benign since it should only
2005 // Check that it's still empty after we acquired the lock since another thread could have
2049 // contains a magic number for debugging. Exclude it.