server.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. /**
  2. * @file server.h
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * This file is part of BadVPN.
  8. *
  9. * BadVPN is free software: you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License version 2
  11. * as published by the Free Software Foundation.
  12. *
  13. * BadVPN is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License along
  19. * with this program; if not, write to the Free Software Foundation, Inc.,
  20. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  21. */
  22. #include <stdint.h>
  23. #include <protocol/scproto.h>
  24. #include <structure/LinkedList2.h>
  25. #include <structure/BAVL.h>
  26. #include <system/BSocket.h>
  27. #include <flow/StreamSocketSource.h>
  28. #include <flow/PacketProtoDecoder.h>
  29. #include <flow/PacketStreamSender.h>
  30. #include <flow/StreamSocketSink.h>
  31. #include <flow/PacketPassPriorityQueue.h>
  32. #include <flow/PacketPassFairQueue.h>
  33. #include <flow/PacketProtoFlow.h>
  34. #include <nspr_support/BPRFileDesc.h>
  35. #include <nspr_support/PRStreamSource.h>
  36. #include <nspr_support/PRStreamSink.h>
  37. // name of the program
  38. #define PROGRAM_NAME "server"
  39. // maxiumum number of connected clients. Must be <=2^16.
  40. #define MAX_CLIENTS 30
  41. // client output control flow buffer size in packets
  42. // it must hold: initdata, newclient's, endclient's (if other peers die when informing them)
  43. // make it big enough to hold the initial packet burst (initdata, newclient's),
  44. #define CLIENT_CONTROL_BUFFER_MIN_PACKETS (1 + 2*(MAX_CLIENTS - 1))
  45. // size of client-to-client buffers in packets
  46. #define CLIENT_PEER_FLOW_BUFFER_MIN_PACKETS 10
  47. // after how long of not hearing anything from the client we disconnect it
  48. #define CLIENT_NO_DATA_TIME_LIMIT 30000
  49. // maxiumum listen addresses
  50. #define MAX_LISTEN_ADDRS 16
  51. // performing SSL handshake
  52. #define INITSTATUS_HANDSHAKE 1
  53. // waiting for clienthello
  54. #define INITSTATUS_WAITHELLO 2
  55. // initialisation was complete
  56. #define INITSTATUS_COMPLETE 3
  57. #define INITSTATUS_HASLINK(status) ((status) == INITSTATUS_WAITHELLO || (status) == INITSTATUS_COMPLETE)
  58. struct client_data;
  59. struct peer_flow {
  60. // source client
  61. struct client_data *src_client;
  62. // destination client
  63. struct client_data *dest_client;
  64. peerid_t dest_client_id;
  65. // node in source client hash table (by destination), only when src_client != NULL
  66. BAVLNode src_tree_node;
  67. // node in source client list, only when src_client != NULL
  68. LinkedList2Node src_list_node;
  69. // node in destination client list
  70. LinkedList2Node dest_list_node;
  71. // output chain
  72. PacketPassFairQueueFlow qflow;
  73. PacketProtoFlow oflow;
  74. BufferWriter *input;
  75. int packet_len;
  76. uint8_t *packet;
  77. };
  78. struct peer_know {
  79. struct client_data *from;
  80. struct client_data *to;
  81. LinkedList2Node from_node;
  82. LinkedList2Node to_node;
  83. };
  84. struct client_data {
  85. // socket
  86. BSocket sock;
  87. BAddr addr;
  88. // SSL file descriptor
  89. PRFileDesc bottom_prfd;
  90. PRFileDesc *ssl_prfd;
  91. BPRFileDesc ssl_bprfd;
  92. // initialization state
  93. int initstatus;
  94. // client data if using SSL
  95. uint8_t cert[SCID_NEWCLIENT_MAX_CERT_LEN];
  96. int cert_len;
  97. char *common_name;
  98. // no data timer
  99. BTimer disconnect_timer;
  100. // client ID
  101. peerid_t id;
  102. // node in clients linked list
  103. LinkedList2Node list_node;
  104. // node in clients tree (by ID)
  105. BAVLNode tree_node;
  106. // knowledge lists
  107. LinkedList2 know_out_list;
  108. LinkedList2 know_in_list;
  109. // flows from us
  110. LinkedList2 peer_out_flows_list;
  111. BAVL peer_out_flows_tree;
  112. // whether it's being removed
  113. int dying;
  114. BPending dying_job;
  115. // publish job
  116. BPending publish_job;
  117. LinkedList2Iterator publish_it;
  118. // error domain
  119. FlowErrorDomain domain;
  120. // input
  121. union {
  122. StreamSocketSource plain;
  123. PRStreamSource ssl;
  124. } input_source;
  125. PacketProtoDecoder input_decoder;
  126. PacketPassInterface input_interface;
  127. // output common
  128. union {
  129. StreamSocketSink plain;
  130. PRStreamSink ssl;
  131. } output_sink;
  132. PacketStreamSender output_sender;
  133. PacketPassPriorityQueue output_priorityqueue;
  134. // output control flow
  135. PacketPassPriorityQueueFlow output_control_qflow;
  136. PacketProtoFlow output_control_oflow;
  137. BufferWriter *output_control_input;
  138. int output_control_packet_len;
  139. uint8_t *output_control_packet;
  140. // output peers flow
  141. PacketPassPriorityQueueFlow output_peers_qflow;
  142. PacketPassFairQueue output_peers_fairqueue;
  143. LinkedList2 output_peers_flows;
  144. };