/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const { 156 CHECK_LT(idx2, size());
|
sanitizer_bitvector.h | 148 uptr i2 = idx2(idx); 163 uptr i2 = idx2(idx); 177 uptr i2 = idx2(idx); 339 uptr idx2(uptr idx) const { function in class:__sanitizer::TwoLevelBitVector
|
/external/jdiff/src/jdiff/ |
CommentsHandler.java | 71 int idx2 = JDiff.newFileName.lastIndexOf('.'); local 73 "_to_" + JDiff.newFileName.substring(0, idx2);
|
RootDocToXML.java | 72 int idx2 = xsdFileName.lastIndexOf('/'); local 73 if (idx == -1 && idx2 == -1) { 75 } else if (idx == -1 && idx2 != -1) { 76 xsdFileName = xsdFileName.substring(0, idx2); 77 } else if (idx != -1 && idx2 == -1) { 79 } else if (idx != -1 && idx2 != -1) { 80 int max = idx2 > idx ? idx2 : idx; [all...] |
/external/tensorflow/tensorflow/compiler/tests/ |
dynamic_stitch_test.py | 54 idx2 = np.array([[1], [3]], dtype=np.int32) 58 [idx1, idx2], [val1, val2],
|
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
TensorScan.h | 220 // loops to avoid an integer division by keeping track of each idx1 and idx2. 222 for (Index idx2 = 0; idx2 < self.stride(); idx2++) { 224 Index offset = idx1 + idx2;
|
/external/skia/tests/ |
PathOpsCubicLineIntersectionIdeas.cpp | 245 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { 246 SkDebugf("%1.9g ", worstStep[idx2]);
|
/external/skqp/tests/ |
PathOpsCubicLineIntersectionIdeas.cpp | 245 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { 246 SkDebugf("%1.9g ", worstStep[idx2]);
|
/external/aac/libAACenc/src/ |
aacenc_tns.cpp | 625 int i, idx0, idx1, idx2, idx3, idx4, lag; local 639 idx2 = idx0 + i / 2; 648 idx2 = idx1 + i; 649 idx3 = idx2 + i; 655 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2); 656 INT sc3 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx2, idx3); 663 for (nsc2 = 1; (1 << nsc2) < (idx2 - idx1); nsc2++) 665 for (nsc3 = 1; (1 << nsc3) < (idx3 - idx2); nsc3++) 673 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2); 674 rxx3_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx2, idx3, 0, nsc3) [all...] |
/external/eigen/test/ |
visitor.cpp | 108 Index idx2 = eigen_maxidx; local 111 v2(idx0) = v2(idx2); 115 VERIFY(eigen_maxidx == (std::min)(idx0,idx2));
|
/external/eigen/unsupported/Eigen/src/BVH/ |
KdBVH.h | 208 int idx2 = (int)boxes.size() - 1; local 209 boxes.push_back(boxes[idx1].merged(boxes[idx2])); 211 children.push_back(idx2);
|
/system/core/adb/ |
bugreport.cpp | 148 size_t idx2 = line.rfind(BUGZ_PROGRESS_SEPARATOR); local 149 int progress = std::stoi(line.substr(idx1, (idx2 - idx1))); 150 int total = std::stoi(line.substr(idx2 + 1));
|
/external/skia/src/pathops/ |
SkPathOpsQuad.cpp | 119 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 120 if (approximately_equal(t[idx2], tValue)) {
|
SkPathOpsCubic.cpp | 380 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 381 if (approximately_equal(t[idx2], 1)) { 388 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 389 if (approximately_equal(t[idx2], 0)) {
|
/external/skqp/src/pathops/ |
SkPathOpsQuad.cpp | 116 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 117 if (approximately_equal(t[idx2], tValue)) {
|
SkPathOpsCubic.cpp | 380 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 381 if (approximately_equal(t[idx2], 1)) { 388 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 389 if (approximately_equal(t[idx2], 0)) {
|
/external/opencv/cv/src/ |
cvtemplmatch.cpp | 342 int idx = 0, idx2 = 0; local 482 idx2 = i * sqsum_step; 484 for( j = 0; j < result->cols; j++, idx += cn, idx2 += cn ) 505 t = q0[idx2+k] - q1[idx2+k] - q2[idx2+k] + q3[idx2+k];
|
cvemd.cpp | 100 int* idx2; member in struct:CvEMDState 309 int cj = state.idx2[j]; 361 sizeof( int ) + sizeof(CvNode2D*)) + /* idx1 & idx2 */ 388 state->idx2 = (int*) buffer; 421 state->idx2[dsize++] = i; 443 state->idx2[dsize++] = -1; 517 int cj = state->idx2[j]; [all...] |
/art/compiler/optimizing/ |
load_store_analysis.h | 358 const HInstruction* idx2, 397 HInstruction* idx2 = loc2->GetIndex(); local 400 if (!CanArrayElementsAlias(idx1, vector_length1, idx2, vector_length2)) {
|
/frameworks/base/rs/java/android/renderscript/ |
Mesh.java | 755 * @param idx2 index of the second vertex in the triangle 760 public TriangleMeshBuilder addTriangle(int idx1, int idx2, int idx3) { 762 (idx2 >= mMaxIndex) || (idx2 < 0) || 772 mIndexData[mIndexCount++] = (short)idx2;
|
/dalvik/libdex/ |
DexProto.cpp | 297 u4 idx2 = dexTypeListGetIdx(typeList2, i); local 300 dexStringByTypeIdx(dexFile2, idx2));
|
/external/tensorflow/tensorflow/python/profiler/internal/ |
run_metadata_test.py | 200 idx2 = op.name.find('_grad/') 201 back_to_forward[op.name] = op.name[idx1:idx2]
|
/system/sepolicy/tools/sepolicy-analyze/ |
typecmp.c | 121 int idx1, struct avtab_node *l2, int idx2) 148 display_allow(policydb, &c->key, idx2, perms2);
|
/external/aac/libFDK/src/ |
FDK_qmf_domain.cpp | 438 int idx2; local 446 idx2 = workBufferOffset % workBufferSectSize; 448 idx1 = (workBufferOffset - idx2) / workBufferSectSize; 456 FDK_ASSERT((idx2 + memSize) <= workBufferSectSize); 459 pwb = &pWorkBuffer[idx1][idx2]; [all...] |
/external/aac/libSACdec/src/ |
sac_calcM1andM2.cpp | 338 const int idx2 = icc[band]; local 339 H11[band] = FX_CFG2FX_DBL(H11_nc[idx1][idx2]); 340 H21[band] = FX_CFG2FX_DBL(H11_nc[30 - idx1][idx2]); 341 H12[band] = FX_CFG2FX_DBL(H12_nc[idx1][idx2]); 342 H22[band] = FX_CFG2FX_DBL(-H12_nc[30 - idx1][idx2]);
|