Lines Matching defs:node
7 #include "src/compiler/node-properties.h"
8 #include "src/compiler/node.h"
57 void BasicBlock::AddNode(Node* node) { nodes_.push_back(node); }
166 BasicBlock* Schedule::block(Node* node) const {
167 if (node->id() < static_cast<NodeId>(nodeid_to_block_.size())) {
168 return nodeid_to_block_[node->id()];
173 bool Schedule::IsScheduled(Node* node) {
174 if (node->id() >= nodeid_to_block_.size()) return false;
175 return nodeid_to_block_[node->id()] != nullptr;
200 void Schedule::PlanNode(BasicBlock* block, Node* node) {
202 StdoutStream{} << "Planning #" << node->id() << ":"
203 << node->op()->mnemonic()
206 DCHECK_NULL(this->block(node));
207 SetBlockForNode(block, node);
210 void Schedule::AddNode(BasicBlock* block, Node* node) {
212 StdoutStream{} << "Adding #" << node->id() << ":" << node->op()->mnemonic()
215 DCHECK(this->block(node) == nullptr || this->block(node) == block);
216 block->AddNode(node);
217 SetBlockForNode(block, node);
364 Node* node = block->NodeAt(node_pos);
365 if (node->opcode() == IrOpcode::kPhi) {
366 Node* first_input = node->InputAt(0);
369 Node* input = node->InputAt(i);
370 if (input != first_input && input != node) {
376 node->ReplaceUses(first_input);
377 node->Kill();
400 Node* node = from->NodeAt(i);
401 if (node->opcode() == IrOpcode::kPhi) {
402 to->AddNode(node);
404 DCHECK_EQ(nodeid_to_block_[node->id()], from);
405 nodeid_to_block_[node->id()] = to;
451 void Schedule::SetControlInput(BasicBlock* block, Node* node) {
452 block->set_control_input(node);
453 SetBlockForNode(block, node);
456 void Schedule::SetBlockForNode(BasicBlock* block, Node* node) {
457 if (node->id() >= nodeid_to_block_.size()) {
458 nodeid_to_block_.resize(node->id() + 1);
460 nodeid_to_block_[node->id()] = block;
485 for (Node* node : *block) {
486 os << " " << *node;
487 if (NodeProperties::IsTyped(node)) {
488 os << " : " << NodeProperties::GetType(node);