Hartmut Brandt 1d614caea7 Instead of dynamically allocating list heads allocated them statically ...

now that their size is only two pointers. This eliminates a lot of calls
to Lst_Init and from there to malloc together with many calls to
Lst_Destroy (in places where the list is obviously empty). This also
reduces the chance to leave a list uninitilized so we can remove more
NULL pointer checks and probably eliminates a couple of memory leaks.

2004-12-16 16:14:16 +00:00

..

lstAppend.c

Nobody actually checked the return codes from Lst_Append and Lst_Insert

2004-12-09 15:31:32 +00:00

lstConcat.c

Instead of dynamically allocating list heads allocated them statically

2004-12-16 16:14:16 +00:00

lstDeQueue.c

Don't check the return code from Lst_Remove. There is no way

2004-12-08 16:50:14 +00:00

lstDestroy.c

Instead of dynamically allocating list heads allocated them statically

2004-12-16 16:14:16 +00:00

lstDupl.c

Instead of dynamically allocating list heads allocated them statically

2004-12-16 16:14:16 +00:00

lstFindFrom.c

Constify the arguments to the list compare function. This temporarily

2004-12-08 12:59:27 +00:00

lstForEachFrom.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstInsert.c

Nobody actually checked the return codes from Lst_Append and Lst_Insert

2004-12-09 15:31:32 +00:00

lstMember.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstRemove.c

No caller checks the return code from Lst_Remove, so don't return one.

2004-12-08 17:43:43 +00:00