2010-01-04 10:16:05 -05:00
|
|
|
|
/*
|
2012-04-27 15:52:18 -04:00
|
|
|
|
* Sample management functions.
|
2010-01-04 10:16:05 -05:00
|
|
|
|
*
|
|
|
|
|
|
* Copyright 2009-2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
|
2012-04-27 15:52:18 -04:00
|
|
|
|
* Copyright (C) 2012 Willy Tarreau <w@1wt.eu>
|
2010-01-04 10:16:05 -05:00
|
|
|
|
*
|
|
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
|
|
*
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
MINOR: sample: add "json" converter
This converter escapes string to use it as json/ascii escaped string.
It can read UTF-8 with differents behavior on errors and encode it in
json/ascii.
json([<input-code>])
Escapes the input string and produces an ASCII ouput string ready to use as a
JSON string. The converter tries to decode the input string according to the
<input-code> parameter. It can be "ascii", "utf8", "utf8s", "utf8"" or
"utf8ps". The "ascii" decoder never fails. The "utf8" decoder detects 3 types
of errors:
- bad UTF-8 sequence (lone continuation byte, bad number of continuation
bytes, ...)
- invalid range (the decoded value is within a UTF-8 prohibited range),
- code overlong (the value is encoded with more bytes than necessary).
The UTF-8 JSON encoding can produce a "too long value" error when the UTF-8
character is greater than 0xffff because the JSON string escape specification
only authorizes 4 hex digits for the value encoding. The UTF-8 decoder exists
in 4 variants designated by a combination of two suffix letters : "p" for
"permissive" and "s" for "silently ignore". The behaviors of the decoders
are :
- "ascii" : never fails ;
- "utf8" : fails on any detected errors ;
- "utf8s" : never fails, but removes characters corresponding to errors ;
- "utf8p" : accepts and fixes the overlong errors, but fails on any other
error ;
- "utf8ps" : never fails, accepts and fixes the overlong errors, but removes
characters corresponding to the other errors.
This converter is particularly useful for building properly escaped JSON for
logging to servers which consume JSON-formated traffic logs.
Example:
capture request header user-agent len 150
capture request header Host len 15
log-format {"ip":"%[src]","user-agent":"%[capture.req.hdr(1),json]"}
Input request from client 127.0.0.1:
GET / HTTP/1.0
User-Agent: Very "Ugly" UA 1/2
Output log:
{"ip":"127.0.0.1","user-agent":"Very \"Ugly\" UA 1\/2"}
2014-08-12 04:20:47 -04:00
|
|
|
|
#include <ctype.h>
|
2010-01-04 10:16:05 -05:00
|
|
|
|
#include <string.h>
|
|
|
|
|
|
#include <arpa/inet.h>
|
2012-09-02 16:34:23 -04:00
|
|
|
|
#include <stdio.h>
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2012-10-29 15:44:36 -04:00
|
|
|
|
#include <types/global.h>
|
|
|
|
|
|
|
2012-08-24 13:22:53 -04:00
|
|
|
|
#include <common/chunk.h>
|
2014-07-15 14:15:37 -04:00
|
|
|
|
#include <common/hash.h>
|
2012-04-27 15:52:18 -04:00
|
|
|
|
#include <common/standard.h>
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
#include <common/uri_auth.h>
|
2014-04-30 12:21:37 -04:00
|
|
|
|
#include <common/base64.h>
|
2012-04-27 15:52:18 -04:00
|
|
|
|
|
2012-04-20 08:45:49 -04:00
|
|
|
|
#include <proto/arg.h>
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
#include <proto/auth.h>
|
|
|
|
|
|
#include <proto/log.h>
|
2013-12-16 19:10:10 -05:00
|
|
|
|
#include <proto/proto_http.h>
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
#include <proto/proxy.h>
|
2012-04-27 15:52:18 -04:00
|
|
|
|
#include <proto/sample.h>
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
#include <proto/stick_table.h>
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2014-02-07 06:14:54 -05:00
|
|
|
|
/* sample type names */
|
|
|
|
|
|
const char *smp_to_type[SMP_TYPES] = {
|
2015-06-03 14:12:35 -04:00
|
|
|
|
[SMP_T_ANY] = "any",
|
2014-02-07 06:14:54 -05:00
|
|
|
|
[SMP_T_BOOL] = "bool",
|
|
|
|
|
|
[SMP_T_SINT] = "sint",
|
|
|
|
|
|
[SMP_T_ADDR] = "addr",
|
|
|
|
|
|
[SMP_T_IPV4] = "ipv4",
|
|
|
|
|
|
[SMP_T_IPV6] = "ipv6",
|
|
|
|
|
|
[SMP_T_STR] = "str",
|
|
|
|
|
|
[SMP_T_BIN] = "bin",
|
2015-06-03 14:12:04 -04:00
|
|
|
|
[SMP_T_METH] = "meth",
|
2014-02-07 06:14:54 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* static sample used in sample_process() when <p> is NULL */
|
2012-04-23 15:35:11 -04:00
|
|
|
|
static struct sample temp_smp;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* list head of all known sample fetch keywords */
|
|
|
|
|
|
static struct sample_fetch_kw_list sample_fetches = {
|
|
|
|
|
|
.list = LIST_HEAD_INIT(sample_fetches.list)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* list head of all known sample format conversion keywords */
|
|
|
|
|
|
static struct sample_conv_kw_list sample_convs = {
|
|
|
|
|
|
.list = LIST_HEAD_INIT(sample_convs.list)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
MEDIUM: samples: use new flags to describe compatibility between fetches and their usages
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.
2013-01-07 09:42:20 -05:00
|
|
|
|
const unsigned int fetch_cap[SMP_SRC_ENTRIES] = {
|
|
|
|
|
|
[SMP_SRC_INTRN] = (SMP_VAL_FE_CON_ACC | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_LISTN] = (SMP_VAL_FE_CON_ACC | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_FTEND] = (SMP_VAL_FE_CON_ACC | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L4CLI] = (SMP_VAL_FE_CON_ACC | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L5CLI] = (SMP_VAL___________ | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_TRACK] = (SMP_VAL_FE_CON_ACC | SMP_VAL_FE_SES_ACC | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L6REQ] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRQHV] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRQHP] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_FE_REQ_CNT |
|
|
|
|
|
|
SMP_VAL_FE_HRQ_HDR | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRQBO] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL_FE_HRQ_BDY | SMP_VAL_FE_SET_BCK |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_BKEND] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL_BE_REQ_CNT | SMP_VAL_BE_HRQ_HDR | SMP_VAL_BE_HRQ_BDY |
|
|
|
|
|
|
SMP_VAL_BE_SET_SRV | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_SERVR] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL_BE_SRV_CON | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L4SRV] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L5SRV] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_L6RES] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRSHV] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRSHP] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL_BE_RES_CNT |
|
|
|
|
|
|
SMP_VAL_BE_HRS_HDR | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_HRSBO] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL_BE_HRS_BDY | SMP_VAL_BE_STO_RUL |
|
|
|
|
|
|
SMP_VAL_FE_RES_CNT | SMP_VAL_FE_HRS_HDR | SMP_VAL_FE_HRS_BDY |
|
|
|
|
|
|
SMP_VAL___________),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_RQFIN] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_RSFIN] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_TXFIN] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
|
|
|
|
|
|
[SMP_SRC_SSFIN] = (SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL___________ | SMP_VAL___________ | SMP_VAL___________ |
|
|
|
|
|
|
SMP_VAL_FE_LOG_END),
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static const char *fetch_src_names[SMP_SRC_ENTRIES] = {
|
|
|
|
|
|
[SMP_SRC_INTRN] = "internal state",
|
|
|
|
|
|
[SMP_SRC_LISTN] = "listener",
|
|
|
|
|
|
[SMP_SRC_FTEND] = "frontend",
|
|
|
|
|
|
[SMP_SRC_L4CLI] = "client address",
|
|
|
|
|
|
[SMP_SRC_L5CLI] = "client-side connection",
|
|
|
|
|
|
[SMP_SRC_TRACK] = "track counters",
|
|
|
|
|
|
[SMP_SRC_L6REQ] = "request buffer",
|
|
|
|
|
|
[SMP_SRC_HRQHV] = "HTTP request headers",
|
|
|
|
|
|
[SMP_SRC_HRQHP] = "HTTP request",
|
|
|
|
|
|
[SMP_SRC_HRQBO] = "HTTP request body",
|
|
|
|
|
|
[SMP_SRC_BKEND] = "backend",
|
|
|
|
|
|
[SMP_SRC_SERVR] = "server",
|
|
|
|
|
|
[SMP_SRC_L4SRV] = "server address",
|
|
|
|
|
|
[SMP_SRC_L5SRV] = "server-side connection",
|
|
|
|
|
|
[SMP_SRC_L6RES] = "response buffer",
|
|
|
|
|
|
[SMP_SRC_HRSHV] = "HTTP response headers",
|
|
|
|
|
|
[SMP_SRC_HRSHP] = "HTTP response",
|
|
|
|
|
|
[SMP_SRC_HRSBO] = "HTTP response body",
|
|
|
|
|
|
[SMP_SRC_RQFIN] = "request buffer statistics",
|
|
|
|
|
|
[SMP_SRC_RSFIN] = "response buffer statistics",
|
|
|
|
|
|
[SMP_SRC_TXFIN] = "transaction statistics",
|
|
|
|
|
|
[SMP_SRC_SSFIN] = "session statistics",
|
|
|
|
|
|
};
|
|
|
|
|
|
|
2013-03-25 09:52:41 -04:00
|
|
|
|
static const char *fetch_ckp_names[SMP_CKP_ENTRIES] = {
|
|
|
|
|
|
[SMP_CKP_FE_CON_ACC] = "frontend tcp-request connection rule",
|
|
|
|
|
|
[SMP_CKP_FE_SES_ACC] = "frontend tcp-request session rule",
|
|
|
|
|
|
[SMP_CKP_FE_REQ_CNT] = "frontend tcp-request content rule",
|
|
|
|
|
|
[SMP_CKP_FE_HRQ_HDR] = "frontend http-request header rule",
|
|
|
|
|
|
[SMP_CKP_FE_HRQ_BDY] = "frontend http-request body rule",
|
|
|
|
|
|
[SMP_CKP_FE_SET_BCK] = "frontend use-backend rule",
|
|
|
|
|
|
[SMP_CKP_BE_REQ_CNT] = "backend tcp-request content rule",
|
|
|
|
|
|
[SMP_CKP_BE_HRQ_HDR] = "backend http-request header rule",
|
|
|
|
|
|
[SMP_CKP_BE_HRQ_BDY] = "backend http-request body rule",
|
|
|
|
|
|
[SMP_CKP_BE_SET_SRV] = "backend use-server, balance or stick-match rule",
|
|
|
|
|
|
[SMP_CKP_BE_SRV_CON] = "server source selection",
|
|
|
|
|
|
[SMP_CKP_BE_RES_CNT] = "backend tcp-response content rule",
|
|
|
|
|
|
[SMP_CKP_BE_HRS_HDR] = "backend http-response header rule",
|
|
|
|
|
|
[SMP_CKP_BE_HRS_BDY] = "backend http-response body rule",
|
|
|
|
|
|
[SMP_CKP_BE_STO_RUL] = "backend stick-store rule",
|
|
|
|
|
|
[SMP_CKP_FE_RES_CNT] = "frontend tcp-response content rule",
|
|
|
|
|
|
[SMP_CKP_FE_HRS_HDR] = "frontend http-response header rule",
|
|
|
|
|
|
[SMP_CKP_FE_HRS_BDY] = "frontend http-response body rule",
|
|
|
|
|
|
[SMP_CKP_FE_LOG_END] = "logs",
|
|
|
|
|
|
};
|
|
|
|
|
|
|
2013-11-21 04:50:10 -05:00
|
|
|
|
/* This function returns the type of the data returned by the sample_expr.
|
|
|
|
|
|
* It assumes that the <expr> and all of its converters are properly
|
|
|
|
|
|
* initialized.
|
|
|
|
|
|
*/
|
|
|
|
|
|
inline
|
|
|
|
|
|
int smp_expr_output_type(struct sample_expr *expr)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct sample_conv_expr *smp_expr;
|
|
|
|
|
|
|
|
|
|
|
|
if (!LIST_ISEMPTY(&expr->conv_exprs)) {
|
|
|
|
|
|
smp_expr = LIST_PREV(&expr->conv_exprs, struct sample_conv_expr *, list);
|
|
|
|
|
|
return smp_expr->conv->out_type;
|
|
|
|
|
|
}
|
|
|
|
|
|
return expr->fetch->out_type;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
MEDIUM: samples: use new flags to describe compatibility between fetches and their usages
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.
2013-01-07 09:42:20 -05:00
|
|
|
|
/* fill the trash with a comma-delimited list of source names for the <use> bit
|
|
|
|
|
|
* field which must be composed of a non-null set of SMP_USE_* flags. The return
|
|
|
|
|
|
* value is the pointer to the string in the trash buffer.
|
|
|
|
|
|
*/
|
|
|
|
|
|
const char *sample_src_names(unsigned int use)
|
|
|
|
|
|
{
|
|
|
|
|
|
int bit;
|
|
|
|
|
|
|
|
|
|
|
|
trash.len = 0;
|
|
|
|
|
|
trash.str[0] = '\0';
|
|
|
|
|
|
for (bit = 0; bit < SMP_SRC_ENTRIES; bit++) {
|
|
|
|
|
|
if (!(use & ~((1 << bit) - 1)))
|
|
|
|
|
|
break; /* no more bits */
|
|
|
|
|
|
|
|
|
|
|
|
if (!(use & (1 << bit)))
|
|
|
|
|
|
continue; /* bit not set */
|
|
|
|
|
|
|
|
|
|
|
|
trash.len += snprintf(trash.str + trash.len, trash.size - trash.len, "%s%s",
|
|
|
|
|
|
(use & ((1 << bit) - 1)) ? "," : "",
|
|
|
|
|
|
fetch_src_names[bit]);
|
|
|
|
|
|
}
|
|
|
|
|
|
return trash.str;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-03-25 09:52:41 -04:00
|
|
|
|
/* return a pointer to the correct sample checkpoint name, or "unknown" when
|
|
|
|
|
|
* the flags are invalid. Only the lowest bit is used, higher bits are ignored
|
|
|
|
|
|
* if set.
|
|
|
|
|
|
*/
|
|
|
|
|
|
const char *sample_ckp_names(unsigned int use)
|
|
|
|
|
|
{
|
|
|
|
|
|
int bit;
|
|
|
|
|
|
|
|
|
|
|
|
for (bit = 0; bit < SMP_CKP_ENTRIES; bit++)
|
|
|
|
|
|
if (use & (1 << bit))
|
|
|
|
|
|
return fetch_ckp_names[bit];
|
|
|
|
|
|
return "unknown sample check place, please report this bug";
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*
|
MEDIUM: samples: use new flags to describe compatibility between fetches and their usages
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.
2013-01-07 09:42:20 -05:00
|
|
|
|
* Registers the sample fetch keyword list <kwl> as a list of valid keywords
|
|
|
|
|
|
* for next parsing sessions. The fetch keywords capabilities are also computed
|
|
|
|
|
|
* from their ->use field.
|
2010-01-04 10:16:05 -05:00
|
|
|
|
*/
|
MEDIUM: samples: use new flags to describe compatibility between fetches and their usages
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.
2013-01-07 09:42:20 -05:00
|
|
|
|
void sample_register_fetches(struct sample_fetch_kw_list *kwl)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
MEDIUM: samples: use new flags to describe compatibility between fetches and their usages
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.
2013-01-07 09:42:20 -05:00
|
|
|
|
struct sample_fetch *sf;
|
|
|
|
|
|
int bit;
|
|
|
|
|
|
|
|
|
|
|
|
for (sf = kwl->kw; sf->kw != NULL; sf++) {
|
|
|
|
|
|
for (bit = 0; bit < SMP_SRC_ENTRIES; bit++)
|
|
|
|
|
|
if (sf->use & (1 << bit))
|
|
|
|
|
|
sf->val |= fetch_cap[bit];
|
|
|
|
|
|
}
|
|
|
|
|
|
LIST_ADDQ(&sample_fetches.list, &kwl->list);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Registers the sample format coverstion keyword list <pckl> as a list of valid keywords for next
|
2010-01-04 10:16:05 -05:00
|
|
|
|
* parsing sessions.
|
|
|
|
|
|
*/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
void sample_register_convs(struct sample_conv_kw_list *pckl)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2012-04-27 15:37:17 -04:00
|
|
|
|
LIST_ADDQ(&sample_convs.list, &pckl->list);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Returns the pointer on sample fetch keyword structure identified by
|
2010-01-04 10:16:05 -05:00
|
|
|
|
* string of <len> in buffer <kw>.
|
|
|
|
|
|
*
|
|
|
|
|
|
*/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_fetch *find_sample_fetch(const char *kw, int len)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
int index;
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_fetch_kw_list *kwl;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
list_for_each_entry(kwl, &sample_fetches.list, list) {
|
2010-01-04 10:16:05 -05:00
|
|
|
|
for (index = 0; kwl->kw[index].kw != NULL; index++) {
|
|
|
|
|
|
if (strncmp(kwl->kw[index].kw, kw, len) == 0 &&
|
|
|
|
|
|
kwl->kw[index].kw[len] == '\0')
|
|
|
|
|
|
return &kwl->kw[index];
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return NULL;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-12-08 08:49:19 -05:00
|
|
|
|
/* This fucntion browse the list of available saple fetch. <current> is
|
|
|
|
|
|
* the last used sample fetch. If it is the first call, it must set to NULL.
|
|
|
|
|
|
* <idx> is the index of the next sample<EFBFBD>fetch entry. It is used as private
|
|
|
|
|
|
* value. It is useles to initiate it.
|
|
|
|
|
|
*
|
|
|
|
|
|
* It returns always the newt fetch_sample entry, and NULL when the end of
|
|
|
|
|
|
* the list is reached.
|
|
|
|
|
|
*/
|
|
|
|
|
|
struct sample_fetch *sample_fetch_getnext(struct sample_fetch *current, int *idx)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct sample_fetch_kw_list *kwl;
|
|
|
|
|
|
struct sample_fetch *base;
|
|
|
|
|
|
|
|
|
|
|
|
if (!current) {
|
|
|
|
|
|
/* Get first kwl entry. */
|
|
|
|
|
|
kwl = LIST_NEXT(&sample_fetches.list, struct sample_fetch_kw_list *, list);
|
|
|
|
|
|
(*idx) = 0;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
/* Get kwl corresponding to the curret entry. */
|
|
|
|
|
|
base = current + 1 - (*idx);
|
|
|
|
|
|
kwl = container_of(base, struct sample_fetch_kw_list, kw);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
|
|
|
|
|
|
|
|
/* Check if kwl is the last entry. */
|
|
|
|
|
|
if (&kwl->list == &sample_fetches.list)
|
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
|
|
/* idx contain the next keyword. If it is available, return it. */
|
|
|
|
|
|
if (kwl->kw[*idx].kw) {
|
|
|
|
|
|
(*idx)++;
|
|
|
|
|
|
return &kwl->kw[(*idx)-1];
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* get next entry in the main list, and return NULL if the end is reached. */
|
|
|
|
|
|
kwl = LIST_NEXT(&kwl->list, struct sample_fetch_kw_list *, list);
|
|
|
|
|
|
|
|
|
|
|
|
/* Set index to 0, ans do one other loop. */
|
|
|
|
|
|
(*idx) = 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-03-10 18:56:48 -04:00
|
|
|
|
/* This function browses the list of available converters. <current> is
|
|
|
|
|
|
* the last used converter. If it is the first call, it must set to NULL.
|
|
|
|
|
|
* <idx> is the index of the next converter entry. It is used as private
|
|
|
|
|
|
* value. It is useless to initiate it.
|
|
|
|
|
|
*
|
|
|
|
|
|
* It returns always the next sample_conv entry, and NULL when the end of
|
|
|
|
|
|
* the list is reached.
|
|
|
|
|
|
*/
|
|
|
|
|
|
struct sample_conv *sample_conv_getnext(struct sample_conv *current, int *idx)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct sample_conv_kw_list *kwl;
|
|
|
|
|
|
struct sample_conv *base;
|
|
|
|
|
|
|
|
|
|
|
|
if (!current) {
|
|
|
|
|
|
/* Get first kwl entry. */
|
|
|
|
|
|
kwl = LIST_NEXT(&sample_convs.list, struct sample_conv_kw_list *, list);
|
|
|
|
|
|
(*idx) = 0;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
/* Get kwl corresponding to the curret entry. */
|
|
|
|
|
|
base = current + 1 - (*idx);
|
|
|
|
|
|
kwl = container_of(base, struct sample_conv_kw_list, kw);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
|
|
/* Check if kwl is the last entry. */
|
|
|
|
|
|
if (&kwl->list == &sample_convs.list)
|
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
|
|
/* idx contain the next keyword. If it is available, return it. */
|
|
|
|
|
|
if (kwl->kw[*idx].kw) {
|
|
|
|
|
|
(*idx)++;
|
|
|
|
|
|
return &kwl->kw[(*idx)-1];
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* get next entry in the main list, and return NULL if the end is reached. */
|
|
|
|
|
|
kwl = LIST_NEXT(&kwl->list, struct sample_conv_kw_list *, list);
|
|
|
|
|
|
|
|
|
|
|
|
/* Set index to 0, ans do one other loop. */
|
|
|
|
|
|
(*idx) = 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Returns the pointer on sample format conversion keyword structure identified by
|
2010-01-04 10:16:05 -05:00
|
|
|
|
* string of <len> in buffer <kw>.
|
|
|
|
|
|
*
|
|
|
|
|
|
*/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_conv *find_sample_conv(const char *kw, int len)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
int index;
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_conv_kw_list *kwl;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
list_for_each_entry(kwl, &sample_convs.list, list) {
|
2010-01-04 10:16:05 -05:00
|
|
|
|
for (index = 0; kwl->kw[index].kw != NULL; index++) {
|
|
|
|
|
|
if (strncmp(kwl->kw[index].kw, kw, len) == 0 &&
|
|
|
|
|
|
kwl->kw[index].kw[len] == '\0')
|
|
|
|
|
|
return &kwl->kw[index];
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return NULL;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/******************************************************************/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* Sample casts functions */
|
2012-04-23 16:38:26 -04:00
|
|
|
|
/* Note: these functions do *NOT* set the output type on the */
|
|
|
|
|
|
/* sample, the caller is responsible for doing this on return. */
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/******************************************************************/
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_ip2int(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = ntohl(smp->data.ipv4.s_addr);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_ip2str(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2012-12-23 14:22:19 -05:00
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
if (!inet_ntop(AF_INET, (void *)&smp->data.ipv4, trash->str, trash->size))
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
trash->len = strlen(trash->str);
|
2012-04-23 16:03:39 -04:00
|
|
|
|
smp->data.str = *trash;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_STR;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_ip2ipv6(struct sample *smp)
|
2011-03-24 06:09:31 -04:00
|
|
|
|
{
|
2012-04-23 16:03:39 -04:00
|
|
|
|
v4tov6(&smp->data.ipv6, &smp->data.ipv4);
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_IPV6;
|
2011-03-24 06:09:31 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_ipv62str(struct sample *smp)
|
2011-03-24 06:09:31 -04:00
|
|
|
|
{
|
2012-12-23 14:22:19 -05:00
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
2011-03-24 06:09:31 -04:00
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
if (!inet_ntop(AF_INET6, (void *)&smp->data.ipv6, trash->str, trash->size))
|
2011-03-24 06:09:31 -04:00
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
trash->len = strlen(trash->str);
|
2012-04-23 16:03:39 -04:00
|
|
|
|
smp->data.str = *trash;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_STR;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2011-03-24 06:09:31 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_ipv62ip(struct sample *smp)
|
2011-03-24 06:09:31 -04:00
|
|
|
|
{
|
2012-04-23 16:03:39 -04:00
|
|
|
|
return v6tov4(&smp->data.ipv4, &smp->data.ipv6);
|
2011-03-24 06:09:31 -04:00
|
|
|
|
}
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_int2ip(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.ipv4.s_addr = htonl((unsigned int)smp->data.sint);
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_IPV4;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int c_str2addr(struct sample *smp)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (!buf2ip(smp->data.str.str, smp->data.str.len, &smp->data.ipv4)) {
|
2013-12-11 06:38:57 -05:00
|
|
|
|
if (!buf2ip6(smp->data.str.str, smp->data.str.len, &smp->data.ipv6))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
smp->type = SMP_T_IPV6;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2013-12-11 06:38:57 -05:00
|
|
|
|
return 1;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
}
|
|
|
|
|
|
smp->type = SMP_T_IPV4;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_str2ip(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2012-04-23 16:03:39 -04:00
|
|
|
|
if (!buf2ip(smp->data.str.str, smp->data.str.len, &smp->data.ipv4))
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 0;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_IPV4;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_str2ipv6(struct sample *smp)
|
2011-03-24 06:09:31 -04:00
|
|
|
|
{
|
2013-12-11 06:38:57 -05:00
|
|
|
|
if (!buf2ip6(smp->data.str.str, smp->data.str.len, &smp->data.ipv6))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
smp->type = SMP_T_IPV6;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2013-12-11 06:38:57 -05:00
|
|
|
|
return 1;
|
2011-03-24 06:09:31 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-03 12:17:10 -05:00
|
|
|
|
/*
|
|
|
|
|
|
* The NULL char always enforces the end of string if it is met.
|
|
|
|
|
|
* Data is never changed, so we can ignore the CONST case
|
MEDIUM: sample: change the behavior of the bin2str cast
The bin2str cast gives the hexadecimal representation of the binary
content when it is used as string. This was inherited from the
stick-table casts without realizing that it was a mistake. Indeed,
it breaks string processing on binary contents, preventing any _reg,
_beg, etc from working.
For example, with an HTTP GET request, the fetch "req.payload(0,3)"
returns the 3 bytes "G", "E", and "T" in binary. If this fetch is
used with regex, it is automatically converted to "474554" and the
regex is applied on this string, so it never matches.
This commit changes the cast so that bin2str does not convert the
contents anymore, and returns a string type. The contents can thus
be matched as is, and the NULL character continues to mark the end
of the string to avoid any issue with some string-based functions.
This commit could almost have been marked as a bug fix since it
does what the doc says.
Note that in case someone would rely on the hex encoding, then the
same behaviour could be achieved by appending ",hex" after the sample
fetch function (brought by previous patch).
2014-03-12 10:07:59 -04:00
|
|
|
|
*/
|
2012-10-17 07:36:06 -04:00
|
|
|
|
static int c_bin2str(struct sample *smp)
|
|
|
|
|
|
{
|
2014-11-03 12:17:10 -05:00
|
|
|
|
int i;
|
2012-10-17 07:36:06 -04:00
|
|
|
|
|
2014-11-03 12:17:10 -05:00
|
|
|
|
for (i = 0; i < smp->data.str.len; i++) {
|
|
|
|
|
|
if (!smp->data.str.str[i]) {
|
|
|
|
|
|
smp->data.str.len = i;
|
MEDIUM: sample: change the behavior of the bin2str cast
The bin2str cast gives the hexadecimal representation of the binary
content when it is used as string. This was inherited from the
stick-table casts without realizing that it was a mistake. Indeed,
it breaks string processing on binary contents, preventing any _reg,
_beg, etc from working.
For example, with an HTTP GET request, the fetch "req.payload(0,3)"
returns the 3 bytes "G", "E", and "T" in binary. If this fetch is
used with regex, it is automatically converted to "474554" and the
regex is applied on this string, so it never matches.
This commit changes the cast so that bin2str does not convert the
contents anymore, and returns a string type. The contents can thus
be matched as is, and the NULL character continues to mark the end
of the string to avoid any issue with some string-based functions.
This commit could almost have been marked as a bug fix since it
does what the doc says.
Note that in case someone would rely on the hex encoding, then the
same behaviour could be achieved by appending ",hex" after the sample
fetch function (brought by previous patch).
2014-03-12 10:07:59 -04:00
|
|
|
|
break;
|
2014-11-03 12:17:10 -05:00
|
|
|
|
}
|
2012-10-17 07:36:06 -04:00
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_int2str(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2012-12-23 14:22:19 -05:00
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
2010-01-04 10:16:05 -05:00
|
|
|
|
char *pos;
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
pos = lltoa_r(smp->data.sint, trash->str, trash->size);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
if (!pos)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
2010-09-23 12:02:19 -04:00
|
|
|
|
trash->size = trash->size - (pos - trash->str);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
trash->str = pos;
|
|
|
|
|
|
trash->len = strlen(pos);
|
2012-04-23 16:03:39 -04:00
|
|
|
|
smp->data.str = *trash;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
smp->type = SMP_T_STR;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
/* This function duplicates data and removes the flag "const". */
|
|
|
|
|
|
int smp_dup(struct sample *smp)
|
2010-09-23 12:02:19 -04:00
|
|
|
|
{
|
2013-12-16 18:20:33 -05:00
|
|
|
|
struct chunk *trash;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
/* If the const flag is not set, we don't need to duplicate the
|
|
|
|
|
|
* pattern as it can be modified in place.
|
|
|
|
|
|
*/
|
|
|
|
|
|
if (!(smp->flags & SMP_F_CONST))
|
|
|
|
|
|
return 1;
|
2013-11-26 14:47:54 -05:00
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
switch (smp->type) {
|
|
|
|
|
|
case SMP_T_BOOL:
|
|
|
|
|
|
case SMP_T_SINT:
|
|
|
|
|
|
case SMP_T_ADDR:
|
|
|
|
|
|
case SMP_T_IPV4:
|
|
|
|
|
|
case SMP_T_IPV6:
|
|
|
|
|
|
/* These type are not const. */
|
|
|
|
|
|
break;
|
|
|
|
|
|
case SMP_T_STR:
|
|
|
|
|
|
case SMP_T_BIN:
|
|
|
|
|
|
/* Duplicate data. */
|
|
|
|
|
|
trash = get_trash_chunk();
|
|
|
|
|
|
trash->len = smp->data.str.len < trash->size ? smp->data.str.len : trash->size;
|
|
|
|
|
|
memcpy(trash->str, smp->data.str.str, trash->len);
|
|
|
|
|
|
smp->data.str = *trash;
|
|
|
|
|
|
break;
|
|
|
|
|
|
default:
|
|
|
|
|
|
/* Other cases are unexpected. */
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
2013-11-26 14:47:54 -05:00
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
/* remove const flag */
|
|
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-12-14 08:55:04 -05:00
|
|
|
|
int c_none(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
static int c_str2int(struct sample *smp)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
const char *str;
|
|
|
|
|
|
const char *end;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2014-01-27 12:20:48 -05:00
|
|
|
|
if (smp->data.str.len == 0)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
str = smp->data.str.str;
|
|
|
|
|
|
end = smp->data.str.str + smp->data.str.len;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = read_int64(&str, end);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-12-16 19:10:10 -05:00
|
|
|
|
static int c_str2meth(struct sample *smp)
|
|
|
|
|
|
{
|
|
|
|
|
|
enum http_meth_t meth;
|
|
|
|
|
|
int len;
|
|
|
|
|
|
|
|
|
|
|
|
meth = find_http_meth(smp->data.str.str, smp->data.str.len);
|
|
|
|
|
|
if (meth == HTTP_METH_OTHER) {
|
|
|
|
|
|
len = smp->data.str.len;
|
|
|
|
|
|
smp->data.meth.str.str = smp->data.str.str;
|
|
|
|
|
|
smp->data.meth.str.len = len;
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
|
|
|
|
|
smp->data.meth.meth = meth;
|
|
|
|
|
|
smp->type = SMP_T_METH;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int c_meth2str(struct sample *smp)
|
|
|
|
|
|
{
|
|
|
|
|
|
int len;
|
|
|
|
|
|
enum http_meth_t meth;
|
|
|
|
|
|
|
|
|
|
|
|
if (smp->data.meth.meth == HTTP_METH_OTHER) {
|
|
|
|
|
|
/* The method is unknown. Copy the original pointer. */
|
|
|
|
|
|
len = smp->data.meth.str.len;
|
|
|
|
|
|
smp->data.str.str = smp->data.meth.str.str;
|
|
|
|
|
|
smp->data.str.len = len;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (smp->data.meth.meth < HTTP_METH_OTHER) {
|
|
|
|
|
|
/* The method is known, copy the pointer containing the string. */
|
|
|
|
|
|
meth = smp->data.meth.meth;
|
|
|
|
|
|
smp->data.str.str = http_known_methods[meth].name;
|
|
|
|
|
|
smp->data.str.len = http_known_methods[meth].len;
|
|
|
|
|
|
smp->flags |= SMP_F_CONST;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
}
|
|
|
|
|
|
else {
|
|
|
|
|
|
/* Unknown method */
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 15:03:26 -04:00
|
|
|
|
static int c_addr2bin(struct sample *smp)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct chunk *chk = get_trash_chunk();
|
|
|
|
|
|
|
|
|
|
|
|
if (smp->type == SMP_T_IPV4) {
|
|
|
|
|
|
chk->len = 4;
|
|
|
|
|
|
memcpy(chk->str, &smp->data.ipv4, chk->len);
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (smp->type == SMP_T_IPV6) {
|
|
|
|
|
|
chk->len = 16;
|
|
|
|
|
|
memcpy(chk->str, &smp->data.ipv6, chk->len);
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
smp->data.str = *chk;
|
|
|
|
|
|
smp->type = SMP_T_BIN;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 15:19:08 -04:00
|
|
|
|
static int c_int2bin(struct sample *smp)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct chunk *chk = get_trash_chunk();
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
*(unsigned long long int *)chk->str = htonll(smp->data.sint);
|
|
|
|
|
|
chk->len = 8;
|
2014-07-15 15:19:08 -04:00
|
|
|
|
|
|
|
|
|
|
smp->data.str = *chk;
|
|
|
|
|
|
smp->type = SMP_T_BIN;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 15:03:26 -04:00
|
|
|
|
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*****************************************************************/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* Sample casts matrix: */
|
|
|
|
|
|
/* sample_casts[from type][to type] */
|
|
|
|
|
|
/* NULL pointer used for impossible sample casts */
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*****************************************************************/
|
|
|
|
|
|
|
2013-11-21 04:53:12 -05:00
|
|
|
|
sample_cast_fct sample_casts[SMP_TYPES][SMP_TYPES] = {
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* to: ANY BOOL SINT ADDR IPV4 IPV6 STR BIN METH */
|
|
|
|
|
|
/* from: ANY */ { c_none, c_none, c_none, c_none, c_none, c_none, c_none, c_none, c_none, },
|
|
|
|
|
|
/* BOOL */ { c_none, c_none, c_none, NULL, NULL, NULL, c_int2str, NULL, NULL, },
|
|
|
|
|
|
/* SINT */ { c_none, c_none, c_none, c_int2ip, c_int2ip, NULL, c_int2str, c_int2bin, NULL, },
|
|
|
|
|
|
/* ADDR */ { c_none, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, },
|
|
|
|
|
|
/* IPV4 */ { c_none, NULL, c_ip2int, c_none, c_none, c_ip2ipv6, c_ip2str, c_addr2bin, NULL, },
|
|
|
|
|
|
/* IPV6 */ { c_none, NULL, NULL, c_none, NULL, c_none, c_ipv62str, c_addr2bin, NULL, },
|
|
|
|
|
|
/* STR */ { c_none, c_str2int, c_str2int, c_str2addr, c_str2ip, c_str2ipv6, c_none, c_none, c_str2meth, },
|
|
|
|
|
|
/* BIN */ { c_none, NULL, NULL, NULL, NULL, NULL, c_bin2str, c_none, c_str2meth, },
|
|
|
|
|
|
/* METH */ { c_none, NULL, NULL, NULL, NULL, NULL, c_meth2str, c_meth2str, c_none, }
|
2010-06-06 07:22:23 -04:00
|
|
|
|
};
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
/*
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Parse a sample expression configuration:
|
2010-01-04 10:16:05 -05:00
|
|
|
|
* fetch keyword followed by format conversion keywords.
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Returns a pointer on allocated sample expression structure.
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
* The caller must have set al->ctx.
|
2010-01-04 10:16:05 -05:00
|
|
|
|
*/
|
2014-02-11 08:00:19 -05:00
|
|
|
|
struct sample_expr *sample_parse_expr(char **str, int *idx, const char *file, int line, char **err_msg, struct arg_list *al)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2013-07-24 09:34:19 -04:00
|
|
|
|
const char *begw; /* beginning of word */
|
|
|
|
|
|
const char *endw; /* end of word */
|
|
|
|
|
|
const char *endt; /* end of term */
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_expr *expr;
|
|
|
|
|
|
struct sample_fetch *fetch;
|
|
|
|
|
|
struct sample_conv *conv;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
unsigned long prev_type;
|
2013-07-24 09:34:19 -04:00
|
|
|
|
char *fkw = NULL;
|
|
|
|
|
|
char *ckw = NULL;
|
2013-12-12 18:40:11 -05:00
|
|
|
|
int err_arg;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
begw = str[*idx];
|
|
|
|
|
|
for (endw = begw; *endw && *endw != '(' && *endw != ','; endw++);
|
|
|
|
|
|
|
|
|
|
|
|
if (endw == begw) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "missing fetch method");
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
/* keep a copy of the current fetch keyword for error reporting */
|
|
|
|
|
|
fkw = my_strndup(begw, endw - begw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
fetch = find_sample_fetch(begw, endw - begw);
|
|
|
|
|
|
if (!fetch) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "unknown fetch method '%s'", fkw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
endt = endw;
|
|
|
|
|
|
if (*endt == '(') {
|
2013-12-12 18:40:11 -05:00
|
|
|
|
/* look for the end of this term and skip the opening parenthesis */
|
|
|
|
|
|
endt = ++endw;
|
2013-07-24 09:34:19 -04:00
|
|
|
|
while (*endt && *endt != ')')
|
|
|
|
|
|
endt++;
|
|
|
|
|
|
if (*endt != ')') {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "missing closing ')' after arguments to fetch keyword '%s'", fkw);
|
2013-07-24 09:34:19 -04:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
/* At this point, we have :
|
|
|
|
|
|
* - begw : beginning of the keyword
|
2013-12-12 18:40:11 -05:00
|
|
|
|
* - endw : end of the keyword, first character not part of keyword
|
|
|
|
|
|
* nor the opening parenthesis (so first character of args
|
|
|
|
|
|
* if present).
|
2013-07-24 09:34:19 -04:00
|
|
|
|
* - endt : end of the term (=endw or last parenthesis if args are present)
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
if (fetch->out_type >= SMP_TYPES) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "returns type of fetch method '%s' is unknown", fkw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
prev_type = fetch->out_type;
|
2013-07-24 09:34:19 -04:00
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
expr = calloc(1, sizeof(struct sample_expr));
|
2010-09-23 12:02:19 -04:00
|
|
|
|
if (!expr)
|
|
|
|
|
|
goto out_error;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
LIST_INIT(&(expr->conv_exprs));
|
|
|
|
|
|
expr->fetch = fetch;
|
2012-10-19 13:49:09 -04:00
|
|
|
|
expr->arg_p = empty_arg_list;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-12-12 18:40:11 -05:00
|
|
|
|
/* Note that we call the argument parser even with an empty string,
|
|
|
|
|
|
* this allows it to automatically create entries for mandatory
|
|
|
|
|
|
* implicit arguments (eg: local proxy name).
|
|
|
|
|
|
*/
|
|
|
|
|
|
al->kw = expr->fetch->kw;
|
|
|
|
|
|
al->conv = NULL;
|
|
|
|
|
|
if (make_arg_list(endw, endt - endw, fetch->arg_mask, &expr->arg_p, err_msg, NULL, &err_arg, al) < 0) {
|
|
|
|
|
|
memprintf(err_msg, "fetch method '%s' : %s", fkw, *err_msg);
|
|
|
|
|
|
goto out_error;
|
|
|
|
|
|
}
|
2012-10-19 13:49:09 -04:00
|
|
|
|
|
2013-12-12 18:40:11 -05:00
|
|
|
|
if (!expr->arg_p) {
|
|
|
|
|
|
expr->arg_p = empty_arg_list;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2013-12-12 18:40:11 -05:00
|
|
|
|
else if (fetch->val_args && !fetch->val_args(expr->arg_p, err_msg)) {
|
|
|
|
|
|
memprintf(err_msg, "invalid args in fetch method '%s' : %s", fkw, *err_msg);
|
2010-09-23 12:02:19 -04:00
|
|
|
|
goto out_error;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
/* Now process the converters if any. We have two supported syntaxes
|
|
|
|
|
|
* for the converters, which can be combined :
|
|
|
|
|
|
* - comma-delimited list of converters just after the keyword and args ;
|
|
|
|
|
|
* - one converter per keyword
|
|
|
|
|
|
* The combination allows to have each keyword being a comma-delimited
|
|
|
|
|
|
* series of converters.
|
|
|
|
|
|
*
|
|
|
|
|
|
* We want to process the former first, then the latter. For this we start
|
|
|
|
|
|
* from the beginning of the supposed place in the exiting conv chain, which
|
|
|
|
|
|
* starts at the last comma (endt).
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
while (1) {
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_conv_expr *conv_expr;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
if (*endt == ')') /* skip last closing parenthesis */
|
|
|
|
|
|
endt++;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
if (*endt && *endt != ',') {
|
|
|
|
|
|
if (ckw)
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "missing comma after conv keyword '%s'", ckw);
|
2013-07-24 09:34:19 -04:00
|
|
|
|
else
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "missing comma after fetch keyword '%s'", fkw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
while (*endt == ',') /* then trailing commas */
|
|
|
|
|
|
endt++;
|
|
|
|
|
|
|
|
|
|
|
|
begw = endt; /* start of conv keyword */
|
|
|
|
|
|
|
|
|
|
|
|
if (!*begw) {
|
|
|
|
|
|
/* none ? skip to next string */
|
|
|
|
|
|
(*idx)++;
|
|
|
|
|
|
begw = str[*idx];
|
|
|
|
|
|
if (!begw || !*begw)
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
for (endw = begw; *endw && *endw != '(' && *endw != ','; endw++);
|
|
|
|
|
|
|
|
|
|
|
|
free(ckw);
|
|
|
|
|
|
ckw = my_strndup(begw, endw - begw);
|
|
|
|
|
|
|
|
|
|
|
|
conv = find_sample_conv(begw, endw - begw);
|
|
|
|
|
|
if (!conv) {
|
|
|
|
|
|
/* we found an isolated keyword that we don't know, it's not ours */
|
|
|
|
|
|
if (begw == str[*idx])
|
|
|
|
|
|
break;
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "unknown conv method '%s'", ckw);
|
2013-07-24 09:34:19 -04:00
|
|
|
|
goto out_error;
|
|
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
endt = endw;
|
|
|
|
|
|
if (*endt == '(') {
|
|
|
|
|
|
/* look for the end of this term */
|
|
|
|
|
|
while (*endt && *endt != ')')
|
|
|
|
|
|
endt++;
|
|
|
|
|
|
if (*endt != ')') {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "syntax error: missing ')' after conv keyword '%s'", ckw);
|
2013-07-24 09:34:19 -04:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2013-07-24 09:34:19 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (conv->in_type >= SMP_TYPES || conv->out_type >= SMP_TYPES) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "returns type of conv method '%s' is unknown", ckw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
/* If impossible type conversion */
|
2012-04-27 15:37:17 -04:00
|
|
|
|
if (!sample_casts[prev_type][conv->in_type]) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "conv method '%s' cannot be applied", ckw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
goto out_error;
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
prev_type = conv->out_type;
|
2012-04-27 15:37:17 -04:00
|
|
|
|
conv_expr = calloc(1, sizeof(struct sample_conv_expr));
|
2010-09-23 12:02:19 -04:00
|
|
|
|
if (!conv_expr)
|
|
|
|
|
|
goto out_error;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
|
|
|
|
|
LIST_ADDQ(&(expr->conv_exprs), &(conv_expr->list));
|
|
|
|
|
|
conv_expr->conv = conv;
|
|
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
if (endt != endw) {
|
2012-04-20 10:04:47 -04:00
|
|
|
|
int err_arg;
|
2012-04-20 09:52:36 -04:00
|
|
|
|
|
2012-04-20 08:45:49 -04:00
|
|
|
|
if (!conv->arg_mask) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "conv method '%s' does not support any args", ckw);
|
2010-09-23 12:02:19 -04:00
|
|
|
|
goto out_error;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
al->kw = expr->fetch->kw;
|
|
|
|
|
|
al->conv = conv_expr->conv->kw;
|
2013-12-12 17:16:54 -05:00
|
|
|
|
if (make_arg_list(endw + 1, endt - endw - 1, conv->arg_mask, &conv_expr->arg_p, err_msg, NULL, &err_arg, al) < 0) {
|
|
|
|
|
|
memprintf(err_msg, "invalid arg %d in conv method '%s' : %s", err_arg+1, ckw, *err_msg);
|
2010-09-23 12:02:19 -04:00
|
|
|
|
goto out_error;
|
|
|
|
|
|
}
|
2012-04-20 09:52:36 -04:00
|
|
|
|
|
2012-10-19 13:49:09 -04:00
|
|
|
|
if (!conv_expr->arg_p)
|
|
|
|
|
|
conv_expr->arg_p = empty_arg_list;
|
|
|
|
|
|
|
2014-02-11 08:00:19 -05:00
|
|
|
|
if (conv->val_args && !conv->val_args(conv_expr->arg_p, conv, file, line, err_msg)) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "invalid args in conv method '%s' : %s", ckw, *err_msg);
|
2012-04-20 09:52:36 -04:00
|
|
|
|
goto out_error;
|
|
|
|
|
|
}
|
2010-09-23 12:02:19 -04:00
|
|
|
|
}
|
2013-07-24 09:34:19 -04:00
|
|
|
|
else if (ARGM(conv->arg_mask)) {
|
2013-12-12 17:16:54 -05:00
|
|
|
|
memprintf(err_msg, "missing args for conv method '%s'", ckw);
|
2010-09-23 12:02:19 -04:00
|
|
|
|
goto out_error;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2010-09-23 12:02:19 -04:00
|
|
|
|
|
2013-07-24 09:34:19 -04:00
|
|
|
|
out:
|
|
|
|
|
|
free(fkw);
|
|
|
|
|
|
free(ckw);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return expr;
|
|
|
|
|
|
|
|
|
|
|
|
out_error:
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* TODO: prune_sample_expr(expr); */
|
2013-07-24 09:34:19 -04:00
|
|
|
|
expr = NULL;
|
|
|
|
|
|
goto out;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Process a fetch + format conversion of defined by the sample expression <expr>
|
2012-04-25 04:13:36 -04:00
|
|
|
|
* on request or response considering the <opt> parameter.
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* Returns a pointer on a typed sample structure containing the result or NULL if
|
|
|
|
|
|
* sample is not found or when format conversion failed.
|
2010-01-04 10:16:05 -05:00
|
|
|
|
* If <p> is not null, function returns results in structure pointed by <p>.
|
2012-04-27 15:37:17 -04:00
|
|
|
|
* If <p> is null, functions returns a pointer on a static sample structure.
|
2012-04-23 16:38:26 -04:00
|
|
|
|
*
|
|
|
|
|
|
* Note: the fetch functions are required to properly set the return type. The
|
|
|
|
|
|
* conversion functions must do so too. However the cast functions do not need
|
|
|
|
|
|
* to since they're made to cast mutiple types according to what is required.
|
2014-07-30 02:56:35 -04:00
|
|
|
|
*
|
|
|
|
|
|
* The caller may indicate in <opt> if it considers the result final or not.
|
|
|
|
|
|
* The caller needs to check the SMP_F_MAY_CHANGE flag in p->flags to verify
|
|
|
|
|
|
* if the result is stable or not, according to the following table :
|
|
|
|
|
|
*
|
|
|
|
|
|
* return MAY_CHANGE FINAL Meaning for the sample
|
|
|
|
|
|
* NULL 0 * Not present and will never be (eg: header)
|
|
|
|
|
|
* NULL 1 0 Not present yet, could change (eg: POST param)
|
|
|
|
|
|
* NULL 1 1 Not present yet, will not change anymore
|
|
|
|
|
|
* smp 0 * Present and will not change (eg: header)
|
|
|
|
|
|
* smp 1 0 Present, may change (eg: request length)
|
|
|
|
|
|
* smp 1 1 Present, last known value (eg: request length)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
*/
|
2015-04-03 19:47:55 -04:00
|
|
|
|
struct sample *sample_process(struct proxy *px, struct session *sess,
|
|
|
|
|
|
struct stream *strm, unsigned int opt,
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_expr *expr, struct sample *p)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2012-04-27 15:37:17 -04:00
|
|
|
|
struct sample_conv_expr *conv_expr;
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2013-07-25 06:02:38 -04:00
|
|
|
|
if (p == NULL) {
|
2012-04-23 15:35:11 -04:00
|
|
|
|
p = &temp_smp;
|
2014-06-25 10:56:41 -04:00
|
|
|
|
memset(p, 0, sizeof(*p));
|
2013-07-25 06:02:38 -04:00
|
|
|
|
}
|
2010-01-04 10:16:05 -05:00
|
|
|
|
|
2015-05-11 05:54:58 -04:00
|
|
|
|
p->px = px;
|
|
|
|
|
|
p->sess = sess;
|
|
|
|
|
|
p->strm = strm;
|
2015-05-11 09:25:29 -04:00
|
|
|
|
p->opt = opt;
|
2015-05-11 09:42:45 -04:00
|
|
|
|
if (!expr->fetch->process(expr->arg_p, p, expr->fetch->kw, expr->fetch->private))
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(conv_expr, &expr->conv_exprs, list) {
|
2012-04-25 11:21:49 -04:00
|
|
|
|
/* we want to ensure that p->type can be casted into
|
|
|
|
|
|
* conv_expr->conv->in_type. We have 3 possibilities :
|
|
|
|
|
|
* - NULL => not castable.
|
|
|
|
|
|
* - c_none => nothing to do (let's optimize it)
|
|
|
|
|
|
* - other => apply cast and prepare to fail
|
|
|
|
|
|
*/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
if (!sample_casts[p->type][conv_expr->conv->in_type])
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
|
|
2012-04-27 15:37:17 -04:00
|
|
|
|
if (sample_casts[p->type][conv_expr->conv->in_type] != c_none &&
|
|
|
|
|
|
!sample_casts[p->type][conv_expr->conv->in_type](p))
|
2012-04-25 11:21:49 -04:00
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
|
|
/* OK cast succeeded */
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
if (!conv_expr->conv->process(conv_expr->arg_p, p, conv_expr->conv->private))
|
2010-01-04 10:16:05 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
|
}
|
|
|
|
|
|
return p;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
/*
|
|
|
|
|
|
* Resolve all remaining arguments in proxy <p>. Returns the number of
|
|
|
|
|
|
* errors or 0 if everything is fine.
|
|
|
|
|
|
*/
|
|
|
|
|
|
int smp_resolve_args(struct proxy *p)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct arg_list *cur, *bak;
|
|
|
|
|
|
const char *ctx, *where;
|
|
|
|
|
|
const char *conv_ctx, *conv_pre, *conv_pos;
|
|
|
|
|
|
struct userlist *ul;
|
2015-01-19 13:00:58 -05:00
|
|
|
|
struct my_regex *reg;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
struct arg *arg;
|
|
|
|
|
|
int cfgerr = 0;
|
2015-01-19 13:00:58 -05:00
|
|
|
|
int rflags;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
|
|
|
|
|
|
list_for_each_entry_safe(cur, bak, &p->conf.args.list, list) {
|
|
|
|
|
|
struct proxy *px;
|
|
|
|
|
|
struct server *srv;
|
|
|
|
|
|
char *pname, *sname;
|
2015-01-19 13:00:58 -05:00
|
|
|
|
char *err;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
|
|
|
|
|
|
arg = cur->arg;
|
|
|
|
|
|
|
|
|
|
|
|
/* prepare output messages */
|
|
|
|
|
|
conv_pre = conv_pos = conv_ctx = "";
|
|
|
|
|
|
if (cur->conv) {
|
|
|
|
|
|
conv_ctx = cur->conv;
|
|
|
|
|
|
conv_pre = "conversion keyword '";
|
|
|
|
|
|
conv_pos = "' for ";
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
where = "in";
|
|
|
|
|
|
ctx = "sample fetch keyword";
|
|
|
|
|
|
switch (cur->ctx) {
|
2015-01-19 13:00:58 -05:00
|
|
|
|
case ARGC_STK: where = "in stick rule in"; break;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
case ARGC_TRK: where = "in tracking rule in"; break;
|
|
|
|
|
|
case ARGC_LOG: where = "in log-format string in"; break;
|
2013-11-20 09:09:52 -05:00
|
|
|
|
case ARGC_HRQ: where = "in http-request header format string in"; break;
|
|
|
|
|
|
case ARGC_HRS: where = "in http-response header format string in"; break;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
case ARGC_UIF: where = "in unique-id-format string in"; break;
|
2013-11-29 06:15:45 -05:00
|
|
|
|
case ARGC_RDR: where = "in redirect format string in"; break;
|
2014-06-13 10:17:14 -04:00
|
|
|
|
case ARGC_CAP: where = "in capture rule in"; break;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
case ARGC_ACL: ctx = "ACL keyword"; break;
|
2015-07-09 05:39:33 -04:00
|
|
|
|
case ARGC_SRV: where = "in server directive in"; break;
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* set a few default settings */
|
|
|
|
|
|
px = p;
|
|
|
|
|
|
pname = p->id;
|
|
|
|
|
|
|
|
|
|
|
|
switch (arg->type) {
|
|
|
|
|
|
case ARGT_SRV:
|
|
|
|
|
|
if (!arg->data.str.len) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : missing server name in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* we support two formats : "bck/srv" and "srv" */
|
|
|
|
|
|
sname = strrchr(arg->data.str.str, '/');
|
|
|
|
|
|
|
|
|
|
|
|
if (sname) {
|
|
|
|
|
|
*sname++ = '\0';
|
|
|
|
|
|
pname = arg->data.str.str;
|
|
|
|
|
|
|
2015-05-26 05:24:42 -04:00
|
|
|
|
px = proxy_be_by_name(pname);
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
if (!px) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find proxy '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
sname = arg->data.str.str;
|
|
|
|
|
|
|
|
|
|
|
|
srv = findserver(px, sname);
|
|
|
|
|
|
if (!srv) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find server '%s' in proxy '%s', referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, sname, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.srv = srv;
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
case ARGT_FE:
|
|
|
|
|
|
if (arg->data.str.len) {
|
|
|
|
|
|
pname = arg->data.str.str;
|
2015-05-26 05:24:42 -04:00
|
|
|
|
px = proxy_fe_by_name(pname);
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!px) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find frontend '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!(px->cap & PR_CAP_FE)) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : proxy '%s', referenced in arg %d of %s%s%s%s '%s' %s proxy '%s', has not frontend capability.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.prx = px;
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
case ARGT_BE:
|
|
|
|
|
|
if (arg->data.str.len) {
|
|
|
|
|
|
pname = arg->data.str.str;
|
2015-05-26 05:24:42 -04:00
|
|
|
|
px = proxy_be_by_name(pname);
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!px) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find backend '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!(px->cap & PR_CAP_BE)) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : proxy '%s', referenced in arg %d of %s%s%s%s '%s' %s proxy '%s', has not backend capability.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.prx = px;
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
case ARGT_TAB:
|
|
|
|
|
|
if (arg->data.str.len) {
|
|
|
|
|
|
pname = arg->data.str.str;
|
2015-05-26 06:08:07 -04:00
|
|
|
|
px = proxy_tbl_by_name(pname);
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!px) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find table '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!px->table.size) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : no table in proxy '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, pname,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.prx = px;
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
case ARGT_USR:
|
|
|
|
|
|
if (!arg->data.str.len) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : missing userlist name in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (p->uri_auth && p->uri_auth->userlist &&
|
|
|
|
|
|
!strcmp(p->uri_auth->userlist->name, arg->data.str.str))
|
|
|
|
|
|
ul = p->uri_auth->userlist;
|
|
|
|
|
|
else
|
|
|
|
|
|
ul = auth_find_userlist(arg->data.str.str);
|
|
|
|
|
|
|
|
|
|
|
|
if (!ul) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : unable to find userlist '%s' referenced in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line, arg->data.str.str,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.usr = ul;
|
|
|
|
|
|
break;
|
2015-01-19 13:00:58 -05:00
|
|
|
|
|
|
|
|
|
|
case ARGT_REG:
|
|
|
|
|
|
if (!arg->data.str.len) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : missing regex in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
reg = calloc(1, sizeof(*reg));
|
|
|
|
|
|
if (!reg) {
|
|
|
|
|
|
Alert("parsing [%s:%d] : not enough memory to build regex in arg %d of %s%s%s%s '%s' %s proxy '%s'.\n",
|
|
|
|
|
|
cur->file, cur->line,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
rflags = 0;
|
|
|
|
|
|
rflags |= (arg->type_flags & ARGF_REG_ICASE) ? REG_ICASE : 0;
|
|
|
|
|
|
err = NULL;
|
|
|
|
|
|
|
2015-01-23 14:23:17 -05:00
|
|
|
|
if (!regex_comp(arg->data.str.str, reg, !(rflags & REG_ICASE), 1 /* capture substr */, &err)) {
|
2015-01-19 13:00:58 -05:00
|
|
|
|
Alert("parsing [%s:%d] : error in regex '%s' in arg %d of %s%s%s%s '%s' %s proxy '%s' : %s.\n",
|
|
|
|
|
|
cur->file, cur->line,
|
|
|
|
|
|
arg->data.str.str,
|
|
|
|
|
|
cur->arg_pos + 1, conv_pre, conv_ctx, conv_pos, ctx, cur->kw, where, p->id, err);
|
|
|
|
|
|
cfgerr++;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
free(arg->data.str.str);
|
|
|
|
|
|
arg->data.str.str = NULL;
|
|
|
|
|
|
arg->unresolved = 0;
|
|
|
|
|
|
arg->data.reg = reg;
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
|
MAJOR: sample: maintain a per-proxy list of the fetch args to resolve
While ACL args were resolved after all the config was parsed, it was not the
case with sample fetch args because they're almost everywhere now.
The issue is that ACLs now solely rely on sample fetches, so their args
resolving doesn't work anymore. And many fetches involving a server, a
proxy or a userlist don't work at all.
The real issue is that at the bottom layers we have no information about
proxies, line numbers, even ACLs in order to report understandable errors,
and that at the top layers we have no visibility over the locations where
fetches are referenced (think log node).
After failing multiple unsatisfying solutions attempts, we now have a new
concept of args list. The principle is that every proxy has a list head
which contains a number of indications such as the config keyword, the
context where it's used, the file and line number, etc... and a list of
arguments. This list head is of the same type as the elements, so it
serves as a template for adding new elements. This way, it is filled from
top to bottom by the callers with the information they have (eg: line
numbers, ACL name, ...) and the lower layers just have to duplicate it and
add an element when they face an argument they cannot resolve yet.
Then at the end of the configuration parsing, a loop passes over each
proxy's list and resolves all the args in sequence. And this way there is
all necessary information to report verbose errors.
The first immediate benefit is that for the first time we got very precise
location of issues (arg number in a keyword in its context, ...). Second,
in order to do this we had to parse log-format and unique-id-format a bit
earlier, so that was a great opportunity for doing so when the directives
are encountered (unless it's a default section). This way, the recorded
line numbers for these args are the ones of the place where the log format
is declared, not the end of the file.
Userlists report slightly more information now. They're the only remaining
ones in the ACL resolving function.
2013-04-02 10:34:32 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LIST_DEL(&cur->list);
|
|
|
|
|
|
free(cur);
|
|
|
|
|
|
} /* end of args processing */
|
|
|
|
|
|
|
|
|
|
|
|
return cfgerr;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-12-20 18:02:32 -05:00
|
|
|
|
/*
|
2014-06-13 10:04:35 -04:00
|
|
|
|
* Process a fetch + format conversion as defined by the sample expression
|
|
|
|
|
|
* <expr> on request or response considering the <opt> parameter. The output is
|
2015-07-06 09:41:02 -04:00
|
|
|
|
* not explicitly set to <smp_type>, but shall be compatible with it as
|
|
|
|
|
|
* specified by 'sample_casts' table. If a stable sample can be fetched, or an
|
|
|
|
|
|
* unstable one when <opt> contains SMP_OPT_FINAL, the sample is converted and
|
2014-06-13 10:04:35 -04:00
|
|
|
|
* returned without the SMP_F_MAY_CHANGE flag. If an unstable sample is found
|
|
|
|
|
|
* and <opt> does not contain SMP_OPT_FINAL, then the sample is returned as-is
|
|
|
|
|
|
* with its SMP_F_MAY_CHANGE flag so that the caller can check it and decide to
|
|
|
|
|
|
* take actions (eg: wait longer). If a sample could not be found or could not
|
2014-07-30 02:56:35 -04:00
|
|
|
|
* be converted, NULL is returned. The caller MUST NOT use the sample if the
|
|
|
|
|
|
* SMP_F_MAY_CHANGE flag is present, as it is used only as a hint that there is
|
|
|
|
|
|
* still hope to get it after waiting longer, and is not converted to string.
|
|
|
|
|
|
* The possible output combinations are the following :
|
|
|
|
|
|
*
|
|
|
|
|
|
* return MAY_CHANGE FINAL Meaning for the sample
|
|
|
|
|
|
* NULL * * Not present and will never be (eg: header)
|
|
|
|
|
|
* smp 0 * Final value converted (eg: header)
|
|
|
|
|
|
* smp 1 0 Not present yet, may appear later (eg: header)
|
|
|
|
|
|
* smp 1 1 never happens (either flag is cleared on output)
|
2012-12-20 18:02:32 -05:00
|
|
|
|
*/
|
2015-07-06 09:41:02 -04:00
|
|
|
|
struct sample *sample_fetch_as_type(struct proxy *px, struct session *sess,
|
2015-04-03 19:47:55 -04:00
|
|
|
|
struct stream *strm, unsigned int opt,
|
2015-07-06 09:41:02 -04:00
|
|
|
|
struct sample_expr *expr, int smp_type)
|
2012-12-20 18:02:32 -05:00
|
|
|
|
{
|
2014-06-13 10:04:35 -04:00
|
|
|
|
struct sample *smp = &temp_smp;
|
2012-12-20 18:02:32 -05:00
|
|
|
|
|
2014-06-25 10:56:41 -04:00
|
|
|
|
memset(smp, 0, sizeof(*smp));
|
|
|
|
|
|
|
2015-04-03 19:47:55 -04:00
|
|
|
|
if (!sample_process(px, sess, strm, opt, expr, smp)) {
|
2014-06-13 10:04:35 -04:00
|
|
|
|
if ((smp->flags & SMP_F_MAY_CHANGE) && !(opt & SMP_OPT_FINAL))
|
|
|
|
|
|
return smp;
|
2012-12-20 18:02:32 -05:00
|
|
|
|
return NULL;
|
2014-06-13 10:04:35 -04:00
|
|
|
|
}
|
2012-12-20 18:02:32 -05:00
|
|
|
|
|
2015-07-06 09:41:02 -04:00
|
|
|
|
if (!sample_casts[smp->type][smp_type])
|
2012-12-20 18:02:32 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
|
|
2015-07-06 09:41:02 -04:00
|
|
|
|
if (!sample_casts[smp->type][smp_type](smp))
|
2012-12-20 18:02:32 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
|
|
2014-06-13 10:04:35 -04:00
|
|
|
|
smp->flags &= ~SMP_F_MAY_CHANGE;
|
2012-12-20 18:02:32 -05:00
|
|
|
|
return smp;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*****************************************************************/
|
2012-04-27 15:37:17 -04:00
|
|
|
|
/* Sample format convert functions */
|
2012-04-23 16:38:26 -04:00
|
|
|
|
/* These functions set the data type on return. */
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/*****************************************************************/
|
|
|
|
|
|
|
2015-05-07 09:46:29 -04:00
|
|
|
|
#ifdef DEBUG_EXPR
|
|
|
|
|
|
static int sample_conv_debug(const struct arg *arg_p, struct sample *smp, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
int i;
|
|
|
|
|
|
struct sample tmp;
|
|
|
|
|
|
|
|
|
|
|
|
if (!(global.mode & MODE_QUIET) || (global.mode & (MODE_VERBOSE | MODE_STARTING))) {
|
|
|
|
|
|
fprintf(stderr, "[debug converter] type: %s ", smp_to_type[smp->type]);
|
|
|
|
|
|
if (!sample_casts[smp->type][SMP_T_STR]) {
|
|
|
|
|
|
fprintf(stderr, "(undisplayable)");
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy sample fetch. This put the sample as const, the
|
|
|
|
|
|
* cast will copy data if a transformation is required.
|
|
|
|
|
|
*/
|
|
|
|
|
|
memcpy(&tmp, smp, sizeof(struct sample));
|
|
|
|
|
|
tmp.flags = SMP_F_CONST;
|
|
|
|
|
|
|
|
|
|
|
|
if (!sample_casts[smp->type][SMP_T_STR](&tmp))
|
|
|
|
|
|
fprintf(stderr, "(undisplayable)");
|
|
|
|
|
|
|
|
|
|
|
|
else {
|
|
|
|
|
|
/* Display the displayable chars*. */
|
|
|
|
|
|
fprintf(stderr, "<");
|
|
|
|
|
|
for (i = 0; i < tmp.data.str.len; i++) {
|
|
|
|
|
|
if (isprint(tmp.data.str.str[i]))
|
|
|
|
|
|
fputc(tmp.data.str.str[i], stderr);
|
|
|
|
|
|
else
|
|
|
|
|
|
fputc('.', stderr);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
fprintf(stderr, ">\n");
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_bin2base64(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-04-30 12:21:37 -04:00
|
|
|
|
{
|
|
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
|
|
|
|
|
int b64_len;
|
|
|
|
|
|
|
|
|
|
|
|
trash->len = 0;
|
|
|
|
|
|
b64_len = a2base64(smp->data.str.str, smp->data.str.len, trash->str, trash->size);
|
|
|
|
|
|
if (b64_len < 0)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
trash->len = b64_len;
|
|
|
|
|
|
smp->data.str = *trash;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_bin2hex(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-03-12 10:01:52 -04:00
|
|
|
|
{
|
|
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
|
|
|
|
|
unsigned char c;
|
|
|
|
|
|
int ptr = 0;
|
|
|
|
|
|
|
|
|
|
|
|
trash->len = 0;
|
|
|
|
|
|
while (ptr < smp->data.str.len && trash->len <= trash->size - 2) {
|
|
|
|
|
|
c = smp->data.str.str[ptr++];
|
|
|
|
|
|
trash->str[trash->len++] = hextab[(c >> 4) & 0xF];
|
|
|
|
|
|
trash->str[trash->len++] = hextab[c & 0xF];
|
|
|
|
|
|
}
|
|
|
|
|
|
smp->data.str = *trash;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
2014-03-12 10:01:52 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 14:15:37 -04:00
|
|
|
|
/* hashes the binary input into a 32-bit unsigned int */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_djb2(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-07-15 14:15:37 -04:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = hash_djb2(smp->data.str.str, smp->data.str.len);
|
2014-07-15 14:15:37 -04:00
|
|
|
|
if (arg_p && arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = full_hash(smp->data.sint);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2014-07-15 14:15:37 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_str2lower(const struct arg *arg_p, struct sample *smp, void *private)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
if (!smp_dup(smp))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
if (!smp->data.str.size)
|
2010-09-23 12:02:19 -04:00
|
|
|
|
return 0;
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
for (i = 0; i < smp->data.str.len; i++) {
|
|
|
|
|
|
if ((smp->data.str.str[i] >= 'A') && (smp->data.str.str[i] <= 'Z'))
|
|
|
|
|
|
smp->data.str.str[i] += 'a' - 'A';
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_str2upper(const struct arg *arg_p, struct sample *smp, void *private)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
if (!smp_dup(smp))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
if (!smp->data.str.size)
|
2010-09-23 12:02:19 -04:00
|
|
|
|
return 0;
|
|
|
|
|
|
|
2012-04-23 16:03:39 -04:00
|
|
|
|
for (i = 0; i < smp->data.str.len; i++) {
|
|
|
|
|
|
if ((smp->data.str.str[i] >= 'a') && (smp->data.str.str[i] <= 'z'))
|
|
|
|
|
|
smp->data.str.str[i] += 'A' - 'a';
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2012-04-20 08:03:29 -04:00
|
|
|
|
/* takes the netmask in arg_p */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_ipmask(const struct arg *arg_p, struct sample *smp, void *private)
|
2010-01-26 12:01:41 -05:00
|
|
|
|
{
|
2012-04-23 16:03:39 -04:00
|
|
|
|
smp->data.ipv4.s_addr &= arg_p->data.ipv4.s_addr;
|
2012-04-23 16:38:26 -04:00
|
|
|
|
smp->type = SMP_T_IPV4;
|
2010-01-26 12:01:41 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-10 10:37:47 -04:00
|
|
|
|
/* takes an UINT value on input supposed to represent the time since EPOCH,
|
|
|
|
|
|
* adds an optional offset found in args[1] and emits a string representing
|
|
|
|
|
|
* the local time in the format specified in args[1] using strftime().
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_ltime(const struct arg *args, struct sample *smp, void *private)
|
2014-07-10 10:37:47 -04:00
|
|
|
|
{
|
|
|
|
|
|
struct chunk *temp;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
time_t curr_date = smp->data.sint;
|
2015-07-07 18:15:20 -04:00
|
|
|
|
struct tm *tm;
|
2014-07-10 10:37:47 -04:00
|
|
|
|
|
|
|
|
|
|
/* add offset */
|
|
|
|
|
|
if (args[1].type == ARGT_SINT || args[1].type == ARGT_UINT)
|
|
|
|
|
|
curr_date += args[1].data.sint;
|
|
|
|
|
|
|
2015-07-07 18:15:20 -04:00
|
|
|
|
tm = localtime(&curr_date);
|
|
|
|
|
|
if (!tm)
|
|
|
|
|
|
return 0;
|
2014-07-10 10:37:47 -04:00
|
|
|
|
temp = get_trash_chunk();
|
2015-07-07 18:15:20 -04:00
|
|
|
|
temp->len = strftime(temp->str, temp->size, args[0].data.str.str, tm);
|
2014-07-10 10:37:47 -04:00
|
|
|
|
smp->data.str = *temp;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 14:15:37 -04:00
|
|
|
|
/* hashes the binary input into a 32-bit unsigned int */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_sdbm(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-07-15 14:15:37 -04:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = hash_sdbm(smp->data.str.str, smp->data.str.len);
|
2014-07-15 14:15:37 -04:00
|
|
|
|
if (arg_p && arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = full_hash(smp->data.sint);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2014-07-15 14:15:37 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-10 10:37:47 -04:00
|
|
|
|
/* takes an UINT value on input supposed to represent the time since EPOCH,
|
|
|
|
|
|
* adds an optional offset found in args[1] and emits a string representing
|
|
|
|
|
|
* the UTC date in the format specified in args[1] using strftime().
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_utime(const struct arg *args, struct sample *smp, void *private)
|
2014-07-10 10:37:47 -04:00
|
|
|
|
{
|
|
|
|
|
|
struct chunk *temp;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
time_t curr_date = smp->data.sint;
|
2015-07-07 18:15:20 -04:00
|
|
|
|
struct tm *tm;
|
2014-07-10 10:37:47 -04:00
|
|
|
|
|
|
|
|
|
|
/* add offset */
|
|
|
|
|
|
if (args[1].type == ARGT_SINT || args[1].type == ARGT_UINT)
|
|
|
|
|
|
curr_date += args[1].data.sint;
|
|
|
|
|
|
|
2015-07-07 18:15:20 -04:00
|
|
|
|
tm = gmtime(&curr_date);
|
|
|
|
|
|
if (!tm)
|
|
|
|
|
|
return 0;
|
2014-07-10 10:37:47 -04:00
|
|
|
|
temp = get_trash_chunk();
|
2015-07-07 18:15:20 -04:00
|
|
|
|
temp->len = strftime(temp->str, temp->size, args[0].data.str.str, tm);
|
2014-07-10 10:37:47 -04:00
|
|
|
|
smp->data.str = *temp;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-07-15 14:15:37 -04:00
|
|
|
|
/* hashes the binary input into a 32-bit unsigned int */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_wt6(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-07-15 14:15:37 -04:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = hash_wt6(smp->data.str.str, smp->data.str.len);
|
2014-07-15 14:15:37 -04:00
|
|
|
|
if (arg_p && arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = full_hash(smp->data.sint);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2014-07-15 14:15:37 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-01-20 13:35:24 -05:00
|
|
|
|
/* hashes the binary input into a 32-bit unsigned int */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_crc32(const struct arg *arg_p, struct sample *smp, void *private)
|
2015-01-20 13:35:24 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = hash_crc32(smp->data.str.str, smp->data.str.len);
|
2015-01-20 13:35:24 -05:00
|
|
|
|
if (arg_p && arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = full_hash(smp->data.sint);
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
2015-01-20 13:35:24 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
MINOR: sample: add "json" converter
This converter escapes string to use it as json/ascii escaped string.
It can read UTF-8 with differents behavior on errors and encode it in
json/ascii.
json([<input-code>])
Escapes the input string and produces an ASCII ouput string ready to use as a
JSON string. The converter tries to decode the input string according to the
<input-code> parameter. It can be "ascii", "utf8", "utf8s", "utf8"" or
"utf8ps". The "ascii" decoder never fails. The "utf8" decoder detects 3 types
of errors:
- bad UTF-8 sequence (lone continuation byte, bad number of continuation
bytes, ...)
- invalid range (the decoded value is within a UTF-8 prohibited range),
- code overlong (the value is encoded with more bytes than necessary).
The UTF-8 JSON encoding can produce a "too long value" error when the UTF-8
character is greater than 0xffff because the JSON string escape specification
only authorizes 4 hex digits for the value encoding. The UTF-8 decoder exists
in 4 variants designated by a combination of two suffix letters : "p" for
"permissive" and "s" for "silently ignore". The behaviors of the decoders
are :
- "ascii" : never fails ;
- "utf8" : fails on any detected errors ;
- "utf8s" : never fails, but removes characters corresponding to errors ;
- "utf8p" : accepts and fixes the overlong errors, but fails on any other
error ;
- "utf8ps" : never fails, accepts and fixes the overlong errors, but removes
characters corresponding to the other errors.
This converter is particularly useful for building properly escaped JSON for
logging to servers which consume JSON-formated traffic logs.
Example:
capture request header user-agent len 150
capture request header Host len 15
log-format {"ip":"%[src]","user-agent":"%[capture.req.hdr(1),json]"}
Input request from client 127.0.0.1:
GET / HTTP/1.0
User-Agent: Very "Ugly" UA 1/2
Output log:
{"ip":"127.0.0.1","user-agent":"Very \"Ugly\" UA 1\/2"}
2014-08-12 04:20:47 -04:00
|
|
|
|
/* This function escape special json characters. The returned string can be
|
|
|
|
|
|
* safely set between two '"' and used as json string. The json string is
|
|
|
|
|
|
* defined like this:
|
|
|
|
|
|
*
|
|
|
|
|
|
* any Unicode character except '"' or '\' or control character
|
|
|
|
|
|
* \", \\, \/, \b, \f, \n, \r, \t, \u + four-hex-digits
|
|
|
|
|
|
*
|
|
|
|
|
|
* The enum input_type contain all the allowed mode for decoding the input
|
|
|
|
|
|
* string.
|
|
|
|
|
|
*/
|
|
|
|
|
|
enum input_type {
|
|
|
|
|
|
IT_ASCII = 0,
|
|
|
|
|
|
IT_UTF8,
|
|
|
|
|
|
IT_UTF8S,
|
|
|
|
|
|
IT_UTF8P,
|
|
|
|
|
|
IT_UTF8PS,
|
|
|
|
|
|
};
|
|
|
|
|
|
static int sample_conv_json_check(struct arg *arg, struct sample_conv *conv,
|
|
|
|
|
|
const char *file, int line, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (!arg) {
|
|
|
|
|
|
memprintf(err, "Unexpected empty arg list");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (arg->type != ARGT_STR) {
|
|
|
|
|
|
memprintf(err, "Unexpected arg type");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (strcmp(arg->data.str.str, "") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_ASCII;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
else if (strcmp(arg->data.str.str, "ascii") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_ASCII;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
else if (strcmp(arg->data.str.str, "utf8") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_UTF8;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
else if (strcmp(arg->data.str.str, "utf8s") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_UTF8S;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
else if (strcmp(arg->data.str.str, "utf8p") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_UTF8P;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
else if (strcmp(arg->data.str.str, "utf8ps") == 0) {
|
|
|
|
|
|
arg->type = ARGT_UINT;
|
|
|
|
|
|
arg->data.uint = IT_UTF8PS;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
memprintf(err, "Unexpected input code type at file '%s', line %d. "
|
|
|
|
|
|
"Allowed value are 'ascii', 'utf8', 'utf8p' and 'utf8pp'", file, line);
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_json(const struct arg *arg_p, struct sample *smp, void *private)
|
MINOR: sample: add "json" converter
This converter escapes string to use it as json/ascii escaped string.
It can read UTF-8 with differents behavior on errors and encode it in
json/ascii.
json([<input-code>])
Escapes the input string and produces an ASCII ouput string ready to use as a
JSON string. The converter tries to decode the input string according to the
<input-code> parameter. It can be "ascii", "utf8", "utf8s", "utf8"" or
"utf8ps". The "ascii" decoder never fails. The "utf8" decoder detects 3 types
of errors:
- bad UTF-8 sequence (lone continuation byte, bad number of continuation
bytes, ...)
- invalid range (the decoded value is within a UTF-8 prohibited range),
- code overlong (the value is encoded with more bytes than necessary).
The UTF-8 JSON encoding can produce a "too long value" error when the UTF-8
character is greater than 0xffff because the JSON string escape specification
only authorizes 4 hex digits for the value encoding. The UTF-8 decoder exists
in 4 variants designated by a combination of two suffix letters : "p" for
"permissive" and "s" for "silently ignore". The behaviors of the decoders
are :
- "ascii" : never fails ;
- "utf8" : fails on any detected errors ;
- "utf8s" : never fails, but removes characters corresponding to errors ;
- "utf8p" : accepts and fixes the overlong errors, but fails on any other
error ;
- "utf8ps" : never fails, accepts and fixes the overlong errors, but removes
characters corresponding to the other errors.
This converter is particularly useful for building properly escaped JSON for
logging to servers which consume JSON-formated traffic logs.
Example:
capture request header user-agent len 150
capture request header Host len 15
log-format {"ip":"%[src]","user-agent":"%[capture.req.hdr(1),json]"}
Input request from client 127.0.0.1:
GET / HTTP/1.0
User-Agent: Very "Ugly" UA 1/2
Output log:
{"ip":"127.0.0.1","user-agent":"Very \"Ugly\" UA 1\/2"}
2014-08-12 04:20:47 -04:00
|
|
|
|
{
|
|
|
|
|
|
struct chunk *temp;
|
|
|
|
|
|
char _str[7]; /* \u + 4 hex digit + null char for sprintf. */
|
|
|
|
|
|
const char *str;
|
|
|
|
|
|
int len;
|
|
|
|
|
|
enum input_type input_type = IT_ASCII;
|
|
|
|
|
|
unsigned int c;
|
|
|
|
|
|
unsigned int ret;
|
|
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
|
|
|
|
if (arg_p)
|
|
|
|
|
|
input_type = arg_p->data.uint;
|
|
|
|
|
|
|
|
|
|
|
|
temp = get_trash_chunk();
|
|
|
|
|
|
temp->len = 0;
|
|
|
|
|
|
|
|
|
|
|
|
p = smp->data.str.str;
|
|
|
|
|
|
while (p < smp->data.str.str + smp->data.str.len) {
|
|
|
|
|
|
|
|
|
|
|
|
if (input_type == IT_ASCII) {
|
|
|
|
|
|
/* Read input as ASCII. */
|
|
|
|
|
|
c = *(unsigned char *)p;
|
|
|
|
|
|
p++;
|
|
|
|
|
|
}
|
|
|
|
|
|
else {
|
|
|
|
|
|
/* Read input as UTF8. */
|
|
|
|
|
|
ret = utf8_next(p, smp->data.str.len - ( p - smp->data.str.str ), &c);
|
|
|
|
|
|
p += utf8_return_length(ret);
|
|
|
|
|
|
|
|
|
|
|
|
if (input_type == IT_UTF8 && utf8_return_code(ret) != UTF8_CODE_OK)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
if (input_type == IT_UTF8S && utf8_return_code(ret) != UTF8_CODE_OK)
|
|
|
|
|
|
continue;
|
|
|
|
|
|
if (input_type == IT_UTF8P && utf8_return_code(ret) & (UTF8_CODE_INVRANGE|UTF8_CODE_BADSEQ))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
if (input_type == IT_UTF8PS && utf8_return_code(ret) & (UTF8_CODE_INVRANGE|UTF8_CODE_BADSEQ))
|
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
|
|
/* Check too big values. */
|
|
|
|
|
|
if ((unsigned int)c > 0xffff) {
|
|
|
|
|
|
if (input_type == IT_UTF8 || input_type == IT_UTF8P)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Convert character. */
|
|
|
|
|
|
if (c == '"') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\\"";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\\') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\\\";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '/') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\/";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\b') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\b";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\f') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\f";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\r') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\r";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\n') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\n";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c == '\t') {
|
|
|
|
|
|
len = 2;
|
|
|
|
|
|
str = "\\t";
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (c > 0xff || !isprint(c)) {
|
|
|
|
|
|
/* isprint generate a segfault if c is too big. The man says that
|
|
|
|
|
|
* c must have the value of an unsigned char or EOF.
|
|
|
|
|
|
*/
|
|
|
|
|
|
len = 6;
|
|
|
|
|
|
_str[0] = '\\';
|
|
|
|
|
|
_str[1] = 'u';
|
|
|
|
|
|
snprintf(&_str[2], 5, "%04x", (unsigned short)c);
|
|
|
|
|
|
str = _str;
|
|
|
|
|
|
}
|
|
|
|
|
|
else {
|
|
|
|
|
|
len = 1;
|
|
|
|
|
|
str = (char *)&c;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Check length */
|
|
|
|
|
|
if (temp->len + len > temp->size)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy string. */
|
|
|
|
|
|
memcpy(temp->str + temp->len, str, len);
|
|
|
|
|
|
temp->len += len;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
|
|
|
|
|
smp->data.str = *temp;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-03 09:32:43 -05:00
|
|
|
|
/* This sample function is designed to extract some bytes from an input buffer.
|
|
|
|
|
|
* First arg is the offset.
|
|
|
|
|
|
* Optional second arg is the length to truncate */
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_bytes(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-11-03 09:32:43 -05:00
|
|
|
|
{
|
|
|
|
|
|
if (smp->data.str.len <= arg_p[0].data.uint) {
|
|
|
|
|
|
smp->data.str.len = 0;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (smp->data.str.size)
|
|
|
|
|
|
smp->data.str.size -= arg_p[0].data.uint;
|
|
|
|
|
|
smp->data.str.len -= arg_p[0].data.uint;
|
|
|
|
|
|
smp->data.str.str += arg_p[0].data.uint;
|
|
|
|
|
|
|
|
|
|
|
|
if ((arg_p[1].type == ARGT_UINT) && (arg_p[1].data.uint < smp->data.str.len))
|
|
|
|
|
|
smp->data.str.len = arg_p[1].data.uint;
|
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-03 11:07:03 -05:00
|
|
|
|
static int sample_conv_field_check(struct arg *args, struct sample_conv *conv,
|
|
|
|
|
|
const char *file, int line, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct arg *arg = args;
|
|
|
|
|
|
|
|
|
|
|
|
if (!arg) {
|
|
|
|
|
|
memprintf(err, "Unexpected empty arg list");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (arg->type != ARGT_UINT) {
|
|
|
|
|
|
memprintf(err, "Unexpected arg type");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!arg->data.uint) {
|
|
|
|
|
|
memprintf(err, "Unexpected value 0 for index");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
arg++;
|
|
|
|
|
|
|
|
|
|
|
|
if (arg->type != ARGT_STR) {
|
|
|
|
|
|
memprintf(err, "Unexpected arg type");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!arg->data.str.len) {
|
|
|
|
|
|
memprintf(err, "Empty separators list");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* This sample function is designed to a return selected part of a string (field).
|
|
|
|
|
|
* First arg is the index of the field (start at 1)
|
|
|
|
|
|
* Second arg is a char list of separators (type string)
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_field(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-11-03 11:07:03 -05:00
|
|
|
|
{
|
|
|
|
|
|
unsigned int field;
|
|
|
|
|
|
char *start, *end;
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
|
|
if (!arg_p[0].data.uint)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
field = 1;
|
|
|
|
|
|
end = start = smp->data.str.str;
|
|
|
|
|
|
while (end - smp->data.str.str < smp->data.str.len) {
|
|
|
|
|
|
|
|
|
|
|
|
for (i = 0 ; i < arg_p[1].data.str.len ; i++) {
|
|
|
|
|
|
if (*end == arg_p[1].data.str.str[i]) {
|
|
|
|
|
|
if (field == arg_p[0].data.uint)
|
|
|
|
|
|
goto found;
|
|
|
|
|
|
start = end+1;
|
|
|
|
|
|
field++;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
end++;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Field not found */
|
|
|
|
|
|
if (field != arg_p[0].data.uint) {
|
|
|
|
|
|
smp->data.str.len = 0;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
found:
|
|
|
|
|
|
smp->data.str.len = end - start;
|
|
|
|
|
|
/* If ret string is len 0, no need to
|
|
|
|
|
|
change pointers or to update size */
|
|
|
|
|
|
if (!smp->data.str.len)
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
|
|
|
|
smp->data.str.str = start;
|
|
|
|
|
|
|
|
|
|
|
|
/* Compute remaining size if needed
|
|
|
|
|
|
Note: smp->data.str.size cannot be set to 0 */
|
|
|
|
|
|
if (smp->data.str.size)
|
|
|
|
|
|
smp->data.str.size -= start - smp->data.str.str;
|
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-25 08:09:01 -05:00
|
|
|
|
/* This sample function is designed to return a word from a string.
|
|
|
|
|
|
* First arg is the index of the word (start at 1)
|
|
|
|
|
|
* Second arg is a char list of words separators (type string)
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_word(const struct arg *arg_p, struct sample *smp, void *private)
|
2014-11-25 08:09:01 -05:00
|
|
|
|
{
|
|
|
|
|
|
unsigned int word;
|
|
|
|
|
|
char *start, *end;
|
|
|
|
|
|
int i, issep, inword;
|
|
|
|
|
|
|
|
|
|
|
|
if (!arg_p[0].data.uint)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
word = 0;
|
|
|
|
|
|
inword = 0;
|
|
|
|
|
|
end = start = smp->data.str.str;
|
|
|
|
|
|
while (end - smp->data.str.str < smp->data.str.len) {
|
|
|
|
|
|
issep = 0;
|
|
|
|
|
|
for (i = 0 ; i < arg_p[1].data.str.len ; i++) {
|
|
|
|
|
|
if (*end == arg_p[1].data.str.str[i]) {
|
|
|
|
|
|
issep = 1;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
if (!inword) {
|
|
|
|
|
|
if (!issep) {
|
|
|
|
|
|
word++;
|
|
|
|
|
|
start = end;
|
|
|
|
|
|
inword = 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (issep) {
|
|
|
|
|
|
if (word == arg_p[0].data.uint)
|
|
|
|
|
|
goto found;
|
|
|
|
|
|
inword = 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
end++;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Field not found */
|
|
|
|
|
|
if (word != arg_p[0].data.uint) {
|
|
|
|
|
|
smp->data.str.len = 0;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
found:
|
|
|
|
|
|
smp->data.str.len = end - start;
|
|
|
|
|
|
/* If ret string is len 0, no need to
|
|
|
|
|
|
change pointers or to update size */
|
|
|
|
|
|
if (!smp->data.str.len)
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
|
|
|
|
smp->data.str.str = start;
|
|
|
|
|
|
|
|
|
|
|
|
/* Compute remaining size if needed
|
|
|
|
|
|
Note: smp->data.str.size cannot be set to 0 */
|
|
|
|
|
|
if (smp->data.str.size)
|
|
|
|
|
|
smp->data.str.size -= start - smp->data.str.str;
|
|
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-01-20 13:47:06 -05:00
|
|
|
|
static int sample_conv_regsub_check(struct arg *args, struct sample_conv *conv,
|
|
|
|
|
|
const char *file, int line, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
struct arg *arg = args;
|
|
|
|
|
|
char *p;
|
|
|
|
|
|
int len;
|
|
|
|
|
|
|
|
|
|
|
|
/* arg0 is a regex, it uses type_flag for ICASE and global match */
|
|
|
|
|
|
arg[0].type_flags = 0;
|
|
|
|
|
|
|
|
|
|
|
|
if (arg[2].type != ARGT_STR)
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
|
|
|
|
p = arg[2].data.str.str;
|
|
|
|
|
|
len = arg[2].data.str.len;
|
|
|
|
|
|
while (len) {
|
|
|
|
|
|
if (*p == 'i') {
|
|
|
|
|
|
arg[0].type_flags |= ARGF_REG_ICASE;
|
|
|
|
|
|
}
|
|
|
|
|
|
else if (*p == 'g') {
|
|
|
|
|
|
arg[0].type_flags |= ARGF_REG_GLOB;
|
|
|
|
|
|
}
|
|
|
|
|
|
else {
|
|
|
|
|
|
memprintf(err, "invalid regex flag '%c', only 'i' and 'g' are supported", *p);
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
p++;
|
|
|
|
|
|
len--;
|
|
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* This sample function is designed to do the equivalent of s/match/replace/ on
|
|
|
|
|
|
* the input string. It applies a regex and restarts from the last matched
|
|
|
|
|
|
* location until nothing matches anymore. First arg is the regex to apply to
|
|
|
|
|
|
* the input string, second arg is the replacement expression.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_regsub(const struct arg *arg_p, struct sample *smp, void *private)
|
2015-01-20 13:47:06 -05:00
|
|
|
|
{
|
|
|
|
|
|
char *start, *end;
|
|
|
|
|
|
struct my_regex *reg = arg_p[0].data.reg;
|
|
|
|
|
|
regmatch_t pmatch[MAX_MATCH];
|
|
|
|
|
|
struct chunk *trash = get_trash_chunk();
|
|
|
|
|
|
int flag, max;
|
|
|
|
|
|
int found;
|
|
|
|
|
|
|
|
|
|
|
|
start = smp->data.str.str;
|
|
|
|
|
|
end = start + smp->data.str.len;
|
|
|
|
|
|
|
|
|
|
|
|
flag = 0;
|
|
|
|
|
|
while (1) {
|
|
|
|
|
|
/* check for last round which is used to copy remaining parts
|
|
|
|
|
|
* when not running in global replacement mode.
|
|
|
|
|
|
*/
|
|
|
|
|
|
found = 0;
|
|
|
|
|
|
if ((arg_p[0].type_flags & ARGF_REG_GLOB) || !(flag & REG_NOTBOL)) {
|
|
|
|
|
|
/* Note: we can have start == end on empty strings or at the end */
|
|
|
|
|
|
found = regex_exec_match2(reg, start, end - start, MAX_MATCH, pmatch, flag);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!found)
|
|
|
|
|
|
pmatch[0].rm_so = end - start;
|
|
|
|
|
|
|
|
|
|
|
|
/* copy the heading non-matching part (which may also be the tail if nothing matches) */
|
|
|
|
|
|
max = trash->size - trash->len;
|
|
|
|
|
|
if (max && pmatch[0].rm_so > 0) {
|
|
|
|
|
|
if (max > pmatch[0].rm_so)
|
|
|
|
|
|
max = pmatch[0].rm_so;
|
|
|
|
|
|
memcpy(trash->str + trash->len, start, max);
|
|
|
|
|
|
trash->len += max;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (!found)
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
/* replace the matching part */
|
|
|
|
|
|
max = trash->size - trash->len;
|
|
|
|
|
|
if (max) {
|
|
|
|
|
|
if (max > arg_p[1].data.str.len)
|
|
|
|
|
|
max = arg_p[1].data.str.len;
|
|
|
|
|
|
memcpy(trash->str + trash->len, arg_p[1].data.str.str, max);
|
|
|
|
|
|
trash->len += max;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* stop here if we're done with this string */
|
|
|
|
|
|
if (start >= end)
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
/* We have a special case for matches of length 0 (eg: "x*y*").
|
|
|
|
|
|
* These ones are considered to match in front of a character,
|
|
|
|
|
|
* so we have to copy that character and skip to the next one.
|
|
|
|
|
|
*/
|
|
|
|
|
|
if (!pmatch[0].rm_eo) {
|
|
|
|
|
|
if (trash->len < trash->size)
|
|
|
|
|
|
trash->str[trash->len++] = start[pmatch[0].rm_eo];
|
|
|
|
|
|
pmatch[0].rm_eo++;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
start += pmatch[0].rm_eo;
|
|
|
|
|
|
flag |= REG_NOTBOL;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
smp->data.str = *trash;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies a binary twos complement and returns the SINT
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* result.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_binary_cpl(const struct arg *arg_p, struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = ~smp->data.sint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies a binary "and" with the UINT in arg_p, and
|
|
|
|
|
|
* returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_binary_and(const struct arg *arg_p, struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint &= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies a binary "or" with the UINT in arg_p, and
|
|
|
|
|
|
* returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_binary_or(const struct arg *arg_p, struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint |= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies a binary "xor" with the UINT in arg_p, and
|
|
|
|
|
|
* returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_binary_xor(const struct arg *arg_p, struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint ^= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies an arithmetic "add" with the UINT in arg_p,
|
|
|
|
|
|
* and returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_add(const struct arg *arg_p, struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint += arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies an arithmetic "sub" with the UINT in arg_p,
|
|
|
|
|
|
* and returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_sub(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint -= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies an arithmetic "mul" with the UINT in arg_p,
|
|
|
|
|
|
* and returns the SINT result.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_mul(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint *= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies an arithmetic "div" with the SINT in arg_p,
|
|
|
|
|
|
* and returns the SINT result. If arg_p makes the result overflow, then the
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* largest possible quantity is returned.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_div(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
|
|
|
|
|
if (arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint /= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
else
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = ~0;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, applies an arithmetic "mod" with the SINT in arg_p,
|
|
|
|
|
|
* and returns the SINT result. If arg_p makes the result overflow, then zero
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* is returned.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_mod(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
|
|
|
|
|
if (arg_p->data.uint)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint %= arg_p->data.uint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
else
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = 0;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes an SINT on input, applies an arithmetic "neg" and returns the SINT
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* result.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_neg(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = -smp->data.sint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, returns true is the value is non-null, otherwise
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* false. The output is a BOOL.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_bool(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = !!smp->data.sint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
smp->type = SMP_T_BOOL;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, returns false is the value is non-null, otherwise
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* truee. The output is a BOOL.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_not(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = !smp->data.sint;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
smp->type = SMP_T_BOOL;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, returns true is the value is odd, otherwise false.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* The output is a BOOL.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_odd(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = smp->data.sint & 1;
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
smp->type = SMP_T_BOOL;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
/* Takes a SINT on input, returns true is the value is even, otherwise false.
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
* The output is a BOOL.
|
|
|
|
|
|
*/
|
2015-05-11 09:20:49 -04:00
|
|
|
|
static int sample_conv_arith_even(const struct arg *arg_p,
|
2015-02-23 09:11:11 -05:00
|
|
|
|
struct sample *smp, void *private)
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = !(smp->data.sint & 1);
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
smp->type = SMP_T_BOOL;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-07-25 06:17:57 -04:00
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
/* All supported sample fetch functions must be declared here */
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/* force TRUE to be returned at the fetch level */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_true(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2013-07-25 06:17:57 -04:00
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_BOOL;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = 1;
|
2013-07-25 06:17:57 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* force FALSE to be returned at the fetch level */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_false(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2013-07-25 06:17:57 -04:00
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_BOOL;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = 0;
|
2013-07-25 06:17:57 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* retrieve environment variable $1 as a string */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_env(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2013-07-25 06:17:57 -04:00
|
|
|
|
{
|
|
|
|
|
|
char *env;
|
|
|
|
|
|
|
|
|
|
|
|
if (!args || args[0].type != ARGT_STR)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
|
|
env = getenv(args[0].data.str.str);
|
|
|
|
|
|
if (!env)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
2013-12-16 18:20:33 -05:00
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
smp->flags = SMP_F_CONST;
|
2013-07-25 06:17:57 -04:00
|
|
|
|
smp->data.str.str = env;
|
|
|
|
|
|
smp->data.str.len = strlen(env);
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-07-25 08:28:25 -04:00
|
|
|
|
/* retrieve the current local date in epoch time, and applies an optional offset
|
|
|
|
|
|
* of args[0] seconds.
|
|
|
|
|
|
*/
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_date(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2013-07-25 08:28:25 -04:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = date.tv_sec;
|
2013-07-25 08:28:25 -04:00
|
|
|
|
|
|
|
|
|
|
/* add offset */
|
|
|
|
|
|
if (args && (args[0].type == ARGT_SINT || args[0].type == ARGT_UINT))
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint += args[0].data.sint;
|
2013-07-25 08:28:25 -04:00
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->type = SMP_T_SINT;
|
2013-07-25 08:28:25 -04:00
|
|
|
|
smp->flags |= SMP_F_VOL_TEST | SMP_F_MAY_CHANGE;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-24 10:02:05 -05:00
|
|
|
|
/* returns the number of processes */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_nbproc(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2014-11-24 10:02:05 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->type = SMP_T_SINT;
|
|
|
|
|
|
smp->data.sint = global.nbproc;
|
2014-11-24 10:02:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* returns the number of the current process (between 1 and nbproc */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_proc(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2014-11-24 10:02:05 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->type = SMP_T_SINT;
|
|
|
|
|
|
smp->data.sint = relative_pid;
|
2014-11-24 10:02:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-02-14 05:59:04 -05:00
|
|
|
|
/* generate a random 32-bit integer for whatever purpose, with an optional
|
|
|
|
|
|
* range specified in argument.
|
|
|
|
|
|
*/
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_rand(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2014-02-14 05:59:04 -05:00
|
|
|
|
{
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = random();
|
2014-02-14 05:59:04 -05:00
|
|
|
|
|
|
|
|
|
|
/* reduce if needed. Don't do a modulo, use all bits! */
|
|
|
|
|
|
if (args && args[0].type == ARGT_UINT)
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = (smp->data.sint * args[0].data.uint) / ((u64)RAND_MAX+1);
|
2014-02-14 05:59:04 -05:00
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->type = SMP_T_SINT;
|
2014-02-14 05:59:04 -05:00
|
|
|
|
smp->flags |= SMP_F_VOL_TEST | SMP_F_MAY_CHANGE;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2014-11-24 10:02:05 -05:00
|
|
|
|
/* returns true if the current process is stopping */
|
|
|
|
|
|
static int
|
2015-05-11 09:42:45 -04:00
|
|
|
|
smp_fetch_stopping(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2014-11-24 10:02:05 -05:00
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_BOOL;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = stopping;
|
2014-11-24 10:02:05 -05:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-06-06 13:30:17 -04:00
|
|
|
|
static int smp_fetch_const_str(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->flags |= SMP_F_CONST;
|
|
|
|
|
|
smp->type = SMP_T_STR;
|
|
|
|
|
|
smp->data.str.str = args[0].data.str.str;
|
|
|
|
|
|
smp->data.str.len = args[0].data.str.len;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_check_const_bool(struct arg *args, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (strcasecmp(args[0].data.str.str, "true") == 0 ||
|
|
|
|
|
|
strcasecmp(args[0].data.str.str, "1") == 0) {
|
|
|
|
|
|
args[0].type = ARGT_UINT;
|
|
|
|
|
|
args[0].data.uint = 1;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
if (strcasecmp(args[0].data.str.str, "false") == 0 ||
|
|
|
|
|
|
strcasecmp(args[0].data.str.str, "0") == 0) {
|
|
|
|
|
|
args[0].type = ARGT_UINT;
|
|
|
|
|
|
args[0].data.uint = 0;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
memprintf(err, "Expects 'true', 'false', '0' or '1'");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_fetch_const_bool(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_BOOL;
|
2015-07-06 17:43:03 -04:00
|
|
|
|
smp->data.sint = args[0].data.uint;
|
2015-06-06 13:30:17 -04:00
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
static int smp_fetch_const_int(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
2015-06-06 13:30:17 -04:00
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_SINT;
|
|
|
|
|
|
smp->data.sint = args[0].data.sint;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_fetch_const_ipv4(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_IPV4;
|
|
|
|
|
|
smp->data.ipv4 = args[0].data.ipv4;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_fetch_const_ipv6(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_IPV6;
|
|
|
|
|
|
smp->data.ipv6 = args[0].data.ipv6;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_check_const_bin(struct arg *args, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
char *binstr;
|
|
|
|
|
|
int binstrlen;
|
|
|
|
|
|
|
|
|
|
|
|
if (!parse_binary(args[0].data.str.str, &binstr, &binstrlen, err))
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
args[0].type = ARGT_STR;
|
|
|
|
|
|
args[0].data.str.str = binstr;
|
|
|
|
|
|
args[0].data.str.len = binstrlen;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_fetch_const_bin(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->flags |= SMP_F_CONST;
|
|
|
|
|
|
smp->type = SMP_T_BIN;
|
|
|
|
|
|
smp->data.str.str = args[0].data.str.str;
|
|
|
|
|
|
smp->data.str.len = args[0].data.str.len;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_check_const_meth(struct arg *args, char **err)
|
|
|
|
|
|
{
|
|
|
|
|
|
enum http_meth_t meth;
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
|
|
meth = find_http_meth(args[0].data.str.str, args[0].data.str.len);
|
|
|
|
|
|
if (meth != HTTP_METH_OTHER) {
|
|
|
|
|
|
args[0].type = ARGT_UINT;
|
|
|
|
|
|
args[0].data.uint = meth;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
/* Check method avalaibility. A methos is a token defined as :
|
|
|
|
|
|
* tchar = "!" / "#" / "$" / "%" / "&" / "'" / "*" / "+" / "-" / "." /
|
|
|
|
|
|
* "^" / "_" / "`" / "|" / "~" / DIGIT / ALPHA
|
|
|
|
|
|
* token = 1*tchar
|
|
|
|
|
|
*/
|
|
|
|
|
|
for (i = 0; i < args[0].data.str.len; i++) {
|
|
|
|
|
|
if (!http_is_token[(unsigned char)args[0].data.str.str[i]]) {
|
|
|
|
|
|
memprintf(err, "expects valid method.");
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int smp_fetch_const_meth(const struct arg *args, struct sample *smp, const char *kw, void *private)
|
|
|
|
|
|
{
|
|
|
|
|
|
smp->type = SMP_T_METH;
|
|
|
|
|
|
if (args[0].type == ARGT_UINT) {
|
|
|
|
|
|
smp->flags &= ~SMP_F_CONST;
|
|
|
|
|
|
smp->data.meth.meth = args[0].data.uint;
|
|
|
|
|
|
smp->data.meth.str.str = "";
|
|
|
|
|
|
smp->data.meth.str.len = 0;
|
|
|
|
|
|
} else {
|
|
|
|
|
|
smp->flags |= SMP_F_CONST;
|
|
|
|
|
|
smp->data.meth.meth = HTTP_METH_OTHER;
|
|
|
|
|
|
smp->data.meth.str.str = args[0].data.str.str;
|
|
|
|
|
|
smp->data.meth.str.len = args[0].data.str.len;
|
|
|
|
|
|
}
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2013-07-25 06:17:57 -04:00
|
|
|
|
/* Note: must not be declared <const> as its list will be overwritten.
|
|
|
|
|
|
* Note: fetches that may return multiple types must be declared as the lowest
|
|
|
|
|
|
* common denominator, the type that can be casted into all other ones. For
|
|
|
|
|
|
* instance IPv4/IPv6 must be declared IPv4.
|
|
|
|
|
|
*/
|
|
|
|
|
|
static struct sample_fetch_kw_list smp_kws = {ILH, {
|
|
|
|
|
|
{ "always_false", smp_fetch_false, 0, NULL, SMP_T_BOOL, SMP_USE_INTRN },
|
|
|
|
|
|
{ "always_true", smp_fetch_true, 0, NULL, SMP_T_BOOL, SMP_USE_INTRN },
|
2013-12-16 18:20:33 -05:00
|
|
|
|
{ "env", smp_fetch_env, ARG1(1,STR), NULL, SMP_T_STR, SMP_USE_INTRN },
|
2015-07-06 17:43:03 -04:00
|
|
|
|
{ "date", smp_fetch_date, ARG1(0,SINT), NULL, SMP_T_SINT, SMP_USE_INTRN },
|
|
|
|
|
|
{ "nbproc", smp_fetch_nbproc,0, NULL, SMP_T_SINT, SMP_USE_INTRN },
|
|
|
|
|
|
{ "proc", smp_fetch_proc, 0, NULL, SMP_T_SINT, SMP_USE_INTRN },
|
|
|
|
|
|
{ "rand", smp_fetch_rand, ARG1(0,UINT), NULL, SMP_T_SINT, SMP_USE_INTRN },
|
2014-11-24 10:02:05 -05:00
|
|
|
|
{ "stopping", smp_fetch_stopping, 0, NULL, SMP_T_BOOL, SMP_USE_INTRN },
|
2015-06-06 13:30:17 -04:00
|
|
|
|
|
|
|
|
|
|
{ "str", smp_fetch_const_str, ARG1(1,STR), NULL , SMP_T_STR, SMP_USE_INTRN },
|
|
|
|
|
|
{ "bool", smp_fetch_const_bool, ARG1(1,STR), smp_check_const_bool, SMP_T_BOOL, SMP_USE_INTRN },
|
2015-07-06 17:43:03 -04:00
|
|
|
|
{ "int", smp_fetch_const_int, ARG1(1,SINT), NULL , SMP_T_SINT, SMP_USE_INTRN },
|
2015-06-06 13:30:17 -04:00
|
|
|
|
{ "ipv4", smp_fetch_const_ipv4, ARG1(1,IPV4), NULL , SMP_T_IPV4, SMP_USE_INTRN },
|
|
|
|
|
|
{ "ipv6", smp_fetch_const_ipv6, ARG1(1,IPV6), NULL , SMP_T_IPV6, SMP_USE_INTRN },
|
|
|
|
|
|
{ "bin", smp_fetch_const_bin, ARG1(1,STR), smp_check_const_bin , SMP_T_BIN, SMP_USE_INTRN },
|
|
|
|
|
|
{ "meth", smp_fetch_const_meth, ARG1(1,STR), smp_check_const_meth, SMP_T_METH, SMP_USE_INTRN },
|
|
|
|
|
|
|
2013-07-25 06:17:57 -04:00
|
|
|
|
{ /* END */ },
|
|
|
|
|
|
}};
|
|
|
|
|
|
|
2010-01-04 10:16:05 -05:00
|
|
|
|
/* Note: must not be declared <const> as its list will be overwritten */
|
2013-06-21 17:16:39 -04:00
|
|
|
|
static struct sample_conv_kw_list sample_conv_kws = {ILH, {
|
2015-05-07 09:46:29 -04:00
|
|
|
|
#ifdef DEBUG_EXPR
|
|
|
|
|
|
{ "debug", sample_conv_debug, 0, NULL, SMP_T_ANY, SMP_T_ANY },
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
2014-04-30 12:21:37 -04:00
|
|
|
|
{ "base64", sample_conv_bin2base64,0, NULL, SMP_T_BIN, SMP_T_STR },
|
2012-04-27 15:37:17 -04:00
|
|
|
|
{ "upper", sample_conv_str2upper, 0, NULL, SMP_T_STR, SMP_T_STR },
|
|
|
|
|
|
{ "lower", sample_conv_str2lower, 0, NULL, SMP_T_STR, SMP_T_STR },
|
2014-03-12 10:01:52 -04:00
|
|
|
|
{ "hex", sample_conv_bin2hex, 0, NULL, SMP_T_BIN, SMP_T_STR },
|
2012-04-27 15:37:17 -04:00
|
|
|
|
{ "ipmask", sample_conv_ipmask, ARG1(1,MSK4), NULL, SMP_T_IPV4, SMP_T_IPV4 },
|
2015-07-06 17:43:03 -04:00
|
|
|
|
{ "ltime", sample_conv_ltime, ARG2(1,STR,SINT), NULL, SMP_T_SINT, SMP_T_STR },
|
|
|
|
|
|
{ "utime", sample_conv_utime, ARG2(1,STR,SINT), NULL, SMP_T_SINT, SMP_T_STR },
|
|
|
|
|
|
{ "crc32", sample_conv_crc32, ARG1(0,UINT), NULL, SMP_T_BIN, SMP_T_SINT },
|
|
|
|
|
|
{ "djb2", sample_conv_djb2, ARG1(0,UINT), NULL, SMP_T_BIN, SMP_T_SINT },
|
|
|
|
|
|
{ "sdbm", sample_conv_sdbm, ARG1(0,UINT), NULL, SMP_T_BIN, SMP_T_SINT },
|
|
|
|
|
|
{ "wt6", sample_conv_wt6, ARG1(0,UINT), NULL, SMP_T_BIN, SMP_T_SINT },
|
MINOR: sample: add "json" converter
This converter escapes string to use it as json/ascii escaped string.
It can read UTF-8 with differents behavior on errors and encode it in
json/ascii.
json([<input-code>])
Escapes the input string and produces an ASCII ouput string ready to use as a
JSON string. The converter tries to decode the input string according to the
<input-code> parameter. It can be "ascii", "utf8", "utf8s", "utf8"" or
"utf8ps". The "ascii" decoder never fails. The "utf8" decoder detects 3 types
of errors:
- bad UTF-8 sequence (lone continuation byte, bad number of continuation
bytes, ...)
- invalid range (the decoded value is within a UTF-8 prohibited range),
- code overlong (the value is encoded with more bytes than necessary).
The UTF-8 JSON encoding can produce a "too long value" error when the UTF-8
character is greater than 0xffff because the JSON string escape specification
only authorizes 4 hex digits for the value encoding. The UTF-8 decoder exists
in 4 variants designated by a combination of two suffix letters : "p" for
"permissive" and "s" for "silently ignore". The behaviors of the decoders
are :
- "ascii" : never fails ;
- "utf8" : fails on any detected errors ;
- "utf8s" : never fails, but removes characters corresponding to errors ;
- "utf8p" : accepts and fixes the overlong errors, but fails on any other
error ;
- "utf8ps" : never fails, accepts and fixes the overlong errors, but removes
characters corresponding to the other errors.
This converter is particularly useful for building properly escaped JSON for
logging to servers which consume JSON-formated traffic logs.
Example:
capture request header user-agent len 150
capture request header Host len 15
log-format {"ip":"%[src]","user-agent":"%[capture.req.hdr(1),json]"}
Input request from client 127.0.0.1:
GET / HTTP/1.0
User-Agent: Very "Ugly" UA 1/2
Output log:
{"ip":"127.0.0.1","user-agent":"Very \"Ugly\" UA 1\/2"}
2014-08-12 04:20:47 -04:00
|
|
|
|
{ "json", sample_conv_json, ARG1(1,STR), sample_conv_json_check, SMP_T_STR, SMP_T_STR },
|
2014-11-03 09:32:43 -05:00
|
|
|
|
{ "bytes", sample_conv_bytes, ARG2(1,UINT,UINT), NULL, SMP_T_BIN, SMP_T_BIN },
|
2014-11-03 11:07:03 -05:00
|
|
|
|
{ "field", sample_conv_field, ARG2(2,UINT,STR), sample_conv_field_check, SMP_T_STR, SMP_T_STR },
|
2014-11-25 08:09:01 -05:00
|
|
|
|
{ "word", sample_conv_word, ARG2(2,UINT,STR), sample_conv_field_check, SMP_T_STR, SMP_T_STR },
|
2015-01-20 13:47:06 -05:00
|
|
|
|
{ "regsub", sample_conv_regsub, ARG3(2,REG,STR,STR), sample_conv_regsub_check, SMP_T_STR, SMP_T_STR },
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
|
2015-07-06 17:43:03 -04:00
|
|
|
|
{ "and", sample_conv_binary_and, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "or", sample_conv_binary_or, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "xor", sample_conv_binary_xor, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "cpl", sample_conv_binary_cpl, 0, NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "bool", sample_conv_arith_bool, 0, NULL, SMP_T_SINT, SMP_T_BOOL },
|
|
|
|
|
|
{ "not", sample_conv_arith_not, 0, NULL, SMP_T_SINT, SMP_T_BOOL },
|
|
|
|
|
|
{ "odd", sample_conv_arith_odd, 0, NULL, SMP_T_SINT, SMP_T_BOOL },
|
|
|
|
|
|
{ "even", sample_conv_arith_even, 0, NULL, SMP_T_SINT, SMP_T_BOOL },
|
|
|
|
|
|
{ "add", sample_conv_arith_add, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "sub", sample_conv_arith_sub, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "mul", sample_conv_arith_mul, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "div", sample_conv_arith_div, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "mod", sample_conv_arith_mod, ARG1(1,UINT), NULL, SMP_T_SINT, SMP_T_SINT },
|
|
|
|
|
|
{ "neg", sample_conv_arith_neg, 0, NULL, SMP_T_SINT, SMP_T_SINT },
|
MEDIUM: samples: provide basic arithmetic and bitwise operators
This commit introduces a new category of converters. They are bitwise and
arithmetic operators which support performing basic operations on integers.
Some bitwise operations are supported (and, or, xor, cpl) and some arithmetic
operations are supported (add, sub, mul, div, mod, neg). Some comparators
are provided (odd, even, not, bool) which make it possible to report a match
without having to write an ACL.
The detailed list of new operators as they appear in the doc is :
add(<value>)
Adds <value> to the input value of type unsigned integer, and returns the
result as an unsigned integer.
and(<value>)
Performs a bitwise "AND" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
bool
Returns a boolean TRUE if the input value of type unsigned integer is
non-null, otherwise returns FALSE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
presence of a flag).
cpl
Takes the input value of type unsigned integer, applies a twos-complement
(flips all bits) and returns the result as an unsigned integer.
div(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
result as an unsigned integer. If <value> is null, the largest unsigned
integer is returned (typically 2^32-1).
even
Returns a boolean TRUE if the input value of type unsigned integer is even
otherwise returns FALSE. It is functionally equivalent to "not,and(1),bool".
mod(<value>)
Divides the input value of type unsigned integer by <value>, and returns the
remainder as an unsigned integer. If <value> is null, then zero is returned.
mul(<value>)
Multiplies the input value of type unsigned integer by <value>, and returns
the product as an unsigned integer. In case of overflow, the higher bits are
lost, leading to seemingly strange values.
neg
Takes the input value of type unsigned integer, computes the opposite value,
and returns the remainder as an unsigned integer. 0 is identity. This
operator is provided for reversed subtracts : in order to subtract the input
from a constant, simply perform a "neg,add(value)".
not
Returns a boolean FALSE if the input value of type unsigned integer is
non-null, otherwise returns TRUE. Used in conjunction with and(), it can be
used to report true/false for bit testing on input values (eg: verify the
absence of a flag).
odd
Returns a boolean TRUE if the input value of type unsigned integer is odd
otherwise returns FALSE. It is functionally equivalent to "and(1),bool".
or(<value>)
Performs a bitwise "OR" between <value> and the input value of type unsigned
integer, and returns the result as an unsigned integer.
sub(<value>)
Subtracts <value> from the input value of type unsigned integer, and returns
the result as an unsigned integer. Note: in order to subtract the input from
a constant, simply perform a "neg,add(value)".
xor(<value>)
Performs a bitwise "XOR" (exclusive OR) between <value> and the input value
of type unsigned integer, and returns the result as an unsigned integer.
2015-01-27 09:12:13 -05:00
|
|
|
|
|
2012-04-20 08:45:49 -04:00
|
|
|
|
{ NULL, NULL, 0, 0, 0 },
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}};
|
|
|
|
|
|
|
|
|
|
|
|
__attribute__((constructor))
|
2012-04-27 15:37:17 -04:00
|
|
|
|
static void __sample_init(void)
|
2010-01-04 10:16:05 -05:00
|
|
|
|
{
|
2013-07-25 06:17:57 -04:00
|
|
|
|
/* register sample fetch and format conversion keywords */
|
|
|
|
|
|
sample_register_fetches(&smp_kws);
|
2012-04-27 15:37:17 -04:00
|
|
|
|
sample_register_convs(&sample_conv_kws);
|
2010-01-04 10:16:05 -05:00
|
|
|
|
}
|