File: pattern_fuzzer.cc

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (35 lines) | stat: -rw-r--r-- 1,054 bytes parent folder | download | duplicates (6) 
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
 
// Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "base/strings/pattern.h"

#include <fuzzer/FuzzedDataProvider.h>
#include <stdint.h>

#include <string>
#include <tuple>

#include "base/strings/utf_string_conversions.h"

namespace {

// Prevent huge inputs from hitting time limits.
constexpr size_t kMaxLength = 1000;

}  // namespace

extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
  FuzzedDataProvider provider(data, size);
  std::string string = provider.ConsumeRandomLengthString(kMaxLength);
  std::string pattern = provider.ConsumeRandomLengthString(kMaxLength);

  std::ignore = base::MatchPattern(string, pattern);
  // Test the wide-string version as well. Note that the Unicode conversion
  // function skips errors (returning the best conversion possible), which is
  // good enough for the fuzzer.
  std::ignore =
      base::MatchPattern(base::UTF8ToUTF16(string), base::UTF8ToUTF16(pattern));

  return 0;
}