| /external/v8/src/compiler/ |
| js-typed-lowering.h | 40 Reduction Reduce(Node* node) final;
45 Reduction ReduceJSAdd(Node* node);
46 Reduction ReduceJSBitwiseNot(Node* node);
47 Reduction ReduceJSDecrement(Node* node);
48 Reduction ReduceJSIncrement(Node* node);
49 Reduction ReduceJSNegate(Node* node);
50 Reduction ReduceJSComparison(Node* node);
51 Reduction ReduceJSLoadNamed(Node* node);
52 Reduction ReduceJSHasInPrototypeChain(Node* node);
53 Reduction ReduceJSOrdinaryHasInstance(Node* node)
[all...] |
| typed-optimization.h | 36 Reduction Reduce(Node* node) final;
39 Reduction ReduceConvertReceiver(Node* node);
40 Reduction ReduceCheckHeapObject(Node* node);
41 Reduction ReduceCheckMaps(Node* node);
42 Reduction ReduceCheckNumber(Node* node);
43 Reduction ReduceCheckString(Node* node);
44 Reduction ReduceCheckEqualsInternalizedString(Node* node);
45 Reduction ReduceCheckEqualsSymbol(Node* node);
46 Reduction ReduceLoadField(Node* node);
47 Reduction ReduceNumberFloor(Node* node)
[all...] |
| js-intrinsic-lowering.h | 39 Reduction Reduce(Node* node) final;
42 Reduction ReduceCreateIterResultObject(Node* node);
43 Reduction ReduceDebugIsActive(Node* node);
44 Reduction ReduceDeoptimizeNow(Node* node);
45 Reduction ReduceCreateJSGeneratorObject(Node* node);
46 Reduction ReduceGeneratorClose(Node* node);
47 Reduction ReduceGeneratorGetInputOrDebugPos(Node* node);
48 Reduction ReduceAsyncGeneratorReject(Node* node);
49 Reduction ReduceAsyncGeneratorResolve(Node* node);
50 Reduction ReduceAsyncGeneratorYield(Node* node)
[all...] |
| js-call-reducer.h | 32 // Performs strength reduction on {JSConstruct} and {JSCall} nodes,
52 Reduction Reduce(Node* node) final;
59 Reduction ReduceArrayConstructor(Node* node);
60 Reduction ReduceBooleanConstructor(Node* node);
61 Reduction ReduceCallApiFunction(Node* node,
63 Reduction ReduceFunctionPrototypeApply(Node* node);
64 Reduction ReduceFunctionPrototypeBind(Node* node);
65 Reduction ReduceFunctionPrototypeCall(Node* node);
66 Reduction ReduceFunctionPrototypeHasInstance(Node* node);
67 Reduction ReduceObjectConstructor(Node* node)
[all...] |
| dead-code-elimination.h | 48 Reduction Reduce(Node* node) final;
51 Reduction ReduceEnd(Node* node);
52 Reduction ReduceLoopOrMerge(Node* node);
53 Reduction ReduceLoopExit(Node* node);
54 Reduction ReduceNode(Node* node);
55 Reduction ReducePhi(Node* node);
56 Reduction ReducePureNode(Node* node);
57 Reduction ReduceUnreachableOrIfException(Node* node);
58 Reduction ReduceEffectNode(Node* node);
59 Reduction ReduceDeoptimizeOrReturnOrTerminate(Node* node)
[all...] |
| machine-operator-reducer.h | 21 // Performs constant folding and strength reduction on nodes that have
32 Reduction Reduce(Node* node) override;
60 Reduction ReplaceBool(bool value) { return ReplaceInt32(value ? 1 : 0); }
61 Reduction ReplaceFloat32(volatile float value) {
64 Reduction ReplaceFloat64(volatile double value) {
67 Reduction ReplaceInt32(int32_t value) {
70 Reduction ReplaceUint32(uint32_t value) {
73 Reduction ReplaceInt64(int64_t value) {
77 Reduction ReduceInt32Add(Node* node);
78 Reduction ReduceInt64Add(Node* node)
[all...] |
| common-operator-reducer.h | 23 // Performs strength reduction on nodes that have common operators.
35 Reduction Reduce(Node* node) final;
38 Reduction ReduceBranch(Node* node);
39 Reduction ReduceDeoptimizeConditional(Node* node);
40 Reduction ReduceMerge(Node* node);
41 Reduction ReduceEffectPhi(Node* node);
42 Reduction ReducePhi(Node* node);
43 Reduction ReduceReturn(Node* node);
44 Reduction ReduceSelect(Node* node);
45 Reduction ReduceSwitch(Node* node)
[all...] |
| simplified-operator-reducer.h | 37 Reduction Reduce(Node* node) final;
40 Reduction ReduceReferenceEqual(Node* node);
42 Reduction Change(Node* node, const Operator* op, Node* a);
43 Reduction ReplaceBoolean(bool value);
44 Reduction ReplaceFloat64(double value);
45 Reduction ReplaceInt32(int32_t value);
46 Reduction ReplaceUint32(uint32_t value) {
49 Reduction ReplaceNumber(double value);
50 Reduction ReplaceNumber(int32_t value);
|
| branch-elimination.h | 30 Reduction Reduce(Node* node) final;
58 Reduction ReduceBranch(Node* node);
59 Reduction ReduceDeoptimizeConditional(Node* node);
60 Reduction ReduceIf(Node* node, bool is_true_branch);
61 Reduction ReduceLoop(Node* node);
62 Reduction ReduceMerge(Node* node);
63 Reduction ReduceStart(Node* node);
64 Reduction ReduceOtherControl(Node* node);
66 Reduction TakeConditionsFromFirstControl(Node* node);
67 Reduction UpdateConditions(Node* node, ControlPathConditions conditions)
[all...] |
| checkpoint-elimination.h | 25 Reduction Reduce(Node* node) final;
28 Reduction ReduceCheckpoint(Node* node);
|
| js-create-lowering.h | 48 Reduction Reduce(Node* node) final;
51 Reduction ReduceJSCreate(Node* node);
52 Reduction ReduceJSCreateArguments(Node* node);
53 Reduction ReduceJSCreateArray(Node* node);
54 Reduction ReduceJSCreateArrayIterator(Node* node);
55 Reduction ReduceJSCreateCollectionIterator(Node* node);
56 Reduction ReduceJSCreateBoundFunction(Node* node);
57 Reduction ReduceJSCreateClosure(Node* node);
58 Reduction ReduceJSCreateIterResultObject(Node* node);
59 Reduction ReduceJSCreateStringIterator(Node* node)
[all...] |
| redundancy-elimination.h | 21 Reduction Reduce(Node* node) final;
60 Reduction ReduceCheckNode(Node* node);
61 Reduction ReduceEffectPhi(Node* node);
62 Reduction ReduceStart(Node* node);
63 Reduction ReduceOtherNode(Node* node);
65 Reduction TakeChecksFromFirstEffect(Node* node);
66 Reduction UpdateChecks(Node* node, EffectPathChecks const* checks);
68 Reduction TryReuseBoundsCheckForFirstInput(Node* node);
|
| js-context-specialization.h | 50 Reduction Reduce(Node* node) final;
53 Reduction ReduceParameter(Node* node);
54 Reduction ReduceJSLoadContext(Node* node);
55 Reduction ReduceJSStoreContext(Node* node);
57 Reduction SimplifyJSStoreContext(Node* node, Node* new_context,
59 Reduction SimplifyJSLoadContext(Node* node, Node* new_context,
|
| js-native-context-specialization.h | 59 Reduction Reduce(Node* node) final;
62 Reduction ReduceJSAdd(Node* node);
63 Reduction ReduceJSGetSuperConstructor(Node* node);
64 Reduction ReduceJSInstanceOf(Node* node);
65 Reduction ReduceJSHasInPrototypeChain(Node* node);
66 Reduction ReduceJSOrdinaryHasInstance(Node* node);
67 Reduction ReduceJSPromiseResolve(Node* node);
68 Reduction ReduceJSResolvePromise(Node* node);
69 Reduction ReduceJSLoadContext(Node* node);
70 Reduction ReduceJSLoadGlobal(Node* node)
[all...] |
| value-numbering-reducer.h | 24 Reduction Reduce(Node* node) override;
29 Reduction ReplaceIfTypesMatch(Node* node, Node* replacement);
|
| graph-reducer.h | 30 class Reduction final {
32 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {}
44 // language-specific reductions (e.g. reduction based on types or constant
45 // folding of low-level operators) can be integrated into the graph reduction
55 virtual Reduction Reduce(Node* node) = 0;
63 static Reduction NoChange() { return Reduction(); }
64 static Reduction Replace(Node* node) { return Reduction(node); }
65 static Reduction Changed(Node* node) { return Reduction(node);
[all...] |
| js-heap-copy-reducer.h | 26 Reduction Reduce(Node* node) override;
|
| checkpoint-elimination.cc | 33 Reduction CheckpointElimination::ReduceCheckpoint(Node* node) {
41 Reduction CheckpointElimination::Reduce(Node* node) {
|
| constant-folding-reducer.h | 26 Reduction Reduce(Node* node) final;
|
| select-lowering.h | 27 Reduction Reduce(Node* node) override;
|
| type-narrowing-reducer.h | 28 Reduction Reduce(Node* node) final;
|
| js-inlining.h | 37 Reduction Reduce(Node* node) final;
41 Reduction ReduceJSCall(Node* node);
68 Reduction InlineCall(Node* call, Node* new_target, Node* context,
|
| branch-elimination.cc | 27 Reduction BranchElimination::Reduce(Node* node) {
56 Reduction BranchElimination::ReduceBranch(Node* node) {
93 Reduction BranchElimination::ReduceDeoptimizeConditional(Node* node) {
140 Reduction BranchElimination::ReduceIf(Node* node, bool is_true_branch) {
155 Reduction BranchElimination::ReduceLoop(Node* node) {
163 Reduction BranchElimination::ReduceMerge(Node* node) {
192 Reduction BranchElimination::ReduceStart(Node* node) {
197 Reduction BranchElimination::ReduceOtherControl(Node* node) {
203 Reduction BranchElimination::TakeConditionsFromFirstControl(Node* node) {
211 Reduction BranchElimination::UpdateConditions
[all...] |
| js-intrinsic-lowering.cc | 27 Reduction JSIntrinsicLowering::Reduce(Node* node) {
86 Reduction JSIntrinsicLowering::ReduceCreateIterResultObject(Node* node) {
95 Reduction JSIntrinsicLowering::ReduceDebugIsActive(Node* node) {
105 Reduction JSIntrinsicLowering::ReduceDeoptimizeNow(Node* node) {
123 Reduction JSIntrinsicLowering::ReduceCreateJSGeneratorObject(Node* node) {
136 Reduction JSIntrinsicLowering::ReduceGeneratorClose(Node* node) {
150 Reduction JSIntrinsicLowering::ReduceGeneratorGetInputOrDebugPos(Node* node) {
160 Reduction JSIntrinsicLowering::ReduceAsyncGeneratorReject(Node* node) {
166 Reduction JSIntrinsicLowering::ReduceAsyncGeneratorResolve(Node* node) {
172 Reduction JSIntrinsicLowering::ReduceAsyncGeneratorYield(Node* node)
[all...] |
| dead-code-elimination.cc | 48 Reduction DeadCodeElimination::Reduce(Node* node) {
80 Reduction DeadCodeElimination::PropagateDeadControl(Node* node) {
87 Reduction DeadCodeElimination::ReduceEnd(Node* node) {
112 Reduction DeadCodeElimination::ReduceLoopOrMerge(Node* node) {
183 Reduction DeadCodeElimination::RemoveLoopExit(Node* node) {
196 Reduction DeadCodeElimination::ReduceNode(Node* node) {
202 Reduction reduction = PropagateDeadControl(node); local
203 if (reduction.Changed()) return reduction;
217 Reduction reduction = PropagateDeadControl(node); local
247 Reduction reduction = PropagateDeadControl(node); local
288 Reduction reduction = PropagateDeadControl(node); local
319 Reduction reduction = PropagateDeadControl(node); local
[all...] |
