Home
last modified time | relevance | path

Searched refs:childnode (Results 1 - 5 of 5) sorted by relevance

/kernel/linux/linux-5.10/arch/c6x/platforms/
H A Dpll.c98 list_for_each_entry(clk, &root->children, childnode) { in propagate_rate()
141 list_del_init(&clk->childnode); in clk_set_parent()
142 list_add(&clk->childnode, &clk->parent->children); in clk_set_parent()
168 list_add_tail(&clk->childnode, &clk->parent->children); in clk_register()
194 list_del(&clk->childnode); in clk_unregister()
326 INIT_LIST_HEAD(&clk->childnode); in __init_clk()
399 list_for_each_entry(clk, &parent->children, childnode) { in dump_clock()
H A Dplldata.c31 .childnode = LIST_HEAD_INIT(clkin1.childnode),
/kernel/linux/linux-5.10/fs/unicode/
H A Dmkutf8data.c347 int childnode; member
429 if (tree->childnode == LEAF) { in tree_walk()
434 assert(tree->childnode == NODE); in tree_walk()
583 tree->childnode = LEAF; in insert()
671 if (tree->childnode == LEAF) in prune()
827 if (tree->childnode == LEAF) in mark_nodes()
830 assert(tree->childnode == NODE); in mark_nodes()
878 assert(tree->childnode == NODE); in mark_nodes()
960 if (tree->childnode == LEAF) { in index_nodes()
965 assert(tree->childnode in index_nodes()
[all...]
/kernel/linux/linux-6.6/fs/unicode/
H A Dmkutf8data.c347 int childnode; member
429 if (tree->childnode == LEAF) { in tree_walk()
434 assert(tree->childnode == NODE); in tree_walk()
583 tree->childnode = LEAF; in insert()
671 if (tree->childnode == LEAF) in prune()
827 if (tree->childnode == LEAF) in mark_nodes()
830 assert(tree->childnode == NODE); in mark_nodes()
878 assert(tree->childnode == NODE); in mark_nodes()
960 if (tree->childnode == LEAF) { in index_nodes()
965 assert(tree->childnode in index_nodes()
[all...]
/kernel/linux/linux-5.10/arch/c6x/include/asm/
H A Dclock.h88 struct list_head childnode; /* parent's child list node */ member

Completed in 6 milliseconds