binder_alloc.h 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. /*
  2. * Copyright (C) 2017 Google, Inc.
  3. *
  4. * This software is licensed under the terms of the GNU General Public
  5. * License version 2, as published by the Free Software Foundation, and
  6. * may be copied, distributed, and modified under those terms.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. * GNU General Public License for more details.
  12. *
  13. */
  14. #ifndef _LINUX_BINDER_ALLOC_H
  15. #define _LINUX_BINDER_ALLOC_H
  16. #include <linux/rbtree.h>
  17. #include <linux/list.h>
  18. #include <linux/mm.h>
  19. #include <linux/rtmutex.h>
  20. #include <linux/vmalloc.h>
  21. #include <linux/slab.h>
  22. #include <linux/list_lru.h>
  23. extern struct list_lru binder_alloc_lru;
  24. struct binder_transaction;
  25. /**
  26. * struct binder_buffer - buffer used for binder transactions
  27. * @entry: entry alloc->buffers
  28. * @rb_node: node for allocated_buffers/free_buffers rb trees
  29. * @free: true if buffer is free
  30. * @allow_user_free: describe the second member of struct blah,
  31. * @async_transaction: describe the second member of struct blah,
  32. * @debug_id: describe the second member of struct blah,
  33. * @transaction: describe the second member of struct blah,
  34. * @target_node: describe the second member of struct blah,
  35. * @data_size: describe the second member of struct blah,
  36. * @offsets_size: describe the second member of struct blah,
  37. * @extra_buffers_size: describe the second member of struct blah,
  38. * @data:i describe the second member of struct blah,
  39. *
  40. * Bookkeeping structure for binder transaction buffers
  41. */
  42. struct binder_buffer {
  43. struct list_head entry; /* free and allocated entries by address */
  44. struct rb_node rb_node; /* free entry by size or allocated entry */
  45. /* by address */
  46. unsigned free:1;
  47. unsigned allow_user_free:1;
  48. unsigned async_transaction:1;
  49. unsigned debug_id:29;
  50. struct binder_transaction *transaction;
  51. struct binder_node *target_node;
  52. size_t data_size;
  53. size_t offsets_size;
  54. size_t extra_buffers_size;
  55. void *data;
  56. };
  57. /**
  58. * struct binder_lru_page - page object used for binder shrinker
  59. * @page_ptr: pointer to physical page in mmap'd space
  60. * @lru: entry in binder_alloc_lru
  61. * @alloc: binder_alloc for a proc
  62. */
  63. struct binder_lru_page {
  64. struct list_head lru;
  65. struct page *page_ptr;
  66. struct binder_alloc *alloc;
  67. };
  68. /**
  69. * struct binder_alloc - per-binder proc state for binder allocator
  70. * @vma: vm_area_struct passed to mmap_handler
  71. * (invarient after mmap)
  72. * @tsk: tid for task that called init for this proc
  73. * (invariant after init)
  74. * @vma_vm_mm: copy of vma->vm_mm (invarient after mmap)
  75. * @buffer: base of per-proc address space mapped via mmap
  76. * @user_buffer_offset: offset between user and kernel VAs for buffer
  77. * @buffers: list of all buffers for this proc
  78. * @free_buffers: rb tree of buffers available for allocation
  79. * sorted by size
  80. * @allocated_buffers: rb tree of allocated buffers sorted by address
  81. * @free_async_space: VA space available for async buffers. This is
  82. * initialized at mmap time to 1/2 the full VA space
  83. * @pages: array of binder_lru_page
  84. * @buffer_size: size of address space specified via mmap
  85. * @pid: pid for associated binder_proc (invariant after init)
  86. * @pages_high: high watermark of offset in @pages
  87. *
  88. * Bookkeeping structure for per-proc address space management for binder
  89. * buffers. It is normally initialized during binder_init() and binder_mmap()
  90. * calls. The address space is used for both user-visible buffers and for
  91. * struct binder_buffer objects used to track the user buffers
  92. */
  93. struct binder_alloc {
  94. struct mutex mutex;
  95. struct vm_area_struct *vma;
  96. struct mm_struct *vma_vm_mm;
  97. void *buffer;
  98. ptrdiff_t user_buffer_offset;
  99. struct list_head buffers;
  100. struct rb_root free_buffers;
  101. struct rb_root allocated_buffers;
  102. size_t free_async_space;
  103. struct binder_lru_page *pages;
  104. size_t buffer_size;
  105. uint32_t buffer_free;
  106. int pid;
  107. size_t pages_high;
  108. };
  109. #ifdef CONFIG_ANDROID_BINDER_IPC_SELFTEST
  110. void binder_selftest_alloc(struct binder_alloc *alloc);
  111. #else
  112. static inline void binder_selftest_alloc(struct binder_alloc *alloc) {}
  113. #endif
  114. enum lru_status binder_alloc_free_page(struct list_head *item,
  115. struct list_lru_one *lru,
  116. spinlock_t *lock, void *cb_arg);
  117. extern struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
  118. size_t data_size,
  119. size_t offsets_size,
  120. size_t extra_buffers_size,
  121. int is_async);
  122. extern void binder_alloc_init(struct binder_alloc *alloc);
  123. extern int binder_alloc_shrinker_init(void);
  124. extern void binder_alloc_vma_close(struct binder_alloc *alloc);
  125. extern struct binder_buffer *
  126. binder_alloc_prepare_to_free(struct binder_alloc *alloc,
  127. uintptr_t user_ptr);
  128. extern void binder_alloc_free_buf(struct binder_alloc *alloc,
  129. struct binder_buffer *buffer);
  130. extern int binder_alloc_mmap_handler(struct binder_alloc *alloc,
  131. struct vm_area_struct *vma);
  132. extern void binder_alloc_deferred_release(struct binder_alloc *alloc);
  133. extern int binder_alloc_get_allocated_count(struct binder_alloc *alloc);
  134. extern void binder_alloc_print_allocated(struct seq_file *m,
  135. struct binder_alloc *alloc);
  136. void binder_alloc_print_pages(struct seq_file *m,
  137. struct binder_alloc *alloc);
  138. /**
  139. * binder_alloc_get_free_async_space() - get free space available for async
  140. * @alloc: binder_alloc for this proc
  141. *
  142. * Return: the bytes remaining in the address-space for async transactions
  143. */
  144. static inline size_t
  145. binder_alloc_get_free_async_space(struct binder_alloc *alloc)
  146. {
  147. size_t free_async_space;
  148. mutex_lock(&alloc->mutex);
  149. free_async_space = alloc->free_async_space;
  150. mutex_unlock(&alloc->mutex);
  151. return free_async_space;
  152. }
  153. /**
  154. * binder_alloc_get_user_buffer_offset() - get offset between kernel/user addrs
  155. * @alloc: binder_alloc for this proc
  156. *
  157. * Return: the offset between kernel and user-space addresses to use for
  158. * virtual address conversion
  159. */
  160. static inline ptrdiff_t
  161. binder_alloc_get_user_buffer_offset(struct binder_alloc *alloc)
  162. {
  163. /*
  164. * user_buffer_offset is constant if vma is set and
  165. * undefined if vma is not set. It is possible to
  166. * get here with !alloc->vma if the target process
  167. * is dying while a transaction is being initiated.
  168. * Returning the old value is ok in this case and
  169. * the transaction will fail.
  170. */
  171. return alloc->user_buffer_offset;
  172. }
  173. #endif /* _LINUX_BINDER_ALLOC_H */