diff options
author | harti <harti@FreeBSD.org> | 2004-12-08 17:43:43 +0000 |
---|---|---|
committer | harti <harti@FreeBSD.org> | 2004-12-08 17:43:43 +0000 |
commit | 7bfaeaf06171fb6d9c4bbc52845c7bf7b370d8d2 (patch) | |
tree | dc59788195b2223a8f3b72c0c0d85f4c00e0b2d2 /usr.bin/make/lst.h | |
parent | 21e06e4bb02890259326936aad2e26187681147e (diff) | |
download | FreeBSD-src-7bfaeaf06171fb6d9c4bbc52845c7bf7b370d8d2.zip FreeBSD-src-7bfaeaf06171fb6d9c4bbc52845c7bf7b370d8d2.tar.gz |
No caller checks the return code from Lst_Remove, so don't return one.
Simplify the algorithm now that circular lists are gone.
Diffstat (limited to 'usr.bin/make/lst.h')
-rw-r--r-- | usr.bin/make/lst.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/usr.bin/make/lst.h b/usr.bin/make/lst.h index bb08f2c..e9c8f1c 100644 --- a/usr.bin/make/lst.h +++ b/usr.bin/make/lst.h @@ -120,7 +120,7 @@ ReturnStatus Lst_Append(Lst *, LstNode *, void *); /* Place an element at the end of a lst. */ #define Lst_AtEnd(LST, D) (Lst_Append((LST), Lst_Last(LST), (D))) /* Remove an element */ -ReturnStatus Lst_Remove(Lst *, LstNode *); +void Lst_Remove(Lst *, LstNode *); /* Replace a node with a new value */ #define Lst_Replace(NODE, D) (((NODE) == NULL) ? FAILURE : \ (((NODE)->datum = (D)), SUCCESS)) |