| /external/deqp/framework/referencerenderer/ |
| rrVertexAttrib.hpp | 30 namespace rr namespace
178 } // rr
|
| /external/libmojo/ui/gfx/geometry/ |
| rect.cc | 219 int rr = right(); local
227 rr = rect.x();
237 SetByBounds(rx, ry, rr, rb);
|
| rect_f.cc | 108 float rr = std::min(right(), rect.right()); local
111 if (rx >= rr || ry >= rb)
112 rx = ry = rr = rb = 0; // non-intersecting
114 SetRect(rx, ry, rr - rx, rb - ry);
127 float rr = std::max(right(), rect.right()); local
130 SetRect(rx, ry, rr - rx, rb - ry);
143 float rr = right(); local
151 rr = rect.x();
161 SetRect(rx, ry, rr - rx, rb - ry);
254 float rr = std::max(p1.x(), p2.x()) local
[all...] |
| /external/libxaac/decoder/ |
| ixheaacd_tcx_fwd_mdct.c | 177 FLOAT32 rr[1024]; local
183 memcpy(&rr, r, lg * sizeof(FLOAT32));
191 rr[i] = a * rr[i] + b * rr_prev;
192 rr_prev = rr[i];
196 r[i] = rr[2 * i];
197 r[lg / 2 + i] = rr[lg - 2 * i - 1];
|
| /external/mdnsresponder/mDNSPosix/ |
| Identify.c | 364 CacheRecord *rr; local
365 FORALL_CACHERECORDS(slot, cg, rr) mDNS_PurgeCacheResourceRecord(m, rr);
|
| /external/skia/gm/ |
| filterfastbounds.cpp | 38 SkRRect rr; local
39 rr.setRectXY(r, xRad, yRad);
40 canvas->drawRRect(rr, p);
|
| /external/skia/include/core/ |
| SkRRect.h | 23 // add heart rect computation (max rect inside RR)
58 * Enum to capture the various possible subtypes of RR. Accessed
62 // !< The RR has zero width and/or zero height. All radii are zero.
65 //!< The RR is actually a (non-empty) rect (i.e., at least one radius
69 //!< The RR is actually a (non-empty) oval (i.e., all x radii are equal
73 //!< The RR is non-empty and all the x radii are equal & all y radii
78 //!< The RR is non-empty and the two left x radii are equal, the two top
80 //!< neither an rect, oval, nor a simple RR. It is called "nine patch"
82 //!< rect with edges that divide the RR into an 9 rectangular patches:
86 //!< A fully general (non-empty) RR. Some of the x and/or y radii ar
146 SkRRect rr; local
152 SkRRect rr; local
158 SkRRect rr; local
[all...] |
| /external/skia/tests/ |
| DrawPathTest.cpp | 325 SkRRect rr; local
326 rr.setRectRadii(r, radii);
327 canvas->drawRRect(rr, p);
340 SkRRect rr; local
341 rr.setRectRadii(r, radii);
342 canvas->clipRRect(rr);
|
| /external/skqp/gm/ |
| filterfastbounds.cpp | 38 SkRRect rr; local
39 rr.setRectXY(r, xRad, yRad);
40 canvas->drawRRect(rr, p);
|
| /external/skqp/include/core/ |
| SkRRect.h | 23 // add heart rect computation (max rect inside RR)
58 * Enum to capture the various possible subtypes of RR. Accessed
62 // !< The RR has zero width and/or zero height. All radii are zero.
65 //!< The RR is actually a (non-empty) rect (i.e., at least one radius
69 //!< The RR is actually a (non-empty) oval (i.e., all x radii are equal
73 //!< The RR is non-empty and all the x radii are equal & all y radii
78 //!< The RR is non-empty and the two left x radii are equal, the two top
80 //!< neither an rect, oval, nor a simple RR. It is called "nine patch"
82 //!< rect with edges that divide the RR into an 9 rectangular patches:
86 //!< A fully general (non-empty) RR. Some of the x and/or y radii ar
147 SkRRect rr; local
153 SkRRect rr; local
159 SkRRect rr; local
[all...] |
| /external/skqp/tests/ |
| DrawPathTest.cpp | 325 SkRRect rr; local
326 rr.setRectRadii(r, radii);
327 canvas->drawRRect(rr, p);
340 SkRRect rr; local
341 rr.setRectRadii(r, radii);
342 canvas->clipRRect(rr);
|
| /external/syslinux/core/legacynet/ |
| dnsresolv.c | 44 uint16_t rdlength; /* The lenght of this rr data */
229 struct dnsrr *rr; local
330 rr = (struct dnsrr *)p;
331 rd_len = ntohs(rr->rdlength);
332 if (same && ntohs(rr->class) == CLASS_IN) {
333 switch (ntohs(rr->type)) {
336 result = *(uint32_t *)rr->rdata;
342 rr->rdata, DNSRecvBuf);
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| base_rendezvous_mgr.cc | 61 auto rr = Create(step_id, worker_env_); local
62 iter = table_.insert({step_id, rr}).first;
|
| /external/webrtc/webrtc/modules/audio_processing/intelligibility/ |
| intelligibility_enhancer.cc | 281 size_t lll, ll, rr, rrr; local
294 rr = static_cast<size_t>(round(
298 rr = min(freqs_, max(rr, kOne)) - 1;
308 step = 1.0f / (rrr - rr);
310 for (size_t j = rr; j <= rrr; ++j) {
314 for (size_t j = ll; j <= rr; ++j) {
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| rtcp_packet_unittest.cc | 309 ReceiverReport rr; local
310 rr.From(kSenderSsrc);
311 EXPECT_TRUE(rr.WithReportBlock(rb));
324 EXPECT_FALSE(rr.BuildExternalBuffer(buffer, kBufferSize, &verifier));
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| c2_11pf.cpp | 123 Word16 rr[][L_CODE],/* i : matrix of autocorrelation */
244 Word16 rr[L_CODE][L_CODE]; local
288 rr,
293 rr,
346 rr, matrix of autocorrelation, double-array of type Word16
406 Word16 rr[][L_CODE], /* i : matrix of autocorrelation */
462 /* alp0 = L_mult(rr[i0][i0], _1_4, pOverflow); */
463 alp0 = (Word32) rr[i0][i0] << 14;
476 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]"
[all...] |
| c2_9pf.cpp | 123 Word16 rr[][L_CODE],/* i : matrix of autocorrelation */
253 Word16 rr[L_CODE][L_CODE];
263 cor_h(h, dn_sign, rr);
264 search_2i40(subNr, dn, rr, codvec);
319 Word16 rr[L_CODE][L_CODE]; local
377 rr,
383 rr,
437 rr = autocorrelation matrix (Word16)
475 Word16 rr[][L_CODE], // i : matrix of autocorrelation
508 alp0 = L_mult(rr[i0][i0], _1_4)
[all...] |
| c3_14pf.cpp | 94 Word16 rr[][L_CODE],/* i : matrix of autocorrelation */
218 Word16 rr[L_CODE][L_CODE]; local
261 rr,
267 rr,
318 rr[][L_CODE] Double Array of type Word16 -- autocorrelation matrix
376 Word16 rr[][L_CODE], /* i : matrix of autocorrelation */
437 /* account for ptr. init. (rr[io]) */
444 /* alp0 = L_mult(rr[i0][i0],_1_4, pOverflow); */
445 alp0 = (Word32) rr[i0][i0] << 14;
460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]"
[all...] |
| c4_17pf.cpp | 103 Word16 rr[][L_CODE],/* i : matrix of autocorrelation */
229 Word16 rr[L_CODE][L_CODE]; local
271 rr,
277 rr,
330 rr[][L_CODE] Double Array of type Word16 -- autocorrelation matrix
389 Word16 rr[][L_CODE], /* i : matrix of autocorrelation */
457 alp0 = (Word32) rr[i0][i0] << 14;
472 * "rr[i0][i3]" is a pointer initialized to "&rr[i0][ipos[3]]" *
482 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[all...] |
| c8_31pf.cpp | 765 Word16 rr[L_CODE][L_CODE]; local
795 rr,
803 rr,
|
| /frameworks/base/core/tests/coretests/src/android/graphics/ |
| BitmapTest.java | 214 int rr = computePrePostMul(a0, r0); local
215 assertTrue("red", Math.abs(rr - r1) <= tolerance);
228 int cc = Color.argb(a0, rr, gg, bb);
|
| /frameworks/base/services/tests/servicestests/src/com/android/server/pm/ |
| ShortcutManagerTest7.java | 57 final ResultReceiver rr = new ResultReceiver(mHandler) { local
72 args, null, rr);
|
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/ |
| RILRequest.java | 76 RILRequest rr = null; local
80 rr = sPool;
81 sPool = rr.mNext;
82 rr.mNext = null;
87 if (rr == null) {
88 rr = new RILRequest();
91 rr.mSerial = sNextSerial.getAndIncrement();
93 rr.mRequest = request;
94 rr.mResult = result;
96 rr.mWakeLockType = RIL.INVALID_WAKELOCK
117 RILRequest rr = null; local
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/elliptic/ |
| p256_amd64.go | 133 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
134 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
136 RR := []uint64{0x83244c95be79eea2, 0x4699799c49bd6fa6, 0x2845b2392b6bec59, 0x66e12d94f3d95620}
137 p256OrdMul(table[:4], x, RR)
219 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
221 var rr = []uint64{0x0000000000000003, 0xfffffffbffffffff, 0xfffffffffffffffe, 0x00000004fffffffd} var
241 p256Mul(r2.xyz[0:4], r2.xyz[0:4], rr[:])
242 p256Mul(r2.xyz[4:8], r2.xyz[4:8], rr[:])
278 p256Mul(r.xyz[0:4], r.xyz[0:4], rr[:])
279 p256Mul(r.xyz[4:8], r.xyz[4:8], rr[:]
[all...] |
| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| p256_amd64.go | 133 // multiplication of x and y in the calculates (x × y × R^-1) mod n. RR
134 // is R×R mod n thus the Montgomery multiplication x and RR gives x×R,
136 RR := []uint64{0x83244c95be79eea2, 0x4699799c49bd6fa6, 0x2845b2392b6bec59, 0x66e12d94f3d95620}
137 p256OrdMul(table[:4], x, RR)
219 // underlying field of the curve. (See initP256 for the value.) Thus rr here is
221 var rr = []uint64{0x0000000000000003, 0xfffffffbffffffff, 0xfffffffffffffffe, 0x00000004fffffffd} var
241 p256Mul(r2.xyz[0:4], r2.xyz[0:4], rr[:])
242 p256Mul(r2.xyz[4:8], r2.xyz[4:8], rr[:])
278 p256Mul(r.xyz[0:4], r.xyz[0:4], rr[:])
279 p256Mul(r.xyz[4:8], r.xyz[4:8], rr[:]
[all...] |
