1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
|
/* Generic linked list routine.
* Copyright (C) 1997, 2000 Kunihiro Ishiguro
*
* This file is part of GNU Zebra.
*
* GNU Zebra 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; either version 2, or (at your option) any
* later version.
*
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#include "pmacct.h"
#include "linklist.h"
/* Allocate new list. */
struct pm_list *
pm_list_new (void)
{
return calloc(1, sizeof (struct pm_list));
}
/* Free list. */
void
pm_list_free (struct pm_list *l)
{
free(l);
}
/* Allocate new listnode. Internal use only. */
static struct pm_listnode *
pm_listnode_new (void)
{
return calloc(1, sizeof (struct pm_listnode));
}
/* Free listnode. */
static void
pm_listnode_free (struct pm_listnode *node)
{
free(node);
}
/* Add new data to the list. */
void
pm_listnode_add (struct pm_list *list, void *val)
{
struct pm_listnode *node;
assert (val != NULL);
node = pm_listnode_new ();
node->prev = list->tail;
node->data = val;
if (list->head == NULL)
list->head = node;
else
list->tail->next = node;
list->tail = node;
list->count++;
}
/*
* Add a node to the list. If the list was sorted according to the
* cmp function, insert a new node with the given val such that the
* list remains sorted. The new node is always inserted; there is no
* notion of omitting duplicates.
*/
void
pm_listnode_add_sort (struct pm_list *list, void *val)
{
struct pm_listnode *n;
struct pm_listnode *new;
assert (val != NULL);
new = pm_listnode_new ();
new->data = val;
if (list->cmp)
{
for (n = list->head; n; n = n->next)
{
if ((*list->cmp) (val, n->data) < 0)
{
new->next = n;
new->prev = n->prev;
if (n->prev)
n->prev->next = new;
else
list->head = new;
n->prev = new;
list->count++;
return;
}
}
}
new->prev = list->tail;
if (list->tail)
list->tail->next = new;
else
list->head = new;
list->tail = new;
list->count++;
}
void
pm_listnode_add_after (struct pm_list *list, struct pm_listnode *pp, void *val)
{
struct pm_listnode *nn;
assert (val != NULL);
nn = pm_listnode_new ();
nn->data = val;
if (pp == NULL)
{
if (list->head)
list->head->prev = nn;
else
list->tail = nn;
nn->next = list->head;
nn->prev = pp;
list->head = nn;
}
else
{
if (pp->next)
pp->next->prev = nn;
else
list->tail = nn;
nn->next = pp->next;
nn->prev = pp;
pp->next = nn;
}
list->count++;
}
/* Delete specific date pointer from the list. */
void
pm_listnode_delete (struct pm_list *list, void *val)
{
struct pm_listnode *node;
assert(list);
for (node = list->head; node; node = node->next)
{
if (node->data == val)
{
if (node->prev)
node->prev->next = node->next;
else
list->head = node->next;
if (node->next)
node->next->prev = node->prev;
else
list->tail = node->prev;
list->count--;
pm_listnode_free (node);
return;
}
}
}
/* Return first node's data if it is there. */
void *
pm_listnode_head (struct pm_list *list)
{
struct pm_listnode *node;
assert(list);
node = list->head;
if (node)
return node->data;
return NULL;
}
/* Delete all listnode from the list. */
void
pm_list_delete_all_node (struct pm_list *list)
{
struct pm_listnode *node;
struct pm_listnode *next;
assert(list);
for (node = list->head; node; node = next)
{
next = node->next;
if (list->del)
(*list->del) (node->data);
pm_listnode_free (node);
}
list->head = list->tail = NULL;
list->count = 0;
}
/* Delete all listnode then free list itself. */
void
pm_list_delete (struct pm_list *list)
{
assert(list);
pm_list_delete_all_node (list);
pm_list_free (list);
}
/* Lookup the node which has given data. */
struct pm_listnode *
pm_listnode_lookup (struct pm_list *list, void *data)
{
struct pm_listnode *node;
assert(list);
for (node = pm_listhead(list); node; node = pm_listnextnode (node))
if (data == pm_listgetdata (node))
return node;
return NULL;
}
/* Delete the node from list. For ospfd and ospf6d. */
void
pm_list_delete_node (struct pm_list *list, struct pm_listnode *node)
{
if (node->prev)
node->prev->next = node->next;
else
list->head = node->next;
if (node->next)
node->next->prev = node->prev;
else
list->tail = node->prev;
list->count--;
pm_listnode_free (node);
}
/* ospf_spf.c */
void
pm_list_add_node_prev (struct pm_list *list, struct pm_listnode *current, void *val)
{
struct pm_listnode *node;
assert (val != NULL);
node = pm_listnode_new ();
node->next = current;
node->data = val;
if (current->prev == NULL)
list->head = node;
else
current->prev->next = node;
node->prev = current->prev;
current->prev = node;
list->count++;
}
/* ospf_spf.c */
void
pm_list_add_node_next (struct pm_list *list, struct pm_listnode *current, void *val)
{
struct pm_listnode *node;
assert (val != NULL);
node = pm_listnode_new ();
node->prev = current;
node->data = val;
if (current->next == NULL)
list->tail = node;
else
current->next->prev = node;
node->next = current->next;
current->next = node;
list->count++;
}
/* ospf_spf.c */
void
pm_list_add_list (struct pm_list *l, struct pm_list *m)
{
struct pm_listnode *n;
for (n = pm_listhead (m); n; n = pm_listnextnode (n))
pm_listnode_add (l, n->data);
}
|