Home
last modified time | relevance | path

Searched refs:NumberLessThanOrEqual (Results 1 - 8 of 8) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dtyped-optimization.cc423 return simplified()->NumberLessThanOrEqual(); in NumberComparisonFor()
501 comparison_op = simplified()->NumberLessThanOrEqual(); in TryReduceStringComparisonOfStringFromSingleCharCode()
765 return simplified->NumberLessThanOrEqual(); in NumberOpFromSpeculativeNumberOp()
H A Dgraph-assembler.cc325 TNode<Boolean> JSGraphAssembler::NumberLessThanOrEqual(TNode<Number> lhs, in NumberLessThanOrEqual() function in v8::internal::compiler::JSGraphAssembler
328 graph()->NewNode(simplified()->NumberLessThanOrEqual(), lhs, rhs)); in NumberLessThanOrEqual()
H A Djs-typed-lowering.cc614 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length, in ReduceJSAdd()
758 less_than_or_equal = simplified()->NumberLessThanOrEqual(); in ReduceJSComparison()
763 less_than_or_equal = simplified()->NumberLessThanOrEqual(); in ReduceJSComparison()
1236 simplified()->NumberLessThanOrEqual(), value_instance_type, in ReduceJSHasInPrototypeChain()
H A Dsimplified-operator.h732 const Operator* NumberLessThanOrEqual();
H A Dgraph-assembler.h858 TNode<Boolean> NumberLessThanOrEqual(TNode<Number> lhs, TNode<Number> rhs);
H A Dopcodes.h305 V(NumberLessThanOrEqual) \
H A Dsimplified-operator.cc680 V(NumberLessThanOrEqual, Operator::kNoProperties, 2, 0) \
H A Djs-call-reducer.cc1510 cond = [&](TNode<Number> i) { return NumberLessThanOrEqual(zero, i); };
5895 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length,
8145 Node* is_positive = graph()->NewNode(simplified()->NumberLessThanOrEqual(),

Completed in 28 milliseconds