database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-28 23:42:10 +03:00
Code Activity

Another PGINDENT run that changes variable indenting and case label indenting. Also static variable indenting.

Browse Source
This commit is contained in:
Bruce Momjian
1997-09-08 02:41:22 +00:00
parent a90f12fd9d
commit 319dbfa736
632 changed files with 28301 additions and 28220 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.6 1997/09/07 04:41:56 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.7 1997/09/08 02:22:56 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -18,10 +18,10 @@
#include <lib/dllist.h>
Dllist *
Dllist *
DLNewList(void)
{
Dllist *l;
Dllist *l;
l = malloc(sizeof(Dllist));
l->dll_head = 0;
@ -34,7 +34,7 @@ DLNewList(void)
void
DLFreeList(Dllist * l)
{
Dlelem *curr;
Dlelem *curr;
while ((curr = DLRemHead(l)) != 0)
free(curr);
@ -42,10 +42,10 @@ DLFreeList(Dllist * l)
free(l);
}
Dlelem *
Dlelem *
DLNewElem(void *val)
{
Dlelem *e;
Dlelem *e;
e = malloc(sizeof(Dlelem));
e->dle_next = 0;
@ -61,7 +61,7 @@ DLFreeElem(Dlelem * e)
free(e);
}
Dlelem *
Dlelem *
DLGetHead(Dllist * l)
{
return (l ? l->dll_head : 0);
@ -69,17 +69,17 @@ DLGetHead(Dllist * l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
void *
DLGetHeadVal(Dllist * l)
{
Dlelem *e = DLGetHead(l);
Dlelem *e = DLGetHead(l);
return (e ? e->dle_val : 0);
}
#endif
Dlelem *
Dlelem *
DLGetTail(Dllist * l)
{
return (l ? l->dll_tail : 0);
@ -87,23 +87,23 @@ DLGetTail(Dllist * l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
void *
DLGetTailVal(Dllist * l)
{
Dlelem *e = DLGetTail(l);
Dlelem *e = DLGetTail(l);
return (e ? e->dle_val : 0);
}
#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);
@ -112,7 +112,7 @@ DLGetSucc(Dlelem * e) /* get successor */
void
DLRemove(Dlelem * e)
{
Dllist *l;
Dllist *l;
if (e->dle_prev)
e->dle_prev->dle_next = e->dle_next;
@ -162,11 +162,11 @@ DLAddTail(Dllist * l, Dlelem * e)
l->dll_head = l->dll_tail;
}
Dlelem *
Dlelem *
DLRemHead(Dllist * l)
{
/* remove and return the head */
Dlelem *result;
Dlelem *result;
if (l->dll_head == 0)
return 0;
@ -188,11 +188,11 @@ DLRemHead(Dllist * l)
return result;
}
Dlelem *
Dlelem *
DLRemTail(Dllist * l)
{
/* remove and return the tail */
Dlelem *result;
Dlelem *result;
if (l->dll_tail == 0)
return 0;

14
src/backend/lib/fstack.c
View File

@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/fstack.c,v 1.5 1997/09/07 04:42:00 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/fstack.c,v 1.6 1997/09/08 02:22:57 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -57,7 +57,7 @@ FixedStackInit(FixedStack stack, Offset offset)
Pointer
FixedStackPop(FixedStack stack)
{
Pointer pointer;
Pointer pointer;
AssertArg(FixedStackIsValid(stack));
@ -75,7 +75,7 @@ FixedStackPop(FixedStack stack)
void
FixedStackPush(FixedStack stack, Pointer pointer)
{
FixedItem item = FixedStackGetItem(stack, pointer);
FixedItem item = FixedStackGetItem(stack, pointer);
AssertArg(FixedStackIsValid(stack));
AssertArg(PointerIsValid(pointer));
@ -96,11 +96,11 @@ FixedStackPush(FixedStack stack, Pointer pointer)
* BadArg if stack is invalid.
* BadArg if pointer is invalid.
*/
static bool
static bool
FixedStackContains(FixedStack stack, Pointer pointer)
{
FixedItem next;
FixedItem item;
FixedItem next;
FixedItem item;
AssertArg(FixedStackIsValid(stack));
AssertArg(PointerIsValid(pointer));
@ -135,7 +135,7 @@ FixedStackGetTop(FixedStack stack)
Pointer
FixedStackGetNext(FixedStack stack, Pointer pointer)
{
FixedItem item;
FixedItem item;
/* AssertArg(FixedStackIsValid(stack)); */
/* AssertArg(PointerIsValid(pointer)); */

8
src/backend/lib/hasht.c
View File

@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/hasht.c,v 1.5 1997/09/07 04:42:03 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/hasht.c,v 1.6 1997/09/08 02:22:59 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -28,9 +28,9 @@
void
HashTableWalk(HTAB * hashtable, HashtFunc function, int arg)
{
long *hashent;
long *data;
int keysize;
long *hashent;
long *data;
int keysize;
keysize = hashtable->hctl->keysize;
hash_seq((HTAB *) NULL);

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

@ -6,7 +6,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.5 1997/09/07 04:42:05 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.6 1997/09/08 02:23:02 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -29,15 +29,15 @@
** 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 */
{
int i;
size_t num;
List **nodearray;
List *tmp,
*output;
int i;
size_t num;
List **nodearray;
List *tmp,
*output;
/* find size of list */
num = length(the_list);

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

@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/qsort.c,v 1.3 1997/09/07 04:42:06 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/qsort.c,v 1.4 1997/09/08 02:23:03 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -45,7 +45,7 @@
*/
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)qsort.c 5.9 (Berkeley) 2/23/91";
static char sccsid[] = "@(#)qsort.c 5.9 (Berkeley) 2/23/91";
#endif /* LIBC_SCCS and not lint */
@ -67,8 +67,8 @@ static char sccsid[] = "@(#)qsort.c 5.9 (Berkeley) 2/23/91";
*/
#define THRESH 4
static void insertion_sort(char *bot, int nmemb, int size, int (*compar) ());
static void quick_sort(char *bot, int nmemb, int size, int (*compar) ());
static void insertion_sort(char *bot, int nmemb, int size, int (*compar) ());
static void quick_sort(char *bot, int nmemb, int size, int (*compar) ());
void
pg_qsort(void *bot,
@ -129,15 +129,15 @@ pg_qsort(void *bot,
static void
quick_sort(char *bot, int nmemb, int size, int (*compar) ())
{
register int cnt;
register int cnt;
register u_char ch;
register char *top,
*mid,
*t1,
*t2;
register int n1,
n2;
char *bsv;
register char *top,
*mid,
*t1,
*t2;
register int n1,
n2;
char *bsv;
/* bot and nmemb must already be set. */
partition:
@ -277,13 +277,13 @@ swap: SWAP(bot, replace);
static void
insertion_sort(char *bot, int nmemb, int size, int (*compar) ())
{
register int cnt;
register int cnt;
register u_char ch;
register char *s1,
*s2,
*t1,
*t2,
*top;
register char *s1,
*s2,
*t1,
*t2,
*top;
/*
* A simple insertion sort (see Knuth, Vol. 3, page 81, Algorithm S).

12
src/backend/lib/stringinfo.c
View File

@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/stringinfo.c,v 1.4 1997/09/07 04:42:07 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/stringinfo.c,v 1.5 1997/09/08 02:23:05 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -30,8 +30,8 @@
StringInfo
makeStringInfo()
{
StringInfo res;
long size;
StringInfo res;
long size;
res = (StringInfo) palloc(sizeof(StringInfoData));
if (res == NULL)
@ -72,9 +72,9 @@ makeStringInfo()
void
appendStringInfo(StringInfo str, char *buffer)
{
int buflen,
newlen;
char *s;
int buflen,
newlen;
char *s;
Assert((str != NULL));