| 1 | /* |
| 2 | * iterator.c |
| 3 | * |
| 4 | * Babeltrace Trace Trimmer Iterator |
| 5 | * |
| 6 | * Copyright 2016 Jérémie Galarneau <jeremie.galarneau@efficios.com> |
| 7 | * |
| 8 | * Author: Jérémie Galarneau <jeremie.galarneau@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 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 21 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 22 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 23 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 24 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| 25 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 26 | * SOFTWARE. |
| 27 | */ |
| 28 | |
| 29 | #include <babeltrace/graph/notification-iterator.h> |
| 30 | #include <babeltrace/graph/private-notification-iterator.h> |
| 31 | #include <babeltrace/graph/notification.h> |
| 32 | #include <babeltrace/graph/notification-event.h> |
| 33 | #include <babeltrace/graph/notification-stream.h> |
| 34 | #include <babeltrace/graph/notification-packet.h> |
| 35 | #include <babeltrace/graph/component-filter.h> |
| 36 | #include <babeltrace/graph/private-component-filter.h> |
| 37 | #include <babeltrace/graph/private-port.h> |
| 38 | #include <babeltrace/graph/private-connection.h> |
| 39 | #include <babeltrace/graph/private-component.h> |
| 40 | #include <babeltrace/ctf-ir/event.h> |
| 41 | #include <babeltrace/ctf-ir/stream.h> |
| 42 | #include <babeltrace/ctf-ir/stream-class.h> |
| 43 | #include <babeltrace/ctf-ir/clock-class.h> |
| 44 | #include <babeltrace/ctf-ir/packet.h> |
| 45 | #include <babeltrace/ctf-ir/trace.h> |
| 46 | #include <babeltrace/ctf-ir/fields.h> |
| 47 | #include <assert.h> |
| 48 | #include <plugins-common.h> |
| 49 | |
| 50 | #include "trimmer.h" |
| 51 | #include "iterator.h" |
| 52 | #include "copy.h" |
| 53 | |
| 54 | static |
| 55 | gboolean close_packets(gpointer key, gpointer value, gpointer user_data) |
| 56 | { |
| 57 | struct bt_ctf_packet *writer_packet = value; |
| 58 | |
| 59 | bt_put(writer_packet); |
| 60 | return TRUE; |
| 61 | } |
| 62 | |
| 63 | BT_HIDDEN |
| 64 | void trimmer_iterator_finalize(struct bt_private_notification_iterator *it) |
| 65 | { |
| 66 | struct trimmer_iterator *trim_it; |
| 67 | |
| 68 | trim_it = bt_private_notification_iterator_get_user_data(it); |
| 69 | assert(trim_it); |
| 70 | |
| 71 | bt_put(trim_it->input_iterator); |
| 72 | g_hash_table_foreach_remove(trim_it->packet_map, |
| 73 | close_packets, NULL); |
| 74 | g_hash_table_destroy(trim_it->packet_map); |
| 75 | g_free(trim_it); |
| 76 | } |
| 77 | |
| 78 | BT_HIDDEN |
| 79 | enum bt_notification_iterator_status trimmer_iterator_init( |
| 80 | struct bt_private_notification_iterator *iterator, |
| 81 | struct bt_private_port *port) |
| 82 | { |
| 83 | enum bt_notification_iterator_status ret = |
| 84 | BT_NOTIFICATION_ITERATOR_STATUS_OK; |
| 85 | enum bt_notification_iterator_status it_ret; |
| 86 | struct bt_private_port *input_port = NULL; |
| 87 | struct bt_private_connection *connection = NULL; |
| 88 | struct bt_private_component *component = |
| 89 | bt_private_notification_iterator_get_private_component(iterator); |
| 90 | struct trimmer_iterator *it_data = g_new0(struct trimmer_iterator, 1); |
| 91 | static const enum bt_notification_type notif_types[] = { |
| 92 | BT_NOTIFICATION_TYPE_EVENT, |
| 93 | BT_NOTIFICATION_TYPE_STREAM_END, |
| 94 | BT_NOTIFICATION_TYPE_PACKET_BEGIN, |
| 95 | BT_NOTIFICATION_TYPE_PACKET_END, |
| 96 | BT_NOTIFICATION_TYPE_SENTINEL, |
| 97 | }; |
| 98 | |
| 99 | if (!it_data) { |
| 100 | ret = BT_NOTIFICATION_ITERATOR_STATUS_NOMEM; |
| 101 | goto end; |
| 102 | } |
| 103 | |
| 104 | /* Create a new iterator on the upstream component. */ |
| 105 | input_port = bt_private_component_filter_get_input_private_port_by_name( |
| 106 | component, "in"); |
| 107 | assert(input_port); |
| 108 | connection = bt_private_port_get_private_connection(input_port); |
| 109 | assert(connection); |
| 110 | |
| 111 | it_data->input_iterator = |
| 112 | bt_private_connection_create_notification_iterator(connection, |
| 113 | notif_types); |
| 114 | if (!it_data->input_iterator) { |
| 115 | ret = BT_NOTIFICATION_ITERATOR_STATUS_NOMEM; |
| 116 | goto end; |
| 117 | } |
| 118 | |
| 119 | it_data->err = stderr; |
| 120 | it_data->packet_map = g_hash_table_new_full(g_direct_hash, |
| 121 | g_direct_equal, NULL, NULL); |
| 122 | |
| 123 | it_ret = bt_private_notification_iterator_set_user_data(iterator, |
| 124 | it_data); |
| 125 | if (it_ret) { |
| 126 | goto end; |
| 127 | } |
| 128 | end: |
| 129 | bt_put(component); |
| 130 | bt_put(connection); |
| 131 | bt_put(input_port); |
| 132 | return ret; |
| 133 | } |
| 134 | |
| 135 | static |
| 136 | int update_lazy_bound(struct trimmer_bound *bound, const char *name, |
| 137 | int64_t ts, bool *lazy_update) |
| 138 | { |
| 139 | struct tm tm; |
| 140 | int64_t value; |
| 141 | time_t timeval; |
| 142 | |
| 143 | *lazy_update = false; |
| 144 | |
| 145 | if (!bound->lazy) { |
| 146 | return 0; |
| 147 | } |
| 148 | tm.tm_isdst = -1; |
| 149 | timeval = ts / NSEC_PER_SEC; |
| 150 | |
| 151 | if (bound->lazy_values.gmt) { |
| 152 | /* Get day, month, year. */ |
| 153 | if (!gmtime_r(&timeval, &tm)) { |
| 154 | printf_error("Failure in gmtime_r()"); |
| 155 | goto error; |
| 156 | } |
| 157 | tm.tm_sec = bound->lazy_values.ss; |
| 158 | tm.tm_min = bound->lazy_values.mm; |
| 159 | tm.tm_hour = bound->lazy_values.hh; |
| 160 | timeval = timegm(&tm); |
| 161 | if (timeval < 0) { |
| 162 | printf_error("Failure in timegm(), incorrectly formatted %s timestamp", |
| 163 | name); |
| 164 | goto error; |
| 165 | } |
| 166 | } else { |
| 167 | /* Get day, month, year. */ |
| 168 | if (!localtime_r(&timeval, &tm)) { |
| 169 | printf_error("Failure in localtime_r()"); |
| 170 | goto error; |
| 171 | } |
| 172 | tm.tm_sec = bound->lazy_values.ss; |
| 173 | tm.tm_min = bound->lazy_values.mm; |
| 174 | tm.tm_hour = bound->lazy_values.hh; |
| 175 | timeval = mktime(&tm); |
| 176 | if (timeval < 0) { |
| 177 | printf_error("Failure in mktime(), incorrectly formatted %s timestamp", |
| 178 | name); |
| 179 | goto error; |
| 180 | } |
| 181 | } |
| 182 | value = (int64_t) timeval; |
| 183 | value *= NSEC_PER_SEC; |
| 184 | value += bound->lazy_values.ns; |
| 185 | bound->value = value; |
| 186 | bound->set = true; |
| 187 | bound->lazy = false; |
| 188 | *lazy_update = true; |
| 189 | return 0; |
| 190 | |
| 191 | error: |
| 192 | return -1; |
| 193 | } |
| 194 | |
| 195 | static |
| 196 | struct bt_notification *evaluate_event_notification( |
| 197 | struct bt_notification *notification, |
| 198 | struct trimmer_iterator *trim_it, |
| 199 | struct trimmer_bound *begin, struct trimmer_bound *end, |
| 200 | bool *_event_in_range, bool *finished) |
| 201 | { |
| 202 | int64_t ts; |
| 203 | int clock_ret; |
| 204 | struct bt_ctf_event *event = NULL, *writer_event; |
| 205 | bool in_range = true; |
| 206 | struct bt_ctf_clock_class *clock_class = NULL; |
| 207 | struct bt_ctf_trace *trace = NULL; |
| 208 | struct bt_ctf_stream *stream = NULL; |
| 209 | struct bt_ctf_stream_class *stream_class = NULL; |
| 210 | struct bt_ctf_clock_value *clock_value = NULL; |
| 211 | bool lazy_update = false; |
| 212 | struct bt_notification *new_notification = NULL; |
| 213 | struct bt_clock_class_priority_map *cc_prio_map; |
| 214 | |
| 215 | event = bt_notification_event_get_event(notification); |
| 216 | assert(event); |
| 217 | cc_prio_map = bt_notification_event_get_clock_class_priority_map( |
| 218 | notification); |
| 219 | assert(cc_prio_map); |
| 220 | writer_event = trimmer_output_event(trim_it, event); |
| 221 | assert(writer_event); |
| 222 | new_notification = bt_notification_event_create(writer_event, cc_prio_map); |
| 223 | assert(new_notification); |
| 224 | bt_put(cc_prio_map); |
| 225 | |
| 226 | stream = bt_ctf_event_get_stream(event); |
| 227 | assert(stream); |
| 228 | |
| 229 | stream_class = bt_ctf_stream_get_class(stream); |
| 230 | assert(stream_class); |
| 231 | |
| 232 | trace = bt_ctf_stream_class_get_trace(stream_class); |
| 233 | assert(trace); |
| 234 | |
| 235 | /* FIXME multi-clock? */ |
| 236 | clock_class = bt_ctf_trace_get_clock_class_by_index(trace, 0); |
| 237 | if (!clock_class) { |
| 238 | goto end; |
| 239 | } |
| 240 | |
| 241 | clock_value = bt_ctf_event_get_clock_value(event, clock_class); |
| 242 | if (!clock_value) { |
| 243 | printf_error("Failed to retrieve clock value"); |
| 244 | goto error; |
| 245 | } |
| 246 | |
| 247 | clock_ret = bt_ctf_clock_value_get_value_ns_from_epoch( |
| 248 | clock_value, &ts); |
| 249 | if (clock_ret) { |
| 250 | printf_error("Failed to retrieve clock value timestamp"); |
| 251 | goto error; |
| 252 | } |
| 253 | if (update_lazy_bound(begin, "begin", ts, &lazy_update)) { |
| 254 | goto end; |
| 255 | } |
| 256 | if (update_lazy_bound(end, "end", ts, &lazy_update)) { |
| 257 | goto end; |
| 258 | } |
| 259 | if (lazy_update && begin->set && end->set) { |
| 260 | if (begin->value > end->value) { |
| 261 | printf_error("Unexpected: time range begin value is above end value"); |
| 262 | goto error; |
| 263 | } |
| 264 | } |
| 265 | if (begin->set && ts < begin->value) { |
| 266 | in_range = false; |
| 267 | } |
| 268 | if (end->set && ts > end->value) { |
| 269 | in_range = false; |
| 270 | *finished = true; |
| 271 | } |
| 272 | |
| 273 | goto end; |
| 274 | |
| 275 | error: |
| 276 | BT_PUT(new_notification); |
| 277 | end: |
| 278 | bt_put(event); |
| 279 | bt_put(writer_event); |
| 280 | bt_put(clock_class); |
| 281 | bt_put(trace); |
| 282 | bt_put(stream); |
| 283 | bt_put(stream_class); |
| 284 | bt_put(clock_value); |
| 285 | *_event_in_range = in_range; |
| 286 | return new_notification; |
| 287 | } |
| 288 | |
| 289 | static |
| 290 | int ns_from_integer_field(struct bt_ctf_field *integer, int64_t *ns) |
| 291 | { |
| 292 | int ret = 0; |
| 293 | int is_signed; |
| 294 | uint64_t raw_clock_value; |
| 295 | struct bt_ctf_field_type *integer_type = NULL; |
| 296 | struct bt_ctf_clock_class *clock_class = NULL; |
| 297 | struct bt_ctf_clock_value *clock_value = NULL; |
| 298 | |
| 299 | integer_type = bt_ctf_field_get_type(integer); |
| 300 | assert(integer_type); |
| 301 | clock_class = bt_ctf_field_type_integer_get_mapped_clock_class( |
| 302 | integer_type); |
| 303 | if (!clock_class) { |
| 304 | ret = -1; |
| 305 | goto end; |
| 306 | } |
| 307 | |
| 308 | is_signed = bt_ctf_field_type_integer_get_signed(integer_type); |
| 309 | if (!is_signed) { |
| 310 | ret = bt_ctf_field_unsigned_integer_get_value(integer, |
| 311 | &raw_clock_value); |
| 312 | if (ret) { |
| 313 | goto end; |
| 314 | } |
| 315 | } else { |
| 316 | /* Signed clock values are unsupported. */ |
| 317 | ret = -1; |
| 318 | goto end; |
| 319 | } |
| 320 | |
| 321 | clock_value = bt_ctf_clock_value_create(clock_class, raw_clock_value); |
| 322 | if (!clock_value) { |
| 323 | goto end; |
| 324 | } |
| 325 | |
| 326 | ret = bt_ctf_clock_value_get_value_ns_from_epoch(clock_value, ns); |
| 327 | end: |
| 328 | bt_put(integer_type); |
| 329 | bt_put(clock_class); |
| 330 | bt_put(clock_value); |
| 331 | return ret; |
| 332 | } |
| 333 | |
| 334 | static uint64_t ns_from_value(uint64_t frequency, uint64_t value) |
| 335 | { |
| 336 | uint64_t ns; |
| 337 | |
| 338 | if (frequency == NSEC_PER_SEC) { |
| 339 | ns = value; |
| 340 | } else { |
| 341 | ns = (uint64_t) ((1e9 * (double) value) / (double) frequency); |
| 342 | } |
| 343 | |
| 344 | return ns; |
| 345 | } |
| 346 | |
| 347 | /* |
| 348 | * timestamp minus the offset. |
| 349 | */ |
| 350 | static |
| 351 | int64_t get_raw_timestamp(struct bt_ctf_packet *writer_packet, |
| 352 | int64_t timestamp) |
| 353 | { |
| 354 | struct bt_ctf_clock_class *writer_clock_class; |
| 355 | int64_t sec_offset, cycles_offset, ns; |
| 356 | struct bt_ctf_trace *writer_trace; |
| 357 | struct bt_ctf_stream *writer_stream; |
| 358 | struct bt_ctf_stream_class *writer_stream_class; |
| 359 | int ret; |
| 360 | uint64_t freq; |
| 361 | |
| 362 | writer_stream = bt_ctf_packet_get_stream(writer_packet); |
| 363 | assert(writer_stream); |
| 364 | |
| 365 | writer_stream_class = bt_ctf_stream_get_class(writer_stream); |
| 366 | assert(writer_stream_class); |
| 367 | |
| 368 | writer_trace = bt_ctf_stream_class_get_trace(writer_stream_class); |
| 369 | assert(writer_trace); |
| 370 | |
| 371 | /* FIXME multi-clock? */ |
| 372 | writer_clock_class = bt_ctf_trace_get_clock_class_by_index( |
| 373 | writer_trace, 0); |
| 374 | assert(writer_clock_class); |
| 375 | |
| 376 | ret = bt_ctf_clock_class_get_offset_s(writer_clock_class, &sec_offset); |
| 377 | assert(!ret); |
| 378 | ns = sec_offset * NSEC_PER_SEC; |
| 379 | |
| 380 | freq = bt_ctf_clock_class_get_frequency(writer_clock_class); |
| 381 | assert(freq != -1ULL); |
| 382 | |
| 383 | ret = bt_ctf_clock_class_get_offset_cycles(writer_clock_class, &cycles_offset); |
| 384 | assert(!ret); |
| 385 | |
| 386 | ns += ns_from_value(freq, cycles_offset); |
| 387 | |
| 388 | bt_put(writer_clock_class); |
| 389 | bt_put(writer_trace); |
| 390 | bt_put(writer_stream_class); |
| 391 | bt_put(writer_stream); |
| 392 | |
| 393 | return timestamp - ns; |
| 394 | } |
| 395 | |
| 396 | static |
| 397 | struct bt_notification *evaluate_packet_notification( |
| 398 | struct bt_notification *notification, |
| 399 | struct trimmer_iterator *trim_it, |
| 400 | struct trimmer_bound *begin, struct trimmer_bound *end, |
| 401 | bool *_packet_in_range, bool *finished) |
| 402 | { |
| 403 | int64_t begin_ns, pkt_begin_ns, end_ns, pkt_end_ns; |
| 404 | bool in_range = true; |
| 405 | struct bt_ctf_packet *packet = NULL, *writer_packet = NULL; |
| 406 | struct bt_ctf_field *packet_context = NULL, |
| 407 | *timestamp_begin = NULL, |
| 408 | *timestamp_end = NULL; |
| 409 | struct bt_notification *new_notification = NULL; |
| 410 | enum bt_component_status ret; |
| 411 | bool lazy_update = false; |
| 412 | |
| 413 | switch (bt_notification_get_type(notification)) { |
| 414 | case BT_NOTIFICATION_TYPE_PACKET_BEGIN: |
| 415 | packet = bt_notification_packet_begin_get_packet(notification); |
| 416 | assert(packet); |
| 417 | writer_packet = trimmer_new_packet(trim_it, packet); |
| 418 | assert(writer_packet); |
| 419 | break; |
| 420 | case BT_NOTIFICATION_TYPE_PACKET_END: |
| 421 | packet = bt_notification_packet_end_get_packet(notification); |
| 422 | assert(packet); |
| 423 | writer_packet = trimmer_close_packet(trim_it, packet); |
| 424 | assert(writer_packet); |
| 425 | break; |
| 426 | default: |
| 427 | goto end; |
| 428 | } |
| 429 | |
| 430 | packet_context = bt_ctf_packet_get_context(writer_packet); |
| 431 | if (!packet_context) { |
| 432 | goto end_no_notif; |
| 433 | } |
| 434 | |
| 435 | if (!bt_ctf_field_is_structure(packet_context)) { |
| 436 | goto end_no_notif; |
| 437 | } |
| 438 | |
| 439 | timestamp_begin = bt_ctf_field_structure_get_field( |
| 440 | packet_context, "timestamp_begin"); |
| 441 | if (!timestamp_begin || !bt_ctf_field_is_integer(timestamp_begin)) { |
| 442 | goto end_no_notif; |
| 443 | } |
| 444 | timestamp_end = bt_ctf_field_structure_get_field( |
| 445 | packet_context, "timestamp_end"); |
| 446 | if (!timestamp_end || !bt_ctf_field_is_integer(timestamp_end)) { |
| 447 | goto end_no_notif; |
| 448 | } |
| 449 | |
| 450 | if (ns_from_integer_field(timestamp_begin, &pkt_begin_ns)) { |
| 451 | goto end_no_notif; |
| 452 | } |
| 453 | if (ns_from_integer_field(timestamp_end, &pkt_end_ns)) { |
| 454 | goto end_no_notif; |
| 455 | } |
| 456 | |
| 457 | if (update_lazy_bound(begin, "begin", pkt_begin_ns, &lazy_update)) { |
| 458 | goto end_no_notif; |
| 459 | } |
| 460 | if (update_lazy_bound(end, "end", pkt_end_ns, &lazy_update)) { |
| 461 | goto end_no_notif; |
| 462 | } |
| 463 | if (lazy_update && begin->set && end->set) { |
| 464 | if (begin->value > end->value) { |
| 465 | printf_error("Unexpected: time range begin value is above end value"); |
| 466 | goto end_no_notif; |
| 467 | } |
| 468 | } |
| 469 | |
| 470 | begin_ns = begin->set ? begin->value : INT64_MIN; |
| 471 | end_ns = end->set ? end->value : INT64_MAX; |
| 472 | |
| 473 | /* |
| 474 | * Accept if there is any overlap between the selected region and the |
| 475 | * packet. |
| 476 | */ |
| 477 | in_range = (pkt_end_ns >= begin_ns) && (pkt_begin_ns <= end_ns); |
| 478 | if (!in_range) { |
| 479 | goto end_no_notif; |
| 480 | } |
| 481 | if (pkt_begin_ns > end_ns) { |
| 482 | *finished = true; |
| 483 | } |
| 484 | |
| 485 | if (begin_ns > pkt_begin_ns) { |
| 486 | ret = update_packet_context_field(trim_it->err, writer_packet, |
| 487 | "timestamp_begin", |
| 488 | get_raw_timestamp(writer_packet, begin_ns)); |
| 489 | assert(!ret); |
| 490 | } |
| 491 | |
| 492 | if (end_ns < pkt_end_ns) { |
| 493 | ret = update_packet_context_field(trim_it->err, writer_packet, |
| 494 | "timestamp_end", |
| 495 | get_raw_timestamp(writer_packet, end_ns)); |
| 496 | assert(!ret); |
| 497 | } |
| 498 | |
| 499 | end: |
| 500 | switch (bt_notification_get_type(notification)) { |
| 501 | case BT_NOTIFICATION_TYPE_PACKET_BEGIN: |
| 502 | new_notification = bt_notification_packet_begin_create(writer_packet); |
| 503 | assert(new_notification); |
| 504 | break; |
| 505 | case BT_NOTIFICATION_TYPE_PACKET_END: |
| 506 | new_notification = bt_notification_packet_end_create(writer_packet); |
| 507 | assert(new_notification); |
| 508 | break; |
| 509 | default: |
| 510 | break; |
| 511 | } |
| 512 | end_no_notif: |
| 513 | *_packet_in_range = in_range; |
| 514 | bt_put(packet); |
| 515 | bt_put(writer_packet); |
| 516 | bt_put(packet_context); |
| 517 | bt_put(timestamp_begin); |
| 518 | bt_put(timestamp_end); |
| 519 | return new_notification; |
| 520 | } |
| 521 | |
| 522 | static |
| 523 | struct bt_notification *evaluate_stream_notification( |
| 524 | struct bt_notification *notification, |
| 525 | struct trimmer_iterator *trim_it) |
| 526 | { |
| 527 | struct bt_ctf_stream *stream; |
| 528 | |
| 529 | stream = bt_notification_stream_end_get_stream(notification); |
| 530 | assert(stream); |
| 531 | |
| 532 | /* FIXME: useless copy */ |
| 533 | return bt_notification_stream_end_create(stream); |
| 534 | } |
| 535 | |
| 536 | /* Return true if the notification should be forwarded. */ |
| 537 | static |
| 538 | enum bt_notification_iterator_status evaluate_notification( |
| 539 | struct bt_notification **notification, |
| 540 | struct trimmer_iterator *trim_it, |
| 541 | struct trimmer_bound *begin, struct trimmer_bound *end, |
| 542 | bool *in_range) |
| 543 | { |
| 544 | enum bt_notification_type type; |
| 545 | struct bt_notification *new_notification = NULL; |
| 546 | bool finished = false; |
| 547 | |
| 548 | *in_range = true; |
| 549 | type = bt_notification_get_type(*notification); |
| 550 | switch (type) { |
| 551 | case BT_NOTIFICATION_TYPE_EVENT: |
| 552 | new_notification = evaluate_event_notification(*notification, |
| 553 | trim_it, begin, end, in_range, &finished); |
| 554 | break; |
| 555 | case BT_NOTIFICATION_TYPE_PACKET_BEGIN: |
| 556 | case BT_NOTIFICATION_TYPE_PACKET_END: |
| 557 | new_notification = evaluate_packet_notification(*notification, |
| 558 | trim_it, begin, end, in_range, &finished); |
| 559 | break; |
| 560 | case BT_NOTIFICATION_TYPE_STREAM_END: |
| 561 | new_notification = evaluate_stream_notification(*notification, |
| 562 | trim_it); |
| 563 | break; |
| 564 | default: |
| 565 | puts("Unhandled notification type"); |
| 566 | break; |
| 567 | } |
| 568 | BT_PUT(*notification); |
| 569 | *notification = new_notification; |
| 570 | |
| 571 | if (finished) { |
| 572 | return BT_NOTIFICATION_ITERATOR_STATUS_END; |
| 573 | } |
| 574 | |
| 575 | return BT_NOTIFICATION_ITERATOR_STATUS_OK; |
| 576 | } |
| 577 | |
| 578 | BT_HIDDEN |
| 579 | struct bt_notification_iterator_next_return trimmer_iterator_next( |
| 580 | struct bt_private_notification_iterator *iterator) |
| 581 | { |
| 582 | struct trimmer_iterator *trim_it = NULL; |
| 583 | struct bt_private_component *component = NULL; |
| 584 | struct trimmer *trimmer = NULL; |
| 585 | struct bt_notification_iterator *source_it = NULL; |
| 586 | struct bt_notification_iterator_next_return ret = { |
| 587 | .status = BT_NOTIFICATION_ITERATOR_STATUS_OK, |
| 588 | .notification = NULL, |
| 589 | }; |
| 590 | bool notification_in_range = false; |
| 591 | |
| 592 | trim_it = bt_private_notification_iterator_get_user_data(iterator); |
| 593 | assert(trim_it); |
| 594 | |
| 595 | component = bt_private_notification_iterator_get_private_component( |
| 596 | iterator); |
| 597 | assert(component); |
| 598 | trimmer = bt_private_component_get_user_data(component); |
| 599 | assert(trimmer); |
| 600 | |
| 601 | source_it = trim_it->input_iterator; |
| 602 | assert(source_it); |
| 603 | |
| 604 | while (!notification_in_range) { |
| 605 | ret.status = bt_notification_iterator_next(source_it); |
| 606 | if (ret.status != BT_NOTIFICATION_ITERATOR_STATUS_OK) { |
| 607 | goto end; |
| 608 | } |
| 609 | |
| 610 | ret.notification = bt_notification_iterator_get_notification( |
| 611 | source_it); |
| 612 | if (!ret.notification) { |
| 613 | ret.status = BT_NOTIFICATION_ITERATOR_STATUS_ERROR; |
| 614 | goto end; |
| 615 | } |
| 616 | |
| 617 | ret.status = evaluate_notification(&ret.notification, trim_it, |
| 618 | &trimmer->begin, &trimmer->end, |
| 619 | ¬ification_in_range); |
| 620 | if (!notification_in_range) { |
| 621 | BT_PUT(ret.notification); |
| 622 | } |
| 623 | |
| 624 | if (ret.status != BT_NOTIFICATION_ITERATOR_STATUS_OK) { |
| 625 | break; |
| 626 | } |
| 627 | } |
| 628 | end: |
| 629 | bt_put(component); |
| 630 | return ret; |
| 631 | } |
| 632 | |
| 633 | BT_HIDDEN |
| 634 | enum bt_notification_iterator_status trimmer_iterator_seek_time( |
| 635 | struct bt_private_notification_iterator *iterator, |
| 636 | int64_t time) |
| 637 | { |
| 638 | return BT_NOTIFICATION_ITERATOR_STATUS_OK; |
| 639 | } |