| 1 | /* |
| 2 | * visitor.c |
| 3 | * |
| 4 | * Babeltrace CTF writer - Visitor |
| 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/ctf-writer/visitor-internal.h> |
| 30 | #include <babeltrace/ctf-writer/object.h> |
| 31 | |
| 32 | BT_HIDDEN |
| 33 | int bt_ctf_visitor_helper(struct bt_ctf_visitor_object *root, |
| 34 | bt_ctf_child_count_accessor child_counter, |
| 35 | bt_ctf_child_accessor child_accessor, |
| 36 | bt_ctf_child_visitor child_visitor, |
| 37 | bt_ctf_visitor visitor, |
| 38 | void *data) |
| 39 | { |
| 40 | int ret, child_count, i; |
| 41 | |
| 42 | ret = visitor(root, data); |
| 43 | if (ret) { |
| 44 | goto end; |
| 45 | } |
| 46 | |
| 47 | child_count = child_counter(root->object); |
| 48 | if (child_count < 0) { |
| 49 | ret = child_count; |
| 50 | goto end; |
| 51 | } |
| 52 | |
| 53 | for (i = 0; i < child_count; i++) { |
| 54 | void *child; |
| 55 | |
| 56 | child = child_accessor(root->object, i); |
| 57 | if (!child) { |
| 58 | ret = -1; |
| 59 | goto end; |
| 60 | } |
| 61 | ret = child_visitor(child, visitor, data); |
| 62 | BT_CTF_OBJECT_PUT_REF_AND_RESET(child); |
| 63 | if (ret) { |
| 64 | goto end; |
| 65 | } |
| 66 | } |
| 67 | end: |
| 68 | return ret; |
| 69 | } |
| 70 | |
| 71 | enum bt_ctf_visitor_object_type bt_ctf_visitor_object_get_type( |
| 72 | struct bt_ctf_visitor_object *object) |
| 73 | { |
| 74 | enum bt_ctf_visitor_object_type ret = BT_CTF_VISITOR_OBJECT_TYPE_UNKNOWN; |
| 75 | |
| 76 | if (!object) { |
| 77 | goto end; |
| 78 | } |
| 79 | |
| 80 | ret = object->type; |
| 81 | end: |
| 82 | return ret; |
| 83 | } |
| 84 | |
| 85 | void *bt_ctf_visitor_object_get_object(struct bt_ctf_visitor_object *object) |
| 86 | { |
| 87 | void *ret = NULL; |
| 88 | |
| 89 | if (!object) { |
| 90 | goto end; |
| 91 | } |
| 92 | |
| 93 | ret = object->object; |
| 94 | end: |
| 95 | return ret; |
| 96 | } |