| /external/v8/src/crankshaft/ |
| hydrogen-osr.h | 29 HBasicBlock* BuildOsrLoopEntry(IterationStatement* statement);
48 HBasicBlock* osr_entry_;
49 HBasicBlock* osr_loop_entry_;
|
| hydrogen-sce.cc | 17 HBasicBlock* block = graph()->blocks()->at(i);
19 HBasicBlock* back_edge = block->loop_information()->GetLastBackEdge();
20 HBasicBlock* dominator = back_edge;
|
| hydrogen-load-elimination.h | 21 void EliminateLoads(HBasicBlock* block);
|
| hydrogen-mark-unreachable.cc | 16 const ZoneList<HBasicBlock*>* blocks = graph()->blocks();
20 HBasicBlock* block = blocks->at(i);
24 HBasicBlock* predecessor = it.Current();
30 HBasicBlock* pred_succ;
|
| hydrogen-bce.h | 39 void EliminateRedundantBoundsChecks(HBasicBlock* bb);
40 BoundsCheckBbData* PreProcessBlock(HBasicBlock* bb);
41 void PostProcessBlock(HBasicBlock* bb, BoundsCheckBbData* data);
|
| hydrogen-redundant-phi.h | 22 void ProcessBlock(HBasicBlock* block);
|
| hydrogen-flow-engine.h | 39 inline NoState* Copy(HBasicBlock* succ, Zone* zone) {
45 inline NoState* Merge(HBasicBlock* succ, NoState* other, Zone* zone) {
82 State* AnalyzeOneBlock(HBasicBlock* block, State* state) {
92 void AnalyzeDominatedBlocks(HBasicBlock* root, State* initial) {
98 HBasicBlock* block = graph_->blocks()->at(i);
123 HBasicBlock* succ = block->end()->SuccessorAt(i);
141 Effects* ComputeLoopEffects(HBasicBlock* block) {
154 HBasicBlock* member = graph_->blocks()->at(i);
174 inline bool SkipNonDominatedBlock(HBasicBlock* root, HBasicBlock* other)
[all...] |
| hydrogen-environment-liveness.h | 30 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live);
32 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live);
|
| /art/compiler/optimizing/ |
| common_dominator.h | 30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) {
37 explicit CommonDominator(HBasicBlock* block)
42 void Update(HBasicBlock* block) {
49 HBasicBlock* block2 = dominator_;
77 HBasicBlock* Get() const {
82 static size_t ChainLength(HBasicBlock* block) {
91 HBasicBlock* dominator_;
|
| linear_order.h | 31 // for (HBasicBlock* block : linear_order) // linear order
33 // for (HBasicBlock* block : ReverseRange(linear_order)) // linear post order
37 ArenaVector<HBasicBlock*>* linear_order);
|
| loop_optimization_test.cc | 43 entry_block_ = new (&allocator_) HBasicBlock(graph_);
44 return_block_ = new (&allocator_) HBasicBlock(graph_);
45 exit_block_ = new (&allocator_) HBasicBlock(graph_);
63 HBasicBlock* AddLoop(HBasicBlock* position, HBasicBlock* successor) {
64 HBasicBlock* header = new (&allocator_) HBasicBlock(graph_);
65 HBasicBlock* body = new (&allocator_) HBasicBlock(graph_)
[all...] |
| graph_test.cc | 27 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
28 HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
38 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
39 HBasicBlock* block = new (allocator) HBasicBlock(graph);
46 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) {
47 HBasicBlock* block = createGotoBlock(graph, allocator);
52 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
53 HBasicBlock* block = new (allocator) HBasicBlock(graph)
[all...] |
| linear_order.cc | 37 static void AddToListForLinearization(ArenaVector<HBasicBlock*>* worklist, HBasicBlock* block) {
41 HBasicBlock* current = *insert_pos;
54 static bool IsLinearOrderWellFormed(const HGraph* graph, ArenaVector<HBasicBlock*>* linear_order) {
55 for (HBasicBlock* header : graph->GetBlocks()) {
62 for (HBasicBlock* block : *linear_order) {
84 ArenaVector<HBasicBlock*>* linear_order) {
97 for (HBasicBlock* block : graph->GetReversePostOrder()) {
109 ArenaVector<HBasicBlock*> worklist(allocator->Adapter(kArenaAllocLinearOrder));
112 HBasicBlock* current = worklist.back()
[all...] |
| block_builder.h | 50 HBasicBlock* GetBlockAt(uint32_t dex_pc) const { return branch_targets_[dex_pc]; }
56 HBasicBlock* MaybeCreateBlockAt(uint32_t dex_pc);
61 HBasicBlock* MaybeCreateBlockAt(uint32_t semantic_dex_pc, uint32_t store_dex_pc);
72 bool MightHaveLiveNormalPredecessors(HBasicBlock* catch_block);
80 ArenaVector<HBasicBlock*> branch_targets_;
81 ArenaVector<HBasicBlock*> throwing_blocks_;
|
| gvn_test.cc | 33 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
42 HBasicBlock* block = new (&allocator) HBasicBlock(graph);
117 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
126 HBasicBlock* block = new (&allocator) HBasicBlock(graph);
140 HBasicBlock* then = new (&allocator) HBasicBlock(graph)
[all...] |
| register_allocation_resolver.h | 29 class HBasicBlock;
67 void ConnectSplitSiblings(LiveInterval* interval, HBasicBlock* from, HBasicBlock* to) const;
70 void InsertParallelMoveAtExitOf(HBasicBlock* block,
74 void InsertParallelMoveAtEntryOf(HBasicBlock* block,
|
| side_effects_analysis.cc | 29 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
40 for (HBasicBlock* block : graph_->GetPostOrder()) {
59 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader();
74 SideEffects SideEffectsAnalysis::GetLoopEffects(HBasicBlock* block) const {
79 SideEffects SideEffectsAnalysis::GetBlockEffects(HBasicBlock* block) const {
|
| bounds_check_elimination_test.cc | 69 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_);
82 HBasicBlock* block1 = new (&allocator_) HBasicBlock(graph_);
90 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_);
103 HBasicBlock* block3 = new (&allocator_) HBasicBlock(graph_);
114 HBasicBlock* block4 = new (&allocator_) HBasicBlock(graph_)
[all...] |
| block_builder.cc | 24 HBasicBlock* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t dex_pc) {
28 HBasicBlock* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t semantic_dex_pc,
30 HBasicBlock* block = branch_targets_[store_dex_pc];
32 block = new (arena_) HBasicBlock(graph_, semantic_dex_pc);
122 HBasicBlock* block = graph_->GetEntryBlock();
133 HBasicBlock* next_block = GetBlockAt(dex_pc);
177 HBasicBlock* next_case_block = GetBlockAt(next_case_dex_pc);
202 HBasicBlock* block,
215 const ArenaSafeMap<uint32_t, HBasicBlock*>& catch_blocks) {
221 bool HBasicBlockBuilder::MightHaveLiveNormalPredecessors(HBasicBlock* catch_block)
[all...] |
| code_sinking.h | 41 void SinkCodeToUncommonBranch(HBasicBlock* end_block);
|
| dead_code_elimination.h | 39 void MaybeRecordDeadBlock(HBasicBlock* block);
|
| loop_optimization.h | 119 bool ShouldVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count);
120 void Vectorize(LoopNode* node, HBasicBlock* block, HBasicBlock* exit, int64_t trip_count);
122 HBasicBlock* block,
123 HBasicBlock* new_preheader,
159 uint32_t GetUnrollingFactor(HBasicBlock* block, int64_t trip_count);
163 bool TrySetSimpleLoopHeader(HBasicBlock* block);
164 bool IsEmptyBody(HBasicBlock* block);
173 HBasicBlock* block);
176 HBasicBlock* block
[all...] |
| cha_guard_optimization.cc | 49 void VisitBasicBlock(HBasicBlock* block) OVERRIDE;
75 void CHAGuardVisitor::VisitBasicBlock(HBasicBlock* block) {
89 HBasicBlock* block = flag->GetBlock();
129 HBasicBlock* dominator = flag->GetBlock();
130 HBasicBlock* receiver_def_block = receiver->GetBlock();
181 HBasicBlock* block = flag->GetBlock();
197 HBasicBlock* pre_header = loop_info->GetPreHeader();
249 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| select_generator.cc | 26 static bool IsSimpleBlock(HBasicBlock* block) {
50 static bool BlocksMergeTogether(HBasicBlock* block1, HBasicBlock* block2) {
56 static HPhi* GetSingleChangedPhi(HBasicBlock* block, size_t index1, size_t index2) {
79 for (HBasicBlock* block : graph_->GetPostOrder()) {
84 HBasicBlock* true_block = if_instruction->IfTrueSuccessor();
85 HBasicBlock* false_block = if_instruction->IfFalseSuccessor();
92 HBasicBlock* merge_block = true_block->GetSingleSuccessor();
|
| side_effects_analysis.h | 36 SideEffects GetLoopEffects(HBasicBlock* block) const;
37 SideEffects GetBlockEffects(HBasicBlock* block) const;
|
