X-Git-Url: http://git.efficios.com/?a=blobdiff_plain;f=src%2Fplugins%2Fctf%2Fcommon%2Fmetadata%2Fvisitor-parent-links.cpp;h=724ada65f2d8b55de8b813fc763faf6ea4799d87;hb=4164020e790fa6c0700715936b40a3fa46df479e;hp=f34df9f58b0b756e350dbbe3475b3e8fe0305432;hpb=087cd0f57f0f7d815a609a4e041d1200f380e4aa;p=babeltrace.git

diff --git a/src/plugins/ctf/common/metadata/visitor-parent-links.cpp b/src/plugins/ctf/common/metadata/visitor-parent-links.cpp
index f34df9f5..724ada65 100644
--- a/src/plugins/ctf/common/metadata/visitor-parent-links.cpp
+++ b/src/plugins/ctf/common/metadata/visitor-parent-links.cpp
@@ -7,8 +7,8 @@
  */
 
 #define BT_COMP_LOG_SELF_COMP (log_cfg->self_comp)
-#define BT_LOG_OUTPUT_LEVEL (log_cfg->log_level)
-#define BT_LOG_TAG "PLUGIN/CTF/META/PARENT-LINKS-VISITOR"
+#define BT_LOG_OUTPUT_LEVEL   (log_cfg->log_level)
+#define BT_LOG_TAG            "PLUGIN/CTF/META/PARENT-LINKS-VISITOR"
 #include "logging/comp-logging.h"
 
 #include <stdio.h>
@@ -25,474 +25,425 @@
 #include "ast.hpp"
 #include "logging.hpp"
 
-static
-int ctf_visitor_unary_expression(int depth, struct ctf_node *node,
-		struct meta_log_config *log_cfg)
+static int ctf_visitor_unary_expression(int depth, struct ctf_node *node,
+                                        struct meta_log_config *log_cfg)
 {
-	int ret = 0;
+    int ret = 0;
 
-	switch (node->u.unary_expression.link) {
-	case UNARY_LINK_UNKNOWN:
-	case UNARY_DOTLINK:
-	case UNARY_ARROWLINK:
-	case UNARY_DOTDOTDOT:
-		break;
-	default:
-		_BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno,
-			"Unknown expression link type: type=%d\n",
-			node->u.unary_expression.link);
-		return -EINVAL;
-	}
+    switch (node->u.unary_expression.link) {
+    case UNARY_LINK_UNKNOWN:
+    case UNARY_DOTLINK:
+    case UNARY_ARROWLINK:
+    case UNARY_DOTDOTDOT:
+        break;
+    default:
+        _BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno, "Unknown expression link type: type=%d\n",
+                                          node->u.unary_expression.link);
+        return -EINVAL;
+    }
 
-	switch (node->u.unary_expression.type) {
-	case UNARY_STRING:
-	case UNARY_SIGNED_CONSTANT:
-	case UNARY_UNSIGNED_CONSTANT:
-		break;
-	case UNARY_SBRAC:
-		node->u.unary_expression.u.sbrac_exp->parent = node;
-		ret = ctf_visitor_unary_expression(depth + 1,
-			node->u.unary_expression.u.sbrac_exp,
-			log_cfg);
-		if (ret)
-			return ret;
-		break;
+    switch (node->u.unary_expression.type) {
+    case UNARY_STRING:
+    case UNARY_SIGNED_CONSTANT:
+    case UNARY_UNSIGNED_CONSTANT:
+        break;
+    case UNARY_SBRAC:
+        node->u.unary_expression.u.sbrac_exp->parent = node;
+        ret =
+            ctf_visitor_unary_expression(depth + 1, node->u.unary_expression.u.sbrac_exp, log_cfg);
+        if (ret)
+            return ret;
+        break;
 
-	case UNARY_UNKNOWN:
-	default:
-		_BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno,
-			"Unknown expression link type: type=%d\n",
-			node->u.unary_expression.link);
-		return -EINVAL;
-	}
-	return 0;
+    case UNARY_UNKNOWN:
+    default:
+        _BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno, "Unknown expression link type: type=%d\n",
+                                          node->u.unary_expression.link);
+        return -EINVAL;
+    }
+    return 0;
 }
 
