{
llist_t *ret;
- ret = (llist_t *) malloc (sizeof (llist_t));
+ ret = malloc (sizeof (*ret));
if (ret == NULL)
return (NULL);
{
llentry_t *e;
- e = (llentry_t *) malloc (sizeof (llentry_t));
+ e = malloc (sizeof (*e));
if (e)
{
e->key = key;
{
llentry_t *prev;
+ if ((l == NULL) || (e == NULL))
+ return;
+
prev = l->head;
while ((prev != NULL) && (prev->next != e))
prev = prev->next;