mmu_rb.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. // SPDX-License-Identifier: GPL-2.0 or BSD-3-Clause
  2. /*
  3. * Copyright(c) 2020 Cornelis Networks, Inc.
  4. * Copyright(c) 2016 - 2017 Intel Corporation.
  5. */
  6. #include <linux/list.h>
  7. #include <linux/rculist.h>
  8. #include <linux/mmu_notifier.h>
  9. #include <linux/interval_tree_generic.h>
  10. #include <linux/sched/mm.h>
  11. #include "mmu_rb.h"
  12. #include "trace.h"
  13. static unsigned long mmu_node_start(struct mmu_rb_node *);
  14. static unsigned long mmu_node_last(struct mmu_rb_node *);
  15. static int mmu_notifier_range_start(struct mmu_notifier *,
  16. const struct mmu_notifier_range *);
  17. static struct mmu_rb_node *__mmu_rb_search(struct mmu_rb_handler *,
  18. unsigned long, unsigned long);
  19. static void release_immediate(struct kref *refcount);
  20. static void handle_remove(struct work_struct *work);
  21. static const struct mmu_notifier_ops mn_opts = {
  22. .invalidate_range_start = mmu_notifier_range_start,
  23. };
  24. INTERVAL_TREE_DEFINE(struct mmu_rb_node, node, unsigned long, __last,
  25. mmu_node_start, mmu_node_last, static, __mmu_int_rb);
  26. static unsigned long mmu_node_start(struct mmu_rb_node *node)
  27. {
  28. return node->addr & PAGE_MASK;
  29. }
  30. static unsigned long mmu_node_last(struct mmu_rb_node *node)
  31. {
  32. return PAGE_ALIGN(node->addr + node->len) - 1;
  33. }
  34. int hfi1_mmu_rb_register(void *ops_arg,
  35. struct mmu_rb_ops *ops,
  36. struct workqueue_struct *wq,
  37. struct mmu_rb_handler **handler)
  38. {
  39. struct mmu_rb_handler *h;
  40. int ret;
  41. h = kzalloc(sizeof(*h), GFP_KERNEL);
  42. if (!h)
  43. return -ENOMEM;
  44. h->root = RB_ROOT_CACHED;
  45. h->ops = ops;
  46. h->ops_arg = ops_arg;
  47. INIT_HLIST_NODE(&h->mn.hlist);
  48. spin_lock_init(&h->lock);
  49. h->mn.ops = &mn_opts;
  50. INIT_WORK(&h->del_work, handle_remove);
  51. INIT_LIST_HEAD(&h->del_list);
  52. INIT_LIST_HEAD(&h->lru_list);
  53. h->wq = wq;
  54. ret = mmu_notifier_register(&h->mn, current->mm);
  55. if (ret) {
  56. kfree(h);
  57. return ret;
  58. }
  59. *handler = h;
  60. return 0;
  61. }
  62. void hfi1_mmu_rb_unregister(struct mmu_rb_handler *handler)
  63. {
  64. struct mmu_rb_node *rbnode;
  65. struct rb_node *node;
  66. unsigned long flags;
  67. struct list_head del_list;
  68. /* Prevent freeing of mm until we are completely finished. */
  69. mmgrab(handler->mn.mm);
  70. /* Unregister first so we don't get any more notifications. */
  71. mmu_notifier_unregister(&handler->mn, handler->mn.mm);
  72. /*
  73. * Make sure the wq delete handler is finished running. It will not
  74. * be triggered once the mmu notifiers are unregistered above.
  75. */
  76. flush_work(&handler->del_work);
  77. INIT_LIST_HEAD(&del_list);
  78. spin_lock_irqsave(&handler->lock, flags);
  79. while ((node = rb_first_cached(&handler->root))) {
  80. rbnode = rb_entry(node, struct mmu_rb_node, node);
  81. rb_erase_cached(node, &handler->root);
  82. /* move from LRU list to delete list */
  83. list_move(&rbnode->list, &del_list);
  84. }
  85. spin_unlock_irqrestore(&handler->lock, flags);
  86. while (!list_empty(&del_list)) {
  87. rbnode = list_first_entry(&del_list, struct mmu_rb_node, list);
  88. list_del(&rbnode->list);
  89. kref_put(&rbnode->refcount, release_immediate);
  90. }
  91. /* Now the mm may be freed. */
  92. mmdrop(handler->mn.mm);
  93. kfree(handler);
  94. }
  95. int hfi1_mmu_rb_insert(struct mmu_rb_handler *handler,
  96. struct mmu_rb_node *mnode)
  97. {
  98. struct mmu_rb_node *node;
  99. unsigned long flags;
  100. int ret = 0;
  101. trace_hfi1_mmu_rb_insert(mnode->addr, mnode->len);
  102. if (current->mm != handler->mn.mm)
  103. return -EPERM;
  104. spin_lock_irqsave(&handler->lock, flags);
  105. node = __mmu_rb_search(handler, mnode->addr, mnode->len);
  106. if (node) {
  107. ret = -EEXIST;
  108. goto unlock;
  109. }
  110. __mmu_int_rb_insert(mnode, &handler->root);
  111. list_add_tail(&mnode->list, &handler->lru_list);
  112. mnode->handler = handler;
  113. unlock:
  114. spin_unlock_irqrestore(&handler->lock, flags);
  115. return ret;
  116. }
  117. /* Caller must hold handler lock */
  118. struct mmu_rb_node *hfi1_mmu_rb_get_first(struct mmu_rb_handler *handler,
  119. unsigned long addr, unsigned long len)
  120. {
  121. struct mmu_rb_node *node;
  122. trace_hfi1_mmu_rb_search(addr, len);
  123. node = __mmu_int_rb_iter_first(&handler->root, addr, (addr + len) - 1);
  124. if (node)
  125. list_move_tail(&node->list, &handler->lru_list);
  126. return node;
  127. }
  128. /* Caller must hold handler lock */
  129. static struct mmu_rb_node *__mmu_rb_search(struct mmu_rb_handler *handler,
  130. unsigned long addr,
  131. unsigned long len)
  132. {
  133. struct mmu_rb_node *node = NULL;
  134. trace_hfi1_mmu_rb_search(addr, len);
  135. if (!handler->ops->filter) {
  136. node = __mmu_int_rb_iter_first(&handler->root, addr,
  137. (addr + len) - 1);
  138. } else {
  139. for (node = __mmu_int_rb_iter_first(&handler->root, addr,
  140. (addr + len) - 1);
  141. node;
  142. node = __mmu_int_rb_iter_next(node, addr,
  143. (addr + len) - 1)) {
  144. if (handler->ops->filter(node, addr, len))
  145. return node;
  146. }
  147. }
  148. return node;
  149. }
  150. /*
  151. * Must NOT call while holding mnode->handler->lock.
  152. * mnode->handler->ops->remove() may sleep and mnode->handler->lock is a
  153. * spinlock.
  154. */
  155. static void release_immediate(struct kref *refcount)
  156. {
  157. struct mmu_rb_node *mnode =
  158. container_of(refcount, struct mmu_rb_node, refcount);
  159. mnode->handler->ops->remove(mnode->handler->ops_arg, mnode);
  160. }
  161. /* Caller must hold mnode->handler->lock */
  162. static void release_nolock(struct kref *refcount)
  163. {
  164. struct mmu_rb_node *mnode =
  165. container_of(refcount, struct mmu_rb_node, refcount);
  166. list_move(&mnode->list, &mnode->handler->del_list);
  167. queue_work(mnode->handler->wq, &mnode->handler->del_work);
  168. }
  169. /*
  170. * struct mmu_rb_node->refcount kref_put() callback.
  171. * Adds mmu_rb_node to mmu_rb_node->handler->del_list and queues
  172. * handler->del_work on handler->wq.
  173. * Does not remove mmu_rb_node from handler->lru_list or handler->rb_root.
  174. * Acquires mmu_rb_node->handler->lock; do not call while already holding
  175. * handler->lock.
  176. */
  177. void hfi1_mmu_rb_release(struct kref *refcount)
  178. {
  179. struct mmu_rb_node *mnode =
  180. container_of(refcount, struct mmu_rb_node, refcount);
  181. struct mmu_rb_handler *handler = mnode->handler;
  182. unsigned long flags;
  183. spin_lock_irqsave(&handler->lock, flags);
  184. list_move(&mnode->list, &mnode->handler->del_list);
  185. spin_unlock_irqrestore(&handler->lock, flags);
  186. queue_work(handler->wq, &handler->del_work);
  187. }
  188. void hfi1_mmu_rb_evict(struct mmu_rb_handler *handler, void *evict_arg)
  189. {
  190. struct mmu_rb_node *rbnode, *ptr;
  191. struct list_head del_list;
  192. unsigned long flags;
  193. bool stop = false;
  194. if (current->mm != handler->mn.mm)
  195. return;
  196. INIT_LIST_HEAD(&del_list);
  197. spin_lock_irqsave(&handler->lock, flags);
  198. list_for_each_entry_safe(rbnode, ptr, &handler->lru_list, list) {
  199. /* refcount == 1 implies mmu_rb_handler has only rbnode ref */
  200. if (kref_read(&rbnode->refcount) > 1)
  201. continue;
  202. if (handler->ops->evict(handler->ops_arg, rbnode, evict_arg,
  203. &stop)) {
  204. __mmu_int_rb_remove(rbnode, &handler->root);
  205. /* move from LRU list to delete list */
  206. list_move(&rbnode->list, &del_list);
  207. }
  208. if (stop)
  209. break;
  210. }
  211. spin_unlock_irqrestore(&handler->lock, flags);
  212. list_for_each_entry_safe(rbnode, ptr, &del_list, list) {
  213. kref_put(&rbnode->refcount, release_immediate);
  214. }
  215. }
  216. static int mmu_notifier_range_start(struct mmu_notifier *mn,
  217. const struct mmu_notifier_range *range)
  218. {
  219. struct mmu_rb_handler *handler =
  220. container_of(mn, struct mmu_rb_handler, mn);
  221. struct rb_root_cached *root = &handler->root;
  222. struct mmu_rb_node *node, *ptr = NULL;
  223. unsigned long flags;
  224. spin_lock_irqsave(&handler->lock, flags);
  225. for (node = __mmu_int_rb_iter_first(root, range->start, range->end-1);
  226. node; node = ptr) {
  227. /* Guard against node removal. */
  228. ptr = __mmu_int_rb_iter_next(node, range->start,
  229. range->end - 1);
  230. trace_hfi1_mmu_mem_invalidate(node->addr, node->len);
  231. /* Remove from rb tree and lru_list. */
  232. __mmu_int_rb_remove(node, root);
  233. list_del_init(&node->list);
  234. kref_put(&node->refcount, release_nolock);
  235. }
  236. spin_unlock_irqrestore(&handler->lock, flags);
  237. return 0;
  238. }
  239. /*
  240. * Work queue function to remove all nodes that have been queued up to
  241. * be removed. The key feature is that mm->mmap_lock is not being held
  242. * and the remove callback can sleep while taking it, if needed.
  243. */
  244. static void handle_remove(struct work_struct *work)
  245. {
  246. struct mmu_rb_handler *handler = container_of(work,
  247. struct mmu_rb_handler,
  248. del_work);
  249. struct list_head del_list;
  250. unsigned long flags;
  251. struct mmu_rb_node *node;
  252. /* remove anything that is queued to get removed */
  253. spin_lock_irqsave(&handler->lock, flags);
  254. list_replace_init(&handler->del_list, &del_list);
  255. spin_unlock_irqrestore(&handler->lock, flags);
  256. while (!list_empty(&del_list)) {
  257. node = list_first_entry(&del_list, struct mmu_rb_node, list);
  258. list_del(&node->list);
  259. handler->ops->remove(handler->ops_arg, node);
  260. }
  261. }