+
/*
- * OLSR ad-hoc routing table management protocol
- * Copyright (C) 2003 Andreas Tønnesen (andreto@ifi.uio.no)
+ * The olsr.org Optimized Link-State Routing daemon(olsrd)
+ * Copyright (c) 2004, Andreas Tonnesen(andreto@olsr.org)
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
*
- * This file is part of the olsr.org OLSR daemon.
+ * * Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * * Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in
+ * the documentation and/or other materials provided with the
+ * distribution.
+ * * Neither the name of olsr.org, olsrd nor the names of its
+ * contributors may be used to endorse or promote products derived
+ * from this software without specific prior written permission.
*
- * olsr.org 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 of the License, or
- * (at your option) any later version.
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+ * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
*
- * olsr.org 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.
+ * Visit http://www.olsr.org for more information.
*
- * You should have received a copy of the GNU General Public License
- * along with olsr.org; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
- *
- *
- * $Id: hna_set.h,v 1.7 2004/10/18 13:13:36 kattemat Exp $
+ * If you find this software useful feel free to make a donation
+ * to the project. For more information see the website or contact
+ * the copyright holders.
*
*/
-
-
#ifndef _OLSR_HNA
#define _OLSR_HNA
#include "hashing.h"
-#include "packet.h"
+#include "olsr_types.h"
+#include "olsr_protocol.h"
+#include "mantissa.h"
+
+#include <time.h>
/* hna_netmask declared in packet.h */
-struct hna_net
-{
- union olsr_ip_addr A_network_addr;
- union hna_netmask A_netmask;
- struct timeval A_time;
- struct hna_net *next;
- struct hna_net *prev;
+struct hna_net {
+ struct olsr_ip_prefix hna_prefix;
+ struct timer_entry *hna_net_timer;
+ struct hna_entry *hna_gw; /* backpointer to the owning HNA entry */
+ struct hna_net *next;
+ struct hna_net *prev;
};
-struct hna_entry
-{
+#define OLSR_HNA_NET_JITTER 5 /* percent */
+
+struct hna_entry {
union olsr_ip_addr A_gateway_addr;
- struct hna_net networks;
- struct hna_entry *next;
- struct hna_entry *prev;
+ struct hna_net networks;
+ struct hna_entry *next;
+ struct hna_entry *prev;
};
-struct hna_entry hna_set[HASHSIZE];
-size_t netmask_size;
-
-int
-olsr_init_hna_set(void);
-
-
-struct hna_net *
-olsr_lookup_hna_net(struct hna_net *, union olsr_ip_addr *, union hna_netmask *);
-
+#define OLSR_FOR_ALL_HNA_ENTRIES(hna) \
+{ \
+ int _idx; \
+ for (_idx = 0; _idx < HASHSIZE; _idx++) { \
+ struct hna_entry *_next; \
+ for(hna = hna_set[_idx].next; \
+ hna != &hna_set[_idx]; \
+ hna = _next) { \
+ _next = hna->next;
+#define OLSR_FOR_ALL_HNA_ENTRIES_END(hna) }}}
-struct hna_entry *
-olsr_lookup_hna_gw(union olsr_ip_addr *);
+extern struct hna_entry hna_set[HASHSIZE];
+int olsr_init_hna_set(void);
+void olsr_cleanup_hna(union olsr_ip_addr *orig);
+struct hna_net *olsr_lookup_hna_net(const struct hna_net *, const union olsr_ip_addr *, uint8_t);
-struct hna_entry *
-olsr_add_hna_entry(union olsr_ip_addr *);
+struct hna_entry *olsr_lookup_hna_gw(const union olsr_ip_addr *);
+struct hna_entry *olsr_add_hna_entry(const union olsr_ip_addr *);
-struct hna_net *
-olsr_add_hna_net(struct hna_entry *, union olsr_ip_addr *, union hna_netmask *);
+struct hna_net *olsr_add_hna_net(struct hna_entry *, const union olsr_ip_addr *, uint8_t);
+void olsr_update_hna_entry(const union olsr_ip_addr *, const union olsr_ip_addr *, uint8_t, olsr_reltime);
-void
-olsr_update_hna_entry(union olsr_ip_addr *, union olsr_ip_addr *, union hna_netmask *, float);
-
-
-void
-olsr_time_out_hna_set(void *);
-
-
-void
-delete_hna_net(struct hna_net *);
-
+#ifndef NODEBUG
+void olsr_print_hna_set(void);
+#else
+#define olsr_print_hna_set() do { } while(0)
+#endif
-void
-delete_hna_entry(struct hna_entry *);
+bool olsr_input_hna(union olsr_message *, struct interface *, union olsr_ip_addr *);
+#endif /* _OLSR_HNA */
-#endif
+/*
+ * Local Variables:
+ * c-basic-offset: 2
+ * indent-tabs-mode: nil
+ * End:
+ */