| /fs/hfs/ |
| A D | bnode.c | 19 bool is_bnode_offset_valid(struct hfs_bnode *node, int off) in is_bnode_offset_valid()
240 void hfs_bnode_dump(struct hfs_bnode *node) in hfs_bnode_dump()
277 void hfs_bnode_unlink(struct hfs_bnode *node) in hfs_bnode_unlink()
326 struct hfs_bnode *node; in hfs_bnode_findhash() local
344 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
400 void hfs_bnode_unhash(struct hfs_bnode *node) in hfs_bnode_unhash()
417 struct hfs_bnode *node; in hfs_bnode_find() local
499 void hfs_bnode_free(struct hfs_bnode *node) in hfs_bnode_free()
511 struct hfs_bnode *node; in hfs_bnode_create() local
545 void hfs_bnode_get(struct hfs_bnode *node) in hfs_bnode_get()
[all …]
|
| A 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
|
| A 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/ |
| A D | bnode.c | 105 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8()
389 void hfs_bnode_dump(struct hfs_bnode *node) in hfs_bnode_dump()
426 void hfs_bnode_unlink(struct hfs_bnode *node) in hfs_bnode_unlink()
476 struct hfs_bnode *node; in hfs_bnode_findhash() local
493 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
550 void hfs_bnode_unhash(struct hfs_bnode *node) in hfs_bnode_unhash()
567 struct hfs_bnode *node; in hfs_bnode_find() local
650 void hfs_bnode_free(struct hfs_bnode *node) in hfs_bnode_free()
662 struct hfs_bnode *node; in hfs_bnode_create() local
696 void hfs_bnode_get(struct hfs_bnode *node) in hfs_bnode_get()
[all …]
|
| A 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
|
| A 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/ |
| A D | midcomms.c | 200 struct midcomms_node *node; member
276 struct midcomms_node *node; in __find_node() local
340 struct midcomms_node *node; in dlm_midcomms_addr() local
660 struct midcomms_node *node; in dlm_midcomms_receive_buffer_3_2() local
788 struct midcomms_node *node; in dlm_midcomms_receive_buffer_3_1() local
920 struct midcomms_node *node; in dlm_midcomms_unack_msg_resend() local
1005 struct midcomms_node *node; in dlm_midcomms_get_mhandle() local
1163 struct midcomms_node *node; in dlm_midcomms_exit() local
1216 struct midcomms_node *node; in dlm_midcomms_add_member() local
1261 struct midcomms_node *node; in dlm_midcomms_remove_member() local
[all …]
|
| /fs/btrfs/ |
| A D | ulist.c | 66 struct ulist_node *node; in ulist_release() local
132 static int ulist_node_val_key_cmp(const void *key, const struct rb_node *node) in ulist_node_val_key_cmp()
147 struct rb_node *node; in ulist_rbtree_search() local
153 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase()
171 struct rb_node *node; in ulist_rbtree_insert() local
209 struct ulist_node *node; in ulist_add_merge() local
251 struct ulist_node *node; in ulist_del() local
285 struct ulist_node *node; in ulist_next() local
|
| A D | delayed-inode.c | 72 struct btrfs_delayed_node *node; in btrfs_get_delayed_node() local
131 struct btrfs_delayed_node *node; in btrfs_get_or_create_delayed_node() local
219 struct btrfs_delayed_node *node; in btrfs_first_delayed_node() local
232 struct btrfs_delayed_node *node) in btrfs_next_delayed_node()
297 struct btrfs_delayed_node *node; in btrfs_first_prepared_delayed_node() local
312 struct btrfs_delayed_node *node) in btrfs_release_prepared_delayed_node()
364 struct rb_node *node; in __btrfs_lookup_delayed_item() local
1593 struct btrfs_delayed_node *node; in btrfs_delete_delayed_dir_index() local
2032 struct btrfs_delayed_node *node; in btrfs_kill_all_delayed_nodes() local
2082 struct btrfs_delayed_node *node; in btrfs_log_get_delayed_items() local
[all …]
|
| A D | ordered-data.c | 37 struct rb_node *node) in tree_insert()
230 struct rb_node *node; in insert_ordered_extent() local
482 struct rb_node *node; in btrfs_mark_ordered_io_finished() local
574 struct rb_node *node; in btrfs_dec_test_ordered_pending() local
651 struct rb_node *node; in btrfs_remove_ordered_extent() local
972 struct rb_node *node; in btrfs_lookup_ordered_extent() local
999 struct rb_node *node; in btrfs_lookup_ordered_range() local
1068 struct rb_node *node; in btrfs_lookup_first_ordered_extent() local
1096 struct rb_node *node; in btrfs_lookup_first_ordered_range() local
1243 struct rb_node *node; in btrfs_split_ordered_extent() local
|
| A D | ref-verify.c | 25 struct rb_node node; member
39 struct rb_node node; member
74 struct rb_node node; member
78 static int block_entry_bytenr_key_cmp(const void *key, const struct rb_node *node) in block_entry_bytenr_key_cmp()
101 struct rb_node *node; in insert_block_entry() local
109 struct rb_node *node; in lookup_block_entry() local
115 static int root_entry_root_objectid_key_cmp(const void *key, const struct rb_node *node) in root_entry_root_objectid_key_cmp()
138 struct rb_node *node; in insert_root_entry() local
176 struct rb_node *node; in insert_ref_entry() local
184 struct rb_node *node; in lookup_root_entry() local
|
| A D | relocation.c | 183 struct btrfs_backref_node *node) in mark_block_processed()
202 struct btrfs_backref_node *node, in walk_up_backref()
309 struct mapping_node *node; in find_reloc_root() local
337 struct btrfs_backref_node *node) in handle_useless_nodes()
482 struct mapping_node *node; in __add_reloc_root() local
514 struct mapping_node *node = NULL; in __del_reloc_root() local
558 struct mapping_node *node = NULL; in __update_reloc_root() local
2380 struct btrfs_backref_node *node; in finish_pending_nodes() local
2610 struct btrfs_backref_node *node; in relocate_tree_blocks() local
3855 struct mapping_node *node, *tmp; in free_reloc_control() local
[all …]
|
| A D | backref.c | 705 struct ulist_node *node; in free_leaf_list() local
738 struct ulist_node *node; in resolve_indirect_refs() local
842 struct rb_node *node; in add_missing_keys() local
891 struct btrfs_delayed_ref_node *node; in add_delayed_refs() local
1389 struct rb_node *node; in find_parent_nodes() local
1766 struct ulist_node *node; in btrfs_find_all_roots_safe() local
1856 struct ulist_node *node; in btrfs_is_data_extent_shared() local
3033 struct btrfs_backref_node *node; in btrfs_backref_alloc_node() local
3129 struct btrfs_backref_node *node) in btrfs_backref_cleanup_node()
3152 struct btrfs_backref_node *node; in btrfs_backref_release_cache() local
[all …]
|
| /fs/ocfs2/cluster/ |
| A 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()
|
| A 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
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
325 struct o2nm_node *node = to_o2nm_node(item); in o2nm_node_local_store() local
[all …]
|
| /fs/nilfs2/ |
| A D | btree.c | 438 struct nilfs_btree_node *node; in nilfs_btree_get_node() local
552 struct nilfs_btree_node *node; in nilfs_btree_do_lookup() local
613 struct nilfs_btree_node *node; in nilfs_btree_do_lookup_last() local
661 struct nilfs_btree_node *node; in nilfs_btree_get_next_key() local
707 struct nilfs_btree_node *node; in nilfs_btree_lookup_contig() local
817 struct nilfs_btree_node *node; in nilfs_btree_do_insert() local
1015 struct nilfs_btree_node *node; in nilfs_btree_find_near() local
1267 struct nilfs_btree_node *node; in nilfs_btree_do_delete() local
1807 struct nilfs_btree_node *node; in nilfs_btree_commit_convert_and_insert() local
2084 struct nilfs_btree_node *node; in nilfs_btree_propagate() local
[all …]
|
| /fs/befs/ |
| A 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/ubifs/ |
| A 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/xfs/libxfs/ |
| A 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()
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()
463 struct xfs_iext_node *node = *nodep; in xfs_iext_split_node() local
506 struct xfs_iext_node *node, *new; in xfs_iext_insert_node() local
692 struct xfs_iext_node *node, in xfs_iext_rebalance_node()
745 struct xfs_iext_node *node, *parent; in xfs_iext_remove_node() local
[all …]
|
| /fs/ocfs2/dlm/ |
| A 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
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
1412 int node, in dlm_request_join()
1499 unsigned int node) in dlm_send_one_join_assert()
[all …]
|
| /fs/unicode/ |
| A D | mkutf8data.c | 361 struct node { struct
366 struct node *parent; 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
944 struct node *node; in index_nodes() local
1051 struct node *node; in size_nodes() local
[all …]
|
| /fs/btrfs/tests/ |
| A D | delayed-refs-tests.c | 61 struct btrfs_delayed_ref_node *node) in delete_delayed_ref_node()
106 static int validate_ref_node(struct btrfs_delayed_ref_node *node, in validate_ref_node()
174 struct btrfs_delayed_ref_node *node; in simple_test() local
342 struct btrfs_delayed_ref_node *node; in merge_tests() local
783 struct btrfs_delayed_ref_node *node; in select_delayed_refs_test() local
|
| /fs/ext4/ |
| A D | extents_status.c | 213 struct rb_node *node; in ext4_es_print_tree() local
295 struct rb_node *node; in __es_find_extent_range() local
604 struct rb_node *node; in ext4_es_try_to_merge_left() local
628 struct rb_node *node; in ext4_es_try_to_merge_right() local
1036 struct rb_node *node; in ext4_es_lookup_extent() local
1125 struct rb_node *node; in init_rsvd() local
1291 struct rb_node *node; in get_rsvd() local
1418 struct rb_node *node; in __es_remove_extent() local
1821 struct rb_node *node; in es_do_reclaim_extents() local
1891 struct rb_node *node; in ext4_clear_inode_es() local
[all …]
|
| /fs/nfs/blocklayout/ |
| A D | extent_tree.c | 14 ext_node(struct rb_node *node) in ext_node()
22 struct rb_node *node = rb_first(root); in ext_tree_first() local
29 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev() local
36 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next() local
49 struct rb_node *node = root->rb_node; in __ext_tree_search() local
326 struct rb_node *node; in __ext_tree_lookup() local
|
| /fs/nfs/ |
| A 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()
|