Lines Matching defs:buffer
50 static struct binder_buffer *binder_buffer_next(struct binder_buffer *buffer)
52 return list_entry(buffer->entry.next, struct binder_buffer, entry);
55 static struct binder_buffer *binder_buffer_prev(struct binder_buffer *buffer)
57 return list_entry(buffer->entry.prev, struct binder_buffer, entry);
61 struct binder_buffer *buffer)
63 if (list_is_last(&buffer->entry, &alloc->buffers))
64 return alloc->buffer + alloc->buffer_size - buffer->user_data;
65 return binder_buffer_next(buffer)->user_data - buffer->user_data;
73 struct binder_buffer *buffer;
82 "%d: add free buffer, size %zd, at %pK\n",
87 buffer = rb_entry(parent, struct binder_buffer, rb_node);
88 BUG_ON(!buffer->free);
90 buffer_size = binder_alloc_buffer_size(alloc, buffer);
106 struct binder_buffer *buffer;
112 buffer = rb_entry(parent, struct binder_buffer, rb_node);
113 BUG_ON(buffer->free);
115 if (new_buffer->user_data < buffer->user_data)
117 else if (new_buffer->user_data > buffer->user_data)
131 struct binder_buffer *buffer;
137 buffer = rb_entry(n, struct binder_buffer, rb_node);
138 BUG_ON(buffer->free);
140 if (uptr < buffer->user_data)
142 else if (uptr > buffer->user_data)
147 * free the buffer when in use by kernel or
150 if (!buffer->allow_user_free)
152 buffer->allow_user_free = 0;
153 return buffer;
160 * binder_alloc_prepare_to_free() - get buffer given user ptr
162 * @user_ptr: User pointer to buffer data
164 * Validate userspace pointer to buffer data and return buffer corresponding to
165 * that user pointer. Search the rb tree for buffer that matches user data
168 * Return: Pointer to buffer or NULL
173 struct binder_buffer *buffer;
176 buffer = binder_alloc_prepare_to_free_locked(alloc, user_ptr);
178 return buffer;
204 page = &alloc->pages[(page_addr - alloc->buffer) / PAGE_SIZE];
231 index = (page_addr - alloc->buffer) / PAGE_SIZE;
283 index = (page_addr - alloc->buffer) / PAGE_SIZE;
319 * If we see alloc->vma is not NULL, buffer data structures set up
351 struct binder_buffer *buffer;
357 buffer = rb_entry(n, struct binder_buffer, rb_node);
358 if (buffer->pid != pid)
360 if (!buffer->async_transaction)
362 total_alloc_size += binder_alloc_buffer_size(alloc, buffer);
368 * async space (which is 25% of total buffer size).
386 struct binder_buffer *buffer;
429 buffer = rb_entry(n, struct binder_buffer, rb_node);
430 BUG_ON(!buffer->free);
431 buffer_size = binder_alloc_buffer_size(alloc, buffer);
453 buffer = rb_entry(n, struct binder_buffer, rb_node);
454 buffer_size = binder_alloc_buffer_size(alloc, buffer);
462 buffer = rb_entry(n, struct binder_buffer, rb_node);
463 buffer_size = binder_alloc_buffer_size(alloc, buffer);
480 buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
481 buffer_size = binder_alloc_buffer_size(alloc, buffer);
485 "%d: binder_alloc_buf size %zd got buffer %pK size %zd\n",
486 alloc->pid, size, buffer, buffer_size);
489 (((uintptr_t)buffer->user_data + buffer_size) & PAGE_MASK);
492 (void __user *)PAGE_ALIGN((uintptr_t)buffer->user_data + size);
496 PAGE_ALIGN((uintptr_t)buffer->user_data), end_page_addr);
503 new_buffer = kzalloc(sizeof(*buffer), GFP_KERNEL);
505 pr_err("%s: %d failed to alloc new buffer struct\n",
509 new_buffer->user_data = (u8 __user *)buffer->user_data + size;
510 list_add(&new_buffer->entry, &buffer->entry);
516 buffer->free = 0;
517 buffer->allow_user_free = 0;
518 binder_insert_allocated_buffer_locked(alloc, buffer);
521 alloc->pid, size, buffer);
522 buffer->data_size = data_size;
523 buffer->offsets_size = offsets_size;
524 buffer->async_transaction = is_async;
525 buffer->extra_buffers_size = extra_buffers_size;
526 buffer->pid = pid;
536 * buffer size).
541 return buffer;
545 PAGE_ALIGN((uintptr_t)buffer->user_data),
551 * binder_alloc_new_buf() - Allocate a new binder buffer
553 * @data_size: size of user data buffer
554 * @offsets_size: user specified buffer offset
556 * @is_async: buffer for async transaction
559 * Allocate a new buffer given the requested sizes. Returns
560 * the kernel version of the buffer pointer. The size allocated
564 * Return: The allocated buffer or %ERR_PTR(-errno) if error
573 struct binder_buffer *buffer;
576 buffer = binder_alloc_new_buf_locked(alloc, data_size, offsets_size,
579 return buffer;
582 static void __user *buffer_start_page(struct binder_buffer *buffer)
584 return (void __user *)((uintptr_t)buffer->user_data & PAGE_MASK);
587 static void __user *prev_buffer_end_page(struct binder_buffer *buffer)
590 (((uintptr_t)(buffer->user_data) - 1) & PAGE_MASK);
594 struct binder_buffer *buffer)
599 BUG_ON(alloc->buffers.next == &buffer->entry);
600 prev = binder_buffer_prev(buffer);
602 if (prev_buffer_end_page(prev) == buffer_start_page(buffer)) {
605 "%d: merge free, buffer %pK share page with %pK\n",
606 alloc->pid, buffer->user_data,
610 if (!list_is_last(&buffer->entry, &alloc->buffers)) {
611 next = binder_buffer_next(buffer);
612 if (buffer_start_page(next) == buffer_start_page(buffer)) {
615 "%d: merge free, buffer %pK share page with %pK\n",
617 buffer->user_data,
622 if (PAGE_ALIGNED(buffer->user_data)) {
624 "%d: merge free, buffer start %pK is page aligned\n",
625 alloc->pid, buffer->user_data);
631 "%d: merge free, buffer %pK do not share page with %pK or %pK\n",
632 alloc->pid, buffer->user_data,
635 binder_update_page_range(alloc, 0, buffer_start_page(buffer),
636 buffer_start_page(buffer) + PAGE_SIZE);
638 list_del(&buffer->entry);
639 kfree(buffer);
643 struct binder_buffer *buffer)
647 buffer_size = binder_alloc_buffer_size(alloc, buffer);
649 size = ALIGN(buffer->data_size, sizeof(void *)) +
650 ALIGN(buffer->offsets_size, sizeof(void *)) +
651 ALIGN(buffer->extra_buffers_size, sizeof(void *));
655 alloc->pid, buffer, size, buffer_size);
657 BUG_ON(buffer->free);
659 BUG_ON(buffer->transaction != NULL);
660 BUG_ON(buffer->user_data < alloc->buffer);
661 BUG_ON(buffer->user_data > alloc->buffer + alloc->buffer_size);
663 if (buffer->async_transaction) {
671 (void __user *)PAGE_ALIGN((uintptr_t)buffer->user_data),
673 buffer->user_data + buffer_size) & PAGE_MASK));
675 rb_erase(&buffer->rb_node, &alloc->allocated_buffers);
676 buffer->free = 1;
677 if (!list_is_last(&buffer->entry, &alloc->buffers)) {
678 struct binder_buffer *next = binder_buffer_next(buffer);
685 if (alloc->buffers.next != &buffer->entry) {
686 struct binder_buffer *prev = binder_buffer_prev(buffer);
689 binder_delete_free_buffer(alloc, buffer);
691 buffer = prev;
694 binder_insert_free_buffer(alloc, buffer);
698 struct binder_buffer *buffer);
700 * binder_alloc_free_buf() - free a binder buffer
702 * @buffer: kernel pointer to buffer
704 * Free the buffer allocated via binder_alloc_new_buf()
707 struct binder_buffer *buffer)
717 if (buffer->clear_on_free) {
718 binder_alloc_clear_buf(alloc, buffer);
719 buffer->clear_on_free = false;
722 binder_free_buf_locked(alloc, buffer);
744 struct binder_buffer *buffer;
756 alloc->buffer = (void __user *)vma->vm_start;
767 buffer = kzalloc(sizeof(*buffer), GFP_KERNEL);
768 if (!buffer) {
770 failure_string = "alloc buffer struct";
774 buffer->user_data = alloc->buffer;
775 list_add(&buffer->entry, &alloc->buffers);
776 buffer->free = 1;
777 binder_insert_free_buffer(alloc, buffer);
788 alloc->buffer = NULL;
805 struct binder_buffer *buffer;
812 buffer = rb_entry(n, struct binder_buffer, rb_node);
815 BUG_ON(buffer->transaction);
817 if (buffer->clear_on_free) {
818 binder_alloc_clear_buf(alloc, buffer);
819 buffer->clear_on_free = false;
821 binder_free_buf_locked(alloc, buffer);
826 buffer = list_first_entry(&alloc->buffers,
828 WARN_ON(!buffer->free);
830 list_del(&buffer->entry);
832 kfree(buffer);
848 page_addr = alloc->buffer + i * PAGE_SIZE;
868 struct binder_buffer *buffer)
871 prefix, buffer->debug_id, buffer->user_data,
872 buffer->data_size, buffer->offsets_size,
873 buffer->extra_buffers_size,
874 buffer->transaction ? "active" : "delivered");
878 * binder_alloc_print_allocated() - print buffer info
882 * Prints information about every buffer associated with
892 print_binder_buffer(m, " buffer",
996 page_addr = (uintptr_t)alloc->buffer + index * PAGE_SIZE;
1098 * check_buffer() - verify that buffer/offset is safe to access
1100 * @buffer: binder buffer to be accessed
1101 * @offset: offset into @buffer data
1105 * @buffer and that the buffer is currently active and not freeable.
1107 * allowed to touch the buffer in two cases:
1109 * 1) when the buffer is being created:
1110 * (buffer->free == 0 && buffer->allow_user_free == 0)
1111 * 2) when the buffer is being torn down:
1112 * (buffer->free == 0 && buffer->transaction == NULL).
1114 * Return: true if the buffer is safe to access
1117 struct binder_buffer *buffer,
1120 size_t buffer_size = binder_alloc_buffer_size(alloc, buffer);
1125 !buffer->free &&
1126 (!buffer->allow_user_free || !buffer->transaction);
1130 * binder_alloc_get_page() - get kernel pointer for given buffer offset
1132 * @buffer: binder buffer to be accessed
1133 * @buffer_offset: offset into @buffer data
1137 * at @buffer_offset into @buffer->user_data. If @pgoffp is not
1141 * to a valid address within the @buffer and that @buffer is
1149 struct binder_buffer *buffer,
1154 (buffer->user_data - alloc->buffer);
1165 * binder_alloc_clear_buf() - zero out buffer
1167 * @buffer: binder buffer to be cleared
1169 * memset the given buffer to 0
1172 struct binder_buffer *buffer)
1174 size_t bytes = binder_alloc_buffer_size(alloc, buffer);
1183 page = binder_alloc_get_page(alloc, buffer,
1197 * @buffer: binder buffer to be accessed
1198 * @buffer_offset: offset into @buffer data
1199 * @from: userspace pointer to source buffer
1202 * Copy bytes from source userspace to target buffer.
1208 struct binder_buffer *buffer,
1213 if (!check_buffer(alloc, buffer, buffer_offset, bytes))
1223 page = binder_alloc_get_page(alloc, buffer,
1240 struct binder_buffer *buffer,
1246 if (!check_buffer(alloc, buffer, buffer_offset, bytes))
1256 page = binder_alloc_get_page(alloc, buffer,
1279 struct binder_buffer *buffer,
1284 return binder_alloc_do_buffer_copy(alloc, true, buffer, buffer_offset,
1290 struct binder_buffer *buffer,
1294 return binder_alloc_do_buffer_copy(alloc, false, buffer, buffer_offset,