9ea1fd3c1a
The license header in each file now more clearly state that this code is licensed under a dual BSD/GPL. Before this was only evident if you looked at the MODULE_LICENSE line in core.c. Signed-off-by: Per Liden <per.liden@nospam.ericsson.com>
145 lines
5.2 KiB
C
145 lines
5.2 KiB
C
/*
|
|
* net/tipc/node.h: Include file for TIPC node management routines
|
|
*
|
|
* Copyright (c) 2003-2005, Ericsson Research Canada
|
|
* Copyright (c) 2005, Wind River Systems
|
|
* Copyright (c) 2005-2006, Ericsson AB
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 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.
|
|
*
|
|
* 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
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _TIPC_NODE_H
|
|
#define _TIPC_NODE_H
|
|
|
|
#include "node_subscr.h"
|
|
#include "addr.h"
|
|
#include "cluster.h"
|
|
#include "bearer.h"
|
|
|
|
/**
|
|
* struct node - TIPC node structure
|
|
* @addr: network address of node
|
|
* @lock: spinlock governing access to structure
|
|
* @owner: pointer to cluster that node belongs to
|
|
* @next: pointer to next node in sorted list of cluster's nodes
|
|
* @nsub: list of "node down" subscriptions monitoring node
|
|
* @active_links: pointers to active links to node
|
|
* @links: pointers to all links to node
|
|
* @link_cnt: number of links to node
|
|
* @permit_changeover: non-zero if node has redundant links to this system
|
|
* @routers: bitmap (used for multicluster communication)
|
|
* @last_router: (used for multicluster communication)
|
|
* @bclink: broadcast-related info
|
|
* @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
|
|
*/
|
|
|
|
struct node {
|
|
u32 addr;
|
|
spinlock_t lock;
|
|
struct cluster *owner;
|
|
struct node *next;
|
|
struct list_head nsub;
|
|
struct link *active_links[2];
|
|
struct link *links[MAX_BEARERS];
|
|
int link_cnt;
|
|
int permit_changeover;
|
|
u32 routers[512/32];
|
|
int last_router;
|
|
struct {
|
|
int supported;
|
|
u32 acked;
|
|
u32 last_in;
|
|
u32 gap_after;
|
|
u32 gap_to;
|
|
u32 nack_sync;
|
|
struct sk_buff *deferred_head;
|
|
struct sk_buff *deferred_tail;
|
|
struct sk_buff *defragm;
|
|
} bclink;
|
|
};
|
|
|
|
extern struct node *nodes;
|
|
extern u32 tipc_own_tag;
|
|
|
|
struct node *node_create(u32 addr);
|
|
void node_delete(struct node *n_ptr);
|
|
struct node *node_attach_link(struct link *l_ptr);
|
|
void node_detach_link(struct node *n_ptr, struct link *l_ptr);
|
|
void node_link_down(struct node *n_ptr, struct link *l_ptr);
|
|
void node_link_up(struct node *n_ptr, struct link *l_ptr);
|
|
int node_has_active_links(struct node *n_ptr);
|
|
int node_has_redundant_links(struct node *n_ptr);
|
|
u32 node_select_router(struct node *n_ptr, u32 ref);
|
|
struct node *node_select_next_hop(u32 addr, u32 selector);
|
|
int node_is_up(struct node *n_ptr);
|
|
void node_add_router(struct node *n_ptr, u32 router);
|
|
void node_remove_router(struct node *n_ptr, u32 router);
|
|
struct sk_buff *node_get_links(const void *req_tlv_area, int req_tlv_space);
|
|
struct sk_buff *node_get_nodes(const void *req_tlv_area, int req_tlv_space);
|
|
|
|
static inline struct node *node_find(u32 addr)
|
|
{
|
|
if (likely(in_own_cluster(addr)))
|
|
return local_nodes[tipc_node(addr)];
|
|
else if (addr_domain_valid(addr)) {
|
|
struct cluster *c_ptr = cluster_find(addr);
|
|
|
|
if (c_ptr)
|
|
return c_ptr->nodes[tipc_node(addr)];
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static inline struct node *node_select(u32 addr, u32 selector)
|
|
{
|
|
if (likely(in_own_cluster(addr)))
|
|
return local_nodes[tipc_node(addr)];
|
|
return node_select_next_hop(addr, selector);
|
|
}
|
|
|
|
static inline void node_lock(struct node *n_ptr)
|
|
{
|
|
spin_lock_bh(&n_ptr->lock);
|
|
}
|
|
|
|
static inline void node_unlock(struct node *n_ptr)
|
|
{
|
|
spin_unlock_bh(&n_ptr->lock);
|
|
}
|
|
|
|
#endif
|