Fix indentation in contrib/amcheck/verify_nbtree.c
authorAlexander Korotkov <[email protected]>
Mon, 30 Oct 2023 08:34:15 +0000 (10:34 +0200)
committerAlexander Korotkov <[email protected]>
Mon, 30 Oct 2023 08:35:03 +0000 (10:35 +0200)
Reported-by: Michael Paquier
Discussion: https://postgr.es/m/ZT9YoDPEQBUMrIHg%40paquier.xyz

contrib/amcheck/verify_nbtree.c

index 7282cf7fc8050807fdaf51a5e31ee1b9ba2f4090..877452f38c67aa29642831a3a6d865c13036ed5e 100644 (file)
@@ -1056,9 +1056,9 @@ bt_entry_unique_check(BtreeCheckState *state, IndexTuple itup,
                                }
 
                                /*
-                                * Prevent double reporting unique constraint violation between
-                                * the posting list entries of the first tuple on the page after
-                                * cross-page check.
+                                * Prevent double reporting unique constraint violation
+                                * between the posting list entries of the first tuple on the
+                                * page after cross-page check.
                                 */
                                if (*lVis_block != targetblock && ItemPointerIsValid(*lVis_tid))
                                        return;
@@ -1072,8 +1072,8 @@ bt_entry_unique_check(BtreeCheckState *state, IndexTuple itup,
        }
 
        /*
-        * Current tuple has no posting list. If TID is visible save info about
-        * it for the next comparisons in the loop in bt_page_check(). Report
+        * Current tuple has no posting list. If TID is visible save info about it
+        * for the next comparisons in the loop in bt_page_check(). Report
         * duplicate if lVis_tid is already valid.
         */
        else
@@ -1694,8 +1694,8 @@ bt_target_page_check(BtreeCheckState *state)
                }
 
                /*
-                * If the index is unique verify entries uniqueness by checking the heap
-                * tuples visibility.
+                * If the index is unique verify entries uniqueness by checking the
+                * heap tuples visibility.
                 */
                if (state->checkunique && state->indexinfo->ii_Unique &&
                        P_ISLEAF(topaque) && !skey->anynullkeys)