HomeSort by relevance Sort by last modified time
    Searched defs:reduction (Results 1 - 25 of 34) sorted by null

1 2

  /external/chromium_org/third_party/WebKit/Source/modules/webaudio/
DynamicsCompressorNode.cpp 89 float reduction = m_dynamicsCompressor->parameterValue(DynamicsCompressor::ParamReduction); local
90 m_reduction->setValue(reduction);
DynamicsCompressorNode.h 60 AudioParam* reduction() { return m_reduction.get(); } function in class:blink::FINAL
  /external/chromium_org/v8/src/compiler/
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.
simplified-operator-reducer-unittest.cc 23 Reduction Reduce(Node* node) {
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());
190 Reduction reduction0 =
198 Reduction reduction1
211 Reduction reduction = Reduce(graph()->NewNode( local
220 Reduction reduction = Reduce( local
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...]
change-lowering-unittest.cc 75 Reduction Reduce(Node* node) {
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
174 Reduction reduction = Reduce(node); 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...]
machine-operator-reducer-unittest.cc 21 Reduction Reduce(Node* node) {
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
276 Reduction reduction = Reduce(graph()->NewNode( local
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...]
  /external/chromium_org/v8/test/cctest/compiler/
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());
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
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...]
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.
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/
__init__.py 165 from multiprocessing import reduction namespace
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/multiprocessing/
__init__.py 165 from multiprocessing import reduction namespace
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
AutoTableLayout.cpp 568 int reduction = std::min(cellLogicalWidth, excess); local
570 excess -= reduction;
571 int newLogicalWidth = std::max<int>(m_layoutStruct[i].effectiveMinLogicalWidth, cellLogicalWidth - reduction);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
ipa-prop.h 559 tree reduction; member in struct:ipa_parm_adjustment
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_multiprocessing.py 40 from multiprocessing import reduction namespace
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_multiprocessing.py 40 from multiprocessing import reduction namespace
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.text_3.5.0.v20100601-1300.jar 
  /external/chromium_org/third_party/closure_compiler/compiler/
compiler.jar 
  /external/chromium_org/third_party/libaddressinput/src/java/
android.jar 
  /prebuilts/sdk/10/
android.jar 
  /prebuilts/sdk/11/
android.jar 
  /prebuilts/sdk/13/
android.jar 
  /prebuilts/sdk/16/
android.jar 
  /prebuilts/sdk/20/
android.jar 
  /prebuilts/sdk/4/
android.jar 
  /prebuilts/sdk/5/
android.jar 

Completed in 923 milliseconds

1 2