Searched refs:t1 (Results 201 - 225 of 878) sorted by relevance

1234567891011>>

/external/ipsec-tools/src/racoon/
H A Dmisc.c158 * t1: start
162 timedelta(t1, t2)
163 struct timeval *t1, *t2;
165 if (t2->tv_usec >= t1->tv_usec)
166 return t2->tv_sec - t1->tv_sec +
167 (double)(t2->tv_usec - t1->tv_usec) / 1000000;
169 return t2->tv_sec - t1->tv_sec - 1 +
170 (double)(1000000 + t2->tv_usec - t1->tv_usec) / 1000000;
/external/toybox/toys/posix/
H A Duniq.c78 char *t1, *t2; local
82 t1 = skip(thisline);
85 t1 = thisline;
90 diff = !(toys.optflags & FLAG_i) ? strcmp(t1, t2) : strcasecmp(t1, t2);
92 diff = !(toys.optflags & FLAG_i) ? strncmp(t1, t2, TT.maxchars)
93 : strncasecmp(t1, t2, TT.maxchars);
/external/v8/test/mjsunit/regress/
H A Dregress-binop-nosse2.js144 function t1(a, b) {return a-b} function
145 assertEquals(t1(1,2), 1-2);
146 assertEquals(t1(2,true), 2-1);
147 assertEquals(t1(false,2), 0-2);
148 assertEquals(t1(1,2.4), 1-2.4);
149 assertEquals(t1(1.3,2.4), 1.3-2.4);
150 assertEquals(t1(true,2.4), 1-2.4);
151 assertEquals(t1(1,undefined), 1-NaN);
152 assertEquals(t1(1,1<<30), 1-(1<<30));
153 assertEquals(t1(
[all...]
H A Dregress-binop.js144 function t1(a, b) {return a-b} function
145 assertEquals(t1(1,2), 1-2);
146 assertEquals(t1(2,true), 2-1);
147 assertEquals(t1(false,2), 0-2);
148 assertEquals(t1(1,2.4), 1-2.4);
149 assertEquals(t1(1.3,2.4), 1.3-2.4);
150 assertEquals(t1(true,2.4), 1-2.4);
151 assertEquals(t1(1,undefined), 1-NaN);
152 assertEquals(t1(1,1<<30), 1-(1<<30));
153 assertEquals(t1(
[all...]
/external/valgrind/none/tests/mips64/
H A Dlogical_instructions.c21 TEST1("and $t0, $t1, $t2", reg_val1[i], reg_val1[N-i-1],
22 t0, t1, t2);
30 TEST2("andi $t0, $t1, 0xff", reg_val1[i], 0xff, t0, t1);
34 TEST2("andi $t0, $t1, 0xff", reg_val2[i], 0xff, t0, t1);
54 TEST1("nor $t0, $t1, $t2", reg_val1[i], reg_val1[N-i-1],
55 t0, t1, t2);
62 TEST1("or $t0, $t1, $t2", reg_val1[i], reg_val1[N-i-1],
63 t0, t1, t
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_blorp_blit.cpp569 struct brw_reg t1; member in class:brw_blorp_blit_program
787 this->t1 = vec16(retype(brw_vec8_grf(reg++, 0), BRW_REGISTER_TYPE_UW));
869 brw_MOV(&func, t1, brw_imm_v(0x3210));
870 brw_MOV(&func, S, stride(t1, 1, 4, 0));
886 struct brw_reg t1_ud1 = vec1(retype(t1, BRW_REGISTER_TYPE_UD));
962 brw_AND(&func, t1, X, brw_imm_uw(0xfff4)); /* X & ~0b1011 */
963 brw_SHR(&func, t1, t1, brw_imm_uw(1)); /* (X & ~0b1011) >> 1 */
966 brw_OR(&func, t1, t1, t
[all...]
/external/boringssl/src/crypto/bn/
H A Dadd.c104 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
[all...]
/external/eigen/test/eigen2/
H A Deigen2_geometry.cpp138 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
[all...]
H A Deigen2_geometry_with_eigen2_prefix.cpp140 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
[all...]
/external/harfbuzz_ng/src/
H A Dhb-utf-private.hh56 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/
H A Dtest-ot-tag.c40 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/boringssl/src/crypto/sha/asm/
H A Dsha256-armv4.pl57 $len="r2"; $t1="r2";
81 @ ldr $t1,[$inp],#4 @ $i
89 rev $t1,$t1
92 @ ldrb $t1,[$inp,#3] @ $i
96 orr $t1,$t1,$t2,lsl#8
98 orr $t1,$t1,$t0,lsl#16
103 orr $t1,
[all...]
/external/libcxx/test/std/thread/futures/futures.shared_future/
H A Dwait.pass.cpp56 Clock::time_point t1 = Clock::now(); local
58 assert(t1-t0 < ms(5));
70 Clock::time_point t1 = Clock::now(); local
72 assert(t1-t0 < ms(5));
84 Clock::time_point t1 = Clock::now(); local
86 assert(t1-t0 < ms(5));
H A Dwait_for.pass.cpp61 Clock::time_point t1 = Clock::now(); local
63 assert(t1-t0 < ms(5));
77 Clock::time_point t1 = Clock::now(); local
79 assert(t1-t0 < ms(5));
93 Clock::time_point t1 = Clock::now(); local
95 assert(t1-t0 < ms(5));
/external/libcxx/test/std/thread/futures/futures.unique_future/
H A Dwait.pass.cpp56 Clock::time_point t1 = Clock::now(); local
58 assert(t1-t0 < ms(5));
70 Clock::time_point t1 = Clock::now(); local
72 assert(t1-t0 < ms(5));
84 Clock::time_point t1 = Clock::now(); local
86 assert(t1-t0 < ms(5));
H A Dwait_for.pass.cpp61 Clock::time_point t1 = Clock::now(); local
63 assert(t1-t0 < ms(50));
77 Clock::time_point t1 = Clock::now(); local
79 assert(t1-t0 < ms(50));
93 Clock::time_point t1 = Clock::now(); local
95 assert(t1-t0 < ms(50));
/external/skia/src/pathops/
H A DSkPathOpsConic.h97 SkDConic subDivide(double t1, double t2) const;
99 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { argument
102 return conic.subDivide(t1, t2);
105 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2,
110 double t1, double t2, SkScalar* newWeight) {
113 return conic.subDivide(a, c, t1, t2, newWeight);
108 SubDivide(const SkPoint pts[kPointCount], SkScalar weight, const SkDPoint& a, const SkDPoint& c, double t1, double t2, SkScalar* newWeight) argument
H A DSkPathOpsQuad.h76 SkDQuad subDivide(double t1, double t2) const;
77 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { argument
80 return quad.subDivide(t1, t2);
82 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
84 double t1, double t2) {
87 return quad.subDivide(a, c, t1, t2);
83 SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c, double t1, double t2) argument
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeWizard.java328 * structure and token types in t1. Check text if the pattern has
332 protected boolean _parse(Object t1, TreePattern tpattern, Map labels) { argument
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 an
394 equals(Object t1, Object t2, TreeAdaptor adaptor) argument
401 equals(Object t1, Object t2) argument
405 _equals(Object t1, Object t2, TreeAdaptor adaptor) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
H A DSecP256K1FieldElement.java182 int[] t1 = x223;
183 SecP256K1Field.squareN(t1, 23, t1);
184 SecP256K1Field.multiply(t1, x22, t1);
185 SecP256K1Field.squareN(t1, 6, t1);
186 SecP256K1Field.multiply(t1, x2, t1);
187 SecP256K1Field.squareN(t1,
[all...]
/external/clang/test/CodeGen/
H A Dms_struct-bitfield-1.c10 } ATTR t1; variable in typeref:struct:__anon1828
11 static int a1[(sizeof(t1) == 8) -1];
/external/clang/test/Modules/Inputs/
H A Dcxx-templates-c.h17 MergeAnonUnionMember() { (void)values.t1; }
18 union { int t1; } values; member in union:MergeAnonUnionMember::__anon2198
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h53 t1.copyFrom(from);
54 while (!t1.empty()) {
55 uptr node = t1.getAndClearFirstOne();
89 t1.copyFrom(from);
90 while (!t1.empty()) {
91 uptr idx = t1.getAndClearFirstOne();
112 BV &to_visit = t1,
160 BV t1, t2; member in class:__sanitizer::BVGraph
/external/compiler-rt/lib/tsan/tests/rtl/
H A Dtsan_test.cc21 ScopedThread t1, t2; local
23 t1.Write1(l);
/external/libcxx/test/std/containers/sequences/array/
H A Dfront_back.pass.cpp54 constexpr T t1 = c.front(); local
55 static_assert (t1 == 1, "");

Completed in 605 milliseconds

1234567891011>>