Lines Matching defs:value

194             s.object(), static_cast<size_t>(s.length().value()));
243 Node* value = effect =
246 ReplaceWithValue(node, value, effect, control);
247 return Replace(value);
290 Node* value = NodeProperties::GetValueInput(node, 1);
313 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value,
346 shared_zone()->New<StringCons>(left.value(), right.value());
375 Node* value = jsgraph()->Constant(function_prototype);
376 ReplaceWithValue(node, value);
377 return Replace(value);
403 receiver = feedback.AsInstanceOf().value();
448 JSObjectRef holder_ref = found_on_proto ? holder.value() : receiver.value();
460 holder.value());
500 // Rewire the value uses of {node} to ToBoolean conversion of the result.
501 Node* value = graph()->NewNode(simplified()->ToBoolean(), node);
503 if (NodeProperties::IsValueEdge(edge) && edge.from() != value) {
504 edge.UpdateTo(value);
587 Node* value = NodeProperties::GetValueInput(node, 0);
592 // for the given {value} and the {prototype}.
596 InferHasInPrototypeChain(value, effect, m.Ref(broker()));
664 Node* value = NodeProperties::GetValueInput(node, 1);
677 // Only optimize if {value} cannot be a JSPromise.
678 MapInference inference(broker(), value, effect);
686 // Create a %Promise% instance and resolve it with {value}.
689 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value,
739 Node* value = effect =
742 ReplaceWithValue(node, value, effect, control);
743 return Replace(value);
773 Node* node, Node* lookup_start_object, Node* receiver, Node* value,
781 ObjectRef property_cell_value = property_cell.value();
803 // TODO(neis): We could generate code that checks if the new value equals
848 value = access_mode == AccessMode::kHas
863 value = access_mode == AccessMode::kHas
877 // Compute proper type based on the current value in the cell.
890 // We can only use the property cell value map for map check
899 value = effect = graph()->NewNode(
912 // value doesn't match the previous value stored inside the cell.
915 graph()->NewNode(simplified()->ReferenceEqual(), value,
924 // value's type doesn't match the type of the previous value in the
934 // Check that the {value} is a HeapObject.
935 value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
936 value, effect, control);
937 // Check {value} map against the {property_cell_value} map.
942 value, effect, control);
946 // Check that the {value} is a Smi.
947 value = effect = graph()->NewNode(
948 simplified()->CheckSmi(FeedbackSource()), value, effect, control);
955 jsgraph()->Constant(property_cell), value,
967 jsgraph()->Constant(property_cell), value, effect, control);
976 ReplaceWithValue(node, value, effect, control);
977 return Replace(value);
993 Node* value = effect =
997 ReplaceWithValue(node, value, effect);
998 return Replace(value);
1012 Node* value = n.value();
1027 value, script_context, effect, control);
1028 ReplaceWithValue(node, value, effect, control);
1029 return Replace(value);
1031 return ReduceGlobalAccess(node, nullptr, nullptr, value, p.name(broker()),
1041 Node* node, Node* value, NamedAccessFeedback const& feedback,
1068 // receiver = the object we pass to the accessor (if any) as the "this" value.
1104 return ReduceGlobalAccess(node, lookup_start_object, receiver, value,
1205 lookup_start_object, receiver, value, context, frame_state, effect,
1215 value = continuation->value();
1252 Node* this_value = value;
1347 values.push_back(continuation->value());
1357 value = effect = control = jsgraph()->Dead();
1359 value = values.front();
1366 value = graph()->NewNode(
1392 ReplaceWithValue(node, value, effect, control);
1393 return Replace(value);
1418 Node* value = jsgraph()->Constant(prototype);
1419 ReplaceWithValue(node, value);
1420 return Replace(value);
1425 Node* value = jsgraph()->Constant(object.AsString().length().value());
1426 ReplaceWithValue(node, value);
1427 return Replace(value);
1535 return ReducePropertyAccess(node, nullptr, p.name(broker()), n.value(),
1544 return ReducePropertyAccess(node, nullptr, p.name(broker()), n.value(),
1550 Node* node, Node* index, Node* value, KeyedAccessMode const& keyed_mode) {
1570 value = BuildIndexedStringLoad(receiver, index, length, &effect, &control,
1573 ReplaceWithValue(node, value, effect, control);
1574 return Replace(value);
1627 Node* node, Node* index, Node* value,
1662 return ReduceElementAccessOnString(node, index, value,
1753 BuildElementAccess(receiver, index, value, effect, control, access_info,
1755 value = continuation.value();
1770 Node* this_value = value;
1821 values.push_back(continuation.value());
1831 value = effect = control = jsgraph()->Dead();
1833 value = values.front();
1840 value = graph()->NewNode(
1849 ReplaceWithValue(node, value, effect, control);
1850 return Replace(value);
1912 Node* value = access_mode == AccessMode::kHas
1915 ReplaceWithValue(node, value, effect, control);
1916 return Replace(value);
1927 jsgraph()->Constant(receiver_ref.AsString().length().value());
1932 Node* value = BuildIndexedStringLoad(receiver, key, length, &effect,
1934 ReplaceWithValue(node, value, effect, control);
1935 return Replace(value);
1942 Node* node, Node* key, base::Optional<NameRef> static_name, Node* value,
1965 return ReduceNamedAccess(node, value, feedback.AsNamedAccess(),
1971 return ReduceElementAccess(node, key, value, feedback.AsElementAccess());
1999 Node* value = jsgraph()->Dead();
2001 return ReducePropertyAccess(node, n.key(), base::nullopt, value,
2009 // value = receiver[name];
2036 // on the {receiver} and then just load the field value dynamically via
2103 // Load the actual field value.
2104 Node* value = effect = graph()->NewNode(simplified()->LoadFieldByIndex(),
2106 ReplaceWithValue(node, value, effect, control);
2107 return Replace(value);
2121 Node* value = jsgraph()->Dead();
2122 return ReducePropertyAccess(node, name, base::nullopt, value,
2130 return ReducePropertyAccess(node, n.key(), base::nullopt, n.value(),
2139 return ReducePropertyAccess(node, n.key(), base::nullopt, n.value(),
2149 ObjectRef constant = access_info.constant().value();
2161 Node* value;
2164 value = *effect = *control = graph()->NewNode(
2176 ? jsgraph()->Constant(access_info.holder().value())
2178 value = InlineApiCall(receiver, holder, frame_state, nullptr, effect,
2190 return value;
2194 Node* receiver, Node* value, Node* context, Node* frame_state,
2197 ObjectRef constant = access_info.constant().value();
2206 target, receiver, value, feedback, context, frame_state, *effect,
2210 ? jsgraph()->Constant(access_info.holder().value())
2212 InlineApiCall(receiver, holder, frame_state, value, effect, control,
2227 Node* receiver, Node* holder, Node* frame_state, Node* value, Node** effect,
2236 // Only setters have a value.
2237 int const argc = value == nullptr ? 0 : 1;
2267 if (value != nullptr) {
2268 inputs[6] = value;
2285 holder.value());
2289 Node* value;
2291 value = jsgraph()->UndefinedConstant();
2298 value = InlinePropertyGetterCall(
2302 Node* cell = jsgraph()->Constant(access_info.constant().value().AsCell());
2303 value = effect =
2308 value = graph()->NewNode(simplified()->StringLength(), receiver);
2317 value = maybe_value.value();
2319 value = access_builder.BuildLoadDataField(
2323 if (value != nullptr) {
2324 return ValueEffectControl(value, effect, control);
2340 holder.value());
2343 Node* value = access_info.IsNotFound() ? jsgraph()->FalseConstant()
2345 return ValueEffectControl(value, effect, control);
2350 Node* lookup_start_object, Node* receiver, Node* value, Node* context,
2363 return BuildPropertyStore(receiver, value, context, frame_state, effect,
2375 Node* receiver, Node* value, Node* context, Node* frame_state, Node* effect,
2386 holder.value());
2393 InlinePropertySetterCall(receiver, value, context, frame_state, &effect,
2428 value = effect =
2429 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), value,
2440 a.Store(value_field_access, value);
2441 value = effect = a.Finish();
2467 // If the field is constant check that the value we are going
2468 // to store matches current value.
2473 graph()->NewNode(simplified()->SameValue(), current_value, value);
2477 return ValueEffectControl(value, effect, control);
2486 // If the field is constant check that the value we are going
2487 // to store matches current value.
2492 current_value, value);
2496 return ValueEffectControl(value, effect, control);
2500 value = effect = graph()->NewNode(
2501 simplified()->CheckSmi(FeedbackSource()), value, effect, control);
2508 // Emit a map check for the value.
2513 value, effect, control);
2515 // Ensure that {value} is a HeapObject.
2516 value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
2517 value, effect, control);
2544 MapRef transition_map_ref = transition_map.value();
2555 storage, value, effect, control);
2559 value = storage;
2568 value, effect, control);
2574 value, effect, control);
2578 return ValueEffectControl(value, effect, control);
2595 return ReducePropertyAccess(node, n.name(), base::nullopt, n.value(),
2605 return ReducePropertyAccess(node, n.index(), base::nullopt, n.value(),
2643 Node* receiver, Node* index, Node* value, Node* effect, Node* control,
2799 value =
2805 value = effect = graph()->NewNode(
2816 // Ensure that the {value} is actually a Number or an Oddball,
2818 value = effect = graph()->NewNode(
2821 value, effect, control);
2823 // Introduce the appropriate truncation for {value}. Currently we
2828 value = graph()->NewNode(simplified()->NumberToUint8Clamped(), value);
2856 value, etrue, if_true);
2873 buffer_or_receiver, base_pointer, external_pointer, index, value,
2880 value = effect =
2887 value = jsgraph()->TrueConstant();
3027 value =
3032 value = effect =
3043 value = graph()->NewNode(
3044 simplified()->ConvertTaggedHoleToUndefined(), value);
3047 value = effect = graph()->NewNode(
3048 simplified()->CheckNotTaggedHole(), value, effect, control);
3059 value = effect = graph()->NewNode(
3060 simplified()->CheckFloat64Hole(mode, FeedbackSource()), value,
3067 value = effect = graph()->NewNode(simplified()->SpeculativeNumberLessThan(
3073 Node* branch = graph()->NewNode(common()->Branch(), value, control);
3133 value =
3143 value = effect = graph()->NewNode(
3144 simplified()->CheckSmi(FeedbackSource()), value, effect, control);
3146 value = effect =
3147 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), value,
3150 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value);
3238 elements, index, value, effect, control);
3242 return ValueEffectControl(value, effect, control);
3292 Node* value = *effect = graph()->NewNode(
3294 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value);
3295 return value;
3318 Node* value = effect = graph()->NewNode(
3321 values.push_back(value);
3368 Node* value,
3375 return graph()->NewNode(op, jsgraph()->Constant(name), value, effect,