mirror of
https://git.haproxy.org/git/haproxy.git/
synced 2025-10-08 22:21:29 +02:00
80aca90ad2
Samples fetches were relying on two flags SMP_CAP_REQ/SMP_CAP_RES to describe whether they were compatible with requests rules or with response rules. This was never reliable because we need a finer granularity (eg: an HTTP request method needs to parse an HTTP request, and is available past this point). Some fetches are also dependant on the context (eg: "hdr" uses request or response depending where it's involved, causing some abiguity). In order to solve this, we need to precisely indicate in fetches what they use, and their users will have to compare with what they have. So now we have a bunch of bits indicating where the sample is fetched in the processing chain, with a few variants indicating for some of them if it is permanent or volatile (eg: an HTTP status is stored into the transaction so it is permanent, despite being caught in the response contents). The fetches also have a second mask indicating their validity domain. This one is computed from a conversion table at registration time, so there is no need for doing it by hand. This validity domain consists in a bitmask with one bit set for each usage point in the processing chain. Some provisions were made for upcoming controls such as connection-based TCP rules which apply on top of the connection layer but before instantiating the session. Then everywhere a fetch is used, the bit for the control point is checked in the fetch's validity domain, and it becomes possible to finely ensure that a fetch will work or not. Note that we need these two separate bitfields because some fetches are usable both in request and response (eg: "hdr", "payload"). So the keyword will have a "use" field made of a combination of several SMP_USE_* values, which will be converted into a wider list of SMP_VAL_* flags. The knowledge of permanent vs dynamic information has disappeared for now, as it was never used. Later we'll probably reintroduce it differently when dealing with variables. Its only use at the moment could have been to avoid caching a dynamic rate measurement, but nothing is cached as of now.
40 lines
1.6 KiB
C
40 lines
1.6 KiB
C
/*
|
|
* include/proto/sample.h
|
|
* Functions for samples management.
|
|
*
|
|
* Copyright (C) 2009-2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
|
|
* Copyright (C) 2012 Willy Tarreau <w@1wt.eu>
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation, version 2.1
|
|
* exclusively.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef _PROTO_SAMPLE_H
|
|
#define _PROTO_SAMPLE_H
|
|
|
|
#include <types/sample.h>
|
|
#include <types/stick_table.h>
|
|
|
|
struct sample_expr *sample_parse_expr(char **str, int *idx, char *err, int err_size);
|
|
struct sample *sample_process(struct proxy *px, struct session *l4,
|
|
void *l7, unsigned int dir, struct sample_expr *expr,
|
|
struct sample *p);
|
|
struct sample *sample_fetch_string(struct proxy *px, struct session *l4, void *l7,
|
|
unsigned int opt, struct sample_expr *expr);
|
|
void sample_register_fetches(struct sample_fetch_kw_list *psl);
|
|
void sample_register_convs(struct sample_conv_kw_list *psl);
|
|
const char *sample_src_names(unsigned int use);
|
|
|
|
#endif /* _PROTO_SAMPLE_H */
|