/frameworks/native/include/utils/ |
LinearTransform.h | 56 // Helpers which will reduce the fraction N/D using Euclid's method. 57 template <class T> static void reduce(T* N, T* D); 58 static void reduce(int32_t* N, uint32_t* D);
|
/external/v8/test/mjsunit/ |
array-reduce.js | 29 * @fileoverview Test reduce and reduceRight 46 // Creates a callback function for reduce/reduceRight that tests the number 105 // ---- Test Reduce[Left] 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) [all...] |
/frameworks/native/libs/utils/ |
LinearTransform.cpp | 210 template <class T> void LinearTransform::reduce(T* N, T* D) { function in class:android::LinearTransform 247 template void LinearTransform::reduce<uint64_t>(uint64_t* N, uint64_t* D); 248 template void LinearTransform::reduce<uint32_t>(uint32_t* N, uint32_t* D); 250 void LinearTransform::reduce(int32_t* N, uint32_t* D) { function in class:android::LinearTransform 254 reduce(reinterpret_cast<uint32_t*>(N), D); 257 reduce(reinterpret_cast<uint32_t*>(N), D);
|
/frameworks/base/services/common_time/ |
common_clock.cpp | 51 LinearTransform::reduce(&numer, &denom); 53 ALOGE("Overflow in CommonClock::init while trying to reduce %lld/%lld", 138 LinearTransform::reduce(&n1, &d2); 139 LinearTransform::reduce(&n2, &d1); 140 LinearTransform::reduce(&n2, &d2);
|
/external/webkit/Tools/BuildSlaveSupport/build.webkit.org-config/public_html/LeaksViewer/ |
LeaksParserWorker.js | 75 leak.stack.reduce(function(node, frame, index, array) { 92 self.profile.totalTime = self.profile.children.reduce(function(sum, child) { return sum + child.totalTime; }, 0);
|
/dalvik/vm/mterp/x86-atom/ |
OP_AGET.S | 47 # to reduce code size
|
/external/v8/test/mjsunit/regress/ |
regress-1436.js | 28 // 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);
|
regress-1790.js | 56 CheckSequence(Array.prototype.reduce, function() { return 0; });
|
/frameworks/compile/mclinker/ |
mcld-device-build.mk | 3 # The three inline options together reduce libbcc.so almost 1MB.
|
/external/quake/quake/src/QW/server/ |
makefile | 3 #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
|
/ndk/sources/host-tools/nawk-20071023/ |
README | 40 conflicts: 43 shift/reduce, 85 reduce/reduce
|
/external/bison/tests/ |
Makefile.am | 50 output.at sets.at reduce.at \
|
/external/llvm/ |
llvm-device-build.mk | 14 # The three inline options together reduce libbcc.so almost 1MB.
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
HeuristicBase.h | 143 /// \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/ |
AutoTableLayout.cpp | 646 // 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 733 int reduce = available * minMaxDiff \/ logicalWidthBeyondMin; local [all...] |
/external/genext2fs/ |
genext2fs.c | 977 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) // free first bloc [all...] |
/external/icu4c/i18n/ |
digitlst.h | 286 /** Reduce, or normalize. Removes trailing zeroes, adjusts exponent appropriately. */ 287 void reduce();
|
digitlst.cpp | 169 // Reduce - remove trailing zero digits. 171 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/ |
Android.mk | 61 src/reduce.c \
|
/external/v8/test/message/ |
testcfg.py | 117 file_prefix = join(self.root, reduce(join, test[1:], ""))
|
/external/v8/test/mozilla/ |
testcfg.py | 112 script = join(self.root, reduce(join, dir, ''), 'shell.js')
|
/external/webkit/LayoutTests/dom/html/level2/html/ |
HTMLUListElement01.js | 78 The compact attribute specifies whether to reduce spacing between list
|
/external/webkit/LayoutTests/dom/xhtml/level2/html/ |
HTMLUListElement01.js | 78 The compact attribute specifies whether to reduce spacing between list
|
/external/bouncycastle/src/main/java/org/bouncycastle/math/ec/ |
ECFieldElement.java | [all...] |
/external/v8/benchmarks/ |
crypto.js | 520 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(r); [all...] |