1651 	int nd)  in policy_zonelist()  argument
1656 			nd = policy->v.preferred_node;  in policy_zonelist()
1666 				unlikely(!node_isset(nd, policy->v.nodes)))  in policy_zonelist()
1667 			nd = first_node(policy->v.nodes);  in policy_zonelist()
1672 	return node_zonelist(nd, gfp);  in policy_zonelist()
2160 		struct sp_node *p = rb_entry(n, struct sp_node, nd);  in sp_lookup()
2176 		w = rb_entry(prev, struct sp_node, nd);  in sp_lookup()
2181 	return rb_entry(n, struct sp_node, nd);  in sp_lookup()
2190 	struct sp_node *nd;  in sp_insert()  local
2194 		nd = rb_entry(parent, struct sp_node, nd);  in sp_insert()
2195 		if (new->start < nd->start)  in sp_insert()
2197 		else if (new->end > nd->end)  in sp_insert()
2202 	rb_link_node(&new->nd, parent, p);  in sp_insert()
2203 	rb_insert_color(&new->nd, &sp->root);  in sp_insert()
2323 	rb_erase(&n->nd, &sp->root);  in sp_delete()
2370 		struct rb_node *next = rb_next(&n->nd);  in shared_policy_replace()
2395 		n = rb_entry(next, struct sp_node, nd);  in shared_policy_replace()
2506 		n = rb_entry(next, struct sp_node, nd);  in mpol_free_shared_policy()
2507 		next = rb_next(&n->nd);  in mpol_free_shared_policy()