#define _NODEMAP_INTERNAL_H
#include <lustre_nodemap.h>
+#include <interval_tree.h>
#define MODULE_STRING "nodemap"
/* nodemap root proc directory under fs/lustre */
extern struct proc_dir_entry *proc_lustre_nodemap_root;
/* flag if nodemap is active */
-extern bool nodemap_idmap_active;
+extern bool nodemap_active;
+
+struct lu_nid_range {
+ /* unique id set my mgs */
+ unsigned int rn_id;
+ /* lu_nodemap containing this range */
+ struct lu_nodemap *rn_nodemap;
+ /* list for nodemap */
+ struct list_head rn_list;
+ /* nid interval tree */
+ struct interval_node rn_node;
+};
+
+struct lu_idmap {
+ /* uid/gid of client */
+ __u32 id_client;
+ /* uid/gid on filesystem */
+ __u32 id_fs;
+ /* tree mapping client ids to filesystem ids */
+ struct rb_node id_client_to_fs;
+ /* tree mappung filesystem to client */
+ struct rb_node id_fs_to_client;
+};
int nodemap_procfs_init(void);
int lprocfs_nodemap_register(const char *name, bool is_default_nodemap,
struct lu_nodemap *nodemap);
+struct lu_nid_range *range_create(lnet_nid_t min, lnet_nid_t max,
+ struct lu_nodemap *nodemap);
+void range_destroy(struct lu_nid_range *range);
+int range_insert(struct lu_nid_range *data);
+void range_delete(struct lu_nid_range *data);
+struct lu_nid_range *range_search(lnet_nid_t nid);
+struct lu_nid_range *range_find(lnet_nid_t start_nid, lnet_nid_t end_nid);
+int range_parse_nidstring(char *range_string, lnet_nid_t *start_nid,
+ lnet_nid_t *end_nid);
+void range_init_tree(void);
+struct lu_idmap *idmap_create(__u32 client_id, __u32 fs_id);
+void idmap_insert(enum nodemap_id_type id_type, struct lu_idmap *idmap,
+ struct lu_nodemap *nodemap);
+void idmap_delete(enum nodemap_id_type id_type, struct lu_idmap *idmap,
+ struct lu_nodemap *nodemap);
+void idmap_delete_tree(struct lu_nodemap *nodemap);
+struct lu_idmap *idmap_search(struct lu_nodemap *nodemap,
+ enum nodemap_tree_type,
+ enum nodemap_id_type id_type,
+ __u32 id);
int nodemap_cleanup_nodemaps(void);
+
+struct rb_node *nm_rb_next_postorder(const struct rb_node *node);
+struct rb_node *nm_rb_first_postorder(const struct rb_root *root);
+
+#define nm_rbtree_postorder_for_each_entry_safe(pos, n, \
+ root, field) \
+ for (pos = nm_rb_first_postorder(root) ? \
+ rb_entry(nm_rb_first_postorder(root), typeof(*pos), \
+ field) : NULL, \
+ n = (pos && nm_rb_next_postorder(&pos->field)) ? \
+ rb_entry(nm_rb_next_postorder(&pos->field), \
+ typeof(*pos), field) : NULL; \
+ pos != NULL; \
+ pos = n, \
+ n = (pos && nm_rb_next_postorder(&pos->field)) ? \
+ rb_entry(nm_rb_next_postorder(&pos->field), \
+ typeof(*pos), field) : NULL)
#endif /* _NODEMAP_INTERNAL_H */