/external/v8/src/compiler/ |
H A D | graph-reducer.cc | 35 Reduction reduction = (*i)->Reduce(node); local 36 Node* replacement = reduction.replacement(); 40 // {replacement == node} represents an in-place reduction. 42 // as now there may be more opportunities for reduction. 57 // {node} with {replacement}. New nodes created by this reduction can 89 // Perform a post-order reduction of all nodes starting from the end.
|
H A D | js-builtin-reducer.cc | 17 // produce an effect. Replaces {node} with {reduction} and relaxes effects. 18 static Reduction ReplaceWithPureReduction(Node* node, Reduction reduction) { argument 19 if (reduction.Changed()) { 20 NodeProperties::ReplaceWithValue(node, reduction.replacement()); 21 return reduction; 28 // for reduction when they have a BuiltinFunctionId associated with them.
|
H A D | simplified-operator-reducer-unittest.cc | 164 Reduction reduction = Reduce( local 166 EXPECT_FALSE(reduction.Changed()); 181 Reduction reduction = Reduce( local 184 ASSERT_TRUE(reduction.Changed()); 185 EXPECT_EQ(param0, reduction.replacement()); 211 Reduction reduction = Reduce(graph()->NewNode( local 214 ASSERT_TRUE(reduction.Changed()); 215 EXPECT_EQ(param0, reduction.replacement()); 220 Reduction reduction = Reduce( local 222 ASSERT_TRUE(reduction 228 Reduction reduction = Reduce( local 240 Reduction reduction = Reduce( local 248 Reduction reduction = local 257 Reduction reduction = Reduce(graph()->NewNode( local 271 Reduction reduction = Reduce(graph()->NewNode( local 285 Reduction reduction = Reduce(graph()->NewNode( local 300 Reduction reduction = Reduce(graph()->NewNode( local 311 Reduction reduction = Reduce(graph()->NewNode( local 322 Reduction reduction = Reduce(graph()->NewNode( local 332 Reduction reduction = Reduce(graph()->NewNode( local 341 Reduction reduction = local 350 Reduction reduction = local 365 Reduction reduction = Reduce(graph()->NewNode( local 376 Reduction reduction = Reduce(graph()->NewNode( local 386 Reduction reduction = Reduce(graph()->NewNode( local 395 Reduction reduction = local 404 Reduction reduction = local 419 Reduction reduction = Reduce(graph()->NewNode( local 430 Reduction reduction = Reduce(graph()->NewNode( local 440 Reduction reduction = Reduce(graph()->NewNode( local 450 Reduction reduction = local 459 Reduction reduction = local 473 Reduction reduction = local [all...] |
H A D | change-lowering-unittest.cc | 128 Reduction reduction = Reduce(node); local 129 ASSERT_TRUE(reduction.Changed()); 131 Node* phi = reduction.replacement(); 145 Reduction reduction = Reduce(node); local 146 ASSERT_TRUE(reduction.Changed()); 148 EXPECT_THAT(reduction.replacement(), IsWordEqual(val, IsTrueConstant())); 155 Reduction reduction = Reduce(node); local 156 ASSERT_TRUE(reduction.Changed()); 158 Node* finish = reduction.replacement(); 174 Reduction reduction local 199 Reduction reduction = Reduce(node); local 229 Reduction reduction = Reduce(node); local 258 Reduction reduction = Reduce(node); local 284 Reduction reduction = Reduce(node); local 310 Reduction reduction = Reduce(node); local 351 Reduction reduction = Reduce(node); local 366 Reduction reduction = Reduce(node); local 395 Reduction reduction = Reduce(node); local 422 Reduction reduction = Reduce(node); local 449 Reduction reduction = Reduce(node); local [all...] |
H A D | machine-operator-reducer-unittest.cc | 234 Reduction reduction = local 236 EXPECT_FALSE(reduction.Changed()); 251 Reduction reduction = Reduce(graph()->NewNode( local 253 ASSERT_TRUE(reduction.Changed()); 254 EXPECT_THAT(reduction.replacement(), IsFloat64Constant(x)); 266 Reduction reduction = Reduce(graph()->NewNode( local 269 ASSERT_TRUE(reduction.Changed()); 270 EXPECT_EQ(value, reduction.replacement()); 276 Reduction reduction = Reduce(graph()->NewNode( local 278 ASSERT_TRUE(reduction 291 Reduction reduction = Reduce(graph()->NewNode( local 301 Reduction reduction = Reduce(graph()->NewNode( local 315 Reduction reduction = Reduce( local 329 Reduction reduction = Reduce( local 343 Reduction reduction = local 358 Reduction reduction = local 375 Reduction reduction = Reduce(graph()->NewNode( local 385 Reduction reduction = Reduce(graph()->NewNode( local 400 Reduction reduction = Reduce(graph()->NewNode( local 410 Reduction reduction = Reduce(graph()->NewNode( local 424 Reduction reduction = Reduce(graph()->NewNode( local 434 Reduction reduction = Reduce( local 503 Reduction reduction = Reduce(node); local 514 Reduction reduction = Reduce(node); local [all...] |
H A D | js-typed-lowering.cc | 622 static Reduction ReplaceWithReduction(Node* node, Reduction reduction) { argument 623 if (reduction.Changed()) { 624 NodeProperties::ReplaceWithValue(node, reduction.replacement()); 625 return reduction;
|
/external/v8/test/cctest/compiler/ |
H A D | test-phi-reducer.cc | 34 Reduction reduction = reducer.Reduce(phi); local 36 CHECK(!reduction.Changed()); 38 CHECK(reduction.Changed()); 39 CHECK_EQ(expect, reduction.replacement());
|
H A D | test-machine-operator-reducer.cc | 87 // Check that the reduction of this binop applied to constants {a} and {b} 94 // Check that the reduction of this binop applied to {a} and {b} yields 101 Reduction reduction = reducer.Reduce(n); local 102 CHECK(reduction.Changed()); 103 CHECK_NE(n, reduction.replacement()); 104 CHECK_EQ(expect, ValueOf<T>(reduction.replacement()->op())); 107 // Check that the reduction of this binop applied to {a} and {b} yields 113 Reduction reduction = reducer.Reduce(n); local 114 CHECK(reduction.Changed()); 115 CHECK_EQ(expect, reduction 125 Reduction reduction = reducer.Reduce(n); local 172 Reduction reduction = reducer.Reduce(n); local 180 Reduction reduction = reducer.Reduce(n); local 196 Reduction reduction = reducer.Reduce(n); local [all...] |
H A D | test-js-typed-lowering.cc | 77 Reduction reduction = reducer.Reduce(node); local 78 if (reduction.Changed()) return reduction.replacement(); 457 // If number constants are eagerly typed, then reduction should 603 CHECK_EQ(IrOpcode::kJSToString, r->opcode()); // No reduction. 748 CHECK_EQ(cmp, r); // No reduction of mixed types. 865 // Helper class for testing the reduction of a single binop.
|
/external/skia/src/pathops/ |
H A D | SkReduceOrder.cpp | 16 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { argument 17 reduction[0] = reduction[1] = quad[0]; 21 static int reductionLineCount(const SkDQuad& reduction) { argument 22 return 1 + !reduction[0].approximatelyEqual(reduction[1]); 25 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { argument 26 reduction[0] = quad[0]; 27 reduction[1] = quad[2]; 28 return reductionLineCount(reduction); 31 horizontal_line(const SkDQuad& quad, SkDQuad& reduction) argument 37 check_linear(const SkDQuad& quad, int minX, int maxX, int minY, int maxY, SkDQuad& reduction) argument 109 coincident_line(const SkDCubic& cubic, SkDCubic& reduction) argument 114 reductionLineCount(const SkDCubic& reduction) argument 118 vertical_line(const SkDCubic& cubic, SkDCubic& reduction) argument 124 horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) argument 131 check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) argument 157 check_linear(const SkDCubic& cubic, int minX, int maxX, int minY, int maxY, SkDCubic& reduction) argument [all...] |
/external/skia/src/utils/win/ |
H A D | SkDWriteGeometrySink.cpp | 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { argument 105 reduction[0] = cubic[0]; 106 reduction[1].x = midX; 107 reduction[1].y = midY; 108 reduction[2] = cubic[3];
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.text_3.5.0.v20100601-1300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/robolectric/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |