diff --git a/datalink814_ge/src/util/list.c b/datalink814_ge/src/util/list.c index 30ab871..117b72b 100644 --- a/datalink814_ge/src/util/list.c +++ b/datalink814_ge/src/util/list.c @@ -12,6 +12,7 @@ // Copyright (c) 2010 TJ Holowaychuk // +#include #include "list.h" /* @@ -41,7 +42,7 @@ list_new(void) { self->head = NULL; self->tail = NULL; self->free = NULL; - self->match = NULL; + self->compare = NULL; self->len = 0; return self; } @@ -181,8 +182,8 @@ list_find(list_t *self, void *val) { list_node_t *node; while ((node = list_iterator_next(it))) { - if (self->match) { - if (self->match(val, node->val)) { + if (self->compare) { + if (self->compare(val, node->val) == 0) { list_iterator_destroy(it); return node; } diff --git a/datalink814_ge/src/util/list.h b/datalink814_ge/src/util/list.h index 685f0b4..127c1c1 100644 --- a/datalink814_ge/src/util/list.h +++ b/datalink814_ge/src/util/list.h @@ -13,7 +13,6 @@ extern "C" { #endif #include -#include #include /* @@ -44,7 +43,7 @@ typedef struct { list_node_t *tail; uint32_t len; void (*free)(void *val); - bool (*match)(void *a, void *b); + int8_t (*compare)(void *a, void *b); } list_t; /*