blob: 1ca47c7f431f1e5a4ac5d2be6769db14dd009fa0 [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;
Christopher Faulet78fbb9f2019-08-11 23:11:03 +020036extern const char *fcgi_flt_id;
Christopher Fauletf4a4ef72018-12-07 17:39:53 +010037
Christopher Faulet443ea1a2016-02-04 13:40:26 +010038#define FLT_ID(flt) (flt)->config->id
39#define FLT_CONF(flt) (flt)->config->conf
40#define FLT_OPS(flt) (flt)->config->ops
41
Christopher Fauletd7c91962015-04-30 11:48:27 +020042/* Useful macros to access per-channel values. It can be safely used inside
43 * filters. */
44#define CHN_IDX(chn) (((chn)->flags & CF_ISRESP) == CF_ISRESP)
Christopher Faulet75bc9132018-11-30 15:18:09 +010045#define FLT_STRM_OFF(s, chn) (strm_flt(s)->offset[CHN_IDX(chn)])
46#define FLT_OFF(flt, chn) ((flt)->offset[CHN_IDX(chn)])
47
Christopher Fauletd7c91962015-04-30 11:48:27 +020048#define FLT_NXT(flt, chn) ((flt)->next[CHN_IDX(chn)])
49#define FLT_FWD(flt, chn) ((flt)->fwd[CHN_IDX(chn)])
Christopher Faulet3e7bc672015-12-07 13:39:08 +010050#define flt_req_nxt(flt) ((flt)->next[0])
51#define flt_rsp_nxt(flt) ((flt)->next[1])
52#define flt_req_fwd(flt) ((flt)->fwd[0])
53#define flt_rsp_fwd(flt) ((flt)->fwd[1])
Christopher Fauletd7c91962015-04-30 11:48:27 +020054
Christopher Fauletda02e172015-12-04 09:25:05 +010055#define HAS_FILTERS(strm) ((strm)->strm_flt.flags & STRM_FLT_FL_HAS_FILTERS)
Christopher Faulet3e344292015-11-24 16:24:13 +010056
Christopher Fauletda02e172015-12-04 09:25:05 +010057#define HAS_REQ_DATA_FILTERS(strm) ((strm)->strm_flt.nb_req_data_filters != 0)
58#define HAS_RSP_DATA_FILTERS(strm) ((strm)->strm_flt.nb_rsp_data_filters != 0)
Christopher Faulet4aad8332016-11-28 10:01:32 +010059#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 +010060
61#define IS_REQ_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_REQ_DATA_FILTER)
62#define IS_RSP_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_RSP_DATA_FILTER)
Christopher Faulet4aad8332016-11-28 10:01:32 +010063#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 +010064
65#define FLT_STRM_CB(strm, call) \
Christopher Faulet3e344292015-11-24 16:24:13 +010066 do { \
67 if (HAS_FILTERS(strm)) { call; } \
68 } while (0)
Christopher Fauletda02e172015-12-04 09:25:05 +010069
70#define FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, default_ret) \
71 (HAS_DATA_FILTERS(strm, chn) ? call : default_ret)
72#define FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, default_ret, on_error) \
Christopher Faulet3e344292015-11-24 16:24:13 +010073 ({ \
74 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010075 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010076 _ret = call; \
77 if (_ret < 0) { on_error; } \
78 } \
79 else \
80 _ret = default_ret; \
81 _ret; \
82 })
Christopher Fauletda02e172015-12-04 09:25:05 +010083#define FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, default_ret, on_error, on_wait) \
Christopher Faulet3e344292015-11-24 16:24:13 +010084 ({ \
85 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010086 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010087 _ret = call; \
88 if (_ret < 0) { on_error; } \
89 if (!_ret) { on_wait; } \
90 } \
91 else \
92 _ret = default_ret; \
93 _ret; \
94 })
95
Christopher Fauletda02e172015-12-04 09:25:05 +010096#define FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, A, B, C, DATA_CB_IMPL, ...) \
97 DATA_CB_IMPL
Christopher Faulet3e344292015-11-24 16:24:13 +010098
Christopher Fauletda02e172015-12-04 09:25:05 +010099#define FLT_STRM_DATA_CB(strm, chn, call, ...) \
100 FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, ##__VA_ARGS__, \
101 FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, ##__VA_ARGS__), \
102 FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, ##__VA_ARGS__), \
103 FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, ##__VA_ARGS__))
Christopher Faulet3e344292015-11-24 16:24:13 +0100104
Christopher Fauletd7c91962015-04-30 11:48:27 +0200105void flt_deinit(struct proxy *p);
106int flt_check(struct proxy *p);
107
108int flt_stream_start(struct stream *s);
109void flt_stream_stop(struct stream *s);
Christopher Faulet92d36382015-11-05 13:35:03 +0100110int flt_set_stream_backend(struct stream *s, struct proxy *be);
111int flt_stream_init(struct stream *s);
112void flt_stream_release(struct stream *s, int only_backend);
Christopher Fauleta00d8172016-11-10 14:58:05 +0100113void flt_stream_check_timeouts(struct stream *s);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200114
Christopher Faulet75bc9132018-11-30 15:18:09 +0100115int flt_http_payload(struct stream *s, struct http_msg *msg, unsigned int len);
116int flt_http_end(struct stream *s, struct http_msg *msg);
117
Christopher Faulet309c6412015-12-02 09:57:32 +0100118void flt_http_reset(struct stream *s, struct http_msg *msg);
Willy Tarreau83061a82018-07-13 11:56:34 +0200119void flt_http_reply(struct stream *s, short status, const struct buffer *msg);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200120
121int flt_start_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Faulet3a394fa2016-05-11 17:13:39 +0200122int flt_pre_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
123int flt_post_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Faulet309c6412015-12-02 09:57:32 +0100124int flt_analyze_http_headers(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200125int flt_end_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
126
127int flt_xfer_data(struct stream *s, struct channel *chn, unsigned int an_bit);
128
129void flt_register_keywords(struct flt_kw_list *kwl);
130struct flt_kw *flt_find_kw(const char *kw);
131void flt_dump_kws(char **out);
Christopher Fauletb3f4e142016-03-07 12:46:38 +0100132void list_filters(FILE *out);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200133
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100134/* Helper function that returns the "global" state of filters attached to a
135 * stream. */
136static inline struct strm_flt *
137strm_flt(struct stream *s)
138{
139 return &s->strm_flt;
140}
141
Christopher Fauletda02e172015-12-04 09:25:05 +0100142/* Registers a filter to a channel. If a filter was already registered, this
143 * function do nothing. Once registered, the filter becomes a "data" filter for
144 * this channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200145static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100146register_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200147{
Christopher Fauletda02e172015-12-04 09:25:05 +0100148 if (!IS_DATA_FILTER(filter, chn)) {
149 if (chn->flags & CF_ISRESP) {
150 filter->flags |= FLT_FL_IS_RSP_DATA_FILTER;
151 strm_flt(s)->nb_rsp_data_filters++;
152 }
153 else {
154 filter->flags |= FLT_FL_IS_REQ_DATA_FILTER;
155 strm_flt(s)->nb_req_data_filters++;
156 }
157 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200158}
159
Christopher Fauletda02e172015-12-04 09:25:05 +0100160/* Unregisters a "data" filter from a channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200161static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100162unregister_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200163{
Christopher Fauletda02e172015-12-04 09:25:05 +0100164 if (IS_DATA_FILTER(filter, chn)) {
165 if (chn->flags & CF_ISRESP) {
166 filter->flags &= ~FLT_FL_IS_RSP_DATA_FILTER;
167 strm_flt(s)->nb_rsp_data_filters--;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200168
Christopher Fauletda02e172015-12-04 09:25:05 +0100169 }
170 else {
171 filter->flags &= ~FLT_FL_IS_REQ_DATA_FILTER;
172 strm_flt(s)->nb_req_data_filters--;
173 }
174 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200175}
176
Christopher Fauletd7c91962015-04-30 11:48:27 +0200177/* This function must be called when a filter alter incoming data. It updates
178 * next offset value of all filter's predecessors. Do not call this function
179 * when a filter change the size of incomding data leads to an undefined
180 * behavior.
181 *
182 * This is the filter's responsiblitiy to update data itself. For now, it is
183 * unclear to know how to handle data updates, so we do the minimum here. For
184 * example, if you filter an HTTP message, we must update msg->next and
185 * msg->chunk_len values.
186 */
187static inline void
188flt_change_next_size(struct filter *filter, struct channel *chn, int len)
189{
190 struct stream *s = chn_strm(chn);
191 struct filter *f;
192
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100193 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200194 if (f == filter)
195 break;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100196 if (IS_DATA_FILTER(filter, chn))
197 FLT_NXT(f, chn) += len;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200198 }
199}
200
201/* This function must be called when a filter alter forwarded data. It updates
202 * offset values (next and forward) of all filters. Do not call this function
203 * when a filter change the size of forwarded data leads to an undefined
204 * behavior.
205 *
206 * This is the filter's responsiblitiy to update data itself. For now, it is
207 * unclear to know how to handle data updates, so we do the minimum here. For
208 * example, if you filter an HTTP message, we must update msg->next and
209 * msg->chunk_len values.
210 */
211static inline void
212flt_change_forward_size(struct filter *filter, struct channel *chn, int len)
213{
214 struct stream *s = chn_strm(chn);
215 struct filter *f;
216 int before = 1;
217
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100218 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200219 if (f == filter)
220 before = 0;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100221 if (IS_DATA_FILTER(filter, chn)) {
222 if (before)
223 FLT_FWD(f, chn) += len;
224 FLT_NXT(f, chn) += len;
225 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200226 }
227}
228
Christopher Faulet75bc9132018-11-30 15:18:09 +0100229/* This function must be called when a filter alter payload data. It updates
230 * offsets of all previous filters and the offset of the stream. Do not call
231 * this function when a filter change the size of payload data leads to an
232 * undefined behavior.
233 *
234 * This is the filter's responsiblitiy to update data itself..
235 */
236static inline void
237flt_update_offsets(struct filter *filter, struct channel *chn, int len)
238{
239 struct stream *s = chn_strm(chn);
240 struct filter *f;
241
242 list_for_each_entry(f, &strm_flt(s)->filters, list) {
243 if (f == filter)
244 break;
245 if (IS_DATA_FILTER(filter, chn))
246 FLT_OFF(f, chn) += len;
247 }
248}
249
Christopher Fauletd7c91962015-04-30 11:48:27 +0200250
251#endif /* _PROTO_FILTERS_H */