1
0

Beacon_test.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277
  1. /* vim: set expandtab ts=4 sw=4: */
  2. /*
  3. * You may redistribute this program and/or modify it under the terms of
  4. * the GNU General Public License as published by the Free Software Foundation,
  5. * either version 3 of the License, or (at your option) any later version.
  6. *
  7. * This program is distributed in the hope that it will be useful,
  8. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. * GNU General Public License for more details.
  11. *
  12. * You should have received a copy of the GNU General Public License
  13. * along with this program. If not, see <https://www.gnu.org/licenses/>.
  14. */
  15. #ifdef SUBNODE
  16. // TODO(cjd): Subnode beacon testing
  17. int main()
  18. {
  19. return 0;
  20. }
  21. #else
  22. #include "crypto/Key.h"
  23. #include "io/FileWriter.h"
  24. #include "memory/MallocAllocator.h"
  25. #include "memory/Allocator.h"
  26. #include "crypto/random/Random.h"
  27. #include "interface/Iface.h"
  28. #include "util/Base32.h"
  29. #include "util/Checksum.h"
  30. #include "util/log/WriterLog.h"
  31. #include "test/TestFramework.h"
  32. #include "wire/Headers.h"
  33. #include "wire/Ethernet.h"
  34. #include "interface/tuntap/TUNMessageType.h"
  35. #include "util/Hex.h"
  36. #include "util/events/Time.h"
  37. #include "util/events/Timeout.h"
  38. #include "dht/dhtcore/NodeStore.h"
  39. #include "dht/Pathfinder_pvt.h"
  40. #include <stdio.h>
  41. struct TwoNodes;
  42. typedef void (RunTest)(struct TwoNodes* ctx);
  43. struct TwoNodes
  44. {
  45. struct TestFramework* nodeB;
  46. struct Iface tunB;
  47. struct TestFramework* nodeA;
  48. struct Iface tunA;
  49. int messageFrom;
  50. bool beaconsSent;
  51. struct Timeout* checkLinkageTimeout;
  52. struct Log* logger;
  53. struct EventBase* base;
  54. struct Allocator* alloc;
  55. uint64_t startTime;
  56. RunTest* runTest;
  57. Identity
  58. };
  59. #define TUNB 2
  60. #define TUNA 1
  61. static Iface_DEFUN incomingTunB(struct Message* msg, struct Iface* tunB)
  62. {
  63. struct TwoNodes* tn = Identity_containerOf(tunB, struct TwoNodes, tunB);
  64. uint16_t t = Er_assert(TUNMessageType_pop(msg));
  65. Assert_true(t == Ethernet_TYPE_IP6);
  66. Er_assert(Message_eshift(msg, -Headers_IP6Header_SIZE));
  67. printf("Message from TUN in node B [%s]\n", msg->bytes);
  68. tn->messageFrom = TUNB;
  69. return 0;
  70. }
  71. static Iface_DEFUN incomingTunA(struct Message* msg, struct Iface* tunA)
  72. {
  73. struct TwoNodes* tn = Identity_containerOf(tunA, struct TwoNodes, tunA);
  74. uint16_t t = Er_assert(TUNMessageType_pop(msg));
  75. Assert_true(t == Ethernet_TYPE_IP6);
  76. Er_assert(Message_eshift(msg, -Headers_IP6Header_SIZE));
  77. uint8_t buff[1024];
  78. Hex_encode(buff, 1024, msg->bytes, msg->length);
  79. printf("Message from TUN in node A [%s] [%d] [%s]\n", msg->bytes, msg->length, buff);
  80. tn->messageFrom = TUNA;
  81. return 0;
  82. }
  83. static void notLinkedYet(struct TwoNodes* ctx)
  84. {
  85. uint64_t now = Time_currentTimeMilliseconds(ctx->base);
  86. if ((now - ctx->startTime) > 5000) {
  87. Assert_failure("Failed to link in 5 seconds");
  88. }
  89. }
  90. static void checkLinkage(void* vTwoNodes)
  91. {
  92. struct TwoNodes* ctx = Identity_check((struct TwoNodes*) vTwoNodes);
  93. if (!ctx->beaconsSent) {
  94. if (Pathfinder_getNodeStore(ctx->nodeA->pathfinder) &&
  95. Pathfinder_getNodeStore(ctx->nodeB->pathfinder))
  96. {
  97. Log_debug(ctx->logger, "Linking A and B");
  98. TestFramework_linkNodes(ctx->nodeB, ctx->nodeA, true);
  99. ctx->beaconsSent = true;
  100. }
  101. return;
  102. }
  103. if (Pathfinder_getNodeStore(ctx->nodeA->pathfinder)->nodeCount < 2) {
  104. notLinkedYet(ctx);
  105. return;
  106. }
  107. Log_debug(ctx->logger, "A seems to be linked with B");
  108. if (Pathfinder_getNodeStore(ctx->nodeB->pathfinder)->nodeCount < 2) {
  109. notLinkedYet(ctx);
  110. return;
  111. }
  112. Log_debug(ctx->logger, "B seems to be linked with A");
  113. Log_debug(ctx->logger, "\n\nSetup Complete\n\n");
  114. Timeout_clearTimeout(ctx->checkLinkageTimeout);
  115. ctx->runTest(ctx);
  116. }
  117. static void start(struct Allocator* alloc,
  118. struct Log* logger,
  119. struct EventBase* base,
  120. struct Random* rand,
  121. RunTest* runTest)
  122. {
  123. #if defined(ADDRESS_PREFIX) || defined(ADDRESS_PREFIX_BITS)
  124. uint8_t address[16];
  125. uint8_t publicKey[32];
  126. uint8_t privateKeyA[32];
  127. Key_gen(address, publicKey, privateKeyA, rand);
  128. struct TestFramework* a =
  129. TestFramework_setUp((char*) privateKeyA, alloc, base, rand, logger);
  130. uint8_t privateKeyB[32];
  131. Key_gen(address, publicKey, privateKeyB, rand);
  132. struct TestFramework* b =
  133. TestFramework_setUp((char*) privateKeyB, alloc, base, rand, logger);
  134. #else
  135. struct TestFramework* a =
  136. TestFramework_setUp("\xad\x7e\xa3\x26\xaa\x01\x94\x0a\x25\xbc\x9e\x01\x26\x22\xdb\x69"
  137. "\x4f\xd9\xb4\x17\x7c\xf3\xf8\x91\x16\xf3\xcf\xe8\x5c\x80\xe1\x4a",
  138. alloc, base, rand, logger);
  139. //"publicKey": "kmzm4w0kj9bswd5qmx74nu7kusv5pj40vcsmp781j6xxgpd59z00.k",
  140. //"ipv6": "fc41:94b5:0925:7ba9:3959:11ab:a006:367a",
  141. struct TestFramework* b =
  142. TestFramework_setUp("\xd8\x54\x3e\x70\xb9\xae\x7c\x41\xbc\x18\xa4\x9a\x9c\xee\xca\x9c"
  143. "\xdc\x45\x01\x96\x6b\xbd\x7e\x76\xcf\x3a\x9f\xbc\x12\xed\x8b\xb4",
  144. alloc, base, rand, logger);
  145. //"publicKey": "vz21tg07061s8v9mckrvgtfds7j2u5lst8cwl6nqhp81njrh5wg0.k",
  146. //"ipv6": "fc1f:5b96:e1c5:625d:afde:2523:a7fa:383a",
  147. #endif
  148. struct TwoNodes* out = Allocator_calloc(alloc, sizeof(struct TwoNodes), 1);
  149. Identity_set(out);
  150. out->tunB.send = incomingTunB;
  151. out->tunA.send = incomingTunA;
  152. Iface_plumb(&out->tunB, b->tunIf);
  153. Iface_plumb(&out->tunA, a->tunIf);
  154. out->nodeB = b;
  155. out->nodeA = a;
  156. out->logger = logger;
  157. out->checkLinkageTimeout = Timeout_setInterval(checkLinkage, out, 1, base, alloc);
  158. out->base = base;
  159. out->startTime = Time_currentTimeMilliseconds(base);
  160. out->runTest = runTest;
  161. out->alloc = alloc;
  162. Log_debug(a->logger, "Waiting for nodes to link asynchronously...");
  163. }
  164. #define STACKMSG(name, messageLength, amountOfPadding) \
  165. uint8_t UniqueName_get()[messageLength + amountOfPadding]; \
  166. name = &(struct Message){ \
  167. .length = messageLength, \
  168. .bytes = UniqueName_last() + amountOfPadding, \
  169. .padding = amountOfPadding, \
  170. .capacity = messageLength \
  171. }
  172. static void sendMessage(struct TwoNodes* tn,
  173. char* message,
  174. struct TestFramework* from,
  175. struct TestFramework* to)
  176. {
  177. struct Message* msg;
  178. STACKMSG(msg, 64, 512);
  179. Bits_memcpy(msg->bytes, message, CString_strlen(message) + 1);
  180. msg->length = CString_strlen(message) + 1;
  181. TestFramework_craftIPHeader(msg, from->ip, to->ip);
  182. msg = Message_clone(msg, from->alloc);
  183. struct Iface* fromIf;
  184. if (from == tn->nodeA) {
  185. fromIf = &tn->tunA;
  186. } else if (from == tn->nodeB) {
  187. fromIf = &tn->tunB;
  188. } else {
  189. Assert_true(false);
  190. }
  191. Er_assert(TUNMessageType_push(msg, Ethernet_TYPE_IP6));
  192. Iface_send(fromIf, msg);
  193. if (to == tn->nodeA) {
  194. Assert_true(tn->messageFrom == TUNA);
  195. } else if (to == tn->nodeB) {
  196. Assert_true(tn->messageFrom == TUNB);
  197. } else {
  198. Assert_true(false);
  199. }
  200. TestFramework_assertLastMessageUnaltered(tn->nodeA);
  201. TestFramework_assertLastMessageUnaltered(tn->nodeB);
  202. tn->messageFrom = 0;
  203. }
  204. static void runTest(struct TwoNodes* tn)
  205. {
  206. sendMessage(tn, "Hello World!", tn->nodeA, tn->nodeB);
  207. sendMessage(tn, "Hello cjdns!", tn->nodeB, tn->nodeA);
  208. sendMessage(tn, "send", tn->nodeA, tn->nodeB);
  209. sendMessage(tn, "a", tn->nodeB, tn->nodeA);
  210. sendMessage(tn, "few", tn->nodeA, tn->nodeB);
  211. sendMessage(tn, "packets", tn->nodeB, tn->nodeA);
  212. sendMessage(tn, "to", tn->nodeA, tn->nodeB);
  213. sendMessage(tn, "make", tn->nodeB, tn->nodeA);
  214. sendMessage(tn, "sure", tn->nodeA, tn->nodeB);
  215. sendMessage(tn, "the", tn->nodeB, tn->nodeA);
  216. sendMessage(tn, "cryptoauth", tn->nodeA, tn->nodeB);
  217. sendMessage(tn, "can", tn->nodeB, tn->nodeA);
  218. sendMessage(tn, "establish", tn->nodeA, tn->nodeB);
  219. Log_debug(tn->logger, "\n\nTest passed, shutting down\n\n");
  220. Allocator_free(tn->alloc);
  221. }
  222. /** Check if nodes A and C can communicate via B without A knowing that C exists. */
  223. int main()
  224. {
  225. struct Allocator* alloc = MallocAllocator_new(1<<22);
  226. struct Writer* logwriter = FileWriter_new(stdout, alloc);
  227. struct Log* logger = WriterLog_new(logwriter, alloc);
  228. struct Random* rand = Random_new(alloc, logger, NULL);
  229. struct EventBase* base = EventBase_new(alloc);
  230. start(Allocator_child(alloc), logger, base, rand, runTest);
  231. EventBase_beginLoop(base);
  232. Allocator_free(alloc);
  233. return 0;
  234. }
  235. #endif