You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
63 lines
2.5 KiB
63 lines
2.5 KiB
// -*- 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
|