Home
last modified time | relevance | path

Searched refs:vc2 (Results 1 – 8 of 8) sorted by relevance

/external/valgrind/drd/
Ddrd_vc.h82 const VectorClock* const vc2);
84 const VectorClock* const vc2);
102 Bool DRD_(vc_lte)(const VectorClock* const vc1, const VectorClock* const vc2) in DRD_()
109 while (j < vc2->size && vc2->vc[j].threadid < vc1->vc[i].threadid) in DRD_()
111 if (j >= vc2->size || vc2->vc[j].threadid > vc1->vc[i].threadid) in DRD_()
118 tl_assert(j < vc2->size && vc2->vc[j].threadid == vc1->vc[i].threadid); in DRD_()
120 if (vc1->vc[i].count > vc2->vc[j].count) in DRD_()
Ddrd_vc.c107 VectorClock vc2; in DRD_() local
108 DRD_(vc_init)(&vc2, &vcelem, 1); in DRD_()
109 DRD_(vc_combine)(vc, &vc2); in DRD_()
110 DRD_(vc_cleanup)(&vc2); in DRD_()
119 const VectorClock* const vc2) in DRD_()
121 return DRD_(vc_lte)(vc1, vc2) || DRD_(vc_lte)(vc2, vc1); in DRD_()
Ddrd_segment.c208 HChar *vc1, *vc2; in DRD_() local
211 vc2 = DRD_(vc_aprint)(&sg2->vc); in DRD_()
214 "Merging segments with vector clocks %s and %s\n", vc1, vc2); in DRD_()
216 VG_(free)(vc2); in DRD_()
/external/eigen/test/
Dproduct.h49 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); in product() local
98 vcres = vc2; in product()
100 VERIFY_IS_APPROX(vcres, vc2 + m1.transpose() * v1); in product()
110 vcres = vc2; in product()
112 VERIFY_IS_APPROX(vcres, vc2 - m1.transpose() * v1); in product()
179 VERIFY_IS_APPROX(vc2.block(0,0,cols,1).transpose() * square2, vc2.transpose() * square2); in product()
180 …VERIFY_IS_APPROX(w2.noalias() = vc2.block(0,0,cols,1).transpose() * square2, vc2.transpose() * squ… in product()
181 …VERIFY_IS_APPROX(w2.block(0,0,1,cols).noalias() = vc2.block(0,0,cols,1).transpose() * square2, vc2… in product()
183 vc2 = square2.block(0,0,1,cols).transpose(); in product()
184 VERIFY_IS_APPROX(square2.block(0,0,1,cols) * square2, vc2.transpose() * square2); in product()
[all …]
Dproduct_extra.cpp34 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); in product_extra() local
56 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2), in product_extra()
57 (-m1.conjugate()*s2).eval() * (s1 * vc2).eval()); in product_extra()
58 VERIFY_IS_APPROX((-m1 * s2) * (s1 * vc2.conjugate()), in product_extra()
59 (-m1*s2).eval() * (s1 * vc2.conjugate()).eval()); in product_extra()
60 VERIFY_IS_APPROX((-m1.conjugate() * s2) * (s1 * vc2.conjugate()), in product_extra()
61 (-m1.conjugate()*s2).eval() * (s1 * vc2.conjugate()).eval()); in product_extra()
63 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2), in product_extra()
64 (s1 * vc2.transpose()).eval() * (-m1.adjoint()*s2).eval()); in product_extra()
65 VERIFY_IS_APPROX((s1 * vc2.adjoint()) * (-m1.transpose() * s2), in product_extra()
[all …]
/external/valgrind/drd/tests/
Dunit_vc.c60 VectorClock vc2; in vc_unittest() local
69 DRD_(vc_init)(&vc2, vc2elem, sizeof(vc2elem)/sizeof(vc2elem[0])); in vc_unittest()
75 DRD_(vc_combine)(&vc3, &vc2); in vc_unittest()
79 fprintf(stderr, "\nvc2: %s", (str = DRD_(vc_aprint)(&vc2))); in vc_unittest()
86 DRD_(vc_lte)(&vc1, &vc2), DRD_(vc_lte)(&vc1, &vc3), in vc_unittest()
87 DRD_(vc_lte)(&vc2, &vc3)); in vc_unittest()
102 DRD_(vc_cleanup)(&vc2); in vc_unittest()
Dunit_vc.stderr.exp4 vc_lte(vc1, vc2) = 0, vc_lte(vc1, vc3) = 1, vc_lte(vc2, vc3) = 1
/external/clang/test/CodeGen/
DNontemporal.cpp15 char __attribute__((vector_size(8))) vc1, vc2; variable
33 __builtin_nontemporal_store(vc1, &vc2); // CHECK: store <8 x i8>{{.*}}align 8, !nontemporal in test_all_sizes()
47 vc2 = __builtin_nontemporal_load(&vc1); // CHECK: load <8 x i8>{{.*}}align 8, !nontemporal in test_all_sizes()