X-Git-Url: http://the.earth.li/gitweb/?p=onak.git;a=blobdiff_plain;f=ll.c;h=e9cde23e9a0f1d71868e57e8fa9085b59595848a;hp=acad0bcae8c64980bac57aa812e9399ae798d6d8;hb=de18b56efecadc4b5d2473904828db9c08cd2162;hpb=4b8483ae278577a3adc8d84da81d77019704466f diff --git a/ll.c b/ll.c index acad0bc..e9cde23 100644 --- a/ll.c +++ b/ll.c @@ -1,9 +1,19 @@ /* * ll.c - various things of used for dealing with linked lists. * - * Jonathan McDowell + * Copyright 2000-2004 Jonathan McDowell * - * Copyright 2000-2002 Project Purple + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by the Free + * Software Foundation; version 2 of the License. + * + * This program is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for + * more details. + * + * You should have received a copy of the GNU General Public License along with + * this program. If not, see . */ #include @@ -28,10 +38,36 @@ struct ll *lladd(struct ll *curll, void *object) return new; } +struct ll *lladdend(struct ll *curll, void *object) +{ + struct ll *new; + struct ll *cur; + + if ((new = malloc(sizeof(struct ll))) == NULL) { + return NULL; + } + + new->next = NULL; + new->object = object; + + if (curll != NULL) { + cur = curll; + while (cur->next != NULL) { + cur = cur->next; + } + cur->next = new; + } else { + curll = new; + } + + return curll; +} + struct ll *lldel(struct ll *curll, void *object, int (*objectcmp) (const void *object1, const void *object2)) { - struct ll *cur; + struct ll *cur = NULL; + struct ll *old = NULL; assert(objectcmp != NULL); @@ -39,11 +75,16 @@ struct ll *lldel(struct ll *curll, void *object, if (cur == NULL) { return NULL; } else if (!(*objectcmp)(cur->object, object)) { - return cur->next; + old = cur; + cur = cur->next; + free(old); + return cur; } while (cur->next != NULL) { if (!(*objectcmp)(cur->next->object, object)) { + old = cur->next; cur->next = cur->next->next; + free(old); break; } } @@ -55,6 +96,8 @@ struct ll *llfind(struct ll *curll, void *object, { struct ll *cur; + assert(objectcmp != NULL); + cur = curll; while (cur != NULL && (*objectcmp)(cur->object, object)) { cur = cur->next; @@ -73,3 +116,19 @@ unsigned long llsize(struct ll *curll) return count; } + +void llfree(struct ll *curll, void (*objectfree) (void *object)) +{ + struct ll *nextll; + + while (curll != NULL) { + nextll = curll->next; + if (curll->object != NULL && objectfree != NULL) { + objectfree(curll->object); + curll->object = NULL; + } + free(curll); + curll = nextll; + } + return; +}