Home
last modified time | relevance | path

Searched refs:BooleanNot (Results 1 – 8 of 8) sorted by relevance

/external/v8/src/compiler/
Dsimplified-operator-reducer-unittest.cc143 {&SimplifiedOperatorBuilder::BooleanNot, "BooleanNot"},
182 graph()->NewNode(simplified()->BooleanNot(), in TEST_F()
183 graph()->NewNode(simplified()->BooleanNot(), param0))); in TEST_F()
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); in TEST_F()
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); in TEST_F()
Dsimplified-operator.h100 const Operator* BooleanNot();
Djs-typed-lowering.cc103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToPureOperator()
520 Node* inv = graph()->NewNode(simplified()->BooleanNot(), cmp); in ReduceJSToBooleanInput()
674 graph()->NewNode(simplified()->BooleanNot(), result.replacement()); in Reduce()
679 value = graph()->NewNode(simplified()->BooleanNot(), node); in Reduce()
Dsimplified-operator.cc99 V(BooleanNot, Operator::kNoProperties, 1) \
Dopcodes.h134 V(BooleanNot) \
Dsimplified-operator-unittest.cc47 PURE(BooleanNot, Operator::kNoProperties, 1),
/external/v8/test/cctest/compiler/
Dsimplified-graph-builder.h53 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } in BooleanNot() function
Dtest-simplified-lowering.cc764 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
779 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
796 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()
811 Node* inv = t.graph()->NewNode(t.simplified()->BooleanNot(), b); in TEST()