Lines Matching defs:mz
411 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
420 if (mz->on_tree)
423 mz->usage_in_excess = new_usage_in_excess;
424 if (!mz->usage_in_excess)
430 if (mz->usage_in_excess < mz_node->usage_in_excess) {
439 mctz->rb_rightmost = &mz->tree_node;
441 rb_link_node(&mz->tree_node, parent, p);
442 rb_insert_color(&mz->tree_node, &mctz->rb_root);
443 mz->on_tree = true;
446 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
449 if (!mz->on_tree)
452 if (&mz->tree_node == mctz->rb_rightmost)
453 mctz->rb_rightmost = rb_prev(&mz->tree_node);
455 rb_erase(&mz->tree_node, &mctz->rb_root);
456 mz->on_tree = false;
459 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
465 __mem_cgroup_remove_exceeded(mz, mctz);
472 struct mem_cgroup_per_node *mz = mem_cgroup_nodeinfo(memcg, 0);
473 struct lruvec *lruvec = &mz->lruvec;
492 struct mem_cgroup_per_node *mz;
509 mz = memcg->nodeinfo[nid];
512 * We have to update the tree if mz is on RB-tree or
515 if (excess || mz->on_tree) {
520 if (mz->on_tree)
521 __mem_cgroup_remove_exceeded(mz, mctz);
523 * Insert again. mz->usage_in_excess will be updated.
526 __mem_cgroup_insert_exceeded(mz, mctz, excess);
535 struct mem_cgroup_per_node *mz;
539 mz = memcg->nodeinfo[nid];
542 mem_cgroup_remove_exceeded(mz, mctz);
549 struct mem_cgroup_per_node *mz;
552 mz = NULL;
556 mz = rb_entry(mctz->rb_rightmost,
563 __mem_cgroup_remove_exceeded(mz, mctz);
564 if (!soft_limit_excess(mz->memcg) ||
565 !css_tryget(&mz->memcg->css))
568 return mz;
574 struct mem_cgroup_per_node *mz;
577 mz = __mem_cgroup_largest_soft_limit_node(mctz);
579 return mz;
1144 struct mem_cgroup_per_node *mz;
1146 mz = root->nodeinfo[reclaim->pgdat->node_id];
1147 iter = &mz->iter;
1245 struct mem_cgroup_per_node *mz;
1249 mz = from->nodeinfo[nid];
1250 iter = &mz->iter;
1412 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];
3561 struct mem_cgroup_per_node *mz, *next_mz = NULL;
3590 mz = next_mz;
3592 mz = mem_cgroup_largest_soft_limit_node(mctz);
3593 if (!mz)
3596 reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
3609 excess = soft_limit_excess(mz->memcg);
3619 __mem_cgroup_insert_exceeded(mz, mctz, excess);
3621 css_put(&mz->memcg->css);
4190 struct mem_cgroup_per_node *mz;
4195 mz = memcg->nodeinfo[pgdat->node_id];
4197 anon_cost += mz->lruvec.anon_cost;
4198 file_cost += mz->lruvec.file_cost;