mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
synced 2026-08-31 07:03:28 -04:00
Merge branch 'bpf-disable-preemption-in-stack-map-code'
Jiri Olsa says: ==================== bpf: Disable preemption in stack map code hi, we need to disable preemption for get_perf_callchain and keep it disabled as long as we are accessing its returned trace entries buffer. This patchset refactors both bpf_get_stack and bpf_get_stackid helpers as suggested by Andrii [1] before applying the actual preemption fix. Note the initial fix was sent by Tao Chen [2], but there was no follow up on this since February, hence this post. thanks, jirka v1: https://lore.kernel.org/bpf/20260720085351.655075-1-jolsa@kernel.org/ v2: https://lore.kernel.org/bpf/20260729083807.1588544-1-jolsa@kernel.org/ v3 changes: - pass flags rgument to callchain_finalize [sashiko] - renamed err label to out in bpf_get_stackid_pe [sashiko] - used scoped_guard in bpf_get_stackid [Leon] - replaced trace->nr modification from *_pe helpers with length argument (new patches 11,12) [Andrii] v2 changes: - removed several unused functions arguments [sashiko] - restore trace-nr value fix in bpf_get_stack_pe [sashiko] - kept rcu locking together with preemption disable in __bpf_get_stack [sashiko] - clear buf on error paths in __bpf_get_task_stack [sashiko] [1] https://lore.kernel.org/bpf/CAEf4BzZwvAUgLwz-M0Y_NJLTmedyY9U6s7LrSmn751hQdTP4Uw@mail.gmail.com/ [2] https://lore.kernel.org/bpf/20260206090653.1336687-1-chen.dylane@linux.dev/ --- ==================== Link: https://patch.msgid.link/20260803210149.296496-1-jolsa@kernel.org Signed-off-by: Andrii Nakryiko <andrii@kernel.org>
This commit is contained in:
@@ -504,78 +504,116 @@ get_callchain_entry_for_task(struct task_struct *task, u32 max_depth)
|
||||
#endif
|
||||
}
|
||||
|
||||
static long __bpf_get_stackid(struct bpf_map *map,
|
||||
struct perf_callchain_entry *trace, u64 flags)
|
||||
struct stackid {
|
||||
struct stack_map_bucket *bucket;
|
||||
const u64 *ips;
|
||||
u32 nr;
|
||||
u32 len;
|
||||
u32 hash;
|
||||
u32 id;
|
||||
bool hash_matches;
|
||||
};
|
||||
|
||||
static int stackid_init(struct stackid *stackid, struct bpf_map *map,
|
||||
const struct perf_callchain_entry *trace, u32 trace_nr, u64 flags)
|
||||
{
|
||||
struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map);
|
||||
struct stack_map_bucket *bucket, *new_bucket, *old_bucket;
|
||||
u32 hash, id, trace_nr, trace_len, i, max_depth;
|
||||
u32 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
u64 *ips;
|
||||
bool hash_matches;
|
||||
u32 max_depth;
|
||||
|
||||
if (trace->nr <= skip)
|
||||
if (trace_nr <= skip)
|
||||
/* skipping more than usable stack trace */
|
||||
return -EFAULT;
|
||||
|
||||
max_depth = stack_map_calculate_max_depth(map->value_size, stack_map_data_size(map), flags);
|
||||
trace_nr = min_t(u32, trace->nr - skip, max_depth - skip);
|
||||
trace_len = trace_nr * sizeof(u64);
|
||||
ips = trace->ip + skip;
|
||||
hash = jhash2((u32 *)ips, trace_len / sizeof(u32), 0);
|
||||
id = hash & (smap->n_buckets - 1);
|
||||
bucket = READ_ONCE(smap->buckets[id]);
|
||||
stackid->nr = min_t(u32, trace_nr - skip, max_depth - skip);
|
||||
stackid->len = stackid->nr * sizeof(u64);
|
||||
stackid->ips = trace->ip + skip;
|
||||
stackid->hash = jhash2((const u32 *)stackid->ips, stackid->len / sizeof(u32), 0);
|
||||
stackid->id = stackid->hash & (smap->n_buckets - 1);
|
||||
stackid->bucket = READ_ONCE(smap->buckets[stackid->id]);
|
||||
stackid->hash_matches = stackid->bucket && stackid->bucket->hash == stackid->hash;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int stackid_fastpath(struct stackid *stackid, struct bpf_map *map,
|
||||
const struct perf_callchain_entry *trace, u32 trace_nr,
|
||||
u64 flags)
|
||||
{
|
||||
int err;
|
||||
|
||||
err = stackid_init(stackid, map, trace, trace_nr, flags);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
hash_matches = bucket && bucket->hash == hash;
|
||||
/* fast cmp */
|
||||
if (hash_matches && flags & BPF_F_FAST_STACK_CMP)
|
||||
return id;
|
||||
if (stackid->hash_matches && flags & BPF_F_FAST_STACK_CMP)
|
||||
return stackid->id;
|
||||
|
||||
if (stack_map_use_build_id(map))
|
||||
return -ENOENT;
|
||||
if (stackid->hash_matches && stackid->bucket->nr == stackid->nr &&
|
||||
memcmp(stackid->bucket->data, stackid->ips, stackid->len) == 0)
|
||||
return stackid->id;
|
||||
if (stackid->bucket && !(flags & BPF_F_REUSE_STACKID))
|
||||
return -EEXIST;
|
||||
return -ENOENT;
|
||||
}
|
||||
|
||||
static struct stack_map_bucket *
|
||||
stackid_new_bucket(struct stackid *stackid, struct bpf_map *map)
|
||||
{
|
||||
struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map);
|
||||
struct bpf_stack_build_id *id_offs;
|
||||
struct stack_map_bucket *bucket;
|
||||
u32 i;
|
||||
|
||||
bucket = (struct stack_map_bucket *) pcpu_freelist_pop(&smap->freelist);
|
||||
if (unlikely(!bucket))
|
||||
return NULL;
|
||||
|
||||
if (stack_map_use_build_id(map)) {
|
||||
id_offs = (struct bpf_stack_build_id *)bucket->data;
|
||||
for (i = 0; i < stackid->nr; i++)
|
||||
id_offs[i].ip = stackid->ips[i];
|
||||
} else {
|
||||
memcpy(bucket->data, stackid->ips, stackid->len);
|
||||
}
|
||||
|
||||
bucket->hash = stackid->hash;
|
||||
bucket->nr = stackid->nr;
|
||||
return bucket;
|
||||
}
|
||||
|
||||
static long stackid_install(struct stackid *stackid, struct bpf_map *map,
|
||||
struct stack_map_bucket *new_bucket, u64 flags)
|
||||
{
|
||||
struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map);
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
struct stack_map_bucket *old_bucket;
|
||||
u32 trace_len;
|
||||
|
||||
if (stack_map_use_build_id(map)) {
|
||||
struct bpf_stack_build_id *id_offs;
|
||||
|
||||
/* for build_id+offset, pop a bucket before slow cmp */
|
||||
new_bucket = (struct stack_map_bucket *)
|
||||
pcpu_freelist_pop(&smap->freelist);
|
||||
if (unlikely(!new_bucket))
|
||||
return -ENOMEM;
|
||||
new_bucket->nr = trace_nr;
|
||||
id_offs = (struct bpf_stack_build_id *)new_bucket->data;
|
||||
for (i = 0; i < trace_nr; i++)
|
||||
id_offs[i].ip = ips[i];
|
||||
stack_map_get_build_id_offset(id_offs, trace_nr, user, false /* !may_fault */);
|
||||
trace_len = trace_nr * sizeof(struct bpf_stack_build_id);
|
||||
if (hash_matches && bucket->nr == trace_nr &&
|
||||
memcmp(bucket->data, new_bucket->data, trace_len) == 0) {
|
||||
stack_map_get_build_id_offset(id_offs, stackid->nr, user, false /* !may_fault */);
|
||||
trace_len = stackid->nr * sizeof(struct bpf_stack_build_id);
|
||||
if (stackid->hash_matches && stackid->bucket->nr == stackid->nr &&
|
||||
memcmp(stackid->bucket->data, new_bucket->data, trace_len) == 0) {
|
||||
pcpu_freelist_push(&smap->freelist, &new_bucket->fnode);
|
||||
return id;
|
||||
return stackid->id;
|
||||
}
|
||||
if (bucket && !(flags & BPF_F_REUSE_STACKID)) {
|
||||
if (stackid->bucket && !(flags & BPF_F_REUSE_STACKID)) {
|
||||
pcpu_freelist_push(&smap->freelist, &new_bucket->fnode);
|
||||
return -EEXIST;
|
||||
}
|
||||
} else {
|
||||
if (hash_matches && bucket->nr == trace_nr &&
|
||||
memcmp(bucket->data, ips, trace_len) == 0)
|
||||
return id;
|
||||
if (bucket && !(flags & BPF_F_REUSE_STACKID))
|
||||
return -EEXIST;
|
||||
|
||||
new_bucket = (struct stack_map_bucket *)
|
||||
pcpu_freelist_pop(&smap->freelist);
|
||||
if (unlikely(!new_bucket))
|
||||
return -ENOMEM;
|
||||
memcpy(new_bucket->data, ips, trace_len);
|
||||
}
|
||||
|
||||
new_bucket->hash = hash;
|
||||
new_bucket->nr = trace_nr;
|
||||
|
||||
old_bucket = xchg(&smap->buckets[id], new_bucket);
|
||||
old_bucket = xchg(&smap->buckets[stackid->id], new_bucket);
|
||||
if (old_bucket)
|
||||
pcpu_freelist_push(&smap->freelist, &old_bucket->fnode);
|
||||
return id;
|
||||
return stackid->id;
|
||||
}
|
||||
|
||||
BPF_CALL_3(bpf_get_stackid, struct pt_regs *, regs, struct bpf_map *, map,
|
||||
@@ -583,23 +621,36 @@ BPF_CALL_3(bpf_get_stackid, struct pt_regs *, regs, struct bpf_map *, map,
|
||||
{
|
||||
u32 elem_size = stack_map_data_size(map);
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
struct stack_map_bucket *new_bucket;
|
||||
struct perf_callchain_entry *trace;
|
||||
struct stackid stackid;
|
||||
bool kernel = !user;
|
||||
u32 max_depth;
|
||||
int err;
|
||||
|
||||
if (unlikely(flags & ~(BPF_F_SKIP_FIELD_MASK | BPF_F_USER_STACK |
|
||||
BPF_F_FAST_STACK_CMP | BPF_F_REUSE_STACKID)))
|
||||
return -EINVAL;
|
||||
|
||||
max_depth = stack_map_calculate_max_depth(map->value_size, elem_size, flags);
|
||||
trace = get_perf_callchain(regs, kernel, user, max_depth,
|
||||
false, false, 0);
|
||||
|
||||
if (unlikely(!trace))
|
||||
/* couldn't fetch the stack trace */
|
||||
return -EFAULT;
|
||||
scoped_guard(preempt) {
|
||||
trace = get_perf_callchain(regs, kernel, user, max_depth,
|
||||
false, false, 0);
|
||||
if (unlikely(!trace))
|
||||
/* couldn't fetch the stack trace */
|
||||
return -EFAULT;
|
||||
|
||||
return __bpf_get_stackid(map, trace, flags);
|
||||
err = stackid_fastpath(&stackid, map, trace, trace->nr, flags);
|
||||
if (err != -ENOENT)
|
||||
return err;
|
||||
|
||||
new_bucket = stackid_new_bucket(&stackid, map);
|
||||
if (!new_bucket)
|
||||
return -ENOMEM;
|
||||
}
|
||||
|
||||
return stackid_install(&stackid, map, new_bucket, flags);
|
||||
}
|
||||
|
||||
const struct bpf_func_proto bpf_get_stackid_proto = {
|
||||
@@ -611,7 +662,7 @@ const struct bpf_func_proto bpf_get_stackid_proto = {
|
||||
.arg3_type = ARG_ANYTHING,
|
||||
};
|
||||
|
||||
static __u64 count_kernel_ip(struct perf_callchain_entry *trace)
|
||||
static __u64 count_kernel_ip(const struct perf_callchain_entry *trace)
|
||||
{
|
||||
__u64 nr_kernel = 0;
|
||||
|
||||
@@ -626,10 +677,13 @@ static __u64 count_kernel_ip(struct perf_callchain_entry *trace)
|
||||
BPF_CALL_3(bpf_get_stackid_pe, struct bpf_perf_event_data_kern *, ctx,
|
||||
struct bpf_map *, map, u64, flags)
|
||||
{
|
||||
const struct perf_callchain_entry *trace;
|
||||
struct perf_event *event = ctx->event;
|
||||
struct perf_callchain_entry *trace;
|
||||
struct stack_map_bucket *new_bucket;
|
||||
struct stackid stackid;
|
||||
bool kernel, user;
|
||||
__u64 nr_kernel;
|
||||
u32 trace_nr;
|
||||
int ret;
|
||||
|
||||
/* perf_sample_data doesn't have callchain, use bpf_get_stackid */
|
||||
@@ -649,26 +703,28 @@ BPF_CALL_3(bpf_get_stackid_pe, struct bpf_perf_event_data_kern *, ctx,
|
||||
return -EFAULT;
|
||||
|
||||
nr_kernel = count_kernel_ip(trace);
|
||||
__u64 nr = trace->nr; /* save original */
|
||||
|
||||
if (kernel) {
|
||||
trace->nr = nr_kernel;
|
||||
ret = __bpf_get_stackid(map, trace, flags);
|
||||
trace_nr = nr_kernel;
|
||||
} else { /* user */
|
||||
u64 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
|
||||
trace_nr = trace->nr;
|
||||
skip += nr_kernel;
|
||||
if (skip > BPF_F_SKIP_FIELD_MASK)
|
||||
return -EFAULT;
|
||||
|
||||
flags = (flags & ~BPF_F_SKIP_FIELD_MASK) | skip;
|
||||
ret = __bpf_get_stackid(map, trace, flags);
|
||||
}
|
||||
|
||||
/* restore nr */
|
||||
trace->nr = nr;
|
||||
ret = stackid_fastpath(&stackid, map, trace, trace_nr, flags);
|
||||
if (ret != -ENOENT)
|
||||
return ret;
|
||||
|
||||
return ret;
|
||||
new_bucket = stackid_new_bucket(&stackid, map);
|
||||
if (new_bucket)
|
||||
return stackid_install(&stackid, map, new_bucket, flags);
|
||||
return -ENOMEM;
|
||||
}
|
||||
|
||||
const struct bpf_func_proto bpf_get_stackid_proto_pe = {
|
||||
@@ -680,19 +736,55 @@ const struct bpf_func_proto bpf_get_stackid_proto_pe = {
|
||||
.arg3_type = ARG_ANYTHING,
|
||||
};
|
||||
|
||||
static u32 callchain_store(const struct perf_callchain_entry *trace, u32 trace_nr,
|
||||
void *buf, u32 elem_size, u64 flags)
|
||||
{
|
||||
bool user_build_id = flags & BPF_F_USER_BUILD_ID;
|
||||
u32 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
const u64 *ips;
|
||||
u32 copy_len;
|
||||
|
||||
trace_nr = trace_nr - skip;
|
||||
copy_len = trace_nr * elem_size;
|
||||
|
||||
ips = trace->ip + skip;
|
||||
if (user_build_id) {
|
||||
struct bpf_stack_build_id *id_offs = buf;
|
||||
|
||||
for (u32 i = 0; i < trace_nr; i++)
|
||||
id_offs[i].ip = ips[i];
|
||||
} else {
|
||||
memcpy(buf, ips, copy_len);
|
||||
}
|
||||
return trace_nr;
|
||||
}
|
||||
|
||||
static long callchain_finalize(void *buf, u32 size, u32 trace_nr, u32 elem_size,
|
||||
u64 flags, bool may_fault)
|
||||
{
|
||||
bool user_build_id = flags & BPF_F_USER_BUILD_ID;
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
u32 copy_len = trace_nr * elem_size;
|
||||
|
||||
if (user_build_id)
|
||||
stack_map_get_build_id_offset(buf, trace_nr, user, may_fault);
|
||||
|
||||
if (size > copy_len)
|
||||
memset(buf + copy_len, 0, size - copy_len);
|
||||
return copy_len;
|
||||
}
|
||||
|
||||
static long __bpf_get_stack(struct pt_regs *regs, struct task_struct *task,
|
||||
struct perf_callchain_entry *trace_in,
|
||||
void *buf, u32 size, u64 flags, bool may_fault)
|
||||
{
|
||||
u32 trace_nr, copy_len, elem_size, max_depth;
|
||||
bool user_build_id = flags & BPF_F_USER_BUILD_ID;
|
||||
bool crosstask = task && task != current;
|
||||
u32 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
struct perf_callchain_entry *trace;
|
||||
u32 trace_nr, elem_size, max_depth;
|
||||
bool kernel = !user;
|
||||
int err = -EINVAL;
|
||||
u64 *ips;
|
||||
|
||||
if (unlikely(flags & ~(BPF_F_SKIP_FIELD_MASK | BPF_F_USER_STACK |
|
||||
BPF_F_USER_BUILD_ID)))
|
||||
@@ -718,13 +810,11 @@ static long __bpf_get_stack(struct pt_regs *regs, struct task_struct *task,
|
||||
|
||||
max_depth = stack_map_calculate_max_depth(size, elem_size, flags);
|
||||
|
||||
preempt_disable();
|
||||
if (may_fault)
|
||||
rcu_read_lock(); /* need RCU for perf's callchain below */
|
||||
|
||||
if (trace_in) {
|
||||
trace = trace_in;
|
||||
trace->nr = min_t(u32, trace->nr, max_depth);
|
||||
} else if (kernel && task) {
|
||||
if (kernel && task) {
|
||||
trace = get_callchain_entry_for_task(task, max_depth);
|
||||
} else {
|
||||
trace = get_perf_callchain(regs, kernel, user, max_depth,
|
||||
@@ -734,33 +824,18 @@ static long __bpf_get_stack(struct pt_regs *regs, struct task_struct *task,
|
||||
if (unlikely(!trace) || trace->nr < skip) {
|
||||
if (may_fault)
|
||||
rcu_read_unlock();
|
||||
preempt_enable();
|
||||
goto err_fault;
|
||||
}
|
||||
|
||||
trace_nr = trace->nr - skip;
|
||||
copy_len = trace_nr * elem_size;
|
||||
trace_nr = callchain_store(trace, trace->nr, buf, elem_size, flags);
|
||||
|
||||
ips = trace->ip + skip;
|
||||
if (user_build_id) {
|
||||
struct bpf_stack_build_id *id_offs = buf;
|
||||
u32 i;
|
||||
|
||||
for (i = 0; i < trace_nr; i++)
|
||||
id_offs[i].ip = ips[i];
|
||||
} else {
|
||||
memcpy(buf, ips, copy_len);
|
||||
}
|
||||
|
||||
/* trace/ips should not be dereferenced after this point */
|
||||
/* trace should not be dereferenced after this point */
|
||||
if (may_fault)
|
||||
rcu_read_unlock();
|
||||
preempt_enable();
|
||||
|
||||
if (user_build_id)
|
||||
stack_map_get_build_id_offset(buf, trace_nr, user, may_fault);
|
||||
|
||||
if (size > copy_len)
|
||||
memset(buf + copy_len, 0, size - copy_len);
|
||||
return copy_len;
|
||||
return callchain_finalize(buf, size, trace_nr, elem_size, flags, may_fault);
|
||||
|
||||
err_fault:
|
||||
err = -EFAULT;
|
||||
@@ -772,7 +847,7 @@ static long __bpf_get_stack(struct pt_regs *regs, struct task_struct *task,
|
||||
BPF_CALL_4(bpf_get_stack, struct pt_regs *, regs, void *, buf, u32, size,
|
||||
u64, flags)
|
||||
{
|
||||
return __bpf_get_stack(regs, NULL, NULL, buf, size, flags, false /* !may_fault */);
|
||||
return __bpf_get_stack(regs, NULL, buf, size, flags, false /* !may_fault */);
|
||||
}
|
||||
|
||||
const struct bpf_func_proto bpf_get_stack_proto = {
|
||||
@@ -788,7 +863,7 @@ const struct bpf_func_proto bpf_get_stack_proto = {
|
||||
BPF_CALL_4(bpf_get_stack_sleepable, struct pt_regs *, regs, void *, buf, u32, size,
|
||||
u64, flags)
|
||||
{
|
||||
return __bpf_get_stack(regs, NULL, NULL, buf, size, flags, true /* may_fault */);
|
||||
return __bpf_get_stack(regs, NULL, buf, size, flags, true /* may_fault */);
|
||||
}
|
||||
|
||||
const struct bpf_func_proto bpf_get_stack_sleepable_proto = {
|
||||
@@ -807,14 +882,17 @@ static long __bpf_get_task_stack(struct task_struct *task, void *buf, u32 size,
|
||||
struct pt_regs *regs;
|
||||
long res = -EINVAL;
|
||||
|
||||
if (!try_get_task_stack(task))
|
||||
if (!try_get_task_stack(task)) {
|
||||
memset(buf, 0, size);
|
||||
return -EFAULT;
|
||||
}
|
||||
|
||||
regs = task_pt_regs(task);
|
||||
if (regs)
|
||||
res = __bpf_get_stack(regs, task, NULL, buf, size, flags, may_fault);
|
||||
res = __bpf_get_stack(regs, task, buf, size, flags, may_fault);
|
||||
else
|
||||
memset(buf, 0, size);
|
||||
put_task_stack(task);
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
@@ -852,18 +930,44 @@ const struct bpf_func_proto bpf_get_task_stack_sleepable_proto = {
|
||||
.arg4_type = ARG_ANYTHING,
|
||||
};
|
||||
|
||||
static int __bpf_get_stack_pe(const struct perf_callchain_entry *trace, u32 trace_nr,
|
||||
void *buf, u32 size, u64 flags)
|
||||
{
|
||||
bool user_build_id = flags & BPF_F_USER_BUILD_ID;
|
||||
u64 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
bool user = flags & BPF_F_USER_STACK;
|
||||
u32 elem_size, max_depth, nr_trace;
|
||||
bool kernel = !user;
|
||||
|
||||
if (kernel && user_build_id)
|
||||
return -EINVAL;
|
||||
|
||||
elem_size = user_build_id ? sizeof(struct bpf_stack_build_id) : sizeof(u64);
|
||||
if (unlikely(size % elem_size))
|
||||
return -EINVAL;
|
||||
|
||||
max_depth = stack_map_calculate_max_depth(size, elem_size, flags);
|
||||
trace_nr = min_t(u32, trace_nr, max_depth);
|
||||
|
||||
if (trace_nr < skip)
|
||||
return -EFAULT;
|
||||
|
||||
nr_trace = callchain_store(trace, trace_nr, buf, elem_size, flags);
|
||||
return callchain_finalize(buf, size, nr_trace, elem_size, flags, false /* !may_fault */);
|
||||
}
|
||||
|
||||
BPF_CALL_4(bpf_get_stack_pe, struct bpf_perf_event_data_kern *, ctx,
|
||||
void *, buf, u32, size, u64, flags)
|
||||
{
|
||||
struct pt_regs *regs = (struct pt_regs *)(ctx->regs);
|
||||
const struct perf_callchain_entry *trace;
|
||||
struct perf_event *event = ctx->event;
|
||||
struct perf_callchain_entry *trace;
|
||||
bool kernel, user;
|
||||
int err = -EINVAL;
|
||||
__u64 nr_kernel;
|
||||
|
||||
if (!(event->attr.sample_type & PERF_SAMPLE_CALLCHAIN))
|
||||
return __bpf_get_stack(regs, NULL, NULL, buf, size, flags, false /* !may_fault */);
|
||||
return __bpf_get_stack(regs, NULL, buf, size, flags, false /* !may_fault */);
|
||||
|
||||
if (unlikely(flags & ~(BPF_F_SKIP_FIELD_MASK | BPF_F_USER_STACK |
|
||||
BPF_F_USER_BUILD_ID)))
|
||||
@@ -880,27 +984,20 @@ BPF_CALL_4(bpf_get_stack_pe, struct bpf_perf_event_data_kern *, ctx,
|
||||
nr_kernel = count_kernel_ip(trace);
|
||||
|
||||
if (kernel) {
|
||||
__u64 nr = trace->nr;
|
||||
|
||||
trace->nr = nr_kernel;
|
||||
err = __bpf_get_stack(regs, NULL, trace, buf, size, flags, false /* !may_fault */);
|
||||
|
||||
/* restore nr */
|
||||
trace->nr = nr;
|
||||
err = __bpf_get_stack_pe(trace, nr_kernel, buf, size, flags);
|
||||
} else { /* user */
|
||||
u64 skip = flags & BPF_F_SKIP_FIELD_MASK;
|
||||
|
||||
skip += nr_kernel;
|
||||
if (skip > BPF_F_SKIP_FIELD_MASK)
|
||||
goto clear;
|
||||
|
||||
flags = (flags & ~BPF_F_SKIP_FIELD_MASK) | skip;
|
||||
err = __bpf_get_stack(regs, NULL, trace, buf, size, flags, false /* !may_fault */);
|
||||
err = __bpf_get_stack_pe(trace, trace->nr, buf, size, flags);
|
||||
}
|
||||
return err;
|
||||
|
||||
clear:
|
||||
memset(buf, 0, size);
|
||||
if (err < 0)
|
||||
memset(buf, 0, size);
|
||||
return err;
|
||||
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user