helpers.c 4.84 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 */
#include <linux/bpf.h>
#include <linux/rcupdate.h>
14
#include <linux/random.h>
15
#include <linux/smp.h>
16
#include <linux/topology.h>
17
#include <linux/ktime.h>
18 19
#include <linux/sched.h>
#include <linux/uidgid.h>
20
#include <linux/filter.h>
21 22 23 24 25 26 27 28 29 30

/* If kernel subsystem is allowing eBPF programs to call this function,
 * inside its own verifier_ops->get_func_proto() callback it should return
 * bpf_map_lookup_elem_proto, so that verifier can properly check the arguments
 *
 * Different map implementations will rely on rcu in map methods
 * lookup/update/delete, therefore eBPF programs must run under rcu lock
 * if program is allowed to access maps, so check rcu_read_lock_held in
 * all three functions.
 */
31
BPF_CALL_2(bpf_map_lookup_elem, struct bpf_map *, map, void *, key)
32 33
{
	WARN_ON_ONCE(!rcu_read_lock_held());
34
	return (unsigned long) map->ops->map_lookup_elem(map, key);
35 36
}

37
const struct bpf_func_proto bpf_map_lookup_elem_proto = {
Daniel Borkmann's avatar
Daniel Borkmann committed
38 39
	.func		= bpf_map_lookup_elem,
	.gpl_only	= false,
40
	.pkt_access	= true,
Daniel Borkmann's avatar
Daniel Borkmann committed
41 42 43
	.ret_type	= RET_PTR_TO_MAP_VALUE_OR_NULL,
	.arg1_type	= ARG_CONST_MAP_PTR,
	.arg2_type	= ARG_PTR_TO_MAP_KEY,
44 45
};

46 47
BPF_CALL_4(bpf_map_update_elem, struct bpf_map *, map, void *, key,
	   void *, value, u64, flags)
48 49
{
	WARN_ON_ONCE(!rcu_read_lock_held());
50
	return map->ops->map_update_elem(map, key, value, flags);
51 52
}

53
const struct bpf_func_proto bpf_map_update_elem_proto = {
Daniel Borkmann's avatar
Daniel Borkmann committed
54 55
	.func		= bpf_map_update_elem,
	.gpl_only	= false,
56
	.pkt_access	= true,
Daniel Borkmann's avatar
Daniel Borkmann committed
57 58 59 60 61
	.ret_type	= RET_INTEGER,
	.arg1_type	= ARG_CONST_MAP_PTR,
	.arg2_type	= ARG_PTR_TO_MAP_KEY,
	.arg3_type	= ARG_PTR_TO_MAP_VALUE,
	.arg4_type	= ARG_ANYTHING,
62 63
};

64
BPF_CALL_2(bpf_map_delete_elem, struct bpf_map *, map, void *, key)
65 66 67 68 69
{
	WARN_ON_ONCE(!rcu_read_lock_held());
	return map->ops->map_delete_elem(map, key);
}

70
const struct bpf_func_proto bpf_map_delete_elem_proto = {
Daniel Borkmann's avatar
Daniel Borkmann committed
71 72
	.func		= bpf_map_delete_elem,
	.gpl_only	= false,
73
	.pkt_access	= true,
Daniel Borkmann's avatar
Daniel Borkmann committed
74 75 76
	.ret_type	= RET_INTEGER,
	.arg1_type	= ARG_CONST_MAP_PTR,
	.arg2_type	= ARG_PTR_TO_MAP_KEY,
77
};
78 79

const struct bpf_func_proto bpf_get_prandom_u32_proto = {
80
	.func		= bpf_user_rnd_u32,
81 82 83
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};
84

85
BPF_CALL_0(bpf_get_smp_processor_id)
86
{
87
	return smp_processor_id();
88 89 90 91 92 93 94
}

const struct bpf_func_proto bpf_get_smp_processor_id_proto = {
	.func		= bpf_get_smp_processor_id,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};
95

96 97 98 99 100 101 102 103 104 105 106
BPF_CALL_0(bpf_get_numa_node_id)
{
	return numa_node_id();
}

const struct bpf_func_proto bpf_get_numa_node_id_proto = {
	.func		= bpf_get_numa_node_id,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};

107
BPF_CALL_0(bpf_ktime_get_ns)
108 109 110 111 112 113 114 115 116 117
{
	/* NMI safe access to clock monotonic */
	return ktime_get_mono_fast_ns();
}

const struct bpf_func_proto bpf_ktime_get_ns_proto = {
	.func		= bpf_ktime_get_ns,
	.gpl_only	= true,
	.ret_type	= RET_INTEGER,
};
118

119
BPF_CALL_0(bpf_get_current_pid_tgid)
120 121 122
{
	struct task_struct *task = current;

123
	if (unlikely(!task))
124 125 126 127 128 129 130 131 132 133 134
		return -EINVAL;

	return (u64) task->tgid << 32 | task->pid;
}

const struct bpf_func_proto bpf_get_current_pid_tgid_proto = {
	.func		= bpf_get_current_pid_tgid,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};

135
BPF_CALL_0(bpf_get_current_uid_gid)
136 137 138 139 140
{
	struct task_struct *task = current;
	kuid_t uid;
	kgid_t gid;

141
	if (unlikely(!task))
142 143 144 145
		return -EINVAL;

	current_uid_gid(&uid, &gid);
	return (u64) from_kgid(&init_user_ns, gid) << 32 |
146
		     from_kuid(&init_user_ns, uid);
147 148 149 150 151 152 153 154
}

const struct bpf_func_proto bpf_get_current_uid_gid_proto = {
	.func		= bpf_get_current_uid_gid,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};

155
BPF_CALL_2(bpf_get_current_comm, char *, buf, u32, size)
156 157 158
{
	struct task_struct *task = current;

159 160
	if (unlikely(!task))
		goto err_clear;
161

162 163 164 165 166 167 168
	strncpy(buf, task->comm, size);

	/* Verifier guarantees that size > 0. For task->comm exceeding
	 * size, guarantee that buf is %NUL-terminated. Unconditionally
	 * done here to save the size test.
	 */
	buf[size - 1] = 0;
169
	return 0;
170 171 172
err_clear:
	memset(buf, 0, size);
	return -EINVAL;
173 174 175 176 177 178
}

const struct bpf_func_proto bpf_get_current_comm_proto = {
	.func		= bpf_get_current_comm,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
179 180
	.arg1_type	= ARG_PTR_TO_UNINIT_MEM,
	.arg2_type	= ARG_CONST_SIZE,
181
};
182 183 184 185 186 187 188 189 190 191 192 193 194 195 196

#ifdef CONFIG_CGROUPS
BPF_CALL_0(bpf_get_current_cgroup_id)
{
	struct cgroup *cgrp = task_dfl_cgroup(current);

	return cgrp->kn->id.id;
}

const struct bpf_func_proto bpf_get_current_cgroup_id_proto = {
	.func		= bpf_get_current_cgroup_id,
	.gpl_only	= false,
	.ret_type	= RET_INTEGER,
};
#endif