Lines Matching refs:mz
120 #define MEM_CGROUP_ZSTAT(mz, idx) ((mz)->count[(idx)])
388 struct mem_cgroup_per_zone *mz,
396 if (mz->on_tree)
399 mz->usage_in_excess = new_usage_in_excess;
400 if (!mz->usage_in_excess)
406 if (mz->usage_in_excess < mz_node->usage_in_excess)
412 else if (mz->usage_in_excess >= mz_node->usage_in_excess)
415 rb_link_node(&mz->tree_node, parent, p);
416 rb_insert_color(&mz->tree_node, &mctz->rb_root);
417 mz->on_tree = true;
422 struct mem_cgroup_per_zone *mz,
425 if (!mz->on_tree)
427 rb_erase(&mz->tree_node, &mctz->rb_root);
428 mz->on_tree = false;
433 struct mem_cgroup_per_zone *mz,
437 __mem_cgroup_remove_exceeded(mem, mz, mctz);
445 struct mem_cgroup_per_zone *mz;
456 mz = mem_cgroup_zoneinfo(mem, nid, zid);
459 * We have to update the tree if mz is on RB-tree or
462 if (excess || mz->on_tree) {
465 if (mz->on_tree)
466 __mem_cgroup_remove_exceeded(mem, mz, mctz);
468 * Insert again. mz->usage_in_excess will be updated.
471 __mem_cgroup_insert_exceeded(mem, mz, mctz, excess);
480 struct mem_cgroup_per_zone *mz;
485 mz = mem_cgroup_zoneinfo(mem, node, zone);
487 mem_cgroup_remove_exceeded(mem, mz, mctz);
501 struct mem_cgroup_per_zone *mz;
504 mz = NULL;
509 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);
515 __mem_cgroup_remove_exceeded(mz->mem, mz, mctz);
516 if (!res_counter_soft_limit_excess(&mz->mem->res) ||
517 !css_tryget(&mz->mem->css))
520 return mz;
526 struct mem_cgroup_per_zone *mz;
529 mz = __mem_cgroup_largest_soft_limit_node(mctz);
531 return mz;
587 struct mem_cgroup_per_zone *mz;
592 mz = mem_cgroup_zoneinfo(mem, nid, zid);
593 total += MEM_CGROUP_ZSTAT(mz, idx);
720 struct mem_cgroup_per_zone *mz;
733 mz = page_cgroup_zoneinfo(pc);
734 MEM_CGROUP_ZSTAT(mz, lru) -= 1;
749 struct mem_cgroup_per_zone *mz;
764 mz = page_cgroup_zoneinfo(pc);
765 list_move(&pc->lru, &mz->lists[lru]);
771 struct mem_cgroup_per_zone *mz;
785 mz = page_cgroup_zoneinfo(pc);
786 MEM_CGROUP_ZSTAT(mz, lru) += 1;
790 list_add(&pc->lru, &mz->lists[lru]);
925 struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid);
927 return MEM_CGROUP_ZSTAT(mz, lru);
935 struct mem_cgroup_per_zone *mz = mem_cgroup_zoneinfo(memcg, nid, zid);
937 return &mz->reclaim_stat;
944 struct mem_cgroup_per_zone *mz;
958 mz = page_cgroup_zoneinfo(pc);
959 if (!mz)
962 return &mz->reclaim_stat;
980 struct mem_cgroup_per_zone *mz;
985 mz = mem_cgroup_zoneinfo(mem_cont, nid, zid);
986 src = &mz->lists[lru];
2872 struct mem_cgroup_per_zone *mz, *next_mz = NULL;
2889 mz = next_mz;
2891 mz = mem_cgroup_largest_soft_limit_node(mctz);
2892 if (!mz)
2895 reclaimed = mem_cgroup_hierarchical_reclaim(mz->mem, zone,
2921 if (next_mz == mz) {
2928 __mem_cgroup_remove_exceeded(mz->mem, mz, mctz);
2929 excess = res_counter_soft_limit_excess(&mz->mem->res);
2939 __mem_cgroup_insert_exceeded(mz->mem, mz, mctz, excess);
2941 css_put(&mz->mem->css);
2966 struct mem_cgroup_per_zone *mz;
2973 mz = mem_cgroup_zoneinfo(mem, node, zid);
2974 list = &mz->lists[lru];
2976 loop = MEM_CGROUP_ZSTAT(mz, lru);
3472 struct mem_cgroup_per_zone *mz;
3478 mz = mem_cgroup_zoneinfo(mem_cont, nid, zid);
3481 mz->reclaim_stat.recent_rotated[0];
3483 mz->reclaim_stat.recent_rotated[1];
3485 mz->reclaim_stat.recent_scanned[0];
3487 mz->reclaim_stat.recent_scanned[1];
3977 struct mem_cgroup_per_zone *mz;
3998 mz = &pn->zoneinfo[zone];
4000 INIT_LIST_HEAD(&mz->lists[l]);
4001 mz->usage_in_excess = 0;
4002 mz->on_tree = false;
4003 mz->mem = mem;