Lines Matching defs:input
595 // If there is an unvisited input, push it and continue with that node.
598 Node* input = node->InputAt(current.input_index);
599 NodeInfo* input_info = GetInfo(input);
603 stack.push({input, 0});
608 // If we had already pushed (and not visited) an input, it means that
612 MarkAsPossibleRevisit(node, input);
704 // nodes will need to be revisited due to having an input which was
777 Node* input = node->InputAt(0);
778 node->ReplaceUses(input);
945 // Converts input {index} of {node} according to given UseInfo {use},
946 // assuming the type of the input is {input_type}. If {input_type} is null,
947 // it takes the input from the input node {TypeOf(node->InputAt(index))}.
952 return; // No input requirement on the use.
953 Node* input = node->InputAt(index);
954 DCHECK_NOT_NULL(input);
955 NodeInfo* input_info = GetInfo(input);
961 index, input->id(), input->op()->mnemonic());
967 input_type = TypeOf(input);
969 Node* n = changer_->GetRepresentationFor(input, input_rep, input_type,
988 // Marks node as a possible revisit since it is a use of input that will be
989 // visited before input is visited.
990 void MarkAsPossibleRevisit(Node* node, Node* input) {
991 auto it = might_need_revisit_.find(input);
993 it = might_need_revisit_.insert({input, ZoneVector<Node*>(zone())}).first;
997 node->op()->mnemonic(), input->id(), input->op()->mnemonic());
1338 Node* input = node->InputAt(i);
1341 if (TypeOf(input).Is(Type::BigInt())) {
1346 DeoptMachineTypeOf(GetInfo(input)->representation(), TypeOf(input));
1430 Node* input = node->InputAt(i);
1432 DeoptMachineTypeOf(GetInfo(input)->representation(), TypeOf(input));
1543 // A -0 input is impossible or will cause a deopt.
1978 UseInfo UseInfoForJSWasmCallArgument(Node* input, wasm::ValueType type,
1980 // If the input type is a Number or Oddball, we can directly convert the
1981 // input into the Wasm native type of the argument. If not, we return
2022 TNode<Object> input = n.Argument(i);
2023 DCHECK_NOT_NULL(input);
2025 input, wasm_signature->GetParam(i), params.feedback());
2071 // Kill non-effectful operations that have a None-type input and are thus
2083 Node* input = node->InputAt(i);
2084 if (TypeOf(input).IsNone()) {
2085 node->ReplaceInput(0, input);
2117 // here, otherwise the input conversion will fail.
2185 // TODO(bmeurer): Optimize somewhat based on input type?
2230 // No input representation requirement; adapt during lowering.
2744 // pass the kIdentifyZeros truncation to its input, and
2924 // no-ops if we figure out (late) that their input is already an
3039 // No need to silence anything if the input cannot be NaN.
3057 // For NumberToBoolean we don't care whether the input is 0 or
3224 // TODO(turbofan): We currently depend on having this first length input
3271 // TODO(bmeurer): The input representation should be TaggedPointer.
3567 // Try to optimize the {node} based on the input type.
3815 // TODO(turbofan): Optimize based on input representation.
3963 // Here we pretend that the input has the sigma's type for the
4206 // Enqueue {use_node}'s {index} input if the {use_info} contains new information
4207 // for that input node.
4214 // Check monotonicity of input requirements.
4343 // Make sure to not overwrite the unreachable node's input. That would
4586 Node* const input = node->InputAt(0);
4595 graph()->NewNode(machine()->Float64Sub(), result, one_half), input),
4604 Node* const input = node->InputAt(0);
4608 graph()->NewNode(machine()->Float64LessThan(), input, zero), minus_one,
4611 graph()->NewNode(machine()->Float64LessThan(), zero, input), one,
4612 input));
4616 Node* const input = node->InputAt(0);
4620 // let sign = input >> 31 in
4621 // (input ^ sign) - sign
4623 Node* sign = graph()->NewNode(machine()->Word32Sar(), input,
4626 graph()->NewNode(machine()->Word32Xor(), input, sign),
4806 Node* const input = node->InputAt(0);
4810 graph()->NewNode(machine()->Int32LessThan(), input, zero), minus_one,
4813 graph()->NewNode(machine()->Int32LessThan(), zero, input), one,
4918 Node* const input = node->InputAt(0);
4922 node->ReplaceInput(0, graph()->NewNode(op, input, zero));
4928 Node* const input = node->InputAt(0);
4930 node->ReplaceInput(0, graph()->NewNode(machine()->Float64Equal(), input,
4937 Node* const input = node->InputAt(0);
4941 graph()->NewNode(machine()->Float64Abs(), input));
4946 Node* const input = node->InputAt(0);
4951 0, graph()->NewNode(machine()->Float64LessThan(), min, input));
4956 graph()->NewNode(machine()->Float64LessThan(), input, max), input,
4963 Node* const input = node->InputAt(0);
4970 graph()->NewNode(machine()->Float64LessThan(), min, input),
4973 graph()->NewNode(machine()->Float64LessThan(), input, max),
4974 input, max),
4980 Node* const input = node->InputAt(0);
4985 0, graph()->NewNode(machine()->Int32LessThanOrEqual(), input, max));
4989 graph()->NewNode(machine()->Int32LessThan(), input, min),
4990 min, input));
4996 Node* const input = node->InputAt(0);
5000 0, graph()->NewNode(machine()->Uint32LessThanOrEqual(), input, max));
5001 node->AppendInput(graph()->zone(), input);