/external/llvm/test/Transforms/SLPVectorizer/X86/ |
D | propagate_ir_flags.ll | 14 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 19 %load2 = load i32, i32* %idx2, align 4 29 store i32 %op2, i32* %idx2, align 4 40 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 45 %load2 = load i32, i32* %idx2, align 4 55 store i32 %op2, i32* %idx2, align 4 66 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 71 %load2 = load i32, i32* %idx2, align 4 81 store i32 %op2, i32* %idx2, align 4 92 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 [all …]
|
/external/webp/src/enc/ |
D | histogram.c | 520 const int idx2 = bin_map[bin_offset + n]; in HistogramCombineEntropyBin() local 524 VP8LHistogramAdd(histograms[idx1], histograms[idx2], histograms[idx1]); in HistogramCombineEntropyBin() 525 histograms[idx2]->bit_cost_ = 0.; in HistogramCombineEntropyBin() 527 const double bit_cost_idx2 = histograms[idx2]->bit_cost_; in HistogramCombineEntropyBin() 531 HistogramAddEval(histograms[idx1], histograms[idx2], in HistogramCombineEntropyBin() 542 (histograms[idx2]->trivial_symbol_ == VP8L_NON_TRIVIAL_SYM)); in HistogramCombineEntropyBin() 546 histograms[idx2]->bit_cost_ = 0.; in HistogramCombineEntropyBin() 577 int idx2; member 638 static void PreparePair(VP8LHistogram** histograms, int idx1, int idx2, in PreparePair() argument 641 if (idx1 > idx2) { in PreparePair() [all …]
|
/external/opencv3/modules/ts/misc/ |
D | concatlogs.py | 33 idx2 = html.rfind("</tbody>") variable 34 html = html[:idx2] + re.sub(r"[ \t\n\r]+", " ", text[idx1:]) 40 idx2 = html.find("</title>") variable 41 html = html[:idx1] + "OpenCV performance testing report" + html[idx2:]
|
/external/skia/tests/ |
D | PathOpsTightBoundsTest.cpp | 41 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local 116 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local
|
D | PathOpsAngleTest.cpp | 242 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 243 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST() 441 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 442 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
D | PathOpsCubicLineIntersectionIdeas.cpp | 243 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { in DEF_TEST() local 244 SkDebugf("%1.9g ", worstStep[idx2]); in DEF_TEST()
|
/external/strace/ |
D | kcmp.c | 37 unsigned long idx2 = tcp->u_arg[4]; in SYS_FUNC() local 44 tprintf(", %u, %u", (unsigned) idx1, (unsigned) idx2); in SYS_FUNC() 54 tprintf(", %#lx, %#lx", idx1, idx2); in SYS_FUNC()
|
/external/opencv3/modules/cudastereo/src/cuda/ |
D | stereobm.cu | 130 …__device__ void StepDown(int idx1, int idx2, unsigned char* imageL, unsigned char* imageR, int d, … in StepDown() argument 139 leftPixel2 = imageL[idx2]; in StepDown() 142 idx2 = idx2 - d; in StepDown() 153 rightPixel2[7] = imageR[idx2 - 7]; in StepDown() 154 rightPixel2[0] = imageR[idx2 - 0]; in StepDown() 155 rightPixel2[1] = imageR[idx2 - 1]; in StepDown() 156 rightPixel2[2] = imageR[idx2 - 2]; in StepDown() 157 rightPixel2[3] = imageR[idx2 - 3]; in StepDown() 158 rightPixel2[4] = imageR[idx2 - 4]; in StepDown() 159 rightPixel2[5] = imageR[idx2 - 5]; in StepDown() [all …]
|
/external/v8/test/webkit/ |
D | date-set-to-nan.js | 360 for (var idx2 in testValues) 361 if (idx0 != 0 || idx1 != 0 || idx2 != 0) { 365 testValues[idx2]); 370 + testValues[idx2] + ") was " 392 for (var idx2 in testValues) 394 if (idx0 != 0 || idx1 != 0 || idx2 != 0 || idx3 != 0) { 398 testValues[idx2], 404 + testValues[idx2] + ", "
|
/external/icu/icu4c/source/tools/gencnval/ |
D | gencnval.c | 664 uint32_t idx, idx2; in addAlias() local 709 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) { in addAlias() 710 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2]; in addAlias() 811 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local 814 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter() 815 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter() 816 uint16_t aliasNum = tags[idx].aliasList[idx2].aliases[idx3]; in resolveAliasToConverter() 819 *converterNum = idx2; in resolveAliasToConverter() 828 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter() 829 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter() [all …]
|
/external/skia/src/pathops/ |
D | SkOpAngle.cpp | 381 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() local 382 if (idx1 == idx2) { in distEndRatio() 386 v.set(pts[idx2] - pts[idx1]); in distEndRatio() 419 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect() local 420 double testT = i[0][idx2]; in endsIntersect() 473 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect() local 474 minX = SkTMin(minX, curve[idx2].fX); in endsIntersect() 475 minY = SkTMin(minY, curve[idx2].fY); in endsIntersect() 476 maxX = SkTMax(maxX, curve[idx2].fX); in endsIntersect() 477 maxY = SkTMax(maxY, curve[idx2].fY); in endsIntersect() [all …]
|
D | SkPathOpsCubic.cpp | 341 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local 342 if (approximately_equal(t[idx2], 1)) { in RootsValidT() 349 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local 350 if (approximately_equal(t[idx2], 0)) { in RootsValidT()
|
D | SkPathOpsQuad.cpp | 86 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in AddValidTs() local 87 if (approximately_equal(t[idx2], tValue)) { in AddValidTs()
|
/external/jetty/src/java/org/eclipse/jetty/webapp/ |
D | Ordering.java | 277 int idx2 = getIndexOf(list, b); in orderList() local 280 if (idx2 < 0) in orderList() 299 insert(list, idx2, f.getName()); in orderList() 317 int idx2 = getIndexOf(list, a); in orderList() local 320 if (idx2 < 0) in orderList() 336 list.remove(idx2); in orderList()
|
/external/jdiff/src/jdiff/ |
D | Comments.java | 111 int idx2 = xsdFileName.lastIndexOf('/'); in writeXSD() local 112 if (idx == -1 && idx2 == -1) { in writeXSD() 114 } else if (idx == -1 && idx2 != -1) { in writeXSD() 115 xsdFileName = xsdFileName.substring(0, idx2+1); in writeXSD() 116 } else if (idx != -1 && idx2 == -1) { in writeXSD() 118 } else if (idx != -1 && idx2 != -1) { in writeXSD() 119 int max = idx2 > idx ? idx2 : idx; in writeXSD()
|
/external/ceres-solver/internal/ceres/ |
D | compressed_row_sparse_matrix.cc | 497 for (int idx2 = m.rows()[r]; idx2 <= idx1; ++idx2) { in CreateOuterProductMatrixAndProgram() local 498 product.push_back(ProductTerm(m.cols()[idx1], m.cols()[idx2], product.size())); in CreateOuterProductMatrixAndProgram() 531 for (int idx2 = row_begin; idx2 <= idx1; ++idx2, ++cursor) { in ComputeOuterProduct() local 532 values[program[cursor]] += v1 * m_values[idx2]; in ComputeOuterProduct()
|
/external/aac/libAACenc/src/ |
D | aacenc_tns.cpp | 597 int i, idx0, idx1, idx2, idx3, idx4, lag; in FDKaacEnc_MergedAutoCorrelation() local 607 idx0 = idx1 = idx2 = idx3 = idx4 = 0; in FDKaacEnc_MergedAutoCorrelation() 615 idx2 = idx0 + i / 2; in FDKaacEnc_MergedAutoCorrelation() 625 idx2 = idx1 + i; in FDKaacEnc_MergedAutoCorrelation() 626 idx3 = idx2 + i; in FDKaacEnc_MergedAutoCorrelation() 632 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2); in FDKaacEnc_MergedAutoCorrelation() 633 INT sc3 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx2, idx3); in FDKaacEnc_MergedAutoCorrelation() 639 for (nsc2=1; (1<<nsc2)<(idx2-idx1); nsc2++); in FDKaacEnc_MergedAutoCorrelation() 640 for (nsc3=1; (1<<nsc3)<(idx3-idx2); nsc3++); in FDKaacEnc_MergedAutoCorrelation() 645 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2); in FDKaacEnc_MergedAutoCorrelation() [all …]
|
/external/eigen/test/ |
D | visitor.cpp | 103 Index idx2 = eigen_maxidx; in vectorVisitor() local 106 v2(idx0) = v2(idx2); in vectorVisitor() 110 VERIFY(eigen_maxidx == (std::min)(idx0,idx2)); in vectorVisitor()
|
/external/llvm/test/CodeGen/PowerPC/ |
D | vector-merge-store-fp-constants.ll | 13 %idx2 = getelementptr float, float* %ptr, i64 2 21 store float 0.0, float* %idx2, align 4
|
/external/llvm/test/CodeGen/X86/ |
D | catchpad-regmask.ll | 6 ; extern "C" void global_array(int idx1, int idx2, int idx3) { 11 ; array[idx2] = 222; 35 define void @global_array(i32 %idx1, i32 %idx2, i32 %idx3) #0 personality i8* bitcast (i32 (...)* @… 48 %idxprom1 = sext i32 %idx2 to i64
|
D | vector-merge-store-fp-constants.ll | 20 %idx2 = getelementptr float, float* %ptr, i64 2 28 store float 0.0, float* %idx2, align 4
|
/external/opencv/cv/src/ |
D | cvtemplmatch.cpp | 342 int idx = 0, idx2 = 0; in cvMatchTemplate() local 482 idx2 = i * sqsum_step; in cvMatchTemplate() 484 for( j = 0; j < result->cols; j++, idx += cn, idx2 += cn ) in cvMatchTemplate() 505 t = q0[idx2+k] - q1[idx2+k] - q2[idx2+k] + q3[idx2+k]; in cvMatchTemplate()
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_bitvector.h | 148 uptr i2 = idx2(idx); in setBit() 163 uptr i2 = idx2(idx); in clearBit() 177 uptr i2 = idx2(idx); in getBit() 339 uptr idx2(uptr idx) const { in idx2() function
|
D | sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const { in check() argument 156 CHECK_LT(idx2, size()); in check()
|
/external/eigen/unsupported/Eigen/src/BVH/ |
D | KdBVH.h | 208 int idx2 = (int)boxes.size() - 1; 209 boxes.push_back(boxes[idx1].merged(boxes[idx2])); 211 children.push_back(idx2);
|