Lines Matching defs:nd
90 int nd, k;
92 for_each_node_mask(nd, *nodemask) {
96 z = &NODE_DATA(nd)->node_zones[k];
1464 int nd = numa_node_id();
1469 nd = policy->v.preferred_node;
1479 unlikely(!node_isset(nd, policy->v.nodes)))
1480 nd = first_node(policy->v.nodes);
1485 return node_zonelist(nd, gfp);
1939 struct sp_node *p = rb_entry(n, struct sp_node, nd);
1955 w = rb_entry(prev, struct sp_node, nd);
1960 return rb_entry(n, struct sp_node, nd);
1969 struct sp_node *nd;
1973 nd = rb_entry(parent, struct sp_node, nd);
1974 if (new->start < nd->start)
1976 else if (new->end > nd->end)
1981 rb_link_node(&new->nd, parent, p);
1982 rb_insert_color(&new->nd, &sp->root);
2009 rb_erase(&n->nd, &sp->root);
2040 struct rb_node *next = rb_next(&n->nd);
2065 n = rb_entry(next, struct sp_node, nd);
2161 n = rb_entry(next, struct sp_node, nd);
2162 next = rb_next(&n->nd);
2163 rb_erase(&n->nd, &p->root);