| /frameworks/base/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);
|
| /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/icu4c/i18n/ |
| digitlst.cpp | 169 // Reduce - remove trailing zero digits.
171 DigitList::reduce() { function in class:DigitList
448 numToConvert.reduce(); // Removes any trailing zeros, so that digit count is good.
771 reduce(); // Remove any trailing zeros
800 * amount. Never reduce it. Available size is kept in fContext.digits.
|
| /external/bouncycastle/src/main/java/org/bouncycastle/math/ec/ |
| ECFieldElement.java | [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/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...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-crypto.js | 512 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(r);
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-crypto.js | 512 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(r);
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-crypto.js | 512 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(r);
[all...] |
| /external/elfutils/src/ |
| ldgeneric.c | 5051 size_t reduce = xelf_fsize (ld_state.outelf, ELF_T_SYM, nsym_local - 1); 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...] |
