Lines Matching defs:value
114 // return more than 1 value, we should merge these back into a single variadic
152 // possible since the merge does not take any value inputs.
263 TNode<Object> value,
265 TNode<Smi> CheckSmi(TNode<Object> value);
266 TNode<String> CheckString(TNode<Object> value);
267 TNode<Number> CheckBounds(TNode<Number> value, TNode<Number> limit);
270 TNode<Smi> TypeGuardUnsignedSmall(TNode<Object> value);
271 TNode<Object> TypeGuardNonInternal(TNode<Object> value);
272 TNode<Number> TypeGuardFixedArrayLength(TNode<Object> value);
299 TNode<Number> NumberInc(TNode<Number> value) {
300 return NumberAdd(value, OneConstant());
725 // Returns {index,value}. Assumes that the map has not changed, but possibly
740 TNode<Object> value = LoadElement<Object>(
742 return std::make_pair(index, value);
753 MachineRepresentationOf<Vars>::value...};
769 void StoreJSArrayLength(TNode<JSArray> array, TNode<Number> value,
771 StoreField(AccessBuilder::ForJSArrayLength(kind), array, value);
791 TNode<Number> CheckFloat64Hole(TNode<Number> value,
795 value, effect(), control()));
799 TNode<Object> TryConvertHoleToUndefined(TNode<Object> value,
803 // TODO(7409): avoid deopt if not all uses of value are truncated.
804 TNode<Number> number = TNode<Number>::UncheckedCast(value);
808 return ConvertTaggedHoleToUndefined(value);
852 TNode<Object> value) {
853 StoreField(AccessBuilder::ForContextSlot(slot_index), context, value);
1027 TNode<Object> value, NumberOperationHint hint) {
1030 value, effect(), control()));
1033 TNode<Smi> JSCallReducerAssembler::CheckSmi(TNode<Object> value) {
1035 value, effect(), control()));
1038 TNode<String> JSCallReducerAssembler::CheckString(TNode<Object> value) {
1040 value, effect(), control()));
1043 TNode<Number> JSCallReducerAssembler::CheckBounds(TNode<Number> value,
1046 value, limit, effect(), control()));
1049 TNode<Smi> JSCallReducerAssembler::TypeGuardUnsignedSmall(TNode<Object> value) {
1050 return TNode<Smi>::UncheckedCast(TypeGuard(Type::UnsignedSmall(), value));
1054 TNode<Object> value) {
1055 return TNode<Object>::UncheckedCast(TypeGuard(Type::NonInternal(), value));
1059 TNode<Object> value) {
1063 TypeGuard(TypeCache::Get()->kFixedArrayLengthType, value));
1212 int search_string_length = search_element_string.length().value();
1232 jsgraph()->Constant(search_element_string.GetChar(i).value());
1517 // Set initial accumulator value.
1520 accumulator = Argument(1); // Initial value specified by the user.
1522 // The initial value was not specified by the user. In this case, the first
1523 // (or last in the case of reduceRight) non-holey value of the array is
1831 // Since the callback returned a trueish value, store the element in a.
2355 Node* value = jsgraph()->NaNConstant();
2356 ReplaceWithValue(node, value);
2357 return Replace(value);
2372 Node* value = jsgraph()->NaNConstant();
2373 ReplaceWithValue(node, value);
2374 return Replace(value);
2390 Node* value = jsgraph()->ZeroConstant();
2391 ReplaceWithValue(node, value);
2392 return Replace(value);
2409 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right);
2410 ReplaceWithValue(node, value, effect);
2411 return Replace(value);
2422 Node* value = jsgraph()->Constant(32);
2423 ReplaceWithValue(node, value);
2424 return Replace(value);
2435 Node* value = graph()->NewNode(simplified()->NumberClz32(), input);
2436 ReplaceWithValue(node, value, effect);
2437 return Replace(value);
2456 Node* value = effect =
2465 value = graph()->NewNode(op, value, input);
2468 ReplaceWithValue(node, value, effect);
2469 return Replace(value);
2526 // ES6 section 19.3.1.1 Boolean ( value )
2530 Node* value = n.ArgumentOrUndefined(0, jsgraph());
2531 value = graph()->NewNode(simplified()->ToBoolean(), value);
2532 ReplaceWithValue(node, value);
2533 return Replace(value);
2540 Node* value = n.Argument(0);
2544 if (NodeProperties::CanBePrimitive(broker(), value, effect)) {
2545 if (!NodeProperties::CanBeNullOrUndefined(broker(), value, effect)) {
2547 // the {value} cannot be null or undefined.
2548 NodeProperties::ReplaceValueInputs(node, value);
2553 ReplaceWithValue(node, value);
2554 return Replace(value);
2607 // Massage the value inputs appropriately.
2682 Node* value =
2685 ReplaceWithValue(node, value, effect, control);
2686 return Replace(value);
2702 // - and all the remaining value inputs are [[BoundArguments]]
2738 // recomputed even if the actual value of the object changes.
2812 Node* value = effect =
2816 ReplaceWithValue(node, value, effect, control);
2817 return Replace(value);
2854 // Just remove the target, which is the first value input.
2923 Node* value = jsgraph()->Constant(candidate_prototype);
2924 ReplaceWithValue(node, value);
2925 return Replace(value);
2940 Node* value = graph()->NewNode(simplified()->SameValue(), lhs, rhs);
2941 ReplaceWithValue(node, value);
2942 return Replace(value);
3017 Node* value = jsgraph()->TrueConstant();
3018 ReplaceWithValue(node, value, effect, control);
3019 return Replace(value);
3031 Node* value = n.ArgumentOrUndefined(0, jsgraph());
3041 // We don't check whether {value} is a proper JSReceiver here explicitly,
3042 // and don't explicitly rule out Primitive {value}s, since all of them
3045 NodeProperties::ReplaceValueInput(node, value, n.TargetIndex());
3058 // Massage value inputs appropriately.
3080 // Massage value inputs appropriately.
3692 shared.function_template_info().value());
4014 // Check if {node} is the only value user of {arguments_list} (except for
4015 // value uses in frame states). If not, we give up for now.
4176 // Check whether the given new target value is a constructor function. The
4177 // replacement {JSConstruct} operator only checks the passed target value
4178 // but relies on the new target value to be implicitly valid.
4246 AllocationSiteRef site = feedback.AsLiteral().value();
4382 args.emplace_back(jsgraph()->Constant(maybe_arg.value()));
4449 Node* value = NodeProperties::GetValueInput(target, 2 + i);
4450 node->InsertInput(graph()->zone(), n.ArgumentIndex(i), value);
4507 FeedbackCellRef feedback_cell = feedback_target.value().AsFeedbackCell();
5124 // If no value is passed, we can immediately lower to a simple
5133 // constructor), {value} will be ignored and therefore we can lower
5134 // to {JSCreate}. See https://tc39.es/ecma262/#sec-object-value.
5138 // Drop the value inputs.
5171 args.emplace_back(jsgraph()->Constant(maybe_arg.value()));
5237 Node* value = NodeProperties::GetValueInput(target, 2 + i);
5238 node->InsertInput(graph()->zone(), n.ArgumentIndex(i), value);
5590 // Collect the value inputs to push.
5596 for (auto& value : values) {
5598 value = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()),
5599 value, effect, control);
5601 value = effect = graph()->NewNode(
5602 simplified()->CheckNumber(p.feedback()), value, effect, control);
5604 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value);
5647 Node* value = values[j];
5653 elements, index, value, effect, control);
5709 Node* value = jsgraph()->UndefinedConstant();
5791 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
5797 value =
5798 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value);
5803 values_to_merge.push_back(value);
5815 value =
5820 ReplaceWithValue(node, value, effect, control);
5821 return Replace(value);
5856 Node* value = jsgraph()->UndefinedConstant();
6033 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
6039 value =
6040 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value);
6045 values_to_merge.push_back(value);
6057 value =
6062 ReplaceWithValue(node, value, effect, control);
6063 return Replace(value);
6148 Node* value = jsgraph()->FalseConstant();
6149 ReplaceWithValue(node, value);
6150 return Replace(value);
6405 // TODO(6587): avoid deopt if not all uses of value are truncated.
6414 // Allocate elements for key/value pair
6442 // value that will never pass the length check again (aka the maximum
6443 // value possible for the specific iterated object). Note that this is
6459 Node* value =
6467 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(),
6468 value, done, context, effect);
6469 ReplaceWithValue(node, value, effect, control);
6470 return Replace(value);
6503 Node* value = effect = graph()->NewNode(string_access_operator, receiver,
6506 ReplaceWithValue(node, value, effect, control);
6507 return Replace(value);
6534 int length = search_element_string.length().value();
6578 Node* value = effect = graph()->NewNode(simplified()->StringCharCodeAt(),
6580 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value);
6582 ReplaceWithValue(node, value, effect, control);
6583 return Replace(value);
6649 Node* value =
6651 ReplaceWithValue(node, value, effect);
6652 return Replace(value);
6675 Node* value =
6677 ReplaceWithValue(node, value, effect);
6678 return Replace(value);
6819 Node* value =
6826 value = effect = graph()->NewNode(javascript()->CreateIterResultObject(),
6827 value, done, context, effect);
6829 ReplaceWithValue(node, value, effect, control);
6830 return Replace(value);
6865 Node* value = graph()->NewNode(simplified()->StringConcat(), length, receiver,
6868 ReplaceWithValue(node, value, effect, control);
6869 return Replace(value);
7056 // input with the {on_finally} value.
7143 Node* value = n.ArgumentOrUndefined(0, jsgraph());
7157 node->ReplaceInput(1, value);
7270 Node* value =
7273 ReplaceWithValue(node, value, effect, control);
7274 return Replace(value);
7281 Node* value = jsgraph()->FalseConstant();
7282 ReplaceWithValue(node, value);
7283 return Replace(value);
7286 Node* value = graph()->NewNode(simplified()->ObjectIsFiniteNumber(), input);
7287 ReplaceWithValue(node, value);
7288 return Replace(value);
7295 Node* value = jsgraph()->FalseConstant();
7296 ReplaceWithValue(node, value);
7297 return Replace(value);
7300 Node* value = graph()->NewNode(simplified()->ObjectIsInteger(), input);
7301 ReplaceWithValue(node, value);
7302 return Replace(value);
7309 Node* value = jsgraph()->FalseConstant();
7310 ReplaceWithValue(node, value);
7311 return Replace(value);
7314 Node* value = graph()->NewNode(simplified()->ObjectIsSafeInteger(), input);
7315 ReplaceWithValue(node, value);
7316 return Replace(value);
7323 Node* value = jsgraph()->FalseConstant();
7324 ReplaceWithValue(node, value);
7325 return Replace(value);
7328 Node* value = graph()->NewNode(simplified()->ObjectIsNaN(), input);
7329 ReplaceWithValue(node, value);
7330 return Replace(value);
7372 Node* value = graph()->NewNode(
7376 ReplaceWithValue(node, value, effect, control);
7377 return Replace(value);
7401 Node* value = graph()->NewNode(simplified()->NumberEqual(), index,
7403 value = graph()->NewNode(simplified()->BooleanNot(), value);
7405 ReplaceWithValue(node, value, effect, control);
7406 return Replace(value);
7460 Node* value = effect = graph()->NewNode(
7464 ReplaceWithValue(node, value, effect, control);
7465 return Replace(value);
7487 // key-value arrays in case of Set/Map entry iteration.
7490 // forwarding) is unable to eliminate the allocations for the key-value
7676 // Abort loop with resulting value.
7679 Node* value = effect =
7690 // The actual {value} depends on the {receiver} iteration type.
7697 value = effect =
7698 graph()->NewNode(javascript()->CreateKeyValueArray(), value,
7699 value, context, effect);
7703 value = effect = graph()->NewNode(
7714 value = effect = graph()->NewNode(
7722 value = effect =
7724 entry_key, value, context, effect);
7731 // Store final {value} and {done} into the {iterator_result}.
7735 iterator_result, value, effect, control);
7763 Node* value = n.ArgumentOrUndefined(0, jsgraph());
7765 node->ReplaceInput(0, value);
7784 Node* value = effect = graph()->NewNode(simplified()->LoadField(access),
7808 value = graph()->NewNode(
7810 check, value, jsgraph()->ZeroConstant());
7813 ReplaceWithValue(node, value, effect, control);
7814 return Replace(value);
7841 Node* value = nullptr;
7843 value = n.ArgumentOrUndefined(1, jsgraph());
7902 // Coerce {value} to Number.
7904 value = effect = graph()->NewNode(
7907 value, effect, control);
7950 value = effect = graph()->NewNode(
7958 data_pointer, offset, value, is_little_endian, effect, control);
7959 value = jsgraph()->UndefinedConstant();
7963 ReplaceWithValue(node, value, effect, control);
7964 return Changed(value);
7975 Node* value = jsgraph()->FalseConstant();
7976 ReplaceWithValue(node, value);
7977 return Replace(value);
7988 Node* value = graph()->NewNode(simplified()->NumberIsFinite(), input);
7989 ReplaceWithValue(node, value, effect);
7990 return Replace(value);
8001 Node* value = jsgraph()->TrueConstant();
8002 ReplaceWithValue(node, value);
8003 return Replace(value);
8014 Node* value = graph()->NewNode(simplified()->NumberIsNaN(), input);
8015 ReplaceWithValue(node, value, effect);
8016 return Replace(value);
8030 Node* value = effect =
8033 ReplaceWithValue(node, value, effect, control);
8034 return Replace(value);
8041 Node* value = effect =
8043 ReplaceWithValue(node, value, effect, control);
8044 return Replace(value);
8051 Node* value = jsgraph()->NaNConstant();
8052 ReplaceWithValue(node, value);
8053 return Replace(value);
8127 ai_exec.lookup_start_object_maps(), kStartAtPrototype, holder.value());
8168 Node* value = n.ArgumentOr(0, jsgraph()->ZeroConstant());
8183 // Convert the {value} to a Number.
8184 NodeProperties::ReplaceValueInputs(node, value);
8208 Node* value = n.Argument(1);
8213 value = effect = graph()->NewNode(
8218 value, effect, control);
8219 ReplaceWithValue(node, value, effect);
8220 return Replace(value);