Lines Matching defs:mz
605 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
614 if (mz->on_tree)
617 mz->usage_in_excess = new_usage_in_excess;
618 if (!mz->usage_in_excess)
624 if (mz->usage_in_excess < mz_node->usage_in_excess) {
633 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
638 mctz->rb_rightmost = &mz->tree_node;
640 rb_link_node(&mz->tree_node, parent, p);
641 rb_insert_color(&mz->tree_node, &mctz->rb_root);
642 mz->on_tree = true;
645 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
648 if (!mz->on_tree)
651 if (&mz->tree_node == mctz->rb_rightmost)
652 mctz->rb_rightmost = rb_prev(&mz->tree_node);
654 rb_erase(&mz->tree_node, &mctz->rb_root);
655 mz->on_tree = false;
658 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
664 __mem_cgroup_remove_exceeded(mz, mctz);
671 struct mem_cgroup_per_node *mz = mem_cgroup_nodeinfo(memcg, 0);
672 struct lruvec *lruvec = &mz->lruvec;
691 struct mem_cgroup_per_node *mz;
702 mz = mem_cgroup_page_nodeinfo(memcg, page);
705 * We have to update the tree if mz is on RB-tree or
708 if (excess || mz->on_tree) {
713 if (mz->on_tree)
714 __mem_cgroup_remove_exceeded(mz, mctz);
716 * Insert again. mz->usage_in_excess will be updated.
719 __mem_cgroup_insert_exceeded(mz, mctz, excess);
728 struct mem_cgroup_per_node *mz;
732 mz = mem_cgroup_nodeinfo(memcg, nid);
735 mem_cgroup_remove_exceeded(mz, mctz);
742 struct mem_cgroup_per_node *mz;
745 mz = NULL;
749 mz = rb_entry(mctz->rb_rightmost,
756 __mem_cgroup_remove_exceeded(mz, mctz);
757 if (!soft_limit_excess(mz->memcg) ||
758 !css_tryget(&mz->memcg->css))
761 return mz;
767 struct mem_cgroup_per_node *mz;
770 mz = __mem_cgroup_largest_soft_limit_node(mctz);
772 return mz;
1183 struct mem_cgroup_per_node *mz;
1185 mz = mem_cgroup_nodeinfo(root, reclaim->pgdat->node_id);
1186 iter = &mz->iter;
1284 struct mem_cgroup_per_node *mz;
1288 mz = mem_cgroup_nodeinfo(from, nid);
1289 iter = &mz->iter;
1362 struct mem_cgroup_per_node *mz;
1386 mz = mem_cgroup_page_nodeinfo(memcg, page);
1387 lruvec = &mz->lruvec;
1413 struct mem_cgroup_per_node *mz;
1424 mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
1425 lru_size = &mz->lru_zone_size[zid][lru];
3425 struct mem_cgroup_per_node *mz, *next_mz = NULL;
3452 mz = next_mz;
3454 mz = mem_cgroup_largest_soft_limit_node(mctz);
3455 if (!mz)
3459 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
3464 __mem_cgroup_remove_exceeded(mz, mctz);
3474 excess = soft_limit_excess(mz->memcg);
3484 __mem_cgroup_insert_exceeded(mz, mctz, excess);
3486 css_put(&mz->memcg->css);
4189 struct mem_cgroup_per_node *mz;
4194 mz = mem_cgroup_nodeinfo(memcg, pgdat->node_id);
4196 anon_cost += mz->lruvec.anon_cost;
4197 file_cost += mz->lruvec.file_cost;