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
|
/*
* Copyright (C) 2024-2025 Colin Ian King.
*
* 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.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "stress-ng.h"
static const stress_help_t help[] = {
{ NULL, "regex N", "start N workers exercise POSIX regular expressions" },
{ NULL, "regex-ops N", "stop after N regular expression operations" },
{ NULL, NULL, NULL }
};
#if defined(HAVE_REGEX_H) && \
defined(HAVE_REGCOMP) && \
defined(HAVE_REGERROR) && \
defined(HAVE_REGEXEC) && \
defined(HAVE_REGFREE)
#include <regex.h>
#define N_REGEXES SIZEOF_ARRAY(stress_posix_regex)
typedef struct stress_posix_regex {
const char *regex;
const char *description;
} stress_posix_regex_t;
static const stress_posix_regex_t stress_posix_regex[] = {
{ "^(((((((((((((([a-z])*)*)*)*)*)*)*)*)*)*)*)*)*)*", "devious alphas" },
{ "^(((((((((((((([0-9])*)*)*)*)*)*)*)*)*)*)*)*)*)*", "devious digits" },
{ "(([a-z])+.)+", "pathological" },
{ "^.*$", "match all" },
{ "^[0-9]*$", "positive integers" },
/* { "([0-9][0-9]+?,[0-9]*?)", "lazy numbers" }, */
{ "([0-9]+,[0-9]*)", "greedy numbers" },
{ "^[+-]?[0-9]*$", "integers" },
{ "^[-+]?[0-9]*\\.?[0-9]+([eE][-+]?[0-9]+)?.$", "floating point" },
{ "^(([0-9]|[1-9][0-9]|1[0-9]{2}|2[0-4][0-9]|25[0-5])\\.){3}([0-9]|[1-9][0-9]|1[0-9]{2}|2[0-4][0-9]|25[0-5])$", "IP-address" },
{ "^0x[0-9A-Fa-f]+", "hexadecimal" },
{ "^[a-zA-Z0-9+/]+", "base64" },
{ "^([Mm]on|[Tt]ues|[Ww]ednes|[Tt]hurs|[Ff]ri|[Ss]at|[Ss]un)day", "Days" },
{ "^([01]?[0-9]|2[0-3]):[0-5]?[0-9]:([0-5]?[0-9])$", "HH:MM:SS" },
{ "^([0-9][0-9][0-9][0-9])/(0[1-9]|1[0-2])/(0[1-9]|[12][0-9]|3[0-1])", "YYYY/MM/DD" },
};
static const char * const stress_regex_text[] = {
"28742",
"1984",
"-1984",
"0xc13eb9a621bd",
"0x00000000000000000000000000000000000000000000000000000000000000001",
"0x0123456789abcdef",
"0x0123456789ABCDEF",
"12,345",
"12,345,678",
"12,345,678,901",
"12:45:57",
"23:59:59",
"24:00:00",
"00:00:00",
"17.9",
"07919",
"-3.14159265358979323846264338327950288419716939937510582097494459230781640628620899",
"-12.4E23",
"1.437676376e-12",
"fred@somewhere.com",
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa!",
"Proin dignissim, erat nec interdum commodo, nulla mi tempor dui, quis scelerisque odio nisi in tortor.",
"1.1.1.1",
"192.168.122.1",
"255.255.255.0",
"255.255.255.256",
"2024/12/31",
"2026/01/01",
"2026/09/01",
"2026/00/01",
"2026/12/32",
"Tuesday",
"monday",
"Friday",
"FridaY",
"example.sqltest.com",
"bbc.co.uk",
"google.com",
};
static double stress_regex_rate(double t[N_REGEXES], uint64_t c[N_REGEXES])
{
size_t i;
double t_total = 0.0;
uint64_t c_total = 0;
for (i = 0; i < N_REGEXES; i++) {
t_total += t[i];
c_total += c[i];
}
return (t_total > 0.0) ? (double)c_total / t_total : 0.0;
}
/*
* stress_regex()
* stress POSIX regular expressions
*/
static int stress_regex(stress_args_t *args)
{
size_t i;
double comp_times[N_REGEXES];
double exec_times[N_REGEXES];
uint64_t comp_count[N_REGEXES];
uint64_t exec_count[N_REGEXES];
bool failed[N_REGEXES];
for (i = 0; i < N_REGEXES; i++) {
comp_times[i] = 0.0;
exec_times[i] = 0.0;
comp_count[i] = 0;
exec_count[i] = 0;
failed[i] = false;
}
stress_set_proc_state(args->name, STRESS_STATE_SYNC_WAIT);
stress_sync_start_wait(args);
stress_set_proc_state(args->name, STRESS_STATE_RUN);
do {
int succeeded = 0;
for (i = 0; LIKELY(i < SIZEOF_ARRAY(stress_posix_regex) && stress_continue(args)); i++) {
double t;
regex_t regex;
int ret;
if (UNLIKELY(failed[i]))
continue;
t = stress_time_now();
ret = regcomp(®ex, stress_posix_regex[i].regex, REG_EXTENDED);
if (UNLIKELY(ret != 0)) {
if (stress_instance_zero(args) && (!failed[i])) {
char errbuf[256];
failed[i] = true;
(void)regerror(ret, ®ex, errbuf, sizeof(errbuf));
pr_inf("%s: failed to compile %s regex '%s', error %s\n",
args->name, stress_posix_regex[i].description,
stress_posix_regex[i].regex, errbuf);
}
} else {
size_t j;
comp_times[i] += stress_time_now() - t;
comp_count[i]++;
succeeded++;
for (j = 0; j < SIZEOF_ARRAY(stress_regex_text); j++) {
regmatch_t regmatch[1];
t = stress_time_now();
ret = regexec(®ex, stress_regex_text[j], SIZEOF_ARRAY(regmatch), regmatch, 0);
if (UNLIKELY(ret))
continue;
/* pr_inf("%s %s\n", stress_posix_regex[i].regex, stress_regex_text[j]); */
exec_times[i] += stress_time_now() - t;
exec_count[i]++;
}
regfree(®ex);
}
stress_bogo_inc(args);
}
if (UNLIKELY(succeeded == 0))
break;
} while (stress_continue(args));
stress_metrics_set(args, 0, "regcomp per sec",
stress_regex_rate(comp_times, comp_count), STRESS_METRIC_HARMONIC_MEAN);
stress_metrics_set(args, 1, "regexec per sec",
stress_regex_rate(exec_times, exec_count), STRESS_METRIC_HARMONIC_MEAN);
for (i = 0; i < N_REGEXES; i++) {
char str[64];
double rate;
rate = comp_times[i] > 0 ? comp_count[i] / comp_times[i] : 0.0;
(void)snprintf(str, sizeof(str), "regcomp '%s' per sec", stress_posix_regex[i].description);
stress_metrics_set(args, i + 2, str, rate, STRESS_METRIC_HARMONIC_MEAN);
}
return EXIT_SUCCESS;
}
const stressor_info_t stress_regex_info = {
.stressor = stress_regex,
.classifier = CLASS_CPU,
.help = help
};
#else
const stressor_info_t stress_regex_info = {
.stressor = stress_unimplemented,
.classifier = CLASS_CPU,
.help = help,
.unimplemented_reason = "no POSIX regex support"
};
#endif
|