Lines Matching defs:mz

109 static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
118 	if (mz->on_tree)
121 	mz->usage_in_excess = new_usage_in_excess;
122 	if (!mz->usage_in_excess)
128 		if (mz->usage_in_excess < mz_node->usage_in_excess) {
137 		mctz->rb_rightmost = &mz->tree_node;
139 	rb_link_node(&mz->tree_node, parent, p);
140 	rb_insert_color(&mz->tree_node, &mctz->rb_root);
141 	mz->on_tree = true;
144 static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
147 	if (!mz->on_tree)
150 	if (&mz->tree_node == mctz->rb_rightmost)
151 		mctz->rb_rightmost = rb_prev(&mz->tree_node);
153 	rb_erase(&mz->tree_node, &mctz->rb_root);
154 	mz->on_tree = false;
157 static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
163 	__mem_cgroup_remove_exceeded(mz, mctz);
182 	struct mem_cgroup_per_node *mz;
199 		mz = memcg->nodeinfo[nid];
202 		 * We have to update the tree if mz is on RB-tree or
205 		if (excess || mz->on_tree) {
210 			if (mz->on_tree)
211 				__mem_cgroup_remove_exceeded(mz, mctz);
213 			 * Insert again. mz->usage_in_excess will be updated.
216 			__mem_cgroup_insert_exceeded(mz, mctz, excess);
225 	struct mem_cgroup_per_node *mz;
229 		mz = memcg->nodeinfo[nid];
232 			mem_cgroup_remove_exceeded(mz, mctz);
239 	struct mem_cgroup_per_node *mz;
242 	mz = NULL;
246 	mz = rb_entry(mctz->rb_rightmost,
253 	__mem_cgroup_remove_exceeded(mz, mctz);
254 	if (!soft_limit_excess(mz->memcg) ||
255 	    !css_tryget(&mz->memcg->css))
258 	return mz;
264 	struct mem_cgroup_per_node *mz;
267 	mz = __mem_cgroup_largest_soft_limit_node(mctz);
269 	return mz;
327 	struct mem_cgroup_per_node *mz, *next_mz = NULL;
356 			mz = next_mz;
358 			mz = mem_cgroup_largest_soft_limit_node(mctz);
359 		if (!mz)
362 		reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
375 		excess = soft_limit_excess(mz->memcg);
385 		__mem_cgroup_insert_exceeded(mz, mctz, excess);
387 		css_put(&mz->memcg->css);
1926 		struct mem_cgroup_per_node *mz;
1931 			mz = memcg->nodeinfo[pgdat->node_id];
1933 			anon_cost += mz->lruvec.anon_cost;
1934 			file_cost += mz->lruvec.file_cost;