Skip to content

Commit

Permalink
tipc: eliminate race during node creation
Browse files Browse the repository at this point in the history
Instances of struct node are created in the function tipc_disc_rcv()
under the assumption that there is no race between received discovery
messages arriving from the same node. This assumption is wrong.
When we use more than one bearer, it is possible that discovery
messages from the same node arrive at the same moment, resulting in
creation of two instances of struct tipc_node. This may later cause
confusion during link establishment, and may result in one of the links
never becoming activated.

We fix this by making lookup and potential creation of nodes atomic.
Instead of first looking up the node, and in case of failure, create it,
we now start with looking up the node inside node_link_create(), and
return a reference to that one if found. Otherwise, we go ahead and
create the node as we did before.

Reviewed-by: Erik Hugne <[email protected]>
Reviewed-by: Ying Xue <[email protected]>
Signed-off-by: Jon Maloy <[email protected]>
Signed-off-by: David S. Miller <[email protected]>
  • Loading branch information
Jon Paul Maloy authored and davem330 committed Feb 5, 2015
1 parent 7d24dcd commit b45db71
Show file tree
Hide file tree
Showing 2 changed files with 7 additions and 13 deletions.
9 changes: 2 additions & 7 deletions net/tipc/discover.c
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
/*
* net/tipc/discover.c
*
* Copyright (c) 2003-2006, 2014, Ericsson AB
* Copyright (c) 2003-2006, 2014-2015, Ericsson AB
* Copyright (c) 2005-2006, 2010-2011, Wind River Systems
* All rights reserved.
*
Expand Down Expand Up @@ -47,7 +47,6 @@
/* indicates no timer in use */
#define TIPC_LINK_REQ_INACTIVE 0xffffffff


/**
* struct tipc_link_req - information about an ongoing link setup request
* @bearer_id: identity of bearer issuing requests
Expand Down Expand Up @@ -163,13 +162,9 @@ void tipc_disc_rcv(struct net *net, struct sk_buff *buf,
if (!tipc_in_scope(bearer->domain, onode))
return;

/* Locate, or if necessary, create, node: */
node = tipc_node_find(net, onode);
if (!node)
node = tipc_node_create(net, onode);
node = tipc_node_create(net, onode);
if (!node)
return;

tipc_node_lock(node);
link = node->links[bearer->identity];

Expand Down
11 changes: 5 additions & 6 deletions net/tipc/node.c
Original file line number Diff line number Diff line change
Expand Up @@ -96,14 +96,14 @@ struct tipc_node *tipc_node_create(struct net *net, u32 addr)
struct tipc_node *n_ptr, *temp_node;

spin_lock_bh(&tn->node_list_lock);

n_ptr = tipc_node_find(net, addr);
if (n_ptr)
goto exit;
n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
if (!n_ptr) {
spin_unlock_bh(&tn->node_list_lock);
pr_warn("Node creation failed, no memory\n");
return NULL;
goto exit;
}

n_ptr->addr = addr;
n_ptr->net = net;
spin_lock_init(&n_ptr->lock);
Expand All @@ -123,9 +123,8 @@ struct tipc_node *tipc_node_create(struct net *net, u32 addr)
list_add_tail_rcu(&n_ptr->list, &temp_node->list);
n_ptr->action_flags = TIPC_WAIT_PEER_LINKS_DOWN;
n_ptr->signature = INVALID_NODE_SIG;

tn->num_nodes++;

exit:
spin_unlock_bh(&tn->node_list_lock);
return n_ptr;
}
Expand Down

0 comments on commit b45db71

Please sign in to comment.