converter/babeltrace-lib.c

   1 /*
   2  * babeltrace-lib.c
   3  *
   4  * Babeltrace Trace Converter Library
   5  *
   6  * Copyright 2010-2011 EfficiOS Inc. and Linux Foundation
   7  *
   8  * Author: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
   9  *
  10  * Permission is hereby granted, free of charge, to any person obtaining a copy
  11  * of this software and associated documentation files (the "Software"), to deal
  12  * in the Software without restriction, including without limitation the rights
  13  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  14  * copies of the Software, and to permit persons to whom the Software is
  15  * furnished to do so, subject to the following conditions:
  16  *
  17  * The above copyright notice and this permission notice shall be included in
  18  * all copies or substantial portions of the Software.
  19  */
  20
  21 #include <stdlib.h>
  22 #include <errno.h>
  23 #include <stdio.h>
  24 #include <inttypes.h>
  25 #include <babeltrace/babeltrace-internal.h>
  26 #include <babeltrace/format.h>
  27 #include <babeltrace/ctf/types.h>
  28 #include <babeltrace/ctf/metadata.h>
  29 #include <babeltrace/ctf-text/types.h>
  30 #include <babeltrace/prio_heap.h>
  31 #include <babeltrace/babeltrace.h>
  32 #include <babeltrace/types.h>
  33 #include <babeltrace/ctf/types.h>
  34 #include <babeltrace/ctf-ir/metadata.h>
  35
  36 /*
  37  * struct babeltrace_iter: data structure representing an iterator on a trace
  38  * collection.
  39  */
  40 struct babeltrace_iter {
  41         struct ptr_heap *stream_heap;
  42         struct trace_collection *tc;
  43 };
  44
  45 static int stream_read_event(struct ctf_file_stream *sin)
  46 {
  47         int ret;
  48
  49         ret = sin->pos.parent.event_cb(&sin->pos.parent, &sin->parent);
  50         if (ret == EOF)
  51                 return EOF;
  52         else if (ret) {
  53                 fprintf(stdout, "[error] Reading event failed.\n");
  54                 return ret;
  55         }
  56         return 0;
  57 }
  58
  59 /*
  60  * returns true if a < b, false otherwise.
  61  */
  62 int stream_compare(void *a, void *b)
  63 {
  64         struct ctf_file_stream *s_a = a, *s_b = b;
  65
  66         if (s_a->parent.timestamp < s_b->parent.timestamp)
  67                 return 1;
  68         else
  69                 return 0;
  70 }
  71
  72 struct babeltrace_iter *babeltrace_iter_create(struct trace_collection *tc)
  73 {
  74         int i, stream_id;
  75         int ret = 0;
  76         struct babeltrace_iter *iter;
  77
  78         iter = malloc(sizeof(struct babeltrace_iter));
  79         if (!iter)
  80                 goto error_malloc;
  81         iter->stream_heap = g_new(struct ptr_heap, 1);
  82         iter->tc = tc;
  83
  84         ret = heap_init(iter->stream_heap, 0, stream_compare);
  85         if (ret < 0)
  86                 goto error_heap_init;
  87
  88         for (i = 0; i < tc->array->len; i++) {
  89                 struct ctf_trace *tin;
  90                 struct trace_descriptor *td_read;
  91
  92                 td_read = g_ptr_array_index(tc->array, i);
  93                 tin = container_of(td_read, struct ctf_trace, parent);
  94
  95                 /* Populate heap with each stream */
  96                 for (stream_id = 0; stream_id < tin->streams->len;
  97                                 stream_id++) {
  98                         struct ctf_stream_class *stream;
  99                         int filenr;
 100
 101                         stream = g_ptr_array_index(tin->streams, stream_id);
 102                         if (!stream)
 103                                 continue;
 104                         for (filenr = 0; filenr < stream->streams->len;
 105                                         filenr++) {
 106                                 struct ctf_file_stream *file_stream;
 107
 108                                 file_stream = g_ptr_array_index(stream->streams,
 109                                                 filenr);
 110
 111                                 ret = stream_read_event(file_stream);
 112                                 if (ret == EOF) {
 113                                         ret = 0;
 114                                         continue;
 115                                 } else if (ret) {
 116                                         goto error;
 117                                 }
 118                                 /* Add to heap */
 119                                 ret = heap_insert(iter->stream_heap, file_stream);
 120                                 if (ret)
 121                                         goto error;
 122                         }
 123                 }
 124         }
 125
 126         return iter;
 127
 128 error:
 129         heap_free(iter->stream_heap);
 130 error_heap_init:
 131         g_free(iter->stream_heap);
 132         free(iter);
 133 error_malloc:
 134         return NULL;
 135 }
 136
 137 void babeltrace_iter_destroy(struct babeltrace_iter *iter)
 138 {
 139         heap_free(iter->stream_heap);
 140         g_free(iter->stream_heap);
 141         free(iter);
 142 }
 143
 144 int babeltrace_iter_next(struct babeltrace_iter *iter)
 145 {
 146         struct ctf_file_stream *file_stream, *removed;
 147         int ret;
 148
 149         file_stream = heap_maximum(iter->stream_heap);
 150         if (!file_stream) {
 151                 /* end of file for all streams */
 152                 ret = 0;
 153                 goto end;
 154         }
 155
 156         ret = stream_read_event(file_stream);
 157         if (ret == EOF) {
 158                 removed = heap_remove(iter->stream_heap);
 159                 assert(removed == file_stream);
 160                 ret = 0;
 161                 goto end;
 162         } else if (ret) {
 163                 goto end;
 164         }
 165         /* Reinsert the file stream into the heap, and rebalance. */
 166         removed = heap_replace_max(iter->stream_heap, file_stream);
 167         assert(removed == file_stream);
 168
 169 end:
 170         return ret;
 171 }
 172
 173 int babeltrace_iter_read_event(struct babeltrace_iter *iter,
 174                 struct ctf_stream **stream,
 175                 struct ctf_stream_event **event)
 176 {
 177         struct ctf_file_stream *file_stream;
 178         int ret = 0;
 179
 180         file_stream = heap_maximum(iter->stream_heap);
 181         if (!file_stream) {
 182                 /* end of file for all streams */
 183                 ret = EOF;
 184                 goto end;
 185         }
 186         *stream = &file_stream->parent;
 187         *event = g_ptr_array_index((*stream)->events_by_id, (*stream)->event_id);
 188 end:
 189         return ret;
 190 }
 191
 192 int convert_trace(struct trace_descriptor *td_write,
 193                   struct trace_collection *trace_collection_read)
 194 {
 195         struct babeltrace_iter *iter;
 196         struct ctf_stream *stream;
 197         struct ctf_stream_event *event;
 198         struct ctf_text_stream_pos *sout;
 199         int ret = 0;
 200
 201         sout = container_of(td_write, struct ctf_text_stream_pos,
 202                         trace_descriptor);
 203
 204         iter = babeltrace_iter_create(trace_collection_read);
 205         while (babeltrace_iter_read_event(iter, &stream, &event) == 0) {
 206                 ret = sout->parent.event_cb(&sout->parent, stream);
 207                 if (ret) {
 208                         fprintf(stdout, "[error] Writing event failed.\n");
 209                         goto end;
 210                 }
 211                 ret = babeltrace_iter_next(iter);
 212                 if (ret < 0)
 213                         goto end;
 214         }
 215 end:
 216         babeltrace_iter_destroy(iter);
 217         return ret;
 218 }