/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
D | LongArray.java | 961 int aVal = (int)(a[j] >>> k); in modMultiplyLD() local 962 int u = aVal & MASK; in modMultiplyLD() 963 int v = (aVal >>> 4) & MASK; in modMultiplyLD() 973 int aVal = (int)(a[j] >>> k); in modMultiplyLD() local 974 int u = aVal & MASK; in modMultiplyLD() 975 int v = (aVal >>> 4) & MASK; in modMultiplyLD() 1091 long aVal = a[aPos]; in modMultiply() local 1095 int u = (int)aVal & MASK; in modMultiply() 1096 aVal >>>= 4; in modMultiply() 1097 int v = (int)aVal & MASK; in modMultiply() [all …]
|
/external/clang/test/Rewriter/ |
D | rewrite-typeof.mm | 27 __typeof__(a) aVal = a; 29 __typeof__(aVal) bVal; 37 // CHECK-LP: int aVal = a;
|
D | rewrite-modern-typeof.mm | 29 __typeof__(a) aVal = a; 31 __typeof__(aVal) bVal; 45 // CHECK-LP: int aVal = a;
|
/external/mesa3d/src/egl/main/ |
D | eglmode.c | 236 const EGLint aVal = getModeAttrib(aMode, SortInfo[i].Attrib); in _eglCompareModes() local 238 if (aVal == bVal) { in _eglCompareModes() 243 return (aVal < bVal) ? -1 : 1; in _eglCompareModes() 246 return (aVal > bVal) ? -1 : 1; in _eglCompareModes()
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
D | ANTLRBaseStack.m | 126 - (void)setLastHash:(NSInteger)aVal 128 LastHash = aVal;
|
D | ANTLRBaseStack.h | 64 - (void)setLastHash:(NSInteger)aVal;
|
D | ANTLRBufferedTreeNodeStream.h | 130 - (void) setUniqueNavigationNodes:(BOOL)aVal;
|
D | ANTLRBufferedTreeNodeStream.m | 360 - (void) setUniqueNavigationNodes:(BOOL)aVal 362 uniqueNavigationNodes = aVal;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
D | ANTLRBaseStack.h | 64 - (void)setLastHash:(NSInteger)aVal;
|
D | ANTLRBufferedTreeNodeStream.h | 128 - (void) setUniqueNavigationNodes:(BOOL)aVal;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
D | ANTLRBaseStack.h | 64 - (void)setLastHash:(NSInteger)aVal;
|
D | ANTLRBufferedTreeNodeStream.h | 128 - (void) setUniqueNavigationNodes:(BOOL)aVal;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
D | ANTLRBaseStack.h | 64 - (void)setLastHash:(NSInteger)aVal;
|
D | ANTLRBufferedTreeNodeStream.h | 128 - (void) setUniqueNavigationNodes:(BOOL)aVal;
|
/external/skia/tests/ |
D | MatrixTest.cpp | 38 float aVal = a.get(i); in are_equal() local 40 int aValI = *SkTCast<int*>(&aVal); in are_equal() 42 if (0 == aVal && 0 == bVal && aValI != bValI) { in are_equal() 45 REPORTER_ASSERT(reporter, aVal == bVal && aValI == aValI); in are_equal() 52 float aVal = a.get(i); in are_equal() local 54 int aValI = *SkTCast<int*>(&aVal); in are_equal() 56 if (sk_float_isnan(aVal) && aValI == bValI) { in are_equal() 59 REPORTER_ASSERT(reporter, aVal == bVal && aValI == bValI); in are_equal()
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/ |
D | SymbolTableParser.h | 39 - (void)setnames:(ANTLRHashMap *)aVal;
|
D | SymbolTableParser.m | 153 - (void)setnames:(ANTLRHashMap *)aVal { names = aVal; }
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/ |
D | SymbolTableParser.h | 59 - (void)setnames:(ANTLRPtrBuffer *)aVal;
|
D | SymbolTableParser.m | 93 - (void)setnames:(ANTLRPtrBuffer *)aVal { names = aVal; }
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
D | SimpleCTP.h | 51 - (void)settree:(ANTLRCommonTree *)aVal;
|
D | SimpleCTP.m | 161 - (void)settree:(ANTLRCommonTree *)aVal { tree = aVal; }
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
D | SimpleCTP.h | 71 - (void)settree:(ANTLRCommonTree *)aVal;
|
D | SimpleCTP.m | 137 - (void)settree:(ANTLRCommonTree *)aVal { tree = aVal; }
|
/external/icu/icu4c/source/test/perf/collationperf/ |
D | collperf.cpp | 344 int aVal = 0; in ICURandomCmp() local 348 aVal += aVal*37 + *ask++; in ICURandomCmp() 354 if (aVal == bVal) { in ICURandomCmp() 357 else if (aVal > bVal) { in ICURandomCmp()
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/ |
D | Nat.java | 473 long c = 0, aVal = a & M, bVal = b & M; in mul31BothAdd() local 477 c += aVal * (x[i] & M) + bVal * (y[i] & M) + (z[zOff + i] & M); in mul31BothAdd()
|