addr.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  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. * 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. #include "addr.h"
  37. #include "core.h"
  38. bool tipc_in_scope(bool legacy_format, u32 domain, u32 addr)
  39. {
  40. if (!domain || (domain == addr))
  41. return true;
  42. if (!legacy_format)
  43. return false;
  44. if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
  45. return true;
  46. if (domain == (addr & TIPC_ZONE_CLUSTER_MASK)) /* domain <Z.C.0> */
  47. return true;
  48. if (domain == (addr & TIPC_ZONE_MASK)) /* domain <Z.0.0> */
  49. return true;
  50. return false;
  51. }
  52. void tipc_set_node_id(struct net *net, u8 *id)
  53. {
  54. struct tipc_net *tn = tipc_net(net);
  55. u32 *tmp = (u32 *)id;
  56. memcpy(tn->node_id, id, NODE_ID_LEN);
  57. tipc_nodeid2string(tn->node_id_string, id);
  58. tn->trial_addr = tmp[0] ^ tmp[1] ^ tmp[2] ^ tmp[3];
  59. pr_info("Own 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. pr_info("32-bit node address hash set to %x\n", addr);
  73. }
  74. char *tipc_nodeid2string(char *str, u8 *id)
  75. {
  76. int i;
  77. u8 c;
  78. /* Already a string ? */
  79. for (i = 0; i < NODE_ID_LEN; i++) {
  80. c = id[i];
  81. if (c >= '0' && c <= '9')
  82. continue;
  83. if (c >= 'A' && c <= 'Z')
  84. continue;
  85. if (c >= 'a' && c <= 'z')
  86. continue;
  87. if (c == '.')
  88. continue;
  89. if (c == ':')
  90. continue;
  91. if (c == '_')
  92. continue;
  93. if (c == '-')
  94. continue;
  95. if (c == '@')
  96. continue;
  97. if (c != 0)
  98. break;
  99. }
  100. if (i == NODE_ID_LEN) {
  101. memcpy(str, id, NODE_ID_LEN);
  102. str[NODE_ID_LEN] = 0;
  103. return str;
  104. }
  105. /* Translate to hex string */
  106. for (i = 0; i < NODE_ID_LEN; i++)
  107. sprintf(&str[2 * i], "%02x", id[i]);
  108. /* Strip off trailing zeroes */
  109. for (i = NODE_ID_STR_LEN - 2; str[i] == '0'; i--)
  110. str[i] = 0;
  111. return str;
  112. }