udp_proxy.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011
  1. /*
  2. * UDP proxy: emulate an unreliable UDP connexion for DTLS testing
  3. *
  4. * Copyright The Mbed TLS Contributors
  5. * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
  6. *
  7. * This file is provided under the Apache License 2.0, or the
  8. * GNU General Public License v2.0 or later.
  9. *
  10. * **********
  11. * Apache License 2.0:
  12. *
  13. * Licensed under the Apache License, Version 2.0 (the "License"); you may
  14. * not use this file except in compliance with the License.
  15. * You may obtain a copy of the License at
  16. *
  17. * http://www.apache.org/licenses/LICENSE-2.0
  18. *
  19. * Unless required by applicable law or agreed to in writing, software
  20. * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
  21. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  22. * See the License for the specific language governing permissions and
  23. * limitations under the License.
  24. *
  25. * **********
  26. *
  27. * **********
  28. * GNU General Public License v2.0 or later:
  29. *
  30. * This program is free software; you can redistribute it and/or modify
  31. * it under the terms of the GNU General Public License as published by
  32. * the Free Software Foundation; either version 2 of the License, or
  33. * (at your option) any later version.
  34. *
  35. * This program is distributed in the hope that it will be useful,
  36. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  37. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  38. * GNU General Public License for more details.
  39. *
  40. * You should have received a copy of the GNU General Public License along
  41. * with this program; if not, write to the Free Software Foundation, Inc.,
  42. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  43. *
  44. * **********
  45. */
  46. /*
  47. * Warning: this is an internal utility program we use for tests.
  48. * It does break some abstractions from the NET layer, and is thus NOT an
  49. * example of good general usage.
  50. */
  51. #if !defined(MBEDTLS_CONFIG_FILE)
  52. #include "mbedtls/config.h"
  53. #else
  54. #include MBEDTLS_CONFIG_FILE
  55. #endif
  56. #if defined(MBEDTLS_PLATFORM_C)
  57. #include "mbedtls/platform.h"
  58. #else
  59. #include <stdio.h>
  60. #include <stdlib.h>
  61. #include <time.h>
  62. #define mbedtls_time time
  63. #define mbedtls_time_t time_t
  64. #define mbedtls_printf printf
  65. #define mbedtls_calloc calloc
  66. #define mbedtls_free free
  67. #define mbedtls_exit exit
  68. #define MBEDTLS_EXIT_SUCCESS EXIT_SUCCESS
  69. #define MBEDTLS_EXIT_FAILURE EXIT_FAILURE
  70. #endif /* MBEDTLS_PLATFORM_C */
  71. #if !defined(MBEDTLS_NET_C)
  72. int main( void )
  73. {
  74. mbedtls_printf( "MBEDTLS_NET_C not defined.\n" );
  75. mbedtls_exit( 0 );
  76. }
  77. #else
  78. #include "mbedtls/net_sockets.h"
  79. #include "mbedtls/error.h"
  80. #include "mbedtls/ssl.h"
  81. #include "mbedtls/timing.h"
  82. #include <string.h>
  83. /* For select() */
  84. #if (defined(_WIN32) || defined(_WIN32_WCE)) && !defined(EFIX64) && \
  85. !defined(EFI32)
  86. #include <winsock2.h>
  87. #include <windows.h>
  88. #if defined(_MSC_VER)
  89. #if defined(_WIN32_WCE)
  90. #pragma comment( lib, "ws2.lib" )
  91. #else
  92. #pragma comment( lib, "ws2_32.lib" )
  93. #endif
  94. #endif /* _MSC_VER */
  95. #else /* ( _WIN32 || _WIN32_WCE ) && !EFIX64 && !EFI32 */
  96. #include <sys/time.h>
  97. #include <sys/types.h>
  98. #include <unistd.h>
  99. #endif /* ( _WIN32 || _WIN32_WCE ) && !EFIX64 && !EFI32 */
  100. #define MAX_MSG_SIZE 16384 + 2048 /* max record/datagram size */
  101. #define DFL_SERVER_ADDR "localhost"
  102. #define DFL_SERVER_PORT "4433"
  103. #define DFL_LISTEN_ADDR "localhost"
  104. #define DFL_LISTEN_PORT "5556"
  105. #define DFL_PACK 0
  106. #if defined(MBEDTLS_TIMING_C)
  107. #define USAGE_PACK \
  108. " pack=%%d default: 0 (don't pack)\n" \
  109. " options: t > 0 (pack for t milliseconds)\n"
  110. #else
  111. #define USAGE_PACK
  112. #endif
  113. #define USAGE \
  114. "\n usage: udp_proxy param=<>...\n" \
  115. "\n acceptable parameters:\n" \
  116. " server_addr=%%s default: localhost\n" \
  117. " server_port=%%d default: 4433\n" \
  118. " listen_addr=%%s default: localhost\n" \
  119. " listen_port=%%d default: 4433\n" \
  120. "\n" \
  121. " duplicate=%%d default: 0 (no duplication)\n" \
  122. " duplicate about 1:N packets randomly\n" \
  123. " delay=%%d default: 0 (no delayed packets)\n" \
  124. " delay about 1:N packets randomly\n" \
  125. " delay_ccs=0/1 default: 0 (don't delay ChangeCipherSpec)\n" \
  126. " delay_cli=%%s Handshake message from client that should be\n"\
  127. " delayed. Possible values are 'ClientHello',\n" \
  128. " 'Certificate', 'CertificateVerify', and\n" \
  129. " 'ClientKeyExchange'.\n" \
  130. " May be used multiple times, even for the same\n"\
  131. " message, in which case the respective message\n"\
  132. " gets delayed multiple times.\n" \
  133. " delay_srv=%%s Handshake message from server that should be\n"\
  134. " delayed. Possible values are 'HelloRequest',\n"\
  135. " 'ServerHello', 'ServerHelloDone', 'Certificate'\n"\
  136. " 'ServerKeyExchange', 'NewSessionTicket',\n"\
  137. " 'HelloVerifyRequest' and ''CertificateRequest'.\n"\
  138. " May be used multiple times, even for the same\n"\
  139. " message, in which case the respective message\n"\
  140. " gets delayed multiple times.\n" \
  141. " drop=%%d default: 0 (no dropped packets)\n" \
  142. " drop about 1:N packets randomly\n" \
  143. " mtu=%%d default: 0 (unlimited)\n" \
  144. " drop packets larger than N bytes\n" \
  145. " bad_ad=0/1 default: 0 (don't add bad ApplicationData)\n" \
  146. " protect_hvr=0/1 default: 0 (don't protect HelloVerifyRequest)\n" \
  147. " protect_len=%%d default: (don't protect packets of this size)\n" \
  148. " inject_clihlo=0/1 default: 0 (don't inject fake ClientHello)\n" \
  149. "\n" \
  150. " seed=%%d default: (use current time)\n" \
  151. USAGE_PACK \
  152. "\n"
  153. /*
  154. * global options
  155. */
  156. #define MAX_DELAYED_HS 10
  157. static struct options
  158. {
  159. const char *server_addr; /* address to forward packets to */
  160. const char *server_port; /* port to forward packets to */
  161. const char *listen_addr; /* address for accepting client connections */
  162. const char *listen_port; /* port for accepting client connections */
  163. int duplicate; /* duplicate 1 in N packets (none if 0) */
  164. int delay; /* delay 1 packet in N (none if 0) */
  165. int delay_ccs; /* delay ChangeCipherSpec */
  166. char* delay_cli[MAX_DELAYED_HS]; /* handshake types of messages from
  167. * client that should be delayed. */
  168. uint8_t delay_cli_cnt; /* Number of entries in delay_cli. */
  169. char* delay_srv[MAX_DELAYED_HS]; /* handshake types of messages from
  170. * server that should be delayed. */
  171. uint8_t delay_srv_cnt; /* Number of entries in delay_srv. */
  172. int drop; /* drop 1 packet in N (none if 0) */
  173. int mtu; /* drop packets larger than this */
  174. int bad_ad; /* inject corrupted ApplicationData record */
  175. int protect_hvr; /* never drop or delay HelloVerifyRequest */
  176. int protect_len; /* never drop/delay packet of the given size*/
  177. int inject_clihlo; /* inject fake ClientHello after handshake */
  178. unsigned pack; /* merge packets into single datagram for
  179. * at most \c merge milliseconds if > 0 */
  180. unsigned int seed; /* seed for "random" events */
  181. } opt;
  182. static void exit_usage( const char *name, const char *value )
  183. {
  184. if( value == NULL )
  185. mbedtls_printf( " unknown option or missing value: %s\n", name );
  186. else
  187. mbedtls_printf( " option %s: illegal value: %s\n", name, value );
  188. mbedtls_printf( USAGE );
  189. exit( 1 );
  190. }
  191. static void get_options( int argc, char *argv[] )
  192. {
  193. int i;
  194. char *p, *q;
  195. opt.server_addr = DFL_SERVER_ADDR;
  196. opt.server_port = DFL_SERVER_PORT;
  197. opt.listen_addr = DFL_LISTEN_ADDR;
  198. opt.listen_port = DFL_LISTEN_PORT;
  199. opt.pack = DFL_PACK;
  200. /* Other members default to 0 */
  201. opt.delay_cli_cnt = 0;
  202. opt.delay_srv_cnt = 0;
  203. memset( opt.delay_cli, 0, sizeof( opt.delay_cli ) );
  204. memset( opt.delay_srv, 0, sizeof( opt.delay_srv ) );
  205. for( i = 1; i < argc; i++ )
  206. {
  207. p = argv[i];
  208. if( ( q = strchr( p, '=' ) ) == NULL )
  209. exit_usage( p, NULL );
  210. *q++ = '\0';
  211. if( strcmp( p, "server_addr" ) == 0 )
  212. opt.server_addr = q;
  213. else if( strcmp( p, "server_port" ) == 0 )
  214. opt.server_port = q;
  215. else if( strcmp( p, "listen_addr" ) == 0 )
  216. opt.listen_addr = q;
  217. else if( strcmp( p, "listen_port" ) == 0 )
  218. opt.listen_port = q;
  219. else if( strcmp( p, "duplicate" ) == 0 )
  220. {
  221. opt.duplicate = atoi( q );
  222. if( opt.duplicate < 0 || opt.duplicate > 20 )
  223. exit_usage( p, q );
  224. }
  225. else if( strcmp( p, "delay" ) == 0 )
  226. {
  227. opt.delay = atoi( q );
  228. if( opt.delay < 0 || opt.delay > 20 || opt.delay == 1 )
  229. exit_usage( p, q );
  230. }
  231. else if( strcmp( p, "delay_ccs" ) == 0 )
  232. {
  233. opt.delay_ccs = atoi( q );
  234. if( opt.delay_ccs < 0 || opt.delay_ccs > 1 )
  235. exit_usage( p, q );
  236. }
  237. else if( strcmp( p, "delay_cli" ) == 0 ||
  238. strcmp( p, "delay_srv" ) == 0 )
  239. {
  240. uint8_t *delay_cnt;
  241. char **delay_list;
  242. size_t len;
  243. char *buf;
  244. if( strcmp( p, "delay_cli" ) == 0 )
  245. {
  246. delay_cnt = &opt.delay_cli_cnt;
  247. delay_list = opt.delay_cli;
  248. }
  249. else
  250. {
  251. delay_cnt = &opt.delay_srv_cnt;
  252. delay_list = opt.delay_srv;
  253. }
  254. if( *delay_cnt == MAX_DELAYED_HS )
  255. {
  256. mbedtls_printf( " too many uses of %s: only %d allowed\n",
  257. p, MAX_DELAYED_HS );
  258. exit_usage( p, NULL );
  259. }
  260. len = strlen( q );
  261. buf = mbedtls_calloc( 1, len + 1 );
  262. if( buf == NULL )
  263. {
  264. mbedtls_printf( " Allocation failure\n" );
  265. exit( 1 );
  266. }
  267. memcpy( buf, q, len + 1 );
  268. delay_list[ (*delay_cnt)++ ] = buf;
  269. }
  270. else if( strcmp( p, "drop" ) == 0 )
  271. {
  272. opt.drop = atoi( q );
  273. if( opt.drop < 0 || opt.drop > 20 || opt.drop == 1 )
  274. exit_usage( p, q );
  275. }
  276. else if( strcmp( p, "pack" ) == 0 )
  277. {
  278. #if defined(MBEDTLS_TIMING_C)
  279. opt.pack = (unsigned) atoi( q );
  280. #else
  281. mbedtls_printf( " option pack only defined if MBEDTLS_TIMING_C is enabled\n" );
  282. exit( 1 );
  283. #endif
  284. }
  285. else if( strcmp( p, "mtu" ) == 0 )
  286. {
  287. opt.mtu = atoi( q );
  288. if( opt.mtu < 0 || opt.mtu > MAX_MSG_SIZE )
  289. exit_usage( p, q );
  290. }
  291. else if( strcmp( p, "bad_ad" ) == 0 )
  292. {
  293. opt.bad_ad = atoi( q );
  294. if( opt.bad_ad < 0 || opt.bad_ad > 1 )
  295. exit_usage( p, q );
  296. }
  297. else if( strcmp( p, "protect_hvr" ) == 0 )
  298. {
  299. opt.protect_hvr = atoi( q );
  300. if( opt.protect_hvr < 0 || opt.protect_hvr > 1 )
  301. exit_usage( p, q );
  302. }
  303. else if( strcmp( p, "protect_len" ) == 0 )
  304. {
  305. opt.protect_len = atoi( q );
  306. if( opt.protect_len < 0 )
  307. exit_usage( p, q );
  308. }
  309. else if( strcmp( p, "inject_clihlo" ) == 0 )
  310. {
  311. opt.inject_clihlo = atoi( q );
  312. if( opt.inject_clihlo < 0 || opt.inject_clihlo > 1 )
  313. exit_usage( p, q );
  314. }
  315. else if( strcmp( p, "seed" ) == 0 )
  316. {
  317. opt.seed = atoi( q );
  318. if( opt.seed == 0 )
  319. exit_usage( p, q );
  320. }
  321. else
  322. exit_usage( p, NULL );
  323. }
  324. }
  325. static const char *msg_type( unsigned char *msg, size_t len )
  326. {
  327. if( len < 1 ) return( "Invalid" );
  328. switch( msg[0] )
  329. {
  330. case MBEDTLS_SSL_MSG_CHANGE_CIPHER_SPEC: return( "ChangeCipherSpec" );
  331. case MBEDTLS_SSL_MSG_ALERT: return( "Alert" );
  332. case MBEDTLS_SSL_MSG_APPLICATION_DATA: return( "ApplicationData" );
  333. case MBEDTLS_SSL_MSG_HANDSHAKE: break; /* See below */
  334. default: return( "Unknown" );
  335. }
  336. if( len < 13 + 12 ) return( "Invalid handshake" );
  337. /*
  338. * Our handshake message are less than 2^16 bytes long, so they should
  339. * have 0 as the first byte of length, frag_offset and frag_length.
  340. * Otherwise, assume they are encrypted.
  341. */
  342. if( msg[14] || msg[19] || msg[22] ) return( "Encrypted handshake" );
  343. switch( msg[13] )
  344. {
  345. case MBEDTLS_SSL_HS_HELLO_REQUEST: return( "HelloRequest" );
  346. case MBEDTLS_SSL_HS_CLIENT_HELLO: return( "ClientHello" );
  347. case MBEDTLS_SSL_HS_SERVER_HELLO: return( "ServerHello" );
  348. case MBEDTLS_SSL_HS_HELLO_VERIFY_REQUEST: return( "HelloVerifyRequest" );
  349. case MBEDTLS_SSL_HS_NEW_SESSION_TICKET: return( "NewSessionTicket" );
  350. case MBEDTLS_SSL_HS_CERTIFICATE: return( "Certificate" );
  351. case MBEDTLS_SSL_HS_SERVER_KEY_EXCHANGE: return( "ServerKeyExchange" );
  352. case MBEDTLS_SSL_HS_CERTIFICATE_REQUEST: return( "CertificateRequest" );
  353. case MBEDTLS_SSL_HS_SERVER_HELLO_DONE: return( "ServerHelloDone" );
  354. case MBEDTLS_SSL_HS_CERTIFICATE_VERIFY: return( "CertificateVerify" );
  355. case MBEDTLS_SSL_HS_CLIENT_KEY_EXCHANGE: return( "ClientKeyExchange" );
  356. case MBEDTLS_SSL_HS_FINISHED: return( "Finished" );
  357. default: return( "Unknown handshake" );
  358. }
  359. }
  360. #if defined(MBEDTLS_TIMING_C)
  361. /* Return elapsed time in milliseconds since the first call */
  362. static unsigned ellapsed_time( void )
  363. {
  364. static int initialized = 0;
  365. static struct mbedtls_timing_hr_time hires;
  366. if( initialized == 0 )
  367. {
  368. (void) mbedtls_timing_get_timer( &hires, 1 );
  369. initialized = 1;
  370. return( 0 );
  371. }
  372. return( mbedtls_timing_get_timer( &hires, 0 ) );
  373. }
  374. typedef struct
  375. {
  376. mbedtls_net_context *ctx;
  377. const char *description;
  378. unsigned packet_lifetime;
  379. unsigned num_datagrams;
  380. unsigned char data[MAX_MSG_SIZE];
  381. size_t len;
  382. } ctx_buffer;
  383. static ctx_buffer outbuf[2];
  384. static int ctx_buffer_flush( ctx_buffer *buf )
  385. {
  386. int ret;
  387. mbedtls_printf( " %05u flush %s: %u bytes, %u datagrams, last %u ms\n",
  388. ellapsed_time(), buf->description,
  389. (unsigned) buf->len, buf->num_datagrams,
  390. ellapsed_time() - buf->packet_lifetime );
  391. ret = mbedtls_net_send( buf->ctx, buf->data, buf->len );
  392. buf->len = 0;
  393. buf->num_datagrams = 0;
  394. return( ret );
  395. }
  396. static unsigned ctx_buffer_time_remaining( ctx_buffer *buf )
  397. {
  398. unsigned const cur_time = ellapsed_time();
  399. if( buf->num_datagrams == 0 )
  400. return( (unsigned) -1 );
  401. if( cur_time - buf->packet_lifetime >= opt.pack )
  402. return( 0 );
  403. return( opt.pack - ( cur_time - buf->packet_lifetime ) );
  404. }
  405. static int ctx_buffer_append( ctx_buffer *buf,
  406. const unsigned char * data,
  407. size_t len )
  408. {
  409. int ret;
  410. if( len > (size_t) INT_MAX )
  411. return( -1 );
  412. if( len > sizeof( buf->data ) )
  413. {
  414. mbedtls_printf( " ! buffer size %u too large (max %u)\n",
  415. (unsigned) len, (unsigned) sizeof( buf->data ) );
  416. return( -1 );
  417. }
  418. if( sizeof( buf->data ) - buf->len < len )
  419. {
  420. if( ( ret = ctx_buffer_flush( buf ) ) <= 0 )
  421. return( ret );
  422. }
  423. memcpy( buf->data + buf->len, data, len );
  424. buf->len += len;
  425. if( ++buf->num_datagrams == 1 )
  426. buf->packet_lifetime = ellapsed_time();
  427. return( (int) len );
  428. }
  429. #endif /* MBEDTLS_TIMING_C */
  430. static int dispatch_data( mbedtls_net_context *ctx,
  431. const unsigned char * data,
  432. size_t len )
  433. {
  434. #if defined(MBEDTLS_TIMING_C)
  435. ctx_buffer *buf = NULL;
  436. if( opt.pack > 0 )
  437. {
  438. if( outbuf[0].ctx == ctx )
  439. buf = &outbuf[0];
  440. else if( outbuf[1].ctx == ctx )
  441. buf = &outbuf[1];
  442. if( buf == NULL )
  443. return( -1 );
  444. return( ctx_buffer_append( buf, data, len ) );
  445. }
  446. #endif /* MBEDTLS_TIMING_C */
  447. return( mbedtls_net_send( ctx, data, len ) );
  448. }
  449. typedef struct
  450. {
  451. mbedtls_net_context *dst;
  452. const char *way;
  453. const char *type;
  454. unsigned len;
  455. unsigned char buf[MAX_MSG_SIZE];
  456. } packet;
  457. /* Print packet. Outgoing packets come with a reason (forward, dupl, etc.) */
  458. void print_packet( const packet *p, const char *why )
  459. {
  460. #if defined(MBEDTLS_TIMING_C)
  461. if( why == NULL )
  462. mbedtls_printf( " %05u dispatch %s %s (%u bytes)\n",
  463. ellapsed_time(), p->way, p->type, p->len );
  464. else
  465. mbedtls_printf( " %05u dispatch %s %s (%u bytes): %s\n",
  466. ellapsed_time(), p->way, p->type, p->len, why );
  467. #else
  468. if( why == NULL )
  469. mbedtls_printf( " dispatch %s %s (%u bytes)\n",
  470. p->way, p->type, p->len );
  471. else
  472. mbedtls_printf( " dispatch %s %s (%u bytes): %s\n",
  473. p->way, p->type, p->len, why );
  474. #endif
  475. fflush( stdout );
  476. }
  477. /*
  478. * In order to test the server's behaviour when receiving a ClientHello after
  479. * the connection is established (this could be a hard reset from the client,
  480. * but the server must not drop the existing connection before establishing
  481. * client reachability, see RFC 6347 Section 4.2.8), we memorize the first
  482. * ClientHello we see (which can't have a cookie), then replay it after the
  483. * first ApplicationData record - then we're done.
  484. *
  485. * This is controlled by the inject_clihlo option.
  486. *
  487. * We want an explicit state and a place to store the packet.
  488. */
  489. typedef enum {
  490. ICH_INIT, /* haven't seen the first ClientHello yet */
  491. ICH_CACHED, /* cached the initial ClientHello */
  492. ICH_INJECTED, /* ClientHello already injected, done */
  493. } inject_clihlo_state_t;
  494. static inject_clihlo_state_t inject_clihlo_state;
  495. static packet initial_clihlo;
  496. int send_packet( const packet *p, const char *why )
  497. {
  498. int ret;
  499. mbedtls_net_context *dst = p->dst;
  500. /* save initial ClientHello? */
  501. if( opt.inject_clihlo != 0 &&
  502. inject_clihlo_state == ICH_INIT &&
  503. strcmp( p->type, "ClientHello" ) == 0 )
  504. {
  505. memcpy( &initial_clihlo, p, sizeof( packet ) );
  506. inject_clihlo_state = ICH_CACHED;
  507. }
  508. /* insert corrupted ApplicationData record? */
  509. if( opt.bad_ad &&
  510. strcmp( p->type, "ApplicationData" ) == 0 )
  511. {
  512. unsigned char buf[MAX_MSG_SIZE];
  513. memcpy( buf, p->buf, p->len );
  514. if( p->len <= 13 )
  515. {
  516. mbedtls_printf( " ! can't corrupt empty AD record" );
  517. }
  518. else
  519. {
  520. ++buf[13];
  521. print_packet( p, "corrupted" );
  522. }
  523. if( ( ret = dispatch_data( dst, buf, p->len ) ) <= 0 )
  524. {
  525. mbedtls_printf( " ! dispatch returned %d\n", ret );
  526. return( ret );
  527. }
  528. }
  529. print_packet( p, why );
  530. if( ( ret = dispatch_data( dst, p->buf, p->len ) ) <= 0 )
  531. {
  532. mbedtls_printf( " ! dispatch returned %d\n", ret );
  533. return( ret );
  534. }
  535. /* Don't duplicate Application Data, only handshake covered */
  536. if( opt.duplicate != 0 &&
  537. strcmp( p->type, "ApplicationData" ) != 0 &&
  538. rand() % opt.duplicate == 0 )
  539. {
  540. print_packet( p, "duplicated" );
  541. if( ( ret = dispatch_data( dst, p->buf, p->len ) ) <= 0 )
  542. {
  543. mbedtls_printf( " ! dispatch returned %d\n", ret );
  544. return( ret );
  545. }
  546. }
  547. /* Inject ClientHello after first ApplicationData */
  548. if( opt.inject_clihlo != 0 &&
  549. inject_clihlo_state == ICH_CACHED &&
  550. strcmp( p->type, "ApplicationData" ) == 0 )
  551. {
  552. print_packet( &initial_clihlo, "injected" );
  553. if( ( ret = dispatch_data( dst, initial_clihlo.buf,
  554. initial_clihlo.len ) ) <= 0 )
  555. {
  556. mbedtls_printf( " ! dispatch returned %d\n", ret );
  557. return( ret );
  558. }
  559. inject_clihlo_state = ICH_INJECTED;
  560. }
  561. return( 0 );
  562. }
  563. #define MAX_DELAYED_MSG 5
  564. static size_t prev_len;
  565. static packet prev[MAX_DELAYED_MSG];
  566. void clear_pending( void )
  567. {
  568. memset( &prev, 0, sizeof( prev ) );
  569. prev_len = 0;
  570. }
  571. void delay_packet( packet *delay )
  572. {
  573. if( prev_len == MAX_DELAYED_MSG )
  574. return;
  575. memcpy( &prev[prev_len++], delay, sizeof( packet ) );
  576. }
  577. int send_delayed()
  578. {
  579. uint8_t offset;
  580. int ret;
  581. for( offset = 0; offset < prev_len; offset++ )
  582. {
  583. ret = send_packet( &prev[offset], "delayed" );
  584. if( ret != 0 )
  585. return( ret );
  586. }
  587. clear_pending();
  588. return( 0 );
  589. }
  590. /*
  591. * Avoid dropping or delaying a packet that was already dropped twice: this
  592. * only results in uninteresting timeouts. We can't rely on type to identify
  593. * packets, since during renegotiation they're all encrypted. So, rely on
  594. * size mod 2048 (which is usually just size).
  595. */
  596. static unsigned char dropped[2048] = { 0 };
  597. #define DROP_MAX 2
  598. /* We only drop packets at the level of entire datagrams, not at the level
  599. * of records. In particular, if the peer changes the way it packs multiple
  600. * records into a single datagram, we don't necessarily count the number of
  601. * times a record has been dropped correctly. However, the only known reason
  602. * why a peer would change datagram packing is disabling the latter on
  603. * retransmission, in which case we'd drop involved records at most
  604. * DROP_MAX + 1 times. */
  605. void update_dropped( const packet *p )
  606. {
  607. size_t id = p->len % sizeof( dropped );
  608. ++dropped[id];
  609. }
  610. int handle_message( const char *way,
  611. mbedtls_net_context *dst,
  612. mbedtls_net_context *src )
  613. {
  614. int ret;
  615. packet cur;
  616. size_t id;
  617. uint8_t delay_idx;
  618. char ** delay_list;
  619. uint8_t delay_list_len;
  620. /* receive packet */
  621. if( ( ret = mbedtls_net_recv( src, cur.buf, sizeof( cur.buf ) ) ) <= 0 )
  622. {
  623. mbedtls_printf( " ! mbedtls_net_recv returned %d\n", ret );
  624. return( ret );
  625. }
  626. cur.len = ret;
  627. cur.type = msg_type( cur.buf, cur.len );
  628. cur.way = way;
  629. cur.dst = dst;
  630. print_packet( &cur, NULL );
  631. id = cur.len % sizeof( dropped );
  632. if( strcmp( way, "S <- C" ) == 0 )
  633. {
  634. delay_list = opt.delay_cli;
  635. delay_list_len = opt.delay_cli_cnt;
  636. }
  637. else
  638. {
  639. delay_list = opt.delay_srv;
  640. delay_list_len = opt.delay_srv_cnt;
  641. }
  642. /* Check if message type is in the list of messages
  643. * that should be delayed */
  644. for( delay_idx = 0; delay_idx < delay_list_len; delay_idx++ )
  645. {
  646. if( delay_list[ delay_idx ] == NULL )
  647. continue;
  648. if( strcmp( delay_list[ delay_idx ], cur.type ) == 0 )
  649. {
  650. /* Delay message */
  651. delay_packet( &cur );
  652. /* Remove entry from list */
  653. mbedtls_free( delay_list[delay_idx] );
  654. delay_list[delay_idx] = NULL;
  655. return( 0 );
  656. }
  657. }
  658. /* do we want to drop, delay, or forward it? */
  659. if( ( opt.mtu != 0 &&
  660. cur.len > (unsigned) opt.mtu ) ||
  661. ( opt.drop != 0 &&
  662. strcmp( cur.type, "ApplicationData" ) != 0 &&
  663. ! ( opt.protect_hvr &&
  664. strcmp( cur.type, "HelloVerifyRequest" ) == 0 ) &&
  665. cur.len != (size_t) opt.protect_len &&
  666. dropped[id] < DROP_MAX &&
  667. rand() % opt.drop == 0 ) )
  668. {
  669. update_dropped( &cur );
  670. }
  671. else if( ( opt.delay_ccs == 1 &&
  672. strcmp( cur.type, "ChangeCipherSpec" ) == 0 ) ||
  673. ( opt.delay != 0 &&
  674. strcmp( cur.type, "ApplicationData" ) != 0 &&
  675. ! ( opt.protect_hvr &&
  676. strcmp( cur.type, "HelloVerifyRequest" ) == 0 ) &&
  677. cur.len != (size_t) opt.protect_len &&
  678. dropped[id] < DROP_MAX &&
  679. rand() % opt.delay == 0 ) )
  680. {
  681. delay_packet( &cur );
  682. }
  683. else
  684. {
  685. /* forward and possibly duplicate */
  686. if( ( ret = send_packet( &cur, "forwarded" ) ) != 0 )
  687. return( ret );
  688. /* send previously delayed messages if any */
  689. ret = send_delayed();
  690. if( ret != 0 )
  691. return( ret );
  692. }
  693. return( 0 );
  694. }
  695. int main( int argc, char *argv[] )
  696. {
  697. int ret = 1;
  698. int exit_code = MBEDTLS_EXIT_FAILURE;
  699. uint8_t delay_idx;
  700. mbedtls_net_context listen_fd, client_fd, server_fd;
  701. #if defined( MBEDTLS_TIMING_C )
  702. struct timeval tm;
  703. #endif
  704. struct timeval *tm_ptr = NULL;
  705. int nb_fds;
  706. fd_set read_fds;
  707. mbedtls_net_init( &listen_fd );
  708. mbedtls_net_init( &client_fd );
  709. mbedtls_net_init( &server_fd );
  710. get_options( argc, argv );
  711. /*
  712. * Decisions to drop/delay/duplicate packets are pseudo-random: dropping
  713. * exactly 1 in N packets would lead to problems when a flight has exactly
  714. * N packets: the same packet would be dropped on every resend.
  715. *
  716. * In order to be able to reproduce problems reliably, the seed may be
  717. * specified explicitly.
  718. */
  719. if( opt.seed == 0 )
  720. {
  721. opt.seed = (unsigned int) time( NULL );
  722. mbedtls_printf( " . Pseudo-random seed: %u\n", opt.seed );
  723. }
  724. srand( opt.seed );
  725. /*
  726. * 0. "Connect" to the server
  727. */
  728. mbedtls_printf( " . Connect to server on UDP/%s/%s ...",
  729. opt.server_addr, opt.server_port );
  730. fflush( stdout );
  731. if( ( ret = mbedtls_net_connect( &server_fd, opt.server_addr, opt.server_port,
  732. MBEDTLS_NET_PROTO_UDP ) ) != 0 )
  733. {
  734. mbedtls_printf( " failed\n ! mbedtls_net_connect returned %d\n\n", ret );
  735. goto exit;
  736. }
  737. mbedtls_printf( " ok\n" );
  738. /*
  739. * 1. Setup the "listening" UDP socket
  740. */
  741. mbedtls_printf( " . Bind on UDP/%s/%s ...",
  742. opt.listen_addr, opt.listen_port );
  743. fflush( stdout );
  744. if( ( ret = mbedtls_net_bind( &listen_fd, opt.listen_addr, opt.listen_port,
  745. MBEDTLS_NET_PROTO_UDP ) ) != 0 )
  746. {
  747. mbedtls_printf( " failed\n ! mbedtls_net_bind returned %d\n\n", ret );
  748. goto exit;
  749. }
  750. mbedtls_printf( " ok\n" );
  751. /*
  752. * 2. Wait until a client connects
  753. */
  754. accept:
  755. mbedtls_net_free( &client_fd );
  756. mbedtls_printf( " . Waiting for a remote connection ..." );
  757. fflush( stdout );
  758. if( ( ret = mbedtls_net_accept( &listen_fd, &client_fd,
  759. NULL, 0, NULL ) ) != 0 )
  760. {
  761. mbedtls_printf( " failed\n ! mbedtls_net_accept returned %d\n\n", ret );
  762. goto exit;
  763. }
  764. mbedtls_printf( " ok\n" );
  765. /*
  766. * 3. Forward packets forever (kill the process to terminate it)
  767. */
  768. clear_pending();
  769. memset( dropped, 0, sizeof( dropped ) );
  770. nb_fds = client_fd.fd;
  771. if( nb_fds < server_fd.fd )
  772. nb_fds = server_fd.fd;
  773. if( nb_fds < listen_fd.fd )
  774. nb_fds = listen_fd.fd;
  775. ++nb_fds;
  776. #if defined(MBEDTLS_TIMING_C)
  777. if( opt.pack > 0 )
  778. {
  779. outbuf[0].ctx = &server_fd;
  780. outbuf[0].description = "S <- C";
  781. outbuf[0].num_datagrams = 0;
  782. outbuf[0].len = 0;
  783. outbuf[1].ctx = &client_fd;
  784. outbuf[1].description = "S -> C";
  785. outbuf[1].num_datagrams = 0;
  786. outbuf[1].len = 0;
  787. }
  788. #endif /* MBEDTLS_TIMING_C */
  789. while( 1 )
  790. {
  791. #if defined(MBEDTLS_TIMING_C)
  792. if( opt.pack > 0 )
  793. {
  794. unsigned max_wait_server, max_wait_client, max_wait;
  795. max_wait_server = ctx_buffer_time_remaining( &outbuf[0] );
  796. max_wait_client = ctx_buffer_time_remaining( &outbuf[1] );
  797. max_wait = (unsigned) -1;
  798. if( max_wait_server == 0 )
  799. ctx_buffer_flush( &outbuf[0] );
  800. else
  801. max_wait = max_wait_server;
  802. if( max_wait_client == 0 )
  803. ctx_buffer_flush( &outbuf[1] );
  804. else
  805. {
  806. if( max_wait_client < max_wait )
  807. max_wait = max_wait_client;
  808. }
  809. if( max_wait != (unsigned) -1 )
  810. {
  811. tm.tv_sec = max_wait / 1000;
  812. tm.tv_usec = ( max_wait % 1000 ) * 1000;
  813. tm_ptr = &tm;
  814. }
  815. else
  816. {
  817. tm_ptr = NULL;
  818. }
  819. }
  820. #endif /* MBEDTLS_TIMING_C */
  821. FD_ZERO( &read_fds );
  822. FD_SET( server_fd.fd, &read_fds );
  823. FD_SET( client_fd.fd, &read_fds );
  824. FD_SET( listen_fd.fd, &read_fds );
  825. if( ( ret = select( nb_fds, &read_fds, NULL, NULL, tm_ptr ) ) < 0 )
  826. {
  827. perror( "select" );
  828. goto exit;
  829. }
  830. if( FD_ISSET( listen_fd.fd, &read_fds ) )
  831. goto accept;
  832. if( FD_ISSET( client_fd.fd, &read_fds ) )
  833. {
  834. if( ( ret = handle_message( "S <- C",
  835. &server_fd, &client_fd ) ) != 0 )
  836. goto accept;
  837. }
  838. if( FD_ISSET( server_fd.fd, &read_fds ) )
  839. {
  840. if( ( ret = handle_message( "S -> C",
  841. &client_fd, &server_fd ) ) != 0 )
  842. goto accept;
  843. }
  844. }
  845. exit_code = MBEDTLS_EXIT_SUCCESS;
  846. exit:
  847. #ifdef MBEDTLS_ERROR_C
  848. if( exit_code != MBEDTLS_EXIT_SUCCESS )
  849. {
  850. char error_buf[100];
  851. mbedtls_strerror( ret, error_buf, 100 );
  852. mbedtls_printf( "Last error was: -0x%04X - %s\n\n", - ret, error_buf );
  853. fflush( stdout );
  854. }
  855. #endif
  856. for( delay_idx = 0; delay_idx < MAX_DELAYED_HS; delay_idx++ )
  857. {
  858. mbedtls_free( opt.delay_cli + delay_idx );
  859. mbedtls_free( opt.delay_srv + delay_idx );
  860. }
  861. mbedtls_net_free( &client_fd );
  862. mbedtls_net_free( &server_fd );
  863. mbedtls_net_free( &listen_fd );
  864. #if defined(_WIN32)
  865. mbedtls_printf( " Press Enter to exit this program.\n" );
  866. fflush( stdout ); getchar();
  867. #endif
  868. mbedtls_exit( exit_code );
  869. }
  870. #endif /* MBEDTLS_NET_C */