node.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  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 "net.h"
  41. #include "bearer.h"
  42. /**
  43. * struct tipc_node - TIPC node structure
  44. * @addr: network address of node
  45. * @lock: spinlock governing access to structure
  46. * @next: pointer to next node in sorted list of cluster's nodes
  47. * @nsub: list of "node down" subscriptions monitoring node
  48. * @active_links: pointers to active links to node
  49. * @links: pointers to all links to node
  50. * @working_links: number of working links to node (both active and standby)
  51. * @cleanup_required: non-zero if cleaning up after a prior loss of contact
  52. * @link_cnt: number of links to node
  53. * @permit_changeover: non-zero if node has redundant links to this system
  54. * @bclink: broadcast-related info
  55. * @supported: non-zero if node supports TIPC b'cast capability
  56. * @acked: sequence # of last outbound b'cast message acknowledged by node
  57. * @last_in: sequence # of last in-sequence b'cast message received from node
  58. * @gap_after: sequence # of last message not requiring a NAK request
  59. * @gap_to: sequence # of last message requiring a NAK request
  60. * @nack_sync: counter that determines when NAK requests should be sent
  61. * @deferred_head: oldest OOS b'cast message received from node
  62. * @deferred_tail: newest OOS b'cast message received from node
  63. * @defragm: list of partially reassembled b'cast message fragments from node
  64. */
  65. struct tipc_node {
  66. u32 addr;
  67. spinlock_t lock;
  68. struct tipc_node *next;
  69. struct list_head nsub;
  70. struct link *active_links[2];
  71. struct link *links[MAX_BEARERS];
  72. int link_cnt;
  73. int working_links;
  74. int cleanup_required;
  75. int permit_changeover;
  76. struct {
  77. int supported;
  78. u32 acked;
  79. u32 last_in;
  80. u32 gap_after;
  81. u32 gap_to;
  82. u32 nack_sync;
  83. struct sk_buff *deferred_head;
  84. struct sk_buff *deferred_tail;
  85. struct sk_buff *defragm;
  86. } bclink;
  87. };
  88. extern u32 tipc_own_tag;
  89. struct tipc_node *tipc_node_create(u32 addr);
  90. void tipc_node_delete(struct tipc_node *n_ptr);
  91. struct tipc_node *tipc_node_attach_link(struct link *l_ptr);
  92. void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr);
  93. void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr);
  94. void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr);
  95. int tipc_node_has_active_links(struct tipc_node *n_ptr);
  96. int tipc_node_has_redundant_links(struct tipc_node *n_ptr);
  97. int tipc_node_is_up(struct tipc_node *n_ptr);
  98. struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space);
  99. struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space);
  100. static inline struct tipc_node *tipc_node_find(u32 addr)
  101. {
  102. if (likely(in_own_cluster(addr)))
  103. return tipc_net.nodes[tipc_node(addr)];
  104. return NULL;
  105. }
  106. static inline void tipc_node_lock(struct tipc_node *n_ptr)
  107. {
  108. spin_lock_bh(&n_ptr->lock);
  109. }
  110. static inline void tipc_node_unlock(struct tipc_node *n_ptr)
  111. {
  112. spin_unlock_bh(&n_ptr->lock);
  113. }
  114. #endif