Searched refs:dm2 (Results 1 – 8 of 8) sorted by relevance
128 destroyme2 dm2; in fn2() local136 destroyme2 dm2; in fn3() local150 destroyme2 dm2; in fn4() local161 destroyme2 dm2; in fn5() local175 destroyme2 dm2; in fn6() local186 destroyme2 dm2; in fn7() local201 destroyme2 dm2; in fn8() local211 destroyme2 dm2; in fn9() local232 destroyme2 dm2; local244 destroyme2 dm2; local[all …]
74 destroyme2 dm2; in fn2() local82 destroyme2 dm2; in fn3() local
24 std::unique_ptr<SkDiscardableMemory> dm2(pool->create(200)); in DEF_TEST() local27 dm2->unlock(); in DEF_TEST()29 REPORTER_ASSERT(reporter, dm2->lock()); in DEF_TEST()30 dm2->unlock(); in DEF_TEST()32 REPORTER_ASSERT(reporter, !dm2->lock()); in DEF_TEST()
259 dm2 = sm1 + dm1;260 dm2 = dm1 - sm1;262 …rices is better performed in two steps. For instance, instead of doing <tt>dm2 = sm1 + dm1</tt>, b…264 dm2 = dm1;265 dm2 += sm1;284 dm2 = dm1 * sm1.adjoint();285 dm2 = 2. * sm1 * dm1;289 dm2 = sm1.selfadjointView<>() * dm1; // if all coefficients of A are stored290 dm2 = A.selfadjointView<Upper>() * dm1; // if only the upper part of A is stored291 dm2 = A.selfadjointView<Lower>() * dm1; // if only the lower part of A is stored[all …]
133 dm2 = sm1 * dm1;
279 BEQ dm2308 dm2: label
1966 const LinearMapper dm2 = rhs.getLinearMapper(0, j2 + 2);1976 kernel.packet[2%PacketSize] = dm2.loadPacket(k);1990 blockB[count+2] = cj(dm2(k));
2316 int32_t dm2 = cal2->fieldDifference(date2, Calendar::MONTH, ec2); in TestJ438() local2321 (dm2 != dm) || in TestJ438()