blob: 7020285621eb5f920d50b9d359b2d353a76c3431 [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>
26#include <types/proto_http.h>
27#include <types/proxy.h>
28#include <types/stream.h>
29
30#include <proto/channel.h>
31
Christopher Faulet443ea1a2016-02-04 13:40:26 +010032#define FLT_ID(flt) (flt)->config->id
33#define FLT_CONF(flt) (flt)->config->conf
34#define FLT_OPS(flt) (flt)->config->ops
35
Christopher Fauletd7c91962015-04-30 11:48:27 +020036/* Useful macros to access per-channel values. It can be safely used inside
37 * filters. */
38#define CHN_IDX(chn) (((chn)->flags & CF_ISRESP) == CF_ISRESP)
39#define FLT_NXT(flt, chn) ((flt)->next[CHN_IDX(chn)])
40#define FLT_FWD(flt, chn) ((flt)->fwd[CHN_IDX(chn)])
Christopher Faulet3e7bc672015-12-07 13:39:08 +010041#define flt_req_nxt(flt) ((flt)->next[0])
42#define flt_rsp_nxt(flt) ((flt)->next[1])
43#define flt_req_fwd(flt) ((flt)->fwd[0])
44#define flt_rsp_fwd(flt) ((flt)->fwd[1])
Christopher Fauletd7c91962015-04-30 11:48:27 +020045
Christopher Fauletda02e172015-12-04 09:25:05 +010046#define HAS_FILTERS(strm) ((strm)->strm_flt.flags & STRM_FLT_FL_HAS_FILTERS)
Christopher Faulet3e344292015-11-24 16:24:13 +010047
Christopher Fauletda02e172015-12-04 09:25:05 +010048#define HAS_REQ_DATA_FILTERS(strm) ((strm)->strm_flt.nb_req_data_filters != 0)
49#define HAS_RSP_DATA_FILTERS(strm) ((strm)->strm_flt.nb_rsp_data_filters != 0)
50#define HAS_DATA_FILTERS(strm, chn) ((chn->flags & CF_ISRESP) ? HAS_RSP_DATA_FILTERS(strm) : HAS_REQ_DATA_FILTERS(strm))
51
52#define IS_REQ_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_REQ_DATA_FILTER)
53#define IS_RSP_DATA_FILTER(flt) ((flt)->flags & FLT_FL_IS_RSP_DATA_FILTER)
54#define IS_DATA_FILTER(flt, chn) ((chn->flags & CF_ISRESP) ? IS_RSP_DATA_FILTER(flt) : IS_REQ_DATA_FILTER(flt))
55
56#define FLT_STRM_CB(strm, call) \
Christopher Faulet3e344292015-11-24 16:24:13 +010057 do { \
58 if (HAS_FILTERS(strm)) { call; } \
59 } while (0)
Christopher Fauletda02e172015-12-04 09:25:05 +010060
61#define FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, default_ret) \
62 (HAS_DATA_FILTERS(strm, chn) ? call : default_ret)
63#define FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, default_ret, on_error) \
Christopher Faulet3e344292015-11-24 16:24:13 +010064 ({ \
65 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010066 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010067 _ret = call; \
68 if (_ret < 0) { on_error; } \
69 } \
70 else \
71 _ret = default_ret; \
72 _ret; \
73 })
Christopher Fauletda02e172015-12-04 09:25:05 +010074#define FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, default_ret, on_error, on_wait) \
Christopher Faulet3e344292015-11-24 16:24:13 +010075 ({ \
76 int _ret; \
Christopher Fauletda02e172015-12-04 09:25:05 +010077 if (HAS_DATA_FILTERS(strm, chn)) { \
Christopher Faulet3e344292015-11-24 16:24:13 +010078 _ret = call; \
79 if (_ret < 0) { on_error; } \
80 if (!_ret) { on_wait; } \
81 } \
82 else \
83 _ret = default_ret; \
84 _ret; \
85 })
86
Christopher Fauletda02e172015-12-04 09:25:05 +010087#define FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, A, B, C, DATA_CB_IMPL, ...) \
88 DATA_CB_IMPL
Christopher Faulet3e344292015-11-24 16:24:13 +010089
Christopher Fauletda02e172015-12-04 09:25:05 +010090#define FLT_STRM_DATA_CB(strm, chn, call, ...) \
91 FLT_STRM_DATA_CB_IMPL_X(strm, chn, call, ##__VA_ARGS__, \
92 FLT_STRM_DATA_CB_IMPL_3(strm, chn, call, ##__VA_ARGS__), \
93 FLT_STRM_DATA_CB_IMPL_2(strm, chn, call, ##__VA_ARGS__), \
94 FLT_STRM_DATA_CB_IMPL_1(strm, chn, call, ##__VA_ARGS__))
Christopher Faulet3e344292015-11-24 16:24:13 +010095
Christopher Fauletd7c91962015-04-30 11:48:27 +020096extern struct pool_head *pool2_filter;
97
98int flt_init(struct proxy *p);
99void flt_deinit(struct proxy *p);
100int flt_check(struct proxy *p);
101
102int flt_stream_start(struct stream *s);
103void flt_stream_stop(struct stream *s);
Christopher Faulet92d36382015-11-05 13:35:03 +0100104int flt_set_stream_backend(struct stream *s, struct proxy *be);
105int flt_stream_init(struct stream *s);
106void flt_stream_release(struct stream *s, int only_backend);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200107
Christopher Fauletd7c91962015-04-30 11:48:27 +0200108int flt_http_data(struct stream *s, struct http_msg *msg);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200109int flt_http_chunk_trailers(struct stream *s, struct http_msg *msg);
110int flt_http_end(struct stream *s, struct http_msg *msg);
Christopher Faulet309c6412015-12-02 09:57:32 +0100111int flt_http_forward_data(struct stream *s, struct http_msg *msg, unsigned int len);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200112
Christopher Faulet309c6412015-12-02 09:57:32 +0100113void flt_http_reset(struct stream *s, struct http_msg *msg);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200114void flt_http_reply(struct stream *s, short status, const struct chunk *msg);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200115
116int flt_start_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
117int flt_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Faulet309c6412015-12-02 09:57:32 +0100118int flt_analyze_http_headers(struct stream *s, struct channel *chn, unsigned int an_bit);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200119int flt_end_analyze(struct stream *s, struct channel *chn, unsigned int an_bit);
120
121int flt_xfer_data(struct stream *s, struct channel *chn, unsigned int an_bit);
122
123void flt_register_keywords(struct flt_kw_list *kwl);
124struct flt_kw *flt_find_kw(const char *kw);
125void flt_dump_kws(char **out);
Christopher Fauletb3f4e142016-03-07 12:46:38 +0100126void list_filters(FILE *out);
Christopher Fauletd7c91962015-04-30 11:48:27 +0200127
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100128/* Helper function that returns the "global" state of filters attached to a
129 * stream. */
130static inline struct strm_flt *
131strm_flt(struct stream *s)
132{
133 return &s->strm_flt;
134}
135
Christopher Fauletda02e172015-12-04 09:25:05 +0100136/* Registers a filter to a channel. If a filter was already registered, this
137 * function do nothing. Once registered, the filter becomes a "data" filter for
138 * this channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200139static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100140register_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200141{
Christopher Fauletda02e172015-12-04 09:25:05 +0100142 if (!IS_DATA_FILTER(filter, chn)) {
143 if (chn->flags & CF_ISRESP) {
144 filter->flags |= FLT_FL_IS_RSP_DATA_FILTER;
145 strm_flt(s)->nb_rsp_data_filters++;
146 }
147 else {
148 filter->flags |= FLT_FL_IS_REQ_DATA_FILTER;
149 strm_flt(s)->nb_req_data_filters++;
150 }
151 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200152}
153
Christopher Fauletda02e172015-12-04 09:25:05 +0100154/* Unregisters a "data" filter from a channel. */
Christopher Fauletd7c91962015-04-30 11:48:27 +0200155static inline void
Christopher Fauletda02e172015-12-04 09:25:05 +0100156unregister_data_filter(struct stream *s, struct channel *chn, struct filter *filter)
Christopher Fauletd7c91962015-04-30 11:48:27 +0200157{
Christopher Fauletda02e172015-12-04 09:25:05 +0100158 if (IS_DATA_FILTER(filter, chn)) {
159 if (chn->flags & CF_ISRESP) {
160 filter->flags &= ~FLT_FL_IS_RSP_DATA_FILTER;
161 strm_flt(s)->nb_rsp_data_filters--;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200162
Christopher Fauletda02e172015-12-04 09:25:05 +0100163 }
164 else {
165 filter->flags &= ~FLT_FL_IS_REQ_DATA_FILTER;
166 strm_flt(s)->nb_req_data_filters--;
167 }
168 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200169}
170
Christopher Fauletd7c91962015-04-30 11:48:27 +0200171/* This function must be called when a filter alter incoming data. It updates
172 * next offset value of all filter's predecessors. Do not call this function
173 * when a filter change the size of incomding data leads to an undefined
174 * behavior.
175 *
176 * This is the filter's responsiblitiy to update data itself. For now, it is
177 * unclear to know how to handle data updates, so we do the minimum here. For
178 * example, if you filter an HTTP message, we must update msg->next and
179 * msg->chunk_len values.
180 */
181static inline void
182flt_change_next_size(struct filter *filter, struct channel *chn, int len)
183{
184 struct stream *s = chn_strm(chn);
185 struct filter *f;
186
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100187 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200188 if (f == filter)
189 break;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100190 if (IS_DATA_FILTER(filter, chn))
191 FLT_NXT(f, chn) += len;
Christopher Fauletd7c91962015-04-30 11:48:27 +0200192 }
193}
194
195/* This function must be called when a filter alter forwarded data. It updates
196 * offset values (next and forward) of all filters. Do not call this function
197 * when a filter change the size of forwarded data leads to an undefined
198 * behavior.
199 *
200 * This is the filter's responsiblitiy to update data itself. For now, it is
201 * unclear to know how to handle data updates, so we do the minimum here. For
202 * example, if you filter an HTTP message, we must update msg->next and
203 * msg->chunk_len values.
204 */
205static inline void
206flt_change_forward_size(struct filter *filter, struct channel *chn, int len)
207{
208 struct stream *s = chn_strm(chn);
209 struct filter *f;
210 int before = 1;
211
Christopher Fauletfcf035c2015-12-03 11:48:03 +0100212 list_for_each_entry(f, &strm_flt(s)->filters, list) {
Christopher Fauletd7c91962015-04-30 11:48:27 +0200213 if (f == filter)
214 before = 0;
Christopher Faulet3e7bc672015-12-07 13:39:08 +0100215 if (IS_DATA_FILTER(filter, chn)) {
216 if (before)
217 FLT_FWD(f, chn) += len;
218 FLT_NXT(f, chn) += len;
219 }
Christopher Fauletd7c91962015-04-30 11:48:27 +0200220 }
221}
222
223
224#endif /* _PROTO_FILTERS_H */