fish-shell/src/ast.h
Johannes Altmanninger 971d257e67 Port AST to Rust
The translation is fairly direct though it adds some duplication, for example
there are multiple "match" statements that mimic function overloading.

Rust has no overloading, and we cannot have generic methods in the Node trait
(due to a Rust limitation, the error is like "cannot be made into an object")
so we include the type name in method names.

Give clients like "indent_visitor_t" a Rust companion ("IndentVisitor")
that takes care of the AST traversal while the AST consumption remains
in C++ for now.  In future, "IndentVisitor" should absorb the entirety of
"indent_visitor_t".  This pattern requires that "fish_indent" be exposed
includable header to the CXX bridge.

Alternatively, we could define FFI wrappers for recursive AST traversal.

Rust requires we separate the AST visitors for "mut" and "const"
scenarios. Take this opportunity to concretize both visitors:

The only client that requires mutable access is the populator.  To match the
structure of the C++ populator which makes heavy use of function overloading,
we need to add a bunch of functions to the trait. Since there is no other
mutable visit, this seems acceptable.

The "const" visitors never use "will_visit_fields_of()" or
"did_visit_fields_of()", so remove them (though this is debatable).

Like in the C++ implementation, the AST nodes themselves are largely defined
via macros.  Union fields like "Statement" and "ArgumentOrRedirection"
do currently not use macros but may in future.

This commit also introduces a precedent for a type that is defined in one
CXX bridge and used in another one - "ParseErrorList".  To make this work
we need to manually define "ExternType".

There is one annoyance with CXX: functions that take explicit lifetime
parameters require to be marked as unsafe. This makes little sense
because functions that return `&Foo` with implicit lifetime can be
misused the same way on the C++ side.

One notable change is that we cannot directly port "find_block_open_keyword()"
(which is used to compute an error) because it relies on the stack of visited
nodes. We cannot modify a stack of node references while we do the "mut"
walk. Happily, an idiomatic solution is easy: we can tell the AST visitor
to backtrack to the parent node and create the error there.

Since "node_t::accept_base" is no longer a template we don't need the
"node_visitation_t" trampoline anymore.

The added copying at the FFI boundary makes things slower (memcpy dominates
the profile) but it's not unusable, which is good news:

    $ hyperfine ./fish.{old,new}" -c 'source ../share/completions/git.fish'"
    Benchmark 1: ./fish.old -c 'source ../share/completions/git.fish'
      Time (mean ± σ):     195.5 ms ±   2.9 ms    [User: 190.1 ms, System: 4.4 ms]
      Range (min … max):   193.2 ms … 205.1 ms    15 runs

    Benchmark 2: ./fish.new -c 'source ../share/completions/git.fish'
      Time (mean ± σ):     677.5 ms ±  62.0 ms    [User: 665.4 ms, System: 10.0 ms]
      Range (min … max):   611.7 ms … 805.5 ms    10 runs

    Summary
      './fish.old -c 'source ../share/completions/git.fish'' ran
        3.47 ± 0.32 times faster than './fish.new -c 'source ../share/completions/git.fish''

Leftovers:
- Enum variants are still snakecase; I didn't get around to changing this yet.
- "ast_type_to_string()" still returns a snakecase name. This could be
  changed since  it's not user visible.
2023-04-16 17:46:56 +02:00

93 lines
2.5 KiB
C++

// Programmatic representation of fish grammar.
#ifndef FISH_AST_H
#define FISH_AST_H
#include <cstddef>
#include <cstdint>
#include <initializer_list>
#include <iterator>
#include <memory>
#include <type_traits>
#include <utility>
#include <vector>
#include "common.h"
#include "cxx.h"
#include "maybe.h"
#include "parse_constants.h"
#if INCLUDE_RUST_HEADERS
#include "ast.rs.h"
namespace ast {
using ast_t = Ast;
using category_t = Category;
using type_t = Type;
using andor_job_list_t = AndorJobList;
using andor_job_t = AndorJob;
using argument_list_t = ArgumentList;
using argument_or_redirection_list_t = ArgumentOrRedirectionList;
using argument_or_redirection_t = ArgumentOrRedirection;
using argument_t = Argument;
using begin_header_t = BeginHeader;
using block_statement_t = BlockStatement;
using case_item_t = CaseItem;
using decorated_statement_t = DecoratedStatement;
using elseif_clause_list_t = ElseifClauseList;
using for_header_t = ForHeader;
using freestanding_argument_list_t = FreestandingArgumentList;
using function_header_t = FunctionHeader;
using if_clause_t = IfClause;
using if_statement_t = IfStatement;
using job_conjunction_continuation_t = JobConjunctionContinuation;
using job_conjunction_t = JobConjunction;
using job_continuation_t = JobContinuation;
using job_list_t = JobList;
using job_pipeline_t = JobPipeline;
using maybe_newlines_t = MaybeNewlines;
using not_statement_t = NotStatement;
using redirection_t = Redirection;
using semi_nl_t = SemiNl;
using statement_t = Statement;
using string_t = String_;
using switch_statement_t = SwitchStatement;
using variable_assignment_list_t = VariableAssignmentList;
using variable_assignment_t = VariableAssignment;
using while_header_t = WhileHeader;
} // namespace ast
#else
struct Ast;
struct NodeFfi;
namespace ast {
using ast_t = Ast;
struct argument_t;
struct block_statement_t;
struct statement_t;
struct string_t;
struct maybe_newlines_t;
struct redirection_t;
struct variable_assignment_t;
struct semi_nl_t;
struct decorated_statement_t;
struct keyword_base_t;
} // namespace ast
#endif
namespace ast {
using node_t = ::NodeFfi;
}
rust::Box<Ast> ast_parse(const wcstring &src, parse_tree_flags_t flags = parse_flag_none,
parse_error_list_t *out_errors = nullptr);
rust::Box<Ast> ast_parse_argument_list(const wcstring &src,
parse_tree_flags_t flags = parse_flag_none,
parse_error_list_t *out_errors = nullptr);
#endif // FISH_AST_H