Searched refs:levels (Results 1 – 4 of 4) sorted by relevance
| /system/core/liblog/tests/ |
| D | liblog_test.cpp | 703 } levels[] = { in TEST() local
729 for(size_t i = 0; i < (sizeof(levels) / sizeof(levels[0])); ++i) { in TEST()
730 if (levels[i].level == -2) { in TEST()
733 for(size_t j = 0; j < (sizeof(levels) / sizeof(levels[0])); ++j) { in TEST()
734 if (levels[j].level == -2) { in TEST()
738 if ((levels[i].level < levels[j].level) in TEST()
739 || (levels[j].level == -1)) { in TEST()
740 EXPECT_FALSE(__android_log_is_loggable(levels[i].level, tag, in TEST()
741 levels[j].level)); in TEST()
743 EXPECT_TRUE(__android_log_is_loggable(levels[i].level, tag, in TEST()
[all …]
|
| /system/extras/verity/ |
| D | build_verity_tree.cpp | 241 int levels = 0; in main() local
243 level_blocks = verity_tree_blocks(calculate_size, block_size, hash_size, levels); in main()
244 levels++; in main()
282 int levels = 0; in main() local
287 level_blocks = verity_tree_blocks(len, block_size, hash_size, levels); in main()
288 levels++; in main()
293 unsigned char **verity_tree_levels = new unsigned char *[levels + 1](); in main()
294 size_t *verity_tree_level_blocks = new size_t[levels](); in main()
300 for (int i = levels - 1; i >= 0; i--) { in main()
306 assert(verity_tree_level_blocks[levels - 1] == 1); in main()
[all …]
|
| /system/media/audio/include/system/ |
| D | sound_trigger.h | 184 struct sound_trigger_confidence_level levels[SOUND_TRIGGER_MAX_USERS]; member
|
| /system/bt/doc/ |
| D | power_management.md | 44 The tables that determine which power levels are acceptable for which profiles
|