Lines Matching defs:node
9 #include "src/compiler/node-matchers.h"
21 Reduction WasmInliner::Reduce(Node* node) {
22 switch (node->opcode()) {
25 return ReduceCall(node);
35 TRACE("[function %d: considering node %d, call to %d: %s]\n", function_index_,
81 TRACE("function %d: have already seen node %d, skipping\n", function_index_,
92 TRACE("[function %d: considering node %d... not a relocatable constant]\n",
139 function_index_, candidate.node->id(), candidate.inlinee_index,
150 Node* call = candidate.node;
152 Trace(candidate, "dead node");
160 // We could build the candidate's graph first and consider its node count,
161 // but it turns out that wire byte size and node count are quite strongly
172 // node. This is more specific than the callee's formal signature and might
253 * effect and control dependencies of callee's start node with the respective
254 * inputs of the call node.
264 // Index 0 is the callee node.
309 // throwing call in the inlinee. This might be followed by a LoopExit node.
353 for (Node* node : subgraph_nodes.reachable) {
354 if (node->id() >= subgraph_min_node_id &&
355 !node->op()->HasProperty(Operator::kNoThrow)) {
356 Node* dangling_handler = DanglingHandler(node);
390 // The first input of a return node is always the 0 constant.
477 // The first input of a return node is discarded. This is because Wasm
505 // One return value. Just replace value uses of the call node with it.
508 // Multiple returns. We have to find the projections of the call node and
522 // The callee can never return. The call node and all its uses are dead.