UdpGwClient.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568
  1. /*
  2. * Copyright (C) Ambroz Bizjak <ambrop7@gmail.com>
  3. * Contributions:
  4. * Transparent DNS: Copyright (C) Kerem Hadimli <kerem.hadimli@gmail.com>
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the author nor the
  14. * names of its contributors may be used to endorse or promote products
  15. * derived from this software without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  19. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  20. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  21. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  22. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  23. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  24. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  26. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27. */
  28. #include <stdlib.h>
  29. #include <string.h>
  30. #include <misc/offset.h>
  31. #include <misc/byteorder.h>
  32. #include <misc/compare.h>
  33. #include <base/BLog.h>
  34. #include <udpgw_client/UdpGwClient.h>
  35. #include <generated/blog_channel_UdpGwClient.h>
  36. static int uint16_comparator (void *unused, uint16_t *v1, uint16_t *v2);
  37. static int compare_addresses (BAddr v1, BAddr v2);
  38. static int conaddr_comparator (void *unused, struct UdpGwClient_conaddr *v1, struct UdpGwClient_conaddr *v2);
  39. static void free_server (UdpGwClient *o);
  40. static void decoder_handler_error (UdpGwClient *o);
  41. static void recv_interface_handler_send (UdpGwClient *o, uint8_t *data, int data_len);
  42. static void send_monitor_handler (UdpGwClient *o);
  43. static void keepalive_if_handler_done (UdpGwClient *o);
  44. static struct UdpGwClient_connection * find_connection_by_conaddr (UdpGwClient *o, struct UdpGwClient_conaddr conaddr);
  45. static struct UdpGwClient_connection * find_connection_by_conid (UdpGwClient *o, uint16_t conid);
  46. static uint16_t find_unused_conid (UdpGwClient *o);
  47. static void connection_init (UdpGwClient *o, struct UdpGwClient_conaddr conaddr, uint8_t flags, const uint8_t *data, int data_len);
  48. static void connection_free (struct UdpGwClient_connection *con);
  49. static void connection_first_job_handler (struct UdpGwClient_connection *con);
  50. static void connection_send (struct UdpGwClient_connection *con, uint8_t flags, const uint8_t *data, int data_len);
  51. static struct UdpGwClient_connection * reuse_connection (UdpGwClient *o, struct UdpGwClient_conaddr conaddr);
  52. static int uint16_comparator (void *unused, uint16_t *v1, uint16_t *v2)
  53. {
  54. return B_COMPARE(*v1, *v2);
  55. }
  56. static int compare_addresses (BAddr v1, BAddr v2)
  57. {
  58. ASSERT(v1.type == BADDR_TYPE_IPV4)
  59. ASSERT(v2.type == BADDR_TYPE_IPV4)
  60. int cmp = B_COMPARE(v1.ipv4.port, v2.ipv4.port);
  61. if (cmp) {
  62. return cmp;
  63. }
  64. return B_COMPARE(v1.ipv4.ip, v2.ipv4.ip);
  65. }
  66. static int conaddr_comparator (void *unused, struct UdpGwClient_conaddr *v1, struct UdpGwClient_conaddr *v2)
  67. {
  68. ASSERT(v1->local_addr.type == BADDR_TYPE_IPV4)
  69. ASSERT(v1->remote_addr.type == BADDR_TYPE_IPV4)
  70. ASSERT(v2->local_addr.type == BADDR_TYPE_IPV4)
  71. ASSERT(v2->remote_addr.type == BADDR_TYPE_IPV4)
  72. int r = compare_addresses(v1->remote_addr, v2->remote_addr);
  73. if (r) {
  74. return r;
  75. }
  76. return compare_addresses(v1->local_addr, v2->local_addr);
  77. }
  78. static void free_server (UdpGwClient *o)
  79. {
  80. // disconnect send connector
  81. PacketPassConnector_DisconnectOutput(&o->send_connector);
  82. // free send sender
  83. PacketStreamSender_Free(&o->send_sender);
  84. // free receive decoder
  85. PacketProtoDecoder_Free(&o->recv_decoder);
  86. // free receive interface
  87. PacketPassInterface_Free(&o->recv_if);
  88. }
  89. static void decoder_handler_error (UdpGwClient *o)
  90. {
  91. DebugObject_Access(&o->d_obj);
  92. ASSERT(o->have_server)
  93. BLog(BLOG_ERROR, "decoder error");
  94. // report error
  95. o->handler_servererror(o->user);
  96. return;
  97. }
  98. static void recv_interface_handler_send (UdpGwClient *o, uint8_t *data, int data_len)
  99. {
  100. DebugObject_Access(&o->d_obj);
  101. ASSERT(o->have_server)
  102. ASSERT(data_len >= 0)
  103. ASSERT(data_len <= o->udpgw_mtu)
  104. // accept packet
  105. PacketPassInterface_Done(&o->recv_if);
  106. // check header
  107. if (data_len < sizeof(struct udpgw_header)) {
  108. BLog(BLOG_ERROR, "missing header");
  109. return;
  110. }
  111. struct udpgw_header header;
  112. memcpy(&header, data, sizeof(header));
  113. data += sizeof(header);
  114. data_len -= sizeof(header);
  115. uint16_t conid = ltoh16(header.conid);
  116. // check remaining data
  117. if (data_len > o->udp_mtu) {
  118. BLog(BLOG_ERROR, "too much data");
  119. return;
  120. }
  121. // find connection
  122. struct UdpGwClient_connection *con = find_connection_by_conid(o, conid);
  123. if (!con) {
  124. BLog(BLOG_ERROR, "unknown conid");
  125. return;
  126. }
  127. // check remote address
  128. if (con->conaddr.remote_addr.ipv4.port != header.addr_port || con->conaddr.remote_addr.ipv4.ip != header.addr_ip) {
  129. BLog(BLOG_ERROR, "wrong remote address");
  130. return;
  131. }
  132. // move connection to front of the list
  133. LinkedList1_Remove(&o->connections_list, &con->connections_list_node);
  134. LinkedList1_Append(&o->connections_list, &con->connections_list_node);
  135. // pass packet to user
  136. o->handler_received(o->user, con->conaddr.local_addr, con->conaddr.remote_addr, data, data_len);
  137. return;
  138. }
  139. static void send_monitor_handler (UdpGwClient *o)
  140. {
  141. DebugObject_Access(&o->d_obj);
  142. if (o->keepalive_sending) {
  143. return;
  144. }
  145. BLog(BLOG_INFO, "keepalive");
  146. // send keepalive
  147. PacketPassInterface_Sender_Send(o->keepalive_if, (uint8_t *)&o->keepalive_packet, sizeof(o->keepalive_packet));
  148. // set sending keep-alive
  149. o->keepalive_sending = 1;
  150. }
  151. static void keepalive_if_handler_done (UdpGwClient *o)
  152. {
  153. DebugObject_Access(&o->d_obj);
  154. ASSERT(o->keepalive_sending)
  155. // set not sending keepalive
  156. o->keepalive_sending = 0;
  157. }
  158. static struct UdpGwClient_connection * find_connection_by_conaddr (UdpGwClient *o, struct UdpGwClient_conaddr conaddr)
  159. {
  160. BAVLNode *tree_node = BAVL_LookupExact(&o->connections_tree_by_conaddr, &conaddr);
  161. if (!tree_node) {
  162. return NULL;
  163. }
  164. return UPPER_OBJECT(tree_node, struct UdpGwClient_connection, connections_tree_by_conaddr_node);
  165. }
  166. static struct UdpGwClient_connection * find_connection_by_conid (UdpGwClient *o, uint16_t conid)
  167. {
  168. BAVLNode *tree_node = BAVL_LookupExact(&o->connections_tree_by_conid, &conid);
  169. if (!tree_node) {
  170. return NULL;
  171. }
  172. return UPPER_OBJECT(tree_node, struct UdpGwClient_connection, connections_tree_by_conid_node);
  173. }
  174. static uint16_t find_unused_conid (UdpGwClient *o)
  175. {
  176. ASSERT(o->num_connections < o->max_connections)
  177. while (1) {
  178. if (!find_connection_by_conid(o, o->next_conid)) {
  179. return o->next_conid;
  180. }
  181. if (o->next_conid == o->max_connections - 1) {
  182. o->next_conid = 0;
  183. } else {
  184. o->next_conid++;
  185. }
  186. }
  187. }
  188. static void connection_init (UdpGwClient *o, struct UdpGwClient_conaddr conaddr, uint8_t flags, const uint8_t *data, int data_len)
  189. {
  190. ASSERT(o->num_connections < o->max_connections)
  191. ASSERT(!find_connection_by_conaddr(o, conaddr))
  192. ASSERT(data_len >= 0)
  193. ASSERT(data_len <= o->udp_mtu)
  194. // allocate structure
  195. struct UdpGwClient_connection *con = (struct UdpGwClient_connection *)malloc(sizeof(*con));
  196. if (!con) {
  197. BLog(BLOG_ERROR, "malloc failed");
  198. goto fail0;
  199. }
  200. // init arguments
  201. con->client = o;
  202. con->conaddr = conaddr;
  203. con->first_flags = flags;
  204. con->first_data = data;
  205. con->first_data_len = data_len;
  206. // allocate conid
  207. con->conid = find_unused_conid(o);
  208. // init first job
  209. BPending_Init(&con->first_job, BReactor_PendingGroup(o->reactor), (BPending_handler)connection_first_job_handler, con);
  210. BPending_Set(&con->first_job);
  211. // init queue flow
  212. PacketPassFairQueueFlow_Init(&con->send_qflow, &o->send_queue);
  213. // init PacketProtoFlow
  214. if (!PacketProtoFlow_Init(&con->send_ppflow, o->udpgw_mtu, o->send_buffer_size, PacketPassFairQueueFlow_GetInput(&con->send_qflow), BReactor_PendingGroup(o->reactor))) {
  215. BLog(BLOG_ERROR, "PacketProtoFlow_Init failed");
  216. goto fail1;
  217. }
  218. con->send_if = PacketProtoFlow_GetInput(&con->send_ppflow);
  219. // insert to connections tree by conaddr
  220. ASSERT_EXECUTE(BAVL_Insert(&o->connections_tree_by_conaddr, &con->connections_tree_by_conaddr_node, NULL))
  221. // insert to connections tree by conid
  222. ASSERT_EXECUTE(BAVL_Insert(&o->connections_tree_by_conid, &con->connections_tree_by_conid_node, NULL))
  223. // insert to connections list
  224. LinkedList1_Append(&o->connections_list, &con->connections_list_node);
  225. // increment number of connections
  226. o->num_connections++;
  227. return;
  228. fail1:
  229. PacketPassFairQueueFlow_Free(&con->send_qflow);
  230. BPending_Free(&con->first_job);
  231. free(con);
  232. fail0:
  233. return;
  234. }
  235. static void connection_free (struct UdpGwClient_connection *con)
  236. {
  237. UdpGwClient *o = con->client;
  238. PacketPassFairQueueFlow_AssertFree(&con->send_qflow);
  239. // decrement number of connections
  240. o->num_connections--;
  241. // remove from connections list
  242. LinkedList1_Remove(&o->connections_list, &con->connections_list_node);
  243. // remove from connections tree by conid
  244. BAVL_Remove(&o->connections_tree_by_conid, &con->connections_tree_by_conid_node);
  245. // remove from connections tree by conaddr
  246. BAVL_Remove(&o->connections_tree_by_conaddr, &con->connections_tree_by_conaddr_node);
  247. // free PacketProtoFlow
  248. PacketProtoFlow_Free(&con->send_ppflow);
  249. // free queue flow
  250. PacketPassFairQueueFlow_Free(&con->send_qflow);
  251. // free first job
  252. BPending_Free(&con->first_job);
  253. // free structure
  254. free(con);
  255. }
  256. static void connection_first_job_handler (struct UdpGwClient_connection *con)
  257. {
  258. connection_send(con, UDPGW_CLIENT_FLAG_REBIND|con->first_flags, con->first_data, con->first_data_len);
  259. }
  260. static void connection_send (struct UdpGwClient_connection *con, uint8_t flags, const uint8_t *data, int data_len)
  261. {
  262. UdpGwClient *o = con->client;
  263. B_USE(o)
  264. ASSERT(data_len >= 0)
  265. ASSERT(data_len <= o->udp_mtu)
  266. // get buffer location
  267. uint8_t *out;
  268. if (!BufferWriter_StartPacket(con->send_if, &out)) {
  269. BLog(BLOG_ERROR, "out of buffer");
  270. return;
  271. }
  272. // write header
  273. struct udpgw_header header;
  274. header.flags = ltoh8(flags);
  275. header.conid = ltoh16(con->conid);
  276. header.addr_ip = con->conaddr.remote_addr.ipv4.ip;
  277. header.addr_port = con->conaddr.remote_addr.ipv4.port;
  278. memcpy(out, &header, sizeof(header));
  279. // write packet to buffer
  280. memcpy(out + sizeof(header), data, data_len);
  281. // submit packet to buffer
  282. BufferWriter_EndPacket(con->send_if, sizeof(header) + data_len);
  283. }
  284. static struct UdpGwClient_connection * reuse_connection (UdpGwClient *o, struct UdpGwClient_conaddr conaddr)
  285. {
  286. ASSERT(!find_connection_by_conaddr(o, conaddr))
  287. ASSERT(o->num_connections > 0)
  288. // get least recently used connection
  289. struct UdpGwClient_connection *con = UPPER_OBJECT(LinkedList1_GetFirst(&o->connections_list), struct UdpGwClient_connection, connections_list_node);
  290. // remove from connections tree by conaddr
  291. BAVL_Remove(&o->connections_tree_by_conaddr, &con->connections_tree_by_conaddr_node);
  292. // set new conaddr
  293. con->conaddr = conaddr;
  294. // insert to connections tree by conaddr
  295. ASSERT_EXECUTE(BAVL_Insert(&o->connections_tree_by_conaddr, &con->connections_tree_by_conaddr_node, NULL))
  296. return con;
  297. }
  298. int UdpGwClient_Init (UdpGwClient *o, int udp_mtu, int max_connections, int send_buffer_size, btime_t keepalive_time, BReactor *reactor, void *user,
  299. UdpGwClient_handler_servererror handler_servererror,
  300. UdpGwClient_handler_received handler_received)
  301. {
  302. ASSERT(udp_mtu >= 0)
  303. ASSERT(udpgw_compute_mtu(udp_mtu) >= 0)
  304. ASSERT(udpgw_compute_mtu(udp_mtu) <= PACKETPROTO_MAXPAYLOAD)
  305. ASSERT(max_connections > 0)
  306. ASSERT(send_buffer_size > 0)
  307. // init arguments
  308. o->udp_mtu = udp_mtu;
  309. o->max_connections = max_connections;
  310. o->send_buffer_size = send_buffer_size;
  311. o->keepalive_time = keepalive_time;
  312. o->reactor = reactor;
  313. o->user = user;
  314. o->handler_servererror = handler_servererror;
  315. o->handler_received = handler_received;
  316. // limit max connections to number of conid's
  317. if (o->max_connections > UINT16_MAX + 1) {
  318. o->max_connections = UINT16_MAX + 1;
  319. }
  320. // compute MTUs
  321. o->udpgw_mtu = udpgw_compute_mtu(o->udp_mtu);
  322. o->pp_mtu = o->udpgw_mtu + sizeof(struct packetproto_header);
  323. // init connections tree by conaddr
  324. BAVL_Init(&o->connections_tree_by_conaddr, OFFSET_DIFF(struct UdpGwClient_connection, conaddr, connections_tree_by_conaddr_node), (BAVL_comparator)conaddr_comparator, NULL);
  325. // init connections tree by conid
  326. BAVL_Init(&o->connections_tree_by_conid, OFFSET_DIFF(struct UdpGwClient_connection, conid, connections_tree_by_conid_node), (BAVL_comparator)uint16_comparator, NULL);
  327. // init connections list
  328. LinkedList1_Init(&o->connections_list);
  329. // set zero connections
  330. o->num_connections = 0;
  331. // set next conid
  332. o->next_conid = 0;
  333. // init send connector
  334. PacketPassConnector_Init(&o->send_connector, o->pp_mtu, BReactor_PendingGroup(o->reactor));
  335. // init send monitor
  336. PacketPassInactivityMonitor_Init(&o->send_monitor, PacketPassConnector_GetInput(&o->send_connector), o->reactor, o->keepalive_time, (PacketPassInactivityMonitor_handler)send_monitor_handler, o);
  337. // init send queue
  338. if (!PacketPassFairQueue_Init(&o->send_queue, PacketPassInactivityMonitor_GetInput(&o->send_monitor), BReactor_PendingGroup(o->reactor), 0, 1)) {
  339. goto fail0;
  340. }
  341. // construct keepalive packet
  342. o->keepalive_packet.pp.len = sizeof(o->keepalive_packet.udpgw);
  343. memset(&o->keepalive_packet.udpgw, 0, sizeof(o->keepalive_packet.udpgw));
  344. o->keepalive_packet.udpgw.flags = UDPGW_CLIENT_FLAG_KEEPALIVE;
  345. // init keepalive queue flow
  346. PacketPassFairQueueFlow_Init(&o->keepalive_qflow, &o->send_queue);
  347. o->keepalive_if = PacketPassFairQueueFlow_GetInput(&o->keepalive_qflow);
  348. // init keepalive output
  349. PacketPassInterface_Sender_Init(o->keepalive_if, (PacketPassInterface_handler_done)keepalive_if_handler_done, o);
  350. // set not sending keepalive
  351. o->keepalive_sending = 0;
  352. // set have no server
  353. o->have_server = 0;
  354. DebugObject_Init(&o->d_obj);
  355. return 1;
  356. fail0:
  357. PacketPassInactivityMonitor_Free(&o->send_monitor);
  358. PacketPassConnector_Free(&o->send_connector);
  359. return 0;
  360. }
  361. void UdpGwClient_Free (UdpGwClient *o)
  362. {
  363. DebugObject_Free(&o->d_obj);
  364. // allow freeing send queue flows
  365. PacketPassFairQueue_PrepareFree(&o->send_queue);
  366. // free connections
  367. while (!LinkedList1_IsEmpty(&o->connections_list)) {
  368. struct UdpGwClient_connection *con = UPPER_OBJECT(LinkedList1_GetFirst(&o->connections_list), struct UdpGwClient_connection, connections_list_node);
  369. connection_free(con);
  370. }
  371. // free server
  372. if (o->have_server) {
  373. free_server(o);
  374. }
  375. // free keepalive queue flow
  376. PacketPassFairQueueFlow_Free(&o->keepalive_qflow);
  377. // free send queue
  378. PacketPassFairQueue_Free(&o->send_queue);
  379. // free send
  380. PacketPassInactivityMonitor_Free(&o->send_monitor);
  381. // free send connector
  382. PacketPassConnector_Free(&o->send_connector);
  383. }
  384. void UdpGwClient_SubmitPacket (UdpGwClient *o, BAddr local_addr, BAddr remote_addr, int is_dns, const uint8_t *data, int data_len)
  385. {
  386. DebugObject_Access(&o->d_obj);
  387. ASSERT(local_addr.type == BADDR_TYPE_IPV4)
  388. ASSERT(remote_addr.type == BADDR_TYPE_IPV4)
  389. ASSERT(data_len >= 0)
  390. ASSERT(data_len <= o->udp_mtu)
  391. // build conaddr
  392. struct UdpGwClient_conaddr conaddr;
  393. conaddr.local_addr = local_addr;
  394. conaddr.remote_addr = remote_addr;
  395. // lookup connection
  396. struct UdpGwClient_connection *con = find_connection_by_conaddr(o, conaddr);
  397. uint8_t flags = 0;
  398. if (is_dns) {
  399. // route to remote DNS server instead of provided address
  400. flags |= UDPGW_CLIENT_FLAG_DNS;
  401. }
  402. // if no connection and can't create a new one, reuse the least recently used une
  403. if (!con && o->num_connections == o->max_connections) {
  404. con = reuse_connection(o, conaddr);
  405. flags |= UDPGW_CLIENT_FLAG_REBIND;
  406. }
  407. if (!con) {
  408. // create new connection
  409. connection_init(o, conaddr, flags, data, data_len);
  410. } else {
  411. // move connection to front of the list
  412. LinkedList1_Remove(&o->connections_list, &con->connections_list_node);
  413. LinkedList1_Append(&o->connections_list, &con->connections_list_node);
  414. // send packet to existing connection
  415. connection_send(con, flags, data, data_len);
  416. }
  417. }
  418. int UdpGwClient_ConnectServer (UdpGwClient *o, StreamPassInterface *send_if, StreamRecvInterface *recv_if)
  419. {
  420. DebugObject_Access(&o->d_obj);
  421. ASSERT(!o->have_server)
  422. // init receive interface
  423. PacketPassInterface_Init(&o->recv_if, o->udpgw_mtu, (PacketPassInterface_handler_send)recv_interface_handler_send, o, BReactor_PendingGroup(o->reactor));
  424. // init receive decoder
  425. if (!PacketProtoDecoder_Init(&o->recv_decoder, recv_if, &o->recv_if, BReactor_PendingGroup(o->reactor), o, (PacketProtoDecoder_handler_error)decoder_handler_error)) {
  426. BLog(BLOG_ERROR, "PacketProtoDecoder_Init failed");
  427. goto fail1;
  428. }
  429. // init send sender
  430. PacketStreamSender_Init(&o->send_sender, send_if, o->pp_mtu, BReactor_PendingGroup(o->reactor));
  431. // connect send connector
  432. PacketPassConnector_ConnectOutput(&o->send_connector, PacketStreamSender_GetInput(&o->send_sender));
  433. // set have server
  434. o->have_server = 1;
  435. return 1;
  436. fail1:
  437. PacketPassInterface_Free(&o->recv_if);
  438. return 0;
  439. }
  440. void UdpGwClient_DisconnectServer (UdpGwClient *o)
  441. {
  442. DebugObject_Access(&o->d_obj);
  443. ASSERT(o->have_server)
  444. // free server
  445. free_server(o);
  446. // set have no server
  447. o->have_server = 0;
  448. }