blob: bdaf498dc44fada6c2d96cf3b32cf5629a324686 [file] [log] [blame]
Emeric Brun2b920a12010-09-23 18:30:22 +02001/*
Emeric Brunb3971ab2015-05-12 18:49:09 +02002 * Peer synchro management.
Emeric Brun2b920a12010-09-23 18:30:22 +02003 *
4 * Copyright 2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
13#include <errno.h>
14#include <fcntl.h>
15#include <stdio.h>
16#include <stdlib.h>
17#include <string.h>
18
19#include <sys/socket.h>
20#include <sys/stat.h>
21#include <sys/types.h>
22
23#include <common/compat.h>
24#include <common/config.h>
25#include <common/time.h>
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +020026#include <common/standard.h>
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +020027#include <common/hathreads.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020028
29#include <types/global.h>
Willy Tarreau3fdb3662012-11-12 00:42:33 +010030#include <types/listener.h>
31#include <types/obj_type.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020032#include <types/peers.h>
Frédéric Lécaille95679dc2019-04-15 10:25:27 +020033#include <types/stats.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020034
35#include <proto/acl.h>
Willy Tarreau8a8d83b2015-04-13 13:24:54 +020036#include <proto/applet.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020037#include <proto/channel.h>
Frédéric Lécaille95679dc2019-04-15 10:25:27 +020038#include <proto/cli.h>
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +020039#include <proto/dict.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020040#include <proto/fd.h>
Willy Tarreaud1d48d42015-03-13 16:15:46 +010041#include <proto/frontend.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020042#include <proto/log.h>
Willy Tarreau53a47662017-08-28 10:53:00 +020043#include <proto/mux_pt.h>
Frédéric Lécaille1055e682018-04-26 14:35:21 +020044#include <proto/peers.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020045#include <proto/proxy.h>
Willy Tarreaufeb76402015-04-03 14:10:06 +020046#include <proto/session.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020047#include <proto/stream.h>
Willy Tarreau22ec1ea2014-11-27 20:45:39 +010048#include <proto/signal.h>
49#include <proto/stick_table.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020050#include <proto/stream_interface.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020051#include <proto/task.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020052
53
54/*******************************/
55/* Current peer learning state */
56/*******************************/
57
58/******************************/
Emeric Brunb3971ab2015-05-12 18:49:09 +020059/* Current peers section resync state */
Emeric Brun2b920a12010-09-23 18:30:22 +020060/******************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010061#define PEERS_F_RESYNC_LOCAL 0x00000001 /* Learn from local finished or no more needed */
62#define PEERS_F_RESYNC_REMOTE 0x00000002 /* Learn from remote finished or no more needed */
63#define PEERS_F_RESYNC_ASSIGN 0x00000004 /* A peer was assigned to learn our lesson */
64#define PEERS_F_RESYNC_PROCESS 0x00000008 /* The assigned peer was requested for resync */
65#define PEERS_F_DONOTSTOP 0x00010000 /* Main table sync task block process during soft stop
66 to push data to new process */
Emeric Brun2b920a12010-09-23 18:30:22 +020067
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010068#define PEERS_RESYNC_STATEMASK (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE)
69#define PEERS_RESYNC_FROMLOCAL 0x00000000
70#define PEERS_RESYNC_FROMREMOTE PEERS_F_RESYNC_LOCAL
71#define PEERS_RESYNC_FINISHED (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE)
Emeric Brunb3971ab2015-05-12 18:49:09 +020072
73/***********************************/
74/* Current shared table sync state */
75/***********************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010076#define SHTABLE_F_TEACH_STAGE1 0x00000001 /* Teach state 1 complete */
77#define SHTABLE_F_TEACH_STAGE2 0x00000002 /* Teach state 2 complete */
Emeric Brun2b920a12010-09-23 18:30:22 +020078
79/******************************/
80/* Remote peer teaching state */
81/******************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010082#define PEER_F_TEACH_PROCESS 0x00000001 /* Teach a lesson to current peer */
83#define PEER_F_TEACH_FINISHED 0x00000008 /* Teach conclude, (wait for confirm) */
84#define PEER_F_TEACH_COMPLETE 0x00000010 /* All that we know already taught to current peer, used only for a local peer */
85#define PEER_F_LEARN_ASSIGN 0x00000100 /* Current peer was assigned for a lesson */
86#define PEER_F_LEARN_NOTUP2DATE 0x00000200 /* Learn from peer finished but peer is not up to date */
87#define PEER_F_ALIVE 0x20000000 /* Used to flag a peer a alive. */
88#define PEER_F_HEARTBEAT 0x40000000 /* Heartbeat message to send. */
89#define PEER_F_DWNGRD 0x80000000 /* When this flag is enabled, we must downgrade the supported version announced during peer sessions. */
Emeric Brun2b920a12010-09-23 18:30:22 +020090
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010091#define PEER_TEACH_RESET ~(PEER_F_TEACH_PROCESS|PEER_F_TEACH_FINISHED) /* PEER_F_TEACH_COMPLETE should never be reset */
92#define PEER_LEARN_RESET ~(PEER_F_LEARN_ASSIGN|PEER_F_LEARN_NOTUP2DATE)
Emeric Brun2b920a12010-09-23 18:30:22 +020093
Frédéric Lécaille54bff832019-03-26 10:25:20 +010094#define PEER_RESYNC_TIMEOUT 5000 /* 5 seconds */
95#define PEER_RECONNECT_TIMEOUT 5000 /* 5 seconds */
Frédéric Lécaille645635d2019-02-11 17:49:39 +010096#define PEER_HEARTBEAT_TIMEOUT 3000 /* 3 seconds */
97
Emeric Brunb3971ab2015-05-12 18:49:09 +020098/*****************************/
99/* Sync message class */
100/*****************************/
101enum {
102 PEER_MSG_CLASS_CONTROL = 0,
103 PEER_MSG_CLASS_ERROR,
104 PEER_MSG_CLASS_STICKTABLE = 10,
105 PEER_MSG_CLASS_RESERVED = 255,
106};
107
108/*****************************/
109/* control message types */
110/*****************************/
111enum {
112 PEER_MSG_CTRL_RESYNCREQ = 0,
113 PEER_MSG_CTRL_RESYNCFINISHED,
114 PEER_MSG_CTRL_RESYNCPARTIAL,
115 PEER_MSG_CTRL_RESYNCCONFIRM,
Frédéric Lécaille645635d2019-02-11 17:49:39 +0100116 PEER_MSG_CTRL_HEARTBEAT,
Emeric Brunb3971ab2015-05-12 18:49:09 +0200117};
118
119/*****************************/
120/* error message types */
121/*****************************/
122enum {
123 PEER_MSG_ERR_PROTOCOL = 0,
124 PEER_MSG_ERR_SIZELIMIT,
125};
126
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100127/*
128 * Parameters used by functions to build peer protocol messages. */
129struct peer_prep_params {
130 struct {
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100131 struct peer *peer;
132 } hello;
133 struct {
134 unsigned int st1;
135 } error_status;
136 struct {
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100137 struct stksess *stksess;
138 struct shared_table *shared_table;
139 unsigned int updateid;
140 int use_identifier;
141 int use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200142 struct peer *peer;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100143 } updt;
144 struct {
145 struct shared_table *shared_table;
146 } swtch;
147 struct {
148 struct shared_table *shared_table;
149 } ack;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100150 struct {
151 unsigned char head[2];
152 } control;
153 struct {
154 unsigned char head[2];
155 } error;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100156};
Emeric Brunb3971ab2015-05-12 18:49:09 +0200157
158/*******************************/
159/* stick table sync mesg types */
160/* Note: ids >= 128 contains */
161/* id message cotains data */
162/*******************************/
Olivier Houchard33992262018-10-16 18:49:26 +0200163#define PEER_MSG_STKT_UPDATE 0x80
164#define PEER_MSG_STKT_INCUPDATE 0x81
165#define PEER_MSG_STKT_DEFINE 0x82
166#define PEER_MSG_STKT_SWITCH 0x83
167#define PEER_MSG_STKT_ACK 0x84
168#define PEER_MSG_STKT_UPDATE_TIMED 0x85
169#define PEER_MSG_STKT_INCUPDATE_TIMED 0x86
Frédéric Lécaille36fb77e2019-06-04 08:28:19 +0200170/* All the stick-table message identifiers abova have the #7 bit set */
171#define PEER_MSG_STKT_BIT 7
172#define PEER_MSG_STKT_BIT_MASK (1 << PEER_MSG_STKT_BIT)
Emeric Brun2b920a12010-09-23 18:30:22 +0200173
Frédéric Lécaille39143342019-05-24 14:32:27 +0200174/* The maximum length of an encoded data length. */
175#define PEER_MSG_ENC_LENGTH_MAXLEN 5
176
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200177/* Minimum 64-bits value encoded with 2 bytes */
178#define PEER_ENC_2BYTES_MIN 0xf0 /* 0xf0 (or 240) */
179/* 3 bytes */
180#define PEER_ENC_3BYTES_MIN ((1ULL << 11) | PEER_ENC_2BYTES_MIN) /* 0x8f0 (or 2288) */
181/* 4 bytes */
182#define PEER_ENC_4BYTES_MIN ((1ULL << 18) | PEER_ENC_3BYTES_MIN) /* 0x408f0 (or 264432) */
183/* 5 bytes */
184#define PEER_ENC_5BYTES_MIN ((1ULL << 25) | PEER_ENC_4BYTES_MIN) /* 0x20408f0 (or 33818864) */
185/* 6 bytes */
186#define PEER_ENC_6BYTES_MIN ((1ULL << 32) | PEER_ENC_5BYTES_MIN) /* 0x1020408f0 (or 4328786160) */
187/* 7 bytes */
188#define PEER_ENC_7BYTES_MIN ((1ULL << 39) | PEER_ENC_6BYTES_MIN) /* 0x81020408f0 (or 554084600048) */
189/* 8 bytes */
190#define PEER_ENC_8BYTES_MIN ((1ULL << 46) | PEER_ENC_7BYTES_MIN) /* 0x4081020408f0 (or 70922828777712) */
191/* 9 bytes */
192#define PEER_ENC_9BYTES_MIN ((1ULL << 53) | PEER_ENC_8BYTES_MIN) /* 0x204081020408f0 (or 9078122083518704) */
193/* 10 bytes */
194#define PEER_ENC_10BYTES_MIN ((1ULL << 60) | PEER_ENC_9BYTES_MIN) /* 0x10204081020408f0 (or 1161999626690365680) */
195
196/* #7 bit used to detect the last byte to be encoded */
197#define PEER_ENC_STOP_BIT 7
198/* The byte minimum value with #7 bit set */
199#define PEER_ENC_STOP_BYTE (1 << PEER_ENC_STOP_BIT)
200/* The left most number of bits set for PEER_ENC_2BYTES_MIN */
201#define PEER_ENC_2BYTES_MIN_BITS 4
202
Frédéric Lécaille39143342019-05-24 14:32:27 +0200203#define PEER_MSG_HEADER_LEN 2
204
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200205#define PEER_STKT_CACHE_MAX_ENTRIES 128
206
Emeric Brun2b920a12010-09-23 18:30:22 +0200207/**********************************/
208/* Peer Session IO handler states */
209/**********************************/
210
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100211enum {
212 PEER_SESS_ST_ACCEPT = 0, /* Initial state for session create by an accept, must be zero! */
213 PEER_SESS_ST_GETVERSION, /* Validate supported protocol version */
214 PEER_SESS_ST_GETHOST, /* Validate host ID correspond to local host id */
215 PEER_SESS_ST_GETPEER, /* Validate peer ID correspond to a known remote peer id */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100216 /* after this point, data were possibly exchanged */
217 PEER_SESS_ST_SENDSUCCESS, /* Send ret code 200 (success) and wait for message */
218 PEER_SESS_ST_CONNECT, /* Initial state for session create on a connect, push presentation into buffer */
219 PEER_SESS_ST_GETSTATUS, /* Wait for the welcome message */
220 PEER_SESS_ST_WAITMSG, /* Wait for data messages */
221 PEER_SESS_ST_EXIT, /* Exit with status code */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200222 PEER_SESS_ST_ERRPROTO, /* Send error proto message before exit */
223 PEER_SESS_ST_ERRSIZE, /* Send error size message before exit */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100224 PEER_SESS_ST_END, /* Killed session */
225};
Emeric Brun2b920a12010-09-23 18:30:22 +0200226
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100227/***************************************************/
228/* Peer Session status code - part of the protocol */
229/***************************************************/
Emeric Brun2b920a12010-09-23 18:30:22 +0200230
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100231#define PEER_SESS_SC_CONNECTCODE 100 /* connect in progress */
232#define PEER_SESS_SC_CONNECTEDCODE 110 /* tcp connect success */
Emeric Brun2b920a12010-09-23 18:30:22 +0200233
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100234#define PEER_SESS_SC_SUCCESSCODE 200 /* accept or connect successful */
Emeric Brun2b920a12010-09-23 18:30:22 +0200235
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100236#define PEER_SESS_SC_TRYAGAIN 300 /* try again later */
Emeric Brun2b920a12010-09-23 18:30:22 +0200237
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100238#define PEER_SESS_SC_ERRPROTO 501 /* error protocol */
239#define PEER_SESS_SC_ERRVERSION 502 /* unknown protocol version */
240#define PEER_SESS_SC_ERRHOST 503 /* bad host name */
241#define PEER_SESS_SC_ERRPEER 504 /* unknown peer */
Emeric Brun2b920a12010-09-23 18:30:22 +0200242
243#define PEER_SESSION_PROTO_NAME "HAProxyS"
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200244#define PEER_MAJOR_VER 2
245#define PEER_MINOR_VER 1
246#define PEER_DWNGRD_MINOR_VER 0
Emeric Brun2b920a12010-09-23 18:30:22 +0200247
Willy Tarreau6254a922019-01-29 17:45:23 +0100248static size_t proto_len = sizeof(PEER_SESSION_PROTO_NAME) - 1;
Frédéric Lécailleed2b4a62017-07-13 09:07:09 +0200249struct peers *cfg_peers = NULL;
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200250static void peer_session_forceshutdown(struct peer *peer);
Emeric Brun2b920a12010-09-23 18:30:22 +0200251
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200252static struct ebpt_node *dcache_tx_insert(struct dcache *dc,
253 struct dcache_tx_entry *i);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200254static inline void flush_dcache(struct peer *peer);
255
Frédéric Lécaille95679dc2019-04-15 10:25:27 +0200256static const char *statuscode_str(int statuscode)
257{
258 switch (statuscode) {
259 case PEER_SESS_SC_CONNECTCODE:
260 return "CONN";
261 case PEER_SESS_SC_CONNECTEDCODE:
262 return "HSHK";
263 case PEER_SESS_SC_SUCCESSCODE:
264 return "ESTA";
265 case PEER_SESS_SC_TRYAGAIN:
266 return "RETR";
267 case PEER_SESS_SC_ERRPROTO:
268 return "PROT";
269 case PEER_SESS_SC_ERRVERSION:
270 return "VERS";
271 case PEER_SESS_SC_ERRHOST:
272 return "NAME";
273 case PEER_SESS_SC_ERRPEER:
274 return "UNKN";
275 default:
276 return "NONE";
277 }
278}
279
Emeric Brun18928af2017-03-29 16:32:53 +0200280/* This function encode an uint64 to 'dynamic' length format.
281 The encoded value is written at address *str, and the
282 caller must assure that size after *str is large enought.
283 At return, the *str is set at the next Byte after then
284 encoded integer. The function returns then length of the
285 encoded integer in Bytes */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200286int intencode(uint64_t i, char **str) {
287 int idx = 0;
288 unsigned char *msg;
289
Emeric Brunb3971ab2015-05-12 18:49:09 +0200290 msg = (unsigned char *)*str;
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200291 if (i < PEER_ENC_2BYTES_MIN) {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200292 msg[0] = (unsigned char)i;
293 *str = (char *)&msg[idx+1];
294 return (idx+1);
295 }
296
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200297 msg[idx] =(unsigned char)i | PEER_ENC_2BYTES_MIN;
298 i = (i - PEER_ENC_2BYTES_MIN) >> PEER_ENC_2BYTES_MIN_BITS;
299 while (i >= PEER_ENC_STOP_BYTE) {
300 msg[++idx] = (unsigned char)i | PEER_ENC_STOP_BYTE;
301 i = (i - PEER_ENC_STOP_BYTE) >> PEER_ENC_STOP_BIT;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200302 }
303 msg[++idx] = (unsigned char)i;
304 *str = (char *)&msg[idx+1];
305 return (idx+1);
306}
307
308
309/* This function returns the decoded integer or 0
310 if decode failed
311 *str point on the beginning of the integer to decode
312 at the end of decoding *str point on the end of the
313 encoded integer or to null if end is reached */
Emeric Brun18928af2017-03-29 16:32:53 +0200314uint64_t intdecode(char **str, char *end)
315{
Emeric Brunb3971ab2015-05-12 18:49:09 +0200316 unsigned char *msg;
Emeric Brun18928af2017-03-29 16:32:53 +0200317 uint64_t i;
318 int shift;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200319
320 if (!*str)
321 return 0;
322
323 msg = (unsigned char *)*str;
Emeric Brun18928af2017-03-29 16:32:53 +0200324 if (msg >= (unsigned char *)end)
325 goto fail;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200326
Emeric Brun18928af2017-03-29 16:32:53 +0200327 i = *(msg++);
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200328 if (i >= PEER_ENC_2BYTES_MIN) {
329 shift = PEER_ENC_2BYTES_MIN_BITS;
Emeric Brun18928af2017-03-29 16:32:53 +0200330 do {
331 if (msg >= (unsigned char *)end)
332 goto fail;
333 i += (uint64_t)*msg << shift;
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200334 shift += PEER_ENC_STOP_BIT;
335 } while (*(msg++) >= PEER_ENC_STOP_BYTE);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200336 }
Frédéric Lécaillea8725ec2019-01-22 10:31:39 +0100337 *str = (char *)msg;
338 return i;
Emeric Brun18928af2017-03-29 16:32:53 +0200339
Frédéric Lécaillea8725ec2019-01-22 10:31:39 +0100340 fail:
341 *str = NULL;
342 return 0;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200343}
Emeric Brun2b920a12010-09-23 18:30:22 +0200344
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100345/*
346 * Build a "hello" peer protocol message.
347 * Return the number of written bytes written to build this messages if succeeded,
348 * 0 if not.
349 */
350static int peer_prepare_hellomsg(char *msg, size_t size, struct peer_prep_params *p)
351{
352 int min_ver, ret;
353 struct peer *peer;
354
355 peer = p->hello.peer;
356 min_ver = (peer->flags & PEER_F_DWNGRD) ? PEER_DWNGRD_MINOR_VER : PEER_MINOR_VER;
357 /* Prepare headers */
358 ret = snprintf(msg, size, PEER_SESSION_PROTO_NAME " %u.%u\n%s\n%s %d %d\n",
359 PEER_MAJOR_VER, min_ver, peer->id, localpeer, (int)getpid(), relative_pid);
360 if (ret >= size)
361 return 0;
362
363 return ret;
364}
365
366/*
367 * Build a "handshake succeeded" status message.
368 * Return the number of written bytes written to build this messages if succeeded,
369 * 0 if not.
370 */
371static int peer_prepare_status_successmsg(char *msg, size_t size, struct peer_prep_params *p)
372{
373 int ret;
374
375 ret = snprintf(msg, size, "%d\n", PEER_SESS_SC_SUCCESSCODE);
376 if (ret >= size)
377 return 0;
378
379 return ret;
380}
381
382/*
383 * Build an error status message.
384 * Return the number of written bytes written to build this messages if succeeded,
385 * 0 if not.
386 */
387static int peer_prepare_status_errormsg(char *msg, size_t size, struct peer_prep_params *p)
388{
389 int ret;
390 unsigned int st1;
391
392 st1 = p->error_status.st1;
393 ret = snprintf(msg, size, "%d\n", st1);
394 if (ret >= size)
395 return 0;
396
397 return ret;
398}
399
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200400/* Set the stick-table UPDATE message type byte at <msg_type> address,
401 * depending on <use_identifier> and <use_timed> boolean parameters.
402 * Always successful.
403 */
404static inline void peer_set_update_msg_type(char *msg_type, int use_identifier, int use_timed)
405{
406 if (use_timed) {
407 if (use_identifier)
408 *msg_type = PEER_MSG_STKT_UPDATE_TIMED;
409 else
410 *msg_type = PEER_MSG_STKT_INCUPDATE_TIMED;
411 }
412 else {
413 if (use_identifier)
414 *msg_type = PEER_MSG_STKT_UPDATE;
415 else
416 *msg_type = PEER_MSG_STKT_INCUPDATE;
417 }
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200418}
Emeric Brun2b920a12010-09-23 18:30:22 +0200419/*
Emeric Brunb3971ab2015-05-12 18:49:09 +0200420 * This prepare the data update message on the stick session <ts>, <st> is the considered
421 * stick table.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800422 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200423 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
424 * check size)
Emeric Brun2b920a12010-09-23 18:30:22 +0200425 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100426static int peer_prepare_updatemsg(char *msg, size_t size, struct peer_prep_params *p)
Emeric Brun2b920a12010-09-23 18:30:22 +0200427{
428 uint32_t netinteger;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200429 unsigned short datalen;
430 char *cursor, *datamsg;
Emeric Brun94900952015-06-11 18:25:54 +0200431 unsigned int data_type;
432 void *data_ptr;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100433 struct stksess *ts;
434 struct shared_table *st;
435 unsigned int updateid;
436 int use_identifier;
437 int use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200438 struct peer *peer;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100439
440 ts = p->updt.stksess;
441 st = p->updt.shared_table;
442 updateid = p->updt.updateid;
443 use_identifier = p->updt.use_identifier;
444 use_timed = p->updt.use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200445 peer = p->updt.peer;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200446
Frédéric Lécaille0e8db972019-05-24 14:34:34 +0200447 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200448
Emeric Brun2b920a12010-09-23 18:30:22 +0200449 /* construct message */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200450
451 /* check if we need to send the update identifer */
Emeric Brun819fc6f2017-06-13 19:37:32 +0200452 if (!st->last_pushed || updateid < st->last_pushed || ((updateid - st->last_pushed) != 1)) {
Emeric Bruna6a09982015-09-22 15:34:19 +0200453 use_identifier = 1;
Emeric Brun2b920a12010-09-23 18:30:22 +0200454 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200455
456 /* encode update identifier if needed */
457 if (use_identifier) {
Emeric Brun819fc6f2017-06-13 19:37:32 +0200458 netinteger = htonl(updateid);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200459 memcpy(cursor, &netinteger, sizeof(netinteger));
460 cursor += sizeof(netinteger);
Emeric Brun2b920a12010-09-23 18:30:22 +0200461 }
462
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200463 if (use_timed) {
464 netinteger = htonl(tick_remain(now_ms, ts->expire));
465 memcpy(cursor, &netinteger, sizeof(netinteger));
466 cursor += sizeof(netinteger);
467 }
468
Emeric Brunb3971ab2015-05-12 18:49:09 +0200469 /* encode the key */
Thierry FOURNIER5d24ebc2015-07-24 08:46:42 +0200470 if (st->table->type == SMP_T_STR) {
Emeric Brun2b920a12010-09-23 18:30:22 +0200471 int stlen = strlen((char *)ts->key.key);
472
Emeric Brunb3971ab2015-05-12 18:49:09 +0200473 intencode(stlen, &cursor);
474 memcpy(cursor, ts->key.key, stlen);
475 cursor += stlen;
Emeric Brun2b920a12010-09-23 18:30:22 +0200476 }
Thierry FOURNIER5d24ebc2015-07-24 08:46:42 +0200477 else if (st->table->type == SMP_T_SINT) {
Emeric Brun2b920a12010-09-23 18:30:22 +0200478 netinteger = htonl(*((uint32_t *)ts->key.key));
Emeric Brunb3971ab2015-05-12 18:49:09 +0200479 memcpy(cursor, &netinteger, sizeof(netinteger));
480 cursor += sizeof(netinteger);
Emeric Brun2b920a12010-09-23 18:30:22 +0200481 }
482 else {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200483 memcpy(cursor, ts->key.key, st->table->key_size);
484 cursor += st->table->key_size;
Emeric Brun2b920a12010-09-23 18:30:22 +0200485 }
486
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100487 HA_RWLOCK_RDLOCK(STK_SESS_LOCK, &ts->lock);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200488 /* encode values */
Emeric Brun94900952015-06-11 18:25:54 +0200489 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200490
Emeric Brun94900952015-06-11 18:25:54 +0200491 data_ptr = stktable_data_ptr(st->table, ts, data_type);
492 if (data_ptr) {
493 switch (stktable_data_types[data_type].std_type) {
494 case STD_T_SINT: {
495 int data;
496
497 data = stktable_data_cast(data_ptr, std_t_sint);
498 intencode(data, &cursor);
499 break;
500 }
501 case STD_T_UINT: {
502 unsigned int data;
503
504 data = stktable_data_cast(data_ptr, std_t_uint);
505 intencode(data, &cursor);
506 break;
507 }
508 case STD_T_ULL: {
509 unsigned long long data;
510
511 data = stktable_data_cast(data_ptr, std_t_ull);
512 intencode(data, &cursor);
513 break;
514 }
515 case STD_T_FRQP: {
516 struct freq_ctr_period *frqp;
517
518 frqp = &stktable_data_cast(data_ptr, std_t_frqp);
519 intencode((unsigned int)(now_ms - frqp->curr_tick), &cursor);
520 intencode(frqp->curr_ctr, &cursor);
521 intencode(frqp->prev_ctr, &cursor);
522 break;
523 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200524 case STD_T_DICT: {
525 struct dict_entry *de;
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200526 struct ebpt_node *cached_de;
Willy Tarreau237f8ae2019-06-06 16:40:43 +0200527 struct dcache_tx_entry cde = { };
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200528 char *beg, *end;
529 size_t value_len, data_len;
530 struct dcache *dc;
531
532 de = stktable_data_cast(data_ptr, std_t_dict);
533 if (!de)
534 break;
535
536 dc = peer->dcache;
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200537 cde.entry.key = de;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200538 cached_de = dcache_tx_insert(dc, &cde);
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200539 if (cached_de == &cde.entry) {
540 if (cde.id + 1 >= PEER_ENC_2BYTES_MIN)
541 break;
542 /* Encode the length of the remaining data -> 1 */
543 intencode(1, &cursor);
544 /* Encode the cache entry ID */
545 intencode(cde.id + 1, &cursor);
546 }
547 else {
548 /* Leave enough room to encode the remaining data length. */
549 end = beg = cursor + PEER_MSG_ENC_LENGTH_MAXLEN;
550 /* Encode the dictionary entry key */
551 intencode(cde.id + 1, &end);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200552 /* Encode the length of the dictionary entry data */
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200553 value_len = de->len;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200554 intencode(value_len, &end);
555 /* Copy the data */
556 memcpy(end, de->value.key, value_len);
557 end += value_len;
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200558 /* Encode the length of the data */
559 data_len = end - beg;
560 intencode(data_len, &cursor);
561 memmove(cursor, beg, data_len);
562 cursor += data_len;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200563 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200564 break;
565 }
Emeric Brun94900952015-06-11 18:25:54 +0200566 }
567 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200568 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100569 HA_RWLOCK_RDUNLOCK(STK_SESS_LOCK, &ts->lock);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200570
571 /* Compute datalen */
572 datalen = (cursor - datamsg);
573
574 /* prepare message header */
575 msg[0] = PEER_MSG_CLASS_STICKTABLE;
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200576 peer_set_update_msg_type(&msg[1], use_identifier, use_timed);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200577 cursor = &msg[2];
578 intencode(datalen, &cursor);
579
580 /* move data after header */
581 memmove(cursor, datamsg, datalen);
582
583 /* return header size + data_len */
584 return (cursor - msg) + datalen;
585}
586
587/*
588 * This prepare the switch table message to targeted share table <st>.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800589 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200590 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
591 * check size)
592 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100593static int peer_prepare_switchmsg(char *msg, size_t size, struct peer_prep_params *params)
Emeric Brunb3971ab2015-05-12 18:49:09 +0200594{
595 int len;
596 unsigned short datalen;
Willy Tarreau83061a82018-07-13 11:56:34 +0200597 struct buffer *chunk;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200598 char *cursor, *datamsg, *chunkp, *chunkq;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200599 uint64_t data = 0;
Emeric Brun94900952015-06-11 18:25:54 +0200600 unsigned int data_type;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100601 struct shared_table *st;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200602
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100603 st = params->swtch.shared_table;
Frédéric Lécaille39143342019-05-24 14:32:27 +0200604 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200605
606 /* Encode data */
607
608 /* encode local id */
609 intencode(st->local_id, &cursor);
610
611 /* encode table name */
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +0100612 len = strlen(st->table->nid);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200613 intencode(len, &cursor);
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +0100614 memcpy(cursor, st->table->nid, len);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200615 cursor += len;
616
617 /* encode table type */
618
619 intencode(st->table->type, &cursor);
620
621 /* encode table key size */
622 intencode(st->table->key_size, &cursor);
623
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200624 chunk = get_trash_chunk();
Willy Tarreau843b7cb2018-07-13 10:54:26 +0200625 chunkp = chunkq = chunk->area;
Emeric Brun94900952015-06-11 18:25:54 +0200626 /* encode available known data types in table */
627 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
628 if (st->table->data_ofs[data_type]) {
629 switch (stktable_data_types[data_type].std_type) {
630 case STD_T_SINT:
631 case STD_T_UINT:
632 case STD_T_ULL:
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200633 case STD_T_DICT:
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200634 data |= 1 << data_type;
635 break;
Emeric Brun94900952015-06-11 18:25:54 +0200636 case STD_T_FRQP:
637 data |= 1 << data_type;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200638 intencode(data_type, &chunkq);
639 intencode(st->table->data_arg[data_type].u, &chunkq);
Emeric Brun94900952015-06-11 18:25:54 +0200640 break;
641 }
642 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200643 }
644 intencode(data, &cursor);
645
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200646 /* Encode stick-table entries duration. */
647 intencode(st->table->expire, &cursor);
648
649 if (chunkq > chunkp) {
Willy Tarreau843b7cb2018-07-13 10:54:26 +0200650 chunk->data = chunkq - chunkp;
651 memcpy(cursor, chunk->area, chunk->data);
652 cursor += chunk->data;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200653 }
654
Emeric Brunb3971ab2015-05-12 18:49:09 +0200655 /* Compute datalen */
656 datalen = (cursor - datamsg);
Emeric Brun2b920a12010-09-23 18:30:22 +0200657
Emeric Brunb3971ab2015-05-12 18:49:09 +0200658 /* prepare message header */
659 msg[0] = PEER_MSG_CLASS_STICKTABLE;
660 msg[1] = PEER_MSG_STKT_DEFINE;
661 cursor = &msg[2];
662 intencode(datalen, &cursor);
Emeric Brun2b920a12010-09-23 18:30:22 +0200663
Emeric Brunb3971ab2015-05-12 18:49:09 +0200664 /* move data after header */
665 memmove(cursor, datamsg, datalen);
666
667 /* return header size + data_len */
668 return (cursor - msg) + datalen;
Emeric Brun2b920a12010-09-23 18:30:22 +0200669}
670
Emeric Brunb3971ab2015-05-12 18:49:09 +0200671/*
672 * This prepare the acknowledge message on the stick session <ts>, <st> is the considered
673 * stick table.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800674 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200675 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
676 * check size)
677 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100678static int peer_prepare_ackmsg(char *msg, size_t size, struct peer_prep_params *p)
Emeric Brunb3971ab2015-05-12 18:49:09 +0200679{
680 unsigned short datalen;
681 char *cursor, *datamsg;
682 uint32_t netinteger;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100683 struct shared_table *st;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200684
Frédéric Lécaille39143342019-05-24 14:32:27 +0200685 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200686
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100687 st = p->ack.shared_table;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200688 intencode(st->remote_id, &cursor);
689 netinteger = htonl(st->last_get);
690 memcpy(cursor, &netinteger, sizeof(netinteger));
691 cursor += sizeof(netinteger);
692
693 /* Compute datalen */
694 datalen = (cursor - datamsg);
695
696 /* prepare message header */
697 msg[0] = PEER_MSG_CLASS_STICKTABLE;
Emeric Brune1ab8082015-08-21 11:48:54 +0200698 msg[1] = PEER_MSG_STKT_ACK;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200699 cursor = &msg[2];
700 intencode(datalen, &cursor);
701
702 /* move data after header */
703 memmove(cursor, datamsg, datalen);
704
705 /* return header size + data_len */
706 return (cursor - msg) + datalen;
707}
Emeric Brun2b920a12010-09-23 18:30:22 +0200708
709/*
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200710 * Function to deinit connected peer
711 */
712void __peer_session_deinit(struct peer *peer)
713{
714 struct stream_interface *si;
715 struct stream *s;
716 struct peers *peers;
717
718 if (!peer->appctx)
719 return;
720
721 si = peer->appctx->owner;
722 if (!si)
723 return;
724
725 s = si_strm(si);
726 if (!s)
727 return;
728
729 peers = strm_fe(s)->parent;
730 if (!peers)
731 return;
732
733 if (peer->appctx->st0 == PEER_SESS_ST_WAITMSG)
734 HA_ATOMIC_SUB(&connected_peers, 1);
735
736 HA_ATOMIC_SUB(&active_peers, 1);
737
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200738 flush_dcache(peer);
739
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200740 /* Re-init current table pointers to force announcement on re-connect */
741 peer->remote_table = peer->last_local_table = NULL;
742 peer->appctx = NULL;
743 if (peer->flags & PEER_F_LEARN_ASSIGN) {
744 /* unassign current peer for learning */
745 peer->flags &= ~(PEER_F_LEARN_ASSIGN);
746 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
747
748 /* reschedule a resync */
749 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(5000));
750 }
751 /* reset teaching and learning flags to 0 */
752 peer->flags &= PEER_TEACH_RESET;
753 peer->flags &= PEER_LEARN_RESET;
754 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
755}
756
757/*
Emeric Brun2b920a12010-09-23 18:30:22 +0200758 * Callback to release a session with a peer
759 */
Willy Tarreau00a37f02015-04-13 12:05:19 +0200760static void peer_session_release(struct appctx *appctx)
Emeric Brun2b920a12010-09-23 18:30:22 +0200761{
Vincent Bernat3c2f2f22016-04-03 13:48:42 +0200762 struct peer *peer = appctx->ctx.peers.ptr;
Emeric Brun2b920a12010-09-23 18:30:22 +0200763
Willy Tarreau7b4b4992013-12-01 09:15:12 +0100764 /* appctx->ctx.peers.ptr is not a peer session */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100765 if (appctx->st0 < PEER_SESS_ST_SENDSUCCESS)
Emeric Brun2b920a12010-09-23 18:30:22 +0200766 return;
767
768 /* peer session identified */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200769 if (peer) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100770 HA_SPIN_LOCK(PEER_LOCK, &peer->lock);
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200771 if (peer->appctx == appctx)
772 __peer_session_deinit(peer);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100773 HA_SPIN_UNLOCK(PEER_LOCK, &peer->lock);
Emeric Brun2b920a12010-09-23 18:30:22 +0200774 }
775}
776
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200777/* Retrieve the major and minor versions of peers protocol
778 * announced by a remote peer. <str> is a null-terminated
779 * string with the following format: "<maj_ver>.<min_ver>".
780 */
781static int peer_get_version(const char *str,
782 unsigned int *maj_ver, unsigned int *min_ver)
783{
784 unsigned int majv, minv;
785 const char *pos, *saved;
786 const char *end;
787
788 saved = pos = str;
789 end = str + strlen(str);
790
791 majv = read_uint(&pos, end);
792 if (saved == pos || *pos++ != '.')
793 return -1;
794
795 saved = pos;
796 minv = read_uint(&pos, end);
797 if (saved == pos || pos != end)
798 return -1;
799
800 *maj_ver = majv;
801 *min_ver = minv;
802
803 return 0;
804}
Emeric Brun2b920a12010-09-23 18:30:22 +0200805
806/*
Frédéric Lécaillece025572019-01-21 13:38:06 +0100807 * Parse a line terminated by an optional '\r' character, followed by a mandatory
808 * '\n' character.
809 * Returns 1 if succeeded or 0 if a '\n' character could not be found, and -1 if
810 * a line could not be read because the communication channel is closed.
811 */
812static inline int peer_getline(struct appctx *appctx)
813{
814 int n;
815 struct stream_interface *si = appctx->owner;
816
817 n = co_getline(si_oc(si), trash.area, trash.size);
818 if (!n)
819 return 0;
820
821 if (n < 0 || trash.area[n - 1] != '\n') {
822 appctx->st0 = PEER_SESS_ST_END;
823 return -1;
824 }
825
826 if (n > 1 && (trash.area[n - 2] == '\r'))
827 trash.area[n - 2] = 0;
828 else
829 trash.area[n - 1] = 0;
830
831 co_skip(si_oc(si), n);
832
833 return n;
834}
835
836/*
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100837 * Send a message after having called <peer_prepare_msg> to build it.
838 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
839 * Returns -1 if there was not enough room left to send the message,
840 * any other negative returned value must be considered as an error with an appcxt st0
841 * returned value equal to PEER_SESS_ST_END.
842 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100843static inline int peer_send_msg(struct appctx *appctx,
844 int (*peer_prepare_msg)(char *, size_t, struct peer_prep_params *),
845 struct peer_prep_params *params)
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100846{
847 int ret, msglen;
848 struct stream_interface *si = appctx->owner;
849
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100850 msglen = peer_prepare_msg(trash.area, trash.size, params);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100851 if (!msglen) {
852 /* internal error: message does not fit in trash */
853 appctx->st0 = PEER_SESS_ST_END;
854 return 0;
855 }
856
857 /* message to buffer */
858 ret = ci_putblk(si_ic(si), trash.area, msglen);
859 if (ret <= 0) {
860 if (ret == -1) {
861 /* No more write possible */
862 si_rx_room_blk(si);
863 return -1;
864 }
865 appctx->st0 = PEER_SESS_ST_END;
866 }
867
868 return ret;
869}
870
871/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100872 * Send a hello message.
873 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
874 * Returns -1 if there was not enough room left to send the message,
875 * any other negative returned value must be considered as an error with an appcxt st0
876 * returned value equal to PEER_SESS_ST_END.
877 */
878static inline int peer_send_hellomsg(struct appctx *appctx, struct peer *peer)
879{
880 struct peer_prep_params p = {
881 .hello.peer = peer,
882 };
883
884 return peer_send_msg(appctx, peer_prepare_hellomsg, &p);
885}
886
887/*
888 * Send a success peer handshake status message.
889 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
890 * Returns -1 if there was not enough room left to send the message,
891 * any other negative returned value must be considered as an error with an appcxt st0
892 * returned value equal to PEER_SESS_ST_END.
893 */
894static inline int peer_send_status_successmsg(struct appctx *appctx)
895{
896 return peer_send_msg(appctx, peer_prepare_status_successmsg, NULL);
897}
898
899/*
900 * Send a peer handshake status error message.
901 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
902 * Returns -1 if there was not enough room left to send the message,
903 * any other negative returned value must be considered as an error with an appcxt st0
904 * returned value equal to PEER_SESS_ST_END.
905 */
906static inline int peer_send_status_errormsg(struct appctx *appctx)
907{
908 struct peer_prep_params p = {
909 .error_status.st1 = appctx->st1,
910 };
911
912 return peer_send_msg(appctx, peer_prepare_status_errormsg, &p);
913}
914
915/*
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100916 * Send a stick-table switch message.
917 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
918 * Returns -1 if there was not enough room left to send the message,
919 * any other negative returned value must be considered as an error with an appcxt st0
920 * returned value equal to PEER_SESS_ST_END.
921 */
922static inline int peer_send_switchmsg(struct shared_table *st, struct appctx *appctx)
923{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100924 struct peer_prep_params p = {
925 .swtch.shared_table = st,
926 };
927
928 return peer_send_msg(appctx, peer_prepare_switchmsg, &p);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100929}
930
931/*
932 * Send a stick-table update acknowledgement message.
933 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
934 * Returns -1 if there was not enough room left to send the message,
935 * any other negative returned value must be considered as an error with an appcxt st0
936 * returned value equal to PEER_SESS_ST_END.
937 */
938static inline int peer_send_ackmsg(struct shared_table *st, struct appctx *appctx)
939{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100940 struct peer_prep_params p = {
941 .ack.shared_table = st,
942 };
943
944 return peer_send_msg(appctx, peer_prepare_ackmsg, &p);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100945}
946
947/*
Frédéric Lécaille87f554c2019-01-22 17:26:50 +0100948 * Send a stick-table update message.
949 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
950 * Returns -1 if there was not enough room left to send the message,
951 * any other negative returned value must be considered as an error with an appcxt st0
952 * returned value equal to PEER_SESS_ST_END.
953 */
954static inline int peer_send_updatemsg(struct shared_table *st, struct appctx *appctx, struct stksess *ts,
955 unsigned int updateid, int use_identifier, int use_timed)
956{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100957 struct peer_prep_params p = {
958 .updt.stksess = ts,
959 .updt.shared_table = st,
960 .updt.updateid = updateid,
961 .updt.use_identifier = use_identifier,
962 .updt.use_timed = use_timed,
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200963 .updt.peer = appctx->ctx.peers.ptr,
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100964 };
965
966 return peer_send_msg(appctx, peer_prepare_updatemsg, &p);
Frédéric Lécaille87f554c2019-01-22 17:26:50 +0100967}
968
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100969/*
970 * Build a peer protocol control class message.
971 * Returns the number of written bytes used to build the message if succeeded,
972 * 0 if not.
973 */
974static int peer_prepare_control_msg(char *msg, size_t size, struct peer_prep_params *p)
975{
976 if (size < sizeof p->control.head)
977 return 0;
978
979 msg[0] = p->control.head[0];
980 msg[1] = p->control.head[1];
981
982 return 2;
983}
Frédéric Lécaille6a8303d2019-01-22 22:25:17 +0100984
985/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100986 * Send a stick-table synchronization request message.
987 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
988 * Returns -1 if there was not enough room left to send the message,
989 * any other negative returned value must be considered as an error with an appctx st0
990 * returned value equal to PEER_SESS_ST_END.
991 */
992static inline int peer_send_resync_reqmsg(struct appctx *appctx)
993{
994 struct peer_prep_params p = {
995 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_RESYNCREQ, },
996 };
997
998 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
999}
1000
1001/*
1002 * Send a stick-table synchronization confirmation message.
1003 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1004 * Returns -1 if there was not enough room left to send the message,
1005 * any other negative returned value must be considered as an error with an appctx st0
1006 * returned value equal to PEER_SESS_ST_END.
1007 */
1008static inline int peer_send_resync_confirmsg(struct appctx *appctx)
1009{
1010 struct peer_prep_params p = {
1011 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_RESYNCCONFIRM, },
1012 };
1013
1014 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1015}
1016
1017/*
1018 * Send a stick-table synchronization finished message.
1019 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1020 * Returns -1 if there was not enough room left to send the message,
1021 * any other negative returned value must be considered as an error with an appctx st0
1022 * returned value equal to PEER_SESS_ST_END.
1023 */
1024static inline int peer_send_resync_finishedmsg(struct appctx *appctx, struct peer *peer)
1025{
1026 struct peer_prep_params p = {
1027 .control.head = { PEER_MSG_CLASS_CONTROL, },
1028 };
1029
1030 p.control.head[1] = (peer->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FINISHED ?
1031 PEER_MSG_CTRL_RESYNCFINISHED : PEER_MSG_CTRL_RESYNCPARTIAL;
1032
1033 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1034}
1035
1036/*
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001037 * Send a heartbeat message.
1038 * Return 0 if the message could not be built modifying the appctx st0 to PEER_SESS_ST_END value.
1039 * Returns -1 if there was not enough room left to send the message,
1040 * any other negative returned value must be considered as an error with an appctx st0
1041 * returned value equal to PEER_SESS_ST_END.
1042 */
1043static inline int peer_send_heartbeatmsg(struct appctx *appctx)
1044{
1045 struct peer_prep_params p = {
1046 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_HEARTBEAT, },
1047 };
1048
1049 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1050}
1051
1052/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001053 * Build a peer protocol error class message.
1054 * Returns the number of written bytes used to build the message if succeeded,
1055 * 0 if not.
1056 */
1057static int peer_prepare_error_msg(char *msg, size_t size, struct peer_prep_params *p)
1058{
1059 if (size < sizeof p->error.head)
1060 return 0;
1061
1062 msg[0] = p->error.head[0];
1063 msg[1] = p->error.head[1];
1064
1065 return 2;
1066}
1067
1068/*
1069 * Send a "size limit reached" error message.
1070 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1071 * Returns -1 if there was not enough room left to send the message,
1072 * any other negative returned value must be considered as an error with an appctx st0
1073 * returned value equal to PEER_SESS_ST_END.
1074 */
1075static inline int peer_send_error_size_limitmsg(struct appctx *appctx)
1076{
1077 struct peer_prep_params p = {
1078 .error.head = { PEER_MSG_CLASS_ERROR, PEER_MSG_ERR_SIZELIMIT, },
1079 };
1080
1081 return peer_send_msg(appctx, peer_prepare_error_msg, &p);
1082}
1083
1084/*
1085 * Send a "peer protocol" error message.
1086 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1087 * Returns -1 if there was not enough room left to send the message,
1088 * any other negative returned value must be considered as an error with an appctx st0
1089 * returned value equal to PEER_SESS_ST_END.
1090 */
1091static inline int peer_send_error_protomsg(struct appctx *appctx)
1092{
1093 struct peer_prep_params p = {
1094 .error.head = { PEER_MSG_CLASS_ERROR, PEER_MSG_ERR_PROTOCOL, },
1095 };
1096
1097 return peer_send_msg(appctx, peer_prepare_error_msg, &p);
1098}
1099
1100/*
Frédéric Lécaille6a8303d2019-01-22 22:25:17 +01001101 * Function used to lookup for recent stick-table updates associated with
1102 * <st> shared stick-table when a lesson must be taught a peer (PEER_F_LEARN_ASSIGN flag set).
1103 */
1104static inline struct stksess *peer_teach_process_stksess_lookup(struct shared_table *st)
1105{
1106 struct eb32_node *eb;
1107
1108 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1109 if (!eb) {
1110 eb = eb32_first(&st->table->updates);
1111 if (!eb || ((int)(eb->key - st->last_pushed) <= 0)) {
1112 st->table->commitupdate = st->last_pushed = st->table->localupdate;
1113 return NULL;
1114 }
1115 }
1116
1117 if ((int)(eb->key - st->table->localupdate) > 0) {
1118 st->table->commitupdate = st->last_pushed = st->table->localupdate;
1119 return NULL;
1120 }
1121
1122 return eb32_entry(eb, struct stksess, upd);
1123}
1124
1125/*
1126 * Function used to lookup for recent stick-table updates associated with
1127 * <st> shared stick-table during teach state 1 step.
1128 */
1129static inline struct stksess *peer_teach_stage1_stksess_lookup(struct shared_table *st)
1130{
1131 struct eb32_node *eb;
1132
1133 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1134 if (!eb) {
1135 st->flags |= SHTABLE_F_TEACH_STAGE1;
1136 eb = eb32_first(&st->table->updates);
1137 if (eb)
1138 st->last_pushed = eb->key - 1;
1139 return NULL;
1140 }
1141
1142 return eb32_entry(eb, struct stksess, upd);
1143}
1144
1145/*
1146 * Function used to lookup for recent stick-table updates associated with
1147 * <st> shared stick-table during teach state 2 step.
1148 */
1149static inline struct stksess *peer_teach_stage2_stksess_lookup(struct shared_table *st)
1150{
1151 struct eb32_node *eb;
1152
1153 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1154 if (!eb || eb->key > st->teaching_origin) {
1155 st->flags |= SHTABLE_F_TEACH_STAGE2;
1156 return NULL;
1157 }
1158
1159 return eb32_entry(eb, struct stksess, upd);
1160}
1161
1162/*
1163 * Generic function to emit update messages for <st> stick-table when a lesson must
1164 * be taught to the peer <p>.
1165 * <locked> must be set to 1 if the shared table <st> is already locked when entering
1166 * this function, 0 if not.
1167 *
1168 * This function temporary unlock/lock <st> when it sends stick-table updates or
1169 * when decrementing its refcount in case of any error when it sends this updates.
1170 *
1171 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1172 * Returns -1 if there was not enough room left to send the message,
1173 * any other negative returned value must be considered as an error with an appcxt st0
1174 * returned value equal to PEER_SESS_ST_END.
1175 * If it returns 0 or -1, this function leave <st> locked if already locked when entering this function
1176 * unlocked if not already locked when entering this function.
1177 */
1178static inline int peer_send_teachmsgs(struct appctx *appctx, struct peer *p,
1179 struct stksess *(*peer_stksess_lookup)(struct shared_table *),
1180 struct shared_table *st, int locked)
1181{
1182 int ret, new_pushed, use_timed;
1183
1184 ret = 1;
1185 use_timed = 0;
1186 if (st != p->last_local_table) {
1187 ret = peer_send_switchmsg(st, appctx);
1188 if (ret <= 0)
1189 return ret;
1190
1191 p->last_local_table = st;
1192 }
1193
1194 if (peer_stksess_lookup != peer_teach_process_stksess_lookup)
1195 use_timed = !(p->flags & PEER_F_DWNGRD);
1196
1197 /* We force new pushed to 1 to force identifier in update message */
1198 new_pushed = 1;
1199
1200 if (!locked)
1201 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1202
1203 while (1) {
1204 struct stksess *ts;
1205 unsigned updateid;
1206
1207 /* push local updates */
1208 ts = peer_stksess_lookup(st);
1209 if (!ts)
1210 break;
1211
1212 updateid = ts->upd.key;
1213 ts->ref_cnt++;
1214 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1215
1216 ret = peer_send_updatemsg(st, appctx, ts, updateid, new_pushed, use_timed);
1217 if (ret <= 0) {
1218 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1219 ts->ref_cnt--;
1220 if (!locked)
1221 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1222 return ret;
1223 }
1224
1225 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1226 ts->ref_cnt--;
1227 st->last_pushed = updateid;
1228
1229 if (peer_stksess_lookup == peer_teach_process_stksess_lookup &&
1230 (int)(st->last_pushed - st->table->commitupdate) > 0)
1231 st->table->commitupdate = st->last_pushed;
1232
1233 /* identifier may not needed in next update message */
1234 new_pushed = 0;
1235 }
1236
1237 out:
1238 if (!locked)
1239 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1240 return 1;
1241}
1242
1243/*
1244 * Function to emit update messages for <st> stick-table when a lesson must
1245 * be taught to the peer <p> (PEER_F_LEARN_ASSIGN flag set).
1246 *
1247 * Note that <st> shared stick-table is locked when calling this function.
1248 *
1249 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1250 * Returns -1 if there was not enough room left to send the message,
1251 * any other negative returned value must be considered as an error with an appcxt st0
1252 * returned value equal to PEER_SESS_ST_END.
1253 */
1254static inline int peer_send_teach_process_msgs(struct appctx *appctx, struct peer *p,
1255 struct shared_table *st)
1256{
1257 return peer_send_teachmsgs(appctx, p, peer_teach_process_stksess_lookup, st, 1);
1258}
1259
1260/*
1261 * Function to emit update messages for <st> stick-table when a lesson must
1262 * be taught to the peer <p> during teach state 1 step.
1263 *
1264 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1265 * Returns -1 if there was not enough room left to send the message,
1266 * any other negative returned value must be considered as an error with an appcxt st0
1267 * returned value equal to PEER_SESS_ST_END.
1268 */
1269static inline int peer_send_teach_stage1_msgs(struct appctx *appctx, struct peer *p,
1270 struct shared_table *st)
1271{
1272 return peer_send_teachmsgs(appctx, p, peer_teach_stage1_stksess_lookup, st, 0);
1273}
1274
1275/*
1276 * Function to emit update messages for <st> stick-table when a lesson must
1277 * be taught to the peer <p> during teach state 1 step.
1278 *
1279 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1280 * Returns -1 if there was not enough room left to send the message,
1281 * any other negative returned value must be considered as an error with an appcxt st0
1282 * returned value equal to PEER_SESS_ST_END.
1283 */
1284static inline int peer_send_teach_stage2_msgs(struct appctx *appctx, struct peer *p,
1285 struct shared_table *st)
1286{
1287 return peer_send_teachmsgs(appctx, p, peer_teach_stage2_stksess_lookup, st, 0);
1288}
1289
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001290
1291/*
1292 * Function used to parse a stick-table update message after it has been received
1293 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1294 * receipt buffer with <msg_end> being position of the end of the stick-table message.
1295 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1296 * was encountered.
1297 * <exp> must be set if the stick-table entry expires.
1298 * <updt> must be set for PEER_MSG_STKT_UPDATE or PEER_MSG_STKT_UPDATE_TIMED stick-table
1299 * messages, in this case the stick-table udpate message is received with a stick-table
1300 * update ID.
1301 * <totl> is the length of the stick-table update message computed upon receipt.
1302 */
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001303static int peer_treat_updatemsg(struct appctx *appctx, struct peer *p, int updt, int exp,
1304 char **msg_cur, char *msg_end, int msg_len, int totl)
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001305{
1306 struct stream_interface *si = appctx->owner;
1307 struct shared_table *st = p->remote_table;
1308 struct stksess *ts, *newts;
1309 uint32_t update;
1310 int expire;
1311 unsigned int data_type;
1312 void *data_ptr;
1313
1314 /* Here we have data message */
1315 if (!st)
1316 goto ignore_msg;
1317
1318 expire = MS_TO_TICKS(st->table->expire);
1319
1320 if (updt) {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001321 if (msg_len < sizeof(update))
1322 goto malformed_exit;
1323
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001324 memcpy(&update, *msg_cur, sizeof(update));
1325 *msg_cur += sizeof(update);
1326 st->last_get = htonl(update);
1327 }
1328 else {
1329 st->last_get++;
1330 }
1331
1332 if (exp) {
1333 size_t expire_sz = sizeof expire;
1334
Willy Tarreau1e82a142019-01-29 11:08:06 +01001335 if (*msg_cur + expire_sz > msg_end)
1336 goto malformed_exit;
1337
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001338 memcpy(&expire, *msg_cur, expire_sz);
1339 *msg_cur += expire_sz;
1340 expire = ntohl(expire);
1341 }
1342
1343 newts = stksess_new(st->table, NULL);
1344 if (!newts)
1345 goto ignore_msg;
1346
1347 if (st->table->type == SMP_T_STR) {
1348 unsigned int to_read, to_store;
1349
1350 to_read = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001351 if (!*msg_cur)
1352 goto malformed_free_newts;
1353
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001354 to_store = MIN(to_read, st->table->key_size - 1);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001355 if (*msg_cur + to_store > msg_end)
1356 goto malformed_free_newts;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001357
1358 memcpy(newts->key.key, *msg_cur, to_store);
1359 newts->key.key[to_store] = 0;
1360 *msg_cur += to_read;
1361 }
1362 else if (st->table->type == SMP_T_SINT) {
1363 unsigned int netinteger;
1364
Willy Tarreau1e82a142019-01-29 11:08:06 +01001365 if (*msg_cur + sizeof(netinteger) > msg_end)
1366 goto malformed_free_newts;
1367
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001368 memcpy(&netinteger, *msg_cur, sizeof(netinteger));
1369 netinteger = ntohl(netinteger);
1370 memcpy(newts->key.key, &netinteger, sizeof(netinteger));
1371 *msg_cur += sizeof(netinteger);
1372 }
1373 else {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001374 if (*msg_cur + st->table->key_size > msg_end)
1375 goto malformed_free_newts;
1376
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001377 memcpy(newts->key.key, *msg_cur, st->table->key_size);
1378 *msg_cur += st->table->key_size;
1379 }
1380
1381 /* lookup for existing entry */
1382 ts = stktable_set_entry(st->table, newts);
1383 if (ts != newts) {
1384 stksess_free(st->table, newts);
1385 newts = NULL;
1386 }
1387
1388 HA_RWLOCK_WRLOCK(STK_SESS_LOCK, &ts->lock);
1389
1390 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001391 uint64_t decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001392
1393 if (!((1 << data_type) & st->remote_data))
1394 continue;
1395
Willy Tarreau1e82a142019-01-29 11:08:06 +01001396 decoded_int = intdecode(msg_cur, msg_end);
1397 if (!*msg_cur)
1398 goto malformed_unlock;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001399
Willy Tarreau1e82a142019-01-29 11:08:06 +01001400 switch (stktable_data_types[data_type].std_type) {
1401 case STD_T_SINT:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001402 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1403 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001404 stktable_data_cast(data_ptr, std_t_sint) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001405 break;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001406
Willy Tarreau1e82a142019-01-29 11:08:06 +01001407 case STD_T_UINT:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001408 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1409 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001410 stktable_data_cast(data_ptr, std_t_uint) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001411 break;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001412
Willy Tarreau1e82a142019-01-29 11:08:06 +01001413 case STD_T_ULL:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001414 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1415 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001416 stktable_data_cast(data_ptr, std_t_ull) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001417 break;
Willy Tarreau1e82a142019-01-29 11:08:06 +01001418
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001419 case STD_T_FRQP: {
1420 struct freq_ctr_period data;
1421
1422 /* First bit is reserved for the freq_ctr_period lock
1423 Note: here we're still protected by the stksess lock
1424 so we don't need to update the update the freq_ctr_period
1425 using its internal lock */
1426
Willy Tarreau1e82a142019-01-29 11:08:06 +01001427 data.curr_tick = tick_add(now_ms, -decoded_int) & ~0x1;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001428 data.curr_ctr = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001429 if (!*msg_cur)
1430 goto malformed_unlock;
1431
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001432 data.prev_ctr = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001433 if (!*msg_cur)
1434 goto malformed_unlock;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001435
1436 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1437 if (data_ptr)
1438 stktable_data_cast(data_ptr, std_t_frqp) = data;
1439 break;
1440 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001441 case STD_T_DICT: {
1442 struct buffer *chunk;
1443 size_t data_len, value_len;
1444 unsigned int id;
1445 struct dict_entry *de;
1446 struct dcache *dc;
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001447 char *end;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001448
1449 data_len = decoded_int;
1450 if (*msg_cur + data_len > msg_end)
1451 goto malformed_unlock;
1452
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001453 /* Compute the end of the current data, <msg_end> being at the end of
1454 * the entire message.
1455 */
1456 end = *msg_cur + data_len;
1457 id = intdecode(msg_cur, end);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001458 if (!*msg_cur || !id)
1459 goto malformed_unlock;
1460
1461 dc = p->dcache;
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001462 if (*msg_cur == end) {
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001463 /* Dictionary entry key without value. */
1464 if (id > dc->max_entries)
1465 break;
1466 /* IDs sent over the network are numbered from 1. */
1467 de = dc->rx[id - 1].de;
1468 }
1469 else {
1470 chunk = get_trash_chunk();
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001471 value_len = intdecode(msg_cur, end);
1472 if (!*msg_cur || *msg_cur + value_len > end ||
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001473 unlikely(value_len + 1 >= chunk->size))
1474 goto malformed_unlock;
1475
1476 chunk_memcpy(chunk, *msg_cur, value_len);
1477 chunk->area[chunk->data] = '\0';
Frédéric Lécaille56aec0d2019-06-06 14:14:15 +02001478 *msg_cur += value_len;
1479
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001480 de = dict_insert(&server_name_dict, chunk->area);
1481 dc->rx[id - 1].de = de;
1482 }
1483 if (de) {
1484 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1485 if (data_ptr)
1486 stktable_data_cast(data_ptr, std_t_dict) = de;
1487 }
1488 break;
1489 }
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001490 }
1491 }
1492 /* Force new expiration */
1493 ts->expire = tick_add(now_ms, expire);
1494
1495 HA_RWLOCK_WRUNLOCK(STK_SESS_LOCK, &ts->lock);
1496 stktable_touch_remote(st->table, ts, 1);
1497 return 1;
1498
1499 ignore_msg:
1500 /* skip consumed message */
1501 co_skip(si_oc(si), totl);
1502 return 0;
Willy Tarreau1e82a142019-01-29 11:08:06 +01001503
1504 malformed_unlock:
1505 /* malformed message */
1506 HA_RWLOCK_WRUNLOCK(STK_SESS_LOCK, &ts->lock);
1507 stktable_touch_remote(st->table, ts, 1);
1508 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1509 return 0;
1510
1511 malformed_free_newts:
1512 /* malformed message */
1513 stksess_free(st->table, newts);
1514 malformed_exit:
1515 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1516 return 0;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001517}
1518
Frédéric Lécaille87f554c2019-01-22 17:26:50 +01001519/*
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001520 * Function used to parse a stick-table update acknowledgement message after it
1521 * has been received by <p> peer with <msg_cur> as address of the pointer to the position in the
1522 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1523 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1524 * was encountered.
1525 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1526 */
1527static inline int peer_treat_ackmsg(struct appctx *appctx, struct peer *p,
1528 char **msg_cur, char *msg_end)
1529{
1530 /* ack message */
1531 uint32_t table_id ;
1532 uint32_t update;
1533 struct shared_table *st;
1534
1535 table_id = intdecode(msg_cur, msg_end);
1536 if (!*msg_cur || (*msg_cur + sizeof(update) > msg_end)) {
1537 /* malformed message */
1538 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1539 return 0;
1540 }
1541
1542 memcpy(&update, *msg_cur, sizeof(update));
1543 update = ntohl(update);
1544
1545 for (st = p->tables; st; st = st->next) {
1546 if (st->local_id == table_id) {
1547 st->update = update;
1548 break;
1549 }
1550 }
1551
1552 return 1;
1553}
1554
1555/*
1556 * Function used to parse a stick-table switch message after it has been received
1557 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1558 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1559 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1560 * was encountered.
1561 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1562 */
1563static inline int peer_treat_switchmsg(struct appctx *appctx, struct peer *p,
1564 char **msg_cur, char *msg_end)
1565{
1566 struct shared_table *st;
1567 int table_id;
1568
1569 table_id = intdecode(msg_cur, msg_end);
1570 if (!*msg_cur) {
1571 /* malformed message */
1572 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1573 return 0;
1574 }
1575
1576 p->remote_table = NULL;
1577 for (st = p->tables; st; st = st->next) {
1578 if (st->remote_id == table_id) {
1579 p->remote_table = st;
1580 break;
1581 }
1582 }
1583
1584 return 1;
1585}
1586
1587/*
1588 * Function used to parse a stick-table definition message after it has been received
1589 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1590 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1591 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1592 * was encountered.
1593 * <totl> is the length of the stick-table update message computed upon receipt.
1594 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1595 */
1596static inline int peer_treat_definemsg(struct appctx *appctx, struct peer *p,
1597 char **msg_cur, char *msg_end, int totl)
1598{
1599 struct stream_interface *si = appctx->owner;
1600 int table_id_len;
1601 struct shared_table *st;
1602 int table_type;
1603 int table_keylen;
1604 int table_id;
1605 uint64_t table_data;
1606
1607 table_id = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001608 if (!*msg_cur)
1609 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001610
1611 table_id_len = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001612 if (!*msg_cur)
1613 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001614
1615 p->remote_table = NULL;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001616 if (!table_id_len || (*msg_cur + table_id_len) >= msg_end)
1617 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001618
1619 for (st = p->tables; st; st = st->next) {
1620 /* Reset IDs */
1621 if (st->remote_id == table_id)
1622 st->remote_id = 0;
1623
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +01001624 if (!p->remote_table && (table_id_len == strlen(st->table->nid)) &&
1625 (memcmp(st->table->nid, *msg_cur, table_id_len) == 0))
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001626 p->remote_table = st;
1627 }
1628
1629 if (!p->remote_table)
1630 goto ignore_msg;
1631
1632 *msg_cur += table_id_len;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001633 if (*msg_cur >= msg_end)
1634 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001635
1636 table_type = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001637 if (!*msg_cur)
1638 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001639
1640 table_keylen = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001641 if (!*msg_cur)
1642 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001643
1644 table_data = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001645 if (!*msg_cur)
1646 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001647
1648 if (p->remote_table->table->type != table_type
1649 || p->remote_table->table->key_size != table_keylen) {
1650 p->remote_table = NULL;
1651 goto ignore_msg;
1652 }
1653
1654 p->remote_table->remote_data = table_data;
1655 p->remote_table->remote_id = table_id;
1656 return 1;
1657
1658 ignore_msg:
1659 co_skip(si_oc(si), totl);
1660 return 0;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001661
1662 malformed_exit:
1663 /* malformed message */
1664 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1665 return 0;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001666}
1667
1668/*
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001669 * Receive a stick-table message.
1670 * Returns 1 if there was no error, if not, returns 0 if not enough data were available,
1671 * -1 if there was an error updating the appctx state st0 accordingly.
1672 */
1673static inline int peer_recv_msg(struct appctx *appctx, char *msg_head, size_t msg_head_sz,
1674 uint32_t *msg_len, int *totl)
1675{
1676 int reql;
1677 struct stream_interface *si = appctx->owner;
1678
1679 reql = co_getblk(si_oc(si), msg_head, 2 * sizeof(char), *totl);
1680 if (reql <= 0) /* closed or EOL not found */
1681 goto incomplete;
1682
1683 *totl += reql;
1684
Frédéric Lécaille36fb77e2019-06-04 08:28:19 +02001685 if (!(msg_head[1] & PEER_MSG_STKT_BIT_MASK))
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001686 return 1;
1687
1688 /* Read and Decode message length */
1689 reql = co_getblk(si_oc(si), &msg_head[2], sizeof(char), *totl);
1690 if (reql <= 0) /* closed */
1691 goto incomplete;
1692
1693 *totl += reql;
1694
Frédéric Lécaille32b55732019-06-03 18:29:51 +02001695 if ((unsigned int)msg_head[2] < PEER_ENC_2BYTES_MIN) {
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001696 *msg_len = msg_head[2];
1697 }
1698 else {
1699 int i;
1700 char *cur;
1701 char *end;
1702
1703 for (i = 3 ; i < msg_head_sz ; i++) {
1704 reql = co_getblk(si_oc(si), &msg_head[i], sizeof(char), *totl);
1705 if (reql <= 0) /* closed */
1706 goto incomplete;
1707
1708 *totl += reql;
1709
Frédéric Lécaille36fb77e2019-06-04 08:28:19 +02001710 if (!(msg_head[i] & PEER_MSG_STKT_BIT_MASK))
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001711 break;
1712 }
1713
1714 if (i == msg_head_sz) {
1715 /* malformed message */
1716 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1717 return -1;
1718 }
1719 end = msg_head + msg_head_sz;
1720 cur = &msg_head[2];
1721 *msg_len = intdecode(&cur, end);
1722 if (!cur) {
1723 /* malformed message */
1724 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1725 return -1;
1726 }
1727 }
1728
1729 /* Read message content */
1730 if (*msg_len) {
1731 if (*msg_len > trash.size) {
1732 /* Status code is not success, abort */
1733 appctx->st0 = PEER_SESS_ST_ERRSIZE;
1734 return -1;
1735 }
1736
1737 reql = co_getblk(si_oc(si), trash.area, *msg_len, *totl);
1738 if (reql <= 0) /* closed */
1739 goto incomplete;
1740 *totl += reql;
1741 }
1742
1743 return 1;
1744
1745 incomplete:
1746 if (reql < 0) {
1747 /* there was an error */
1748 appctx->st0 = PEER_SESS_ST_END;
1749 return -1;
1750 }
1751
1752 return 0;
1753}
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001754
1755/*
1756 * Treat the awaited message with <msg_head> as header.*
1757 * Return 1 if succeeded, 0 if not.
1758 */
1759static inline int peer_treat_awaited_msg(struct appctx *appctx, struct peer *peer, unsigned char *msg_head,
1760 char **msg_cur, char *msg_end, int msg_len, int totl)
1761{
1762 struct stream_interface *si = appctx->owner;
1763 struct stream *s = si_strm(si);
1764 struct peers *peers = strm_fe(s)->parent;
1765
1766 if (msg_head[0] == PEER_MSG_CLASS_CONTROL) {
1767 if (msg_head[1] == PEER_MSG_CTRL_RESYNCREQ) {
1768 struct shared_table *st;
1769 /* Reset message: remote need resync */
1770
1771 /* prepare tables fot a global push */
1772 for (st = peer->tables; st; st = st->next) {
1773 st->teaching_origin = st->last_pushed = st->table->update;
1774 st->flags = 0;
1775 }
1776
1777 /* reset teaching flags to 0 */
1778 peer->flags &= PEER_TEACH_RESET;
1779
1780 /* flag to start to teach lesson */
1781 peer->flags |= PEER_F_TEACH_PROCESS;
1782 }
1783 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCFINISHED) {
1784 if (peer->flags & PEER_F_LEARN_ASSIGN) {
1785 peer->flags &= ~PEER_F_LEARN_ASSIGN;
1786 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
1787 peers->flags |= (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE);
1788 }
1789 peer->confirm++;
1790 }
1791 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCPARTIAL) {
1792 if (peer->flags & PEER_F_LEARN_ASSIGN) {
1793 peer->flags &= ~PEER_F_LEARN_ASSIGN;
1794 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
1795
1796 peer->flags |= PEER_F_LEARN_NOTUP2DATE;
Frédéric Lécaille54bff832019-03-26 10:25:20 +01001797 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(PEER_RESYNC_TIMEOUT));
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001798 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
1799 }
1800 peer->confirm++;
1801 }
1802 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCCONFIRM) {
1803 struct shared_table *st;
1804
1805 /* If stopping state */
1806 if (stopping) {
1807 /* Close session, push resync no more needed */
1808 peer->flags |= PEER_F_TEACH_COMPLETE;
1809 appctx->st0 = PEER_SESS_ST_END;
1810 return 0;
1811 }
1812 for (st = peer->tables; st; st = st->next) {
1813 st->update = st->last_pushed = st->teaching_origin;
1814 st->flags = 0;
1815 }
1816
1817 /* reset teaching flags to 0 */
1818 peer->flags &= PEER_TEACH_RESET;
1819 }
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001820 else if (msg_head[1] == PEER_MSG_CTRL_HEARTBEAT) {
Frédéric Lécaille54bff832019-03-26 10:25:20 +01001821 peer->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001822 }
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001823 }
1824 else if (msg_head[0] == PEER_MSG_CLASS_STICKTABLE) {
1825 if (msg_head[1] == PEER_MSG_STKT_DEFINE) {
1826 if (!peer_treat_definemsg(appctx, peer, msg_cur, msg_end, totl))
1827 return 0;
1828 }
1829 else if (msg_head[1] == PEER_MSG_STKT_SWITCH) {
1830 if (!peer_treat_switchmsg(appctx, peer, msg_cur, msg_end))
1831 return 0;
1832 }
1833 else if (msg_head[1] == PEER_MSG_STKT_UPDATE ||
1834 msg_head[1] == PEER_MSG_STKT_INCUPDATE ||
1835 msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED ||
1836 msg_head[1] == PEER_MSG_STKT_INCUPDATE_TIMED) {
1837 int update, expire;
1838
1839 update = msg_head[1] == PEER_MSG_STKT_UPDATE || msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED;
1840 expire = msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED || msg_head[1] == PEER_MSG_STKT_INCUPDATE_TIMED;
1841 if (!peer_treat_updatemsg(appctx, peer, update, expire,
1842 msg_cur, msg_end, msg_len, totl))
1843 return 0;
1844
1845 }
1846 else if (msg_head[1] == PEER_MSG_STKT_ACK) {
1847 if (!peer_treat_ackmsg(appctx, peer, msg_cur, msg_end))
1848 return 0;
1849 }
1850 }
1851 else if (msg_head[0] == PEER_MSG_CLASS_RESERVED) {
1852 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1853 return 0;
1854 }
1855
1856 return 1;
1857}
Frédéric Lécaille25e1d5e2019-01-24 17:33:48 +01001858
1859
1860/*
1861 * Send any message to <peer> peer.
1862 * Returns 1 if succeeded, or -1 or 0 if failed.
1863 * -1 means an internal error occured, 0 is for a peer protocol error leading
1864 * to a peer state change (from the peer I/O handler point of view).
1865 */
1866static inline int peer_send_msgs(struct appctx *appctx, struct peer *peer)
1867{
1868 int repl;
1869 struct stream_interface *si = appctx->owner;
1870 struct stream *s = si_strm(si);
1871 struct peers *peers = strm_fe(s)->parent;
1872
1873 /* Need to request a resync */
1874 if ((peer->flags & PEER_F_LEARN_ASSIGN) &&
1875 (peers->flags & PEERS_F_RESYNC_ASSIGN) &&
1876 !(peers->flags & PEERS_F_RESYNC_PROCESS)) {
1877
1878 repl = peer_send_resync_reqmsg(appctx);
1879 if (repl <= 0)
1880 return repl;
1881
1882 peers->flags |= PEERS_F_RESYNC_PROCESS;
1883 }
1884
1885 /* Nothing to read, now we start to write */
1886 if (peer->tables) {
1887 struct shared_table *st;
1888 struct shared_table *last_local_table;
1889
1890 last_local_table = peer->last_local_table;
1891 if (!last_local_table)
1892 last_local_table = peer->tables;
1893 st = last_local_table->next;
1894
1895 while (1) {
1896 if (!st)
1897 st = peer->tables;
1898
1899 /* It remains some updates to ack */
1900 if (st->last_get != st->last_acked) {
1901 repl = peer_send_ackmsg(st, appctx);
1902 if (repl <= 0)
1903 return repl;
1904
1905 st->last_acked = st->last_get;
1906 }
1907
1908 if (!(peer->flags & PEER_F_TEACH_PROCESS)) {
1909 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1910 if (!(peer->flags & PEER_F_LEARN_ASSIGN) &&
1911 ((int)(st->last_pushed - st->table->localupdate) < 0)) {
1912
1913 repl = peer_send_teach_process_msgs(appctx, peer, st);
1914 if (repl <= 0) {
1915 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1916 return repl;
1917 }
1918 }
1919 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1920 }
1921 else {
1922 if (!(st->flags & SHTABLE_F_TEACH_STAGE1)) {
1923 repl = peer_send_teach_stage1_msgs(appctx, peer, st);
1924 if (repl <= 0)
1925 return repl;
1926 }
1927
1928 if (!(st->flags & SHTABLE_F_TEACH_STAGE2)) {
1929 repl = peer_send_teach_stage2_msgs(appctx, peer, st);
1930 if (repl <= 0)
1931 return repl;
1932 }
1933 }
1934
1935 if (st == last_local_table)
1936 break;
1937 st = st->next;
1938 }
1939 }
1940
1941 if ((peer->flags & PEER_F_TEACH_PROCESS) && !(peer->flags & PEER_F_TEACH_FINISHED)) {
1942 repl = peer_send_resync_finishedmsg(appctx, peer);
1943 if (repl <= 0)
1944 return repl;
1945
1946 /* flag finished message sent */
1947 peer->flags |= PEER_F_TEACH_FINISHED;
1948 }
1949
1950 /* Confirm finished or partial messages */
1951 while (peer->confirm) {
1952 repl = peer_send_resync_confirmsg(appctx);
1953 if (repl <= 0)
1954 return repl;
1955
1956 peer->confirm--;
1957 }
1958
1959 return 1;
1960}
1961
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001962/*
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01001963 * Read and parse a first line of a "hello" peer protocol message.
1964 * Returns 0 if could not read a line, -1 if there was a read error or
1965 * the line is malformed, 1 if succeeded.
1966 */
1967static inline int peer_getline_version(struct appctx *appctx,
1968 unsigned int *maj_ver, unsigned int *min_ver)
1969{
1970 int reql;
1971
1972 reql = peer_getline(appctx);
1973 if (!reql)
1974 return 0;
1975
1976 if (reql < 0)
1977 return -1;
1978
1979 /* test protocol */
1980 if (strncmp(PEER_SESSION_PROTO_NAME " ", trash.area, proto_len + 1) != 0) {
1981 appctx->st0 = PEER_SESS_ST_EXIT;
1982 appctx->st1 = PEER_SESS_SC_ERRPROTO;
1983 return -1;
1984 }
1985 if (peer_get_version(trash.area + proto_len + 1, maj_ver, min_ver) == -1 ||
1986 *maj_ver != PEER_MAJOR_VER || *min_ver > PEER_MINOR_VER) {
1987 appctx->st0 = PEER_SESS_ST_EXIT;
1988 appctx->st1 = PEER_SESS_SC_ERRVERSION;
1989 return -1;
1990 }
1991
1992 return 1;
1993}
1994
1995/*
1996 * Read and parse a second line of a "hello" peer protocol message.
1997 * Returns 0 if could not read a line, -1 if there was a read error or
1998 * the line is malformed, 1 if succeeded.
1999 */
2000static inline int peer_getline_host(struct appctx *appctx)
2001{
2002 int reql;
2003
2004 reql = peer_getline(appctx);
2005 if (!reql)
2006 return 0;
2007
2008 if (reql < 0)
2009 return -1;
2010
2011 /* test hostname match */
2012 if (strcmp(localpeer, trash.area) != 0) {
2013 appctx->st0 = PEER_SESS_ST_EXIT;
2014 appctx->st1 = PEER_SESS_SC_ERRHOST;
2015 return -1;
2016 }
2017
2018 return 1;
2019}
2020
2021/*
2022 * Read and parse a last line of a "hello" peer protocol message.
2023 * Returns 0 if could not read a character, -1 if there was a read error or
2024 * the line is malformed, 1 if succeeded.
2025 * Set <curpeer> accordingly (the remote peer sending the "hello" message).
2026 */
2027static inline int peer_getline_last(struct appctx *appctx, struct peer **curpeer)
2028{
2029 char *p;
2030 int reql;
2031 struct peer *peer;
2032 struct stream_interface *si = appctx->owner;
2033 struct stream *s = si_strm(si);
2034 struct peers *peers = strm_fe(s)->parent;
2035
2036 reql = peer_getline(appctx);
2037 if (!reql)
2038 return 0;
2039
2040 if (reql < 0)
2041 return -1;
2042
2043 /* parse line "<peer name> <pid> <relative_pid>" */
2044 p = strchr(trash.area, ' ');
2045 if (!p) {
2046 appctx->st0 = PEER_SESS_ST_EXIT;
2047 appctx->st1 = PEER_SESS_SC_ERRPROTO;
2048 return -1;
2049 }
2050 *p = 0;
2051
2052 /* lookup known peer */
2053 for (peer = peers->remote; peer; peer = peer->next) {
2054 if (strcmp(peer->id, trash.area) == 0)
2055 break;
2056 }
2057
2058 /* if unknown peer */
2059 if (!peer) {
2060 appctx->st0 = PEER_SESS_ST_EXIT;
2061 appctx->st1 = PEER_SESS_SC_ERRPEER;
2062 return -1;
2063 }
2064 *curpeer = peer;
2065
2066 return 1;
2067}
2068
2069/*
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002070 * Init <peer> peer after having accepted it at peer protocol level.
2071 */
2072static inline void init_accepted_peer(struct peer *peer, struct peers *peers)
2073{
2074 struct shared_table *st;
2075
2076 /* Register status code */
2077 peer->statuscode = PEER_SESS_SC_SUCCESSCODE;
2078
2079 /* Awake main task */
2080 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
2081
2082 /* Init confirm counter */
2083 peer->confirm = 0;
2084
2085 /* Init cursors */
2086 for (st = peer->tables; st ; st = st->next) {
2087 st->last_get = st->last_acked = 0;
2088 st->teaching_origin = st->last_pushed = st->update;
2089 }
2090
2091 /* reset teaching and learning flags to 0 */
2092 peer->flags &= PEER_TEACH_RESET;
2093 peer->flags &= PEER_LEARN_RESET;
2094
2095 /* if current peer is local */
2096 if (peer->local) {
2097 /* if current host need resyncfrom local and no process assined */
2098 if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMLOCAL &&
2099 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2100 /* assign local peer for a lesson, consider lesson already requested */
2101 peer->flags |= PEER_F_LEARN_ASSIGN;
2102 peers->flags |= (PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
2103 }
2104
2105 }
2106 else if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE &&
2107 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2108 /* assign peer for a lesson */
2109 peer->flags |= PEER_F_LEARN_ASSIGN;
2110 peers->flags |= PEERS_F_RESYNC_ASSIGN;
2111 }
2112}
2113
2114/*
2115 * Init <peer> peer after having connected it at peer protocol level.
2116 */
2117static inline void init_connected_peer(struct peer *peer, struct peers *peers)
2118{
2119 struct shared_table *st;
2120
2121 /* Init cursors */
2122 for (st = peer->tables; st ; st = st->next) {
2123 st->last_get = st->last_acked = 0;
2124 st->teaching_origin = st->last_pushed = st->update;
2125 }
2126
2127 /* Init confirm counter */
2128 peer->confirm = 0;
2129
2130 /* reset teaching and learning flags to 0 */
2131 peer->flags &= PEER_TEACH_RESET;
2132 peer->flags &= PEER_LEARN_RESET;
2133
2134 /* If current peer is local */
2135 if (peer->local) {
2136 /* flag to start to teach lesson */
2137 peer->flags |= PEER_F_TEACH_PROCESS;
2138 }
2139 else if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE &&
2140 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2141 /* If peer is remote and resync from remote is needed,
2142 and no peer currently assigned */
2143
2144 /* assign peer for a lesson */
2145 peer->flags |= PEER_F_LEARN_ASSIGN;
2146 peers->flags |= PEERS_F_RESYNC_ASSIGN;
2147 }
2148}
2149
2150/*
Emeric Brun2b920a12010-09-23 18:30:22 +02002151 * IO Handler to handle message exchance with a peer
2152 */
Willy Tarreau00a37f02015-04-13 12:05:19 +02002153static void peer_io_handler(struct appctx *appctx)
Emeric Brun2b920a12010-09-23 18:30:22 +02002154{
Willy Tarreau00a37f02015-04-13 12:05:19 +02002155 struct stream_interface *si = appctx->owner;
Willy Tarreau87b09662015-04-03 00:22:06 +02002156 struct stream *s = si_strm(si);
Vincent Bernat3c2f2f22016-04-03 13:48:42 +02002157 struct peers *curpeers = strm_fe(s)->parent;
Emeric Brun80527f52017-06-19 17:46:37 +02002158 struct peer *curpeer = NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002159 int reql = 0;
2160 int repl = 0;
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002161 unsigned int maj_ver, min_ver;
Willy Tarreau2d372c22018-11-05 17:12:27 +01002162 int prev_state;
Emeric Brun2b920a12010-09-23 18:30:22 +02002163
Joseph Herlant82b2f542018-11-15 12:19:14 -08002164 /* Check if the input buffer is available. */
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002165 if (si_ic(si)->buf.size == 0) {
2166 si_rx_room_blk(si);
2167 goto out;
2168 }
Christopher Fauleta73e59b2016-12-09 17:30:18 +01002169
Emeric Brun2b920a12010-09-23 18:30:22 +02002170 while (1) {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002171 prev_state = appctx->st0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002172switchstate:
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002173 maj_ver = min_ver = (unsigned int)-1;
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002174 switch(appctx->st0) {
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002175 case PEER_SESS_ST_ACCEPT:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002176 prev_state = appctx->st0;
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002177 appctx->ctx.peers.ptr = NULL;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002178 appctx->st0 = PEER_SESS_ST_GETVERSION;
Emeric Brun2b920a12010-09-23 18:30:22 +02002179 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002180 case PEER_SESS_ST_GETVERSION:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002181 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002182 reql = peer_getline_version(appctx, &maj_ver, &min_ver);
2183 if (reql <= 0) {
2184 if (!reql)
2185 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002186 goto switchstate;
2187 }
2188
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002189 appctx->st0 = PEER_SESS_ST_GETHOST;
Emeric Brun2b920a12010-09-23 18:30:22 +02002190 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002191 case PEER_SESS_ST_GETHOST:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002192 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002193 reql = peer_getline_host(appctx);
2194 if (reql <= 0) {
2195 if (!reql)
2196 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002197 goto switchstate;
2198 }
2199
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002200 appctx->st0 = PEER_SESS_ST_GETPEER;
Emeric Brun2b920a12010-09-23 18:30:22 +02002201 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002202 case PEER_SESS_ST_GETPEER: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002203 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002204 reql = peer_getline_last(appctx, &curpeer);
2205 if (reql <= 0) {
2206 if (!reql)
2207 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002208 goto switchstate;
2209 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002210
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002211 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Willy Tarreau9df94c22016-10-31 18:42:52 +01002212 if (curpeer->appctx && curpeer->appctx != appctx) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002213 if (curpeer->local) {
2214 /* Local connection, reply a retry */
2215 appctx->st0 = PEER_SESS_ST_EXIT;
2216 appctx->st1 = PEER_SESS_SC_TRYAGAIN;
2217 goto switchstate;
Emeric Brun2b920a12010-09-23 18:30:22 +02002218 }
Emeric Brun80527f52017-06-19 17:46:37 +02002219
2220 /* we're killing a connection, we must apply a random delay before
2221 * retrying otherwise the other end will do the same and we can loop
2222 * for a while.
2223 */
2224 curpeer->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + random() % 2000));
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002225 peer_session_forceshutdown(curpeer);
Emeric Brun2b920a12010-09-23 18:30:22 +02002226 }
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002227 if (maj_ver != (unsigned int)-1 && min_ver != (unsigned int)-1) {
2228 if (min_ver == PEER_DWNGRD_MINOR_VER) {
2229 curpeer->flags |= PEER_F_DWNGRD;
2230 }
2231 else {
2232 curpeer->flags &= ~PEER_F_DWNGRD;
2233 }
2234 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002235 curpeer->appctx = appctx;
2236 appctx->ctx.peers.ptr = curpeer;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002237 appctx->st0 = PEER_SESS_ST_SENDSUCCESS;
Olivier Houcharded879892019-03-08 18:53:43 +01002238 _HA_ATOMIC_ADD(&active_peers, 1);
Emeric Brun2b920a12010-09-23 18:30:22 +02002239 /* fall through */
2240 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002241 case PEER_SESS_ST_SENDSUCCESS: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002242 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002243 if (!curpeer) {
2244 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002245 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002246 if (curpeer->appctx != appctx) {
2247 appctx->st0 = PEER_SESS_ST_END;
2248 goto switchstate;
2249 }
2250 }
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002251
2252 repl = peer_send_status_successmsg(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002253 if (repl <= 0) {
2254 if (repl == -1)
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002255 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002256 goto switchstate;
2257 }
2258
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002259 init_accepted_peer(curpeer, curpeers);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002260
Emeric Brun2b920a12010-09-23 18:30:22 +02002261 /* switch to waiting message state */
Olivier Houcharded879892019-03-08 18:53:43 +01002262 _HA_ATOMIC_ADD(&connected_peers, 1);
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002263 appctx->st0 = PEER_SESS_ST_WAITMSG;
Emeric Brun2b920a12010-09-23 18:30:22 +02002264 goto switchstate;
2265 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002266 case PEER_SESS_ST_CONNECT: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002267 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002268 if (!curpeer) {
2269 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002270 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002271 if (curpeer->appctx != appctx) {
2272 appctx->st0 = PEER_SESS_ST_END;
2273 goto switchstate;
2274 }
2275 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002276
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002277 repl = peer_send_hellomsg(appctx, curpeer);
Emeric Brun2b920a12010-09-23 18:30:22 +02002278 if (repl <= 0) {
2279 if (repl == -1)
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002280 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002281 goto switchstate;
2282 }
2283
2284 /* switch to the waiting statuscode state */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002285 appctx->st0 = PEER_SESS_ST_GETSTATUS;
Emeric Brun2b920a12010-09-23 18:30:22 +02002286 /* fall through */
2287 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002288 case PEER_SESS_ST_GETSTATUS: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002289 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002290 if (!curpeer) {
2291 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002292 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002293 if (curpeer->appctx != appctx) {
2294 appctx->st0 = PEER_SESS_ST_END;
2295 goto switchstate;
2296 }
2297 }
2298
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002299 if (si_ic(si)->flags & CF_WRITE_PARTIAL)
Emeric Brunb3971ab2015-05-12 18:49:09 +02002300 curpeer->statuscode = PEER_SESS_SC_CONNECTEDCODE;
Emeric Brun2b920a12010-09-23 18:30:22 +02002301
Frédéric Lécaillece025572019-01-21 13:38:06 +01002302 reql = peer_getline(appctx);
2303 if (!reql)
2304 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002305
Frédéric Lécaillece025572019-01-21 13:38:06 +01002306 if (reql < 0)
2307 goto switchstate;
Emeric Brun2b920a12010-09-23 18:30:22 +02002308
2309 /* Register status code */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02002310 curpeer->statuscode = atoi(trash.area);
Emeric Brun2b920a12010-09-23 18:30:22 +02002311
2312 /* Awake main task */
Frédéric Lécailleed2b4a62017-07-13 09:07:09 +02002313 task_wakeup(curpeers->sync_task, TASK_WOKEN_MSG);
Emeric Brun2b920a12010-09-23 18:30:22 +02002314
2315 /* If status code is success */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002316 if (curpeer->statuscode == PEER_SESS_SC_SUCCESSCODE) {
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002317 init_connected_peer(curpeer, curpeers);
Emeric Brun2b920a12010-09-23 18:30:22 +02002318 }
2319 else {
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002320 if (curpeer->statuscode == PEER_SESS_SC_ERRVERSION)
2321 curpeer->flags |= PEER_F_DWNGRD;
Emeric Brun2b920a12010-09-23 18:30:22 +02002322 /* Status code is not success, abort */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002323 appctx->st0 = PEER_SESS_ST_END;
Emeric Brun2b920a12010-09-23 18:30:22 +02002324 goto switchstate;
2325 }
Olivier Houcharded879892019-03-08 18:53:43 +01002326 _HA_ATOMIC_ADD(&connected_peers, 1);
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002327 appctx->st0 = PEER_SESS_ST_WAITMSG;
Emeric Brun2b920a12010-09-23 18:30:22 +02002328 /* fall through */
2329 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002330 case PEER_SESS_ST_WAITMSG: {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002331 uint32_t msg_len = 0;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02002332 char *msg_cur = trash.area;
2333 char *msg_end = trash.area;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002334 unsigned char msg_head[7];
Emeric Brun2b920a12010-09-23 18:30:22 +02002335 int totl = 0;
2336
Willy Tarreau2d372c22018-11-05 17:12:27 +01002337 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002338 if (!curpeer) {
2339 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002340 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002341 if (curpeer->appctx != appctx) {
2342 appctx->st0 = PEER_SESS_ST_END;
2343 goto switchstate;
2344 }
2345 }
2346
Frédéric Lécaille95203f22019-01-23 19:38:11 +01002347 reql = peer_recv_msg(appctx, (char *)msg_head, sizeof msg_head, &msg_len, &totl);
2348 if (reql <= 0) {
2349 if (reql == -1)
2350 goto switchstate;
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002351 goto send_msgs;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002352 }
Willy Tarreau86a446e2013-11-25 23:02:37 +01002353
Frédéric Lécaille95203f22019-01-23 19:38:11 +01002354 msg_end += msg_len;
Frédéric Lécaille444243c2019-01-24 15:40:11 +01002355 if (!peer_treat_awaited_msg(appctx, curpeer, msg_head, &msg_cur, msg_end, msg_len, totl))
Emeric Brun2b920a12010-09-23 18:30:22 +02002356 goto switchstate;
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002357
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002358 curpeer->flags |= PEER_F_ALIVE;
2359
Emeric Brun2b920a12010-09-23 18:30:22 +02002360 /* skip consumed message */
Willy Tarreau06d80a92017-10-19 14:32:15 +02002361 co_skip(si_oc(si), totl);
Emeric Brun2b920a12010-09-23 18:30:22 +02002362 /* loop on that state to peek next message */
Willy Tarreau72d6c162013-04-11 16:14:13 +02002363 goto switchstate;
2364
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002365send_msgs:
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002366 if (curpeer->flags & PEER_F_HEARTBEAT) {
2367 curpeer->flags &= ~PEER_F_HEARTBEAT;
2368 repl = peer_send_heartbeatmsg(appctx);
2369 if (repl <= 0) {
2370 if (repl == -1)
2371 goto out;
2372 goto switchstate;
2373 }
2374 }
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002375 /* we get here when a peer_recv_msg() returns 0 in reql */
Frédéric Lécaille25e1d5e2019-01-24 17:33:48 +01002376 repl = peer_send_msgs(appctx, curpeer);
2377 if (repl <= 0) {
2378 if (repl == -1)
2379 goto out;
2380 goto switchstate;
Emeric Brun597b26e2016-08-12 11:23:31 +02002381 }
2382
Emeric Brun2b920a12010-09-23 18:30:22 +02002383 /* noting more to do */
2384 goto out;
2385 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002386 case PEER_SESS_ST_EXIT:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002387 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002388 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002389 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002390 if (peer_send_status_errormsg(appctx) == -1)
2391 goto out;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002392 appctx->st0 = PEER_SESS_ST_END;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002393 goto switchstate;
2394 case PEER_SESS_ST_ERRSIZE: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002395 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002396 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002397 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002398 if (peer_send_error_size_limitmsg(appctx) == -1)
2399 goto out;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002400 appctx->st0 = PEER_SESS_ST_END;
2401 goto switchstate;
2402 }
2403 case PEER_SESS_ST_ERRPROTO: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002404 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002405 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002406 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002407 if (peer_send_error_protomsg(appctx) == -1)
2408 goto out;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002409 appctx->st0 = PEER_SESS_ST_END;
Willy Tarreau2d372c22018-11-05 17:12:27 +01002410 prev_state = appctx->st0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002411 /* fall through */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002412 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002413 case PEER_SESS_ST_END: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002414 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002415 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002416 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002417 if (curpeer) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002418 HA_SPIN_UNLOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002419 curpeer = NULL;
2420 }
Willy Tarreau73b013b2012-05-21 16:31:45 +02002421 si_shutw(si);
2422 si_shutr(si);
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002423 si_ic(si)->flags |= CF_READ_NULL;
Willy Tarreau828824a2015-04-19 17:20:03 +02002424 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002425 }
2426 }
2427 }
2428out:
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002429 si_oc(si)->flags |= CF_READ_DONTWAIT;
Emeric Brun80527f52017-06-19 17:46:37 +02002430
2431 if (curpeer)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002432 HA_SPIN_UNLOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun2b920a12010-09-23 18:30:22 +02002433 return;
2434}
2435
Willy Tarreau30576452015-04-13 13:50:30 +02002436static struct applet peer_applet = {
Willy Tarreau3fdb3662012-11-12 00:42:33 +01002437 .obj_type = OBJ_TYPE_APPLET,
Willy Tarreaub24281b2011-02-13 13:16:36 +01002438 .name = "<PEER>", /* used for logging */
2439 .fct = peer_io_handler,
Aman Gupta9a13e842012-04-02 18:57:53 -07002440 .release = peer_session_release,
Willy Tarreaub24281b2011-02-13 13:16:36 +01002441};
Emeric Brun2b920a12010-09-23 18:30:22 +02002442
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002443
Emeric Brun2b920a12010-09-23 18:30:22 +02002444/*
2445 * Use this function to force a close of a peer session
2446 */
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002447static void peer_session_forceshutdown(struct peer *peer)
Emeric Brun2b920a12010-09-23 18:30:22 +02002448{
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002449 struct appctx *appctx = peer->appctx;
2450
Frédéric Lécaille5df11902017-06-13 16:39:57 +02002451 /* Note that the peer sessions which have just been created
2452 * (->st0 == PEER_SESS_ST_CONNECT) must not
2453 * be shutdown, if not, the TCP session will never be closed
2454 * and stay in CLOSE_WAIT state after having been closed by
2455 * the remote side.
2456 */
2457 if (!appctx || appctx->st0 == PEER_SESS_ST_CONNECT)
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002458 return;
2459
Willy Tarreau81bc3b02016-10-31 17:37:39 +01002460 if (appctx->applet != &peer_applet)
2461 return;
2462
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002463 __peer_session_deinit(peer);
2464
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002465 appctx->st0 = PEER_SESS_ST_END;
Willy Tarreau78c0c502016-10-31 17:32:20 +01002466 appctx_wakeup(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002467}
2468
Willy Tarreau91d96282015-03-13 15:47:26 +01002469/* Pre-configures a peers frontend to accept incoming connections */
2470void peers_setup_frontend(struct proxy *fe)
2471{
2472 fe->last_change = now.tv_sec;
Frédéric Lécaillec06b5d42018-04-26 10:06:41 +02002473 fe->cap = PR_CAP_FE | PR_CAP_BE;
Willy Tarreau91d96282015-03-13 15:47:26 +01002474 fe->maxconn = 0;
2475 fe->conn_retries = CONN_RETRIES;
2476 fe->timeout.client = MS_TO_TICKS(5000);
Willy Tarreaud1d48d42015-03-13 16:15:46 +01002477 fe->accept = frontend_accept;
Willy Tarreauf87ab942015-03-13 15:55:16 +01002478 fe->default_target = &peer_applet.obj_type;
Willy Tarreau91d96282015-03-13 15:47:26 +01002479 fe->options2 |= PR_O2_INDEPSTR | PR_O2_SMARTCON | PR_O2_SMARTACC;
Willy Tarreau0fca4832015-05-01 19:12:05 +02002480 fe->bind_proc = 0; /* will be filled by users */
Willy Tarreau91d96282015-03-13 15:47:26 +01002481}
2482
Emeric Brun2b920a12010-09-23 18:30:22 +02002483/*
Willy Tarreaubd55e312010-11-11 10:55:09 +01002484 * Create a new peer session in assigned state (connect will start automatically)
Emeric Brun2b920a12010-09-23 18:30:22 +02002485 */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002486static struct appctx *peer_session_create(struct peers *peers, struct peer *peer)
Emeric Brun2b920a12010-09-23 18:30:22 +02002487{
Willy Tarreau04b92862017-09-15 11:01:04 +02002488 struct proxy *p = peers->peers_fe; /* attached frontend */
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002489 struct appctx *appctx;
Willy Tarreau15b5e142015-04-04 14:38:25 +02002490 struct session *sess;
Willy Tarreau87b09662015-04-03 00:22:06 +02002491 struct stream *s;
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002492 struct connection *conn;
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002493 struct conn_stream *cs;
Emeric Brun2b920a12010-09-23 18:30:22 +02002494
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002495 peer->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002496 peer->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
Emeric Brunb3971ab2015-05-12 18:49:09 +02002497 peer->statuscode = PEER_SESS_SC_CONNECTCODE;
Willy Tarreaud990baf2015-04-05 00:32:03 +02002498 s = NULL;
2499
Emeric Brun1138fd02017-06-19 12:38:55 +02002500 appctx = appctx_new(&peer_applet, tid_bit);
Willy Tarreaud990baf2015-04-05 00:32:03 +02002501 if (!appctx)
2502 goto out_close;
2503
2504 appctx->st0 = PEER_SESS_ST_CONNECT;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002505 appctx->ctx.peers.ptr = (void *)peer;
Willy Tarreaud990baf2015-04-05 00:32:03 +02002506
Willy Tarreau04b92862017-09-15 11:01:04 +02002507 sess = session_new(p, NULL, &appctx->obj_type);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002508 if (!sess) {
Christopher Faulet767a84b2017-11-24 16:50:31 +01002509 ha_alert("out of memory in peer_session_create().\n");
Willy Tarreaud990baf2015-04-05 00:32:03 +02002510 goto out_free_appctx;
Emeric Brun2b920a12010-09-23 18:30:22 +02002511 }
2512
Willy Tarreau87787ac2017-08-28 16:22:54 +02002513 if ((s = stream_new(sess, &appctx->obj_type)) == NULL) {
Christopher Faulet767a84b2017-11-24 16:50:31 +01002514 ha_alert("Failed to initialize stream in peer_session_create().\n");
Willy Tarreau87787ac2017-08-28 16:22:54 +02002515 goto out_free_sess;
Willy Tarreau8baf9062015-04-05 00:46:36 +02002516 }
2517
Willy Tarreau342bfb12015-04-05 01:35:34 +02002518 /* The tasks below are normally what is supposed to be done by
2519 * fe->accept().
2520 */
Willy Tarreaue7dff022015-04-03 01:14:29 +02002521 s->flags = SF_ASSIGNED|SF_ADDR_SET;
Emeric Brun2b920a12010-09-23 18:30:22 +02002522
Willy Tarreau6e2979c2015-04-27 13:21:15 +02002523 /* applet is waiting for data */
Willy Tarreau0cd3bd62018-11-06 18:46:37 +01002524 si_cant_get(&s->si[0]);
Willy Tarreau6e2979c2015-04-27 13:21:15 +02002525 appctx_wakeup(appctx);
2526
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002527 /* initiate an outgoing connection */
Willy Tarreaudbd02672017-12-06 17:39:53 +01002528 s->si[1].flags |= SI_FL_NOLINGER;
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002529 si_set_state(&s->si[1], SI_ST_ASS);
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002530
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002531 /* automatically prepare the stream interface to connect to the
Willy Tarreaub363a1f2013-10-01 10:45:07 +02002532 * pre-initialized connection in si->conn.
2533 */
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002534 if (unlikely((conn = conn_new()) == NULL))
Willy Tarreau8baf9062015-04-05 00:46:36 +02002535 goto out_free_strm;
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002536
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002537 if (unlikely((cs = cs_new(conn)) == NULL))
2538 goto out_free_conn;
2539
Frédéric Lécaille1055e682018-04-26 14:35:21 +02002540 conn->target = s->target = peer_session_target(peer, s);
Willy Tarreaube373152018-09-06 11:45:30 +02002541 memcpy(&conn->addr.to, &peer->addr, sizeof(conn->addr.to));
2542
Frédéric Lécaille1055e682018-04-26 14:35:21 +02002543 conn_prepare(conn, peer->proto, peer_xprt(peer));
Olivier Houchardef60ff32019-01-29 19:00:33 +01002544 if (conn_install_mux(conn, &mux_pt_ops, cs, s->be, NULL) < 0)
2545 goto out_free_cs;
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002546 si_attach_cs(&s->si[1], cs);
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002547
Emeric Brun2b920a12010-09-23 18:30:22 +02002548 s->do_log = NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002549 s->uniq_id = 0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002550
Willy Tarreau22ec1ea2014-11-27 20:45:39 +01002551 s->res.flags |= CF_READ_DONTWAIT;
Willy Tarreau696a2912014-11-24 11:36:57 +01002552
Emeric Brunb3971ab2015-05-12 18:49:09 +02002553 peer->appctx = appctx;
Willy Tarreau87787ac2017-08-28 16:22:54 +02002554 task_wakeup(s->task, TASK_WOKEN_INIT);
Olivier Houcharded879892019-03-08 18:53:43 +01002555 _HA_ATOMIC_ADD(&active_peers, 1);
Willy Tarreau9df94c22016-10-31 18:42:52 +01002556 return appctx;
Emeric Brun2b920a12010-09-23 18:30:22 +02002557
2558 /* Error unrolling */
Olivier Houchardef60ff32019-01-29 19:00:33 +01002559out_free_cs:
2560 cs_free(cs);
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002561 out_free_conn:
2562 conn_free(conn);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002563 out_free_strm:
Emeric Brun2b920a12010-09-23 18:30:22 +02002564 LIST_DEL(&s->list);
Willy Tarreaubafbe012017-11-24 17:34:44 +01002565 pool_free(pool_head_stream, s);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002566 out_free_sess:
Willy Tarreau11c36242015-04-04 15:54:03 +02002567 session_free(sess);
Willy Tarreaud990baf2015-04-05 00:32:03 +02002568 out_free_appctx:
2569 appctx_free(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002570 out_close:
Willy Tarreaub21d08e2016-10-31 17:46:57 +01002571 return NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002572}
2573
2574/*
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002575 * Task processing function to manage re-connect, peer session
2576 * tasks wakeup on local update and heartbeat.
Emeric Brun2b920a12010-09-23 18:30:22 +02002577 */
Olivier Houchard9f6af332018-05-25 14:04:04 +02002578static struct task *process_peer_sync(struct task * task, void *context, unsigned short state)
Emeric Brun2b920a12010-09-23 18:30:22 +02002579{
Olivier Houchard9f6af332018-05-25 14:04:04 +02002580 struct peers *peers = context;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002581 struct peer *ps;
2582 struct shared_table *st;
Emeric Brun2b920a12010-09-23 18:30:22 +02002583
2584 task->expire = TICK_ETERNITY;
2585
Emeric Brunb3971ab2015-05-12 18:49:09 +02002586 if (!peers->peers_fe) {
Willy Tarreau46dc1ca2015-05-01 18:32:13 +02002587 /* this one was never started, kill it */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002588 signal_unregister_handler(peers->sighandler);
Olivier Houchard3f795f72019-04-17 22:51:06 +02002589 task_destroy(peers->sync_task);
Willy Tarreau37bb7be2015-09-21 15:24:58 +02002590 peers->sync_task = NULL;
Willy Tarreau46dc1ca2015-05-01 18:32:13 +02002591 return NULL;
2592 }
2593
Emeric Brun80527f52017-06-19 17:46:37 +02002594 /* Acquire lock for all peers of the section */
2595 for (ps = peers->remote; ps; ps = ps->next)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002596 HA_SPIN_LOCK(PEER_LOCK, &ps->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002597
Emeric Brun2b920a12010-09-23 18:30:22 +02002598 if (!stopping) {
2599 /* Normal case (not soft stop)*/
Emeric Brunb3971ab2015-05-12 18:49:09 +02002600
2601 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMLOCAL) &&
2602 (!nb_oldpids || tick_is_expired(peers->resync_timeout, now_ms)) &&
2603 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002604 /* Resync from local peer needed
2605 no peer was assigned for the lesson
2606 and no old local peer found
2607 or resync timeout expire */
2608
2609 /* flag no more resync from local, to try resync from remotes */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002610 peers->flags |= PEERS_F_RESYNC_LOCAL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002611
2612 /* reschedule a resync */
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002613 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(PEER_RESYNC_TIMEOUT));
Emeric Brun2b920a12010-09-23 18:30:22 +02002614 }
2615
2616 /* For each session */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002617 for (ps = peers->remote; ps; ps = ps->next) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002618 /* For each remote peers */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002619 if (!ps->local) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002620 if (!ps->appctx) {
2621 /* no active peer connection */
Emeric Brun2b920a12010-09-23 18:30:22 +02002622 if (ps->statuscode == 0 ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002623 ((ps->statuscode == PEER_SESS_SC_CONNECTCODE ||
Willy Tarreaub4e34da2015-05-20 10:39:04 +02002624 ps->statuscode == PEER_SESS_SC_SUCCESSCODE ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002625 ps->statuscode == PEER_SESS_SC_CONNECTEDCODE) &&
Emeric Brun2b920a12010-09-23 18:30:22 +02002626 tick_is_expired(ps->reconnect, now_ms))) {
2627 /* connection never tried
Willy Tarreau9df94c22016-10-31 18:42:52 +01002628 * or previous peer connection established with success
2629 * or previous peer connection failed while connecting
Emeric Brun2b920a12010-09-23 18:30:22 +02002630 * and reconnection timer is expired */
2631
2632 /* retry a connect */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002633 ps->appctx = peer_session_create(peers, ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002634 }
Willy Tarreaub4e34da2015-05-20 10:39:04 +02002635 else if (!tick_is_expired(ps->reconnect, now_ms)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002636 /* If previous session failed during connection
2637 * but reconnection timer is not expired */
2638
2639 /* reschedule task for reconnect */
2640 task->expire = tick_first(task->expire, ps->reconnect);
2641 }
2642 /* else do nothing */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002643 } /* !ps->appctx */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002644 else if (ps->statuscode == PEER_SESS_SC_SUCCESSCODE) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002645 /* current peer connection is active and established */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002646 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE) &&
2647 !(peers->flags & PEERS_F_RESYNC_ASSIGN) &&
Emeric Brun2b920a12010-09-23 18:30:22 +02002648 !(ps->flags & PEER_F_LEARN_NOTUP2DATE)) {
2649 /* Resync from a remote is needed
2650 * and no peer was assigned for lesson
2651 * and current peer may be up2date */
2652
2653 /* assign peer for the lesson */
2654 ps->flags |= PEER_F_LEARN_ASSIGN;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002655 peers->flags |= PEERS_F_RESYNC_ASSIGN;
Emeric Brun2b920a12010-09-23 18:30:22 +02002656
Willy Tarreau9df94c22016-10-31 18:42:52 +01002657 /* wake up peer handler to handle a request of resync */
Willy Tarreaue5843b32015-04-27 18:40:14 +02002658 appctx_wakeup(ps->appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002659 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002660 else {
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002661 int update_to_push = 0;
2662
Emeric Brunb3971ab2015-05-12 18:49:09 +02002663 /* Awake session if there is data to push */
2664 for (st = ps->tables; st ; st = st->next) {
2665 if ((int)(st->last_pushed - st->table->localupdate) < 0) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002666 /* wake up the peer handler to push local updates */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002667 update_to_push = 1;
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002668 /* There is no need to send a heartbeat message
2669 * when some updates must be pushed. The remote
2670 * peer will consider <ps> peer as alive when it will
2671 * receive these updates.
2672 */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002673 ps->flags &= ~PEER_F_HEARTBEAT;
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002674 /* Re-schedule another one later. */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002675 ps->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002676 /* We are going to send updates, let's ensure we will
2677 * come back to send heartbeat messages or to reconnect.
2678 */
2679 task->expire = tick_first(ps->reconnect, ps->heartbeat);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002680 appctx_wakeup(ps->appctx);
2681 break;
2682 }
2683 }
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002684 /* When there are updates to send we do not reconnect
2685 * and do not send heartbeat message either.
2686 */
2687 if (!update_to_push) {
2688 if (tick_is_expired(ps->reconnect, now_ms)) {
2689 if (ps->flags & PEER_F_ALIVE) {
2690 /* This peer was alive during a 'reconnect' period.
2691 * Flag it as not alive again for the next period.
2692 */
2693 ps->flags &= ~PEER_F_ALIVE;
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002694 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002695 }
2696 else {
2697 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + random() % 2000));
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002698 peer_session_forceshutdown(ps);
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002699 }
2700 }
2701 else if (tick_is_expired(ps->heartbeat, now_ms)) {
2702 ps->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
2703 ps->flags |= PEER_F_HEARTBEAT;
2704 appctx_wakeup(ps->appctx);
2705 }
Frédéric Lécailleb7405c12019-03-27 14:32:39 +01002706 task->expire = tick_first(ps->reconnect, ps->heartbeat);
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002707 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002708 }
2709 /* else do nothing */
2710 } /* SUCCESSCODE */
2711 } /* !ps->peer->local */
2712 } /* for */
2713
2714 /* Resync from remotes expired: consider resync is finished */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002715 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE) &&
2716 !(peers->flags & PEERS_F_RESYNC_ASSIGN) &&
2717 tick_is_expired(peers->resync_timeout, now_ms)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002718 /* Resync from remote peer needed
2719 * no peer was assigned for the lesson
2720 * and resync timeout expire */
2721
2722 /* flag no more resync from remote, consider resync is finished */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002723 peers->flags |= PEERS_F_RESYNC_REMOTE;
Emeric Brun2b920a12010-09-23 18:30:22 +02002724 }
2725
Emeric Brunb3971ab2015-05-12 18:49:09 +02002726 if ((peers->flags & PEERS_RESYNC_STATEMASK) != PEERS_RESYNC_FINISHED) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002727 /* Resync not finished*/
Frédéric Lécaille5d6e5f82017-05-29 13:47:16 +02002728 /* reschedule task to resync timeout if not expired, to ended resync if needed */
2729 if (!tick_is_expired(peers->resync_timeout, now_ms))
2730 task->expire = tick_first(task->expire, peers->resync_timeout);
Emeric Brun2b920a12010-09-23 18:30:22 +02002731 }
2732 } /* !stopping */
2733 else {
2734 /* soft stop case */
Willy Tarreau086735a2018-11-05 15:09:47 +01002735 if (state & TASK_WOKEN_SIGNAL) {
Joseph Herlant82b2f542018-11-15 12:19:14 -08002736 /* We've just received the signal */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002737 if (!(peers->flags & PEERS_F_DONOTSTOP)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002738 /* add DO NOT STOP flag if not present */
Olivier Houcharded879892019-03-08 18:53:43 +01002739 _HA_ATOMIC_ADD(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002740 peers->flags |= PEERS_F_DONOTSTOP;
2741 ps = peers->local;
2742 for (st = ps->tables; st ; st = st->next)
2743 st->table->syncing++;
Emeric Brun2b920a12010-09-23 18:30:22 +02002744 }
2745
2746 /* disconnect all connected peers */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002747 for (ps = peers->remote; ps; ps = ps->next) {
Emeric Brun80527f52017-06-19 17:46:37 +02002748 /* we're killing a connection, we must apply a random delay before
2749 * retrying otherwise the other end will do the same and we can loop
2750 * for a while.
2751 */
2752 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + random() % 2000));
Willy Tarreau9df94c22016-10-31 18:42:52 +01002753 if (ps->appctx) {
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002754 peer_session_forceshutdown(ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002755 }
2756 }
2757 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002758
Emeric Brunb3971ab2015-05-12 18:49:09 +02002759 ps = peers->local;
Emeric Brun2b920a12010-09-23 18:30:22 +02002760 if (ps->flags & PEER_F_TEACH_COMPLETE) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002761 if (peers->flags & PEERS_F_DONOTSTOP) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002762 /* resync of new process was complete, current process can die now */
Olivier Houcharded879892019-03-08 18:53:43 +01002763 _HA_ATOMIC_SUB(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002764 peers->flags &= ~PEERS_F_DONOTSTOP;
2765 for (st = ps->tables; st ; st = st->next)
2766 st->table->syncing--;
Emeric Brun2b920a12010-09-23 18:30:22 +02002767 }
2768 }
Willy Tarreau9df94c22016-10-31 18:42:52 +01002769 else if (!ps->appctx) {
2770 /* If there's no active peer connection */
Emeric Brun2b920a12010-09-23 18:30:22 +02002771 if (ps->statuscode == 0 ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002772 ps->statuscode == PEER_SESS_SC_SUCCESSCODE ||
2773 ps->statuscode == PEER_SESS_SC_CONNECTEDCODE ||
2774 ps->statuscode == PEER_SESS_SC_TRYAGAIN) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002775 /* connection never tried
Willy Tarreau9df94c22016-10-31 18:42:52 +01002776 * or previous peer connection was successfully established
2777 * or previous tcp connect succeeded but init state incomplete
Emeric Brun2b920a12010-09-23 18:30:22 +02002778 * or during previous connect, peer replies a try again statuscode */
2779
2780 /* connect to the peer */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002781 peer_session_create(peers, ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002782 }
2783 else {
2784 /* Other error cases */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002785 if (peers->flags & PEERS_F_DONOTSTOP) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002786 /* unable to resync new process, current process can die now */
Olivier Houcharded879892019-03-08 18:53:43 +01002787 _HA_ATOMIC_SUB(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002788 peers->flags &= ~PEERS_F_DONOTSTOP;
2789 for (st = ps->tables; st ; st = st->next)
2790 st->table->syncing--;
Emeric Brun2b920a12010-09-23 18:30:22 +02002791 }
2792 }
2793 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002794 else if (ps->statuscode == PEER_SESS_SC_SUCCESSCODE ) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002795 /* current peer connection is active and established
2796 * wake up all peer handlers to push remaining local updates */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002797 for (st = ps->tables; st ; st = st->next) {
2798 if ((int)(st->last_pushed - st->table->localupdate) < 0) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002799 appctx_wakeup(ps->appctx);
2800 break;
2801 }
2802 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002803 }
2804 } /* stopping */
Emeric Brun80527f52017-06-19 17:46:37 +02002805
2806 /* Release lock for all peers of the section */
2807 for (ps = peers->remote; ps; ps = ps->next)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002808 HA_SPIN_UNLOCK(PEER_LOCK, &ps->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002809
Emeric Brun2b920a12010-09-23 18:30:22 +02002810 /* Wakeup for re-connect */
2811 return task;
2812}
2813
Emeric Brunb3971ab2015-05-12 18:49:09 +02002814
Emeric Brun2b920a12010-09-23 18:30:22 +02002815/*
Willy Tarreaud9443442018-10-15 11:18:03 +02002816 * returns 0 in case of error.
Emeric Brun2b920a12010-09-23 18:30:22 +02002817 */
Willy Tarreaud9443442018-10-15 11:18:03 +02002818int peers_init_sync(struct peers *peers)
Emeric Brun2b920a12010-09-23 18:30:22 +02002819{
Emeric Brun2b920a12010-09-23 18:30:22 +02002820 struct peer * curpeer;
Emeric Brun2b920a12010-09-23 18:30:22 +02002821
Emeric Brun2b920a12010-09-23 18:30:22 +02002822 for (curpeer = peers->remote; curpeer; curpeer = curpeer->next) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002823 peers->peers_fe->maxconn += 3;
2824 }
2825
Emeric Brunc60def82017-09-27 14:59:38 +02002826 peers->sync_task = task_new(MAX_THREADS_MASK);
Willy Tarreaud9443442018-10-15 11:18:03 +02002827 if (!peers->sync_task)
2828 return 0;
2829
Emeric Brunb3971ab2015-05-12 18:49:09 +02002830 peers->sync_task->process = process_peer_sync;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002831 peers->sync_task->context = (void *)peers;
2832 peers->sighandler = signal_register_task(0, peers->sync_task, 0);
2833 task_wakeup(peers->sync_task, TASK_WOKEN_INIT);
Willy Tarreaud9443442018-10-15 11:18:03 +02002834 return 1;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002835}
2836
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002837/*
2838 * Allocate a cache a dictionary entries used upon transmission.
2839 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002840static struct dcache_tx *new_dcache_tx(size_t max_entries)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002841{
2842 struct dcache_tx *d;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002843 struct ebpt_node *entries;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002844
2845 d = malloc(sizeof *d);
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002846 entries = calloc(max_entries, sizeof *entries);
2847 if (!d || !entries)
2848 goto err;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002849
2850 d->lru_key = 0;
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02002851 d->prev_lookup = NULL;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002852 d->cached_entries = EB_ROOT_UNIQUE;
2853 d->entries = entries;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002854
2855 return d;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002856
2857 err:
2858 free(d);
2859 free(entries);
2860 return NULL;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002861}
2862
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002863static void free_dcache_tx(struct dcache_tx *dc)
2864{
2865 free(dc->entries);
2866 dc->entries = NULL;
2867 free(dc);
2868}
2869
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002870/*
2871 * Allocate a cache of dictionary entries with <name> as name and <max_entries>
2872 * as maximum of entries.
2873 * Return the dictionay cache if succeeded, NULL if not.
2874 * Must be deallocated calling free_dcache().
2875 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002876static struct dcache *new_dcache(size_t max_entries)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002877{
2878 struct dcache_tx *dc_tx;
2879 struct dcache *dc;
2880 struct dcache_rx *dc_rx;
2881
2882 dc = calloc(1, sizeof *dc);
2883 dc_tx = new_dcache_tx(max_entries);
2884 dc_rx = calloc(max_entries, sizeof *dc_rx);
2885 if (!dc || !dc_tx || !dc_rx)
2886 goto err;
2887
2888 dc->tx = dc_tx;
2889 dc->rx = dc_rx;
2890 dc->max_entries = max_entries;
2891
2892 return dc;
2893
2894 err:
2895 free(dc);
2896 free(dc_tx);
2897 free(dc_rx);
2898 return NULL;
2899}
2900
2901/*
2902 * Deallocate a cache of dictionary entries.
2903 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002904static inline void free_dcache(struct dcache *dc)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002905{
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002906 free_dcache_tx(dc->tx);
2907 dc->tx = NULL;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002908 free(dc->rx); dc->rx = NULL;
2909 free(dc);
2910}
2911
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002912
2913/*
2914 * Look for the dictionary entry with the value of <i> in <d> cache of dictionary
2915 * entries used upon transmission.
2916 * Return the entry if found, NULL if not.
2917 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002918static struct ebpt_node *dcache_tx_lookup_value(struct dcache_tx *d,
2919 struct dcache_tx_entry *i)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002920{
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002921 return ebpt_lookup(&d->cached_entries, i->entry.key);
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002922}
2923
2924/*
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002925 * Flush <dc> cache.
2926 * Always succeeds.
2927 */
2928static inline void flush_dcache(struct peer *peer)
2929{
2930 int i;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02002931 struct dcache *dc = peer->dcache;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002932
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002933 for (i = 0; i < dc->max_entries; i++)
2934 ebpt_delete(&dc->tx->entries[i]);
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002935
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002936 memset(dc->rx, 0, dc->max_entries * sizeof *dc->rx);
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002937}
2938
2939/*
2940 * Insert a dictionary entry in <dc> cache part used upon transmission (->tx)
2941 * with information provided by <i> dictionary cache entry (especially the value
2942 * to be inserted if not already). Return <i> if already present in the cache
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002943 * or something different of <i> if not.
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002944 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002945static struct ebpt_node *dcache_tx_insert(struct dcache *dc, struct dcache_tx_entry *i)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002946{
2947 struct dcache_tx *dc_tx;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002948 struct ebpt_node *o;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002949
2950 dc_tx = dc->tx;
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02002951
2952 if (dc_tx->prev_lookup && dc_tx->prev_lookup->key == i->entry.key) {
2953 o = dc_tx->prev_lookup;
2954 } else {
2955 o = dcache_tx_lookup_value(dc_tx, i);
2956 if (o) {
2957 /* Save it */
2958 dc_tx->prev_lookup = o;
2959 }
2960 }
2961
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002962 if (o) {
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002963 /* Copy the ID. */
2964 i->id = o - dc->tx->entries;
2965 return &i->entry;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002966 }
2967
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002968 /* The new entry to put in cache */
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02002969 dc_tx->prev_lookup = o = &dc_tx->entries[dc_tx->lru_key];
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002970
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002971 ebpt_delete(o);
2972 o->key = i->entry.key;
2973 ebpt_insert(&dc_tx->cached_entries, o);
2974 i->id = dc_tx->lru_key;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002975
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002976 /* Update the index for the next entry to put in cache */
2977 dc_tx->lru_key = (dc_tx->lru_key + 1) & (dc->max_entries - 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002978
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002979 return o;
2980}
Emeric Brunb3971ab2015-05-12 18:49:09 +02002981
2982/*
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02002983 * Allocate a dictionary cache for each peer of <peers> section.
2984 * Return 1 if succeeded, 0 if not.
2985 */
2986int peers_alloc_dcache(struct peers *peers)
2987{
2988 struct peer *p;
2989
2990 for (p = peers->remote; p; p = p->next) {
2991 p->dcache = new_dcache(PEER_STKT_CACHE_MAX_ENTRIES);
2992 if (!p->dcache)
2993 return 0;
2994 }
2995
2996 return 1;
2997}
2998
2999/*
Emeric Brunb3971ab2015-05-12 18:49:09 +02003000 * Function used to register a table for sync on a group of peers
3001 *
3002 */
3003void peers_register_table(struct peers *peers, struct stktable *table)
3004{
3005 struct shared_table *st;
3006 struct peer * curpeer;
3007 int id = 0;
3008
3009 for (curpeer = peers->remote; curpeer; curpeer = curpeer->next) {
Vincent Bernat02779b62016-04-03 13:48:43 +02003010 st = calloc(1,sizeof(*st));
Emeric Brunb3971ab2015-05-12 18:49:09 +02003011 st->table = table;
3012 st->next = curpeer->tables;
3013 if (curpeer->tables)
3014 id = curpeer->tables->local_id;
3015 st->local_id = id + 1;
3016
3017 curpeer->tables = st;
3018 }
3019
3020 table->sync_task = peers->sync_task;
Emeric Brun2b920a12010-09-23 18:30:22 +02003021}
3022
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003023/*
3024 * Parse the "show peers" command arguments.
3025 * Returns 0 if succeeded, 1 if not with the ->msg of the appctx set as
3026 * error message.
3027 */
3028static int cli_parse_show_peers(char **args, char *payload, struct appctx *appctx, void *private)
3029{
3030 appctx->ctx.cfgpeers.target = NULL;
3031
3032 if (*args[2]) {
3033 struct peers *p;
3034
3035 for (p = cfg_peers; p; p = p->next) {
3036 if (!strcmp(p->id, args[2])) {
3037 appctx->ctx.cfgpeers.target = p;
3038 break;
3039 }
3040 }
3041
3042 if (!p) {
3043 appctx->ctx.cli.severity = LOG_ERR;
3044 appctx->ctx.cli.msg = "No such peers\n";
3045 appctx->st0 = CLI_ST_PRINT;
3046 return 1;
3047 }
3048 }
3049
3050 return 0;
3051}
3052
3053/*
3054 * This function dumps the peer state information of <peers> "peers" section.
3055 * Returns 0 if the output buffer is full and needs to be called again, non-zero if not.
3056 * Dedicated to be called by cli_io_handler_show_peers() cli I/O handler.
3057 */
3058static int peers_dump_head(struct buffer *msg, struct stream_interface *si, struct peers *peers)
3059{
3060 struct tm tm;
3061
3062 get_localtime(peers->last_change, &tm);
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003063 chunk_appendf(msg, "%p: [%02d/%s/%04d:%02d:%02d:%02d] id=%s state=%d flags=0x%x resync_timeout=%s task_calls=%u\n",
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003064 peers,
3065 tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
3066 tm.tm_hour, tm.tm_min, tm.tm_sec,
3067 peers->id, peers->state, peers->flags,
3068 peers->resync_timeout ?
3069 tick_is_expired(peers->resync_timeout, now_ms) ? "<PAST>" :
3070 human_time(TICKS_TO_MS(peers->resync_timeout - now_ms),
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003071 TICKS_TO_MS(1000)) : "<NEVER>",
3072 peers->sync_task ? peers->sync_task->calls : 0);
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003073
3074 if (ci_putchk(si_ic(si), msg) == -1) {
3075 si_rx_room_blk(si);
3076 return 0;
3077 }
3078
3079 return 1;
3080}
3081
3082/*
3083 * This function dumps <peer> state information.
3084 * Returns 0 if the output buffer is full and needs to be called again, non-zero
3085 * if not. Dedicated to be called by cli_io_handler_show_peers() cli I/O handler.
3086 */
3087static int peers_dump_peer(struct buffer *msg, struct stream_interface *si, struct peer *peer)
3088{
3089 struct connection *conn;
3090 char pn[INET6_ADDRSTRLEN];
3091 struct stream_interface *peer_si;
3092 struct stream *peer_s;
3093 struct appctx *appctx;
3094 struct shared_table *st;
3095
3096 addr_to_str(&peer->addr, pn, sizeof pn);
3097 chunk_appendf(msg, " %p: id=%s(%s) addr=%s:%d status=%s reconnect=%s confirm=%u\n",
3098 peer, peer->id,
3099 peer->local ? "local" : "remote",
3100 pn, get_host_port(&peer->addr),
3101 statuscode_str(peer->statuscode),
3102 peer->reconnect ?
3103 tick_is_expired(peer->reconnect, now_ms) ? "<PAST>" :
3104 human_time(TICKS_TO_MS(peer->reconnect - now_ms),
3105 TICKS_TO_MS(1000)) : "<NEVER>",
3106 peer->confirm);
3107
3108 chunk_appendf(&trash, " flags=0x%x", peer->flags);
3109
3110 appctx = peer->appctx;
3111 if (!appctx)
3112 goto end;
3113
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003114 chunk_appendf(&trash, " appctx:%p st0=%d st1=%d task_calls=%u", appctx, appctx->st0, appctx->st1,
3115 appctx->t ? appctx->t->calls : 0);
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003116
3117 peer_si = peer->appctx->owner;
3118 if (!peer_si)
3119 goto end;
3120
3121 peer_s = si_strm(peer_si);
3122 if (!peer_s)
3123 goto end;
3124
3125 chunk_appendf(&trash, " state=%s", si_state_str(si_opposite(peer_si)->state));
3126
3127 conn = objt_conn(strm_orig(peer_s));
3128 if (conn)
3129 chunk_appendf(&trash, "\n xprt=%s", conn_get_xprt_name(conn));
3130
Willy Tarreau8dfffdb2019-07-17 11:44:11 +02003131 switch (conn && conn_get_src(conn) ? addr_to_str(&conn->addr.from, pn, sizeof(pn)) : AF_UNSPEC) {
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003132 case AF_INET:
3133 case AF_INET6:
3134 chunk_appendf(&trash, " src=%s:%d", pn, get_host_port(&conn->addr.from));
3135 break;
3136 case AF_UNIX:
3137 chunk_appendf(&trash, " src=unix:%d", strm_li(peer_s)->luid);
3138 break;
3139 }
3140
Willy Tarreau8dfffdb2019-07-17 11:44:11 +02003141 switch (conn && conn_get_dst(conn) ? addr_to_str(&conn->addr.to, pn, sizeof(pn)) : AF_UNSPEC) {
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003142 case AF_INET:
3143 case AF_INET6:
3144 chunk_appendf(&trash, " addr=%s:%d", pn, get_host_port(&conn->addr.to));
3145 break;
3146 case AF_UNIX:
3147 chunk_appendf(&trash, " addr=unix:%d", strm_li(peer_s)->luid);
3148 break;
3149 }
3150
3151 if (peer->remote_table)
3152 chunk_appendf(&trash, "\n remote_table:%p id=%s local_id=%d remote_id=%d",
3153 peer->remote_table,
3154 peer->remote_table->table->id,
3155 peer->remote_table->local_id,
3156 peer->remote_table->remote_id);
3157
3158 if (peer->last_local_table)
3159 chunk_appendf(&trash, "\n last_local_table:%p id=%s local_id=%d remote_id=%d",
3160 peer->last_local_table,
3161 peer->last_local_table->table->id,
3162 peer->last_local_table->local_id,
3163 peer->last_local_table->remote_id);
3164
3165 if (peer->tables) {
3166 chunk_appendf(&trash, "\n shared tables:");
3167 for (st = peer->tables; st; st = st->next) {
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003168 int i, count;
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003169 struct stktable *t;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003170 struct dcache *dcache;
3171
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003172 t = st->table;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003173 dcache = peer->dcache;
3174
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003175 chunk_appendf(&trash, "\n %p local_id=%d remote_id=%d "
3176 "flags=0x%x remote_data=0x%llx",
3177 st, st->local_id, st->remote_id,
3178 st->flags, (unsigned long long)st->remote_data);
3179 chunk_appendf(&trash, "\n last_acked=%u last_pushed=%u last_get=%u"
3180 " teaching_origin=%u update=%u",
3181 st->last_acked, st->last_pushed, st->last_get,
3182 st->teaching_origin, st->update);
3183 chunk_appendf(&trash, "\n table:%p id=%s update=%u localupdate=%u"
3184 " commitupdate=%u syncing=%u",
3185 t, t->id, t->update, t->localupdate, t->commitupdate, t->syncing);
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003186 chunk_appendf(&trash, "\n TX dictionary cache:");
3187 count = 0;
3188 for (i = 0; i < dcache->max_entries; i++) {
3189 struct ebpt_node *node;
3190 struct dict_entry *de;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003191
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003192 node = &dcache->tx->entries[i];
3193 if (!node->key)
3194 break;
3195
3196 if (!count++)
3197 chunk_appendf(&trash, "\n ");
3198 de = node->key;
3199 chunk_appendf(&trash, " %3u -> %s", i, (char *)de->value.key);
3200 count &= 0x3;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003201 }
3202 chunk_appendf(&trash, "\n RX dictionary cache:");
3203 count = 0;
3204 for (i = 0; i < dcache->max_entries; i++) {
3205 if (!count++)
3206 chunk_appendf(&trash, "\n ");
3207 chunk_appendf(&trash, " %3u -> %s", i,
3208 dcache->rx[i].de ?
3209 (char *)dcache->rx[i].de->value.key : "-");
3210 count &= 0x3;
3211 }
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003212 }
3213 }
3214
3215 end:
3216 chunk_appendf(&trash, "\n");
3217 if (ci_putchk(si_ic(si), msg) == -1) {
3218 si_rx_room_blk(si);
3219 return 0;
3220 }
3221
3222 return 1;
3223}
3224
3225/*
3226 * This function dumps all the peers of "peers" section.
3227 * Returns 0 if the output buffer is full and needs to be called
3228 * again, non-zero if not. It proceeds in an isolated thread, so
3229 * there is no thread safety issue here.
3230 */
3231static int cli_io_handler_show_peers(struct appctx *appctx)
3232{
3233 int show_all;
3234 int ret = 0, first_peers = 1;
3235 struct stream_interface *si = appctx->owner;
3236
3237 thread_isolate();
3238
3239 show_all = !appctx->ctx.cfgpeers.target;
3240
3241 chunk_reset(&trash);
3242
3243 while (appctx->st2 != STAT_ST_FIN) {
3244 switch (appctx->st2) {
3245 case STAT_ST_INIT:
3246 if (show_all)
3247 appctx->ctx.cfgpeers.peers = cfg_peers;
3248 else
3249 appctx->ctx.cfgpeers.peers = appctx->ctx.cfgpeers.target;
3250
3251 appctx->st2 = STAT_ST_LIST;
3252 /* fall through */
3253
3254 case STAT_ST_LIST:
3255 if (!appctx->ctx.cfgpeers.peers) {
3256 /* No more peers list. */
3257 appctx->st2 = STAT_ST_END;
3258 }
3259 else {
3260 if (!first_peers)
3261 chunk_appendf(&trash, "\n");
3262 else
3263 first_peers = 0;
3264 if (!peers_dump_head(&trash, si, appctx->ctx.cfgpeers.peers))
3265 goto out;
3266
3267 appctx->ctx.cfgpeers.peer = appctx->ctx.cfgpeers.peers->remote;
3268 appctx->ctx.cfgpeers.peers = appctx->ctx.cfgpeers.peers->next;
3269 appctx->st2 = STAT_ST_INFO;
3270 }
3271 break;
3272
3273 case STAT_ST_INFO:
3274 if (!appctx->ctx.cfgpeers.peer) {
3275 /* End of peer list */
3276 if (show_all)
3277 appctx->st2 = STAT_ST_LIST;
3278 else
3279 appctx->st2 = STAT_ST_END;
3280 }
3281 else {
3282 if (!peers_dump_peer(&trash, si, appctx->ctx.cfgpeers.peer))
3283 goto out;
3284
3285 appctx->ctx.cfgpeers.peer = appctx->ctx.cfgpeers.peer->next;
3286 }
3287 break;
3288
3289 case STAT_ST_END:
3290 appctx->st2 = STAT_ST_FIN;
3291 break;
3292 }
3293 }
3294 ret = 1;
3295 out:
3296 thread_release();
3297 return ret;
3298}
3299
3300/*
3301 * CLI keywords.
3302 */
3303static struct cli_kw_list cli_kws = {{ }, {
3304 { { "show", "peers", NULL }, "show peers [peers section]: dump some information about all the peers or this peers section", cli_parse_show_peers, cli_io_handler_show_peers, },
3305 {},
3306}};
3307
3308/* Register cli keywords */
3309INITCALL1(STG_REGISTER, cli_register_kw, &cli_kws);
3310