diff options
| author | David Lamparter <equinox@opensourcerouting.org> | 2021-05-03 16:40:09 +0200 |
|---|---|---|
| committer | David Lamparter <equinox@opensourcerouting.org> | 2021-05-03 20:56:55 +0200 |
| commit | 02fb02de37ae7eb98328758707abaf2c31b4e785 (patch) | |
| tree | ee5cc77434884540e7045cf137bc591ca5a42fea /lib/linklist.h | |
| parent | fdab29403786a385d40182967f0776fb4c44a8f6 (diff) | |
lib: kill unused list_filter_out_nodes()
pimd was the only user of this function, and that has gone away now.
So just kill the function.
Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
Diffstat (limited to 'lib/linklist.h')
| -rw-r--r-- | lib/linklist.h | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/lib/linklist.h b/lib/linklist.h index d8820c924d..1452145218 100644 --- a/lib/linklist.h +++ b/lib/linklist.h @@ -295,19 +295,6 @@ extern void list_delete_all_node(struct list *list); extern void list_delete_node(struct list *list, struct listnode *node); /* - * Delete all nodes which satisfy a condition from a list. - * Deletes the node if cond function returns true for the node. - * If function ptr passed is NULL, it deletes all nodes - * - * list - * list to operate on - * cond - * function pointer which takes node data as input and return true or false - */ - -extern void list_filter_out_nodes(struct list *list, bool (*cond)(void *data)); - -/* * Insert a new element into a list with insertion sort if there is no * duplicate element present in the list. This assumes the input list is * sorted. If unsorted, it will check for duplicate until it finds out |