143     BytecodeRegion &entryBlock = graph_[0];  in BuildEntryBlock()
144     BytecodeRegion &nextBlock = graph_[1];  in BuildEntryBlock()
158     graph_.resize(blockSize + 1);  in BuildRegions()
170             auto &prevBlock = graph_[blockId - 1];  in BuildRegions()
181     auto &lastBlock = graph_[blockId - 1]; // 1: last block  in BuildRegions()
207     for (size_t i = 0; i < graph_.size(); i++) {  in BuildCatchBlocks()
208         auto &bb = graph_[i];  in BuildCatchBlocks()
217             for (size_t j = i + 1; j < graph_.size(); j++) {  in BuildCatchBlocks()
218                 auto &catchBB = graph_[j];  in BuildCatchBlocks()
243     std::vector<size_t> visited(graph_.size(), 0);  in ComputeDominatorTree()
244     auto basicBlockId = graph_[0].id;  in ComputeDominatorTree()
245     visited[graph_[0].id] = 1;  in ComputeDominatorTree()
252         for (const auto &succBlock: graph_[curBlockId].succs) {  in ComputeDominatorTree()
268     std::vector<size_t> realImmDom(graph_.size()); // immediate dominator with real index  in ComputeDominatorTree()
290             for (const auto &preBlock : graph_[basicBlockList[idx]].preds) {  in ComputeDominatorTree()
328     graph_[0].iDominator = &graph_[0];  in BuildImmediateDominator()
330         auto dominatedBlock = &graph_[i];  in BuildImmediateDominator()
334         auto immDomBlock = &graph_[immDom[i]];  in BuildImmediateDominator()
338     for (auto &block : graph_) {  in BuildImmediateDominator()
356     for (auto &bb : graph_) {  in ComputeDomFrontiers()
367                 runner = &graph_[immDom[runner->id]];  in ComputeDomFrontiers()
374             graph_[i].domFrontiers.emplace_back(*iter);  in ComputeDomFrontiers()
381     for (auto &block: graph_) {  in RemoveDeadRegions()
391     for (auto &block : graph_) {  in RemoveDeadRegions()
402     for (auto &bb : graph_) {  in InsertPhi()
432             for (auto &block : graph_[currentId].domFrontiers) {  in InsertPhi()
451     for (auto &bb : graph_) {  in InsertExceptionPhi()
484     for (auto &bb: graph_) {  in UpdateCFG()
499     for (auto &bb: graph_) {  in UpdateCFG()
576     for (auto &bb: graph_) {  in CollectPredsInfo()
584     for (auto &bb: graph_) {  in CollectPredsInfo()
625     for (auto &bb: graph_) {  in CollectPredsInfo()
1049     auto &entryBlock = graph_[0];  in BuildSubCircuit()
1052         auto &bb = graph_[bbId];  in BuildSubCircuit()
1062             auto &bbNext = graph_[bb.id + 1];  in BuildSubCircuit()
1082             auto &bbNext = graph_[bb.id + 1];  in BuildSubCircuit()
1270     auto &bb = graph_.at(bbId);  in ResolveDef()
1400     for (auto &bb: graph_) {  in BuildCircuit()
1598     for (size_t i = 0; i < graph_.size(); i++) {  in PrintGraph()
1599         BytecodeRegion& bb = graph_[i];  in PrintGraph()