blob: a2a86885c8dd6ff2c3c3f9a46a3faef03ba4cd72 [file] [log] [blame]
Emeric Brun3bd697e2010-01-04 15:23:48 +01001/*
2 * Stick tables management functions.
3 *
4 * Copyright 2009-2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
Willy Tarreau08d5f982010-06-06 13:34:54 +02005 * Copyright (C) 2010 Willy Tarreau <w@1wt.eu>
Emeric Brun3bd697e2010-01-04 15:23:48 +01006 *
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
11 *
12 */
13
14#include <string.h>
15
16#include <common/config.h>
17#include <common/memory.h>
18#include <common/mini-clist.h>
19#include <common/standard.h>
20#include <common/time.h>
21
22#include <ebmbtree.h>
23#include <ebsttree.h>
24
Willy Tarreaud9f316a2014-07-10 14:03:38 +020025#include <proto/arg.h>
Emeric Brun3bd697e2010-01-04 15:23:48 +010026#include <proto/proxy.h>
Willy Tarreaucd3b0942012-04-27 21:52:18 +020027#include <proto/sample.h>
Emeric Brun3bd697e2010-01-04 15:23:48 +010028#include <proto/session.h>
Willy Tarreau68129b92010-06-06 16:06:52 +020029#include <proto/stick_table.h>
Emeric Brun3bd697e2010-01-04 15:23:48 +010030#include <proto/task.h>
Emeric Brun32da3c42010-09-23 18:39:19 +020031#include <proto/peers.h>
32#include <types/global.h>
Emeric Brun3bd697e2010-01-04 15:23:48 +010033
Willy Tarreau12785782012-04-27 21:37:17 +020034/* structure used to return a table key built from a sample */
Willy Tarreau07115412012-10-29 21:56:59 +010035struct stktable_key *static_table_key;
Willy Tarreauf0b38bf2010-06-06 13:22:23 +020036
Emeric Brun3bd697e2010-01-04 15:23:48 +010037/*
Willy Tarreauaea940e2010-06-06 11:56:36 +020038 * Free an allocated sticky session <ts>, and decrease sticky sessions counter
39 * in table <t>.
Emeric Brun3bd697e2010-01-04 15:23:48 +010040 */
41void stksess_free(struct stktable *t, struct stksess *ts)
42{
43 t->current--;
Willy Tarreau393379c2010-06-06 12:11:37 +020044 pool_free2(t->pool, (void *)ts - t->data_size);
Emeric Brun3bd697e2010-01-04 15:23:48 +010045}
46
47/*
Willy Tarreauf6efda12010-08-03 20:34:06 +020048 * Kill an stksess (only if its ref_cnt is zero).
49 */
50void stksess_kill(struct stktable *t, struct stksess *ts)
51{
52 if (ts->ref_cnt)
53 return;
54
55 eb32_delete(&ts->exp);
Emeric Brun85e77c72010-09-23 18:16:52 +020056 eb32_delete(&ts->upd);
Willy Tarreauf6efda12010-08-03 20:34:06 +020057 ebmb_delete(&ts->key);
58 stksess_free(t, ts);
59}
60
61/*
Willy Tarreauaea940e2010-06-06 11:56:36 +020062 * Initialize or update the key in the sticky session <ts> present in table <t>
63 * from the value present in <key>.
Emeric Brun3bd697e2010-01-04 15:23:48 +010064 */
Willy Tarreau393379c2010-06-06 12:11:37 +020065void stksess_setkey(struct stktable *t, struct stksess *ts, struct stktable_key *key)
Emeric Brun3bd697e2010-01-04 15:23:48 +010066{
67 if (t->type != STKTABLE_TYPE_STRING)
Willy Tarreau86257dc2010-06-06 12:57:10 +020068 memcpy(ts->key.key, key->key, t->key_size);
Emeric Brun3bd697e2010-01-04 15:23:48 +010069 else {
Willy Tarreau86257dc2010-06-06 12:57:10 +020070 memcpy(ts->key.key, key->key, MIN(t->key_size - 1, key->key_len));
71 ts->key.key[MIN(t->key_size - 1, key->key_len)] = 0;
Emeric Brun3bd697e2010-01-04 15:23:48 +010072 }
73}
74
75
76/*
Willy Tarreau393379c2010-06-06 12:11:37 +020077 * Init sticky session <ts> of table <t>. The data parts are cleared and <ts>
78 * is returned.
Emeric Brun3bd697e2010-01-04 15:23:48 +010079 */
Willy Tarreau393379c2010-06-06 12:11:37 +020080static struct stksess *stksess_init(struct stktable *t, struct stksess * ts)
Emeric Brun3bd697e2010-01-04 15:23:48 +010081{
Willy Tarreau393379c2010-06-06 12:11:37 +020082 memset((void *)ts - t->data_size, 0, t->data_size);
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +020083 ts->ref_cnt = 0;
Willy Tarreau86257dc2010-06-06 12:57:10 +020084 ts->key.node.leaf_p = NULL;
85 ts->exp.node.leaf_p = NULL;
Emeric Brun85e77c72010-09-23 18:16:52 +020086 ts->upd.node.leaf_p = NULL;
Emeric Brun3bd697e2010-01-04 15:23:48 +010087 return ts;
88}
89
90/*
Willy Tarreauaea940e2010-06-06 11:56:36 +020091 * Trash oldest <to_batch> sticky sessions from table <t>
92 * Returns number of trashed sticky sessions.
Emeric Brun3bd697e2010-01-04 15:23:48 +010093 */
Willy Tarreau3a925c12013-09-04 17:54:01 +020094int stktable_trash_oldest(struct stktable *t, int to_batch)
Emeric Brun3bd697e2010-01-04 15:23:48 +010095{
96 struct stksess *ts;
97 struct eb32_node *eb;
98 int batched = 0;
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +020099 int looped = 0;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100100
101 eb = eb32_lookup_ge(&t->exps, now_ms - TIMER_LOOK_BACK);
102
103 while (batched < to_batch) {
104
105 if (unlikely(!eb)) {
106 /* we might have reached the end of the tree, typically because
107 * <now_ms> is in the first half and we're first scanning the last
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200108 * half. Let's loop back to the beginning of the tree now if we
109 * have not yet visited it.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100110 */
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200111 if (looped)
112 break;
113 looped = 1;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100114 eb = eb32_first(&t->exps);
115 if (likely(!eb))
116 break;
117 }
118
119 /* timer looks expired, detach it from the queue */
Willy Tarreau86257dc2010-06-06 12:57:10 +0200120 ts = eb32_entry(eb, struct stksess, exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100121 eb = eb32_next(eb);
122
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200123 /* don't delete an entry which is currently referenced */
124 if (ts->ref_cnt)
125 continue;
126
Willy Tarreau86257dc2010-06-06 12:57:10 +0200127 eb32_delete(&ts->exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100128
Willy Tarreau86257dc2010-06-06 12:57:10 +0200129 if (ts->expire != ts->exp.key) {
Emeric Brun3bd697e2010-01-04 15:23:48 +0100130 if (!tick_isset(ts->expire))
131 continue;
132
Willy Tarreau86257dc2010-06-06 12:57:10 +0200133 ts->exp.key = ts->expire;
134 eb32_insert(&t->exps, &ts->exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100135
Willy Tarreau86257dc2010-06-06 12:57:10 +0200136 if (!eb || eb->key > ts->exp.key)
137 eb = &ts->exp;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100138
139 continue;
140 }
Emeric Brun3bd697e2010-01-04 15:23:48 +0100141
Willy Tarreauaea940e2010-06-06 11:56:36 +0200142 /* session expired, trash it */
Willy Tarreau86257dc2010-06-06 12:57:10 +0200143 ebmb_delete(&ts->key);
Emeric Brun85e77c72010-09-23 18:16:52 +0200144 eb32_delete(&ts->upd);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100145 stksess_free(t, ts);
146 batched++;
147 }
148
149 return batched;
150}
151
152/*
Willy Tarreauaea940e2010-06-06 11:56:36 +0200153 * Allocate and initialise a new sticky session.
154 * The new sticky session is returned or NULL in case of lack of memory.
155 * Sticky sessions should only be allocated this way, and must be freed using
Willy Tarreaua7b46b52013-04-11 16:55:37 +0200156 * stksess_free(). Table <t>'s sticky session counter is increased. If <key>
157 * is not NULL, it is assigned to the new session.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100158 */
159struct stksess *stksess_new(struct stktable *t, struct stktable_key *key)
160{
161 struct stksess *ts;
162
163 if (unlikely(t->current == t->size)) {
164 if ( t->nopurge )
165 return NULL;
166
Emeric Brunfbce6d02010-09-23 18:10:00 +0200167 if (!stktable_trash_oldest(t, (t->size >> 8) + 1))
Emeric Brun3bd697e2010-01-04 15:23:48 +0100168 return NULL;
169 }
170
Willy Tarreau393379c2010-06-06 12:11:37 +0200171 ts = pool_alloc2(t->pool) + t->data_size;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100172 if (ts) {
173 t->current++;
Willy Tarreau393379c2010-06-06 12:11:37 +0200174 stksess_init(t, ts);
Willy Tarreaua7b46b52013-04-11 16:55:37 +0200175 if (key)
176 stksess_setkey(t, ts, key);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100177 }
178
179 return ts;
180}
181
182/*
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200183 * Looks in table <t> for a sticky session matching key <key>.
Willy Tarreauaea940e2010-06-06 11:56:36 +0200184 * Returns pointer on requested sticky session or NULL if none was found.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100185 */
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200186struct stksess *stktable_lookup_key(struct stktable *t, struct stktable_key *key)
Emeric Brun3bd697e2010-01-04 15:23:48 +0100187{
188 struct ebmb_node *eb;
189
Emeric Brun3bd697e2010-01-04 15:23:48 +0100190 if (t->type == STKTABLE_TYPE_STRING)
Emeric Brun485479d2010-09-23 18:02:19 +0200191 eb = ebst_lookup_len(&t->keys, key->key, key->key_len+1 < t->key_size ? key->key_len : t->key_size-1);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100192 else
193 eb = ebmb_lookup(&t->keys, key->key, t->key_size);
194
195 if (unlikely(!eb)) {
196 /* no session found */
197 return NULL;
198 }
199
Willy Tarreau86257dc2010-06-06 12:57:10 +0200200 return ebmb_entry(eb, struct stksess, key);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100201}
202
Willy Tarreau1f7e9252010-06-20 12:27:21 +0200203/* Lookup and touch <key> in <table>, or create the entry if it does not exist.
204 * This is mainly used for situations where we want to refresh a key's usage so
205 * that it does not expire, and we want to have it created if it was not there.
206 * The stksess is returned, or NULL if it could not be created.
207 */
208struct stksess *stktable_update_key(struct stktable *table, struct stktable_key *key)
209{
210 struct stksess *ts;
211
212 ts = stktable_lookup_key(table, key);
213 if (likely(ts))
Emeric Brun85e77c72010-09-23 18:16:52 +0200214 return stktable_touch(table, ts, 1);
Willy Tarreau1f7e9252010-06-20 12:27:21 +0200215
216 /* entry does not exist, initialize a new one */
217 ts = stksess_new(table, key);
218 if (likely(ts))
Emeric Brun85e77c72010-09-23 18:16:52 +0200219 stktable_store(table, ts, 1);
Willy Tarreau1f7e9252010-06-20 12:27:21 +0200220 return ts;
221}
222
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200223/*
224 * Looks in table <t> for a sticky session with same key as <ts>.
225 * Returns pointer on requested sticky session or NULL if none was found.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100226 */
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200227struct stksess *stktable_lookup(struct stktable *t, struct stksess *ts)
Emeric Brun3bd697e2010-01-04 15:23:48 +0100228{
Emeric Brun3bd697e2010-01-04 15:23:48 +0100229 struct ebmb_node *eb;
230
231 if (t->type == STKTABLE_TYPE_STRING)
Willy Tarreau86257dc2010-06-06 12:57:10 +0200232 eb = ebst_lookup(&(t->keys), (char *)ts->key.key);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100233 else
Willy Tarreau86257dc2010-06-06 12:57:10 +0200234 eb = ebmb_lookup(&(t->keys), ts->key.key, t->key_size);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100235
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200236 if (unlikely(!eb))
237 return NULL;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100238
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200239 return ebmb_entry(eb, struct stksess, key);
240}
Emeric Brun3bd697e2010-01-04 15:23:48 +0100241
Willy Tarreaucb183642010-06-06 17:58:34 +0200242/* Update the expiration timer for <ts> but do not touch its expiration node.
243 * The table's expiration timer is updated if set.
244 */
Emeric Brun85e77c72010-09-23 18:16:52 +0200245struct stksess *stktable_touch(struct stktable *t, struct stksess *ts, int local)
Willy Tarreaucb183642010-06-06 17:58:34 +0200246{
Emeric Brun85e77c72010-09-23 18:16:52 +0200247 struct eb32_node * eb;
Willy Tarreaucb183642010-06-06 17:58:34 +0200248 ts->expire = tick_add(now_ms, MS_TO_TICKS(t->expire));
249 if (t->expire) {
250 t->exp_task->expire = t->exp_next = tick_first(ts->expire, t->exp_next);
251 task_queue(t->exp_task);
252 }
Emeric Brun85e77c72010-09-23 18:16:52 +0200253
254 if (t->sync_task && local) {
255 ts->upd.key = ++t->update;
256 t->localupdate = t->update;
257 eb32_delete(&ts->upd);
258 eb = eb32_insert(&t->updates, &ts->upd);
259 if (eb != &ts->upd) {
260 eb32_delete(eb);
261 eb32_insert(&t->updates, &ts->upd);
262 }
263 task_wakeup(t->sync_task, TASK_WOKEN_MSG);
264 }
Willy Tarreaucb183642010-06-06 17:58:34 +0200265 return ts;
266}
267
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200268/* Insert new sticky session <ts> in the table. It is assumed that it does not
269 * yet exist (the caller must check this). The table's timeout is updated if it
270 * is set. <ts> is returned.
271 */
Emeric Brun85e77c72010-09-23 18:16:52 +0200272struct stksess *stktable_store(struct stktable *t, struct stksess *ts, int local)
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200273{
274 ebmb_insert(&t->keys, &ts->key, t->key_size);
Emeric Brun85e77c72010-09-23 18:16:52 +0200275 stktable_touch(t, ts, local);
Willy Tarreaucb183642010-06-06 17:58:34 +0200276 ts->exp.key = ts->expire;
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200277 eb32_insert(&t->exps, &ts->exp);
Willy Tarreauf16d2b82010-06-06 15:38:59 +0200278 return ts;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100279}
280
Willy Tarreau9ba2dcc2010-06-14 21:04:55 +0200281/* Returns a valid or initialized stksess for the specified stktable_key in the
282 * specified table, or NULL if the key was NULL, or if no entry was found nor
283 * could be created. The entry's expiration is updated.
284 */
285struct stksess *stktable_get_entry(struct stktable *table, struct stktable_key *key)
286{
287 struct stksess *ts;
288
289 if (!key)
290 return NULL;
291
292 ts = stktable_lookup_key(table, key);
293 if (ts == NULL) {
294 /* entry does not exist, initialize a new one */
295 ts = stksess_new(table, key);
296 if (!ts)
297 return NULL;
Emeric Brun85e77c72010-09-23 18:16:52 +0200298 stktable_store(table, ts, 1);
Willy Tarreau9ba2dcc2010-06-14 21:04:55 +0200299 }
300 else
Emeric Brun85e77c72010-09-23 18:16:52 +0200301 stktable_touch(table, ts, 1);
Willy Tarreau9ba2dcc2010-06-14 21:04:55 +0200302 return ts;
303}
304
Emeric Brun3bd697e2010-01-04 15:23:48 +0100305/*
Willy Tarreauaea940e2010-06-06 11:56:36 +0200306 * Trash expired sticky sessions from table <t>. The next expiration date is
307 * returned.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100308 */
309static int stktable_trash_expired(struct stktable *t)
310{
311 struct stksess *ts;
312 struct eb32_node *eb;
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200313 int looped = 0;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100314
315 eb = eb32_lookup_ge(&t->exps, now_ms - TIMER_LOOK_BACK);
316
317 while (1) {
318 if (unlikely(!eb)) {
319 /* we might have reached the end of the tree, typically because
320 * <now_ms> is in the first half and we're first scanning the last
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200321 * half. Let's loop back to the beginning of the tree now if we
322 * have not yet visited it.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100323 */
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200324 if (looped)
325 break;
326 looped = 1;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100327 eb = eb32_first(&t->exps);
328 if (likely(!eb))
329 break;
330 }
331
332 if (likely(tick_is_lt(now_ms, eb->key))) {
333 /* timer not expired yet, revisit it later */
334 t->exp_next = eb->key;
335 return t->exp_next;
336 }
337
338 /* timer looks expired, detach it from the queue */
Willy Tarreau86257dc2010-06-06 12:57:10 +0200339 ts = eb32_entry(eb, struct stksess, exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100340 eb = eb32_next(eb);
341
Willy Tarreaue7f3d7a2010-06-14 14:53:07 +0200342 /* don't delete an entry which is currently referenced */
343 if (ts->ref_cnt)
344 continue;
345
Willy Tarreau86257dc2010-06-06 12:57:10 +0200346 eb32_delete(&ts->exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100347
348 if (!tick_is_expired(ts->expire, now_ms)) {
349 if (!tick_isset(ts->expire))
350 continue;
351
Willy Tarreau86257dc2010-06-06 12:57:10 +0200352 ts->exp.key = ts->expire;
353 eb32_insert(&t->exps, &ts->exp);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100354
Willy Tarreau86257dc2010-06-06 12:57:10 +0200355 if (!eb || eb->key > ts->exp.key)
356 eb = &ts->exp;
Emeric Brun3bd697e2010-01-04 15:23:48 +0100357 continue;
358 }
359
360 /* session expired, trash it */
Willy Tarreau86257dc2010-06-06 12:57:10 +0200361 ebmb_delete(&ts->key);
Emeric Brun85e77c72010-09-23 18:16:52 +0200362 eb32_delete(&ts->upd);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100363 stksess_free(t, ts);
364 }
365
366 /* We have found no task to expire in any tree */
367 t->exp_next = TICK_ETERNITY;
368 return t->exp_next;
369}
370
371/*
Willy Tarreauaea940e2010-06-06 11:56:36 +0200372 * Task processing function to trash expired sticky sessions. A pointer to the
373 * task itself is returned since it never dies.
Emeric Brun3bd697e2010-01-04 15:23:48 +0100374 */
Willy Tarreauaea940e2010-06-06 11:56:36 +0200375static struct task *process_table_expire(struct task *task)
Emeric Brun3bd697e2010-01-04 15:23:48 +0100376{
377 struct stktable *t = (struct stktable *)task->context;
378
379 task->expire = stktable_trash_expired(t);
380 return task;
381}
382
Willy Tarreauaea940e2010-06-06 11:56:36 +0200383/* Perform minimal stick table intializations, report 0 in case of error, 1 if OK. */
Emeric Brun3bd697e2010-01-04 15:23:48 +0100384int stktable_init(struct stktable *t)
385{
386 if (t->size) {
387 memset(&t->keys, 0, sizeof(t->keys));
388 memset(&t->exps, 0, sizeof(t->exps));
389
Willy Tarreau393379c2010-06-06 12:11:37 +0200390 t->pool = create_pool("sticktables", sizeof(struct stksess) + t->data_size + t->key_size, MEM_F_SHARED);
Emeric Brun3bd697e2010-01-04 15:23:48 +0100391
392 t->exp_next = TICK_ETERNITY;
393 if ( t->expire ) {
394 t->exp_task = task_new();
395 t->exp_task->process = process_table_expire;
396 t->exp_task->expire = TICK_ETERNITY;
397 t->exp_task->context = (void *)t;
398 }
Emeric Brun32da3c42010-09-23 18:39:19 +0200399 if (t->peers.p && t->peers.p->peers_fe) {
400 peers_register_table(t->peers.p, t);
401 }
402
Emeric Brun3bd697e2010-01-04 15:23:48 +0100403 return t->pool != NULL;
404 }
405 return 1;
406}
407
408/*
409 * Configuration keywords of known table types
410 */
Emeric Brun485479d2010-09-23 18:02:19 +0200411struct stktable_type stktable_types[STKTABLE_TYPES] = {{ "ip", 0, 4 },
David du Colombier4f92d322011-03-24 11:09:31 +0100412 { "ipv6", 0, 16 },
Emeric Brun3bd697e2010-01-04 15:23:48 +0100413 { "integer", 0, 4 },
Emeric Brun485479d2010-09-23 18:02:19 +0200414 { "string", STK_F_CUSTOM_KEYSIZE, 32 },
David du Colombier4f92d322011-03-24 11:09:31 +0100415 { "binary", STK_F_CUSTOM_KEYSIZE, 32 } };
Emeric Brun3bd697e2010-01-04 15:23:48 +0100416
417
418/*
419 * Parse table type configuration.
420 * Returns 0 on successful parsing, else 1.
421 * <myidx> is set at next configuration <args> index.
422 */
423int stktable_parse_type(char **args, int *myidx, unsigned long *type, size_t *key_size)
424{
425 for (*type = 0; *type < STKTABLE_TYPES; (*type)++) {
426 if (strcmp(args[*myidx], stktable_types[*type].kw) != 0)
427 continue;
428
429 *key_size = stktable_types[*type].default_size;
430 (*myidx)++;
431
Willy Tarreauaea940e2010-06-06 11:56:36 +0200432 if (stktable_types[*type].flags & STK_F_CUSTOM_KEYSIZE) {
Emeric Brun3bd697e2010-01-04 15:23:48 +0100433 if (strcmp("len", args[*myidx]) == 0) {
434 (*myidx)++;
435 *key_size = atol(args[*myidx]);
Emeric Brun485479d2010-09-23 18:02:19 +0200436 if (!*key_size)
Emeric Brun3bd697e2010-01-04 15:23:48 +0100437 break;
Emeric Brun485479d2010-09-23 18:02:19 +0200438 if (*type == STKTABLE_TYPE_STRING) {
439 /* null terminated string needs +1 for '\0'. */
440 (*key_size)++;
441 }
Emeric Brun3bd697e2010-01-04 15:23:48 +0100442 (*myidx)++;
443 }
444 }
445 return 0;
446 }
447 return 1;
448}
449
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200450/*****************************************************************/
Willy Tarreau12785782012-04-27 21:37:17 +0200451/* typed sample to typed table key functions */
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200452/*****************************************************************/
453
Willy Tarreau342acb42012-04-23 22:03:39 +0200454static void *k_int2int(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200455{
Willy Tarreau342acb42012-04-23 22:03:39 +0200456 return (void *)&smp->data.uint;
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200457}
458
Willy Tarreau342acb42012-04-23 22:03:39 +0200459static void *k_ip2ip(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200460{
Willy Tarreau803685f2013-12-02 23:17:27 +0100461 if (smp->type == SMP_T_IPV6) {
462 v6tov4(&kdata->ip, &smp->data.ipv6);
463 return (void *)&kdata->ip.s_addr;
464 }
465 else {
466 return (void *)&smp->data.ipv4.s_addr;
467 }
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200468}
469
Willy Tarreau342acb42012-04-23 22:03:39 +0200470static void *k_ip2ipv6(struct sample *smp, union stktable_key_data *kdata, size_t *len)
David du Colombier4f92d322011-03-24 11:09:31 +0100471{
Willy Tarreau803685f2013-12-02 23:17:27 +0100472 if (smp->type == SMP_T_IPV6) {
473 return (void *)&smp->data.ipv6.s6_addr;
474 }
475 else {
476 v4tov6(&kdata->ipv6, &smp->data.ipv4);
477 return (void *)&kdata->ipv6.s6_addr;
478 }
David du Colombier4f92d322011-03-24 11:09:31 +0100479}
David du Colombier4f92d322011-03-24 11:09:31 +0100480
Willy Tarreau342acb42012-04-23 22:03:39 +0200481static void *k_ip2int(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200482{
Willy Tarreau803685f2013-12-02 23:17:27 +0100483 if (smp->type == SMP_T_IPV6) {
484 if (!v6tov4(&kdata->ip, &smp->data.ipv6))
485 return NULL;
486 kdata->integer = ntohl(kdata->ip.s_addr);
487 }
488 else {
489 kdata->integer = ntohl(smp->data.ipv4.s_addr);
490 }
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200491 return (void *)&kdata->integer;
492}
493
Willy Tarreau342acb42012-04-23 22:03:39 +0200494static void *k_int2ip(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200495{
Willy Tarreau342acb42012-04-23 22:03:39 +0200496 kdata->ip.s_addr = htonl(smp->data.uint);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200497 return (void *)&kdata->ip.s_addr;
498}
499
Willy Tarreau342acb42012-04-23 22:03:39 +0200500static void *k_str2str(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200501{
Willy Tarreau342acb42012-04-23 22:03:39 +0200502 *len = smp->data.str.len;
503 return (void *)smp->data.str.str;
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200504}
505
Willy Tarreau342acb42012-04-23 22:03:39 +0200506static void *k_ip2str(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200507{
Willy Tarreau803685f2013-12-02 23:17:27 +0100508 if (smp->type == SMP_T_IPV6) {
509 if (!inet_ntop(AF_INET6, &smp->data.ipv6, kdata->buf, *len))
510 return NULL;
511 }
512 else {
513 if (!inet_ntop(AF_INET, &smp->data.ipv4, kdata->buf, *len))
514 return NULL;
515 }
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200516
517 *len = strlen((const char *)kdata->buf);
518 return (void *)kdata->buf;
519}
520
Emeric Brun8ac33d92012-10-17 13:36:06 +0200521static void *k_bin2str(struct sample *smp, union stktable_key_data *kdata, size_t *len)
522{
523 unsigned char c;
524 int ptr = 0;
Willy Tarreauf22180f2012-12-09 11:08:14 +0100525 int max = *len;
526 int size = 0;
Emeric Brun8ac33d92012-10-17 13:36:06 +0200527
Willy Tarreauf22180f2012-12-09 11:08:14 +0100528 while (ptr < smp->data.str.len && size <= max - 2) {
Emeric Brun8ac33d92012-10-17 13:36:06 +0200529 c = smp->data.str.str[ptr++];
Willy Tarreauf22180f2012-12-09 11:08:14 +0100530 kdata->buf[size++] = hextab[(c >> 4) & 0xF];
531 kdata->buf[size++] = hextab[c & 0xF];
Emeric Brun8ac33d92012-10-17 13:36:06 +0200532 }
Willy Tarreauf22180f2012-12-09 11:08:14 +0100533 *len = size;
Emeric Brun8ac33d92012-10-17 13:36:06 +0200534 return (void *)kdata->buf;
535}
536
Willy Tarreau342acb42012-04-23 22:03:39 +0200537static void *k_int2str(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200538{
539 void *key;
540
Willy Tarreauf22180f2012-12-09 11:08:14 +0100541 key = (void *)ultoa_r(smp->data.uint, kdata->buf, *len);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200542 if (!key)
543 return NULL;
544
545 *len = strlen((const char *)key);
546 return key;
547}
548
Willy Tarreau342acb42012-04-23 22:03:39 +0200549static void *k_str2ip(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200550{
Willy Tarreau342acb42012-04-23 22:03:39 +0200551 if (!buf2ip(smp->data.str.str, smp->data.str.len, &kdata->ip))
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200552 return NULL;
553
554 return (void *)&kdata->ip.s_addr;
555}
556
Willy Tarreau342acb42012-04-23 22:03:39 +0200557static void *k_str2ipv6(struct sample *smp, union stktable_key_data *kdata, size_t *len)
David du Colombier4f92d322011-03-24 11:09:31 +0100558{
Willy Tarreau342acb42012-04-23 22:03:39 +0200559 if (!inet_pton(AF_INET6, smp->data.str.str, &kdata->ipv6))
David du Colombier4f92d322011-03-24 11:09:31 +0100560 return NULL;
561
562 return (void *)&kdata->ipv6.s6_addr;
563}
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200564
Willy Tarreau342acb42012-04-23 22:03:39 +0200565static void *k_str2int(struct sample *smp, union stktable_key_data *kdata, size_t *len)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200566{
567 int i;
568
569 kdata->integer = 0;
Willy Tarreau342acb42012-04-23 22:03:39 +0200570 for (i = 0; i < smp->data.str.len; i++) {
571 uint32_t val = smp->data.str.str[i] - '0';
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200572
573 if (val > 9)
574 break;
575
576 kdata->integer = kdata->integer * 10 + val;
577 }
578 return (void *)&kdata->integer;
579}
580
581/*****************************************************************/
Willy Tarreau12785782012-04-27 21:37:17 +0200582/* typed sample to typed table key matrix: */
583/* sample_to_key[from sample type][to table key type] */
584/* NULL pointer used for impossible sample casts */
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200585/*****************************************************************/
586
Willy Tarreau12785782012-04-27 21:37:17 +0200587typedef void *(*sample_to_key_fct)(struct sample *smp, union stktable_key_data *kdata, size_t *len);
588static sample_to_key_fct sample_to_key[SMP_TYPES][STKTABLE_TYPES] = {
David du Colombier4f92d322011-03-24 11:09:31 +0100589/* table type: IP IPV6 INTEGER STRING BINARY */
Willy Tarreau422aa072012-04-20 20:49:27 +0200590/* patt. type: BOOL */ { NULL, NULL, k_int2int, k_int2str, NULL },
591/* UINT */ { k_int2ip, NULL, k_int2int, k_int2str, NULL },
592/* SINT */ { k_int2ip, NULL, k_int2int, k_int2str, NULL },
Thierry FOURNIERb805f712013-11-26 20:47:54 +0100593/* ADDR */ { k_ip2ip, k_ip2ipv6, k_ip2int, k_ip2str, NULL },
Willy Tarreau422aa072012-04-20 20:49:27 +0200594/* IPV4 */ { k_ip2ip, k_ip2ipv6, k_ip2int, k_ip2str, NULL },
Willy Tarreau803685f2013-12-02 23:17:27 +0100595/* IPV6 */ { k_ip2ip, k_ip2ipv6, k_ip2int, k_ip2str, NULL },
Willy Tarreau422aa072012-04-20 20:49:27 +0200596/* STR */ { k_str2ip, k_str2ipv6, k_str2int, k_str2str, k_str2str },
Emeric Brun8ac33d92012-10-17 13:36:06 +0200597/* BIN */ { NULL, NULL, NULL, k_bin2str, k_str2str },
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200598};
599
600
Willy Tarreau8fed9032014-07-03 17:02:46 +0200601/* Prepares a stktable_key from a sample <smp> to search into table <t>.
602 * Returns NULL if the sample could not be converted (eg: no matching type),
603 * otherwise a pointer to the static stktable_key filled with what is needed
604 * for the lookup.
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200605 */
Willy Tarreau8fed9032014-07-03 17:02:46 +0200606struct stktable_key *smp_to_stkey(struct sample *smp, struct stktable *t)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200607{
Willy Tarreau12785782012-04-27 21:37:17 +0200608 if (!sample_to_key[smp->type][t->type])
Willy Tarreau12e50112012-04-25 17:21:49 +0200609 return NULL;
610
Willy Tarreau07115412012-10-29 21:56:59 +0100611 static_table_key->key_len = t->key_size;
612 static_table_key->key = sample_to_key[smp->type][t->type](smp, &static_table_key->data, &static_table_key->key_len);
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200613
Willy Tarreau07115412012-10-29 21:56:59 +0100614 if (!static_table_key->key)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200615 return NULL;
616
Willy Tarreau07115412012-10-29 21:56:59 +0100617 if (static_table_key->key_len == 0)
Willy Tarreau7fc1c6e2012-04-26 11:03:17 +0200618 return NULL;
619
Willy Tarreau07115412012-10-29 21:56:59 +0100620 if ((static_table_key->key_len < t->key_size) && (t->type != STKTABLE_TYPE_STRING)) {
Emeric Brun485479d2010-09-23 18:02:19 +0200621 /* need padding with null */
622
623 /* assume static_table_key.key_len is less than sizeof(static_table_key.data.buf)
624 cause t->key_size is necessary less than sizeof(static_table_key.data) */
625
Willy Tarreau07115412012-10-29 21:56:59 +0100626 if ((char *)static_table_key->key > (char *)&static_table_key->data &&
627 (char *)static_table_key->key < (char *)&static_table_key->data + global.tune.bufsize) {
Emeric Brun485479d2010-09-23 18:02:19 +0200628 /* key buffer is part of the static_table_key private data buffer, but is not aligned */
629
Willy Tarreau07115412012-10-29 21:56:59 +0100630 if (global.tune.bufsize - ((char *)static_table_key->key - (char *)&static_table_key->data) < t->key_size) {
631 /* if not remain enough place for padding , process a realign */
632 memmove(static_table_key->data.buf, static_table_key->key, static_table_key->key_len);
633 static_table_key->key = static_table_key->data.buf;
Emeric Brun485479d2010-09-23 18:02:19 +0200634 }
635 }
Willy Tarreau07115412012-10-29 21:56:59 +0100636 else if (static_table_key->key != static_table_key->data.buf) {
Emeric Brun485479d2010-09-23 18:02:19 +0200637 /* key definitly not part of the static_table_key private data buffer */
638
Willy Tarreau07115412012-10-29 21:56:59 +0100639 memcpy(static_table_key->data.buf, static_table_key->key, static_table_key->key_len);
640 static_table_key->key = static_table_key->data.buf;
Emeric Brun485479d2010-09-23 18:02:19 +0200641 }
642
Willy Tarreau07115412012-10-29 21:56:59 +0100643 memset(static_table_key->key + static_table_key->key_len, 0, t->key_size - static_table_key->key_len);
Emeric Brun485479d2010-09-23 18:02:19 +0200644 }
645
Willy Tarreau07115412012-10-29 21:56:59 +0100646 return static_table_key;
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200647}
648
649/*
Willy Tarreau8fed9032014-07-03 17:02:46 +0200650 * Process a fetch + format conversion as defined by the sample expression <expr>
651 * on request or response considering the <opt> parameter. Returns either NULL if
652 * no key could be extracted, or a pointer to the converted result stored in
653 * static_table_key in format <table_type>. If <smp> is not NULL, it will be reset
654 * and its flags will be initialized so that the caller gets a copy of the input
655 * sample, and knows why it was not accepted (eg: SMP_F_MAY_CHANGE is present).
656 */
657struct stktable_key *stktable_fetch_key(struct stktable *t, struct proxy *px, struct session *l4, void *l7,
658 unsigned int opt, struct sample_expr *expr, struct sample *smp)
659{
660 if (smp)
661 memset(smp, 0, sizeof(*smp));
662
663 smp = sample_process(px, l4, l7, opt, expr, smp);
664 if (!smp)
665 return NULL;
666
667 if ((smp->flags & SMP_F_MAY_CHANGE) && !(opt & SMP_OPT_FINAL))
668 return NULL; /* we can only use stable samples */
669
670 return smp_to_stkey(smp, t);
671}
672
673/*
Willy Tarreau12785782012-04-27 21:37:17 +0200674 * Returns 1 if sample expression <expr> result can be converted to table key of
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200675 * type <table_type>, otherwise zero. Used in configuration check.
676 */
Willy Tarreau12785782012-04-27 21:37:17 +0200677int stktable_compatible_sample(struct sample_expr *expr, unsigned long table_type)
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200678{
Thierry FOURNIERf73eb8f2013-11-27 15:30:55 +0100679 int out_type;
680
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200681 if (table_type >= STKTABLE_TYPES)
682 return 0;
683
Thierry FOURNIERf73eb8f2013-11-27 15:30:55 +0100684 out_type = smp_expr_output_type(expr);
685 if (!sample_to_key[out_type][table_type])
686 return 0;
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200687
Willy Tarreauf0b38bf2010-06-06 13:22:23 +0200688 return 1;
689}
Emeric Brun3bd697e2010-01-04 15:23:48 +0100690
Willy Tarreau08d5f982010-06-06 13:34:54 +0200691/* Extra data types processing */
692struct stktable_data_type stktable_data_types[STKTABLE_DATA_TYPES] = {
Willy Tarreau3b9c6e02010-07-18 08:04:30 +0200693 [STKTABLE_DT_SERVER_ID] = { .name = "server_id", .std_type = STD_T_SINT },
694 [STKTABLE_DT_GPC0] = { .name = "gpc0", .std_type = STD_T_UINT },
Willy Tarreauba2ffd12013-05-29 15:54:14 +0200695 [STKTABLE_DT_GPC0_RATE] = { .name = "gpc0_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
Willy Tarreau3b9c6e02010-07-18 08:04:30 +0200696 [STKTABLE_DT_CONN_CNT] = { .name = "conn_cnt", .std_type = STD_T_UINT },
697 [STKTABLE_DT_CONN_RATE] = { .name = "conn_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
698 [STKTABLE_DT_CONN_CUR] = { .name = "conn_cur", .std_type = STD_T_UINT },
699 [STKTABLE_DT_SESS_CNT] = { .name = "sess_cnt", .std_type = STD_T_UINT },
700 [STKTABLE_DT_SESS_RATE] = { .name = "sess_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
701 [STKTABLE_DT_HTTP_REQ_CNT] = { .name = "http_req_cnt", .std_type = STD_T_UINT },
702 [STKTABLE_DT_HTTP_REQ_RATE] = { .name = "http_req_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
703 [STKTABLE_DT_HTTP_ERR_CNT] = { .name = "http_err_cnt", .std_type = STD_T_UINT },
704 [STKTABLE_DT_HTTP_ERR_RATE] = { .name = "http_err_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
705 [STKTABLE_DT_BYTES_IN_CNT] = { .name = "bytes_in_cnt", .std_type = STD_T_ULL },
706 [STKTABLE_DT_BYTES_IN_RATE] = { .name = "bytes_in_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
707 [STKTABLE_DT_BYTES_OUT_CNT] = { .name = "bytes_out_cnt", .std_type = STD_T_ULL },
708 [STKTABLE_DT_BYTES_OUT_RATE]= { .name = "bytes_out_rate", .std_type = STD_T_FRQP, .arg_type = ARG_T_DELAY },
Willy Tarreau08d5f982010-06-06 13:34:54 +0200709};
710
711/*
712 * Returns the data type number for the stktable_data_type whose name is <name>,
713 * or <0 if not found.
714 */
715int stktable_get_data_type(char *name)
716{
717 int type;
718
719 for (type = 0; type < STKTABLE_DATA_TYPES; type++) {
720 if (strcmp(name, stktable_data_types[type].name) == 0)
721 return type;
722 }
723 return -1;
724}
725
Willy Tarreau4a0347a2010-06-18 17:26:50 +0200726/* Returns pointer to proxy containing table <name> or NULL if not found */
727struct proxy *find_stktable(const char *name)
728{
729 struct proxy *px;
Willy Tarreau991610d2014-03-15 08:03:57 +0100730 struct ebpt_node *node;
731
732 for (node = ebis_lookup(&proxy_by_name, name); node; node = ebpt_next(node)) {
733 px = container_of(node, struct proxy, conf.by_name);
734
735 if (strcmp(px->id, name) != 0)
736 break;
Willy Tarreau4a0347a2010-06-18 17:26:50 +0200737
Willy Tarreau991610d2014-03-15 08:03:57 +0100738 if (px->table.size)
Willy Tarreau4a0347a2010-06-18 17:26:50 +0200739 return px;
740 }
741 return NULL;
742}
Willy Tarreaud9f316a2014-07-10 14:03:38 +0200743
744/* Casts sample <smp> to the type of the table specified in arg(0), and looks
745 * it up into this table. Returns true if found, false otherwise. The input
746 * type is STR so that input samples are converted to string (since all types
747 * can be converted to strings), then the function casts the string again into
748 * the table's type. This is a double conversion, but in the future we might
749 * support automatic input types to perform the cast on the fly.
750 */
751static int sample_conv_in_table(const struct arg *arg_p, struct sample *smp)
752{
753 struct stktable *t;
754 struct stktable_key *key;
755 struct stksess *ts;
756
757 t = &arg_p[0].data.prx->table;
758
759 key = smp_to_stkey(smp, t);
760 if (!key)
761 return 0;
762
763 ts = stktable_lookup_key(t, key);
764
765 smp->type = SMP_T_BOOL;
766 smp->data.uint = !!ts;
767 smp->flags = SMP_F_VOL_TEST;
768 return 1;
769}
770
771/* Casts sample <smp> to the type of the table specified in arg(0), and looks
772 * it up into this table. Returns the data rate received from clients in bytes/s
773 * if the key is present in the table, otherwise zero, so that comparisons can
774 * be easily performed. If the inspected parameter is not stored in the table,
775 * <not found> is returned.
776 */
777static int sample_conv_table_bytes_in_rate(const struct arg *arg_p, struct sample *smp)
778{
779 struct stktable *t;
780 struct stktable_key *key;
781 struct stksess *ts;
782 void *ptr;
783
784 t = &arg_p[0].data.prx->table;
785
786 key = smp_to_stkey(smp, t);
787 if (!key)
788 return 0;
789
790 smp->flags = SMP_F_VOL_TEST;
791 smp->type = SMP_T_UINT;
792 smp->data.uint = 0;
793
794 ts = stktable_lookup_key(t, key);
795 if (!ts) /* key not present */
796 return 1;
797
798 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_BYTES_IN_RATE);
799 if (!ptr)
800 return 0; /* parameter not stored */
801
802 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, bytes_in_rate),
803 t->data_arg[STKTABLE_DT_BYTES_IN_RATE].u);
804 return 1;
805}
806
807/* Casts sample <smp> to the type of the table specified in arg(0), and looks
808 * it up into this table. Returns the cumulated number of connections for the key
809 * if the key is present in the table, otherwise zero, so that comparisons can
810 * be easily performed. If the inspected parameter is not stored in the table,
811 * <not found> is returned.
812 */
813static int sample_conv_table_conn_cnt(const struct arg *arg_p, struct sample *smp)
814{
815 struct stktable *t;
816 struct stktable_key *key;
817 struct stksess *ts;
818 void *ptr;
819
820 t = &arg_p[0].data.prx->table;
821
822 key = smp_to_stkey(smp, t);
823 if (!key)
824 return 0;
825
826 smp->flags = SMP_F_VOL_TEST;
827 smp->type = SMP_T_UINT;
828 smp->data.uint = 0;
829
830 ts = stktable_lookup_key(t, key);
831 if (!ts) /* key not present */
832 return 1;
833
834 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_CONN_CNT);
835 if (!ptr)
836 return 0; /* parameter not stored */
837
838 smp->data.uint = stktable_data_cast(ptr, conn_cnt);
839 return 1;
840}
841
842/* Casts sample <smp> to the type of the table specified in arg(0), and looks
843 * it up into this table. Returns the number of concurrent connections for the
844 * key if the key is present in the table, otherwise zero, so that comparisons
845 * can be easily performed. If the inspected parameter is not stored in the
846 * table, <not found> is returned.
847 */
848static int sample_conv_table_conn_cur(const struct arg *arg_p, struct sample *smp)
849{
850 struct stktable *t;
851 struct stktable_key *key;
852 struct stksess *ts;
853 void *ptr;
854
855 t = &arg_p[0].data.prx->table;
856
857 key = smp_to_stkey(smp, t);
858 if (!key)
859 return 0;
860
861 smp->flags = SMP_F_VOL_TEST;
862 smp->type = SMP_T_UINT;
863 smp->data.uint = 0;
864
865 ts = stktable_lookup_key(t, key);
866 if (!ts) /* key not present */
867 return 1;
868
869 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_CONN_CUR);
870 if (!ptr)
871 return 0; /* parameter not stored */
872
873 smp->data.uint = stktable_data_cast(ptr, conn_cur);
874 return 1;
875}
876
877/* Casts sample <smp> to the type of the table specified in arg(0), and looks
878 * it up into this table. Returns the rate of incoming connections from the key
879 * if the key is present in the table, otherwise zero, so that comparisons can
880 * be easily performed. If the inspected parameter is not stored in the table,
881 * <not found> is returned.
882 */
883static int sample_conv_table_conn_rate(const struct arg *arg_p, struct sample *smp)
884{
885 struct stktable *t;
886 struct stktable_key *key;
887 struct stksess *ts;
888 void *ptr;
889
890 t = &arg_p[0].data.prx->table;
891
892 key = smp_to_stkey(smp, t);
893 if (!key)
894 return 0;
895
896 smp->flags = SMP_F_VOL_TEST;
897 smp->type = SMP_T_UINT;
898 smp->data.uint = 0;
899
900 ts = stktable_lookup_key(t, key);
901 if (!ts) /* key not present */
902 return 1;
903
904 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_CONN_RATE);
905 if (!ptr)
906 return 0; /* parameter not stored */
907
908 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, conn_rate),
909 t->data_arg[STKTABLE_DT_CONN_RATE].u);
910 return 1;
911}
912
913/* Casts sample <smp> to the type of the table specified in arg(0), and looks
914 * it up into this table. Returns the data rate sent to clients in bytes/s
915 * if the key is present in the table, otherwise zero, so that comparisons can
916 * be easily performed. If the inspected parameter is not stored in the table,
917 * <not found> is returned.
918 */
919static int sample_conv_table_bytes_out_rate(const struct arg *arg_p, struct sample *smp)
920{
921 struct stktable *t;
922 struct stktable_key *key;
923 struct stksess *ts;
924 void *ptr;
925
926 t = &arg_p[0].data.prx->table;
927
928 key = smp_to_stkey(smp, t);
929 if (!key)
930 return 0;
931
932 smp->flags = SMP_F_VOL_TEST;
933 smp->type = SMP_T_UINT;
934 smp->data.uint = 0;
935
936 ts = stktable_lookup_key(t, key);
937 if (!ts) /* key not present */
938 return 1;
939
940 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_BYTES_OUT_RATE);
941 if (!ptr)
942 return 0; /* parameter not stored */
943
944 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, bytes_out_rate),
945 t->data_arg[STKTABLE_DT_BYTES_OUT_RATE].u);
946 return 1;
947}
948
949/* Casts sample <smp> to the type of the table specified in arg(0), and looks
950 * it up into this table. Returns the value of the GPC0 counter for the key
951 * if the key is present in the table, otherwise zero, so that comparisons can
952 * be easily performed. If the inspected parameter is not stored in the table,
953 * <not found> is returned.
954 */
955static int sample_conv_table_gpc0(const struct arg *arg_p, struct sample *smp)
956{
957 struct stktable *t;
958 struct stktable_key *key;
959 struct stksess *ts;
960 void *ptr;
961
962 t = &arg_p[0].data.prx->table;
963
964 key = smp_to_stkey(smp, t);
965 if (!key)
966 return 0;
967
968 smp->flags = SMP_F_VOL_TEST;
969 smp->type = SMP_T_UINT;
970 smp->data.uint = 0;
971
972 ts = stktable_lookup_key(t, key);
973 if (!ts) /* key not present */
974 return 1;
975
976 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_GPC0);
977 if (!ptr)
978 return 0; /* parameter not stored */
979
980 smp->data.uint = stktable_data_cast(ptr, gpc0);
981 return 1;
982}
983
984/* Casts sample <smp> to the type of the table specified in arg(0), and looks
985 * it up into this table. Returns the event rate of the GPC0 counter for the key
986 * if the key is present in the table, otherwise zero, so that comparisons can
987 * be easily performed. If the inspected parameter is not stored in the table,
988 * <not found> is returned.
989 */
990static int sample_conv_table_gpc0_rate(const struct arg *arg_p, struct sample *smp)
991{
992 struct stktable *t;
993 struct stktable_key *key;
994 struct stksess *ts;
995 void *ptr;
996
997 t = &arg_p[0].data.prx->table;
998
999 key = smp_to_stkey(smp, t);
1000 if (!key)
1001 return 0;
1002
1003 smp->flags = SMP_F_VOL_TEST;
1004 smp->type = SMP_T_UINT;
1005 smp->data.uint = 0;
1006
1007 ts = stktable_lookup_key(t, key);
1008 if (!ts) /* key not present */
1009 return 1;
1010
1011 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_GPC0_RATE);
1012 if (!ptr)
1013 return 0; /* parameter not stored */
1014
1015 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, gpc0_rate),
1016 t->data_arg[STKTABLE_DT_GPC0_RATE].u);
1017 return 1;
1018}
1019
1020/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1021 * it up into this table. Returns the cumulated number of HTTP request errors
1022 * for the key if the key is present in the table, otherwise zero, so that
1023 * comparisons can be easily performed. If the inspected parameter is not stored
1024 * in the table, <not found> is returned.
1025 */
1026static int sample_conv_table_http_err_cnt(const struct arg *arg_p, struct sample *smp)
1027{
1028 struct stktable *t;
1029 struct stktable_key *key;
1030 struct stksess *ts;
1031 void *ptr;
1032
1033 t = &arg_p[0].data.prx->table;
1034
1035 key = smp_to_stkey(smp, t);
1036 if (!key)
1037 return 0;
1038
1039 smp->flags = SMP_F_VOL_TEST;
1040 smp->type = SMP_T_UINT;
1041 smp->data.uint = 0;
1042
1043 ts = stktable_lookup_key(t, key);
1044 if (!ts) /* key not present */
1045 return 1;
1046
1047 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_HTTP_ERR_CNT);
1048 if (!ptr)
1049 return 0; /* parameter not stored */
1050
1051 smp->data.uint = stktable_data_cast(ptr, http_err_cnt);
1052 return 1;
1053}
1054
1055/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1056 * it up into this table. Returns the HTTP request error rate the key
1057 * if the key is present in the table, otherwise zero, so that comparisons can
1058 * be easily performed. If the inspected parameter is not stored in the table,
1059 * <not found> is returned.
1060 */
1061static int sample_conv_table_http_err_rate(const struct arg *arg_p, struct sample *smp)
1062{
1063 struct stktable *t;
1064 struct stktable_key *key;
1065 struct stksess *ts;
1066 void *ptr;
1067
1068 t = &arg_p[0].data.prx->table;
1069
1070 key = smp_to_stkey(smp, t);
1071 if (!key)
1072 return 0;
1073
1074 smp->flags = SMP_F_VOL_TEST;
1075 smp->type = SMP_T_UINT;
1076 smp->data.uint = 0;
1077
1078 ts = stktable_lookup_key(t, key);
1079 if (!ts) /* key not present */
1080 return 1;
1081
1082 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_HTTP_ERR_RATE);
1083 if (!ptr)
1084 return 0; /* parameter not stored */
1085
1086 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, http_err_rate),
1087 t->data_arg[STKTABLE_DT_HTTP_ERR_RATE].u);
1088 return 1;
1089}
1090
1091/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1092 * it up into this table. Returns the cumulated number of HTTP request for the
1093 * key if the key is present in the table, otherwise zero, so that comparisons
1094 * can be easily performed. If the inspected parameter is not stored in the
1095 * table, <not found> is returned.
1096 */
1097static int sample_conv_table_http_req_cnt(const struct arg *arg_p, struct sample *smp)
1098{
1099 struct stktable *t;
1100 struct stktable_key *key;
1101 struct stksess *ts;
1102 void *ptr;
1103
1104 t = &arg_p[0].data.prx->table;
1105
1106 key = smp_to_stkey(smp, t);
1107 if (!key)
1108 return 0;
1109
1110 smp->flags = SMP_F_VOL_TEST;
1111 smp->type = SMP_T_UINT;
1112 smp->data.uint = 0;
1113
1114 ts = stktable_lookup_key(t, key);
1115 if (!ts) /* key not present */
1116 return 1;
1117
1118 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_HTTP_REQ_CNT);
1119 if (!ptr)
1120 return 0; /* parameter not stored */
1121
1122 smp->data.uint = stktable_data_cast(ptr, http_req_cnt);
1123 return 1;
1124}
1125
1126/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1127 * it up into this table. Returns the HTTP request rate the key if the key is
1128 * present in the table, otherwise zero, so that comparisons can be easily
1129 * performed. If the inspected parameter is not stored in the table, <not found>
1130 * is returned.
1131 */
1132static int sample_conv_table_http_req_rate(const struct arg *arg_p, struct sample *smp)
1133{
1134 struct stktable *t;
1135 struct stktable_key *key;
1136 struct stksess *ts;
1137 void *ptr;
1138
1139 t = &arg_p[0].data.prx->table;
1140
1141 key = smp_to_stkey(smp, t);
1142 if (!key)
1143 return 0;
1144
1145 smp->flags = SMP_F_VOL_TEST;
1146 smp->type = SMP_T_UINT;
1147 smp->data.uint = 0;
1148
1149 ts = stktable_lookup_key(t, key);
1150 if (!ts) /* key not present */
1151 return 1;
1152
1153 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_HTTP_REQ_RATE);
1154 if (!ptr)
1155 return 0; /* parameter not stored */
1156
1157 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, http_req_rate),
1158 t->data_arg[STKTABLE_DT_HTTP_REQ_RATE].u);
1159 return 1;
1160}
1161
1162/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1163 * it up into this table. Returns the volume of datareceived from clients in kbytes
1164 * if the key is present in the table, otherwise zero, so that comparisons can
1165 * be easily performed. If the inspected parameter is not stored in the table,
1166 * <not found> is returned.
1167 */
1168static int sample_conv_table_kbytes_in(const struct arg *arg_p, struct sample *smp)
1169{
1170 struct stktable *t;
1171 struct stktable_key *key;
1172 struct stksess *ts;
1173 void *ptr;
1174
1175 t = &arg_p[0].data.prx->table;
1176
1177 key = smp_to_stkey(smp, t);
1178 if (!key)
1179 return 0;
1180
1181 smp->flags = SMP_F_VOL_TEST;
1182 smp->type = SMP_T_UINT;
1183 smp->data.uint = 0;
1184
1185 ts = stktable_lookup_key(t, key);
1186 if (!ts) /* key not present */
1187 return 1;
1188
1189 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_BYTES_IN_CNT);
1190 if (!ptr)
1191 return 0; /* parameter not stored */
1192
1193 smp->data.uint = stktable_data_cast(ptr, bytes_in_cnt) >> 10;
1194 return 1;
1195}
1196
1197/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1198 * it up into this table. Returns the volume of data sent to clients in kbytes
1199 * if the key is present in the table, otherwise zero, so that comparisons can
1200 * be easily performed. If the inspected parameter is not stored in the table,
1201 * <not found> is returned.
1202 */
1203static int sample_conv_table_kbytes_out(const struct arg *arg_p, struct sample *smp)
1204{
1205 struct stktable *t;
1206 struct stktable_key *key;
1207 struct stksess *ts;
1208 void *ptr;
1209
1210 t = &arg_p[0].data.prx->table;
1211
1212 key = smp_to_stkey(smp, t);
1213 if (!key)
1214 return 0;
1215
1216 smp->flags = SMP_F_VOL_TEST;
1217 smp->type = SMP_T_UINT;
1218 smp->data.uint = 0;
1219
1220 ts = stktable_lookup_key(t, key);
1221 if (!ts) /* key not present */
1222 return 1;
1223
1224 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_BYTES_OUT_CNT);
1225 if (!ptr)
1226 return 0; /* parameter not stored */
1227
1228 smp->data.uint = stktable_data_cast(ptr, bytes_out_cnt) >> 10;
1229 return 1;
1230}
1231
1232/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1233 * it up into this table. Returns the server ID associated with the key if the
1234 * key is present in the table, otherwise zero, so that comparisons can be
1235 * easily performed. If the inspected parameter is not stored in the table,
1236 * <not found> is returned.
1237 */
1238static int sample_conv_table_server_id(const struct arg *arg_p, struct sample *smp)
1239{
1240 struct stktable *t;
1241 struct stktable_key *key;
1242 struct stksess *ts;
1243 void *ptr;
1244
1245 t = &arg_p[0].data.prx->table;
1246
1247 key = smp_to_stkey(smp, t);
1248 if (!key)
1249 return 0;
1250
1251 smp->flags = SMP_F_VOL_TEST;
1252 smp->type = SMP_T_UINT;
1253 smp->data.uint = 0;
1254
1255 ts = stktable_lookup_key(t, key);
1256 if (!ts) /* key not present */
1257 return 1;
1258
1259 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_SERVER_ID);
1260 if (!ptr)
1261 return 0; /* parameter not stored */
1262
1263 smp->data.uint = stktable_data_cast(ptr, server_id);
1264 return 1;
1265}
1266
1267/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1268 * it up into this table. Returns the cumulated number of sessions for the
1269 * key if the key is present in the table, otherwise zero, so that comparisons
1270 * can be easily performed. If the inspected parameter is not stored in the
1271 * table, <not found> is returned.
1272 */
1273static int sample_conv_table_sess_cnt(const struct arg *arg_p, struct sample *smp)
1274{
1275 struct stktable *t;
1276 struct stktable_key *key;
1277 struct stksess *ts;
1278 void *ptr;
1279
1280 t = &arg_p[0].data.prx->table;
1281
1282 key = smp_to_stkey(smp, t);
1283 if (!key)
1284 return 0;
1285
1286 smp->flags = SMP_F_VOL_TEST;
1287 smp->type = SMP_T_UINT;
1288 smp->data.uint = 0;
1289
1290 ts = stktable_lookup_key(t, key);
1291 if (!ts) /* key not present */
1292 return 1;
1293
1294 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_SESS_CNT);
1295 if (!ptr)
1296 return 0; /* parameter not stored */
1297
1298 smp->data.uint = stktable_data_cast(ptr, sess_cnt);
1299 return 1;
1300}
1301
1302/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1303 * it up into this table. Returns the session rate the key if the key is
1304 * present in the table, otherwise zero, so that comparisons can be easily
1305 * performed. If the inspected parameter is not stored in the table, <not found>
1306 * is returned.
1307 */
1308static int sample_conv_table_sess_rate(const struct arg *arg_p, struct sample *smp)
1309{
1310 struct stktable *t;
1311 struct stktable_key *key;
1312 struct stksess *ts;
1313 void *ptr;
1314
1315 t = &arg_p[0].data.prx->table;
1316
1317 key = smp_to_stkey(smp, t);
1318 if (!key)
1319 return 0;
1320
1321 smp->flags = SMP_F_VOL_TEST;
1322 smp->type = SMP_T_UINT;
1323 smp->data.uint = 0;
1324
1325 ts = stktable_lookup_key(t, key);
1326 if (!ts) /* key not present */
1327 return 1;
1328
1329 ptr = stktable_data_ptr(t, ts, STKTABLE_DT_SESS_RATE);
1330 if (!ptr)
1331 return 0; /* parameter not stored */
1332
1333 smp->data.uint = read_freq_ctr_period(&stktable_data_cast(ptr, sess_rate),
1334 t->data_arg[STKTABLE_DT_SESS_RATE].u);
1335 return 1;
1336}
1337
1338/* Casts sample <smp> to the type of the table specified in arg(0), and looks
1339 * it up into this table. Returns the amount of concurrent connections tracking
1340 * the same key if the key is present in the table, otherwise zero, so that
1341 * comparisons can be easily performed. If the inspected parameter is not
1342 * stored in the table, <not found> is returned.
1343 */
1344static int sample_conv_table_trackers(const struct arg *arg_p, struct sample *smp)
1345{
1346 struct stktable *t;
1347 struct stktable_key *key;
1348 struct stksess *ts;
1349
1350 t = &arg_p[0].data.prx->table;
1351
1352 key = smp_to_stkey(smp, t);
1353 if (!key)
1354 return 0;
1355
1356 smp->flags = SMP_F_VOL_TEST;
1357 smp->type = SMP_T_UINT;
1358 smp->data.uint = 0;
1359
1360 ts = stktable_lookup_key(t, key);
1361 if (ts)
1362 smp->data.uint = ts->ref_cnt;
1363
1364 return 1;
1365}
1366
1367
1368/* Note: must not be declared <const> as its list will be overwritten */
1369static struct sample_conv_kw_list sample_conv_kws = {ILH, {
1370 { "in_table", sample_conv_in_table, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_BOOL },
1371 { "table_bytes_in_rate", sample_conv_table_bytes_in_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1372 { "table_bytes_out_rate", sample_conv_table_bytes_out_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1373 { "table_conn_cnt", sample_conv_table_conn_cnt, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1374 { "table_conn_cur", sample_conv_table_conn_cur, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1375 { "table_conn_rate", sample_conv_table_conn_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1376 { "table_gpc0", sample_conv_table_gpc0, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1377 { "table_gpc0_rate", sample_conv_table_gpc0_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1378 { "table_http_err_cnt", sample_conv_table_http_err_cnt, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1379 { "table_http_err_rate", sample_conv_table_http_err_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1380 { "table_http_req_cnt", sample_conv_table_http_req_cnt, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1381 { "table_http_req_rate", sample_conv_table_http_req_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1382 { "table_kbytes_in", sample_conv_table_kbytes_in, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1383 { "table_kbytes_out", sample_conv_table_kbytes_out, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1384 { "table_server_id", sample_conv_table_server_id, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1385 { "table_sess_cnt", sample_conv_table_sess_cnt, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1386 { "table_sess_rate", sample_conv_table_sess_rate, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1387 { "table_trackers", sample_conv_table_trackers, ARG1(1,TAB), NULL, SMP_T_STR, SMP_T_UINT },
1388 { /* END */ },
1389}};
1390
1391__attribute__((constructor))
1392static void __stick_table_init(void)
1393{
1394 /* register sample fetch and format conversion keywords */
1395 sample_register_convs(&sample_conv_kws);
1396}