Stowage/ladybird
2
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2025-10-30 21:01:00 +00:00
Code Issues Projects Releases Packages Wiki Activity
ladybird/Userland/Libraries/LibCpp/AST.cpp

427 lines
10 KiB
C++
Raw Normal View History

LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
/*
* Copyright (c) 2021, Itamar S. <itamar8910@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "AST.h"
namespace Cpp {
static void print_indent(int indent)
{
for (int i = 0; i < indent * 2; ++i)
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
out(" ");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void ASTNode::dump(size_t indent) const
{
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}[{}:{}->{}:{}]", class_name(), start().line, start().column, end().line, end().column);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void TranslationUnit::dump(size_t indent) const
{
ASTNode::dump(indent);
LibCpp: Parse Namespace declaration Also, remove unused State::Context
2021-03-19 21:47:43 +02:00
for (const auto& child : m_declarations) {
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
child.dump(indent + 1);
}
}
void FunctionDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
m_return_type->dump(indent + 1);
if (!m_name.is_null()) {
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("(");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
for (const auto& arg : m_parameters) {
arg.dump(indent + 1);
}
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln(")");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
if (!m_definition.is_null()) {
m_definition->dump(indent + 1);
}
}
NonnullRefPtrVector<Declaration> FunctionDeclaration::declarations() const
{
NonnullRefPtrVector<Declaration> declarations;
for (auto& arg : m_parameters) {
declarations.append(arg);
}
return declarations;
}
void Type::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent + 1);
LibCpp: Parse type qualifiers
2021-02-28 18:40:45 +02:00
String qualifiers_string;
LibCpp: Parse ellipsis We can now parse the printf function declaration :^)
2021-03-01 22:33:46 +02:00
if (!m_qualifiers.is_empty())
LibCpp: Parse type qualifiers
2021-02-28 18:40:45 +02:00
qualifiers_string = String::formatted("[{}] ", String::join(" ", m_qualifiers));
outln("{}{}", qualifiers_string, m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void Parameter::dump(size_t indent) const
{
ASTNode::dump(indent);
LibCpp: Parse ellipsis We can now parse the printf function declaration :^)
2021-03-01 22:33:46 +02:00
if (m_is_ellipsis) {
print_indent(indent + 1);
outln("...");
}
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
if (!m_name.is_null()) {
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
LibCpp: Parse ellipsis We can now parse the printf function declaration :^)
2021-03-01 22:33:46 +02:00
if (m_type)
m_type->dump(indent + 1);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void FunctionDefinition::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Fix busted outln() invocations
2021-02-21 21:30:07 +01:00
outln("{{");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
for (const auto& statement : m_statements) {
statement.dump(indent + 1);
}
print_indent(indent);
LibCpp: Fix busted outln() invocations
2021-02-21 21:30:07 +01:00
outln("}}");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
NonnullRefPtrVector<Declaration> FunctionDefinition::declarations() const
{
NonnullRefPtrVector<Declaration> declarations;
for (auto& statement : m_statements) {
declarations.append(statement.declarations());
}
return declarations;
}
void VariableDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
LibCpp: Check if type is null in VariableDeclaration::dump
2021-03-04 11:49:35 +02:00
if (m_type)
m_type->dump(indent + 1);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
if (m_initial_value)
m_initial_value->dump(indent + 1);
}
void Identifier::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void NumericLiteral::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_value);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void BinaryExpression::dump(size_t indent) const
{
ASTNode::dump(indent);
const char* op_string = nullptr;
switch (m_op) {
case BinaryOp::Addition:
op_string = "+";
break;
case BinaryOp::Subtraction:
op_string = "-";
break;
case BinaryOp::Multiplication:
op_string = "*";
break;
case BinaryOp::Division:
op_string = "/";
break;
case BinaryOp::Modulo:
op_string = "%";
break;
case BinaryOp::GreaterThan:
op_string = ">";
break;
case BinaryOp::GreaterThanEquals:
op_string = ">=";
break;
case BinaryOp::LessThan:
op_string = "<";
break;
case BinaryOp::LessThanEquals:
op_string = "<=";
break;
case BinaryOp::BitwiseAnd:
op_string = "&";
break;
case BinaryOp::BitwiseOr:
op_string = "|";
break;
case BinaryOp::BitwiseXor:
op_string = "^";
break;
case BinaryOp::LeftShift:
op_string = "<<";
break;
case BinaryOp::RightShift:
op_string = ">>";
break;
}
m_lhs->dump(indent + 1);
print_indent(indent + 1);
Everywhere: Rename ASSERT => VERIFY (...and ASSERT_NOT_REACHED => VERIFY_NOT_REACHED) Since all of these checks are done in release builds as well, let's rename them to VERIFY to prevent confusion, as everyone is used to assertions being compiled out in release. We can introduce a new ASSERT macro that is specifically for debug checks, but I'm doing this wholesale conversion first since we've accumulated thousands of these already, and it's not immediately obvious which ones are suitable for ASSERT.
2021-02-23 20:42:32 +01:00
VERIFY(op_string);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", op_string);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
m_rhs->dump(indent + 1);
}
void AssignmentExpression::dump(size_t indent) const
{
ASTNode::dump(indent);
const char* op_string = nullptr;
switch (m_op) {
case AssignmentOp::Assignment:
op_string = "=";
break;
case AssignmentOp::AdditionAssignment:
op_string = "+=";
break;
case AssignmentOp::SubtractionAssignment:
op_string = "-=";
break;
}
m_lhs->dump(indent + 1);
print_indent(indent + 1);
Everywhere: Rename ASSERT => VERIFY (...and ASSERT_NOT_REACHED => VERIFY_NOT_REACHED) Since all of these checks are done in release builds as well, let's rename them to VERIFY to prevent confusion, as everyone is used to assertions being compiled out in release. We can introduce a new ASSERT macro that is specifically for debug checks, but I'm doing this wholesale conversion first since we've accumulated thousands of these already, and it's not immediately obvious which ones are suitable for ASSERT.
2021-02-23 20:42:32 +01:00
VERIFY(op_string);
LibCpp: Fix yet another broken outln() invocation.. Fixes #5463
2021-02-21 22:12:40 +01:00
outln("{}", op_string);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
m_rhs->dump(indent + 1);
}
void FunctionCall::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
for (const auto& arg : m_arguments) {
arg.dump(indent + 1);
}
}
void StringLiteral::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_value);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void ReturnStatement::dump(size_t indent) const
{
ASTNode::dump(indent);
m_value->dump(indent + 1);
}
void EnumDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
for (auto& entry : m_entries) {
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", entry);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
}
void StructOrClassDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
for (auto& member : m_members) {
member.dump(indent + 1);
}
}
void MemberDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
m_type->dump(indent + 1);
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_name);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
if (m_initial_value) {
m_initial_value->dump(indent + 2);
}
}
void UnaryExpression::dump(size_t indent) const
{
ASTNode::dump(indent);
const char* op_string = nullptr;
switch (m_op) {
case UnaryOp::BitwiseNot:
op_string = "~";
break;
case UnaryOp::Not:
op_string = "!";
break;
case UnaryOp::Plus:
op_string = "+";
break;
case UnaryOp::Minus:
op_string = "-";
break;
case UnaryOp::PlusPlus:
op_string = "++";
break;
default:
op_string = "<invalid>";
}
Everywhere: Rename ASSERT => VERIFY (...and ASSERT_NOT_REACHED => VERIFY_NOT_REACHED) Since all of these checks are done in release builds as well, let's rename them to VERIFY to prevent confusion, as everyone is used to assertions being compiled out in release. We can introduce a new ASSERT macro that is specifically for debug checks, but I'm doing this wholesale conversion first since we've accumulated thousands of these already, and it's not immediately obvious which ones are suitable for ASSERT.
2021-02-23 20:42:32 +01:00
VERIFY(op_string);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", op_string);
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
m_lhs->dump(indent + 1);
}
void BooleanLiteral::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("{}", m_value ? "true" : "false");
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
void Pointer::dump(size_t indent) const
{
ASTNode::dump(indent);
if (!m_pointee.is_null()) {
m_pointee->dump(indent + 1);
}
}
void MemberExpression::dump(size_t indent) const
{
ASTNode::dump(indent);
m_object->dump(indent + 1);
m_property->dump(indent + 1);
}
void BlockStatement::dump(size_t indent) const
{
ASTNode::dump(indent);
for (auto& statement : m_statements) {
statement.dump(indent + 1);
}
}
void ForStatement::dump(size_t indent) const
{
ASTNode::dump(indent);
if (m_init)
m_init->dump(indent + 1);
if (m_test)
m_test->dump(indent + 1);
if (m_update)
m_update->dump(indent + 1);
if (m_body)
m_body->dump(indent + 1);
}
NonnullRefPtrVector<Declaration> Statement::declarations() const
{
if (is_declaration()) {
NonnullRefPtrVector<Declaration> vec;
const auto& decl = static_cast<const Declaration&>(*this);
vec.empend(const_cast<Declaration&>(decl));
return vec;
}
return {};
}
NonnullRefPtrVector<Declaration> ForStatement::declarations() const
{
auto declarations = m_init->declarations();
declarations.append(m_body->declarations());
return declarations;
}
NonnullRefPtrVector<Declaration> BlockStatement::declarations() const
{
NonnullRefPtrVector<Declaration> declarations;
for (auto& statement : m_statements) {
declarations.append(statement.declarations());
}
return declarations;
}
LibCpp: Parse If statements
2021-01-29 12:03:02 +02:00
void IfStatement::dump(size_t indent) const
{
ASTNode::dump(indent);
if (m_predicate) {
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("Predicate:");
LibCpp: Parse If statements
2021-01-29 12:03:02 +02:00
m_predicate->dump(indent + 1);
}
if (m_then) {
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("Then:");
LibCpp: Parse If statements
2021-01-29 12:03:02 +02:00
m_then->dump(indent + 1);
}
if (m_else) {
print_indent(indent + 1);
LibCpp: Replace dbgprintf() with outln()
2021-02-20 17:12:25 +01:00
outln("Else:");
LibCpp: Parse If statements
2021-01-29 12:03:02 +02:00
m_else->dump(indent + 1);
}
}
NonnullRefPtrVector<Declaration> IfStatement::declarations() const
{
NonnullRefPtrVector<Declaration> declarations;
declarations.append(m_predicate->declarations());
declarations.append(m_then->declarations());
declarations.append(m_else->declarations());
return declarations;
}
LibCpp: Parse Namespace declaration Also, remove unused State::Context
2021-03-19 21:47:43 +02:00
void NamespaceDeclaration::dump(size_t indent) const
{
ASTNode::dump(indent);
print_indent(indent + 1);
outln("{}", m_name);
for (auto& decl : m_declarations)
decl.dump(indent + 1);
}
LibCpp: Add the beginning of a C++ parser This parser will be used by the C++ langauge server to provide better auto-complete (& maybe also other things in the future). It is designed to be error tolerant, and keeps track of the position spans of the AST nodes, which should be useful later for incremental parsing.
2021-01-23 16:47:20 +02:00
}
Reference in a new issue Copy permalink