| /fs/hfs/ |
| D | bnode.c | 19 bool is_bnode_offset_valid(struct hfs_bnode *node, int off) in is_bnode_offset_valid()
35 int check_and_correct_requested_length(struct hfs_bnode *node, int off, int len) in check_and_correct_requested_length()
60 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read()
98 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16()
106 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8()
114 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key()
135 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_write()
160 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) in hfs_bnode_write_u16()
167 void hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data) in hfs_bnode_write_u8()
173 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len) in hfs_bnode_clear()
[all …]
|
| D | brec.c | 19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen()
68 struct hfs_bnode *node, *new_node; in hfs_brec_insert() local
180 struct hfs_bnode *node, *parent; in hfs_brec_remove() local
234 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
355 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent() local
460 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height() local
|
| D | btree.c | 176 struct hfs_bnode *node; in hfs_btree_close() local
200 struct hfs_bnode *node; in hfs_btree_write() local
229 struct hfs_bnode *node; in hfs_bmap_new_bmap() local
287 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
359 void hfs_bmap_free(struct hfs_bnode *node) in hfs_bmap_free()
|
| /fs/hfsplus/ |
| D | bnode.c | 22 bool is_bnode_offset_valid(struct hfs_bnode *node, int off) in is_bnode_offset_valid()
38 int check_and_correct_requested_length(struct hfs_bnode *node, int off, int len) in check_and_correct_requested_length()
64 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read()
97 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16()
105 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8()
113 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key()
135 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_write()
170 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) in hfs_bnode_write_u16()
177 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len) in hfs_bnode_clear()
269 void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len) in hfs_bnode_move()
[all …]
|
| D | brec.c | 20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff()
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen()
66 struct hfs_bnode *node, *new_node; in hfs_brec_insert() local
182 struct hfs_bnode *node, *parent; in hfs_brec_remove() local
238 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
359 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent() local
464 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height() local
|
| D | btree.c | 261 struct hfs_bnode *node; in hfs_btree_close() local
286 struct hfs_bnode *node; in hfs_btree_write() local
316 struct hfs_bnode *node; in hfs_bmap_new_bmap() local
376 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
449 void hfs_bmap_free(struct hfs_bnode *node) in hfs_bmap_free()
|
| /fs/dlm/ |
| D | midcomms.c | 200 struct midcomms_node *node; member
254 const char *dlm_midcomms_state(struct midcomms_node *node) in dlm_midcomms_state()
259 unsigned long dlm_midcomms_flags(struct midcomms_node *node) in dlm_midcomms_flags()
264 int dlm_midcomms_send_queue_cnt(struct midcomms_node *node) in dlm_midcomms_send_queue_cnt()
269 uint32_t dlm_midcomms_version(struct midcomms_node *node) in dlm_midcomms_version()
276 struct midcomms_node *node; in __find_node() local
294 static void dlm_mhandle_delete(struct midcomms_node *node, in dlm_mhandle_delete()
302 static void dlm_send_queue_flush(struct midcomms_node *node) in dlm_send_queue_flush()
317 static void midcomms_node_reset(struct midcomms_node *node) in midcomms_node_reset()
340 struct midcomms_node *node; in dlm_midcomms_addr() local
[all …]
|
| /fs/ocfs2/cluster/ |
| D | quorum.c | 162 static void o2quo_set_hold(struct o2quo_state *qs, u8 node) in o2quo_set_hold()
174 static void o2quo_clear_hold(struct o2quo_state *qs, u8 node) in o2quo_clear_hold()
195 void o2quo_hb_up(u8 node) in o2quo_hb_up()
219 void o2quo_hb_down(u8 node) in o2quo_hb_down()
244 void o2quo_hb_still_up(u8 node) in o2quo_hb_still_up()
263 void o2quo_conn_up(u8 node) in o2quo_conn_up()
289 void o2quo_conn_err(u8 node) in o2quo_conn_err()
|
| D | nodemanager.c | 32 struct o2nm_node *node = NULL; in o2nm_get_node_by_num() local
71 struct o2nm_node *node, *ret = NULL; in o2nm_node_ip_tree_lookup() local
101 struct o2nm_node *node = NULL; in o2nm_get_node_by_ip() local
118 void o2nm_node_put(struct o2nm_node *node) in o2nm_node_put()
124 void o2nm_node_get(struct o2nm_node *node) in o2nm_node_get()
158 struct o2nm_node *node = to_o2nm_node(item); in o2nm_node_release() local
167 static struct o2nm_cluster *to_o2nm_cluster_from_node(struct o2nm_node *node) in to_o2nm_cluster_from_node()
186 struct o2nm_node *node = to_o2nm_node(item); in o2nm_node_num_store() local
241 struct o2nm_node *node = to_o2nm_node(item); in o2nm_node_ipv4_port_store() local
270 struct o2nm_node *node = to_o2nm_node(item); in o2nm_node_ipv4_address_store() local
[all …]
|
| /fs/nilfs2/ |
| D | btree.c | 74 static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node) in nilfs_btree_node_get_flags()
80 nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags) in nilfs_btree_node_set_flags()
85 static int nilfs_btree_node_root(const struct nilfs_btree_node *node) in nilfs_btree_node_root()
90 static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node) in nilfs_btree_node_get_level()
96 nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) in nilfs_btree_node_set_level()
101 static int nilfs_btree_node_get_nchildren(const struct nilfs_btree_node *node) in nilfs_btree_node_get_nchildren()
107 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren) in nilfs_btree_node_set_nchildren()
123 nilfs_btree_node_dkeys(const struct nilfs_btree_node *node) in nilfs_btree_node_dkeys()
131 nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax) in nilfs_btree_node_dptrs()
137 nilfs_btree_node_get_key(const struct nilfs_btree_node *node, int index) in nilfs_btree_node_get_key()
[all …]
|
| /fs/btrfs/ |
| D | delayed-inode.c | 72 struct btrfs_delayed_node *node; in btrfs_get_delayed_node() local
126 struct btrfs_delayed_node *node; in btrfs_get_or_create_delayed_node() local
176 struct btrfs_delayed_node *node, in btrfs_queue_delayed_node()
197 struct btrfs_delayed_node *node) in btrfs_dequeue_delayed_node()
215 struct btrfs_delayed_node *node = NULL; in btrfs_first_delayed_node() local
231 struct btrfs_delayed_node *node) in btrfs_next_delayed_node()
288 static inline void btrfs_release_delayed_node(struct btrfs_delayed_node *node) in btrfs_release_delayed_node()
297 struct btrfs_delayed_node *node = NULL; in btrfs_first_prepared_delayed_node() local
314 struct btrfs_delayed_node *node) in btrfs_release_prepared_delayed_node()
320 struct btrfs_delayed_node *node, in btrfs_alloc_delayed_item()
[all …]
|
| D | ulist.c | 66 struct ulist_node *node; in ulist_release() local
149 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase()
210 struct ulist_node *node; in ulist_add_merge() local
252 struct ulist_node *node; in ulist_del() local
286 struct ulist_node *node; in ulist_next() local
|
| D | ordered-data.c | 37 struct rb_node *node) in tree_insert()
220 struct rb_node *node; in insert_ordered_extent() local
472 struct rb_node *node; in btrfs_mark_ordered_io_finished() local
564 struct rb_node *node; in btrfs_dec_test_ordered_pending() local
646 struct rb_node *node; in btrfs_remove_ordered_extent() local
954 struct rb_node *node; in btrfs_lookup_ordered_extent() local
981 struct rb_node *node; in btrfs_lookup_ordered_range() local
1050 struct rb_node *node; in btrfs_lookup_first_ordered_extent() local
1078 struct rb_node *node; in btrfs_lookup_first_ordered_range() local
1225 struct rb_node *node; in btrfs_split_ordered_extent() local
|
| D | misc.h | 71 struct rb_node *node = root->rb_node; in rb_simple_search() local
99 struct rb_node *node = root->rb_node, *ret = NULL; in rb_simple_search_first() local
123 struct rb_node *node) in rb_simple_insert()
|
| D | relocation.c | 173 struct btrfs_backref_node *node) in mark_block_processed()
191 struct btrfs_backref_node *node, in walk_up_backref()
298 struct mapping_node *node; in find_reloc_root() local
326 struct btrfs_backref_node *node) in handle_useless_nodes()
410 struct btrfs_backref_node *node = NULL; in build_backref_tree() local
484 struct btrfs_backref_node *node = NULL; in clone_backref_node() local
565 struct mapping_node *node; in __add_reloc_root() local
598 struct mapping_node *node = NULL; in __del_reloc_root() local
642 struct mapping_node *node = NULL; in __update_reloc_root() local
2072 struct btrfs_backref_node *node, in select_reloc_root()
[all …]
|
| D | delayed-ref.c | 318 struct rb_node *node) in htree_insert()
353 struct rb_node *node = &ins->ref_node; in tree_insert() local
476 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref() local
521 struct rb_node *node; in btrfs_merge_delayed_refs() local
577 struct rb_node *node; in btrfs_select_ref_head() local
1006 struct btrfs_delayed_ref_node *node; in add_delayed_ref() local
1210 struct rb_node *node; in btrfs_find_delayed_tree_ref() local
|
| /fs/ubifs/ |
| D | auth.c | 28 int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_calc_hash()
62 int ubifs_prepare_auth_node(struct ubifs_info *c, void *node, in ubifs_prepare_auth_node()
136 void ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, in ubifs_bad_hash()
162 int __ubifs_node_check_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_check_hash()
387 static int ubifs_node_calc_hmac(const struct ubifs_info *c, const void *node, in ubifs_node_calc_hmac()
431 int __ubifs_node_insert_hmac(const struct ubifs_info *c, void *node, int len, in __ubifs_node_insert_hmac()
447 int __ubifs_node_verify_hmac(const struct ubifs_info *c, const void *node, in __ubifs_node_verify_hmac()
|
| /fs/befs/ |
| D | btree.c | 192 struct befs_btree_node *node, befs_off_t node_off) in befs_bt_read_node()
330 befs_find_key(struct super_block *sb, struct befs_btree_node *node, in befs_find_key()
599 befs_leafnode(struct befs_btree_node *node) in befs_leafnode()
622 befs_bt_keylen_index(struct befs_btree_node *node) in befs_bt_keylen_index()
643 befs_bt_valarray(struct befs_btree_node *node) in befs_bt_valarray()
659 befs_bt_keydata(struct befs_btree_node *node) in befs_bt_keydata()
675 befs_bt_get_key(struct super_block *sb, struct befs_btree_node *node, in befs_bt_get_key()
|
| /fs/xfs/libxfs/ |
| D | xfs_iext_tree.c | 161 struct xfs_iext_node *node = ifp->if_data; in xfs_iext_find_first_leaf() local
179 struct xfs_iext_node *node = ifp->if_data; in xfs_iext_find_last_leaf() local
277 struct xfs_iext_node *node, in xfs_iext_key_cmp()
309 struct xfs_iext_node *node = ifp->if_data; in xfs_iext_find_level() local
330 struct xfs_iext_node *node, in xfs_iext_node_pos()
345 struct xfs_iext_node *node, in xfs_iext_node_insert_pos()
360 struct xfs_iext_node *node, in xfs_iext_node_nr_entries()
408 struct xfs_iext_node *node = xfs_iext_alloc_node(NODE_SIZE); in xfs_iext_grow() local
440 struct xfs_iext_node *node = ifp->if_data; in xfs_iext_update_node() local
463 struct xfs_iext_node *node = *nodep; in xfs_iext_split_node() local
[all …]
|
| /fs/ocfs2/dlm/ |
| D | dlmdomain.c | 488 unsigned int node; in dlm_begin_exit_domain_handler() local
531 int node = -1, num = 0; in __dlm_print_nodes() local
548 unsigned int node; in dlm_exit_domain_handler() local
575 unsigned int node) in dlm_send_one_domain_exit()
598 int node = -1; in dlm_begin_exit_domain() local
627 int node, clear_node, status; in dlm_leave_domain() local
726 static int dlm_query_join_proto_check(char *proto_type, int node, in dlm_query_join_proto_check()
1217 struct o2nm_node *node; in dlm_send_nodeinfo() local
1350 unsigned int node) in dlm_send_one_join_cancel()
1380 int node; in dlm_send_join_cancels() local
[all …]
|
| /fs/unicode/ |
| D | mkutf8data.c | 361 struct node { struct
366 struct node *parent; argument
371 unsigned char leftnode; argument
372 unsigned char rightnode; argument
382 struct node *node; in lookup() argument
419 struct node *node; in tree_walk() local
494 struct node *node; in alloc_node() local
535 struct node *node; in insert() local
656 struct node *node; in prune() local
817 struct node *node; in mark_nodes() local
[all …]
|
| /fs/incfs/ |
| D | sysfs.c | 145 struct incfs_sysfs_node *node = container_of(kobj, in incfs_sysfs_release() local
163 struct incfs_sysfs_node *node = NULL; in incfs_add_sysfs_node() local
196 void incfs_free_sysfs_node(struct incfs_sysfs_node *node) in incfs_free_sysfs_node()
|
| /fs/ext4/ |
| D | extents_status.c | 182 struct rb_node *node; in ext4_es_print_tree() local
214 struct rb_node *node = root->rb_node; in __es_tree_search() local
264 struct rb_node *node; in __es_find_extent_range() local
573 struct rb_node *node; in ext4_es_try_to_merge_left() local
597 struct rb_node *node; in ext4_es_try_to_merge_right() local
1005 struct rb_node *node; in ext4_es_lookup_extent() local
1094 struct rb_node *node; in init_rsvd() local
1216 struct rb_node *node = root->rb_node; in __pr_tree_search() local
1260 struct rb_node *node; in get_rsvd() local
1387 struct rb_node *node; in __es_remove_extent() local
[all …]
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 13 ext_node(struct rb_node *node) in ext_node()
21 struct rb_node *node = rb_first(root); in ext_tree_first() local
28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev() local
35 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next() local
48 struct rb_node *node = root->rb_node; in __ext_tree_search() local
325 struct rb_node *node; in __ext_tree_lookup() local
|
| /fs/nfs/ |
| D | pnfs_dev.c | 291 nfs4_mark_deviceid_available(struct nfs4_deviceid_node *node) in nfs4_mark_deviceid_available()
301 nfs4_mark_deviceid_unavailable(struct nfs4_deviceid_node *node) in nfs4_mark_deviceid_unavailable()
311 nfs4_test_deviceid_unavailable(struct nfs4_deviceid_node *node) in nfs4_test_deviceid_unavailable()
|