diff options
| author | Bruce Momjian <bruce@momjian.us> | 1997-09-08 02:41:22 +0000 |
|---|---|---|
| committer | Bruce Momjian <bruce@momjian.us> | 1997-09-08 02:41:22 +0000 |
| commit | 319dbfa7364721d3343af03a7ce063c2a2c9d385 (patch) | |
| tree | a2146fe02c49ce1e497b7c287dfcaa367a703ae4 /src/include/lib/dllist.h | |
| parent | a90f12fd9d6886da4f0734288496361a304d3882 (diff) | |
| download | postgresql-319dbfa7364721d3343af03a7ce063c2a2c9d385.tar.gz | |
Another PGINDENT run that changes variable indenting and case label indenting. Also static variable indenting.
Diffstat (limited to 'src/include/lib/dllist.h')
| -rw-r--r-- | src/include/lib/dllist.h | 44 |
1 files changed, 22 insertions, 22 deletions
diff --git a/src/include/lib/dllist.h b/src/include/lib/dllist.h index 15a18d88c6..af0c580cc9 100644 --- a/src/include/lib/dllist.h +++ b/src/include/lib/dllist.h @@ -26,7 +26,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: dllist.h,v 1.5 1997/09/07 04:58:07 momjian Exp $ + * $Id: dllist.h,v 1.6 1997/09/08 02:36:47 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -40,32 +40,32 @@ struct Dlelem; typedef struct Dlelem { - struct Dlelem *dle_next; /* next element */ - struct Dlelem *dle_prev; /* previous element */ - void *dle_val; /* value of the element */ - struct Dllist *dle_list; /* what list this element is in */ -} Dlelem; + struct Dlelem *dle_next; /* next element */ + struct Dlelem *dle_prev; /* previous element */ + void *dle_val; /* value of the element */ + struct Dllist *dle_list; /* what list this element is in */ +} Dlelem; typedef struct Dllist { - Dlelem *dll_head; - Dlelem *dll_tail; -} Dllist; + Dlelem *dll_head; + Dlelem *dll_tail; +} Dllist; -extern Dllist *DLNewList(void);/* initialize a new list */ -extern void DLFreeList(Dllist *); /* free up a list and all the +extern Dllist *DLNewList(void); /* initialize a new list */ +extern void DLFreeList(Dllist *); /* free up a list and all the * nodes in it */ -extern Dlelem *DLNewElem(void *val); -extern void DLFreeElem(Dlelem *); -extern Dlelem *DLGetHead(Dllist *); -extern Dlelem *DLGetTail(Dllist *); -extern Dlelem *DLRemTail(Dllist * l); -extern Dlelem *DLGetPred(Dlelem *); /* get predecessor */ -extern Dlelem *DLGetSucc(Dlelem *); /* get successor */ -extern void DLRemove(Dlelem *); /* removes node from list */ -extern void DLAddHead(Dllist * list, Dlelem * node); -extern void DLAddTail(Dllist * list, Dlelem * node); -extern Dlelem *DLRemHead(Dllist * list); /* remove and return the +extern Dlelem *DLNewElem(void *val); +extern void DLFreeElem(Dlelem *); +extern Dlelem *DLGetHead(Dllist *); +extern Dlelem *DLGetTail(Dllist *); +extern Dlelem *DLRemTail(Dllist * l); +extern Dlelem *DLGetPred(Dlelem *); /* get predecessor */ +extern Dlelem *DLGetSucc(Dlelem *); /* get successor */ +extern void DLRemove(Dlelem *); /* removes node from list */ +extern void DLAddHead(Dllist * list, Dlelem * node); +extern void DLAddTail(Dllist * list, Dlelem * node); +extern Dlelem *DLRemHead(Dllist * list); /* remove and return the * head */ #define DLE_VAL(x) (x->dle_val) |