summaryrefslogtreecommitdiff
path: root/harnesses/regset.c
blob: a8dd1810a9bc3e38fecc527ad75c1b42106fa367 (plain)
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
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
/*
 * regset.c
 * Copyright (c) 2019  K.Kosako
 */
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <time.h>

#include "oniguruma.h"


#define RETRY_LIMIT   5000

#ifdef STANDALONE
//#define CHECK_EACH_REGEX_SEARCH_TIME
#endif

#define MAX_REG_NUM   256

typedef unsigned char uint8_t;
static OnigEncoding ENC;

static void
output_current_time(FILE* fp)
{
  char d[64];
  time_t t;

  t = time(NULL);
  strftime(d, sizeof(d), "%m/%d %H:%M:%S", localtime(&t));

  fprintf(fp, "%s", d);
}

#ifdef CHECK_EACH_REGEX_SEARCH_TIME
static double
get_sec(struct timespec* ts, struct timespec* te)
{
  double t;

  t = (te->tv_sec - ts->tv_sec) +
      (double )(te->tv_nsec - ts->tv_nsec) / 1000000000.0;
  return t;
}

static int
check_each_regex_search_time(OnigRegSet* set, unsigned char* str, unsigned char* end)
{
  int n;
  int i;
  int r;
  OnigRegion* region;

  n = onig_regset_number_of_regex(set);
  region = onig_region_new();

  for (i = 0; i < n; i++) {
    regex_t* reg;
    unsigned char* start;
    unsigned char* range;
    struct timespec ts1, ts2;
    double t;

    reg = onig_regset_get_regex(set, i);
    start = str;
    range = end;

    clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts1);

    r = onig_search(reg, str, end, start, range, region, ONIG_OPTION_NONE);

    clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts2);
    t = get_sec(&ts1, &ts2);

    fprintf(stdout, "regex search time %d: %6.2lfmsec.\n", i, t * 1000.0);
  }

  onig_region_free(region, 1);
  return 0;
}
#endif

static int
search(OnigRegSet* set, OnigRegSetLead lead, unsigned char* str, unsigned char* end)
{
  int r;
  int match_pos;
  unsigned char *start, *range;

  start = str;
  range = end;
  r = onig_regset_search(set, str, end, start, range, lead,
                         ONIG_OPTION_NONE, &match_pos);
  if (r >= 0) {
#ifdef STANDALONE
    int i;
    int match_index;
    OnigRegion* region;

    match_index = r;
    fprintf(stdout, "match reg index: %d, pos: %d  (%s)\n",
            match_index, match_pos, ONIGENC_NAME(ENC));
    region = onig_regset_get_region(set, match_index);
    if (region == 0) {
      fprintf(stdout, "ERROR: can't get region.\n");
      return -1;
    }

    for (i = 0; i < region->num_regs; i++) {
      fprintf(stdout, "%d: (%d-%d)\n", i, region->beg[i], region->end[i]);
    }
#endif
  }
  else if (r == ONIG_MISMATCH) {
#ifdef STANDALONE
    fprintf(stdout, "search fail (%s)\n", ONIGENC_NAME(ENC));
#endif
  }
  else { /* error */
#ifdef STANDALONE
    char s[ONIG_MAX_ERROR_MESSAGE_LEN];

    onig_error_code_to_str((UChar* )s, r);
    fprintf(stdout, "ERROR: %s\n", s);
    fprintf(stdout, "  (%s)\n", ONIGENC_NAME(ENC));
#endif
    return -1;
  }

  return 0;
}

static long INPUT_COUNT;
static long EXEC_COUNT;
static long EXEC_COUNT_INTERVAL;
static long REGEX_SUCCESS_COUNT;
static long VALID_STRING_COUNT;

static int
exec(OnigEncoding enc, int reg_num, int init_reg_num,
     UChar* pat[], UChar* pat_end[],
     OnigRegSetLead lead, UChar* str, UChar* end)
{
  int r;
  int i, j;
  OnigRegSet* set;
  regex_t* reg;
  OnigOptionType options;
  OnigErrorInfo einfo;
  regex_t* regs[MAX_REG_NUM];

  EXEC_COUNT++;
  EXEC_COUNT_INTERVAL++;

  options = (EXEC_COUNT % 4 == 0) ? ONIG_OPTION_IGNORECASE : ONIG_OPTION_NONE;

  onig_initialize(&enc, 1);
  onig_set_retry_limit_in_search(RETRY_LIMIT);

  for (i = 0; i < init_reg_num; i++) {
    r = onig_new(&regs[i], pat[i], pat_end[i], options, ENC,
                 ONIG_SYNTAX_DEFAULT, &einfo);
    if (r != 0) {
#ifdef STANDALONE
      char s[ONIG_MAX_ERROR_MESSAGE_LEN];

      onig_error_code_to_str((UChar* )s, r, &einfo);
      fprintf(stdout, "ERROR: index: %d, %s\n", i, s);
#endif

      for (j = 0; j < i; j++) onig_free(regs[j]);

      onig_end();

      if (r == ONIGERR_PARSER_BUG ||
          r == ONIGERR_STACK_BUG  ||
          r == ONIGERR_UNDEFINED_BYTECODE ||
          r == ONIGERR_UNEXPECTED_BYTECODE) {
        return -2;
      }
      else
        return -1;
    }
  }

  r = onig_regset_new(&set, init_reg_num, regs);
  if (r != 0) {
    for (i = 0; i < init_reg_num; i++) {
      onig_free(regs[i]);
    }
    onig_end();
    return -1;
  }

  for (i = init_reg_num; i < reg_num; i++) {
    r = onig_new(&reg, pat[i], pat_end[i], options, ENC,
                 ONIG_SYNTAX_DEFAULT, &einfo);
    if (r != 0) {
#ifdef STANDALONE
      char s[ONIG_MAX_ERROR_MESSAGE_LEN];

      onig_error_code_to_str((UChar* )s, r, &einfo);
      fprintf(stdout, "ERROR: index: %d, %s\n", i, s);
#endif
      onig_regset_free(set);
      onig_end();

      if (r == ONIGERR_PARSER_BUG ||
          r == ONIGERR_STACK_BUG  ||
          r == ONIGERR_UNDEFINED_BYTECODE ||
          r == ONIGERR_UNEXPECTED_BYTECODE) {
        return -2;
      }
      else
        return -1;
    }

    r = onig_regset_add(set, reg);
    if (r != 0) {
      onig_regset_free(set);
      onig_end();
      fprintf(stdout, "ERROR: onig_regset_add(): %d\n", i);
      return r;
    }
  }

  REGEX_SUCCESS_COUNT++;

  if (onigenc_is_valid_mbc_string(enc, str, end) != 0) {
    VALID_STRING_COUNT++;
    r = search(set, lead, str, end);
#ifdef CHECK_EACH_REGEX_SEARCH_TIME
    r = check_each_regex_search_time(set, str, end);
#endif
  }

  onig_regset_free(set);
  onig_end();
  return 0;
}

