/system/extras/verity/ |
build_verity_tree.cpp | 21 uint64_t hash_size; member in struct:sparse_hash_ctx 36 size_t verity_tree_blocks(uint64_t data_size, size_t block_size, size_t hash_size, 40 int hashes_per_block = div_round_up(block_size, hash_size); 101 memcpy(ctx->hashes, ctx->zero_block_hash, ctx->hash_size); 102 ctx->hashes += ctx->hash_size; 192 size_t hash_size = EVP_MD_size(md); local 193 assert(hash_size * 2 < block_size); 196 salt_size = hash_size; 223 level_blocks = verity_tree_blocks(calculate_size, block_size, hash_size, levels); 267 level_blocks = verity_tree_blocks(len, block_size, hash_size, levels) [all...] |
/external/oprofile/daemon/ |
opd_cookie.c | 97 #define HASH_SIZE 512 98 #define HASH_BITS (HASH_SIZE - 1) 100 static struct list_head hashes[HASH_SIZE]; 129 return (cookie >> DCOOKIE_SHIFT) & (HASH_SIZE - 1); 207 for (i = 0; i < HASH_SIZE; ++i)
|
opd_anon.c | 31 #define HASH_SIZE 1024 32 #define HASH_BITS (HASH_SIZE - 1) 43 static struct list_head hashes[HASH_SIZE]; 73 return ((app >> DCOOKIE_SHIFT) ^ (tgid >> 2)) & (HASH_SIZE - 1); 224 for (i = 0; i < HASH_SIZE; ++i)
|
opd_sfile.c | 29 #define HASH_SIZE 2048 30 #define HASH_BITS (HASH_SIZE - 1) 33 static struct list_head hashes[HASH_SIZE]; 641 for (; i < HASH_SIZE; ++i)
|
/external/chromium_org/crypto/ |
symmetric_key_win.cc | 138 DWORD hash_size = 0; local 141 hash_size = 20; 144 hash_size = 32; 147 hash_size = 48; 150 hash_size = 64; 153 if (hash_size == 0) 158 return (key_size_in_bits >= (hash_size / 2 * 8) && 239 DWORD hash_size, 271 std::vector<BYTE> hash_value(hash_size); 273 DWORD size = hash_size; [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
color_cache.c | 23 const int hash_size = 1 << hash_bits; local 26 cc->colors_ = (uint32_t*)WebPSafeCalloc((uint64_t)hash_size,
|
/external/webp/src/utils/ |
color_cache.c | 23 const int hash_size = 1 << hash_bits; local 26 cc->colors_ = (uint32_t*)WebPSafeCalloc((uint64_t)hash_size,
|
/external/fio/t/ |
genzipf.c | 36 static unsigned long hash_size = 1 << 24; variable 196 hash_size = nranges; 197 while ((hash_size >>= 1) != 0) 200 hash_size = 1 << hash_bits; 202 hash = malloc(hash_size * sizeof(struct flist_head)); 203 for (i = 0; i < hash_size; i++)
|
/external/wpa_supplicant_8/src/tls/ |
tlsv1_record.h | 41 size_t hash_size; member in struct:tlsv1_record_layer
|
tlsv1_record.c | 46 rl->hash_size = MD5_MAC_LEN; 49 rl->hash_size = SHA1_MAC_LEN; 52 rl->hash_size = SHA256_MAC_LEN; 208 rl->hash_size); 219 if (clen < rl->hash_size) { 427 if (plen < rl->hash_size) { 434 plen -= rl->hash_size; 437 rl->hash_size); 458 if (hlen != rl->hash_size ||
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
cso_cache.c | 170 int hash_size = cso_hash_size(hash); local 171 int max_entries = (max_size > hash_size) ? max_size : hash_size; 173 if (hash_size > max_size) 174 to_remove += hash_size - max_size;
|
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
cso_cache.c | 170 int hash_size = cso_hash_size(hash); local 171 int max_entries = (max_size > hash_size) ? max_size : hash_size; 173 if (hash_size > max_size) 174 to_remove += hash_size - max_size;
|
/external/e2fsprogs/e2fsck/ |
revoke.c | 94 int hash_size; member in struct:jbd_revoke_table_s 117 (block << (hash_shift - 12))) & (table->hash_size - 1); 200 int journal_init_revoke(journal_t *journal, int hash_size) 210 /* Check that the hash_size is a power of two */ 211 J_ASSERT ((hash_size & (hash_size-1)) == 0); 213 journal->j_revoke->hash_size = hash_size; 216 tmp = hash_size; 222 kmalloc(hash_size * sizeof(struct list_head), GFP_KERNEL) [all...] |
/external/chromium_org/third_party/mesa/src/src/glx/ |
glxhash.c | 84 #define HASH_SIZE 512 /* Good for about 100 entries */ 121 __glxHashBucketPtr buckets[HASH_SIZE]; 149 hash %= HASH_SIZE; 170 for (i = 0; i < HASH_SIZE; i++) 186 for (i = 0; i < HASH_SIZE; i++) { 297 while (table->p0 < HASH_SIZE) { 364 for (i = 0; i < HASH_SIZE; i++) {
|
/external/mesa3d/src/glx/ |
glxhash.c | 84 #define HASH_SIZE 512 /* Good for about 100 entries */ 121 __glxHashBucketPtr buckets[HASH_SIZE]; 149 hash %= HASH_SIZE; 170 for (i = 0; i < HASH_SIZE; i++) 186 for (i = 0; i < HASH_SIZE; i++) { 297 while (table->p0 < HASH_SIZE) { 364 for (i = 0; i < HASH_SIZE; i++) {
|
/hardware/intel/img/libdrm/libdrm/ |
xf86drmHash.c | 82 #define HASH_SIZE 512 /* Good for about 100 entries */ 116 HashBucketPtr buckets[HASH_SIZE]; 150 hash %= HASH_SIZE; 170 for (i = 0; i < HASH_SIZE; i++) table->buckets[i] = NULL; 183 for (i = 0; i < HASH_SIZE; i++) { 281 while (table->p0 < HASH_SIZE) { 337 for (i = 0; i < HASH_SIZE; i++) {
|
/external/dnsmasq/src/ |
cache.c | 26 static int bignames_left, hash_size; variable 108 /* hash_size is a power of two. */ 114 else if (new_size <= hash_size || !(new = whine_malloc(new_size * sizeof(struct crec *)))) 121 old_size = hash_size; 123 hash_size = new_size; 150 /* hash_size is a power of two */ 151 return hash_table + ((val ^ (val >> 16)) & (hash_size - 1)); 307 for (i = 0; i < hash_size; i++) 600 for (i=0; i<hash_size; i++) 673 for (i=0; i<hash_size; i++ [all...] |
/system/core/include/mincrypt/ |
hash-internal.h | 57 #define HASH_size(ctx) (ctx)->f->size
|
/external/e2fsprogs/lib/ext2fs/ |
tdb.h | 145 struct tdb_context *tdb_open(const char *name, int hash_size, int tdb_flags, 147 struct tdb_context *tdb_open_ex(const char *name, int hash_size, int tdb_flags,
|
tdb.c | 138 #define TDB_HASHTABLE_SIZE(tdb) ((tdb->header.hash_size+1)*sizeof(tdb_off_t)) 139 #define TDB_DATA_START(hash_size) TDB_HASH_TOP(hash_size-1) 160 #define BUCKET(hash) ((hash) % tdb->header.hash_size) 192 u32 hash_size; /* number of hash entries */ member in struct:tdb_header 419 if (list < -1 || list >= (int)tdb->header.hash_size) { 518 if (list < -1 || list >= (int)tdb->header.hash_size) { 519 TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: list %d invalid (%d)\n", list, tdb->header.hash_size)); 644 0, 4*tdb->header.hash_size)) { 682 0, 4*tdb->header.hash_size)) { [all...] |
/external/pixman/pixman/ |
pixman-glyph.c | 43 #define HASH_SIZE (2 * N_GLYPHS_HIGH_WATER) 44 #define HASH_MASK (HASH_SIZE - 1) 62 glyph_t * glyphs[HASH_SIZE]; 171 for (i = 0; i < HASH_SIZE; ++i) 268 if (cache->n_glyphs >= HASH_SIZE)
|
/external/e2fsprogs/intl/ |
loadmsgcat.c | 1044 domain->hash_size = W (domain->must_swap, data->hash_tab_size); 1046 (domain->hash_size > 2 1123 memneed = domain->hash_size * sizeof (nls_uint32); 1200 mem += domain->hash_size * sizeof (nls_uint32); [all...] |
/external/fio/ |
gettime.c | 40 #define HASH_SIZE (1 << HASH_BITS) 42 static struct flist_head hash[HASH_SIZE]; 100 for (i = 0; i < HASH_SIZE; i++) { 120 for (i = 0; i < HASH_SIZE; i++)
|
/external/chromium_org/third_party/libwebp/enc/ |
backward_references.h | 119 #define HASH_SIZE (1 << HASH_BITS) 124 int32_t hash_to_first_index_[HASH_SIZE];
|
/external/webp/src/enc/ |
backward_references.h | 119 #define HASH_SIZE (1 << HASH_BITS) 124 int32_t hash_to_first_index_[HASH_SIZE];
|