HomeSort by relevance Sort by last modified time
    Searched refs:t1 (Results 226 - 250 of 1224) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/boringssl/src/crypto/bn/
add.c 104 BN_ULONG *ap, *bp, *rp, carry, t1, t2; local
134 t1 = *(ap++);
135 t2 = (t1 + 1) & BN_MASK2;
261 register BN_ULONG t1, t2, *ap, *bp, *rp; local
284 t1 = *(ap++);
287 carry = (t1 <= t2);
288 t1 = (t1 - t2 - 1) & BN_MASK2;
290 carry = (t1 < t2);
291 t1 = (t1 - t2) & BN_MASK2
    [all...]
  /external/eigen/test/eigen2/
eigen2_geometry.cpp 138 Transform3 t0, t1, t2; local
147 t1.setIdentity();
148 t1.linear() = q1.toRotationMatrix();
152 t1.prescale(v0);
155 //VERIFY(!ei_isApprox((t1 * Vector3(1,0,0)).norm(), v0.x()));
158 t1.setIdentity();
163 t1.linear() = q1.conjugate().toRotationMatrix();
164 t1.prescale(v1.cwise().inverse());
165 t1.translate(-v0);
167 VERIFY((t0.matrix() * t1.matrix()).isIdentity(test_precision<Scalar>()))
    [all...]
eigen2_geometry_with_eigen2_prefix.cpp 140 Transform3 t0, t1, t2; local
149 t1.setIdentity();
150 t1.linear() = q1.toRotationMatrix();
154 t1.prescale(v0);
157 //VERIFY(!ei_isApprox((t1 * Vector3(1,0,0)).norm(), v0.x()));
160 t1.setIdentity();
165 t1.linear() = q1.conjugate().toRotationMatrix();
166 t1.prescale(v1.cwise().inverse());
167 t1.translate(-v0);
169 VERIFY((t0.matrix() * t1.matrix()).isIdentity(test_precision<Scalar>()))
    [all...]
  /external/openssl/crypto/bn/
bn_asm.c 395 BN_ULONG t1,t2; local
404 t1=a[0]; t2=b[0];
405 r[0]=(t1-t2-c)&BN_MASK2;
406 if (t1 != t2) c=(t1 < t2);
407 t1=a[1]; t2=b[1];
408 r[1]=(t1-t2-c)&BN_MASK2;
409 if (t1 != t2) c=(t1 < t2);
410 t1=a[2]; t2=b[2]
564 BN_ULONG t1,t2; local
673 BN_ULONG t1,t2; local
718 BN_ULONG t1,t2; local
799 BN_ULONG t1,t2; local
    [all...]
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-utf-private.hh 56 unsigned int t1; local
58 (t1 = text[0] - 0x80u) <= 0x3Fu))
60 c = ((c&0x1Fu)<<6) | t1;
68 unsigned int t1, t2; local
70 (t1 = text[0] - 0x80u) <= 0x3Fu &&
73 c = ((c&0xFu)<<12) | (t1<<6) | t2;
83 unsigned int t1, t2, t3; local
85 (t1 = text[0] - 0x80u) <= 0x3Fu &&
89 c = ((c&0x7u)<<18) | (t1<<12) | (t2<<6) | t3;
  /external/harfbuzz_ng/src/
hb-utf-private.hh 56 unsigned int t1; local
58 (t1 = text[0] - 0x80u) <= 0x3Fu))
60 c = ((c&0x1Fu)<<6) | t1;
68 unsigned int t1, t2; local
70 (t1 = text[0] - 0x80u) <= 0x3Fu &&
73 c = ((c&0xFu)<<12) | (t1<<6) | t2;
83 unsigned int t1, t2, t3; local
85 (t1 = text[0] - 0x80u) <= 0x3Fu &&
89 c = ((c&0x7u)<<18) | (t1<<12) | (t2<<6) | t3;
  /external/harfbuzz_ng/test/api/
test-ot-tag.c 40 hb_script_t t1, t2; local
45 hb_ot_tags_from_script (script, &t1, &t2);
47 g_assert_cmphex (t1, ==, tag);
57 hb_script_t t1, t2; local
63 hb_ot_tags_from_script (script, &t1, &t2);
65 g_assert_cmphex (t1, ==, tag1);
75 hb_script_t t1, t2; local
81 hb_ot_tags_from_script (HB_SCRIPT_HIRAGANA, &t1, &t2);
82 g_assert_cmphex (t1, ==, HB_TAG_CHAR4 ("kana"));
  /external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/
x86SP_FFT_CToC_FC32_Fwd_Radix4_ms.c 32 OMX_FC32 t1; local
48 // CSUB t1, in0, in2
49 t1.Re = in0[0] - in2[0];
50 t1.Im = in0[n] - in2[n];
68 // CSUB_ADD_X out3, t1, t3
69 out3[0] = t1.Re - t3.Im;
70 out3[n] = t1.Im + t3.Re;
72 // CADD_SUB_X out1, t1, t3
73 out1[0] = t1.Re + t3.Im;
74 out1[n] = t1.Im - t3.Re
87 OMX_FC32 t1; local
    [all...]
x86SP_FFT_CToC_FC32_Inv_Radix4_ms.c 32 OMX_FC32 t1; local
48 // CSUB t1, in0, in2
49 t1.Re = in0[0] - in2[0];
50 t1.Im = in0[n] - in2[n];
68 // CSUB_ADD_X out1, t1, t3
69 out1[0] = t1.Re - t3.Im;
70 out1[n] = t1.Im + t3.Re;
72 // CADD_SUB_X out3, t1, t3
73 out3[0] = t1.Re + t3.Im;
74 out3[n] = t1.Im - t3.Re
87 OMX_FC32 t1; local
    [all...]
  /external/openssl/crypto/sha/asm/
