node.h File Reference

#include "node_subscr.h"
#include "addr.h"
#include "net.h"
#include "bearer.h"

Go to the source code of this file.

Data Structures
struct	tipc_node

Macros
#define	INVALID_NODE_SIG   0x10000
#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 */

Functions
struct tipc_node *	tipc_node_find (u32 addr)
struct tipc_node *	tipc_node_create (u32 addr)
void	tipc_node_delete (struct tipc_node *n_ptr)
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)
int	tipc_node_active_links (struct tipc_node *n_ptr)
int	tipc_node_redundant_links (struct tipc_node *n_ptr)
int	tipc_node_is_up (struct tipc_node *n_ptr)
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)

Variables
struct list_head	tipc_node_list

Macro Definition Documentation

#define INVALID_NODE_SIG   0x10000

Definition at line 48 of file node.h.

#define WAIT_NAMES_GONE   0x0002 /* wait for peer's publications to be purged */

Definition at line 52 of file node.h.

#define WAIT_NODE_DOWN   0x0004 /* wait until peer node is declared down */

Definition at line 53 of file node.h.

#define WAIT_PEER_DOWN   0x0001 /* wait to see that peer's links are down */

Definition at line 51 of file node.h.

Function Documentation

int tipc_node_active_links

(

struct tipc_node *

n_ptr

)

Definition at line 234 of file node.c.

void tipc_node_attach_link	(	struct tipc_node *	n_ptr,
		struct tipc_link *	l_ptr
	)

Definition at line 249 of file node.c.

struct tipc_node* tipc_node_create ( u32  addr )

read

tipc_node_create - create neighboring node

Currently, this routine is called by neighbor discovery code, which holds net_lock for reading only. We must take node_create_lock to ensure a node isn't created twice if two different bearers discover the node at the same time. (It would be preferable to switch to holding net_lock in write mode, but this is a non-trivial change.)

Definition at line 93 of file node.c.

void tipc_node_delete

(

struct tipc_node *

n_ptr

)

Definition at line 134 of file node.c.

void tipc_node_detach_link	(	struct tipc_node *	n_ptr,
		struct tipc_link *	l_ptr
	)

Definition at line 256 of file node.c.

struct tipc_node* tipc_node_find ( u32  addr )

read

Definition at line 69 of file node.c.

struct sk_buff* tipc_node_get_links ( const void *  req_tlv_area, int  req_tlv_space  )

read

Definition at line 383 of file node.c.

struct sk_buff* tipc_node_get_nodes ( const void *  req_tlv_area, int  req_tlv_space  )

read

Definition at line 334 of file node.c.

int tipc_node_is_up

(

struct tipc_node *

n_ptr

)

Definition at line 244 of file node.c.

void tipc_node_link_down	(	struct tipc_node *	n_ptr,
		struct tipc_link *	l_ptr
	)

tipc_node_link_down - handle loss of link

Definition at line 207 of file node.c.

void tipc_node_link_up	(	struct tipc_node *	n_ptr,
		struct tipc_link *	l_ptr
	)

tipc_node_link_up - handle addition of link

Link becomes active (alone or shared) or standby, depending on its priority.

Definition at line 148 of file node.c.

int tipc_node_redundant_links

(

struct tipc_node *

n_ptr

)

Definition at line 239 of file node.c.

Variable Documentation

struct list_head tipc_node_list