Lines Matching defs:node
752 * Remove the node now but someone else can add it back,
855 * The lruvec is the intersection of the NUMA node and a cgroup. This
857 * change of state at this level: per-node, per-cgroup, per-lruvec.
862 /* Update node */
886 * node. If we reparent the slab objects to the root memcg,
1152 * Reclaimers can specify a node in @reclaim to divide up the memcgs
1154 * same node.
1390 * Since a node can be onlined after the mem_cgroup was created,
3438 * Do not even bother to check the largest node if the root
3477 * back the node to the tree if reclaim returns 0.
3673 int node, cpu, i;
3683 for_each_node(node) {
3684 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
3695 for (pi = pn; pi; pi = parent_nodeinfo(pi, node))
5268 static int alloc_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5271 int tmp = node;
5274 * But it's BUG to call kmalloc() against offline node.
5280 if (!node_state(node, N_NORMAL_MEMORY))
5303 pn->lruvec.pgdat = NODE_DATA(node);
5307 memcg->nodeinfo[node] = pn;
5311 static void free_mem_cgroup_per_node_info(struct mem_cgroup *memcg, int node)
5313 struct mem_cgroup_per_node *pn = memcg->nodeinfo[node];
5325 int node;
5327 for_each_node(node)
5328 free_mem_cgroup_per_node_info(memcg, node);
5350 int node;
5377 for_each_node(node)
5378 if (alloc_mem_cgroup_per_node_info(memcg, node))
7257 int cpu, node;
7266 for_each_node(node) {
7270 node_online(node) ? node : NUMA_NO_NODE);
7275 soft_limit_tree.rb_tree_per_node[node] = rtpn;