projects
/
babeltrace.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
ctf.fs: bt_ctf_notif_iter_create(): assert() that all medops exist
[babeltrace.git]
/
formats
/
ctf
/
metadata
/
ctf-visitor-parent-links.c
diff --git
a/formats/ctf/metadata/ctf-visitor-parent-links.c
b/formats/ctf/metadata/ctf-visitor-parent-links.c
index 953727e84c3eccc809328f7f7ca6f82e8c7e0cc7..037496afba04837b30852dd616cfa496af1aad7c 100644
(file)
--- a/
formats/ctf/metadata/ctf-visitor-parent-links.c
+++ b/
formats/ctf/metadata/ctf-visitor-parent-links.c
@@
-69,13
+69,6
@@
int ctf_visitor_unary_expression(FILE *fd, int depth, struct ctf_node *node)
if (ret)
return ret;
break;
if (ret)
return ret;
break;
- case UNARY_NESTED:
- node->u.unary_expression.u.nested_exp->parent = node;
- ret = ctf_visitor_unary_expression(fd, depth + 1,
- node->u.unary_expression.u.nested_exp);
- if (ret)
- return ret;
- break;
case UNARY_UNKNOWN:
default:
case UNARY_UNKNOWN:
default:
@@
-187,6
+180,9
@@
int ctf_visitor_parent_links(FILE *fd, int depth, struct ctf_node *node)
int ret = 0;
struct ctf_node *iter;
int ret = 0;
struct ctf_node *iter;
+ if (node->visited)
+ return 0;
+
switch (node->type) {
case NODE_ROOT:
bt_list_for_each_entry(iter, &node->u.root.declaration_list, siblings) {
switch (node->type) {
case NODE_ROOT:
bt_list_for_each_entry(iter, &node->u.root.declaration_list, siblings) {
This page took
0.023606 seconds
and
4
git commands to generate.