Searched refs:idx2 (Results 1 - 25 of 74) sorted by relevance

123

/external/mesa3d/src/compiler/nir/
H A Dnir_intrinsics.c34 idx0, idx1, idx2, _flags) \
46 [NIR_INTRINSIC_ ## idx2] = 3, \
H A Dnir_intrinsics.h33 * num_variables, num_indices, idx0, idx1, idx2, flags)
301 #define SYSTEM_VALUE(name, components, num_indices, idx0, idx1, idx2) \
304 idx0, idx1, idx2, \
392 #define LOAD(name, srcs, num_indices, idx0, idx1, idx2, flags) \
393 INTRINSIC(load_##name, srcs, ARR(1, 1, 1, 1), true, 0, 0, num_indices, idx0, idx1, idx2, flags)
427 #define STORE(name, srcs, num_indices, idx0, idx1, idx2, flags) \
428 INTRINSIC(store_##name, srcs, ARR(0, 1, 1, 1), false, 0, 0, num_indices, idx0, idx1, idx2, flags)
/external/strace/
H A Dkcmp.c61 kernel_ulong_t idx2 = tcp->u_arg[4]; local
71 printpidfd(tcp, pid1, idx2);
82 if (umove_or_printaddr(tcp, idx2, &slot))
101 tprintf(", %#" PRI_klx ", %#" PRI_klx, idx1, idx2);
/external/brotli/c/enc/
H A Dcluster.c27 return TO_BROTLI_BOOL((p1->idx2 - p1->idx1) > (p2->idx2 - p2->idx1));
H A Dcluster.h23 uint32_t idx2; member in struct:HistogramPair
H A Dcluster_inc.h12 /* Computes the bit cost reduction by combining out[idx1] and out[idx2] and if
13 it is below a threshold, stores the pair (idx1, idx2) in the *pairs queue. */
16 uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs,
20 p.idx1 = p.idx2 = 0;
22 if (idx1 == idx2) {
25 if (idx2 < idx1) {
26 uint32_t t = idx2;
27 idx2 = idx1;
31 p.idx2 = idx2;
[all...]
/external/strace/tests/
H A Dkcmp.c92 * * When type is KCMP_EPOLL_TFD, it signalises whether idx2 is a valid
97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...)
102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2);
114 printpidfd(", ", pid2, idx2);
119 va_start(ap, idx2);
128 (struct kcmp_epoll_slot *) (uintptr_t) idx2;
134 if (idx2)
135 printf("%#llx", (unsigned long long) idx2);
141 (unsigned long long) idx1, (unsigned long long) idx2);
96 do_kcmp(kernel_ulong_t pid1, kernel_ulong_t pid2, kernel_ulong_t type, const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) argument
/external/strace/tests-m32/
H A Dkcmp.c92 * * When type is KCMP_EPOLL_TFD, it signalises whether idx2 is a valid
97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...)
102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2);
114 printpidfd(", ", pid2, idx2);
119 va_start(ap, idx2);
128 (struct kcmp_epoll_slot *) (uintptr_t) idx2;
134 if (idx2)
135 printf("%#llx", (unsigned long long) idx2);
141 (unsigned long long) idx1, (unsigned long long) idx2);
96 do_kcmp(kernel_ulong_t pid1, kernel_ulong_t pid2, kernel_ulong_t type, const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) argument
/external/strace/tests-mx32/
H A Dkcmp.c92 * * When type is KCMP_EPOLL_TFD, it signalises whether idx2 is a valid
97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...)
102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2);
114 printpidfd(", ", pid2, idx2);
119 va_start(ap, idx2);
128 (struct kcmp_epoll_slot *) (uintptr_t) idx2;
134 if (idx2)
135 printf("%#llx", (unsigned long long) idx2);
141 (unsigned long long) idx1, (unsigned long long) idx2);
96 do_kcmp(kernel_ulong_t pid1, kernel_ulong_t pid2, kernel_ulong_t type, const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) argument
/external/webp/src/enc/
H A Dhistogram_enc.c621 int idx2; member in struct:__anon30428
682 // Create a pair from indices "idx1" and "idx2" provided its cost
687 int idx2, double threshold) {
694 if (idx1 > idx2) {
695 const int tmp = idx2;
696 idx2 = idx1;
700 pair.idx2 = idx2;
702 h2 = histograms[idx2];
749 const int idx2 local
685 HistoQueuePush(HistoQueue* const histo_queue, VP8LHistogram** const histograms, int idx1, int idx2, double threshold) argument
837 uint32_t idx2 = tmp % (image_histo_size - 1); local
[all...]
/external/skia/tests/
H A DPathOpsTightBoundsTest.cpp41 for (int idx2 = 0; idx2 < 10; ++idx2) {
116 for (int idx2 = 0; idx2 < 10; ++idx2) {
H A DPathOpsAngleTest.cpp248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
249 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint();
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
448 temp[idx2] = data.fPts.fPts[idx2]
[all...]
H A DPathOpsCubicLineIntersectionIdeas.cpp245 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) {
246 SkDebugf("%1.9g ", worstStep[idx2]);
/external/skqp/tests/
H A DPathOpsTightBoundsTest.cpp41 for (int idx2 = 0; idx2 < 10; ++idx2) {
116 for (int idx2 = 0; idx2 < 10; ++idx2) {
H A DPathOpsAngleTest.cpp248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
249 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint();
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
448 temp[idx2] = data.fPts.fPts[idx2]
[all...]
H A DPathOpsCubicLineIntersectionIdeas.cpp245 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) {
246 SkDebugf("%1.9g ", worstStep[idx2]);
/external/icu/icu4c/source/tools/gencnval/
H A Dgencnval.c666 uint32_t idx, idx2; local
711 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) {
712 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2];
813 uint16_t idx, idx2, idx3; local
816 for (idx2 = 0; idx2 < converterCount; idx2++) {
817 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2]
[all...]
/external/jdiff/src/jdiff/
H A DComments.java111 int idx2 = xsdFileName.lastIndexOf('/');
112 if (idx == -1 && idx2 == -1) {
114 } else if (idx == -1 && idx2 != -1) {
115 xsdFileName = xsdFileName.substring(0, idx2+1);
116 } else if (idx != -1 && idx2 == -1) {
118 } else if (idx != -1 && idx2 != -1) {
119 int max = idx2 > idx ? idx2 : idx;
H A DCommentsHandler.java71 int idx2 = JDiff.newFileName.lastIndexOf('.');
73 "_to_" + JDiff.newFileName.substring(0, idx2);
/external/protobuf/objectivec/
H A DGPBArray.h81 withValueAtIndex:(NSUInteger)idx2;
121 withValueAtIndex:(NSUInteger)idx2;
161 withValueAtIndex:(NSUInteger)idx2;
201 withValueAtIndex:(NSUInteger)idx2;
241 withValueAtIndex:(NSUInteger)idx2;
281 withValueAtIndex:(NSUInteger)idx2;
321 withValueAtIndex:(NSUInteger)idx2;
399 withValueAtIndex:(NSUInteger)idx2;
522 //% withValueAtIndex:(NSUInteger)idx2;
/external/tensorflow/tensorflow/compiler/tests/
H A Ddynamic_stitch_test.py54 idx2 = np.array([[1], [3]], dtype=np.int32)
58 [idx1, idx2], [val1, val2],
/external/skia/src/pathops/
H A DSkOpAngle.cpp413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
414 if (idx1 == idx2) {
418 v.set(pts[idx2] - pts[idx1]);
451 for (int idx2 = 0; idx2 < i.used(); ++idx2) {
452 double testT = i[0][idx2];
505 for (int idx2
[all...]
/external/skqp/src/pathops/
H A DSkOpAngle.cpp413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
414 if (idx1 == idx2) {
418 v.set(pts[idx2] - pts[idx1]);
451 for (int idx2 = 0; idx2 < i.used(); ++idx2) {
452 double testT = i[0][idx2];
505 for (int idx2
[all...]
/external/syslinux/com32/lua/src/
H A Dluaconf.h301 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
302 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h154 void check(uptr idx1, uptr idx2) const {
156 CHECK_LT(idx2, size());

Completed in 537 milliseconds

123