Lines Matching refs:ToInt
414 TRACE("Create block id:%d for #%d:%s\n", block->id().ToInt(), node->id(),
606 node->op()->mnemonic(), block->id().ToInt());
609 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt());
902 if (loop != nullptr && !loop->members->Contains(succ->id().ToInt())) {
976 current->id().ToInt(), loop_depth);
982 TRACE("id:%d is not in a loop (depth == %d)\n", current->id().ToInt(),
986 current->id().ToInt(), current->loop_header()->id().ToInt(),
1020 if (!loops_[loop_num].members->Contains(member->id().ToInt())) {
1021 loops_[loop_num].members->Add(member->id().ToInt());
1033 if (!loops_[loop_num].members->Contains(pred->id().ToInt())) {
1034 loops_[loop_num].members->Add(pred->id().ToInt());
1084 DCHECK_EQ(0, (*order)[0]->id().ToInt()); // entry should be first.
1175 auto entry1 = common_dominator_cache_.find(b1->id().ToInt());
1177 auto entry2 = entry1->second->find(b2->id().ToInt());
1232 new_cache_entries[new_cache_entries_cursor++] = b1->id().ToInt();
1233 new_cache_entries[new_cache_entries_cursor++] = b2->id().ToInt();
1293 TRACE("Block id:%d's idom is id:%d, depth = %d\n", block->id().ToInt(),
1294 dominator->id().ToInt(), block->dominator_depth());
1430 data->minimum_block_->id().ToInt(),
1470 data->minimum_block_->id().ToInt(),
1574 node->id(), node->op()->mnemonic(), block->id().ToInt(),
1575 block->loop_depth(), min_block->id().ToInt());
1586 node->op()->mnemonic(), hoist_block->id().ToInt());
1647 node->op()->mnemonic(), block->id().ToInt());
1675 node->id(), node->op()->mnemonic(), block->id().ToInt());
1698 node->op()->mnemonic(), block->id().ToInt());
1703 use_node->op()->mnemonic(), use_block->id().ToInt());
1786 use->op()->mnemonic(), result->id().ToInt());
1955 TRACE("Move planned nodes from id:%d to id:%d\n", from->id().ToInt(),
1956 to->id().ToInt());