orangefs-bufmap.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * (C) 2001 Clemson University and The University of Chicago
  4. *
  5. * See COPYING in top-level directory.
  6. */
  7. #include "protocol.h"
  8. #include "orangefs-kernel.h"
  9. #include "orangefs-bufmap.h"
  10. struct slot_map {
  11. int c;
  12. wait_queue_head_t q;
  13. int count;
  14. unsigned long *map;
  15. };
  16. static struct slot_map rw_map = {
  17. .c = -1,
  18. .q = __WAIT_QUEUE_HEAD_INITIALIZER(rw_map.q)
  19. };
  20. static struct slot_map readdir_map = {
  21. .c = -1,
  22. .q = __WAIT_QUEUE_HEAD_INITIALIZER(readdir_map.q)
  23. };
  24. static void install(struct slot_map *m, int count, unsigned long *map)
  25. {
  26. spin_lock(&m->q.lock);
  27. m->c = m->count = count;
  28. m->map = map;
  29. wake_up_all_locked(&m->q);
  30. spin_unlock(&m->q.lock);
  31. }
  32. static void mark_killed(struct slot_map *m)
  33. {
  34. spin_lock(&m->q.lock);
  35. m->c -= m->count + 1;
  36. spin_unlock(&m->q.lock);
  37. }
  38. static void run_down(struct slot_map *m)
  39. {
  40. DEFINE_WAIT(wait);
  41. spin_lock(&m->q.lock);
  42. if (m->c != -1) {
  43. for (;;) {
  44. if (likely(list_empty(&wait.entry)))
  45. __add_wait_queue_entry_tail(&m->q, &wait);
  46. set_current_state(TASK_UNINTERRUPTIBLE);
  47. if (m->c == -1)
  48. break;
  49. spin_unlock(&m->q.lock);
  50. schedule();
  51. spin_lock(&m->q.lock);
  52. }
  53. __remove_wait_queue(&m->q, &wait);
  54. __set_current_state(TASK_RUNNING);
  55. }
  56. m->map = NULL;
  57. spin_unlock(&m->q.lock);
  58. }
  59. static void put(struct slot_map *m, int slot)
  60. {
  61. int v;
  62. spin_lock(&m->q.lock);
  63. __clear_bit(slot, m->map);
  64. v = ++m->c;
  65. if (v > 0)
  66. wake_up_locked(&m->q);
  67. if (unlikely(v == -1)) /* finished dying */
  68. wake_up_all_locked(&m->q);
  69. spin_unlock(&m->q.lock);
  70. }
  71. static int wait_for_free(struct slot_map *m)
  72. {
  73. long left = slot_timeout_secs * HZ;
  74. DEFINE_WAIT(wait);
  75. do {
  76. long n = left, t;
  77. if (likely(list_empty(&wait.entry)))
  78. __add_wait_queue_entry_tail_exclusive(&m->q, &wait);
  79. set_current_state(TASK_INTERRUPTIBLE);
  80. if (m->c > 0)
  81. break;
  82. if (m->c < 0) {
  83. /* we are waiting for map to be installed */
  84. /* it would better be there soon, or we go away */
  85. if (n > ORANGEFS_BUFMAP_WAIT_TIMEOUT_SECS * HZ)
  86. n = ORANGEFS_BUFMAP_WAIT_TIMEOUT_SECS * HZ;
  87. }
  88. spin_unlock(&m->q.lock);
  89. t = schedule_timeout(n);
  90. spin_lock(&m->q.lock);
  91. if (unlikely(!t) && n != left && m->c < 0)
  92. left = t;
  93. else
  94. left = t + (left - n);
  95. if (signal_pending(current))
  96. left = -EINTR;
  97. } while (left > 0);
  98. if (!list_empty(&wait.entry))
  99. list_del(&wait.entry);
  100. else if (left <= 0 && waitqueue_active(&m->q))
  101. __wake_up_locked_key(&m->q, TASK_INTERRUPTIBLE, NULL);
  102. __set_current_state(TASK_RUNNING);
  103. if (likely(left > 0))
  104. return 0;
  105. return left < 0 ? -EINTR : -ETIMEDOUT;
  106. }
  107. static int get(struct slot_map *m)
  108. {
  109. int res = 0;
  110. spin_lock(&m->q.lock);
  111. if (unlikely(m->c <= 0))
  112. res = wait_for_free(m);
  113. if (likely(!res)) {
  114. m->c--;
  115. res = find_first_zero_bit(m->map, m->count);
  116. __set_bit(res, m->map);
  117. }
  118. spin_unlock(&m->q.lock);
  119. return res;
  120. }
  121. /* used to describe mapped buffers */
  122. struct orangefs_bufmap_desc {
  123. void __user *uaddr; /* user space address pointer */
  124. struct page **page_array; /* array of mapped pages */
  125. int array_count; /* size of above arrays */
  126. struct list_head list_link;
  127. };
  128. static struct orangefs_bufmap {
  129. int desc_size;
  130. int desc_shift;
  131. int desc_count;
  132. int total_size;
  133. int page_count;
  134. struct page **page_array;
  135. struct orangefs_bufmap_desc *desc_array;
  136. /* array to track usage of buffer descriptors */
  137. unsigned long *buffer_index_array;
  138. /* array to track usage of buffer descriptors for readdir */
  139. #define N DIV_ROUND_UP(ORANGEFS_READDIR_DEFAULT_DESC_COUNT, BITS_PER_LONG)
  140. unsigned long readdir_index_array[N];
  141. #undef N
  142. } *__orangefs_bufmap;
  143. static DEFINE_SPINLOCK(orangefs_bufmap_lock);
  144. static void
  145. orangefs_bufmap_unmap(struct orangefs_bufmap *bufmap)
  146. {
  147. unpin_user_pages(bufmap->page_array, bufmap->page_count);
  148. }
  149. static void
  150. orangefs_bufmap_free(struct orangefs_bufmap *bufmap)
  151. {
  152. kfree(bufmap->page_array);
  153. kfree(bufmap->desc_array);
  154. bitmap_free(bufmap->buffer_index_array);
  155. kfree(bufmap);
  156. }
  157. /*
  158. * XXX: Can the size and shift change while the caller gives up the
  159. * XXX: lock between calling this and doing something useful?
  160. */
  161. int orangefs_bufmap_size_query(void)
  162. {
  163. struct orangefs_bufmap *bufmap;
  164. int size = 0;
  165. spin_lock(&orangefs_bufmap_lock);
  166. bufmap = __orangefs_bufmap;
  167. if (bufmap)
  168. size = bufmap->desc_size;
  169. spin_unlock(&orangefs_bufmap_lock);
  170. return size;
  171. }
  172. int orangefs_bufmap_shift_query(void)
  173. {
  174. struct orangefs_bufmap *bufmap;
  175. int shift = 0;
  176. spin_lock(&orangefs_bufmap_lock);
  177. bufmap = __orangefs_bufmap;
  178. if (bufmap)
  179. shift = bufmap->desc_shift;
  180. spin_unlock(&orangefs_bufmap_lock);
  181. return shift;
  182. }
  183. static DECLARE_WAIT_QUEUE_HEAD(bufmap_waitq);
  184. static DECLARE_WAIT_QUEUE_HEAD(readdir_waitq);
  185. static struct orangefs_bufmap *
  186. orangefs_bufmap_alloc(struct ORANGEFS_dev_map_desc *user_desc)
  187. {
  188. struct orangefs_bufmap *bufmap;
  189. bufmap = kzalloc(sizeof(*bufmap), GFP_KERNEL);
  190. if (!bufmap)
  191. goto out;
  192. bufmap->total_size = user_desc->total_size;
  193. bufmap->desc_count = user_desc->count;
  194. bufmap->desc_size = user_desc->size;
  195. bufmap->desc_shift = ilog2(bufmap->desc_size);
  196. bufmap->buffer_index_array = bitmap_zalloc(bufmap->desc_count, GFP_KERNEL);
  197. if (!bufmap->buffer_index_array)
  198. goto out_free_bufmap;
  199. bufmap->desc_array =
  200. kcalloc(bufmap->desc_count, sizeof(struct orangefs_bufmap_desc),
  201. GFP_KERNEL);
  202. if (!bufmap->desc_array)
  203. goto out_free_index_array;
  204. bufmap->page_count = bufmap->total_size / PAGE_SIZE;
  205. /* allocate storage to track our page mappings */
  206. bufmap->page_array =
  207. kcalloc(bufmap->page_count, sizeof(struct page *), GFP_KERNEL);
  208. if (!bufmap->page_array)
  209. goto out_free_desc_array;
  210. return bufmap;
  211. out_free_desc_array:
  212. kfree(bufmap->desc_array);
  213. out_free_index_array:
  214. bitmap_free(bufmap->buffer_index_array);
  215. out_free_bufmap:
  216. kfree(bufmap);
  217. out:
  218. return NULL;
  219. }
  220. static int
  221. orangefs_bufmap_map(struct orangefs_bufmap *bufmap,
  222. struct ORANGEFS_dev_map_desc *user_desc)
  223. {
  224. int pages_per_desc = bufmap->desc_size / PAGE_SIZE;
  225. int offset = 0, ret, i;
  226. /* map the pages */
  227. ret = pin_user_pages_fast((unsigned long)user_desc->ptr,
  228. bufmap->page_count, FOLL_WRITE, bufmap->page_array);
  229. if (ret < 0)
  230. return ret;
  231. if (ret != bufmap->page_count) {
  232. gossip_err("orangefs error: asked for %d pages, only got %d.\n",
  233. bufmap->page_count, ret);
  234. for (i = 0; i < ret; i++) {
  235. SetPageError(bufmap->page_array[i]);
  236. unpin_user_page(bufmap->page_array[i]);
  237. }
  238. return -ENOMEM;
  239. }
  240. /*
  241. * ideally we want to get kernel space pointers for each page, but
  242. * we can't kmap that many pages at once if highmem is being used.
  243. * so instead, we just kmap/kunmap the page address each time the
  244. * kaddr is needed.
  245. */
  246. for (i = 0; i < bufmap->page_count; i++)
  247. flush_dcache_page(bufmap->page_array[i]);
  248. /* build a list of available descriptors */
  249. for (offset = 0, i = 0; i < bufmap->desc_count; i++) {
  250. bufmap->desc_array[i].page_array = &bufmap->page_array[offset];
  251. bufmap->desc_array[i].array_count = pages_per_desc;
  252. bufmap->desc_array[i].uaddr =
  253. (user_desc->ptr + (i * pages_per_desc * PAGE_SIZE));
  254. offset += pages_per_desc;
  255. }
  256. return 0;
  257. }
  258. /*
  259. * orangefs_bufmap_initialize()
  260. *
  261. * initializes the mapped buffer interface
  262. *
  263. * returns 0 on success, -errno on failure
  264. */
  265. int orangefs_bufmap_initialize(struct ORANGEFS_dev_map_desc *user_desc)
  266. {
  267. struct orangefs_bufmap *bufmap;
  268. int ret = -EINVAL;
  269. gossip_debug(GOSSIP_BUFMAP_DEBUG,
  270. "orangefs_bufmap_initialize: called (ptr ("
  271. "%p) sz (%d) cnt(%d).\n",
  272. user_desc->ptr,
  273. user_desc->size,
  274. user_desc->count);
  275. if (user_desc->total_size < 0 ||
  276. user_desc->size < 0 ||
  277. user_desc->count < 0)
  278. goto out;
  279. /*
  280. * sanity check alignment and size of buffer that caller wants to
  281. * work with
  282. */
  283. if (PAGE_ALIGN((unsigned long)user_desc->ptr) !=
  284. (unsigned long)user_desc->ptr) {
  285. gossip_err("orangefs error: memory alignment (front). %p\n",
  286. user_desc->ptr);
  287. goto out;
  288. }
  289. if (PAGE_ALIGN(((unsigned long)user_desc->ptr + user_desc->total_size))
  290. != (unsigned long)(user_desc->ptr + user_desc->total_size)) {
  291. gossip_err("orangefs error: memory alignment (back).(%p + %d)\n",
  292. user_desc->ptr,
  293. user_desc->total_size);
  294. goto out;
  295. }
  296. if (user_desc->total_size != (user_desc->size * user_desc->count)) {
  297. gossip_err("orangefs error: user provided an oddly sized buffer: (%d, %d, %d)\n",
  298. user_desc->total_size,
  299. user_desc->size,
  300. user_desc->count);
  301. goto out;
  302. }
  303. if ((user_desc->size % PAGE_SIZE) != 0) {
  304. gossip_err("orangefs error: bufmap size not page size divisible (%d).\n",
  305. user_desc->size);
  306. goto out;
  307. }
  308. ret = -ENOMEM;
  309. bufmap = orangefs_bufmap_alloc(user_desc);
  310. if (!bufmap)
  311. goto out;
  312. ret = orangefs_bufmap_map(bufmap, user_desc);
  313. if (ret)
  314. goto out_free_bufmap;
  315. spin_lock(&orangefs_bufmap_lock);
  316. if (__orangefs_bufmap) {
  317. spin_unlock(&orangefs_bufmap_lock);
  318. gossip_err("orangefs: error: bufmap already initialized.\n");
  319. ret = -EINVAL;
  320. goto out_unmap_bufmap;
  321. }
  322. __orangefs_bufmap = bufmap;
  323. install(&rw_map,
  324. bufmap->desc_count,
  325. bufmap->buffer_index_array);
  326. install(&readdir_map,
  327. ORANGEFS_READDIR_DEFAULT_DESC_COUNT,
  328. bufmap->readdir_index_array);
  329. spin_unlock(&orangefs_bufmap_lock);
  330. gossip_debug(GOSSIP_BUFMAP_DEBUG,
  331. "orangefs_bufmap_initialize: exiting normally\n");
  332. return 0;
  333. out_unmap_bufmap:
  334. orangefs_bufmap_unmap(bufmap);
  335. out_free_bufmap:
  336. orangefs_bufmap_free(bufmap);
  337. out:
  338. return ret;
  339. }
  340. /*
  341. * orangefs_bufmap_finalize()
  342. *
  343. * shuts down the mapped buffer interface and releases any resources
  344. * associated with it
  345. *
  346. * no return value
  347. */
  348. void orangefs_bufmap_finalize(void)
  349. {
  350. struct orangefs_bufmap *bufmap = __orangefs_bufmap;
  351. if (!bufmap)
  352. return;
  353. gossip_debug(GOSSIP_BUFMAP_DEBUG, "orangefs_bufmap_finalize: called\n");
  354. mark_killed(&rw_map);
  355. mark_killed(&readdir_map);
  356. gossip_debug(GOSSIP_BUFMAP_DEBUG,
  357. "orangefs_bufmap_finalize: exiting normally\n");
  358. }
  359. void orangefs_bufmap_run_down(void)
  360. {
  361. struct orangefs_bufmap *bufmap = __orangefs_bufmap;
  362. if (!bufmap)
  363. return;
  364. run_down(&rw_map);
  365. run_down(&readdir_map);
  366. spin_lock(&orangefs_bufmap_lock);
  367. __orangefs_bufmap = NULL;
  368. spin_unlock(&orangefs_bufmap_lock);
  369. orangefs_bufmap_unmap(bufmap);
  370. orangefs_bufmap_free(bufmap);
  371. }
  372. /*
  373. * orangefs_bufmap_get()
  374. *
  375. * gets a free mapped buffer descriptor, will sleep until one becomes
  376. * available if necessary
  377. *
  378. * returns slot on success, -errno on failure
  379. */
  380. int orangefs_bufmap_get(void)
  381. {
  382. return get(&rw_map);
  383. }
  384. /*
  385. * orangefs_bufmap_put()
  386. *
  387. * returns a mapped buffer descriptor to the collection
  388. *
  389. * no return value
  390. */
  391. void orangefs_bufmap_put(int buffer_index)
  392. {
  393. put(&rw_map, buffer_index);
  394. }
  395. /*
  396. * orangefs_readdir_index_get()
  397. *
  398. * gets a free descriptor, will sleep until one becomes
  399. * available if necessary.
  400. * Although the readdir buffers are not mapped into kernel space
  401. * we could do that at a later point of time. Regardless, these
  402. * indices are used by the client-core.
  403. *
  404. * returns slot on success, -errno on failure
  405. */
  406. int orangefs_readdir_index_get(void)
  407. {
  408. return get(&readdir_map);
  409. }
  410. void orangefs_readdir_index_put(int buffer_index)
  411. {
  412. put(&readdir_map, buffer_index);
  413. }
  414. /*
  415. * we've been handed an iovec, we need to copy it to
  416. * the shared memory descriptor at "buffer_index".
  417. */
  418. int orangefs_bufmap_copy_from_iovec(struct iov_iter *iter,
  419. int buffer_index,
  420. size_t size)
  421. {
  422. struct orangefs_bufmap_desc *to;
  423. int i;
  424. gossip_debug(GOSSIP_BUFMAP_DEBUG,
  425. "%s: buffer_index:%d: size:%zu:\n",
  426. __func__, buffer_index, size);
  427. to = &__orangefs_bufmap->desc_array[buffer_index];
  428. for (i = 0; size; i++) {
  429. struct page *page = to->page_array[i];
  430. size_t n = size;
  431. if (n > PAGE_SIZE)
  432. n = PAGE_SIZE;
  433. if (copy_page_from_iter(page, 0, n, iter) != n)
  434. return -EFAULT;
  435. size -= n;
  436. }
  437. return 0;
  438. }
  439. /*
  440. * we've been handed an iovec, we need to fill it from
  441. * the shared memory descriptor at "buffer_index".
  442. */
  443. int orangefs_bufmap_copy_to_iovec(struct iov_iter *iter,
  444. int buffer_index,
  445. size_t size)
  446. {
  447. struct orangefs_bufmap_desc *from;
  448. int i;
  449. from = &__orangefs_bufmap->desc_array[buffer_index];
  450. gossip_debug(GOSSIP_BUFMAP_DEBUG,
  451. "%s: buffer_index:%d: size:%zu:\n",
  452. __func__, buffer_index, size);
  453. for (i = 0; size; i++) {
  454. struct page *page = from->page_array[i];
  455. size_t n = size;
  456. if (n > PAGE_SIZE)
  457. n = PAGE_SIZE;
  458. n = copy_page_to_iter(page, 0, n, iter);
  459. if (!n)
  460. return -EFAULT;
  461. size -= n;
  462. }
  463. return 0;
  464. }
  465. void orangefs_bufmap_page_fill(void *page_to,
  466. int buffer_index,
  467. int slot_index)
  468. {
  469. struct orangefs_bufmap_desc *from;
  470. void *page_from;
  471. from = &__orangefs_bufmap->desc_array[buffer_index];
  472. page_from = kmap_atomic(from->page_array[slot_index]);
  473. memcpy(page_to, page_from, PAGE_SIZE);
  474. kunmap_atomic(page_from);
  475. }