| /system/extras/tests/binder/benchmarks/ |
| H A D | binderAddInts.cpp | 223 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
224 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
225 stream << (char) str[n1];
236 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
237 if (CPU_ISSET(n1,
239 stream << n1; local
[all...] |
| /system/core/include/utils/ |
| H A D | Unicode.h | 41 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
44 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
|
| /system/core/libutils/include/utils/ |
| H A D | Unicode.h | 41 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
44 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
|
| /system/timezone/testing/data/ |
| H A D | transform-distro-files.sh | 35 TZHEADER=$(head -n1 ${INPUT_TZDATA_FILE} | cut -c1-11)
|
| /system/tools/hidl/docs/src/lexer/ |
| H A D | ILexer.kt | 63 val n1 = matchResult.groups[1]?.value
65 if (n1 != null && n2 != null) {
66 newStr = newStr.replace("${n1}\\s*\\.\\s*${n2}".toRegex(), "${n1}.${n2}")
|
| /system/core/libutils/ |
| H A D | Unicode.cpp | 324 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
326 const char16_t* e1 = s1+n1;
336 return n1 < n2
338 : (n1 > n2
343 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2)
345 const char16_t* e1 = s1H+n1;
357 return n1 < n2
359 : (n1 > n2
|
| /system/tools/hidl/scripts/ |
| H A D | run-tests.sh | 52 local testable=$(echo "${output}" | head -n1)
|
| /system/extras/simpleperf/ |
| H A D | callchain.h | 153 static bool CompareNodeByPeriod(const std::unique_ptr<NodeT>& n1, argument
155 uint64_t period1 = n1->period + n1->children_period;
|
| H A D | CallChainJoiner.cpp | 104 bool LRUCache::CacheNodeEqual(const CacheNode* n1, const CacheNode* n2) { argument
105 return n1->tid == n2->tid && n1->ip == n2->ip && n1->sp == n2->sp;
|
| H A D | CallChainJoiner.h | 89 static bool CacheNodeEqual(const CacheNode* n1, const CacheNode* n2);
|
| /system/bt/stack/smp/ |
| H A D | smp_int.h | 363 uint8_t* key_id, uint8_t* n1,
366 extern void smp_f5_calc_chk(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* a1,
368 extern void smp_f6_calc_chk(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* r,
522 extern bool smp_calculate_f5(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* a1,
525 uint8_t* t, uint8_t* counter, uint8_t* key_id, uint8_t* n1, uint8_t* n2,
528 extern bool smp_calculate_f6(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* r,
|
| H A D | smp_keys.cc | 1240 bool smp_calculate_f5(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* a1, argument
1268 p_prnt = n1;
1287 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_mac_key, key_id, n1,
1297 if (!smp_calculate_f5_mackey_or_long_term_key(t, counter_ltk, key_id, n1, n2,
1343 uint8_t* key_id, uint8_t* n1,
1368 p_prnt = n1;
1391 ARRAY_TO_STREAM(p, n1, BT_OCTET16_LEN);
1583 bool smp_calculate_f6(uint8_t* w, uint8_t* n1, uint8_t* n2, uint8_t* r, argument
1599 p_print = n1;
1629 ARRAY_TO_STREAM(p, n1, BT_OCTET16_LE
1342 smp_calculate_f5_mackey_or_long_term_key(uint8_t* t, uint8_t* counter, uint8_t* key_id, uint8_t* n1, uint8_t* n2, uint8_t* a1, uint8_t* a2, uint8_t* length, uint8_t* mac) argument
[all...] |
| H A D | aes.cc | 259 uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; local
264 if (n1)
265 while (n2 >= n1) /* divide polynomial p2 by p1 */
267 n2 /= n1; /* shift smaller polynomial left */
276 while (n1 >= n2) {
277 n1 /= n2;
278 p1 ^= p2 * n1;
279 v1 ^= v2 * n1;
280 n1 = hibit(p1);
|
| /system/extras/ioblame/ |
| H A D | ioblame.sh | 353 i_size=`tail -n1 subtrace | awk '{ if ($12 > 1024) printf "%d KB", ($12/1024); else printf "%d bytes", $12; }' `
411 i_size=`fgrep -w "$j" subtrace | tail -n1 | awk '{ if ($12 > 1024) printf "%d KB", ($12/1024); else printf "%d bytes", $12; }' `
|
| /system/core/fs_mgr/ |
| H A D | fs_mgr.cpp | 533 char *n1; local
537 n1 = strdup(in1);
540 remove_trailing_slashes(n1);
543 ret = !strcmp(n1, n2);
545 free(n1);
|