| /external/v8/src/compiler/ |
| tail-call-optimization.cc | 16 Reduction TailCallOptimization::Reduce(Node* node) {
|
| js-context-relaxation.cc | 15 Reduction JSContextRelaxation::Reduce(Node* node) {
|
| js-frame-specialization.cc | 15 Reduction JSFrameSpecialization::Reduce(Node* node) {
|
| load-elimination.cc | 17 Reduction LoadElimination::Reduce(Node* node) {
|
| dead-code-elimination.cc | 24 Reduction DeadCodeElimination::Reduce(Node* node) {
|
| js-context-specialization.cc | 19 Reduction JSContextSpecialization::Reduce(Node* node) {
|
| js-inlining-heuristic.cc | 15 Reduction JSInliningHeuristic::Reduce(Node* node) {
|
| select-lowering.cc | 26 Reduction SelectLowering::Reduce(Node* node) {
|
| simplified-operator-reducer.cc | 24 Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
|
| value-numbering-reducer.cc | 52 Reduction ValueNumberingReducer::Reduce(Node* node) {
100 // Now we are called again to reduce node1, and we would return NoChange
|
| escape-analysis-reducer.cc | 24 Reduction EscapeAnalysisReducer::Reduce(Node* node) {
|
| branch-elimination.cc | 26 Reduction BranchElimination::Reduce(Node* node) {
|
| common-operator-reducer.cc | 56 Reduction CommonOperatorReducer::Reduce(Node* node) {
181 // We might now be able to further reduce the {merge} node.
216 // We might now be able to further reduce the {merge} node.
223 // We might now be able to further reduce the {merge} node.
228 // We might now be able to further reduce the {merge} node.
238 // We might now be able to further reduce the {merge} node.
245 // We might now be able to further reduce the {merge} node.
250 // We might now be able to further reduce the {merge} node.
268 // We might now be able to further reduce the {merge} node.
|
| graph-reducer.cc | 79 Reduction GraphReducer::Reduce(Node* const node) {
83 Reduction reduction = (*i)->Reduce(node);
133 Reduction reduction = Reduce(node);
198 // If there was a replacement, reduce it after popping {node}.
|
| js-builtin-reducer.cc | 145 Reduction JSBuiltinReducer::Reduce(Node* node) {
|
| js-global-object-specialization.cc | 40 Reduction JSGlobalObjectSpecialization::Reduce(Node* node) {
|
| /external/v8/test/unittests/compiler/ |
| select-lowering-unittest.cc | 24 Reduction Reduce(Node* node) { return lowering_.Reduce(node); }
43 Reduction const r = Reduce(s0);
55 Reduction const r = Reduce(graph()->NewNode(
64 Reduction const r = Reduce(graph()->NewNode(
|
| simplified-operator-reducer-unittest.cc | 30 Reduction Reduce(Node* node) {
36 return reducer.Reduce(node);
128 Reduction reduction = Reduce(
138 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant()));
146 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant()));
158 Reduction reduction = Reduce(graph()->NewNode(
167 Reduction reduction = Reduce(
175 Reduction reduction = Reduce(
187 Reduction reduction = Reduce(
196 Reduce(graph()->NewNode(simplified()->ChangeBoolToBit(), TrueConstant()))
[all...] |
| tail-call-optimization-unittest.cc | 21 Reduction Reduce(Node* node) {
23 return tco.Reduce(node);
45 Reduction r = Reduce(ret);
71 Reduction r = Reduce(ret);
93 Reduction r = Reduce(ret);
117 Reduction r = Reduce(ret);
143 Reduction r = Reduce(ret);
165 Reduction r = Reduce(ret);
|
| js-builtin-reducer-unittest.cc | 27 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags =
37 return reducer.Reduce(node);
95 Reduction r = Reduce(call);
117 Reduction r = Reduce(call);
142 Reduction r = Reduce(call);
174 Reduction r = Reduce(call);
202 Reduction r = Reduce(call);
|
| js-intrinsic-lowering-unittest.cc | 33 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags =
44 return reducer.Reduce(node);
71 Reduction const r = Reduce(graph()->NewNode(
91 Reduction const r = Reduce(
108 Reduction const r = Reduce(
125 Reduction const r = Reduce(
142 Reduction const r = Reduce(
173 Reduction const r = Reduce(
204 Reduction const r = Reduce(graph()->NewNode(
235 Reduction const r = Reduce(
[all...] |
| load-elimination-unittest.cc | 21 Reduction Reduce(Node* node) {
25 return reducer.Reduce(node);
45 Reduction r1 = Reduce(graph()->NewNode(simplified()->LoadField(access1),
53 Reduction r2 = Reduce(graph()->NewNode(simplified()->LoadField(access2),
62 Reduction r3 = Reduce(graph()->NewNode(simplified()->LoadField(access1),
66 Reduction r4 = Reduce(graph()->NewNode(simplified()->LoadField(access1),
|
| value-numbering-reducer-unittest.cc | 34 Reduction Reduce(Node* node) { return reducer_.Reduce(node); }
49 EXPECT_FALSE(Reduce(n1).Changed());
50 EXPECT_FALSE(Reduce(n2).Changed());
57 EXPECT_FALSE(Reduce(n1).Changed());
59 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed());
67 EXPECT_FALSE(Reduce(n0).Changed());
68 EXPECT_FALSE(Reduce(n1).Changed());
84 Reduction r1 = Reduce(n1);
90 Reduction r2 = Reduce(n2)
[all...] |
| branch-elimination-unittest.cc | 26 void Reduce() {
72 Reduce();
113 Reduce();
151 Reduce();
200 Reduce();
|
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/detail/ |
| reduce_to_column.hpp | 51 #include "../../block/reduce.hpp"
57 template <int BLOCK_SIZE, typename work_type, typename work_elem_type, class Reductor, int cn> struct Reduce;
59 template <int BLOCK_SIZE, typename work_type, typename work_elem_type, class Reductor> struct Reduce<BLOCK_SIZE, work_type, work_elem_type, Reductor, 1>
68 template <int BLOCK_SIZE, typename work_type, typename work_elem_type, class Reductor> struct Reduce<BLOCK_SIZE, work_type, work_elem_type, Reductor, 2>
77 template <int BLOCK_SIZE, typename work_type, typename work_elem_type, class Reductor> struct Reduce<BLOCK_SIZE, work_type, work_elem_type, Reductor, 3>
86 template <int BLOCK_SIZE, typename work_type, typename work_elem_type, class Reductor> struct Reduce<BLOCK_SIZE, work_type, work_elem_type, Reductor, 4>
118 Reduce<BLOCK_SIZE, work_type, work_elem_type, Reductor, cn>::call(smem, myVal);
|