-static
-int ctf_visitor_type_specifier(int depth, struct ctf_node *node,
-		struct meta_log_config *log_cfg)
+static int ctf_visitor_type_specifier(int depth, struct ctf_node *node,
+                                      struct meta_log_config *log_cfg)
 {
-	int ret;
+    int ret;
 
-	switch (node->u.field_class_specifier.type) {
-	case TYPESPEC_VOID:
-	case TYPESPEC_CHAR:
-	case TYPESPEC_SHORT:
-	case TYPESPEC_INT:
-	case TYPESPEC_LONG:
-	case TYPESPEC_FLOAT:
-	case TYPESPEC_DOUBLE:
-	case TYPESPEC_SIGNED:
-	case TYPESPEC_UNSIGNED:
-	case TYPESPEC_BOOL:
-	case TYPESPEC_COMPLEX:
-	case TYPESPEC_IMAGINARY:
-	case TYPESPEC_CONST:
-	case TYPESPEC_ID_TYPE:
-		break;
-	case TYPESPEC_FLOATING_POINT:
-	case TYPESPEC_INTEGER:
-	case TYPESPEC_STRING:
-	case TYPESPEC_STRUCT:
-	case TYPESPEC_VARIANT:
-	case TYPESPEC_ENUM:
-		node->u.field_class_specifier.node->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_specifier.node,
-			log_cfg);
-		if (ret)
-			return ret;
-		break;
+    switch (node->u.field_class_specifier.type) {
+    case TYPESPEC_VOID:
+    case TYPESPEC_CHAR:
+    case TYPESPEC_SHORT:
+    case TYPESPEC_INT:
+    case TYPESPEC_LONG:
+    case TYPESPEC_FLOAT:
+    case TYPESPEC_DOUBLE:
+    case TYPESPEC_SIGNED:
+    case TYPESPEC_UNSIGNED:
+    case TYPESPEC_BOOL:
+    case TYPESPEC_COMPLEX:
+    case TYPESPEC_IMAGINARY:
+    case TYPESPEC_CONST:
+    case TYPESPEC_ID_TYPE:
+        break;
+    case TYPESPEC_FLOATING_POINT:
+    case TYPESPEC_INTEGER:
+    case TYPESPEC_STRING:
+    case TYPESPEC_STRUCT:
+    case TYPESPEC_VARIANT:
+    case TYPESPEC_ENUM:
+        node->u.field_class_specifier.node->parent = node;
+        ret = ctf_visitor_parent_links(depth + 1, node->u.field_class_specifier.node, log_cfg);
+        if (ret)
+            return ret;
+        break;
 
-	case TYPESPEC_UNKNOWN:
-	default:
-		_BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno,
-			"Unknown type specifier: type=%d\n",
-			node->u.field_class_specifier.type);
-		return -EINVAL;
-	}
-	return 0;
+    case TYPESPEC_UNKNOWN:
+    default:
+        _BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno, "Unknown type specifier: type=%d\n",
+                                          node->u.field_class_specifier.type);
+        return -EINVAL;
+    }
+    return 0;
 }
 
