Home
last modified time | relevance | path

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

1234

/system/extras/ksmutils/
Dlookup3.c69 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
175 const uint32_t *k, /* the key, an array of uint32_t values */ in hashword() argument
187 a += k[0]; in hashword()
188 b += k[1]; in hashword()
189 c += k[2]; in hashword()
192 k += 3; in hashword()
198 case 3 : c+=k[2]; in hashword()
199 case 2 : b+=k[1]; in hashword()
200 case 1 : a+=k[0]; in hashword()
219 const uint32_t *k, /* the key, an array of uint32_t values */ in hashword2() argument
[all …]
Dksminfo.c191 size_t i, j, k; in read_pages() local
261 for (k = 0; k < kp->len; k++) { in read_pages()
262 if (kp->pages[k].hash == hash) break; in read_pages()
265 if (k == kp->len) { in read_pages()
275 memset(&tmp[k], 0, sizeof(tmp[k]) * GROWTH_FACTOR); in read_pages()
292 cur_page = &kp->pages[k]; in read_pages()
344 size_t i, j, k; in print_pages() local
371 for (k = 0; k < 8 && j < kp->pages[i].vaddr_len; k++, j++) { in print_pages()
/system/extras/perfprofd/scripts/
Dsorted_collection.py29 self._keys = [k for k, item in decorated]
30 self._items = [item for k, item in decorated]
74 k = self._key(item)
75 i = bisect_left(self._keys, k)
76 j = bisect_right(self._keys, k)
81 k = self._key(item)
82 i = bisect_left(self._keys, k)
83 j = bisect_right(self._keys, k)
88 k = self._key(item)
89 i = bisect_left(self._keys, k)
[all …]
/system/chre/external/kiss_fft/
Dkiss_fftr.c70 int k,ncfft; in kiss_fftr() local
105 for ( k=1;k <= ncfft/2 ; ++k ) { in kiss_fftr()
106 fpk = st->tmpbuf[k]; in kiss_fftr()
107 fpnk.r = st->tmpbuf[ncfft-k].r; in kiss_fftr()
108 fpnk.i = - st->tmpbuf[ncfft-k].i; in kiss_fftr()
114 C_MUL( tw , f2k , st->super_twiddles[k-1]); in kiss_fftr()
116 freqdata[k].r = HALF_OF(f1k.r + tw.r); in kiss_fftr()
117 freqdata[k].i = HALF_OF(f1k.i + tw.i); in kiss_fftr()
118 freqdata[ncfft-k].r = HALF_OF(f1k.r - tw.r); in kiss_fftr()
119 freqdata[ncfft-k].i = HALF_OF(tw.i - f1k.i); in kiss_fftr()
[all …]
Dkissfft.hh125 for (int k=0;k<m;++k) { in kf_bfly2() local
126 cpx_type t = Fout[m+k] * _traits.twiddle(k*fstride); in kf_bfly2()
127 Fout[m+k] = Fout[k] - t; in kf_bfly2()
128 Fout[k] += t; in kf_bfly2()
136 for (size_t k=0;k<m;++k) { in kf_bfly4() local
137 scratch[0] = Fout[k+m] * _traits.twiddle(k*fstride); in kf_bfly4()
138 scratch[1] = Fout[k+2*m] * _traits.twiddle(k*fstride*2); in kf_bfly4()
139 scratch[2] = Fout[k+3*m] * _traits.twiddle(k*fstride*3); in kf_bfly4()
140 scratch[5] = Fout[k] - scratch[1]; in kf_bfly4()
142 Fout[k] += scratch[1]; in kf_bfly4()
[all …]
Dkiss_fft.c53 size_t k=m; in kf_bfly4() local
89 }while(--k); in kf_bfly4()
99 size_t k=m; in kf_bfly3() local
133 }while(--k); in kf_bfly3()
206 int u,k,q1,q; in kf_bfly_generic() local
214 k=u; in kf_bfly_generic()
216 scratch[q1] = Fout[ k ]; in kf_bfly_generic()
218 k += m; in kf_bfly_generic()
221 k=u; in kf_bfly_generic()
224 Fout[ k ] = scratch[0]; in kf_bfly_generic()
[all …]
/system/libhidl/transport/include/hidl/
DConcurrentMap.h33 void set(K &&k, V &&v) { in set() argument
35 mMap[std::forward<K>(k)] = std::forward<V>(v); in set()
39 const V &get(const K &k, const V &def) const { in get() argument
41 const_iterator iter = mMap.find(k); in get()
48 size_type erase(const K &k) { in erase() argument
50 return mMap.erase(k); in erase()
53 size_type eraseIfEqual(const K& k, const V& v) { in eraseIfEqual() argument
55 const_iterator iter = mMap.find(k); in eraseIfEqual()
69 void setLocked(K&& k, V&& v) { mMap[std::forward<K>(k)] = std::forward<V>(v); } in setLocked() argument
70 void setLocked(K&& k, const V& v) { mMap[std::forward<K>(k)] = v; } in setLocked() argument
[all …]
/system/bt/stack/smp/
Daes.cc386 static void copy_and_key(void* d, const void* s, const void* k) { in copy_and_key() argument
388 ((uint_32t*)d)[0] = ((uint_32t*)s)[0] ^ ((uint_32t*)k)[0]; in copy_and_key()
389 ((uint_32t*)d)[1] = ((uint_32t*)s)[1] ^ ((uint_32t*)k)[1]; in copy_and_key()
390 ((uint_32t*)d)[2] = ((uint_32t*)s)[2] ^ ((uint_32t*)k)[2]; in copy_and_key()
391 ((uint_32t*)d)[3] = ((uint_32t*)s)[3] ^ ((uint_32t*)k)[3]; in copy_and_key()
393 ((uint_8t*)d)[0] = ((uint_8t*)s)[0] ^ ((uint_8t*)k)[0]; in copy_and_key()
394 ((uint_8t*)d)[1] = ((uint_8t*)s)[1] ^ ((uint_8t*)k)[1]; in copy_and_key()
395 ((uint_8t*)d)[2] = ((uint_8t*)s)[2] ^ ((uint_8t*)k)[2]; in copy_and_key()
396 ((uint_8t*)d)[3] = ((uint_8t*)s)[3] ^ ((uint_8t*)k)[3]; in copy_and_key()
397 ((uint_8t*)d)[4] = ((uint_8t*)s)[4] ^ ((uint_8t*)k)[4]; in copy_and_key()
[all …]
Dp_256_ecc_pp.cc158 static void ECC_NAF(uint8_t* naf, uint32_t* NumNAF, uint32_t* k, in ECC_NAF() argument
165 while ((var = multiprecision_most_signbits(k, keyLength)) >= 1) { in ECC_NAF()
166 if (k[0] & 0x01) // k is odd in ECC_NAF()
168 sign = (k[0] & 0x03); // 1 or 3 in ECC_NAF()
172 k[0] = k[0] & 0xFFFFFFFE; in ECC_NAF()
174 k[0] = k[0] + 1; in ECC_NAF()
175 if (k[0] == 0) // overflow in ECC_NAF()
179 k[j]++; in ECC_NAF()
180 } while (k[j++] == 0); // overflow in ECC_NAF()
186 multiprecision_rshift(k, k, keyLength); in ECC_NAF()
/system/sepolicy/tools/sepolicy-analyze/
Ddups.c12 static int find_dups_helper(avtab_key_t * k, avtab_datum_t * d, in find_dups_helper() argument
24 if (!(k->specified & AVTAB_ALLOWED)) in find_dups_helper()
27 if (k->source_type == k->target_type) in find_dups_helper()
30 avkey.target_class = k->target_class; in find_dups_helper()
31 avkey.specified = k->specified; in find_dups_helper()
33 sattr = &policydb->type_attr_map[k->source_type - 1]; in find_dups_helper()
34 tattr = &policydb->type_attr_map[k->target_type - 1]; in find_dups_helper()
35 stype = policydb->type_val_to_struct[k->source_type - 1]; in find_dups_helper()
36 ttype = policydb->type_val_to_struct[k->target_type - 1]; in find_dups_helper()
46 if (avkey.source_type == k->source_type && in find_dups_helper()
[all …]
Dtypecmp.c10 static int insert_type_rule(avtab_key_t * k, avtab_datum_t * d, in insert_type_rule() argument
21 if (k->source_type < c->key.source_type) in insert_type_rule()
23 if (k->source_type == c->key.source_type && in insert_type_rule()
24 k->target_type < c->key.target_type) in insert_type_rule()
26 if (k->source_type == c->key.source_type && in insert_type_rule()
27 k->target_type == c->key.target_type && in insert_type_rule()
28 k->target_class <= c->key.target_class) in insert_type_rule()
33 k->source_type == c->key.source_type && in insert_type_rule()
34 k->target_type == c->key.target_type && in insert_type_rule()
35 k->target_class == c->key.target_class) { in insert_type_rule()
[all …]
Dbooleans.c7 static int list_booleans(hashtab_key_t k, in list_booleans() argument
11 const char *name = k; in list_booleans()
/system/extras/boottime_tools/bootanalyze/
Dbootanalyze.py125 for k, v in shutdown_events.iteritems():
126 events = shutdown_event_all.get(k)
129 shutdown_event_all[k] = events
132 for k, v in shutdown_timing_events.iteritems():
133 events = shutdown_timing_event_all.get(k)
136 shutdown_timing_event_all[k] = events
147 for k, v in processing_data.iteritems():
148 if k not in data_points:
149 data_points[k] = []
150 data_points[k].append(v['value'])
[all …]
/system/bt/embdrv/sbc/encoder/srce/
Dsbc_dct.c183 uint8_t Index, k; in SBC_FastIDCT8()
188 for (k = 0; k < 16; k++) { in SBC_FastIDCT8()
191 temp += (gas16AnalDCTcoeff8[(Index * 8 * 2) + k] * (pInVect[k] >> 16)); in SBC_FastIDCT8()
193 ((gas16AnalDCTcoeff8[(Index * 8 * 2) + k] * (pInVect[k] & 0xFFFF)) >> in SBC_FastIDCT8()
252 uint8_t Index, k; in SBC_FastIDCT4()
257 for (k = 0; k < 8; k++) { in SBC_FastIDCT4()
260 temp += (gas16AnalDCTcoeff4[(Index * 4 * 2) + k] * (pInVect[k] >> 16)); in SBC_FastIDCT4()
262 ((gas16AnalDCTcoeff4[(Index * 4 * 2) + k] * (pInVect[k] & 0xFFFF)) >> in SBC_FastIDCT4()
/system/bt/btif/src/
Dbtif_config_transcode.cc52 for (XMLElement* k = j->FirstChildElement(); k != NULL; in btif_config_transcode() local
53 k = k->NextSiblingElement()) { in btif_config_transcode()
54 const char* key = k->Attribute("Tag"); in btif_config_transcode()
55 const char* value = k->GetText(); in btif_config_transcode()
/system/tools/hidl/test/java_test/
Dhidl_test_java_native.cpp209 size_t k = 0; in TEST_F() local
213 for (size_t j = 0; j < 6; ++j, ++k) { in TEST_F()
214 in.addresses[i][j] = k; in TEST_F()
215 expectedOut.addresses[n - 1 - i][j] = k; in TEST_F()
232 size_t k = 0; in TEST_F() local
235 for (size_t j = 0; j < 6; ++j, ++k) { in TEST_F()
236 in[i][j] = k; in TEST_F()
237 expectedOut[n - 1 - i][j] = k; in TEST_F()
505 size_t k = 0; in TEST_F() local
507 for (size_t j = 0; j < 128; ++j, ++k) { in TEST_F()
[all …]
/system/keymaster/key_blob_utils/
Docb.c797 unsigned i, k, tz, remaining; in process_ad() local
853 k = 0; in process_ad()
865 k = 4; in process_ad()
870 ta[k] = xor_block(ad_offset, adp[k]); in process_ad()
871 ad_offset = xor_block(ad_offset, getL(ctx, ntz(k + 2))); in process_ad()
872 ta[k + 1] = xor_block(ad_offset, adp[k + 1]); in process_ad()
874 k += 2; in process_ad()
878 ta[k] = xor_block(ad_offset, adp[k]); in process_ad()
880 ++k; in process_ad()
885 memcpy(tmp.u8, adp + k, remaining); in process_ad()
[all …]
/system/core/libutils/tests/
DLruCache_test.cpp30 int k; member
32 explicit ComplexKey(int k) : k(k) { in ComplexKey()
36 ComplexKey(const ComplexKey& other) : k(other.k) { in ComplexKey()
45 return k == other.k; in operator ==()
49 return k != other.k; in operator !=()
100 return hash_type(value.k); in hash_type()
115 void operator()(SimpleKey& k, StringValue& v) { in operator ()() argument
117 lastKey = k; in operator ()()
127 void operator()(KeyWithPointer& k, StringValue&) { in operator ()() argument
128 delete k.ptr; in operator ()()
[all …]
/system/update_engine/sample_images/
Dgenerate_images.sh52 sudo dd of="${mntdir}"/regular-16k status=none
53 sudo dd if=/dev/zero of="${mntdir}"/regular-32k-zeros bs=1024 count=16 \
60 sudo truncate --size=10240 "${mntdir}"/sparse_empty-10k
65 sudo dd of="${mntdir}"/sparse-16k-last_block bs=1 \
75 sudo truncate --size=16384 "${mntdir}"/sparse-16k-first_block
76 echo "first block" | sudo dd of="${mntdir}"/sparse-16k-first_block status=none
78 sudo truncate --size=16384 "${mntdir}"/sparse-16k-holes
79 echo "a" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=100 status=none
80 echo "b" | sudo dd of="${mntdir}"/sparse-16k-holes bs=1 seek=10000 status=none
86 sudo ln "${mntdir}"/regular-16k "${mntdir}"/link-hard-regular-16k
/system/extras/tests/pagingtest/
Dthrashing_test.c18 unsigned long long k; in thrashing_test() local
62 for (k = 0; k < filesize; k += pagesize) { in thrashing_test()
63 bufs[j][k]; in thrashing_test()
/system/core/storaged/include/
Dstoraged_uid_monitor.h53 for (int k = 0; k < CHARGER_STATS; k++) { variable
54 bytes[i][j][k] += stats.bytes[i][j][k];
/system/bt/stack/rfcomm/
Drfc_port_if.cc130 uint8_t k; in RFCOMM_ParNegReq() local
151 k = (p_port->credit_rx_max < RFCOMM_K_MAX) ? p_port->credit_rx_max in RFCOMM_ParNegReq()
153 p_port->credit_rx = k; in RFCOMM_ParNegReq()
156 k = 0; in RFCOMM_ParNegReq()
162 rfc_send_pn(p_mcb, dlci, true, mtu, cl, k); in RFCOMM_ParNegReq()
176 uint8_t k) { in RFCOMM_ParNegRsp() argument
180 rfc_send_pn(p_mcb, dlci, false, mtu, cl, k); in RFCOMM_ParNegRsp()
/system/bt/profile/avrcp/tests/
Davrcp_test_helper.h95 ACTION_TEMPLATE(InvokeCb, HAS_1_TEMPLATE_PARAMS(int, k), in ACTION_TEMPLATE() argument
97 ::testing::get<k>(args).Run(input); in ACTION_TEMPLATE()
100 ACTION_TEMPLATE(InvokeCb, HAS_1_TEMPLATE_PARAMS(int, k), in ACTION_TEMPLATE() argument
102 ::testing::get<k>(args).Run(a, b); in ACTION_TEMPLATE()
105 ACTION_TEMPLATE(InvokeCb, HAS_1_TEMPLATE_PARAMS(int, k), in ACTION_TEMPLATE() argument
107 ::testing::get<k>(args).Run(a, b, c); in ACTION_TEMPLATE()
/system/core/libsysutils/src/
DFrameworkListener.cpp180 for (int k = 0; k < argc; k++) { in dispatchCommand()
181 SLOGD("arg[%d] = '%s'", k, argv[k]); in dispatchCommand()
/system/bt/bta/sys/
Dutl.cc114 uint16_t j, k; in utl_itoa() local
123 k = i / j; in utl_itoa()
125 if (k > 0 || fill) { in utl_itoa()
126 *p++ = k + '0'; in utl_itoa()

1234