2 * COarse-grain LOck-stepping Virtual Machines for Non-stop Service (COLO)
3 * (a.k.a. Fault Tolerance or Continuous Replication)
5 * Copyright (c) 2016 HUAWEI TECHNOLOGIES CO., LTD.
6 * Copyright (c) 2016 FUJITSU LIMITED
7 * Copyright (c) 2016 Intel Corporation
11 * This work is licensed under the terms of the GNU GPL, version 2 or
12 * later. See the COPYING file in the top-level directory.
15 #ifndef QEMU_COLO_PROXY_H
16 #define QEMU_COLO_PROXY_H
18 #include "slirp/slirp.h"
19 #include "qemu/jhash.h"
20 #include "qemu/timer.h"
22 #define HASHTABLE_MAX_SIZE 16384
25 #define IPPROTO_DCCP 33
29 #define IPPROTO_SCTP 132
32 #ifndef IPPROTO_UDPLITE
33 #define IPPROTO_UDPLITE 136
36 typedef struct Packet {
39 uint8_t *network_header;
42 uint8_t *transport_header;
44 /* Time of packet creation, in wall clock ms */
48 typedef struct ConnectionKey {
49 /* (src, dst) must be grouped, in the same way than in IP header */
55 } QEMU_PACKED ConnectionKey;
57 typedef struct Connection {
58 /* connection primary send queue: element type: Packet */
60 /* connection secondary send queue: element type: Packet */
61 GQueue secondary_list;
62 /* flag to enqueue unprocessed_connections */
65 /* offset = secondary_seq - primary_seq */
68 * we use this flag update offset func
69 * run once in independent tcp connection
74 uint32_t connection_key_hash(const void *opaque);
75 int connection_key_equal(const void *opaque1, const void *opaque2);
76 int parse_packet_early(Packet *pkt);
77 void fill_connection_key(Packet *pkt, ConnectionKey *key);
78 void reverse_connection_key(ConnectionKey *key);
79 Connection *connection_new(ConnectionKey *key);
80 void connection_destroy(void *opaque);
81 Connection *connection_get(GHashTable *connection_track_table,
84 void connection_hashtable_reset(GHashTable *connection_track_table);
85 Packet *packet_new(const void *data, int size);
86 void packet_destroy(void *opaque, void *user_data);
88 #endif /* QEMU_COLO_PROXY_H */