Home
last modified time | relevance | path

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

/linux-6.15/fs/ubifs/
H 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 …]
H 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 …]
H 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);
/linux-6.15/scripts/dtc/libfdt/
H A Dfdt_overlay.c795 int nnode; in overlay_apply_node() local
798 nnode = fdt_add_subnode(fdt, target, name); in overlay_apply_node()
799 if (nnode == -FDT_ERR_EXISTS) { in overlay_apply_node()
800 nnode = fdt_subnode_offset(fdt, target, name); in overlay_apply_node()
801 if (nnode == -FDT_ERR_NOTFOUND) in overlay_apply_node()
805 if (nnode < 0) in overlay_apply_node()
806 return nnode; in overlay_apply_node()
808 ret = overlay_apply_node(fdt, nnode, fdto, subnode); in overlay_apply_node()
/linux-6.15/drivers/md/
H A Ddm-dust.c243 struct rb_node *node = NULL, *nnode = NULL; in __dust_clear_badblocks() local
245 nnode = rb_first(tree); in __dust_clear_badblocks()
246 if (nnode == NULL) { in __dust_clear_badblocks()
251 while (nnode) { in __dust_clear_badblocks()
252 node = nnode; in __dust_clear_badblocks()
253 nnode = rb_next(node); in __dust_clear_badblocks()
/linux-6.15/drivers/accel/amdxdna/
H A Daie2_solver.c36 u32 nnode; member
175 rgp->nnode--; in remove_solver_node()
282 xrs->rgp.nnode++; in create_solver_node()
/linux-6.15/Documentation/bpf/
H A Dmap_lru_hash_update.dot27 label="Local freelist\nnode available?"];
58 label="Try to remove\nnode from hashtab"]
76 label="Try to remove\nnode from hashtab"]
/linux-6.15/include/linux/
H A Drio.h269 struct list_head nnode; /* node in net list of ports */ member
/linux-6.15/drivers/rapidio/
H A Drio-scan.c963 if (mport->nnode.next || mport->nnode.prev) in rio_enum_mport()