addr.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /*
  2. * net/tipc/addr.c: TIPC address utility routines
  3. *
  4. * Copyright (c) 2000-2006, 2018, Ericsson AB
  5. * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
  6. * Copyright (c) 2020-2021, Red Hat Inc
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. * 2. Redistributions in binary form must reproduce the above copyright
  15. * notice, this list of conditions and the following disclaimer in the
  16. * documentation and/or other materials provided with the distribution.
  17. * 3. Neither the names of the copyright holders nor the names of its
  18. * contributors may be used to endorse or promote products derived from
  19. * this software without specific prior written permission.
  20. *
  21. * Alternatively, this software may be distributed under the terms of the
  22. * GNU General Public License ("GPL") version 2 as published by the Free
  23. * Software Foundation.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  26. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  29. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  30. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  31. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  32. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  33. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  34. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  35. * POSSIBILITY OF SUCH DAMAGE.
  36. */
  37. #include "addr.h"
  38. #include "core.h"
  39. bool tipc_in_scope(bool legacy_format, u32 domain, u32 addr)
  40. {
  41. if (!domain || (domain == addr))
  42. return true;
  43. if (!legacy_format)
  44. return false;
  45. if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
  46. return true;
  47. if (domain == (addr & TIPC_ZONE_CLUSTER_MASK)) /* domain <Z.C.0> */
  48. return true;
  49. if (domain == (addr & TIPC_ZONE_MASK)) /* domain <Z.0.0> */
  50. return true;
  51. return false;
  52. }
  53. void tipc_set_node_id(struct net *net, u8 *id)
  54. {
  55. struct tipc_net *tn = tipc_net(net);
  56. memcpy(tn->node_id, id, NODE_ID_LEN);
  57. tipc_nodeid2string(tn->node_id_string, id);
  58. tn->trial_addr = hash128to32(id);
  59. pr_info("Node identity %s, cluster identity %u\n",
  60. tipc_own_id_string(net), tn->net_id);
  61. }
  62. void tipc_set_node_addr(struct net *net, u32 addr)
  63. {
  64. struct tipc_net *tn = tipc_net(net);
  65. u8 node_id[NODE_ID_LEN] = {0,};
  66. tn->node_addr = addr;
  67. if (!tipc_own_id(net)) {
  68. sprintf(node_id, "%x", addr);
  69. tipc_set_node_id(net, node_id);
  70. }
  71. tn->trial_addr = addr;
  72. tn->addr_trial_end = jiffies;
  73. pr_info("Node number set to %u\n", addr);
  74. }
  75. char *tipc_nodeid2string(char *str, u8 *id)
  76. {
  77. int i;
  78. u8 c;
  79. /* Already a string ? */
  80. for (i = 0; i < NODE_ID_LEN; i++) {
  81. c = id[i];
  82. if (c >= '0' && c <= '9')
  83. continue;
  84. if (c >= 'A' && c <= 'Z')
  85. continue;
  86. if (c >= 'a' && c <= 'z')
  87. continue;
  88. if (c == '.')
  89. continue;
  90. if (c == ':')
  91. continue;
  92. if (c == '_')
  93. continue;
  94. if (c == '-')
  95. continue;
  96. if (c == '@')
  97. continue;
  98. if (c != 0)
  99. break;
  100. }
  101. if (i == NODE_ID_LEN) {
  102. memcpy(str, id, NODE_ID_LEN);
  103. str[NODE_ID_LEN] = 0;
  104. return str;
  105. }
  106. /* Translate to hex string */
  107. for (i = 0; i < NODE_ID_LEN; i++)
  108. sprintf(&str[2 * i], "%02x", id[i]);
  109. /* Strip off trailing zeroes */
  110. for (i = NODE_ID_STR_LEN - 2; str[i] == '0'; i--)
  111. str[i] = 0;
  112. return str;
  113. }