Searched refs:levels (Results 1 - 4 of 4) sorted by relevance

/system/extras/verity/
H A Dbuild_verity_tree.cpp243 int levels = 0; local
245 level_blocks = verity_tree_blocks(calculate_size, block_size, hash_size, levels);
246 levels++;
284 int levels = 0; local
289 level_blocks = verity_tree_blocks(len, block_size, hash_size, levels);
290 levels++;
295 unsigned char **verity_tree_levels = new unsigned char *[levels + 1]();
296 size_t *verity_tree_level_blocks = new size_t[levels]();
302 for (int i = levels - 1; i >= 0; i--) {
308 assert(verity_tree_level_blocks[levels
[all...]
/system/core/liblog/tests/
H A Dliblog_test.cpp1237 } levels[] = { local
1263 for(size_t i = 0; i < (sizeof(levels) / sizeof(levels[0])); ++i) {
1264 if (levels[i].level == -2) {
1267 for(size_t j = 0; j < (sizeof(levels) / sizeof(levels[0])); ++j) {
1268 if (levels[j].level == -2) {
1273 levels[i].level, tag, levels[j].level);
1274 if ((levels[
[all...]
/system/extras/libfec/
H A Dfec_verity.cpp88 number of hash tree levels in `verity_levels,' and the number of hashes per
194 uint32_t levels = 0; local
196 /* calculate the size and the number of levels in the hash tree */
198 verity_get_size(v->data_blocks * FEC_BLOCKSIZE, &levels, NULL);
226 uint32_t hashes[levels];
231 for (uint32_t i = 1; i < levels; ++i) {
232 uint32_t blocks = hashes[levels - i];
233 debug("%u hash blocks on level %u", blocks, levels - i);
264 for (uint32_t i = 1; i < levels; ++i) {
265 uint32_t blocks = hashes[levels
[all...]
/system/media/audio/include/system/
H A Dsound_trigger.h194 unsigned int num_levels; /* number of user confidence levels */
195 struct sound_trigger_confidence_level levels[SOUND_TRIGGER_MAX_USERS]; member in struct:sound_trigger_phrase_recognition_extra

Completed in 172 milliseconds