Home Explore Help
Sign In
cpp
/
ZeroTierOne
mirror of https://github.com/zerotier/ZeroTierOne
2
0
Fork 0
Files Issues 0 Wiki
Tree: f057bb63cd
Branches Tags
ZeroTierOne
/
node
/
Topology.cpp

Topology.cpp 22 KB
History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331 
  1. /*
    2. 

  2.  * ZeroTier One - Network Virtualization Everywhere
    3. 

  3.  * Copyright (C) 2011-2016  ZeroTier, Inc.  https://www.zerotier.com/
    4. 

  4.  *
    5. 

  5.  * This program is free software: you can redistribute it and/or modify
    6. 

  6.  * it under the terms of the GNU General Public License as published by
    7. 

  7.  * the Free Software Foundation, either version 3 of the License, or
    8. 

  8.  * (at your option) any later version.
    9. 

  9.  *
    10. 

  10.  * This program is distributed in the hope that it will be useful,
    11. 

  11.  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    12. 

  12.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    13. 

  13.  * GNU General Public License for more details.
    14. 

  14.  *
    15. 

  15.  * You should have received a copy of the GNU General Public License
    16. 

  16.  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
    17. 

  17.  */
    18. 

  18. 

  19. #include "Constants.hpp"
    20. 

  20. #include "Topology.hpp"
    21. 

  21. #include "RuntimeEnvironment.hpp"
    22. 

  22. #include "Node.hpp"
    23. 

  23. #include "Network.hpp"
    24. 

  24. #include "NetworkConfig.hpp"
    25. 

  25. #include "Buffer.hpp"
    26. 

  26. 

  27. namespace ZeroTier {
    28. 

  28. 

  29. // 2015-11-16 -- The Fabulous Four (should have named them after Beatles!)
    30. 

  30. //#define ZT_DEFAULT_WORLD_LENGTH 494
    31. 

  31. //static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x51,0x11,0x70,0xb2,0xfb,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0x80,0x31,0xa4,0x65,0x95,0x45,0x06,0x1c,0xfb,0xc2,0x4e,0x5d,0xe7,0x0a,0x40,0x7a,0x97,0xce,0x36,0xa2,0x3d,0x05,0xca,0x87,0xc7,0x59,0x27,0x5c,0x8b,0x0d,0x4c,0xb4,0xbb,0x26,0x2f,0x77,0x17,0x5e,0xb7,0x4d,0xb8,0xd3,0xb4,0xe9,0x23,0x5d,0xcc,0xa2,0x71,0xa8,0xdf,0xf1,0x23,0xa3,0xb2,0x66,0x74,0xea,0xe5,0xdc,0x8d,0xef,0xd3,0x0a,0xa9,0xac,0xcb,0xda,0x93,0xbd,0x6c,0xcd,0x43,0x1d,0xa7,0x98,0x6a,0xde,0x70,0xc0,0xc6,0x1c,0xaf,0xf0,0xfd,0x7f,0x8a,0xb9,0x76,0x13,0xe1,0xde,0x4f,0xf3,0xd6,0x13,0x04,0x7e,0x19,0x87,0x6a,0xba,0x00,0x2a,0x6e,0x2b,0x23,0x18,0x93,0x0f,0x60,0xeb,0x09,0x7f,0x70,0xd0,0xf4,0xb0,0x28,0xb2,0xcd,0x6d,0x3d,0x0c,0x63,0xc0,0x14,0xb9,0x03,0x9f,0xf3,0x53,0x90,0xe4,0x11,0x81,0xf2,0x16,0xfb,0x2e,0x6f,0xa8,0xd9,0x5c,0x1e,0xe9,0x66,0x71,0x56,0x41,0x19,0x05,0xc3,0xdc,0xcf,0xea,0x78,0xd8,0xc6,0xdf,0xaf,0xba,0x68,0x81,0x70,0xb3,0xfa,0x00,0x01,0x04,0xc6,0xc7,0x61,0xdc,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x01,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x8a,0xcf,0x05,0x9f,0xe3,0x00,0x48,0x2f,0x6e,0xe5,0xdf,0xe9,0x02,0x31,0x9b,0x41,0x9d,0xe5,0xbd,0xc7,0x65,0x20,0x9c,0x0e,0xcd,0xa3,0x8c,0x4d,0x6e,0x4f,0xcf,0x0d,0x33,0x65,0x83,0x98,0xb4,0x52,0x7d,0xcd,0x22,0xf9,0x31,0x12,0xfb,0x9b,0xef,0xd0,0x2f,0xd7,0x8b,0xf7,0x26,0x1b,0x33,0x3f,0xc1,0x05,0xd1,0x92,0xa6,0x23,0xca,0x9e,0x50,0xfc,0x60,0xb3,0x74,0xa5,0x00,0x01,0x04,0xa2,0xf3,0x4d,0x6f,0x27,0x09,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x01,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09};
    32. 

  32. 

  33. // 2015-11-20 -- Alice and Bob are live, and we're now IPv6 dual-stack!
    34. 

  34. //#define ZT_DEFAULT_WORLD_LENGTH 792
    35. 

  35. //static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x51,0x26,0x6f,0x7c,0x8a,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0xe8,0x0a,0xf5,0xbc,0xf8,0x3d,0x97,0xcd,0xc3,0xf8,0xe2,0x41,0x16,0x42,0x0f,0xc7,0x76,0x8e,0x07,0xf3,0x7e,0x9e,0x7d,0x1b,0xb3,0x23,0x21,0x79,0xce,0xb9,0xd0,0xcb,0xb5,0x94,0x7b,0x89,0x21,0x57,0x72,0xf6,0x70,0xa1,0xdd,0x67,0x38,0xcf,0x45,0x45,0xc2,0x8d,0x46,0xec,0x00,0x2c,0xe0,0x2a,0x63,0x3f,0x63,0x8d,0x33,0x08,0x51,0x07,0x77,0x81,0x5b,0x32,0x49,0xae,0x87,0x89,0xcf,0x31,0xaa,0x41,0xf1,0x52,0x97,0xdc,0xa2,0x55,0xe1,0x4a,0x6e,0x3c,0x04,0xf0,0x4f,0x8a,0x0e,0xe9,0xca,0xec,0x24,0x30,0x04,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x0c,0x04,0xbc,0xa6,0x5e,0xb1,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x02,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x7d,0x00,0x01,0x27,0x09,0x04,0x9a,0x42,0xc5,0x21,0x27,0x09,0x06,0x2c,0x0f,0xf8,0x50,0x01,0x54,0x01,0x97,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x33,0x27,0x09,0x04,0x9f,0xcb,0x61,0xab,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x08,0x00,0x00,0xa1,0x00,0x00,0x00,0x00,0x00,0x54,0x60,0x01,0x27,0x09,0x04,0xa9,0x39,0x8f,0x68,0x27,0x09,0x06,0x26,0x07,0xf0,0xd0,0x1d,0x01,0x00,0x57,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x02,0x27,0x09,0x04,0x6b,0xaa,0xc5,0x0e,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x00,0x00,0x00,0x00,0x02,0x00,0xe0,0x01,0x27,0x09,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09,0x06,0x24,0x00,0x61,0x80,0x00,0x00,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0xb7,0x40,0x01,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x0c,0x04,0x2d,0x20,0xc6,0x82,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x64,0x00,0x81,0xc3,0x54,0x00,0x00,0xff,0xfe,0x18,0x1d,0x61,0x27,0x09,0x04,0x2e,0x65,0xa0,0xf9,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x03,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x6a,0x30,0x01,0x27,0x09,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x68,0x00,0x83,0xa4,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x64,0x27,0x09,0x04,0x2d,0x20,0xf6,0xb3,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x58,0x00,0x8b,0xf8,0x54,0x00,0x00,0xff,0xfe,0x15,0xb3,0x9a,0x27,0x09,0x04,0x2d,0x20,0xf8,0x57,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x70,0x00,0x9b,0xc9,0x54,0x00,0x00,0xff,0xfe,0x15,0xc4,0xf5,0x27,0x09,0x04,0x9f,0xcb,0x02,0x9a,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x0c,0xad,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x26,0x70,0x01,0x27,0x09,0x7e,0x19,0x87,0x6a,0xba,0x00,0x2a,0x6e,0x2b,0x23,0x18,0x93,0x0f,0x60,0xeb,0x09,0x7f,0x70,0xd0,0xf4,0xb0,0x28,0xb2,0xcd,0x6d,0x3d,0x0c,0x63,0xc0,0x14,0xb9,0x03,0x9f,0xf3,0x53,0x90,0xe4,0x11,0x81,0xf2,0x16,0xfb,0x2e,0x6f,0xa8,0xd9,0x5c,0x1e,0xe9,0x66,0x71,0x56,0x41,0x19,0x05,0xc3,0xdc,0xcf,0xea,0x78,0xd8,0xc6,0xdf,0xaf,0xba,0x68,0x81,0x70,0xb3,0xfa,0x00,0x01,0x04,0xc6,0xc7,0x61,0xdc,0x27,0x09,0x8a,0xcf,0x05,0x9f,0xe3,0x00,0x48,0x2f,0x6e,0xe5,0xdf,0xe9,0x02,0x31,0x9b,0x41,0x9d,0xe5,0xbd,0xc7,0x65,0x20,0x9c,0x0e,0xcd,0xa3,0x8c,0x4d,0x6e,0x4f,0xcf,0x0d,0x33,0x65,0x83,0x98,0xb4,0x52,0x7d,0xcd,0x22,0xf9,0x31,0x12,0xfb,0x9b,0xef,0xd0,0x2f,0xd7,0x8b,0xf7,0x26,0x1b,0x33,0x3f,0xc1,0x05,0xd1,0x92,0xa6,0x23,0xca,0x9e,0x50,0xfc,0x60,0xb3,0x74,0xa5,0x00,0x01,0x04,0xa2,0xf3,0x4d,0x6f,0x27,0x09};
    36. 

  36. 

  37. // 2015-12-17 -- Old New York root is dead, old SF still alive
    38. 

  38. //#define ZT_DEFAULT_WORLD_LENGTH 732
    39. 

  39. //static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x51,0xb1,0x7e,0x39,0x9d,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0x8a,0xca,0xf2,0x3d,0x71,0x2e,0xc2,0x39,0x45,0x66,0xb3,0xe9,0x39,0x79,0xb1,0x55,0xc4,0xa9,0xfc,0xbc,0xfc,0x55,0xaf,0x8a,0x2f,0x38,0xc8,0xcd,0xe9,0x02,0x5b,0x86,0xa9,0x72,0xf7,0x16,0x00,0x35,0xb7,0x84,0xc9,0xfc,0xe4,0xfa,0x96,0x8b,0xf4,0x1e,0xba,0x60,0x9f,0x85,0x14,0xc2,0x07,0x4b,0xfd,0xd1,0x6c,0x19,0x69,0xd3,0xf9,0x09,0x9c,0x9d,0xe3,0xb9,0x8f,0x11,0x78,0x71,0xa7,0x4a,0x05,0xd8,0xcc,0x60,0xa2,0x06,0x66,0x9f,0x47,0xc2,0x71,0xb8,0x54,0x80,0x9c,0x45,0x16,0x10,0xa9,0xd0,0xbd,0xf7,0x03,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x0c,0x04,0xbc,0xa6,0x5e,0xb1,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x02,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x7d,0x00,0x01,0x27,0x09,0x04,0x9a,0x42,0xc5,0x21,0x27,0x09,0x06,0x2c,0x0f,0xf8,0x50,0x01,0x54,0x01,0x97,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x33,0x27,0x09,0x04,0x9f,0xcb,0x61,0xab,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x08,0x00,0x00,0xa1,0x00,0x00,0x00,0x00,0x00,0x54,0x60,0x01,0x27,0x09,0x04,0xa9,0x39,0x8f,0x68,0x27,0x09,0x06,0x26,0x07,0xf0,0xd0,0x1d,0x01,0x00,0x57,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x02,0x27,0x09,0x04,0x6b,0xaa,0xc5,0x0e,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x00,0x00,0x00,0x00,0x02,0x00,0xe0,0x01,0x27,0x09,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09,0x06,0x24,0x00,0x61,0x80,0x00,0x00,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0xb7,0x40,0x01,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x0c,0x04,0x2d,0x20,0xc6,0x82,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x64,0x00,0x81,0xc3,0x54,0x00,0x00,0xff,0xfe,0x18,0x1d,0x61,0x27,0x09,0x04,0x2e,0x65,0xa0,0xf9,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x03,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x6a,0x30,0x01,0x27,0x09,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x68,0x00,0x83,0xa4,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x64,0x27,0x09,0x04,0x2d,0x20,0xf6,0xb3,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x58,0x00,0x8b,0xf8,0x54,0x00,0x00,0xff,0xfe,0x15,0xb3,0x9a,0x27,0x09,0x04,0x2d,0x20,0xf8,0x57,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x70,0x00,0x9b,0xc9,0x54,0x00,0x00,0xff,0xfe,0x15,0xc4,0xf5,0x27,0x09,0x04,0x9f,0xcb,0x02,0x9a,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x0c,0xad,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x26,0x70,0x01,0x27,0x09,0x7e,0x19,0x87,0x6a,0xba,0x00,0x2a,0x6e,0x2b,0x23,0x18,0x93,0x0f,0x60,0xeb,0x09,0x7f,0x70,0xd0,0xf4,0xb0,0x28,0xb2,0xcd,0x6d,0x3d,0x0c,0x63,0xc0,0x14,0xb9,0x03,0x9f,0xf3,0x53,0x90,0xe4,0x11,0x81,0xf2,0x16,0xfb,0x2e,0x6f,0xa8,0xd9,0x5c,0x1e,0xe9,0x66,0x71,0x56,0x41,0x19,0x05,0xc3,0xdc,0xcf,0xea,0x78,0xd8,0xc6,0xdf,0xaf,0xba,0x68,0x81,0x70,0xb3,0xfa,0x00,0x02,0x04,0xc6,0xc7,0x61,0xdc,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x00,0x00,0x00,0x00,0x00,0xc5,0xf0,0x01,0x27,0x09};
    40. 

  40. 

  41. // 2016-01-13 -- Old San Francisco 1.0.1 root is dead, now we're just on Alice and Bob!
    42. 

  42. #define ZT_DEFAULT_WORLD_LENGTH 634
    43. 

  43. static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x52,0x3c,0x32,0x50,0x1a,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0x4a,0xf7,0x86,0xa8,0x40,0xd6,0x52,0xea,0xae,0x9e,0x7a,0xbf,0x4c,0x97,0x66,0xab,0x2d,0x6f,0xaf,0xc9,0x2b,0x3a,0xff,0xed,0xd6,0x30,0x3e,0xc4,0x6a,0x65,0xf2,0xbd,0x83,0x52,0xf5,0x40,0xe9,0xcc,0x0d,0x6e,0x89,0x3f,0x9a,0xa0,0xb8,0xdf,0x42,0xd2,0x2f,0x84,0xe6,0x03,0x26,0x0f,0xa8,0xe3,0xcc,0x05,0x05,0x03,0xef,0x12,0x80,0x0d,0xce,0x3e,0xb6,0x58,0x3b,0x1f,0xa8,0xad,0xc7,0x25,0xf9,0x43,0x71,0xa7,0x5c,0x9a,0xc7,0xe1,0xa3,0xb8,0x88,0xd0,0x71,0x6c,0x94,0x99,0x73,0x41,0x0b,0x1b,0x48,0x84,0x02,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x0c,0x04,0xbc,0xa6,0x5e,0xb1,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x02,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x7d,0x00,0x01,0x27,0x09,0x04,0x9a,0x42,0xc5,0x21,0x27,0x09,0x06,0x2c,0x0f,0xf8,0x50,0x01,0x54,0x01,0x97,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x33,0x27,0x09,0x04,0x9f,0xcb,0x61,0xab,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x08,0x00,0x00,0xa1,0x00,0x00,0x00,0x00,0x00,0x54,0x60,0x01,0x27,0x09,0x04,0xa9,0x39,0x8f,0x68,0x27,0x09,0x06,0x26,0x07,0xf0,0xd0,0x1d,0x01,0x00,0x57,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x02,0x27,0x09,0x04,0x6b,0xaa,0xc5,0x0e,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x00,0x00,0x00,0x00,0x02,0x00,0xe0,0x01,0x27,0x09,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09,0x06,0x24,0x00,0x61,0x80,0x00,0x00,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0xb7,0x40,0x01,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x0c,0x04,0x2d,0x20,0xc6,0x82,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x64,0x00,0x81,0xc3,0x54,0x00,0x00,0xff,0xfe,0x18,0x1d,0x61,0x27,0x09,0x04,0x2e,0x65,0xa0,0xf9,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x03,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x6a,0x30,0x01,0x27,0x09,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x68,0x00,0x83,0xa4,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x64,0x27,0x09,0x04,0x2d,0x20,0xf6,0xb3,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x58,0x00,0x8b,0xf8,0x54,0x00,0x00,0xff,0xfe,0x15,0xb3,0x9a,0x27,0x09,0x04,0x2d,0x20,0xf8,0x57,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x70,0x00,0x9b,0xc9,0x54,0x00,0x00,0xff,0xfe,0x15,0xc4,0xf5,0x27,0x09,0x04,0x9f,0xcb,0x02,0x9a,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x0c,0xad,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x26,0x70,0x01,0x27,0x09};
    44. 

  44. 

  45. Topology::Topology(const RuntimeEnvironment *renv) :
    46. 

  46. 	RR(renv),
    47. 

  47. 	_trustedPathCount(0),
    48. 

  48. 	_amRoot(false)
    49. 

  49. {
    50. 

  50. 	// Get cached world if present
    51. 

  51. 	std::string dsWorld(RR->node->dataStoreGet("world"));
    52. 

  52. 	World cachedWorld;
    53. 

  53. 	if (dsWorld.length() > 0) {
    54. 

  54. 		try {
    55. 

  55. 			Buffer<ZT_WORLD_MAX_SERIALIZED_LENGTH> dswtmp(dsWorld.data(),(unsigned int)dsWorld.length());
    56. 

  56. 			cachedWorld.deserialize(dswtmp,0);
    57. 

  57. 		} catch ( ... ) {
    58. 

  58. 			cachedWorld = World(); // clear if cached world is invalid
    59. 

  59. 		}
    60. 

  60. 	}
    61. 

  61. 

  62. 	// Use default or cached world depending on which is shinier
    63. 

  63. 	World defaultWorld;
    64. 

  64. 	{
    65. 

  65. 		Buffer<ZT_DEFAULT_WORLD_LENGTH> wtmp(ZT_DEFAULT_WORLD,ZT_DEFAULT_WORLD_LENGTH);
    66. 

  66. 		defaultWorld.deserialize(wtmp,0); // throws on error, which would indicate a bad static variable up top
    67. 

  67. 	}
    68. 

  68. 	if (cachedWorld.shouldBeReplacedBy(defaultWorld,false)) {
    69. 

  69. 		_setWorld(defaultWorld);
    70. 

  70. 		if (dsWorld.length() > 0)
    71. 

  71. 			RR->node->dataStoreDelete("world");
    72. 

  72. 	} else _setWorld(cachedWorld);
    73. 

  73. }
    74. 

  74. 

  75. Topology::~Topology()
    76. 

  76. {
    77. 

  77. 	Buffer<ZT_PEER_SUGGESTED_SERIALIZATION_BUFFER_SIZE> *pbuf = 0;
    78. 

  78. 	try {
    79. 

  79. 		pbuf = new Buffer<ZT_PEER_SUGGESTED_SERIALIZATION_BUFFER_SIZE>();
    80. 

  80. 		std::string all;
    81. 

  81. 

  82. 		Address *a = (Address *)0;
    83. 

  83. 		SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
    84. 

  84. 		Hashtable< Address,SharedPtr<Peer> >::Iterator i(_peers);
    85. 

  85. 		while (i.next(a,p)) {
    86. 

  86. 			if (std::find(_rootAddresses.begin(),_rootAddresses.end(),*a) == _rootAddresses.end()) {
    87. 

  87. 				pbuf->clear();
    88. 

  88. 				try {
    89. 

  89. 					(*p)->serialize(*pbuf);
    90. 

  90. 					try {
    91. 

  91. 						all.append((const char *)pbuf->data(),pbuf->size());
    92. 

  92. 					} catch ( ... ) {
    93. 

  93. 						return; // out of memory? just skip
    94. 

  94. 					}
    95. 

  95. 				} catch ( ... ) {} // peer too big? shouldn't happen, but it so skip
    96. 

  96. 			}
    97. 

  97. 		}
    98. 

  98. 

  99. 		RR->node->dataStorePut("peers.save",all,true);
    100. 

  100. 

  101. 		delete pbuf;
    102. 

  102. 	} catch ( ... ) {
    103. 

  103. 		delete pbuf;
    104. 

  104. 	}
    105. 

  105. }
    106. 

  106. 

  107. SharedPtr<Peer> Topology::addPeer(const SharedPtr<Peer> &peer)
    108. 

  108. {
    109. 

  109. #ifdef ZT_TRACE
    110. 

  110. 	if ((!peer)||(peer->address() == RR->identity.address())) {
    111. 

  111. 		if (!peer)
    112. 

  112. 			fprintf(stderr,"FATAL BUG: addPeer() caught attempt to add NULL peer" ZT_EOL_S);
    113. 

  113. 		else fprintf(stderr,"FATAL BUG: addPeer() caught attempt to add peer for self" ZT_EOL_S);
    114. 

  114. 		abort();
    115. 

  115. 	}
    116. 

  116. #endif
    117. 

  117. 

  118. 	SharedPtr<Peer> np;
    119. 

  119. 	{
    120. 

  120. 		Mutex::Lock _l(_lock);
    121. 

  121. 		SharedPtr<Peer> &hp = _peers[peer->address()];
    122. 

  122. 		if (!hp)
    123. 

  123. 			hp = peer;
    124. 

  124. 		np = hp;
    125. 

  125. 	}
    126. 

  126. 

  127. 	np->use(RR->node->now());
    128. 

  128. 	saveIdentity(np->identity());
    129. 

  129. 

  130. 	return np;
    131. 

  131. }
    132. 

  132. 

  133. SharedPtr<Peer> Topology::getPeer(const Address &zta)
    134. 

  134. {
    135. 

  135. 	if (zta == RR->identity.address()) {
    136. 

  136. 		TRACE("BUG: ignored attempt to getPeer() for self, returned NULL");
    137. 

  137. 		return SharedPtr<Peer>();
    138. 

  138. 	}
    139. 

  139. 

  140. 	{
    141. 

  141. 		Mutex::Lock _l(_lock);
    142. 

  142. 		const SharedPtr<Peer> *const ap = _peers.get(zta);
    143. 

  143. 		if (ap) {
    144. 

  144. 			(*ap)->use(RR->node->now());
    145. 

  145. 			return *ap;
    146. 

  146. 		}
    147. 

  147. 	}
    148. 

  148. 

  149. 	try {
    150. 

  150. 		Identity id(_getIdentity(zta));
    151. 

  151. 		if (id) {
    152. 

  152. 			SharedPtr<Peer> np(new Peer(RR,RR->identity,id));
    153. 

  153. 			{
    154. 

  154. 				Mutex::Lock _l(_lock);
    155. 

  155. 				SharedPtr<Peer> &ap = _peers[zta];
    156. 

  156. 				if (!ap)
    157. 

  157. 					ap.swap(np);
    158. 

  158. 				ap->use(RR->node->now());
    159. 

  159. 				return ap;
    160. 

  160. 			}
    161. 

  161. 		}
    162. 

  162. 	} catch ( ... ) {
    163. 

  163. 		fprintf(stderr,"EXCEPTION in getPeer() part 2\n");
    164. 

  164. 		abort();
    165. 

  165. 	} // invalid identity on disk?
    166. 

  166. 

  167. 	return SharedPtr<Peer>();
    168. 

  168. }
    169. 

  169. 

  170. Identity Topology::getIdentity(const Address &zta)
    171. 

  171. {
    172. 

  172. 	if (zta == RR->identity.address()) {
    173. 

  173. 		return RR->identity;
    174. 

  174. 	} else {
    175. 

  175. 		Mutex::Lock _l(_lock);
    176. 

  176. 		const SharedPtr<Peer> *const ap = _peers.get(zta);
    177. 

  177. 		if (ap)
    178. 

  178. 			return (*ap)->identity();
    179. 

  179. 	}
    180. 

  180. 	return _getIdentity(zta);
    181. 

  181. }
    182. 

  182. 

  183. void Topology::saveIdentity(const Identity &id)
    184. 

  184. {
    185. 

  185. 	if (id) {
    186. 

  186. 		char p[128];
    187. 

  187. 		Utils::snprintf(p,sizeof(p),"iddb.d/%.10llx",(unsigned long long)id.address().toInt());
    188. 

  188. 		RR->node->dataStorePut(p,id.toString(false),false);
    189. 

  189. 	}
    190. 

  190. }
    191. 

  191. 

  192. SharedPtr<Peer> Topology::getBestRoot(const Address *avoid,unsigned int avoidCount,bool strictAvoid)
    193. 

  193. {
    194. 

  194. 	const uint64_t now = RR->node->now();
    195. 

  195. 	Mutex::Lock _l(_lock);
    196. 

  196. 

  197. 	if (_amRoot) {
    198. 

  198. 		/* If I am a root server, the "best" root server is the one whose address
    199. 

  199. 		 * is numerically greater than mine (with wrap at top of list). This
    200. 

  200. 		 * causes packets searching for a route to pretty much literally
    201. 

  201. 		 * circumnavigate the globe rather than bouncing between just two. */
    202. 

  202. 

  203. 		for(unsigned long p=0;p<_rootAddresses.size();++p) {
    204. 

  204. 			if (_rootAddresses[p] == RR->identity.address()) {
    205. 

  205. 				for(unsigned long q=1;q<_rootAddresses.size();++q) {
    206. 

  206. 					const SharedPtr<Peer> *const nextsn = _peers.get(_rootAddresses[(p + q) % _rootAddresses.size()]);
    207. 

  207. 					if ((nextsn)&&((*nextsn)->hasActiveDirectPath(now))) {
    208. 

  208. 						(*nextsn)->use(now);
    209. 

  209. 						return *nextsn;
    210. 

  210. 					}
    211. 

  211. 				}
    212. 

  212. 				break;
    213. 

  213. 			}
    214. 

  214. 		}
    215. 

  215. 

  216. 	} else {
    217. 

  217. 		/* If I am not a root server, the best root server is the active one with
    218. 

  218. 		 * the lowest quality score. (lower == better) */
    219. 

  219. 

  220. 		unsigned int bestQualityOverall = ~((unsigned int)0);
    221. 

  221. 		unsigned int bestQualityNotAvoid = ~((unsigned int)0);
    222. 

  222. 		const SharedPtr<Peer> *bestOverall = (const SharedPtr<Peer> *)0;
    223. 

  223. 		const SharedPtr<Peer> *bestNotAvoid = (const SharedPtr<Peer> *)0;
    224. 

  224. 

  225. 		for(std::vector< SharedPtr<Peer> >::const_iterator r(_rootPeers.begin());r!=_rootPeers.end();++r) {
    226. 

  226. 			bool avoiding = false;
    227. 

  227. 			for(unsigned int i=0;i<avoidCount;++i) {
    228. 

  228. 				if (avoid[i] == (*r)->address()) {
    229. 

  229. 					avoiding = true;
    230. 

  230. 					break;
    231. 

  231. 				}
    232. 

  232. 			}
    233. 

  233. 			const unsigned int q = (*r)->relayQuality(now);
    234. 

  234. 			if (q <= bestQualityOverall) {
    235. 

  235. 				bestQualityOverall = q;
    236. 

  236. 				bestOverall = &(*r);
    237. 

  237. 			}
    238. 

  238. 			if ((!avoiding)&&(q <= bestQualityNotAvoid)) {
    239. 

  239. 				bestQualityNotAvoid = q;
    240. 

  240. 				bestNotAvoid = &(*r);
    241. 

  241. 			}
    242. 

  242. 		}
    243. 

  243. 

  244. 		if (bestNotAvoid) {
    245. 

  245. 			(*bestNotAvoid)->use(now);
    246. 

  246. 			return *bestNotAvoid;
    247. 

  247. 		} else if ((!strictAvoid)&&(bestOverall)) {
    248. 

  248. 			(*bestOverall)->use(now);
    249. 

  249. 			return *bestOverall;
    250. 

  250. 		}
    251. 

  251. 

  252. 	}
    253. 

  253. 

  254. 	return SharedPtr<Peer>();
    255. 

  255. }
    256. 

  256. 

  257. bool Topology::isUpstream(const Identity &id) const
    258. 

  258. {
    259. 

  259. 	return isRoot(id);
    260. 

  260. }
    261. 

  261. 

  262. bool Topology::worldUpdateIfValid(const World &newWorld)
    263. 

  263. {
    264. 

  264. 	Mutex::Lock _l(_lock);
    265. 

  265. 	if (_world.shouldBeReplacedBy(newWorld,true)) {
    266. 

  266. 		_setWorld(newWorld);
    267. 

  267. 		try {
    268. 

  268. 			Buffer<ZT_WORLD_MAX_SERIALIZED_LENGTH> dswtmp;
    269. 

  269. 			newWorld.serialize(dswtmp,false);
    270. 

  270. 			RR->node->dataStorePut("world",dswtmp.data(),dswtmp.size(),false);
    271. 

  271. 		} catch ( ... ) {
    272. 

  272. 			RR->node->dataStoreDelete("world");
    273. 

  273. 		}
    274. 

  274. 		return true;
    275. 

  275. 	}
    276. 

  276. 	return false;
    277. 

  277. }
    278. 

  278. 

  279. void Topology::clean(uint64_t now)
    280. 

  280. {
    281. 

  281. 	Mutex::Lock _l(_lock);
    282. 

  282. 	Hashtable< Address,SharedPtr<Peer> >::Iterator i(_peers);
    283. 

  283. 	Address *a = (Address *)0;
    284. 

  284. 	SharedPtr<Peer> *p = (SharedPtr<Peer> *)0;
    285. 

  285. 	while (i.next(a,p)) {
    286. 

  286. 		if (((now - (*p)->lastUsed()) >= ZT_PEER_IN_MEMORY_EXPIRATION)&&(std::find(_rootAddresses.begin(),_rootAddresses.end(),*a) == _rootAddresses.end())) {
    287. 

  287. 			_peers.erase(*a);
    288. 

  288. 		} else {
    289. 

  289. 			(*p)->clean(now);
    290. 

  290. 		}
    291. 

  291. 	}
    292. 

  292. }
    293. 

  293. 

  294. Identity Topology::_getIdentity(const Address &zta)
    295. 

  295. {
    296. 

  296. 	char p[128];
    297. 

  297. 	Utils::snprintf(p,sizeof(p),"iddb.d/%.10llx",(unsigned long long)zta.toInt());
    298. 

  298. 	std::string ids(RR->node->dataStoreGet(p));
    299. 

  299. 	if (ids.length() > 0) {
    300. 

  300. 		try {
    301. 

  301. 			return Identity(ids);
    302. 

  302. 		} catch ( ... ) {} // ignore invalid IDs
    303. 

  303. 	}
    304. 

  304. 	return Identity();
    305. 

  305. }
    306. 

  306. 

  307. void Topology::_setWorld(const World &newWorld)
    308. 

  308. {
    309. 

  309. 	// assumed _lock is locked (or in constructor)
    310. 

  310. 	_world = newWorld;
    311. 

  311. 	_amRoot = false;
    312. 

  312. 	_rootAddresses.clear();
    313. 

  313. 	_rootPeers.clear();
    314. 

  314. 	for(std::vector<World::Root>::const_iterator r(_world.roots().begin());r!=_world.roots().end();++r) {
    315. 

  315. 		_rootAddresses.push_back(r->identity.address());
    316. 

  316. 		if (r->identity.address() == RR->identity.address()) {
    317. 

  317. 			_amRoot = true;
    318. 

  318. 		} else {
    319. 

  319. 			SharedPtr<Peer> *rp = _peers.get(r->identity.address());
    320. 

  320. 			if (rp) {
    321. 

  321. 				_rootPeers.push_back(*rp);
    322. 

  322. 			} else {
    323. 

  323. 				SharedPtr<Peer> newrp(new Peer(RR,RR->identity,r->identity));
    324. 

  324. 				_peers.set(r->identity.address(),newrp);
    325. 

  325. 				_rootPeers.push_back(newrp);
    326. 

  326. 			}
    327. 

  327. 		}
    328. 

  328. 	}
    329. 

  329. }
    330. 

  330. 

  331. } // namespace ZeroTier
    332.