Home
last modified time | relevance | path

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

/external/antlr/runtime/ObjC/Framework/ANTLR.xcodeproj/
Dacondit.pbxuser215 rLen = 0;
225 rLen = 0;
235 rLen = 15;
245 rLen = 0;
255 rLen = 0;
265 rLen = 0;
275 rLen = 0;
285 rLen = 18;
295 rLen = 18;
305 rLen = 0;
[all …]
/external/icu/icu4c/source/test/cintltst/
Dcmsccoll.c3585 int32_t rLen, tLen, ruleLen, sLen, kLen; in TestVI5913() local
3657 rLen = ucol_getSortKey(coll, tData[j], tLen, resColl, 100); in TestVI5913()
3658 for(i = 0; i<rLen; i++) { in TestVI5913()
3681 rLen = ucol_getSortKey(coll, tData[j], tLen, resColl, 100); in TestVI5913()
3682 for(i = 0; i<rLen; i++) { in TestVI5913()
3708 rLen = ucol_getSortKey(coll, tailorData[j], tLen, resColl, 100); in TestVI5913()
3709 if ( kLen!=rLen || uprv_memcmp(expColl, resColl, rLen*sizeof(uint8_t))!=0 ) { in TestVI5913()
3711 for(i = 0; i<rLen; i++) { in TestVI5913()
3725 rLen = ucol_getSortKey(coll, tailorData2[j], tLen, resColl, 100); in TestVI5913()
3726 if ( kLen!=rLen || uprv_memcmp(expColl, resColl, rLen*sizeof(uint8_t))!=0 ) { in TestVI5913()
[all …]
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/
DLongArray.java1348 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in modReduce() local
1349 return new LongArray(buf, 0, rLen); in modReduce()
1489 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in reduce() local
1490 if (rLen < buf.length) in reduce()
1492 m_ints = new long[rLen]; in reduce()
1493 System.arraycopy(buf, 0, m_ints, 0, rLen); in reduce()
1499 int rLen = reduceInPlace(buf, off, len, m, ks); in reduceResult() local
1500 return new LongArray(buf, off, rLen); in reduceResult()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DLongArray.java1347 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in modReduce() local
1348 return new LongArray(buf, 0, rLen); in modReduce()
1488 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in reduce() local
1489 if (rLen < buf.length) in reduce()
1491 m_ints = new long[rLen]; in reduce()
1492 System.arraycopy(buf, 0, m_ints, 0, rLen); in reduce()
1498 int rLen = reduceInPlace(buf, off, len, m, ks); in reduceResult() local
1499 return new LongArray(buf, off, rLen); in reduceResult()
/external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/math/ec/
DLongArray.java1348 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in modReduce() local
1349 return new LongArray(buf, 0, rLen); in modReduce()
1489 int rLen = reduceInPlace(buf, 0, buf.length, m, ks); in reduce() local
1490 if (rLen < buf.length) in reduce()
1492 m_ints = new long[rLen]; in reduce()
1493 System.arraycopy(buf, 0, m_ints, 0, rLen); in reduce()
1499 int rLen = reduceInPlace(buf, off, len, m, ks); in reduceResult() local
1500 return new LongArray(buf, off, rLen); in reduceResult()
/external/deqp/framework/randomshaders/
DrsgBinaryOps.cpp746 T rLen = GetRandom()(rnd, T(0), T(8)); in operator ()() local
748 T rMax = rMin+rLen; in operator ()()
761 T aLen = GetRandom()(rnd, T(0), T(8)-rLen); in operator ()()
772 T aLen = GetRandom()(rnd, T(0), T(8)-rLen); in operator ()()
802 T rLen = GetRandom()(rnd, T(0), T(8)); in operator ()() local
804 T rMax = rMin+rLen; in operator ()()
817 T aLen = GetRandom()(rnd, T(0), T(8)-rLen); in operator ()()
828 T aLen = GetRandom()(rnd, T(0), T(8)-rLen); in operator ()()