Files
carbon-lang/toolchain/semantics/semantics_node.h
T
Jon Ross-Perkins 6feed2ae33 Add tracking of function parameters (#2552)
For parameters (and in the future, arguments too; generally comma-separated lists) track two node blocks:

1. param_ir: The complete IR.
2. param_refs: Nodes within the IR that are the "root" parameter.

param_refs should allow quick counting of the # of parameters, and more efficient comparison of call args with function parameters. param_ir should be necessary to generate the actual signature.

In order to construct this, this refactors the node_block_stack into its own class, which is reused in params_stack. These carry references to the underlying SmallVector for lazy modification in order to avoid a dependency cycle with SemanticsIR (also see notes on empty node blocks below).

When finalized, the block pair is pushed onto finished_params_stack. That's because node_stack only has space for one thing, and this is two things -- so I'm essentially choosing a trade-off of adding another stack in order to avoid consuming more space in the expectation that most parse nodes have 0 or 1 things to return, and 2 will be very rare.

As factored, this currently consolidates most empty node blocks into a single canonical empty node block. This is because I think empty blocks, i.e. `()`, will be very common. In order to achieve this, SemanticsNodeBlockStack does lazy creation.

An alternative approach would have been to use 1 node block per parameter. We decided against this in order to reduce the number of vectors being created.
2023-01-26 14:30:38 -08:00

286 lines
10 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_SEMANTICS_SEMANTICS_NODE_H_
#define CARBON_TOOLCHAIN_SEMANTICS_SEMANTICS_NODE_H_
#include <cstdint>
#include "common/check.h"
#include "common/ostream.h"
#include "toolchain/parser/parse_tree.h"
#include "toolchain/semantics/semantics_builtin_kind.h"
#include "toolchain/semantics/semantics_node_kind.h"
namespace Carbon {
// Type-safe storage of Node IDs.
struct SemanticsNodeId : public IndexBase {
// Uses the cross-reference node ID for a builtin. This relies on SemanticsIR
// guarantees for builtin cross-reference placement.
static auto MakeBuiltinReference(SemanticsBuiltinKind kind)
-> SemanticsNodeId {
return SemanticsNodeId(kind.AsInt());
}
// Constructs an explicitly invalid instance.
static auto MakeInvalid() -> SemanticsNodeId { return SemanticsNodeId(); }
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "node";
IndexBase::Print(out);
}
};
// The ID of a callable, such as a function.
struct SemanticsCallableId : public IndexBase {
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "callable" << index;
}
};
// The ID of a cross-referenced IR.
struct SemanticsCrossReferenceIRId : public IndexBase {
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "ir";
IndexBase::Print(out);
}
};
// Type-safe storage of integer literals.
struct SemanticsIntegerLiteralId : public IndexBase {
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "int";
IndexBase::Print(out);
}
};
// Type-safe storage of node blocks.
struct SemanticsNodeBlockId : public IndexBase {
// All SemanticsIR instances must provide the 0th node block as empty.
// NOLINTNEXTLINE(readability-identifier-naming)
static const SemanticsNodeBlockId Empty;
// An explicitly invalid ID.
// NOLINTNEXTLINE(readability-identifier-naming)
static const SemanticsNodeBlockId Invalid;
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "block";
IndexBase::Print(out);
}
};
constexpr SemanticsNodeBlockId SemanticsNodeBlockId::Empty =
SemanticsNodeBlockId(0);
constexpr SemanticsNodeBlockId SemanticsNodeBlockId::Invalid =
SemanticsNodeBlockId();
// Type-safe storage of strings.
struct SemanticsStringId : public IndexBase {
using IndexBase::IndexBase;
auto Print(llvm::raw_ostream& out) const -> void {
out << "str";
IndexBase::Print(out);
}
};
// The standard structure for nodes.
class SemanticsNode {
public:
struct NoArgs {};
auto GetAsInvalid() const -> NoArgs { CARBON_FATAL() << "Invalid access"; }
static auto MakeAssign(ParseTree::Node parse_node, SemanticsNodeId type,
SemanticsNodeId lhs, SemanticsNodeId rhs)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::Assign, type, lhs.index,
rhs.index);
}
auto GetAsAssign() const -> std::pair<SemanticsNodeId, SemanticsNodeId> {
CARBON_CHECK(kind_ == SemanticsNodeKind::Assign);
return {SemanticsNodeId(arg0_), SemanticsNodeId(arg1_)};
}
static auto MakeBinaryOperatorAdd(ParseTree::Node parse_node,
SemanticsNodeId type, SemanticsNodeId lhs,
SemanticsNodeId rhs) -> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::BinaryOperatorAdd, type,
lhs.index, rhs.index);
}
auto GetAsBinaryOperatorAdd() const
-> std::pair<SemanticsNodeId, SemanticsNodeId> {
CARBON_CHECK(kind_ == SemanticsNodeKind::BinaryOperatorAdd);
return {SemanticsNodeId(arg0_), SemanticsNodeId(arg1_)};
}
static auto MakeBindName(ParseTree::Node parse_node, SemanticsNodeId type,
SemanticsStringId name, SemanticsNodeId node)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::BindName, type,
name.index, node.index);
}
auto GetAsBindName() const -> std::pair<SemanticsStringId, SemanticsNodeId> {
CARBON_CHECK(kind_ == SemanticsNodeKind::BindName);
return {SemanticsStringId(arg0_), SemanticsNodeId(arg1_)};
}
static auto MakeBuiltin(SemanticsBuiltinKind builtin_kind,
SemanticsNodeId type) -> SemanticsNode {
// Builtins won't have a ParseTree node associated, so we provide the
// default invalid one.
return SemanticsNode(ParseTree::Node(), SemanticsNodeKind::Builtin, type,
builtin_kind.AsInt());
}
auto GetAsBuiltin() const -> SemanticsBuiltinKind {
CARBON_CHECK(kind_ == SemanticsNodeKind::Builtin);
return SemanticsBuiltinKind::FromInt(arg0_);
}
static auto MakeCodeBlock(ParseTree::Node parse_node,
SemanticsNodeBlockId node_block) -> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::CodeBlock,
SemanticsNodeId(), node_block.index);
}
auto GetAsCodeBlock() const -> SemanticsNodeBlockId {
CARBON_CHECK(kind_ == SemanticsNodeKind::CodeBlock);
return SemanticsNodeBlockId(arg0_);
}
static auto MakeCrossReference(SemanticsNodeId type,
SemanticsCrossReferenceIRId ir,
SemanticsNodeId node) -> SemanticsNode {
return SemanticsNode(ParseTree::Node::MakeInvalid(),
SemanticsNodeKind::CrossReference, type, ir.index,
node.index);
}
auto GetAsCrossReference() const
-> std::pair<SemanticsCrossReferenceIRId, SemanticsNodeBlockId> {
CARBON_CHECK(kind_ == SemanticsNodeKind::CrossReference);
return {SemanticsCrossReferenceIRId(arg0_), SemanticsNodeBlockId(arg1_)};
}
// TODO: The signature should be added as a parameter.
static auto MakeFunctionDeclaration(ParseTree::Node parse_node,
SemanticsCallableId signature)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::FunctionDeclaration,
SemanticsNodeId(), signature.index);
}
auto GetAsFunctionDeclaration() const -> SemanticsCallableId {
CARBON_CHECK(kind_ == SemanticsNodeKind::FunctionDeclaration);
return {SemanticsCallableId(arg0_)};
}
static auto MakeFunctionDefinition(ParseTree::Node parse_node,
SemanticsNodeId decl,
SemanticsNodeBlockId node_block)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::FunctionDefinition,
SemanticsNodeId(), decl.index, node_block.index);
}
auto GetAsFunctionDefinition() const
-> std::pair<SemanticsNodeId, SemanticsNodeBlockId> {
CARBON_CHECK(kind_ == SemanticsNodeKind::FunctionDefinition);
return {SemanticsNodeId(arg0_), SemanticsNodeBlockId(arg1_)};
}
static auto MakeIntegerLiteral(ParseTree::Node parse_node,
SemanticsIntegerLiteralId integer)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::IntegerLiteral,
SemanticsNodeId::MakeBuiltinReference(
SemanticsBuiltinKind::IntegerType),
integer.index);
}
auto GetAsIntegerLiteral() const -> SemanticsIntegerLiteralId {
CARBON_CHECK(kind_ == SemanticsNodeKind::IntegerLiteral);
return SemanticsIntegerLiteralId(arg0_);
}
static auto MakeRealLiteral(ParseTree::Node parse_node) -> SemanticsNode {
return SemanticsNode(
parse_node, SemanticsNodeKind::RealLiteral,
SemanticsNodeId::MakeBuiltinReference(SemanticsBuiltinKind::RealType));
}
auto GetAsRealLiteral() const -> NoArgs {
CARBON_CHECK(kind_ == SemanticsNodeKind::RealLiteral);
return {};
}
static auto MakeReturn(ParseTree::Node parse_node) -> SemanticsNode {
// The actual type is `()`. However, code dealing with `return;` should
// understand the type without checking, so it's not necessary but could be
// specified if needed.
return SemanticsNode(parse_node, SemanticsNodeKind::Return,
SemanticsNodeId());
}
auto GetAsReturn() const -> NoArgs {
CARBON_CHECK(kind_ == SemanticsNodeKind::Return);
return {};
}
static auto MakeReturnExpression(ParseTree::Node parse_node,
SemanticsNodeId type, SemanticsNodeId expr)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::ReturnExpression, type,
expr.index);
}
auto GetAsReturnExpression() const -> SemanticsNodeId {
CARBON_CHECK(kind_ == SemanticsNodeKind::ReturnExpression);
return SemanticsNodeId(arg0_);
}
static auto MakeVarStorage(ParseTree::Node parse_node, SemanticsNodeId type)
-> SemanticsNode {
return SemanticsNode(parse_node, SemanticsNodeKind::VarStorage, type);
}
auto GetAsVarStorage() const -> NoArgs {
CARBON_CHECK(kind_ == SemanticsNodeKind::VarStorage);
return NoArgs();
}
SemanticsNode()
: SemanticsNode(ParseTree::Node(), SemanticsNodeKind::Invalid,
SemanticsNodeId()) {}
auto parse_node() const -> ParseTree::Node { return parse_node_; }
auto kind() const -> SemanticsNodeKind { return kind_; }
auto type() const -> SemanticsNodeId { return type_; }
auto Print(llvm::raw_ostream& out) const -> void;
private:
explicit SemanticsNode(ParseTree::Node parse_node, SemanticsNodeKind kind,
SemanticsNodeId type, int32_t arg0 = -1,
int32_t arg1 = -1)
: parse_node_(parse_node),
kind_(kind),
type_(type),
arg0_(arg0),
arg1_(arg1) {}
ParseTree::Node parse_node_;
SemanticsNodeKind kind_;
SemanticsNodeId type_;
int32_t arg0_;
int32_t arg1_;
};
// TODO: This is currently 20 bytes because we sometimes have 2 arguments for a
// pair of SemanticsNodes. However, SemanticsNodeKind is 1 byte; if args
// were 3.5 bytes, we could potentially shrink SemanticsNode by 4 bytes. This
// may be worth investigating further.
static_assert(sizeof(SemanticsNode) == 20, "Unexpected SemanticsNode size");
} // namespace Carbon
#endif // CARBON_TOOLCHAIN_SEMANTICS_SEMANTICS_NODE_H_