| /external/valgrind/drd/ |
| drd_vc.h | 82 const VectorClock* const vc2);
84 const VectorClock* const vc2);
98 * vc2, and if additionally all corresponding counters in v2 are higher or
102 Bool DRD_(vc_lte)(const VectorClock* const vc1, const VectorClock* const vc2)
109 while (j < vc2->size && vc2->vc[j].threadid < vc1->vc[i].threadid)
111 if (j >= vc2->size || vc2->vc[j].threadid > vc1->vc[i].threadid)
118 tl_assert(j < vc2->size && vc2->vc[j].threadid == vc1->vc[i].threadid)
[all...] |
| drd_vc.c | 107 VectorClock vc2; local
108 DRD_(vc_init)(&vc2, &vcelem, 1);
109 DRD_(vc_combine)(vc, &vc2);
110 DRD_(vc_cleanup)(&vc2);
115 * @return True if vector clocks vc1 and vc2 are ordered, and false otherwise.
119 const VectorClock* const vc2)
121 return DRD_(vc_lte)(vc1, vc2) || DRD_(vc_lte)(vc2, vc1);
|
| drd_segment.c | 208 HChar *vc1, *vc2; local
211 vc2 = DRD_(vc_aprint)(&sg2->vc);
214 "Merging segments with vector clocks %s and %s\n", vc1, vc2);
216 VG_(free)(vc2);
|
| /external/valgrind/drd/tests/ |
| unit_vc.stderr.exp | 2 vc2: [ 1: 4, 3: 9 ]
4 vc_lte(vc1, vc2) = 0, vc_lte(vc1, vc3) = 1, vc_lte(vc2, vc3) = 1
|
| unit_vc.c | 60 VectorClock vc2; local
69 DRD_(vc_init)(&vc2, vc2elem, sizeof(vc2elem)/sizeof(vc2elem[0]));
75 DRD_(vc_combine)(&vc3, &vc2);
79 fprintf(stderr, "\nvc2: %s", (str = DRD_(vc_aprint)(&vc2)));
84 fprintf(stderr, "vc_lte(vc1, vc2) = %d, vc_lte(vc1, vc3) = %d,"
85 " vc_lte(vc2, vc3) = %d\nvc_lte(",
86 DRD_(vc_lte)(&vc1, &vc2), DRD_(vc_lte)(&vc1, &vc3),
87 DRD_(vc_lte)(&vc2, &vc3));
102 DRD_(vc_cleanup)(&vc2);
|
| /external/clang/test/CodeGen/ |
| Nontemporal.cpp | 15 char __attribute__((vector_size(8))) vc1, vc2; variable
33 __builtin_nontemporal_store(vc1, &vc2); // CHECK: store <8 x i8>{{.*}}align 8, !nontemporal
47 vc2 = __builtin_nontemporal_load(&vc1); // CHECK: load <8 x i8>{{.*}}align 8, !nontemporal
|
| /external/eigen/test/ |
| product.h | 49 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); local
98 vcres = vc2;
100 VERIFY_IS_APPROX(vcres, vc2 + m1.transpose() * v1);
110 vcres = vc2;
112 VERIFY_IS_APPROX(vcres, vc2 - m1.transpose() * v1);
179 VERIFY_IS_APPROX(vc2.block(0,0,cols,1).transpose() * square2, vc2.transpose() * square2);
180 VERIFY_IS_APPROX(w2.noalias() = vc2.block(0,0,cols,1).transpose() * square2, vc2.transpose() * square2);
181 VERIFY_IS_APPROX(w2.block(0,0,1,cols).noalias() = vc2.block(0,0,cols,1).transpose() * square2, vc2.transpose() * square2)
[all...] |
| product_extra.cpp | 34 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); local
56 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2),
57 (-m1.conjugate()*s2).eval() * (s1 * vc2).eval());
58 VERIFY_IS_APPROX((-m1 * s2) * (s1 * vc2.conjugate()),
59 (-m1*s2).eval() * (s1 * vc2.conjugate()).eval());
60 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2.conjugate()),
61 (-m1.conjugate()*s2).eval() * (s1 * vc2.conjugate()).eval());
63 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2),
64 (s1 * vc2.transpose()).eval() * (-m1.adjoint()*s2).eval());
65 VERIFY_IS_APPROX((s1 * vc2.adjoint()) * (-m1.transpose() * s2)
[all...] |
