c239d4b228
- Major release - Completely replace active/standby clustering with a new peer-to-peer clustering method which allows much greater throughput and is a lot more fault tolerant - Add internal tbf implementation for throttling without relying on tc and kernel HTB - Add support for iBGP and eBGP to advertise routes - Add cli commands "show cluster", "show bgp", "show ipcache", "show throttle", "show tbf", "suspend bgp", "restart bgp", "show user" - Interception destination must be set per-user - If SMP machine, allow use of SCHED_FIFO, which should improve performance - Added config option to send GARP at startup - Added plugin_become_master and plugin_new_session_master plugin hooks - Remove useless sessionsendarp(). This isn't needed now that we are using TUN instead of TAP. - ICMP rate limiting so not every unreachable packet is replied with an ICMP unreachable message - mangle table is not required on anything but the cluster master, so slaves will drop the mangle table and attempt to unload the ip_conntrack module - Statically assigned IP addresses (by Radius) work now - Add -d command-line flag to detach and become a daemon - Configuration file is now "/etc/l2tpns/startup-config" - Reduced MIN_IP_SIZE to 0x19 to stop a pile of Short IP warnings - Resend initial IPCP request until it's acknowleged by the client - Better radius session cleanup logic - Many miscellaenous bugfixes and performance enhancements - Thanks to Michael O'Reilly and Brendan O'Dea for most of these new features
28 lines
568 B
C
28 lines
568 B
C
#ifndef __LL_H__
|
|
#define __LL_H__
|
|
|
|
typedef struct s_li
|
|
{
|
|
void *data;
|
|
struct s_li *next;
|
|
} li;
|
|
|
|
typedef struct s_ll
|
|
{
|
|
li *head;
|
|
li *end;
|
|
li *current;
|
|
} linked_list;
|
|
|
|
linked_list *ll_init();
|
|
void ll_done(linked_list *l);
|
|
li *ll_push(linked_list *l, void *data);
|
|
void ll_delete(linked_list *l, void *data);
|
|
void *ll_pop(linked_list *l);
|
|
void ll_iterate(linked_list *l, int(*func)(void *));
|
|
void ll_reset(linked_list *l);
|
|
void *ll_next(linked_list *l);
|
|
int ll_size(linked_list *l);
|
|
int ll_contains(linked_list *l, void *search);
|
|
|
|
#endif /* __LL_H__ */
|