1 files changed, 58 insertions, 55 deletions

diff --git a/src/backend/optimizer/util/indexnode.c b/src/backend/optimizer/util/indexnode.c
index 8e9237e6845..e6a1902f8b9 100644
--- a/src/backend/optimizer/util/indexnode.c
+++ b/src/backend/optimizer/util/indexnode.c
@@ -1,13 +1,13 @@
 /*-------------------------------------------------------------------------
  *
  * indexnode.c--
- *    Routines to find all indices on a relation
+ *	  Routines to find all indices on a relation
  *
  * Copyright (c) 1994, Regents of the University of California
  *
  *
  * IDENTIFICATION
- *    $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/indexnode.c,v 1.2 1996/10/31 10:59:37 scrappy Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/indexnode.c,v 1.3 1997/09/07 04:44:22 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -21,74 +21,77 @@
 
 #include "optimizer/internal.h"
 #include "optimizer/plancat.h"
-#include "optimizer/pathnode.h"		/* where the decls go */
+#include "optimizer/pathnode.h" /* where the decls go */
 
 
-static List *find_secondary_index(Query *root, Oid relid);
+static List    *find_secondary_index(Query * root, Oid relid);
 
-/*    
+/*
  * find-relation-indices--
- *    Returns a list of index nodes containing appropriate information for
- *    each (secondary) index defined on a relation.
- *    
+ *	  Returns a list of index nodes containing appropriate information for
+ *	  each (secondary) index defined on a relation.
+ *
  */
-List *
-find_relation_indices(Query *root, Rel *rel)
+List		   *
+find_relation_indices(Query * root, Rel * rel)
 {
-    if (rel->indexed) {
-	return (find_secondary_index(root, lfirsti(rel->relids)));
-    } else {
-	return (NIL);
-    }
+	if (rel->indexed)
+	{
+		return (find_secondary_index(root, lfirsti(rel->relids)));
+	}
+	else
+	{
+		return (NIL);
+	}
 }
 
-/*    
+/*
  * find-secondary-index--
- *    Creates a list of index path nodes containing information for each
- *    secondary index defined on a relation by searching through the index
- *    catalog.
- *    
+ *	  Creates a list of index path nodes containing information for each
+ *	  secondary index defined on a relation by searching through the index
+ *	  catalog.
+ *
  * 'relid' is the OID of the relation for which indices are being located
- *    
+ *
  * Returns a list of new index nodes.
- *    
+ *
  */
-static List *
-find_secondary_index(Query *root, Oid relid)
+static List    *
+find_secondary_index(Query * root, Oid relid)
 {
-    IdxInfoRetval indexinfo;
-    List *indexes = NIL;
-    bool first = TRUE;
+	IdxInfoRetval	indexinfo;
+	List		   *indexes = NIL;
+	bool			first = TRUE;
 
-    while (index_info(root, first, relid,&indexinfo)) {
-	Rel *indexnode = makeNode(Rel);
+	while (index_info(root, first, relid, &indexinfo))
+	{
+		Rel			   *indexnode = makeNode(Rel);
 
-	indexnode->relids = lconsi(indexinfo.relid,NIL);
-	indexnode->relam = indexinfo.relam;
-	indexnode->pages = indexinfo.pages;
-	indexnode->tuples = indexinfo.tuples;
-	indexnode->indexkeys = indexinfo.indexkeys;
-	indexnode->ordering = indexinfo.orderOprs;
-	indexnode->classlist = indexinfo.classlist;
-	indexnode->indproc= indexinfo.indproc;
-	indexnode->indpred = (List*)indexinfo.indpred;
-	
-	indexnode->indexed= false; /* not indexed itself */
-	indexnode->size = 0;
-	indexnode->width= 0;
-	indexnode->targetlist= NIL;
-	indexnode->pathlist= NIL;
-	indexnode->unorderedpath= NULL;
-	indexnode->cheapestpath= NULL;
-	indexnode->pruneable= true;
-	indexnode->clauseinfo= NIL;
-	indexnode->joininfo= NIL;
-	indexnode->innerjoin= NIL;
+		indexnode->relids = lconsi(indexinfo.relid, NIL);
+		indexnode->relam = indexinfo.relam;
+		indexnode->pages = indexinfo.pages;
+		indexnode->tuples = indexinfo.tuples;
+		indexnode->indexkeys = indexinfo.indexkeys;
+		indexnode->ordering = indexinfo.orderOprs;
+		indexnode->classlist = indexinfo.classlist;
+		indexnode->indproc = indexinfo.indproc;
+		indexnode->indpred = (List *) indexinfo.indpred;
 
-	indexes = lcons(indexnode, indexes);
-	first = FALSE;
-    }
+		indexnode->indexed = false;		/* not indexed itself */
+		indexnode->size = 0;
+		indexnode->width = 0;
+		indexnode->targetlist = NIL;
+		indexnode->pathlist = NIL;
+		indexnode->unorderedpath = NULL;
+		indexnode->cheapestpath = NULL;
+		indexnode->pruneable = true;
+		indexnode->clauseinfo = NIL;
+		indexnode->joininfo = NIL;
+		indexnode->innerjoin = NIL;
 
-    return indexes;
-}
+		indexes = lcons(indexnode, indexes);
+		first = FALSE;
+	}
 
+	return indexes;
+}