HomeSort by relevance Sort by last modified time
    Searched refs:idx2 (Results 1 - 25 of 96) sorted by null

1 2 3 4

  /art/compiler/optimizing/
load_store_analysis.cc 39 const HInstruction* idx2,
45 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() != idx2) {
66 const HBinaryOperation* idx2,
68 if (!IsAddOrSub(idx1) || !IsAddOrSub(idx2)) {
73 idx2->AsBinaryOperation()->GetLeastConstantLeft()) {
78 !idx2->GetConstantRight()->IsIntConstant()) {
87 int64_t l2 = idx2->IsAdd() ?
88 idx2->GetConstantRight()->AsIntConstant()->GetValue() :
89 -idx2->GetConstantRight()->AsIntConstant()->GetValue();
97 const HInstruction* idx2,
    [all...]
  /external/mesa3d/src/compiler/nir/
nir_intrinsics.c 34 idx0, idx1, idx2, _flags) \
46 [NIR_INTRINSIC_ ## idx2] = 3, \
nir_intrinsics.h 33 * 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/
kcmp.c 61 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);
  /libcore/ojluni/src/main/java/sun/reflect/
Reflection.java 161 int idx2 = 0; local
173 if (name2.charAt(idx2) == '[') {
175 idx2++;
176 } while (name2.charAt(idx2) == '[');
177 if (name2.charAt(idx2) != 'L') {
185 int length2 = lastDot2 - idx2;
190 return name1.regionMatches(false, idx1, name2, idx2, length1);
  /external/brotli/c/enc/
cluster.c 27 return TO_BROTLI_BOOL((p1->idx2 - p1->idx1) > (p2->idx2 - p2->idx1));
cluster.h 23 uint32_t idx2; member in struct:HistogramPair
cluster_inc.h 12 /* 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/
kcmp.c 92 * * 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);
  /external/strace/tests-m32/
kcmp.c 92 * * 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);
  /external/strace/tests-mx32/
kcmp.c 92 * * 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);
  /system/extras/tests/kernel.config/
sysvipc_test.cpp 30 int kcmp(pid_t pid1, pid_t pid2, int type, unsigned long idx1, unsigned long idx2) {
31 return syscall(SYS_kcmp, pid1, pid2, type, 0, idx1, idx2);
  /external/webp/src/enc/
histogram_enc.c 621 int idx2; member in struct:__anon43747
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 = histo_queue.queue[0].idx2 local
837 uint32_t idx2 = tmp % (image_histo_size - 1); local
    [all...]
  /external/skia/tests/
PathOpsTightBoundsTest.cpp 41 for (int idx2 = 0; idx2 < 10; ++idx2) {
116 for (int idx2 = 0; idx2 < 10; ++idx2) {
PathOpsAngleTest.cpp 248 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].asSkPoint()
    [all...]
  /external/skqp/tests/
PathOpsTightBoundsTest.cpp 41 for (int idx2 = 0; idx2 < 10; ++idx2) {
116 for (int idx2 = 0; idx2 < 10; ++idx2) {
PathOpsAngleTest.cpp 248 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].asSkPoint()
    [all...]
  /frameworks/base/cmds/statsd/src/anomaly/
indexed_priority_queue.h 80 /** Returns whether pq[idx1] is considered higher than pq[idx2], according to Comparator. */
81 bool higher(size_t idx1, size_t idx2) const;
196 bool indexed_priority_queue<AA, Comparator>::higher(size_t idx1, size_t idx2) const {
197 if (!(0u < idx1 && idx1 < pq.size() && 0u < idx2 && idx2 < pq.size())) {
200 return Comparator()(pq[idx1], pq[idx2]);
  /external/icu/icu4c/source/tools/gencnval/
gencnval.c 666 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].aliasCount; idx3++)
    [all...]
  /external/jdiff/src/jdiff/
Comments.java 111 int idx2 = xsdFileName.lastIndexOf('/'); local
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;
  /external/protobuf/objectivec/
GPBArray.h 81 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/skia/src/pathops/
SkOpAngle.cpp 413 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 = 0; idx2 <= ptCount; ++idx2)
    [all...]
  /external/skqp/src/pathops/
SkOpAngle.cpp 413 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 = 0; idx2 <= ptCount; ++idx2)
    [all...]
  /device/linaro/bootloader/edk2/StdLib/Include/Lua/
luaconf.h 297 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
298 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
  /external/syslinux/com32/lua/src/
luaconf.h 301 #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)

Completed in 507 milliseconds

1 2 3 4