Lines Matching defs:from
214 // recursion we may benefit from recursive inlining, if we have additional
342 Node* from, Node* to,
352 processed = DuplicateStateValuesAndRename(input, from, to, mode);
353 } else if (input == from) {
390 FrameState frame_state, Node* from, Node* to, StateCloneMode mode) {
396 if (frame_state.stack() == from) {
403 Node* new_locals = DuplicateStateValuesAndRename(locals, from, to, mode);
467 // from the outside. In particular, there should not be any unaccounted uses
468 // of the phi, effect-phi and merge because we will remove them from
543 // the entire subgraph reachable by inputs from the call (terminating
563 // First compute the set of uses that are only reachable from 2 and 3.
586 // Bail out if there is a use of {callee} that is not reachable from 1, 2
590 if (edge.from() == node && edge.index() == 0) continue;
594 if (replaceable_uses[i].node == edge.from() &&