Searched refs:r2 (Results 1 - 25 of 994) sorted by path

1234567891011>>

/external/aac/libFDK/src/arm/
H A Ddct_arm.cpp103 r2 pDat_0
118 LDR r5, [r2, #0] // accu2 = pDat_0[0]
129 LDR r6, [r2, #4] // accu3 = pDat_0[1]
137 STR r5, [r2], #4 // *pDat_0++ = accu2
138 STR r4, [r2], #4 // *pDat_0++ = accu1
144 LDR r5, [r2, #0] // accu2 = pDat_0[0]
155 LDR r6, [r2, #4] // accu3 = pDat_0[1]
163 STR r5, [r2], #4 // *pDat_0++ = accu2
164 STR r4, [r2], #4 // *pDat_0++ = accu1
282 r2 pDat_
[all...]
/external/aac/libFDK/src/
H A Dfft.cpp108 FIXP_DBL r1,r2; local
112 r2 = fMult((pDat[2] - pDat[4]), C31);
125 pDat[3] = s1 + r2;
126 pDat[5] = s1 - r2;
141 FIXP_DBL r1,r2,r3,r4; local
149 r2 = pDat[4] - pDat[6];
158 t = fMult((r4 + r2), C51);
162 r2 = t + fMult(r2, C53);
189 pDat[3] = s1 - r2;
240 FIXP_DBL r1,r2,r3; local
[all...]
H A Dqmf.cpp802 FIXP_QMF r1, i1, r2, i2; local
805 r2 = tReal[L - i - 1];
810 tReal[L - i - 1] = (r2 - i2)>>1;
811 tImag[i] = -(r2 + i2)>>1;
818 FIXP_QMF r1, i1, r2, i2; local
821 r2 = -tReal[L - i - 1];
826 tReal[L - i - 1] = (r2 - i2)>>1;
827 tImag[i] = -(r2 + i2)>>1;
/external/aac/libSBRdec/src/arm/
H A Denv_calc_arm.cpp111 r2 imTmp
125 LDR r5, [r2], #4
133 LDR r5, [r2], #4
/external/aac/libSBRenc/src/
H A Dton_corr.cpp126 INT i, k, r, r2, timeIndex, autoCorrScaling; local
288 r2 = r; /* (INT) pow(-1, band); */
291 r2 = r + 1; /* (INT) pow(-1, band+1); */
293 signMatrix[timeIndex][r] = 1 - 2*(r2 & 0x1);
/external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/
H A DgUnit.g103 : ( r1=RULE_REF ('walks' r2=RULE_REF)?
105 if ( $r2==null ) ts = new gUnitTestSuite($r1.text);
106 else ts = new gUnitTestSuite($r1.text, $r2.text);
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
H A DITreeFixture.cs158 ITree r2 = new CommonTree(new CommonToken(106));
159 r2.AddChild(new CommonTree(new CommonToken(107)));
160 r1.AddChild(r2);
H A DITreeNodeStreamFixture.cs202 ITree r2 = new CommonTree(new CommonToken(106));
203 r2.AddChild(new CommonTree(new CommonToken(107)));
204 r1.AddChild(r2);
239 ITree r2 = new CommonTree(new CommonToken(106));
240 r2.AddChild(new CommonTree(new CommonToken(107)));
241 r1.AddChild(r2);
286 ITree r2 = new CommonTree(new CommonToken(106));
287 r2.AddChild(new CommonTree(new CommonToken(107)));
288 r1.AddChild(r2);
327 ITree r2
[all...]
/external/antlr/antlr-3.4/runtime/Python/unittests/
H A Dtesttree.py184 r2 = CommonTree(CommonToken(106))
185 r2.addChild(CommonTree(CommonToken(107)))
186 r1.addChild(r2)
217 r2 = CommonTree(CommonToken(106))
218 r2.addChild(CommonTree(CommonToken(107)))
219 r1.addChild(r2)
261 r2 = CommonTree(CommonToken(106))
262 r2.addChild(CommonTree(CommonToken(107)))
263 r1.addChild(r2)
300 r2
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/
H A Dconstruction.rb45 r2
396 ast_test :input => "assert 2+3", :rule => :r2, :ast => "(assert (+ 2 3))"
398 ast_test :input => "assert 2+3 : 5", :rule => :r2, :ast => "(assert (+ 2 3) 5)"
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/
H A Dcalc.rb28 '+' r2=mult { $result += $r2.result }
29 | '-' r2=mult { $result -= $r2.result }
36 '*' r2=log {$result *= $r2.result}
37 | '/' r2=log {$result /= $r2.result}
38 | '%' r2=log {$result \%= $r2
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
H A Dtest-trees.rb167 r2 = new_node new_token(106)
168 r2.add_child new_node( new_token 107 )
169 r1.add_child r2
193 r2 = new_node new_token(106)
194 r2.add_child new_node( new_token 107 )
195 r1.add_child r2
226 r2 = new_node new_token(106)
227 r2.add_child new_node( new_token 107 )
228 r1.add_child r2
260 r2
[all...]
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DANTLR.g643 ( ( OR a2=alternative r2=rewrite
645 -> $ruleAltList $a2 $r2?
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestBufferedTreeNodeStream.java56 Tree r2 = new CommonTree(new CommonToken(106));
57 r2.addChild(new CommonTree(new CommonToken(107)));
58 r1.addChild(r2);
H A DTestTreeNodeStream.java175 Tree r2 = new CommonTree(new CommonToken(106));
176 r2.addChild(new CommonTree(new CommonToken(107)));
177 r1.addChild(r2);
206 Tree r2 = new CommonTree(new CommonToken(106));
207 r2.addChild(new CommonTree(new CommonToken(107)));
208 r1.addChild(r2);
251 Tree r2 = new CommonTree(new CommonToken(106));
252 r2.addChild(new CommonTree(new CommonToken(107)));
253 r1.addChild(r2);
290 Tree r2
[all...]
H A DTestTrees.java154 Tree r2 = new CommonTree(new CommonToken(106));
155 r2.addChild(new CommonTree(new CommonToken(107)));
156 r1.addChild(r2);
/external/apache-harmony/logging/src/test/java/org/apache/harmony/logging/tests/java/util/logging/
H A DConsoleHandlerTest.java364 LogRecord r2 = new LogRecord(Level.INFO, "testPublish_Record2");
370 assertTrue(h.isLoggable(r2));
371 h.publish(r2);
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DNodeSorter.java161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,
168 n2Num = r2.num();
224 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,
228 n2String = k.m_col.getCollationKey(r2.str());
533 XObject r2 = k2.m_selectPat.execute(m_execContext, node,
537 d = r2.num();
540 m_key2Value = k2.m_col.getCollationKey(r2.str());
/external/bison/src/
H A Doutput.c213 | Prepare the muscles related to the rules: rhs, prhs, r1, r2, |
226 unsigned int *r2 = xnmalloc (nrules, sizeof *r2); local
241 r2[r] = i - prhs[r];
257 muscle_insert_unsigned_int_table ("r2", r2, 0, 0, nrules);
268 free (r2);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
H A DAESEngine.java476 int r, r0, r1, r2, r3;
489 r2 = T0[C2&255] ^ shift(T0[(C3>>8)&255], 24) ^ shift(T0[(C0>>16)&255], 16) ^ shift(T0[(C1>>24)&255], 8) ^ KW[r][2];
491 C0 = T0[r0&255] ^ shift(T0[(r1>>8)&255], 24) ^ shift(T0[(r2>>16)&255], 16) ^ shift(T0[(r3>>24)&255], 8) ^ KW[r][0];
492 C1 = T0[r1&255] ^ shift(T0[(r2>>8)&255], 24) ^ shift(T0[(r3>>16)&255], 16) ^ shift(T0[(r0>>24)&255], 8) ^ KW[r][1];
493 C2 = T0[r2&255] ^ shift(T0[(r3>>8)&255], 24) ^ shift(T0[(r0>>16)&255], 16) ^ shift(T0[(r1>>24)&255], 8) ^ KW[r][2];
494 C3 = T0[r3&255] ^ shift(T0[(r0>>8)&255], 24) ^ shift(T0[(r1>>16)&255], 16) ^ shift(T0[(r2>>24)&255], 8) ^ KW[r++][3];
499 r2 = T0[C2&255] ^ shift(T0[(C3>>8)&255], 24) ^ shift(T0[(C0>>16)&255], 16) ^ shift(T0[(C1>>24)&255], 8) ^ KW[r][2];
504 C0 = (S[r0&255]&255) ^ ((S[(r1>>8)&255]&255)<<8) ^ ((S[(r2>>16)&255]&255)<<16) ^ (S[(r3>>24)&255]<<24) ^ KW[r][0];
505 C1 = (S[r1&255]&255) ^ ((S[(r2>>8)&255]&255)<<8) ^ ((S[(r3>>16)&255]&255)<<16) ^ (S[(r0>>24)&255]<<24) ^ KW[r][1];
506 C2 = (S[r2
[all...]
H A DAESFastEngine.java806 int r, r0, r1, r2, r3;
818 r2 = T0[C2&255] ^ T1[(C3>>8)&255] ^ T2[(C0>>16)&255] ^ T3[(C1>>24)&255] ^ KW[r][2];
820 C0 = T0[r0&255] ^ T1[(r1>>8)&255] ^ T2[(r2>>16)&255] ^ T3[(r3>>24)&255] ^ KW[r][0];
821 C1 = T0[r1&255] ^ T1[(r2>>8)&255] ^ T2[(r3>>16)&255] ^ T3[(r0>>24)&255] ^ KW[r][1];
822 C2 = T0[r2&255] ^ T1[(r3>>8)&255] ^ T2[(r0>>16)&255] ^ T3[(r1>>24)&255] ^ KW[r][2];
823 C3 = T0[r3&255] ^ T1[(r0>>8)&255] ^ T2[(r1>>16)&255] ^ T3[(r2>>24)&255] ^ KW[r++][3];
828 r2 = T0[C2&255] ^ T1[(C3>>8)&255] ^ T2[(C0>>16)&255] ^ T3[(C1>>24)&255] ^ KW[r][2];
833 C0 = (S[r0&255]&255) ^ ((S[(r1>>8)&255]&255)<<8) ^ ((S[(r2>>16)&255]&255)<<16) ^ (S[(r3>>24)&255]<<24) ^ KW[r][0];
834 C1 = (S[r1&255]&255) ^ ((S[(r2>>8)&255]&255)<<8) ^ ((S[(r3>>16)&255]&255)<<16) ^ (S[(r0>>24)&255]<<24) ^ KW[r][1];
835 C2 = (S[r2
[all...]
/external/ceres-solver/examples/
H A Dlibmv_bundle_adjuster.cc470 T r2 = x*x + y*y; local
471 T r4 = r2 * r2;
472 T r6 = r4 * r2;
473 T r_coeff = (T(1) + k1*r2 + k2*r4 + k3*r6);
474 T xd = x * r_coeff + T(2)*p1*x*y + p2*(r2 + T(2)*x*x);
475 T yd = y * r_coeff + T(2)*p2*x*y + p1*(r2 + T(2)*y*y);
H A Dsimple_bundle_adjuster.cc148 T r2 = xp*xp + yp*yp; local
149 T distortion = T(1.0) + r2 * (l1 + l2 * r2);
H A Dsnavely_reprojection_error.h80 T r2 = xp*xp + yp*yp; local
81 T distortion = T(1.0) + r2 * (l1 + l2 * r2);
143 T r2 = xp*xp + yp*yp; local
144 T distortion = T(1.0) + r2 * (l1 + l2 * r2);

Completed in 768 milliseconds

1234567891011>>