54 #ifdef UIP_SR_CONF_LINK_NUM 56 #define UIP_SR_LINK_NUM UIP_SR_CONF_LINK_NUM 60 #if ROUTING_CONF_RPL_LITE 61 #define UIP_SR_LINK_NUM NETSTACK_MAX_ROUTE_ENTRIES 62 #elif ROUTING_CONF_RPL_CLASSIC 64 #include "net/routing/rpl-classic/rpl-conf.h" 65 #if RPL_WITH_NON_STORING 66 #define UIP_SR_LINK_NUM NETSTACK_MAX_ROUTE_ENTRIES 68 #define UIP_SR_LINK_NUM 0 73 #define UIP_SR_LINK_NUM 0 80 #ifdef UIP_SR_CONF_REMOVAL_DELAY 81 #define UIP_SR_REMOVAL_DELAY UIP_SR_CONF_REMOVAL_DELAY 83 #define UIP_SR_REMOVAL_DELAY 60 86 #define UIP_SR_INFINITE_LIFETIME 0xFFFFFFFF 99 unsigned char link_identifier[8];
int uip_sr_num_nodes(void)
Tells how many nodes are currently stored in the graph.
static uip_ds6_addr_t * addr
Pointer to a nbr cache entry.
void uip_sr_free_all(void)
Deallocate all neighbors.
void uip_sr_init(void)
Initialize this module.
void uip_sr_expire_parent(void *graph, const uip_ipaddr_t *child, const uip_ipaddr_t *parent)
Expires a given child-parent link.
uip_sr_node_t * uip_sr_node_next(uip_sr_node_t *item)
Returns the next element of the non-storing node list.
void uip_sr_periodic(unsigned seconds)
A function called periodically.
uip_sr_node_t * uip_sr_node_head(void)
Returns the head of the non-storing node list.
uip_sr_node_t * uip_sr_get_node(void *graph, const uip_ipaddr_t *addr)
Looks up for a source routing node from its IPv6 global address.
int uip_sr_link_snprint(char *buf, int buflen, uip_sr_node_t *link)
Print a textual description of a source routing link.
Header file for the uIP TCP/IP stack.
uip_sr_node_t * uip_sr_update_node(void *graph, const uip_ipaddr_t *child, const uip_ipaddr_t *parent, uint32_t lifetime)
Updates a child-parent link.
int uip_sr_is_addr_reachable(void *graph, const uip_ipaddr_t *addr)
Telle whether an address is reachable, i.e.
A node in a source routing graph, stored at the root and representing all child-parent relationship...
struct uip_sr_node uip_sr_node_t
A node in a source routing graph, stored at the root and representing all child-parent relationship...