Run pgindent on remaining files now that LOOPBYTE is a usable macro.

contrib/hstore/hstore_gist.c

@@ -516,7 +516,7 @@ ghstore_consistent(PG_FUNCTION_ARGS)
 
 	sign = GETSIGN(entry);
 
-	if ( strategy == HStoreContainsStrategyNumber || strategy == 13 /* hack for old strats */ )
+	if (strategy == HStoreContainsStrategyNumber || strategy == 13 /* hack for old strats */ )
 	{
 		HStore	   *query = PG_GETARG_HS(1);
 		HEntry	   *qe = ARRPTR(query);
@@ -540,10 +540,10 @@ ghstore_consistent(PG_FUNCTION_ARGS)
 			qe++;
 		}
 	}
-	else if ( strategy == HStoreExistsStrategyNumber )
+	else if (strategy == HStoreExistsStrategyNumber)
 	{
 		text	   *query = PG_GETARG_TEXT_P(1);
-		int		crc = crc32_sz( VARDATA(query), VARSIZE(query)-VARHDRSZ );
+		int			crc = crc32_sz(VARDATA(query), VARSIZE(query) - VARHDRSZ);
 
 		res = (GETBIT(sign, HASHVAL(crc))) ? true : false;
 	}

contrib/ltree/ltree_gist.c

@@ -1,7 +1,7 @@
 /*
  * GiST support for ltree
  * Teodor Sigaev <teodor@stack.net>
- * $PostgreSQL: pgsql/contrib/ltree/ltree_gist.c,v 1.21 2007/11/16 00:13:02 momjian Exp $
+ * $PostgreSQL: pgsql/contrib/ltree/ltree_gist.c,v 1.22 2007/11/16 01:12:24 momjian Exp $
  */
 
 #include "ltree.h"

contrib/pg_trgm/trgm_gist.c

@@ -397,7 +397,7 @@ typedef struct
 } CACHESIGN;
 
 static void
-fillcache(CACHESIGN * item, TRGM * key)
+fillcache(CACHESIGN *item, TRGM * key)
 {
 	item->allistrue = false;
 	if (ISARRKEY(key))
@@ -426,7 +426,7 @@ comparecost(const void *a, const void *b)
 
 
 static int
-hemdistcache(CACHESIGN * a, CACHESIGN * b)
+hemdistcache(CACHESIGN *a, CACHESIGN *b)
 {
 	if (a->allistrue)
 	{

src/backend/utils/adt/tsgistidx.c

@@ -7,7 +7,7 @@
  *
  *
  * IDENTIFICATION
- *	  $PostgreSQL: pgsql/src/backend/utils/adt/tsgistidx.c,v 1.5 2007/11/16 00:13:02 momjian Exp $
+ *	  $PostgreSQL: pgsql/src/backend/utils/adt/tsgistidx.c,v 1.6 2007/11/16 01:12:24 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -167,7 +167,7 @@ uniqueint(int4 *a, int4 l)
 }
 
 static void
-makesign(BITVECP sign, SignTSVector * a)
+makesign(BITVECP sign, SignTSVector *a)
 {
 	int4		k,
 				len = ARRNELEM(a);
@@ -299,7 +299,7 @@ typedef struct
  * is there value 'val' in array or not ?
  */
 static bool
-checkcondition_arr(void *checkval, QueryOperand * val)
+checkcondition_arr(void *checkval, QueryOperand *val)
 {
 	int4	   *StopLow = ((CHKVAL *) checkval)->arrb;
 	int4	   *StopHigh = ((CHKVAL *) checkval)->arre;
@@ -322,7 +322,7 @@ checkcondition_arr(void *checkval, QueryOperand * val)
 }
 
 static bool
-checkcondition_bit(void *checkval, QueryOperand * val)
+checkcondition_bit(void *checkval, QueryOperand *val)
 {
 	return GETBIT(checkval, HASHVAL(val->valcrc));
 }
@@ -364,7 +364,7 @@ gtsvector_consistent(PG_FUNCTION_ARGS)
 }
 
 static int4
-unionkey(BITVECP sbase, SignTSVector * add)
+unionkey(BITVECP sbase, SignTSVector *add)
 {
 	int4		i;
 
@@ -507,7 +507,7 @@ hemdistsign(BITVECP a, BITVECP b)
 }
 
 static int
-hemdist(SignTSVector * a, SignTSVector * b)
+hemdist(SignTSVector *a, SignTSVector *b)
 {
 	if (ISALLTRUE(a))
 	{
@@ -557,7 +557,7 @@ typedef struct
 } CACHESIGN;
 
 static void
-fillcache(CACHESIGN * item, SignTSVector * key)
+fillcache(CACHESIGN *item, SignTSVector *key)
 {
 	item->allistrue = false;
 	if (ISARRKEY(key))
@@ -589,7 +589,7 @@ comparecost(const void *va, const void *vb)
 
 
 static int
-hemdistcache(CACHESIGN * a, CACHESIGN * b)
+hemdistcache(CACHESIGN *a, CACHESIGN *b)
 {
 	if (a->allistrue)
 	{