Home
last modified time | relevance | path

Searched refs:insert_pos (Results 1 – 7 of 7) sorted by relevance

/art/compiler/optimizing/
Dcode_sinking.cc226 HInstruction* insert_pos = nullptr; in FindIdealPosition() local
229 (insert_pos == nullptr || use.GetUser()->StrictlyDominates(insert_pos))) { in FindIdealPosition()
230 insert_pos = use.GetUser(); in FindIdealPosition()
236 (insert_pos == nullptr || user->StrictlyDominates(insert_pos))) { in FindIdealPosition()
237 insert_pos = user; in FindIdealPosition()
240 if (insert_pos == nullptr) { in FindIdealPosition()
242 insert_pos = target_block->GetLastInstruction(); in FindIdealPosition()
243 DCHECK(insert_pos->IsControlFlow()); in FindIdealPosition()
245 if (insert_pos->IsIf()) { in FindIdealPosition()
246 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in FindIdealPosition()
[all …]
Dlinear_order.cc43 auto insert_pos = worklist->rbegin(); // insert_pos.base() will be the actual position. in AddToListForLinearization() local
44 for (auto end = worklist->rend(); insert_pos != end; ++insert_pos) { in AddToListForLinearization()
45 HBasicBlock* current = *insert_pos; in AddToListForLinearization()
54 worklist->insert(insert_pos.base(), block); in AddToListForLinearization()
Dssa_liveness_analysis.h350 UsePositionList::iterator insert_pos; variable
352 insert_pos = next_pos;
356 uses_.insert_after(insert_pos, *new_use);
1063 UsePositionList::iterator insert_pos = uses_.before_begin(); in AddBackEdgeUses() local
1085 DCHECK(insert_pos != uses_.before_begin() in AddBackEdgeUses()
1086 ? back_edge_use_position > insert_pos->GetPosition() in AddBackEdgeUses()
1088 << std::distance(uses_.before_begin(), insert_pos); in AddBackEdgeUses()
1091 insert_pos = uses_.insert_after(insert_pos, *new_use); in AddBackEdgeUses()
Dnodes.cc2087 HInstruction* insert_pos = nullptr; in MoveBeforeFirstUserAndOutOfLoops() local
2090 (insert_pos == nullptr || use.GetUser()->StrictlyDominates(insert_pos))) { in MoveBeforeFirstUserAndOutOfLoops()
2091 insert_pos = use.GetUser(); in MoveBeforeFirstUserAndOutOfLoops()
2094 if (insert_pos == nullptr) { in MoveBeforeFirstUserAndOutOfLoops()
2096 insert_pos = target_block->GetLastInstruction(); in MoveBeforeFirstUserAndOutOfLoops()
2097 DCHECK(insert_pos->IsControlFlow()); in MoveBeforeFirstUserAndOutOfLoops()
2099 if (insert_pos->IsIf()) { in MoveBeforeFirstUserAndOutOfLoops()
2100 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in MoveBeforeFirstUserAndOutOfLoops()
2101 if (if_input == insert_pos->GetPrevious()) { in MoveBeforeFirstUserAndOutOfLoops()
2102 insert_pos = if_input; in MoveBeforeFirstUserAndOutOfLoops()
[all …]
Dregister_allocator_linear_scan.cc1069 auto insert_pos = array->begin() + insert_at; in AddSorted() local
1071 array->insert(insert_pos, { interval->GetHighInterval(), interval }); in AddSorted()
1073 array->insert(insert_pos, { interval, interval->GetLowInterval() }); in AddSorted()
1075 array->insert(insert_pos, interval); in AddSorted()
/art/libdexfile/dex/
Dtype_lookup_table.cc77 uint32_t insert_pos = tail_pos; in Create() local
79 insert_pos = (insert_pos + 1) & mask; in Create()
80 } while (!entries[insert_pos].IsEmpty()); in Create()
82 entries[insert_pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create()
83 entries[tail_pos].SetNextPosDelta((insert_pos - tail_pos) & mask, mask_bits); in Create()
84 DCHECK(entries[insert_pos].IsLast(mask_bits)); in Create()
/art/libartbase/base/
Dhash_set_test.cc371 HashSet<std::string>::iterator insert_pos = hash_set.insert(test_string).first; in TEST_F() local
373 ASSERT_TRUE(it == insert_pos); in TEST_F()