haproxy/include/haproxy/peers-t.h
Frédéric Lécaille 36d1565640 MINOR: peers: Support for peer shards
Add "shards" new keyword for "peers" section to configure the number
of peer shards attached to such secions. This impact all the stick-tables
attached to the section.
Add "shard" new "server" parameter to configure the peers which participate to
all the stick-tables contents distribution. Each peer receive the stick-tables updates
only for keys with this shard value as distribution hash. The "shard" value
is stored in ->shard new server struct member.
cfg_parse_peers() which is the function which is called to parse all
the lines of a "peers" section is modified to parse the "shards" parameter
stored in ->nb_shards new peers struct member.
Add srv_parse_shard() new callback into server.c to pare the "shard"
parameter.
Implement stksess_getkey_hash() to compute the distribution hash for a
stick-table key as the 64-bits xxhash of the key concatenated to the stick-table
name. This function is called by stksess_setkey_shard(), itself
called by the already implemented function which create a new stick-table
key (stksess_new()).
Add ->idlen new stktable struct member to store the stick-table name length
to not have to compute it each time a stick-table key hash is computed.
2022-10-24 10:55:53 +02:00

143 lines
5.0 KiB
C

/*
* include/haproxy/peers-t.h
* This file defines everything related to peers.
*
* Copyright 2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation, version 2.1
* exclusively.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef _HAPROXY_PEERS_T_H
#define _HAPROXY_PEERS_T_H
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <import/ebtree-t.h>
#include <haproxy/api-t.h>
#include <haproxy/dict-t.h>
#include <haproxy/thread-t.h>
struct shared_table {
struct stktable *table; /* stick table to sync */
int local_id;
int remote_id;
int flags;
uint64_t remote_data;
unsigned int remote_data_nbelem[STKTABLE_DATA_TYPES];
unsigned int last_acked;
unsigned int last_pushed;
unsigned int last_get;
unsigned int teaching_origin;
unsigned int update;
struct shared_table *next; /* next shared table in list */
};
struct peer {
int local; /* proxy state */
__decl_thread(HA_SPINLOCK_T lock); /* lock used to handle this peer section */
char *id;
struct {
const char *file; /* file where the section appears */
int line; /* line where the section appears */
} conf; /* config information */
time_t last_change;
struct sockaddr_storage addr; /* peer address */
struct protocol *proto; /* peer address protocol */
struct xprt_ops *xprt; /* peer socket operations at transport layer */
void *sock_init_arg; /* socket operations's opaque init argument if needed */
unsigned int flags; /* peer session flags */
unsigned int statuscode; /* current/last session status code */
unsigned int reconnect; /* next connect timer */
unsigned int heartbeat; /* next heartbeat timer */
unsigned int confirm; /* confirm message counter */
unsigned int last_hdshk; /* Date of the last handshake. */
uint32_t rx_hbt; /* received heartbeats counter */
uint32_t tx_hbt; /* transmitted heartbeats counter */
uint32_t no_hbt; /* no received heartbeat counter */
uint32_t new_conn; /* new connection after reconnection timeout expiration counter */
uint32_t proto_err; /* protocol errors counter */
uint32_t coll; /* connection collisions counter */
struct appctx *appctx; /* the appctx running it */
struct shared_table *remote_table;
struct shared_table *last_local_table;
struct shared_table *tables;
struct server *srv;
struct dcache *dcache; /* dictionary cache */
struct peers *peers; /* associated peer section */
struct peer *next; /* next peer in the list */
};
struct peers {
char *id; /* peer section name */
struct task *sync_task; /* main sync task */
struct sig_handler *sighandler; /* signal handler */
struct peer *remote; /* remote peers list */
struct peer *local; /* local peer list */
struct proxy *peers_fe; /* peer frontend */
struct {
const char *file; /* file where the section appears */
int line; /* line where the section appears */
} conf; /* config information */
time_t last_change;
struct peers *next; /* next peer section */
unsigned int flags; /* current peers section resync state */
unsigned int resync_timeout; /* resync timeout timer */
int count; /* total of peers */
int nb_shards; /* Number of peer shards */
int disabled; /* peers proxy disabled if >0 */
int applet_count[MAX_THREADS]; /* applet count per thread */
};
/* LRU cache for dictionaies */
struct dcache_tx {
/* The last recently used key */
unsigned int lru_key;
/* An array of entries to store pointers to dictionary entries. */
struct ebpt_node *entries;
/* The previous lookup result. */
struct ebpt_node *prev_lookup;
/* ebtree to store the previous entries. */
struct eb_root cached_entries;
};
struct dcache_rx {
unsigned int id;
struct dict_entry *de;
};
struct dcache_tx_entry {
unsigned int id;
struct ebpt_node entry;
};
/* stick-table data type cache */
struct dcache {
/* Cache used upon transmission */
struct dcache_tx *tx;
/* Cache used upon receipt */
struct dcache_rx *rx;
/* Maximum number of entries in this cache */
size_t max_entries;
};
#endif /* _HAPROXY_PEERS_T_H */