644 lines · 16.9 KB · C
RawDownload
	else		memcpy(buf, ips, copy_len); 	if (size > copy_len)		memset(buf + copy_len, 0, size - copy_len);	return copy_len; err_fault:	err = -EFAULT;clear:	memset(buf, 0, size);	return err;} const struct bpf_func_proto bpf_get_stack_proto = {	.func		= bpf_get_stack,	.gpl_only	= true,	.ret_type	= RET_INTEGER,	.arg1_type	= ARG_PTR_TO_CTX,	.arg2_type	= ARG_PTR_TO_UNINIT_MEM,	.arg3_type	= ARG_CONST_SIZE_OR_ZERO,	.arg4_type	= ARG_ANYTHING,}; /* Called from eBPF program */static void *stack_map_lookup_elem(struct bpf_map *map, void *key){	return ERR_PTR(-EOPNOTSUPP);} /* Called from syscall */int bpf_stackmap_copy(struct bpf_map *map, void *key, void *value){	struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map);	struct stack_map_bucket *bucket, *old_bucket;	u32 id = *(u32 *)key, trace_len; 	if (unlikely(id >= smap->n_buckets))		return -ENOENT; 	bucket = xchg(&smap->buckets[id], NULL);	if (!bucket)		return -ENOENT; 	trace_len = bucket->nr * stack_map_data_size(map);	memcpy(value, bucket->data, trace_len);	memset(value + trace_len, 0, map->value_size - trace_len); 	old_bucket = xchg(&smap->buckets[id], bucket);	if (old_bucket)		pcpu_freelist_push(&smap->freelist, &old_bucket->fnode);	return 0;} static int stack_map_get_next_key(struct bpf_map *map, void *key,				  void *next_key){	struct bpf_stack_map *smap = container_of(map,						  struct bpf_stack_map, map);	u32 id; 	WARN_ON_ONCE(!rcu_read_lock_held()); 	if (!key) {		id = 0;	} else {		id = *(u32 *)key;		if (id >= smap->n_buckets || !smap->buckets[id])			id = 0;		else			id++;	} 	while (id < smap->n_buckets && !smap->buckets[id])		id++; 	if (id >= smap->n_buckets)		return -ENOENT; 	*(u32 *)next_key = id;	return 0;} static int stack_map_update_elem(struct bpf_map *map, void *key, void *value,				 u64 map_flags){	return -EINVAL;} /* Called from syscall or from eBPF program */static int stack_map_delete_elem(struct bpf_map *map, void *key){	struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map);	struct stack_map_bucket *old_bucket;	u32 id = *(u32 *)key; 	if (unlikely(id >= smap->n_buckets))		return -E2BIG; 	old_bucket = xchg(&smap->buckets[id], NULL);	if (old_bucket) {		pcpu_freelist_push(&smap->freelist, &old_bucket->fnode);		return 0;	} else {		return -ENOENT;	}} /* Called when map->refcnt goes to zero, either from workqueue or from syscall */static void stack_map_free(struct bpf_map *map){	struct bpf_stack_map *smap = container_of(map, struct bpf_stack_map, map); 	/* wait for bpf programs to complete before freeing stack map */	synchronize_rcu(); 	bpf_map_area_free(smap->elems);	pcpu_freelist_destroy(&smap->freelist);	bpf_map_area_free(smap);	put_callchain_buffers();} const struct bpf_map_ops stack_trace_map_ops = {	.map_alloc = stack_map_alloc,	.map_free = stack_map_free,	.map_get_next_key = stack_map_get_next_key,	.map_lookup_elem = stack_map_lookup_elem,	.map_update_elem = stack_map_update_elem,	.map_delete_elem = stack_map_delete_elem,	.map_check_btf = map_check_no_btf,}; static int __init stack_map_init(void){	int cpu;	struct stack_map_irq_work *work; 	for_each_possible_cpu(cpu) {		work = per_cpu_ptr(&up_read_work, cpu);		init_irq_work(&work->irq_work, do_up_read);	}	return 0;}subsys_initcall(stack_map_init);

Lines 501–644 of 644. Previous lines

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t