jump_label.c 10 KB

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