2 * The olsr.org Optimized Link-State Routing daemon(olsrd)
3 * Copyright (c) 2004, Andreas Tønnesen(andreto@olsr.org)
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * * Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * * Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided with the
16 * * Neither the name of olsr.org, olsrd nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
28 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
30 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
33 * Visit http://www.olsr.org for more information.
35 * If you find this software useful feel free to make a donation
36 * to the project. For more information see the website or contact
37 * the copyright holders.
39 * $Id: two_hop_neighbor_table.h,v 1.11 2004/12/04 17:06:57 tlopatic Exp $
43 #ifndef _OLSR_TWO_HOP_TABLE
44 #define _OLSR_TWO_HOP_TABLE
49 #define NB2S_COVERED 0x1 /* node has been covered by a MPR */
52 struct neighbor_list_entry
54 struct neighbor_entry *neighbor;
55 double path_link_quality;
56 double saved_path_link_quality;
57 struct neighbor_list_entry *next;
58 struct neighbor_list_entry *prev;
62 struct neighbor_2_entry
64 union olsr_ip_addr neighbor_2_addr;
65 olsr_u8_t mpr_covered_count; /*used in mpr calculation*/
66 olsr_u8_t processed; /*used in mpr calculation*/
67 olsr_16_t neighbor_2_pointer; /* Neighbor count */
68 struct neighbor_list_entry neighbor_2_nblist;
69 struct neighbor_2_entry *prev;
70 struct neighbor_2_entry *next;
73 struct neighbor_2_entry two_hop_neighbortable[HASHSIZE];
77 olsr_init_two_hop_table(void);
80 olsr_delete_neighbor_pointer(struct neighbor_2_entry *, union olsr_ip_addr *);
83 olsr_delete_two_hop_neighbor_table(struct neighbor_2_entry *);
86 olsr_insert_two_hop_neighbor_table(struct neighbor_2_entry *);
88 struct neighbor_2_entry *
89 olsr_lookup_two_hop_neighbor_table(union olsr_ip_addr *);
91 struct neighbor_2_entry *
92 olsr_lookup_two_hop_neighbor_table_mid(union olsr_ip_addr *);
95 olsr_print_two_hop_neighbor_table(void);