drm_buffer.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  1. /**************************************************************************
  2. *
  3. * Copyright 2010 Pauli Nieminen.
  4. * All Rights Reserved.
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining a
  7. * copy of this software and associated documentation files (the
  8. * "Software"), to deal in the Software without restriction, including
  9. * without limitation the rights to use, copy, modify, merge, publish,
  10. * distribute, sub license, and/or sell copies of the Software, and to
  11. * permit persons to whom the Software is furnished to do so, subject to
  12. * the following conditions:
  13. *
  14. * The above copyright notice and this permission notice (including the
  15. * next paragraph) shall be included in all copies or substantial portions
  16. * of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
  21. * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
  22. * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  23. * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  24. * USE OR OTHER DEALINGS IN THE SOFTWARE.
  25. *
  26. *
  27. **************************************************************************/
  28. /*
  29. * Multipart buffer for coping data which is larger than the page size.
  30. *
  31. * Authors:
  32. * Pauli Nieminen <suokkos-at-gmail-dot-com>
  33. */
  34. #include "drm_buffer.h"
  35. /**
  36. * Allocate the drm buffer object.
  37. *
  38. * buf: Pointer to a pointer where the object is stored.
  39. * size: The number of bytes to allocate.
  40. */
  41. int drm_buffer_alloc(struct drm_buffer **buf, int size)
  42. {
  43. int nr_pages = size / PAGE_SIZE + 1;
  44. int idx;
  45. /* Allocating pointer table to end of structure makes drm_buffer
  46. * variable sized */
  47. *buf = kzalloc(sizeof(struct drm_buffer) + nr_pages*sizeof(char *),
  48. GFP_KERNEL);
  49. if (*buf == NULL) {
  50. DRM_ERROR("Failed to allocate drm buffer object to hold"
  51. " %d bytes in %d pages.\n",
  52. size, nr_pages);
  53. return -ENOMEM;
  54. }
  55. (*buf)->size = size;
  56. for (idx = 0; idx < nr_pages; ++idx) {
  57. (*buf)->data[idx] =
  58. kmalloc(min(PAGE_SIZE, size - idx * PAGE_SIZE),
  59. GFP_KERNEL);
  60. if ((*buf)->data[idx] == NULL) {
  61. DRM_ERROR("Failed to allocate %dth page for drm"
  62. " buffer with %d bytes and %d pages.\n",
  63. idx + 1, size, nr_pages);
  64. goto error_out;
  65. }
  66. }
  67. return 0;
  68. error_out:
  69. /* Only last element can be null pointer so check for it first. */
  70. if ((*buf)->data[idx])
  71. kfree((*buf)->data[idx]);
  72. for (--idx; idx >= 0; --idx)
  73. kfree((*buf)->data[idx]);
  74. kfree(*buf);
  75. return -ENOMEM;
  76. }
  77. EXPORT_SYMBOL(drm_buffer_alloc);
  78. /**
  79. * Copy the user data to the begin of the buffer and reset the processing
  80. * iterator.
  81. *
  82. * user_data: A pointer the data that is copied to the buffer.
  83. * size: The Number of bytes to copy.
  84. */
  85. int drm_buffer_copy_from_user(struct drm_buffer *buf,
  86. void __user *user_data, int size)
  87. {
  88. int nr_pages = size / PAGE_SIZE + 1;
  89. int idx;
  90. if (size > buf->size) {
  91. DRM_ERROR("Requesting to copy %d bytes to a drm buffer with"
  92. " %d bytes space\n",
  93. size, buf->size);
  94. return -EFAULT;
  95. }
  96. for (idx = 0; idx < nr_pages; ++idx) {
  97. if (DRM_COPY_FROM_USER(buf->data[idx],
  98. user_data + idx * PAGE_SIZE,
  99. min(PAGE_SIZE, size - idx * PAGE_SIZE))) {
  100. DRM_ERROR("Failed to copy user data (%p) to drm buffer"
  101. " (%p) %dth page.\n",
  102. user_data, buf, idx);
  103. return -EFAULT;
  104. }
  105. }
  106. buf->iterator = 0;
  107. return 0;
  108. }
  109. EXPORT_SYMBOL(drm_buffer_copy_from_user);
  110. /**
  111. * Free the drm buffer object
  112. */
  113. void drm_buffer_free(struct drm_buffer *buf)
  114. {
  115. if (buf != NULL) {
  116. int nr_pages = buf->size / PAGE_SIZE + 1;
  117. int idx;
  118. for (idx = 0; idx < nr_pages; ++idx)
  119. kfree(buf->data[idx]);
  120. kfree(buf);
  121. }
  122. }
  123. EXPORT_SYMBOL(drm_buffer_free);
  124. /**
  125. * Read an object from buffer that may be split to multiple parts. If object
  126. * is not split function just returns the pointer to object in buffer. But in
  127. * case of split object data is copied to given stack object that is suplied
  128. * by caller.
  129. *
  130. * The processing location of the buffer is also advanced to the next byte
  131. * after the object.
  132. *
  133. * objsize: The size of the objet in bytes.
  134. * stack_obj: A pointer to a memory location where object can be copied.
  135. */
  136. void *drm_buffer_read_object(struct drm_buffer *buf,
  137. int objsize, void *stack_obj)
  138. {
  139. int idx = drm_buffer_index(buf);
  140. int page = drm_buffer_page(buf);
  141. void *obj = NULL;
  142. if (idx + objsize <= PAGE_SIZE) {
  143. obj = &buf->data[page][idx];
  144. } else {
  145. /* The object is split which forces copy to temporary object.*/
  146. int beginsz = PAGE_SIZE - idx;
  147. memcpy(stack_obj, &buf->data[page][idx], beginsz);
  148. memcpy(stack_obj + beginsz, &buf->data[page + 1][0],
  149. objsize - beginsz);
  150. obj = stack_obj;
  151. }
  152. drm_buffer_advance(buf, objsize);
  153. return obj;
  154. }
  155. EXPORT_SYMBOL(drm_buffer_read_object);