jump_label.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436
  1. /*
  2. * jump label support
  3. *
  4. * Copyright (C) 2009 Jason Baron <jbaron@redhat.com>
  5. * Copyright (C) 2011 Peter Zijlstra <pzijlstr@redhat.com>
  6. *
  7. */
  8. #include <linux/memory.h>
  9. #include <linux/uaccess.h>
  10. #include <linux/module.h>
  11. #include <linux/list.h>
  12. #include <linux/slab.h>
  13. #include <linux/sort.h>
  14. #include <linux/err.h>
  15. #include <linux/jump_label.h>
  16. #ifdef HAVE_JUMP_LABEL
  17. /* mutex to protect coming/going of the the jump_label table */
  18. static DEFINE_MUTEX(jump_label_mutex);
  19. void jump_label_lock(void)
  20. {
  21. mutex_lock(&jump_label_mutex);
  22. }
  23. void jump_label_unlock(void)
  24. {
  25. mutex_unlock(&jump_label_mutex);
  26. }
  27. bool jump_label_enabled(struct jump_label_key *key)
  28. {
  29. return !!atomic_read(&key->enabled);
  30. }
  31. static int jump_label_cmp(const void *a, const void *b)
  32. {
  33. const struct jump_entry *jea = a;
  34. const struct jump_entry *jeb = b;
  35. if (jea->key < jeb->key)
  36. return -1;
  37. if (jea->key > jeb->key)
  38. return 1;
  39. return 0;
  40. }
  41. static void
  42. jump_label_sort_entries(struct jump_entry *start, struct jump_entry *stop)
  43. {
  44. unsigned long size;
  45. size = (((unsigned long)stop - (unsigned long)start)
  46. / sizeof(struct jump_entry));
  47. sort(start, size, sizeof(struct jump_entry), jump_label_cmp, NULL);
  48. }
  49. static void jump_label_update(struct jump_label_key *key, int enable);
  50. void jump_label_inc(struct jump_label_key *key)
  51. {
  52. if (atomic_inc_not_zero(&key->enabled))
  53. return;
  54. jump_label_lock();
  55. if (atomic_read(&key->enabled) == 0)
  56. jump_label_update(key, JUMP_LABEL_ENABLE);
  57. atomic_inc(&key->enabled);
  58. jump_label_unlock();
  59. }
  60. EXPORT_SYMBOL_GPL(jump_label_inc);
  61. static void __jump_label_dec(struct jump_label_key *key,
  62. unsigned long rate_limit, struct delayed_work *work)
  63. {
  64. if (!atomic_dec_and_mutex_lock(&key->enabled, &jump_label_mutex))
  65. return;
  66. if (rate_limit) {
  67. atomic_inc(&key->enabled);
  68. schedule_delayed_work(work, rate_limit);
  69. } else
  70. jump_label_update(key, JUMP_LABEL_DISABLE);
  71. jump_label_unlock();
  72. }
  73. EXPORT_SYMBOL_GPL(jump_label_dec);
  74. static void jump_label_update_timeout(struct work_struct *work)
  75. {
  76. struct jump_label_key_deferred *key =
  77. container_of(work, struct jump_label_key_deferred, work.work);
  78. __jump_label_dec(&key->key, 0, NULL);
  79. }
  80. void jump_label_dec(struct jump_label_key *key)
  81. {
  82. __jump_label_dec(key, 0, NULL);
  83. }
  84. void jump_label_dec_deferred(struct jump_label_key_deferred *key)
  85. {
  86. __jump_label_dec(&key->key, key->timeout, &key->work);
  87. }
  88. void jump_label_rate_limit(struct jump_label_key_deferred *key,
  89. unsigned long rl)
  90. {
  91. key->timeout = rl;
  92. INIT_DELAYED_WORK(&key->work, jump_label_update_timeout);
  93. }
  94. static int addr_conflict(struct jump_entry *entry, void *start, void *end)
  95. {
  96. if (entry->code <= (unsigned long)end &&
  97. entry->code + JUMP_LABEL_NOP_SIZE > (unsigned long)start)
  98. return 1;
  99. return 0;
  100. }
  101. static int __jump_label_text_reserved(struct jump_entry *iter_start,
  102. struct jump_entry *iter_stop, void *start, void *end)
  103. {
  104. struct jump_entry *iter;
  105. iter = iter_start;
  106. while (iter < iter_stop) {
  107. if (addr_conflict(iter, start, end))
  108. return 1;
  109. iter++;
  110. }
  111. return 0;
  112. }
  113. /*
  114. * Update code which is definitely not currently executing.
  115. * Architectures which need heavyweight synchronization to modify
  116. * running code can override this to make the non-live update case
  117. * cheaper.
  118. */
  119. void __weak __init_or_module arch_jump_label_transform_static(struct jump_entry *entry,
  120. enum jump_label_type type)
  121. {
  122. arch_jump_label_transform(entry, type);
  123. }
  124. static void __jump_label_update(struct jump_label_key *key,
  125. struct jump_entry *entry,
  126. struct jump_entry *stop, int enable)
  127. {
  128. for (; (entry < stop) &&
  129. (entry->key == (jump_label_t)(unsigned long)key);
  130. entry++) {
  131. /*
  132. * entry->code set to 0 invalidates module init text sections
  133. * kernel_text_address() verifies we are not in core kernel
  134. * init code, see jump_label_invalidate_module_init().
  135. */
  136. if (entry->code && kernel_text_address(entry->code))
  137. arch_jump_label_transform(entry, enable);
  138. }
  139. }
  140. void __init jump_label_init(void)
  141. {
  142. struct jump_entry *iter_start = __start___jump_table;
  143. struct jump_entry *iter_stop = __stop___jump_table;
  144. struct jump_label_key *key = NULL;
  145. struct jump_entry *iter;
  146. jump_label_lock();
  147. jump_label_sort_entries(iter_start, iter_stop);
  148. for (iter = iter_start; iter < iter_stop; iter++) {
  149. struct jump_label_key *iterk;
  150. iterk = (struct jump_label_key *)(unsigned long)iter->key;
  151. arch_jump_label_transform_static(iter, jump_label_enabled(iterk) ?
  152. JUMP_LABEL_ENABLE : JUMP_LABEL_DISABLE);
  153. if (iterk == key)
  154. continue;
  155. key = iterk;
  156. key->entries = iter;
  157. #ifdef CONFIG_MODULES
  158. key->next = NULL;
  159. #endif
  160. }
  161. jump_label_unlock();
  162. }
  163. #ifdef CONFIG_MODULES
  164. struct jump_label_mod {
  165. struct jump_label_mod *next;
  166. struct jump_entry *entries;
  167. struct module *mod;
  168. };
  169. static int __jump_label_mod_text_reserved(void *start, void *end)
  170. {
  171. struct module *mod;
  172. mod = __module_text_address((unsigned long)start);
  173. if (!mod)
  174. return 0;
  175. WARN_ON_ONCE(__module_text_address((unsigned long)end) != mod);
  176. return __jump_label_text_reserved(mod->jump_entries,
  177. mod->jump_entries + mod->num_jump_entries,
  178. start, end);
  179. }
  180. static void __jump_label_mod_update(struct jump_label_key *key, int enable)
  181. {
  182. struct jump_label_mod *mod = key->next;
  183. while (mod) {
  184. struct module *m = mod->mod;
  185. __jump_label_update(key, mod->entries,
  186. m->jump_entries + m->num_jump_entries,
  187. enable);
  188. mod = mod->next;
  189. }
  190. }
  191. /***
  192. * apply_jump_label_nops - patch module jump labels with arch_get_jump_label_nop()
  193. * @mod: module to patch
  194. *
  195. * Allow for run-time selection of the optimal nops. Before the module
  196. * loads patch these with arch_get_jump_label_nop(), which is specified by
  197. * the arch specific jump label code.
  198. */
  199. void jump_label_apply_nops(struct module *mod)
  200. {
  201. struct jump_entry *iter_start = mod->jump_entries;
  202. struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
  203. struct jump_entry *iter;
  204. /* if the module doesn't have jump label entries, just return */
  205. if (iter_start == iter_stop)
  206. return;
  207. for (iter = iter_start; iter < iter_stop; iter++) {
  208. struct jump_label_key *iterk;
  209. iterk = (struct jump_label_key *)(unsigned long)iter->key;
  210. arch_jump_label_transform_static(iter, jump_label_enabled(iterk) ?
  211. JUMP_LABEL_ENABLE : JUMP_LABEL_DISABLE);
  212. }
  213. }
  214. static int jump_label_add_module(struct module *mod)
  215. {
  216. struct jump_entry *iter_start = mod->jump_entries;
  217. struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
  218. struct jump_entry *iter;
  219. struct jump_label_key *key = NULL;
  220. struct jump_label_mod *jlm;
  221. /* if the module doesn't have jump label entries, just return */
  222. if (iter_start == iter_stop)
  223. return 0;
  224. jump_label_sort_entries(iter_start, iter_stop);
  225. for (iter = iter_start; iter < iter_stop; iter++) {
  226. if (iter->key == (jump_label_t)(unsigned long)key)
  227. continue;
  228. key = (struct jump_label_key *)(unsigned long)iter->key;
  229. if (__module_address(iter->key) == mod) {
  230. atomic_set(&key->enabled, 0);
  231. key->entries = iter;
  232. key->next = NULL;
  233. continue;
  234. }
  235. jlm = kzalloc(sizeof(struct jump_label_mod), GFP_KERNEL);
  236. if (!jlm)
  237. return -ENOMEM;
  238. jlm->mod = mod;
  239. jlm->entries = iter;
  240. jlm->next = key->next;
  241. key->next = jlm;
  242. if (jump_label_enabled(key))
  243. __jump_label_update(key, iter, iter_stop, JUMP_LABEL_ENABLE);
  244. }
  245. return 0;
  246. }
  247. static void jump_label_del_module(struct module *mod)
  248. {
  249. struct jump_entry *iter_start = mod->jump_entries;
  250. struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
  251. struct jump_entry *iter;
  252. struct jump_label_key *key = NULL;
  253. struct jump_label_mod *jlm, **prev;
  254. for (iter = iter_start; iter < iter_stop; iter++) {
  255. if (iter->key == (jump_label_t)(unsigned long)key)
  256. continue;
  257. key = (struct jump_label_key *)(unsigned long)iter->key;
  258. if (__module_address(iter->key) == mod)
  259. continue;
  260. prev = &key->next;
  261. jlm = key->next;
  262. while (jlm && jlm->mod != mod) {
  263. prev = &jlm->next;
  264. jlm = jlm->next;
  265. }
  266. if (jlm) {
  267. *prev = jlm->next;
  268. kfree(jlm);
  269. }
  270. }
  271. }
  272. static void jump_label_invalidate_module_init(struct module *mod)
  273. {
  274. struct jump_entry *iter_start = mod->jump_entries;
  275. struct jump_entry *iter_stop = iter_start + mod->num_jump_entries;
  276. struct jump_entry *iter;
  277. for (iter = iter_start; iter < iter_stop; iter++) {
  278. if (within_module_init(iter->code, mod))
  279. iter->code = 0;
  280. }
  281. }
  282. static int
  283. jump_label_module_notify(struct notifier_block *self, unsigned long val,
  284. void *data)
  285. {
  286. struct module *mod = data;
  287. int ret = 0;
  288. switch (val) {
  289. case MODULE_STATE_COMING:
  290. jump_label_lock();
  291. ret = jump_label_add_module(mod);
  292. if (ret)
  293. jump_label_del_module(mod);
  294. jump_label_unlock();
  295. break;
  296. case MODULE_STATE_GOING:
  297. jump_label_lock();
  298. jump_label_del_module(mod);
  299. jump_label_unlock();
  300. break;
  301. case MODULE_STATE_LIVE:
  302. jump_label_lock();
  303. jump_label_invalidate_module_init(mod);
  304. jump_label_unlock();
  305. break;
  306. }
  307. return notifier_from_errno(ret);
  308. }
  309. struct notifier_block jump_label_module_nb = {
  310. .notifier_call = jump_label_module_notify,
  311. .priority = 1, /* higher than tracepoints */
  312. };
  313. static __init int jump_label_init_module(void)
  314. {
  315. return register_module_notifier(&jump_label_module_nb);
  316. }
  317. early_initcall(jump_label_init_module);
  318. #endif /* CONFIG_MODULES */
  319. /***
  320. * jump_label_text_reserved - check if addr range is reserved
  321. * @start: start text addr
  322. * @end: end text addr
  323. *
  324. * checks if the text addr located between @start and @end
  325. * overlaps with any of the jump label patch addresses. Code
  326. * that wants to modify kernel text should first verify that
  327. * it does not overlap with any of the jump label addresses.
  328. * Caller must hold jump_label_mutex.
  329. *
  330. * returns 1 if there is an overlap, 0 otherwise
  331. */
  332. int jump_label_text_reserved(void *start, void *end)
  333. {
  334. int ret = __jump_label_text_reserved(__start___jump_table,
  335. __stop___jump_table, start, end);
  336. if (ret)
  337. return ret;
  338. #ifdef CONFIG_MODULES
  339. ret = __jump_label_mod_text_reserved(start, end);
  340. #endif
  341. return ret;
  342. }
  343. static void jump_label_update(struct jump_label_key *key, int enable)
  344. {
  345. struct jump_entry *entry = key->entries, *stop = __stop___jump_table;
  346. #ifdef CONFIG_MODULES
  347. struct module *mod = __module_address((jump_label_t)key);
  348. __jump_label_mod_update(key, enable);
  349. if (mod)
  350. stop = mod->jump_entries + mod->num_jump_entries;
  351. #endif
  352. /* if there are no users, entry can be NULL */
  353. if (entry)
  354. __jump_label_update(key, entry, stop, enable);
  355. }
  356. #endif