HomeSort by relevance Sort by last modified time
    Searched refs:t1 (Results 351 - 375 of 1329) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/sqlite/src/test/
laststmtchanges.test 106 create table t1 (k integer primary key);
108 create trigger r1 after insert on t1 for each row begin
113 insert into t1 values (77);
134 # 1 from "insert into t1 values(77)" +
151 create trigger r1 after update on t1 for each row begin
156 update t1 set k=k;
183 create trigger r1 before delete on t1 for each row begin
188 delete from t1;
215 drop table t0; drop table t1; drop table t2;
217 create temp table t1 (k integer primary key)
    [all...]
  /external/icu4c/test/cintltst/
utransts.c 245 UTransliterator* t1=NULL; local
272 t1=utrans_open(TransID[i], UTRANS_FORWARD,NULL,0,NULL, &status);
273 if(t1 == NULL || U_FAILURE(status)){
277 inverse1=utrans_openInverse(t1, &status);
286 utrans_close(t1);
293 UTransliterator* t1=NULL; local
300 t1=utrans_open("Latin-Devanagari", UTRANS_FORWARD, NULL,0,NULL,&status);
308 utrans_close(t1);
312 t3=utrans_clone(t1, &status);
315 utrans_getID(t1, buf1, BUF_CAP)
340 UTransliterator* t1=NULL; local
    [all...]
  /external/mesa3d/src/mesa/program/
prog_noise.c 219 float t1 = 1.0f - x1 * x1; local
227 /* if(t1 < 0.0f) t1 = 0.0f; // this never happens for the 1D case */
228 t1 *= t1;
229 n1 = t1 * t1 * grad1(perm[i1 & 0xff], x1);
261 float t0, t1, t2; local
297 t1 = 0.5f - x1 * x1 - y1 * y1;
298 if (t1 < 0.0f
348 float t0, t1, t2, t3; local
531 float t0, t1, t2, t3, t4; local
    [all...]
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 32 t = p0; t1 = *(&(p0)+1); \
34 p1 = t; *(&(p1)+1) = t1
46 int t, t1; local
114 int t0, t1, t2, t3; local
146 t1 = (i0 + i2) >> 1;
151 buf[ 1] = i4 + t1;
153 buf[ 9] = i4 - t1;
165 t1 = MULHIGH(SQRT1_2, r0 + i0);
170 buf[ 7] = i6 - t1;
172 buf[15] = i6 + t1;
192 int t0, t1; local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_datetime.py 288 t1 = timedelta(days=100,
295 self.assertEqual(t1, t2)
298 t1 = timedelta(days=100,
305 self.assertEqual(hash(t1), hash(t2))
307 t1 += timedelta(weeks=7)
309 self.assertEqual(t1, t2)
310 self.assertEqual(hash(t1), hash(t2))
312 d = {t1: 1}
315 self.assertEqual(d[t1], 2)
326 t1 = timedelta(2, 3, 4
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_datetime.py 288 t1 = timedelta(days=100,
295 self.assertEqual(t1, t2)
298 t1 = timedelta(days=100,
305 self.assertEqual(hash(t1), hash(t2))
307 t1 += timedelta(weeks=7)
309 self.assertEqual(t1, t2)
310 self.assertEqual(hash(t1), hash(t2))
312 d = {t1: 1}
315 self.assertEqual(d[t1], 2)
326 t1 = timedelta(2, 3, 4
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/
member_swap.pass.cpp 26 const T t1[] = {0, 1, 2, 3, 4, 5}; local
27 C c1(std::begin(t1), std::end(t1), A(1));
51 const T t1[] = {0, 1, 2, 3, 4, 5}; local
52 C c1(std::begin(t1), std::end(t1), A(1));
105 const T t1[] = {0, 1, 2, 3, 4, 5}; local
106 C c1(std::begin(t1), std::end(t1), A(1));
130 const T t1[] = {0, 1, 2, 3, 4, 5} local
184 const T t1[] = {0, 1, 2, 3, 4, 5}; local
209 const T t1[] = {0, 1, 2, 3, 4, 5}; local
    [all...]
non_member_swap.pass.cpp 27 const T t1[] = {0, 1, 2, 3, 4, 5}; local
28 C c1(std::begin(t1), std::end(t1), A(1));
52 const T t1[] = {0, 1, 2, 3, 4, 5}; local
53 C c1(std::begin(t1), std::end(t1), A(1));
106 const T t1[] = {0, 1, 2, 3, 4, 5}; local
107 C c1(std::begin(t1), std::end(t1), A(1));
131 const T t1[] = {0, 1, 2, 3, 4, 5} local
185 const T t1[] = {0, 1, 2, 3, 4, 5}; local
210 const T t1[] = {0, 1, 2, 3, 4, 5}; local
    [all...]
  /dalvik/vm/mterp/mips/
OP_APUT_OBJECT.S 8 GET_OPA(t1) # t1 <- AA
13 GET_VREG(rBIX, t1) # rBIX <- vAA
41 srl t1, rINST, GC_CARD_SHIFT
42 addu t2, a2, t1
  /external/chromium/third_party/modp_b64/
modp_b64.cc 86 uint8_t t1, t2, t3; local
89 t1 = str[i]; t2 = str[i+1]; t3 = str[i+2];
90 *p++ = e0[t1];
91 *p++ = e1[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)];
100 t1 = str[i];
101 *p++ = e0[t1];
102 *p++ = e1[(t1 & 0x03) << 4];
107 t1 = str[i]; t2 = str[i+1];
108 *p++ = e0[t1];
109 *p++ = e1[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)]
    [all...]
  /external/chromium_org/third_party/modp_b64/
modp_b64.cc 86 uint8_t t1, t2, t3; local
90 t1 = str[i]; t2 = str[i+1]; t3 = str[i+2];
91 *p++ = e0[t1];
92 *p++ = e1[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)];
102 t1 = str[i];
103 *p++ = e0[t1];
104 *p++ = e1[(t1 & 0x03) << 4];
109 t1 = str[i]; t2 = str[i+1];
110 *p++ = e0[t1];
111 *p++ = e1[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)]
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/sha/asm/
sha1-s390x.pl 60 $t1="%r11";
103 rll $t1,$a,5
106 alr $e,$t1
122 rll $t1,$a,5
124 alr $e,$t1
140 rll $t1,$a,5
142 alr $e,$t1
144 lr $t1,$b
146 nr $t1,$c
148 or $t0,$t1
    [all...]
sha1-mips.pl 24 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25));
41 # ($t0,$t1,$t2,$t3,$t8,$t9)=map("\$$_",(12..15,24,25));
90 $t1=$num; # $num is offloaded to stack
99 srl $t1,@X[$i],8
102 andi $t1,0xFF00
105 or $t1,$t2
106 or @X[$i],$t1
113 srl $t1,$a,27
116 addu $e,$t1
133 srl $t1,@X[$i],
    [all...]
sha512-parisc.pl 91 $t1 ="%r29";
105 addl $t1,$h,$h
106 andcm $g,$e,$t1
109 or $t0,$t1,$t1 ; Ch(e,f,g)
112 addl $t1,$h,$h
118 and $a,$c,$t1
121 xor $t1,$t0,$t0
122 and $b,$c,$t1
125 xor $t1,$t0,$t0 ; Maj(a,b,c
    [all...]
  /external/openssl/crypto/sha/asm/
sha1-s390x.pl 60 $t1="%r11";
103 rll $t1,$a,5
106 alr $e,$t1
122 rll $t1,$a,5
124 alr $e,$t1
140 rll $t1,$a,5
142 alr $e,$t1
144 lr $t1,$b
146 nr $t1,$c
148 or $t0,$t1
    [all...]
sha1-mips.pl 24 ($zero,$at,$t0,$t1,$t2)=map("\$$_",(0..2,24,25));
41 # ($t0,$t1,$t2,$t3,$t8,$t9)=map("\$$_",(12..15,24,25));
90 $t1=$num; # $num is offloaded to stack
99 srl $t1,@X[$i],8
102 andi $t1,0xFF00
105 or $t1,$t2
106 or @X[$i],$t1
113 srl $t1,$a,27
116 addu $e,$t1
133 srl $t1,@X[$i],
    [all...]
sha512-parisc.pl 91 $t1 ="%r29";
105 addl $t1,$h,$h
106 andcm $g,$e,$t1
109 or $t0,$t1,$t1 ; Ch(e,f,g)
112 addl $t1,$h,$h
118 and $a,$c,$t1
121 xor $t1,$t0,$t0
122 and $b,$c,$t1
125 xor $t1,$t0,$t0 ; Maj(a,b,c
    [all...]
  /system/core/libpixelflinger/arch-mips/
t32cb16blend.S 193 pixel $t3,$t4,$t1,0
194 sh $t1,-2($a0)
217 pixel $t3,$t4,$t1,0
218 pixel $t3,$t5,$t1,16
219 sw $t1,-8($a0)
233 pixel $t3,$t4,$t1,0
234 pixel $t3,$t5,$t1,16
235 sw $t1,-4($a0)
252 pixel $t3,$t4,$t1,0
253 sh $t1,-2($a0
    [all...]
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/type_traits/
type_with_alignment.hpp 197 typedef ::boost::detail::lower_alignment<Align> t1; typedef in class:boost::detail::type_with_alignment_imp
199 ::boost::detail::is_aligned< ::boost::alignment_of<t1>::value,Align >::value
200 , t1
297 boost::detail::type_with_alignment_imp<8> >::type t1;
299 typedef t1::type type;
306 boost::detail::type_with_alignment_imp<16> >::type t1;
308 typedef t1::type type;
315 boost::detail::type_with_alignment_imp<32> >::type t1;
317 typedef t1::type type;
323 boost::detail::type_with_alignment_imp<64> >::type t1;
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp 41 const double t1 = 2 * i.x2() * b * c local
52 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
54 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
295 SkDPoint t1[3], t2[3]; local
298 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
300 if (t1[1].approximatelyEqual(t2[1])) {
301 *pt = t1[1];
303 SkDebugf("%s t1=%1.9g t2=%1.9g (%1.9g,%1.9g) == (%1.9g,%1.9g)\n", __FUNCTION__,
304 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t2[1].fX, t2[1].fY)
    [all...]
  /external/skia/src/pathops/
SkDQuadIntersection.cpp 41 const double t1 = 2 * i.x2() * b * c local
52 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
54 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
295 SkDPoint t1[3], t2[3]; local
298 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
300 if (t1[1].approximatelyEqual(t2[1])) {
301 *pt = t1[1];
303 SkDebugf("%s t1=%1.9g t2=%1.9g (%1.9g,%1.9g) == (%1.9g,%1.9g)\n", __FUNCTION__,
304 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t2[1].fX, t2[1].fY)
    [all...]
  /external/chromium_org/crypto/
curve25519-donna.c 513 limb t1[10]; local
517 /* 4 */ fsquare(t1,z2);
518 /* 8 */ fsquare(t0,t1);
525 /* 2^7 - 2^2 */ fsquare(t1,t0);
526 /* 2^8 - 2^3 */ fsquare(t0,t1);
527 /* 2^9 - 2^4 */ fsquare(t1,t0);
528 /* 2^10 - 2^5 */ fsquare(t0,t1);
532 /* 2^12 - 2^2 */ fsquare(t1,t0);
534 for (i = 2;i < 10;i += 2) { fsquare(t0,t1); fsquare(t1,t0);
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
x86_64-gcc.c 236 BN_ULONG t1,t2; local
243 t1=a[0]; t2=b[0];
244 r[0]=(t1-t2-c)&BN_MASK2;
245 if (t1 != t2) c=(t1 < t2);
248 t1=a[1]; t2=b[1];
249 r[1]=(t1-t2-c)&BN_MASK2;
250 if (t1 != t2) c=(t1 < t2);
253 t1=a[2]; t2=b[2]
355 BN_ULONG t1,t2; local
459 BN_ULONG t1,t2; local
499 BN_ULONG t1,t2; local
575 BN_ULONG t1,t2; local
    [all...]
  /external/openssl/crypto/bn/asm/
x86_64-gcc.c 236 BN_ULONG t1,t2; local
243 t1=a[0]; t2=b[0];
244 r[0]=(t1-t2-c)&BN_MASK2;
245 if (t1 != t2) c=(t1 < t2);
248 t1=a[1]; t2=b[1];
249 r[1]=(t1-t2-c)&BN_MASK2;
250 if (t1 != t2) c=(t1 < t2);
253 t1=a[2]; t2=b[2]
355 BN_ULONG t1,t2; local
459 BN_ULONG t1,t2; local
499 BN_ULONG t1,t2; local
575 BN_ULONG t1,t2; local
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeWizard.cs 410 * structure and token types in t1. Check text if the pattern has
415 protected virtual bool ParseCore(object t1, TreePattern tpattern, IDictionary<string, object> labels) {
417 if (t1 == null || tpattern == null) {
422 if (adaptor.GetType(t1) != tpattern.Type) {
426 if (tpattern.hasTextArg && !adaptor.GetText(t1).Equals(tpattern.Text)) {
431 // map label in pattern to node in t1
432 labels[tpattern.label] = t1;
435 int n1 = adaptor.GetChildCount(t1);
441 object child1 = adaptor.GetChild(t1, i);
475 * Compare t1 and t2; return true if token types/text, structure match exactly
    [all...]

Completed in 301 milliseconds

<<11121314151617181920>>