Searched refs:BooleanNot (Results 1 – 10 of 10) sorted by relevance
| /external/v8/test/unittests/compiler/ |
| D | simplified-operator-reducer-unittest.cc | 129 graph()->NewNode(simplified()->BooleanNot(), in TEST_F()
130 graph()->NewNode(simplified()->BooleanNot(), param0))); in TEST_F()
138 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); in TEST_F()
146 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); in TEST_F()
|
| D | simplified-operator-unittest.cc | 41 PURE(BooleanNot, Operator::kNoProperties, 1),
|
| D | common-operator-reducer-unittest.cc | 182 graph()->NewNode(simplified()->BooleanNot(), value), control); in TEST_F()
|
| D | node-test-utils.cc | 2089 IS_UNOP_MATCHER(BooleanNot)
|
| /external/v8/test/cctest/compiler/ |
| D | graph-builder-tester.h | 110 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } in BooleanNot() function
|
| D | test-simplified-lowering.cc | 815 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
830 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
847 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
862 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
|
| /external/v8/src/compiler/ |
| D | simplified-operator.h | 132 const Operator* BooleanNot();
|
| D | simplified-operator.cc | 161 V(BooleanNot, Operator::kNoProperties, 1) \
|
| D | opcodes.h | 172 V(BooleanNot) \
|
| D | js-typed-lowering.cc | 182 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToPureOperator()
208 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToStringComparisonOperator()
656 Node* value = graph()->NewNode(simplified()->BooleanNot(), node); in ReduceJSEqual()
743 NodeProperties::ChangeOp(node, simplified()->BooleanNot()); in ReduceJSToBoolean()
2545 NodeProperties::ChangeOp(node, simplified()->BooleanNot()); in ReduceSelect()
|