pagelist.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/module.h>
  3. #include <linux/gfp.h>
  4. #include <linux/slab.h>
  5. #include <linux/pagemap.h>
  6. #include <linux/highmem.h>
  7. #include <linux/ceph/pagelist.h>
  8. struct ceph_pagelist *ceph_pagelist_alloc(gfp_t gfp_flags)
  9. {
  10. struct ceph_pagelist *pl;
  11. pl = kmalloc(sizeof(*pl), gfp_flags);
  12. if (!pl)
  13. return NULL;
  14. INIT_LIST_HEAD(&pl->head);
  15. pl->mapped_tail = NULL;
  16. pl->length = 0;
  17. pl->room = 0;
  18. INIT_LIST_HEAD(&pl->free_list);
  19. pl->num_pages_free = 0;
  20. refcount_set(&pl->refcnt, 1);
  21. return pl;
  22. }
  23. EXPORT_SYMBOL(ceph_pagelist_alloc);
  24. static void ceph_pagelist_unmap_tail(struct ceph_pagelist *pl)
  25. {
  26. if (pl->mapped_tail) {
  27. struct page *page = list_entry(pl->head.prev, struct page, lru);
  28. kunmap(page);
  29. pl->mapped_tail = NULL;
  30. }
  31. }
  32. void ceph_pagelist_release(struct ceph_pagelist *pl)
  33. {
  34. if (!refcount_dec_and_test(&pl->refcnt))
  35. return;
  36. ceph_pagelist_unmap_tail(pl);
  37. while (!list_empty(&pl->head)) {
  38. struct page *page = list_first_entry(&pl->head, struct page,
  39. lru);
  40. list_del(&page->lru);
  41. __free_page(page);
  42. }
  43. ceph_pagelist_free_reserve(pl);
  44. kfree(pl);
  45. }
  46. EXPORT_SYMBOL(ceph_pagelist_release);
  47. static int ceph_pagelist_addpage(struct ceph_pagelist *pl)
  48. {
  49. struct page *page;
  50. if (!pl->num_pages_free) {
  51. page = __page_cache_alloc(GFP_NOFS);
  52. } else {
  53. page = list_first_entry(&pl->free_list, struct page, lru);
  54. list_del(&page->lru);
  55. --pl->num_pages_free;
  56. }
  57. if (!page)
  58. return -ENOMEM;
  59. pl->room += PAGE_SIZE;
  60. ceph_pagelist_unmap_tail(pl);
  61. list_add_tail(&page->lru, &pl->head);
  62. pl->mapped_tail = kmap(page);
  63. return 0;
  64. }
  65. int ceph_pagelist_append(struct ceph_pagelist *pl, const void *buf, size_t len)
  66. {
  67. while (pl->room < len) {
  68. size_t bit = pl->room;
  69. int ret;
  70. memcpy(pl->mapped_tail + (pl->length & ~PAGE_MASK),
  71. buf, bit);
  72. pl->length += bit;
  73. pl->room -= bit;
  74. buf += bit;
  75. len -= bit;
  76. ret = ceph_pagelist_addpage(pl);
  77. if (ret)
  78. return ret;
  79. }
  80. memcpy(pl->mapped_tail + (pl->length & ~PAGE_MASK), buf, len);
  81. pl->length += len;
  82. pl->room -= len;
  83. return 0;
  84. }
  85. EXPORT_SYMBOL(ceph_pagelist_append);
  86. /* Allocate enough pages for a pagelist to append the given amount
  87. * of data without allocating.
  88. * Returns: 0 on success, -ENOMEM on error.
  89. */
  90. int ceph_pagelist_reserve(struct ceph_pagelist *pl, size_t space)
  91. {
  92. if (space <= pl->room)
  93. return 0;
  94. space -= pl->room;
  95. space = (space + PAGE_SIZE - 1) >> PAGE_SHIFT; /* conv to num pages */
  96. while (space > pl->num_pages_free) {
  97. struct page *page = __page_cache_alloc(GFP_NOFS);
  98. if (!page)
  99. return -ENOMEM;
  100. list_add_tail(&page->lru, &pl->free_list);
  101. ++pl->num_pages_free;
  102. }
  103. return 0;
  104. }
  105. EXPORT_SYMBOL(ceph_pagelist_reserve);
  106. /* Free any pages that have been preallocated. */
  107. int ceph_pagelist_free_reserve(struct ceph_pagelist *pl)
  108. {
  109. while (!list_empty(&pl->free_list)) {
  110. struct page *page = list_first_entry(&pl->free_list,
  111. struct page, lru);
  112. list_del(&page->lru);
  113. __free_page(page);
  114. --pl->num_pages_free;
  115. }
  116. BUG_ON(pl->num_pages_free);
  117. return 0;
  118. }
  119. EXPORT_SYMBOL(ceph_pagelist_free_reserve);
  120. /* Create a truncation point. */
  121. void ceph_pagelist_set_cursor(struct ceph_pagelist *pl,
  122. struct ceph_pagelist_cursor *c)
  123. {
  124. c->pl = pl;
  125. c->page_lru = pl->head.prev;
  126. c->room = pl->room;
  127. }
  128. EXPORT_SYMBOL(ceph_pagelist_set_cursor);
  129. /* Truncate a pagelist to the given point. Move extra pages to reserve.
  130. * This won't sleep.
  131. * Returns: 0 on success,
  132. * -EINVAL if the pagelist doesn't match the trunc point pagelist
  133. */
  134. int ceph_pagelist_truncate(struct ceph_pagelist *pl,
  135. struct ceph_pagelist_cursor *c)
  136. {
  137. struct page *page;
  138. if (pl != c->pl)
  139. return -EINVAL;
  140. ceph_pagelist_unmap_tail(pl);
  141. while (pl->head.prev != c->page_lru) {
  142. page = list_entry(pl->head.prev, struct page, lru);
  143. /* move from pagelist to reserve */
  144. list_move_tail(&page->lru, &pl->free_list);
  145. ++pl->num_pages_free;
  146. }
  147. pl->room = c->room;
  148. if (!list_empty(&pl->head)) {
  149. page = list_entry(pl->head.prev, struct page, lru);
  150. pl->mapped_tail = kmap(page);
  151. }
  152. return 0;
  153. }
  154. EXPORT_SYMBOL(ceph_pagelist_truncate);