database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-02 09:02:37 +03:00
Code Activity

pgindent run before 6.3 release, with Thomas' requested changes.

Browse Source
This commit is contained in:
Bruce Momjian
1998-02-26 04:46:47 +00:00
parent 757bf69a2e
commit a32450a585
430 changed files with 12390 additions and 10292 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/backend/lib/dllist.c
View File

@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.8 1997/09/08 21:43:27 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.9 1998/02/26 04:31:37 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -18,7 +18,7 @@
#include <lib/dllist.h>
Dllist *
Dllist *
DLNewList(void)
{
Dllist *l;
@ -42,7 +42,7 @@ DLFreeList(Dllist *l)
free(l);
}
Dlelem *
Dlelem *
DLNewElem(void *val)
{
Dlelem *e;
@ -61,7 +61,7 @@ DLFreeElem(Dlelem *e)
free(e);
}
Dlelem *
Dlelem *
DLGetHead(Dllist *l)
{
return (l ? l->dll_head : 0);
@ -69,7 +69,7 @@ DLGetHead(Dllist *l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
void *
DLGetHeadVal(Dllist *l)
{
Dlelem *e = DLGetHead(l);
@ -79,7 +79,7 @@ DLGetHeadVal(Dllist *l)
#endif
Dlelem *
Dlelem *
DLGetTail(Dllist *l)
{
return (l ? l->dll_tail : 0);
@ -87,7 +87,7 @@ DLGetTail(Dllist *l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
void *
DLGetTailVal(Dllist *l)
{
Dlelem *e = DLGetTail(l);
@ -97,13 +97,13 @@ DLGetTailVal(Dllist *l)
#endif
Dlelem *
Dlelem *
DLGetPred(Dlelem *e) /* get predecessor */
{
return (e ? e->dle_prev : 0);
}
Dlelem *
Dlelem *
DLGetSucc(Dlelem *e) /* get successor */
{
return (e ? e->dle_next : 0);
@ -162,7 +162,7 @@ DLAddTail(Dllist *l, Dlelem *e)
l->dll_head = l->dll_tail;
}
Dlelem *
Dlelem *
DLRemHead(Dllist *l)
{
/* remove and return the head */
@ -188,7 +188,7 @@ DLRemHead(Dllist *l)
return result;
}
Dlelem *
Dlelem *
DLRemTail(Dllist *l)
{
/* remove and return the tail */

4
src/backend/lib/lispsort.c
View File

@ -6,7 +6,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.7 1997/09/08 21:43:31 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.8 1998/02/26 04:31:39 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -29,7 +29,7 @@
** as passed into lisp_qsort(), and returns a new list with
** the nodes sorted. The old list is *not* freed or modified (?)
*/
List *
List *
lisp_qsort(List *the_list, /* the list to be sorted */
int (*compare) ()) /* function to compare two nodes */
{

16
src/backend/lib/qsort.c
View File

@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/qsort.c,v 1.5 1998/02/11 19:10:35 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/qsort.c,v 1.6 1998/02/26 04:31:40 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -129,13 +129,13 @@ pg_qsort(void *bot,
static void
quick_sort(char *bot, int nmemb, int size, int (*compar) ())
{
int cnt;
u_char ch;
char *top,
int cnt;
u_char ch;
char *top,
*mid,
*t1,
*t2;
int n1,
int n1,
n2;
char *bsv;
@ -277,9 +277,9 @@ swap: SWAP(bot, replace);
static void
insertion_sort(char *bot, int nmemb, int size, int (*compar) ())
{
int cnt;
u_char ch;
char *s1,
int cnt;
u_char ch;
char *s1,
*s2,
*t1,
*t2,