File: pattern_fuzzer.cc

package info (click to toggle)
chromium 145.0.7632.109-1
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 5,974,804 kB
  • sloc: cpp: 36,197,696; ansic: 7,602,761; javascript: 3,563,590; python: 1,649,324; xml: 838,427; asm: 717,087; pascal: 185,708; sh: 88,786; perl: 88,718; objc: 79,984; sql: 59,811; cs: 42,452; fortran: 24,101; makefile: 21,022; tcl: 15,277; php: 14,022; yacc: 9,066; ruby: 7,553; awk: 3,720; lisp: 3,233; lex: 1,328; ada: 727; jsp: 228; sed: 36
file content (35 lines) | stat: -rw-r--r-- 1,054 bytes parent folder | download | duplicates (13) 
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;
}