2014-10-20 11:26:23 +00:00
|
|
|
// Copyright 2014 the V8 project authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
|
|
|
|
|
|
|
#ifndef V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_
|
|
|
|
#define V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_
|
|
|
|
|
2018-03-02 10:54:30 +00:00
|
|
|
#include "src/compiler/common-operator.h"
|
2014-10-20 11:26:23 +00:00
|
|
|
#include "src/compiler/machine-operator.h"
|
2018-09-20 11:15:25 +00:00
|
|
|
#include "src/compiler/opcodes.h"
|
2016-08-08 06:07:21 +00:00
|
|
|
#include "src/compiler/simplified-operator.h"
|
2015-12-03 13:33:14 +00:00
|
|
|
#include "src/machine-type.h"
|
2014-10-20 11:26:23 +00:00
|
|
|
#include "testing/gmock/include/gmock/gmock.h"
|
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
// Forward declarations.
|
|
|
|
class ExternalReference;
|
2015-08-31 08:24:52 +00:00
|
|
|
template <typename T>
|
|
|
|
class Handle;
|
2014-10-20 11:26:23 +00:00
|
|
|
class HeapObject;
|
2016-02-02 07:25:30 +00:00
|
|
|
class Type;
|
2015-11-17 15:06:41 +00:00
|
|
|
enum TypeofMode : int;
|
2014-10-20 11:26:23 +00:00
|
|
|
|
|
|
|
namespace compiler {
|
|
|
|
|
|
|
|
// Forward declarations.
|
2014-12-02 04:48:57 +00:00
|
|
|
class BufferAccess;
|
2014-10-20 11:26:23 +00:00
|
|
|
class CallDescriptor;
|
2015-06-02 09:37:49 +00:00
|
|
|
class ContextAccess;
|
2014-10-20 11:26:23 +00:00
|
|
|
struct ElementAccess;
|
|
|
|
struct FieldAccess;
|
|
|
|
class Node;
|
|
|
|
|
|
|
|
|
|
|
|
using ::testing::Matcher;
|
|
|
|
|
[turbofan] Proper dead code elimination as regular reducer.
The three different concerns that the ControlReducer used to deal with
are now properly separated into
a.) DeadCodeElimination, which is a regular AdvancedReducer, that
propagates Dead via control edges,
b.) CommonOperatorReducer, which does strength reduction on common
operators (i.e. Branch, Phi, and friends), and
c.) GraphTrimming, which removes dead->live edges from the graph.
This will make it possible to run the DeadCodeElimination together with
other passes that actually introduce Dead nodes, i.e. typed lowering;
and it opens the door for general inlining without two stage fix point
iteration.
To make the DeadCodeElimination easier and more uniform, we basically
reverted the introduction of DeadValue and DeadEffect, and changed the
Dead operator to produce control, value and effect. Note however that
this is not a requirement, but merely a way to make dead propagation
easier and more uniform. We could always go back and decide to have
different Dead operators if some other change requires that.
Note that there are several additional opportunities for cleanup now,
i.e. OSR deconstruction could be a regular reducer now, and we don't
need to use TheHole as dead value marker in the GraphReducer. And we can
actually run the dead code elimination together with the other passes
instead of using separate passes over the graph. We will do this in
follow up CLs.
R=jarin@chromium.org, mstarzinger@chromium.org
Review URL: https://codereview.chromium.org/1193833002
Cr-Commit-Position: refs/heads/master@{#29146}
2015-06-19 12:07:17 +00:00
|
|
|
Matcher<Node*> IsDead();
|
2015-05-26 10:31:55 +00:00
|
|
|
Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher);
|
|
|
|
Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher);
|
2015-06-26 08:20:53 +00:00
|
|
|
Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher,
|
|
|
|
const Matcher<Node*>& control2_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsBranch(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsMerge(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher);
|
2015-02-17 13:29:31 +00:00
|
|
|
Matcher<Node*> IsMerge(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher,
|
|
|
|
const Matcher<Node*>& control2_matcher);
|
2015-01-20 09:45:02 +00:00
|
|
|
Matcher<Node*> IsLoop(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher);
|
|
|
|
Matcher<Node*> IsLoop(const Matcher<Node*>& control0_matcher,
|
|
|
|
const Matcher<Node*>& control1_matcher,
|
|
|
|
const Matcher<Node*>& control2_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsIfTrue(const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsIfFalse(const Matcher<Node*>& control_matcher);
|
2015-03-03 06:11:37 +00:00
|
|
|
Matcher<Node*> IsIfSuccess(const Matcher<Node*>& control_matcher);
|
2015-02-17 13:29:31 +00:00
|
|
|
Matcher<Node*> IsSwitch(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2018-03-02 10:54:30 +00:00
|
|
|
Matcher<Node*> IsIfValue(const Matcher<IfValueParameters>& value_matcher,
|
2015-02-17 13:29:31 +00:00
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsIfDefault(const Matcher<Node*>& control_matcher);
|
2015-10-14 14:53:04 +00:00
|
|
|
Matcher<Node*> IsBeginRegion(const Matcher<Node*>& effect_matcher);
|
|
|
|
Matcher<Node*> IsFinishRegion(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher);
|
2015-01-20 09:45:02 +00:00
|
|
|
Matcher<Node*> IsReturn(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2016-02-23 15:33:06 +00:00
|
|
|
Matcher<Node*> IsReturn2(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-05-06 12:51:41 +00:00
|
|
|
Matcher<Node*> IsTerminate(const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2016-08-31 05:48:05 +00:00
|
|
|
Matcher<Node*> IsTypeGuard(const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsExternalConstant(
|
|
|
|
const Matcher<ExternalReference>& value_matcher);
|
2015-08-31 08:24:52 +00:00
|
|
|
Matcher<Node*> IsHeapConstant(Handle<HeapObject> value);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsFloat32Constant(const Matcher<float>& value_matcher);
|
|
|
|
Matcher<Node*> IsFloat64Constant(const Matcher<double>& value_matcher);
|
|
|
|
Matcher<Node*> IsInt32Constant(const Matcher<int32_t>& value_matcher);
|
|
|
|
Matcher<Node*> IsInt64Constant(const Matcher<int64_t>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberConstant(const Matcher<double>& value_matcher);
|
2016-11-11 13:04:08 +00:00
|
|
|
Matcher<Node*> IsPointerConstant(const Matcher<intptr_t>& value_matcher);
|
2015-12-10 09:03:30 +00:00
|
|
|
Matcher<Node*> IsSelect(const Matcher<MachineRepresentation>& type_matcher,
|
2014-10-29 14:16:32 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher);
|
2015-12-10 09:03:30 +00:00
|
|
|
Matcher<Node*> IsPhi(const Matcher<MachineRepresentation>& type_matcher,
|
2014-10-20 11:26:23 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& merge_matcher);
|
2015-12-10 09:03:30 +00:00
|
|
|
Matcher<Node*> IsPhi(const Matcher<MachineRepresentation>& type_matcher,
|
2015-01-20 09:45:02 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& merge_matcher);
|
2014-11-04 14:37:22 +00:00
|
|
|
Matcher<Node*> IsEffectPhi(const Matcher<Node*>& effect0_matcher,
|
|
|
|
const Matcher<Node*>& effect1_matcher,
|
|
|
|
const Matcher<Node*>& merge_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsProjection(const Matcher<size_t>& index_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher);
|
2015-11-17 12:18:25 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-09-02 04:55:07 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2014-11-04 12:58:17 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-09-02 04:55:07 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2015-08-25 11:31:09 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-09-02 04:55:07 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2015-08-25 11:31:09 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-09-02 04:55:07 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2014-10-20 11:26:23 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& value3_matcher,
|
2015-04-23 09:04:37 +00:00
|
|
|
const Matcher<Node*>& value4_matcher,
|
2014-10-20 11:26:23 +00:00
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-09-02 04:55:07 +00:00
|
|
|
Matcher<Node*> IsCall(const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2015-04-23 09:04:37 +00:00
|
|
|
const Matcher<Node*>& value0_matcher,
|
|
|
|
const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher,
|
|
|
|
const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher,
|
|
|
|
const Matcher<Node*>& value5_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsCall(
|
2015-09-02 04:55:07 +00:00
|
|
|
const Matcher<const CallDescriptor*>& descriptor_matcher,
|
2015-04-23 09:04:37 +00:00
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher, const Matcher<Node*>& value5_matcher,
|
|
|
|
const Matcher<Node*>& value6_matcher, const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-05-05 09:42:59 +00:00
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-07-23 14:21:26 +00:00
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-07-30 08:18:23 +00:00
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-08-18 12:41:41 +00:00
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher, const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher, const Matcher<Node*>& value5_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-08-24 10:25:34 +00:00
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher, const Matcher<Node*>& value5_matcher,
|
|
|
|
const Matcher<Node*>& value6_matcher, const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsTailCall(
|
|
|
|
const Matcher<CallDescriptor const*>& descriptor_matcher,
|
|
|
|
const Matcher<Node*>& value0_matcher, const Matcher<Node*>& value1_matcher,
|
|
|
|
const Matcher<Node*>& value2_matcher, const Matcher<Node*>& value3_matcher,
|
|
|
|
const Matcher<Node*>& value4_matcher, const Matcher<Node*>& value5_matcher,
|
|
|
|
const Matcher<Node*>& value6_matcher, const Matcher<Node*>& value7_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-08-18 12:41:41 +00:00
|
|
|
|
2014-10-20 11:26:23 +00:00
|
|
|
|
2014-10-28 08:33:52 +00:00
|
|
|
Matcher<Node*> IsBooleanNot(const Matcher<Node*>& value_matcher);
|
2016-11-24 06:36:46 +00:00
|
|
|
Matcher<Node*> IsReferenceEqual(const Matcher<Node*>& lhs_matcher,
|
2015-05-27 04:23:29 +00:00
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-28 08:33:52 +00:00
|
|
|
Matcher<Node*> IsNumberEqual(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsNumberLessThan(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-06-02 09:20:50 +00:00
|
|
|
Matcher<Node*> IsNumberAdd(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-08-02 13:41:48 +00:00
|
|
|
|
2016-08-08 06:07:21 +00:00
|
|
|
#define DECLARE_SPECULATIVE_BINOP_MATCHER(opcode) \
|
|
|
|
Matcher<Node*> Is##opcode(const Matcher<NumberOperationHint>& hint_matcher, \
|
|
|
|
const Matcher<Node*>& lhs_matcher, \
|
|
|
|
const Matcher<Node*>& rhs_matcher, \
|
|
|
|
const Matcher<Node*>& effect_matcher, \
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2019-02-13 00:33:17 +00:00
|
|
|
SIMPLIFIED_SPECULATIVE_NUMBER_BINOP_LIST(DECLARE_SPECULATIVE_BINOP_MATCHER)
|
[turbofan] Eliminate redundant Smi checks around array accesses.
As identified in the web-tooling-benchmark, there are specific code
patterns involving array indexed property accesses and subsequent
comparisons of those indices that lead to repeated Smi checks in the
optimized code, which in turn leads to high register pressure and
generally bad register allocation. An example of this pattern is
code like this:
```js
function f(a, n) {
const i = a[n];
if (n >= 1) return i;
}
```
The `a[n]` property access introduces a CheckBounds on `n`, which
later lowers to a `CheckedTaggedToInt32[dont-check-minus-zero]`,
however the `n >= 1` comparison has collected `SignedSmall` feedback
and so it introduces a `CheckedTaggedToTaggedSigned` operation. This
second Smi check is redundant and cannot easily be combined with the
earlier tagged->int32 conversion, since that also deals with heap
numbers and even truncates -0 to 0.
So we teach the RedundancyElimination to look at the inputs of these
speculative number comparisons and if there's a leading bounds check
on either of these inputs, we change the input to the result of the
bounds check. This avoids the redundant Smi checks later and generally
allows the SimplifiedLowering to do a significantly better job on the
number comparisons. We only do this in case of SignedSmall feedback
and only for inputs that are not already known to be in UnsignedSmall
range, to avoid doing too many (unnecessary) expensive lookups during
RedundancyElimination.
All of this is safe despite the fact that CheckBounds truncates -0
to 0, since the regular number comparisons in JavaScript identify
0 and -0 (unlike Object.is()). This also adds appropriate tests,
especially for the interesting cases where -0 is used only after
the code was optimized.
Bug: v8:6936, v8:7094
Change-Id: Ie37114fb6192e941ae1a4f0bfe00e9c0a8305c07
Reviewed-on: https://chromium-review.googlesource.com/c/1246181
Reviewed-by: Sigurd Schneider <sigurds@chromium.org>
Commit-Queue: Benedikt Meurer <bmeurer@chromium.org>
Cr-Commit-Position: refs/heads/master@{#56428}
2018-09-26 14:47:25 +00:00
|
|
|
DECLARE_SPECULATIVE_BINOP_MATCHER(SpeculativeNumberEqual)
|
|
|
|
DECLARE_SPECULATIVE_BINOP_MATCHER(SpeculativeNumberLessThan)
|
|
|
|
DECLARE_SPECULATIVE_BINOP_MATCHER(SpeculativeNumberLessThanOrEqual)
|
2016-08-02 13:41:48 +00:00
|
|
|
#undef DECLARE_SPECULATIVE_BINOP_MATCHER
|
|
|
|
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsNumberSubtract(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-29 14:16:32 +00:00
|
|
|
Matcher<Node*> IsNumberMultiply(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-07-03 11:41:54 +00:00
|
|
|
Matcher<Node*> IsNumberShiftLeft(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsNumberShiftRight(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsNumberShiftRightLogical(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-05-12 18:42:13 +00:00
|
|
|
Matcher<Node*> IsNumberImul(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-06-28 04:34:20 +00:00
|
|
|
Matcher<Node*> IsNumberAbs(const Matcher<Node*>& value_matcher);
|
[builtins] Unify most of the remaining Math builtins.
Import fdlibm versions of acos, acosh, asin and asinh, which are more
precise and produce the same result across platforms (we were using
libm versions for asin and acos so far, where both speed and precision
depended on the operating system so far). Introduce appropriate TurboFan
operators for these functions and use them both for inlining and for the
generic builtin.
Also migrate the Math.imul and Math.fround builtins to TurboFan builtins
to ensure that their behavior is always exactly the same as the inlined
TurboFan version (i.e. C++ truncation semantics for double to float
don't necessarily meet the JavaScript semantics).
For completeness, also migrate Math.sign, which can even get some nice
love in TurboFan.
Drive-by-fix: Some alpha-sorting on the Math related functions, and
cleanup the list of Math intrinsics that we have to export via the
native context currently.
BUG=v8:3266,v8:3496,v8:3509,v8:3952,v8:5169,v8:5170,v8:5171,v8:5172
TBR=rossberg@chromium.org
R=franzih@chromium.org
Review-Url: https://codereview.chromium.org/2116753002
Cr-Commit-Position: refs/heads/master@{#37476}
2016-07-01 11:11:33 +00:00
|
|
|
Matcher<Node*> IsNumberAcos(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberAcosh(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberAsin(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberAsinh(const Matcher<Node*>& value_matcher);
|
2016-06-13 07:06:49 +00:00
|
|
|
Matcher<Node*> IsNumberAtan(const Matcher<Node*>& value_matcher);
|
[builtins] Unify most of the remaining Math builtins.
Import fdlibm versions of acos, acosh, asin and asinh, which are more
precise and produce the same result across platforms (we were using
libm versions for asin and acos so far, where both speed and precision
depended on the operating system so far). Introduce appropriate TurboFan
operators for these functions and use them both for inlining and for the
generic builtin.
Also migrate the Math.imul and Math.fround builtins to TurboFan builtins
to ensure that their behavior is always exactly the same as the inlined
TurboFan version (i.e. C++ truncation semantics for double to float
don't necessarily meet the JavaScript semantics).
For completeness, also migrate Math.sign, which can even get some nice
love in TurboFan.
Drive-by-fix: Some alpha-sorting on the Math related functions, and
cleanup the list of Math intrinsics that we have to export via the
native context currently.
BUG=v8:3266,v8:3496,v8:3509,v8:3952,v8:5169,v8:5170,v8:5171,v8:5172
TBR=rossberg@chromium.org
R=franzih@chromium.org
Review-Url: https://codereview.chromium.org/2116753002
Cr-Commit-Position: refs/heads/master@{#37476}
2016-07-01 11:11:33 +00:00
|
|
|
Matcher<Node*> IsNumberAtanh(const Matcher<Node*>& value_matcher);
|
2016-06-13 07:06:49 +00:00
|
|
|
Matcher<Node*> IsNumberAtan2(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-06-28 10:23:58 +00:00
|
|
|
Matcher<Node*> IsNumberCbrt(const Matcher<Node*>& value_matcher);
|
2016-06-15 05:43:36 +00:00
|
|
|
Matcher<Node*> IsNumberCeil(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberClz32(const Matcher<Node*>& value_matcher);
|
2016-06-17 15:21:48 +00:00
|
|
|
Matcher<Node*> IsNumberCos(const Matcher<Node*>& value_matcher);
|
2016-06-30 08:41:05 +00:00
|
|
|
Matcher<Node*> IsNumberCosh(const Matcher<Node*>& value_matcher);
|
2016-06-17 05:19:35 +00:00
|
|
|
Matcher<Node*> IsNumberExp(const Matcher<Node*>& value_matcher);
|
2016-06-17 09:13:22 +00:00
|
|
|
Matcher<Node*> IsNumberExpm1(const Matcher<Node*>& value_matcher);
|
2016-06-15 05:43:36 +00:00
|
|
|
Matcher<Node*> IsNumberFloor(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberFround(const Matcher<Node*>& value_matcher);
|
2016-06-13 05:46:38 +00:00
|
|
|
Matcher<Node*> IsNumberLog(const Matcher<Node*>& value_matcher);
|
|
|
|
Matcher<Node*> IsNumberLog1p(const Matcher<Node*>& value_matcher);
|
2016-06-16 11:22:32 +00:00
|
|
|
Matcher<Node*> IsNumberLog10(const Matcher<Node*>& value_matcher);
|
2016-06-28 10:23:58 +00:00
|
|
|
Matcher<Node*> IsNumberLog2(const Matcher<Node*>& value_matcher);
|
2016-07-22 08:22:05 +00:00
|
|
|
Matcher<Node*> IsNumberMax(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsNumberMin(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-06-15 05:43:36 +00:00
|
|
|
Matcher<Node*> IsNumberRound(const Matcher<Node*>& value_matcher);
|
2016-06-28 10:23:58 +00:00
|
|
|
Matcher<Node*> IsNumberPow(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
[builtins] Unify most of the remaining Math builtins.
Import fdlibm versions of acos, acosh, asin and asinh, which are more
precise and produce the same result across platforms (we were using
libm versions for asin and acos so far, where both speed and precision
depended on the operating system so far). Introduce appropriate TurboFan
operators for these functions and use them both for inlining and for the
generic builtin.
Also migrate the Math.imul and Math.fround builtins to TurboFan builtins
to ensure that their behavior is always exactly the same as the inlined
TurboFan version (i.e. C++ truncation semantics for double to float
don't necessarily meet the JavaScript semantics).
For completeness, also migrate Math.sign, which can even get some nice
love in TurboFan.
Drive-by-fix: Some alpha-sorting on the Math related functions, and
cleanup the list of Math intrinsics that we have to export via the
native context currently.
BUG=v8:3266,v8:3496,v8:3509,v8:3952,v8:5169,v8:5170,v8:5171,v8:5172
TBR=rossberg@chromium.org
R=franzih@chromium.org
Review-Url: https://codereview.chromium.org/2116753002
Cr-Commit-Position: refs/heads/master@{#37476}
2016-07-01 11:11:33 +00:00
|
|
|
Matcher<Node*> IsNumberSign(const Matcher<Node*>& value_matcher);
|
2016-06-17 15:21:48 +00:00
|
|
|
Matcher<Node*> IsNumberSin(const Matcher<Node*>& value_matcher);
|
2016-06-30 08:41:05 +00:00
|
|
|
Matcher<Node*> IsNumberSinh(const Matcher<Node*>& value_matcher);
|
2016-06-15 05:43:36 +00:00
|
|
|
Matcher<Node*> IsNumberSqrt(const Matcher<Node*>& value_matcher);
|
2016-06-20 05:51:37 +00:00
|
|
|
Matcher<Node*> IsNumberTan(const Matcher<Node*>& value_matcher);
|
2016-06-30 08:41:05 +00:00
|
|
|
Matcher<Node*> IsNumberTanh(const Matcher<Node*>& value_matcher);
|
2016-06-15 05:43:36 +00:00
|
|
|
Matcher<Node*> IsNumberTrunc(const Matcher<Node*>& value_matcher);
|
2018-09-07 12:06:06 +00:00
|
|
|
Matcher<Node*> IsStringConcat(const Matcher<Node*>& length_matcher,
|
|
|
|
const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2018-03-23 13:03:34 +00:00
|
|
|
Matcher<Node*> IsStringFromSingleCharCode(const Matcher<Node*>& value_matcher);
|
2017-11-30 06:10:35 +00:00
|
|
|
Matcher<Node*> IsStringLength(const Matcher<Node*>& value_matcher);
|
2015-05-04 12:07:12 +00:00
|
|
|
Matcher<Node*> IsAllocate(const Matcher<Node*>& size_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsLoadField(const Matcher<FieldAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
2014-10-28 08:33:52 +00:00
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-12-04 10:50:43 +00:00
|
|
|
Matcher<Node*> IsStoreField(const Matcher<FieldAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-12-02 04:48:57 +00:00
|
|
|
Matcher<Node*> IsLoadBuffer(const Matcher<BufferAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& buffer_matcher,
|
|
|
|
const Matcher<Node*>& offset_matcher,
|
|
|
|
const Matcher<Node*>& length_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
|
|
|
Matcher<Node*> IsStoreBuffer(const Matcher<BufferAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& buffer_matcher,
|
|
|
|
const Matcher<Node*>& offset_matcher,
|
|
|
|
const Matcher<Node*>& length_matcher,
|
|
|
|
const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsLoadElement(const Matcher<ElementAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
2014-12-02 04:48:57 +00:00
|
|
|
const Matcher<Node*>& control_matcher,
|
2014-10-28 13:00:11 +00:00
|
|
|
const Matcher<Node*>& effect_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsStoreElement(const Matcher<ElementAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2018-03-16 08:36:57 +00:00
|
|
|
|
|
|
|
Matcher<Node*> IsObjectIsFiniteNumber(const Matcher<Node*>& value_matcher);
|
2018-04-23 08:49:19 +00:00
|
|
|
Matcher<Node*> IsNumberIsFinite(const Matcher<Node*>& value_matcher);
|
2018-03-16 08:37:33 +00:00
|
|
|
Matcher<Node*> IsObjectIsInteger(const Matcher<Node*>& value_matcher);
|
2018-03-21 12:04:47 +00:00
|
|
|
Matcher<Node*> IsObjectIsSafeInteger(const Matcher<Node*>& value_matcher);
|
2017-03-03 09:08:14 +00:00
|
|
|
Matcher<Node*> IsObjectIsNaN(const Matcher<Node*>& value_matcher);
|
2018-04-23 08:49:19 +00:00
|
|
|
Matcher<Node*> IsNumberIsNaN(const Matcher<Node*>& value_matcher);
|
2016-02-02 11:42:38 +00:00
|
|
|
Matcher<Node*> IsObjectIsReceiver(const Matcher<Node*>& value_matcher);
|
2015-01-26 09:05:47 +00:00
|
|
|
Matcher<Node*> IsObjectIsSmi(const Matcher<Node*>& value_matcher);
|
2016-11-24 06:36:46 +00:00
|
|
|
Matcher<Node*> IsObjectIsUndetectable(const Matcher<Node*>& value_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
|
|
|
|
Matcher<Node*> IsLoad(const Matcher<LoadRepresentation>& rep_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2018-03-26 15:44:44 +00:00
|
|
|
Matcher<Node*> IsPoisonedLoad(const Matcher<LoadRepresentation>& rep_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2018-03-08 09:49:00 +00:00
|
|
|
Matcher<Node*> IsUnalignedLoad(const Matcher<LoadRepresentation>& rep_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsStore(const Matcher<StoreRepresentation>& rep_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& value_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2016-07-22 20:55:03 +00:00
|
|
|
Matcher<Node*> IsUnalignedStore(
|
|
|
|
const Matcher<UnalignedStoreRepresentation>& rep_matcher,
|
|
|
|
const Matcher<Node*>& base_matcher, const Matcher<Node*>& index_matcher,
|
|
|
|
const Matcher<Node*>& value_matcher, const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2017-05-16 12:27:56 +00:00
|
|
|
Matcher<Node*> IsStackSlot(const Matcher<StackSlotRepresentation>& rep_matcher);
|
2018-01-29 12:16:32 +00:00
|
|
|
Matcher<Node*> IsWord32Popcnt(const Matcher<Node*>& value_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsWord32And(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-10-01 17:22:58 +00:00
|
|
|
Matcher<Node*> IsWord32Or(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-02-24 09:51:30 +00:00
|
|
|
Matcher<Node*> IsWord32Xor(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsWord32Sar(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsWord32Shl(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsWord32Shr(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsWord32Ror(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsWord32Equal(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-03-20 08:37:20 +00:00
|
|
|
Matcher<Node*> IsWord32Clz(const Matcher<Node*>& value_matcher);
|
2016-03-16 12:14:44 +00:00
|
|
|
Matcher<Node*> IsWord32Ctz(const Matcher<Node*>& value_matcher);
|
2016-03-15 10:41:55 +00:00
|
|
|
Matcher<Node*> IsWord32Popcnt(const Matcher<Node*>& value_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsWord64And(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-10-01 17:22:58 +00:00
|
|
|
Matcher<Node*> IsWord64Or(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
Matcher<Node*> IsWord64Xor(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsWord64Shl(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
Matcher<Node*> IsWord64Shr(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsWord64Sar(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsWord64Equal(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsInt32AddWithOverflow(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-07-14 09:23:44 +00:00
|
|
|
Matcher<Node*> IsInt32SubWithOverflow(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsInt32Add(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsInt32Sub(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2018-10-18 12:53:22 +00:00
|
|
|
Matcher<Node*> IsInt32Div(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsInt32Mul(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsInt32MulHigh(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsInt32LessThan(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsUint32LessThan(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsUint32LessThanOrEqual(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-07-23 14:21:26 +00:00
|
|
|
Matcher<Node*> IsInt64Add(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-07-30 11:36:26 +00:00
|
|
|
Matcher<Node*> IsInt64Sub(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-12-12 14:52:30 +00:00
|
|
|
Matcher<Node*> IsInt64Mul(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2018-10-18 12:53:22 +00:00
|
|
|
Matcher<Node*> IsInt64Div(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-09-10 16:21:34 +00:00
|
|
|
Matcher<Node*> IsJSAdd(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2018-04-26 06:59:15 +00:00
|
|
|
Matcher<Node*> IsJSParseInt(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-09-27 10:26:09 +00:00
|
|
|
Matcher<Node*> IsBitcastTaggedToWord(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsBitcastWordToTagged(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsBitcastWordToTaggedSigned(const Matcher<Node*>& input_matcher);
|
2016-04-24 11:39:31 +00:00
|
|
|
Matcher<Node*> IsTruncateFloat64ToWord32(const Matcher<Node*>& input_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsChangeFloat64ToInt32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsChangeFloat64ToUint32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsChangeInt32ToFloat64(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsChangeInt32ToInt64(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsChangeUint32ToFloat64(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsChangeUint32ToUint64(const Matcher<Node*>& input_matcher);
|
2019-04-15 15:38:24 +00:00
|
|
|
Matcher<Node*> IsChangeCompressedToTagged(const Matcher<Node*>& input_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsTruncateFloat64ToFloat32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsTruncateInt64ToInt32(const Matcher<Node*>& input_matcher);
|
2015-04-08 11:54:53 +00:00
|
|
|
Matcher<Node*> IsFloat32Abs(const Matcher<Node*>& input_matcher);
|
2016-08-08 08:39:38 +00:00
|
|
|
Matcher<Node*> IsFloat32Neg(const Matcher<Node*>& input_matcher);
|
2015-07-13 05:23:40 +00:00
|
|
|
Matcher<Node*> IsFloat32Equal(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsFloat32LessThan(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsFloat32LessThanOrEqual(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-03-12 14:07:28 +00:00
|
|
|
Matcher<Node*> IsFloat64Max(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsFloat64Min(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-09-16 17:55:03 +00:00
|
|
|
Matcher<Node*> IsFloat64Add(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-11-06 06:13:10 +00:00
|
|
|
Matcher<Node*> IsFloat64Sub(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-09-16 17:55:03 +00:00
|
|
|
Matcher<Node*> IsFloat64Mul(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2015-04-08 11:54:53 +00:00
|
|
|
Matcher<Node*> IsFloat64Abs(const Matcher<Node*>& input_matcher);
|
2016-08-08 08:39:38 +00:00
|
|
|
Matcher<Node*> IsFloat64Neg(const Matcher<Node*>& input_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
Matcher<Node*> IsFloat64Sqrt(const Matcher<Node*>& input_matcher);
|
2015-03-10 08:42:47 +00:00
|
|
|
Matcher<Node*> IsFloat64RoundDown(const Matcher<Node*>& input_matcher);
|
Add floor, ceil, round (truncate) instructions for ia32, x64 (if SSE4.1) and
add floor, ceil, round (truncate and away from zero) for arm64.
R=bmeurer@chromium.org, dcarney@chromium.org, mstarzinger@chromium.org, rodolph.perfetta@arm.com
TEST=test/mjsunit/asm/math-floor.js,test/mjsunit/asm/math-ceil.js,test/unittest/compiler/js-builtin-reducer-unittest.cc
Review URL: https://codereview.chromium.org/677433002
Cr-Commit-Position: refs/heads/master@{#25018}
git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@25018 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2014-10-30 14:15:20 +00:00
|
|
|
Matcher<Node*> IsFloat64RoundTruncate(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsFloat64RoundTiesAway(const Matcher<Node*>& input_matcher);
|
2015-03-05 09:22:26 +00:00
|
|
|
Matcher<Node*> IsFloat64ExtractLowWord32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsFloat64ExtractHighWord32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsFloat64InsertLowWord32(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
Matcher<Node*> IsFloat64InsertHighWord32(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2014-11-25 08:40:18 +00:00
|
|
|
Matcher<Node*> IsToNumber(const Matcher<Node*>& base_matcher,
|
|
|
|
const Matcher<Node*>& context_matcher,
|
|
|
|
const Matcher<Node*>& effect_matcher,
|
|
|
|
const Matcher<Node*>& control_matcher);
|
2015-06-02 09:37:49 +00:00
|
|
|
Matcher<Node*> IsLoadContext(const Matcher<ContextAccess>& access_matcher,
|
|
|
|
const Matcher<Node*>& context_matcher);
|
2016-09-06 08:54:19 +00:00
|
|
|
Matcher<Node*> IsNumberToBoolean(const Matcher<Node*>& input_matcher);
|
2014-11-25 08:40:18 +00:00
|
|
|
Matcher<Node*> IsNumberToInt32(const Matcher<Node*>& input_matcher);
|
|
|
|
Matcher<Node*> IsNumberToUint32(const Matcher<Node*>& input_matcher);
|
2015-07-23 14:21:26 +00:00
|
|
|
Matcher<Node*> IsParameter(const Matcher<int> index_matcher);
|
2018-02-11 19:17:27 +00:00
|
|
|
Matcher<Node*> IsSpeculationPoison();
|
2015-07-23 14:21:26 +00:00
|
|
|
Matcher<Node*> IsLoadFramePointer();
|
2016-04-19 12:47:25 +00:00
|
|
|
Matcher<Node*> IsLoadParentFramePointer();
|
2016-06-10 07:41:45 +00:00
|
|
|
Matcher<Node*> IsPlainPrimitiveToNumber(const Matcher<Node*>& input_matcher);
|
2014-10-20 11:26:23 +00:00
|
|
|
|
2016-03-14 15:33:15 +00:00
|
|
|
Matcher<Node*> IsInt32PairAdd(const Matcher<Node*>& a_matcher,
|
|
|
|
const Matcher<Node*>& b_matcher,
|
|
|
|
const Matcher<Node*>& c_matcher,
|
|
|
|
const Matcher<Node*>& d_matcher);
|
2016-03-16 10:56:29 +00:00
|
|
|
Matcher<Node*> IsInt32PairSub(const Matcher<Node*>& a_matcher,
|
|
|
|
const Matcher<Node*>& b_matcher,
|
|
|
|
const Matcher<Node*>& c_matcher,
|
2016-03-30 10:39:04 +00:00
|
|
|
const Matcher<Node*>& d_matcher);
|
|
|
|
Matcher<Node*> IsInt32PairMul(const Matcher<Node*>& a_matcher,
|
|
|
|
const Matcher<Node*>& b_matcher,
|
|
|
|
const Matcher<Node*>& c_matcher,
|
2016-03-16 10:56:29 +00:00
|
|
|
const Matcher<Node*>& d_matcher);
|
|
|
|
|
2016-03-07 15:17:54 +00:00
|
|
|
Matcher<Node*> IsWord32PairShl(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& mid_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-03-09 16:37:29 +00:00
|
|
|
Matcher<Node*> IsWord32PairShr(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& mid_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
|
|
|
|
|
|
|
Matcher<Node*> IsWord32PairSar(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& mid_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher);
|
2016-07-29 19:31:54 +00:00
|
|
|
Matcher<Node*> IsWord32ReverseBytes(const Matcher<Node*>& value_matcher);
|
2016-03-07 15:17:54 +00:00
|
|
|
|
2016-03-15 12:45:43 +00:00
|
|
|
Matcher<Node*> IsStackSlot();
|
|
|
|
|
2018-02-21 11:38:35 +00:00
|
|
|
Matcher<Node*> IsSpeculativeToNumber(const Matcher<Node*>& value_matcher);
|
|
|
|
|
2017-09-11 13:44:42 +00:00
|
|
|
// Helpers
|
|
|
|
static inline Matcher<Node*> IsIntPtrConstant(const intptr_t value) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsInt64Constant(static_cast<int64_t>(value))
|
|
|
|
: IsInt32Constant(static_cast<int32_t>(value));
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsIntPtrAdd(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsInt64Add(lhs_matcher, rhs_matcher)
|
|
|
|
: IsInt32Add(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsIntPtrSub(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsInt64Sub(lhs_matcher, rhs_matcher)
|
|
|
|
: IsInt32Sub(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsIntPtrMul(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsInt64Mul(lhs_matcher, rhs_matcher)
|
|
|
|
: IsInt32Mul(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
2018-10-18 12:53:22 +00:00
|
|
|
static inline Matcher<Node*> IsIntPtrDiv(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsInt64Div(lhs_matcher, rhs_matcher)
|
|
|
|
: IsInt32Div(lhs_matcher, rhs_matcher);
|
2018-10-18 12:53:22 +00:00
|
|
|
}
|
|
|
|
|
2017-09-11 13:44:42 +00:00
|
|
|
static inline Matcher<Node*> IsWordShl(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64Shl(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32Shl(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsWordShr(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64Shr(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32Shr(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsWordSar(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64Sar(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32Sar(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsWordAnd(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64And(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32And(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsWordOr(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64Or(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32Or(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsWordXor(const Matcher<Node*>& lhs_matcher,
|
|
|
|
const Matcher<Node*>& rhs_matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsWord64Xor(lhs_matcher, rhs_matcher)
|
|
|
|
: IsWord32Xor(lhs_matcher, rhs_matcher);
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsChangeInt32ToIntPtr(
|
|
|
|
const Matcher<Node*>& matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsChangeInt32ToInt64(matcher) : matcher;
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline Matcher<Node*> IsChangeUint32ToWord(
|
|
|
|
const Matcher<Node*>& matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsChangeUint32ToUint64(matcher) : matcher;
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
2018-02-23 13:46:00 +00:00
|
|
|
static inline Matcher<Node*> IsTruncateIntPtrToInt32(
|
2017-09-11 13:44:42 +00:00
|
|
|
const Matcher<Node*>& matcher) {
|
2019-02-14 13:01:52 +00:00
|
|
|
return kSystemPointerSize == 8 ? IsTruncateInt64ToInt32(matcher) : matcher;
|
2017-09-11 13:44:42 +00:00
|
|
|
}
|
|
|
|
|
2014-10-20 11:26:23 +00:00
|
|
|
} // namespace compiler
|
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|
|
|
|
|
|
|
|
#endif // V8_UNITTESTS_COMPILER_NODE_TEST_UTILS_H_
|