Lines Matching defs:buffer
119 * Each buffer keeps an array of ordered events objects:
120 * buffer -> event[0]
132 * - use available object in current allocation buffer
133 * - allocate new buffer if the current buffer is full
138 size = sizeof(*oe->buffer) + MAX_SAMPLE_BUFFER * sizeof(*new);
143 } else if (oe->buffer) {
144 new = &oe->buffer->event[oe->buffer_idx];
146 oe->buffer = NULL;
148 oe->buffer = malloc(size);
149 if (!oe->buffer) {
158 list_add(&oe->buffer->list, &oe->to_free);
161 new = &oe->buffer->event[0];
373 ordered_events_buffer__free(struct ordered_events_buffer *buffer,
380 __free_dup_event(oe, buffer->event[i].event);
383 free(buffer);
388 struct ordered_events_buffer *buffer, *tmp;
394 * Current buffer might not have all the events allocated
397 if (oe->buffer) {
398 list_del_init(&oe->buffer->list);
399 ordered_events_buffer__free(oe->buffer, oe->buffer_idx, oe);
403 list_for_each_entry_safe(buffer, tmp, &oe->to_free, list) {
404 list_del_init(&buffer->list);
405 ordered_events_buffer__free(buffer, MAX_SAMPLE_BUFFER, oe);