Home
last modified time | relevance | path

Searched refs:h (Results 1 – 7 of 7) sorted by relevance

/fs/zfs/
A Dzfs_sha256.c78 uint32_t a, b, c, d, e, f, g, h, t, T1, T2, W[64]; in SHA256Transform() local
88 e = H[4]; f = H[5]; g = H[6]; h = H[7]; in SHA256Transform()
91 T1 = h + SIGMA1(e) + Ch(e, f, g) + SHA256_K[t] + W[t]; in SHA256Transform()
93 h = g; g = f; f = e; e = d + T1; in SHA256Transform()
98 H[4] += e; H[5] += f; H[6] += g; H[7] += h; in SHA256Transform()
A Dzfs.c98 #define LEAF_HASH(bs, h) \ argument
100 ((h) >> (64 - ZAP_LEAF_HASH_SHIFT(bs)-l->l_hdr.lh_prefix_len)))
811 int blksft, uint64_t h, in zap_leaf_lookup() argument
827 for (chunk = zfs_to_cpu16(l->l_hash[LEAF_HASH(blksft, h)], endian); in zap_leaf_lookup()
843 if (zfs_to_cpu64(le->le_hash, endian) != h) in zap_leaf_lookup()
/fs/ubifs/
A Dlpt.c1461 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup()
1597 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1963 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1992 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1996 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2006 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2009 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2023 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2061 h -= 1; in ubifs_lpt_scan_nolock()
2071 h += 1; in ubifs_lpt_scan_nolock()
[all …]
A Dlog.c97 long long h, t; in empty_log_bytes() local
99 h = (long long)c->lhead_lnum * c->leb_size + c->lhead_offs; in empty_log_bytes()
102 if (h > t) in empty_log_bytes()
103 return c->log_bytes - h + t; in empty_log_bytes()
104 else if (h != t) in empty_log_bytes()
105 return t - h; in empty_log_bytes()
A Dlpt_commit.c632 int err, h, iip, shft; in pnode_lookup() local
643 for (h = 1; h < c->lpt_hght; h++) { in pnode_lookup()
1387 int h, i, found; in first_nnode() local
1393 for (h = 1; h < c->lpt_hght; h++) { in first_nnode()
1399 *hght = h; in first_nnode()
1422 int iip, h, i, found; in next_nnode() local
1440 for (h = *hght + 1; h < c->lpt_hght; h++) { in next_nnode()
1446 *hght = h; in next_nnode()
/fs/erofs/
A Dzmap.c27 struct z_erofs_map_header *h; in z_erofs_fill_inode_lazy() local
38 h = (struct z_erofs_map_header *)buf; in z_erofs_fill_inode_lazy()
43 if (h->h_clusterbits >> Z_EROFS_FRAGMENT_INODE_BIT) { in z_erofs_fill_inode_lazy()
45 vi->fragmentoff = le64_to_cpu(*(__le64 *)h) ^ (1ULL << 63); in z_erofs_fill_inode_lazy()
50 vi->z_advise = le16_to_cpu(h->h_advise); in z_erofs_fill_inode_lazy()
51 vi->z_algorithmtype[0] = h->h_algorithmtype & 15; in z_erofs_fill_inode_lazy()
52 vi->z_algorithmtype[1] = h->h_algorithmtype >> 4; in z_erofs_fill_inode_lazy()
60 vi->z_logical_clusterbits = sbi.blkszbits + (h->h_clusterbits & 7); in z_erofs_fill_inode_lazy()
72 vi->idata_size = le16_to_cpu(h->h_idata_size); in z_erofs_fill_inode_lazy()
85 !(h->h_clusterbits >> Z_EROFS_FRAGMENT_INODE_BIT)) { in z_erofs_fill_inode_lazy()
[all …]
/fs/btrfs/
A Dctree.h180 const struct btrfs_header *h = (struct btrfs_header *)eb->data; \
181 return le##bits##_to_cpu(h->member); \
186 struct btrfs_header *h = (struct btrfs_header *)eb->data; \
187 h->member = cpu_to_le##bits(val); \
691 struct btrfs_free_space_header *h, in btrfs_free_space_key() argument
694 read_eb_member(eb, h, struct btrfs_free_space_header, location, key); in btrfs_free_space_key()
698 struct btrfs_free_space_header *h, in btrfs_set_free_space_key() argument
701 write_eb_member(eb, h, struct btrfs_free_space_header, location, key); in btrfs_set_free_space_key()

Completed in 22 milliseconds