| /external/autotest/client/cros/netprotos/ |
| zeroconf.py | 29 """Returns whether the two dpkt.dns.DNS.RR objects are equal."""
30 # Compare all the members present in either object and on any RR object.
32 dpkt.dns.DNS.RR.__slots__)
33 # On RR objects, rdata is packed based on the other members and the final
34 # packed string depends on other RR and Q elements on the same DNS/mDNS
170 for rr in answers: # Answers RRs
173 if rr.type == dpkt.dns.DNS_A:
174 data = socket.inet_ntoa(rr.ip)
175 elif rr.type == dpkt.dns.DNS_PTR:
176 data = rr.ptrnam
[all...] |
| zeroconf_unittest.py | 30 @return a list of dpkt.dns.DNS.RR objects, one for each matching record.
113 dpkt.dns.DNS.RR(
119 dpkt.dns.DNS.RR(
|
| /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...] |
| /toolchain/binutils/binutils-2.25/include/opcode/ |
| spu.h | 30 RR,
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonBitSimplify.cpp | 167 static bool getSubregMask(const BitTracker::RegisterRef &RR,
182 const BitTracker::RegisterRef &RR, MachineRegisterInfo &MRI);
363 bool HexagonBitSimplify::getSubregMask(const BitTracker::RegisterRef &RR,
365 const TargetRegisterClass *RC = MRI.getRegClass(RR.Reg);
367 assert(RR.Sub == 0);
373 if (RR.Sub == 0) {
378 assert(RR.Sub == Hexagon::subreg_loreg || RR.Sub == Hexagon::subreg_hireg);
380 Begin = (RR.Sub == Hexagon::subreg_loreg ? 0 : 32);
850 const BitTracker::RegisterRef &RR, MachineRegisterInfo &MRI)
[all...] |
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| rsaz_exp.c | 71 const BN_ULONG m_norm[16], const BN_ULONG RR[16], BN_ULONG k0)
92 rsaz_1024_norm2red_avx2(R2, RR);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/hppa/unsorted/ |
| brlenbug.s | 196 ldw RR'done___2-$global$(%r1),%r20 ;# 94 reload_outsi+2/5
202 ldo RR're_syntax_table-$global$(%r1),%r4 ;# 100 movhi-2
217 ldo RR're_syntax_table-$global$(%r1),%r19 ;# 8715 movhi-2
228 ldo RR're_syntax_table-$global$+48(%r1),%r19 ;# 8711 movhi-2
234 ldo RR're_syntax_table-$global$(%r1),%r19 ;# 175 movhi-2
239 stw %r19,RR'done___2-$global$(%r1) ;# 181 reload_outsi+2/6
[all...] |
| /external/webrtc/webrtc/test/ |
| rtcp_packet_parser.cc | 35 receiver_report_.Set(parser.Packet().RR);
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| tc-arm.c | [all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| nat.go | 1101 rr := make(nat, numWords)
1102 copy(rr, x)
1103 x = rr
1117 // RR = 2**(2*_W*len(m)) mod m
1118 RR := nat(nil).setWord(1)
1119 zz := nat(nil).shl(RR, uint(2*numWords*_W))
1120 _, RR = RR.div(RR, zz, m)
1121 if len(RR) < numWords
[all...] |
| /prebuilts/go/linux-x86/src/math/big/ |
| nat.go | 1101 rr := make(nat, numWords)
1102 copy(rr, x)
1103 x = rr
1117 // RR = 2**(2*_W*len(m)) mod m
1118 RR := nat(nil).setWord(1)
1119 zz := nat(nil).shl(RR, uint(2*numWords*_W))
1120 _, RR = RR.div(RR, zz, m)
1121 if len(RR) < numWords
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/elliptic/ |
| p256_amd64.go | 115 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
116 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
118 RR := []uint64{0x83244c95be79eea2, 0x4699799c49bd6fa6, 0x2845b2392b6bec59, 0x66e12d94f3d95620}
119 p256OrdMul(table[:4], x, RR)
201 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
203 var rr = []uint64{0x0000000000000003, 0xfffffffbffffffff, 0xfffffffffffffffe, 0x00000004fffffffd} var
221 p256Mul(r2.xyz[0:4], r2.xyz[0:4], rr[:])
222 p256Mul(r2.xyz[4:8], r2.xyz[4:8], rr[:])
251 p256Mul(r.xyz[0:4], r.xyz[0:4], rr[:])
252 p256Mul(r.xyz[4:8], r.xyz[4:8], rr[:]
[all...] |
| p256_s390x.go | 108 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
109 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
111 RR := []byte{0x66, 0xe1, 0x2d, 0x94, 0xf3, 0xd9, 0x56, 0x20, 0x28, 0x45, 0xb2, 0x39, 0x2b, 0x6b, 0xec, 0x59,
114 p256OrdMul(table[0][:], x, RR)
187 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
189 var rr = []byte{0x00, 0x00, 0x00, 0x04, 0xff, 0xff, 0xff, 0xfd, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, var
210 p256MulAsm(r2.x[:], r2.x[:], rr[:])
211 p256MulAsm(r2.y[:], r2.y[:], rr[:])
229 p256MulAsm(r.x[:], r.x[:], rr[:])
230 p256MulAsm(r.y[:], r.y[:], rr[:]
[all...] |
| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| p256_amd64.go | 115 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
116 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
118 RR := []uint64{0x83244c95be79eea2, 0x4699799c49bd6fa6, 0x2845b2392b6bec59, 0x66e12d94f3d95620}
119 p256OrdMul(table[:4], x, RR)
201 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
203 var rr = []uint64{0x0000000000000003, 0xfffffffbffffffff, 0xfffffffffffffffe, 0x00000004fffffffd} var
221 p256Mul(r2.xyz[0:4], r2.xyz[0:4], rr[:])
222 p256Mul(r2.xyz[4:8], r2.xyz[4:8], rr[:])
251 p256Mul(r.xyz[0:4], r.xyz[0:4], rr[:])
252 p256Mul(r.xyz[4:8], r.xyz[4:8], rr[:]
[all...] |
| p256_s390x.go | 108 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
109 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
111 RR := []byte{0x66, 0xe1, 0x2d, 0x94, 0xf3, 0xd9, 0x56, 0x20, 0x28, 0x45, 0xb2, 0x39, 0x2b, 0x6b, 0xec, 0x59,
114 p256OrdMul(table[0][:], x, RR)
187 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
189 var rr = []byte{0x00, 0x00, 0x00, 0x04, 0xff, 0xff, 0xff, 0xfd, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, var
210 p256MulAsm(r2.x[:], r2.x[:], rr[:])
211 p256MulAsm(r2.y[:], r2.y[:], rr[:])
229 p256MulAsm(r.x[:], r.x[:], rr[:])
230 p256MulAsm(r.y[:], r.y[:], rr[:]
[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/llvm/lib/CodeGen/ |
| AggressiveAntiDepBreaker.cpp | 392 AggressiveAntiDepState::RegisterReference RR = { &MO, RC };
393 RegRefs.insert(std::make_pair(Reg, RR));
476 AggressiveAntiDepState::RegisterReference RR = { &MO, RC };
477 RegRefs.insert(std::make_pair(Reg, RR));
[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...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| AggressiveAntiDepBreaker.cpp | 408 AggressiveAntiDepState::RegisterReference RR = { &MO, RC };
409 RegRefs.insert(std::make_pair(Reg, RR));
483 AggressiveAntiDepState::RegisterReference RR = { &MO, RC };
484 RegRefs.insert(std::make_pair(Reg, RR));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/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-3960126/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-3977809/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-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/linux-x86/clang-3957855/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/linux-x86/clang-3960126/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...] |
