mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-24 22:02:23 +01:00
Continuing with #3070. Just a dir and file rename (mostly removing prefixes, although for parse_tree_fuzzer and parse_tree_file_test I'm dropping "tree" instead of "parse"). Everything in the parse dir should be marked as a move.
407 lines
16 KiB
C++
407 lines
16 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
|
|
|
|
#ifndef CARBON_TOOLCHAIN_CHECK_CONTEXT_H_
|
|
#define CARBON_TOOLCHAIN_CHECK_CONTEXT_H_
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include "llvm/ADT/DenseSet.h"
|
|
#include "llvm/ADT/FoldingSet.h"
|
|
#include "llvm/ADT/SmallVector.h"
|
|
#include "toolchain/check/declaration_name_stack.h"
|
|
#include "toolchain/check/node_block_stack.h"
|
|
#include "toolchain/check/node_stack.h"
|
|
#include "toolchain/parse/tree.h"
|
|
#include "toolchain/sem_ir/file.h"
|
|
#include "toolchain/sem_ir/node.h"
|
|
|
|
namespace Carbon::Check {
|
|
|
|
// Context and shared functionality for semantics handlers.
|
|
class Context {
|
|
public:
|
|
// Stores references for work.
|
|
explicit Context(const Lex::TokenizedBuffer& tokens,
|
|
DiagnosticEmitter<Parse::Node>& emitter,
|
|
const Parse::Tree& parse_tree, SemIR::File& semantics,
|
|
llvm::raw_ostream* vlog_stream);
|
|
|
|
// Marks an implementation TODO. Always returns false.
|
|
auto TODO(Parse::Node parse_node, std::string label) -> bool;
|
|
|
|
// Runs verification that the processing cleanly finished.
|
|
auto VerifyOnFinish() -> void;
|
|
|
|
// Adds a node to the current block, returning the produced ID.
|
|
auto AddNode(SemIR::Node node) -> SemIR::NodeId;
|
|
|
|
// Adds a node to the given block, returning the produced ID.
|
|
auto AddNodeToBlock(SemIR::NodeBlockId block, SemIR::Node node)
|
|
-> SemIR::NodeId;
|
|
|
|
// Pushes a parse tree node onto the stack, storing the SemIR::Node as the
|
|
// result.
|
|
auto AddNodeAndPush(Parse::Node parse_node, SemIR::Node node) -> void;
|
|
|
|
// Adds a name to name lookup. Prints a diagnostic for name conflicts.
|
|
auto AddNameToLookup(Parse::Node name_node, SemIR::StringId name_id,
|
|
SemIR::NodeId target_id) -> void;
|
|
|
|
// Performs name lookup in a specified scope, returning the referenced node.
|
|
// If scope_id is invalid, uses the current contextual scope.
|
|
auto LookupName(Parse::Node parse_node, SemIR::StringId name_id,
|
|
SemIR::NameScopeId scope_id, bool print_diagnostics)
|
|
-> SemIR::NodeId;
|
|
|
|
// Prints a diagnostic for a duplicate name.
|
|
auto DiagnoseDuplicateName(Parse::Node parse_node, SemIR::NodeId prev_def_id)
|
|
-> void;
|
|
|
|
// Prints a diagnostic for a missing name.
|
|
auto DiagnoseNameNotFound(Parse::Node parse_node, SemIR::StringId name_id)
|
|
-> void;
|
|
|
|
// Pushes a new scope onto scope_stack_.
|
|
auto PushScope() -> void;
|
|
|
|
// Pops the top scope from scope_stack_, cleaning up names from name_lookup_.
|
|
auto PopScope() -> void;
|
|
|
|
// Adds a `Branch` node branching to a new node block, and returns the ID of
|
|
// the new block. All paths to the branch target must go through the current
|
|
// block, though not necessarily through this branch.
|
|
auto AddDominatedBlockAndBranch(Parse::Node parse_node) -> SemIR::NodeBlockId;
|
|
|
|
// Adds a `Branch` node branching to a new node block with a value, and
|
|
// returns the ID of the new block. All paths to the branch target must go
|
|
// through the current block.
|
|
auto AddDominatedBlockAndBranchWithArg(Parse::Node parse_node,
|
|
SemIR::NodeId arg_id)
|
|
-> SemIR::NodeBlockId;
|
|
|
|
// Adds a `BranchIf` node branching to a new node block, and returns the ID
|
|
// of the new block. All paths to the branch target must go through the
|
|
// current block.
|
|
auto AddDominatedBlockAndBranchIf(Parse::Node parse_node,
|
|
SemIR::NodeId cond_id)
|
|
-> SemIR::NodeBlockId;
|
|
|
|
// Adds branches from the given list of blocks to a new block, for
|
|
// reconvergence of control flow, and pushes the new block onto the node
|
|
// block stack.
|
|
auto AddConvergenceBlockAndPush(
|
|
Parse::Node parse_node, std::initializer_list<SemIR::NodeBlockId> blocks)
|
|
-> void;
|
|
|
|
// Adds branches from the given list of blocks and values to a new block, for
|
|
// reconvergence of control flow with a result value, and pushes the new
|
|
// block onto the node block stack. Returns a node referring to the result
|
|
// value.
|
|
auto AddConvergenceBlockWithArgAndPush(
|
|
Parse::Node parse_node,
|
|
std::initializer_list<std::pair<SemIR::NodeBlockId, SemIR::NodeId>>
|
|
blocks_and_args) -> SemIR::NodeId;
|
|
|
|
// Add the current code block to the enclosing function.
|
|
auto AddCurrentCodeBlockToFunction() -> void;
|
|
|
|
// Returns whether the current position in the current block is reachable.
|
|
auto is_current_position_reachable() -> bool;
|
|
|
|
// Converts the given expression to an ephemeral reference to a temporary if
|
|
// it is an initializing expression.
|
|
auto MaterializeIfInitializing(SemIR::NodeId expr_id) -> SemIR::NodeId {
|
|
if (GetExpressionCategory(semantics_ir(), expr_id) ==
|
|
SemIR::ExpressionCategory::Initializing) {
|
|
return FinalizeTemporary(expr_id, /*discarded=*/false);
|
|
}
|
|
return expr_id;
|
|
}
|
|
|
|
// Convert the given expression to a value expression of the same type.
|
|
auto ConvertToValueExpression(SemIR::NodeId expr_id) -> SemIR::NodeId;
|
|
|
|
// Performs initialization of `target_id` from `value_id`. Returns the
|
|
// possibly-converted initialization expression, which should be assigned to
|
|
// the target using a suitable node for the kind of initialization.
|
|
auto Initialize(Parse::Node parse_node, SemIR::NodeId target_id,
|
|
SemIR::NodeId value_id) -> SemIR::NodeId;
|
|
|
|
// Converts `value_id` to a value expression of type `type_id`.
|
|
auto ConvertToValueOfType(Parse::Node parse_node, SemIR::NodeId value_id,
|
|
SemIR::TypeId type_id) -> SemIR::NodeId {
|
|
return ConvertToValueExpression(
|
|
ImplicitAsRequired(parse_node, value_id, type_id));
|
|
}
|
|
|
|
// Converts `value_id` to a value expression of type `bool`.
|
|
auto ConvertToBoolValue(Parse::Node parse_node, SemIR::NodeId value_id)
|
|
-> SemIR::NodeId {
|
|
return ConvertToValueOfType(
|
|
parse_node, value_id, CanonicalizeType(SemIR::NodeId::BuiltinBoolType));
|
|
}
|
|
|
|
// Handles an expression whose result is discarded.
|
|
auto HandleDiscardedExpression(SemIR::NodeId id) -> void;
|
|
|
|
// Runs ImplicitAsImpl for a set of arguments and parameters.
|
|
//
|
|
// This will eventually need to support checking against multiple possible
|
|
// overloads, multiple of which may be possible but not "best". While this can
|
|
// currently be done by calling twice, toggling `apply_implicit_as`, in the
|
|
// future we may want to remember the right implicit conversions to do for
|
|
// valid cases in order to efficiently handle generics.
|
|
auto ImplicitAsForArgs(
|
|
SemIR::NodeBlockId arg_refs_id, Parse::Node param_parse_node,
|
|
SemIR::NodeBlockId param_refs_id,
|
|
DiagnosticEmitter<Parse::Node>::DiagnosticBuilder* diagnostic) -> bool;
|
|
|
|
// Runs ImplicitAsImpl for a situation where a cast is required, returning the
|
|
// updated `value_id`. Prints a diagnostic and returns an Error if
|
|
// unsupported.
|
|
auto ImplicitAsRequired(Parse::Node parse_node, SemIR::NodeId value_id,
|
|
SemIR::TypeId as_type_id) -> SemIR::NodeId;
|
|
|
|
// Canonicalizes a type which is tracked as a single node.
|
|
// TODO: This should eventually return a type ID.
|
|
auto CanonicalizeType(SemIR::NodeId node_id) -> SemIR::TypeId;
|
|
|
|
// Handles canonicalization of struct types. This may create a new struct type
|
|
// when it has a new structure, or reference an existing struct type when it
|
|
// duplicates a prior type.
|
|
//
|
|
// Individual struct type fields aren't canonicalized because they may have
|
|
// name conflicts or other diagnostics during creation, which can use the
|
|
// parse node.
|
|
auto CanonicalizeStructType(Parse::Node parse_node,
|
|
SemIR::NodeBlockId refs_id) -> SemIR::TypeId;
|
|
|
|
// Handles canonicalization of tuple types. This may create a new tuple type
|
|
// if the `type_ids` doesn't match an existing tuple type.
|
|
auto CanonicalizeTupleType(Parse::Node parse_node,
|
|
llvm::SmallVector<SemIR::TypeId>&& type_ids)
|
|
-> SemIR::TypeId;
|
|
|
|
// Returns a pointer type whose pointee type is `pointee_type_id`.
|
|
auto GetPointerType(Parse::Node parse_node, SemIR::TypeId pointee_type_id)
|
|
-> SemIR::TypeId;
|
|
|
|
// Converts an expression for use as a type.
|
|
// TODO: This should eventually return a type ID.
|
|
auto ExpressionAsType(Parse::Node parse_node, SemIR::NodeId value_id)
|
|
-> SemIR::TypeId {
|
|
auto node = semantics_ir_->GetNode(value_id);
|
|
if (node.kind() == SemIR::NodeKind::StubReference) {
|
|
value_id = node.GetAsStubReference();
|
|
CARBON_CHECK(semantics_ir_->GetNode(value_id).kind() !=
|
|
SemIR::NodeKind::StubReference)
|
|
<< "Stub reference should not point to another stub reference";
|
|
}
|
|
|
|
return CanonicalizeType(
|
|
ConvertToValueOfType(parse_node, value_id, SemIR::TypeId::TypeType));
|
|
}
|
|
|
|
// Removes any top-level `const` qualifiers from a type.
|
|
auto GetUnqualifiedType(SemIR::TypeId type_id) -> SemIR::TypeId;
|
|
|
|
// Starts handling parameters or arguments.
|
|
auto ParamOrArgStart() -> void;
|
|
|
|
// On a comma, pushes the entry. On return, the top of node_stack_ will be
|
|
// start_kind.
|
|
auto ParamOrArgComma(bool for_args) -> void;
|
|
|
|
// Detects whether there's an entry to push. On return, the top of
|
|
// node_stack_ will be start_kind, and the caller should do type-specific
|
|
// processing. Returns refs_id.
|
|
auto ParamOrArgEnd(bool for_args, Parse::NodeKind start_kind)
|
|
-> SemIR::NodeBlockId;
|
|
|
|
// Saves a parameter from the top block in node_stack_ to the top block in
|
|
// params_or_args_stack_. If for_args, adds a StubReference of the previous
|
|
// node's result to the IR.
|
|
//
|
|
// This should only be called by other ParamOrArg functions, not directly.
|
|
auto ParamOrArgSave(bool for_args) -> void;
|
|
|
|
// Prints information for a stack dump.
|
|
auto PrintForStackDump(llvm::raw_ostream& output) const -> void;
|
|
|
|
auto tokens() -> const Lex::TokenizedBuffer& { return *tokens_; }
|
|
|
|
auto emitter() -> DiagnosticEmitter<Parse::Node>& { return *emitter_; }
|
|
|
|
auto parse_tree() -> const Parse::Tree& { return *parse_tree_; }
|
|
|
|
auto semantics_ir() -> SemIR::File& { return *semantics_ir_; }
|
|
|
|
auto node_stack() -> NodeStack& { return node_stack_; }
|
|
|
|
auto node_block_stack() -> NodeBlockStack& { return node_block_stack_; }
|
|
|
|
auto args_type_info_stack() -> NodeBlockStack& {
|
|
return args_type_info_stack_;
|
|
}
|
|
|
|
auto return_scope_stack() -> llvm::SmallVector<SemIR::NodeId>& {
|
|
return return_scope_stack_;
|
|
}
|
|
|
|
auto declaration_name_stack() -> DeclarationNameStack& {
|
|
return declaration_name_stack_;
|
|
}
|
|
|
|
private:
|
|
// For CanImplicitAs, the detected conversion to apply.
|
|
enum ImplicitAsKind : int8_t {
|
|
// Incompatible types.
|
|
Incompatible,
|
|
// No conversion required.
|
|
Identical,
|
|
// ImplicitAs is required.
|
|
Compatible,
|
|
};
|
|
|
|
// A FoldingSet node for a type.
|
|
class TypeNode : public llvm::FastFoldingSetNode {
|
|
public:
|
|
explicit TypeNode(const llvm::FoldingSetNodeID& node_id,
|
|
SemIR::TypeId type_id)
|
|
: llvm::FastFoldingSetNode(node_id), type_id_(type_id) {}
|
|
|
|
auto type_id() -> SemIR::TypeId { return type_id_; }
|
|
|
|
private:
|
|
SemIR::TypeId type_id_;
|
|
};
|
|
|
|
// An entry in scope_stack_.
|
|
struct ScopeStackEntry {
|
|
// Names which are registered with name_lookup_, and will need to be
|
|
// deregistered when the scope ends.
|
|
llvm::DenseSet<SemIR::StringId> names;
|
|
|
|
// TODO: This likely needs to track things which need to be destructed.
|
|
};
|
|
|
|
// Commits to using a temporary to store the result of the initializing
|
|
// expression described by `init_id`, and returns the location of the
|
|
// temporary. If `discarded` is `true`, the result is discarded, and no
|
|
// temporary will be created if possible; if no temporary is created, the
|
|
// return value will be `SemIR::NodeId::Invalid`.
|
|
auto FinalizeTemporary(SemIR::NodeId init_id, bool discarded)
|
|
-> SemIR::NodeId;
|
|
|
|
// Marks the initializer `init_id` as initializing `target_id`.
|
|
auto MarkInitializerFor(SemIR::NodeId init_id, SemIR::NodeId target_id)
|
|
-> void;
|
|
|
|
// Runs ImplicitAs behavior to convert `value` to `as_type`, returning the
|
|
// result type. The result will be the node to use to replace `value`.
|
|
//
|
|
// If `output_value_id` is null, then this only checks if the conversion is
|
|
// possible.
|
|
//
|
|
// If `output_value_id` is not null, then it will be set if there is a need to
|
|
// cast.
|
|
auto ImplicitAsImpl(SemIR::NodeId value_id, SemIR::TypeId as_type_id,
|
|
SemIR::NodeId* output_value_id) -> ImplicitAsKind;
|
|
|
|
// Forms a canonical type ID for a type. This function is given two
|
|
// callbacks:
|
|
//
|
|
// `profile_type(canonical_id)` is called to build a fingerprint for this
|
|
// type. The ID should be distinct for all distinct type values with the same
|
|
// `kind`.
|
|
//
|
|
// `make_node()` is called to obtain a `SemIR::NodeId` that describes the
|
|
// type. It is only called if the type does not already exist, so can be used
|
|
// to lazily build the `SemIR::Node`. `make_node()` is not permitted to
|
|
// directly or indirectly canonicalize any types.
|
|
auto CanonicalizeTypeImpl(
|
|
SemIR::NodeKind kind,
|
|
llvm::function_ref<void(llvm::FoldingSetNodeID& canonical_id)>
|
|
profile_type,
|
|
llvm::function_ref<SemIR::NodeId()> make_node) -> SemIR::TypeId;
|
|
|
|
// Forms a canonical type ID for a type. If the type is new, adds the node to
|
|
// the current block.
|
|
auto CanonicalizeTypeAndAddNodeIfNew(SemIR::Node node) -> SemIR::TypeId;
|
|
|
|
auto current_scope() -> ScopeStackEntry& { return scope_stack_.back(); }
|
|
|
|
// Tokens for getting data on literals.
|
|
const Lex::TokenizedBuffer* tokens_;
|
|
|
|
// Handles diagnostics.
|
|
DiagnosticEmitter<Parse::Node>* emitter_;
|
|
|
|
// The file's parse tree.
|
|
const Parse::Tree* parse_tree_;
|
|
|
|
// The SemIR::File being added to.
|
|
SemIR::File* semantics_ir_;
|
|
|
|
// Whether to print verbose output.
|
|
llvm::raw_ostream* vlog_stream_;
|
|
|
|
// The stack during Build. Will contain file-level parse nodes on return.
|
|
NodeStack node_stack_;
|
|
|
|
// The stack of node blocks being used for general IR generation.
|
|
NodeBlockStack node_block_stack_;
|
|
|
|
// The stack of node blocks being used for per-element tracking of nodes in
|
|
// parameter and argument node blocks. Versus node_block_stack_, an element
|
|
// will have 1 or more nodes in blocks in node_block_stack_, but only ever 1
|
|
// node in blocks here.
|
|
NodeBlockStack params_or_args_stack_;
|
|
|
|
// The stack of node blocks being used for type information while processing
|
|
// arguments. This is used in parallel with params_or_args_stack_. It's
|
|
// currently only used for struct literals, where we need to track names
|
|
// for a type separate from the literal arguments.
|
|
NodeBlockStack args_type_info_stack_;
|
|
|
|
// A stack of return scopes; i.e., targets for `return`. Inside a function,
|
|
// this will be a FunctionDeclaration.
|
|
llvm::SmallVector<SemIR::NodeId> return_scope_stack_;
|
|
|
|
// A stack for scope context.
|
|
llvm::SmallVector<ScopeStackEntry> scope_stack_;
|
|
|
|
// The stack used for qualified declaration name construction.
|
|
DeclarationNameStack declaration_name_stack_;
|
|
|
|
// Maps identifiers to name lookup results. Values are a stack of name lookup
|
|
// results in the ancestor scopes. This offers constant-time lookup of names,
|
|
// regardless of how many scopes exist between the name declaration and
|
|
// reference.
|
|
//
|
|
// Names which no longer have lookup results are erased.
|
|
llvm::DenseMap<SemIR::StringId, llvm::SmallVector<SemIR::NodeId>>
|
|
name_lookup_;
|
|
|
|
// Cache of the mapping from nodes to types, to avoid recomputing the folding
|
|
// set ID.
|
|
llvm::DenseMap<SemIR::NodeId, SemIR::TypeId> canonical_types_;
|
|
|
|
// Tracks the canonical representation of types that have been defined.
|
|
llvm::FoldingSet<TypeNode> canonical_type_nodes_;
|
|
|
|
// Storage for the nodes in canonical_type_nodes_. This stores in pointers so
|
|
// that FoldingSet can have stable pointers.
|
|
llvm::SmallVector<std::unique_ptr<TypeNode>> type_node_storage_;
|
|
};
|
|
|
|
// Parse node handlers. Returns false for unrecoverable errors.
|
|
#define CARBON_PARSE_NODE_KIND(Name) \
|
|
auto Handle##Name(Context& context, Parse::Node parse_node)->bool;
|
|
#include "toolchain/parse/node_kind.def"
|
|
|
|
} // namespace Carbon::Check
|
|
|
|
#endif // CARBON_TOOLCHAIN_CHECK_CONTEXT_H_
|