File: fuzzing.h

package info (click to toggle)
llvm-toolchain-7 1%3A7.0.1-8~deb9u3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 733,456 kB
  • sloc: cpp: 3,776,651; ansic: 633,271; asm: 350,301; python: 142,716; objc: 107,612; sh: 22,626; lisp: 11,056; perl: 7,999; pascal: 6,742; ml: 5,537; awk: 3,536; makefile: 2,557; cs: 2,027; xml: 841; ruby: 156
file content (62 lines) | stat: -rw-r--r-- 2,563 bytes parent folder | download | duplicates (3)
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
// -*- C++ -*-
//===-------------------------- fuzzing.h --------------------------------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//

#ifndef _LIBCPP_FUZZING
#define _LIBCPP_FUZZING

#include <cstddef> // for size_t
#include <cstdint> // for uint8_t

namespace fuzzing {

//  These all return 0 on success; != 0 on failure
    int sort             (const uint8_t *data, size_t size);
    int stable_sort      (const uint8_t *data, size_t size);
    int partition        (const uint8_t *data, size_t size);
    int partition_copy   (const uint8_t *data, size_t size);
    int stable_partition (const uint8_t *data, size_t size);
	int unique           (const uint8_t *data, size_t size);
	int unique_copy      (const uint8_t *data, size_t size);

//  partition and stable_partition take Bi-Di iterators.
//  Should test those, too
    int nth_element       (const uint8_t *data, size_t size);
    int partial_sort      (const uint8_t *data, size_t size);
    int partial_sort_copy (const uint8_t *data, size_t size);

//  Heap operations
    int make_heap        (const uint8_t *data, size_t size);
    int push_heap        (const uint8_t *data, size_t size);
    int pop_heap         (const uint8_t *data, size_t size);

//  Various flavors of regex
    int regex_ECMAScript (const uint8_t *data, size_t size);
    int regex_POSIX      (const uint8_t *data, size_t size);
    int regex_extended   (const uint8_t *data, size_t size);
    int regex_awk        (const uint8_t *data, size_t size);
    int regex_grep       (const uint8_t *data, size_t size);
    int regex_egrep      (const uint8_t *data, size_t size);

//	Searching
	int search                      (const uint8_t *data, size_t size);
// 	int search_boyer_moore          (const uint8_t *data, size_t size);
// 	int search_boyer_moore_horspool (const uint8_t *data, size_t size);

//	Set operations
// 	int includes                 (const uint8_t *data, size_t size);
// 	int set_union                (const uint8_t *data, size_t size);
// 	int set_intersection         (const uint8_t *data, size_t size);
// 	int set_difference           (const uint8_t *data, size_t size);
// 	int set_symmetric_difference (const uint8_t *data, size_t size);
// 	int merge                    (const uint8_t *data, size_t size);

} // namespace fuzzing

#endif // _LIBCPP_FUZZING