ip_address.cpp 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257
  1. /*************************************************************************/
  2. /* ip_address.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "ip_address.h"
  31. /*
  32. IP_Address::operator Variant() const {
  33. return operator String();
  34. }*/
  35. #include <stdio.h>
  36. #include <string.h>
  37. IP_Address::operator String() const {
  38. if (wildcard)
  39. return "*";
  40. if (!valid)
  41. return "";
  42. if (is_ipv4())
  43. // IPv4 address mapped to IPv6
  44. return itos(field8[12]) + "." + itos(field8[13]) + "." + itos(field8[14]) + "." + itos(field8[15]);
  45. String ret;
  46. for (int i = 0; i < 8; i++) {
  47. if (i > 0)
  48. ret = ret + ":";
  49. uint16_t num = (field8[i * 2] << 8) + field8[i * 2 + 1];
  50. ret = ret + String::num_int64(num, 16);
  51. };
  52. return ret;
  53. }
  54. static void _parse_hex(const String &p_string, int p_start, uint8_t *p_dst) {
  55. uint16_t ret = 0;
  56. for (int i = p_start; i < p_start + 4; i++) {
  57. if (i >= p_string.length()) {
  58. break;
  59. };
  60. int n = 0;
  61. CharType c = p_string[i];
  62. if (c >= '0' && c <= '9') {
  63. n = c - '0';
  64. } else if (c >= 'a' && c <= 'f') {
  65. n = 10 + (c - 'a');
  66. } else if (c >= 'A' && c <= 'F') {
  67. n = 10 + (c - 'A');
  68. } else if (c == ':') {
  69. break;
  70. } else {
  71. ERR_FAIL_MSG("Invalid character in IPv6 address: " + p_string + ".");
  72. };
  73. ret = ret << 4;
  74. ret += n;
  75. };
  76. p_dst[0] = ret >> 8;
  77. p_dst[1] = ret & 0xff;
  78. };
  79. void IP_Address::_parse_ipv6(const String &p_string) {
  80. static const int parts_total = 8;
  81. int parts[parts_total] = { 0 };
  82. int parts_count = 0;
  83. bool part_found = false;
  84. bool part_skip = false;
  85. bool part_ipv4 = false;
  86. int parts_idx = 0;
  87. for (int i = 0; i < p_string.length(); i++) {
  88. CharType c = p_string[i];
  89. if (c == ':') {
  90. if (i == 0) {
  91. continue; // next must be a ":"
  92. };
  93. if (!part_found) {
  94. part_skip = true;
  95. parts[parts_idx++] = -1;
  96. };
  97. part_found = false;
  98. } else if (c == '.') {
  99. part_ipv4 = true;
  100. } else if ((c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F')) {
  101. if (!part_found) {
  102. parts[parts_idx++] = i;
  103. part_found = true;
  104. ++parts_count;
  105. };
  106. } else {
  107. ERR_FAIL_MSG("Invalid character in IPv6 address: " + p_string + ".");
  108. };
  109. };
  110. int parts_extra = 0;
  111. if (part_skip) {
  112. parts_extra = parts_total - parts_count;
  113. };
  114. int idx = 0;
  115. for (int i = 0; i < parts_idx; i++) {
  116. if (parts[i] == -1) {
  117. for (int j = 0; j < parts_extra; j++) {
  118. field16[idx++] = 0;
  119. };
  120. continue;
  121. };
  122. if (part_ipv4 && i == parts_idx - 1) {
  123. _parse_ipv4(p_string, parts[i], (uint8_t *)&field16[idx]); // should be the last one
  124. } else {
  125. _parse_hex(p_string, parts[i], (uint8_t *)&(field16[idx++]));
  126. };
  127. };
  128. };
  129. void IP_Address::_parse_ipv4(const String &p_string, int p_start, uint8_t *p_ret) {
  130. String ip;
  131. if (p_start != 0) {
  132. ip = p_string.substr(p_start, p_string.length() - p_start);
  133. } else {
  134. ip = p_string;
  135. };
  136. int slices = ip.get_slice_count(".");
  137. ERR_FAIL_COND_MSG(slices != 4, "Invalid IP address string: " + ip + ".");
  138. for (int i = 0; i < 4; i++) {
  139. p_ret[i] = ip.get_slicec('.', i).to_int();
  140. }
  141. };
  142. void IP_Address::clear() {
  143. memset(&field8[0], 0, sizeof(field8));
  144. valid = false;
  145. wildcard = false;
  146. };
  147. bool IP_Address::is_ipv4() const {
  148. return (field32[0] == 0 && field32[1] == 0 && field16[4] == 0 && field16[5] == 0xffff);
  149. }
  150. const uint8_t *IP_Address::get_ipv4() const {
  151. ERR_FAIL_COND_V_MSG(!is_ipv4(), &(field8[12]), "IPv4 requested, but current IP is IPv6."); // Not the correct IPv4 (it's an IPv6), but we don't want to return a null pointer risking an engine crash.
  152. return &(field8[12]);
  153. }
  154. void IP_Address::set_ipv4(const uint8_t *p_ip) {
  155. clear();
  156. valid = true;
  157. field16[5] = 0xffff;
  158. field32[3] = *((const uint32_t *)p_ip);
  159. }
  160. const uint8_t *IP_Address::get_ipv6() const {
  161. return field8;
  162. }
  163. void IP_Address::set_ipv6(const uint8_t *p_buf) {
  164. clear();
  165. valid = true;
  166. for (int i = 0; i < 16; i++)
  167. field8[i] = p_buf[i];
  168. }
  169. IP_Address::IP_Address(const String &p_string) {
  170. clear();
  171. if (p_string == "*") {
  172. // Wildcard (not a valid IP)
  173. wildcard = true;
  174. } else if (p_string.find(":") >= 0) {
  175. // IPv6
  176. _parse_ipv6(p_string);
  177. valid = true;
  178. } else if (p_string.get_slice_count(".") == 4) {
  179. // IPv4 (mapped to IPv6 internally)
  180. field16[5] = 0xffff;
  181. _parse_ipv4(p_string, 0, &field8[12]);
  182. valid = true;
  183. } else {
  184. ERR_PRINT("Invalid IP address.");
  185. }
  186. }
  187. _FORCE_INLINE_ static void _32_to_buf(uint8_t *p_dst, uint32_t p_n) {
  188. p_dst[0] = (p_n >> 24) & 0xff;
  189. p_dst[1] = (p_n >> 16) & 0xff;
  190. p_dst[2] = (p_n >> 8) & 0xff;
  191. p_dst[3] = (p_n >> 0) & 0xff;
  192. };
  193. IP_Address::IP_Address(uint32_t p_a, uint32_t p_b, uint32_t p_c, uint32_t p_d, bool is_v6) {
  194. clear();
  195. valid = true;
  196. if (!is_v6) {
  197. // Mapped to IPv6
  198. field16[5] = 0xffff;
  199. field8[12] = p_a;
  200. field8[13] = p_b;
  201. field8[14] = p_c;
  202. field8[15] = p_d;
  203. } else {
  204. _32_to_buf(&field8[0], p_a);
  205. _32_to_buf(&field8[4], p_b);
  206. _32_to_buf(&field8[8], p_c);
  207. _32_to_buf(&field8[12], p_d);
  208. }
  209. }