jump_label.c 8.8 KB
Newer Older
1 2 3 4
/*
 * jump label support
 *
 * Copyright (C) 2009 Jason Baron <jbaron@redhat.com>
5
 * Copyright (C) 2011 Peter Zijlstra <pzijlstr@redhat.com>
6 7 8 9 10 11 12 13 14
 *
 */
#include <linux/memory.h>
#include <linux/uaccess.h>
#include <linux/module.h>
#include <linux/list.h>
#include <linux/slab.h>
#include <linux/sort.h>
#include <linux/err.h>
15
#include <linux/jump_label.h>
16 17 18 19 20 21

#ifdef HAVE_JUMP_LABEL

/* mutex to protect coming/going of the the jump_label table */
static DEFINE_MUTEX(jump_label_mutex);

22 23 24 25 26 27 28 29 30 31
void jump_label_lock(void)
{
	mutex_lock(&jump_label_mutex);
}

void jump_label_unlock(void)
{
	mutex_unlock(&jump_label_mutex);
}

32 33 34 35 36
bool jump_label_enabled(struct jump_label_key *key)
{
	return !!atomic_read(&key->enabled);
}

37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
static int jump_label_cmp(const void *a, const void *b)
{
	const struct jump_entry *jea = a;
	const struct jump_entry *jeb = b;

	if (jea->key < jeb->key)
		return -1;

	if (jea->key > jeb->key)
		return 1;

	return 0;
}

static void
52
jump_label_sort_entries(struct jump_entry *start, struct jump_entry *stop)
53 54 55 56 57 58 59 60
{
	unsigned long size;

	size = (((unsigned long)stop - (unsigned long)start)
					/ sizeof(struct jump_entry));
	sort(start, size, sizeof(struct jump_entry), jump_label_cmp, NULL);
}

61
static void jump_label_update(struct jump_label_key *key, int enable);
62

63
void jump_label_inc(struct jump_label_key *key)
64
{
65 66
	if (atomic_inc_not_zero(&key->enabled))
		return;
67

68 69 70 71
	jump_label_lock();
	if (atomic_add_return(1, &key->enabled) == 1)
		jump_label_update(key, JUMP_LABEL_ENABLE);
	jump_label_unlock();
72 73
}

74
void jump_label_dec(struct jump_label_key *key)
75
{
76 77
	if (!atomic_dec_and_mutex_lock(&key->enabled, &jump_label_mutex))
		return;
78

79
	jump_label_update(key, JUMP_LABEL_DISABLE);
80
	jump_label_unlock();
81 82
}

83 84 85 86 87 88 89 90 91
static int addr_conflict(struct jump_entry *entry, void *start, void *end)
{
	if (entry->code <= (unsigned long)end &&
		entry->code + JUMP_LABEL_NOP_SIZE > (unsigned long)start)
		return 1;

	return 0;
}

92 93
static int __jump_label_text_reserved(struct jump_entry *iter_start,
		struct jump_entry *iter_stop, void *start, void *end)
94 95 96 97 98
{
	struct jump_entry *iter;

	iter = iter_start;
	while (iter < iter_stop) {
99 100
		if (addr_conflict(iter, start, end))
			return 1;
101 102 103
		iter++;
	}

104 105 106 107
	return 0;
}

static void __jump_label_update(struct jump_label_key *key,
108 109
				struct jump_entry *entry,
				struct jump_entry *stop, int enable)
110
{
111 112 113
	for (; (entry < stop) &&
	      (entry->key == (jump_label_t)(unsigned long)key);
	      entry++) {
114 115 116 117 118 119 120 121
		/*
		 * entry->code set to 0 invalidates module init text sections
		 * kernel_text_address() verifies we are not in core kernel
		 * init code, see jump_label_invalidate_module_init().
		 */
		if (entry->code && kernel_text_address(entry->code))
			arch_jump_label_transform(entry, enable);
	}
122 123
}

124 125 126 127 128 129 130
/*
 * Not all archs need this.
 */
