| /third_party/node/deps/v8/src/compiler/ |
| H A D | js-typed-lowering.cc | 797 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
801 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
807 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
810 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
827 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
836 return r.ChangeToPureOperator(simplified()->ReferenceEqual()); in ReduceJSEqual()
846 // else ReferenceEqual(left, right) in ReduceJSEqual()
857 __ GotoIf(__ ReferenceEqual(lhs, __ UndefinedConstant()), in ReduceJSEqual()
859 __ GotoIf(__ ReferenceEqual(lhs, __ NullConstant()), &check_undetectable, in ReduceJSEqual()
861 __ GotoIf(__ ReferenceEqual(rh in ReduceJSEqual()
[all...] |
| H A D | property-access-builder.cc | 118 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected); in BuildCheckValue()
254 graph()->NewNode(simplified()->ReferenceEqual(), map, in BuildLoadDataField()
|
| H A D | graph-assembler.cc | 139 ReferenceEqual(value, Name##Constant())); \
286 TNode<Boolean> JSGraphAssembler::ReferenceEqual(TNode<Object> lhs, in ReferenceEqual() function in v8::internal::compiler::JSGraphAssembler
289 graph()->NewNode(simplified()->ReferenceEqual(), lhs, rhs)); in ReferenceEqual()
|
| H A D | bytecode-graph-builder.cc | 1726 NewNode(simplified()->ReferenceEqual(), extension_slot, in CheckContextExtensionAtDepth()
2814 Node* check_for_hole = NewNode(simplified()->ReferenceEqual(), accumulator, in VisitThrowReferenceErrorIfHole()
2823 Node* check_for_hole = NewNode(simplified()->ReferenceEqual(), accumulator, in VisitThrowSuperNotCalledIfHole()
2830 Node* check_for_hole = NewNode(simplified()->ReferenceEqual(), accumulator, in VisitThrowSuperAlreadyCalledIfNotHole()
3259 Node* result = NewNode(simplified()->ReferenceEqual(), left, right); in VisitTestReferenceEqual()
3293 Node* result = NewNode(simplified()->ReferenceEqual(), object, in VisitTestNull()
3300 Node* result = NewNode(simplified()->ReferenceEqual(), object, in VisitTestUndefined()
3325 NewNode(simplified()->ReferenceEqual(), object, in VisitTestTypeOf()
3328 NewNode(simplified()->ReferenceEqual(), object, in VisitTestTypeOf()
3334 graph()->NewNode(simplified()->ReferenceEqual(), objec in VisitTestTypeOf()
[all...] |
| H A D | typed-optimization.cc | 592 // SameValue(x:unique,y:unique) => ReferenceEqual(x,y) in ReduceSameValue()
593 NodeProperties::ChangeOp(node, simplified()->ReferenceEqual()); in ReduceSameValue()
724 // => BooleanNot(ReferenceEqual(x,#null)) in ReduceToBoolean()
725 node->ReplaceInput(0, graph()->NewNode(simplified()->ReferenceEqual(), in ReduceToBoolean()
739 // ToBoolean(x:string) => BooleanNot(ReferenceEqual(x,"")) in ReduceToBoolean()
741 graph()->NewNode(simplified()->ReferenceEqual(), input, in ReduceToBoolean()
|
| H A D | js-inlining-heuristic.cc | 672 graph()->NewNode(simplified()->ReferenceEqual(), callee, target); in CreateOrReuseDispatch()
|
| H A D | js-native-context-specialization.cc | 915 graph()->NewNode(simplified()->ReferenceEqual(), value, in ReduceGlobalAccess()
1897 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), in ReduceElementLoadFromHeapConstant()
2070 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver_map, in ReduceJSLoadPropertyWithEnumeratedKey()
2091 graph()->NewNode(simplified()->ReferenceEqual(), enum_indices, in ReduceJSLoadPropertyWithEnumeratedKey()
3105 vtrue = graph()->NewNode(simplified()->ReferenceEqual(), element, in BuildElementAccess()
|
| H A D | js-call-reducer.cc | 2623 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list,
2632 graph()->NewNode(simplified()->ReferenceEqual(), arguments_list,
3011 Node* check = graph()->NewNode(simplified()->ReferenceEqual(),
4494 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target,
5041 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), target,
5062 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), new_target,
5187 graph()->NewNode(simplified()->ReferenceEqual(),
5230 graph()->NewNode(simplified()->ReferenceEqual(),
5366 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), end,
7670 graph()->NewNode(simplified()->ReferenceEqual(), entry_ke
[all...] |
| H A D | escape-analysis.cc | 556 jsgraph->simplified()->ReferenceEqual(), checked_map, map_node); in LowerCompareMapsWithoutLoad()
|
| H A D | simplified-operator.h | 817 const Operator* ReferenceEqual();
|
| H A D | graph-assembler.h | 852 TNode<Boolean> ReferenceEqual(TNode<Object> lhs, TNode<Object> rhs);
|
| H A D | opcodes.h | 309 V(ReferenceEqual) \
|
| H A D | simplified-operator.cc | 793 V(ReferenceEqual, Operator::kCommutative, 2, 0) \
|
| /third_party/node/deps/v8/src/runtime/ |
| H A D | runtime.h | 376 F(ReferenceEqual, 2, 1)
|