binder_buffer
struct binder_buffer *buffer,
struct binder_buffer *b,
struct binder_buffer *b,
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *b = t->buffer;
struct binder_buffer *buffer = t_outdated->buffer;
struct binder_buffer *buffer, bool is_failure)
binder_uintptr_t binder_buffer, size_t size,
void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
struct binder_buffer *buffer;
binder_uintptr_t binder_buffer, size_t size,
void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
struct binder_buffer *buffer = t->buffer;
struct binder_buffer *buffer = t->buffer;
struct binder_alloc *alloc, struct binder_buffer *new_buffer)
struct binder_buffer *buffer;
buffer = rb_entry(n, struct binder_buffer, rb_node);
struct binder_buffer *buffer;
buffer = rb_entry(parent, struct binder_buffer, rb_node);
static struct binder_buffer *binder_alloc_prepare_to_free_locked(
struct binder_buffer *buffer,
struct binder_buffer *buffer;
struct binder_buffer *buffer,
buffer = rb_entry(n, struct binder_buffer, rb_node);
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *binder_alloc_prepare_to_free(struct binder_alloc *alloc,
struct binder_buffer *buffer,
struct binder_buffer *buffer;
buffer = rb_entry(n, struct binder_buffer, rb_node);
buffer = rb_entry(n, struct binder_buffer, rb_node);
struct binder_buffer *buffer;
buffer = rb_entry(n, struct binder_buffer, rb_node);
static struct binder_buffer *binder_buffer_next(struct binder_buffer *buffer)
static struct binder_buffer *binder_alloc_new_buf_locked(
struct binder_buffer *new_buffer,
struct binder_buffer *buffer;
return list_entry(buffer->entry.next, struct binder_buffer, entry);
buffer = rb_entry(n, struct binder_buffer, rb_node);
static struct binder_buffer *binder_buffer_prev(struct binder_buffer *buffer)
buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
return list_entry(buffer->entry.prev, struct binder_buffer, entry);
struct binder_buffer *buffer)
struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
struct binder_buffer *buffer, *next;
static unsigned long buffer_start_page(struct binder_buffer *buffer)
static unsigned long prev_buffer_end_page(struct binder_buffer *buffer)
struct binder_buffer *new_buffer)
struct binder_buffer *buffer)
struct binder_buffer *prev, *next;
struct binder_buffer *buffer)
struct binder_buffer *buffer;
struct binder_buffer *next = binder_buffer_next(buffer);
struct binder_buffer *prev = binder_buffer_prev(buffer);
struct binder_buffer *buffer,
struct binder_buffer *buffer)
struct binder_buffer *buffer)
buffer = rb_entry(parent, struct binder_buffer, rb_node);
struct binder_buffer *buffer;
struct binder_buffer *buffer;
buffer = rb_entry(n, struct binder_buffer, rb_node);
struct binder_buffer, entry);
struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
struct binder_buffer *
struct binder_buffer *buffer);
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *buffer,
struct binder_buffer *buffer);
struct binder_buffer *buffer;
struct binder_buffer;
TP_PROTO(struct binder_buffer *buf),
TP_PROTO(struct binder_buffer *buffer),
TP_PROTO(struct binder_buffer *buffer),
TP_PROTO(struct binder_buffer *buffer),
TP_PROTO(struct binder_buffer *buffer),
struct binder_buffer *buffer,
struct binder_buffer *buffers[],
struct binder_buffer *buffers[],
struct binder_buffer *buffers[BUFFER_NUM];
struct binder_buffer *buf;
buf = rb_entry(n, struct binder_buffer, rb_node);