#define MAX_PATTERN_SIZE      30
#define NUM_CONTROL_BYTES      3

#define EXEC_PRINT_INTERVAL  2000000

static int MaxRegNum;
static int MaxInitRegNum;

extern int
LLVMFuzzerTestOneInput(const uint8_t * Data, size_t Size)
{
  int r, i;
  int pattern_size;
  unsigned char *str_null_end;
  size_t remaining_size;
  unsigned char *data;
  unsigned int reg_num;
  unsigned int init_reg_num;
  unsigned char* pat[256];
  unsigned char* pat_end[256];
  int len;
  unsigned int lead_num;
  OnigRegSetLead lead;

  INPUT_COUNT++;

  if (Size < NUM_CONTROL_BYTES) return 0;

  remaining_size = Size;
  data = (unsigned char* )(Data);

  reg_num = data[0];
  data++;
  remaining_size--;

  init_reg_num = data[0];
  data++;
  remaining_size--;

  lead_num = data[0];
  data++;
  remaining_size--;
  lead = (lead_num % 2 == 0 ? ONIG_REGSET_POSITION_LEAD : ONIG_REGSET_REGEX_LEAD);

  if (remaining_size < reg_num * 2) {
    reg_num = reg_num % 15;  // zero is OK.
  }

  init_reg_num %= (reg_num + 1);

  if (MaxRegNum < reg_num)
    MaxRegNum = reg_num;

  if (MaxInitRegNum < init_reg_num)
    MaxInitRegNum = init_reg_num;

  if (reg_num == 0)
    pattern_size = 1;
  else
    pattern_size = remaining_size / (reg_num * 2);
    
  if (pattern_size > MAX_PATTERN_SIZE)
    pattern_size = MAX_PATTERN_SIZE;

  len = pattern_size * reg_num;
  if (len == 0) len = 1;

  for (i = 0; i < reg_num; i++) {
    pat[i] = (unsigned char* )malloc(pattern_size);
    memcpy(pat[i], data, pattern_size);
    pat_end[i] = pat[i] + pattern_size;
    data += pattern_size;
    remaining_size -= pattern_size;
  }

  unsigned char *str = (unsigned char*)malloc(remaining_size != 0 ? remaining_size : 1);
  memcpy(str, data, remaining_size);
  str_null_end = str + remaining_size;

#ifdef STANDALONE
  fprintf(stdout, "reg num: %d, pattern size: %d, lead: %s\n",
          reg_num, pattern_size,
          lead == ONIG_REGSET_POSITION_LEAD ? "position" : "regex");

  if (reg_num != 0) {
    unsigned char* p;
    i = 0;
    p = pat[0];
    while (p < pat_end[0]) {
      fprintf(stdout, " 0x%02x", (int )*p++);
      i++;
      if (i % 8 == 0) fprintf(stdout, "\n");
    }
    fprintf(stdout, "\n");
  }
#endif

  ENC = ONIG_ENCODING_UTF8;

  r = exec(ENC, reg_num, init_reg_num, pat, pat_end, lead, str, str_null_end);

  for (i = 0; i < reg_num; i++) {
    free(pat[i]);
  }
  free(str);

  if (r == -2) {
    //output_data("parser-bug", Data, Size);
    exit(-2);
  }

  if (EXEC_COUNT_INTERVAL == EXEC_PRINT_INTERVAL) {
    float fexec, freg, fvalid;

    fexec  = (float )EXEC_COUNT / INPUT_COUNT;
    freg   = (float )REGEX_SUCCESS_COUNT / INPUT_COUNT;
    fvalid = (float )VALID_STRING_COUNT / INPUT_COUNT;

    output_current_time(stdout);
    fprintf(stdout, ": %ld: EXEC:%.2f, REG:%.2f, VALID:%.2f MAX REG:%d-%d\n",
            EXEC_COUNT, fexec, freg, fvalid, MaxRegNum, MaxInitRegNum);

    EXEC_COUNT_INTERVAL = 0;
  }
  else if (EXEC_COUNT == 1) {
    output_current_time(stdout);
    fprintf(stdout, ": ------------ START ------------\n");
  }

  return r;
}

#ifdef STANDALONE

extern int main(int argc, char* argv[])
{
  size_t n;
  uint8_t Data[10000];

  n = read(0, Data, sizeof(Data));
  fprintf(stdout, "n: %ld\n", n);
  LLVMFuzzerTestOneInput(Data, n);

  return 0;
}
#endif /* STANDALONE */