Home
last modified time | relevance | path

Searched refs:old_list (Results 1 – 2 of 2) sorted by relevance

/external/libunwind/src/
DLos-common.c48 move_cached_elf_data (struct map_info *old_list, struct map_info *new_list) in move_cached_elf_data() argument
50 while (old_list) in move_cached_elf_data()
52 if (!old_list->ei.valid) in move_cached_elf_data()
54 old_list = old_list->next; in move_cached_elf_data()
61 while (new_list && old_list->start <= new_list->start) in move_cached_elf_data()
63 if (old_list->start == new_list->start in move_cached_elf_data()
64 && old_list->end == new_list->end) in move_cached_elf_data()
68 new_list->ei = old_list->ei; in move_cached_elf_data()
70 old_list->ei.mapped = false; in move_cached_elf_data()
72 old_list->ei.mini_debug_info_data = NULL; in move_cached_elf_data()
[all …]
/external/v8/src/zone/
Dzone-handle-set.h62 List const* const old_list = list(); in insert() local
63 for (size_t i = 0; i < old_list->size(); ++i) { in insert()
64 if (old_list->at(i) == value) return; in insert()
65 if (old_list->at(i) > value) break; in insert()
68 new_list->reserve(old_list->size() + 1); in insert()
70 for (; i < old_list->size(); ++i) { in insert()
71 if (old_list->at(i) > value) break; in insert()
72 new_list->push_back(old_list->at(i)); in insert()
75 for (; i < old_list->size(); ++i) { in insert()
76 new_list->push_back(old_list->at(i)); in insert()
[all …]