node.h 4.6 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/node.h: Include file for TIPC node management routines
3
 *
4
 * Copyright (c) 2000-2006, 2014-2016, Ericsson AB
5
 * Copyright (c) 2005, 2010-2014, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 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.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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
P
Per Liden 已提交
34 35 36 37 38 39
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _TIPC_NODE_H
#define _TIPC_NODE_H

40 41
#include "addr.h"
#include "net.h"
P
Per Liden 已提交
42
#include "bearer.h"
43
#include "msg.h"
P
Per Liden 已提交
44

45 46 47
/* Optional capabilities supported by this code version
 */
enum {
48 49
	TIPC_BCAST_SYNCH      = (1 << 1),
	TIPC_BCAST_STATE_NACK = (1 << 2),
50
	TIPC_BLOCK_FLOWCTL    = (1 << 3),
J
Jon Maloy 已提交
51
	TIPC_BCAST_RCAST      = (1 << 4),
52 53
	TIPC_NODE_ID128       = (1 << 5),
	TIPC_LINK_PROTO_SEQNO = (1 << 6)
54 55
};

56 57 58 59 60 61
#define TIPC_NODE_CAPABILITIES (TIPC_BCAST_SYNCH       |  \
				TIPC_BCAST_STATE_NACK  |  \
				TIPC_BCAST_RCAST       |  \
				TIPC_BLOCK_FLOWCTL     |  \
				TIPC_NODE_ID128        |  \
				TIPC_LINK_PROTO_SEQNO)
62
#define INVALID_BEARER_ID -1
63

64
void tipc_node_stop(struct net *net);
65
bool tipc_node_get_id(struct net *net, u32 addr, u8 *id);
66 67
u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr);
void tipc_node_check_dest(struct net *net, u32 onode, u8 *peer_id128,
68 69 70 71
			  struct tipc_bearer *bearer,
			  u16 capabilities, u32 signature,
			  struct tipc_media_addr *maddr,
			  bool *respond, bool *dupl_addr);
72
void tipc_node_delete_links(struct net *net, int bearer_id);
73
void tipc_node_apply_property(struct net *net, struct tipc_bearer *b, int prop);
74 75
int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
			   char *linkname, size_t len);
76 77
int tipc_node_xmit(struct net *net, struct sk_buff_head *list, u32 dnode,
		   int selector);
78
int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *list);
79 80
int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
		       u32 selector);
81 82 83
void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr);
void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr);
void tipc_node_broadcast(struct net *net, struct sk_buff *skb);
84 85
int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port);
void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port);
86
int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel);
87
bool tipc_node_is_up(struct net *net, u32 addr);
88
u16 tipc_node_get_capabilities(struct net *net, u32 addr);
89
int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);
90
int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb);
91 92 93
int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info);
int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info);
int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info);
94
int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info);
95

96
int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info);
97
int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info);
98 99 100
int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb);
int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
				   struct netlink_callback *cb);
P
Per Liden 已提交
101
#endif