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) 2011, 2015, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
32 * Top-level entry points into osd module
34 * Author: Wang Di <wangdi@clusterfs.com>
35 * Author: Nikita Danilov <nikita@clusterfs.com>
38 #ifndef __LINUX_LUSTRE_IAM_H__
39 #define __LINUX_LUSTRE_IAM_H__
41 #include <linux/module.h>
42 #include <asm/unaligned.h>
44 #include "osd_dynlocks.h"
50 #define ergo(a, b) (!(a) || (b))
51 /* logical equivalence */
52 #define equi(a, b) (!!(a) == !!(b))
56 * Maximal number of non-leaf levels in htree. In the stock ldiskfs this
60 * XXX reduced back to 2 to make per-node locking work.
62 DX_MAX_TREE_HEIGHT = 5,
64 * Scratch keys used by generic code for temporaries.
68 * [0] reserved for assertions and as a staging area for
69 * record keys immediately used for key comparisons.
71 * [1] reserved for record key, stored during iteration over
72 * node records (see dx_node_check()).
74 * [2] reserved for leaf node operations.
76 * [3] reserved for index operations.
78 * [4] reserved for path->ip_ikey_target
83 * Maximal format name length.
92 * Various debugging levels.
97 * Following macros are defined in config.h and are tunable through
98 * appropriate configure switches (indicated below).
102 * Compile basic assertions in. You want this most of the time.
104 * --{enable,disable}-ldiskfs-assert (on by default).
106 #define LDISKFS_ASSERT (1)
109 * Compile heavier correctness checks in. You want this during development
112 * --{enable,disable}-ldiskfs-correctness (off by default).
114 #define LDISKFS_CORRECTNESS (1)
117 * Compile heavy invariant checking in. You want this early during development
118 * or when chasing a bug.
120 * --{enable,disable}-ldiskfs-invariant (off by default).
122 #define LDISKFS_INVARIANT (1)
125 #if defined(LDISKFS_ASSERT)
126 #define LDISKFS_ASSERT_ON (1)
128 #define LDISKFS_ASSERT_ON (0)
131 #if defined(LDISKFS_CORRECTNESS)
132 #define LDISKFS_CORRECTNESS_ON (1)
134 #define LDISKFS_CORRECTNESS_ON (0)
137 #if defined(LDISKFS_INVARIANT)
138 #define LDISKFS_INVARIANT_ON (1)
140 #define LDISKFS_INVARIANT_ON (0)
144 #if LDISKFS_ASSERT_ON
145 #define assert(test) J_ASSERT(test)
147 #define assert(test) ((void)(test))
151 #if LDISKFS_CORRECTNESS_ON
152 #define assert_corr(test) J_ASSERT(test)
153 #define do_corr(exp) exp
155 #define assert_corr(test) do {;} while (0)
156 #define do_corr(exp) do {;} while (0)
159 #if LDISKFS_INVARIANT_ON
160 #define assert_inv(test) J_ASSERT(test)
162 #define assert_inv(test) do {;} while (0)
166 * Entry within index tree node. Consists of a key immediately followed
167 * (without padding) by a pointer to the child node.
169 * Both key and pointer are of variable size, hence incomplete type.
173 struct iam_entry_compat {
179 * Incomplete type used to refer to keys in iam container.
181 * As key size can be different from container to container, iam has to use
182 * incomplete type. Clients cast pointer to iam_key to real key type and back.
187 * Incomplete type use to refer to the records stored in iam containers.
192 * Key in index node. Possibly compressed. Fixed size.
197 * Scalar type into which certain iam_key's can be uniquely mapped. Used to
198 * support interfaces like readdir(), where iteration over index has to be
201 typedef __u32 iam_ptr_t;
204 * Index node traversed during tree lookup.
207 struct buffer_head *bh; /* buffer holding node data */
208 struct iam_entry *entries; /* array of entries */
209 struct iam_entry *at; /* target entry, found by binary search */
210 iam_ptr_t leaf; /* (logical) offset of child node found by
212 iam_ptr_t curidx; /* (logical) offset of this node. Used to
213 * per-node locking to detect concurrent
215 unsigned int at_shifted:1; /* The "at" entry has moved to next
216 * because of shrinking index node
217 * for recycling empty leaf node. */
221 * Opaque entry in the leaf node.
226 struct iam_container;
229 /* leaf node reached by tree lookup */
231 struct iam_path *il_path;
232 struct buffer_head *il_bh;
233 struct iam_lentry *il_entries;
234 struct iam_lentry *il_at;
236 * Lock on a leaf node.
238 struct dynlock_handle *il_lock;
239 iam_ptr_t il_curidx; /* logical offset of leaf node. */
244 * Return values of ->lookup() operation from struct iam_leaf_operations.
248 * lookup found a record with the key requested
250 IAM_LOOKUP_EXACT = 0,
252 * lookup positioned leaf on some record
258 IAM_LOOKUP_EMPTY = 2,
260 * lookup positioned leaf before first record
262 IAM_LOOKUP_BEFORE = 3,
264 * Found hash may have a continuation in the next leaf.
266 IAM_LOOKUP_LAST = 0x100
270 * Format-specific container operations. These are called by generic iam code.
272 struct iam_operations {
274 * Returns pointer (in the same sense as pointer in index entry) to
277 __u32 (*id_root_ptr)(struct iam_container *c);
280 * Check validity and consistency of index node.
282 int (*id_node_check)(struct iam_path *path, struct iam_frame *frame);
284 * Copy some data from node header into frame. This is called when
285 * new node is loaded into frame.
287 int (*id_node_load)(struct iam_path *path, struct iam_frame *frame);
289 * Initialize new node (stored in @bh) that is going to be added into
292 int (*id_node_init)(struct iam_container *c,
293 struct buffer_head *bh, int root);
294 int (*id_node_read)(struct iam_container *c, iam_ptr_t ptr,
295 handle_t *h, struct buffer_head **bh);
297 * Key comparison functions. Returns -1, 0, +1.
299 int (*id_ikeycmp)(const struct iam_container *c,
300 const struct iam_ikey *k1,
301 const struct iam_ikey *k2);
303 * Modify root node when tree height increases.
305 struct iam_entry *(*id_root_inc)(struct iam_container *c,
306 struct iam_path *path,
307 struct iam_frame *frame);
309 struct iam_path_descr *(*id_ipd_alloc)(const struct iam_container *c,
311 void (*id_ipd_free)(struct iam_path_descr *ipd);
315 char id_name[DX_FMT_NAME_LEN];
319 * Another format-specific operation vector, consisting of methods to access
320 * leaf nodes. This is separated from struct iam_operations, because it is
321 * assumed that there will be many formats with different format of leaf
322 * nodes, yes the same struct iam_operations.
324 struct iam_leaf_operations {
330 * initialize just loaded leaf node.
332 int (*init)(struct iam_leaf *p);
336 void (*init_new)(struct iam_container *c, struct buffer_head *bh);
340 void (*fini)(struct iam_leaf *l);
342 * returns true iff leaf is positioned at the last entry.
344 int (*at_end)(const struct iam_leaf *l);
345 /* position leaf at the first entry */
346 void (*start)(struct iam_leaf *l);
347 /* more leaf to the next entry. */
348 void (*next)(struct iam_leaf *l);
350 * return key of current leaf record. This method may return
351 * either pointer to the key stored in node, or copy key into
352 * @k buffer supplied by caller and return pointer to this
353 * buffer. The latter approach is used when keys in nodes are
354 * not stored in plain form (e.g., htree doesn't store keys at
357 * Caller should assume that returned pointer is only valid
358 * while leaf node is pinned and locked.
360 struct iam_ikey *(*ikey)(const struct iam_leaf *l, struct iam_ikey *k);
361 struct iam_key *(*key)(const struct iam_leaf *l);
362 /* return pointer to entry body. Pointer is valid while
363 corresponding leaf node is locked and pinned. */
364 struct iam_rec *(*rec)(const struct iam_leaf *l);
366 void (*key_set)(struct iam_leaf *l, const struct iam_key *k);
367 void (*rec_set)(struct iam_leaf *l, const struct iam_rec *r);
368 void (*rec_get)(const struct iam_leaf *l, struct iam_rec *r);
370 int (*key_cmp)(const struct iam_leaf *l, const struct iam_key *k);
371 int (*key_eq)(const struct iam_leaf *l, const struct iam_key *k);
373 int (*rec_eq)(const struct iam_leaf *l, const struct iam_rec *r);
375 int (*key_size)(const struct iam_leaf *l);
377 * Search leaf @l for a record with key @k or for a place
378 * where such record is to be inserted.
380 * Scratch keys from @path can be used.
382 int (*lookup)(struct iam_leaf *l, const struct iam_key *k);
383 int (*ilookup)(struct iam_leaf *l, const struct iam_ikey *ik);
385 int (*can_add)(const struct iam_leaf *l,
386 const struct iam_key *k, const struct iam_rec *r);
390 void (*rec_add)(struct iam_leaf *l,
391 const struct iam_key *k, const struct iam_rec *r);
393 * remove rec for a leaf
395 void (*rec_del)(struct iam_leaf *l, int shift);
397 * split leaf node, moving some entries into @bh (the latter currently
398 * is assumed to be empty).
400 void (*split)(struct iam_leaf *l, struct buffer_head **bh,
405 int (*leaf_empty)(struct iam_leaf *l);
409 * Parameters, describing a flavor of iam container.
413 * Size of a key in this container, in bytes.
417 * Size of a key in index nodes, in bytes.
421 * Size of a pointer to the next level (stored in index nodes), in
426 * Size of a record (stored in leaf nodes), in bytes.
430 * Size of unused (by iam) space at the beginning of every non-root
431 * node, in bytes. Used for compatibility with ldiskfs.
435 * Size of unused (by iam) space at the beginning of root node, in
436 * bytes. Used for compatibility with ldiskfs.
440 const struct iam_operations *id_ops;
441 const struct iam_leaf_operations *id_leaf_ops;
445 IAM_IDLE_HEADER_MAGIC = 0x7903,
449 * Header structure to record idle blocks.
451 struct iam_idle_head {
453 __le16 iih_count; /* how many idle blocks in this head */
454 __le32 iih_next; /* next head for idle blocks */
459 * An instance of iam container.
461 struct iam_container {
463 * Underlying flat file. IO against this object is issued to
466 struct inode *ic_object;
470 struct buffer_head *ic_root_bh;
474 struct iam_descr *ic_descr;
476 * read-write lock protecting index consistency.
478 struct rw_semaphore ic_sem;
479 struct dynlock ic_tree_lock;
480 /* Protect ic_idle_bh */
481 struct mutex ic_idle_mutex;
485 struct buffer_head *ic_idle_bh;
486 unsigned int ic_idle_failed:1; /* Idle block mechanism failed */
490 * description-specific part of iam_path. This is usually embedded into larger
493 struct iam_path_descr {
495 * Scratch-pad area for temporary keys.
497 struct iam_ikey *ipd_key_scratch[DX_SCRATCH_KEYS];
501 * Structure to keep track of a path drilled through htree.
507 struct iam_container *ip_container;
509 * Number of index levels minus one.
513 * Nodes that top-to-bottom traversal passed through.
515 struct iam_frame ip_frames[DX_MAX_TREE_HEIGHT];
517 * Last filled frame in ->ip_frames. Refers to the 'twig' node (one
518 * immediately above leaf).
520 struct iam_frame *ip_frame;
522 * Leaf node: a child of ->ip_frame.
524 struct iam_leaf ip_leaf;
528 const struct iam_key *ip_key_target;
529 const struct iam_ikey *ip_ikey_target;
531 * Description-specific data.
533 struct iam_path_descr *ip_data;
536 struct ldiskfs_dx_hash_info;
539 * Helper structure for legacy htrees.
541 struct iam_path_compat {
542 struct iam_path ipc_path;
543 struct iam_container ipc_container;
544 __u32 ipc_scratch[DX_SCRATCH_KEYS];
545 struct ldiskfs_dx_hash_info *ipc_hinfo;
546 struct qstr *ipc_qstr;
547 struct iam_path_descr ipc_descr;
548 struct ldiskfs_dx_hash_info ipc_hinfo_area;
551 #define const_max(p, q) ((p > q) ? p : q)
554 DX_MAX_IKEY_SIZE = 32, /* be generous */
556 * Hack to avoid dynamic allocation and freeing of ipd.
558 DX_IPD_MAX_SIZE = const_max(sizeof(struct iam_path_compat),
559 DX_MAX_IKEY_SIZE * DX_SCRATCH_KEYS +
560 sizeof(struct iam_path_descr))
564 * iam cursor (iterator) api.
568 * States of iterator state machine.
573 /* iterator is above particular record in the container */
575 /* iterator is positioned before record */
580 * Flags controlling iterator functionality.
584 * this iterator will move (iam_it_next() will be called on it)
586 IAM_IT_MOVE = BIT(0),
588 * tree can be updated through this iterator.
590 IAM_IT_WRITE = BIT(1)
596 * Immediately after call to iam_it_init() iterator is in "detached"
597 * (IAM_IT_DETACHED) state: it is associated with given parent container, but
598 * doesn't point to any particular record in this container.
600 * After successful call to iam_it_get() and until corresponding call to
601 * iam_it_put() iterator is in one of "active" states: IAM_IT_ATTACHED or
604 * Active iterator can move through records in a container (provided
605 * IAM_IT_MOVE permission) in a key order, can get record and key values as it
606 * passes over them, and can modify container (provided IAM_IT_WRITE
609 * Iteration may reach the end of container, at which point iterator switches
610 * into IAM_IT_DETACHED state.
612 * Concurrency: iterators are supposed to be local to thread. Interfaces below
613 * do no internal serialization of access to the iterator fields.
615 * When in non-detached state, iterator keeps some container nodes pinned in
616 * memory and locked (that locking may be implemented at the container
617 * granularity though). In particular, clients may assume that pointers to
618 * records and keys obtained through iterator interface as valid until
619 * iterator is detached (except that they may be invalidated by sub-sequent
620 * operations done through the same iterator).
623 struct iam_iterator {
625 * iterator flags, taken from enum iam_it_flags.
628 enum iam_it_state ii_state;
630 * path to the record. Valid in IAM_IT_ATTACHED, and IAM_IT_SKEWED
633 struct iam_path ii_path;
636 void iam_path_init(struct iam_path *path, struct iam_container *c,
637 struct iam_path_descr *pd);
638 void iam_path_fini(struct iam_path *path);
639 void iam_path_release(struct iam_path *path);
641 void iam_path_compat_init(struct iam_path_compat *path, struct inode *inode);
642 void iam_path_compat_fini(struct iam_path_compat *path);
644 struct iam_path_descr *iam_ipd_alloc(void *area, int keysize);
645 void iam_ipd_free(struct iam_path_descr *ipd);
647 int iam_it_init(struct iam_iterator *it, struct iam_container *c, __u32 flags,
648 struct iam_path_descr *pd);
649 void iam_it_fini(struct iam_iterator *it);
650 int iam_it_get(struct iam_iterator *it, const struct iam_key *k);
651 int iam_it_get_at(struct iam_iterator *it, const struct iam_key *k);
652 void iam_it_dup(struct iam_iterator *dst, const struct iam_iterator *src);
653 void iam_it_put(struct iam_iterator *it);
654 int iam_it_next(struct iam_iterator *it);
655 struct iam_rec *iam_it_rec_get(const struct iam_iterator *it);
656 int iam_it_rec_set(handle_t *h,
657 struct iam_iterator *it, const struct iam_rec *r);
658 struct iam_key *iam_it_key_get(const struct iam_iterator *it);
659 int iam_it_key_size(const struct iam_iterator *it);
660 int iam_it_rec_insert(handle_t *h, struct iam_iterator *it,
661 const struct iam_key *k, const struct iam_rec *r);
662 int iam_it_rec_delete(handle_t *h, struct iam_iterator *it);
664 typedef __u64 iam_pos_t;
666 iam_pos_t iam_it_store(const struct iam_iterator *it);
667 int iam_it_load(struct iam_iterator *it, iam_pos_t pos);
669 int iam_lookup(struct iam_container *c, const struct iam_key *k,
670 struct iam_rec *r, struct iam_path_descr *pd);
671 int iam_delete(handle_t *h, struct iam_container *c, const struct iam_key *k,
672 struct iam_path_descr *pd);
673 int iam_update(handle_t *h, struct iam_container *c, const struct iam_key *k,
674 const struct iam_rec *r, struct iam_path_descr *pd);
675 int iam_insert(handle_t *handle, struct iam_container *c,
676 const struct iam_key *k,
677 const struct iam_rec *r, struct iam_path_descr *pd);
679 * Initialize container @c.
681 int iam_container_init(struct iam_container *c,
682 struct iam_descr *descr, struct inode *inode);
684 * Finalize container @c, release all resources.
686 void iam_container_fini(struct iam_container *c);
689 * Determine container format.
691 int iam_container_setup(struct iam_container *c);
693 static inline struct iam_descr *iam_container_descr(struct iam_container *c)
698 static inline struct iam_descr *iam_path_descr(const struct iam_path *p)
700 return p->ip_container->ic_descr;
703 static inline struct inode *iam_path_obj(struct iam_path *p)
705 return p->ip_container->ic_object;
708 static inline void iam_ikeycpy(const struct iam_container *c,
709 struct iam_ikey *k1, const struct iam_ikey *k2)
711 memcpy(k1, k2, c->ic_descr->id_ikey_size);
714 static inline size_t iam_entry_size(struct iam_path *p)
716 return iam_path_descr(p)->id_ikey_size + iam_path_descr(p)->id_ptr_size;
719 static inline struct iam_entry *iam_entry_shift(struct iam_path *p,
720 struct iam_entry *entry,
724 return e + shift * iam_entry_size(p);
727 static inline struct iam_ikey *dx_get_ikey(struct iam_path *p,
728 struct iam_entry *entry,
729 struct iam_ikey *key)
731 return memcpy(key, entry, iam_path_descr(p)->id_ikey_size);
734 static inline struct iam_ikey *iam_ikey_at(struct iam_path *p,
735 struct iam_entry *entry)
737 return (struct iam_ikey *)entry;
740 static inline ptrdiff_t iam_entry_diff(struct iam_path *p,
741 struct iam_entry *e1,
742 struct iam_entry *e2)
746 diff = (void *)e1 - (void *)e2;
747 assert_corr(diff / iam_entry_size(p) * iam_entry_size(p) == diff);
748 return diff / iam_entry_size(p);
752 * Helper for the frequent case, where key was already placed into @k1 by
755 static inline void iam_ikeycpy0(const struct iam_container *c,
756 struct iam_ikey *k1, const struct iam_ikey *k2)
759 iam_ikeycpy(c, k1, k2);
762 static inline int iam_ikeycmp(const struct iam_container *c,
763 const struct iam_ikey *k1,
764 const struct iam_ikey *k2)
766 return c->ic_descr->id_ops->id_ikeycmp(c, k1, k2);
769 static inline void *iam_entry_off(struct iam_entry *entry, size_t off)
771 return (void *)((char *)entry + off);
778 static inline struct iam_path *iam_leaf_path(const struct iam_leaf *leaf)
780 return leaf->il_path;
783 static inline struct iam_container *
784 iam_leaf_container(const struct iam_leaf *leaf)
786 return iam_leaf_path(leaf)->ip_container;
789 static inline struct iam_descr *iam_leaf_descr(const struct iam_leaf *leaf)
791 return iam_leaf_container(leaf)->ic_descr;
794 static inline const struct iam_leaf_operations *
795 iam_leaf_ops(const struct iam_leaf *leaf)
797 return iam_leaf_descr(leaf)->id_leaf_ops;
800 static inline void iam_reccpy(const struct iam_leaf *leaf,
801 struct iam_rec *rec_dst)
803 iam_leaf_ops(leaf)->rec_get(leaf, rec_dst);
806 /*XXX These stuff put here, just because they are used by iam.c */
807 static inline unsigned dx_get_block(struct iam_path *p, struct iam_entry *entry)
811 addr = iam_entry_off(entry, iam_path_descr(p)->id_ikey_size);
812 return le32_to_cpu(get_unaligned(addr));
815 static inline void dx_set_block(struct iam_path *p,
816 struct iam_entry *entry, unsigned value)
820 addr = iam_entry_off(entry, iam_path_descr(p)->id_ikey_size);
821 put_unaligned(cpu_to_le32(value), addr);
824 static inline void dx_set_ikey(struct iam_path *p, struct iam_entry *entry,
825 const struct iam_ikey *key)
827 iam_ikeycpy(p->ip_container, iam_entry_off(entry, 0), key);
843 struct dx_countlimit {
849 * dx_root_info is laid out so that if it should somehow get overlaid by a
850 * dirent the two low bits of the hash version will be zero. Therefore, the
851 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
855 struct fake_dirent dot;
857 struct fake_dirent dotdot;
861 __le32 reserved_zero;
863 u8 info_length; /* 8 */
868 struct {} entries[0];
873 struct fake_dirent fake;
874 struct {} entries[0];
878 static inline unsigned dx_get_count(struct iam_entry *entries)
880 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
883 static inline unsigned dx_get_limit(struct iam_entry *entries)
885 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
888 static inline void dx_set_count(struct iam_entry *entries, unsigned value)
890 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
893 static inline unsigned dx_node_limit(struct iam_path *p)
895 struct iam_descr *param = iam_path_descr(p);
896 unsigned entry_space = iam_path_obj(p)->i_sb->s_blocksize -
898 return entry_space / (param->id_ikey_size + param->id_ptr_size);
901 static inline unsigned dx_root_limit(struct iam_path *p)
903 struct iam_descr *param = iam_path_descr(p);
904 unsigned limit = iam_path_obj(p)->i_sb->s_blocksize -
906 limit /= (param->id_ikey_size + param->id_ptr_size);
907 if (limit == dx_node_limit(p))
913 static inline struct iam_entry *dx_get_entries(struct iam_path *path,
914 void *data, int root)
916 struct iam_descr *param = iam_path_descr(path);
917 return data + (root ? param->id_root_gap : param->id_node_gap);
921 static inline struct iam_entry *dx_node_get_entries(struct iam_path *path,
922 struct iam_frame *frame)
924 return dx_get_entries(path,
925 frame->bh->b_data, frame == path->ip_frames);
928 static inline struct iam_ikey *iam_path_ikey(const struct iam_path *path,
931 LASSERT(0 <= nr && nr < ARRAY_SIZE(path->ip_data->ipd_key_scratch));
932 return path->ip_data->ipd_key_scratch[nr];
935 static inline int iam_leaf_is_locked(const struct iam_leaf *leaf)
939 result = dynlock_is_locked(&iam_leaf_container(leaf)->ic_tree_lock,
946 static inline int iam_frame_is_locked(struct iam_path *path,
947 const struct iam_frame *frame)
951 result = dynlock_is_locked(&path->ip_container->ic_tree_lock,
958 int dx_lookup_lock(struct iam_path *path,
959 struct dynlock_handle **dl, enum dynlock_type lt);
961 void dx_insert_block(struct iam_path *path, struct iam_frame *frame,
962 u32 hash, u32 block);
963 int dx_index_is_compat(struct iam_path *path);
965 int ldiskfs_htree_next_block(struct inode *dir, __u32 hash,
966 struct iam_path *path, __u32 *start_hash);
968 int split_index_node(handle_t *handle, struct iam_path *path,
969 struct dynlock_handle **lh);
970 struct ldiskfs_dir_entry_2 *split_entry(struct inode *dir,
971 struct ldiskfs_dir_entry_2 *de,
972 unsigned long ino, mode_t mode,
973 const char *name, int namelen);
974 struct ldiskfs_dir_entry_2 *find_insertion_point(struct inode *dir,
975 struct buffer_head *bh,
976 const char *name, int namelen);
977 struct ldiskfs_dir_entry_2 *move_entries(struct inode *dir,
978 struct ldiskfs_dx_hash_info *hinfo,
979 struct buffer_head **bh1,
980 struct buffer_head **bh2,
983 extern struct iam_descr iam_htree_compat_param;
985 struct dynlock_handle *dx_lock_htree(struct inode *dir, unsigned long value,
986 enum dynlock_type lt);
987 void dx_unlock_htree(struct inode *dir, struct dynlock_handle *lh);
992 void iam_container_write_lock(struct iam_container *c);
993 void iam_container_write_unlock(struct iam_container *c);
995 void iam_container_read_lock(struct iam_container *c);
996 void iam_container_read_unlock(struct iam_container *c);
998 int iam_index_next(struct iam_container *c, struct iam_path *p);
999 int iam_read_leaf(struct iam_path *p);
1001 int iam_node_read(struct iam_container *c, iam_ptr_t ptr,
1002 handle_t *handle, struct buffer_head **bh);
1003 int iam_lvar_create(struct inode *obj,
1004 int keysize, int ptrsize, int recsize, handle_t *handle);
1007 #define swap(x, y) do { typeof(x) z = x; x = y; y = z; } while (0)
1011 #define dxtrace(command) command
1013 #define dxtrace(command)
1016 #define BH_DXLock (BH_BITMAP_UPTODATE + 1)
1017 #define DX_DEBUG (0)
1019 static struct iam_lock_stats {
1020 unsigned dls_bh_lock;
1021 unsigned dls_bh_busy;
1022 unsigned dls_bh_again;
1023 unsigned dls_bh_full_again;
1024 } iam_lock_stats = { 0, };
1025 #define DX_DEVAL(x) x
1030 static inline void iam_lock_bh(struct buffer_head volatile *bh)
1032 DX_DEVAL(iam_lock_stats.dls_bh_lock++);
1034 while (test_and_set_bit_lock(BH_DXLock, &bh->b_state)) {
1035 DX_DEVAL(iam_lock_stats.dls_bh_busy++);
1036 while (test_bit(BH_DXLock, &bh->b_state))
1042 static inline void iam_unlock_bh(struct buffer_head *bh)
1045 clear_bit_unlock(BH_DXLock, &bh->b_state);
1050 void iam_insert_key(struct iam_path *path, struct iam_frame *frame,
1051 const struct iam_ikey *key, iam_ptr_t ptr);
1053 void iam_insert_key_lock(struct iam_path *path, struct iam_frame *frame,
1054 const struct iam_ikey *key, iam_ptr_t ptr);
1057 int iam_leaf_at_end(const struct iam_leaf *l);
1058 void iam_leaf_next(struct iam_leaf *folio);
1059 int iam_leaf_can_add(const struct iam_leaf *l,
1060 const struct iam_key *k, const struct iam_rec *r);
1062 struct iam_path *iam_leaf_path(const struct iam_leaf *leaf);
1063 struct iam_container *iam_leaf_container(const struct iam_leaf *leaf);
1064 struct iam_descr *iam_leaf_descr(const struct iam_leaf *leaf);
1065 const struct iam_leaf_operations *iam_leaf_ops(const struct iam_leaf *leaf);
1068 int iam_node_read(struct iam_container *c, iam_ptr_t ptr,
1069 handle_t *h, struct buffer_head **bh);
1071 int iam_root_limit(int rootgap, int blocksize, int size);
1073 void iam_lfix_format_init(void);
1074 void iam_lvar_format_init(void);
1075 int iam_lfix_guess(struct iam_container *c);
1076 int iam_lvar_guess(struct iam_container *c);
1077 void iam_htree_format_init(void);
1079 int iam_lfix_create(struct inode *obj,
1080 int keysize, int ptrsize, int recsize, handle_t *handle);
1081 struct iam_private_info;
1083 void ldiskfs_iam_release(struct file *filp, struct inode *inode);
1085 int iam_uapi_ioctl(struct inode * inode, struct file * filp, unsigned int cmd,
1089 #if LDISKFS_INVARIANT_ON
1090 extern int ldiskfs_check_dir_entry(const char *, struct inode *,
1091 struct ldiskfs_dir_entry_2 *,
1092 struct buffer_head *, unsigned long);
1093 extern int dx_node_check(struct iam_path *p, struct iam_frame *f);
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)
1109 * User level API. Copy exists in lustre/lustre/tests/iam_ut.c
1112 struct iam_uapi_info {
1117 char iui_fmt_name[DX_FMT_NAME_LEN];
1120 struct iam_uapi_op {
1125 struct iam_uapi_it {
1126 struct iam_uapi_op iui_op;
1130 enum iam_ioctl_cmd {
1131 IAM_IOC_INIT = _IOW('i', 1, struct iam_uapi_info),
1132 IAM_IOC_GETINFO = _IOR('i', 2, struct iam_uapi_info),
1133 IAM_IOC_INSERT = _IOR('i', 3, struct iam_uapi_op),
1134 IAM_IOC_LOOKUP = _IOWR('i', 4, struct iam_uapi_op),
1135 IAM_IOC_DELETE = _IOR('i', 5, struct iam_uapi_op),
1136 IAM_IOC_IT_START = _IOR('i', 6, struct iam_uapi_it),
1137 IAM_IOC_IT_NEXT = _IOW('i', 7, struct iam_uapi_it),
1138 IAM_IOC_IT_STOP = _IOR('i', 8, struct iam_uapi_it),
1140 IAM_IOC_POLYMORPH = _IOR('i', 9, unsigned long)
1143 /* __LINUX_LUSTRE_IAM_H__ */