mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-10-03 08:55:50 +01:00
Jon Ross-Perkins
918c089e03
This handles namespacing of functions. Parsing and semantics are changed significantly, while lowering works without changes. Variables can't be namespaced yet because they're dealing with patterns, and I didn't dig through that code. Most of the logic is done through the new name declaration stack, which is necessary because semantics isn't quite sure where the declaration name ends. It'd be complex for parsing to send a signal about this, probably involving node variants and rewrites of the tree, and this solution seems to work well. Unfortunately this means a new stack, but that may be inevitable due to the extra information needing to be tracked. Note this doesn't deal with scoped lookups of non-namespace things, which we'll need for generics. That'll probably involve pushing resolved scopes onto a stack (or maybe just setting a singleton value?) to affect contextual name lookup. But, I think the basics are there to make it work when we can test the behavior. This renames "designator expression" to "qualified expression" and adds "qualified declaration" in order to use terminology more consistent with C++. Namespaces will probably need to be considered for name mangling down the line, but this still uses the basic name.
622 lines
24 KiB
C++
622 lines
24 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 "toolchain/semantics/semantics_context.h"
|
|
|
|
#include <utility>
|
|
|
|
#include "common/vlog.h"
|
|
#include "toolchain/diagnostics/diagnostic_kind.h"
|
|
#include "toolchain/lexer/tokenized_buffer.h"
|
|
#include "toolchain/parser/parse_node_kind.h"
|
|
#include "toolchain/semantics/semantics_ir.h"
|
|
#include "toolchain/semantics/semantics_node.h"
|
|
#include "toolchain/semantics/semantics_node_block_stack.h"
|
|
|
|
namespace Carbon {
|
|
|
|
CARBON_DIAGNOSTIC(NameNotFound, Error, "Name {0} not found", llvm::StringRef);
|
|
|
|
SemanticsContext::SemanticsContext(const TokenizedBuffer& tokens,
|
|
DiagnosticEmitter<ParseTree::Node>& emitter,
|
|
const ParseTree& parse_tree,
|
|
SemanticsIR& semantics_ir,
|
|
llvm::raw_ostream* vlog_stream)
|
|
: tokens_(&tokens),
|
|
emitter_(&emitter),
|
|
parse_tree_(&parse_tree),
|
|
semantics_ir_(&semantics_ir),
|
|
vlog_stream_(vlog_stream),
|
|
node_stack_(parse_tree, vlog_stream),
|
|
node_block_stack_("node_block_stack_", semantics_ir, vlog_stream),
|
|
params_or_args_stack_("params_or_args_stack_", semantics_ir, vlog_stream),
|
|
args_type_info_stack_("args_type_info_stack_", semantics_ir,
|
|
vlog_stream) {
|
|
// Inserts the "Invalid" and "Type" types as "used types" so that
|
|
// canonicalization can skip them. We don't emit either for lowering.
|
|
canonical_types_.insert(
|
|
{SemanticsNodeId::BuiltinInvalidType, SemanticsTypeId::InvalidType});
|
|
canonical_types_.insert(
|
|
{SemanticsNodeId::BuiltinTypeType, SemanticsTypeId::TypeType});
|
|
}
|
|
|
|
auto SemanticsContext::TODO(ParseTree::Node parse_node, std::string label)
|
|
-> bool {
|
|
CARBON_DIAGNOSTIC(SemanticsTodo, Error, "Semantics TODO: {0}", std::string);
|
|
emitter_->Emit(parse_node, SemanticsTodo, std::move(label));
|
|
return false;
|
|
}
|
|
|
|
auto SemanticsContext::VerifyOnFinish() -> void {
|
|
// Information in all the various context objects should be cleaned up as
|
|
// various pieces of context go out of scope. At this point, nothing should
|
|
// remain.
|
|
// node_stack_ will still contain top-level entities.
|
|
CARBON_CHECK(name_lookup_.empty()) << name_lookup_.size();
|
|
CARBON_CHECK(scope_stack_.empty()) << scope_stack_.size();
|
|
CARBON_CHECK(node_block_stack_.empty()) << node_block_stack_.size();
|
|
CARBON_CHECK(params_or_args_stack_.empty()) << params_or_args_stack_.size();
|
|
}
|
|
|
|
auto SemanticsContext::AddNode(SemanticsNode node) -> SemanticsNodeId {
|
|
return AddNodeToBlock(node_block_stack_.PeekForAdd(), node);
|
|
}
|
|
|
|
auto SemanticsContext::AddNodeToBlock(SemanticsNodeBlockId block,
|
|
SemanticsNode node) -> SemanticsNodeId {
|
|
CARBON_VLOG() << "AddNode " << block << ": " << node << "\n";
|
|
return semantics_ir_->AddNode(block, node);
|
|
}
|
|
|
|
auto SemanticsContext::AddNodeAndPush(ParseTree::Node parse_node,
|
|
SemanticsNode node) -> void {
|
|
auto node_id = AddNode(node);
|
|
node_stack_.Push(parse_node, node_id);
|
|
}
|
|
|
|
CARBON_DIAGNOSTIC(NameDeclarationDuplicate, Error,
|
|
"Duplicate name being declared in the same scope.");
|
|
CARBON_DIAGNOSTIC(NameDeclarationPrevious, Note,
|
|
"Name is previously declared here.");
|
|
|
|
auto SemanticsContext::AddNameToLookup(ParseTree::Node name_node,
|
|
SemanticsStringId name_id,
|
|
SemanticsNodeId target_id) -> void {
|
|
if (current_scope().names.insert(name_id).second) {
|
|
name_lookup_[name_id].push_back(target_id);
|
|
} else {
|
|
auto prev_def_id = name_lookup_[name_id].back();
|
|
auto prev_def = semantics_ir_->GetNode(prev_def_id);
|
|
emitter_->Build(name_node, NameDeclarationDuplicate)
|
|
.Note(prev_def.parse_node(), NameDeclarationPrevious)
|
|
.Emit();
|
|
}
|
|
}
|
|
|
|
auto SemanticsContext::AddNameToLookup(DeclarationNameContext name_context,
|
|
SemanticsNodeId target_id) -> void {
|
|
switch (name_context.state) {
|
|
case DeclarationNameContext::State::Error:
|
|
// The name is invalid and a diagnostic has already been emitted.
|
|
return;
|
|
|
|
case DeclarationNameContext::State::New:
|
|
CARBON_FATAL() << "Name is missing, not expected to call AddNameToLookup "
|
|
"(but that may change based on error handling).";
|
|
|
|
case DeclarationNameContext::State::Resolved:
|
|
case DeclarationNameContext::State::ResolvedNonScope: {
|
|
auto prev_def = semantics_ir_->GetNode(name_context.resolved_node_id);
|
|
emitter_->Build(name_context.parse_node, NameDeclarationDuplicate)
|
|
.Note(prev_def.parse_node(), NameDeclarationPrevious)
|
|
.Emit();
|
|
return;
|
|
}
|
|
|
|
case DeclarationNameContext::State::Unresolved:
|
|
if (name_context.target_scope_id == SemanticsNameScopeId::Invalid) {
|
|
AddNameToLookup(name_context.parse_node,
|
|
name_context.unresolved_name_id, target_id);
|
|
} else {
|
|
bool success = semantics_ir_->AddNameScopeEntry(
|
|
name_context.target_scope_id, name_context.unresolved_name_id,
|
|
target_id);
|
|
CARBON_CHECK(success)
|
|
<< "Duplicate names should have been resolved previously: "
|
|
<< name_context.unresolved_name_id << " in "
|
|
<< name_context.target_scope_id;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
|
|
auto SemanticsContext::LookupName(ParseTree::Node parse_node,
|
|
SemanticsStringId name_id,
|
|
SemanticsNameScopeId scope_id,
|
|
bool print_diagnostics) -> SemanticsNodeId {
|
|
if (scope_id == SemanticsNameScopeId::Invalid) {
|
|
auto it = name_lookup_.find(name_id);
|
|
if (it == name_lookup_.end()) {
|
|
if (print_diagnostics) {
|
|
emitter_->Emit(parse_node, NameNotFound,
|
|
semantics_ir_->GetString(name_id));
|
|
}
|
|
return SemanticsNodeId::BuiltinInvalidType;
|
|
}
|
|
CARBON_CHECK(!it->second.empty())
|
|
<< "Should have been erased: " << semantics_ir_->GetString(name_id);
|
|
|
|
// TODO: Check for ambiguous lookups.
|
|
return it->second.back();
|
|
} else {
|
|
const auto& scope = semantics_ir_->GetNameScope(scope_id);
|
|
auto it = scope.find(name_id);
|
|
if (it == scope.end()) {
|
|
if (print_diagnostics) {
|
|
emitter_->Emit(parse_node, NameNotFound,
|
|
semantics_ir_->GetString(name_id));
|
|
}
|
|
return SemanticsNodeId::BuiltinInvalidType;
|
|
}
|
|
|
|
return it->second;
|
|
}
|
|
}
|
|
|
|
auto SemanticsContext::PushScope() -> void { scope_stack_.push_back({}); }
|
|
|
|
auto SemanticsContext::PopScope() -> void {
|
|
auto scope = scope_stack_.pop_back_val();
|
|
for (const auto& str_id : scope.names) {
|
|
auto it = name_lookup_.find(str_id);
|
|
if (it->second.size() == 1) {
|
|
// Erase names that no longer resolve.
|
|
name_lookup_.erase(it);
|
|
} else {
|
|
it->second.pop_back();
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename BranchNode, typename... Args>
|
|
static auto AddDominatedBlockAndBranchImpl(SemanticsContext& context,
|
|
ParseTree::Node parse_node,
|
|
Args... args)
|
|
-> SemanticsNodeBlockId {
|
|
if (!context.node_block_stack().is_current_block_reachable()) {
|
|
return SemanticsNodeBlockId::Unreachable;
|
|
}
|
|
auto block_id = context.semantics_ir().AddNodeBlock();
|
|
context.AddNode(BranchNode::Make(parse_node, block_id, args...));
|
|
return block_id;
|
|
}
|
|
|
|
auto SemanticsContext::AddDominatedBlockAndBranch(ParseTree::Node parse_node)
|
|
-> SemanticsNodeBlockId {
|
|
return AddDominatedBlockAndBranchImpl<SemanticsNode::Branch>(*this,
|
|
parse_node);
|
|
}
|
|
|
|
auto SemanticsContext::AddDominatedBlockAndBranchWithArg(
|
|
ParseTree::Node parse_node, SemanticsNodeId arg_id)
|
|
-> SemanticsNodeBlockId {
|
|
return AddDominatedBlockAndBranchImpl<SemanticsNode::BranchWithArg>(
|
|
*this, parse_node, arg_id);
|
|
}
|
|
|
|
auto SemanticsContext::AddDominatedBlockAndBranchIf(ParseTree::Node parse_node,
|
|
SemanticsNodeId cond_id)
|
|
-> SemanticsNodeBlockId {
|
|
return AddDominatedBlockAndBranchImpl<SemanticsNode::BranchIf>(
|
|
*this, parse_node, cond_id);
|
|
}
|
|
|
|
auto SemanticsContext::AddConvergenceBlockAndPush(
|
|
ParseTree::Node parse_node,
|
|
std::initializer_list<SemanticsNodeBlockId> blocks) -> void {
|
|
CARBON_CHECK(blocks.size() >= 2) << "no convergence";
|
|
|
|
SemanticsNodeBlockId new_block_id = SemanticsNodeBlockId::Unreachable;
|
|
for (SemanticsNodeBlockId block_id : blocks) {
|
|
if (block_id != SemanticsNodeBlockId::Unreachable) {
|
|
if (new_block_id == SemanticsNodeBlockId::Unreachable) {
|
|
new_block_id = semantics_ir().AddNodeBlock();
|
|
}
|
|
AddNodeToBlock(block_id,
|
|
SemanticsNode::Branch::Make(parse_node, new_block_id));
|
|
}
|
|
}
|
|
node_block_stack().Push(new_block_id);
|
|
}
|
|
|
|
auto SemanticsContext::AddConvergenceBlockWithArgAndPush(
|
|
ParseTree::Node parse_node,
|
|
std::initializer_list<std::pair<SemanticsNodeBlockId, SemanticsNodeId>>
|
|
blocks_and_args) -> SemanticsNodeId {
|
|
CARBON_CHECK(blocks_and_args.size() >= 2) << "no convergence";
|
|
|
|
SemanticsNodeBlockId new_block_id = SemanticsNodeBlockId::Unreachable;
|
|
for (auto [block_id, arg_id] : blocks_and_args) {
|
|
if (block_id != SemanticsNodeBlockId::Unreachable) {
|
|
if (new_block_id == SemanticsNodeBlockId::Unreachable) {
|
|
new_block_id = semantics_ir().AddNodeBlock();
|
|
}
|
|
AddNodeToBlock(block_id, SemanticsNode::BranchWithArg::Make(
|
|
parse_node, new_block_id, arg_id));
|
|
}
|
|
}
|
|
node_block_stack().Push(new_block_id);
|
|
|
|
// Acquire the result value.
|
|
SemanticsTypeId result_type_id =
|
|
semantics_ir().GetNode(blocks_and_args.begin()->second).type_id();
|
|
return AddNode(
|
|
SemanticsNode::BlockArg::Make(parse_node, result_type_id, new_block_id));
|
|
}
|
|
|
|
// Add the current code block to the enclosing function.
|
|
auto SemanticsContext::AddCurrentCodeBlockToFunction() -> void {
|
|
CARBON_CHECK(!node_block_stack().empty()) << "no current code block";
|
|
CARBON_CHECK(!return_scope_stack().empty()) << "no current function";
|
|
|
|
if (!node_block_stack().is_current_block_reachable()) {
|
|
// Don't include unreachable blocks in the function.
|
|
return;
|
|
}
|
|
|
|
auto function_id = semantics_ir()
|
|
.GetNode(return_scope_stack().back())
|
|
.GetAsFunctionDeclaration();
|
|
semantics_ir()
|
|
.GetFunction(function_id)
|
|
.body_block_ids.push_back(node_block_stack().PeekForAdd());
|
|
}
|
|
|
|
auto SemanticsContext::is_current_position_reachable() -> bool {
|
|
switch (auto block_id = node_block_stack().Peek(); block_id.index) {
|
|
case SemanticsNodeBlockId::Unreachable.index: {
|
|
return false;
|
|
}
|
|
case SemanticsNodeBlockId::Invalid.index: {
|
|
return true;
|
|
}
|
|
default: {
|
|
// Our current position is at the end of a real block. That position is
|
|
// reachable unless the previous instruction is a terminator instruction.
|
|
const auto& block_contents = semantics_ir().GetNodeBlock(block_id);
|
|
if (block_contents.empty()) {
|
|
return true;
|
|
}
|
|
const auto& last_node = semantics_ir().GetNode(block_contents.back());
|
|
return last_node.kind().terminator_kind() !=
|
|
SemanticsTerminatorKind::Terminator;
|
|
}
|
|
}
|
|
}
|
|
|
|
auto SemanticsContext::PushDeclarationName() -> void {
|
|
declaration_name_stack_.push_back(
|
|
{.state = DeclarationNameContext::State::New,
|
|
.target_scope_id = SemanticsNameScopeId::Invalid,
|
|
.resolved_node_id = SemanticsNodeId::Invalid});
|
|
}
|
|
|
|
auto SemanticsContext::PopDeclarationName() -> DeclarationNameContext {
|
|
if (parse_tree_->node_kind(node_stack().PeekParseNode()) ==
|
|
ParseNodeKind::QualifiedDeclaration) {
|
|
// Any parts from a QualifiedDeclaration will already have been processed
|
|
// into the name.
|
|
node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::QualifiedDeclaration);
|
|
} else {
|
|
// The name had no qualifiers, so we need to process the node now.
|
|
auto [parse_node, node_or_name_id] =
|
|
node_stack_.PopWithParseNode<SemanticsNodeId>();
|
|
ApplyDeclarationNameQualifier(parse_node, node_or_name_id);
|
|
}
|
|
|
|
return declaration_name_stack_.pop_back_val();
|
|
}
|
|
|
|
auto SemanticsContext::ApplyDeclarationNameQualifier(
|
|
ParseTree::Node parse_node, SemanticsNodeId node_or_name_id) -> void {
|
|
auto& name_context = declaration_name_stack_.back();
|
|
switch (name_context.state) {
|
|
case DeclarationNameContext::State::Error:
|
|
// Already in an error state, so return without examining.
|
|
return;
|
|
|
|
case DeclarationNameContext::State::Unresolved:
|
|
// Because more qualifiers were found, we diagnose that the earlier
|
|
// qualifier failed to resolve.
|
|
name_context.state = DeclarationNameContext::State::Error;
|
|
emitter_->Emit(name_context.parse_node, NameNotFound,
|
|
semantics_ir_->GetString(name_context.unresolved_name_id));
|
|
return;
|
|
|
|
case DeclarationNameContext::State::ResolvedNonScope: {
|
|
// Because more qualifiers were found, we diagnose that the earlier
|
|
// qualifier didn't resolve to a scoped entity.
|
|
name_context.state = DeclarationNameContext::State::Error;
|
|
CARBON_DIAGNOSTIC(QualifiedDeclarationInNonScope, Error,
|
|
"Declaration qualifiers are only allowed for entities "
|
|
"that provide a scope.");
|
|
CARBON_DIAGNOSTIC(QualifiedDeclarationNonScopeEntity, Note,
|
|
"Non-scope entity referenced here.");
|
|
emitter_->Build(parse_node, QualifiedDeclarationInNonScope)
|
|
.Note(name_context.parse_node, QualifiedDeclarationNonScopeEntity)
|
|
.Emit();
|
|
return;
|
|
}
|
|
|
|
case DeclarationNameContext::State::New:
|
|
case DeclarationNameContext::State::Resolved: {
|
|
name_context.parse_node = parse_node;
|
|
if (parse_tree().node_kind(name_context.parse_node) ==
|
|
ParseNodeKind::Name) {
|
|
// For identifier nodes, we need to perform a lookup on the identifier.
|
|
// This means the input node_id is actually a string ID.
|
|
SemanticsStringId name_id(node_or_name_id.index);
|
|
auto resolved_node_id = LookupName(name_context.parse_node, name_id,
|
|
name_context.target_scope_id,
|
|
/*print_diagnostics=*/false);
|
|
if (resolved_node_id == SemanticsNodeId::BuiltinInvalidType) {
|
|
// Invalid indicates an unresolved node. Store it and return.
|
|
name_context.state = DeclarationNameContext::State::Unresolved;
|
|
name_context.unresolved_name_id = name_id;
|
|
return;
|
|
} else {
|
|
// Store the resolved node and continue for the target scope update.
|
|
name_context.resolved_node_id = resolved_node_id;
|
|
}
|
|
} else {
|
|
// For other nodes, we expect a regular resolved node, for example a
|
|
// namespace or generic type. Store it and continue for the target scope
|
|
// update.
|
|
name_context.resolved_node_id = node_or_name_id;
|
|
}
|
|
|
|
// This will only be reached for resolved nodes. We update the target
|
|
// scope based on the resolved type.
|
|
auto resolved_node =
|
|
semantics_ir_->GetNode(name_context.resolved_node_id);
|
|
switch (resolved_node.kind()) {
|
|
case SemanticsNodeKind::Namespace:
|
|
name_context.state = DeclarationNameContext::State::Resolved;
|
|
name_context.target_scope_id = resolved_node.GetAsNamespace();
|
|
break;
|
|
default:
|
|
name_context.state = DeclarationNameContext::State::ResolvedNonScope;
|
|
break;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
auto SemanticsContext::ImplicitAsForArgs(
|
|
SemanticsNodeBlockId arg_refs_id, ParseTree::Node param_parse_node,
|
|
SemanticsNodeBlockId param_refs_id,
|
|
DiagnosticEmitter<ParseTree::Node>::DiagnosticBuilder* diagnostic) -> bool {
|
|
// If both arguments and parameters are empty, return quickly. Otherwise,
|
|
// we'll fetch both so that errors are consistent.
|
|
if (arg_refs_id == SemanticsNodeBlockId::Empty &&
|
|
param_refs_id == SemanticsNodeBlockId::Empty) {
|
|
return true;
|
|
}
|
|
|
|
auto arg_refs = semantics_ir_->GetNodeBlock(arg_refs_id);
|
|
auto param_refs = semantics_ir_->GetNodeBlock(param_refs_id);
|
|
|
|
// If sizes mismatch, fail early.
|
|
if (arg_refs.size() != param_refs.size()) {
|
|
CARBON_CHECK(diagnostic != nullptr) << "Should have validated first";
|
|
CARBON_DIAGNOSTIC(CallArgCountMismatch, Note,
|
|
"Function cannot be used: Received {0} argument(s), but "
|
|
"require {1} argument(s).",
|
|
int, int);
|
|
diagnostic->Note(param_parse_node, CallArgCountMismatch, arg_refs.size(),
|
|
param_refs.size());
|
|
return false;
|
|
}
|
|
|
|
// Check type conversions per-element.
|
|
// TODO: arg_ir_id is passed so that implicit conversions can be inserted.
|
|
// It's currently not supported, but will be needed.
|
|
for (size_t i = 0; i < arg_refs.size(); ++i) {
|
|
auto value_id = arg_refs[i];
|
|
auto as_type_id = semantics_ir_->GetNode(param_refs[i]).type_id();
|
|
if (ImplicitAsImpl(value_id, as_type_id,
|
|
diagnostic == nullptr ? &value_id : nullptr) ==
|
|
ImplicitAsKind::Incompatible) {
|
|
CARBON_CHECK(diagnostic != nullptr) << "Should have validated first";
|
|
CARBON_DIAGNOSTIC(CallArgTypeMismatch, Note,
|
|
"Function cannot be used: Cannot implicityly convert "
|
|
"argument {0} from `{1}` to `{2}`.",
|
|
size_t, std::string, std::string);
|
|
diagnostic->Note(param_parse_node, CallArgTypeMismatch, i,
|
|
semantics_ir_->StringifyType(
|
|
semantics_ir_->GetNode(value_id).type_id()),
|
|
semantics_ir_->StringifyType(as_type_id));
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
auto SemanticsContext::ImplicitAsRequired(ParseTree::Node parse_node,
|
|
SemanticsNodeId value_id,
|
|
SemanticsTypeId as_type_id)
|
|
-> SemanticsNodeId {
|
|
SemanticsNodeId output_value_id = value_id;
|
|
if (ImplicitAsImpl(value_id, as_type_id, &output_value_id) ==
|
|
ImplicitAsKind::Incompatible) {
|
|
// Only error when the system is trying to use the result.
|
|
CARBON_DIAGNOSTIC(ImplicitAsConversionFailure, Error,
|
|
"Cannot implicitly convert from `{0}` to `{1}`.",
|
|
std::string, std::string);
|
|
emitter_
|
|
->Build(parse_node, ImplicitAsConversionFailure,
|
|
semantics_ir_->StringifyType(
|
|
semantics_ir_->GetNode(value_id).type_id()),
|
|
semantics_ir_->StringifyType(as_type_id))
|
|
.Emit();
|
|
}
|
|
return output_value_id;
|
|
}
|
|
|
|
auto SemanticsContext::ImplicitAsBool(ParseTree::Node parse_node,
|
|
SemanticsNodeId value_id)
|
|
-> SemanticsNodeId {
|
|
return ImplicitAsRequired(parse_node, value_id,
|
|
CanonicalizeType(SemanticsNodeId::BuiltinBoolType));
|
|
}
|
|
|
|
auto SemanticsContext::ImplicitAsImpl(SemanticsNodeId value_id,
|
|
SemanticsTypeId as_type_id,
|
|
SemanticsNodeId* output_value_id)
|
|
-> ImplicitAsKind {
|
|
// Start by making sure both sides are valid. If any part is invalid, the
|
|
// result is invalid and we shouldn't error.
|
|
if (value_id == SemanticsNodeId::BuiltinInvalidType) {
|
|
// If the value is invalid, we can't do much, but do "succeed".
|
|
return ImplicitAsKind::Identical;
|
|
}
|
|
auto value = semantics_ir_->GetNode(value_id);
|
|
auto value_type_id = value.type_id();
|
|
if (value_type_id == SemanticsTypeId::InvalidType) {
|
|
return ImplicitAsKind::Identical;
|
|
}
|
|
|
|
if (as_type_id == SemanticsTypeId::InvalidType) {
|
|
// Although the target type is invalid, this still changes the value.
|
|
if (output_value_id != nullptr) {
|
|
*output_value_id = SemanticsNodeId::BuiltinInvalidType;
|
|
}
|
|
return ImplicitAsKind::Compatible;
|
|
}
|
|
|
|
if (value_type_id == as_type_id) {
|
|
// Type doesn't need to change.
|
|
return ImplicitAsKind::Identical;
|
|
}
|
|
|
|
if (as_type_id == SemanticsTypeId::TypeType) {
|
|
// TODO: When converting `()` to a type, the result is `() as Type`.
|
|
// Right now there is no tuple value support.
|
|
|
|
// When converting `{}` to a type, the result is `{} as Type`.
|
|
if (value.kind() == SemanticsNodeKind::StructValue &&
|
|
value.GetAsStructValue() == SemanticsNodeBlockId::Empty) {
|
|
if (output_value_id != nullptr) {
|
|
*output_value_id = semantics_ir_->GetType(value_type_id);
|
|
}
|
|
return ImplicitAsKind::Compatible;
|
|
}
|
|
}
|
|
|
|
// TODO: Handle ImplicitAs for compatible structs and tuples.
|
|
|
|
if (output_value_id != nullptr) {
|
|
*output_value_id = SemanticsNodeId::BuiltinInvalidType;
|
|
}
|
|
return ImplicitAsKind::Incompatible;
|
|
}
|
|
|
|
auto SemanticsContext::ParamOrArgStart() -> void {
|
|
params_or_args_stack_.Push();
|
|
}
|
|
|
|
auto SemanticsContext::ParamOrArgComma(bool for_args) -> void {
|
|
ParamOrArgSave(for_args);
|
|
}
|
|
|
|
auto SemanticsContext::ParamOrArgEnd(bool for_args, ParseNodeKind start_kind)
|
|
-> SemanticsNodeBlockId {
|
|
if (parse_tree_->node_kind(node_stack_.PeekParseNode()) != start_kind) {
|
|
ParamOrArgSave(for_args);
|
|
}
|
|
return params_or_args_stack_.Pop();
|
|
}
|
|
|
|
auto SemanticsContext::ParamOrArgSave(bool for_args) -> void {
|
|
SemanticsNodeId param_or_arg_id = SemanticsNodeId::Invalid;
|
|
if (for_args) {
|
|
// For an argument, we add a stub reference to the expression on the top of
|
|
// the stack. There may not be anything on the IR prior to this.
|
|
auto [entry_parse_node, entry_node_id] =
|
|
node_stack_.PopWithParseNode<SemanticsNodeId>();
|
|
param_or_arg_id = AddNode(SemanticsNode::StubReference::Make(
|
|
entry_parse_node, semantics_ir_->GetNode(entry_node_id).type_id(),
|
|
entry_node_id));
|
|
} else {
|
|
// For a parameter, there should always be something in the IR.
|
|
node_stack_.PopAndIgnore();
|
|
auto ir_id = node_block_stack_.Peek();
|
|
CARBON_CHECK(ir_id.is_valid());
|
|
auto& ir = semantics_ir_->GetNodeBlock(ir_id);
|
|
CARBON_CHECK(!ir.empty()) << "Should have had a param";
|
|
param_or_arg_id = ir.back();
|
|
}
|
|
|
|
// Save the param or arg ID.
|
|
auto& params_or_args =
|
|
semantics_ir_->GetNodeBlock(params_or_args_stack_.PeekForAdd());
|
|
params_or_args.push_back(param_or_arg_id);
|
|
}
|
|
|
|
auto SemanticsContext::CanonicalizeType(SemanticsNodeId node_id)
|
|
-> SemanticsTypeId {
|
|
auto it = canonical_types_.find(node_id);
|
|
if (it != canonical_types_.end()) {
|
|
return it->second;
|
|
}
|
|
|
|
auto type_id = semantics_ir_->AddType(node_id);
|
|
CARBON_CHECK(canonical_types_.insert({node_id, type_id}).second);
|
|
return type_id;
|
|
}
|
|
|
|
auto SemanticsContext::CanonicalizeStructType(ParseTree::Node parse_node,
|
|
SemanticsNodeBlockId refs_id)
|
|
-> SemanticsTypeId {
|
|
// Construct the field structure for lookup.
|
|
auto refs = semantics_ir_->GetNodeBlock(refs_id);
|
|
llvm::FoldingSetNodeID canonical_id;
|
|
for (const auto& ref_id : refs) {
|
|
auto ref = semantics_ir_->GetNode(ref_id);
|
|
canonical_id.AddInteger(ref.GetAsStructTypeField().index);
|
|
canonical_id.AddInteger(ref.type_id().index);
|
|
}
|
|
|
|
// If a struct with matching fields was already created, reuse it.
|
|
void* insert_pos;
|
|
auto* node =
|
|
canonical_struct_types_.FindNodeOrInsertPos(canonical_id, insert_pos);
|
|
if (node != nullptr) {
|
|
return node->type_id();
|
|
}
|
|
|
|
// The struct doesn't already exist, so create and store it as canonical.
|
|
auto node_id = AddNode(SemanticsNode::StructType::Make(
|
|
parse_node, SemanticsTypeId::TypeType, refs_id));
|
|
auto type_id = semantics_ir_->AddType(node_id);
|
|
CARBON_CHECK(canonical_types_.insert({node_id, type_id}).second);
|
|
canonical_struct_types_nodes_.push_back(
|
|
std::make_unique<StructTypeNode>(canonical_id, type_id));
|
|
canonical_struct_types_.InsertNode(canonical_struct_types_nodes_.back().get(),
|
|
insert_pos);
|
|
return type_id;
|
|
}
|
|
|
|
auto SemanticsContext::PrintForStackDump(llvm::raw_ostream& output) const
|
|
-> void {
|
|
node_stack_.PrintForStackDump(output);
|
|
node_block_stack_.PrintForStackDump(output);
|
|
params_or_args_stack_.PrintForStackDump(output);
|
|
args_type_info_stack_.PrintForStackDump(output);
|
|
}
|
|
|
|
} // namespace Carbon
|