HomeSort by: relevance | last modified time | path
    Searched refs:nilfs_node (Results 1 - 5 of 5) sorted by relevancy

  /src/sys/fs/nilfs/
nilfs_subr.h 49 int nilfs_bread(struct nilfs_node *node, uint64_t blocknr,
53 int nilfs_btree_nlookup(struct nilfs_node *node, uint64_t from, uint64_t blks, uint64_t *l2vmap);
57 int nilfs_nvtop(struct nilfs_node *node, uint64_t blks, uint64_t *l2vmap, uint64_t *v2pmap);
60 int nilfs_get_node_raw(struct nilfs_device *nilfsdev, struct nilfs_mount *ump, uint64_t ino, struct nilfs_inode *inode, struct nilfs_node **nodep);
61 void nilfs_dispose_node(struct nilfs_node **node);
63 int nilfs_grow_node(struct nilfs_node *node, uint64_t new_size);
64 int nilfs_shrink_node(struct nilfs_node *node, uint64_t new_size);
65 void nilfs_itimes(struct nilfs_node *nilfs_node, struct timespec *acc,
73 void nilfs_delete_node(struct nilfs_node *nilfs_node)
    [all...]
nilfs_vnops.c 61 #define VTOI(vnode) ((struct nilfs_node *) (vnode)->v_data)
75 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_inactive
77 DPRINTF(NODE, ("nilfs_inactive called for nilfs_node %p\n", VTOI(vp)));
79 if (nilfs_node == NULL) {
103 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_reclaim
107 DPRINTF(NODE, ("nilfs_reclaim called for node %p\n", nilfs_node));
109 if (nilfs_node == NULL) {
119 nilfs_dispose_node(&nilfs_node);
142 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_read
213 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_write
969 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_close
1141 struct nilfs_node *nilfs_node, *dir_node; local in function:nilfs_do_link
1222 struct nilfs_node *nilfs_node; local in function:nilfs_symlink
1407 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_remove
1442 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_rmdir
1515 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_advlock
    [all...]
nilfs.h 105 struct nilfs_node;
132 struct nilfs_node *dat_node;
133 struct nilfs_node *cp_node;
134 struct nilfs_node *su_node;
173 struct nilfs_node *ifile_node;
185 struct nilfs_node { struct
205 LIST_ENTRY(nilfs_node) hashchain; /* inside hash line */
nilfs_subr.c 61 #define VTOI(vnode) ((struct nilfs_node *) (vnode)->v_data)
64 static int nilfs_btree_lookup(struct nilfs_node *node, uint64_t lblocknr,
142 nilfs_bread(struct nilfs_node *node, uint64_t blocknr,
199 nilfs_btree_lookup_level(struct nilfs_node *node, uint64_t lblocknr,
263 nilfs_btree_lookup(struct nilfs_node *node, uint64_t lblocknr,
323 nilfs_btree_nlookup(struct nilfs_node *node, uint64_t from, uint64_t blks,
417 nilfs_nvtop(struct nilfs_node *node, uint64_t blks, uint64_t *l2vmap,
666 uint64_t ino, struct nilfs_inode *inode, struct nilfs_node **nodep)
668 struct nilfs_node *node;
673 memset(node, 0, sizeof(struct nilfs_node));
    [all...]
nilfs_vfsops.c 71 #define VTOI(vnode) ((struct nilfs_node *) vnode->v_data)
126 struct nilfs_node *nilfs_node = VTOI(vp); local in function:nilfs_gop_markupdate
140 nilfs_node->i_flags |= mask;
208 size = sizeof(struct nilfs_node);
712 struct nilfs_node *cp_node;
1116 struct nilfs_node *node;

Completed in 13 milliseconds