node.h 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /*
  2. * net/tipc/node.h: Include file for TIPC node management routines
  3. *
  4. * Copyright (c) 2000-2006, Ericsson AB
  5. * Copyright (c) 2005, Wind River Systems
  6. * All rights reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions are met:
  10. *
  11. * 1. Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in the
  15. * documentation and/or other materials provided with the distribution.
  16. * 3. Neither the names of the copyright holders nor the names of its
  17. * contributors may be used to endorse or promote products derived from
  18. * this software without specific prior written permission.
  19. *
  20. * Alternatively, this software may be distributed under the terms of the
  21. * GNU General Public License ("GPL") version 2 as published by the Free
  22. * Software Foundation.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  25. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  34. * POSSIBILITY OF SUCH DAMAGE.
  35. */
  36. #ifndef _TIPC_NODE_H
  37. #define _TIPC_NODE_H
  38. #include "node_subscr.h"
  39. #include "addr.h"
  40. #include "cluster.h"
  41. #include "bearer.h"
  42. /**
  43. * struct node - TIPC node structure
  44. * @addr: network address of node
  45. * @lock: spinlock governing access to structure
  46. * @owner: pointer to cluster that node belongs to
  47. * @next: pointer to next node in sorted list of cluster's nodes
  48. * @nsub: list of "node down" subscriptions monitoring node
  49. * @active_links: pointers to active links to node
  50. * @links: pointers to all links to node
  51. * @working_links: number of working links to node (both active and standby)
  52. * @link_cnt: number of links to node
  53. * @permit_changeover: non-zero if node has redundant links to this system
  54. * @routers: bitmap (used for multicluster communication)
  55. * @last_router: (used for multicluster communication)
  56. * @bclink: broadcast-related info
  57. * @supported: non-zero if node supports TIPC b'cast capability
  58. * @acked: sequence # of last outbound b'cast message acknowledged by node
  59. * @last_in: sequence # of last in-sequence b'cast message received from node
  60. * @gap_after: sequence # of last message not requiring a NAK request
  61. * @gap_to: sequence # of last message requiring a NAK request
  62. * @nack_sync: counter that determines when NAK requests should be sent
  63. * @deferred_head: oldest OOS b'cast message received from node
  64. * @deferred_tail: newest OOS b'cast message received from node
  65. * @defragm: list of partially reassembled b'cast message fragments from node
  66. */
  67. struct node {
  68. u32 addr;
  69. spinlock_t lock;
  70. struct cluster *owner;
  71. struct node *next;
  72. struct list_head nsub;
  73. struct link *active_links[2];
  74. struct link *links[MAX_BEARERS];
  75. int link_cnt;
  76. int working_links;
  77. int permit_changeover;
  78. u32 routers[512/32];
  79. int last_router;
  80. struct {
  81. int supported;
  82. u32 acked;
  83. u32 last_in;
  84. u32 gap_after;
  85. u32 gap_to;
  86. u32 nack_sync;
  87. struct sk_buff *deferred_head;
  88. struct sk_buff *deferred_tail;
  89. struct sk_buff *defragm;
  90. } bclink;
  91. };
  92. extern struct node *tipc_nodes;
  93. extern u32 tipc_own_tag;
  94. struct node *tipc_node_create(u32 addr);
  95. void tipc_node_delete(struct node *n_ptr);
  96. struct node *tipc_node_attach_link(struct link *l_ptr);
  97. void tipc_node_detach_link(struct node *n_ptr, struct link *l_ptr);
  98. void tipc_node_link_down(struct node *n_ptr, struct link *l_ptr);
  99. void tipc_node_link_up(struct node *n_ptr, struct link *l_ptr);
  100. int tipc_node_has_active_links(struct node *n_ptr);
  101. int tipc_node_has_redundant_links(struct node *n_ptr);
  102. u32 tipc_node_select_router(struct node *n_ptr, u32 ref);
  103. struct node *tipc_node_select_next_hop(u32 addr, u32 selector);
  104. int tipc_node_is_up(struct node *n_ptr);
  105. void tipc_node_add_router(struct node *n_ptr, u32 router);
  106. void tipc_node_remove_router(struct node *n_ptr, u32 router);
  107. struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space);
  108. struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space);
  109. static inline struct node *tipc_node_find(u32 addr)
  110. {
  111. if (likely(in_own_cluster(addr)))
  112. return tipc_local_nodes[tipc_node(addr)];
  113. else if (tipc_addr_domain_valid(addr)) {
  114. struct cluster *c_ptr = tipc_cltr_find(addr);
  115. if (c_ptr)
  116. return c_ptr->nodes[tipc_node(addr)];
  117. }
  118. return NULL;
  119. }
  120. static inline struct node *tipc_node_select(u32 addr, u32 selector)
  121. {
  122. if (likely(in_own_cluster(addr)))
  123. return tipc_local_nodes[tipc_node(addr)];
  124. return tipc_node_select_next_hop(addr, selector);
  125. }
  126. static inline void tipc_node_lock(struct node *n_ptr)
  127. {
  128. spin_lock_bh(&n_ptr->lock);
  129. }
  130. static inline void tipc_node_unlock(struct node *n_ptr)
  131. {
  132. spin_unlock_bh(&n_ptr->lock);
  133. }
  134. #endif