};
enum bpf_cgroup_iter_order {
- BPF_ITER_ORDER_UNSPEC = 0,
- BPF_ITER_SELF_ONLY, /* process only a single object. */
- BPF_ITER_DESCENDANTS_PRE, /* walk descendants in pre-order. */
- BPF_ITER_DESCENDANTS_POST, /* walk descendants in post-order. */
- BPF_ITER_ANCESTORS_UP, /* walk ancestors upward. */
+ BPF_CGROUP_ITER_ORDER_UNSPEC = 0,
+ BPF_CGROUP_ITER_SELF_ONLY, /* process only a single object. */
+ BPF_CGROUP_ITER_DESCENDANTS_PRE, /* walk descendants in pre-order. */
+ BPF_CGROUP_ITER_DESCENDANTS_POST, /* walk descendants in post-order. */
+ BPF_CGROUP_ITER_ANCESTORS_UP, /* walk ancestors upward. */
};
union bpf_iter_link_info {
++*pos;
p->terminate = false;
p->visited_all = false;
- if (p->order == BPF_ITER_DESCENDANTS_PRE)
+ if (p->order == BPF_CGROUP_ITER_DESCENDANTS_PRE)
return css_next_descendant_pre(NULL, p->start_css);
- else if (p->order == BPF_ITER_DESCENDANTS_POST)
+ else if (p->order == BPF_CGROUP_ITER_DESCENDANTS_POST)
return css_next_descendant_post(NULL, p->start_css);
- else if (p->order == BPF_ITER_ANCESTORS_UP)
+ else if (p->order == BPF_CGROUP_ITER_ANCESTORS_UP)
return p->start_css;
- else /* BPF_ITER_SELF_ONLY */
+ else /* BPF_CGROUP_ITER_SELF_ONLY */
return p->start_css;
}
if (p->terminate)
return NULL;
- if (p->order == BPF_ITER_DESCENDANTS_PRE)
+ if (p->order == BPF_CGROUP_ITER_DESCENDANTS_PRE)
return css_next_descendant_pre(curr, p->start_css);
- else if (p->order == BPF_ITER_DESCENDANTS_POST)
+ else if (p->order == BPF_CGROUP_ITER_DESCENDANTS_POST)
return css_next_descendant_post(curr, p->start_css);
- else if (p->order == BPF_ITER_ANCESTORS_UP)
+ else if (p->order == BPF_CGROUP_ITER_ANCESTORS_UP)
return curr->parent;
- else /* BPF_ITER_SELF_ONLY */
+ else /* BPF_CGROUP_ITER_SELF_ONLY */
return NULL;
}
int order = linfo->cgroup.order;
struct cgroup *cgrp;
- if (order != BPF_ITER_DESCENDANTS_PRE &&
- order != BPF_ITER_DESCENDANTS_POST &&
- order != BPF_ITER_ANCESTORS_UP &&
- order != BPF_ITER_SELF_ONLY)
+ if (order != BPF_CGROUP_ITER_DESCENDANTS_PRE &&
+ order != BPF_CGROUP_ITER_DESCENDANTS_POST &&
+ order != BPF_CGROUP_ITER_ANCESTORS_UP &&
+ order != BPF_CGROUP_ITER_SELF_ONLY)
return -EINVAL;
if (fd && id)
kfree(buf);
show_order:
- if (aux->cgroup.order == BPF_ITER_DESCENDANTS_PRE)
+ if (aux->cgroup.order == BPF_CGROUP_ITER_DESCENDANTS_PRE)
seq_puts(seq, "order: descendants_pre\n");
- else if (aux->cgroup.order == BPF_ITER_DESCENDANTS_POST)
+ else if (aux->cgroup.order == BPF_CGROUP_ITER_DESCENDANTS_POST)
seq_puts(seq, "order: descendants_post\n");
- else if (aux->cgroup.order == BPF_ITER_ANCESTORS_UP)
+ else if (aux->cgroup.order == BPF_CGROUP_ITER_ANCESTORS_UP)
seq_puts(seq, "order: ancestors_up\n");
- else /* BPF_ITER_SELF_ONLY */
+ else /* BPF_CGROUP_ITER_SELF_ONLY */
seq_puts(seq, "order: self_only\n");
}
};
enum bpf_cgroup_iter_order {
- BPF_ITER_ORDER_UNSPEC = 0,
- BPF_ITER_SELF_ONLY, /* process only a single object. */
- BPF_ITER_DESCENDANTS_PRE, /* walk descendants in pre-order. */
- BPF_ITER_DESCENDANTS_POST, /* walk descendants in post-order. */
- BPF_ITER_ANCESTORS_UP, /* walk ancestors upward. */
+ BPF_CGROUP_ITER_ORDER_UNSPEC = 0,
+ BPF_CGROUP_ITER_SELF_ONLY, /* process only a single object. */
+ BPF_CGROUP_ITER_DESCENDANTS_PRE, /* walk descendants in pre-order. */
+ BPF_CGROUP_ITER_DESCENDANTS_POST, /* walk descendants in post-order. */
+ BPF_CGROUP_ITER_ANCESTORS_UP, /* walk ancestors upward. */
};
union bpf_iter_link_info {
/* union with nested struct */
TEST_BTF_DUMP_DATA(btf, d, "union", str, union bpf_iter_link_info, BTF_F_COMPACT,
- "(union bpf_iter_link_info){.map = (struct){.map_fd = (__u32)1,},.cgroup = (struct){.order = (enum bpf_cgroup_iter_order)BPF_ITER_SELF_ONLY,.cgroup_fd = (__u32)1,},}",
+ "(union bpf_iter_link_info){.map = (struct){.map_fd = (__u32)1,},.cgroup = (struct){.order = (enum bpf_cgroup_iter_order)BPF_CGROUP_ITER_SELF_ONLY,.cgroup_fd = (__u32)1,},}",
{ .cgroup = { .order = 1, .cgroup_fd = 1, }});
/* struct skb with nested structs/unions; because type output is so
* traverse one cgroup, so set the traversal order to "self".
*/
linfo.cgroup.cgroup_fd = cgroup_fd;
- linfo.cgroup.order = BPF_ITER_SELF_ONLY;
+ linfo.cgroup.order = BPF_CGROUP_ITER_SELF_ONLY;
opts.link_info = &linfo;
opts.link_info_len = sizeof(linfo);
link = bpf_program__attach_iter(obj->progs.dump_vmscan, &opts);
cg_id[PARENT], cg_id[CHILD1], cg_id[CHILD2]);
read_from_cgroup_iter(skel->progs.cgroup_id_printer, cg_fd[PARENT],
- BPF_ITER_DESCENDANTS_PRE, "preorder");
+ BPF_CGROUP_ITER_DESCENDANTS_PRE, "preorder");
}
/* Postorder walk prints child and parent in order. */
cg_id[CHILD1], cg_id[CHILD2], cg_id[PARENT]);
read_from_cgroup_iter(skel->progs.cgroup_id_printer, cg_fd[PARENT],
- BPF_ITER_DESCENDANTS_POST, "postorder");
+ BPF_CGROUP_ITER_DESCENDANTS_POST, "postorder");
}
/* Walking parents prints parent and then root. */
cg_id[PARENT], cg_id[ROOT]);
read_from_cgroup_iter(skel->progs.cgroup_id_printer, cg_fd[PARENT],
- BPF_ITER_ANCESTORS_UP, "ancestors_up");
+ BPF_CGROUP_ITER_ANCESTORS_UP, "ancestors_up");
skel->bss->terminal_cgroup = 0;
}
PROLOGUE "%8llu\n" EPILOGUE, cg_id[PARENT]);
read_from_cgroup_iter(skel->progs.cgroup_id_printer, cg_fd[PARENT],
- BPF_ITER_DESCENDANTS_PRE, "early_termination");
+ BPF_CGROUP_ITER_DESCENDANTS_PRE, "early_termination");
skel->bss->terminate_early = 0;
}
PROLOGUE "%8llu\n" EPILOGUE, cg_id[PARENT]);
read_from_cgroup_iter(skel->progs.cgroup_id_printer, cg_fd[PARENT],
- BPF_ITER_SELF_ONLY, "self_only");
+ BPF_CGROUP_ITER_SELF_ONLY, "self_only");
}
void test_cgroup_iter(void)