Lines Matching refs:oe
18 static void queue_event(struct ordered_events *oe, struct ordered_event *new)
20 struct ordered_event *last = oe->last;
24 ++oe->nr_events;
25 oe->last = new;
27 pr_oe_time2(timestamp, "queue_event nr_events %u\n", oe->nr_events);
30 list_add(&new->list, &oe->events);
31 oe->max_timestamp = timestamp;
43 if (p == &oe->events) {
44 list_add_tail(&new->list, &oe->events);
45 oe->max_timestamp = timestamp;
54 if (p == &oe->events) {
55 list_add(&new->list, &oe->events);
64 static union perf_event *__dup_event(struct ordered_events *oe,
69 if (oe->cur_alloc_size < oe->max_alloc_size) {
72 oe->cur_alloc_size += event->header.size;
78 static union perf_event *dup_event(struct ordered_events *oe,
81 return oe->copy_on_queue ? __dup_event(oe, event) : event;
84 static void __free_dup_event(struct ordered_events *oe, union perf_event *event)
87 oe->cur_alloc_size -= event->header.size;
92 static void free_dup_event(struct ordered_events *oe, union perf_event *event)
94 if (oe->copy_on_queue)
95 __free_dup_event(oe, event);
99 static struct ordered_event *alloc_event(struct ordered_events *oe,
102 struct list_head *cache = &oe->cache;
107 new_event = dup_event(oe, event);
138 size = sizeof(*oe->buffer) + MAX_SAMPLE_BUFFER * sizeof(*new);
143 } else if (oe->buffer) {
144 new = &oe->buffer->event[oe->buffer_idx];
145 if (++oe->buffer_idx == MAX_SAMPLE_BUFFER)
146 oe->buffer = NULL;
147 } else if ((oe->cur_alloc_size + size) < oe->max_alloc_size) {
148 oe->buffer = malloc(size);
149 if (!oe->buffer) {
150 free_dup_event(oe, new_event);
155 oe->cur_alloc_size, size, oe->max_alloc_size);
157 oe->cur_alloc_size += size;
158 list_add(&oe->buffer->list, &oe->to_free);
160 oe->buffer_idx = 1;
161 new = &oe->buffer->event[0];
163 pr("allocation limit reached %" PRIu64 "B\n", oe->max_alloc_size);
172 ordered_events__new_event(struct ordered_events *oe, u64 timestamp,
177 new = alloc_event(oe, event);
180 queue_event(oe, new);
186 void ordered_events__delete(struct ordered_events *oe, struct ordered_event *event)
188 list_move(&event->list, &oe->cache);
189 oe->nr_events--;
190 free_dup_event(oe, event->event);
194 int ordered_events__queue(struct ordered_events *oe, union perf_event *event,
202 if (timestamp < oe->last_flush) {
204 pr_oe_time(oe->last_flush, "last flush, last_flush_type %d\n",
205 oe->last_flush_type);
207 oe->nr_unordered_events++;
210 oevent = ordered_events__new_event(oe, timestamp, event);
212 ordered_events__flush(oe, OE_FLUSH__HALF);
213 oevent = ordered_events__new_event(oe, timestamp, event);
223 static int do_flush(struct ordered_events *oe, bool show_progress)
225 struct list_head *head = &oe->events;
227 u64 limit = oe->next_flush;
228 u64 last_ts = oe->last ? oe->last->timestamp : 0ULL;
236 ui_progress__init(&prog, oe->nr_events, "Processing time ordered events...");
244 ret = oe->deliver(oe, iter);
248 ordered_events__delete(oe, iter);
249 oe->last_flush = iter->timestamp;
256 oe->last = NULL;
258 oe->last = list_entry(head->prev, struct ordered_event, list);
266 static int __ordered_events__flush(struct ordered_events *oe, enum oe_flush how,
280 if (oe->nr_events == 0)
288 oe->next_flush = ULLONG_MAX;
294 struct list_head *head = &oe->events;
297 last = oe->last;
303 oe->next_flush = first->timestamp;
304 oe->next_flush += (last->timestamp - first->timestamp) / 2;
309 oe->next_flush = timestamp;
319 pr_oe_time(oe->next_flush, "next_flush - ordered_events__flush PRE %s, nr_events %u\n",
320 str[how], oe->nr_events);
321 pr_oe_time(oe->max_timestamp, "max_timestamp\n");
323 err = do_flush(oe, show_progress);
327 oe->next_flush = oe->max_timestamp;
329 oe->last_flush_type = how;
332 pr_oe_time(oe->next_flush, "next_flush - ordered_events__flush POST %s, nr_events %u\n",
333 str[how], oe->nr_events);
334 pr_oe_time(oe->last_flush, "last_flush\n");
339 int ordered_events__flush(struct ordered_events *oe, enum oe_flush how)
341 return __ordered_events__flush(oe, how, 0);
344 int ordered_events__flush_time(struct ordered_events *oe, u64 timestamp)
346 return __ordered_events__flush(oe, OE_FLUSH__TIME, timestamp);
349 u64 ordered_events__first_time(struct ordered_events *oe)
353 if (list_empty(&oe->events))
356 event = list_first_entry(&oe->events, struct ordered_event, list);
360 void ordered_events__init(struct ordered_events *oe, ordered_events__deliver_t deliver,
363 INIT_LIST_HEAD(&oe->events);
364 INIT_LIST_HEAD(&oe->cache);
365 INIT_LIST_HEAD(&oe->to_free);
366 oe->max_alloc_size = (u64) -1;
367 oe->cur_alloc_size = 0;
368 oe->deliver = deliver;
369 oe->data = data;
374 unsigned int max, struct ordered_events *oe)
376 if (oe->copy_on_queue) {
380 __free_dup_event(oe, buffer->event[i].event);
386 void ordered_events__free(struct ordered_events *oe)
390 if (list_empty(&oe->to_free))
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) {
405 ordered_events_buffer__free(buffer, MAX_SAMPLE_BUFFER, oe);
409 void ordered_events__reinit(struct ordered_events *oe)
411 ordered_events__deliver_t old_deliver = oe->deliver;
413 ordered_events__free(oe);
414 memset(oe, '\0', sizeof(*oe));
415 ordered_events__init(oe, old_deliver, oe->data);