Blame view
kernel/jump_label.c
11.1 KB
bf5438fca jump label: Base ... |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 |
/* * jump label support * * Copyright (C) 2009 Jason Baron <jbaron@redhat.com> * */ #include <linux/jump_label.h> #include <linux/memory.h> #include <linux/uaccess.h> #include <linux/module.h> #include <linux/list.h> #include <linux/jhash.h> #include <linux/slab.h> #include <linux/sort.h> #include <linux/err.h> #ifdef HAVE_JUMP_LABEL #define JUMP_LABEL_HASH_BITS 6 #define JUMP_LABEL_TABLE_SIZE (1 << JUMP_LABEL_HASH_BITS) static struct hlist_head jump_label_table[JUMP_LABEL_TABLE_SIZE]; /* mutex to protect coming/going of the the jump_label table */ static DEFINE_MUTEX(jump_label_mutex); struct jump_label_entry { struct hlist_node hlist; struct jump_entry *table; int nr_entries; /* hang modules off here */ struct hlist_head modules; unsigned long key; }; struct jump_label_module_entry { struct hlist_node hlist; struct jump_entry *table; int nr_entries; struct module *mod; }; |
91bad2f8d jump label: Fix d... |
41 42 43 44 45 46 47 48 49 |
void jump_label_lock(void) { mutex_lock(&jump_label_mutex); } void jump_label_unlock(void) { mutex_unlock(&jump_label_mutex); } |
bf5438fca jump label: Base ... |
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 |
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 sort_jump_label_entries(struct jump_entry *start, struct jump_entry *stop) { 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); } static struct jump_label_entry *get_jump_label_entry(jump_label_t key) { struct hlist_head *head; struct hlist_node *node; struct jump_label_entry *e; u32 hash = jhash((void *)&key, sizeof(jump_label_t), 0); head = &jump_label_table[hash & (JUMP_LABEL_TABLE_SIZE - 1)]; hlist_for_each_entry(e, node, head, hlist) { if (key == e->key) return e; } return NULL; } static struct jump_label_entry * add_jump_label_entry(jump_label_t key, int nr_entries, struct jump_entry *table) { struct hlist_head *head; struct jump_label_entry *e; u32 hash; e = get_jump_label_entry(key); if (e) return ERR_PTR(-EEXIST); e = kmalloc(sizeof(struct jump_label_entry), GFP_KERNEL); if (!e) return ERR_PTR(-ENOMEM); hash = jhash((void *)&key, sizeof(jump_label_t), 0); head = &jump_label_table[hash & (JUMP_LABEL_TABLE_SIZE - 1)]; e->key = key; e->table = table; e->nr_entries = nr_entries; INIT_HLIST_HEAD(&(e->modules)); hlist_add_head(&e->hlist, head); return e; } static int build_jump_label_hashtable(struct jump_entry *start, struct jump_entry *stop) { struct jump_entry *iter, *iter_begin; struct jump_label_entry *entry; int count; sort_jump_label_entries(start, stop); iter = start; while (iter < stop) { entry = get_jump_label_entry(iter->key); if (!entry) { iter_begin = iter; count = 0; while ((iter < stop) && (iter->key == iter_begin->key)) { iter++; count++; } entry = add_jump_label_entry(iter_begin->key, count, iter_begin); if (IS_ERR(entry)) return PTR_ERR(entry); } else { WARN_ONCE(1, KERN_ERR "build_jump_hashtable: unexpected entry! "); return -1; } } return 0; } /*** * jump_label_update - update jump label text * @key - key value associated with a a jump label * @type - enum set to JUMP_LABEL_ENABLE or JUMP_LABEL_DISABLE * * Will enable/disable the jump for jump label @key, depending on the * value of @type. * */ void jump_label_update(unsigned long key, enum jump_label_type type) { struct jump_entry *iter; struct jump_label_entry *entry; struct hlist_node *module_node; struct jump_label_module_entry *e_module; int count; |
91bad2f8d jump label: Fix d... |
163 |
jump_label_lock(); |
bf5438fca jump label: Base ... |
164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 |
entry = get_jump_label_entry((jump_label_t)key); if (entry) { count = entry->nr_entries; iter = entry->table; while (count--) { if (kernel_text_address(iter->code)) arch_jump_label_transform(iter, type); iter++; } /* eanble/disable jump labels in modules */ hlist_for_each_entry(e_module, module_node, &(entry->modules), hlist) { count = e_module->nr_entries; iter = e_module->table; while (count--) { |
b842f8faf jump label: Fix m... |
179 180 |
if (iter->key && kernel_text_address(iter->code)) |
bf5438fca jump label: Base ... |
181 182 183 184 185 |
arch_jump_label_transform(iter, type); iter++; } } } |
91bad2f8d jump label: Fix d... |
186 |
jump_label_unlock(); |
bf5438fca jump label: Base ... |
187 |
} |
4c3ef6d79 jump label: Add j... |
188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 |
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; } #ifdef CONFIG_MODULES static int module_conflict(void *start, void *end) { struct hlist_head *head; struct hlist_node *node, *node_next, *module_node, *module_node_next; struct jump_label_entry *e; struct jump_label_module_entry *e_module; struct jump_entry *iter; int i, count; int conflict = 0; for (i = 0; i < JUMP_LABEL_TABLE_SIZE; i++) { head = &jump_label_table[i]; hlist_for_each_entry_safe(e, node, node_next, head, hlist) { hlist_for_each_entry_safe(e_module, module_node, module_node_next, &(e->modules), hlist) { count = e_module->nr_entries; iter = e_module->table; while (count--) { if (addr_conflict(iter, start, end)) { conflict = 1; goto out; } iter++; } } } } out: return conflict; } #endif /*** * 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. |
91bad2f8d jump label: Fix d... |
242 |
* Caller must hold jump_label_mutex. |
4c3ef6d79 jump label: Add j... |
243 244 245 246 247 248 249 250 251 |
* * returns 1 if there is an overlap, 0 otherwise */ int jump_label_text_reserved(void *start, void *end) { struct jump_entry *iter; struct jump_entry *iter_start = __start___jump_table; struct jump_entry *iter_stop = __start___jump_table; int conflict = 0; |
4c3ef6d79 jump label: Add j... |
252 253 254 255 256 257 258 259 260 261 262 263 264 265 |
iter = iter_start; while (iter < iter_stop) { if (addr_conflict(iter, start, end)) { conflict = 1; goto out; } iter++; } /* now check modules */ #ifdef CONFIG_MODULES conflict = module_conflict(start, end); #endif out: |
4c3ef6d79 jump label: Add j... |
266 267 |
return conflict; } |
95bcd683f jump label: Make ... |
268 269 270 271 272 273 |
/* * Not all archs need this. */ void __weak arch_jump_label_text_poke_early(jump_label_t addr) { } |
bf5438fca jump label: Base ... |
274 275 276 277 278 279 |
static __init int init_jump_label(void) { int ret; struct jump_entry *iter_start = __start___jump_table; struct jump_entry *iter_stop = __stop___jump_table; struct jump_entry *iter; |
91bad2f8d jump label: Fix d... |
280 |
jump_label_lock(); |
bf5438fca jump label: Base ... |
281 282 283 284 285 286 287 |
ret = build_jump_label_hashtable(__start___jump_table, __stop___jump_table); iter = iter_start; while (iter < iter_stop) { arch_jump_label_text_poke_early(iter->code); iter++; } |
91bad2f8d jump label: Fix d... |
288 |
jump_label_unlock(); |
bf5438fca jump label: Base ... |
289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 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 |
return ret; } early_initcall(init_jump_label); #ifdef CONFIG_MODULES static struct jump_label_module_entry * add_jump_label_module_entry(struct jump_label_entry *entry, struct jump_entry *iter_begin, int count, struct module *mod) { struct jump_label_module_entry *e; e = kmalloc(sizeof(struct jump_label_module_entry), GFP_KERNEL); if (!e) return ERR_PTR(-ENOMEM); e->mod = mod; e->nr_entries = count; e->table = iter_begin; hlist_add_head(&e->hlist, &entry->modules); return e; } static int add_jump_label_module(struct module *mod) { struct jump_entry *iter, *iter_begin; struct jump_label_entry *entry; struct jump_label_module_entry *module_entry; int count; /* if the module doesn't have jump label entries, just return */ if (!mod->num_jump_entries) return 0; sort_jump_label_entries(mod->jump_entries, mod->jump_entries + mod->num_jump_entries); iter = mod->jump_entries; while (iter < mod->jump_entries + mod->num_jump_entries) { entry = get_jump_label_entry(iter->key); iter_begin = iter; count = 0; while ((iter < mod->jump_entries + mod->num_jump_entries) && (iter->key == iter_begin->key)) { iter++; count++; } if (!entry) { entry = add_jump_label_entry(iter_begin->key, 0, NULL); if (IS_ERR(entry)) return PTR_ERR(entry); } module_entry = add_jump_label_module_entry(entry, iter_begin, count, mod); if (IS_ERR(module_entry)) return PTR_ERR(module_entry); } return 0; } static void remove_jump_label_module(struct module *mod) { struct hlist_head *head; struct hlist_node *node, *node_next, *module_node, *module_node_next; struct jump_label_entry *e; struct jump_label_module_entry *e_module; int i; /* if the module doesn't have jump label entries, just return */ if (!mod->num_jump_entries) return; for (i = 0; i < JUMP_LABEL_TABLE_SIZE; i++) { head = &jump_label_table[i]; hlist_for_each_entry_safe(e, node, node_next, head, hlist) { hlist_for_each_entry_safe(e_module, module_node, module_node_next, &(e->modules), hlist) { if (e_module->mod == mod) { hlist_del(&e_module->hlist); kfree(e_module); } } if (hlist_empty(&e->modules) && (e->nr_entries == 0)) { hlist_del(&e->hlist); kfree(e); } } } } |
b842f8faf jump label: Fix m... |
378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 |
static void remove_jump_label_module_init(struct module *mod) { struct hlist_head *head; struct hlist_node *node, *node_next, *module_node, *module_node_next; struct jump_label_entry *e; struct jump_label_module_entry *e_module; struct jump_entry *iter; int i, count; /* if the module doesn't have jump label entries, just return */ if (!mod->num_jump_entries) return; for (i = 0; i < JUMP_LABEL_TABLE_SIZE; i++) { head = &jump_label_table[i]; hlist_for_each_entry_safe(e, node, node_next, head, hlist) { hlist_for_each_entry_safe(e_module, module_node, module_node_next, &(e->modules), hlist) { if (e_module->mod != mod) continue; count = e_module->nr_entries; iter = e_module->table; while (count--) { if (within_module_init(iter->code, mod)) iter->key = 0; iter++; } } } } } |
bf5438fca jump label: Base ... |
410 411 412 413 414 415 416 417 418 |
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: |
91bad2f8d jump label: Fix d... |
419 |
jump_label_lock(); |
bf5438fca jump label: Base ... |
420 421 422 |
ret = add_jump_label_module(mod); if (ret) remove_jump_label_module(mod); |
91bad2f8d jump label: Fix d... |
423 |
jump_label_unlock(); |
bf5438fca jump label: Base ... |
424 425 |
break; case MODULE_STATE_GOING: |
91bad2f8d jump label: Fix d... |
426 |
jump_label_lock(); |
bf5438fca jump label: Base ... |
427 |
remove_jump_label_module(mod); |
91bad2f8d jump label: Fix d... |
428 |
jump_label_unlock(); |
bf5438fca jump label: Base ... |
429 |
break; |
b842f8faf jump label: Fix m... |
430 |
case MODULE_STATE_LIVE: |
91bad2f8d jump label: Fix d... |
431 |
jump_label_lock(); |
b842f8faf jump label: Fix m... |
432 |
remove_jump_label_module_init(mod); |
91bad2f8d jump label: Fix d... |
433 |
jump_label_unlock(); |
b842f8faf jump label: Fix m... |
434 |
break; |
bf5438fca jump label: Base ... |
435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 |
} return ret; } /*** * 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) { struct jump_entry *iter; /* if the module doesn't have jump label entries, just return */ if (!mod->num_jump_entries) return; iter = mod->jump_entries; while (iter < mod->jump_entries + mod->num_jump_entries) { arch_jump_label_text_poke_early(iter->code); iter++; } } struct notifier_block jump_label_module_nb = { .notifier_call = jump_label_module_notify, .priority = 0, }; static __init int init_jump_label_module(void) { return register_module_notifier(&jump_label_module_nb); } early_initcall(init_jump_label_module); #endif /* CONFIG_MODULES */ #endif |