jump_label.c 8.6 KB

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