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

Used modified version of indent that understands over 100 typedefs.

Browse Source
This commit is contained in:
Bruce Momjian
1997-09-08 21:56:23 +00:00
parent 075cede748
commit 59f6a57e59
413 changed files with 4472 additions and 4460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.7 1997/09/08 02:22:56 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.8 1997/09/08 21:43:27 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -32,7 +32,7 @@ DLNewList(void)
/* free up a list and all the nodes in it */
void
DLFreeList(Dllist * l)
DLFreeList(Dllist *l)
{
Dlelem *curr;
@ -56,13 +56,13 @@ DLNewElem(void *val)
}
void
DLFreeElem(Dlelem * e)
DLFreeElem(Dlelem *e)
{
free(e);
}
Dlelem *
DLGetHead(Dllist * l)
DLGetHead(Dllist *l)
{
return (l ? l->dll_head : 0);
}
@ -70,7 +70,7 @@ DLGetHead(Dllist * l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
DLGetHeadVal(Dllist * l)
DLGetHeadVal(Dllist *l)
{
Dlelem *e = DLGetHead(l);
@ -80,7 +80,7 @@ DLGetHeadVal(Dllist * l)
#endif
Dlelem *
DLGetTail(Dllist * l)
DLGetTail(Dllist *l)
{
return (l ? l->dll_tail : 0);
}
@ -88,7 +88,7 @@ DLGetTail(Dllist * l)
/* get the value stored in the first element */
#ifdef NOT_USED
void *
DLGetTailVal(Dllist * l)
DLGetTailVal(Dllist *l)
{
Dlelem *e = DLGetTail(l);
@ -98,19 +98,19 @@ DLGetTailVal(Dllist * l)
#endif
Dlelem *
DLGetPred(Dlelem * e) /* get predecessor */
DLGetPred(Dlelem *e) /* get predecessor */
{
return (e ? e->dle_prev : 0);
}
Dlelem *
DLGetSucc(Dlelem * e) /* get successor */
DLGetSucc(Dlelem *e) /* get successor */
{
return (e ? e->dle_next : 0);
}
void
DLRemove(Dlelem * e)
DLRemove(Dlelem *e)
{
Dllist *l;
@ -129,7 +129,7 @@ DLRemove(Dlelem * e)
}
void
DLAddHead(Dllist * l, Dlelem * e)
DLAddHead(Dllist *l, Dlelem *e)
{
e->dle_list = l;
@ -146,7 +146,7 @@ DLAddHead(Dllist * l, Dlelem * e)
}
void
DLAddTail(Dllist * l, Dlelem * e)
DLAddTail(Dllist *l, Dlelem *e)
{
e->dle_list = l;
@ -163,7 +163,7 @@ DLAddTail(Dllist * l, Dlelem * e)
}
Dlelem *
DLRemHead(Dllist * l)
DLRemHead(Dllist *l)
{
/* remove and return the head */
Dlelem *result;
@ -189,7 +189,7 @@ DLRemHead(Dllist * l)
}
Dlelem *
DLRemTail(Dllist * l)
DLRemTail(Dllist *l)
{
/* remove and return the tail */
Dlelem *result;

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

@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/hasht.c,v 1.6 1997/09/08 02:22:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/hasht.c,v 1.7 1997/09/08 21:43:29 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -26,7 +26,7 @@
* -----------------------------------
*/
void
HashTableWalk(HTAB * hashtable, HashtFunc function, int arg)
HashTableWalk(HTAB *hashtable, HashtFunc function, int arg)
{
long *hashent;
long *data;

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

@ -6,7 +6,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.6 1997/09/08 02:23:02 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.7 1997/09/08 21:43:31 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -30,7 +30,7 @@
** the nodes sorted. The old list is *not* freed or modified (?)
*/
List *
lisp_qsort(List * the_list, /* the list to be sorted */
lisp_qsort(List *the_list, /* the list to be sorted */
int (*compare) ()) /* function to compare two nodes */
{
int i;