Home
last modified time | relevance | path

Searched refs:pnode (Results 1 – 9 of 9) sorted by relevance

/fs/ubifs/
A Dlpt.c1314 branch->pnode = pnode; in read_pnode()
1438 pnode = branch->pnode; in ubifs_get_pnode()
1591 pnode->parent->nbranch[p->iip].pnode = p; in dirty_cow_pnode()
1634 pnode = dirty_cow_pnode(c, pnode); in ubifs_lpt_lookup_dirty()
2020 pnode = branch->pnode; in scan_get_pnode()
2023 path->ptr.pnode = pnode; in scan_get_pnode()
2026 pnode = &path->pnode; in scan_get_pnode()
2028 path->ptr.pnode = pnode; in scan_get_pnode()
2172 parent->nbranch[pnode->iip].pnode = pnode; in ubifs_lpt_scan_nolock()
2173 path[h].ptr.pnode = pnode; in ubifs_lpt_scan_nolock()
[all …]
A Dlpt_commit.c559 nnode = pnode->parent; in next_pnode_to_dirty()
616 ubifs_add_lpt_dirt(c, pnode->parent->nbranch[pnode->iip].lnum, in add_pnode_dirt()
662 if (IS_ERR(pnode)) in make_tree_dirty()
665 while (pnode) { in make_tree_dirty()
667 pnode = next_pnode_to_dirty(c, pnode); in make_tree_dirty()
668 if (IS_ERR(pnode)) in make_tree_dirty()
916 if (IS_ERR(pnode)) in make_pnode_dirty()
918 branch = &pnode->parent->nbranch[pnode->iip]; in make_pnode_dirty()
1522 if (IS_ERR(pnode)) in dbg_is_pnode_dirty()
1524 branch = &pnode->parent->nbranch[pnode->iip]; in dbg_is_pnode_dirty()
[all …]
A Dlprops.c492 struct ubifs_pnode *pnode; in is_lprops_dirty() local
496 pnode = (struct ubifs_pnode *)container_of(lprops - pos, in is_lprops_dirty()
499 return !test_bit(COW_CNODE, &pnode->flags) && in is_lprops_dirty()
500 test_bit(DIRTY_CNODE, &pnode->flags); in is_lprops_dirty()
A Ddebug.c923 void ubifs_dump_pnode(struct ubifs_info *c, struct ubifs_pnode *pnode, in ubifs_dump_pnode() argument
930 (size_t)pnode, (size_t)parent, (size_t)pnode->cnext); in ubifs_dump_pnode()
932 pnode->flags, iip, pnode->level, pnode->num); in ubifs_dump_pnode()
934 struct ubifs_lprops *lp = &pnode->lprops[i]; in ubifs_dump_pnode()
A Ddebug.h260 void ubifs_dump_pnode(struct ubifs_info *c, struct ubifs_pnode *pnode,
A Dubifs.h590 struct ubifs_pnode *pnode; member
1965 struct ubifs_pnode *pnode);
/fs/f2fs/
A Dextent_cache.c225 struct rb_node **pnode = &root->rb_root.rb_node; in __lookup_extent_node_ret() local
242 while (*pnode) { in __lookup_extent_node_ret()
243 parent = *pnode; in __lookup_extent_node_ret()
244 en = rb_entry(*pnode, struct extent_node, rb_node); in __lookup_extent_node_ret()
247 pnode = &(*pnode)->rb_left; in __lookup_extent_node_ret()
249 pnode = &(*pnode)->rb_right; in __lookup_extent_node_ret()
256 *insert_p = pnode; in __lookup_extent_node_ret()
A Dsegment.c1052 struct rb_node **pnode = &root->rb_root.rb_node; in __lookup_discard_cmd_ret() local
1064 while (*pnode) { in __lookup_discard_cmd_ret()
1065 parent = *pnode; in __lookup_discard_cmd_ret()
1066 dc = rb_entry(*pnode, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1069 pnode = &(*pnode)->rb_left; in __lookup_discard_cmd_ret()
1071 pnode = &(*pnode)->rb_right; in __lookup_discard_cmd_ret()
1076 *insert_p = pnode; in __lookup_discard_cmd_ret()
/fs/
A DMakefile15 pnode.o splice.o sync.o utimes.o d_path.o \

Completed in 40 milliseconds