Home
last modified time | relevance | path

Searched refs:nnode (Results 1 – 3 of 3) sorted by relevance

/fs/ubifs/
A Dlpt.c1246 branch->nnode = nnode; in ubifs_read_nnode()
1412 nnode = branch->nnode; in ubifs_get_nnode()
1615 nnode = dirty_cow_nnode(c, nnode); in ubifs_lpt_lookup_dirty()
1626 nnode = dirty_cow_nnode(c, nnode); in ubifs_lpt_lookup_dirty()
1961 nnode = branch->nnode; in scan_get_nnode()
1964 path->ptr.nnode = nnode; in scan_get_nnode()
1967 nnode = &path->nnode; in scan_get_nnode()
1969 path->ptr.nnode = nnode; in scan_get_nnode()
2155 parent->nbranch[nnode->iip].nnode = nnode; in ubifs_lpt_scan_nolock()
2156 path[h].ptr.nnode = nnode; in ubifs_lpt_scan_nolock()
[all …]
A Dlpt_commit.c568 nnode = nnode->parent; in next_pnode_to_dirty()
639 nnode = nnode->parent; in do_make_pnode_dirty()
881 nnode = nnode->parent; in make_nnode_dirty()
886 nnode = nnode->parent; in make_nnode_dirty()
1351 if (nnode->nbranch[i].nnode) { in first_nnode()
1353 nnode = nnode->nbranch[i].nnode; in first_nnode()
1387 nnode = parent->nbranch[iip].nnode; in next_nnode()
1398 if (nnode->nbranch[i].nnode) { in next_nnode()
1400 nnode = nnode->nbranch[i].nnode; in next_nnode()
1440 kfree(nnode->nbranch[i].nnode); in ubifs_lpt_free()
[all …]
A Dubifs.h589 struct ubifs_nnode *nnode; member
1967 struct ubifs_nnode *nnode);
1975 void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode);
1980 struct ubifs_nnode *nnode);

Completed in 17 milliseconds