Home
last modified time | relevance | path

Searched defs:block (Results 1 – 25 of 58) sorted by relevance

123

/art/compiler/optimizing/
Dcommon_dominator.h37 explicit CommonDominator(HBasicBlock* block) in CommonDominator()
42 void Update(HBasicBlock* block) { in Update()
82 static size_t ChainLength(HBasicBlock* block) { in ChainLength()
Dcha_guard_optimization.cc75 void CHAGuardVisitor::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
89 HBasicBlock* block = flag->GetBlock(); in RemoveGuard() local
181 HBasicBlock* block = flag->GetBlock(); in HoistGuard() local
Dssa_liveness_analysis_test.cc52 HBasicBlock* CreateSuccessor(HBasicBlock* block) { in CreateSuccessor()
75 HBasicBlock* block = CreateSuccessor(entry_); in TEST_F() local
107 HBasicBlock* block = CreateSuccessor(entry_); in TEST_F() local
177 HBasicBlock* block = CreateSuccessor(entry_); in TEST_F() local
Dconstant_folding.cc81 void HConstantFoldingVisitor::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
291 HBasicBlock* block = instruction->GetBlock(); in VisitRem() local
335 HBasicBlock* block = instruction->GetBlock(); in VisitSub() local
364 HBasicBlock* block = instruction->GetBlock(); in VisitXor() local
Dgraph_test.cc39 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createGotoBlock() local
47 HBasicBlock* block = createGotoBlock(graph, allocator); in createEntryBlock() local
53 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createReturnBlock() local
61 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createExitBlock() local
291 HBasicBlock* block = createGotoBlock(graph, &allocator); in TEST() local
Dnodes.cc49 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock()
113 HBasicBlock* block = blocks_[i]; in RemoveInstructionsAsUsersFromDeadBlocks() local
126 HBasicBlock* block = blocks_[i]; in RemoveDeadBlocks() local
210 static bool UpdateDominatorOfSuccessor(HBasicBlock* block, HBasicBlock* successor) { in UpdateDominatorOfSuccessor()
307 HBasicBlock* HGraph::SplitEdge(HBasicBlock* block, HBasicBlock* successor) { in SplitEdge()
316 void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) { in SplitCriticalEdge()
407 HBasicBlock* block = blocks_[block_id]; in SimplifyCFG() local
564 void HLoopInformation::Add(HBasicBlock* block) { in Add()
568 void HLoopInformation::Remove(HBasicBlock* block) { in Remove()
572 void HLoopInformation::PopulateRecursive(HBasicBlock* block) { in PopulateRecursive()
[all …]
Dselect_generator.cc26 static bool IsSimpleBlock(HBasicBlock* block) { in IsSimpleBlock()
56 static HPhi* GetSingleChangedPhi(HBasicBlock* block, size_t index1, size_t index2) { in GetSingleChangedPhi()
Dloop_optimization.cc43 static bool IsGotoBlock(HBasicBlock* block, /*out*/ HBasicBlock** succ) { in IsGotoBlock()
182 static HInstruction* Insert(HBasicBlock* block, HInstruction* instruction) { in Insert()
393 HBasicBlock* block = it.Current(); in SimplifyBlocks() local
504 bool HLoopOptimization::CanVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count) { in CanVectorize()
574 HBasicBlock* block, in Vectorize()
653 HBasicBlock* block, in GenerateNewLoop()
1304 bool HLoopOptimization::TrySetSimpleLoopHeader(HBasicBlock* block) { in TrySetSimpleLoopHeader()
1329 bool HLoopOptimization::IsEmptyBody(HBasicBlock* block) { in IsEmptyBody()
1377 HBasicBlock* block) { in TryReplaceWithLastValue()
1419 HBasicBlock* block, in TryAssignLastValue()
Ddead_code_elimination.cc34 HBasicBlock* block = worklist.back(); in MarkReachableBlocks() local
85 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) { in MaybeRecordDeadBlock()
290 HBasicBlock* block = graph_->GetReversePostOrder()[i]; in ConnectSuccessiveBlocks() local
Dpretty_printer.h73 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { in VisitBasicBlock()
127 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { in VisitBasicBlock()
Dgvn_test.cc42 HBasicBlock* block = new (&allocator) HBasicBlock(graph); in TEST_F() local
126 HBasicBlock* block = new (&allocator) HBasicBlock(graph); in TEST_F() local
209 HBasicBlock* block = new (&allocator) HBasicBlock(graph); in TEST_F() local
Dssa_liveness_analysis.cc259 for (const HBasicBlock* block : graph_->GetPostOrder()) { in ComputeLiveInAndLiveOutSets() local
273 bool SsaLivenessAnalysis::UpdateLiveOut(const HBasicBlock& block) { in UpdateLiveOut()
286 bool SsaLivenessAnalysis::UpdateLiveIn(const HBasicBlock& block) { in UpdateLiveIn()
341 HBasicBlock* block = liveness.GetBlockFromPosition(GetStart() / 2); in FindFirstRegisterHint() local
Dblock_builder.cc29 HBasicBlock* block = branch_targets_[store_dex_pc]; in MaybeCreateBlockAt() local
121 HBasicBlock* block = graph_->GetEntryBlock(); in ConnectBasicBlocks() local
192 HBasicBlock* block, in GetTryItem()
Dinduction_var_range.cc177 static HInstruction* Insert(HBasicBlock* block, HInstruction* instruction) { in Insert()
265 HBasicBlock* block, in GenerateRange()
288 HBasicBlock* block) { in GenerateTakenTest()
330 HBasicBlock* block) { in GenerateLastValue()
401 HBasicBlock* block) { in GenerateTripCount()
958 HBasicBlock* block, in GenerateRangeOrLastValue()
1025 HBasicBlock* block, in GenerateLastValuePolynomial()
1058 HBasicBlock* block, in GenerateLastValueGeometric()
1109 HBasicBlock* block, in GenerateLastValueWrapAround()
1130 HBasicBlock* block, in GenerateLastValuePeriodic()
[all …]
Dbounds_check_elimination.cc534 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { in VisitBasicBlock()
693 HBasicBlock* block = instruction->GetBlock(); in HandleIf() local
816 HBasicBlock* block = bounds_check->GetBlock(); in VisitBoundsCheck() local
1181 void AddCompareWithDeoptimization(HBasicBlock* block, in AddCompareWithDeoptimization()
1215 void AddComparesWithDeoptimization(HBasicBlock* block) { in AddComparesWithDeoptimization()
1395 HBasicBlock* block = GetPreHeader(loop, bounds_check); in TransformLoopForDynamicBCE() local
1467 bool DynamicBCESeemsProfitable(HLoopInformation* loop, HBasicBlock* block) { in DynamicBCESeemsProfitable()
1550 HBasicBlock* block = GetPreHeader(loop, check); in CanHandleNullCheck() local
1607 HBasicBlock* block = it->second; in GetPreHeader() local
1620 HBasicBlock* block, in InsertDeoptInLoop()
[all …]
Dgraph_checker.cc36 static bool IsExitTryBoundaryIntoExitBlock(HBasicBlock* block) { in IsExitTryBoundaryIntoExitBlock()
47 void GraphChecker::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
872 HBasicBlock* block = instruction->GetBlock(); in VisitPackedSwitch() local
1002 HBasicBlock* block = instruction->GetBlock(); in VisitConstant() local
Dinstruction_simplifier_arm.h54 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { in VisitBasicBlock()
Dinstruction_simplifier_arm64.h56 void VisitBasicBlock(HBasicBlock* block) OVERRIDE { in VisitBasicBlock()
Dgvn.cc380 void AbandonSetFor(HBasicBlock* block) { in AbandonSetFor()
419 void GlobalValueNumberer::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
535 HBasicBlock* block, const ValueSet& reference_set) const { in FindVisitedBlockWithRecyclableSet()
Dcode_sinking.cc121 static void AddInputs(HBasicBlock* block, in AddInputs()
164 HBasicBlock* block = user->GetBlock(); in FindIdealPosition() local
Dpc_relative_fixups_mips.cc102 HBasicBlock* block = switch_insn->GetBlock(); in VisitPackedSwitch() local
Dbounds_check_elimination_test.cc306 HBasicBlock* block = new (&allocator_) HBasicBlock(graph_); in TEST_F() local
374 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildSSAGraph1() local
490 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildSSAGraph2() local
596 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildSSAGraph3() local
701 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildSSAGraph4() local
803 HBasicBlock* block = new (&allocator_) HBasicBlock(graph_); in TEST_F() local
Dssa_liveness_analysis.h33 BlockInfo(ArenaAllocator* allocator, const HBasicBlock& block, size_t number_of_ssa_values) in BlockInfo()
367 void AddPhiUse(HInstruction* instruction, size_t input_index, HBasicBlock* block) { in AddPhiUse()
1168 BitVector* GetLiveInSet(const HBasicBlock& block) const { in GetLiveInSet()
1172 BitVector* GetLiveOutSet(const HBasicBlock& block) const { in GetLiveOutSet()
1176 BitVector* GetKillSet(const HBasicBlock& block) const { in GetKillSet()
1262 void CheckNoLiveInIrreducibleLoop(const HBasicBlock& block) const { in CheckNoLiveInIrreducibleLoop()
Dregister_allocator_test.cc501 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildIfElseWithPhi() local
663 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildFieldReturn() local
750 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildTwoSubs() local
829 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildDiv() local
897 HBasicBlock* block = new (&allocator) HBasicBlock(graph); in TEST_F() local
/art/runtime/base/
Dscoped_flock.cc35 bool ScopedFlock::Init(const char* filename, int flags, bool block, std::string* error_msg) { in Init()
41 bool block, in Init()

123