mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-25 11:10:10 +01:00
Jon Meow
9c716e9c3b
The small size is for the 1m vs 5m time limit -- all these tests _should_ be fast so a lower limit seems consistent, and the 5m timeout was getting in my way when trying to debug *actual* timeouts. The Carbon::Testing bit is for convenience -- test libraries are generally using it, it seems like the tests should too. Note this reduces the need for `using`. This does push NodeMatchers into Carbon::Testing -- I don't think this was benefiting from having its own namespace; `using namespace` is discouraged [under style](https://google.github.io/styleguide/cppguide.html#Namespaces), we wouldn't support an equivalent in Carbon, and it feels like it's not helping to avoid name collisions. (also tidy was bugging about it, and while I could NOLINT that, this felt like the better approach)
65 lines
2.0 KiB
C++
65 lines
2.0 KiB
C++
// Part of the Carbon Language project, under the Apache License v2.0 with LLVM
|
|
// Exceptions. See /LICENSE for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <cstring>
|
|
|
|
#include "common/check.h"
|
|
#include "llvm/ADT/StringRef.h"
|
|
#include "toolchain/diagnostics/diagnostic_emitter.h"
|
|
#include "toolchain/diagnostics/null_diagnostics.h"
|
|
#include "toolchain/lexer/tokenized_buffer.h"
|
|
#include "toolchain/parser/parse_tree.h"
|
|
|
|
namespace Carbon::Testing {
|
|
|
|
// NOLINTNEXTLINE: Match the documented fuzzer entry point declaration style.
|
|
extern "C" int LLVMFuzzerTestOneInput(const unsigned char* data,
|
|
std::size_t size) {
|
|
// We need two bytes of data to compute a file name length.
|
|
if (size < 2) {
|
|
return 0;
|
|
}
|
|
uint16_t raw_filename_length;
|
|
std::memcpy(&raw_filename_length, data, 2);
|
|
data += 2;
|
|
size -= 2;
|
|
std::size_t filename_length = raw_filename_length;
|
|
|
|
// We need enough data to populate this filename length.
|
|
if (size < filename_length) {
|
|
return 0;
|
|
}
|
|
llvm::StringRef filename(reinterpret_cast<const char*>(data),
|
|
filename_length);
|
|
data += filename_length;
|
|
size -= filename_length;
|
|
|
|
// The rest of the data is the source text.
|
|
auto source = SourceBuffer::CreateFromText(
|
|
llvm::StringRef(reinterpret_cast<const char*>(data), size), filename);
|
|
|
|
// Lex the input.
|
|
auto tokens = TokenizedBuffer::Lex(source, NullDiagnosticConsumer());
|
|
if (tokens.HasErrors()) {
|
|
return 0;
|
|
}
|
|
|
|
// Now parse it into a tree. Note that parsing will (when asserts are enabled)
|
|
// walk the entire tree to verify it so we don't have to do that here.
|
|
ParseTree tree = ParseTree::Parse(tokens, NullDiagnosticConsumer());
|
|
if (tree.HasErrors()) {
|
|
return 0;
|
|
}
|
|
|
|
// In the absence of parse errors, we should have exactly as many nodes as
|
|
// tokens.
|
|
CHECK(tree.Size() == tokens.Size()) << "Unexpected number of tree nodes!";
|
|
|
|
return 0;
|
|
}
|
|
|
|
} // namespace Carbon::Testing
|