Lines Matching refs:n
180 static uint32_t val_from_bn_n_salt(size_t bn, size_t n, uint8_t salt) in val_from_bn_n_salt() argument
183 assert(n < UINT8_MAX); in val_from_bn_n_salt()
184 return SHIFT_U32(n, 16) | SHIFT_U32(bn, 8) | salt; in val_from_bn_n_salt()
190 size_t n = 0; in write_block() local
192 for (n = 0; n < ARRAY_SIZE(b); n++) in write_block()
193 b[n] = val_from_bn_n_salt(bn, n, salt); in write_block()
202 size_t n = 0; in read_block() local
208 for (n = 0; n < ARRAY_SIZE(b); n++) { in read_block()
209 if (b[n] != val_from_bn_n_salt(bn, n, salt)) { in read_block()
212 n, b[n], val_from_bn_n_salt(bn, n, salt)); in read_block()
226 size_t n = 0; in do_range() local
228 for (n = 0; n < num_blocks; n++) { in do_range()
229 res = fn(ht, n + begin, salt); in do_range()
243 size_t n = 0; in do_range_backwards() local
245 for (n = 0; n < num_blocks; n++) { in do_range_backwards()
246 res = fn(ht, num_blocks - 1 - n + begin, salt); in do_range_backwards()
437 size_t n = 0; in test_write_read() local
451 for (n = 0; n < num_blocks; n += 3) { in test_write_read()
452 for (m = 0; m < n; m += 3) { in test_write_read()
453 for (o = 0; o < (n - m); o++) { in test_write_read()
454 res = htree_test_rewrite(aux, n, m, o); in test_write_read()
476 size_t n = 0; in test_corrupt_type() local
485 n = 0; in test_corrupt_type()
491 aux2.data[offs + n]++; in test_corrupt_type()
494 aux2.data[offs + n]++; in test_corrupt_type()
527 if (n == size0 - 1) in test_corrupt_type()
531 if (n) in test_corrupt_type()
532 n += n; in test_corrupt_type()
534 n = 1; in test_corrupt_type()
537 if (n >= size0) in test_corrupt_type()
538 n = size0 - 1; in test_corrupt_type()
563 size_t n = 0; in test_corrupt() local
593 for (n = 0; n < num_blocks; n++) { in test_corrupt()
595 TEE_FS_HTREE_TYPE_NODE, n); in test_corrupt()
598 for (n = 0; n < num_blocks; n++) { in test_corrupt()
600 TEE_FS_HTREE_TYPE_BLOCK, n); in test_corrupt()