/art/compiler/optimizing/ |
load_store_analysis.cc | 25 // Check if array indices array[idx1 +/- CONST] and array[idx2] MAY alias. 26 static bool BinaryOpAndIndexMayAlias(const HBinaryOperation* idx1, const HInstruction* idx2) { 27 DCHECK(idx1 != nullptr); 30 if (!idx1->IsAdd() && !idx1->IsSub()) { 35 HConstant* cst = idx1->GetConstantRight(); 40 if (idx1->GetLeastConstantLeft() == idx2) { 41 // for example, array[idx1 + 1] and array[idx1] 49 static bool BinaryOpsMayAlias(const HBinaryOperation* idx1, const HBinaryOperation* idx2) [all...] |
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
propagate_ir_flags.ll | 13 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 18 %load1 = load i32, i32* %idx1, align 4 28 store i32 %op1, i32* %idx1, align 4 39 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 44 %load1 = load i32, i32* %idx1, align 4 54 store i32 %op1, i32* %idx1, align 4 65 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 70 %load1 = load i32, i32* %idx1, align 4 80 store i32 %op1, i32* %idx1, align 4 91 %idx1 = getelementptr inbounds i32, i32* %x, i64 [all...] |
/external/brotli/enc/ |
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 if (idx1 == idx2) { 23 if (idx2 < idx1) { 25 idx2 = idx1; 26 idx1 = t; 28 p.idx1 = idx1; 30 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]) [all...] |
cluster.c | 27 return TO_BROTLI_BOOL((p1->idx2 - p1->idx1) > (p2->idx2 - p2->idx1));
|
cluster.h | 22 uint32_t idx1; member in struct:HistogramPair
|
/external/llvm/test/CodeGen/X86/ |
dag-merge-fast-accesses.ll | 22 %idx1 = getelementptr i64, i64* %ptr, i64 1 25 store i64 0, i64* %idx1, align 8 46 %idx1 = getelementptr double, double* %ptr, i64 1 49 store double %vecext1, double* %idx1, align 8 78 %idx1 = getelementptr i64, i64* %ptr, i64 1 81 %ld1 = load i64, i64* %idx1, align 4
|
vector-merge-store-fp-constants.ll | 19 %idx1 = getelementptr float, float* %ptr, i64 1 27 store float 0.0, float* %idx1, align 4
|
catchpad-regmask.ll | 6 ; extern "C" void global_array(int idx1, int idx2, int idx3) { 8 ; array[idx1] = 111; 35 define void @global_array(i32 %idx1, i32 %idx2, i32 %idx3) #0 personality i8* bitcast (i32 (...)* @__CxxFrameHandler3 to i8*) { 37 %idxprom = sext i32 %idx1 to i64
|
vec_loadsingles.ll | 45 %idx1 = getelementptr inbounds float, float* %ptr, i64 1 46 %b = load float, float* %idx1, align 8 75 %idx1 = getelementptr inbounds float, float* %ptr, i64 1 76 %b = load float, float* %idx1, align 4 112 %idx1 = getelementptr inbounds double, double* %ptr, i64 1 113 %b = load double, double* %idx1, align 8
|
/external/llvm/test/CodeGen/PowerPC/ |
vector-merge-store-fp-constants.ll | 12 %idx1 = getelementptr float, float* %ptr, i64 1 20 store float 0.0, float* %idx1, align 4
|
/system/extras/tests/kernel.config/ |
sysvipc_test.cpp | 26 int kcmp(pid_t pid1, pid_t pid2, int type, unsigned long idx1, unsigned long idx2) { 27 return syscall(SYS_kcmp, pid1, pid2, type, 0, 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/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/strace/ |
kcmp.c | 37 kernel_ulong_t idx1 = tcp->u_arg[3]; local 45 tprintf(", %u, %u", (unsigned) idx1, (unsigned) idx2); 55 tprintf(", %#" PRI_klx ", %#" PRI_klx, idx1, idx2);
|
/external/strace/tests/ |
kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) 50 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 61 printf(", %u, %u", (unsigned) idx1, (unsigned) idx2); 64 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/strace/tests-m32/ |
kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) 50 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 61 printf(", %u, %u", (unsigned) idx1, (unsigned) idx2); 64 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/strace/tests-mx32/ |
kcmp.c | 45 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2) 50 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); 61 printf(", %u, %u", (unsigned) idx1, (unsigned) idx2); 64 (unsigned long long) idx1, (unsigned long long) idx2);
|
/external/mesa3d/src/compiler/nir/ |
nir_intrinsics.c | 34 idx0, idx1, idx2, _flags) \ 45 [NIR_INTRINSIC_ ## idx1] = 2, \
|
/external/swiftshader/third_party/subzero/crosstest/ |
test_vector_ops_ll.ll | 4 i32 1, label %idx1 11 idx1: 29 i32 1, label %idx1 37 idx1: 58 i32 1, label %idx1 70 idx1: 107 i32 1, label %idx1 127 idx1: 196 i32 1, label %idx1 203 idx1 [all...] |
/external/llvm/test/CodeGen/Hexagon/ |
store-shift.ll | 5 ; CHECK-DAG: r[[IDX1:[0-9]+]] = add(r2, #6) 7 ; CHECK-DAG: memw(r0 + r[[IDX1]]<<#2) = r3 9 ; CHECK-DAG: memw(r[[BASE]] + r[[IDX1]]<<#2) = r[[IDX0]]
|
/external/protobuf/objectivec/ |
GPBArray.m | 279 //%- (void)exchangeValueAtIndex:(NSUInteger)idx1 281 //%VALIDATE_RANGE(idx1, _count) 283 //% TYPE temp = _values[idx1]; 284 //% _values[idx1] = _values[idx2]; 517 - (void)exchangeValueAtIndex:(NSUInteger)idx1 519 if (idx1 >= _count) { 522 (unsigned long)idx1, (unsigned long)_count]; 529 int32_t temp = _values[idx1]; 530 _values[idx1] = _values[idx2]; 764 - (void)exchangeValueAtIndex:(NSUInteger)idx1 [all...] |
/prebuilts/ndk/r13/sources/third_party/vulkan/src/build-android/generated/layer-src/unique_objects/ |
unique_objects.cpp | 74 for (uint32_t idx1=0; idx1<pSubmits[idx0].signalSemaphoreCount; ++idx1) { 75 local_pSubmits[idx0].pSignalSemaphores[idx1] = (VkSemaphore)my_map_data->unique_id_mapping[reinterpret_cast<const uint64_t &>(pSubmits[idx0].pSignalSemaphores[idx1])]; 325 for (uint32_t idx1=0; idx1<pBindInfo[idx0].bufferBindCount; ++idx1) { 326 if (pBindInfo[idx0].pBufferBinds[idx1].buffer) { 327 local_pBindInfo[idx0].pBufferBinds[idx1].buffer = (VkBuffer)my_map_data->unique_id_mapping[reinterpret_cast<const uint64_t &>(pBindInfo[id (…) [all...] |
/external/webp/src/enc/ |
histogram_enc.c | 610 // Pair of histograms. Negative idx1 value means that pair is out-of-date. 612 int idx1; member in struct:__anon38549 674 static void PreparePair(VP8LHistogram** histograms, int idx1, int idx2, 680 if (idx1 > idx2) { 682 idx2 = idx1; 683 idx1 = tmp; 685 pair->idx1 = idx1; 687 h1 = histograms[idx1]; 724 const int idx1 = histo_queue.queue[0].idx1 local 820 uint32_t idx1, idx2; local [all...] |
/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);
|