int
update_neighbor_status(struct neighbor_entry *entry, int lnk)
{
/*
* Update neighbor entry
*/
if(lnk == SYM_LINK)
{
/* N_status is set to SYM */
if(entry->status == NOT_SYM)
{
struct neighbor_2_entry *two_hop_neighbor;
/* Delete posible 2 hop entry on this neighbor */
if((two_hop_neighbor = olsr_lookup_two_hop_neighbor_table(&entry->neighbor_main_addr))!=NULL)
{
olsr_delete_two_hop_neighbor_table(two_hop_neighbor);
}
changes_neighborhood = OLSR_TRUE;
changes_topology = OLSR_TRUE;
if(olsr_cnf->tc_redundancy > 1)
signal_link_changes(OLSR_TRUE);
}
entry->status = SYM;
}
else
{
if(entry->status == SYM)
{
changes_neighborhood = OLSR_TRUE;
changes_topology = OLSR_TRUE;
if(olsr_cnf->tc_redundancy > 1)
signal_link_changes(OLSR_TRUE);
}
/* else N_status is set to NOT_SYM */
entry->status = NOT_SYM;
/* remove neighbor from routing list */
}
return entry->status;
}
/**
*Processes an list of neighbors from an incoming HELLO message.
*@param neighbor the neighbor who sent the message.
*@param message the HELLO message
*@return nada
*/
static void
process_message_neighbors(struct neighbor_entry *neighbor, const struct hello_message *message)
{
struct hello_neighbor *message_neighbors;
for (message_neighbors = message->neighbors; message_neighbors != NULL; message_neighbors = message_neighbors->next) {
union olsr_ip_addr *neigh_addr;
struct neighbor_2_entry *two_hop_neighbor;
/*
*check all interfaces
*so that we don't add ourselves to the
*2 hop list
*IMPORTANT!
*/
if (if_ifwithaddr(&message_neighbors->address) != NULL)
continue;
/* Get the main address */
neigh_addr = mid_lookup_main_addr(&message_neighbors->address);
if (neigh_addr != NULL) {
message_neighbors->address = *neigh_addr;
}
if (((message_neighbors->status == SYM_NEIGH) || (message_neighbors->status == MPR_NEIGH))) {
struct neighbor_2_list_entry *two_hop_neighbor_yet = olsr_lookup_my_neighbors(neighbor, &message_neighbors->address);
if (two_hop_neighbor_yet != NULL) {
/* Updating the holding time for this neighbor */
olsr_set_timer(&two_hop_neighbor_yet->nbr2_list_timer, message->vtime, OLSR_NBR2_LIST_JITTER, OLSR_TIMER_ONESHOT,
&olsr_expire_nbr2_list, two_hop_neighbor_yet, 0);
two_hop_neighbor = two_hop_neighbor_yet->neighbor_2;
/*
* For link quality OLSR, reset the path link quality here.
* The path link quality will be calculated in the second pass, below.
* Keep the saved_path_link_quality for reference.
*/
if (olsr_cnf->lq_level > 0) {
/*
* loop through the one-hop neighbors that see this
* 'two_hop_neighbor'
*/
struct neighbor_list_entry *walker;
for (walker = two_hop_neighbor->neighbor_2_nblist.next; walker != &two_hop_neighbor->neighbor_2_nblist;
walker = walker->next) {
/*
* have we found the one-hop neighbor that sent the
* HELLO message that we're current processing?
*/
if (walker->neighbor == neighbor) {
walker->path_linkcost = LINK_COST_BROKEN;
}
}
}
} else {
two_hop_neighbor = olsr_lookup_two_hop_neighbor_table(&message_neighbors->address);
if (two_hop_neighbor == NULL) {
changes_neighborhood = true;
changes_topology = true;
two_hop_neighbor = olsr_malloc(sizeof(struct neighbor_2_entry), "Process HELLO");
two_hop_neighbor->neighbor_2_nblist.next = &two_hop_neighbor->neighbor_2_nblist;
two_hop_neighbor->neighbor_2_nblist.prev = &two_hop_neighbor->neighbor_2_nblist;
two_hop_neighbor->neighbor_2_pointer = 0;
two_hop_neighbor->neighbor_2_addr = message_neighbors->address;
olsr_insert_two_hop_neighbor_table(two_hop_neighbor);
linking_this_2_entries(neighbor, two_hop_neighbor, message->vtime);
} else {
/*
linking to this two_hop_neighbor entry
*/
changes_neighborhood = true;
changes_topology = true;
linking_this_2_entries(neighbor, two_hop_neighbor, message->vtime);
}
}
}
}
/* Separate, second pass for link quality OLSR */
/* Separate, second and third pass for link quality OLSR */
if (olsr_cnf->lq_level > 0) {
olsr_linkcost first_hop_pathcost;
struct link_entry *lnk = get_best_link_to_neighbor(&neighbor->neighbor_main_addr);
if (!lnk)
return;
/* calculate first hop path quality */
first_hop_pathcost = lnk->linkcost;
/*
* Second pass for link quality OLSR: calculate the best 2-hop
* path costs to all the 2-hop neighbors indicated in the
* HELLO message. Since the same 2-hop neighbor may be listed
* more than once in the same HELLO message (each at a possibly
* different quality) we want to select only the best one, not just
* the last one listed in the HELLO message.
*/
for (message_neighbors = message->neighbors; message_neighbors != NULL; message_neighbors = message_neighbors->next) {
if (if_ifwithaddr(&message_neighbors->address) != NULL)
continue;
if (((message_neighbors->status == SYM_NEIGH) || (message_neighbors->status == MPR_NEIGH))) {
struct neighbor_list_entry *walker;
struct neighbor_2_entry *two_hop_neighbor;
struct neighbor_2_list_entry *two_hop_neighbor_yet = olsr_lookup_my_neighbors(neighbor,
&message_neighbors->address);
if (!two_hop_neighbor_yet)
continue;
two_hop_neighbor = two_hop_neighbor_yet->neighbor_2;
/*
* loop through the one-hop neighbors that see this
* 'two_hop_neighbor'
*/
for (walker = two_hop_neighbor->neighbor_2_nblist.next; walker != &two_hop_neighbor->neighbor_2_nblist;
walker = walker->next) {
/*
* have we found the one-hop neighbor that sent the
* HELLO message that we're current processing?
*/
if (walker->neighbor == neighbor) {
olsr_linkcost new_second_hop_linkcost, new_path_linkcost;
// the link cost between the 1-hop neighbour and the
// 2-hop neighbour
new_second_hop_linkcost = message_neighbors->cost;
// the total cost for the route
// "us --- 1-hop --- 2-hop"
new_path_linkcost = first_hop_pathcost + new_second_hop_linkcost;
// Only copy the link quality if it is better than what we have
// for this 2-hop neighbor
if (new_path_linkcost < walker->path_linkcost) {
walker->second_hop_linkcost = new_second_hop_linkcost;
walker->path_linkcost = new_path_linkcost;
walker->saved_path_linkcost = new_path_linkcost;
changes_neighborhood = true;
changes_topology = true;
}
}
}
}
}
}
}
