Files
@ 7f9b23076d66
Branch filter:
Location: CSY/reowolf/src/protocol/parser/visitor.rs
7f9b23076d66
10.7 KiB
application/rls-services+xml
Add some tests for tuple member access
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 | use crate::protocol::ast::*;
use crate::protocol::input_source::ParseError;
use crate::protocol::parser::{type_table::*, Module};
use crate::protocol::symbol_table::{SymbolTable};
type Unit = ();
pub(crate) type VisitorResult = Result<Unit, ParseError>;
/// Globally configured vector capacity for statement buffers in visitor
/// implementations
pub(crate) const STMT_BUFFER_INIT_CAPACITY: usize = 256;
/// Globally configured vector capacity for expression buffers in visitor
/// implementations
pub(crate) const EXPR_BUFFER_INIT_CAPACITY: usize = 256;
/// General context structure that is used while traversing the AST.
pub(crate) struct Ctx<'p> {
pub heap: &'p mut Heap,
pub modules: &'p mut [Module],
pub module_idx: usize, // currently considered module
pub symbols: &'p mut SymbolTable,
pub types: &'p mut TypeTable,
pub arch: &'p crate::protocol::TargetArch,
}
impl<'p> Ctx<'p> {
/// Returns module `modules[module_idx]`
pub(crate) fn module(&self) -> &Module {
&self.modules[self.module_idx]
}
pub(crate) fn module_mut(&mut self) -> &mut Module {
&mut self.modules[self.module_idx]
}
}
/// Visitor is a generic trait that will fully walk the AST. The default
/// implementation of the visitors is to not recurse. The exception is the
/// top-level `visit_definition`, `visit_stmt` and `visit_expr` methods, which
/// call the appropriate visitor function.
pub(crate) trait Visitor {
// Entry point
fn visit_module(&mut self, ctx: &mut Ctx) -> VisitorResult {
let mut def_index = 0;
let module_root_id = ctx.modules[ctx.module_idx].root_id;
loop {
let definition_id = {
let root = &ctx.heap[module_root_id];
if def_index >= root.definitions.len() {
return Ok(())
}
root.definitions[def_index]
};
self.visit_definition(ctx, definition_id)?;
def_index += 1;
}
}
// Definitions
// --- enum matching
fn visit_definition(&mut self, ctx: &mut Ctx, id: DefinitionId) -> VisitorResult {
match &ctx.heap[id] {
Definition::Enum(def) => {
let def = def.this;
self.visit_enum_definition(ctx, def)
},
Definition::Union(def) => {
let def = def.this;
self.visit_union_definition(ctx, def)
}
Definition::Struct(def) => {
let def = def.this;
self.visit_struct_definition(ctx, def)
},
Definition::Component(def) => {
let def = def.this;
self.visit_component_definition(ctx, def)
},
Definition::Function(def) => {
let def = def.this;
self.visit_function_definition(ctx, def)
}
}
}
// --- enum variant handling
fn visit_enum_definition(&mut self, _ctx: &mut Ctx, _id: EnumDefinitionId) -> VisitorResult { Ok(()) }
fn visit_union_definition(&mut self, _ctx: &mut Ctx, _id: UnionDefinitionId) -> VisitorResult{ Ok(()) }
fn visit_struct_definition(&mut self, _ctx: &mut Ctx, _id: StructDefinitionId) -> VisitorResult { Ok(()) }
fn visit_component_definition(&mut self, _ctx: &mut Ctx, _id: ComponentDefinitionId) -> VisitorResult { Ok(()) }
fn visit_function_definition(&mut self, _ctx: &mut Ctx, _id: FunctionDefinitionId) -> VisitorResult { Ok(()) }
// Statements
// --- enum matching
fn visit_stmt(&mut self, ctx: &mut Ctx, id: StatementId) -> VisitorResult {
match &ctx.heap[id] {
Statement::Block(stmt) => {
let this = stmt.this;
self.visit_block_stmt(ctx, this)
},
Statement::EndBlock(_stmt) => Ok(()),
Statement::Local(stmt) => {
let this = stmt.this();
self.visit_local_stmt(ctx, this)
},
Statement::Labeled(stmt) => {
let this = stmt.this;
self.visit_labeled_stmt(ctx, this)
},
Statement::If(stmt) => {
let this = stmt.this;
self.visit_if_stmt(ctx, this)
},
Statement::EndIf(_stmt) => Ok(()),
Statement::While(stmt) => {
let this = stmt.this;
self.visit_while_stmt(ctx, this)
},
Statement::EndWhile(_stmt) => Ok(()),
Statement::Break(stmt) => {
let this = stmt.this;
self.visit_break_stmt(ctx, this)
},
Statement::Continue(stmt) => {
let this = stmt.this;
self.visit_continue_stmt(ctx, this)
},
Statement::Synchronous(stmt) => {
let this = stmt.this;
self.visit_synchronous_stmt(ctx, this)
},
Statement::EndSynchronous(_stmt) => Ok(()),
Statement::Fork(stmt) => {
let this = stmt.this;
self.visit_fork_stmt(ctx, this)
},
Statement::EndFork(_stmt) => Ok(()),
Statement::Return(stmt) => {
let this = stmt.this;
self.visit_return_stmt(ctx, this)
},
Statement::Goto(stmt) => {
let this = stmt.this;
self.visit_goto_stmt(ctx, this)
},
Statement::New(stmt) => {
let this = stmt.this;
self.visit_new_stmt(ctx, this)
},
Statement::Expression(stmt) => {
let this = stmt.this;
self.visit_expr_stmt(ctx, this)
}
}
}
fn visit_local_stmt(&mut self, ctx: &mut Ctx, id: LocalStatementId) -> VisitorResult {
match &ctx.heap[id] {
LocalStatement::Channel(stmt) => {
let this = stmt.this;
self.visit_local_channel_stmt(ctx, this)
},
LocalStatement::Memory(stmt) => {
let this = stmt.this;
self.visit_local_memory_stmt(ctx, this)
},
}
}
// --- enum variant handling
fn visit_block_stmt(&mut self, _ctx: &mut Ctx, _id: BlockStatementId) -> VisitorResult { Ok(()) }
fn visit_local_memory_stmt(&mut self, _ctx: &mut Ctx, _id: MemoryStatementId) -> VisitorResult { Ok(()) }
fn visit_local_channel_stmt(&mut self, _ctx: &mut Ctx, _id: ChannelStatementId) -> VisitorResult { Ok(()) }
fn visit_labeled_stmt(&mut self, _ctx: &mut Ctx, _id: LabeledStatementId) -> VisitorResult { Ok(()) }
fn visit_if_stmt(&mut self, _ctx: &mut Ctx, _id: IfStatementId) -> VisitorResult { Ok(()) }
fn visit_while_stmt(&mut self, _ctx: &mut Ctx, _id: WhileStatementId) -> VisitorResult { Ok(()) }
fn visit_break_stmt(&mut self, _ctx: &mut Ctx, _id: BreakStatementId) -> VisitorResult { Ok(()) }
fn visit_continue_stmt(&mut self, _ctx: &mut Ctx, _id: ContinueStatementId) -> VisitorResult { Ok(()) }
fn visit_synchronous_stmt(&mut self, _ctx: &mut Ctx, _id: SynchronousStatementId) -> VisitorResult { Ok(()) }
fn visit_fork_stmt(&mut self, _ctx: &mut Ctx, _id: ForkStatementId) -> VisitorResult { Ok(()) }
fn visit_return_stmt(&mut self, _ctx: &mut Ctx, _id: ReturnStatementId) -> VisitorResult { Ok(()) }
fn visit_goto_stmt(&mut self, _ctx: &mut Ctx, _id: GotoStatementId) -> VisitorResult { Ok(()) }
fn visit_new_stmt(&mut self, _ctx: &mut Ctx, _id: NewStatementId) -> VisitorResult { Ok(()) }
fn visit_expr_stmt(&mut self, _ctx: &mut Ctx, _id: ExpressionStatementId) -> VisitorResult { Ok(()) }
// Expressions
// --- enum matching
fn visit_expr(&mut self, ctx: &mut Ctx, id: ExpressionId) -> VisitorResult {
match &ctx.heap[id] {
Expression::Assignment(expr) => {
let this = expr.this;
self.visit_assignment_expr(ctx, this)
},
Expression::Binding(expr) => {
let this = expr.this;
self.visit_binding_expr(ctx, this)
}
Expression::Conditional(expr) => {
let this = expr.this;
self.visit_conditional_expr(ctx, this)
}
Expression::Binary(expr) => {
let this = expr.this;
self.visit_binary_expr(ctx, this)
}
Expression::Unary(expr) => {
let this = expr.this;
self.visit_unary_expr(ctx, this)
}
Expression::Indexing(expr) => {
let this = expr.this;
self.visit_indexing_expr(ctx, this)
}
Expression::Slicing(expr) => {
let this = expr.this;
self.visit_slicing_expr(ctx, this)
}
Expression::Select(expr) => {
let this = expr.this;
self.visit_select_expr(ctx, this)
}
Expression::Literal(expr) => {
let this = expr.this;
self.visit_literal_expr(ctx, this)
}
Expression::Cast(expr) => {
let this = expr.this;
self.visit_cast_expr(ctx, this)
}
Expression::Call(expr) => {
let this = expr.this;
self.visit_call_expr(ctx, this)
}
Expression::Variable(expr) => {
let this = expr.this;
self.visit_variable_expr(ctx, this)
}
}
}
fn visit_assignment_expr(&mut self, _ctx: &mut Ctx, _id: AssignmentExpressionId) -> VisitorResult { Ok(()) }
fn visit_binding_expr(&mut self, _ctx: &mut Ctx, _id: BindingExpressionId) -> VisitorResult { Ok(()) }
fn visit_conditional_expr(&mut self, _ctx: &mut Ctx, _id: ConditionalExpressionId) -> VisitorResult { Ok(()) }
fn visit_binary_expr(&mut self, _ctx: &mut Ctx, _id: BinaryExpressionId) -> VisitorResult { Ok(()) }
fn visit_unary_expr(&mut self, _ctx: &mut Ctx, _id: UnaryExpressionId) -> VisitorResult { Ok(()) }
fn visit_indexing_expr(&mut self, _ctx: &mut Ctx, _id: IndexingExpressionId) -> VisitorResult { Ok(()) }
fn visit_slicing_expr(&mut self, _ctx: &mut Ctx, _id: SlicingExpressionId) -> VisitorResult { Ok(()) }
fn visit_select_expr(&mut self, _ctx: &mut Ctx, _id: SelectExpressionId) -> VisitorResult { Ok(()) }
fn visit_literal_expr(&mut self, _ctx: &mut Ctx, _id: LiteralExpressionId) -> VisitorResult { Ok(()) }
fn visit_cast_expr(&mut self, _ctx: &mut Ctx, _id: CastExpressionId) -> VisitorResult { Ok(()) }
fn visit_call_expr(&mut self, _ctx: &mut Ctx, _id: CallExpressionId) -> VisitorResult { Ok(()) }
fn visit_variable_expr(&mut self, _ctx: &mut Ctx, _id: VariableExpressionId) -> VisitorResult { Ok(()) }
}
|