void __weak arch_jump_label_text_poke_early(jump_label_t addr)
{
}

131
static __init int jump_label_init(void)
132 133 134
{
	struct jump_entry *iter_start = __start___jump_table;
	struct jump_entry *iter_stop = __stop___jump_table;
135
	struct jump_label_key *key = NULL;
136 137
	struct jump_entry *iter;

138
	jump_label_lock();
139 140 141
	jump_label_sort_entries(iter_start, iter_stop);

	for (iter = iter_start; iter < iter_stop; iter++) {
142
		arch_jump_label_text_poke_early(iter->code);
143 144 145 146 147 148 149 150 151
		if (iter->key == (jump_label_t)(unsigned long)key)
			continue;

		key = (struct jump_label_key *)(unsigned long)iter->key;
		atomic_set(&key->enabled, 0);
		key->entries = iter;
#ifdef CONFIG_MODULES
		key->next = NULL;
#endif
152
	}
153
	jump_label_unlock();
154 155

	return 0;
156
}
157
early_initcall(jump_label_init);
158 159 160

#ifdef CONFIG_MODULES

161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
struct jump_label_mod {
	struct jump_label_mod *next;
	struct jump_entry *entries;
	struct module *mod;
};

static int __jump_label_mod_text_reserved(void *start, void *end)
{
	struct module *mod;

	mod = __module_text_address((unsigned long)start);
	if (!mod)
		return 0;

	WARN_ON_ONCE(__module_text_address((unsigned long)end) != mod);

	return __jump_label_text_reserved(mod->jump_entries,
				mod->jump_entries + mod->num_jump_entries,
				start, end);
}

static void __jump_label_mod_update(struct jump_label_key *key, int enable)
{
	struct jump_label_mod *mod = key->next;

	while (mod) {
187 188 189 190 191
		struct module *m = mod->mod;

		__jump_label_update(key, mod->entries,
				    m->jump_entries + m->num_jump_entries,
				    enable);
192 193 194 195 196 197 198 199 200 201 202 203 204
		mod = mod->next;
	}
}

/***
 * apply_jump_label_nops - patch module jump labels with arch_get_jump_label_nop()
 * @mod: module to patch
 *
 * Allow for run-time selection of the optimal nops. Before the module
 * loads patch these with arch_get_jump_label_nop(), which is specified by
 * the arch specific jump label code.
 */
void jump_label_apply_nops(struct module *mod)
205
{
206 207 208 209 210 211 212 213 214 215
	struct jump_entry *iter_start = mod->jump_entries;
	struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
	struct jump_entry *iter;

	/* if the module doesn't have jump label entries, just return */
	if (iter_start == iter_stop)
		return;

	for (iter = iter_start; iter < iter_stop; iter++)
		arch_jump_label_text_poke_early(iter->code);
216 217
}

218
static int jump_label_add_module(struct module *mod)
219
{
220 221 222 223 224
	struct jump_entry *iter_start = mod->jump_entries;
	struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
	struct jump_entry *iter;
	struct jump_label_key *key = NULL;
	struct jump_label_mod *jlm;
225 226

	/* if the module doesn't have jump label entries, just return */
227
	if (iter_start == iter_stop)
228 229
		return 0;

230 231 232 233 234 235 236 237 238 239 240 241 242
	jump_label_sort_entries(iter_start, iter_stop);

	for (iter = iter_start; iter < iter_stop; iter++) {
		if (iter->key == (jump_label_t)(unsigned long)key)
			continue;

		key = (struct jump_label_key *)(unsigned long)iter->key;

		if (__module_address(iter->key) == mod) {
			atomic_set(&key->enabled, 0);
			key->entries = iter;
			key->next = NULL;
			continue;
243
		}
244 245 246 247 248 249 250 251 252 253 254

		jlm = kzalloc(sizeof(struct jump_label_mod), GFP_KERNEL);
		if (!jlm)
			return -ENOMEM;

		jlm->mod = mod;
		jlm->entries = iter;
		jlm->next = key->next;
		key->next = jlm;

		if (jump_label_enabled(key))
255 256
			__jump_label_update(key, iter, iter_stop,
					    JUMP_LABEL_ENABLE);
257
	}
258

259 260 261
	return 0;
}

