120 		struct ctl_node *ctl_node;  in find_entry()  local
124 		ctl_node = rb_entry(node, struct ctl_node, node);  in find_entry()
125 		head = ctl_node->header;  in find_entry()
126 		entry = &head->ctl_table[ctl_node - head->node];  in find_entry()
153 		struct ctl_node *parent_node;  in insert_entry()
158 		parent_node = rb_entry(parent, struct ctl_node, node);  in insert_entry()
190 	struct ctl_node *node, struct ctl_table *table)  in init_header()
353 static struct ctl_node *first_usable_entry(struct rb_node *node)  in first_usable_entry()
355 	struct ctl_node *ctl_node;  in first_usable_entry()  local
358 		ctl_node = rb_entry(node, struct ctl_node, node);  in first_usable_entry()
359 		if (use_table(ctl_node->header))  in first_usable_entry()
360 			return ctl_node;  in first_usable_entry()
370 	struct ctl_node *ctl_node;  in first_entry()  local
373 	ctl_node = first_usable_entry(rb_first(&dir->root));  in first_entry()
375 	if (ctl_node) {  in first_entry()
376 		head = ctl_node->header;  in first_entry()
377 		entry = &head->ctl_table[ctl_node - head->node];  in first_entry()
387 	struct ctl_node *ctl_node = &head->node[entry - head->ctl_table];  in next_entry()  local
392 	ctl_node = first_usable_entry(rb_next(&ctl_node->node));  in next_entry()
395 	if (ctl_node) {  in next_entry()
396 		head = ctl_node->header;  in next_entry()
397 		entry = &head->ctl_table[ctl_node - head->node];  in next_entry()
952 	struct ctl_node *node;  in new_dir()
955 	new = kzalloc(sizeof(*new) + sizeof(struct ctl_node) +  in new_dir()
961 	node = (struct ctl_node *)(new + 1);  in new_dir()
1150 	struct ctl_node *node;  in new_links()
1162 			sizeof(struct ctl_node)*nr_entries +  in new_links()
1170 	node = (struct ctl_node *)(links + 1);  in new_links()
1308 	struct ctl_node *node;  in __register_sysctl_table()
1315 			 sizeof(struct ctl_node)*nr_entries, GFP_KERNEL);  in __register_sysctl_table()
1319 	node = (struct ctl_node *)(header + 1);  in __register_sysctl_table()