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, 2016, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
34 * implementation of iam format for fixed size records, variable sized keys.
36 * Author: Nikita Danilov <nikita@clusterfs.com>
39 #include <linux/types.h>
40 #include "osd_internal.h"
47 IAM_LVAR_LEAF_MAGIC = 0x1973 /* This is duplicated in
48 * lustre/utils/create_iam.c */
51 /* This is duplicated in lustre/utils/create_iam.c */
52 struct lvar_leaf_header {
53 __le16 vlh_magic; /* magic number IAM_LVAR_LEAF_MAGIC */
54 __le16 vlh_used; /* used bytes, including header */
58 * Format of leaf entry:
64 * Entries are ordered in key order.
67 /* This is duplicated in lustre/utils/create_iam.c */
68 typedef __u32 lvar_hash_t;
70 /* This is duplicated in lustre/utils/create_iam.c */
71 struct lvar_leaf_entry {
77 #define PDIFF(ptr0, ptr1) (((char *)(ptr0)) - ((char *)(ptr1)))
80 static inline int blocksize(const struct iam_leaf *leaf)
82 return iam_leaf_container(leaf)->ic_object->i_sb->s_blocksize;
85 static inline const char *kchar(const struct iam_key *key)
90 static inline struct iam_lentry *lvar_lentry(const struct lvar_leaf_entry *ent)
92 return (struct iam_lentry *)ent;
95 static inline struct lvar_leaf_entry *lentry_lvar(const struct iam_lentry *lent)
97 return (struct lvar_leaf_entry *)lent;
101 static inline int e_keysize(const struct lvar_leaf_entry *ent)
103 return le16_to_cpu(ent->vle_keysize);
106 /* This is duplicated in lustre/utils/create_iam.c */
109 LVAR_ROUND = LVAR_PAD - 1
112 static inline int getsize(const struct iam_leaf *leaf, int namelen, int recsize)
114 CLASSERT(!(LVAR_PAD & (LVAR_PAD - 1)));
116 return (offsetof(struct lvar_leaf_entry, vle_key) +
117 namelen + recsize + LVAR_ROUND) & ~LVAR_ROUND;
120 static inline int rec_size(const struct iam_rec *rec)
122 return *(const char *)rec;
125 static inline struct iam_rec *e_rec(const struct lvar_leaf_entry *ent)
127 return ((void *)ent) +
128 offsetof(struct lvar_leaf_entry, vle_key) + e_keysize(ent);
131 static inline int e_size(const struct iam_leaf *leaf,
132 const struct lvar_leaf_entry *ent)
134 return getsize(leaf, e_keysize(ent), rec_size(e_rec(ent)));
137 static inline char *e_char(const struct lvar_leaf_entry *ent)
139 return (char *)&ent->vle_key;
142 static inline struct iam_key *e_key(const struct lvar_leaf_entry *ent)
144 return (struct iam_key *)e_char(ent);
147 static inline lvar_hash_t e_hash(const struct lvar_leaf_entry *ent)
149 return le32_to_cpu(ent->vle_hash);
152 static void e_print(const struct lvar_leaf_entry *ent)
154 printk(" %p %8.8x \"%*.*s\"\n", ent, e_hash(ent),
155 e_keysize(ent), e_keysize(ent), e_char(ent));
158 static inline struct lvar_leaf_entry *e_next(const struct iam_leaf *leaf,
159 const struct lvar_leaf_entry *ent)
161 return ((void *)ent) + e_size(leaf, ent);
164 #define LVAR_HASH_SANDWICH (0)
165 #define LVAR_HASH_TEA (1)
166 #define LVAR_HASH_R5 (0)
167 #define LVAR_HASH_PREFIX (0)
169 static __u32 hash_build0(const char *name, int namelen)
175 if (strncmp(name, ".", 1) == 0 && namelen == 1)
177 if (strncmp(name, "..", 2) == 0 && namelen == 2)
180 if (LVAR_HASH_PREFIX) {
182 strncpy((void *)&result,
183 name, min(namelen, (int)sizeof result));
185 struct ldiskfs_dx_hash_info hinfo;
187 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
189 ldiskfsfs_dirhash(name, namelen, &hinfo);
191 if (LVAR_HASH_SANDWICH) {
194 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
196 ldiskfsfs_dirhash(name, namelen, &hinfo);
197 result2 = hinfo.hash;
198 result = (0xfc000000 & result2) | (0x03ffffff & result);
205 HASH_GRAY_AREA = 1024,
206 HASH_MAX_SIZE = 0x7fffffffUL
209 static __u32 hash_build(const char *name, int namelen)
213 hash = (hash_build0(name, namelen) << 1) & HASH_MAX_SIZE;
214 if (hash > HASH_MAX_SIZE - HASH_GRAY_AREA)
215 hash &= HASH_GRAY_AREA - 1;
219 static inline lvar_hash_t get_hash(const struct iam_container *bag,
220 const char *name, int namelen)
222 return hash_build(name, namelen);
225 static inline int e_eq(const struct lvar_leaf_entry *ent,
226 const char *name, int namelen)
228 return namelen == e_keysize(ent) && !memcmp(e_char(ent), name, namelen);
231 static inline int e_cmp(const struct iam_leaf *leaf,
232 const struct lvar_leaf_entry *ent, lvar_hash_t hash)
237 return ehash == hash ? 0 : (ehash < hash ? -1 : +1);
240 static struct lvar_leaf_header *n_head(const struct iam_leaf *l)
242 return (struct lvar_leaf_header *)l->il_bh->b_data;
245 static int h_used(const struct lvar_leaf_header *hdr)
247 return le16_to_cpu(hdr->vlh_used);
250 static void h_used_adj(const struct iam_leaf *leaf,
251 struct lvar_leaf_header *hdr, int adj)
255 used = h_used(hdr) + adj;
256 assert_corr(sizeof *hdr <= used && used <= blocksize(leaf));
257 hdr->vlh_used = cpu_to_le16(used);
260 static struct lvar_leaf_entry *n_start(const struct iam_leaf *leaf)
262 return (void *)leaf->il_bh->b_data + sizeof(struct lvar_leaf_header);
265 static struct lvar_leaf_entry *n_end(const struct iam_leaf *l)
267 return (void *)l->il_bh->b_data + h_used(n_head(l));
270 static struct lvar_leaf_entry *n_cur(const struct iam_leaf *l)
272 return lentry_lvar(l->il_at);
275 void n_print(const struct iam_leaf *l)
277 struct lvar_leaf_entry *scan;
279 printk(KERN_EMERG "used: %d\n", h_used(n_head(l)));
280 for (scan = n_start(l); scan < n_end(l); scan = e_next(l, scan))
284 #if LDISKFS_CORRECTNESS_ON
285 static int n_at_rec(const struct iam_leaf *folio)
288 n_start(folio) <= lentry_lvar(folio->il_at) &&
289 lentry_lvar(folio->il_at) < n_end(folio);
292 #if LDISKFS_INVARIANT_ON
293 static int n_invariant(const struct iam_leaf *leaf)
295 struct iam_path *path;
296 struct lvar_leaf_entry *scan;
297 struct lvar_leaf_entry *end;
299 lvar_hash_t nexthash;
300 lvar_hash_t starthash;
304 path = leaf->il_path;
306 if (h_used(n_head(leaf)) > blocksize(leaf))
310 * Delimiting key in the parent index node. Clear least bit to account
311 * for hash collision marker.
313 starthash = *(lvar_hash_t *)iam_ikey_at(path, path->ip_frame->at) & ~1;
314 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
315 nexthash = e_hash(scan);
316 if (nexthash != get_hash(iam_leaf_container(leaf),
317 e_char(scan), e_keysize(scan))) {
321 if (0 && nexthash < starthash) {
323 * Unfortunately this useful invariant cannot be
324 * reliably checked as parent node is nor necessarily
328 printk("%#x < %#x\n", nexthash, starthash);
332 if (nexthash < hash) {
344 /* LDISKFS_INVARIANT_ON */
347 /* LDISKFS_CORRECTNESS_ON */
350 static struct iam_ikey *lvar_ikey(const struct iam_leaf *l,
351 struct iam_ikey *key)
355 assert_corr(n_at_rec(l));
358 *hash = e_hash(n_cur(l));
362 static struct iam_key *lvar_key(const struct iam_leaf *l)
364 return e_key(n_cur(l));
367 static int lvar_key_size(const struct iam_leaf *l)
369 return e_keysize(n_cur(l));
372 static void lvar_start(struct iam_leaf *l)
374 l->il_at = lvar_lentry(n_start(l));
377 static int lvar_init(struct iam_leaf *l)
381 struct lvar_leaf_header *head;
383 assert_corr(l->il_bh != NULL);
387 if (le16_to_cpu(head->vlh_magic) == IAM_LVAR_LEAF_MAGIC &&
388 used <= blocksize(l)) {
389 l->il_at = l->il_entries = lvar_lentry(n_start(l));
394 obj = iam_leaf_container(l)->ic_object;
395 CERROR("Wrong magic in node %llu (#%lu): %#x != %#x or "
397 (unsigned long long)l->il_bh->b_blocknr, obj->i_ino,
398 le16_to_cpu(head->vlh_magic), IAM_LVAR_LEAF_MAGIC,
405 static void lvar_fini(struct iam_leaf *l)
407 l->il_entries = l->il_at = NULL;
410 static struct iam_rec *lvar_rec(const struct iam_leaf *l)
412 assert_corr(n_at_rec(l));
413 return e_rec(n_cur(l));
416 static void lvar_next(struct iam_leaf *l)
418 assert_corr(n_at_rec(l));
419 assert_corr(iam_leaf_is_locked(l));
420 l->il_at = lvar_lentry(e_next(l, n_cur(l)));
423 static int lvar_lookup(struct iam_leaf *leaf, const struct iam_key *k)
425 struct lvar_leaf_entry *found;
426 struct lvar_leaf_entry *scan;
427 struct lvar_leaf_entry *end;
435 assert_inv(n_invariant(leaf));
439 namelen = strlen(name);
440 hash = get_hash(iam_leaf_container(leaf), name, namelen);
445 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
446 lvar_hash_t scan_hash;
448 scan_hash = e_hash(scan);
449 if (scan_hash < hash)
451 else if (scan_hash == hash) {
452 if (e_eq(scan, name, namelen)) {
456 leaf->il_at = lvar_lentry(scan);
457 return IAM_LOOKUP_EXACT;
458 } else if (!found_equal) {
469 * @k is less than all hashes in the leaf.
472 result = IAM_LOOKUP_BEFORE;
474 leaf->il_at = lvar_lentry(found);
475 result = IAM_LOOKUP_OK;
476 assert_corr(n_at_rec(leaf));
479 result |= IAM_LOOKUP_LAST;
480 assert_inv(n_invariant(leaf));
485 static int lvar_ilookup(struct iam_leaf *leaf, const struct iam_ikey *ik)
487 struct lvar_leaf_entry *scan;
488 struct lvar_leaf_entry *end;
491 assert_inv(n_invariant(leaf));
493 hash = *(const lvar_hash_t *)ik;
496 for (scan = n_start(leaf); scan < end; scan = e_next(leaf, scan)) {
497 lvar_hash_t scan_hash;
499 scan_hash = e_hash(scan);
500 if (scan_hash > hash)
501 return scan == n_start(leaf) ?
502 IAM_LOOKUP_BEFORE : IAM_LOOKUP_OK;
503 leaf->il_at = lvar_lentry(scan);
504 if (scan_hash == hash)
505 return IAM_LOOKUP_EXACT;
507 assert_inv(n_invariant(leaf));
509 * @ik is greater than any key in the node. Return last record in the
512 return IAM_LOOKUP_OK;
515 static void __lvar_key_set(struct iam_leaf *l, const struct iam_key *k)
517 memcpy(e_key(n_cur(l)), k, e_keysize(n_cur(l)));
520 static void lvar_key_set(struct iam_leaf *l, const struct iam_key *k)
522 assert_corr(n_at_rec(l));
523 assert_corr(strlen(kchar(k)) == e_keysize(n_cur(l)));
524 assert_corr(iam_leaf_is_locked(l));
525 __lvar_key_set(l, k);
526 assert_inv(n_invariant(l));
529 static int lvar_key_cmp(const struct iam_leaf *l, const struct iam_key *k)
536 hash = get_hash(iam_leaf_container(l), name, strlen(name));
537 return e_cmp(l, n_cur(l), hash);
540 static int lvar_key_eq(const struct iam_leaf *l, const struct iam_key *k)
545 return e_eq(n_cur(l), name, strlen(name));
548 static void __lvar_rec_set(struct iam_leaf *l, const struct iam_rec *r)
550 memcpy(e_rec(n_cur(l)), r, rec_size(r));
553 static void lvar_rec_set(struct iam_leaf *l, const struct iam_rec *r)
555 assert_corr(n_at_rec(l));
556 assert_corr(iam_leaf_is_locked(l));
557 __lvar_rec_set(l, r);
558 assert_inv(n_invariant(l));
561 static int lvar_rec_eq(const struct iam_leaf *l, const struct iam_rec *r)
563 struct iam_rec *rec = e_rec(n_cur(l));
565 if (rec_size(rec) != rec_size(r))
567 return !memcmp(rec, r, rec_size(r));
570 static void lvar_rec_get(const struct iam_leaf *l, struct iam_rec *r)
574 rec = e_rec(n_cur(l));
575 assert_corr(n_at_rec(l));
576 assert_corr(iam_leaf_is_locked(l));
577 memcpy(r, rec, rec_size(rec));
578 assert_inv(n_invariant(l));
581 static int lvar_can_add(const struct iam_leaf *l,
582 const struct iam_key *k, const struct iam_rec *r)
584 assert_corr(iam_leaf_is_locked(l));
587 getsize(l, strlen(kchar(k)), rec_size(r)) <= blocksize(l);
590 static int lvar_at_end(const struct iam_leaf *folio)
592 assert_corr(iam_leaf_is_locked(folio));
593 return n_cur(folio) == n_end(folio);
596 static void lvar_rec_add(struct iam_leaf *leaf,
597 const struct iam_key *k, const struct iam_rec *r)
606 assert_corr(lvar_can_add(leaf, k, r));
607 assert_inv(n_invariant(leaf));
608 assert_corr(iam_leaf_is_locked(leaf));
612 shift = getsize(leaf, ksize, rec_size(r));
614 if (!lvar_at_end(leaf)) {
615 assert_corr(n_cur(leaf) < n_end(leaf));
617 if (lvar_key_cmp(leaf, k) <= 0)
621 * Another exceptional case: insertion with the key
622 * less than least key in the leaf.
624 assert_corr(leaf->il_at == leaf->il_entries);
627 diff = PDIFF(end, start);
628 assert_corr(diff >= 0);
629 memmove(start + shift, start, diff);
631 h_used_adj(leaf, n_head(leaf), shift);
632 n_cur(leaf)->vle_keysize = cpu_to_le16(ksize);
633 n_cur(leaf)->vle_hash = cpu_to_le32(get_hash(iam_leaf_container(leaf),
635 __lvar_key_set(leaf, k);
636 __lvar_rec_set(leaf, r);
637 assert_corr(n_at_rec(leaf));
638 assert_inv(n_invariant(leaf));
641 static void lvar_rec_del(struct iam_leaf *leaf, int shift)
647 assert_corr(n_at_rec(leaf));
648 assert_inv(n_invariant(leaf));
649 assert_corr(iam_leaf_is_locked(leaf));
652 next = e_next(leaf, n_cur(leaf));
653 nob = e_size(leaf, n_cur(leaf));
654 memmove(leaf->il_at, next, end - next);
655 h_used_adj(leaf, n_head(leaf), -nob);
656 assert_inv(n_invariant(leaf));
659 static void lvar_init_new(struct iam_container *c, struct buffer_head *bh)
661 struct lvar_leaf_header *hdr;
663 hdr = (struct lvar_leaf_header *)bh->b_data;
664 hdr->vlh_magic = cpu_to_le16(IAM_LVAR_LEAF_MAGIC);
665 hdr->vlh_used = sizeof *hdr;
668 static struct lvar_leaf_entry *find_pivot(const struct iam_leaf *leaf,
669 struct lvar_leaf_entry **prev)
676 threshold = blocksize(leaf) / 2;
677 for (scan = start = n_start(leaf); scan - start <= threshold;
678 *prev = scan, scan = e_next(leaf, scan)) {
684 static void lvar_split(struct iam_leaf *leaf, struct buffer_head **bh,
687 struct lvar_leaf_entry *first_to_move;
688 struct lvar_leaf_entry *last_to_stay;
689 struct iam_path *path;
690 struct lvar_leaf_header *hdr;
691 struct buffer_head *new_leaf;
696 assert_inv(n_invariant(leaf));
697 assert_corr(iam_leaf_is_locked(leaf));
700 path = iam_leaf_path(leaf);
702 hdr = (void *)new_leaf->b_data;
704 first_to_move = find_pivot(leaf, &last_to_stay);
705 assert_corr(last_to_stay != NULL);
706 assert_corr(e_next(leaf, last_to_stay) == first_to_move);
708 hash = e_hash(first_to_move);
709 if (hash == e_hash(last_to_stay))
715 tomove = PDIFF(n_end(leaf), first_to_move);
716 memmove(hdr + 1, first_to_move, tomove);
718 h_used_adj(leaf, hdr, tomove);
719 h_used_adj(leaf, n_head(leaf), -tomove);
721 assert_corr(n_end(leaf) == first_to_move);
723 if (n_cur(leaf) >= first_to_move) {
725 * insertion point moves into new leaf.
729 shift = PDIFF(leaf->il_at, first_to_move);
731 leaf->il_bh = new_leaf;
732 leaf->il_curidx = new_blknr;
734 assert_corr(iam_leaf_is_locked(leaf));
737 * init cannot fail, as node was just initialized.
739 assert_corr(result == 0);
740 leaf->il_at = ((void *)leaf->il_at) + shift;
743 * Insert pointer to the new node (together with the least key in
744 * the node) into index node.
746 iam_insert_key_lock(path, path->ip_frame, (struct iam_ikey *)&hash,
748 assert_corr(n_cur(leaf) < n_end(leaf));
749 assert_inv(n_invariant(leaf));
752 static int lvar_leaf_empty(struct iam_leaf *leaf)
754 return h_used(n_head(leaf)) == sizeof(struct lvar_leaf_header);
757 static struct iam_leaf_operations lvar_leaf_ops = {
759 .init_new = lvar_init_new,
766 .key_set = lvar_key_set,
767 .key_cmp = lvar_key_cmp,
768 .key_eq = lvar_key_eq,
769 .key_size = lvar_key_size,
770 .rec_set = lvar_rec_set,
771 .rec_eq = lvar_rec_eq,
772 .rec_get = lvar_rec_get,
773 .lookup = lvar_lookup,
774 .ilookup = lvar_ilookup,
775 .at_end = lvar_at_end,
776 .rec_add = lvar_rec_add,
777 .rec_del = lvar_rec_del,
778 .can_add = lvar_can_add,
780 .leaf_empty = lvar_leaf_empty,
788 /* This is duplicated in lustre/utils/create_iam.c */
789 /* egrep -i '^o?x?[olabcdef]*$' /usr/share/dict/words */
790 IAM_LVAR_ROOT_MAGIC = 0xb01dface
793 /* This is duplicated in lustre/utils/create_iam.c */
798 u8 vr_indirect_levels;
803 static __u32 lvar_root_ptr(struct iam_container *c)
808 static int lvar_node_init(struct iam_container *c, struct buffer_head *bh,
814 static struct iam_entry *lvar_root_inc(struct iam_container *c,
815 struct iam_path *path,
816 struct iam_frame *frame)
818 struct lvar_root *root;
819 struct iam_entry *entries;
821 assert_corr(iam_frame_is_locked(path, frame));
822 entries = frame->entries;
824 dx_set_count(entries, 2);
825 assert_corr(dx_get_limit(entries) == dx_root_limit(path));
827 root = (void *)frame->bh->b_data;
828 assert_corr(le64_to_cpu(root->vr_magic) == IAM_LVAR_ROOT_MAGIC);
829 root->vr_indirect_levels ++;
830 frame->at = entries = iam_entry_shift(path, entries, 1);
831 memset(iam_ikey_at(path, entries), 0,
832 iam_path_descr(path)->id_ikey_size);
836 static int lvar_node_check(struct iam_path *path, struct iam_frame *frame)
840 unsigned limit_correct;
841 struct iam_entry *entries;
843 entries = dx_node_get_entries(path, frame);
845 if (frame == path->ip_frames) {
846 struct lvar_root *root;
848 root = (void *)frame->bh->b_data;
849 if (le32_to_cpu(root->vr_magic) != IAM_LVAR_ROOT_MAGIC)
851 limit_correct = dx_root_limit(path);
853 limit_correct = dx_node_limit(path);
854 count = dx_get_count(entries);
855 limit = dx_get_limit(entries);
858 if (limit != limit_correct)
863 static int lvar_node_load(struct iam_path *path, struct iam_frame *frame)
865 struct iam_entry *entries;
867 entries = dx_node_get_entries(path, frame);
869 data = frame->bh->b_data;
871 if (frame == path->ip_frames) {
872 struct lvar_root *root;
876 name = kchar(path->ip_key_target);
877 path->ip_indirect = root->vr_indirect_levels;
878 if (path->ip_ikey_target == NULL) {
879 path->ip_ikey_target = iam_path_ikey(path, 4);
880 *(lvar_hash_t *)path->ip_ikey_target =
881 get_hash(path->ip_container, name,
885 frame->entries = frame->at = entries;
889 static int lvar_ikeycmp(const struct iam_container *c,
890 const struct iam_ikey *k1, const struct iam_ikey *k2)
892 lvar_hash_t p1 = le32_to_cpu(*(lvar_hash_t *)k1);
893 lvar_hash_t p2 = le32_to_cpu(*(lvar_hash_t *)k2);
895 return p1 > p2 ? +1 : (p1 < p2 ? -1 : 0);
898 static struct iam_path_descr *lvar_ipd_alloc(const struct iam_container *c,
901 return iam_ipd_alloc(area, c->ic_descr->id_ikey_size);
904 static void lvar_root(void *buf,
905 int blocksize, int keysize, int ptrsize, int recsize)
907 struct lvar_root *root;
908 struct dx_countlimit *limit;
912 isize = sizeof(lvar_hash_t) + ptrsize;
914 *root = (typeof(*root)) {
915 .vr_magic = cpu_to_le32(IAM_LVAR_ROOT_MAGIC),
916 .vr_recsize = cpu_to_le16(recsize),
917 .vr_ptrsize = cpu_to_le16(ptrsize),
918 .vr_indirect_levels = 0
921 limit = (void *)(root + 1);
922 *limit = (typeof(*limit)){
924 * limit itself + one pointer to the leaf.
926 .count = cpu_to_le16(2),
927 .limit = iam_root_limit(sizeof(struct lvar_root), blocksize,
928 sizeof (lvar_hash_t) + ptrsize)
931 /* To guarantee that the padding "keysize + ptrsize"
932 * covers the "dx_countlimit" and the "idle_blocks". */
933 LASSERT((keysize + ptrsize) >=
934 (sizeof(struct dx_countlimit) + sizeof(__u32)));
936 entry = (void *)(limit + 1);
937 /* Put "idle_blocks" just after the limit. There was padding after
938 * the limit, the "idle_blocks" re-uses part of the padding, so no
939 * compatibility issues with old layout.
946 entry = (void *)(root + 1) + isize;
949 * Entry format is <key> followed by <ptr>. In the minimal tree
950 * consisting of a root and single node, <key> is a minimal possible
953 *(lvar_hash_t *)entry = 0;
954 entry += sizeof(lvar_hash_t);
955 /* now @entry points to <ptr> */
957 *(u_int32_t *)entry = cpu_to_le32(1);
959 *(u_int64_t *)entry = cpu_to_le64(1);
962 static int lvar_esize(int namelen, int recsize)
964 return (offsetof(struct lvar_leaf_entry, vle_key) +
965 namelen + recsize + LVAR_ROUND) & ~LVAR_ROUND;
968 static void lvar_leaf(void *buf,
969 int blocksize, int keysize, int ptrsize, int recsize)
971 struct lvar_leaf_header *head;
972 struct lvar_leaf_entry *entry;
976 *head = (typeof(*head)) {
977 .vlh_magic = cpu_to_le16(IAM_LVAR_LEAF_MAGIC),
978 .vlh_used = cpu_to_le16(sizeof *head + lvar_esize(0, recsize))
980 entry = (void *)(head + 1);
981 *entry = (typeof(*entry)) {
985 memset(e_rec(entry), 0, recsize);
986 *(char *)e_rec(entry) = recsize;
989 int iam_lvar_create(struct inode *obj,
990 int keysize, int ptrsize, int recsize, handle_t *handle)
992 struct buffer_head *root_node;
993 struct buffer_head *leaf_node;
994 struct super_block *sb;
1000 assert_corr(obj->i_size == 0);
1003 bsize = sb->s_blocksize;
1004 root_node = osd_ldiskfs_append(handle, obj, &blknr);
1005 if (IS_ERR(root_node))
1006 GOTO(out, result = PTR_ERR(root_node));
1008 leaf_node = osd_ldiskfs_append(handle, obj, &blknr);
1009 if (IS_ERR(leaf_node))
1010 GOTO(out_root, result = PTR_ERR(leaf_node));
1012 lvar_root(root_node->b_data, bsize, keysize, ptrsize, recsize);
1013 lvar_leaf(leaf_node->b_data, bsize, keysize, ptrsize, recsize);
1014 ldiskfs_mark_inode_dirty(handle, obj);
1015 result = ldiskfs_handle_dirty_metadata(handle, NULL, root_node);
1017 result = ldiskfs_handle_dirty_metadata(handle, NULL, leaf_node);
1019 ldiskfs_std_error(sb, result);
1023 GOTO(out_root, result);
1031 static struct iam_operations lvar_ops = {
1032 .id_root_ptr = lvar_root_ptr,
1033 .id_node_read = iam_node_read,
1034 .id_node_init = lvar_node_init,
1035 .id_node_check = lvar_node_check,
1036 .id_node_load = lvar_node_load,
1037 .id_ikeycmp = lvar_ikeycmp,
1038 .id_root_inc = lvar_root_inc,
1039 .id_ipd_alloc = lvar_ipd_alloc,
1040 .id_ipd_free = iam_ipd_free,
1044 static int lvar_guess(struct iam_container *c)
1047 struct buffer_head *bh;
1048 const struct lvar_root *root;
1050 assert_corr(c->ic_object != NULL);
1052 result = iam_node_read(c, lvar_root_ptr(c), NULL, &bh);
1054 root = (void *)bh->b_data;
1055 if (le32_to_cpu(root->vr_magic) == IAM_LVAR_ROOT_MAGIC) {
1056 struct iam_descr *descr;
1058 descr = c->ic_descr;
1059 descr->id_key_size = LDISKFS_NAME_LEN;
1060 descr->id_ikey_size = sizeof (lvar_hash_t);
1061 descr->id_rec_size = le16_to_cpu(root->vr_recsize);
1062 descr->id_ptr_size = le16_to_cpu(root->vr_ptrsize);
1063 descr->id_root_gap = sizeof *root;
1064 descr->id_node_gap = 0;
1065 descr->id_ops = &lvar_ops;
1066 descr->id_leaf_ops = &lvar_leaf_ops;
1077 static struct iam_format lvar_format = {
1078 .if_guess = lvar_guess
1081 void iam_lvar_format_init(void)
1083 iam_format_register(&lvar_format);