-static
-int ctf_visitor_field_class_declarator(int depth, struct ctf_node *node,
-		struct meta_log_config *log_cfg)
+static int ctf_visitor_field_class_declarator(int depth, struct ctf_node *node,
+                                              struct meta_log_config *log_cfg)
 {
-	int ret = 0;
-	struct ctf_node *iter;
+    int ret = 0;
+    struct ctf_node *iter;
 
-	depth++;
+    depth++;
 
-	bt_list_for_each_entry(iter, &node->u.field_class_declarator.pointers,
-				siblings) {
-		iter->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
-		if (ret)
-			return ret;
-	}
+    bt_list_for_each_entry (iter, &node->u.field_class_declarator.pointers, siblings) {
+        iter->parent = node;
+        ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+        if (ret)
+            return ret;
+    }
 
-	switch (node->u.field_class_declarator.type) {
-	case TYPEDEC_ID:
-		break;
-	case TYPEDEC_NESTED:
-		if (node->u.field_class_declarator.u.nested.field_class_declarator) {
-			node->u.field_class_declarator.u.nested.field_class_declarator->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1,
-				node->u.field_class_declarator.u.nested.field_class_declarator,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		if (!node->u.field_class_declarator.u.nested.abstract_array) {
-			bt_list_for_each_entry(iter, &node->u.field_class_declarator.u.nested.length,
-						siblings) {
-				iter->parent = node;
-				ret = ctf_visitor_parent_links(depth + 1, iter,
-					log_cfg);
-				if (ret)
-					return ret;
-			}
-		}
-		if (node->u.field_class_declarator.bitfield_len) {
-			node->u.field_class_declarator.bitfield_len = node;
-			ret = ctf_visitor_parent_links(depth + 1,
-				node->u.field_class_declarator.bitfield_len,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case TYPEDEC_UNKNOWN:
-	default:
-		_BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno,
-			"Unknown type declarator: type=%d\n",
-			node->u.field_class_declarator.type);
-		return -EINVAL;
-	}
-	depth--;
-	return 0;
+    switch (node->u.field_class_declarator.type) {
+    case TYPEDEC_ID:
+        break;
+    case TYPEDEC_NESTED:
+        if (node->u.field_class_declarator.u.nested.field_class_declarator) {
+            node->u.field_class_declarator.u.nested.field_class_declarator->parent = node;
+            ret = ctf_visitor_parent_links(
+                depth + 1, node->u.field_class_declarator.u.nested.field_class_declarator, log_cfg);
+            if (ret)
+                return ret;
+        }
+        if (!node->u.field_class_declarator.u.nested.abstract_array) {
+            bt_list_for_each_entry (iter, &node->u.field_class_declarator.u.nested.length,
+                                    siblings) {
+                iter->parent = node;
+                ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+                if (ret)
+                    return ret;
+            }
+        }
+        if (node->u.field_class_declarator.bitfield_len) {
+            node->u.field_class_declarator.bitfield_len = node;
+            ret = ctf_visitor_parent_links(depth + 1, node->u.field_class_declarator.bitfield_len,
+                                           log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case TYPEDEC_UNKNOWN:
+    default:
+        _BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno, "Unknown type declarator: type=%d\n",
+                                          node->u.field_class_declarator.type);
+        return -EINVAL;
+    }
+    depth--;
+    return 0;
 }
 
-int ctf_visitor_parent_links(int depth, struct ctf_node *node,
-		struct meta_log_config *log_cfg)
+int ctf_visitor_parent_links(int depth, struct ctf_node *node, struct meta_log_config *log_cfg)
 {
-	int ret = 0;
-	struct ctf_node *iter;
+    int ret = 0;
+    struct ctf_node *iter;
 
-	if (node->visited)
-		return 0;
+    if (node->visited)
+        return 0;
 
-	switch (node->type) {
-	case NODE_ROOT:
-		bt_list_for_each_entry(iter, &node->u.root.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.root.trace, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.root.stream, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.root.event, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.root.clock, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.root.callsite, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
+    switch (node->type) {
+    case NODE_ROOT:
+        bt_list_for_each_entry (iter, &node->u.root.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.root.trace, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.root.stream, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.root.event, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.root.clock, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.root.callsite, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
 
-	case NODE_EVENT:
-		bt_list_for_each_entry(iter, &node->u.event.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_STREAM:
-		bt_list_for_each_entry(iter, &node->u.stream.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_ENV:
-		bt_list_for_each_entry(iter, &node->u.env.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_TRACE:
-		bt_list_for_each_entry(iter, &node->u.trace.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_CLOCK:
-		bt_list_for_each_entry(iter, &node->u.clock.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_CALLSITE:
-		bt_list_for_each_entry(iter, &node->u.callsite.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
+    case NODE_EVENT:
+        bt_list_for_each_entry (iter, &node->u.event.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_STREAM:
+        bt_list_for_each_entry (iter, &node->u.stream.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_ENV:
+        bt_list_for_each_entry (iter, &node->u.env.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_TRACE:
+        bt_list_for_each_entry (iter, &node->u.trace.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_CLOCK:
+        bt_list_for_each_entry (iter, &node->u.clock.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_CALLSITE:
+        bt_list_for_each_entry (iter, &node->u.callsite.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
 
-	case NODE_CTF_EXPRESSION:
-		depth++;
-		bt_list_for_each_entry(iter, &node->u.ctf_expression.left, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u.ctf_expression.right, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		depth--;
-		break;
-	case NODE_UNARY_EXPRESSION:
-		return ctf_visitor_unary_expression(depth, node, log_cfg);
+    case NODE_CTF_EXPRESSION:
+        depth++;
+        bt_list_for_each_entry (iter, &node->u.ctf_expression.left, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u.ctf_expression.right, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        depth--;
+        break;
+    case NODE_UNARY_EXPRESSION:
+        return ctf_visitor_unary_expression(depth, node, log_cfg);
 
-	case NODE_TYPEDEF:
-		depth++;
-		node->u.field_class_def.field_class_specifier_list->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_def.field_class_specifier_list,
-			log_cfg);
-		if (ret)
-			return ret;
-		bt_list_for_each_entry(iter, &node->u.field_class_def.field_class_declarators, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		depth--;
-		break;
-	case NODE_TYPEALIAS_TARGET:
-		depth++;
-		node->u.field_class_alias_target.field_class_specifier_list->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_alias_target.field_class_specifier_list,
-			log_cfg);
-		if (ret)
-			return ret;
-		bt_list_for_each_entry(iter, &node->u.field_class_alias_target.field_class_declarators, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		depth--;
-		break;
-	case NODE_TYPEALIAS_ALIAS:
-		depth++;
-		node->u.field_class_alias_name.field_class_specifier_list->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_alias_name.field_class_specifier_list,
-			log_cfg);
-		if (ret)
-			return ret;
-		bt_list_for_each_entry(iter, &node->u.field_class_alias_name.field_class_declarators, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		depth--;
-		break;
-	case NODE_TYPEALIAS:
-		node->u.field_class_alias.target->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_alias.target, log_cfg);
-		if (ret)
-			return ret;
-		node->u.field_class_alias.alias->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.field_class_alias.alias, log_cfg);
-		if (ret)
-			return ret;
-		break;
+    case NODE_TYPEDEF:
+        depth++;
+        node->u.field_class_def.field_class_specifier_list->parent = node;
+        ret = ctf_visitor_parent_links(depth + 1,
+                                       node->u.field_class_def.field_class_specifier_list, log_cfg);
+        if (ret)
+            return ret;
+        bt_list_for_each_entry (iter, &node->u.field_class_def.field_class_declarators, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        depth--;
+        break;
+    case NODE_TYPEALIAS_TARGET:
+        depth++;
+        node->u.field_class_alias_target.field_class_specifier_list->parent = node;
+        ret = ctf_visitor_parent_links(
+            depth + 1, node->u.field_class_alias_target.field_class_specifier_list, log_cfg);
+        if (ret)
+            return ret;
+        bt_list_for_each_entry (iter, &node->u.field_class_alias_target.field_class_declarators,
+                                siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        depth--;
+        break;
+    case NODE_TYPEALIAS_ALIAS:
+        depth++;
+        node->u.field_class_alias_name.field_class_specifier_list->parent = node;
+        ret = ctf_visitor_parent_links(
+            depth + 1, node->u.field_class_alias_name.field_class_specifier_list, log_cfg);
+        if (ret)
+            return ret;
+        bt_list_for_each_entry (iter, &node->u.field_class_alias_name.field_class_declarators,
+                                siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        depth--;
+        break;
+    case NODE_TYPEALIAS:
+        node->u.field_class_alias.target->parent = node;
+        ret = ctf_visitor_parent_links(depth + 1, node->u.field_class_alias.target, log_cfg);
+        if (ret)
+            return ret;
+        node->u.field_class_alias.alias->parent = node;
+        ret = ctf_visitor_parent_links(depth + 1, node->u.field_class_alias.alias, log_cfg);
+        if (ret)
+            return ret;
+        break;
 
-	case NODE_TYPE_SPECIFIER_LIST:
-		bt_list_for_each_entry(iter, &node->u.field_class_specifier_list.head, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
+    case NODE_TYPE_SPECIFIER_LIST:
+        bt_list_for_each_entry (iter, &node->u.field_class_specifier_list.head, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
 
-	case NODE_TYPE_SPECIFIER:
-		ret = ctf_visitor_type_specifier(depth, node, log_cfg);
-		if (ret)
-			return ret;
-		break;
-	case NODE_POINTER:
-		break;
-	case NODE_TYPE_DECLARATOR:
-		ret = ctf_visitor_field_class_declarator(depth, node,
-			log_cfg);
-		if (ret)
-			return ret;
-		break;
+    case NODE_TYPE_SPECIFIER:
+        ret = ctf_visitor_type_specifier(depth, node, log_cfg);
+        if (ret)
+            return ret;
+        break;
+    case NODE_POINTER:
+        break;
+    case NODE_TYPE_DECLARATOR:
+        ret = ctf_visitor_field_class_declarator(depth, node, log_cfg);
+        if (ret)
+            return ret;
+        break;
 
-	case NODE_FLOATING_POINT:
-		bt_list_for_each_entry(iter, &node->u.floating_point.expressions, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_INTEGER:
-		bt_list_for_each_entry(iter, &node->u.integer.expressions, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_STRING:
-		bt_list_for_each_entry(iter, &node->u.string.expressions, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_ENUMERATOR:
-		bt_list_for_each_entry(iter, &node->u.enumerator.values, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_ENUM:
-		depth++;
-		if (node->u._enum.container_field_class) {
-			ret = ctf_visitor_parent_links(depth + 1,
-				node->u._enum.container_field_class, log_cfg);
-			if (ret)
-				return ret;
-		}
+    case NODE_FLOATING_POINT:
+        bt_list_for_each_entry (iter, &node->u.floating_point.expressions, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_INTEGER:
+        bt_list_for_each_entry (iter, &node->u.integer.expressions, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_STRING:
+        bt_list_for_each_entry (iter, &node->u.string.expressions, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_ENUMERATOR:
+        bt_list_for_each_entry (iter, &node->u.enumerator.values, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_ENUM:
+        depth++;
+        if (node->u._enum.container_field_class) {
+            ret = ctf_visitor_parent_links(depth + 1, node->u._enum.container_field_class, log_cfg);
+            if (ret)
+                return ret;
+        }
 
-		bt_list_for_each_entry(iter, &node->u._enum.enumerator_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		depth--;
-		break;
-	case NODE_STRUCT_OR_VARIANT_DECLARATION:
-		node->u.struct_or_variant_declaration.field_class_specifier_list->parent = node;
-		ret = ctf_visitor_parent_links(depth + 1,
-			node->u.struct_or_variant_declaration.field_class_specifier_list,
-			log_cfg);
-		if (ret)
-			return ret;
-		bt_list_for_each_entry(iter, &node->u.struct_or_variant_declaration.field_class_declarators, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_VARIANT:
-		bt_list_for_each_entry(iter, &node->u.variant.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
-	case NODE_STRUCT:
-		bt_list_for_each_entry(iter, &node->u._struct.declaration_list, siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		bt_list_for_each_entry(iter, &node->u._struct.min_align,
-					siblings) {
-			iter->parent = node;
-			ret = ctf_visitor_parent_links(depth + 1, iter,
-				log_cfg);
-			if (ret)
-				return ret;
-		}
-		break;
+        bt_list_for_each_entry (iter, &node->u._enum.enumerator_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        depth--;
+        break;
+    case NODE_STRUCT_OR_VARIANT_DECLARATION:
+        node->u.struct_or_variant_declaration.field_class_specifier_list->parent = node;
+        ret = ctf_visitor_parent_links(
+            depth + 1, node->u.struct_or_variant_declaration.field_class_specifier_list, log_cfg);
+        if (ret)
+            return ret;
+        bt_list_for_each_entry (
+            iter, &node->u.struct_or_variant_declaration.field_class_declarators, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_VARIANT:
+        bt_list_for_each_entry (iter, &node->u.variant.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
+    case NODE_STRUCT:
+        bt_list_for_each_entry (iter, &node->u._struct.declaration_list, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        bt_list_for_each_entry (iter, &node->u._struct.min_align, siblings) {
+            iter->parent = node;
+            ret = ctf_visitor_parent_links(depth + 1, iter, log_cfg);
+            if (ret)
+                return ret;
+        }
+        break;
 
-	case NODE_UNKNOWN:
-	default:
-		_BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno,
-			"Unknown node type: type=%d\n", node->type);
-		return -EINVAL;
-	}
-	return ret;
+    case NODE_UNKNOWN:
+    default:
+        _BT_COMP_LOGE_APPEND_CAUSE_LINENO(node->lineno, "Unknown node type: type=%d\n", node->type);
+        return -EINVAL;
+    }
+    return ret;
 }