mirror of
https://github.com/xemu-project/xemu.git
synced 2024-11-25 12:40:08 +00:00
e05ae1d9fb
Only slirp/libslirp.h should be included. Instead of using some slirp declarations and utility functions directly, let's copy them in net/util.h. Signed-off-by: Marc-André Lureau <marcandre.lureau@redhat.com> Reviewed-by: Philippe Mathieu-Daudé <philmd@redhat.com> Tested-by: Philippe Mathieu-Daudé <philmd@redhat.com> Signed-off-by: Samuel Thibault <samuel.thibault@ens-lyon.org>
107 lines
3.4 KiB
C
107 lines
3.4 KiB
C
/*
|
|
* COarse-grain LOck-stepping Virtual Machines for Non-stop Service (COLO)
|
|
* (a.k.a. Fault Tolerance or Continuous Replication)
|
|
*
|
|
* Copyright (c) 2016 HUAWEI TECHNOLOGIES CO., LTD.
|
|
* Copyright (c) 2016 FUJITSU LIMITED
|
|
* Copyright (c) 2016 Intel Corporation
|
|
*
|
|
* Author: Zhang Chen <zhangchen.fnst@cn.fujitsu.com>
|
|
*
|
|
* This work is licensed under the terms of the GNU GPL, version 2 or
|
|
* later. See the COPYING file in the top-level directory.
|
|
*/
|
|
|
|
#ifndef QEMU_COLO_PROXY_H
|
|
#define QEMU_COLO_PROXY_H
|
|
|
|
#include "qemu/jhash.h"
|
|
#include "qemu/timer.h"
|
|
#include "net/eth.h"
|
|
|
|
#define HASHTABLE_MAX_SIZE 16384
|
|
|
|
#ifndef IPPROTO_DCCP
|
|
#define IPPROTO_DCCP 33
|
|
#endif
|
|
|
|
#ifndef IPPROTO_SCTP
|
|
#define IPPROTO_SCTP 132
|
|
#endif
|
|
|
|
#ifndef IPPROTO_UDPLITE
|
|
#define IPPROTO_UDPLITE 136
|
|
#endif
|
|
|
|
typedef struct Packet {
|
|
void *data;
|
|
union {
|
|
uint8_t *network_header;
|
|
struct ip *ip;
|
|
};
|
|
uint8_t *transport_header;
|
|
int size;
|
|
/* Time of packet creation, in wall clock ms */
|
|
int64_t creation_ms;
|
|
/* Get vnet_hdr_len from filter */
|
|
uint32_t vnet_hdr_len;
|
|
uint32_t tcp_seq; /* sequence number */
|
|
uint32_t tcp_ack; /* acknowledgement number */
|
|
/* the sequence number of the last byte of the packet */
|
|
uint32_t seq_end;
|
|
uint8_t header_size; /* the header length */
|
|
uint16_t payload_size; /* the payload length */
|
|
/* record the payload offset(the length that has been compared) */
|
|
uint16_t offset;
|
|
uint8_t flags; /* Flags(aka Control bits) */
|
|
} Packet;
|
|
|
|
typedef struct ConnectionKey {
|
|
/* (src, dst) must be grouped, in the same way than in IP header */
|
|
struct in_addr src;
|
|
struct in_addr dst;
|
|
uint16_t src_port;
|
|
uint16_t dst_port;
|
|
uint8_t ip_proto;
|
|
} QEMU_PACKED ConnectionKey;
|
|
|
|
typedef struct Connection {
|
|
/* connection primary send queue: element type: Packet */
|
|
GQueue primary_list;
|
|
/* connection secondary send queue: element type: Packet */
|
|
GQueue secondary_list;
|
|
/* flag to enqueue unprocessed_connections */
|
|
bool processing;
|
|
uint8_t ip_proto;
|
|
/* record the sequence number that has been compared */
|
|
uint32_t compare_seq;
|
|
/* the maximum of acknowledgement number in primary_list queue */
|
|
uint32_t pack;
|
|
/* the maximum of acknowledgement number in secondary_list queue */
|
|
uint32_t sack;
|
|
/* offset = secondary_seq - primary_seq */
|
|
uint32_t offset;
|
|
|
|
int tcp_state; /* TCP FSM state */
|
|
uint32_t fin_ack_seq; /* the seq of 'fin=1,ack=1' */
|
|
} Connection;
|
|
|
|
uint32_t connection_key_hash(const void *opaque);
|
|
int connection_key_equal(const void *opaque1, const void *opaque2);
|
|
int parse_packet_early(Packet *pkt);
|
|
void extract_ip_and_port(uint32_t tmp_ports, ConnectionKey *key, Packet *pkt);
|
|
void fill_connection_key(Packet *pkt, ConnectionKey *key);
|
|
void reverse_connection_key(ConnectionKey *key);
|
|
Connection *connection_new(ConnectionKey *key);
|
|
void connection_destroy(void *opaque);
|
|
Connection *connection_get(GHashTable *connection_track_table,
|
|
ConnectionKey *key,
|
|
GQueue *conn_list);
|
|
bool connection_has_tracked(GHashTable *connection_track_table,
|
|
ConnectionKey *key);
|
|
void connection_hashtable_reset(GHashTable *connection_track_table);
|
|
Packet *packet_new(const void *data, int size, int vnet_hdr_len);
|
|
void packet_destroy(void *opaque, void *user_data);
|
|
|
|
#endif /* QEMU_COLO_PROXY_H */
|