111 		struct ctl_node *ctl_node;  in find_entry()  local
115 		ctl_node = rb_entry(node, struct ctl_node, node);  in find_entry()
116 		head = ctl_node->header;  in find_entry()
117 		entry = &head->ctl_table[ctl_node - head->node];  in find_entry()
144 		struct ctl_node *parent_node;  in insert_entry()
149 		parent_node = rb_entry(parent, struct ctl_node, node);  in insert_entry()
181 	struct ctl_node *node, struct ctl_table *table)  in init_header()
347 static struct ctl_node *first_usable_entry(struct rb_node *node)  in first_usable_entry()
349 	struct ctl_node *ctl_node;  in first_usable_entry()  local
352 		ctl_node = rb_entry(node, struct ctl_node, node);  in first_usable_entry()
353 		if (use_table(ctl_node->header))  in first_usable_entry()
354 			return ctl_node;  in first_usable_entry()
364 	struct ctl_node *ctl_node;  in first_entry()  local
367 	ctl_node = first_usable_entry(rb_first(&dir->root));  in first_entry()
369 	if (ctl_node) {  in first_entry()
370 		head = ctl_node->header;  in first_entry()
371 		entry = &head->ctl_table[ctl_node - head->node];  in first_entry()
381 	struct ctl_node *ctl_node = &head->node[entry - head->ctl_table];  in next_entry()  local
386 	ctl_node = first_usable_entry(rb_next(&ctl_node->node));  in next_entry()
389 	if (ctl_node) {  in next_entry()
390 		head = ctl_node->header;  in next_entry()
391 		entry = &head->ctl_table[ctl_node - head->node];  in next_entry()
881 	struct ctl_node *node;  in new_dir()
884 	new = kzalloc(sizeof(*new) + sizeof(struct ctl_node) +  in new_dir()
890 	node = (struct ctl_node *)(new + 1);  in new_dir()
1062 	struct ctl_node *node;  in new_links()
1074 			sizeof(struct ctl_node)*nr_entries +  in new_links()
1082 	node = (struct ctl_node *)(links + 1);  in new_links()
1220 	struct ctl_node *node;  in __register_sysctl_table()
1227 			 sizeof(struct ctl_node)*nr_entries, GFP_KERNEL);  in __register_sysctl_table()
1231 	node = (struct ctl_node *)(header + 1);  in __register_sysctl_table()