262
static void jump_label_del_module(struct module *mod)
263
{
264 265 266 267 268
	struct jump_entry *iter_start = mod->jump_entries;
	struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
	struct jump_entry *iter;
	struct jump_label_key *key = NULL;
	struct jump_label_mod *jlm, **prev;
269

270 271 272 273 274 275 276 277 278 279 280
	for (iter = iter_start; iter < iter_stop; iter++) {
		if (iter->key == (jump_label_t)(unsigned long)key)
			continue;

		key = (struct jump_label_key *)(unsigned long)iter->key;

		if (__module_address(iter->key) == mod)
			continue;

		prev = &key->next;
		jlm = key->next;
281

282 283 284 285 286 287 288 289
		while (jlm && jlm->mod != mod) {
			prev = &jlm->next;
			jlm = jlm->next;
		}

		if (jlm) {
			*prev = jlm->next;
			kfree(jlm);
290 291 292 293
		}
	}
}

294
static void jump_label_invalidate_module_init(struct module *mod)
295
{
296 297
	struct jump_entry *iter_start = mod->jump_entries;
	struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
298 299
	struct jump_entry *iter;

300 301 302
	for (iter = iter_start; iter < iter_stop; iter++) {
		if (within_module_init(iter->code, mod))
			iter->code = 0;
303 304 305
	}
}

306 307 308 309 310 311 312 313 314
static int
jump_label_module_notify(struct notifier_block *self, unsigned long val,
			 void *data)
{
	struct module *mod = data;
	int ret = 0;

	switch (val) {
	case MODULE_STATE_COMING:
315
		jump_label_lock();
316
		ret = jump_label_add_module(mod);
317
		if (ret)
318
			jump_label_del_module(mod);
319
		jump_label_unlock();
320 321
		break;
	case MODULE_STATE_GOING:
322
		jump_label_lock();
323
		jump_label_del_module(mod);
324
		jump_label_unlock();
325
		break;
326
	case MODULE_STATE_LIVE:
327
		jump_label_lock();
328
		jump_label_invalidate_module_init(mod);
329
		jump_label_unlock();
330
		break;
331 332
	}

333
	return notifier_from_errno(ret);
334 335 336 337
}

struct notifier_block jump_label_module_nb = {
	.notifier_call = jump_label_module_notify,
338
	.priority = 1, /* higher than tracepoints */
339 340
};

341
static __init int jump_label_init_module(void)
342 343 344
{
	return register_module_notifier(&jump_label_module_nb);
}
345
early_initcall(jump_label_init_module);
346 347 348

#endif /* CONFIG_MODULES */

349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
/***
 * jump_label_text_reserved - check if addr range is reserved
 * @start: start text addr
 * @end: end text addr
 *
 * checks if the text addr located between @start and @end
 * overlaps with any of the jump label patch addresses. Code
 * that wants to modify kernel text should first verify that
 * it does not overlap with any of the jump label addresses.
 * Caller must hold jump_label_mutex.
 *
 * returns 1 if there is an overlap, 0 otherwise
 */
int jump_label_text_reserved(void *start, void *end)
{
	int ret = __jump_label_text_reserved(__start___jump_table,
			__stop___jump_table, start, end);

	if (ret)
		return ret;

#ifdef CONFIG_MODULES
	ret = __jump_label_mod_text_reserved(start, end);
#endif
	return ret;
}

static void jump_label_update(struct jump_label_key *key, int enable)
{
	struct jump_entry *entry = key->entries;

	/* if there are no users, entry can be NULL */
	if (entry)
382
		__jump_label_update(key, entry, __stop___jump_table, enable);
383 384 385 386 387 388

#ifdef CONFIG_MODULES
	__jump_label_mod_update(key, enable);
#endif
}

389
#endif