2006-01-02 11:04:38 -07:00
|
|
|
/*
|
|
|
|
|
* net/tipc/node.h: Include file for TIPC node management routines
|
2007-02-09 07:25:21 -07:00
|
|
|
*
|
2006-01-11 11:14:19 -07:00
|
|
|
* Copyright (c) 2000-2006, Ericsson AB
|
2011-02-25 16:42:52 -07:00
|
|
|
* Copyright (c) 2005, 2010-2011, Wind River Systems
|
2006-01-02 11:04:38 -07:00
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
2006-01-11 05:30:43 -07:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
2006-01-02 11:04:38 -07:00
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
|
*
|
2006-01-11 05:30:43 -07:00
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. Neither the names of the copyright holders nor the names of its
|
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
|
* this software without specific prior written permission.
|
2006-01-02 11:04:38 -07:00
|
|
|
*
|
2006-01-11 05:30:43 -07:00
|
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
|
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
|
|
|
* Software Foundation.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
2006-01-02 11:04:38 -07:00
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _TIPC_NODE_H
|
|
|
|
|
#define _TIPC_NODE_H
|
|
|
|
|
|
|
|
|
|
#include "node_subscr.h"
|
2010-12-31 11:59:19 -07:00
|
|
|
#include "addr.h"
|
|
|
|
|
#include "net.h"
|
2006-01-02 11:04:38 -07:00
|
|
|
#include "bearer.h"
|
|
|
|
|
|
tipc: Ensure both nodes recognize loss of contact between them
Enhances TIPC to ensure that a node that loses contact with a
neighboring node does not allow contact to be re-established until
it sees that its peer has also recognized the loss of contact.
Previously, nodes that were connected by two or more links could
encounter a situation in which node A would lose contact with node B
on all of its links, purge its name table of names published by B,
and then fail to repopulate those names once contact with B was restored.
This would happen because B was able to re-establish one or more links
so quickly that it never reached a point where it had no links to A --
meaning that B never saw a loss of contact with A, and consequently
didn't re-publish its names to A.
This problem is now prevented by enhancing the cleanup done by TIPC
following a loss of contact with a neighboring node to ensure that
node A ignores all messages sent by B until it receives a LINK_PROTOCOL
message that indicates B has lost contact with A, thereby preventing
the (re)establishment of links between the nodes. The loss of contact
is recognized when a RESET or ACTIVATE message is received that has
a "redundant link exists" field of 0, indicating that B's sending link
endpoint is in a reset state and that B has no other working links.
Additionally, TIPC now suppresses the sending of (most) link protocol
messages to a neighboring node while it is cleaning up after an earlier
loss of contact with that node. This stops the peer node from prematurely
activating its link endpoint, which would prevent TIPC from later
activating its own end. TIPC still allows outgoing RESET messages to
occur during cleanup, to avoid problems if its own node recognizes
the loss of contact first and tries to notify the peer of the situation.
Finally, TIPC now recognizes an impending loss of contact with a peer node
as soon as it receives a RESET message on a working link that is the
peer's only link to the node, and ensures that the link protocol
suppression mentioned above goes into effect right away -- that is,
even before its own link endpoints have failed. This is necessary to
ensure correct operation when there are redundant links between the nodes,
since otherwise TIPC would send an ACTIVATE message upon receiving a RESET
on its first link and only begin suppressing when a RESET on its second
link was received, instead of initiating suppression with the first RESET
message as it needs to.
Note: The reworked cleanup code also eliminates a check that prevented
a link endpoint's discovery object from responding to incoming messages
while stale name table entries are being purged. This check is now
unnecessary and would have slowed down re-establishment of communication
between the nodes in some situations.
Signed-off-by: Allan Stephens <allan.stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
2011-05-27 09:00:51 -06:00
|
|
|
/* Flags used to block (re)establishment of contact with a neighboring node */
|
|
|
|
|
|
|
|
|
|
#define WAIT_PEER_DOWN 0x0001 /* wait to see that peer's links are down */
|
|
|
|
|
#define WAIT_NAMES_GONE 0x0002 /* wait for peer's publications to be purged */
|
|
|
|
|
#define WAIT_NODE_DOWN 0x0004 /* wait until peer node is declared down */
|
|
|
|
|
|
2006-01-02 11:04:38 -07:00
|
|
|
/**
|
2008-09-03 00:38:32 -06:00
|
|
|
* struct tipc_node - TIPC node structure
|
2006-01-02 11:04:38 -07:00
|
|
|
* @addr: network address of node
|
|
|
|
|
* @lock: spinlock governing access to structure
|
2011-02-25 16:42:52 -07:00
|
|
|
* @hash: links to adjacent nodes in unsorted hash chain
|
|
|
|
|
* @list: links to adjacent nodes in sorted list of cluster's nodes
|
2006-01-02 11:04:38 -07:00
|
|
|
* @nsub: list of "node down" subscriptions monitoring node
|
|
|
|
|
* @active_links: pointers to active links to node
|
|
|
|
|
* @links: pointers to all links to node
|
2006-06-26 00:52:50 -06:00
|
|
|
* @working_links: number of working links to node (both active and standby)
|
tipc: Ensure both nodes recognize loss of contact between them
Enhances TIPC to ensure that a node that loses contact with a
neighboring node does not allow contact to be re-established until
it sees that its peer has also recognized the loss of contact.
Previously, nodes that were connected by two or more links could
encounter a situation in which node A would lose contact with node B
on all of its links, purge its name table of names published by B,
and then fail to repopulate those names once contact with B was restored.
This would happen because B was able to re-establish one or more links
so quickly that it never reached a point where it had no links to A --
meaning that B never saw a loss of contact with A, and consequently
didn't re-publish its names to A.
This problem is now prevented by enhancing the cleanup done by TIPC
following a loss of contact with a neighboring node to ensure that
node A ignores all messages sent by B until it receives a LINK_PROTOCOL
message that indicates B has lost contact with A, thereby preventing
the (re)establishment of links between the nodes. The loss of contact
is recognized when a RESET or ACTIVATE message is received that has
a "redundant link exists" field of 0, indicating that B's sending link
endpoint is in a reset state and that B has no other working links.
Additionally, TIPC now suppresses the sending of (most) link protocol
messages to a neighboring node while it is cleaning up after an earlier
loss of contact with that node. This stops the peer node from prematurely
activating its link endpoint, which would prevent TIPC from later
activating its own end. TIPC still allows outgoing RESET messages to
occur during cleanup, to avoid problems if its own node recognizes
the loss of contact first and tries to notify the peer of the situation.
Finally, TIPC now recognizes an impending loss of contact with a peer node
as soon as it receives a RESET message on a working link that is the
peer's only link to the node, and ensures that the link protocol
suppression mentioned above goes into effect right away -- that is,
even before its own link endpoints have failed. This is necessary to
ensure correct operation when there are redundant links between the nodes,
since otherwise TIPC would send an ACTIVATE message upon receiving a RESET
on its first link and only begin suppressing when a RESET on its second
link was received, instead of initiating suppression with the first RESET
message as it needs to.
Note: The reworked cleanup code also eliminates a check that prevented
a link endpoint's discovery object from responding to incoming messages
while stale name table entries are being purged. This check is now
unnecessary and would have slowed down re-establishment of communication
between the nodes in some situations.
Signed-off-by: Allan Stephens <allan.stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
2011-05-27 09:00:51 -06:00
|
|
|
* @block_setup: bit mask of conditions preventing link establishment to node
|
2006-01-02 11:04:38 -07:00
|
|
|
* @link_cnt: number of links to node
|
|
|
|
|
* @permit_changeover: non-zero if node has redundant links to this system
|
|
|
|
|
* @bclink: broadcast-related info
|
2011-10-25 13:14:46 -06:00
|
|
|
* @supportable: non-zero if node supports TIPC b'cast link capability
|
2006-01-02 11:04:38 -07:00
|
|
|
* @supported: non-zero if node supports TIPC b'cast capability
|
|
|
|
|
* @acked: sequence # of last outbound b'cast message acknowledged by node
|
|
|
|
|
* @last_in: sequence # of last in-sequence b'cast message received from node
|
|
|
|
|
* @gap_after: sequence # of last message not requiring a NAK request
|
|
|
|
|
* @gap_to: sequence # of last message requiring a NAK request
|
|
|
|
|
* @nack_sync: counter that determines when NAK requests should be sent
|
|
|
|
|
* @deferred_head: oldest OOS b'cast message received from node
|
|
|
|
|
* @deferred_tail: newest OOS b'cast message received from node
|
|
|
|
|
* @defragm: list of partially reassembled b'cast message fragments from node
|
|
|
|
|
*/
|
2007-02-09 07:25:21 -07:00
|
|
|
|
2008-09-03 00:38:32 -06:00
|
|
|
struct tipc_node {
|
2006-01-02 11:04:38 -07:00
|
|
|
u32 addr;
|
|
|
|
|
spinlock_t lock;
|
2011-02-25 16:42:52 -07:00
|
|
|
struct hlist_node hash;
|
|
|
|
|
struct list_head list;
|
2006-01-02 11:04:38 -07:00
|
|
|
struct list_head nsub;
|
2011-12-29 18:58:42 -07:00
|
|
|
struct tipc_link *active_links[2];
|
|
|
|
|
struct tipc_link *links[MAX_BEARERS];
|
2006-01-02 11:04:38 -07:00
|
|
|
int link_cnt;
|
2006-06-26 00:52:50 -06:00
|
|
|
int working_links;
|
tipc: Ensure both nodes recognize loss of contact between them
Enhances TIPC to ensure that a node that loses contact with a
neighboring node does not allow contact to be re-established until
it sees that its peer has also recognized the loss of contact.
Previously, nodes that were connected by two or more links could
encounter a situation in which node A would lose contact with node B
on all of its links, purge its name table of names published by B,
and then fail to repopulate those names once contact with B was restored.
This would happen because B was able to re-establish one or more links
so quickly that it never reached a point where it had no links to A --
meaning that B never saw a loss of contact with A, and consequently
didn't re-publish its names to A.
This problem is now prevented by enhancing the cleanup done by TIPC
following a loss of contact with a neighboring node to ensure that
node A ignores all messages sent by B until it receives a LINK_PROTOCOL
message that indicates B has lost contact with A, thereby preventing
the (re)establishment of links between the nodes. The loss of contact
is recognized when a RESET or ACTIVATE message is received that has
a "redundant link exists" field of 0, indicating that B's sending link
endpoint is in a reset state and that B has no other working links.
Additionally, TIPC now suppresses the sending of (most) link protocol
messages to a neighboring node while it is cleaning up after an earlier
loss of contact with that node. This stops the peer node from prematurely
activating its link endpoint, which would prevent TIPC from later
activating its own end. TIPC still allows outgoing RESET messages to
occur during cleanup, to avoid problems if its own node recognizes
the loss of contact first and tries to notify the peer of the situation.
Finally, TIPC now recognizes an impending loss of contact with a peer node
as soon as it receives a RESET message on a working link that is the
peer's only link to the node, and ensures that the link protocol
suppression mentioned above goes into effect right away -- that is,
even before its own link endpoints have failed. This is necessary to
ensure correct operation when there are redundant links between the nodes,
since otherwise TIPC would send an ACTIVATE message upon receiving a RESET
on its first link and only begin suppressing when a RESET on its second
link was received, instead of initiating suppression with the first RESET
message as it needs to.
Note: The reworked cleanup code also eliminates a check that prevented
a link endpoint's discovery object from responding to incoming messages
while stale name table entries are being purged. This check is now
unnecessary and would have slowed down re-establishment of communication
between the nodes in some situations.
Signed-off-by: Allan Stephens <allan.stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
2011-05-27 09:00:51 -06:00
|
|
|
int block_setup;
|
2006-01-02 11:04:38 -07:00
|
|
|
int permit_changeover;
|
|
|
|
|
struct {
|
2011-10-25 13:14:46 -06:00
|
|
|
u8 supportable;
|
|
|
|
|
u8 supported;
|
2006-01-02 11:04:38 -07:00
|
|
|
u32 acked;
|
|
|
|
|
u32 last_in;
|
2007-02-09 07:25:21 -07:00
|
|
|
u32 gap_after;
|
|
|
|
|
u32 gap_to;
|
2006-01-02 11:04:38 -07:00
|
|
|
u32 nack_sync;
|
|
|
|
|
struct sk_buff *deferred_head;
|
|
|
|
|
struct sk_buff *deferred_tail;
|
|
|
|
|
struct sk_buff *defragm;
|
|
|
|
|
} bclink;
|
|
|
|
|
};
|
|
|
|
|
|
2011-02-25 16:42:52 -07:00
|
|
|
#define NODE_HTABLE_SIZE 512
|
|
|
|
|
extern struct list_head tipc_node_list;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* A trivial power-of-two bitmask technique is used for speed, since this
|
|
|
|
|
* operation is done for every incoming TIPC packet. The number of hash table
|
|
|
|
|
* entries has been chosen so that no hash chain exceeds 8 nodes and will
|
|
|
|
|
* usually be much smaller (typically only a single node).
|
|
|
|
|
*/
|
|
|
|
|
static inline unsigned int tipc_hashfn(u32 addr)
|
|
|
|
|
{
|
|
|
|
|
return addr & (NODE_HTABLE_SIZE - 1);
|
|
|
|
|
}
|
|
|
|
|
|
2006-01-02 11:04:38 -07:00
|
|
|
extern u32 tipc_own_tag;
|
|
|
|
|
|
2011-02-25 16:42:52 -07:00
|
|
|
struct tipc_node *tipc_node_find(u32 addr);
|
2008-09-03 00:38:32 -06:00
|
|
|
struct tipc_node *tipc_node_create(u32 addr);
|
|
|
|
|
void tipc_node_delete(struct tipc_node *n_ptr);
|
2011-12-29 18:58:42 -07:00
|
|
|
void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
|
|
|
|
|
void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
|
|
|
|
|
void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
|
|
|
|
|
void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
|
2011-02-28 08:36:21 -07:00
|
|
|
int tipc_node_active_links(struct tipc_node *n_ptr);
|
|
|
|
|
int tipc_node_redundant_links(struct tipc_node *n_ptr);
|
2008-09-03 00:38:32 -06:00
|
|
|
int tipc_node_is_up(struct tipc_node *n_ptr);
|
2006-01-17 16:38:21 -07:00
|
|
|
struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space);
|
|
|
|
|
struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space);
|
2006-01-02 11:04:38 -07:00
|
|
|
|
2008-09-03 00:38:32 -06:00
|
|
|
static inline void tipc_node_lock(struct tipc_node *n_ptr)
|
2006-01-02 11:04:38 -07:00
|
|
|
{
|
|
|
|
|
spin_lock_bh(&n_ptr->lock);
|
|
|
|
|
}
|
|
|
|
|
|
2008-09-03 00:38:32 -06:00
|
|
|
static inline void tipc_node_unlock(struct tipc_node *n_ptr)
|
2006-01-02 11:04:38 -07:00
|
|
|
{
|
|
|
|
|
spin_unlock_bh(&n_ptr->lock);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif
|
