diff options
| author | Bruce Momjian | 1997-09-08 21:56:23 +0000 |
|---|---|---|
| committer | Bruce Momjian | 1997-09-08 21:56:23 +0000 |
| commit | 59f6a57e59fe8353f9edaa3703516ea67e06672b (patch) | |
| tree | 1b083fb66cf0be3890480a1ed5fb077dd7293790 /src/include/lib/dllist.h | |
| parent | 075cede74858a9a04e97097b1ccd555121516c20 (diff) | |
Used modified version of indent that understands over 100 typedefs.
Diffstat (limited to 'src/include/lib/dllist.h')
| -rw-r--r-- | src/include/lib/dllist.h | 15 |
1 files changed, 7 insertions, 8 deletions
diff --git a/src/include/lib/dllist.h b/src/include/lib/dllist.h index af0c580cc93..238ac3b8ea0 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.6 1997/09/08 02:36:47 momjian Exp $ + * $Id: dllist.h,v 1.7 1997/09/08 21:52:17 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -44,13 +44,13 @@ typedef struct Dlelem struct Dlelem *dle_prev; /* previous element */ void *dle_val; /* value of the element */ struct Dllist *dle_list; /* what list this element is in */ -} Dlelem; +} Dlelem; typedef struct Dllist { Dlelem *dll_head; Dlelem *dll_tail; -} Dllist; +} Dllist; extern Dllist *DLNewList(void); /* initialize a new list */ extern void DLFreeList(Dllist *); /* free up a list and all the @@ -59,14 +59,13 @@ extern Dlelem *DLNewElem(void *val); extern void DLFreeElem(Dlelem *); extern Dlelem *DLGetHead(Dllist *); extern Dlelem *DLGetTail(Dllist *); -extern Dlelem *DLRemTail(Dllist * l); +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 */ +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) |