Phase 2 pgindent run for v12.

Switch to 2.1 version of pg_bsd_indent.  This formats
multiline function declarations "correctly", that is with
additional lines of parameter declarations indented to match
where the first line's left parenthesis is.

Discussion: https://postgr.es/m/CAEepm=0P3FeTXRcU5B2W3jv3PgRVZ-kGUXLGfd42FFhUROO3ug@mail.gmail.com

src/include/lib/binaryheap.h

@@ -38,8 +38,8 @@ typedef struct binaryheap
 } binaryheap;
 
 extern binaryheap *binaryheap_allocate(int capacity,
-					binaryheap_comparator compare,
-					void *arg);
+									   binaryheap_comparator compare,
+									   void *arg);
 extern void binaryheap_reset(binaryheap *heap);
 extern void binaryheap_free(binaryheap *heap);
 extern void binaryheap_add_unordered(binaryheap *heap, Datum d);

src/include/lib/bloomfilter.h

@@ -16,12 +16,12 @@
 typedef struct bloom_filter bloom_filter;
 
 extern bloom_filter *bloom_create(int64 total_elems, int bloom_work_mem,
-			 uint64 seed);
+								  uint64 seed);
 extern void bloom_free(bloom_filter *filter);
 extern void bloom_add_element(bloom_filter *filter, unsigned char *elem,
-				  size_t len);
+							  size_t len);
 extern bool bloom_lacks_element(bloom_filter *filter, unsigned char *elem,
-					size_t len);
+								size_t len);
 extern double bloom_prop_bits_set(bloom_filter *filter);
 
 #endif							/* BLOOMFILTER_H */

src/include/lib/dshash.h

@@ -61,21 +61,21 @@ typedef struct dshash_table_item dshash_table_item;
 
 /* Creating, sharing and destroying from hash tables. */
 extern dshash_table *dshash_create(dsa_area *area,
-			  const dshash_parameters *params,
-			  void *arg);
+								   const dshash_parameters *params,
+								   void *arg);
 extern dshash_table *dshash_attach(dsa_area *area,
-			  const dshash_parameters *params,
-			  dshash_table_handle handle,
-			  void *arg);
+								   const dshash_parameters *params,
+								   dshash_table_handle handle,
+								   void *arg);
 extern void dshash_detach(dshash_table *hash_table);
 extern dshash_table_handle dshash_get_hash_table_handle(dshash_table *hash_table);
 extern void dshash_destroy(dshash_table *hash_table);
 
 /* Finding, creating, deleting entries. */
 extern void *dshash_find(dshash_table *hash_table,
-			const void *key, bool exclusive);
+						 const void *key, bool exclusive);
 extern void *dshash_find_or_insert(dshash_table *hash_table,
-					  const void *key, bool *found);
+								   const void *key, bool *found);
 extern bool dshash_delete_key(dshash_table *hash_table, const void *key);
 extern void dshash_delete_entry(dshash_table *hash_table, void *entry);
 extern void dshash_release_lock(dshash_table *hash_table, void *entry);

src/include/lib/knapsack.h

@@ -11,6 +11,6 @@
 #include "nodes/bitmapset.h"
 
 extern Bitmapset *DiscreteKnapsack(int max_weight, int num_items,
-				 int *item_weights, double *item_values);
+								   int *item_weights, double *item_values);
 
 #endif							/* KNAPSACK_H */

src/include/lib/pairingheap.h

@@ -76,7 +76,7 @@ typedef struct pairingheap
 } pairingheap;
 
 extern pairingheap *pairingheap_allocate(pairingheap_comparator compare,
-					 void *arg);
+										 void *arg);
 extern void pairingheap_free(pairingheap *heap);
 extern void pairingheap_add(pairingheap *heap, pairingheap_node *node);
 extern pairingheap_node *pairingheap_first(pairingheap *heap);
@@ -85,8 +85,8 @@ extern void pairingheap_remove(pairingheap *heap, pairingheap_node *node);
 
 #ifdef PAIRINGHEAP_DEBUG
 extern char *pairingheap_dump(pairingheap *heap,
-				 void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
-				 void *opaque);
+							  void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
+							  void *opaque);
 #endif
 
 /* Resets the heap to be empty. */

src/include/lib/rbtree.h

@@ -60,11 +60,11 @@ typedef RBTNode *(*rbt_allocfunc) (void *arg);
 typedef void (*rbt_freefunc) (RBTNode *x, void *arg);
 
 extern RBTree *rbt_create(Size node_size,
-		   rbt_comparator comparator,
-		   rbt_combiner combiner,
-		   rbt_allocfunc allocfunc,
-		   rbt_freefunc freefunc,
-		   void *arg);
+						  rbt_comparator comparator,
+						  rbt_combiner combiner,
+						  rbt_allocfunc allocfunc,
+						  rbt_freefunc freefunc,
+						  void *arg);
 
 extern RBTNode *rbt_find(RBTree *rbt, const RBTNode *data);
 extern RBTNode *rbt_leftmost(RBTree *rbt);
@@ -73,7 +73,7 @@ extern RBTNode *rbt_insert(RBTree *rbt, const RBTNode *data, bool *isNew);
 extern void rbt_delete(RBTree *rbt, RBTNode *node);
 
 extern void rbt_begin_iterate(RBTree *rbt, RBTOrderControl ctrl,
-				  RBTreeIterator *iter);
+							  RBTreeIterator *iter);
 extern RBTNode *rbt_iterate(RBTreeIterator *iter);
 
 #endif							/* RBTREE_H */

src/include/lib/simplehash.h

@@ -139,7 +139,7 @@ typedef struct SH_ITERATOR
 
 /* externally visible function prototypes */
 SH_SCOPE	SH_TYPE *SH_CREATE(MemoryContext ctx, uint32 nelements,
-		  void *private_data);
+							   void *private_data);
 SH_SCOPE void SH_DESTROY(SH_TYPE * tb);
 SH_SCOPE void SH_RESET(SH_TYPE * tb);
 SH_SCOPE void SH_GROW(SH_TYPE * tb, uint32 newsize);

src/include/lib/stringinfo.h

@@ -141,7 +141,7 @@ extern void appendStringInfoSpaces(StringInfo str, int count);
  * if necessary.
  */
 extern void appendBinaryStringInfo(StringInfo str,
-					   const char *data, int datalen);
+								   const char *data, int datalen);
 
 /*------------------------
  * appendBinaryStringInfoNT
@@ -149,7 +149,7 @@ extern void appendBinaryStringInfo(StringInfo str,
  * if necessary. Does not ensure a trailing null-byte exists.
  */
 extern void appendBinaryStringInfoNT(StringInfo str,
-						 const char *data, int datalen);
+									 const char *data, int datalen);
 
 /*------------------------
  * enlargeStringInfo