mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-24 22:02:23 +01:00
Jon Meow
8a2ef22c2a
There's currently a bug with empty files, in that it initializes SourceBuffer with an invalid StringRef that results in a crash. That got me looking at the std::optional TODO, but the issue is that there are really three states: - Buffered - mmapped (not buffered) - Moved out of (no longer initialized) Technically an optional could work if we initialize the buffer on move out, indicating the mmap is gone. But the mode setup felt better to me. And then this also adds the size check. Which is really how I started looking at this.
51 lines
1.5 KiB
C++
51 lines
1.5 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) {
|
|
// Ignore large inputs.
|
|
// TODO: See tokenized_buffer_fuzzer.cpp.
|
|
if (size > 100000) {
|
|
return 0;
|
|
}
|
|
|
|
auto source = SourceBuffer::CreateFromText(
|
|
llvm::StringRef(reinterpret_cast<const char*>(data), size));
|
|
|
|
// 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
|