Committing clang-format changes

Author: github-actions[bot]

src/H5RT.c

@@ -293,7 +293,7 @@ H5RT_create(int rank, H5RT_leaf_t *leaves, size_t count)
     if (NULL == (rtree = H5FL_CALLOC(H5RT_t)))
         HGOTO_ERROR(H5E_RESOURCE, H5E_CANTALLOC, NULL, "failed to allocate memory for R-tree");
 
-    rtree->rank = rank;
+    rtree->rank    = rank;
     rtree->nleaves = count;
 
     /* Take ownership of leaves array */
@@ -447,9 +447,11 @@ H5RT_free(H5RT_t *rtree)
 }
 
 /* Deep copy the provided rtree */
-H5RT_t* H5RT_copy(const H5RT_t *rtree) {
-    H5RT_t *ret_value    = NULL;
-    H5RT_t *new_tree     = NULL;
+H5RT_t *
+H5RT_copy(const H5RT_t *rtree)
+{
+    H5RT_t *ret_value = NULL;
+    H5RT_t *new_tree  = NULL;
 
     H5RT_leaf_t *new_leaves = NULL;
 
@@ -465,20 +467,22 @@ H5RT_t* H5RT_copy(const H5RT_t *rtree) {
     if (NULL == (new_leaves = (H5RT_leaf_t *)malloc(rtree->nleaves * sizeof(H5RT_leaf_t))))
         HGOTO_ERROR(H5E_RESOURCE, H5E_CANTALLOC, NULL, "failed to allocate memory for R-tree leaves");
 
-    /* If the user-stored data in the r-tree is a pointer, then the new r-tree will have pointers to the same shared data */
+    /* If the user-stored data in the r-tree is a pointer, then the new r-tree will have pointers to the same
+     * shared data */
     memcpy(new_leaves, rtree->leaves, rtree->nleaves * sizeof(H5RT_leaf_t));
 
     if ((new_tree = H5RT_create(rtree->rank, new_leaves, rtree->nleaves)) == NULL)
         HGOTO_ERROR(H5E_INTERNAL, H5E_CANTINIT, NULL, "failed to create new r-tree");
 
     ret_value = new_tree;
 
-done:   
+done:
     if (!ret_value) {
         if (new_tree) {
             if (H5RT_free(new_tree) < 0)
                 HDONE_ERROR(H5E_INTERNAL, H5E_CANTFREE, NULL, "unable to free partially copied r-tree");
-        } else if (new_leaves) {
+        }
+        else if (new_leaves) {
             free(new_leaves);
         }
     }

test/rtree.c

@@ -47,16 +47,17 @@ static H5RT_leaf_t **manual_search(H5RT_leaf_t *leaves, size_t leaf_count, int r
 static size_t get_num_leaves(H5RT_leaf_t *results_arr);
 
 /* Helper function to compare r-tree search results to linear search */
-static herr_t verify_rtree_search(H5RT_leaf_t *results_head, H5RT_leaf_t *leaves, size_t leaf_count, hsize_t min[],
-                                 hsize_t max[], int rank);
+static herr_t verify_rtree_search(H5RT_leaf_t *results_head, H5RT_leaf_t *leaves, size_t leaf_count,
+                                  hsize_t min[], hsize_t max[], int rank);
 
-
-static herr_t verify_rtree_search(H5RT_leaf_t *results_head, H5RT_leaf_t *leaves, size_t leaf_count, hsize_t min[],
-                                 hsize_t max[], int rank) {
+static herr_t
+verify_rtree_search(H5RT_leaf_t *results_head, H5RT_leaf_t *leaves, size_t leaf_count, hsize_t min[],
+                    hsize_t max[], int rank)
+{
     H5RT_leaf_t **manual_results     = NULL;
     size_t        num_manual_results = 0;
-    size_t num_rtree_results = 0;
-    herr_t ret_value = SUCCEED;
+    size_t        num_rtree_results  = 0;
+    herr_t        ret_value          = SUCCEED;
 
     /* Perform manual search for comparison */
     manual_results = manual_search(leaves, leaf_count, rank, min, max, &num_manual_results);
@@ -325,11 +326,12 @@ test_rtree_search(void)
  *-------------------------------------------------------------------------
  */
 static herr_t
-test_rtree_copy(void) {
-    H5RT_t *tree = NULL;
-    H5RT_t *tree_copy = NULL;
+test_rtree_copy(void)
+{
+    H5RT_t      *tree       = NULL;
+    H5RT_t      *tree_copy  = NULL;
     size_t       leaf_count = 0;
-    H5RT_leaf_t *leaves = NULL;
+    H5RT_leaf_t *leaves     = NULL;
 
     H5RT_leaf_t *results_head = NULL;
     hsize_t      min[H5S_MAX_RANK];
@@ -355,7 +357,7 @@ test_rtree_copy(void) {
                 FAIL_STACK_ERROR;
 
             /* Ownership is transferred */
-            leaves      = NULL;
+            leaves = NULL;
 
             /* Deep copy the tree */
             if ((tree_copy = H5RT_copy(tree)) == NULL)
@@ -388,7 +390,7 @@ test_rtree_copy(void) {
 
     PASSED();
     return SUCCEED;
-    
+
 error:
     if (leaves)
         free(leaves);
@@ -425,7 +427,7 @@ main(void)
     nerrors += test_rtree_create() < 0 ? 1 : 0;
     nerrors += test_rtree_search() < 0 ? 1 : 0;
     nerrors += test_rtree_copy() < 0 ? 1 : 0;
-    
+
     if (nerrors)
         goto error;