o Don't free the second list in Lst_Concat for LST_CONCLINK; free
authorMax Okumoto <okumoto@dragonflybsd.org>
Fri, 17 Dec 2004 08:01:40 +0000 (08:01 +0000)
committerMax Okumoto <okumoto@dragonflybsd.org>
Fri, 17 Dec 2004 08:01:40 +0000 (08:01 +0000)
commit57de52ee3c2aa94a93dd1c9722d6899588039e45
tree4c95e3f5ea623ef1d4ce62a5ffcc055c467e9e61
parent513bf0dbde6225af00ac9f7c9a535389d96cb9b9
o Don't free the second list in Lst_Concat for LST_CONCLINK; free
  it in the caller instead.

o Remove return value from Lst_Concat. None of the callers ever
  checked it. Remove stuff that was needed for circular lists.

o Don't check the return code from Lst_Remove. There is no way that
  the list's first element is not on the list.

o No caller checks the return code from Lst_Remove, so don't return
  one.  Simplify the algorithm now that circular lists are gone.

o Now that circular lists are gone remove stuff for them. Simplify
  somewhat so that we can remove a local variable.

Taken-from: FreeBSD
Author: harti
usr.bin/make/lst.h
usr.bin/make/lst.lib/lstConcat.c
usr.bin/make/lst.lib/lstDeQueue.c
usr.bin/make/lst.lib/lstDestroy.c
usr.bin/make/lst.lib/lstRemove.c
usr.bin/make/suff.c