Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 516) sorted by relevance

12345678910>>...21

/system/core/libpixelflinger/codeflinger/
Dmips_disassem.c189 InstFmt i; in db_disasm_insn() local
191 i.word = insn; in db_disasm_insn()
193 switch (i.JType.op) { in db_disasm_insn()
195 if (i.word == 0) { in db_disasm_insn()
199 if (i.word == 0x0080) { in db_disasm_insn()
203 if (i.word == 0x00c0) { in db_disasm_insn()
211 if ( (i.RType.func == OP_ADDU && i.RType.rt == 0) || in db_disasm_insn()
212 (i.RType.func == OP_OR && i.RType.rt == 0) ) { in db_disasm_insn()
214 reg_name[i.RType.rd], in db_disasm_insn()
215 reg_name[i.RType.rs]); in db_disasm_insn()
[all …]
/system/core/libmincrypt/
Drsa.c36 int i; in subM() local
37 for (i = 0; i < key->len; ++i) { in subM()
38 A += (uint64_t)a[i] - key->n[i]; in subM()
39 a[i] = (uint32_t)A; in subM()
47 int i; in geM() local
48 for (i = key->len; i;) { in geM()
49 --i; in geM()
50 if (a[i] < key->n[i]) return 0; in geM()
51 if (a[i] > key->n[i]) return 1; in geM()
64 int i; in montMulAdd() local
[all …]
Dp256.c64 int i, result = 0; in p256_is_zero() local
65 for (i = 0; i < P256_NDIGITS; ++i) result |= P256_DIGIT(a, i); in p256_is_zero()
75 int i; in mulAdd() local
78 for (i = 0; i < P256_NDIGITS; ++i) { in mulAdd()
80 carry += (p256_ddigit)P256_DIGIT(a, i) * b; in mulAdd()
92 int i; in subTop() local
95 for (i = 0; i < P256_NDIGITS; ++i) { in subTop()
114 int i; in subM() local
116 for (i = 0; i < P256_NDIGITS; ++i) { in subM()
118 borrow -= P256_DIGIT(MOD, i) & mask; in subM()
[all …]
Dp256_ec.c220 unsigned i; in felem_sum() local
222 for (i = 0;; i++) { in felem_sum()
223 out[i] = in[i] + in2[i]; in felem_sum()
224 out[i] += carry; in felem_sum()
225 carry = out[i] >> 29; in felem_sum()
226 out[i] &= kBottom29Bits; in felem_sum()
228 i++; in felem_sum()
229 if (i == NLIMBS) in felem_sum()
232 out[i] = in[i] + in2[i]; in felem_sum()
233 out[i] += carry; in felem_sum()
[all …]
/system/bt/osi/test/
Darray_test.cpp35 for (int i = 0; i < 100; ++i) { in TEST_F() local
36 array_append_value(array, i * i); in TEST_F()
38 for (int i = 0; i < 100; ++i) { in TEST_F() local
39 EXPECT_EQ(*(int *)array_at(array, i), i * i); in TEST_F()
47 for (int i = 0; i < 100; ++i) { in TEST_F() local
48 items[i] = i * i; in TEST_F()
49 array_append_ptr(array, &items[i]); in TEST_F()
51 for (int i = 0; i < 100; ++i) { in TEST_F() local
52 EXPECT_EQ(*(int *)array_at(array, i), i * i); in TEST_F()
70 for (int i = 0; i < 100; ++i) { in TEST_F() local
[all …]
Dhash_map_test.cpp67 for (size_t i = 0; i < data_sz; i++) { in TEST_F() local
68 EXPECT_EQ(i, hash_map_size(hash_map)); in TEST_F()
69 hash_map_set(hash_map, data[i].key, (void*)data[i].data); in TEST_F()
70 EXPECT_EQ(i + 1, hash_map_size(hash_map)); in TEST_F()
75 for (size_t i = 0; i < data_sz; i++) { in TEST_F() local
76 char *val = (char *)hash_map_get(hash_map, data[i].key); in TEST_F()
77 EXPECT_STREQ(data[i].data, val); in TEST_F()
100 for (size_t i = 0; i < data_sz; i++) { in TEST_F() local
101 hash_map_set(hash_map, data[i].key, (void*)data[i].data); in TEST_F()
107 for (size_t i = 0; i < data_sz; i++) { in TEST_F() local
[all …]
/system/core/libion/tests/
Ddevice_test.cpp128 for (size_t i = size-1; i > 0; i--) { in dirtyCache() local
129 ((volatile char *)ptr)[i]; in dirtyCache()
130 ((char *)ptr)[i] = i; in dirtyCache()
151 for (int i = 0; i < 4096; i++) in TEST_F() local
152 ((char *)ptr)[i] = i; in TEST_F()
158 for (int i = 0; i < 4096; i++) in TEST_F() local
159 ASSERT_EQ((char)i, ((char *)buf)[i]); in TEST_F()
173 for (int i = 0; i < 4096; i++) in TEST_F() local
174 ((char *)buf)[i] = i; in TEST_F()
192 for (int i = 0; i < 4096; i++) in TEST_F() local
[all …]
/system/bt/bta/gatt/
Dbta_gatts_utils.c66 UINT8 i; in bta_gatts_alloc_srvc_cb() local
68 for (i = 0; i < BTA_GATTS_MAX_SRVC_NUM; i ++) in bta_gatts_alloc_srvc_cb()
70 if (!p_cb->srvc_cb[i].in_use) in bta_gatts_alloc_srvc_cb()
72 p_cb->srvc_cb[i].in_use = TRUE; in bta_gatts_alloc_srvc_cb()
73 p_cb->srvc_cb[i].rcb_idx = rcb_idx; in bta_gatts_alloc_srvc_cb()
74 return i; in bta_gatts_alloc_srvc_cb()
91 UINT8 i; in bta_gatts_find_app_rcb_by_app_if() local
94 for (i = 0, p_reg = bta_gatts_cb.rcb; i < BTA_GATTS_MAX_APP_NUM; i ++, p_reg++) in bta_gatts_find_app_rcb_by_app_if()
114 UINT8 i; in bta_gatts_find_app_rcb_idx_by_app_if() local
116 for (i = 0; i < BTA_GATTS_MAX_APP_NUM; i ++) in bta_gatts_find_app_rcb_idx_by_app_if()
[all …]
/system/extras/cpustats/
Dcpustats.c72 int i, freq_count; in main() local
79 for (i = 0; i < argc; i++) { in main()
80 if (!strcmp(argv[i], "-n")) { in main()
81 if (i + 1 >= argc) { in main()
86 iterations = atoi(argv[++i]); in main()
89 if (!strcmp(argv[i], "-d")) { in main()
90 if (i + 1 >= argc) { in main()
95 delay = atoi(argv[++i]); in main()
98 if (!strcmp(argv[i], "-m")) { in main()
101 if (!strcmp(argv[i], "-h")) { in main()
[all …]
/system/extras/tests/memtest/
Dfptest.cpp60 for(int i=0; i<1020; i++) { in test_mad() local
61 data_f[i] = i; in test_mad()
69 for (int i=0; i < 1000; i++) { in test_mad() local
70 data_f[i] = (data_f[i] * 0.02f + in test_mad()
71 data_f[i+1] * 0.04f + in test_mad()
72 data_f[i+2] * 0.05f + in test_mad()
73 data_f[i+3] * 0.1f + in test_mad()
74 data_f[i+4] * 0.2f + in test_mad()
75 data_f[i+5] * 0.2f + in test_mad()
76 data_f[i+6] * 0.1f + in test_mad()
[all …]
/system/media/audio_utils/
Dfixedfft.cpp113 int scale = LOG_FFT_SIZE, i, p, r; in fixed_fft() local
115 for (r = 0, i = 1; i < n; ++i) { in fixed_fft()
117 if (i < r) { in fixed_fft()
118 int32_t t = v[i]; in fixed_fft()
119 v[i] = v[r]; in fixed_fft()
127 for (i = 0; i < n; i += p << 1) { in fixed_fft()
128 int32_t x = half(v[i]); in fixed_fft()
129 int32_t y = half(v[i + p]); in fixed_fft()
130 v[i] = x + y; in fixed_fft()
131 v[i + p] = x - y; in fixed_fft()
[all …]
/system/bt/test/suite/
Dmain.c52 for (int i = 0; watchdog_running && i < WATCHDOG_PERIOD_SEC; ++i) { in watchdog_fn() local
85 for (size_t i = 0; i < sanity_suite_size; ++i) { in print_usage() local
86 printf(" %s\n", sanity_suite[i].function_name); in print_usage()
88 for (size_t i = 0; i < test_suite_size; ++i) { in print_usage() local
89 printf(" %s\n", test_suite[i].function_name); in print_usage()
94 for (size_t i = 0; i < sanity_suite_size; ++i) { in is_valid() local
95 if (!strcmp(test_name, sanity_suite[i].function_name)) { in is_valid()
99 for (size_t i = 0; i < test_suite_size; ++i) { in is_valid() local
100 if (!strcmp(test_name, test_suite[i].function_name)) { in is_valid()
111 for (int i = 1; i < argc; ++i) { in main() local
[all …]
/system/core/libutils/tests/
DBlobCache_test.cpp119 for (int i = 0; i < MAX_KEY_SIZE+1; i++) { in TEST_F() local
120 key[i] = 'a'; in TEST_F()
132 for (int i = 0; i < MAX_VALUE_SIZE+1; i++) { in TEST_F() local
133 buf[i] = 'b'; in TEST_F()
136 for (int i = 0; i < MAX_VALUE_SIZE+1; i++) { in TEST_F() local
137 buf[i] = 0xee; in TEST_F()
140 for (int i = 0; i < MAX_VALUE_SIZE+1; i++) { in TEST_F() local
141 SCOPED_TRACE(i); in TEST_F()
142 ASSERT_EQ(0xee, buf[i]); in TEST_F()
155 for (int i = 0; i < MAX_KEY_SIZE; i++) { in TEST_F() local
[all …]
/system/media/audio_route/
Daudio_route.c100 unsigned int i; in path_print() local
104 for (i = 0; i < path->length; i++) { in path_print()
105 struct mixer_ctl *ctl = index_to_ctl(ar, path->setting[i].ctl_index); in path_print()
107 ALOGE(" id=%d: ctl=%s", i, mixer_ctl_get_name(ctl)); in path_print()
108 for (j = 0; j < path->setting[i].num_values; j++) in path_print()
109 ALOGE(" id=%d value=%d", j, path->setting[i].value[j]); in path_print()
115 unsigned int i; in path_free() local
117 for (i = 0; i < ar->num_mixer_paths; i++) { in path_free()
118 if (ar->mixer_path[i].name) in path_free()
119 free(ar->mixer_path[i].name); in path_free()
[all …]
/system/core/toolbox/upstream-netbsd/usr.bin/grep/
Dfastgrep.c60 unsigned int i; in fgrepcomp() local
71 for (i = 0; i <= UCHAR_MAX; i++) in fgrepcomp()
72 fg->qsBc[i] = fg->len; in fgrepcomp()
73 for (i = 1; i < fg->len; i++) in fgrepcomp()
74 fg->qsBc[fg->pattern[i]] = fg->len - i; in fgrepcomp()
83 unsigned int i; in fastcomp() local
129 for (i = 0; i < fg->len; i++) { in fastcomp()
131 if (fg->pattern[i] == '.') { in fastcomp()
132 hasDot = i; in fastcomp()
133 if (i < fg->len / 2) { in fastcomp()
[all …]
/system/extras/tests/pagingtest/
Dthrashing_test.c17 unsigned i, j; in thrashing_test() local
36 for (i = 0; i < ARRAY_SIZE(fds); i++) { in thrashing_test()
37 fds[i] = create_tmp_file(tmpnames[i], filesize); in thrashing_test()
38 if (fds[i] < 0) { in thrashing_test()
43 for (i = 0; i < ARRAY_SIZE(fds); i++) { in thrashing_test()
44 bufs[i] = mmap(NULL, filesize, PROT_READ, MAP_PRIVATE, fds[i], 0); in thrashing_test()
45 if (bufs[i] == ((void *)-1)) { in thrashing_test()
51 for (i = 0; i < test_runs; i++) { in thrashing_test()
72 for (i = 0; i < ARRAY_SIZE(bufs) && bufs[i] != NULL; i++) { in thrashing_test()
73 munmap((void *)bufs[i], filesize); in thrashing_test()
[all …]
/system/core/libsync/
Dsync_test.c40 int i; in sync_thread() local
42 for (i = 0; i < 2; i++) { in sync_thread()
43 err = sync_wait(sync_data->fd[i], 10000); in sync_thread()
48 i, strerror(errno)); in sync_thread()
50 printf("thread %d wait %d done\n", sync_data->thread_no, i); in sync_thread()
52 info = sync_fence_info(sync_data->fd[i]); in sync_thread()
81 int i, j; in main() local
90 for (i = 0; i < 3; i++) { in main()
91 sync_data[i].thread_no = i; in main()
94 unsigned val = i + j * 3 + 1; in main()
[all …]
/system/bt/stack/pan/
Dpan_utils.c184 UINT16 i; in pan_allocate_pcb() local
186 for (i=0; i<MAX_PAN_CONNS; i++) in pan_allocate_pcb()
188 if (pan_cb.pcb[i].con_state != PAN_STATE_IDLE && in pan_allocate_pcb()
189 pan_cb.pcb[i].handle == handle) in pan_allocate_pcb()
193 for (i=0; i<MAX_PAN_CONNS; i++) in pan_allocate_pcb()
195 if (pan_cb.pcb[i].con_state != PAN_STATE_IDLE && in pan_allocate_pcb()
196 memcmp (pan_cb.pcb[i].rem_bda, p_bda, BD_ADDR_LEN) == 0) in pan_allocate_pcb()
200 for (i=0; i<MAX_PAN_CONNS; i++) in pan_allocate_pcb()
202 if (pan_cb.pcb[i].con_state == PAN_STATE_IDLE) in pan_allocate_pcb()
204 memset (&(pan_cb.pcb[i]), 0, sizeof (tPAN_CONN)); in pan_allocate_pcb()
[all …]
/system/bt/btcore/src/
Duuid.c70 for (size_t i = 0; i < sizeof(bt_uuid_t); ++i, s+=2) { in uuid_new() local
74 uuid->uu[i] = strtoul(buf, NULL, 16); in uuid_new()
76 switch(i) { in uuid_new()
136 for (int i = 0; i < 4; i++) { in uuid_to_string() local
137 string += sprintf(string, "%02x", uuid->uu[i]); in uuid_to_string()
140 for (int i = 4; i < 6; i++) { in uuid_to_string() local
141 string += sprintf(string, "%02x", uuid->uu[i]); in uuid_to_string()
144 for (int i = 6; i < 8; i++) { in uuid_to_string() local
145 string += sprintf(string, "%02x", uuid->uu[i]); in uuid_to_string()
148 for (int i = 8; i < 10; i++) { in uuid_to_string() local
[all …]
/system/core/fs_mgr/
Dfs_mgr.c128 int i; in check_fs() local
129 for (i = 0; i < 5; i++) { in check_fs()
304 int i; in mount_with_alternatives() local
316 for (i = start_idx; in mount_with_alternatives()
318i < fstab->num_entries && !strcmp(fstab->recs[start_idx].mount_point, fstab->recs[i].mount_point); in mount_with_alternatives()
319 i++) { in mount_with_alternatives()
327 … fstab->recs[i].mount_point, i, fstab->recs[i].fs_type, fstab->recs[*attempted_idx].fs_type); in mount_with_alternatives()
331 if (fstab->recs[i].fs_mgr_flags & MF_CHECK) { in mount_with_alternatives()
332 check_fs(fstab->recs[i].blk_device, fstab->recs[i].fs_type, in mount_with_alternatives()
333 fstab->recs[i].mount_point); in mount_with_alternatives()
[all …]
/system/bt/btif/src/
Dbtif_mce.c55 int i; in btif_mce_mas_discovery_comp_evt() local
62 for (i = 0; i < evt_data->num_mas; i++) in btif_mce_mas_discovery_comp_evt()
64 insts[i].id = evt_data->mas[i].instance_id; in btif_mce_mas_discovery_comp_evt()
65 insts[i].scn = evt_data->mas[i].scn; in btif_mce_mas_discovery_comp_evt()
66 insts[i].msg_types = evt_data->mas[i].msg_type; in btif_mce_mas_discovery_comp_evt()
67 insts[i].p_name = evt_data->mas[i].p_srv_name; in btif_mce_mas_discovery_comp_evt()
80 int i; in mas_discovery_comp_copy_cb() local
92 for (i = 0; i < p_src_data->num_mas; i++) in mas_discovery_comp_copy_cb()
94 p_dest_data->mas[i].p_srv_name = p_dest_str; in mas_discovery_comp_copy_cb()
95 memcpy(p_dest_str, p_src_data->mas[i].p_srv_name, p_src_data->mas[i].srv_name_len); in mas_discovery_comp_copy_cb()
[all …]
/system/core/libutils/
DJenkinsHash.cpp35 size_t i; in JenkinsHashMixBytes() local
36 for (i = 0; i < (size & -4); i += 4) { in JenkinsHashMixBytes()
37 uint32_t data = bytes[i] | (bytes[i+1] << 8) | (bytes[i+2] << 16) | (bytes[i+3] << 24); in JenkinsHashMixBytes()
41 uint32_t data = bytes[i]; in JenkinsHashMixBytes()
42 data |= ((size & 3) > 1) ? (bytes[i+1] << 8) : 0; in JenkinsHashMixBytes()
43 data |= ((size & 3) > 2) ? (bytes[i+2] << 16) : 0; in JenkinsHashMixBytes()
51 size_t i; in JenkinsHashMixShorts() local
52 for (i = 0; i < (size & -2); i += 2) { in JenkinsHashMixShorts()
53 uint32_t data = shorts[i] | (shorts[i+1] << 16); in JenkinsHashMixShorts()
57 uint32_t data = shorts[i]; in JenkinsHashMixShorts()
/system/bt/bta/sys/
Dutl.c122 UINT8 utl_itoa(UINT16 i, char *p_s) in utl_itoa() argument
128 if (i == 0) in utl_itoa()
137 k = i / j; in utl_itoa()
138 i %= j; in utl_itoa()
260 UINT16 i = 0; in utl_isintstr() local
262 for(i=0; p_s[i] != 0; i++) in utl_isintstr()
264 if(((p_s[i] < '0') || (p_s[i] > '9')) && (p_s[i] != ';')) in utl_isintstr()
284 UINT16 i = 0; in utl_isdialstr() local
286 for(i=0; p_s[i] != 0; i++) in utl_isdialstr()
288 if(!(((p_s[i] >= '0') && (p_s[i] <= '9')) in utl_isdialstr()
[all …]
/system/keymaster/
Doperation_table.cpp51 for (size_t i = 0; i < table_size_; ++i) { in Add() local
52 if (table_[i].operation == NULL) { in Add()
53 table_[i].operation = op.release(); in Add()
54 table_[i].handle = *op_handle; in Add()
68 for (size_t i = 0; i < table_size_; ++i) { in Find() local
69 if (table_[i].handle == op_handle) in Find()
70 return table_[i].operation; in Find()
79 for (size_t i = 0; i < table_size_; ++i) { in Delete() local
80 if (table_[i].handle == op_handle) { in Delete()
81 delete table_[i].operation; in Delete()
[all …]
/system/core/libcutils/tests/
DMemsetTest.cpp103 for (int i = 0; i < FENCEPOST_LENGTH; i += 2) { in SetFencepost() local
104 buffer[i] = 0xde; in SetFencepost()
105 buffer[i+1] = 0xad; in SetFencepost()
110 for (int i = 0; i < FENCEPOST_LENGTH; i += 2) { in VerifyFencepost() local
111 if (buffer[i] != 0xde || buffer[i+1] != 0xad) { in VerifyFencepost()
113 if (buffer[i] == 0xde) { in VerifyFencepost()
114 i++; in VerifyFencepost()
119 ASSERT_EQ(expected_value, buffer[i]); in VerifyFencepost()
131 for (size_t i = 0; i < MAX_TEST_SIZE/sizeof(uint32_t); i++) { in RunMemsetTests() local
132 expected_buf[i] = value; in RunMemsetTests()
[all …]

12345678910>>...21