3 * The olsr.org Optimized Link-State Routing daemon(olsrd)
4 * Copyright (c) 2004-2009, the olsr.org team - see HISTORY file
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of olsr.org, olsrd nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
29 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
31 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
34 * Visit http://www.olsr.org for more information.
36 * If you find this software useful feel free to make a donation
37 * to the project. For more information see the website or contact
38 * the copyright holders.
44 #include "olsr_types.h"
47 #include "olsr_ip_prefix_list.h"
50 ip_prefix_list_flush(struct list_entity *ip_prefix_head)
52 struct ip_prefix_entry *entry, *iterator;
54 OLSR_FOR_ALL_IPPREFIX_ENTRIES(ip_prefix_head, entry, iterator) {
55 list_remove(&entry->node);
61 ip_prefix_list_add(struct list_entity *ip_prefix_head, const union olsr_ip_addr *net, uint8_t prefix_len)
63 struct ip_prefix_entry *new_entry = olsr_malloc(sizeof(*new_entry), "new ip_prefix");
65 new_entry->net.prefix = *net;
66 new_entry->net.prefix_len = prefix_len;
69 list_add_before(ip_prefix_head, &new_entry->node);
73 ip_prefix_list_remove(struct list_entity *ip_prefix_head, const union olsr_ip_addr *net, uint8_t prefix_len, int ip_version)
75 struct ip_prefix_entry *h, *iterator;
77 OLSR_FOR_ALL_IPPREFIX_ENTRIES(ip_prefix_head, h, iterator) {
78 if (ipcmp(ip_version, net, &h->net.prefix) == 0 && h->net.prefix_len == prefix_len) {
79 list_remove(&h->node);
87 struct ip_prefix_entry *
88 ip_prefix_list_find(struct list_entity *ip_prefix_head, const union olsr_ip_addr *net, uint8_t prefix_len, int ip_version)
90 struct ip_prefix_entry *h, *iterator;
92 OLSR_FOR_ALL_IPPREFIX_ENTRIES(ip_prefix_head, h, iterator) {
93 if (prefix_len == h->net.prefix_len && ipcmp(ip_version, net, &h->net.prefix) == 0) {