From 1d8bbfd2e7cfb72cbe4d5c5d4fa650a28dedac0b Mon Sep 17 00:00:00 2001
From: Bruce Momjian <bruce@momjian.us>
Date: Tue, 19 Aug 1997 21:40:56 +0000
Subject: Make functions static where possible, enclose unused functions in
 #ifdef NOT_USED.

---
 src/backend/lib/dllist.c   | 7 +++++--
 src/backend/lib/lispsort.c | 4 +++-
 2 files changed, 8 insertions(+), 3 deletions(-)

(limited to 'src/backend/lib')

diff --git a/src/backend/lib/dllist.c b/src/backend/lib/dllist.c
index a0487edb876..b8dd14a231b 100644
--- a/src/backend/lib/dllist.c
+++ b/src/backend/lib/dllist.c
@@ -9,7 +9,7 @@
  *
  *
  * IDENTIFICATION
- *    $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.4 1996/11/10 03:00:20 momjian Exp $
+ *    $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.5 1997/08/19 21:31:16 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -67,6 +67,7 @@ DLGetHead(Dllist* l)
 }
 
 /* get the value stored in the first element */
+#ifdef NOT_USED
 void*
 DLGetHeadVal(Dllist* l)
 {
@@ -74,6 +75,7 @@ DLGetHeadVal(Dllist* l)
   
   return (e ? e->dle_val : 0);
 }
+#endif
 
 Dlelem* 
 DLGetTail(Dllist* l)
@@ -82,6 +84,7 @@ DLGetTail(Dllist* l)
 }
 
 /* get the value stored in the first element */
+#ifdef NOT_USED
 void*
 DLGetTailVal(Dllist* l)
 {
@@ -89,7 +92,7 @@ DLGetTailVal(Dllist* l)
   
   return (e ? e->dle_val : 0);
 }
-
+#endif
 
 Dlelem* 
 DLGetPred(Dlelem* e) /* get predecessor */
diff --git a/src/backend/lib/lispsort.c b/src/backend/lib/lispsort.c
index 9376395998a..11acc5683b2 100644
--- a/src/backend/lib/lispsort.c
+++ b/src/backend/lib/lispsort.c
@@ -6,7 +6,7 @@
  *
  *
  * IDENTIFICATION
- *    $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.3 1996/11/06 08:27:14 scrappy Exp $
+ *    $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.4 1997/08/19 21:31:18 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -22,6 +22,7 @@
 #include <lib/lispsort.h>
 #include <lib/qsort.h>
 
+#ifdef NOT_USED
 /*
 ** lisp_qsort: Takes a lisp list as input, copies it into an array of lisp 
 **             nodes which it sorts via qsort() with the comparison function
@@ -57,3 +58,4 @@ List *lisp_qsort(List *the_list,    /* the list to be sorted */
     
     return(output);
 }
+#endif
-- 
cgit v1.2.3