47 #include "net/routing/rpl-classic/rpl-private.h" 48 #include "net/nbr-table.h" 54 #define LOG_MODULE "RPL" 55 #define LOG_LEVEL LOG_LEVEL_RPL 67 #define MAX_CHILDREN (NBR_TABLE_MAX_NEIGHBORS - 2) 68 #define UIP_IP_BUF ((struct uip_ip_hdr *)&uip_buf[UIP_LLH_LEN]) 70 static int num_parents;
71 static int num_children;
73 static linkaddr_t *worst_rank_nbr;
74 static rpl_rank_t worst_rank;
81 static void update_nbr(
void);
82 static struct ctimer periodic_timer;
83 static int timer_init = 0;
85 handle_periodic_timer(
void *ptr)
105 &handle_periodic_timer, NULL);
110 worst_rank_nbr = NULL;
115 nbr = nbr_table_head(ds6_neighbors);
117 linkaddr_t *lladdr = nbr_table_get_lladdr(ds6_neighbors, nbr);
125 if(uip_ds6_route_is_nexthop(&nbr->ipaddr) != 0) {
130 parent = rpl_get_parent((uip_lladdr_t *)lladdr);
134 if(parent->dag != NULL && parent->dag->preferred_parent == parent) {
139 }
else if(is_used == 0 && worst_rank < RPL_INFINITE_RANK &&
141 parent->dag != NULL &&
142 parent->dag->instance != NULL &&
143 (rank = parent->dag->instance->of->rank_via_parent(parent)) > worst_rank) {
146 worst_rank_nbr = lladdr;
154 worst_rank_nbr = lladdr;
155 worst_rank = RPL_INFINITE_RANK;
156 }
else if(is_used > 1) {
157 LOG_DBG(
"nbr-policy: *** neighbor is both child and candidate parent: ");
158 LOG_DBG_LLADDR(lladdr);
162 nbr = nbr_table_next(ds6_neighbors, nbr);
166 num_free = NBR_TABLE_MAX_NEIGHBORS - num_used;
168 LOG_DBG(
"nbr-policy: free: %d, children: %d, parents: %d routes: %d\n",
169 num_free, num_children, num_parents, uip_ds6_route_num_routes());
175 find_removable_dis(uip_ipaddr_t *from)
182 LOG_DBG(
"nbr-policy: num-free > 0 = %d - Other for RPL/ND6 unused NBR entry exists.\n",
185 if(num_children < MAX_CHILDREN) {
186 return worst_rank_nbr;
192 find_removable_dio(uip_ipaddr_t *from, rpl_dio_t *dio)
198 instance = rpl_get_instance(dio->instance_id);
199 if(instance == NULL || instance->current_dag == NULL) {
200 LOG_WARN(
"nbr-policy: did not find instance id: %d\n", dio->instance_id);
205 if(dio->rank + instance->min_hoprankinc < worst_rank - instance->min_hoprankinc / 2) {
207 LOG_DBG(
"nbr-policy: DIO rank %u, worst_rank %u -- add to cache\n",
208 dio->rank, worst_rank);
210 return worst_rank_nbr;
213 LOG_DBG(
"nbr-policy: DIO rank %u, worst_rank %u -- do not add to cache\n",
214 dio->rank, worst_rank);
221 int max = MAX_CHILDREN;
224 if(instance != NULL) {
226 if(instance->current_dag->rank ==
ROOT_RANK(instance)) {
227 max = NBR_TABLE_MAX_NEIGHBORS;
233 if(num_children >= max) {
234 LOG_ERR(
"nbr-policy: can not add another child - already at max.\n");
238 return worst_rank_nbr;
242 rpl_nbr_policy_find_removable(nbr_table_reason_t reason,
void * data)
247 case NBR_TABLE_REASON_RPL_DIO:
248 return find_removable_dio(&
UIP_IP_BUF->srcipaddr, data);
249 case NBR_TABLE_REASON_RPL_DAO:
250 return find_removable_dao(&
UIP_IP_BUF->srcipaddr, data);
251 case NBR_TABLE_REASON_RPL_DIS:
252 return find_removable_dis(&
UIP_IP_BUF->srcipaddr);
#define UIP_IP_BUF
Pointer to IP header.
static uip_ds6_nbr_t * nbr
Pointer to llao option in uip_buf.
#define ROOT_RANK
Rank of a root node.
IPv6 Neighbor cache (link-layer/IPv6 address mapping)
#define CLOCK_SECOND
A second, measured in system clock time.
void ctimer_set(struct ctimer *c, clock_time_t t, void(*f)(void *), void *ptr)
Set a callback timer.
void ctimer_restart(struct ctimer *c)
Restart a callback timer from the current point in time.
Header file for routing table manipulation.
Header file for the logging system
An entry in the nbr cache.