| /external/libopus/celt/ |
| celt.c | 92 opus_val32 x0, x1, x2, x3, x4; local
96 x2 = x[-T];
102 + MULT16_32_Q15(g10,x2)
106 x3=x2;
107 x2=x1;
121 opus_val32 x0, x1, x2, x3, x4; local
141 x2 = x[-T1 ];
153 + MULT16_32_Q15(MULT16_16_Q15(f,g10),x2)
157 x3=x2;
158 x2=x1
[all...] |
| mathops.c | 144 opus_val16 x2; local
146 x2 = MULT16_16_P15(x,x);
147 return ADD16(1,MIN16(32766,ADD32(SUB16(L1,x2), MULT16_16_P15(x2, ADD32(L2, MULT16_16_P15(x2, ADD32(L3, MULT16_16_P15(L4, x2
|
| /external/opencv3/modules/stitching/src/ |
| seam_finders.cpp | 134 int x2 = roi.x - tl2.x + x; local
135 if (y2 >= 0 && x2 >= 0 && y2 < img2.height && x2 < img2.width)
136 submask2.at<uchar>(y + gap, x + gap) = mask2.at<uchar>(y2, x2);
690 float diffL2Square3(const Mat &image1, int y1, int x1, const Mat &image2, int y2, int x2)
694 return static_cast<float>(sqr(r1[3*x1] - r2[3*x2]) + sqr(r1[3*x1+1] - r2[3*x2+1]) +
695 sqr(r1[3*x1+2] - r2[3*x2+2]));
700 float diffL2Square4(const Mat &image1, int y1, int x1, const Mat &image2, int y2, int x2)
704 return static_cast<float>(sqr(r1[4*x1] - r2[4*x2]) + sqr(r1[4*x1+1] - r2[4*x2+1])
[all...] |
| /external/opencv3/samples/cpp/ |
| drawing.cpp | 27 int x1 = -width/2, x2 = width*3/2, y1 = -height/2, y2 = height*3/2; local
37 pt1.x = rng.uniform(x1, x2);
39 pt2.x = rng.uniform(x1, x2);
52 pt1.x = rng.uniform(x1, x2);
54 pt2.x = rng.uniform(x1, x2);
68 center.x = rng.uniform(x1, x2);
86 pt[0][0].x = rng.uniform(x1, x2);
88 pt[0][1].x = rng.uniform(x1, x2);
90 pt[0][2].x = rng.uniform(x1, x2);
92 pt[1][0].x = rng.uniform(x1, x2);
[all...] |
| /external/pdfium/third_party/agg23/ |
| agg_rendering_buffer.h | 29 int x1, x2; member in struct:agg::rendering_buffer::row_data
33 x1(x1_), x2(x2_), ptr(ptr_) {}
|
| /external/valgrind/memcheck/tests/ |
| mempool.c | 115 char *x1, *x2, *x3, *x4, *x5; local
122 x2 = allocate(p, 20);
128 *x2 = 'b'; // valid
139 *x2 = 'f'; // valid
|
| mempool2.c | 118 char *x1, *x2; local
131 x2 = allocate(p2, 20);
140 res += x2[-1]; // invalid
141 res += x2[20]; // invalid
150 VALGRIND_MEMPOOL_FREE(p2, x2);
151 res += x2[11];
159 VALGRIND_MEMPOOL_FREE(p2, x2);
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| get_pred_adv_b_add.cpp | 867 uint32 x1, x2, x1m, x2m, y1, y2, y1m, y2m; /* new way */ local
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/ |
| armVCM4P10_InterpolateLuma_Align_unsafe_s.s | 49 x2 RN 11 label
90 LDM pSrc, {x0, x1, x2}
96 STM pDst!, {x0, x1, x2} ;// Store aligned output row
101 LDM pSrc, {x0, x1, x2}
110 ORR x1, x1, x2, LSL #24
111 MOV x2, x2, LSR #8
112 STM pDst!, {x0, x1, x2} ;// Store aligned output row
117 LDM pSrc, {x0, x1, x2}
126 ORR x1, x1, x2, LSL #1
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src/ |
| armVCM4P10_InterpolateLuma_Align_unsafe_s.s | 49 x2 RN 11 label
90 LDM pSrc, {x0, x1, x2}
96 STM pDst!, {x0, x1, x2} ;// Store aligned output row
101 LDM pSrc, {x0, x1, x2}
110 ORR x1, x1, x2, LSL #24
111 MOV x2, x2, LSR #8
112 STM pDst!, {x0, x1, x2} ;// Store aligned output row
117 LDM pSrc, {x0, x1, x2}
126 ORR x1, x1, x2, LSL #1
[all...] |
| /frameworks/base/libs/hwui/ |
| ShadowTessellator.cpp | 132 double x2 = poly[p2].x; local
134 double a = (x1 * y2 - x2 * y1);
135 sumx += (x1 + x2) * a;
|
| /frameworks/rs/cpu_ref/ |
| rsCpuIntrinsicLUT.cpp | 64 uint32_t x2 = xend; local
71 while (x1 < x2) {
|
| /system/bt/embdrv/sbc/encoder/srce/ |
| sbc_dct.c | 87 register SINT32 x0, x1, x2, x3, x4, x5, x6, x7,temp; local
94 x2 = (pInVect[2] + pInVect[6]) >>1;
106 /* rearrangement of x2 and x6 as in (15) */
107 x2 -=x6;
110 /* 2-point IDCT of x2 and x6 and post-multiplication as in (15) */
112 temp = x2 ;
113 SBC_IDCT_MULT(SBC_COS_PI_SUR_8,( x2 + x6 ), x2); /*x2 = ( x2 + x6 ) * cos(1*pi/8) ; *
209 SINT32 temp,x2; local
[all...] |
| /external/libvncserver/webclients/novnc/include/ |
| display.js | 29 this._cleanRect = { 'x1': 0, 'y1': 0, 'x2': -1, 'y2': -1 };
137 if (width < vp.w && cr.x2 > vp.x + width - 1) {
138 cr.x2 = vp.x + width - 1;
196 if (vx2 < cr.x2) {
197 cr.x2 = vx2;
252 'w': cr.x2 - cr.x1 + 1, 'h': cr.y2 - cr.y1 + 1 };
255 if (cr.x1 >= cr.x2 || cr.y1 >= cr.y2) {
268 if (vx2 > cr.x2) {
270 dirtyBoxes.push({'x': cr.x2 + 1, 'y': vp.y,
271 'w': vx2 - cr.x2, 'h': vp.h})
336 var x2 = new_x - this._viewportLoc.x; variable
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_tanhl.c | 115 long double hi,lo,s,x2,x4,z; local
137 x2 = x*x;
139 x4 = x2*x2;
140 RETURNI(((T19*x2 + T17)*x4 + (T15*x2 + T13))*(x2*x*x2*x4*x4) +
141 ((T11*x2 + T9)*x4 + (T7*x2 + T5))*(x2*x*x2)
[all...] |
| /device/google/contexthub/lib/nanohub/ |
| aes.c | 206 uint32_t x0, x1, x2, x3; //we CAN use an array, but then GCC will not use registers. so we use separate vars. sigh... local
212 x2 = *src++ ^ *k++;
222 ror(FwdTab0[(x2 >> 8) & 0xff], 16) ^
227 ror(FwdTab0[(x2 >> 16) & 0xff], 8) ^
232 ror(FwdTab0[(x2 >> 24) & 0xff], 0) ^
241 ror(FwdTab0[(x2 >> 0) & 0xff], 24);
245 x2 = t2;
252 (((uint32_t)(FwdSbox[(x2 >> 8) & 0xff])) << 8) ^
257 (((uint32_t)(FwdSbox[(x2 >> 16) & 0xff])) << 16) ^
262 (((uint32_t)(FwdSbox[(x2 >> 24) & 0xff])) << 24)
276 uint32_t x0, x1, x2, x3; local
[all...] |
| /device/google/dragon/audio/hal/dsp/ |
| eq.c | 49 float x2 = q->x2; local
60 + b1*x1 + b2*x2
63 x2 = x1;
69 q->x2 = x2;
84 float x2 = q->x2; local
95 + b1*x1 + b2*x2
98 x2 = x1
111 float x2 = q->x2; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| MullerSolver.java | 200 // [x0, x2] is the bracketing interval in each iteration
201 // x1 is the last approximation and an interpolation point in (x0, x2)
207 double x2 = max; local
208 double y2 = f.value(x2);
209 double x1 = 0.5 * (x0 + x2);
224 // x0, x1, x2 and x is the zero of the interpolating parabola.
226 // real roots and we choose one in [x0, x2] to be x.
228 final double d12 = (y2 - y1) / (x2 - x1);
229 final double d012 = (d12 - d01) / (x2 - x0);
235 // one of them should lie in (x0, x2)
352 double x2 = 0.5 * (x0 + x1); local
[all...] |
| /external/boringssl/src/crypto/poly1305/ |
| poly1305_arm.c | 43 uint32_t x2 = r->v[4]; local
56 x2 += x1 >> 26;
58 x3 += x2 >> 26;
59 x2 &= 0x3ffffff;
69 y2 = x2 + (y1 >> 26);
80 y2 ^= x2;
92 y2 ^= x2;
106 uint32_t x2 = x->v[4]; local
112 x2 += x1 >> 26;
114 x3 += x2 >> 26
[all...] |
| /external/ceres-solver/examples/ |
| more_garbow_hillstrom.cc | 86 const T x2 = x[1]; member in namespace:ceres::examples
87 residual[0] = T(10.0) * (x2 - x1 * x1);
101 const T x2 = x[1]; member in namespace:ceres::examples
102 residual[0] = T(-13.0) + x1 + ((T(5.0) - x2) * x2 - T(2.0)) * x2;
103 residual[1] = T(-29.0) + x1 + ((x2 + T(1.0)) * x2 - T(14.0)) * x2;
116 const T x2 = x[1] member in namespace:ceres::examples
130 const T x2 = x[1]; member in namespace:ceres::examples
145 const T x2 = x[1]; member in namespace:ceres::examples
160 const T x2 = x[1]; member in namespace:ceres::examples
178 const T x2 = x[1]; member in namespace:ceres::examples
196 const T x2 = x[1]; member in namespace:ceres::examples
223 const T x2 = x[1]; member in namespace:ceres::examples
245 const T x2 = x[1]; member in namespace:ceres::examples
[all...] |
| /external/clang/test/ASTMerge/Inputs/ |
| enum1.c | 13 } x2; variable in typeref:enum:E2
|
| enum2.c | 13 } x2; variable in typeref:enum:E2
|
| struct1.c | 21 struct S2 { int i; float f; } x2; variable in typeref:struct:S2
|
| struct2.c | 18 union S2 { int i; float f; } x2; variable in typeref:union:S2
|
| /external/clang/test/CodeGen/ |
| decl.c | 112 typedef struct x2 *x0;
114 struct x2 { struct
|