sha256-armv4.pl 43 $len="r2"; $t1="r2";
44 $T1="r3"; $t3="r3";
67 @ ldr $t1,[$inp],#4 @ $i
74 rev $t1,$t1
76 @ ldrb $t1,[$inp,#3] @ $i
80 orr $t1,$t1,$t2,lsl#8
82 orr $t1,$t1,$t0,lsl#1
    [all...]
  /art/test/051-thread/src/
Main.java 145 PriorityStoringThread t1 = new PriorityStoringThread(false); local
146 t1.setPriority(Thread.MAX_PRIORITY);
147 t1.start();
148 t1.join();
149 if (supportsThreadPriorities() && (t1.getNativePriority() != Thread.MAX_PRIORITY)) {
150 System.out.print("thread priority for t1 was " + t1.getNativePriority() +
  /cts/tests/tests/app/src/android/app/cts/
ActionBarTest.java 48 Tab t1 = createTab("Tab 1"); local
49 mBar.addTab(t1);
51 assertEquals(t1, mBar.getSelectedTab());
52 assertEquals(t1, mBar.getTabAt(0));
57 assertEquals(t1, mBar.getSelectedTab());
77 assertEquals(t1, mBar.getTabAt(1));
  /development/perftests/panorama/
benchmark.cpp 53 struct timespec t1, t2, t3; local
87 clock_gettime(CLOCK_MONOTONIC, &t1);
107 (t3.tv_sec - t1.tv_sec) + (t3.tv_nsec - t1.tv_nsec)/1e9;
109 (t2.tv_sec - t1.tv_sec) + (t2.tv_nsec - t1.tv_nsec)/1e9;
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.h 66 SkDCubic subDivide(double t1, double t2) const;
68 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
71 return cubic.subDivide(t1, t2);
74 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
80 cubic.subDivide(a, d, t1, t2, p);
  /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/
lattice_mips.c 34 int32_t r0, r1, r2, t0, t1, t2, t_ar; local
57 "mul %[t1], %[r1], %[t_ar] \n\t"
61 "addu %[t1], %[t1], %[r0] \n\t"
63 "shra_r.w %[t1], %[t1], 15 \n\t"
66 "addiu %[t1], %[t1], 0x4000 \n\t"
67 "sra %[t1], %[t1], 15 \n\t
140 int t0, t1, t2, t3; local
    [all...]
  /external/libcxx/test/thread/futures/futures.shared_future/
wait.pass.cpp 54 Clock::time_point t1 = Clock::now(); local
56 assert(t1-t0 < ms(5));
68 Clock::time_point t1 = Clock::now(); local
70 assert(t1-t0 < ms(5));
82 Clock::time_point t1 = Clock::now(); local
84 assert(t1-t0 < ms(5));
wait_for.pass.cpp 59 Clock::time_point t1 = Clock::now(); local
61 assert(t1-t0 < ms(5));
75 Clock::time_point t1 = Clock::now(); local
77 assert(t1-t0 < ms(5));
91 Clock::time_point t1 = Clock::now(); local
93 assert(t1-t0 < ms(5));
  /external/libcxx/test/thread/futures/futures.unique_future/
wait.pass.cpp 54 Clock::time_point t1 = Clock::now(); local
56 assert(t1-t0 < ms(5));
68 Clock::time_point t1 = Clock::now(); local
70 assert(t1-t0 < ms(5));
82 Clock::time_point t1 = Clock::now(); local
84 assert(t1-t0 < ms(5));
wait_for.pass.cpp 59 Clock::time_point t1 = Clock::now(); local
61 assert(t1-t0 < ms(50));
75 Clock::time_point t1 = Clock::now(); local
77 assert(t1-t0 < ms(50));
91 Clock::time_point t1 = Clock::now(); local
93 assert(t1-t0 < ms(50));
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeWizard.java 328 * structure and token types in t1. Check text if the pattern has
332 protected boolean _parse(Object t1, TreePattern tpattern, Map labels) {
334 if ( t1==null || tpattern==null ) {
339 if ( adaptor.getType(t1) != tpattern.getType() ) return false;
341 if ( tpattern.hasTextArg && !adaptor.getText(t1).equals(tpattern.getText()) ) {
346 // map label in pattern to node in t1
347 labels.put(tpattern.label, t1);
350 int n1 = adaptor.getChildCount(t1);
356 Object child1 = adaptor.getChild(t1, i);
385 /** Compare t1 and t2; return true if token types/text, structure match exactly
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
CubicSubDivide.cpp 11 Given a cubic c, t1, and t2, find a small cubic segment.
14 s1 = 1 - t1
16 A = c[0]*s1*s1*s1 + 3*c[1]*s1*s1*t1 + 3*c[2]*s1*t1*t1 + c[3]*t1*t1*t1
20 First, compute two reference T values 1/3 and 2/3 from t1 to t2:
22 c(at (2*t1 + t2)/3) ==
    [all...]
  /bionic/libc/arch-mips/bionic/
__bionic_clone.S 42 lw t1,24(sp) # arg
44 sw t1,4(a1) # arg
syscall.S 46 lw t1, 24(sp)
49 sw t1, 20(sp)
  /bionic/libc/arch-mips64/include/machine/
regdef.h 65 #define t1 $13 macro
70 #define t1 $9 macro
  /development/ndk/platforms/android-L/arch-mips64/include/machine/
regdef.h 65 #define t1 $13 macro
70 #define t1 $9 macro

Completed in 1038 milliseconds

1 2 3 4 5 6 7 8 91011>>