mz
const struct mz_hdr *mz = pebuf;
chkaddr(0, 0, sizeof(*mz));
if (mz->magic != IMAGE_DOS_SIGNATURE)
cursor = sizeof(*mz);
chkaddr(cursor, mz->peaddr, sizeof(*pe));
pe = pebuf + mz->peaddr;
cursor = mz->peaddr + sizeof(*pe);
s16 mz;
set_s16(&sensor->full_scale.mz, full_scale.mz);
result.mz = get_s16(&sensor->max_full_scale.mz);
val = get_s16(&spriv->sensor->filter[filter].mz);
r[5].l.range[0].min = -get_s16(&fs->mz) * 100;
r[5].l.range[0].max = get_s16(&fs->mz) * 100;
set_s16(&sensor->offsets.mz, 0);
s32 mz;
s32 mz;
struct mem_cgroup_per_node *mz;
mz = memcg->nodeinfo[pgdat->node_id];
lruvec = &mz->lruvec;
struct mem_cgroup_per_node *mz;
mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
return mz->memcg;
struct mem_cgroup_per_node *mz;
mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
return READ_ONCE(mz->lru_zone_size[zone_idx][lru]);
static void __mem_cgroup_insert_exceeded(struct mem_cgroup_per_node *mz,
if (mz->on_tree)
mz->usage_in_excess = new_usage_in_excess;
if (!mz->usage_in_excess)
if (mz->usage_in_excess < mz_node->usage_in_excess) {
mctz->rb_rightmost = &mz->tree_node;
rb_link_node(&mz->tree_node, parent, p);
rb_insert_color(&mz->tree_node, &mctz->rb_root);
mz->on_tree = true;
static void __mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
if (!mz->on_tree)
if (&mz->tree_node == mctz->rb_rightmost)
mctz->rb_rightmost = rb_prev(&mz->tree_node);
rb_erase(&mz->tree_node, &mctz->rb_root);
mz->on_tree = false;
static void mem_cgroup_remove_exceeded(struct mem_cgroup_per_node *mz,
__mem_cgroup_remove_exceeded(mz, mctz);
struct mem_cgroup_per_node *mz;
struct mem_cgroup_per_node *mz;
mz = memcg->nodeinfo[pgdat->node_id];
anon_cost += mz->lruvec.anon_cost;
file_cost += mz->lruvec.file_cost;
mz = memcg->nodeinfo[nid];
if (excess || mz->on_tree) {
if (mz->on_tree)
__mem_cgroup_remove_exceeded(mz, mctz);
__mem_cgroup_insert_exceeded(mz, mctz, excess);
struct mem_cgroup_per_node *mz;
mz = memcg->nodeinfo[nid];
mem_cgroup_remove_exceeded(mz, mctz);
struct mem_cgroup_per_node *mz;
mz = NULL;
mz = rb_entry(mctz->rb_rightmost,
__mem_cgroup_remove_exceeded(mz, mctz);
if (!soft_limit_excess(mz->memcg) ||
!css_tryget(&mz->memcg->css))
return mz;
struct mem_cgroup_per_node *mz;
mz = __mem_cgroup_largest_soft_limit_node(mctz);
return mz;
struct mem_cgroup_per_node *mz, *next_mz = NULL;
mz = next_mz;
mz = mem_cgroup_largest_soft_limit_node(mctz);
if (!mz)
reclaimed = mem_cgroup_soft_reclaim(mz->memcg, pgdat,
excess = soft_limit_excess(mz->memcg);
__mem_cgroup_insert_exceeded(mz, mctz, excess);
css_put(&mz->memcg->css);
struct mem_cgroup_per_node *mz;
mz = from->nodeinfo[nid];
iter = &mz->iter;
struct mem_cgroup_per_node *mz;
mz = container_of(lruvec, struct mem_cgroup_per_node, lruvec);
lru_size = &mz->lru_zone_size[zid][lru];