Cross Reference: /art/runtime/gc/allocator/rosalloc.cc

Lines Matching defs:end
75              << std::hex << (intptr_t)base_ << ", end="
129   for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) {
173       // There is a free page run at the end.
178       // There is no free page run at the end.
196         // There was a free page run at the end. Expand its size.
202         // Otherwise, insert a new free page run at the end.
326   size_t end = page_map_size_;
327   while (idx < end && page_map_[idx] == pm_part_type) {
358   DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
368     if (higher_it != free_page_runs_.end()) {
369       for (auto it = higher_it; it != free_page_runs_.end(); ) {
453   DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end());
458   DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
569         // since we end up dirtying zero pages which may have been madvised.
616       DCHECK(non_full_runs_[idx].find(current_run) == non_full_runs_[idx].end());
617       DCHECK(full_runs_[idx].find(current_run) != full_runs_[idx].end());
626     DCHECK(non_full_runs_[idx].find(current_run) == non_full_runs_[idx].end());
627     DCHECK(full_runs_[idx].find(current_run) == full_runs_[idx].end());
674       CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end());
675       CHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end());
707           DCHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end());
708           DCHECK(full_runs_[idx].find(thread_local_run) != full_runs_[idx].end());
716         DCHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end());
717         DCHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end());
780     DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end());
781     DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end());
796     if (pos != non_full_runs->end()) {
806     DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end());
807     DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end());
820       if (pos == non_full_runs->end()) {
822         DCHECK(full_runs->find(run) != full_runs->end());
971 void RosAlloc::Run::InspectAllSlots(void (*handler)(void* start, void* end, size_t used_bytes, void* callback_arg),
1114       DCHECK(non_full_runs_[idx].find(run) == non_full_runs_[idx].end());
1115       DCHECK(full_runs_[idx].find(run) == full_runs_[idx].end());
1140           DCHECK(full_runs->find(run) == full_runs->end());
1141           DCHECK(non_full_runs->find(run) == non_full_runs->end());
1148             DCHECK(pos != full_runs->end());
1155             DCHECK(full_runs->find(run) == full_runs->end());
1159           DCHECK(full_runs->find(run) == full_runs->end());
1160           DCHECK(non_full_runs->find(run) != non_full_runs->end());
1167           DCHECK(non_full_runs->find(run) == non_full_runs->end());
1179           DCHECK(non_full_runs->find(run) == non_full_runs->end());
1180           DCHECK(full_runs->find(run) == full_runs->end());
1185           DCHECK(full_runs->find(run) != full_runs->end());
1186           DCHECK(non_full_runs->find(run) == non_full_runs->end());
1203           DCHECK(full_runs->find(run) == full_runs->end());
1204           DCHECK(non_full_runs->find(run) != non_full_runs->end());
1216   size_t end = page_map_size_;
1221   for (size_t i = 0; i < end; ++i) {
1228         if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
1242             // Reset at the end of the current free page run.
1258             // Reset at the end of the current free page run.
1318       size_t end = page_map_size_;
1319       while (idx < end && page_map_[idx] == kPageMapLargeObjectPart) {
1402 void RosAlloc::InspectAll(void (*handler)(void* start, void* end, size_t used_bytes, void* callback_arg),
1419         DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end());
1428         void* end = reinterpret_cast<uint8_t*>(fpr) + fpr_size;
1429         handler(start, end, 0, arg);
1449         void* end = base_ + (i + num_pages) * kPageSize;
1451         handler(start, end, used_bytes, arg);
1540       DCHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end());
1541       DCHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end());
1554       DCHECK(full_runs_[idx].find(run) != full_runs_[idx].end());
1567     DCHECK(non_full_runs_[idx].find(run) != non_full_runs_[idx].end());
1728 void RosAlloc::BytesAllocatedCallback(void* start ATTRIBUTE_UNUSED, void* end ATTRIBUTE_UNUSED,
1737 void RosAlloc::ObjectsAllocatedCallback(void* start ATTRIBUTE_UNUSED, void* end ATTRIBUTE_UNUSED,
1769           CHECK(free_page_runs_.find(fpr) != free_page_runs_.end())
1884       << "Mismatch in the end address of the run " << Dump();
1892     for (auto it = thread_list.begin(); it != thread_list.end(); ++it) {
1937         CHECK(non_full_runs.find(this) != non_full_runs.end())
1943           CHECK(full_runs.find(this) != full_runs.end())
2015           if (free_page_runs_.find(fpr) != free_page_runs_.end()) {
2043 size_t RosAlloc::ReleasePageRange(uint8_t* start, uint8_t* end) {
2045   DCHECK_ALIGNED(end, kPageSize);
2046   DCHECK_LT(start, end);
2053     if (start == end) {
2059     memset(start, 0, end - start);
2061   CHECK_EQ(madvise(start, end - start, MADV_DONTNEED), 0);
2065   const size_t max_idx = pm_idx + (end - start) / kPageSize;