BeaconFramework.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  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. #include "test/BeaconFramework.h"
  16. #include "io/FileWriter.h"
  17. #include "memory/Allocator.h"
  18. #include "crypto/random/Random.h"
  19. #include "interface/Iface.h"
  20. #include "util/events/EventBase.h"
  21. #include "util/log/WriterLog.h"
  22. #include "test/TestFramework.h"
  23. #include "wire/Headers.h"
  24. #include "wire/Ethernet.h"
  25. #include "interface/tuntap/TUNMessageType.h"
  26. #include "util/Hex.h"
  27. #include "util/events/Time.h"
  28. #include "util/events/Timeout.h"
  29. #include <stdio.h>
  30. struct TwoNodes;
  31. typedef void (RunTest)(struct TwoNodes* ctx);
  32. struct TwoNodes
  33. {
  34. struct TestFramework* nodeB;
  35. struct Iface tunB;
  36. struct TestFramework* nodeA;
  37. struct Iface tunA;
  38. int messageFrom;
  39. bool beaconsSent;
  40. struct Timeout* checkLinkageTimeout;
  41. struct Log* logger;
  42. EventBase_t* base;
  43. struct Allocator* alloc;
  44. uint64_t startTime;
  45. RunTest* runTest;
  46. Identity
  47. };
  48. #define TUNB 2
  49. #define TUNA 1
  50. static Iface_DEFUN incomingTunB(Message_t* msg, struct Iface* tunB)
  51. {
  52. struct TwoNodes* tn = Identity_containerOf(tunB, struct TwoNodes, tunB);
  53. uint16_t t = -1;
  54. Err(TUNMessageType_pop(&t, msg));
  55. Assert_true(t == Ethernet_TYPE_IP6);
  56. Err(Message_eshift(msg, -Headers_IP6Header_SIZE));
  57. printf("Message from TUN in node B [%s]\n", Message_bytes(msg));
  58. tn->messageFrom = TUNB;
  59. return NULL;
  60. }
  61. static Iface_DEFUN incomingTunA(Message_t* msg, struct Iface* tunA)
  62. {
  63. struct TwoNodes* tn = Identity_containerOf(tunA, struct TwoNodes, tunA);
  64. uint16_t t = -1;
  65. Err(TUNMessageType_pop(&t, msg));
  66. Assert_true(t == Ethernet_TYPE_IP6);
  67. Err(Message_eshift(msg, -Headers_IP6Header_SIZE));
  68. uint8_t buff[1024];
  69. Hex_encode(buff, 1024, Message_bytes(msg), Message_getLength(msg));
  70. printf("Message from TUN in node A [%s] [%d] [%s]\n", Message_bytes(msg), Message_getLength(msg), buff);
  71. tn->messageFrom = TUNA;
  72. return NULL;
  73. }
  74. static void notLinkedYet(struct TwoNodes* ctx)
  75. {
  76. uint64_t now = Time_currentTimeMilliseconds();
  77. if ((now - ctx->startTime) > 5000) {
  78. Assert_failure("Failed to link in 5 seconds");
  79. }
  80. }
  81. static void checkLinkage(void* vTwoNodes)
  82. {
  83. struct TwoNodes* ctx = Identity_check((struct TwoNodes*) vTwoNodes);
  84. if (!ctx->beaconsSent) {
  85. Log_debug(ctx->logger, "Linking A and B");
  86. TestFramework_linkNodes(ctx->nodeB, ctx->nodeA, true);
  87. ctx->beaconsSent = true;
  88. return;
  89. }
  90. //Log_debug(ctx->logger, "Checking linkage");
  91. if (SessionManager_handleCount(ctx->nodeA->nc->sm) < 1) {
  92. notLinkedYet(ctx);
  93. return;
  94. }
  95. Log_debug(ctx->logger, "A seems to be linked with B");
  96. if (SessionManager_handleCount(ctx->nodeA->nc->sm) < 1) {
  97. notLinkedYet(ctx);
  98. return;
  99. }
  100. Log_debug(ctx->logger, "B seems to be linked with A");
  101. Log_debug(ctx->logger, "\n\nSetup Complete\n\n");
  102. Timeout_clearTimeout(ctx->checkLinkageTimeout);
  103. ctx->runTest(ctx);
  104. }
  105. static void start(struct Allocator* alloc,
  106. struct Log* logger,
  107. EventBase_t* base,
  108. struct Random* rand,
  109. RunTest* runTest,
  110. bool noiseA,
  111. bool noiseB)
  112. {
  113. #if defined(ADDRESS_PREFIX) || defined(ADDRESS_PREFIX_BITS)
  114. uint8_t address[16];
  115. uint8_t publicKey[32];
  116. uint8_t privateKeyA[32];
  117. Key_gen(address, publicKey, privateKeyA, rand);
  118. struct TestFramework* a =
  119. TestFramework_setUp((char*) privateKeyA, alloc, base, rand, logger, noiseA);
  120. uint8_t privateKeyB[32];
  121. Key_gen(address, publicKey, privateKeyB, rand);
  122. struct TestFramework* b =
  123. TestFramework_setUp((char*) privateKeyB, alloc, base, rand, logger, noiseB);
  124. #else
  125. struct TestFramework* a =
  126. TestFramework_setUp("\xad\x7e\xa3\x26\xaa\x01\x94\x0a\x25\xbc\x9e\x01\x26\x22\xdb\x69"
  127. "\x4f\xd9\xb4\x17\x7c\xf3\xf8\x91\x16\xf3\xcf\xe8\x5c\x80\xe1\x4a",
  128. alloc, base, rand, logger, noiseA);
  129. //"publicKey": "kmzm4w0kj9bswd5qmx74nu7kusv5pj40vcsmp781j6xxgpd59z00.k",
  130. //"ipv6": "fc41:94b5:0925:7ba9:3959:11ab:a006:367a",
  131. struct TestFramework* b =
  132. TestFramework_setUp("\xd8\x54\x3e\x70\xb9\xae\x7c\x41\xbc\x18\xa4\x9a\x9c\xee\xca\x9c"
  133. "\xdc\x45\x01\x96\x6b\xbd\x7e\x76\xcf\x3a\x9f\xbc\x12\xed\x8b\xb4",
  134. alloc, base, rand, logger, noiseB);
  135. //"publicKey": "vz21tg07061s8v9mckrvgtfds7j2u5lst8cwl6nqhp81njrh5wg0.k",
  136. //"ipv6": "fc1f:5b96:e1c5:625d:afde:2523:a7fa:383a",
  137. #endif
  138. struct TwoNodes* out = Allocator_calloc(alloc, sizeof(struct TwoNodes), 1);
  139. Identity_set(out);
  140. out->tunB.send = incomingTunB;
  141. out->tunA.send = incomingTunA;
  142. Iface_plumb(&out->tunB, b->tunIf);
  143. Iface_plumb(&out->tunA, a->tunIf);
  144. out->nodeB = b;
  145. out->nodeA = a;
  146. out->logger = logger;
  147. out->checkLinkageTimeout = Timeout_setInterval(checkLinkage, out, 1, base, alloc);
  148. out->base = base;
  149. out->startTime = Time_currentTimeMilliseconds();
  150. out->runTest = runTest;
  151. out->alloc = alloc;
  152. Log_debug(a->logger, "Waiting for nodes to link asynchronously...");
  153. }
  154. static void sendMessage(struct TwoNodes* tn,
  155. char* message,
  156. struct TestFramework* from,
  157. struct TestFramework* to)
  158. {
  159. Message_t* msg = Message_new(64, 512, from->alloc);
  160. uint8_t* b = NULL;
  161. Err_assert(Message_peakBytes(&b, msg, 64));
  162. CString_strcpy(b, message);
  163. Err_assert(Message_truncate(msg, CString_strlen(message) + 1));
  164. TestFramework_craftIPHeader(msg, from->ip, to->ip);
  165. struct Iface* fromIf;
  166. if (from == tn->nodeA) {
  167. fromIf = &tn->tunA;
  168. } else if (from == tn->nodeB) {
  169. fromIf = &tn->tunB;
  170. } else {
  171. Assert_true(false);
  172. }
  173. Err_assert(TUNMessageType_push(msg, Ethernet_TYPE_IP6));
  174. RTypes_Error_t* err = Iface_send(fromIf, msg);
  175. if (err) {
  176. Assert_failure("%s\n", Rffi_printError(err, tn->alloc));
  177. }
  178. if (to == tn->nodeA) {
  179. Assert_true(tn->messageFrom == TUNA);
  180. } else if (to == tn->nodeB) {
  181. Assert_true(tn->messageFrom == TUNB);
  182. } else {
  183. Assert_true(false);
  184. }
  185. TestFramework_assertLastMessageUnaltered(tn->nodeA);
  186. TestFramework_assertLastMessageUnaltered(tn->nodeB);
  187. tn->messageFrom = 0;
  188. }
  189. static void runTest(struct TwoNodes* tn)
  190. {
  191. sendMessage(tn, "Hello World!", tn->nodeA, tn->nodeB);
  192. sendMessage(tn, "Hello cjdns!", tn->nodeB, tn->nodeA);
  193. sendMessage(tn, "send", tn->nodeA, tn->nodeB);
  194. sendMessage(tn, "a", tn->nodeB, tn->nodeA);
  195. sendMessage(tn, "few", tn->nodeA, tn->nodeB);
  196. sendMessage(tn, "packets", tn->nodeB, tn->nodeA);
  197. sendMessage(tn, "to", tn->nodeA, tn->nodeB);
  198. sendMessage(tn, "make", tn->nodeB, tn->nodeA);
  199. sendMessage(tn, "sure", tn->nodeA, tn->nodeB);
  200. sendMessage(tn, "the", tn->nodeB, tn->nodeA);
  201. sendMessage(tn, "cryptoauth", tn->nodeA, tn->nodeB);
  202. sendMessage(tn, "can", tn->nodeB, tn->nodeA);
  203. sendMessage(tn, "establish", tn->nodeA, tn->nodeB);
  204. Log_debug(tn->logger, "\n\nTest passed, shutting down\n\n");
  205. EventBase_t* base = tn->base;
  206. Allocator_free(tn->alloc);
  207. EventBase_endLoop(base);
  208. }
  209. /** Check if nodes A and C can communicate via B without A knowing that C exists. */
  210. int BeaconFramework_test(bool noiseA, bool noiseB)
  211. {
  212. struct Allocator* alloc = Allocator_new(1<<22);
  213. struct Writer* logwriter = FileWriter_new(stdout, alloc);
  214. struct Log* logger = WriterLog_new(logwriter, alloc);
  215. struct Random* rand = NULL;
  216. Err_assert(Random_new(&rand, alloc, logger));
  217. EventBase_t* base = EventBase_new(alloc);
  218. start(Allocator_child(alloc), logger, base, rand, runTest, noiseA, noiseB);
  219. EventBase_beginLoop(base);
  220. Allocator_free(alloc);
  221. return 0;
  222. }