Lines Matching refs:simplified
50 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathUnary()
76 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary()
80 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary()
107 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul()
111 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul()
114 left = graph()->NewNode(simplified()->NumberToUint32(), left); in ReduceMathImul()
115 right = graph()->NewNode(simplified()->NumberToUint32(), right); in ReduceMathImul()
116 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right); in ReduceMathImul()
137 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathClz32()
140 input = graph()->NewNode(simplified()->NumberToUint32(), input); in ReduceMathClz32()
141 Node* value = graph()->NewNode(simplified()->NumberClz32(), input); in ReduceMathClz32()
162 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathMinMax()
167 simplified()->SpeculativeToNumber(NumberOperationHint::kNumberOrOddball, in ReduceMathMinMax()
240 value = graph()->NewNode(simplified()->ToBoolean(), value); in ReduceBooleanConstructor()
313 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list, in ReduceFunctionPrototypeApply()
322 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list, in ReduceFunctionPrototypeApply()
467 simplified()->CheckMaps(CheckMapsFlag::kNone, receiver_maps), receiver, in ReduceFunctionPrototypeBind()
506 simplified()->LoadField(AccessBuilder::ForJSFunctionContext()), target, in ReduceFunctionPrototypeCall()
629 Node* value = graph()->NewNode(simplified()->SameValue(), lhs, rhs); in ReduceObjectIs()
702 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceObjectPrototypeHasOwnProperty()
704 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceObjectPrototypeHasOwnProperty()
707 simplified()->CheckIf(DeoptimizeReason::kWrongMap), check, effect, in ReduceObjectPrototypeHasOwnProperty()
844 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target); in ReduceReflectGet()
920 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), target); in ReduceReflectHas()
1061 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayForEach()
1069 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayForEach()
1093 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayForEach()
1111 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayForEach()
1119 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayForEach()
1131 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayForEach()
1133 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayForEach()
1231 return graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayReduce()
1233 return graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayReduce()
1246 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayReduce()
1252 simplified()->LoadField(AccessBuilder::ForJSArrayLength(PACKED_ELEMENTS)), in ReduceArrayReduce()
1257 : graph()->NewNode(simplified()->NumberSubtract(), original_length, in ReduceArrayReduce()
1260 left ? simplified()->NumberAdd() : simplified()->NumberSubtract(); in ReduceArrayReduce()
1311 left ? graph()->NewNode(simplified()->NumberLessThan(), k, in ReduceArrayReduce()
1313 : graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceArrayReduce()
1316 simplified()->CheckIf(DeoptimizeReason::kNoInitialElement), in ReduceArrayReduce()
1351 ? graph()->NewNode(simplified()->NumberLessThan(), k, original_length) in ReduceArrayReduce()
1352 : graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceArrayReduce()
1379 simplified()->CheckMaps(CheckMapsFlag::kNone, receiver_maps), receiver, in ReduceArrayReduce()
1531 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayMap()
1537 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayMap()
1568 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayMap()
1586 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayMap()
1594 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayMap()
1605 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayMap()
1607 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayMap()
1651 simplified()->TransitionAndStoreElement(double_map, fast_map), a, k, in ReduceArrayMap()
1744 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFilter()
1768 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayFilter()
1801 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayFilter()
1825 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFilter()
1833 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayFilter()
1845 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayFilter()
1847 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayFilter()
2011 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFind()
2019 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayFind()
2048 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayFind()
2066 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayFind()
2077 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayFind()
2084 graph()->NewNode(simplified()->CheckFloat64Hole(mode, p.feedback()), in ReduceArrayFind()
2088 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), element); in ReduceArrayFind()
2123 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArrayFind()
2162 graph()->NewNode(simplified()->ToBoolean(), callback_value); in DoFilterPostCallbackWork()
2165 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in DoFilterPostCallbackWork()
2176 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), a, etrue, in DoFilterPostCallbackWork()
2185 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), elements, in DoFilterPostCallbackWork()
2192 simplified()->MaybeGrowFastElements(mode, VectorSlotPair()), a, in DoFilterPostCallbackWork()
2196 Node* new_length_a = graph()->NewNode(simplified()->NumberAdd(), checked_to, in DoFilterPostCallbackWork()
2200 simplified()->StoreField(AccessBuilder::ForJSArrayLength(kind)), a, in DoFilterPostCallbackWork()
2205 simplified()->StoreElement(AccessBuilder::ForFixedArrayElement(kind)), in DoFilterPostCallbackWork()
2225 Node* check = graph()->NewNode(simplified()->ObjectIsCallable(), fncallback); in WireInCallbackIsCallableCheck()
2265 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in SafeLoadElement()
2267 *k = *effect = graph()->NewNode(simplified()->CheckBounds(feedback), *k, in SafeLoadElement()
2274 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), receiver, in SafeLoadElement()
2278 simplified()->LoadElement(AccessBuilder::ForFixedArrayElement( in SafeLoadElement()
2335 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayEvery()
2344 simplified()->CheckMaps(CheckMapsFlag::kNone, receiver_maps), receiver, in ReduceArrayEvery()
2348 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayEvery()
2376 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArrayEvery()
2400 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayEvery()
2408 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArrayEvery()
2419 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArrayEvery()
2421 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArrayEvery()
2467 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArrayEvery()
2469 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in ReduceArrayEvery()
2597 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), receiver, in ReduceArrayIndexOfIncludes()
2603 simplified()->LoadField( in ReduceArrayIndexOfIncludes()
2609 from_index = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceArrayIndexOfIncludes()
2616 graph()->NewNode(simplified()->NumberLessThan(), from_index, in ReduceArrayIndexOfIncludes()
2619 simplified()->NumberMax(), in ReduceArrayIndexOfIncludes()
2620 graph()->NewNode(simplified()->NumberAdd(), length, from_index), in ReduceArrayIndexOfIncludes()
2688 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArraySome()
2695 simplified()->CheckMaps(CheckMapsFlag::kNone, receiver_maps), receiver, in ReduceArraySome()
2699 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArraySome()
2732 graph()->NewNode(simplified()->NumberLessThan(), k, original_length); in ReduceArraySome()
2756 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArraySome()
2764 graph()->NewNode(simplified()->NumberAdd(), k, jsgraph()->OneConstant()); in ReduceArraySome()
2775 check = graph()->NewNode(simplified()->NumberIsFloat64Hole(), element); in ReduceArraySome()
2777 check = graph()->NewNode(simplified()->ReferenceEqual(), element, in ReduceArraySome()
2823 graph()->NewNode(simplified()->ToBoolean(), callback_value); in ReduceArraySome()
2825 graph()->NewNode(simplified()->ReferenceEqual(), boolean_result, in ReduceArraySome()
2936 simplified()->LoadField(AccessBuilder::ForJSFunctionContext()), target, in ReduceCallApiFunction()
3152 graph()->NewNode(simplified()->ObjectIsConstructor(), new_target); in ReduceCallOrConstructWithArrayLikeOrSpread()
3344 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target, in ReduceJSCall()
3347 simplified()->CheckIf(DeoptimizeReason::kWrongCallTarget), check, in ReduceJSCall()
3532 return ReduceMathUnary(node, simplified()->NumberAbs()); in ReduceJSCall()
3534 return ReduceMathUnary(node, simplified()->NumberAcos()); in ReduceJSCall()
3536 return ReduceMathUnary(node, simplified()->NumberAcosh()); in ReduceJSCall()
3538 return ReduceMathUnary(node, simplified()->NumberAsin()); in ReduceJSCall()
3540 return ReduceMathUnary(node, simplified()->NumberAsinh()); in ReduceJSCall()
3542 return ReduceMathUnary(node, simplified()->NumberAtan()); in ReduceJSCall()
3544 return ReduceMathUnary(node, simplified()->NumberAtanh()); in ReduceJSCall()
3546 return ReduceMathUnary(node, simplified()->NumberCbrt()); in ReduceJSCall()
3548 return ReduceMathUnary(node, simplified()->NumberCeil()); in ReduceJSCall()
3550 return ReduceMathUnary(node, simplified()->NumberCos()); in ReduceJSCall()
3552 return ReduceMathUnary(node, simplified()->NumberCosh()); in ReduceJSCall()
3554 return ReduceMathUnary(node, simplified()->NumberExp()); in ReduceJSCall()
3556 return ReduceMathUnary(node, simplified()->NumberExpm1()); in ReduceJSCall()
3558 return ReduceMathUnary(node, simplified()->NumberFloor()); in ReduceJSCall()
3560 return ReduceMathUnary(node, simplified()->NumberFround()); in ReduceJSCall()
3562 return ReduceMathUnary(node, simplified()->NumberLog()); in ReduceJSCall()
3564 return ReduceMathUnary(node, simplified()->NumberLog1p()); in ReduceJSCall()
3566 return ReduceMathUnary(node, simplified()->NumberLog10()); in ReduceJSCall()
3568 return ReduceMathUnary(node, simplified()->NumberLog2()); in ReduceJSCall()
3570 return ReduceMathUnary(node, simplified()->NumberRound()); in ReduceJSCall()
3572 return ReduceMathUnary(node, simplified()->NumberSign()); in ReduceJSCall()
3574 return ReduceMathUnary(node, simplified()->NumberSin()); in ReduceJSCall()
3576 return ReduceMathUnary(node, simplified()->NumberSinh()); in ReduceJSCall()
3578 return ReduceMathUnary(node, simplified()->NumberSqrt()); in ReduceJSCall()
3580 return ReduceMathUnary(node, simplified()->NumberTan()); in ReduceJSCall()
3582 return ReduceMathUnary(node, simplified()->NumberTanh()); in ReduceJSCall()
3584 return ReduceMathUnary(node, simplified()->NumberTrunc()); in ReduceJSCall()
3586 return ReduceMathBinary(node, simplified()->NumberAtan2()); in ReduceJSCall()
3588 return ReduceMathBinary(node, simplified()->NumberPow()); in ReduceJSCall()
3594 return ReduceMathMinMax(node, simplified()->NumberMax(), in ReduceJSCall()
3597 return ReduceMathMinMax(node, simplified()->NumberMin(), in ReduceJSCall()
3626 return ReduceStringPrototypeStringAt(simplified()->StringCharCodeAt(), in ReduceJSCall()
3630 simplified()->StringCodePointAt(UnicodeEncoding::UTF32), node); in ReduceJSCall()
3775 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target, in ReduceJSConstruct()
3778 simplified()->CheckIf(DeoptimizeReason::kWrongCallTarget), check, in ReduceJSConstruct()
3797 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3800 simplified()->CheckIf(DeoptimizeReason::kWrongCallTarget), check, in ReduceJSConstruct()
3901 graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3944 graph()->NewNode(simplified()->ReferenceEqual(), in ReduceJSConstruct()
3982 simplified()->CheckString(p.feedback()), receiver, effect, control); in ReduceStringPrototypeIndexOf()
3986 graph()->NewNode(simplified()->CheckString(p.feedback()), search_string, in ReduceStringPrototypeIndexOf()
3993 simplified()->CheckSmi(p.feedback()), position, effect, control); in ReduceStringPrototypeIndexOf()
4002 NodeProperties::ChangeOp(node, simplified()->StringIndexOf()); in ReduceStringPrototypeIndexOf()
4024 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSubstring()
4027 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSubstring()
4030 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSubstring()
4032 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSubstring()
4043 Node* vfalse = efalse = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceStringPrototypeSubstring()
4051 graph()->NewNode(simplified()->NumberMin(), in ReduceStringPrototypeSubstring()
4052 graph()->NewNode(simplified()->NumberMax(), start, in ReduceStringPrototypeSubstring()
4056 graph()->NewNode(simplified()->NumberMin(), in ReduceStringPrototypeSubstring()
4057 graph()->NewNode(simplified()->NumberMax(), end, in ReduceStringPrototypeSubstring()
4062 graph()->NewNode(simplified()->NumberMin(), finalStart, finalEnd); in ReduceStringPrototypeSubstring()
4063 Node* to = graph()->NewNode(simplified()->NumberMax(), finalStart, finalEnd); in ReduceStringPrototypeSubstring()
4065 Node* value = effect = graph()->NewNode(simplified()->StringSubstring(), in ReduceStringPrototypeSubstring()
4087 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSlice()
4090 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSlice()
4093 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSlice()
4097 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSlice()
4110 simplified()->CheckSmi(p.feedback()), end, efalse, if_false); in ReduceStringPrototypeSlice()
4120 graph()->NewNode(simplified()->NumberLessThan(), start, in ReduceStringPrototypeSlice()
4123 simplified()->NumberMax(), in ReduceStringPrototypeSlice()
4124 graph()->NewNode(simplified()->NumberAdd(), length, start), in ReduceStringPrototypeSlice()
4126 graph()->NewNode(simplified()->NumberMin(), start, length)); in ReduceStringPrototypeSlice()
4134 graph()->NewNode(simplified()->NumberLessThan(), end, in ReduceStringPrototypeSlice()
4136 graph()->NewNode(simplified()->NumberMax(), in ReduceStringPrototypeSlice()
4137 graph()->NewNode(simplified()->NumberAdd(), length, end), in ReduceStringPrototypeSlice()
4139 graph()->NewNode(simplified()->NumberMin(), end, length)); in ReduceStringPrototypeSlice()
4148 Node* check = graph()->NewNode(simplified()->NumberLessThan(), from, to); in ReduceStringPrototypeSlice()
4155 Node* vtrue = etrue = graph()->NewNode(simplified()->StringSubstring(), in ReduceStringPrototypeSlice()
4189 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeSubstr()
4192 start = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), start, in ReduceStringPrototypeSubstr()
4195 Node* length = graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeSubstr()
4199 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end, in ReduceStringPrototypeSubstr()
4211 simplified()->CheckSmi(p.feedback()), end, efalse, if_false); in ReduceStringPrototypeSubstr()
4221 graph()->NewNode(simplified()->NumberLessThan(), start, in ReduceStringPrototypeSubstr()
4224 simplified()->NumberMax(), in ReduceStringPrototypeSubstr()
4225 graph()->NewNode(simplified()->NumberAdd(), length, start), in ReduceStringPrototypeSubstr()
4234 simplified()->NumberMin(), in ReduceStringPrototypeSubstr()
4235 graph()->NewNode(simplified()->NumberMax(), end, in ReduceStringPrototypeSubstr()
4237 graph()->NewNode(simplified()->NumberSubtract(), length, initStart)); in ReduceStringPrototypeSubstr()
4243 graph()->NewNode(simplified()->NumberAdd(), initStart, resultLength), in ReduceStringPrototypeSubstr()
4249 Node* check = graph()->NewNode(simplified()->NumberLessThan(), in ReduceStringPrototypeSubstr()
4258 graph()->NewNode(simplified()->StringSubstring(), receiver, initStart, in ReduceStringPrototypeSubstr()
4384 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypePush()
4397 value = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceArrayPrototypePush()
4400 value = effect = graph()->NewNode(simplified()->CheckNumber(p.feedback()), in ReduceArrayPrototypePush()
4403 value = graph()->NewNode(simplified()->NumberSilenceNaN(), value); in ReduceArrayPrototypePush()
4409 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayPrototypePush()
4417 simplified()->NumberAdd(), length, jsgraph()->Constant(num_values)); in ReduceArrayPrototypePush()
4421 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), receiver, in ReduceArrayPrototypePush()
4424 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), elements, in ReduceArrayPrototypePush()
4431 simplified()->MaybeGrowFastElements(mode, p.feedback()), receiver, in ReduceArrayPrototypePush()
4433 graph()->NewNode(simplified()->NumberAdd(), length, in ReduceArrayPrototypePush()
4440 simplified()->StoreField(AccessBuilder::ForJSArrayLength(kind)), in ReduceArrayPrototypePush()
4446 Node* index = graph()->NewNode(simplified()->NumberAdd(), length, in ReduceArrayPrototypePush()
4449 simplified()->StoreElement(AccessBuilder::ForFixedArrayElement(kind)), in ReduceArrayPrototypePush()
4499 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypePop()
4506 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayPrototypePop()
4510 Node* check = graph()->NewNode(simplified()->NumberEqual(), length, in ReduceArrayPrototypePop()
4528 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), receiver, in ReduceArrayPrototypePop()
4534 graph()->NewNode(simplified()->EnsureWritableFastElements(), receiver, in ReduceArrayPrototypePop()
4539 length = graph()->NewNode(simplified()->NumberSubtract(), length, in ReduceArrayPrototypePop()
4544 simplified()->StoreField(AccessBuilder::ForJSArrayLength(kind)), in ReduceArrayPrototypePop()
4549 simplified()->LoadElement(AccessBuilder::ForFixedArrayElement(kind)), in ReduceArrayPrototypePop()
4554 simplified()->StoreElement( in ReduceArrayPrototypePop()
4568 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value); in ReduceArrayPrototypePop()
4618 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypeShift()
4625 simplified()->LoadField(AccessBuilder::ForJSArrayLength(kind)), receiver, in ReduceArrayPrototypeShift()
4629 Node* check0 = graph()->NewNode(simplified()->NumberEqual(), length, in ReduceArrayPrototypeShift()
4644 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length, in ReduceArrayPrototypeShift()
4654 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), in ReduceArrayPrototypeShift()
4659 simplified()->LoadElement(AccessBuilder::ForFixedArrayElement(kind)), in ReduceArrayPrototypeShift()
4665 graph()->NewNode(simplified()->EnsureWritableFastElements(), in ReduceArrayPrototypeShift()
4682 graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceArrayPrototypeShift()
4693 graph()->NewNode(simplified()->LoadElement(access), elements, index, in ReduceArrayPrototypeShift()
4696 graph()->NewNode(simplified()->StoreElement(access), elements, in ReduceArrayPrototypeShift()
4697 graph()->NewNode(simplified()->NumberSubtract(), in ReduceArrayPrototypeShift()
4704 graph()->NewNode(simplified()->NumberAdd(), index, in ReduceArrayPrototypeShift()
4709 length = graph()->NewNode(simplified()->NumberSubtract(), length, in ReduceArrayPrototypeShift()
4714 simplified()->StoreField(AccessBuilder::ForJSArrayLength(kind)), in ReduceArrayPrototypeShift()
4719 simplified()->StoreElement( in ReduceArrayPrototypeShift()
4765 graph()->NewNode(simplified()->ConvertTaggedHoleToUndefined(), value); in ReduceArrayPrototypeShift()
4828 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceArrayPrototypeSlice()
4978 graph()->NewNode(simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
4984 simplified()->CheckMaps(CheckMapsFlag::kNone, iterated_object_maps, in ReduceArrayIteratorPrototypeNext()
4998 simplified()->LoadField(AccessBuilder::ForJSArrayBufferViewBuffer()), in ReduceArrayIteratorPrototypeNext()
5002 simplified()->ArrayBufferWasNeutered(), buffer, effect, control); in ReduceArrayIteratorPrototypeNext()
5003 check = graph()->NewNode(simplified()->BooleanNot(), check); in ReduceArrayIteratorPrototypeNext()
5007 simplified()->CheckIf(DeoptimizeReason::kArrayBufferWasNeutered), in ReduceArrayIteratorPrototypeNext()
5024 Node* index = effect = graph()->NewNode(simplified()->LoadField(index_access), in ReduceArrayIteratorPrototypeNext()
5034 simplified()->LoadField(AccessBuilder::ForJSObjectElements()), in ReduceArrayIteratorPrototypeNext()
5045 simplified()->LoadField(length_access), iterated_object, effect, control); in ReduceArrayIteratorPrototypeNext()
5048 Node* check = graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceArrayIteratorPrototypeNext()
5073 simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
5077 simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
5094 graph()->NewNode(simplified()->LoadField( in ReduceArrayIteratorPrototypeNext()
5099 graph()->NewNode(simplified()->LoadTypedElement(array_type), buffer, in ReduceArrayIteratorPrototypeNext()
5103 simplified()->LoadElement( in ReduceArrayIteratorPrototypeNext()
5111 simplified()->ConvertTaggedHoleToUndefined(), value_true); in ReduceArrayIteratorPrototypeNext()
5116 simplified()->CheckFloat64Hole(mode, p.feedback()), value_true, in ReduceArrayIteratorPrototypeNext()
5133 Node* next_index = graph()->NewNode(simplified()->NumberAdd(), index, in ReduceArrayIteratorPrototypeNext()
5135 etrue = graph()->NewNode(simplified()->StoreField(index_access), iterator, in ReduceArrayIteratorPrototypeNext()
5160 efalse = graph()->NewNode(simplified()->StoreField(index_access), in ReduceArrayIteratorPrototypeNext()
5201 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeStringAt()
5206 graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeStringAt()
5209 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceStringPrototypeStringAt()
5213 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in ReduceStringPrototypeStringAt()
5237 receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeCharAt()
5242 graph()->NewNode(simplified()->StringLength(), receiver); in ReduceStringPrototypeCharAt()
5245 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceStringPrototypeCharAt()
5249 Node* masked_index = graph()->NewNode(simplified()->PoisonIndex(), index); in ReduceStringPrototypeCharAt()
5251 graph()->NewNode(simplified()->StringCharCodeAt(), receiver, masked_index, in ReduceStringPrototypeCharAt()
5253 value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value); in ReduceStringPrototypeCharAt()
5271 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeToLowerCaseIntl()
5278 NodeProperties::ChangeOp(node, simplified()->StringToLowerCaseIntl()); in ReduceStringPrototypeToLowerCaseIntl()
5293 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeToUpperCaseIntl()
5300 NodeProperties::ChangeOp(node, simplified()->StringToUpperCaseIntl()); in ReduceStringPrototypeToUpperCaseIntl()
5320 simplified()->SpeculativeToNumber(NumberOperationHint::kNumberOrOddball, in ReduceStringFromCharCode()
5325 graph()->NewNode(simplified()->StringFromSingleCharCode(), input); in ReduceStringFromCharCode()
5344 input = effect = graph()->NewNode(simplified()->CheckSmi(p.feedback()), in ReduceStringFromCodePoint()
5348 graph()->NewNode(simplified()->CheckBounds(p.feedback()), input, in ReduceStringFromCodePoint()
5352 simplified()->StringFromSingleCodePoint(UnicodeEncoding::UTF32), input); in ReduceStringFromCodePoint()
5367 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeIterator()
5384 simplified()->LoadField(AccessBuilder::ForJSStringIteratorString()), in ReduceStringIteratorPrototypeNext()
5387 simplified()->LoadField(AccessBuilder::ForJSStringIteratorIndex()), in ReduceStringIteratorPrototypeNext()
5389 Node* length = graph()->NewNode(simplified()->StringLength(), string); in ReduceStringIteratorPrototypeNext()
5393 graph()->NewNode(simplified()->NumberLessThan(), index, length); in ReduceStringIteratorPrototypeNext()
5404 simplified()->StringCodePointAt(UnicodeEncoding::UTF16), string, in ReduceStringIteratorPrototypeNext()
5407 simplified()->StringFromSingleCodePoint(UnicodeEncoding::UTF16), in ReduceStringIteratorPrototypeNext()
5412 graph()->NewNode(simplified()->StringLength(), vtrue0); in ReduceStringIteratorPrototypeNext()
5413 index = graph()->NewNode(simplified()->NumberAdd(), index, char_length); in ReduceStringIteratorPrototypeNext()
5415 simplified()->StoreField(AccessBuilder::ForJSStringIteratorIndex()), in ReduceStringIteratorPrototypeNext()
5459 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeConcat()
5467 graph()->NewNode(simplified()->CheckString(p.feedback()), in ReduceStringPrototypeConcat()
5621 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromiseConstructor()
5625 simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromiseConstructor()
5629 simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromiseConstructor()
5828 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeCatch()
5909 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeFinally()
5916 Node* check = graph()->NewNode(simplified()->ObjectIsCallable(), on_finally); in ReducePromisePrototypeFinally()
5938 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromisePrototypeFinally()
5942 graph()->NewNode(simplified()->StoreField(AccessBuilder::ForContextSlot( in ReducePromisePrototypeFinally()
5982 effect = graph()->NewNode(simplified()->MapGuard(receiver_maps), receiver, in ReducePromisePrototypeFinally()
6062 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReducePromisePrototypeThen()
6070 graph()->NewNode(simplified()->ObjectIsCallable(), on_fulfilled), in ReducePromisePrototypeThen()
6076 graph()->NewNode(simplified()->ObjectIsCallable(), on_rejected), in ReducePromisePrototypeThen()
6181 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceTypedArrayPrototypeToStringTag()
6191 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceTypedArrayPrototypeToStringTag()
6194 simplified()->LoadField(AccessBuilder::ForMapBitField2()), receiver_map, in ReduceTypedArrayPrototypeToStringTag()
6197 simplified()->NumberShiftRightLogical(), in ReduceTypedArrayPrototypeToStringTag()
6198 graph()->NewNode(simplified()->NumberBitwiseAnd(), receiver_bit_field2, in ReduceTypedArrayPrototypeToStringTag()
6206 simplified()->NumberSubtract(), receiver_elements_kind, in ReduceTypedArrayPrototypeToStringTag()
6212 simplified()->NumberEqual(), receiver_elements_kind, \ in ReduceTypedArrayPrototypeToStringTag()
6250 Node* value = graph()->NewNode(simplified()->ObjectIsFiniteNumber(), input); in ReduceNumberIsFinite()
6263 Node* value = graph()->NewNode(simplified()->ObjectIsInteger(), input); in ReduceNumberIsInteger()
6276 Node* value = graph()->NewNode(simplified()->ObjectIsSafeInteger(), input); in ReduceNumberIsSafeInteger()
6289 Node* value = graph()->NewNode(simplified()->ObjectIsNaN(), input); in ReduceNumberIsNaN()
6307 simplified()->LoadField(AccessBuilder::ForJSCollectionTable()), receiver, in ReduceMapPrototypeGet()
6311 simplified()->FindOrderedHashMapEntry(), table, key, effect, control); in ReduceMapPrototypeGet()
6313 Node* check = graph()->NewNode(simplified()->NumberEqual(), entry, in ReduceMapPrototypeGet()
6327 simplified()->LoadElement(AccessBuilder::ForOrderedHashMapEntryValue()), in ReduceMapPrototypeGet()
6352 simplified()->LoadField(AccessBuilder::ForJSCollectionTable()), receiver, in ReduceMapPrototypeHas()
6356 simplified()->FindOrderedHashMapEntry(), table, key, effect, control); in ReduceMapPrototypeHas()
6358 Node* value = graph()->NewNode(simplified()->NumberEqual(), index, in ReduceMapPrototypeHas()
6360 value = graph()->NewNode(simplified()->BooleanNot(), value); in ReduceMapPrototypeHas()
6409 simplified()->LoadField(AccessBuilder::ForJSCollectionTable()), in ReduceCollectionPrototypeSize()
6412 simplified()->LoadField( in ReduceCollectionPrototypeSize()
6476 simplified()->LoadField(AccessBuilder::ForJSCollectionIteratorTable()), in ReduceCollectionIteratorPrototypeNext()
6479 graph()->NewNode(simplified()->LoadField( in ReduceCollectionIteratorPrototypeNext()
6482 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), next_table); in ReduceCollectionIteratorPrototypeNext()
6495 simplified()->LoadField(AccessBuilder::ForJSCollectionIteratorIndex()), in ReduceCollectionIteratorPrototypeNext()
6513 simplified()->StoreField(AccessBuilder::ForJSCollectionIteratorIndex()), in ReduceCollectionIteratorPrototypeNext()
6516 simplified()->StoreField(AccessBuilder::ForJSCollectionIteratorTable()), in ReduceCollectionIteratorPrototypeNext()
6529 simplified()->LoadField(AccessBuilder::ForJSCollectionIteratorIndex()), in ReduceCollectionIteratorPrototypeNext()
6532 simplified()->LoadField(AccessBuilder::ForJSCollectionIteratorTable()), in ReduceCollectionIteratorPrototypeNext()
6547 simplified()->LoadField( in ReduceCollectionIteratorPrototypeNext()
6551 simplified()->LoadField( in ReduceCollectionIteratorPrototypeNext()
6555 simplified()->LoadField( in ReduceCollectionIteratorPrototypeNext()
6559 graph()->NewNode(simplified()->NumberAdd(), number_of_elements, in ReduceCollectionIteratorPrototypeNext()
6575 Node* check0 = graph()->NewNode(simplified()->NumberLessThan(), index, in ReduceCollectionIteratorPrototypeNext()
6585 simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6599 simplified()->NumberAdd(), in ReduceCollectionIteratorPrototypeNext()
6601 simplified()->NumberAdd(), in ReduceCollectionIteratorPrototypeNext()
6602 graph()->NewNode(simplified()->NumberMultiply(), index, in ReduceCollectionIteratorPrototypeNext()
6607 simplified()->LoadElement(AccessBuilder::ForFixedArrayElement()), in ReduceCollectionIteratorPrototypeNext()
6611 index = graph()->NewNode(simplified()->NumberAdd(), index, in ReduceCollectionIteratorPrototypeNext()
6615 graph()->NewNode(simplified()->ReferenceEqual(), entry_key, in ReduceCollectionIteratorPrototypeNext()
6631 simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6649 simplified()->LoadElement( in ReduceCollectionIteratorPrototypeNext()
6653 simplified()->NumberAdd(), entry_start_position, in ReduceCollectionIteratorPrototypeNext()
6660 simplified()->LoadElement( in ReduceCollectionIteratorPrototypeNext()
6664 simplified()->NumberAdd(), entry_start_position, in ReduceCollectionIteratorPrototypeNext()
6679 graph()->NewNode(simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6683 graph()->NewNode(simplified()->StoreField( in ReduceCollectionIteratorPrototypeNext()
6714 NodeProperties::ChangeOp(node, simplified()->ObjectIsArrayBufferView()); in ReduceArrayBufferIsView()
6726 Node* value = effect = graph()->NewNode(simplified()->LoadField(access), in ReduceArrayBufferViewAccessor()
6738 simplified()->LoadField(AccessBuilder::ForJSArrayBufferViewBuffer()), in ReduceArrayBufferViewAccessor()
6741 simplified()->ArrayBufferWasNeutered(), buffer, effect, control); in ReduceArrayBufferViewAccessor()
6813 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeGet()
6819 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeGet()
6823 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeGet()
6827 simplified()->CheckSmi(p.feedback()), byte_length, effect, control); in ReduceDataViewPrototypeGet()
6831 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeGet()
6838 graph()->NewNode(simplified()->NumberAdd(), offset, in ReduceDataViewPrototypeGet()
6840 effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceDataViewPrototypeGet()
6846 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeGet()
6850 simplified()->CheckSmi(p.feedback()), byte_offset, effect, control); in ReduceDataViewPrototypeGet()
6853 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeGet()
6858 graph()->NewNode(simplified()->ToBoolean(), is_little_endian); in ReduceDataViewPrototypeGet()
6862 simplified()->LoadField(AccessBuilder::ForJSArrayBufferViewBuffer()), in ReduceDataViewPrototypeGet()
6873 simplified()->ArrayBufferWasNeutered(), buffer, effect, control); in ReduceDataViewPrototypeGet()
6875 graph()->NewNode(simplified()->BooleanNot(), check_neutered); in ReduceDataViewPrototypeGet()
6877 simplified()->CheckIf(DeoptimizeReason::kArrayBufferWasNeutered, in ReduceDataViewPrototypeGet()
6884 simplified()->LoadField(AccessBuilder::ForJSArrayBufferBackingStore()), in ReduceDataViewPrototypeGet()
6889 simplified()->LoadDataViewElement(element_type), buffer, backing_store, in ReduceDataViewPrototypeGet()
6947 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeSet()
6953 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeSet()
6957 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeSet()
6961 simplified()->CheckSmi(p.feedback()), byte_length, effect, control); in ReduceDataViewPrototypeSet()
6965 graph()->NewNode(simplified()->CheckBounds(p.feedback()), offset, in ReduceDataViewPrototypeSet()
6972 graph()->NewNode(simplified()->NumberAdd(), offset, in ReduceDataViewPrototypeSet()
6974 effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()), in ReduceDataViewPrototypeSet()
6980 graph()->NewNode(simplified()->LoadField( in ReduceDataViewPrototypeSet()
6984 simplified()->CheckSmi(p.feedback()), byte_offset, effect, control); in ReduceDataViewPrototypeSet()
6987 offset = graph()->NewNode(simplified()->NumberAdd(), offset, byte_offset); in ReduceDataViewPrototypeSet()
6992 graph()->NewNode(simplified()->ToBoolean(), is_little_endian); in ReduceDataViewPrototypeSet()
6996 simplified()->SpeculativeToNumber(NumberOperationHint::kNumberOrOddball, in ReduceDataViewPrototypeSet()
7002 simplified()->LoadField(AccessBuilder::ForJSArrayBufferViewBuffer()), in ReduceDataViewPrototypeSet()
7013 simplified()->ArrayBufferWasNeutered(), buffer, effect, control); in ReduceDataViewPrototypeSet()
7015 graph()->NewNode(simplified()->BooleanNot(), check_neutered); in ReduceDataViewPrototypeSet()
7017 simplified()->CheckIf(DeoptimizeReason::kArrayBufferWasNeutered, in ReduceDataViewPrototypeSet()
7024 simplified()->LoadField(AccessBuilder::ForJSArrayBufferBackingStore()), in ReduceDataViewPrototypeSet()
7028 effect = graph()->NewNode(simplified()->StoreDataViewElement(element_type), in ReduceDataViewPrototypeSet()
7059 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceGlobalIsFinite()
7062 Node* value = graph()->NewNode(simplified()->NumberIsFinite(), input); in ReduceGlobalIsFinite()
7084 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceGlobalIsNaN()
7087 Node* value = graph()->NewNode(simplified()->NumberIsNaN(), input); in ReduceGlobalIsNaN()
7100 simplified()->LoadField(AccessBuilder::ForJSDateValue()), receiver, in ReduceDatePrototypeGetTime()
7113 graph()->NewNode(simplified()->DateNow(), effect, control); in ReduceDateNow()
7205 graph()->NewNode(simplified()->CheckMaps(CheckMapsFlag::kNone, in ReduceRegExpPrototypeTest()
7214 simplified()->CheckString(p.feedback()), search, effect, control); in ReduceRegExpPrototypeTest()
7217 simplified()->LoadField(AccessBuilder::ForJSRegExpLastIndex()), regexp, in ReduceRegExpPrototypeTest()
7221 simplified()->CheckSmi(p.feedback()), lastIndex, effect, control); in ReduceRegExpPrototypeTest()
7223 Node* is_positive = graph()->NewNode(simplified()->NumberLessThanOrEqual(), in ReduceRegExpPrototypeTest()
7227 simplified()->CheckIf(DeoptimizeReason::kNotASmi, p.feedback()), in ReduceRegExpPrototypeTest()
7299 SimplifiedOperatorBuilder* JSCallReducer::simplified() const { in simplified() function in v8::internal::compiler::JSCallReducer
7300 return jsgraph()->simplified(); in simplified()