4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, 2015, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
33 * implementation of iam format for fixed size records, variable sized keys.
35 * Author: Nikita Danilov <nikita@clusterfs.com>
38 #include <linux/types.h>
39 #include "osd_internal.h"
46 /* This is duplicated in lustre/utils/create_iam.c */
47 IAM_LVAR_LEAF_MAGIC = 0x1973
50 /* This is duplicated in lustre/utils/create_iam.c */
51 struct lvar_leaf_header {
52 __le16 vlh_magic; /* magic number IAM_LVAR_LEAF_MAGIC */
53 __le16 vlh_used; /* used bytes, including header */
57 * Format of leaf entry:
63 * Entries are ordered in key order.
66 /* This is duplicated in lustre/utils/create_iam.c */
67 typedef u32 lvar_hash_t;
69 /* This is duplicated in lustre/utils/create_iam.c */
70 struct lvar_leaf_entry {
76 #define PDIFF(ptr0, ptr1) (((char *)(ptr0)) - ((char *)(ptr1)))
79 static inline int blocksize(const struct iam_leaf *leaf)
81 return iam_leaf_container(leaf)->ic_object->i_sb->s_blocksize;
84 static inline const char *kchar(const struct iam_key *key)
89 static inline struct iam_lentry *lvar_lentry(const struct lvar_leaf_entry *ent)
91 return (struct iam_lentry *)ent;
94 static inline struct lvar_leaf_entry *lentry_lvar(const struct iam_lentry *lent)
96 return (struct lvar_leaf_entry *)lent;
100 static inline int e_keysize(const struct lvar_leaf_entry *ent)
102 return le16_to_cpu(ent->vle_keysize);
105 /* This is duplicated in lustre/utils/create_iam.c */
108 LVAR_ROUND = LVAR_PAD - 1
111 static inline int getsize(const struct iam_leaf *leaf, int namelen, int recsize)
113 BUILD_BUG_ON((LVAR_PAD & (LVAR_PAD - 1)));
115 return (offsetof(struct lvar_leaf_entry, vle_key) +
116 namelen + recsize + LVAR_ROUND) & ~LVAR_ROUND;
119 static inline int rec_size(const struct iam_rec *rec)
121 return *(const char *)rec;
124 static inline struct iam_rec *e_rec(const struct lvar_leaf_entry *ent)
126 return ((void *)ent) +
127 offsetof(struct lvar_leaf_entry, vle_key) + e_keysize(ent);
130 static inline int e_size(const struct iam_leaf *leaf,
131 const struct lvar_leaf_entry *ent)
133 return getsize(leaf, e_keysize(ent), rec_size(e_rec(ent)));
136 static inline char *e_char(const struct lvar_leaf_entry *ent)
138 return (char *)&ent->vle_key;
141 static inline struct iam_key *e_key(const struct lvar_leaf_entry *ent)
143 return (struct iam_key *)e_char(ent);
146 static inline lvar_hash_t e_hash(const struct lvar_leaf_entry *ent)
148 return le32_to_cpu(ent->vle_hash);
151 static void e_print(const struct lvar_leaf_entry *ent)
153 CERROR(" %p %8.8x \"%*.*s\"\n", ent, e_hash(ent),
154 e_keysize(ent), e_keysize(ent), e_char(ent));
157 static inline struct lvar_leaf_entry *e_next(const struct iam_leaf *leaf,
158 const struct lvar_leaf_entry *ent)
160 return ((void *)ent) + e_size(leaf, ent);
163 #define LVAR_HASH_SANDWICH (0)
164 #define LVAR_HASH_TEA (1)
165 #define LVAR_HASH_R5 (0)
166 #define LVAR_HASH_PREFIX (0)
168 #ifdef HAVE_LDISKFSFS_DIRHASH_WITH_DIR
169 #define e_ldiskfsfs_dirhash(dir, name, len, info) \
170 ldiskfsfs_dirhash((dir), (name), (len), (info))
172 #define e_ldiskfsfs_dirhash(dir, name, len, info) \
173 ldiskfsfs_dirhash((name), (len), (info))
176 static u32 hash_build0(const struct inode *dir, const char *name, int namelen)
182 if (strncmp(name, ".", 1) == 0 && namelen == 1)
184 if (strncmp(name, "..", 2) == 0 && namelen == 2)
187 if (LVAR_HASH_PREFIX) {
189 strncpy((void *)&result,
190 name, min_t(int, namelen, sizeof(result)));
192 struct ldiskfs_dx_hash_info hinfo;
194 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
196 e_ldiskfsfs_dirhash(dir, name, namelen, &hinfo);
198 if (LVAR_HASH_SANDWICH) {
201 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
203 e_ldiskfsfs_dirhash(dir, name, namelen, &hinfo);
204 result2 = hinfo.hash;
205 result = (0xfc000000 & result2) | (0x03ffffff & result);
212 HASH_GRAY_AREA = 1024,
213 HASH_MAX_SIZE = 0x7fffffffUL
216 static u32 hash_build(const struct inode *dir, const char *name, int namelen)
220 hash = (hash_build0(dir, name, namelen) << 1) & HASH_MAX_SIZE;
221 if (hash > HASH_MAX_SIZE - HASH_GRAY_AREA)
222 hash &= HASH_GRAY_AREA - 1;
226 static inline lvar_hash_t get_hash(const struct inode *dir,
227 const char *name, int namelen)
229 return hash_build(dir, name, namelen);
232 static inline lvar_hash_t iam_get_hash(const struct iam_leaf *leaf,
233 const char *name, int namelen)
235 struct iam_path *iam_path = iam_leaf_path(leaf);
237 return get_hash(iam_path_obj(iam_path), name, namelen);
240 static inline int e_eq(const struct lvar_leaf_entry *ent,
241 const char *name, int namelen)
243 return namelen == e_keysize(ent) && !memcmp(e_char(ent), name, namelen);
246 static inline int e_cmp(const struct iam_leaf *leaf,
247 const struct lvar_leaf_entry *ent, lvar_hash_t hash)
252 return ehash == hash ? 0 : (ehash < hash ? -1 : 1);
255 static struct lvar_leaf_header *n_head(const struct iam_leaf *l)
257 return (struct lvar_leaf_header *)l->il_bh->b_data;
260 static int h_used(const struct lvar_leaf_header *hdr)
262 return le16_to_cpu(hdr->vlh_used);
265 static void h_used_adj(const struct iam_leaf *leaf,
266 struct lvar_leaf_header *hdr, int adj)
270 used = h_used(hdr) + adj;
271 assert_corr(sizeof(*hdr) <= used && used <= blocksize(leaf));
272 hdr->vlh_used = cpu_to_le16(used);
275 static struct lvar_leaf_entry *n_start(const struct iam_leaf *leaf)
277 return (void *)leaf->il_bh->b_data + sizeof(struct lvar_leaf_header);
280 static struct lvar_leaf_entry *n_end(const struct iam_leaf *l)
282 return (void *)l->il_bh->b_data + h_used(n_head(l));
285 static struct lvar_leaf_entry *n_cur(const struct iam_leaf *l)
287 return lentry_lvar(l->il_at);
290 void n_print(const struct iam_leaf *l)
292 struct lvar_leaf_entry *scan;
294 CERROR("used: %d\n", h_used(n_head(l)));
295 for (scan = n_start(l); scan < n_end(l); scan = e_next(l, scan))
299 #if LDISKFS_CORRECTNESS_ON
300 static int n_at_rec(const struct iam_leaf *folio)
302 return n_start(folio) <= lentry_lvar(folio->il_at) &&
303 lentry_lvar(folio->il_at) < n_end(folio);
306 #if LDISKFS_INVARIANT_ON
307 static int n_invariant(const struct iam_leaf *leaf)
309 struct iam_path *path;
311 struct lvar_leaf_entry *scan;
312 struct lvar_leaf_entry *end;
314 lvar_hash_t nexthash;
315 lvar_hash_t starthash;
319 path = leaf->il_path;
321 if (h_used(n_head(leaf)) > blocksize(leaf))
324 dir = iam_path_obj(iam_path);
326 * Delimiting key in the parent index node. Clear least bit to account
327 * for hash collision marker.
329 starthash = *(lvar_hash_t *)iam_ikey_at(path, path->ip_frame->at) & ~1;
330 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
331 nexthash = e_hash(scan);
332 if (nexthash != get_hash(dir, e_char(scan), e_keysize(scan))) {
336 if (0 && nexthash < starthash) {
338 * Unfortunately this useful invariant cannot be
339 * reliably checked as parent node is not necessarily
343 CERROR("invalid hash value less than start hash: %#x < %#x\n",
344 nexthash, starthash);
348 if (nexthash < hash) {
360 /* LDISKFS_INVARIANT_ON */
363 /* LDISKFS_CORRECTNESS_ON */
366 static struct iam_ikey *lvar_ikey(const struct iam_leaf *l,
367 struct iam_ikey *key)
371 assert_corr(n_at_rec(l));
374 *hash = e_hash(n_cur(l));
378 static struct iam_key *lvar_key(const struct iam_leaf *l)
380 return e_key(n_cur(l));
383 static int lvar_key_size(const struct iam_leaf *l)
385 return e_keysize(n_cur(l));
388 static void lvar_start(struct iam_leaf *l)
390 l->il_at = lvar_lentry(n_start(l));
393 static int lvar_init(struct iam_leaf *l)
397 struct lvar_leaf_header *head;
399 assert_corr(l->il_bh != NULL);
403 if (le16_to_cpu(head->vlh_magic) == IAM_LVAR_LEAF_MAGIC &&
404 used <= blocksize(l)) {
405 l->il_at = l->il_entries = lvar_lentry(n_start(l));
410 obj = iam_leaf_container(l)->ic_object;
412 "Bad magic in node %llu (#%lu): %#x != %#x or wrong used: %d\n",
413 (unsigned long long)l->il_bh->b_blocknr, obj->i_ino,
414 le16_to_cpu(head->vlh_magic), IAM_LVAR_LEAF_MAGIC,
421 static void lvar_fini(struct iam_leaf *l)
423 l->il_entries = l->il_at = NULL;
426 static struct iam_rec *lvar_rec(const struct iam_leaf *l)
428 assert_corr(n_at_rec(l));
429 return e_rec(n_cur(l));
432 static void lvar_next(struct iam_leaf *l)
434 assert_corr(n_at_rec(l));
435 assert_corr(iam_leaf_is_locked(l));
436 l->il_at = lvar_lentry(e_next(l, n_cur(l)));
439 static int lvar_lookup(struct iam_leaf *leaf, const struct iam_key *k)
441 struct lvar_leaf_entry *found;
442 struct lvar_leaf_entry *scan;
443 struct lvar_leaf_entry *end;
451 assert_inv(n_invariant(leaf));
455 namelen = strlen(name);
456 hash = iam_get_hash(leaf, name, namelen);
461 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
462 lvar_hash_t scan_hash;
464 scan_hash = e_hash(scan);
465 if (scan_hash < hash)
467 else if (scan_hash == hash) {
468 if (e_eq(scan, name, namelen)) {
472 leaf->il_at = lvar_lentry(scan);
473 return IAM_LOOKUP_EXACT;
474 } else if (!found_equal) {
485 * @k is less than all hashes in the leaf.
488 result = IAM_LOOKUP_BEFORE;
490 leaf->il_at = lvar_lentry(found);
491 result = IAM_LOOKUP_OK;
492 assert_corr(n_at_rec(leaf));
495 result |= IAM_LOOKUP_LAST;
496 assert_inv(n_invariant(leaf));
501 static int lvar_ilookup(struct iam_leaf *leaf, const struct iam_ikey *ik)
503 struct lvar_leaf_entry *scan;
504 struct lvar_leaf_entry *end;
507 assert_inv(n_invariant(leaf));
509 hash = *(const lvar_hash_t *)ik;
512 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
513 lvar_hash_t scan_hash;
515 scan_hash = e_hash(scan);
516 if (scan_hash > hash)
517 return scan == n_start(leaf) ?
518 IAM_LOOKUP_BEFORE : IAM_LOOKUP_OK;
519 leaf->il_at = lvar_lentry(scan);
520 if (scan_hash == hash)
521 return IAM_LOOKUP_EXACT;
523 assert_inv(n_invariant(leaf));
525 * @ik is greater than any key in the node. Return last record in the
528 return IAM_LOOKUP_OK;
531 static void __lvar_key_set(struct iam_leaf *l, const struct iam_key *k)
533 memcpy(e_key(n_cur(l)), k, e_keysize(n_cur(l)));
536 static void lvar_key_set(struct iam_leaf *l, const struct iam_key *k)
538 assert_corr(n_at_rec(l));
539 assert_corr(strlen(kchar(k)) == e_keysize(n_cur(l)));
540 assert_corr(iam_leaf_is_locked(l));
541 __lvar_key_set(l, k);
542 assert_inv(n_invariant(l));
545 static int lvar_key_cmp(const struct iam_leaf *l, const struct iam_key *k)
552 hash = iam_get_hash(l, name, strlen(name));
553 return e_cmp(l, n_cur(l), hash);
556 static int lvar_key_eq(const struct iam_leaf *l, const struct iam_key *k)
561 return e_eq(n_cur(l), name, strlen(name));
564 static void __lvar_rec_set(struct iam_leaf *l, const struct iam_rec *r)
566 memcpy(e_rec(n_cur(l)), r, rec_size(r));
569 static void lvar_rec_set(struct iam_leaf *l, const struct iam_rec *r)
571 assert_corr(n_at_rec(l));
572 assert_corr(iam_leaf_is_locked(l));
573 __lvar_rec_set(l, r);
574 assert_inv(n_invariant(l));
577 static int lvar_rec_eq(const struct iam_leaf *l, const struct iam_rec *r)
579 struct iam_rec *rec = e_rec(n_cur(l));
581 if (rec_size(rec) != rec_size(r))
583 return !memcmp(rec, r, rec_size(r));
586 static void lvar_rec_get(const struct iam_leaf *l, struct iam_rec *r)
590 rec = e_rec(n_cur(l));
591 assert_corr(n_at_rec(l));
592 assert_corr(iam_leaf_is_locked(l));
593 memcpy(r, rec, rec_size(rec));
594 assert_inv(n_invariant(l));
597 static int lvar_can_add(const struct iam_leaf *l,
598 const struct iam_key *k, const struct iam_rec *r)
600 assert_corr(iam_leaf_is_locked(l));
601 return h_used(n_head(l)) +
602 getsize(l, strlen(kchar(k)), rec_size(r)) <= blocksize(l);
605 static int lvar_at_end(const struct iam_leaf *folio)
607 assert_corr(iam_leaf_is_locked(folio));
608 return n_cur(folio) == n_end(folio);
611 static void lvar_rec_add(struct iam_leaf *leaf,
612 const struct iam_key *k, const struct iam_rec *r)
621 assert_corr(lvar_can_add(leaf, k, r));
622 assert_inv(n_invariant(leaf));
623 assert_corr(iam_leaf_is_locked(leaf));
627 shift = getsize(leaf, ksize, rec_size(r));
629 if (!lvar_at_end(leaf)) {
630 assert_corr(n_cur(leaf) < n_end(leaf));
632 if (lvar_key_cmp(leaf, k) <= 0)
636 * Another exceptional case: insertion with the key
637 * less than least key in the leaf.
639 assert_corr(leaf->il_at == leaf->il_entries);
642 diff = PDIFF(end, start);
643 assert_corr(diff >= 0);
644 memmove(start + shift, start, diff);
646 h_used_adj(leaf, n_head(leaf), shift);
647 n_cur(leaf)->vle_keysize = cpu_to_le16(ksize);
648 n_cur(leaf)->vle_hash = cpu_to_le32(iam_get_hash(leaf, key, ksize));
649 __lvar_key_set(leaf, k);
650 __lvar_rec_set(leaf, r);
651 assert_corr(n_at_rec(leaf));
652 assert_inv(n_invariant(leaf));
655 static void lvar_rec_del(struct iam_leaf *leaf, int shift)
661 assert_corr(n_at_rec(leaf));
662 assert_inv(n_invariant(leaf));
663 assert_corr(iam_leaf_is_locked(leaf));
666 next = e_next(leaf, n_cur(leaf));
667 nob = e_size(leaf, n_cur(leaf));
668 memmove(leaf->il_at, next, end - next);
669 h_used_adj(leaf, n_head(leaf), -nob);
670 assert_inv(n_invariant(leaf));
673 static void lvar_init_new(struct iam_container *c, struct buffer_head *bh)
675 struct lvar_leaf_header *hdr;
677 hdr = (struct lvar_leaf_header *)bh->b_data;
678 hdr->vlh_magic = cpu_to_le16(IAM_LVAR_LEAF_MAGIC);
679 hdr->vlh_used = sizeof(*hdr);
682 static struct lvar_leaf_entry *find_pivot(const struct iam_leaf *leaf,
683 struct lvar_leaf_entry **prev)
690 threshold = blocksize(leaf) / 2;
691 for (scan = start = n_start(leaf); scan - start <= threshold;
692 *prev = scan, scan = e_next(leaf, scan)) {
698 static void lvar_split(struct iam_leaf *leaf, struct buffer_head **bh,
701 struct lvar_leaf_entry *first_to_move;
702 struct lvar_leaf_entry *last_to_stay;
703 struct iam_path *path;
704 struct lvar_leaf_header *hdr;
705 struct buffer_head *new_leaf;
709 assert_inv(n_invariant(leaf));
710 assert_corr(iam_leaf_is_locked(leaf));
713 path = iam_leaf_path(leaf);
715 hdr = (void *)new_leaf->b_data;
717 first_to_move = find_pivot(leaf, &last_to_stay);
718 assert_corr(last_to_stay != NULL);
719 assert_corr(e_next(leaf, last_to_stay) == first_to_move);
721 hash = e_hash(first_to_move);
722 if (hash == e_hash(last_to_stay))
728 tomove = PDIFF(n_end(leaf), first_to_move);
729 memmove(hdr + 1, first_to_move, tomove);
731 h_used_adj(leaf, hdr, tomove);
732 h_used_adj(leaf, n_head(leaf), -tomove);
734 assert_corr(n_end(leaf) == first_to_move);
736 if (n_cur(leaf) >= first_to_move) {
738 * insertion point moves into new leaf.
742 shift = PDIFF(leaf->il_at, first_to_move);
744 leaf->il_bh = new_leaf;
745 leaf->il_curidx = new_blknr;
747 assert_corr(iam_leaf_is_locked(leaf));
750 * init cannot fail, as node was just initialized.
752 assert_corr(result == 0);
753 leaf->il_at = ((void *)leaf->il_at) + shift;
756 * Insert pointer to the new node (together with the least key in
757 * the node) into index node.
759 iam_insert_key_lock(path, path->ip_frame, (struct iam_ikey *)&hash,
761 assert_corr(n_cur(leaf) < n_end(leaf));
762 assert_inv(n_invariant(leaf));
765 static int lvar_leaf_empty(struct iam_leaf *leaf)
767 return h_used(n_head(leaf)) == sizeof(struct lvar_leaf_header);
770 static const struct iam_leaf_operations lvar_leaf_ops = {
772 .init_new = lvar_init_new,
779 .key_set = lvar_key_set,
780 .key_cmp = lvar_key_cmp,
781 .key_eq = lvar_key_eq,
782 .key_size = lvar_key_size,
783 .rec_set = lvar_rec_set,
784 .rec_eq = lvar_rec_eq,
785 .rec_get = lvar_rec_get,
786 .lookup = lvar_lookup,
787 .ilookup = lvar_ilookup,
788 .at_end = lvar_at_end,
789 .rec_add = lvar_rec_add,
790 .rec_del = lvar_rec_del,
791 .can_add = lvar_can_add,
793 .leaf_empty = lvar_leaf_empty,
801 /* This is duplicated in lustre/utils/create_iam.c */
802 /* egrep -i '^o?x?[olabcdef]*$' /usr/share/dict/words */
803 IAM_LVAR_ROOT_MAGIC = 0xb01dface
806 /* This is duplicated in lustre/utils/create_iam.c */
811 u8 vr_indirect_levels;
816 static u32 lvar_root_ptr(struct iam_container *c)
821 static int lvar_node_init(struct iam_container *c, struct buffer_head *bh,
827 static struct iam_entry *lvar_root_inc(struct iam_container *c,
828 struct iam_path *path,
829 struct iam_frame *frame)
831 struct lvar_root *root;
832 struct iam_entry *entries;
834 assert_corr(iam_frame_is_locked(path, frame));
835 entries = frame->entries;
837 dx_set_count(entries, 2);
838 assert_corr(dx_get_limit(entries) == dx_root_limit(path));
840 root = (void *)frame->bh->b_data;
841 assert_corr(le64_to_cpu(root->vr_magic) == IAM_LVAR_ROOT_MAGIC);
842 root->vr_indirect_levels++;
843 frame->at = entries = iam_entry_shift(path, entries, 1);
844 memset(iam_ikey_at(path, entries), 0,
845 iam_path_descr(path)->id_ikey_size);
849 static int lvar_node_check(struct iam_path *path, struct iam_frame *frame)
853 unsigned int limit_correct;
854 struct iam_entry *entries;
856 entries = dx_node_get_entries(path, frame);
858 if (frame == path->ip_frames) {
859 struct lvar_root *root;
861 root = (void *)frame->bh->b_data;
862 if (le32_to_cpu(root->vr_magic) != IAM_LVAR_ROOT_MAGIC)
864 limit_correct = dx_root_limit(path);
866 limit_correct = dx_node_limit(path);
867 count = dx_get_count(entries);
868 limit = dx_get_limit(entries);
871 if (limit != limit_correct)
876 static int lvar_node_load(struct iam_path *path, struct iam_frame *frame)
878 struct iam_entry *entries;
881 entries = dx_node_get_entries(path, frame);
882 data = frame->bh->b_data;
884 if (frame == path->ip_frames) {
885 struct lvar_root *root;
889 name = kchar(path->ip_key_target);
890 path->ip_indirect = root->vr_indirect_levels;
891 if (path->ip_ikey_target == NULL) {
892 path->ip_ikey_target = iam_path_ikey(path, 4);
893 *(lvar_hash_t *)path->ip_ikey_target =
894 get_hash(iam_path_obj(path), name,
898 frame->entries = frame->at = entries;
902 static int lvar_ikeycmp(const struct iam_container *c,
903 const struct iam_ikey *k1, const struct iam_ikey *k2)
905 lvar_hash_t p1 = le32_to_cpu(*(lvar_hash_t *)k1);
906 lvar_hash_t p2 = le32_to_cpu(*(lvar_hash_t *)k2);
908 return p1 > p2 ? 1 : (p1 < p2 ? -1 : 0);
911 static struct iam_path_descr *lvar_ipd_alloc(const struct iam_container *c,
914 return iam_ipd_alloc(area, c->ic_descr->id_ikey_size);
917 static void lvar_root(void *buf,
918 int blocksize, int keysize, int ptrsize, int recsize)
920 struct lvar_root *root;
921 struct dx_countlimit *limit;
925 isize = sizeof(lvar_hash_t) + ptrsize;
927 *root = (typeof(*root)) {
928 .vr_magic = cpu_to_le32(IAM_LVAR_ROOT_MAGIC),
929 .vr_recsize = cpu_to_le16(recsize),
930 .vr_ptrsize = cpu_to_le16(ptrsize),
931 .vr_indirect_levels = 0
934 limit = (void *)(root + 1);
935 *limit = (typeof(*limit)){
937 * limit itself + one pointer to the leaf.
939 .count = cpu_to_le16(2),
940 .limit = iam_root_limit(sizeof(struct lvar_root), blocksize,
941 sizeof(lvar_hash_t) + ptrsize)
944 /* To guarantee that the padding "keysize + ptrsize"
945 * covers the "dx_countlimit" and the "idle_blocks". */
946 LASSERT((keysize + ptrsize) >=
947 (sizeof(struct dx_countlimit) + sizeof(u32)));
949 entry = (void *)(limit + 1);
950 /* Put "idle_blocks" just after the limit. There was padding after
951 * the limit, the "idle_blocks" re-uses part of the padding, so no
952 * compatibility issues with old layout.
959 entry = (void *)(root + 1) + isize;
962 * Entry format is <key> followed by <ptr>. In the minimal tree
963 * consisting of a root and single node, <key> is a minimal possible
966 *(lvar_hash_t *)entry = 0;
967 entry += sizeof(lvar_hash_t);
968 /* now @entry points to <ptr> */
970 *(u_int32_t *)entry = cpu_to_le32(1);
972 *(u_int64_t *)entry = cpu_to_le64(1);
975 static int lvar_esize(int namelen, int recsize)
977 return (offsetof(struct lvar_leaf_entry, vle_key) +
978 namelen + recsize + LVAR_ROUND) & ~LVAR_ROUND;
981 static void lvar_leaf(void *buf,
982 int blocksize, int keysize, int ptrsize, int recsize)
984 struct lvar_leaf_header *head;
985 struct lvar_leaf_entry *entry;
989 *head = (typeof(*head)) {
990 .vlh_magic = cpu_to_le16(IAM_LVAR_LEAF_MAGIC),
991 .vlh_used = cpu_to_le16(sizeof(*head) + lvar_esize(0, recsize))
993 entry = (void *)(head + 1);
994 *entry = (typeof(*entry)) {
998 memset(e_rec(entry), 0, recsize);
999 *(char *)e_rec(entry) = recsize;
1002 int iam_lvar_create(struct inode *obj,
1003 int keysize, int ptrsize, int recsize, handle_t *handle)
1005 struct buffer_head *root_node;
1006 struct buffer_head *leaf_node;
1007 struct super_block *sb;
1011 unsigned long bsize;
1013 assert_corr(obj->i_size == 0);
1016 bsize = sb->s_blocksize;
1017 root_node = osd_ldiskfs_append(handle, obj, &blknr);
1018 if (IS_ERR(root_node))
1019 GOTO(out, result = PTR_ERR(root_node));
1021 leaf_node = osd_ldiskfs_append(handle, obj, &blknr);
1022 if (IS_ERR(leaf_node))
1023 GOTO(out_root, result = PTR_ERR(leaf_node));
1025 lvar_root(root_node->b_data, bsize, keysize, ptrsize, recsize);
1026 lvar_leaf(leaf_node->b_data, bsize, keysize, ptrsize, recsize);
1027 ldiskfs_mark_inode_dirty(handle, obj);
1028 result = ldiskfs_handle_dirty_metadata(handle, NULL, root_node);
1030 result = ldiskfs_handle_dirty_metadata(handle, NULL, leaf_node);
1032 ldiskfs_std_error(sb, result);
1036 GOTO(out_root, result);
1044 static const struct iam_operations lvar_ops = {
1045 .id_root_ptr = lvar_root_ptr,
1046 .id_node_read = iam_node_read,
1047 .id_node_init = lvar_node_init,
1048 .id_node_check = lvar_node_check,
1049 .id_node_load = lvar_node_load,
1050 .id_ikeycmp = lvar_ikeycmp,
1051 .id_root_inc = lvar_root_inc,
1052 .id_ipd_alloc = lvar_ipd_alloc,
1053 .id_ipd_free = iam_ipd_free,
1057 int iam_lvar_guess(struct iam_container *c)
1060 struct buffer_head *bh;
1061 const struct lvar_root *root;
1063 assert_corr(c->ic_object != NULL);
1065 result = iam_node_read(c, lvar_root_ptr(c), NULL, &bh);
1067 root = (void *)bh->b_data;
1069 if (le32_to_cpu(root->vr_magic) == IAM_LVAR_ROOT_MAGIC) {
1070 struct iam_descr *descr;
1072 descr = c->ic_descr;
1073 descr->id_key_size = LDISKFS_NAME_LEN;
1074 descr->id_ikey_size = sizeof(lvar_hash_t);
1075 descr->id_rec_size = le16_to_cpu(root->vr_recsize);
1076 descr->id_ptr_size = le16_to_cpu(root->vr_ptrsize);
1077 descr->id_root_gap = sizeof(*root);
1078 descr->id_node_gap = 0;
1079 descr->id_ops = &lvar_ops;
1080 descr->id_leaf_ops = &lvar_leaf_ops;