| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | lpt.c | 368 * ubifs_pack_nnode - pack all the bit fields of a nnode.
371 * @nnode: nnode to pack
374 struct ubifs_nnode *nnode) in ubifs_pack_nnode()
382 pack_bits(c, &addr, &pos, nnode->num, c->pcnt_bits); in ubifs_pack_nnode()
384 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode()
389 pack_bits(c, &addr, &pos, nnode->nbranch[i].offs, in ubifs_pack_nnode()
482 * @nnode: nnode for which to add dirt
484 void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode) in ubifs_add_nnode_dirt() argument
373 ubifs_pack_nnode(struct ubifs_info *c, void *buf, struct ubifs_nnode *nnode) ubifs_pack_nnode() argument
605 struct ubifs_nnode *nnode = NULL; ubifs_create_dflt_lpt() local
1011 ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, struct ubifs_nnode *nnode) ubifs_unpack_nnode() argument
1104 validate_nnode(const struct ubifs_info *c, struct ubifs_nnode *nnode, struct ubifs_nnode *parent, int iip) validate_nnode() argument
1206 struct ubifs_nnode *nnode = NULL; ubifs_read_nnode() local
1408 struct ubifs_nnode *nnode; ubifs_get_nnode() local
1459 struct ubifs_nnode *nnode; ubifs_pnode_lookup() local
1511 dirty_cow_nnode(struct ubifs_info *c, struct ubifs_nnode *nnode) dirty_cow_nnode() argument
1606 struct ubifs_nnode *nnode; ubifs_lpt_lookup_dirty() local
1655 struct ubifs_nnode *nnode, *nn; ubifs_lpt_calc_hash() local
1928 struct ubifs_nnode nnode; global() member
1934 struct ubifs_nnode *nnode; global() member
1955 struct ubifs_nnode *nnode; scan_get_nnode() local
2082 struct ubifs_nnode *nnode; ubifs_lpt_scan_nolock() local
2383 struct ubifs_nnode *nnode, *nn; dbg_check_lpt_nodes() local
[all...] |
| H A D | lpt_commit.c | 26 * @nnode: nnode at which to start
30 static struct ubifs_cnode *first_dirty_cnode(const struct ubifs_info *c, struct ubifs_nnode *nnode) in first_dirty_cnode() argument
32 ubifs_assert(c, nnode); in first_dirty_cnode()
39 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
44 nnode = (struct ubifs_nnode *)cnode; in first_dirty_cnode()
50 return (struct ubifs_cnode *)nnode; in first_dirty_cnode()
63 struct ubifs_nnode *nnode; in next_dirty_cnode() local
67 nnode = cnode->parent; in next_dirty_cnode()
68 if (!nnode) in next_dirty_cnode()
555 struct ubifs_nnode *nnode; next_pnode_to_dirty() local
629 struct ubifs_nnode *nnode; do_make_pnode_dirty() local
825 struct ubifs_nnode *nnode; nnode_lookup() local
863 struct ubifs_nnode *nnode; make_nnode_dirty() local
1341 struct ubifs_nnode *nnode; first_nnode() local
1373 next_nnode(struct ubifs_info *c, struct ubifs_nnode *nnode, int *hght) next_nnode() argument
1418 struct ubifs_nnode *nnode; ubifs_lpt_free() local
1478 struct ubifs_nnode *nnode; dbg_is_nnode_dirty() local
1892 struct ubifs_nnode nnode; dump_lpt_leb() local
[all...] |
| H A D | ubifs.h | 544 * @parent: parent nnode
562 * @parent: parent nnode
584 * @nnode: nnode child
592 struct ubifs_nnode *nnode; member
600 * @parent: parent nnode
1177 * @pcnt_bits: number of bits needed to record pnode or nnode number
1179 * @nnode_sz: size of on-flash nnode
1189 * @lpt_lnum: LEB number of the root nnode of the LPT
1190 * @lpt_offs: offset of the root nnode o
[all...] |
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | lpt.c | 368 * ubifs_pack_nnode - pack all the bit fields of a nnode.
371 * @nnode: nnode to pack
374 struct ubifs_nnode *nnode) in ubifs_pack_nnode()
382 pack_bits(c, &addr, &pos, nnode->num, c->pcnt_bits); in ubifs_pack_nnode()
384 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode()
389 pack_bits(c, &addr, &pos, nnode->nbranch[i].offs, in ubifs_pack_nnode()
482 * @nnode: nnode for which to add dirt
484 void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode) in ubifs_add_nnode_dirt() argument
373 ubifs_pack_nnode(struct ubifs_info *c, void *buf, struct ubifs_nnode *nnode) ubifs_pack_nnode() argument
605 struct ubifs_nnode *nnode = NULL; ubifs_create_dflt_lpt() local
1011 ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, struct ubifs_nnode *nnode) ubifs_unpack_nnode() argument
1104 validate_nnode(const struct ubifs_info *c, struct ubifs_nnode *nnode, struct ubifs_nnode *parent, int iip) validate_nnode() argument
1206 struct ubifs_nnode *nnode = NULL; ubifs_read_nnode() local
1408 struct ubifs_nnode *nnode; ubifs_get_nnode() local
1459 struct ubifs_nnode *nnode; ubifs_pnode_lookup() local
1511 dirty_cow_nnode(struct ubifs_info *c, struct ubifs_nnode *nnode) dirty_cow_nnode() argument
1606 struct ubifs_nnode *nnode; ubifs_lpt_lookup_dirty() local
1655 struct ubifs_nnode *nnode, *nn; ubifs_lpt_calc_hash() local
1928 struct ubifs_nnode nnode; global() member
1934 struct ubifs_nnode *nnode; global() member
1955 struct ubifs_nnode *nnode; scan_get_nnode() local
2082 struct ubifs_nnode *nnode; ubifs_lpt_scan_nolock() local
2383 struct ubifs_nnode *nnode, *nn; dbg_check_lpt_nodes() local
[all...] |
| H A D | lpt_commit.c | 26 * @nnode: nnode at which to start
30 static struct ubifs_cnode *first_dirty_cnode(const struct ubifs_info *c, struct ubifs_nnode *nnode) in first_dirty_cnode() argument
32 ubifs_assert(c, nnode); in first_dirty_cnode()
39 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
44 nnode = (struct ubifs_nnode *)cnode; in first_dirty_cnode()
50 return (struct ubifs_cnode *)nnode; in first_dirty_cnode()
63 struct ubifs_nnode *nnode; in next_dirty_cnode() local
67 nnode = cnode->parent; in next_dirty_cnode()
68 if (!nnode) in next_dirty_cnode()
555 struct ubifs_nnode *nnode; next_pnode_to_dirty() local
629 struct ubifs_nnode *nnode; do_make_pnode_dirty() local
825 struct ubifs_nnode *nnode; nnode_lookup() local
863 struct ubifs_nnode *nnode; make_nnode_dirty() local
1341 struct ubifs_nnode *nnode; first_nnode() local
1373 next_nnode(struct ubifs_info *c, struct ubifs_nnode *nnode, int *hght) next_nnode() argument
1418 struct ubifs_nnode *nnode; ubifs_lpt_free() local
1478 struct ubifs_nnode *nnode; dbg_is_nnode_dirty() local
1892 struct ubifs_nnode nnode; dump_lpt_leb() local
[all...] |
| H A D | ubifs.h | 553 * @parent: parent nnode
571 * @parent: parent nnode
593 * @nnode: nnode child
601 struct ubifs_nnode *nnode; member
609 * @parent: parent nnode
1198 * @pcnt_bits: number of bits needed to record pnode or nnode number
1200 * @nnode_sz: size of on-flash nnode
1210 * @lpt_lnum: LEB number of the root nnode of the LPT
1211 * @lpt_offs: offset of the root nnode o
[all...] |
| /kernel/linux/linux-5.10/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 583 int nnode; in overlay_apply_node() local
586 nnode = fdt_add_subnode(fdt, target, name); in overlay_apply_node()
587 if (nnode == -FDT_ERR_EXISTS) { in overlay_apply_node()
588 nnode = fdt_subnode_offset(fdt, target, name); in overlay_apply_node()
589 if (nnode == -FDT_ERR_NOTFOUND) in overlay_apply_node()
593 if (nnode < 0) in overlay_apply_node()
594 return nnode; in overlay_apply_node()
596 ret = overlay_apply_node(fdt, nnode, fdto, subnode); in overlay_apply_node()
|
| /kernel/linux/linux-6.6/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 568 int nnode; in overlay_apply_node() local
571 nnode = fdt_add_subnode(fdt, target, name); in overlay_apply_node()
572 if (nnode == -FDT_ERR_EXISTS) { in overlay_apply_node()
573 nnode = fdt_subnode_offset(fdt, target, name); in overlay_apply_node()
574 if (nnode == -FDT_ERR_NOTFOUND) in overlay_apply_node()
578 if (nnode < 0) in overlay_apply_node()
579 return nnode; in overlay_apply_node()
581 ret = overlay_apply_node(fdt, nnode, fdto, subnode); in overlay_apply_node()
|
| /kernel/linux/linux-5.10/drivers/md/ |
| H A D | dm-dust.c | 243 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()
|
| /kernel/linux/linux-6.6/drivers/md/ |
| H A D | dm-dust.c | 243 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()
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | rio.h | 243 * @nnode: Node in network list of master ports
269 struct list_head nnode; /* node in net list of ports */ member
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | rio.h | 243 * @nnode: Node in network list of master ports
269 struct list_head nnode; /* node in net list of ports */ member
|
| /kernel/linux/linux-5.10/drivers/rapidio/ |
| H A D | rio-scan.c | 960 if (mport->nnode.next || mport->nnode.prev) in rio_enum_mport()
|
| /kernel/linux/linux-6.6/drivers/rapidio/ |
| H A D | rio-scan.c | 960 if (mport->nnode.next || mport->nnode.prev) in rio_enum_mport()
|