fix/breakage API : replace bt_ctf_event
[babeltrace.git] / formats / ctf / iterator.c
1 /*
2 * ctf/iterator.c
3 *
4 * Babeltrace Library
5 *
6 * Copyright 2011-2012 EfficiOS Inc. and Linux Foundation
7 *
8 * Author: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
9 * Julien Desfossez <julien.desfossez@efficios.com>
10 *
11 * Permission is hereby granted, free of charge, to any person obtaining a copy
12 * of this software and associated documentation files (the "Software"), to deal
13 * in the Software without restriction, including without limitation the rights
14 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
15 * copies of the Software, and to permit persons to whom the Software is
16 * furnished to do so, subject to the following conditions:
17 *
18 * The above copyright notice and this permission notice shall be included in
19 * all copies or substantial portions of the Software.
20 */
21
22 #include <babeltrace/babeltrace.h>
23 #include <babeltrace/format.h>
24 #include <babeltrace/ctf/events.h>
25 #include <babeltrace/ctf-ir/metadata.h>
26 #include <babeltrace/prio_heap.h>
27 #include <babeltrace/iterator-internal.h>
28 #include <babeltrace/ctf/events-internal.h>
29 #include <babeltrace/ctf/metadata.h>
30 #include <glib.h>
31
32 #include "events-private.h"
33
34 struct bt_ctf_iter *bt_ctf_iter_create(struct bt_context *ctx,
35 const struct bt_iter_pos *begin_pos,
36 const struct bt_iter_pos *end_pos)
37 {
38 struct bt_ctf_iter *iter;
39 int ret;
40
41 iter = g_new0(struct bt_ctf_iter, 1);
42 ret = bt_iter_init(&iter->parent, ctx, begin_pos, end_pos);
43 if (ret) {
44 g_free(iter);
45 return NULL;
46 }
47 iter->callbacks = g_array_new(0, 1, sizeof(struct bt_stream_callbacks));
48 iter->recalculate_dep_graph = 0;
49 iter->main_callbacks.callback = NULL;
50 iter->dep_gc = g_ptr_array_new();
51 return iter;
52 }
53
54 void bt_ctf_iter_destroy(struct bt_ctf_iter *iter)
55 {
56 struct bt_stream_callbacks *bt_stream_cb;
57 struct bt_callback_chain *bt_chain;
58 int i, j;
59
60 /* free all events callbacks */
61 if (iter->main_callbacks.callback)
62 g_array_free(iter->main_callbacks.callback, TRUE);
63
64 /* free per-event callbacks */
65 for (i = 0; i < iter->callbacks->len; i++) {
66 bt_stream_cb = &g_array_index(iter->callbacks,
67 struct bt_stream_callbacks, i);
68 if (!bt_stream_cb || !bt_stream_cb->per_id_callbacks)
69 continue;
70 for (j = 0; j < bt_stream_cb->per_id_callbacks->len; j++) {
71 bt_chain = &g_array_index(bt_stream_cb->per_id_callbacks,
72 struct bt_callback_chain, j);
73 if (bt_chain->callback) {
74 g_array_free(bt_chain->callback, TRUE);
75 }
76 }
77 g_array_free(bt_stream_cb->per_id_callbacks, TRUE);
78 }
79
80 bt_iter_fini(&iter->parent);
81 g_free(iter);
82 }
83
84 struct bt_iter *bt_ctf_get_iter(struct bt_ctf_iter *iter)
85 {
86 return &iter->parent;
87 }
88
89 struct ctf_event_definition *bt_ctf_iter_read_event(struct bt_ctf_iter *iter)
90 {
91 struct ctf_file_stream *file_stream;
92 struct ctf_event_definition *ret = &iter->current_ctf_event;
93 struct ctf_stream_definition *stream;
94
95 file_stream = heap_maximum(iter->parent.stream_heap);
96 if (!file_stream) {
97 /* end of file for all streams */
98 goto stop;
99 }
100 stream = &file_stream->parent;
101 ret = g_ptr_array_index(stream->events_by_id,
102 stream->event_id);
103
104 if (ret->stream->stream_id > iter->callbacks->len)
105 goto end;
106
107 process_callbacks(iter, ret->stream);
108
109 end:
110 return ret;
111 stop:
112 return NULL;
113 }
This page took 0.045612 seconds and 5 git commands to generate.