129 		struct ctl_node *ctl_node;  in find_entry()  local
133 		ctl_node = rb_entry(node, struct ctl_node, node);  in find_entry()
134 		head = ctl_node->header;  in find_entry()
135 		entry = &head->ctl_table[ctl_node - head->node];  in find_entry()
162 		struct ctl_node *parent_node;  in insert_entry()
167 		parent_node = rb_entry(parent, struct ctl_node, node);  in insert_entry()
199 	struct ctl_node *node, struct ctl_table *table)  in init_header()
366 static struct ctl_node *first_usable_entry(struct rb_node *node)  in first_usable_entry()
368 	struct ctl_node *ctl_node;  in first_usable_entry()  local
371 		ctl_node = rb_entry(node, struct ctl_node, node);  in first_usable_entry()
372 		if (use_table(ctl_node->header))  in first_usable_entry()
373 			return ctl_node;  in first_usable_entry()
383 	struct ctl_node *ctl_node;  in first_entry()  local
386 	ctl_node = first_usable_entry(rb_first(&dir->root));  in first_entry()
388 	if (ctl_node) {  in first_entry()
389 		head = ctl_node->header;  in first_entry()
390 		entry = &head->ctl_table[ctl_node - head->node];  in first_entry()
400 	struct ctl_node *ctl_node = &head->node[entry - head->ctl_table];  in next_entry()  local
405 	ctl_node = first_usable_entry(rb_next(&ctl_node->node));  in next_entry()
408 	if (ctl_node) {  in next_entry()
409 		head = ctl_node->header;  in next_entry()
410 		entry = &head->ctl_table[ctl_node - head->node];  in next_entry()
968 	struct ctl_node *node;  in new_dir()
971 	new = kzalloc(sizeof(*new) + sizeof(struct ctl_node) +  in new_dir()
977 	node = (struct ctl_node *)(new + 1);  in new_dir()
1171 	struct ctl_node *node;  in new_links()
1183 			sizeof(struct ctl_node)*nr_entries +  in new_links()
1191 	node = (struct ctl_node *)(links + 1);  in new_links()
1331 	struct ctl_node *node;  in __register_sysctl_table()
1338 			 sizeof(struct ctl_node)*nr_entries, GFP_KERNEL_ACCOUNT);  in __register_sysctl_table()
1342 	node = (struct ctl_node *)(header + 1);  in __register_sysctl_table()