blob: 3deb2d1170de3d637af1fad8e2b1216efec5190f [file] [log] [blame]
Christopher Fauletd7c91962015-04-30 11:48:27 +02001/*
2 * include/proto/filters.h
3 * This file defines function prototypes for stream filters management.
4 *
5 * Copyright (C) 2015 Qualys Inc., Christopher Faulet <cfaulet@qualys.com>
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21#ifndef _PROTO_FILTERS_H
22#define _PROTO_FILTERS_H
23
24#include <types/channel.h>
25#include <types/filters.h>
Christopher Fauletfc9cfe42019-07-16 14:54:53 +020026#include <types/http_ana.h>
Christopher Fauletd7c91962015-04-30 11:48:27 +020027#include <types/proxy.h>
28#include <types/stream.h>
29
30#include <proto/channel.h>
31
Christopher Fauletf4a4ef72018-12-07 17:39:53 +010032extern const char *trace_flt_id;
33extern const char *http_comp_flt_id;
34extern const char *cache_store_flt_id;
35extern const char *spoe_filter_id;
36
Christopher Faulet443ea1a2016-02-04 13:40:26 +010037#define FLT_ID(flt) (flt)->config->id
38#define FLT_CONF(flt) (flt)->config->conf
39#define FLT_OPS(flt) (flt)->config->ops
40
Christopher Fauletd7c91962015-04-30 11:48:27 +020041/* Useful macros to access per-channel values. It can be safely used inside
42 * filters. */
43#define CHN_IDX(chn) (((chn)->flags & CF_ISRESP) == CF_ISRESP)
Christopher Faulet75bc9132018-11-30 15:18:09 +010044#define FLT_STRM_OFF(s, chn) (strm_flt(s)->offset[CHN_IDX(chn)])
45#define FLT_OFF(flt, chn) ((flt)->offset[CHN_IDX(chn)])
46
Christopher Fauletd7c91962015-04-30 11:48:27 +020047#define FLT_NXT(flt, chn) ((flt)->next[CHN_IDX(chn)])
48#define FLT_FWD(flt, chn) ((flt)->fwd[CHN_IDX(chn)])
Christopher Faulet3e7bc672015-12-07 13:39:08 +010049#define flt_req_nxt(flt) ((flt)->next[0])
50#define flt_rsp_nxt(flt) ((flt)->next[1])
51#define flt_req_fwd(flt) ((flt)->fwd[0])
52#define flt_rsp_fwd(flt) ((flt)->fwd[1])
Christopher Fauletd7c91962015-04-30 11:48:27 +020053
Christopher Fauletda02e172015-12-04 09:25:05 +010054#define HAS_FILTERS(strm) ((strm)->strm_flt.flags & STRM_FLT_FL_HAS_FILTERS)
Christopher Faulet3e344292015-11-24 16:24:13 +010055
Christopher Fauletda02e172015-12-04 09:25:05 +010056#define HAS_REQ_DATA_FILTERS(strm) ((strm)->strm_flt.nb_req_data_filters != 0)
57#define HAS_RSP_DATA_FILTERS(strm) ((strm)->strm_flt.nb_rsp_data_filters != 0)
Christopher Faulet4aad8332016-11-28 10:01:32 +010058#define HAS_DATA_FILTERS(strm, chn) (((chn)->flags & CF_ISRESP) ? HAS_RSP_DATA_FILTERS(strm) : HAS_REQ_DATA_FILTERS(strm))
Christopher Fauletda02e172015-12-04 09:25:05 +010059
60#define IS_REQ_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_REQ_DATA_FILTER)
61#define IS_RSP_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_RSP_DATA_FILTER)
Christopher Faulet4aad8332016-11-28 10:01:32 +010062#define IS_DATA_FILTER(flt, chn) (((chn)->flags & CF_ISRESP) ? IS_RSP_DATA_FILTER(flt) : IS_REQ_DATA_FILTER(flt))
Christopher Fauletda02e172015-12-04 09:25:05 +010063
64#define FLT_STRM_CB(strm, call) \
Christopher Faulet3e344292015-11-24 16:24:13 +010065 do { \
66 if (HAS_FILTERS(strm)) { call; } \
67 } while (0)
Christopher Fauletda02e172015-12-04 09:25:05 +010068
69#define FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, default_ret) \
70 (HAS_DATA_FILTERS(strm, chn) ? call : default_ret)
71#define FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, default_ret, on_error) \
Christopher Faulet3e344292015-11-24 16:24:13 +010072 ({ \
73 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010074 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010075 _ret = call; \
76 if (_ret < 0) { on_error; } \
77 } \
78 else \
79 _ret = default_ret; \
80 _ret; \
81 })
Christopher Fauletda02e172015-12-04 09:25:05 +010082#define FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, default_ret, on_error, on_wait) \
Christopher Faulet3e344292015-11-24 16:24:13 +010083 ({ \
84 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010085 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010086 _ret = call; \
87 if (_ret < 0) { on_error; } \
88 if (!_ret) { on_wait; } \
89 } \
90 else \
91 _ret = default_ret; \
92 _ret; \
93 })
94
Christopher Fauletda02e172015-12-04 09:25:05 +010095#define FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, A, B, C, DATA_CB_IMPL, ...) \
96 DATA_CB_IMPL
Christopher Faulet3e344292015-11-24 16:24:13 +010097
Christopher Fauletda02e172015-12-04 09:25:05 +010098#define FLT_STRM_DATA_CB(strm, chn, call, ...) \
99 FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, ##__VA_ARGS__, \
100 FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, ##__VA_ARGS__), \
101 FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, ##__VA_ARGS__), \
102 FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, ##__VA_ARGS__))
Christopher Faulet3e344292015-11-24 16:24:13 +0100103
Christopher Fauletd7c91962015-04-30 11:48:27 +0200104void flt_deinit(struct proxy *p);
105int flt_check(struct proxy *p);
106
107int flt_stream_start(struct stream *s);
108void flt_stream_stop(struct stream *s);
Christopher Faulet92d36382015-11-05 13:35:03 +0100109int flt_set_stream_backend(struct stream *s, struct proxy *be);
110int flt_stream_init(struct stream *s);
111void flt_stream_release(struct stream *s, int only_backend);
Christopher Fauleta00d8172016-11-10 14:58:05 +0100112void flt_stream_check_timeouts(struct stream *s);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200113
Christopher Faulet75bc9132018-11-30 15:18:09 +0100114int flt_http_payload(struct stream *s, struct http_msg *msg, unsigned int len);
115int flt_http_end(struct stream *s, struct http_msg *msg);
116
Christopher Faulet309c6412015-12-02 09:57:32 +0100117void flt_http_reset(struct stream *s, struct http_msg *msg);
Willy Tarreau83061a82018-07-13 11:56:34 +0200118void flt_http_reply(struct stream *s, short status, const struct buffer *msg);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200119
120int flt_start_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Faulet3a394fa2016-05-11 17:13:39 +0200121int flt_pre_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
122int flt_post_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Faulet309c6412015-12-02 09:57:32 +0100123int flt_analyze_http_headers(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200124int flt_end_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
125
126int flt_xfer_data(struct stream *s, struct channel *chn, unsigned int an_bit);
127
128void flt_register_keywords(struct flt_kw_list *kwl);
129struct flt_kw *flt_find_kw(const char *kw);
130void flt_dump_kws(char **out);
Christopher Fauletb3f4e142016-03-07 12:46:38 +0100131void list_filters(FILE *out);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200132
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100133/* Helper function that returns the "global" state of filters attached to a
134 * stream. */
135static inline struct strm_flt *
136strm_flt(struct stream *s)
137{
138 return &s->strm_flt;
139}
140
Christopher Fauletda02e172015-12-04 09:25:05 +0100141/* Registers a filter to a channel. If a filter was already registered, this
142 * function do nothing. Once registered, the filter becomes a "data" filter for
143 * this channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200144static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100145register_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200146{
Christopher Fauletda02e172015-12-04 09:25:05 +0100147 if (!IS_DATA_FILTER(filter, chn)) {
148 if (chn->flags & CF_ISRESP) {
149 filter->flags |= FLT_FL_IS_RSP_DATA_FILTER;
150 strm_flt(s)->nb_rsp_data_filters++;
151 }
152 else {
153 filter->flags |= FLT_FL_IS_REQ_DATA_FILTER;
154 strm_flt(s)->nb_req_data_filters++;
155 }
156 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200157}
158
Christopher Fauletda02e172015-12-04 09:25:05 +0100159/* Unregisters a "data" filter from a channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200160static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100161unregister_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200162{
Christopher Fauletda02e172015-12-04 09:25:05 +0100163 if (IS_DATA_FILTER(filter, chn)) {
164 if (chn->flags & CF_ISRESP) {
165 filter->flags &= ~FLT_FL_IS_RSP_DATA_FILTER;
166 strm_flt(s)->nb_rsp_data_filters--;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200167
Christopher Fauletda02e172015-12-04 09:25:05 +0100168 }
169 else {
170 filter->flags &= ~FLT_FL_IS_REQ_DATA_FILTER;
171 strm_flt(s)->nb_req_data_filters--;
172 }
173 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200174}
175
Christopher Fauletd7c91962015-04-30 11:48:27 +0200176/* This function must be called when a filter alter incoming data. It updates
177 * next offset value of all filter's predecessors. Do not call this function
178 * when a filter change the size of incomding data leads to an undefined
179 * behavior.
180 *
181 * This is the filter's responsiblitiy to update data itself. For now, it is
182 * unclear to know how to handle data updates, so we do the minimum here. For
183 * example, if you filter an HTTP message, we must update msg->next and
184 * msg->chunk_len values.
185 */
186static inline void
187flt_change_next_size(struct filter *filter, struct channel *chn, int len)
188{
189 struct stream *s = chn_strm(chn);
190 struct filter *f;
191
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100192 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200193 if (f == filter)
194 break;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100195 if (IS_DATA_FILTER(filter, chn))
196 FLT_NXT(f, chn) += len;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200197 }
198}
199
200/* This function must be called when a filter alter forwarded data. It updates
201 * offset values (next and forward) of all filters. Do not call this function
202 * when a filter change the size of forwarded data leads to an undefined
203 * behavior.
204 *
205 * This is the filter's responsiblitiy to update data itself. For now, it is
206 * unclear to know how to handle data updates, so we do the minimum here. For
207 * example, if you filter an HTTP message, we must update msg->next and
208 * msg->chunk_len values.
209 */
210static inline void
211flt_change_forward_size(struct filter *filter, struct channel *chn, int len)
212{
213 struct stream *s = chn_strm(chn);
214 struct filter *f;
215 int before = 1;
216
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100217 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200218 if (f == filter)
219 before = 0;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100220 if (IS_DATA_FILTER(filter, chn)) {
221 if (before)
222 FLT_FWD(f, chn) += len;
223 FLT_NXT(f, chn) += len;
224 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200225 }
226}
227
Christopher Faulet75bc9132018-11-30 15:18:09 +0100228/* This function must be called when a filter alter payload data. It updates
229 * offsets of all previous filters and the offset of the stream. Do not call
230 * this function when a filter change the size of payload data leads to an
231 * undefined behavior.
232 *
233 * This is the filter's responsiblitiy to update data itself..
234 */
235static inline void
236flt_update_offsets(struct filter *filter, struct channel *chn, int len)
237{
238 struct stream *s = chn_strm(chn);
239 struct filter *f;
240
241 list_for_each_entry(f, &strm_flt(s)->filters, list) {
242 if (f == filter)
243 break;
244 if (IS_DATA_FILTER(filter, chn))
245 FLT_OFF(f, chn) += len;
246 }
247}
248
Christopher Fauletd7c91962015-04-30 11:48:27 +0200249
250#endif /* _PROTO_FILTERS_H */