| /external/valgrind/main/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 | 104 VectorClock vc2; local
105 DRD_(vc_init)(&vc2, &vcelem, 1);
106 DRD_(vc_combine)(vc, &vc2);
107 DRD_(vc_cleanup)(&vc2);
112 * @return True if vector clocks vc1 and vc2 are ordered, and false otherwise.
116 const VectorClock* const vc2)
118 return DRD_(vc_lte)(vc1, vc2) || DRD_(vc_lte)(vc2, vc1);
|
| drd_segment.c | 209 char *vc1, *vc2; local
212 vc2 = DRD_(vc_aprint)(&sg2->vc);
215 "Merging segments with vector clocks %s and %s\n", vc1, vc2);
217 VG_(free)(vc2);
|
| /external/valgrind/main/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/eigen/test/ |
| product_extra.cpp | 35 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); local
57 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2),
58 (-m1.conjugate()*s2).eval() * (s1 * vc2).eval());
59 VERIFY_IS_APPROX((-m1 * s2) * (s1 * vc2.conjugate()),
60 (-m1*s2).eval() * (s1 * vc2.conjugate()).eval());
61 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2.conjugate()),
62 (-m1.conjugate()*s2).eval() * (s1 * vc2.conjugate()).eval());
64 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2),
65 (s1 * vc2.transpose()).eval() * (-m1.adjoint()*s2).eval());
66 VERIFY_IS_APPROX((s1 * vc2.adjoint()) * (-m1.transpose() * s2)
[all...] |
| product.h | 51 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); local
100 vcres = vc2;
102 VERIFY_IS_APPROX(vcres, vc2 + m1.transpose() * v1);
112 vcres = vc2;
114 VERIFY_IS_APPROX(vcres, vc2 - m1.transpose() * v1);
|
| /external/eigen/test/eigen2/ |
| product.h | 55 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); local
107 vcres = vc2;
109 VERIFY_IS_APPROX(vcres, vc2 + m1.transpose() * v1);
|
