Home
last modified time | relevance | path

Searched refs:ciPos (Results 1 – 1 of 1) sorted by relevance

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DLongArray.java1314 int ciPos = ci.length; in modMultiplyAlt() local
1315 while (--ciPos > 1) in modMultiplyAlt()
1317 if ((ciPos & 1L) == 0L) in modMultiplyAlt()
1322 addShiftedUp(c, ci[ciPos >>> 1], c, ci[ciPos], cLen, positions); in modMultiplyAlt()
1329 distribute(c, ci[ciPos], ci[ciPos - 1], ci[1], cLen); in modMultiplyAlt()