/art/compiler/optimizing/ |
load_store_analysis.cc | 37 static bool CanBinaryOpAndIndexAlias(const HBinaryOperation* idx1, 41 if (!IsAddOrSub(idx1)) { 45 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() != idx2) { 49 if (!idx1->GetConstantRight()->IsIntConstant()) { 55 int64_t l1 = idx1->IsAdd() ? 56 idx1->GetConstantRight()->AsIntConstant()->GetValue() : 57 -idx1->GetConstantRight()->AsIntConstant()->GetValue(); 64 static bool CanBinaryOpsAlias(const HBinaryOperation* idx1, 68 if (!IsAddOrSub(idx1) || !IsAddOrSub(idx2)) { 72 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() ! [all...] |
/external/mesa3d/src/compiler/nir/ |
nir_intrinsics.c | 34 idx0, idx1, idx2, _flags) \ 45 [NIR_INTRINSIC_ ## idx1] = 2, \
|
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 | 60 kernel_ulong_t idx1 = tcp->u_arg[3]; local 69 printpidfd(tcp, pid1, idx1); 79 printpidfd(tcp, pid1, idx1); 101 tprintf(", %#" PRI_klx ", %#" PRI_klx, idx1, idx2);
|
/libcore/ojluni/src/main/java/sun/reflect/ |
Reflection.java | 160 int idx1 = 0; local 164 if (name1.charAt(idx1) == '[') { 166 idx1++; 167 } while (name1.charAt(idx1) == '['); 168 if (name1.charAt(idx1) != 'L') { 184 int length1 = lastDot1 - idx1; 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_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. */ 15 const HistogramType* out, const uint32_t* cluster_size, uint32_t idx1, 20 p.idx1 = p.idx2 = 0; 22 if (idx1 == idx2) { 25 if (idx2 < idx1) { 27 idx2 = idx1; 28 idx1 = t; 30 p.idx1 = idx1; [all...] |
cluster.h | 22 uint32_t idx1; member in struct:HistogramPair
|
/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/strace/tests/ |
kcmp.c | 97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) 102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 113 printpidfd(", ", pid1, idx1); 123 printpidfd(", ", pid1, idx1); 141 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/strace/tests-m32/ |
kcmp.c | 97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) 102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 113 printpidfd(", ", pid1, idx1); 123 printpidfd(", ", pid1, idx1); 141 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/strace/tests-mx32/ |
kcmp.c | 97 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) 102 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 113 printpidfd(", ", pid1, idx1); 123 printpidfd(", ", pid1, idx1); 141 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/webp/src/enc/ |
histogram_enc.c | 618 // Pair of histograms. Negative idx1 value means that pair is out-of-date. 620 int idx1; member in struct:__anon43747 682 // Create a pair from indices "idx1" and "idx2" provided its cost 686 VP8LHistogram** const histograms, int idx1, 694 if (idx1 > idx2) { 696 idx2 = idx1; 697 idx1 = tmp; 699 pair.idx1 = idx1; 701 h1 = histograms[idx1]; 748 const int idx1 = histo_queue.queue[0].idx1; local 836 const uint32_t idx1 = tmp \/ (image_histo_size - 1); local [all...] |
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
TensorStriding.h | 175 const Index idx1 = indices[1] / m_outputStrides[i]; local 177 inputIndices[1] += idx1 * m_inputStrides[i]; 179 indices[1] -= idx1 * m_outputStrides[i]; 186 const Index idx1 = indices[1] / m_outputStrides[i]; local 188 inputIndices[1] += idx1 * m_inputStrides[i]; 190 indices[1] -= idx1 * m_outputStrides[i]; 300 const Index idx1 = indices[1] / this->m_outputStrides[i]; local 302 inputIndices[1] += idx1 * this->m_inputStrides[i]; 304 indices[1] -= idx1 * this->m_outputStrides[i]; 311 const Index idx1 = indices[1] / this->m_outputStrides[i] local [all...] |
TensorScan.h | 220 // loops to avoid an integer division by keeping track of each idx1 and idx2. 221 for (Index idx1 = 0; idx1 < total_size; idx1 += self.stride() * self.size()) { 224 Index offset = idx1 + idx2;
|
/external/eigen/unsupported/Eigen/src/BVH/ |
KdBVH.h | 196 int idx1 = (int)boxes.size() - 1; local 197 boxes.push_back(boxes[idx1].merged(objBoxes[objCenters[mid].second])); 198 children.push_back(idx1); 206 int idx1 = (int)boxes.size() - 1; local 209 boxes.push_back(boxes[idx1].merged(boxes[idx2])); 210 children.push_back(idx1);
|
/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/protobuf/objectivec/ |
GPBArray.h | 80 - (void)exchangeValueAtIndex:(NSUInteger)idx1 120 - (void)exchangeValueAtIndex:(NSUInteger)idx1 160 - (void)exchangeValueAtIndex:(NSUInteger)idx1 200 - (void)exchangeValueAtIndex:(NSUInteger)idx1 240 - (void)exchangeValueAtIndex:(NSUInteger)idx1 280 - (void)exchangeValueAtIndex:(NSUInteger)idx1 320 - (void)exchangeValueAtIndex:(NSUInteger)idx1 398 - (void)exchangeValueAtIndex:(NSUInteger)idx1 521 //%- (void)exchangeValueAtIndex:(NSUInteger)idx1
|
/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)
|
/external/aac/libAACenc/src/ |
aacenc_tns.cpp | 625 int i, idx0, idx1, idx2, idx3, idx4, lag; local 638 idx1 = idx0 + i / 4; 647 idx1 = lpcStartLine[HIFILT]; 648 idx2 = idx1 + i; 654 INT sc1 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx0, idx1); 655 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2); 661 for (nsc1 = 1; (1 << nsc1) < (idx1 - idx0); nsc1++) 663 for (nsc2 = 1; (1 << nsc2) < (idx2 - idx1); nsc2++) 672 rxx1_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx0, idx1, 0, nsc1); 673 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2) [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const { 155 CHECK_LT(idx1, size());
|
sanitizer_bitvector.h | 147 uptr i1 = idx1(idx); 162 uptr i1 = idx1(idx); 176 uptr i1 = idx1(idx); 333 uptr idx1(uptr idx) const { function in class:__sanitizer::TwoLevelBitVector
|
/external/jdiff/src/jdiff/ |
CommentsHandler.java | 70 int idx1 = JDiff.oldFileName.lastIndexOf('.'); local 72 String filename2 = JDiff.oldFileName.substring(0, idx1) +
|
/external/tensorflow/tensorflow/compiler/tests/ |
dynamic_stitch_test.py | 53 idx1 = np.array([0, 2], dtype=np.int32) 58 [idx1, idx2], [val1, val2],
|