| /external/mesa3d/src/compiler/nir/ |
| D | nir_intrinsics.h | 301 #define SYSTEM_VALUE(name, components, num_indices, idx0, idx1, idx2) \ argument
392 #define LOAD(name, srcs, num_indices, idx0, idx1, idx2, flags) \ argument
427 #define STORE(name, srcs, num_indices, idx0, idx1, idx2, flags) \ argument
|
| D | nir_intrinsics.c | 34 idx0, idx1, idx2, _flags) \ argument
|
| D | nir_builder.h | 506 num_variables, num_indices, idx0, idx1, idx2, flags) argument
|
| /external/strace/ |
| D | kcmp.c | 38 kernel_ulong_t idx2 = tcp->u_arg[4]; in SYS_FUNC() local
|
| /external/strace/tests-mx32/ |
| D | kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) in do_kcmp()
|
| /external/strace/tests/ |
| D | kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) in do_kcmp()
|
| /external/strace/tests-m32/ |
| D | kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) in do_kcmp()
|
| /external/brotli/enc/ |
| D | cluster.h | 23 uint32_t idx2; member
|
| /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 | PathOpsCubicLineIntersectionIdeas.cpp | 245 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { in DEF_TEST() local
|
| D | PathOpsAngleTest.cpp | 248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local
|
| /external/eigen/test/ |
| D | visitor.cpp | 108 Index idx2 = eigen_maxidx; in vectorVisitor() local
|
| /external/jdiff/src/jdiff/ |
| D | CommentsHandler.java | 71 int idx2 = JDiff.newFileName.lastIndexOf('.'); in startElement() local
|
| D | Comments.java | 111 int idx2 = xsdFileName.lastIndexOf('/'); in writeXSD() local
|
| D | RootDocToXML.java | 72 int idx2 = xsdFileName.lastIndexOf('/'); in writeXSD() local
|
| /external/skia/src/pathops/ |
| D | SkOpAngle.cpp | 413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() local
451 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect() local
505 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect() local
565 for (int idx2 = 0; idx2 <= oppPts; ++idx2) { in endToSide() local
|
| D | SkPathOpsCubic.cpp | 380 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local
388 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in RootsValidT() local
|
| D | SkPathOpsQuad.cpp | 116 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { in AddValidTs() local
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const { in check()
|
| D | sanitizer_bitvector.h | 339 uptr idx2(uptr idx) const { in idx2() function
|
| D | sanitizer_deadlock_detector.h | 357 bool testOnlyHasEdgeRaw(uptr idx1, uptr idx2) { in testOnlyHasEdgeRaw()
|
| /external/webp/src/enc/ |
| D | histogram_enc.c | 613 int idx2; member
674 static void PreparePair(VP8LHistogram** histograms, int idx1, int idx2, in PreparePair()
725 const int idx2 = histo_queue.queue[0].idx2; in HistogramCombineGreedy() local
820 uint32_t idx1, idx2; in HistogramCombineStochastic() local
|
| /external/skia/third_party/lua/src/ |
| D | luaconf.h | 297 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) argument
298 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) argument
|
| /external/syslinux/com32/lua/src/ |
| D | luaconf.h | 301 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) argument
302 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) argument
|
| /external/icu/icu4c/source/tools/gencnval/ |
| D | gencnval.c | 666 uint32_t idx, idx2; in addAlias() local
813 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local
|