Lines Matching refs:insert
82 regions_.insert(insert_pos, merged_region);
86 // No element below, and not adjavent to {above}: insert and done.
88 regions_.insert(above, new_region);
103 regions_.insert(above, merged_region);
107 // Not adjacent to any existing region: insert between {below} and {above}.
109 regions_.insert(above, new_region);
136 regions_.insert(insert_pos, {old.begin() + size, old.size() - size});
139 regions_.insert(insert_pos, {old.begin(), old.size() - size});
142 // (insert the region with smaller address first).
143 regions_.insert(insert_pos, {old.begin(), ret.begin() - old.begin()});
144 regions_.insert(insert_pos, {ret.end(), old.end() - ret.end()});
891 // is {true}) and insert it into {writable_memory_}.
921 writable_memory_.insert(insert_pos, region);
1759 if (cached_code_->insert(std::make_pair(key, code)).second) {
1987 lookup_map_.insert(std::make_pair(
2247 lookup_map_.insert(std::make_pair(start, std::make_pair(end, ret.get())));