121 		struct ctl_node *ctl_node;  in find_entry()  local
125 		ctl_node = rb_entry(node, struct ctl_node, node);  in find_entry()
126 		head = ctl_node->header;  in find_entry()
127 		entry = &head->ctl_table[ctl_node - head->node];  in find_entry()
154 		struct ctl_node *parent_node;  in insert_entry()
159 		parent_node = rb_entry(parent, struct ctl_node, node);  in insert_entry()
191 	struct ctl_node *node, struct ctl_table *table)  in init_header()
354 static struct ctl_node *first_usable_entry(struct rb_node *node)  in first_usable_entry()
356 	struct ctl_node *ctl_node;  in first_usable_entry()  local
359 		ctl_node = rb_entry(node, struct ctl_node, node);  in first_usable_entry()
360 		if (use_table(ctl_node->header))  in first_usable_entry()
361 			return ctl_node;  in first_usable_entry()
371 	struct ctl_node *ctl_node;  in first_entry()  local
374 	ctl_node = first_usable_entry(rb_first(&dir->root));  in first_entry()
376 	if (ctl_node) {  in first_entry()
377 		head = ctl_node->header;  in first_entry()
378 		entry = &head->ctl_table[ctl_node - head->node];  in first_entry()
388 	struct ctl_node *ctl_node = &head->node[entry - head->ctl_table];  in next_entry()  local
393 	ctl_node = first_usable_entry(rb_next(&ctl_node->node));  in next_entry()
396 	if (ctl_node) {  in next_entry()
397 		head = ctl_node->header;  in next_entry()
398 		entry = &head->ctl_table[ctl_node - head->node];  in next_entry()
953 	struct ctl_node *node;  in new_dir()
956 	new = kzalloc(sizeof(*new) + sizeof(struct ctl_node) +  in new_dir()
962 	node = (struct ctl_node *)(new + 1);  in new_dir()
1157 	struct ctl_node *node;  in new_links()
1169 			sizeof(struct ctl_node)*nr_entries +  in new_links()
1177 	node = (struct ctl_node *)(links + 1);  in new_links()
1315 	struct ctl_node *node;  in __register_sysctl_table()
1322 			 sizeof(struct ctl_node)*nr_entries, GFP_KERNEL);  in __register_sysctl_table()
1326 	node = (struct ctl_node *)(header + 1);  in __register_sysctl_table()