Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 166) sorted by relevance

1234567

/system/media/audio_utils/tests/
Dchannelmix_tests.cpp136 for (size_t j = 0; j < channels; ++j) { in channelStatistics() local
137 result[j].add(*fptr++); in channelStatistics()
198 for (unsigned j = 0; j < frames; ++j) { in testBalance() local
200 *indata++ = (k == i) ? (j & 1 ? -0.5f : 0.5f) : 0; in testBalance()
207 for (unsigned j = 0; j < frames; ++j) { in testBalance() local
219 for (unsigned j = 0; j < frames; ++j) { in testBalance() local
228 for (unsigned j = 0; j < frames; ++j) { in testBalance() local
237 for (size_t j = 0; j < outChannels; ++j) { in testBalance() local
238 power[j] = stats[j].getPopVariance(); in testBalance()
245 for (unsigned j = 0; j < outChannels; ++j) { in testBalance() local
[all …]
/system/tools/aidl/tests/
Dtest_util.cpp74 for (size_t j = 0; j < b_lines.size() + 1; ++j) { in PrintDiff() local
75 if (i == 0 || j == 0) { in PrintDiff()
82 if (j) { in PrintDiff()
86 table[i][j].longest_common_subsequence_length = 0; in PrintDiff()
87 table[i][j].propagation_directions = directions; in PrintDiff()
88 } else if (a_lines[i-1] == b_lines[j-1]) { in PrintDiff()
89 table[i][j].longest_common_subsequence_length = in PrintDiff()
90 table[i-1][j-1].longest_common_subsequence_length + 1; in PrintDiff()
91 table[i][j].propagation_directions = UP_LEFT; in PrintDiff()
93 size_t length_up = table[i-1][j].longest_common_subsequence_length; in PrintDiff()
[all …]
/system/media/audio_utils/
Dmono_blend.cpp33 for (size_t j = 0; j < channelCount; ++j) { in mono_blend() local
37 for (size_t j = 0; j < channelCount; ++j) { in mono_blend() local
48 for (size_t j = 0; j < channelCount; ++j) { in mono_blend() local
56 for (size_t j = 0; j < channelCount; ++j) { in mono_blend() local
DChannelMix.cpp86 for (size_t j = 0; j < s.OUTPUT_CHANNEL_COUNT; ++j) { in sparseChannelMatrixMultiply() local
87 ch[j] += array[j] * src[i]; in sparseChannelMatrixMultiply()
92 for (size_t j = 0; j < s.OUTPUT_CHANNEL_COUNT; ++j) { in sparseChannelMatrixMultiply() local
93 ch[j] += dst[j]; in sparseChannelMatrixMultiply()
97 for (size_t j = 0; j < s.OUTPUT_CHANNEL_COUNT; ++j) { in sparseChannelMatrixMultiply() local
98 dst[j] = clamp(ch[j]); in sparseChannelMatrixMultiply()
DBalance.cpp93 for (size_t j = 0; j < mChannelCount; ++j) { in process() local
94 mDeltas[j] = (mVolumes[j] - mRampVolumes[j]) * r; in process()
100 for (size_t j = 0; j < mChannelCount; ++j) { // better precision: delta * i in process() local
101 *buffer++ *= mRampVolumes[j] + mDeltas[j] * findex; in process()
114 for (size_t j = 0; j < mChannelCount; ++j) { in process() local
115 *buffer++ *= mVolumes[j]; in process()
/system/extras/cpu_loads/
Dsimd.cpp29 for (int j = 0; j < 8192; j++) { in main() local
30 a(i, j) = 1 + i * j; in main()
31 b(i, j) = 2 + i * j; in main()
32 c(i, j) = 3 + i * j; in main()
/system/extras/simpleperf/
Dbuild_id.h49 for (size_t j = i; j < i + 2; ++j) { in BuildId() local
51 if (s[j] >= '0' && s[j] <= '9') { in BuildId()
52 ch |= s[j] - '0'; in BuildId()
53 } else if (s[j] >= 'a' && s[j] <= 'f') { in BuildId()
54 ch |= s[j] - 'a' + 10; in BuildId()
55 } else if (s[j] >= 'A' && s[j] <= 'F') { in BuildId()
56 ch |= s[j] - 'A' + 10; in BuildId()
DBranchListFile_test.cpp29 for (size_t j = 0; j <= i; j++) { in TEST() local
30 bool b = s[j >> 3] & (1 << (j & 7)); in TEST()
31 ASSERT_EQ(b, branch[j]); in TEST()
/system/extras/tests/framebuffer/
Dfb_test.c208 int i, j; in draw_grid() local
213 for (j = 0; j < h/2; j++) { in draw_grid()
216 loc[i + j*(stride)] = red; in draw_grid()
218 loc32[i + j*(stride)] = red32; in draw_grid()
221 loc[i + j*(stride)] = green; in draw_grid()
223 loc32[i + j*(stride)] = green32; in draw_grid()
226 for (; j < h; j++) { in draw_grid()
229 loc[i + j*(stride)] = blue; in draw_grid()
231 loc32[i + j*(stride)] = blue32; in draw_grid()
234 loc[i + j*(stride)] = white; in draw_grid()
[all …]
/system/extras/simpleperf/testdata/
Dperf_with_jit_symbol.foldedstack_with_tid2 …mpleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j] 317654
3 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
4 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
5 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
6 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
7 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
8 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
9 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];unknow…
Dperf_with_jit_symbol.foldedstack_with_pid2 …mpleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j] 317654
3 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
4 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
5 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
6 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
7 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
8 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
9 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];unknow…
Dperf_with_jit_symbol.foldedstack2 …mpleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j] 317654
3 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
4 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
5 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
6 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
7 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
8 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];art::M…
9 …pleperf.debuggable.MainActivity$1.run;java.lang.Thread.sleep_[j];java.lang.Thread.sleep_[j];unknow…
/system/chre/apps/nearby/location/lbs/contexthub/nanoapps/nearby/
Dhw_filter.cc35 for (int j = 0; j < filter.len; ++j) { in Match() local
36 if ((report.data[i + 1 + j] & filter.dataMask[j]) != in Match()
37 (filter.data[j] & filter.dataMask[j])) { in Match()
/system/extras/ext4_utils/include/ext4_utils/
Djbd2.h112 #define JBD2_HAS_COMPAT_FEATURE(j, mask) \ argument
113 ((j)->j_format_version >= 2 && ((j)->j_superblock->s_feature_compat & cpu_to_be32((mask))))
114 #define JBD2_HAS_RO_COMPAT_FEATURE(j, mask) \ argument
115 ((j)->j_format_version >= 2 && ((j)->j_superblock->s_feature_ro_compat & cpu_to_be32((mask))))
116 #define JBD2_HAS_INCOMPAT_FEATURE(j, mask) \ argument
117 ((j)->j_format_version >= 2 && ((j)->j_superblock->s_feature_incompat & cpu_to_be32((mask))))
/system/core/storaged/tools/
Dranker.py109 for j in range(8):
110 task_io[j] += long(words[i+j])
113 for j in range(8):
114 task_io.append(long(words[i+j]))
127 for j in range(8):
128 uid_io[j] += long(words[i+j])
131 uid_io = [long(words[i+j]) for j in range(8)]
163 for j in range(min(args.uidcnt, len(uid_rank[0]))):
164 uid = uid_rank[i][j][1]
/system/extras/mmap-perf/
DmmapPerf.cpp94 void benchLinearRead(unsigned int j) { in benchLinearRead() argument
95 uint8_t *targetPtr = (uint8_t*)m_ptr + pageSize * j; in benchLinearRead()
98 void benchLinearWrite(unsigned int j) { in benchLinearWrite() argument
99 uint8_t *targetPtr = (uint8_t*)m_ptr + pageSize * j; in benchLinearWrite()
136 unsigned int j = 0; in benchLinearRead() local
138 file.benchLinearRead(j); in benchLinearRead()
139 j = (j + 1) % pagesTotal; in benchLinearRead()
147 unsigned int j = 0; in benchLinearWrite() local
149 file.benchLinearWrite(j); in benchLinearWrite()
150 j = (j + 1) % pagesTotal; in benchLinearWrite()
/system/libfmq/benchmarks/
Dmsgq_benchmark_client.cpp167 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
202 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
234 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
266 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
295 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
329 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
362 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
397 for (uint32_t j = 0; j < numLoops; j++) { in TEST_F() local
/system/extras/verity/fec/
Dmain.cpp45 int j; in encode_rs() local
50 for (j = 0; j < fcx->rs_n; ++j) { in encode_rs()
51 data[j] = image_get_interleaved_byte(i + j, fcx); in encode_rs()
62 int j, rv; in decode_rs() local
69 for (j = 0; j < fcx->rs_n; ++j) { in decode_rs()
70 data[j] = image_get_interleaved_byte(i + j, fcx); in decode_rs()
81 for (j = 0; j < fcx->rs_n; ++j) { in decode_rs()
82 image_set_interleaved_byte(i + j, fcx, data[j]); in decode_rs()
/system/chre/apps/wifi_offload/test/
Drandomgenerator_test.cc73 for (size_t j = 0; j < repeats_to_fill_8_bytes; j++) { in GeneratesDifferentNumbersIn8Bytes() local
82 for (size_t j = i + 1; j < num_values; j++) { in GeneratesDifferentNumbersIn8Bytes() local
83 ASSERT_NE(rand_values[i], rand_values[j]); in GeneratesDifferentNumbersIn8Bytes()
/system/media/audio_route/
Daudio_route.c144 unsigned int j;
152 for (j = 0; j < path->setting[i].num_values; j++)
153 ALOGE(" id=%d value=0x%02x", j, path->setting[i].value.bytes[j]);
155 for (j = 0; j < path->setting[i].num_values; j++)
156 ALOGE(" id=%d value=%d", j, path->setting[i].value.enumerated[j]);
158 for (j = 0; j < path->setting[i].num_values; j++)
159 ALOGE(" id=%d value=%ld", j, path->setting[i].value.integer[j]);
172 size_t j; in path_free() local
173 for (j = 0; j < ar->mixer_path[i].length; j++) { in path_free()
174 free(ar->mixer_path[i].setting[j].value.ptr); in path_free()
[all …]
/system/tools/hidl/test/java_test/src/com/android/commands/hidl_test_java/
DHidlTestJava.java816 for (int j = 0; j < 6; ++j, ++k) { in client()
817 mac[j] = (byte)k; in client()
840 for (int j = 0; j < 6; ++j, ++k) { in client()
841 mac[j] = (byte)k; in client()
867 for (int j = 0; j < 3; ++j) { in client()
868 in.s[i][j] = numberToEnglish(3 * i + j + 1); in client()
869 expectedOut.s[j][i] = in.s[i][j]; in client()
884 for (int j = 0; j < 3; ++j) { in client()
885 in[i][j] = numberToEnglish(3 * i + j + 1); in client()
886 expectedOut[j][i] = in[i][j]; in client()
[all …]
/system/update_engine/payload_consumer/
Dverity_writer_android.cc81 for (size_t j = 0; j < rs_n_; j++) { in Compute() local
83 current_round_ * rs_n_ * block_size_ + j, rs_n_, num_rounds_); in Compute()
99 rs_blocks_[k * rs_n_ + j] = buffer_[k]; in Compute()
102 for (size_t j = 0; j < block_size_; j++) { in Compute() local
106 rs_blocks_.data() + j * rs_n_, in Compute()
107 fec_.data() + j * fec_roots_); in Compute()
359 for (size_t j = 0; j < rs_n; j++) { in EncodeFEC() local
362 fec_ecc_interleave(i * rs_n * block_size + j, rs_n, rounds); in EncodeFEC()
375 rs_blocks[k * rs_n + j] = buffer[k]; in EncodeFEC()
379 for (size_t j = 0; j < block_size; j++) { in EncodeFEC() local
[all …]
/system/extras/tests/pftest/
Dpftest.c50 unsigned int j; in main() local
55 for (j = 0; j < sizeof(numPagesList)/sizeof(int); j++) { in main()
56 int numPages = numPagesList[j]; in main()
/system/sepolicy/tools/sepolicy-analyze/
Dtypecmp.c162 size_t i, j; in analyze_types() local
220 for (j = i + 1; j < policydb->p_types.nprim; j++) { in analyze_types()
221 type = policydb->type_val_to_struct[j]; in analyze_types()
223 free_type_rules(type_rules[j].next); in analyze_types()
224 type_rules[j].next = NULL; in analyze_types()
227 for (l1 = type_rules[i].next, l2 = type_rules[j].next; in analyze_types()
242 policydb->p_type_val_to_name[j]); in analyze_types()
245 if (find_match(policydb, l1, i, l2, j)) in analyze_types()
247 if (find_match(policydb, l2, j, l1, i)) in analyze_types()
253 display_allow(policydb, &l2->key, j, l2->datum.data); in analyze_types()
[all …]
/system/core/trusty/libtrusty/tipc-test/
Dtipc_test.c338 uint i, j; in closer3_test() local
349 for (j = 0; j < 4; j++) { in closer3_test()
350 fd[j] = tipc_connect(params->dev_name, closer3_name); in closer3_test()
351 if (fd[j] < 0) { in closer3_test()
352 fprintf(stderr, "fd[%d]: failed to connect to '%s' service\n", j, "closer3"); in closer3_test()
355 printf("%s: fd[%d]=%d: connected\n", __func__, j, fd[j]); in closer3_test()
357 memset(buf, i + j, sizeof(buf)); in closer3_test()
358 rc = write(fd[j], buf, sizeof(buf)); in closer3_test()
361 printf("%s: fd[%d]=%d: write returned = %zd\n", __func__, j, fd[j], rc); in closer3_test()
372 for (j = 0; j < 4; j++) { in closer3_test()
[all …]

1234567