Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 174) sorted by relevance

1234567

/packages/modules/NeuralNetworks/driver/cache/BlobCache/
DBlobCache_test.cpp295 uint8_t k = i; in TEST_P() local
296 mBC->set(&k, 1, "x", 1); in TEST_P()
300 uint8_t k = i; in TEST_P() local
301 if (mBC->get(&k, 1, NULL, 0) == 1) { in TEST_P()
315 uint8_t k = i; in TEST_P() local
316 mBC->set(&k, 1, "x", 1); in TEST_P()
320 uint8_t k = maxEntries; in TEST_P() local
321 mBC->set(&k, 1, "x", 1); in TEST_P()
327 uint8_t k = i; in TEST_P() local
328 bool found = (mBC->get(&k, 1, NULL, 0) == 1); in TEST_P()
[all …]
/packages/modules/StatsD/statsd/src/
Dhash.cpp60 uint32_t k = DecodeFixed32(data); in Hash32() local
61 k *= m; in Hash32()
62 k ^= k >> r; in Hash32()
63 k *= m; in Hash32()
65 h ^= k; in Hash32()
98 uint64_t k = DecodeFixed64(data); in Hash64() local
102 k *= m; in Hash64()
103 k ^= k >> r; in Hash64()
104 k *= m; in Hash64()
106 h ^= k; in Hash64()
/packages/apps/Gallery2/jni/filters/
Dkmeans.h88 void initialPickHeuristicRandom(int k, T values[], int len, int dimension, int stride, T dst[], in initialPickHeuristicRandom() argument
94 unsigned int r_vals[k]; in initialPickHeuristicRandom()
97 for (x = 0; x < k; x++) { in initialPickHeuristicRandom()
141 int calculateNewCentroids(int k, T values[], int len, int dimension, int stride, T oldCenters[], in calculateNewCentroids() argument
144 pop_size = k * stride; in calculateNewCentroids()
145 int popularities[k]; in calculateNewCentroids()
149 memset(popularities, 0, sizeof(int) * k); in calculateNewCentroids()
179 void runKMeansWithPicks(int k, T finalCentroids[], T values[], int len, int dimension, int stride, in runKMeansWithPicks() argument
181 int k_len = k * stride; in runKMeansWithPicks()
194 ret = calculateNewCentroids<T, N>(k, values, len, dimension, stride, c1, c2); in runKMeansWithPicks()
[all …]
Dkmeans.cc53 int k = p; in JNIFUNCF() local
55 unsigned char finalCentroids[k * stride]; in JNIFUNCF()
58 runKMeans<unsigned char, int>(k, finalCentroids, small_ds, len, dimension, in JNIFUNCF()
64 unsigned char nextCentroids[k * stride]; in JNIFUNCF()
67 runKMeansWithPicks<unsigned char, int>(k, nextCentroids, large_ds, len, in JNIFUNCF()
73 applyCentroids<unsigned char, int>(k, nextCentroids, dst, len, dimension, stride); in JNIFUNCF()
/packages/apps/LegacyCamera/jni/feature_stab/src/dbreg/
Ddbreg.cpp274 for(int k=0; k<m_nr_corners_ref; k++) in UpdateReference() local
276 if(m_x_corners_ref[k]>m_im_width/3) in UpdateReference()
278 m_x_corners_ref[nr] = m_x_corners_ref[k]; in UpdateReference()
279 m_y_corners_ref[nr] = m_y_corners_ref[k]; in UpdateReference()
293 for(int k=0; k<m_nr_corners_ins; k++) in UpdateReference() local
295 m_x_corners_ref[k] = m_x_corners_ins[k]; in UpdateReference()
296 m_y_corners_ref[k] = m_y_corners_ins[k]; in UpdateReference()
603 for( int c=0, k=0 ;c < m_nr_matches; c++, k=k+3) in ComputeCostArray() local
605 … m_sq_cost[c] = SquaredInhomogenousHomographyError(m_corners_ins+k,m_H_ref_to_ins,m_corners_ref+k); in ComputeCostArray()
617 for(int c=0, k=0 ;c<m_nr_matches;c++,k=k+3) in SelectOutliers() local
[all …]
Dvp_motionmodel.c98 int i, j, k, l, m, n,ntemp; in inv4Mat() local
106 for(k=0,i=0;i<4;i++) in inv4Mat()
107 for(j=0;j<4;j++,k++) in inv4Mat()
108 inmat[i][j]=(double)in->par[k]; in inv4Mat()
116 for (k=0;k<4;k++) { in inv4Mat()
117 if (i != k) { in inv4Mat()
121 mat[m][n] = inmat[k][l]; in inv4Mat()
136 for(k=0,i=0;i<4;i++) in inv4Mat()
137 for(j=0;j<4;j++,k++) in inv4Mat()
138 out->par[k]=(VP_PAR)outmat[i][j]; /*lint !e771*/ in inv4Mat()
/packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/
Dbiginteger.h92 uint64_t k = 0; variable
95 digits_[i] = MulAdd64(digits_[i], u, k, &hi);
96 k = hi;
99 if (k > 0)
100 PushBack(k);
110 uint64_t k = 0; variable
116 const uint64_t p0 = ud + k;
119 k = p1 >> 32;
122 if (k > 0)
123 PushBack(k);
[all …]
/packages/apps/DocumentsUI/tests/res/raw/
Dimages_tar10 …;�T�A��ZY}����<c�uϠ� ��j�ڭ x�Βή!n�%c�PA/�����.���*d��ac����G+���6ͺ؊k�<b���J_���1��Zճ…
13 ���ڪ��U�+Zn9�1柔�!�,�b�>�*�W��F���(�x�]^��k^C#�~���N_���a���h�7��\�3F'F�$� �qld�V��}q�X�!�…
14 cL�Py2��W��_,ݨ��l�*��z4m:����7<k֎�Bl���$/�Pe��0i����=���ϋ������+�ar� � f����Go�'�5���vb�…
17 g!d���+ߏ �������h�̌�f��Q����z+�Ȫk O�q����:$B�_�;��䶢���o�s�e}�J�)��h)ΞD[�&Z�/��gY�MN…
19k� \�x:S�8X �&�a5�O :�ڃ�/�=�N�Z���S�=���D)p幬�=�64װ"�[I�T��w��#1S�(�,o�.� ���wT���.r�W…
30 …��N��iJ�`,s���2X��s�A~�*����8ŪH�K_]��19�� � \�P�7��U���#*${�������:�k:��X�?���,c0�O��YuɄ…
58 …B:Ԭ�ʅ� � ��2��~l�EW ���Fnq�Zv�WWN��m+���8+�?�o<4�j��a#��y�z��M~��k<�%߈<J��!�8("�O����
59 ���sqCe�Bn�!������k:��Ɋܷ)$���=s �����/R�QC]q�[�>K�*� �����_Ԗ-(����*q�=`̻-�N��O��4…
62 �VWE?}� ��k�d�٠d9zM�N�^��b\nXޟʷ�O�y#6p:���BG�cLoG9�m����Ax
66 …7�y�X�?� w��<�p��{db%��n��"��"C�����w:Qi�BԔn2�c�o#��S�u������|�Ο����b�k�lv��C����*�p{����…
/packages/modules/NeuralNetworks/common/operations/
DRoiAlign.cpp130 for (uint32_t k = 0; k < inDepth; k++) outPtr[k] = 0; in roiAlignNhwc() local
163 for (uint32_t k = 0; k < inDepth; k++) { in roiAlignNhwc() local
166 interpolation += ws[c] * batchBase[offsets[c] + k]; in roiAlignNhwc()
168 outPtr[k] += interpolation; in roiAlignNhwc()
174 for (uint32_t k = 0; k < inDepth; k++) in roiAlignNhwc() local
175 outPtr[k] /= static_cast<T_Input>(numSamplingPoints); in roiAlignNhwc()
289 for (uint32_t k = 0; k < inDepth; k++) { in roiAlignQuantNhwc() local
294 wQuant * (static_cast<int32_t>(batchBase[offsets[c] + k]) - in roiAlignQuantNhwc()
297 outTemp[k] += interpolation; in roiAlignQuantNhwc()
303 for (uint32_t k = 0; k < inDepth; k++) { in roiAlignQuantNhwc() local
[all …]
DTopK_V2.cpp41 bool evalGeneric(const T* inputData, const Shape& inputShape, const int32_t k, T* valuesData, in evalGeneric() argument
52 std::nth_element(values.begin(), values.begin() + (rowSize - k), values.end()); in evalGeneric()
53 std::sort(values.begin() + (rowSize - k), values.end()); in evalGeneric()
55 for (int i = 0; i < k; ++i) { in evalGeneric()
97 const int32_t k = context->getInputValue<int32_t>(kTopKScalar); in prepare() local
98 NN_RET_CHECK_GT(k, 0); in prepare()
99 NN_RET_CHECK_LE(k, inputShape.dimensions.back()); in prepare()
104 outputValuesShape.dimensions.back() = k; in prepare()
108 outputIndicesShape.dimensions.back() = k; in prepare()
DEmbeddingLookupTest.cpp102 ASSERT_EQ(execution.setInput(EmbeddingLookup::k##X##Tensor, X##_.data(), \ in Invoke()
111 ASSERT_EQ(execution.setOutput(EmbeddingLookup::k##X##Tensor, X##_.data(), \ in Invoke()
132 for (uint32_t k = 0; k < features_; k++) { in Set3DWeightMatrix() local
133 Value_[(i * columns_ + j) * features_ + k] = function(i, j, k); in Set3DWeightMatrix()
160 m.Set3DWeightMatrix([](int i, int j, int k) { return i + j / 10.0f + k / 100.0f; }); in TEST() argument
DGroupedConv2D.cpp73 for (uint32_t k = 0; k < filterDepth; k++) { in groupedConvFloat32() local
76 uint32_t dInput = filterDepth * g + k; in groupedConvFloat32()
80 i * filterWidth * filterDepth + j * filterDepth + k; in groupedConvFloat32()
145 for (uint32_t k = 0; k < filterDepth; k++) { in groupedConvQuant8() local
148 uint32_t dInput = filterDepth * g + k; in groupedConvQuant8()
152 i * filterWidth * filterDepth + j * filterDepth + k; in groupedConvQuant8()
249 for (uint32_t k = 0; k < filterDepth; k++) { in groupedConvQuant8PerChannel() local
252 uint32_t dInput = filterDepth * g + k; in groupedConvQuant8PerChannel()
256 i * filterWidth * filterDepth + j * filterDepth + k; in groupedConvQuant8PerChannel()
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
Ddb_utilities_indexing.h62 int i,j,k; in db_MultiplyMatricesAB() local
68 for(k=0;k<acols;k++) acc+=A[i][k]*B[k][j]; in db_MultiplyMatricesAB()
75 int i,j,k; in db_UpperMultiplyMatricesAtB() local
81 for(k=0;k<acols;k++) acc+=At[k][i]*B[k][j]; in db_UpperMultiplyMatricesAtB()
Ddb_utilities_linalg.cpp82 int i,j,k; in db_CholeskyDecompSeparateDiagonal() local
90 for(k=i-1;k>=0;k--) s-=A[i][k]*A[j][k]; in db_CholeskyDecompSeparateDiagonal()
104 int i,k; in db_CholeskyBacksub() local
109 for(s=b[i],k=i-1;k>=0;k--) s-=A[i][k]*x[k]; in db_CholeskyBacksub()
114 for(s=x[i],k=i+1;k<n;k++) s-=A[k][i]*x[k]; in db_CholeskyBacksub()
/packages/apps/Gallery2/src/com/android/gallery3d/data/
DLocalMergeAlbum.java138 int k = -1; // k points to the best slot up to now. in getMediaItem() local
141 if (k == -1 || mComparator.compare(slot[j], slot[k]) < 0) { in getMediaItem()
142 k = j; in getMediaItem()
148 if (k == -1) break; in getMediaItem()
151 subPos[k]++; in getMediaItem()
153 result.add(slot[k]); in getMediaItem()
155 slot[k] = mFetcher[k].getItem(subPos[k]); in getMediaItem()
DSizeClustering.java90 int k = 0; in run() local
96 mClusters[k] = group[i]; in run()
98 mNames[k] = String.format( in run()
101 mNames[k] = String.format( in run()
106 mNames[k] = String.format( in run()
109 mMinSizes[k] = SIZE_LEVELS[i]; in run()
110 k++; in run()
DLocationClustering.java232 for (int k = minK; k <= maxK; k++) { in kMeans()
234 int delta = n / k; in kMeans()
235 for (int i = 0; i < k; i++) { in kMeans()
243 for (int i = 0; i < k; i++) { in kMeans()
254 for (int j = 0; j < k; j++) { in kMeans()
276 for (int i = 0; i < k; i++) { in kMeans()
291 int reassign[] = new int[k]; in kMeans()
293 for (int i = 0; i < k; i++) { in kMeans()
/packages/modules/NeuralNetworks/runtime/test/specs/V1_2/
Dtopk_v2.mod.py27 k=Int32Scalar("k", 2),
35 k=Int32Scalar("k", 2),
43 k=Int32Scalar("k", 2),
51 k=Int32Scalar("k", 2),
59 k=Int32Scalar("k", 2),
67 k=Int32Scalar("k", 2),
75 model = Model().Operation("TOPK_V2", test_case.inp, test_case.k).To(
/packages/modules/NeuralNetworks/common/include/
DOperationsUtils.h338 for (int k = 0; k < blockSize; ++k) { in transposeFirstTwoDimensions() local
339 transposedBuffer[(j * firstDim + i) * blockSize + k] = in transposeFirstTwoDimensions()
340 buffer[(i * secondDim + j) * blockSize + k]; in transposeFirstTwoDimensions()
369 for (unsigned int k = 0; k < dimsA[2]; ++k) { in mergeThirdDimension() local
370 merged[(i * dimsA[1] + j) * (dimsA[2] + dimsB[2]) + k] = in mergeThirdDimension()
371 bufferA[(i * dimsA[1] + j) * dimsA[2] + k]; in mergeThirdDimension()
373 for (unsigned int k = 0; k < dimsB[2]; ++k) { in mergeThirdDimension() local
374 merged[(i * dimsA[1] + j) * (dimsA[2] + dimsB[2]) + dimsA[2] + k] = in mergeThirdDimension()
375 bufferB[(i * dimsB[1] + j) * dimsB[2] + k]; in mergeThirdDimension()
/packages/modules/StatsD/lib/libkll/include/
Dkll.h45 int k() const { in k() function
46 return compactor_stack_.k(); in k()
74 KllQuantile(int64_t inv_eps, int64_t inv_delta, int k, RandomGenerator* random) in KllQuantile() argument
77 compactor_stack_(inv_eps_, inv_delta, k, in KllQuantile()
121 void set_k(int k) { in set_k() argument
122 k_ = k; in set_k()
135 int k() const { in k() function
/packages/apps/Gallery2/jni_jpegstream/src/
Djpeg_reader.cpp186 int r, g, b, c, m, y, k; in formatPixels() local
191 k = buf[i + 3]; in formatPixels()
194 r = (k * c) / 255; in formatPixels()
195 g = (k * m) / 255; in formatPixels()
196 b = (k * y) / 255; in formatPixels()
198 r = (255 - k) * (255 - c) / 255; in formatPixels()
199 g = (255 - k) * (255 - m) / 255; in formatPixels()
200 b = (255 - k) * (255 - y) / 255; in formatPixels()
/packages/modules/Connectivity/Tethering/src/com/android/networkstack/tethering/
DBpfCoordinator.java755 mBpfCoordinatorShim.tetherOffloadRuleForEach(UPSTREAM, (k, v) -> { in tetherOffloadRuleClear()
756 if (Arrays.equals(k.src4, clientAddr.getAddress())) { in tetherOffloadRuleClear()
757 deleteUpstreamRuleKeys.add(k); in tetherOffloadRuleClear()
760 mBpfCoordinatorShim.tetherOffloadRuleForEach(DOWNSTREAM, (k, v) -> { in tetherOffloadRuleClear()
762 deleteDownstreamRuleKeys.add(k); in tetherOffloadRuleClear()
763 upstreamIndiceSet.add((int) k.iif); in tetherOffloadRuleClear()
778 for (final Tether4Key k : deleteUpstreamRuleKeys) { in tetherOffloadRuleClear()
779 mBpfCoordinatorShim.tetherOffloadRuleRemove(UPSTREAM, k); in tetherOffloadRuleClear()
781 for (final Tether4Key k : deleteDownstreamRuleKeys) { in tetherOffloadRuleClear()
782 mBpfCoordinatorShim.tetherOffloadRuleRemove(DOWNSTREAM, k); in tetherOffloadRuleClear()
[all …]
/packages/modules/Wifi/service/java/com/android/server/wifi/util/
DMatrix.java210 for (int k = 0; k < m; k++) { in dot()
211 s += this.get(i, k) * that.get(k, j); in dot()
350 for (int k = 0; k < m; k++) { in dotTranspose()
351 s += this.get(i, k) * that.get(j, k); in dotTranspose()
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/colorpicker/
DColorGridDialog.java42 int k = 0; in ColorGridDialog() local
47 hsv[0] = (k % 5) * 360 / 5; in ColorGridDialog()
48 hsv[1] = (k / 5) / 3.0f; in ColorGridDialog()
49 hsv[2] = (k < 5) ? (k / 4f) : 1; in ColorGridDialog()
60 k++; in ColorGridDialog()
/packages/modules/StatsD/lib/libkll/tests/
Dkll_test.cpp66 EXPECT_GE(quantiles_state.k(), 300); in TEST()
67 EXPECT_LT(quantiles_state.k(), 5000); in TEST()
105 EXPECT_GE(quantiles_state.k(), 15); in TEST()
106 EXPECT_LT(quantiles_state.k(), 200); in TEST()
137 EXPECT_EQ(quantiles_state.k(), 6000); in TEST()
162 EXPECT_GE(quantiles_state.k(), 1000); in TEST()
163 EXPECT_LT(quantiles_state.k(), 5000); in TEST()

1234567