Searched refs:v1 (Results 1 - 25 of 344) sorted by relevance

1234567891011>>

/macosx-10.10/ntp-92/scripts/
H A Dcalc_tickadj.in12 $v1=0.;
19 ($v1, $v2) = split;
22 while ($v1 < 0)
24 $v1 += $cvt;
28 while ($v1 > $cvt)
30 $v1 -= $cvt;
35 printf("%.3f (drift)\n", $v1);
37 printf("%d usec; %d nsec\n", $base, ($base + ($v1/$cvt)) * 1000);
/macosx-10.10/ruby-106/ruby/test/matrix/
H A Dtest_vector.rb6 @v1 = Vector[1,2,3]
8 @v3 = @v1.clone
14 assert_same @v1, @v1
15 assert_not_same @v1, @v2
16 assert_not_same @v1, @v3
17 assert_not_same @v1, @v4
18 assert_not_same @v1, @w1
22 assert_equal @v1, @v1
[all...]
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/tests/
H A Dtdiffer.cpp15 c4_View v1 = s1.GetAs("a[p1:I]"); local
16 v1.Add(p1[123]);
23 c4_View v1 = s1.View("a"); local
24 A(v1.GetSize() == 1);
25 A(p1(v1[0]) == 123);
26 v1.Add(p1[456]);
27 A(v1.GetSize() == 2);
28 A(p1(v1[0]) == 123);
29 A(p1(v1[1]) == 456);
31 A(v1
41 c4_View v1 = s1.View("a"); local
[all...]
H A Dtbasic1.cpp52 c4_View v1; local
55 p1(r1) = v1;
58 A(x1[0] == v1[0]);
64 c4_View v1 = (p1, p3, p2); local
65 A(v1.FindProperty(p1.GetId()) == 0);
66 A(v1.FindProperty(p2.GetId()) == 2);
67 A(v1.FindProperty(p3.GetId()) == 1);
97 c4_View v1 = (p1, p2, p3); local
98 v1.SetSize(5);
99 r1 = v1[
111 c4_View v1; local
128 c4_View v1; local
148 c4_View v1; local
165 c4_View v1; local
177 c4_View v1; local
190 c4_View v1; local
198 c4_View v1; local
215 c4_View v1; local
244 c4_View v1; local
[all...]
H A Dtstore2.cpp21 c4_View v1 = s1.View("a"); local
22 v1.Add(p1["one"]);
23 v1.Add(p1["two"]);
24 c4_View v2 = p2(v1[0]);
26 v2 = p2(v1[1]);
29 v1.InsertAt(1, p1["three"]);
30 v2 = p2(v1[1]);
53 c4_View v1 = s1.View("a"); local
54 A(v1.GetSize() == 3);
55 c4_View v2 = p2(v1[
68 c4_View v1 = s1.View("a"); local
80 c4_View v1 = s1.View("a"); local
93 c4_View v1 = s1.View("a"); local
119 c4_View v1 = s1.View("a"); local
125 c4_View v1 = s1.View("a"); local
152 c4_View v1 = s1.View("a"); local
160 c4_View v1 = s1.View("a"); local
183 c4_View v1 = s1.View("a"); local
204 c4_View v1 = s1.View("a"); local
243 c4_View v1 = s1.View("a"); local
266 c4_View v1 = s1.View("a"); local
299 c4_View v1 = s1.View("a"); local
324 c4_View v1 = s1.View("a"); local
354 c4_View v1; local
[all...]
H A Dtstore3.cpp11 c4_View v1; local
15 v1 = s1.GetAs("a[p1:I,p2:S]");
16 v1.Add(p1[123]);
20 //A(p1 (v1[0]) == 123);
21 A(v1.GetSize() == 1);
22 A(v1.NumProperties() == 0);
35 c4_View v1; local
40 v1.Add(r1);
41 A(v1.GetSize() == 1);
45 v1
113 c4_View v1 = storage.View("a"); local
135 c4_View v1 = s1.View("a"); local
180 c4_View v1 = s1.View("a1"); local
204 c4_View v1 = s1.View("a1"); local
218 c4_View v1 = s1.View("a1"); local
253 c4_View v1 = s1.View("a"); local
279 c4_View v1 = s1.View("a"); local
315 c4_View v1; local
339 c4_View v1 = s1.View("a"); local
373 c4_View v1 = s1.View("a"); local
382 c4_View v1 = s1.View("a"); local
[all...]
H A Dtcusto1.cpp11 c4_View v1; local
12 v1.Add(p1[123]);
13 v1.Add(p1[234]);
14 v1.Add(p1[345]);
15 v1.Add(p1[456]);
16 v1.Add(p1[567]);
18 c4_View v2 = v1.Slice(1, - 1, 2);
23 v1.Add(p1[678]);
24 A(v1.GetSize() == 6);
33 c4_View v1; local
57 c4_View v1; local
81 c4_View v1; local
115 c4_View v1; local
139 c4_View v1; local
163 c4_View v1; local
186 c4_View v1; local
207 c4_View v1, v2, v3; local
247 c4_View v1, v2, v3; local
[all...]
H A Dtstore4.cpp17 c4_View v1 = s1.View("a"); local
19 v1.Add(p1[hi]);
20 A(p1(v1[0]) == hi);
21 v1.Add(p1[hello]);
22 A(p1(v1[0]) == hi);
23 A(p1(v1[1]) == hello);
24 v1.InsertAt(1, p1[gday]);
25 A(p1(v1[0]) == hi);
26 A(p1(v1[1]) == gday);
27 A(p1(v1[
44 c4_View v1 = s1.View("a"); local
71 c4_View v1 = s1.View("a"); local
111 c4_View v1 = s1.View("a"); local
163 c4_View v1 = s1.View("a"); local
178 c4_View v1 = s1.View("a"); local
204 c4_View v1 = s1.View("a"); local
226 c4_View v1 = s1.View("a"); local
251 c4_View v1 = s1.View("a"); local
292 c4_View v1 = s1.GetAs("v1[key:I,p1:B]"); local
349 c4_View v1 = s1.GetAs("v1[p1:I]"); local
[all...]
H A Dtbasic2.cpp15 c4_View v1; local
16 v1.Add(p1[111] + p2["one"]);
17 v1.Add(p1[222] + p2["two"]);
18 v1.Add(p1[333] + p2["three"]);
19 v1.Add(p1[345] + p2["four"]);
20 v1.Add(p1[234] + p2["five"]);
21 v1.Add(p1[123] + p2["six"]);
22 c4_View v2 = v1.Sort();
34 c4_View v3 = v1.SortOn(p2);
46 c4_View v4 = v1
74 c4_View v1; local
102 c4_View v1; local
119 c4_View v1; local
160 c4_View v1; local
174 c4_View v1; local
199 c4_View v1; local
[all...]
H A Dtnotify.cpp10 c4_View v1; local
11 v1.Add(p1[111]);
12 v1.Add(p1[222]);
13 v1.Add(p1[333]);
14 v1.Add(p1[345]);
15 v1.Add(p1[234]);
16 v1.Add(p1[123]);
17 A(v1.GetSize() == 6);
18 c4_View v2 = v1.SelectRange(p1[200], p1[333]);
23 v1
42 c4_View v1; local
70 c4_View v1; local
94 c4_View v1; local
116 c4_View v1; local
146 c4_View v1; local
174 c4_View v1; local
198 c4_View v1; local
238 c4_View v1; local
289 c4_View v1; local
300 c4_View v1 = (p1, p2); local
324 c4_View v1 = (p1, p2); local
371 c4_View v1; local
423 c4_View v1 = s1.View("a"); local
[all...]
H A Dtstore1.cpp23 c4_View v1 = s1.View("a"); local
24 v1.Add(p1[123]);
25 v1.Add(p1[456]);
26 v1.InsertAt(1, p1[789]);
27 A(v1.GetSize() == 3);
29 A(v1.GetSize() == 3);
41 c4_View v1 = s1.View("a"); local
42 v1.Add(p1[12.3]);
43 v1.Add(p1[45.6]);
44 v1
57 c4_View v1 = s1.View("a"); local
74 c4_View v1 = s1.View("a"); local
99 c4_View v1 = s1.View("a"); local
105 c4_View v1 = s1.View("a"); local
120 c4_View v1 = s1.View("a"); local
128 c4_View v1 = s1.View("a"); local
144 c4_View v1 = s1.View("a"); local
152 c4_View v1 = s1.View("a"); local
167 c4_View v1 = s1.View("a"); local
171 c4_View v1; local
195 c4_View v1 = s1.View("a"); local
[all...]
H A Dtstore5.cpp17 c4_View v1 = s1.View("a"); local
18 v1.Add(p1[123]);
19 A(p1(v1[0]) == 123);
20 A(v1.GetSize() == 1);
32 c4_View v1 = s2.View("a"); local
33 A(p1(v1[0]) == 123);
34 A(v1.GetSize() == 1);
40 c4_View v1 = s3.View("a"); local
41 A(p1(v1[0]) == 123);
42 A(v1
55 c4_View v1 = s4.View("a"); local
62 c4_View v1 = s5.View("a"); local
76 c4_View v1 = s1.GetAs("a[_B[p1:B]]"); local
114 c4_View v1 = s1.GetAs("a[p1:I]"); local
143 c4_View v1 = s1.GetAs("a[p1:I,p2:B]"); local
173 c4_View v1 = s1.GetAs("a[p1:I,p2[p3:B]]"); local
207 c4_View v1 = s1.View("a"); local
250 c4_View v1 = s1.GetAs("v1[p1:A]"); local
253 c4_View v1 = s1.GetAs("v1[p1:I]"); local
270 c4_View v1 = s1.GetAs("v1[v2[p1:I]]"); local
276 c4_View v1 = s1.View("v1"); local
293 c4_View v1 = s1.View("v1"); local
307 c4_View v1 = s1.GetAs("v1[p1:I,p1:S]"); local
324 c4_View v1 = s1.GetAs("a[p1:I]"); local
[all...]
H A Dtcusto2.cpp12 c4_View v1, v2, v3; local
14 v1.Add(p1[1] + p2[11]);
15 v1.Add(p1[1] + p2[22]);
16 v1.Add(p1[2] + p2[33]);
17 v1.Add(p1[2] + p2[33]);
18 v1.Add(p1[3] + p2[44]);
19 v1.Add(p1[4] + p2[55]);
20 v1.Add(p1[4] + p2[55]);
21 v1.Add(p1[4] + p2[55]);
23 v2 = v1
43 c4_View v1, v2, v3; local
67 c4_View v1, v2, v3; local
88 c4_View v1, v2, v3; local
110 c4_View v1, v2, v3; local
130 c4_View v1; local
153 c4_View v1, v2, v3; local
225 c4_View v1, v2, v3; local
261 c4_View v1, v2a, v2b, v2c, v3; local
322 c4_View v1; local
368 c4_View v1, v2, v3; local
404 c4_View v1 = s1.GetAs("v1[p1:I,p2:I,p3:I]"); local
[all...]
H A Dtlimits.cpp23 c4_View v1 = s1.View("a"); local
25 v1.Add(p123[123]);
37 c4_View v1 = s1.View("a"); local
39 v1.SetSize(9000);
41 for (int i = 0; i < v1.GetSize(); ++i) {
42 p1(v1[i]) = 1000000L + i;
44 A(p1(v1[i]) - 1000000L == i);
47 for (int j = 0; j < v1.GetSize(); ++j) {
48 A(p1(v1[j]) - 1000000L == j);
53 for (int k = 0; k < v1
70 c4_View v1 = s1.View("a"); local
105 c4_View v1 = s1.View("a"); local
119 c4_View v1 = s1.View("a"); local
135 c4_View v1 = s1.View("a"); local
157 c4_View v1 = s1.View("a"); local
171 c4_View v1 = s1.View("a"); local
194 c4_View v1 = s1.View("a"); local
235 c4_View v1 = s1.View("a"); local
251 c4_View v1 = s1.View("a"); local
283 c4_View v1 = s1.View("a"); local
[all...]
H A Dtformat.cpp16 c4_View v1 = s1.View("a"); local
17 v1.Add(p1[123]);
30 c4_View v1 = s1.View("a"); local
31 A(v1.GetSize() == 1);
32 A(p1(v1[0]) == 123);
52 c4_View v1 = s1.View("a"); local
53 v1.Add(p1[123]);
65 c4_View v1 = s1.View("a"); local
66 A(v1.GetSize() == 1); // 19990916 new semantics, still as temp view
67 A(p1(v1[
79 c4_View v1 = s1.View("a"); local
99 c4_View v1 = s1.View("a"); local
126 c4_View v1 = s1.View("a"); local
139 c4_View v1 = s1.View("a"); local
163 c4_View v1 = s1.View("a"); local
185 c4_View v1 = s1.View("a"); local
242 c4_View v1; local
266 c4_View v1 = s1.GetAs("a[p1:I]"); local
294 c4_View v1 = s1.GetAs("a[p1:I]"); local
326 c4_View v1 = s1.GetAs("a"); local
[all...]
/macosx-10.10/llvmCore-3425.0.34/utils/unittest/googletest/include/gtest/
H A Dgtest_pred_impl.h46 // ASSERT_PRED_FORMAT1(pred_format, v1)
47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2)
58 // ASSERT_PRED1(pred, v1)
59 // ASSERT_PRED2(pred, v1, v2)
63 // and the values v1, v2, ..., must support the << operator for
90 const T1& v1) {
91 if (pred(v1)) return AssertionSuccess();
95 << "\n" << e1 << " evaluates to " << v1;
100 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\
101 GTEST_ASSERT_(pred_format(#v1, v
87 AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) argument
129 AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) argument
178 AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) argument
234 AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) argument
297 AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) argument
[all...]
/macosx-10.10/OpenLDAP-499.27/OpenLDAP/libraries/liblutil/
H A Dmemcmp.c24 (lutil_memcmp)(const void *v1, const void *v2, size_t n) argument
27 const unsigned char *s1=v1, *s2=v2;
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/examples/
H A Dpair.py1 # Small demo of v1.pair(v2)
18 v1 = db.getas("one[s:S]") variable
22 v1.append(s=v)
26 metakit.dump(v1.pair(v2))
H A Dremap.py1 # Small demo of v1.remapwith(v2)
20 v1 = db.getas("counts[s:S]") variable
24 v1.append(s=v)
28 metakit.dump(v1.remapwith(v2))
/macosx-10.10/emacs-93/emacs/src/
H A Dbytecode.c419 /* Lisp_Object v1, v2; */
507 Lisp_Object v1, v2;
509 v1 = vectorp[op];
510 if (SYMBOLP (v1))
512 v2 = SYMBOL_VALUE (v1);
516 v2 = Fsymbol_value (v1);
523 v2 = Fsymbol_value (v1);
532 Lisp_Object v1;
535 v1 = POP;
536 if (NILP (v1))
502 Lisp_Object v1, v2; variable
527 Lisp_Object v1; variable
542 Lisp_Object v1; variable
550 Lisp_Object v1; variable
558 Lisp_Object v1; variable
568 Lisp_Object v1; variable
615 Lisp_Object v1; variable
617 PUSH (v1); variable
667 Lisp_Object v1, v2; variable
723 Lisp_Object v1; variable
768 Lisp_Object v1; variable
782 Lisp_Object v1; variable
851 Lisp_Object v1; variable
884 Lisp_Object v1; variable
897 Lisp_Object v1, v2; variable
934 Lisp_Object v1; variable
946 Lisp_Object v1; variable
976 Lisp_Object v1; variable
986 Lisp_Object v1, v2; variable
1008 Lisp_Object v1; variable
1018 Lisp_Object v1; variable
1028 Lisp_Object v1; variable
1038 Lisp_Object v1, v2; variable
1077 Lisp_Object v1; variable
1095 Lisp_Object v1; variable
1113 Lisp_Object v1, v2; variable
1116 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1); variable
1134 Lisp_Object v1; variable
1144 Lisp_Object v1; variable
1154 Lisp_Object v1; variable
1164 Lisp_Object v1; variable
1181 Lisp_Object v1; variable
1234 Lisp_Object v1; variable
1244 Lisp_Object v1; variable
1246 PUSH (v1); variable
1272 Lisp_Object v1; variable
1274 PUSH (v1); variable
1280 Lisp_Object v1; variable
1282 PUSH (v1); variable
1294 Lisp_Object v1; variable
1298 PUSH (v1); variable
1304 Lisp_Object v1; variable
1308 PUSH (v1); variable
1314 Lisp_Object v1; variable
1318 PUSH (v1); variable
1372 Lisp_Object v1; variable
1382 Lisp_Object v1; variable
1405 Lisp_Object v1; variable
1415 Lisp_Object v1; variable
1425 Lisp_Object v1; variable
1447 Lisp_Object v1, v2; variable
1482 Lisp_Object v1; variable
1492 Lisp_Object v1; variable
1502 Lisp_Object v1; variable
1510 Lisp_Object v1; variable
1520 Lisp_Object v1, v2; variable
1548 Lisp_Object v1; variable
1558 Lisp_Object v1; variable
1574 Lisp_Object v1; variable
1584 Lisp_Object v1; variable
1594 Lisp_Object v1; variable
1602 Lisp_Object v1; variable
[all...]
/macosx-10.10/bind9-45.101/bind9/contrib/zkt/
H A Ddebug.h48 # define dbg_val2(fmt, v1, v2) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2)
49 # define dbg_val3(fmt, v1, v2, v3) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3)
50 # define dbg_val4(fmt, v1, v2, v3, v4) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3, v4)
51 # define dbg_val5(fmt, v1, v2, v3, v4, v5) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3, v4, v5)
52 # define dbg_val6(fmt, v1, v2, v3, v4, v5, v6) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v
[all...]
/macosx-10.10/OpenSSL098-52/src/crypto/des/
H A Dofb_enc.c71 register DES_LONG d0,d1,vv0,vv1,v0,v1,n=(numbits+7)/8; local
98 c2l(iv,v1);
100 ti[1]=v1;
104 ti[1]=v1;
116 { v0=v1; v1=vv0; }
118 { v0=vv0; v1=vv1; }
121 v0=((v1>>(num-32))|(vv0<<(64-num)))&0xffffffffL;
122 v1=((vv0>>(num-32))|(vv1<<(64-num)))&0xffffffffL;
126 v0=((v0>>num)|(v1<<(3
[all...]
H A Dofb64ede.c71 register DES_LONG v0,v1; local
82 c2l(iv,v1);
84 ti[1]=v1;
87 l2c(v1,dp);
93 /* ti[1]=v1; */
96 v1=ti[1];
100 l2c(v1,dp);
109 v1=ti[1];*/
112 l2c(v1,iv);
114 v0=v1
[all...]
/macosx-10.10/ruby-106/ruby/test/rdoc/
H A Dtest_rdoc_markup_verbatim.rb6 v1 = verb('1 + 1')
12 assert_equal v1, v2
14 refute_equal v1, v3
15 refute_equal v1, v4
/macosx-10.10/bzip2-36/bzip2/arm64/
H A Dcrc32vec.s36 let there be at least 8 128-bit vectors v0, v1, v2, v3, v4, v5, v6, v7
37 we can apply the folding to (v0,x4), (v1,v5), (v2,v6), (v3,v7), respectively, with T = 512
43 v1' = v0 * (x^128 mod P(x)) + v1;
54 a. v0 = (H(x)*x^96 + L(x)*x^32, a P(x) congruent vector is v1 = H(x) * (x^96 mod P(x)) + L(x) * x^32,
56 b. v1 = H'(x)*x^64 + L'(x), a P(x) congruen vector is v2 = H'(x) * (x^64 mod P(x)) + L'(x), which is 64-bit.
77 st1.4s {v0,v1,v2,v3},[x3],#4*16
92 ld1.4s {v1}, [buf], #16 // 1st vector
95 rev64.16b v1, v1
[all...]

Completed in 178 milliseconds

1234567891011>>