1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
|
/**
* Utility for the quality of service module mod_qos.
*
* qsrespeed.c: tool to measure the processing time
* of regular expressions
*
* See http://mod-qos.sourceforge.net/ for further
* details.
*
* Copyright (C) 2023 Pascal Buchbinder
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
static const char revision[] = "$Revision: 2654 $";
/* system */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <time.h>
/* apr */
#include <apr.h>
#include <apr_strings.h>
#include <apr_time.h>
#include <apr_general.h>
#include <apr_lib.h>
#include <apr_portable.h>
#include <apr_support.h>
#define PCRE2_CODE_UNIT_WIDTH 8
#include <pcre2.h>
#include "qs_util.h"
#define LOOPS 100
typedef struct {
qs_regex_t *preg;
} rule_t;
static void usage(const char *cmd, int man) {
if(man) {
//.TH [name of program] [section number] [center footer] [left footer] [center header]
printf(".TH %s 1 \"%s\" \"mod_qos utilities %s\" \"%s man page\"\n", qs_CMD(cmd), man_date,
man_version, cmd);
}
printf("\n");
if(man) {
printf(".SH NAME\n");
}
qs_man_print(man, "Tool to compare / estimate the processing time for (Perl-compatible)\n");
qs_man_print(man, "regular expressions (PCRE).\n");
printf("\n");
if(man) {
printf(".SH SYNOPSIS\n");
}
qs_man_print(man, "%s%s <path>\n", man ? "" : "Usage: ", cmd);
printf("\n");
if(man) {
printf(".SH DESCRIPTION\n");
} else {
printf("Summary\n");
}
qs_man_print(man, "%s loads regular expressions from the provided file and matches\n", cmd);
qs_man_print(man, "them against a built-in set of strings measuring the time needed to\n");
qs_man_print(man, "process them. It's a benchmark too to judge the expressions you have\n");
qs_man_print(man, "defined regarding the potential CPU consumption.\n");
printf("\n");
if(man) {
printf(".SH OPTIONS\n");
} else {
printf("Options\n");
}
if(man) printf(".TP\n");
qs_man_print(man, " <path>\n");
if(man) printf("\n");
qs_man_print(man, " Defines the input file to process. The file consists a list of\n");
qs_man_print(man, " (separated by a newline character) regular expressions to test\n");
printf("\n");
if(man) {
printf(".SH SEE ALSO\n");
printf("qsdt(1), qsexec(1), qsfilter2(1), qsgeo(1), qsgrep(1), qshead(1), qslog(1), qslogger(1), qspng(1), qsre(1), qsrotate(1), qssign(1), qstail(1)\n");
printf(".SH AUTHOR\n");
printf("Pascal Buchbinder, http://mod-qos.sourceforge.net/\n");
} else {
printf("See http://mod-qos.sourceforge.net/ for further details.\n");
}
if(man) {
exit(0);
} else {
exit(1);
}
}
typedef struct {
const char* string;
int len;
} qs_r_t;
int main(int argc, const char *const argv[]) {
int datalen=0;
qs_r_t data[] = {
{ "Emma", 0 },
{ "Buchschacher", 0 },
{ "Schafhauserstrasse 60, 8000 Zürich", 0 },
{ "128128127136178267893209807237276365235", 0 },
{ "/get/application/data/index/list/all/data", 0 },
{ "05.03.1978", 0 },
{ "888 888-888-777", 0 },
{ "name=value&id=kAfBFLJaBQB-AAABBQAAAAZgAAAA9--DwnTUWct-AAA2&host=me.main.org&key=121213122aaaaaaaaaaMMMM123&tex=emb+ed", 0 },
{ "<x:ml><node attribute=\"value\" attr2=\"99999999\">text shows_this!</node></x:ml>", 0 },
{ "<html lang=\"en\"><meta charset=\"utf-8\"><meta property=\"og:type\" content=\"website\"></html>", 0 },
{ "lajksdfhjklasdhfaskdjfhklasjdlfaksdhfasjkdflsajkdflkdflhdjklfadhfksdjfhklasjdhfskljdfhsklajdhflskjdfhlskjhdflksjdhlfksjdhfjklsdhfklsdhfklsjdhklshlksfhdklfhslkdfhlskhdklsjhdflskfhlsh", 0 },
{ "ajksdfhjklasdhfaskdjfhklasjdlfaksdhfasjkdflsajkdflkdflhdjklfadhfksdjfhklasjdhfskljdfhsklajdhflskjdfhlskjhdflksjdhlfksjdhfjklsdhfklsdhfklsjdhklshlksfljsdahsdznvztbasmuiwmereizfrbizvnsdmovosduvnuztbvzucxzvmpmvdzubtfrmeirmrnbewrJHJSBNUAIMSODMAINBSUDTAZSUDIOASMDNBAGZDTSZBUANIMOINSAUBZDGTZUIOIMSKNABJDHT9807765243567283992039209376526368799230827836526789 ç%&/\"(><<<-.,:;)*=)()(&%\"ç", 0 },
{ "text/html,application/xhtml+xm…plication/xml;q=0.9,*/*;q=0.8", 0 },
{ "Accept-Language: fr-CH, fr;q=0.9, en;q=0.8, de;q=0.7, *;q=0.5", 0},
{ "Hm_lvt_ef1299edab2ff5d2f13e859…d=GA1.2.1594867574.1516566392", 0 },
{ "If-Modified-Since", 0 },
{ "Fri, 05 Jan 2018 02:34:41 GMT", 0 },
{ "[Wed Feb 28 22:08:09 2018] [notice] Apache/2.2.34 (Unix) mod_ssl/2.2.34 OpenSSL/1.0.2g mod_qos/11.52 configured -- resuming normal operations", 0 },
{ "127.0.0.1 - - [28/Feb/2018:21:03:37 +0100] \"GET /console?action=inclimit&address=194.31.217.21&event=QS_Limit HTTP/1.1\" 200 52 \"-\" 0 - - - id=wWkYPUtmBQARFAABEAAAAAAX-yQgC5d2 - - #5230", 0 },
{ "2013/11/07 17:44:07 [error] 4640#0: *55 auth_token_module(014): request not authorized: invalid signature, client: 127.0.0.1, server: localhost, request: \"GET /app/index.html?req=1 HTTP/1.1\", host: \"127.0.0.1:8204\" 000000000002#IPhzBRn7cuuGdqBI7T4OSIjXx7JGliUokCk8dFIU9n0=", 0 },
{ "2010 12 04 20:46:45.118 dispatch IWWWauthCo 07148.4046314384 3-ERROR : AuthsessClient_1_0::execute: no valid 000000000002#5jYHrFBotkZwAs5EyfVQVgNZb3M=", 0 },
{ "2011-09-01 07:37:17,275 main org.apache.catalina.startup.Catalina INFO Server startup in 5770 ms 000000000002#LQ/h2UbJ2HzdZyf8BqnB7TB8LZM=", 0 },
{ "2010-04-14 20:18:37,464 | INFO | org.hibernate.cfg ::getInputStream:1081 resource: /hibernate.cfg.xml 000000000002#9lpZof9jvdMRrIebCM7rbKzJ7aY=", 0 },
{ "http://mod-qos.sourceforge.net/", 0 },
{ "Mozilla/5.0 (X11; Ubuntu; Linu…) Gecko/20100101 Firefox/57.0", 0 },
{ " Whether 'tis nobler in the mind to suffer The slings and arrows of outrageous fortune, Or to take arms against a sea of troubles, And by opposing end them? To die: to sleep; No more; and by a sleep to say we end The heart-ache and the thousand natural shocks That flesh is heir to, 'tis a consummation Devoutly to be wish'd.", 0 },
{ "To be, or not to be: that is the question: Whether 'tis nobler in the mind to suffer The slings and arrows of outrageous fortune, Or to take arms against a sea of troubles, And by opposing end them? To die: to sleep; No more; and by a sleep to say we end The heart-ache and the thousand natural shocks That flesh is heir to, 'tis a consummation Devoutly to be wish'd. To die, to sleep; To sleep: perchance to dream: ay, there's the rub; For in that sleep of death what dreams may come When we have shuffled off this mortal coil, Must give us pause: there's the respect That makes calamity of so long life; For who would bear the whips and scorns of time, The oppressor's wrong, the proud man's contumely, The pangs of despised love, the law's delay, The insolence of office and the spurns That patient merit of the unworthy takes, When he himself might his quietus make With a bare bodkin? who would fardels bear, To grunt and sweat under a weary life, But that the dread of something after death, The undiscover'd country from whose bourn No traveller returns, puzzles the will And makes us rather bear those ills we have Than fly to others that we know not of? Thus conscience does make cowards of us all; And thus the native hue of resolution Is sicklied o'er with the pale cast of thought, And enterprises of great pith and moment With this regard their currents turn awry, And lose the name of action.--Soft you now! The fair Ophelia! Nymph, in thy orisonsBe all my sins remember'd.", 0 },
{ "{\n" \
" \"_to\": \"1.2.3.4:5678\",\n" \
" \"_line\": 63546230,\n" \
" \"profile_image_url\": \"http://a3.twimg.com/profile_images/852841481/Untitled_3_normal.jpg\",\n" \
" \"created_at\": \"Sat, 08 May 2010 21:46:23 +0000\",\n" \
" \"from_user\": \"pelchiie\",\n" \
" \"metadata\": {\n" \
" \"result_type\": \"recent\"\n" \
" },\n" \
" \"to_user_id\": null,\n" \
" \"text\": \"twitter is dead today.\",\n" \
" \"id\": 13630378882,\n" \
" \"from_user_id\": 12621761,\n" \
" \"geo\": null,\n" \
" \"iso_language_code\": \"en\",\n" \
" \"source\": \"<a href=\\\"http://twitter.com/\\\">web</a>\"\n" \
"}", 0 },
{ NULL, 0 }
};
int i;
FILE *file;
char readline[MAX_LINE];
const char *cmd = strrchr(argv[0], '/');
apr_pool_t *pool;
apr_table_t *rules;
long long start;
long long end;
struct timeval tv;
static char ver[80];
const char *filename = NULL;
if(cmd == NULL) {
cmd = (char *)argv[0];
} else {
cmd++;
}
apr_app_initialize(&argc, &argv, NULL);
apr_pool_create(&pool, NULL);
rules = apr_table_make(pool, 100);
argc--;
argv++;
while(argc >= 1) {
if(strcmp(*argv,"-h") == 0) {
usage(cmd, 0);
} else if(strcmp(*argv,"--help") == 0) {
usage(cmd, 0);
} else if(strcmp(*argv,"-?") == 0) {
usage(cmd, 0);
} else if(strcmp(*argv,"--man") == 0) {
usage(cmd, 1);
} else {
filename = *argv;
}
argc--;
argv++;
}
{
// init
qs_r_t *d = data;
while(d->string) {
d->len = strlen(d->string);
datalen += d->len;
d++;
}
}
if(filename == NULL) {
usage(cmd, 0);
}
file = fopen(filename, "r");
if(!file) {
fprintf(stderr, "ERROR, failed to open the log file '%s'\n", filename);
exit(1);
}
while(fgets(readline, MAX_LINE-1, file) != NULL) {
char *p;
int len = strlen(readline);
rule_t *rule = apr_pcalloc(pool, sizeof(rule_t));
while(len > 0 && readline[len] < 32) {
readline[len] = '\0';
len--;
}
if((strlen(readline) > 0) &&
(readline[0] != CR) &&
(readline[0] != LF)) {
p = readline;
rule->preg = apr_palloc(pool, sizeof(qs_regex_t));
if(qs_regcomp(rule->preg, p, PCRE2_DOTALL|PCRE2_CASELESS) != 0) {
printf("failed to compile pattern [%s]\n", p);
exit(1);
}
apr_pool_pre_cleanup_register(pool, rule->preg, qs_pregfree);
apr_table_addn(rules, apr_pstrdup(pool, p), (char *)rule);
}
}
{ // per rule
int k;
apr_table_entry_t *entry = (apr_table_entry_t *)apr_table_elts(rules)->elts;
for(k = 0; k < apr_table_elts(rules)->nelts; k++) {
rule_t* rule = (rule_t *)entry[k].val;
gettimeofday(&tv, NULL);
start = tv.tv_sec * 1000000 + tv.tv_usec;
for(i = 0; i < LOOPS; i++) {
qs_r_t *d = data;
while(d->string) {
qs_regexec_len(rule->preg, d->string, d->len, 0, NULL, 0);
d++;
}
}
gettimeofday(&tv, NULL);
end = tv.tv_sec * 1000000 + tv.tv_usec;
printf("%lld usec for %s\n", (end - start)/LOOPS, entry[k].key);
}
}
// all rules
gettimeofday(&tv, NULL);
start = tv.tv_sec * 1000000 + tv.tv_usec;
for(i = 0; i < LOOPS; i++) {
const qs_r_t *d = data;
while(d->string) {
int k;
apr_table_entry_t *entry = (apr_table_entry_t *)apr_table_elts(rules)->elts;
for(k = 0; k < apr_table_elts(rules)->nelts; k++) {
rule_t* rule = (rule_t *)entry[k].val;
qs_regexec_len(rule->preg, d->string, d->len, 0, NULL, 0);
}
d++;
}
}
gettimeofday(&tv, NULL);
end = tv.tv_sec * 1000000 + tv.tv_usec;
pcre2_config(PCRE2_CONFIG_VERSION, ver);
printf("match all rules (%d) against the test variables (%lu strings, %d characters) took: %lld usec (%s/PCRE %s)\n",
apr_table_elts(rules)->nelts,
sizeof(data)/sizeof(qs_r_t)-1,
datalen,
(end - start) / LOOPS,
revision, ver);
return 0;
}
|