| /external/v8/src/ |
| hydrogen-osr.h | 28 HBasicBlock* BuildOsrLoopEntry(IterationStatement* statement);
47 HBasicBlock* osr_entry_;
48 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 | 15 const ZoneList<HBasicBlock*>* blocks = graph()->blocks();
19 HBasicBlock* block = blocks->at(i);
23 HBasicBlock* predecessor = it.Current();
29 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 | 31 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live);
33 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live);
|
| hydrogen-bch.cc | 31 HBasicBlock* block() { return block_; }
32 void set_block(HBasicBlock* block) { block_ = block; }
57 HBasicBlock* CurrentDominatedBlock() {
62 HBasicBlock* NextDominatedBlock() {
73 HBasicBlock* block_;
84 HBasicBlock* loop_header() const { return loop_header_; }
86 Element* at(HBasicBlock* block) const { return at(block->block_id()); }
88 void AddCheckAt(HBasicBlock* block) {
127 HBasicBlock* current = loop_header();
129 HBasicBlock* next
[all...] |
| hydrogen-escape-analysis.h | 38 HPhi* NewPhiAndInsert(HBasicBlock* block, HValue* incoming_value, int index);
44 HCapturedObject* StateAt(HBasicBlock* block) {
48 void SetStateAt(HBasicBlock* block, HCapturedObject* state) {
|
| /art/compiler/optimizing/ |
| boolean_simplifier.h | 73 void TryRemovingNegatedCondition(HBasicBlock* block);
74 void TryRemovingBooleanSelection(HBasicBlock* block);
|
| graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
40 HBasicBlock* block = new (allocator) HBasicBlock(graph);
47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) {
48 HBasicBlock* block = createGotoBlock(graph, allocator);
53 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
54 HBasicBlock* block = new (allocator) HBasicBlock(graph)
[all...] |
| gvn_test.cc | 33 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
39 HBasicBlock* block = new (&allocator) HBasicBlock(graph);
82 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
88 HBasicBlock* block = new (&allocator) HBasicBlock(graph);
96 HBasicBlock* then = new (&allocator) HBasicBlock(graph)
[all...] |
| dead_code_elimination.h | 43 void MaybeRecordDeadBlock(HBasicBlock* block);
|
| boolean_simplifier.cc | 21 void HBooleanSimplifier::TryRemovingNegatedCondition(HBasicBlock* block) {
43 static bool BlocksDoMergeTogether(HBasicBlock* block1, HBasicBlock* block2) {
45 HBasicBlock* succ1 = block1->GetSuccessors().Get(0);
46 HBasicBlock* succ2 = block2->GetSuccessors().Get(0);
101 void HBooleanSimplifier::TryRemovingBooleanSelection(HBasicBlock* block) {
106 HBasicBlock* true_block = if_instruction->IfTrueSuccessor();
107 HBasicBlock* false_block = if_instruction->IfFalseSuccessor();
111 HBasicBlock* merge_block = true_block->GetSuccessors().Get(0);
156 HBasicBlock* block = it.Current()
[all...] |
| side_effects_analysis.cc | 29 HBasicBlock* block = it.Current();
41 HBasicBlock* block = it.Current();
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 | 48 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
61 HBasicBlock* block1 = new (&allocator) HBasicBlock(graph);
69 HBasicBlock* block2 = new (&allocator) HBasicBlock(graph);
82 HBasicBlock* block3 = new (&allocator) HBasicBlock(graph);
93 HBasicBlock* block4 = new (&allocator) HBasicBlock(graph)
[all...] |
| nodes.cc | 27 void HGraph::AddBlock(HBasicBlock* block) {
56 HBasicBlock* block = blocks_.Get(i);
68 HBasicBlock* block = blocks_.Get(i);
80 void HGraph::VisitBlockForBackEdges(HBasicBlock* block,
89 HBasicBlock* successor = block->GetSuccessors().Get(i);
130 void HBasicBlock::ClearDominanceInformation() {
145 HBasicBlock* HGraph::FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const {
163 void HGraph::VisitBlockForDominatorTree(HBasicBlock* block
[all...] |
| side_effects_analysis.h | 33 SideEffects GetLoopEffects(HBasicBlock* block) const;
34 SideEffects GetBlockEffects(HBasicBlock* block) const;
|
| graph_checker.h | 40 void VisitBasicBlock(HBasicBlock* block) OVERRIDE;
80 HBasicBlock* current_block_ = nullptr;
111 void VisitBasicBlock(HBasicBlock* block) OVERRIDE;
113 void CheckLoop(HBasicBlock* loop_header);
|
| primitive_type_propagation.h | 33 void VisitBasicBlock(HBasicBlock* block);
|
| ssa_builder.h | 61 GrowableArray<HInstruction*>* GetLocalsFor(HBasicBlock* block) {
72 HInstruction* ValueOfLocal(HBasicBlock* block, size_t local);
74 void VisitBasicBlock(HBasicBlock* block);
101 GrowableArray<HBasicBlock*> loop_headers_;
|
| nodes_test.cc | 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
41 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph);
48 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph);
76 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
102 HBasicBlock* entry = new (&allocator) HBasicBlock(graph)
[all...] |
| reference_type_propagation.h | 51 void VisitBasicBlock(HBasicBlock* block);
56 void BoundTypeForIfNotNull(HBasicBlock* block);
57 void BoundTypeForIfInstanceOf(HBasicBlock* block);
|
| pretty_printer.h | 71 void VisitBasicBlock(HBasicBlock* block) OVERRIDE {
74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors();
83 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors();
125 void VisitBasicBlock(HBasicBlock* block) OVERRIDE {
140 HBasicBlock* current_block_;
|
