1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see [sun.com URL with a
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
37 * Top-level entry points into osd module
39 * Author: Wang Di <wangdi@clusterfs.com>
40 * Author: Nikita Danilov <nikita@clusterfs.com>
43 #ifndef __LINUX_LUSTRE_IAM_H__
44 #define __LINUX_LUSTRE_IAM_H__
46 #include <linux/module.h>
47 #include <asm/unaligned.h>
48 #include <linux/dynlocks.h>
51 * linux/include/linux/osd_iam.h
54 #define CLASSERT(cond) do {switch(42) {case (cond): case 0: break;}} while (0)
57 #define ergo(a, b) (!(a) || (b))
58 /* logical equivalence */
59 #define equi(a, b) (!!(a) == !!(b))
63 * Maximal number of non-leaf levels in htree. In the stock ldiskfs this
67 * XXX reduced back to 2 to make per-node locking work.
69 DX_MAX_TREE_HEIGHT = 5,
71 * Scratch keys used by generic code for temporaries.
75 * [0] reserved for assertions and as a staging area for
76 * record keys immediately used for key comparisons.
78 * [1] reserved for record key, stored during iteration over
79 * node records (see dx_node_check()).
81 * [2] reserved for leaf node operations.
83 * [3] reserved for index operations.
85 * [4] reserved for path->ip_ikey_target
90 * Maximal format name length.
96 /* handle_t, journal_start(), journal_stop() */
97 #include <linux/jbd.h>
102 * Various debugging levels.
107 * Following macros are defined in config.h and are tunable through
108 * appropriate configure switches (indicated below).
112 * Compile basic assertions in. You want this most of the time.
114 * --{enable,disable}-ldiskfs-assert (on by default).
116 #define LDISKFS_ASSERT (1)
119 * Compile heavier correctness checks in. You want this during development
122 * --{enable,disable}-ldiskfs-correctness (off by default).
124 #define LDISKFS_CORRECTNESS (1)
127 * Compile heavy invariant checking in. You want this early during development
128 * or when chasing a bug.
130 * --{enable,disable}-ldiskfs-invariant (off by default).
132 #define LDISKFS_INVARIANT (1)
135 #if defined(LDISKFS_ASSERT)
136 #define LDISKFS_ASSERT_ON (1)
138 #define LDISKFS_ASSERT_ON (0)
141 #if defined(LDISKFS_CORRECTNESS)
142 #define LDISKFS_CORRECTNESS_ON (1)
144 #define LDISKFS_CORRECTNESS_ON (0)
147 #if defined(LDISKFS_INVARIANT)
148 #define LDISKFS_INVARIANT_ON (1)
150 #define LDISKFS_INVARIANT_ON (0)
154 #if LDISKFS_ASSERT_ON
155 #define assert(test) J_ASSERT(test)
157 #define assert(test) ((void)(test))
161 #if LDISKFS_CORRECTNESS_ON
162 #define assert_corr(test) J_ASSERT(test)
163 #define do_corr(exp) exp
165 #define assert_corr(test) do {;} while (0)
166 #define do_corr(exp) do {;} while (0)
169 #if LDISKFS_INVARIANT_ON
170 #define assert_inv(test) J_ASSERT(test)
172 #define assert_inv(test) do {;} while (0)
176 * Entry within index tree node. Consists of a key immediately followed
177 * (without padding) by a pointer to the child node.
179 * Both key and pointer are of variable size, hence incomplete type.
183 struct iam_entry_compat {
189 * Incomplete type used to refer to keys in iam container.
191 * As key size can be different from container to container, iam has to use
192 * incomplete type. Clients cast pointer to iam_key to real key type and back.
197 * Incomplete type use to refer to the records stored in iam containers.
202 * Key in index node. Possibly compressed. Fixed size.
207 * Scalar type into which certain iam_key's can be uniquely mapped. Used to
208 * support interfaces like readdir(), where iteration over index has to be
211 typedef __u32 iam_ptr_t;
214 * Index node traversed during tree lookup.
217 struct buffer_head *bh; /* buffer holding node data */
218 struct iam_entry *entries; /* array of entries */
219 struct iam_entry *at; /* target entry, found by binary search */
220 iam_ptr_t leaf; /* (logical) offset of child node found by
222 iam_ptr_t curidx; /* (logical) offset of this node. Used to
223 * per-node locking to detect concurrent
228 * Opaque entry in the leaf node.
233 struct iam_container;
236 /* leaf node reached by tree lookup */
238 struct iam_path *il_path;
239 struct buffer_head *il_bh;
240 struct iam_lentry *il_entries;
241 struct iam_lentry *il_at;
243 * Lock on a leaf node.
245 struct dynlock_handle *il_lock;
246 iam_ptr_t il_curidx; /* logical offset of leaf node. */
251 * Return values of ->lookup() operation from struct iam_leaf_operations.
255 * lookup found a record with the key requested
257 IAM_LOOKUP_EXACT = 0,
259 * lookup positioned leaf on some record
265 IAM_LOOKUP_EMPTY = 2,
267 * lookup positioned leaf before first record
269 IAM_LOOKUP_BEFORE = 3,
271 * Found hash may have a continuation in the next leaf.
273 IAM_LOOKUP_LAST = 0x100
277 * Format-specific container operations. These are called by generic iam code.
279 struct iam_operations {
281 * Returns pointer (in the same sense as pointer in index entry) to
284 __u32 (*id_root_ptr)(struct iam_container *c);
287 * Check validity and consistency of index node.
289 int (*id_node_check)(struct iam_path *path, struct iam_frame *frame);
291 * Copy some data from node header into frame. This is called when
292 * new node is loaded into frame.
294 int (*id_node_load)(struct iam_path *path, struct iam_frame *frame);
296 * Initialize new node (stored in @bh) that is going to be added into
299 int (*id_node_init)(struct iam_container *c,
300 struct buffer_head *bh, int root);
301 int (*id_node_read)(struct iam_container *c, iam_ptr_t ptr,
302 handle_t *h, struct buffer_head **bh);
304 * Key comparison functions. Returns -1, 0, +1.
306 int (*id_ikeycmp)(const struct iam_container *c,
307 const struct iam_ikey *k1,
308 const struct iam_ikey *k2);
310 * Modify root node when tree height increases.
312 struct iam_entry *(*id_root_inc)(struct iam_container *c,
313 struct iam_path *path,
314 struct iam_frame *frame);
316 struct iam_path_descr *(*id_ipd_alloc)(const struct iam_container *c,
318 void (*id_ipd_free)(struct iam_path_descr *ipd);
322 char id_name[DX_FMT_NAME_LEN];
326 * Another format-specific operation vector, consisting of methods to access
327 * leaf nodes. This is separated from struct iam_operations, because it is
328 * assumed that there will be many formats with different format of leaf
329 * nodes, yes the same struct iam_operations.
331 struct iam_leaf_operations {
337 * initialize just loaded leaf node.
339 int (*init)(struct iam_leaf *p);
343 void (*init_new)(struct iam_container *c, struct buffer_head *bh);
347 void (*fini)(struct iam_leaf *l);
349 * returns true iff leaf is positioned at the last entry.
351 int (*at_end)(const struct iam_leaf *l);
352 /* position leaf at the first entry */
353 void (*start)(struct iam_leaf *l);
354 /* more leaf to the next entry. */
355 void (*next)(struct iam_leaf *l);
357 * return key of current leaf record. This method may return
358 * either pointer to the key stored in node, or copy key into
359 * @k buffer supplied by caller and return pointer to this
360 * buffer. The latter approach is used when keys in nodes are
361 * not stored in plain form (e.g., htree doesn't store keys at
364 * Caller should assume that returned pointer is only valid
365 * while leaf node is pinned and locked.
367 struct iam_ikey *(*ikey)(const struct iam_leaf *l, struct iam_ikey *k);
368 struct iam_key *(*key)(const struct iam_leaf *l);
369 /* return pointer to entry body. Pointer is valid while
370 corresponding leaf node is locked and pinned. */
371 struct iam_rec *(*rec)(const struct iam_leaf *l);
373 void (*key_set)(struct iam_leaf *l, const struct iam_key *k);
374 void (*rec_set)(struct iam_leaf *l, const struct iam_rec *r);
375 void (*rec_get)(const struct iam_leaf *l, struct iam_rec *r);
377 int (*key_cmp)(const struct iam_leaf *l, const struct iam_key *k);
378 int (*key_eq)(const struct iam_leaf *l, const struct iam_key *k);
380 int (*key_size)(const struct iam_leaf *l);
382 * Search leaf @l for a record with key @k or for a place
383 * where such record is to be inserted.
385 * Scratch keys from @path can be used.
387 int (*lookup)(struct iam_leaf *l, const struct iam_key *k);
388 int (*ilookup)(struct iam_leaf *l, const struct iam_ikey *ik);
390 int (*can_add)(const struct iam_leaf *l,
391 const struct iam_key *k, const struct iam_rec *r);
395 void (*rec_add)(struct iam_leaf *l,
396 const struct iam_key *k, const struct iam_rec *r);
398 * remove rec for a leaf
400 void (*rec_del)(struct iam_leaf *l, int shift);
402 * split leaf node, moving some entries into @bh (the latter currently
403 * is assumed to be empty).
405 void (*split)(struct iam_leaf *l, struct buffer_head **bh,
410 * Parameters, describing a flavor of iam container.
414 * Size of a key in this container, in bytes.
418 * Size of a key in index nodes, in bytes.
422 * Size of a pointer to the next level (stored in index nodes), in
427 * Size of a record (stored in leaf nodes), in bytes.
431 * Size of unused (by iam) space at the beginning of every non-root
432 * node, in bytes. Used for compatibility with ldiskfs.
436 * Size of unused (by iam) space at the beginning of root node, in
437 * bytes. Used for compatibility with ldiskfs.
441 struct iam_operations *id_ops;
442 struct iam_leaf_operations *id_leaf_ops;
446 * An instance of iam container.
448 struct iam_container {
450 * Underlying flat file. IO against this object is issued to
453 struct inode *ic_object;
457 struct iam_descr *ic_descr;
459 * read-write lock protecting index consistency.
461 struct rw_semaphore ic_sem;
465 * description-specific part of iam_path. This is usually embedded into larger
468 struct iam_path_descr {
470 * Scratch-pad area for temporary keys.
472 struct iam_ikey *ipd_key_scratch[DX_SCRATCH_KEYS];
476 * Structure to keep track of a path drilled through htree.
482 struct iam_container *ip_container;
484 * Number of index levels minus one.
488 * Nodes that top-to-bottom traversal passed through.
490 struct iam_frame ip_frames[DX_MAX_TREE_HEIGHT];
492 * Last filled frame in ->ip_frames. Refers to the 'twig' node (one
493 * immediately above leaf).
495 struct iam_frame *ip_frame;
497 * Leaf node: a child of ->ip_frame.
499 struct iam_leaf ip_leaf;
503 const struct iam_key *ip_key_target;
504 const struct iam_ikey *ip_ikey_target;
506 * Description-specific data.
508 struct iam_path_descr *ip_data;
511 struct ldiskfs_dx_hash_info;
514 * Helper structure for legacy htrees.
516 struct iam_path_compat {
517 struct iam_path ipc_path;
518 struct iam_container ipc_container;
519 __u32 ipc_scratch[DX_SCRATCH_KEYS];
520 struct ldiskfs_dx_hash_info *ipc_hinfo;
521 struct qstr *ipc_qstr;
522 struct iam_path_descr ipc_descr;
523 struct ldiskfs_dx_hash_info ipc_hinfo_area;
526 #define const_max(p, q) ((p > q) ? p : q)
529 DX_MAX_IKEY_SIZE = 32, /* be generous */
531 * Hack to avoid dynamic allocation and freeing of ipd.
533 DX_IPD_MAX_SIZE = const_max(sizeof(struct iam_path_compat),
534 DX_MAX_IKEY_SIZE * DX_SCRATCH_KEYS +
535 sizeof(struct iam_path_descr))
539 * iam cursor (iterator) api.
543 * States of iterator state machine.
548 /* iterator is above particular record in the container */
550 /* iterator is positioned before record */
555 * Flags controlling iterator functionality.
559 * this iterator will move (iam_it_next() will be called on it)
561 IAM_IT_MOVE = (1 << 0),
563 * tree can be updated through this iterator.
565 IAM_IT_WRITE = (1 << 1)
571 * Immediately after call to iam_it_init() iterator is in "detached"
572 * (IAM_IT_DETACHED) state: it is associated with given parent container, but
573 * doesn't point to any particular record in this container.
575 * After successful call to iam_it_get() and until corresponding call to
576 * iam_it_put() iterator is in one of "active" states: IAM_IT_ATTACHED or
579 * Active iterator can move through records in a container (provided
580 * IAM_IT_MOVE permission) in a key order, can get record and key values as it
581 * passes over them, and can modify container (provided IAM_IT_WRITE
584 * Iteration may reach the end of container, at which point iterator switches
585 * into IAM_IT_DETACHED state.
587 * Concurrency: iterators are supposed to be local to thread. Interfaces below
588 * do no internal serialization of access to the iterator fields.
590 * When in non-detached state, iterator keeps some container nodes pinned in
591 * memory and locked (that locking may be implemented at the container
592 * granularity though). In particular, clients may assume that pointers to
593 * records and keys obtained through iterator interface as valid until
594 * iterator is detached (except that they may be invalidated by sub-sequent
595 * operations done through the same iterator).
598 struct iam_iterator {
600 * iterator flags, taken from enum iam_it_flags.
603 enum iam_it_state ii_state;
605 * path to the record. Valid in IAM_IT_ATTACHED, and IAM_IT_SKEWED
608 struct iam_path ii_path;
611 void iam_path_init(struct iam_path *path, struct iam_container *c,
612 struct iam_path_descr *pd);
613 void iam_path_fini(struct iam_path *path);
614 void iam_path_release(struct iam_path *path);
616 void iam_path_compat_init(struct iam_path_compat *path, struct inode *inode);
617 void iam_path_compat_fini(struct iam_path_compat *path);
619 struct iam_path_descr *iam_ipd_alloc(void *area, int keysize);
620 void iam_ipd_free(struct iam_path_descr *ipd);
622 int iam_it_init(struct iam_iterator *it, struct iam_container *c, __u32 flags,
623 struct iam_path_descr *pd);
624 void iam_it_fini(struct iam_iterator *it);
625 int iam_it_get(struct iam_iterator *it, const struct iam_key *k);
626 int iam_it_get_at(struct iam_iterator *it, const struct iam_key *k);
627 void iam_it_dup(struct iam_iterator *dst, const struct iam_iterator *src);
628 void iam_it_put(struct iam_iterator *it);
629 int iam_it_next(struct iam_iterator *it);
630 struct iam_rec *iam_it_rec_get(const struct iam_iterator *it);
631 int iam_it_rec_set(handle_t *h,
632 struct iam_iterator *it, const struct iam_rec *r);
633 struct iam_key *iam_it_key_get(const struct iam_iterator *it);
634 int iam_it_key_size(const struct iam_iterator *it);
635 int iam_it_rec_insert(handle_t *h, struct iam_iterator *it,
636 const struct iam_key *k, const struct iam_rec *r);
637 int iam_it_rec_delete(handle_t *h, struct iam_iterator *it);
639 typedef __u64 iam_pos_t;
641 iam_pos_t iam_it_store(const struct iam_iterator *it);
642 int iam_it_load(struct iam_iterator *it, iam_pos_t pos);
644 int iam_lookup(struct iam_container *c, const struct iam_key *k,
645 struct iam_rec *r, struct iam_path_descr *pd);
646 int iam_delete(handle_t *h, struct iam_container *c, const struct iam_key *k,
647 struct iam_path_descr *pd);
648 int iam_update(handle_t *h, struct iam_container *c, const struct iam_key *k,
649 const struct iam_rec *r, struct iam_path_descr *pd);
650 int iam_insert(handle_t *handle, struct iam_container *c,
651 const struct iam_key *k,
652 const struct iam_rec *r, struct iam_path_descr *pd);
654 * Initialize container @c.
656 int iam_container_init(struct iam_container *c,
657 struct iam_descr *descr, struct inode *inode);
659 * Finalize container @c, release all resources.
661 void iam_container_fini(struct iam_container *c);
664 * Determine container format.
666 int iam_container_setup(struct iam_container *c);
668 static inline struct iam_descr *iam_container_descr(struct iam_container *c)
673 static inline struct iam_descr *iam_path_descr(const struct iam_path *p)
675 return p->ip_container->ic_descr;
678 static inline struct inode *iam_path_obj(struct iam_path *p)
680 return p->ip_container->ic_object;
683 static inline void iam_ikeycpy(const struct iam_container *c,
684 struct iam_ikey *k1, const struct iam_ikey *k2)
686 memcpy(k1, k2, c->ic_descr->id_ikey_size);
689 static inline size_t iam_entry_size(struct iam_path *p)
691 return iam_path_descr(p)->id_ikey_size + iam_path_descr(p)->id_ptr_size;
694 static inline struct iam_entry *iam_entry_shift(struct iam_path *p,
695 struct iam_entry *entry,
699 return e + shift * iam_entry_size(p);
702 static inline struct iam_ikey *dx_get_ikey(struct iam_path *p,
703 struct iam_entry *entry,
704 struct iam_ikey *key)
706 return memcpy(key, entry, iam_path_descr(p)->id_ikey_size);
709 static inline struct iam_ikey *iam_ikey_at(struct iam_path *p,
710 struct iam_entry *entry)
712 return (struct iam_ikey *)entry;
715 static inline ptrdiff_t iam_entry_diff(struct iam_path *p,
716 struct iam_entry *e1,
717 struct iam_entry *e2)
721 diff = (void *)e1 - (void *)e2;
722 assert_corr(diff / iam_entry_size(p) * iam_entry_size(p) == diff);
723 return diff / iam_entry_size(p);
727 * Helper for the frequent case, where key was already placed into @k1 by
730 static inline void iam_ikeycpy0(const struct iam_container *c,
731 struct iam_ikey *k1, const struct iam_ikey *k2)
734 iam_ikeycpy(c, k1, k2);
737 static inline int iam_ikeycmp(const struct iam_container *c,
738 const struct iam_ikey *k1,
739 const struct iam_ikey *k2)
741 return c->ic_descr->id_ops->id_ikeycmp(c, k1, k2);
744 static inline void *iam_entry_off(struct iam_entry *entry, size_t off)
746 return (void *)((char *)entry + off);
753 static inline struct iam_path *iam_leaf_path(const struct iam_leaf *leaf)
755 return leaf->il_path;
758 static inline struct iam_container *
759 iam_leaf_container(const struct iam_leaf *leaf)
761 return iam_leaf_path(leaf)->ip_container;
764 static inline struct iam_descr *iam_leaf_descr(const struct iam_leaf *leaf)
766 return iam_leaf_container(leaf)->ic_descr;
769 static inline struct iam_leaf_operations *
770 iam_leaf_ops(const struct iam_leaf *leaf)
772 return iam_leaf_descr(leaf)->id_leaf_ops;
775 static inline void iam_reccpy(const struct iam_leaf *leaf,
776 struct iam_rec *rec_dst)
778 iam_leaf_ops(leaf)->rec_get(leaf, rec_dst);
781 /*XXX These stuff put here, just because they are used by iam.c */
782 static inline unsigned dx_get_block(struct iam_path *p, struct iam_entry *entry)
786 addr = iam_entry_off(entry, iam_path_descr(p)->id_ikey_size);
787 return le32_to_cpu(get_unaligned(addr)) & 0x00ffffff;
790 static inline void dx_set_block(struct iam_path *p,
791 struct iam_entry *entry, unsigned value)
795 addr = iam_entry_off(entry, iam_path_descr(p)->id_ikey_size);
796 put_unaligned(cpu_to_le32(value), addr);
799 static inline void dx_set_ikey(struct iam_path *p, struct iam_entry *entry,
800 const struct iam_ikey *key)
802 iam_ikeycpy(p->ip_container, iam_entry_off(entry, 0), key);
818 struct dx_countlimit {
824 * dx_root_info is laid out so that if it should somehow get overlaid by a
825 * dirent the two low bits of the hash version will be zero. Therefore, the
826 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
830 struct fake_dirent dot;
832 struct fake_dirent dotdot;
836 __le32 reserved_zero;
838 u8 info_length; /* 8 */
843 struct {} entries[0];
848 struct fake_dirent fake;
849 struct {} entries[0];
853 static inline unsigned dx_get_count(struct iam_entry *entries)
855 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
858 static inline unsigned dx_get_limit(struct iam_entry *entries)
860 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
863 static inline void dx_set_count(struct iam_entry *entries, unsigned value)
865 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
868 static inline unsigned dx_node_limit(struct iam_path *p)
870 struct iam_descr *param = iam_path_descr(p);
871 unsigned entry_space = iam_path_obj(p)->i_sb->s_blocksize -
873 return entry_space / (param->id_ikey_size + param->id_ptr_size);
876 static inline unsigned dx_root_limit(struct iam_path *p)
878 struct iam_descr *param = iam_path_descr(p);
879 unsigned limit = iam_path_obj(p)->i_sb->s_blocksize -
881 limit /= (param->id_ikey_size + param->id_ptr_size);
882 if (limit == dx_node_limit(p))
888 static inline struct iam_entry *dx_get_entries(struct iam_path *path,
889 void *data, int root)
891 struct iam_descr *param = iam_path_descr(path);
892 return data + (root ? param->id_root_gap : param->id_node_gap);
896 static inline struct iam_entry *dx_node_get_entries(struct iam_path *path,
897 struct iam_frame *frame)
899 return dx_get_entries(path,
900 frame->bh->b_data, frame == path->ip_frames);
903 static inline struct iam_ikey *iam_path_ikey(const struct iam_path *path,
906 assert(0 <= nr && nr < ARRAY_SIZE(path->ip_data->ipd_key_scratch));
907 return path->ip_data->ipd_key_scratch[nr];
910 static inline struct dynlock *path_dynlock(struct iam_path *path)
912 return &LDISKFS_I(iam_path_obj(path))->i_htree_lock;
915 static inline int iam_leaf_is_locked(const struct iam_leaf *leaf)
919 result = dynlock_is_locked(path_dynlock(leaf->il_path),
926 static inline int iam_frame_is_locked(struct iam_path *path,
927 const struct iam_frame *frame)
931 result = dynlock_is_locked(path_dynlock(path), frame->curidx);
937 int dx_lookup_lock(struct iam_path *path,
938 struct dynlock_handle **dl, enum dynlock_type lt);
940 void dx_insert_block(struct iam_path *path, struct iam_frame *frame,
941 u32 hash, u32 block);
942 int dx_index_is_compat(struct iam_path *path);
944 int ldiskfs_htree_next_block(struct inode *dir, __u32 hash,
945 struct iam_path *path, __u32 *start_hash);
947 struct buffer_head *ldiskfs_append(handle_t *handle, struct inode *inode,
948 u32 *block, int *err);
949 int split_index_node(handle_t *handle, struct iam_path *path,
950 struct dynlock_handle **lh);
951 struct ldiskfs_dir_entry_2 *split_entry(struct inode *dir,
952 struct ldiskfs_dir_entry_2 *de,
953 unsigned long ino, mode_t mode,
954 const char *name, int namelen);
955 struct ldiskfs_dir_entry_2 *find_insertion_point(struct inode *dir,
956 struct buffer_head *bh,
957 const char *name, int namelen);
958 struct ldiskfs_dir_entry_2 *move_entries(struct inode *dir,
959 struct ldiskfs_dx_hash_info *hinfo,
960 struct buffer_head **bh1,
961 struct buffer_head **bh2,
964 extern struct iam_descr iam_htree_compat_param;
966 struct dynlock_handle *dx_lock_htree(struct inode *dir, unsigned long value,
967 enum dynlock_type lt);
968 void dx_unlock_htree(struct inode *dir, struct dynlock_handle *lh);
973 void iam_container_write_lock(struct iam_container *c);
974 void iam_container_write_unlock(struct iam_container *c);
976 void iam_container_read_lock(struct iam_container *c);
977 void iam_container_read_unlock(struct iam_container *c);
979 int iam_index_next(struct iam_container *c, struct iam_path *p);
980 int iam_read_leaf(struct iam_path *p);
982 int iam_node_read(struct iam_container *c, iam_ptr_t ptr,
983 handle_t *handle, struct buffer_head **bh);
984 int iam_lvar_create(struct inode *obj, int keysize, int ptrsize,
985 int recsize, handle_t *handle);
986 int iam_lfix_create(struct inode *obj, int keysize, int ptrsize,
987 int recsize, handle_t *handle);
990 #define swap(x, y) do { typeof(x) z = x; x = y; y = z; } while (0)
994 #define dxtrace(command) command
996 #define dxtrace(command)
1000 #define DX_DEBUG (1)
1002 static struct iam_lock_stats {
1003 unsigned dls_bh_lock;
1004 unsigned dls_bh_busy;
1005 unsigned dls_bh_again;
1006 unsigned dls_bh_full_again;
1007 } iam_lock_stats = { 0, };
1008 #define DX_DEVAL(x) x
1013 static inline void iam_lock_bh(struct buffer_head volatile *bh)
1015 DX_DEVAL(iam_lock_stats.dls_bh_lock++);
1017 while (test_and_set_bit(BH_DXLock, &bh->b_state)) {
1018 DX_DEVAL(iam_lock_stats.dls_bh_busy++);
1019 while (test_bit(BH_DXLock, &bh->b_state))
1025 static inline void iam_unlock_bh(struct buffer_head *bh)
1028 smp_mb__before_clear_bit();
1029 clear_bit(BH_DXLock, &bh->b_state);
1034 void iam_insert_key(struct iam_path *path, struct iam_frame *frame,
1035 const struct iam_ikey *key, iam_ptr_t ptr);
1037 void iam_insert_key_lock(struct iam_path *path, struct iam_frame *frame,
1038 const struct iam_ikey *key, iam_ptr_t ptr);
1041 int iam_leaf_at_end(const struct iam_leaf *l);
1042 void iam_leaf_next(struct iam_leaf *folio);
1043 int iam_leaf_can_add(const struct iam_leaf *l,
1044 const struct iam_key *k, const struct iam_rec *r);
1046 struct iam_path *iam_leaf_path(const struct iam_leaf *leaf);
1047 struct iam_container *iam_leaf_container(const struct iam_leaf *leaf);
1048 struct iam_descr *iam_leaf_descr(const struct iam_leaf *leaf);
1049 struct iam_leaf_operations *iam_leaf_ops(const struct iam_leaf *leaf);
1052 int iam_node_read(struct iam_container *c, iam_ptr_t ptr,
1053 handle_t *h, struct buffer_head **bh);
1060 * Method called to recognize container format. Should return true iff
1061 * container @c conforms to this format. This method may do IO to read
1064 * If container is recognized, this method sets operation vectors
1065 * ->id_ops and ->id_leaf_ops in container description (c->ic_descr),
1066 * and fills other description fields.
1068 int (*if_guess)(struct iam_container *c);
1070 * Linkage into global list of container formats.
1072 struct list_head if_linkage;
1075 void iam_format_register(struct iam_format *fmt);
1076 int iam_root_limit(int rootgap, int blocksize, int size);
1078 void iam_lfix_format_init(void);
1079 void iam_lvar_format_init(void);
1080 void iam_htree_format_init(void);
1082 struct iam_private_info;
1084 void ldiskfs_iam_release(struct file *filp, struct inode *inode);
1086 int iam_uapi_ioctl(struct inode * inode, struct file * filp, unsigned int cmd,
1090 #if LDISKFS_INVARIANT_ON
1091 extern int ldiskfs_check_dir_entry(const char *, struct inode *,
1092 struct ldiskfs_dir_entry_2 *,
1093 struct buffer_head *, unsigned long);
1095 static inline int ldiskfs_check_dir_entry(const char * function,
1097 struct ldiskfs_dir_entry_2 * de,
1098 struct buffer_head * bh,
1099 unsigned long offset)
1110 * User level API. Copy exists in lustre/lustre/tests/iam_ut.c
1113 struct iam_uapi_info {
1118 char iui_fmt_name[DX_FMT_NAME_LEN];
1121 struct iam_uapi_op {
1126 struct iam_uapi_it {
1127 struct iam_uapi_op iui_op;
1131 enum iam_ioctl_cmd {
1132 IAM_IOC_INIT = _IOW('i', 1, struct iam_uapi_info),
1133 IAM_IOC_GETINFO = _IOR('i', 2, struct iam_uapi_info),
1134 IAM_IOC_INSERT = _IOR('i', 3, struct iam_uapi_op),
1135 IAM_IOC_LOOKUP = _IOWR('i', 4, struct iam_uapi_op),
1136 IAM_IOC_DELETE = _IOR('i', 5, struct iam_uapi_op),
1137 IAM_IOC_IT_START = _IOR('i', 6, struct iam_uapi_it),
1138 IAM_IOC_IT_NEXT = _IOW('i', 7, struct iam_uapi_it),
1139 IAM_IOC_IT_STOP = _IOR('i', 8, struct iam_uapi_it),
1141 IAM_IOC_POLYMORPH = _IOR('i', 9, unsigned long)
1144 /* __LINUX_LUSTRE_IAM_H__ */