childnode          88 arch/c6x/include/asm/clock.h 	struct list_head	childnode;	/* parent's child list node */
childnode          98 arch/c6x/platforms/pll.c 	list_for_each_entry(clk, &root->children, childnode) {
childnode         141 arch/c6x/platforms/pll.c 	list_del_init(&clk->childnode);
childnode         142 arch/c6x/platforms/pll.c 	list_add(&clk->childnode, &clk->parent->children);
childnode         168 arch/c6x/platforms/pll.c 		list_add_tail(&clk->childnode, &clk->parent->children);
childnode         194 arch/c6x/platforms/pll.c 	list_del(&clk->childnode);
childnode         326 arch/c6x/platforms/pll.c 	INIT_LIST_HEAD(&clk->childnode);
childnode         399 arch/c6x/platforms/pll.c 	list_for_each_entry(clk, &parent->children, childnode) {
childnode          31 arch/c6x/platforms/plldata.c 	.childnode = LIST_HEAD_INIT(clkin1.childnode),
childnode         347 fs/unicode/mkutf8data.c 	int childnode;
childnode         429 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
childnode         434 fs/unicode/mkutf8data.c 		assert(tree->childnode == NODE);
childnode         583 fs/unicode/mkutf8data.c 			tree->childnode = LEAF;
childnode         671 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
childnode         827 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
childnode         830 fs/unicode/mkutf8data.c 	assert(tree->childnode == NODE);
childnode         878 fs/unicode/mkutf8data.c 	assert(tree->childnode == NODE);
childnode         960 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
childnode         965 fs/unicode/mkutf8data.c 	assert(tree->childnode == NODE);
childnode        1071 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
childnode        1074 fs/unicode/mkutf8data.c 	assert(tree->childnode == NODE);
childnode        1209 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
childnode        1218 fs/unicode/mkutf8data.c 	assert(tree->childnode == NODE);
childnode        1679 fs/unicode/mkutf8data.c 		trees[i].childnode = NODE;