| /external/clang/test/PCH/ |
| cxx-reference.h | 4 typedef char (&&RR);
9 char &&rr = 'c'; variable
12 RR &lrrr = c;
13 RR &&rrrr = 'c';
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| PointerSubChecker.cpp | 48 const MemRegion *RR = RV.getAsRegion();
50 if (!(LR && RR))
54 const MemRegion *BaseRR = RR->getBaseRegion();
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegisterClassInfo.cpp | 57 BitVector RR = TRI->getReservedRegs(*MF);
58 if (RR != Reserved)
60 Reserved = RR;
|
| /external/llvm/lib/CodeGen/ |
| RegisterClassInfo.cpp | 65 const BitVector &RR = MF->getRegInfo().getReservedRegs();
66 if (Reserved.size() != RR.size() || RR != Reserved) {
68 Reserved = RR;
|
| /external/vboot_reference/host/lib/ |
| util_misc.c | 39 BIGNUM *N0inv = NULL, *R = NULL, *RR = NULL;
41 BIGNUM *n = NULL, *rr = NULL; local
70 NEW_BIGNUM(RR);
74 NEW_BIGNUM(rr);
97 /* Calculate RR = R^2 mod N */
98 BN_copy(RR, R);
99 BN_mul(RRTemp, RR, R, bn_ctx);
100 BN_mod(RR, RRTemp, N, bn_ctx);
118 BN_mod(rr, RR, B, bn_ctx); /* rr = RR mod B *
[all...] |
| /bootable/recovery/tools/dumpkey/ |
| DumpPublicKey.java | 131 BigInteger RR = R.multiply(R).mod(N); // 2^4096 mod N
150 long rr = RR.mod(B).longValue(); local
151 result.append(rr);
157 RR = RR.divide(B);
|
| /external/clang/test/CodeGen/ |
| union.c | 39 union RR {_Bool a : 1;} RRU;
|
| /external/vboot_reference/utility/ |
| dumpRSAPublicKey.c | 46 BIGNUM *N0inv= NULL, *R = NULL, *RR = NULL, *RRTemp = NULL, *NnumBits = NULL;
47 BIGNUM *n = NULL, *rr = NULL; local
65 RR = BN_new();
69 rr = BN_new();
91 /* Calculate RR = R^2 mod N */
92 BN_copy(RR, R);
93 BN_mul(RRTemp, RR, R, bn_ctx);
94 BN_mod(RR, RRTemp, N, bn_ctx);
113 BN_mod(rr, RR, B, bn_ctx); /* rr = RR mod B *
[all...] |
| /external/boringssl/src/include/openssl/ |
| bn.h | [all...] |
| /toolchain/binutils/binutils-2.27/include/opcode/ |
| spu.h | 30 RR,
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonOptAddrMode.cpp | 151 RegisterRef RR = UA.Addr->getRegRef();
152 if (OffsetReg == RR.Reg) {
153 OffsetRR = RR;
|
| RDFLiveness.cpp | 111 RegisterRef RR = TA.Addr->getRegRef();
112 if (RAI.covers(RR, RefRR)) {
515 RegisterRef RR = NodeAddr<DefNode*>(Ds[0]).Addr->getRegRef();
516 dbgs() << '<' << Print<RegisterRef>(RR, DFG) << '>';
604 RegisterRef RR = R.first;
605 if (!isRestricted(PA, UA, RR))
606 RR = getRestrictedRegRef(UA);
610 if (!RAI.alias(R.first, RR))
612 for (auto D : getAllReachingDefs(RR, UA))
613 LOX[RR].insert(D.Id)
[all...] |
| HexagonExpandCondsets.cpp | 219 bool operator== (RegisterRef RR) const {
220 return Reg == RR.Reg && Sub == RR.Sub;
222 bool operator!= (RegisterRef RR) const { return !operator==(RR); }
223 bool operator< (RegisterRef RR) const {
224 return Reg < RR.Reg || (Reg == RR.Reg && Sub < RR.Sub);
236 void addRefToMap(RegisterRef RR, ReferenceMap &Map, unsigned Exec)
[all...] |
| /external/opencv/cv/src/ |
| cvundistort.cpp | 379 double A[3][3], RR[3][3], k[5]={0,0,0,0,0}, fx, fy, ifx, ify, cx, cy;
381 CvMat _RR=cvMat(3, 3, CV_64F, RR);
470 double xx = RR[0][0]*x + RR[0][1]*y + RR[0][2];
471 double yy = RR[1][0]*x + RR[1][1]*y + RR[1][2];
472 double ww = 1./(RR[2][0]*x + RR[2][1]*y + RR[2][2])
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 517 TreeTy *RR = getRight(R);
519 if (getHeight(RR) >= getHeight(RL))
520 return createNode(createNode(L,V,RL), R, RR);
527 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /external/opencv/ml/src/ |
| mlboost.cpp | 581 // RR - ... both send to the right
584 double LL = 0, RL = 0, LR, RR;
598 RR = (sum_abs + sum)*0.5;
602 // LR of them are sent to the left by primary split, and RR - to the right.
603 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
613 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
615 best_val = LL + RR;
621 RL += w; RR -= w;
646 // RR - ... both send to the right
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ImmutableSet.h | 514 TreeTy *RR = getRight(R);
516 if (getHeight(RR) >= getHeight(RL))
517 return createNode(createNode(L,V,RL), R, RR);
524 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 522 TreeTy *RR = getRight(R);
524 if (getHeight(RR) >= getHeight(RL))
525 return createNode(createNode(L,V,RL), R, RR);
532 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| ImmutableSet.h | 519 TreeTy *RR = getRight(R);
521 if (getHeight(RR) >= getHeight(RL))
522 return createNode(createNode(L,V,RL), R, RR);
529 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 522 TreeTy *RR = getRight(R);
524 if (getHeight(RR) >= getHeight(RL))
525 return createNode(createNode(L,V,RL), R, RR);
532 return createNode(createNode(L,V,RLL), RL, createNode(RLR,R,RR));
[all...] |
