Lines Matching refs:graph_
33 graph_ = CreateGraph(&allocator_);
41 loop_preheader_[d] = new (&allocator_) HBasicBlock(graph_);
42 graph_->AddBlock(loop_preheader_[d]);
43 loop_header_[d] = new (&allocator_) HBasicBlock(graph_);
44 graph_->AddBlock(loop_header_[d]);
49 loop_body_[d] = new (&allocator_) HBasicBlock(graph_);
50 graph_->AddBlock(loop_body_[d]);
65 graph_->SetNumberOfVRegs(n + 3);
68 entry_ = new (&allocator_) HBasicBlock(graph_);
69 graph_->AddBlock(entry_);
71 return_ = new (&allocator_) HBasicBlock(graph_);
72 graph_->AddBlock(return_);
73 exit_ = new (&allocator_) HBasicBlock(graph_);
74 graph_->AddBlock(exit_);
78 graph_->SetEntryBlock(entry_);
79 graph_->SetExitBlock(exit_);
83 graph_->GetDexFile(), 0, 0, Primitive::kPrimNot, true);
85 constant0_ = graph_->GetIntConstant(0);
86 constant1_ = graph_->GetIntConstant(1);
87 constant100_ = graph_->GetIntConstant(100);
88 float_constant0_ = graph_->GetFloatConstant(0.0f);
111 HBasicBlock* cond = new (&allocator_) HBasicBlock(graph_);
112 HBasicBlock* ifTrue = new (&allocator_) HBasicBlock(graph_);
113 HBasicBlock* ifFalse = new (&allocator_) HBasicBlock(graph_);
114 graph_->AddBlock(cond);
115 graph_->AddBlock(ifTrue);
116 graph_->AddBlock(ifFalse);
169 graph_->BuildDominatorTree();
170 iva_ = new (&allocator_) HInductionVarAnalysis(graph_);
177 HGraph* graph_;
211 graph_->BuildDominatorTree();
619 basic_[0]->ReplaceInput(graph_->GetIntConstant(-128), 0);
621 ifs->ReplaceInput(graph_->GetIntConstant(127), 1);
638 basic_[0]->ReplaceInput(graph_->GetIntConstant(-128), 0);
640 ifs->ReplaceInput(graph_->GetIntConstant(128), 1);
656 basic_[0]->ReplaceInput(graph_->GetIntConstant(-32768), 0);
658 ifs->ReplaceInput(graph_->GetIntConstant(32767), 1);
676 basic_[0]->ReplaceInput(graph_->GetIntConstant(-32768), 0);
678 ifs->ReplaceInput(graph_->GetIntConstant(32768), 1);
696 ifs->ReplaceInput(graph_->GetIntConstant(65535), 1);
714 ifs->ReplaceInput(graph_->GetIntConstant(65536), 1);
