Home
last modified time | relevance | path

Searched refs:cnode (Results 1 – 6 of 6) sorted by relevance

/fs/ubifs/
Dlpt_commit.c53 struct ubifs_cnode *cnode; in first_dirty_cnode() local
55 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
56 if (cnode && in first_dirty_cnode()
57 test_bit(DIRTY_CNODE, &cnode->flags)) { in first_dirty_cnode()
58 if (cnode->level == 0) in first_dirty_cnode()
59 return cnode; in first_dirty_cnode()
60 nnode = (struct ubifs_nnode *)cnode; in first_dirty_cnode()
76 static struct ubifs_cnode *next_dirty_cnode(struct ubifs_cnode *cnode) in next_dirty_cnode() argument
81 ubifs_assert(cnode); in next_dirty_cnode()
82 nnode = cnode->parent; in next_dirty_cnode()
[all …]
Dlpt.c1517 if (branch->cnode) in dirty_cow_nnode()
1518 branch->cnode->parent = n; in dirty_cow_nnode()
1770 struct ubifs_cnode cnode; member
1776 struct ubifs_cnode *cnode; member
1998 path[h + 1].cnode.parent = nnode; in ubifs_lpt_scan_nolock()
2221 int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode, in dbg_check_lpt_nodes() argument
2231 while (cnode) { in dbg_check_lpt_nodes()
2233 nnode = cnode->parent; in dbg_check_lpt_nodes()
2234 if (cnode->level) { in dbg_check_lpt_nodes()
2237 if (cnode->num != num) { in dbg_check_lpt_nodes()
[all …]
Ddebug.h302 int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode,
445 struct ubifs_cnode *cnode, int row, int col) { return 0; } in dbg_check_lpt_nodes() argument
Dubifs.h586 struct ubifs_cnode *cnode; member
/fs/coda/
DMakefile7 coda-objs := psdev.o cache.o cnode.o inode.o dir.o file.o upcall.o \
/fs/nilfs2/
Dbtree.c2019 struct nilfs_btree_node *node, *cnode; in nilfs_btree_add_dirty_buffer() local
2041 cnode = (struct nilfs_btree_node *)cbh->b_data; in nilfs_btree_add_dirty_buffer()
2042 ckey = nilfs_btree_node_get_key(cnode, 0); in nilfs_btree_add_dirty_buffer()