mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-24 20:30:14 +01:00
Jon Ross-Perkins
2de746e83c
I've been mulling this mainly for the parameter complexity of check/lower, but doing lex/parse for symmetry. I'm motivated by the plan to move dumping for all of them into the respective functions, because of discussion about llvm-verifier. That basically would add another bool parameter (or more) to each of these. My instinct is we're going to probably accrue a little more over time, so I'm suggesting this as maybe adding the boundary a little simpler and/or easier to read. Note it may make sense to refactor a little further, e.g. maybe Lower::Context could receive the full set of options and pick out what it wants, but I figured creating the struct itself would be a decent start. I'm trying to put things into options when we can produce a reasonable default if the user doesn't assign a value. I'm using an explicit constructor so that values can be added without affecting every caller. A different factoring would be to pass in everything through the param struct, but that just felt weird when I was trying it out. Removing `inst_namer` and `module_name` from `LowerToLLVM` params -- both of these can be inferred from `sem_ir`, and I'm not seeing a particular reason to maintain them at the call site.
52 lines
1.8 KiB
C++
52 lines
1.8 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 <cstring>
|
|
|
|
#include "llvm/ADT/StringRef.h"
|
|
#include "testing/fuzzing/libfuzzer.h"
|
|
#include "toolchain/base/shared_value_stores.h"
|
|
#include "toolchain/diagnostics/null_diagnostics.h"
|
|
#include "toolchain/lex/lex.h"
|
|
#include "toolchain/parse/parse.h"
|
|
|
|
namespace Carbon::Testing {
|
|
|
|
// NOLINTNEXTLINE: Match the documented fuzzer entry point declaration style.
|
|
extern "C" int LLVMFuzzerTestOneInput(const unsigned char* data, size_t size) {
|
|
// Ignore large inputs.
|
|
// TODO: See tokenized_buffer_fuzzer.cpp.
|
|
if (size > 100000) {
|
|
return 0;
|
|
}
|
|
static constexpr llvm::StringLiteral TestFileName = "test.carbon";
|
|
llvm::vfs::InMemoryFileSystem fs;
|
|
llvm::StringRef data_ref(reinterpret_cast<const char*>(data), size);
|
|
CARBON_CHECK(fs.addFile(
|
|
TestFileName, /*ModificationTime=*/0,
|
|
llvm::MemoryBuffer::getMemBuffer(data_ref, /*BufferName=*/TestFileName,
|
|
/*RequiresNullTerminator=*/false)));
|
|
auto source =
|
|
SourceBuffer::MakeFromFile(fs, TestFileName, Diagnostics::NullConsumer());
|
|
|
|
// Lex the input.
|
|
SharedValueStores value_stores;
|
|
Lex::LexOptions lex_options;
|
|
lex_options.consumer = &Diagnostics::NullConsumer();
|
|
auto tokens = Lex::Lex(value_stores, *source, lex_options);
|
|
if (tokens.has_errors()) {
|
|
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.
|
|
Parse::ParseOptions parse_options;
|
|
parse_options.consumer = &Diagnostics::NullConsumer();
|
|
Parse::Parse(tokens, parse_options);
|
|
return 0;
|
|
}
|
|
|
|
} // namespace Carbon::Testing
|