Home
last modified time | relevance | path

Searched refs:idx2 (Results 1 – 25 of 52) sorted by relevance

123

/external/llvm/test/Transforms/SLPVectorizer/X86/
Dpropagate_ir_flags.ll14 %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/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/
DASN1ObjectIdentifier.java428 int idx2 = enc[enc.length - 1] & 0x7f; in fromOctetString() local
440 possibleMatch = first[idx2]; in fromOctetString()
443 return first[idx2] = new ASN1ObjectIdentifier(enc); in fromOctetString()
458 possibleMatch = first[idx2]; in fromOctetString()
461 return first[idx2] = new ASN1ObjectIdentifier(enc); in fromOctetString()
469 idx2 = (idx2 + 1) & 0x7f; in fromOctetString()
470 possibleMatch = first[idx2]; in fromOctetString()
473 return first[idx2] = new ASN1ObjectIdentifier(enc); in fromOctetString()
/external/skia/tests/
DPathOpsTightBoundsTest.cpp41 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local
116 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local
DPathOpsAngleTest.cpp242 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()
DPathOpsCubicLineIntersectionIdeas.cpp243 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { in DEF_TEST() local
244 SkDebugf("%1.9g ", worstStep[idx2]); in DEF_TEST()
/external/v8/test/webkit/
Ddate-set-to-nan.js360 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/
Dgencnval.c656 uint32_t idx, idx2; in addAlias() local
701 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) { in addAlias()
702 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2]; in addAlias()
803 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local
806 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter()
807 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter()
808 uint16_t aliasNum = tags[idx].aliasList[idx2].aliases[idx3]; in resolveAliasToConverter()
811 *converterNum = idx2; in resolveAliasToConverter()
820 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter()
821 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter()
[all …]
/external/skia/src/pathops/
DSkOpAngle.cpp429 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() local
430 if (idx1 == idx2) { in distEndRatio()
434 v.set(pts[idx2] - pts[idx1]); in distEndRatio()
467 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect() local
468 double testT = i[0][idx2]; in endsIntersect()
521 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect() local
522 minX = SkTMin(minX, curve[idx2].fX); in endsIntersect()
523 minY = SkTMin(minY, curve[idx2].fY); in endsIntersect()
524 maxX = SkTMax(maxX, curve[idx2].fX); in endsIntersect()
525 maxY = SkTMax(maxY, curve[idx2].fY); in endsIntersect()
[all …]
DSkPathOpsQuad.cpp86 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in AddValidTs() local
87 if (approximately_equal(t[idx2], tValue)) { in AddValidTs()
DSkPathOpsCubic.cpp344 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local
345 if (approximately_equal(t[idx2], 1)) { in RootsValidT()
352 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local
353 if (approximately_equal(t[idx2], 0)) { in RootsValidT()
/external/lldb/source/Core/
DRegularExpression.cpp204 RegularExpression::Match::GetMatchSpanningIndices (const char* s, uint32_t idx1, uint32_t idx2, llv… in GetMatchSpanningIndices() argument
206 if (idx1 < m_matches.size() && idx2 < m_matches.size()) in GetMatchSpanningIndices()
208 if (m_matches[idx1].rm_so == m_matches[idx2].rm_eo) in GetMatchSpanningIndices()
214 else if (m_matches[idx1].rm_so < m_matches[idx2].rm_eo) in GetMatchSpanningIndices()
216 …match_str = llvm::StringRef (s + m_matches[idx1].rm_so, m_matches[idx2].rm_eo - m_matches[idx1].rm… in GetMatchSpanningIndices()
/external/jetty/src/java/org/eclipse/jetty/webapp/
DOrdering.java277 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/
DComments.java111 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()
DRootDocToXML.java71 int idx2 = xsdFileName.lastIndexOf('/'); in writeXSD() local
72 if (idx == -1 && idx2 == -1) { in writeXSD()
74 } else if (idx == -1 && idx2 != -1) { in writeXSD()
75 xsdFileName = xsdFileName.substring(0, idx2); in writeXSD()
76 } else if (idx != -1 && idx2 == -1) { in writeXSD()
78 } else if (idx != -1 && idx2 != -1) { in writeXSD()
79 int max = idx2 > idx ? idx2 : idx; in writeXSD()
DCommentsHandler.java71 int idx2 = JDiff.newFileName.lastIndexOf('.'); in startElement() local
73 "_to_" + JDiff.newFileName.substring(0, idx2); in startElement()
/external/ceres-solver/internal/ceres/
Dcompressed_row_sparse_matrix.cc497 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/eigen/test/
Dvisitor.cpp103 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/aac/libAACenc/src/
Daacenc_tns.cpp626 int i, idx0, idx1, idx2, idx3, idx4, lag; in FDKaacEnc_MergedAutoCorrelation() local
642 idx2 = idx0 + i / 2; in FDKaacEnc_MergedAutoCorrelation()
652 idx2 = idx1 + i; in FDKaacEnc_MergedAutoCorrelation()
653 idx3 = idx2 + i; in FDKaacEnc_MergedAutoCorrelation()
659 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2); in FDKaacEnc_MergedAutoCorrelation()
660 INT sc3 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx2, idx3); in FDKaacEnc_MergedAutoCorrelation()
666 for (nsc2=1; (1<<nsc2)<(idx2-idx1); nsc2++); in FDKaacEnc_MergedAutoCorrelation()
667 for (nsc3=1; (1<<nsc3)<(idx3-idx2); nsc3++); in FDKaacEnc_MergedAutoCorrelation()
672 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2); in FDKaacEnc_MergedAutoCorrelation()
673 rxx3_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx2, idx3, 0, nsc3); in FDKaacEnc_MergedAutoCorrelation()
[all …]
/external/webp/src/enc/
Dhistogram.c538 const int idx2 = bin_map[bin_offset + n]; in HistogramCombineEntropyBin() local
539 const double bit_cost_idx2 = histograms[idx2]->bit_cost_; in HistogramCombineEntropyBin()
543 HistogramAddEval(histograms[idx1], histograms[idx2], in HistogramCombineEntropyBin()
547 histograms[idx2]->bit_cost_ = 0.; in HistogramCombineEntropyBin()
595 const uint32_t idx2 = (idx1 + diff + 1) % image_histo_size; in HistogramCombine() local
596 if (idx1 == idx2) { in HistogramCombine()
601 curr_cost_diff = HistogramAddEval(histograms[idx1], histograms[idx2], in HistogramCombine()
611 best_idx2 = idx2; in HistogramCombine()
/external/opencv/cv/src/
Dcvtemplmatch.cpp342 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/
Dsanitizer_bitvector.h148 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
Dsanitizer_bvgraph.h154 void check(uptr idx1, uptr idx2) const { in check() argument
156 CHECK_LT(idx2, size()); in check()
/external/eigen/unsupported/Eigen/src/BVH/
DKdBVH.h208 int idx2 = (int)boxes.size() - 1;
209 boxes.push_back(boxes[idx1].merged(boxes[idx2]));
211 children.push_back(idx2);
/external/libvncserver/x11vnc/
Duserinput.c7056 int xc, yc, wc, hc, idx2; in clipped() local
7064 idx2 = lookup_old_stack_index(ic); in clipped()
7065 if (idx2 < 0) { in clipped()
7068 if (cache_list[idx2].win == win) { in clipped()
7071 if (cache_list[idx2].map_state != IsViewable) { in clipped()
7074 xc = cache_list[idx2].x; in clipped()
7075 yc = cache_list[idx2].y; in clipped()
7076 wc = cache_list[idx2].width; in clipped()
7077 hc = cache_list[idx2].height; in clipped()
7082 if (0) fprintf(stderr, "clip[0x%lx]: 0x%lx, %d/%d\n", win, cache_list[idx2].win, ic, idx2); in clipped()
[all …]
/external/llvm/test/CodeGen/X86/
Dpr13899.ll32 %idx2 = getelementptr inbounds <8 x float>, <8 x float>* %p, i64 2
33 %3 = load <8 x float>, <8 x float>* %idx2

123