2020-05-10 01:58:59 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
|
|
|
/* Copyright (c) 2020 Facebook */
|
|
|
|
|
|
|
|
#include <linux/fs.h>
|
2020-05-10 01:59:05 +08:00
|
|
|
#include <linux/anon_inodes.h>
|
2020-05-10 01:58:59 +08:00
|
|
|
#include <linux/filter.h>
|
|
|
|
#include <linux/bpf.h>
|
|
|
|
|
|
|
|
struct bpf_iter_target_info {
|
|
|
|
struct list_head list;
|
2020-05-14 02:02:19 +08:00
|
|
|
const struct bpf_iter_reg *reg_info;
|
2020-05-10 01:59:00 +08:00
|
|
|
u32 btf_id; /* cached value */
|
2020-05-10 01:58:59 +08:00
|
|
|
};
|
|
|
|
|
2020-05-10 01:59:01 +08:00
|
|
|
struct bpf_iter_link {
|
|
|
|
struct bpf_link link;
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
struct bpf_iter_aux_info aux;
|
2020-05-10 01:59:01 +08:00
|
|
|
struct bpf_iter_target_info *tinfo;
|
|
|
|
};
|
|
|
|
|
2020-05-10 01:59:05 +08:00
|
|
|
struct bpf_iter_priv_data {
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
const struct bpf_iter_seq_info *seq_info;
|
2020-05-10 01:59:05 +08:00
|
|
|
struct bpf_prog *prog;
|
|
|
|
u64 session_id;
|
|
|
|
u64 seq_num;
|
|
|
|
bool done_stop;
|
|
|
|
u8 target_private[] __aligned(8);
|
|
|
|
};
|
|
|
|
|
2020-05-10 01:58:59 +08:00
|
|
|
static struct list_head targets = LIST_HEAD_INIT(targets);
|
|
|
|
static DEFINE_MUTEX(targets_mutex);
|
|
|
|
|
2020-05-10 01:59:02 +08:00
|
|
|
/* protect bpf_iter_link changes */
|
|
|
|
static DEFINE_MUTEX(link_mutex);
|
|
|
|
|
2020-05-10 01:59:05 +08:00
|
|
|
/* incremented on every opened seq_file */
|
|
|
|
static atomic64_t session_id;
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
static int prepare_seq_file(struct file *file, struct bpf_iter_link *link,
|
|
|
|
const struct bpf_iter_seq_info *seq_info);
|
2020-05-10 01:59:06 +08:00
|
|
|
|
2020-05-10 01:59:07 +08:00
|
|
|
static void bpf_iter_inc_seq_num(struct seq_file *seq)
|
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *iter_priv;
|
|
|
|
|
|
|
|
iter_priv = container_of(seq->private, struct bpf_iter_priv_data,
|
|
|
|
target_private);
|
|
|
|
iter_priv->seq_num++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void bpf_iter_dec_seq_num(struct seq_file *seq)
|
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *iter_priv;
|
|
|
|
|
|
|
|
iter_priv = container_of(seq->private, struct bpf_iter_priv_data,
|
|
|
|
target_private);
|
|
|
|
iter_priv->seq_num--;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void bpf_iter_done_stop(struct seq_file *seq)
|
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *iter_priv;
|
|
|
|
|
|
|
|
iter_priv = container_of(seq->private, struct bpf_iter_priv_data,
|
|
|
|
target_private);
|
|
|
|
iter_priv->done_stop = true;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:04 +08:00
|
|
|
/* bpf_seq_read, a customized and simpler version for bpf iterator.
|
|
|
|
* no_llseek is assumed for this file.
|
|
|
|
* The following are differences from seq_read():
|
|
|
|
* . fixed buffer size (PAGE_SIZE)
|
|
|
|
* . assuming no_llseek
|
|
|
|
* . stop() may call bpf program, handling potential overflow there
|
|
|
|
*/
|
|
|
|
static ssize_t bpf_seq_read(struct file *file, char __user *buf, size_t size,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct seq_file *seq = file->private_data;
|
|
|
|
size_t n, offs, copied = 0;
|
|
|
|
int err = 0;
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
mutex_lock(&seq->lock);
|
|
|
|
|
|
|
|
if (!seq->buf) {
|
|
|
|
seq->size = PAGE_SIZE;
|
|
|
|
seq->buf = kmalloc(seq->size, GFP_KERNEL);
|
|
|
|
if (!seq->buf) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (seq->count) {
|
|
|
|
n = min(seq->count, size);
|
|
|
|
err = copy_to_user(buf, seq->buf + seq->from, n);
|
|
|
|
if (err) {
|
|
|
|
err = -EFAULT;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
seq->count -= n;
|
|
|
|
seq->from += n;
|
|
|
|
copied = n;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
seq->from = 0;
|
|
|
|
p = seq->op->start(seq, &seq->index);
|
|
|
|
if (!p)
|
|
|
|
goto stop;
|
|
|
|
if (IS_ERR(p)) {
|
|
|
|
err = PTR_ERR(p);
|
|
|
|
seq->op->stop(seq, p);
|
|
|
|
seq->count = 0;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = seq->op->show(seq, p);
|
|
|
|
if (err > 0) {
|
2020-05-10 01:59:07 +08:00
|
|
|
/* object is skipped, decrease seq_num, so next
|
|
|
|
* valid object can reuse the same seq_num.
|
|
|
|
*/
|
|
|
|
bpf_iter_dec_seq_num(seq);
|
2020-05-10 01:59:04 +08:00
|
|
|
seq->count = 0;
|
|
|
|
} else if (err < 0 || seq_has_overflowed(seq)) {
|
|
|
|
if (!err)
|
|
|
|
err = -E2BIG;
|
|
|
|
seq->op->stop(seq, p);
|
|
|
|
seq->count = 0;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
loff_t pos = seq->index;
|
|
|
|
|
|
|
|
offs = seq->count;
|
|
|
|
p = seq->op->next(seq, p, &seq->index);
|
|
|
|
if (pos == seq->index) {
|
|
|
|
pr_info_ratelimited("buggy seq_file .next function %ps "
|
|
|
|
"did not updated position index\n",
|
|
|
|
seq->op->next);
|
|
|
|
seq->index++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IS_ERR_OR_NULL(p))
|
|
|
|
break;
|
|
|
|
|
2020-05-10 01:59:07 +08:00
|
|
|
/* got a valid next object, increase seq_num */
|
|
|
|
bpf_iter_inc_seq_num(seq);
|
|
|
|
|
2020-05-10 01:59:04 +08:00
|
|
|
if (seq->count >= size)
|
|
|
|
break;
|
|
|
|
|
|
|
|
err = seq->op->show(seq, p);
|
|
|
|
if (err > 0) {
|
2020-05-10 01:59:07 +08:00
|
|
|
bpf_iter_dec_seq_num(seq);
|
2020-05-10 01:59:04 +08:00
|
|
|
seq->count = offs;
|
|
|
|
} else if (err < 0 || seq_has_overflowed(seq)) {
|
|
|
|
seq->count = offs;
|
|
|
|
if (offs == 0) {
|
|
|
|
if (!err)
|
|
|
|
err = -E2BIG;
|
|
|
|
seq->op->stop(seq, p);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
stop:
|
|
|
|
offs = seq->count;
|
|
|
|
/* bpf program called if !p */
|
|
|
|
seq->op->stop(seq, p);
|
2020-05-10 01:59:07 +08:00
|
|
|
if (!p) {
|
|
|
|
if (!seq_has_overflowed(seq)) {
|
|
|
|
bpf_iter_done_stop(seq);
|
|
|
|
} else {
|
|
|
|
seq->count = offs;
|
|
|
|
if (offs == 0) {
|
|
|
|
err = -E2BIG;
|
|
|
|
goto done;
|
|
|
|
}
|
2020-05-10 01:59:04 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
n = min(seq->count, size);
|
|
|
|
err = copy_to_user(buf, seq->buf, n);
|
|
|
|
if (err) {
|
|
|
|
err = -EFAULT;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
copied = n;
|
|
|
|
seq->count -= n;
|
|
|
|
seq->from = n;
|
|
|
|
done:
|
|
|
|
if (!copied)
|
|
|
|
copied = err;
|
|
|
|
else
|
|
|
|
*ppos += copied;
|
|
|
|
mutex_unlock(&seq->lock);
|
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
static const struct bpf_iter_seq_info *
|
|
|
|
__get_seq_info(struct bpf_iter_link *link)
|
|
|
|
{
|
|
|
|
const struct bpf_iter_seq_info *seq_info;
|
|
|
|
|
|
|
|
if (link->aux.map) {
|
|
|
|
seq_info = link->aux.map->ops->iter_seq_info;
|
|
|
|
if (seq_info)
|
|
|
|
return seq_info;
|
|
|
|
}
|
|
|
|
|
|
|
|
return link->tinfo->reg_info->seq_info;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:06 +08:00
|
|
|
static int iter_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct bpf_iter_link *link = inode->i_private;
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
return prepare_seq_file(file, link, __get_seq_info(link));
|
2020-05-10 01:59:06 +08:00
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:05 +08:00
|
|
|
static int iter_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *iter_priv;
|
|
|
|
struct seq_file *seq;
|
|
|
|
|
|
|
|
seq = file->private_data;
|
|
|
|
if (!seq)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
iter_priv = container_of(seq->private, struct bpf_iter_priv_data,
|
|
|
|
target_private);
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
if (iter_priv->seq_info->fini_seq_private)
|
|
|
|
iter_priv->seq_info->fini_seq_private(seq->private);
|
2020-05-10 01:59:05 +08:00
|
|
|
|
|
|
|
bpf_prog_put(iter_priv->prog);
|
|
|
|
seq->private = iter_priv;
|
|
|
|
|
|
|
|
return seq_release_private(inode, file);
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:06 +08:00
|
|
|
const struct file_operations bpf_iter_fops = {
|
|
|
|
.open = iter_open,
|
2020-05-10 01:59:05 +08:00
|
|
|
.llseek = no_llseek,
|
|
|
|
.read = bpf_seq_read,
|
|
|
|
.release = iter_release,
|
|
|
|
};
|
|
|
|
|
2020-05-14 02:02:19 +08:00
|
|
|
/* The argument reg_info will be cached in bpf_iter_target_info.
|
|
|
|
* The common practice is to declare target reg_info as
|
|
|
|
* a const static variable and passed as an argument to
|
|
|
|
* bpf_iter_reg_target().
|
|
|
|
*/
|
|
|
|
int bpf_iter_reg_target(const struct bpf_iter_reg *reg_info)
|
2020-05-10 01:58:59 +08:00
|
|
|
{
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
|
|
|
|
|
|
|
tinfo = kmalloc(sizeof(*tinfo), GFP_KERNEL);
|
|
|
|
if (!tinfo)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2020-05-14 02:02:19 +08:00
|
|
|
tinfo->reg_info = reg_info;
|
2020-05-10 01:58:59 +08:00
|
|
|
INIT_LIST_HEAD(&tinfo->list);
|
|
|
|
|
|
|
|
mutex_lock(&targets_mutex);
|
|
|
|
list_add(&tinfo->list, &targets);
|
|
|
|
mutex_unlock(&targets_mutex);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-05-14 02:02:20 +08:00
|
|
|
void bpf_iter_unreg_target(const struct bpf_iter_reg *reg_info)
|
2020-05-10 01:58:59 +08:00
|
|
|
{
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
|
|
|
bool found = false;
|
|
|
|
|
|
|
|
mutex_lock(&targets_mutex);
|
|
|
|
list_for_each_entry(tinfo, &targets, list) {
|
2020-05-14 02:02:20 +08:00
|
|
|
if (reg_info == tinfo->reg_info) {
|
2020-05-10 01:58:59 +08:00
|
|
|
list_del(&tinfo->list);
|
|
|
|
kfree(tinfo);
|
|
|
|
found = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&targets_mutex);
|
|
|
|
|
|
|
|
WARN_ON(found == false);
|
|
|
|
}
|
2020-05-10 01:59:00 +08:00
|
|
|
|
|
|
|
static void cache_btf_id(struct bpf_iter_target_info *tinfo,
|
|
|
|
struct bpf_prog *prog)
|
|
|
|
{
|
|
|
|
tinfo->btf_id = prog->aux->attach_btf_id;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bpf_iter_prog_supported(struct bpf_prog *prog)
|
|
|
|
{
|
|
|
|
const char *attach_fname = prog->aux->attach_func_name;
|
|
|
|
u32 prog_btf_id = prog->aux->attach_btf_id;
|
|
|
|
const char *prefix = BPF_ITER_FUNC_PREFIX;
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
|
|
|
int prefix_len = strlen(prefix);
|
|
|
|
bool supported = false;
|
|
|
|
|
|
|
|
if (strncmp(attach_fname, prefix, prefix_len))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
mutex_lock(&targets_mutex);
|
|
|
|
list_for_each_entry(tinfo, &targets, list) {
|
|
|
|
if (tinfo->btf_id && tinfo->btf_id == prog_btf_id) {
|
|
|
|
supported = true;
|
|
|
|
break;
|
|
|
|
}
|
2020-05-14 02:02:19 +08:00
|
|
|
if (!strcmp(attach_fname + prefix_len, tinfo->reg_info->target)) {
|
2020-05-10 01:59:00 +08:00
|
|
|
cache_btf_id(tinfo, prog);
|
|
|
|
supported = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&targets_mutex);
|
|
|
|
|
2020-05-14 02:02:21 +08:00
|
|
|
if (supported) {
|
|
|
|
prog->aux->ctx_arg_info_size = tinfo->reg_info->ctx_arg_info_size;
|
|
|
|
prog->aux->ctx_arg_info = tinfo->reg_info->ctx_arg_info;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:00 +08:00
|
|
|
return supported;
|
|
|
|
}
|
2020-05-10 01:59:01 +08:00
|
|
|
|
|
|
|
static void bpf_iter_link_release(struct bpf_link *link)
|
|
|
|
{
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
struct bpf_iter_link *iter_link =
|
|
|
|
container_of(link, struct bpf_iter_link, link);
|
|
|
|
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
if (iter_link->tinfo->reg_info->detach_target)
|
|
|
|
iter_link->tinfo->reg_info->detach_target(&iter_link->aux);
|
2020-05-10 01:59:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void bpf_iter_link_dealloc(struct bpf_link *link)
|
|
|
|
{
|
|
|
|
struct bpf_iter_link *iter_link =
|
|
|
|
container_of(link, struct bpf_iter_link, link);
|
|
|
|
|
|
|
|
kfree(iter_link);
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:02 +08:00
|
|
|
static int bpf_iter_link_replace(struct bpf_link *link,
|
|
|
|
struct bpf_prog *new_prog,
|
|
|
|
struct bpf_prog *old_prog)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
mutex_lock(&link_mutex);
|
|
|
|
if (old_prog && link->prog != old_prog) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (link->prog->type != new_prog->type ||
|
|
|
|
link->prog->expected_attach_type != new_prog->expected_attach_type ||
|
|
|
|
link->prog->aux->attach_btf_id != new_prog->aux->attach_btf_id) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
old_prog = xchg(&link->prog, new_prog);
|
|
|
|
bpf_prog_put(old_prog);
|
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
mutex_unlock(&link_mutex);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:01 +08:00
|
|
|
static const struct bpf_link_ops bpf_iter_link_lops = {
|
|
|
|
.release = bpf_iter_link_release,
|
|
|
|
.dealloc = bpf_iter_link_dealloc,
|
2020-05-10 01:59:02 +08:00
|
|
|
.update_prog = bpf_iter_link_replace,
|
2020-05-10 01:59:01 +08:00
|
|
|
};
|
|
|
|
|
2020-05-10 01:59:06 +08:00
|
|
|
bool bpf_link_is_iter(struct bpf_link *link)
|
|
|
|
{
|
|
|
|
return link->ops == &bpf_iter_link_lops;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:01 +08:00
|
|
|
int bpf_iter_link_attach(const union bpf_attr *attr, struct bpf_prog *prog)
|
|
|
|
{
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
union bpf_iter_link_info __user *ulinfo;
|
2020-05-10 01:59:01 +08:00
|
|
|
struct bpf_link_primer link_primer;
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
union bpf_iter_link_info linfo;
|
2020-05-10 01:59:01 +08:00
|
|
|
struct bpf_iter_link *link;
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
u32 prog_btf_id, linfo_len;
|
2020-05-10 01:59:01 +08:00
|
|
|
bool existed = false;
|
|
|
|
int err;
|
|
|
|
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
if (attr->link_create.target_fd || attr->link_create.flags)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
memset(&linfo, 0, sizeof(union bpf_iter_link_info));
|
|
|
|
|
|
|
|
ulinfo = u64_to_user_ptr(attr->link_create.iter_info);
|
|
|
|
linfo_len = attr->link_create.iter_info_len;
|
|
|
|
if (!ulinfo ^ !linfo_len)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (ulinfo) {
|
|
|
|
err = bpf_check_uarg_tail_zero(ulinfo, sizeof(linfo),
|
|
|
|
linfo_len);
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
linfo_len = min_t(u32, linfo_len, sizeof(linfo));
|
|
|
|
if (copy_from_user(&linfo, ulinfo, linfo_len))
|
|
|
|
return -EFAULT;
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:01 +08:00
|
|
|
prog_btf_id = prog->aux->attach_btf_id;
|
|
|
|
mutex_lock(&targets_mutex);
|
|
|
|
list_for_each_entry(tinfo, &targets, list) {
|
|
|
|
if (tinfo->btf_id == prog_btf_id) {
|
|
|
|
existed = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&targets_mutex);
|
|
|
|
if (!existed)
|
|
|
|
return -ENOENT;
|
|
|
|
|
|
|
|
link = kzalloc(sizeof(*link), GFP_USER | __GFP_NOWARN);
|
|
|
|
if (!link)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
bpf_link_init(&link->link, BPF_LINK_TYPE_ITER, &bpf_iter_link_lops, prog);
|
|
|
|
link->tinfo = tinfo;
|
|
|
|
|
|
|
|
err = bpf_link_prime(&link->link, &link_primer);
|
|
|
|
if (err) {
|
|
|
|
kfree(link);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
if (tinfo->reg_info->attach_target) {
|
|
|
|
err = tinfo->reg_info->attach_target(prog, &linfo, &link->aux);
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
if (err) {
|
bpf: Change uapi for bpf iterator map elements
Commit a5cbe05a6673 ("bpf: Implement bpf iterator for
map elements") added bpf iterator support for
map elements. The map element bpf iterator requires
info to identify a particular map. In the above
commit, the attr->link_create.target_fd is used
to carry map_fd and an enum bpf_iter_link_info
is added to uapi to specify the target_fd actually
representing a map_fd:
enum bpf_iter_link_info {
BPF_ITER_LINK_UNSPEC = 0,
BPF_ITER_LINK_MAP_FD = 1,
MAX_BPF_ITER_LINK_INFO,
};
This is an extensible approach as we can grow
enumerator for pid, cgroup_id, etc. and we can
unionize target_fd for pid, cgroup_id, etc.
But in the future, there are chances that
more complex customization may happen, e.g.,
for tasks, it could be filtered based on
both cgroup_id and user_id.
This patch changed the uapi to have fields
__aligned_u64 iter_info;
__u32 iter_info_len;
for additional iter_info for link_create.
The iter_info is defined as
union bpf_iter_link_info {
struct {
__u32 map_fd;
} map;
};
So future extension for additional customization
will be easier. The bpf_iter_link_info will be
passed to target callback to validate and generic
bpf_iter framework does not need to deal it any
more.
Note that map_fd = 0 will be considered invalid
and -EBADF will be returned to user space.
Fixes: a5cbe05a6673 ("bpf: Implement bpf iterator for map elements")
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Andrii Nakryiko <andriin@fb.com>
Acked-by: John Fastabend <john.fastabend@gmail.com>
Link: https://lore.kernel.org/bpf/20200805055056.1457463-1-yhs@fb.com
2020-08-05 13:50:56 +08:00
|
|
|
bpf_link_cleanup(&link_primer);
|
|
|
|
return err;
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-05-10 01:59:01 +08:00
|
|
|
return bpf_link_settle(&link_primer);
|
|
|
|
}
|
2020-05-10 01:59:05 +08:00
|
|
|
|
|
|
|
static void init_seq_meta(struct bpf_iter_priv_data *priv_data,
|
|
|
|
struct bpf_iter_target_info *tinfo,
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
const struct bpf_iter_seq_info *seq_info,
|
2020-05-10 01:59:05 +08:00
|
|
|
struct bpf_prog *prog)
|
|
|
|
{
|
|
|
|
priv_data->tinfo = tinfo;
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
priv_data->seq_info = seq_info;
|
2020-05-10 01:59:05 +08:00
|
|
|
priv_data->prog = prog;
|
|
|
|
priv_data->session_id = atomic64_inc_return(&session_id);
|
|
|
|
priv_data->seq_num = 0;
|
|
|
|
priv_data->done_stop = false;
|
|
|
|
}
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
static int prepare_seq_file(struct file *file, struct bpf_iter_link *link,
|
|
|
|
const struct bpf_iter_seq_info *seq_info)
|
2020-05-10 01:59:05 +08:00
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *priv_data;
|
|
|
|
struct bpf_iter_target_info *tinfo;
|
|
|
|
struct bpf_prog *prog;
|
|
|
|
u32 total_priv_dsize;
|
|
|
|
struct seq_file *seq;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
mutex_lock(&link_mutex);
|
|
|
|
prog = link->link.prog;
|
|
|
|
bpf_prog_inc(prog);
|
|
|
|
mutex_unlock(&link_mutex);
|
|
|
|
|
|
|
|
tinfo = link->tinfo;
|
|
|
|
total_priv_dsize = offsetof(struct bpf_iter_priv_data, target_private) +
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
seq_info->seq_priv_size;
|
|
|
|
priv_data = __seq_open_private(file, seq_info->seq_ops,
|
2020-05-14 02:02:19 +08:00
|
|
|
total_priv_dsize);
|
2020-05-10 01:59:05 +08:00
|
|
|
if (!priv_data) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto release_prog;
|
|
|
|
}
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
if (seq_info->init_seq_private) {
|
|
|
|
err = seq_info->init_seq_private(priv_data->target_private, &link->aux);
|
2020-05-10 01:59:05 +08:00
|
|
|
if (err)
|
|
|
|
goto release_seq_file;
|
|
|
|
}
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
init_seq_meta(priv_data, tinfo, seq_info, prog);
|
2020-05-10 01:59:05 +08:00
|
|
|
seq = file->private_data;
|
|
|
|
seq->private = priv_data->target_private;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
release_seq_file:
|
|
|
|
seq_release_private(file->f_inode, file);
|
|
|
|
file->private_data = NULL;
|
|
|
|
release_prog:
|
|
|
|
bpf_prog_put(prog);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bpf_iter_new_fd(struct bpf_link *link)
|
|
|
|
{
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
struct bpf_iter_link *iter_link;
|
2020-05-10 01:59:05 +08:00
|
|
|
struct file *file;
|
|
|
|
unsigned int flags;
|
|
|
|
int err, fd;
|
|
|
|
|
|
|
|
if (link->ops != &bpf_iter_link_lops)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
flags = O_RDONLY | O_CLOEXEC;
|
|
|
|
fd = get_unused_fd_flags(flags);
|
|
|
|
if (fd < 0)
|
|
|
|
return fd;
|
|
|
|
|
|
|
|
file = anon_inode_getfile("bpf_iter", &bpf_iter_fops, NULL, flags);
|
|
|
|
if (IS_ERR(file)) {
|
|
|
|
err = PTR_ERR(file);
|
|
|
|
goto free_fd;
|
|
|
|
}
|
|
|
|
|
bpf: Implement bpf iterator for map elements
The bpf iterator for map elements are implemented.
The bpf program will receive four parameters:
bpf_iter_meta *meta: the meta data
bpf_map *map: the bpf_map whose elements are traversed
void *key: the key of one element
void *value: the value of the same element
Here, meta and map pointers are always valid, and
key has register type PTR_TO_RDONLY_BUF_OR_NULL and
value has register type PTR_TO_RDWR_BUF_OR_NULL.
The kernel will track the access range of key and value
during verification time. Later, these values will be compared
against the values in the actual map to ensure all accesses
are within range.
A new field iter_seq_info is added to bpf_map_ops which
is used to add map type specific information, i.e., seq_ops,
init/fini seq_file func and seq_file private data size.
Subsequent patches will have actual implementation
for bpf_map_ops->iter_seq_info.
In user space, BPF_ITER_LINK_MAP_FD needs to be
specified in prog attr->link_create.flags, which indicates
that attr->link_create.target_fd is a map_fd.
The reason for such an explicit flag is for possible
future cases where one bpf iterator may allow more than
one possible customization, e.g., pid and cgroup id for
task_file.
Current kernel internal implementation only allows
the target to register at most one required bpf_iter_link_info.
To support the above case, optional bpf_iter_link_info's
are needed, the target can be extended to register such link
infos, and user provided link_info needs to match one of
target supported ones.
Signed-off-by: Yonghong Song <yhs@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Link: https://lore.kernel.org/bpf/20200723184112.590360-1-yhs@fb.com
2020-07-24 02:41:12 +08:00
|
|
|
iter_link = container_of(link, struct bpf_iter_link, link);
|
|
|
|
err = prepare_seq_file(file, iter_link, __get_seq_info(iter_link));
|
2020-05-10 01:59:05 +08:00
|
|
|
if (err)
|
|
|
|
goto free_file;
|
|
|
|
|
|
|
|
fd_install(fd, file);
|
|
|
|
return fd;
|
|
|
|
|
|
|
|
free_file:
|
|
|
|
fput(file);
|
|
|
|
free_fd:
|
|
|
|
put_unused_fd(fd);
|
|
|
|
return err;
|
|
|
|
}
|
2020-05-10 01:59:07 +08:00
|
|
|
|
|
|
|
struct bpf_prog *bpf_iter_get_info(struct bpf_iter_meta *meta, bool in_stop)
|
|
|
|
{
|
|
|
|
struct bpf_iter_priv_data *iter_priv;
|
|
|
|
struct seq_file *seq;
|
|
|
|
void *seq_priv;
|
|
|
|
|
|
|
|
seq = meta->seq;
|
|
|
|
if (seq->file->f_op != &bpf_iter_fops)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
seq_priv = seq->private;
|
|
|
|
iter_priv = container_of(seq_priv, struct bpf_iter_priv_data,
|
|
|
|
target_private);
|
|
|
|
|
|
|
|
if (in_stop && iter_priv->done_stop)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
meta->session_id = iter_priv->session_id;
|
|
|
|
meta->seq_num = iter_priv->seq_num;
|
|
|
|
|
|
|
|
return iter_priv->prog;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bpf_iter_run_prog(struct bpf_prog *prog, void *ctx)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
migrate_disable();
|
|
|
|
ret = BPF_PROG_RUN(prog, ctx);
|
|
|
|
migrate_enable();
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
2020-05-14 02:02:18 +08:00
|
|
|
/* bpf program can only return 0 or 1:
|
|
|
|
* 0 : okay
|
|
|
|
* 1 : retry the same object
|
|
|
|
* The bpf_iter_run_prog() return value
|
|
|
|
* will be seq_ops->show() return value.
|
|
|
|
*/
|
2020-05-10 01:59:07 +08:00
|
|
|
return ret == 0 ? 0 : -EAGAIN;
|
|
|
|
}
|