Searched refs:reduce (Results 1 - 25 of 62) sorted by relevance

123

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/Composition/
H A DProgram.cs47 var reduce = new Reduce(new CommonTreeNodeStream(t));
48 t = (CommonTree)reduce.Downup(t);
/external/v8/test/mjsunit/regress/
H A Dregress-1790.js56 CheckSequence(Array.prototype.reduce, function() { return 0; });
H A Dregress-1436.js28 // Check that reduce and reduceRight call the callback function with
32 // Check receiver for reduce and reduceRight.
39 [2, 3].reduce(non_strict);
40 [2, 3].reduce(strict);
/external/webkit/Tools/BuildSlaveSupport/build.webkit.org-config/public_html/LeaksViewer/
H A DLeaksParserWorker.js75 leak.stack.reduce(function(node, frame, index, array) {
92 self.profile.totalTime = self.profile.children.reduce(function(sum, child) { return sum + child.totalTime; }, 0);
/external/quake/quake/src/QW/server/
H A Dmakefile3 #CFLAGS = -mpentium -O6 -Wall -I../client -I. -DSERVERONLY -fomit-frame-pointer -fno-strength-reduce
4 #CFLAGS = -mpentium -O2 -Wall -I../client -I. -DSERVERONLY -fomit-frame-pointer -fno-strength-reduce
5 CFLAGS=-DSERVERONLY -I../client -V2.7.2.1 -bi486-linux/ -O6 -Wall -fomit-frame-pointer -fno-strength-reduce
/external/bison/tests/
H A DMakefile.am50 output.at sets.at reduce.at \
/external/llvm/
H A Dllvm-device-build.mk14 # The three inline options together reduce libbcc.so almost 1MB.
/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h143 /// \brief Optimally reduce one of the nodes in the optimal reduce list.
144 /// @return True if a reduction takes place, false if the optimal reduce
147 /// Selects a node from the optimal reduce list and removes it, applying
172 void reduce() { function in class:PBQP::HeuristicBase
186 /// \brief Add a node to the heuristic reduce list.
187 /// @param nItr Node iterator to add to the heuristic reduce list.
192 /// \brief Heuristically reduce one of the nodes in the heuristic
193 /// reduce list.
194 /// @return True if a reduction takes place, false if the heuristic reduce
[all...]
/external/webkit/Source/WebCore/rendering/
H A DAutoTableLayout.cpp646 // If we have overallocated, reduce every cell according to the difference between desired width and minwidth
649 // Need to reduce cells with the following prioritization:
667 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
668 m_layoutStruct[i].computedLogicalWidth += reduce;
669 available -= reduce;
689 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
690 m_layoutStruct[i].computedLogicalWidth += reduce;
691 available -= reduce;
711 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
712 m_layoutStruct[i].computedLogicalWidth += reduce;
733 int reduce = available * minMaxDiff / logicalWidthBeyondMin; local
[all...]
/external/genext2fs/
H A Dgenext2fs.c977 int extend = 0, reduce = 0; local
979 reduce = 1;
996 if(reduce) // free first block
1005 if(reduce) // free block
1016 if(reduce) // free indirect block
1022 if(reduce) // free first block
1033 if(reduce) // free block
1045 if(reduce) // free double indirect block
1050 if(reduce) // free firstindirect block
1056 if(reduce) // fre
[all...]
/external/v8/test/mjsunit/
H A Darray-reduce.js29 * @fileoverview Test reduce and reduceRight
46 // Creates a callback function for reduce/reduceRight that tests the number
109 testReduce("reduce", "SimpleReduceSum", 12,
115 testReduce("reduce", "SimpleReduceProd", 48,
121 testReduce("reduce", "SimpleReduceDec", 246,
127 testReduce("reduce", "SimpleReduceAccumulate", simpleArray,
134 testReduce("reduce", "EmptyReduceSum", 0, [], [], sum, 0);
135 testReduce("reduce", "EmptyReduceProd", 1, [], [], prod, 1);
136 testReduce("reduce", "EmptyReduceDec", 0, [], [], dec, 0);
137 testReduce("reduce", "EmptyReduceAccumulat
[all...]
H A Dfunction-call.js52 Array.prototype.reduce,
150 [Array.prototype.reduce,
/external/icu4c/i18n/
H A Ddigitlst.h287 void reduce();
H A Ddigitlst.cpp171 DigitList::reduce() { function in class:DigitList
458 numToConvert.reduce(); // Removes any trailing zeros, so that digit count is good.
781 reduce(); // Remove any trailing zeros
810 * amount. Never reduce it. Available size is kept in fContext.digits.
/external/bison/
H A DAndroid.mk61 src/reduce.c \
/external/v8/test/message/
H A Dtestcfg.py117 file_prefix = join(self.root, reduce(join, test[1:], ""))
/external/v8/test/mozilla/
H A Dtestcfg.py112 script = join(self.root, reduce(join, dir, ''), 'shell.js')
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DECFieldElement.java1014 mult.reduce(m, new int[]{k1, k2, k3});
1034 squared.reduce(m, new int[]{k1, k2, k3});
/external/v8/benchmarks/
H A Dcrypto.js520 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
521 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
525 Classic.prototype.reduce = cReduce;
537 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
578 this.reduce(r);
603 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
606 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
610 Montgomery.prototype.reduce = montReduce;
1069 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
1086 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
H A Dv8-crypto.js512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
517 Classic.prototype.reduce = cReduce;
529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
570 this.reduce(r);
595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
602 Montgomery.prototype.reduce = montReduce;
1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
H A Dv8-crypto.js512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
517 Classic.prototype.reduce = cReduce;
529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
570 this.reduce(r);
595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
602 Montgomery.prototype.reduce = montReduce;
1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-crypto.js512 function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
513 function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
517 Classic.prototype.reduce = cReduce;
529 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
570 this.reduce(r);
595 function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
598 function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
602 Montgomery.prototype.reduce = montReduce;
1061 else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
1078 function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(
[all...]
/external/sonivox/arm-hybrid-22k/lib_src/
H A DARM-E_interpolate_loop_gnu.s107 MOV tmp0, tmp0, ASR #2 @ reduce 16-bit signal by 12dB
H A DARM-E_interpolate_noloop_gnu.s99 MOV tmp0, tmp0, ASR #2 @ reduce 16-bit signal by 12dB
H A DARM-E_voice_gain_gnu.s79 @ NOTE: instructions are reordered to reduce the effect of latency

Completed in 2163 milliseconds

123