CSY/reowolf Changeset - b69f417a9972 · Centrum Wiskunde & Informatica (CWI)

Changeset - b69f417a9972

Parent rev.

Child rev.

[Not reviewed]

0 20 1

MH - 4 years ago 2021-05-17 18:18:16
contact@maxhenger.nl

implement EvalError, slicing expression

21 files changed with 538 insertions and 148 deletions:

src/collections/string_pool.rs

src/ffi/mod.rs

src/protocol/eval/error.rs

111

src/protocol/eval/executor.rs

src/protocol/eval/mod.rs

src/protocol/eval/value.rs

src/protocol/input_source.rs

src/protocol/mod.rs

src/protocol/parser/pass_definitions.rs

src/protocol/parser/pass_typing.rs

src/protocol/parser/type_table.rs

src/protocol/tests/eval_calls.rs

src/protocol/tests/eval_operators.rs

src/protocol/tests/eval_silly.rs

src/protocol/tests/parser_imports.rs

src/protocol/tests/parser_inference.rs

src/protocol/tests/parser_validation.rs

src/protocol/tests/utils.rs

src/runtime/error.rs

src/runtime/mod.rs

src/runtime/tests.rs

0 comments (0 inline, 0 general)

src/collections/string_pool.rs

➞

Show inline comments

@@ @@ -149,12 +149,19 @@ impl Drop for StringPool { @@
                 Box::from_raw(cur_slab); // consume and deallocate
+            }
+        }
+    }
+}
 // String pool cannot be cloned, and the created `StringRef` instances remain
 // allocated until the end of the program, so it is always safe to send. It is
 // also sync in the sense that it becomes an immutable thing after compilation,
 // but lets not derive that if we would ever become a multithreaded compiler in
 // the future.
 unsafe impl Send for StringPool {}
 #[cfg(test)]
 mod tests {
     use super::*;
     #[test]
     fn test_string_just_fits() {

src/ffi/mod.rs

➞

Show inline comments

@@ @@ -229,19 +229,22 @@ pub unsafe extern "C" fn connector_add_port_pair( @@
 /// - a set of ports (represented as a slice; duplicates are ignored) in the native component's interface,
 /// the connector creates a new (internal) protocol component C, such that the set of native ports are moved to C.
 /// Usable in {setup, communication} states.
 #[no_mangle]
 pub unsafe extern "C" fn connector_add_component(
     connector: &mut Connector,
     module_ptr: *const u8,
     module_len: usize,
     ident_ptr: *const u8,
     ident_len: usize,
     ports_ptr: *const PortId,
     ports_len: usize,
 ) -> c_int {
     StoredError::tl_clear();
     match connector.add_component(
         &*slice_from_raw_parts(module_ptr, module_len),
         &*slice_from_raw_parts(ident_ptr, ident_len),
         &*slice_from_raw_parts(ports_ptr, ports_len),
     ) {
         Ok(()) => RW_OK,
         Err(err) => {
             StoredError::tl_debug_store(&err);

src/protocol/eval/error.rs

➞

Show inline comments

@@ new file 100644 @@
 use std::fmt;
 use crate::protocol::{
     ast::*,
     Module,
     input_source::{ErrorStatement, StatementKind}
 };
 use super::executor::*;
 /// Represents a stack frame recorded in an error
 #[derive(Debug)]
 pub struct EvalFrame {
     pub line: u32,
     pub module_name: String,
     pub procedure: String, // function or component
     pub is_func: bool,
+}
 impl fmt::Display for EvalFrame {
     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
         let func_or_comp = if self.is_func {
             "function "
         } else {
             "component"
         };
         if self.module_name.is_empty() {
             write!(f, "{} {}:{}", func_or_comp, &self.procedure, self.line)
         } else {
             write!(f, "{} {}:{}:{}", func_or_comp, &self.module_name, &self.procedure, self.line)
+        }
+    }
+}
 /// Represents an error that ocurred during evaluation. Contains error
 /// statements just like in parsing errors. Additionally may display the current
 /// execution state.
 #[derive(Debug)]
 pub struct EvalError {
     pub(crate) statements: Vec<ErrorStatement>,
     pub(crate) frames: Vec<EvalFrame>,
+}
 impl EvalError {
     pub(crate) fn new_error_at_expr(prompt: &Prompt, modules: &[Module], heap: &Heap, expr_id: ExpressionId, msg: String) -> EvalError {
         // Create frames
         debug_assert!(!prompt.frames.is_empty());
         let mut frames = Vec::with_capacity(prompt.frames.len());
         let mut last_module_source = &modules[0].source;
         for frame in prompt.frames.iter() {
             let definition = &heap[frame.definition];
             let statement = &heap[frame.position];
             let statement_span = statement.span();
             let (root_id, procedure, is_func) = match definition {
                 Definition::Function(def) => {
                     (def.defined_in, def.identifier.value.as_str().to_string(), true)
                 },
                 Definition::Component(def) => {
                     (def.defined_in, def.identifier.value.as_str().to_string(), false)
                 },
                 _ => unreachable!("construct stack frame with definition pointing to data type")
             };
             // Lookup module name, if it has one
             let module = modules.iter().find(|m| m.root_id == root_id).unwrap();
             let module_name = if let Some(name) = &module.name {
                 name.as_str().to_string()
             } else {
                 String::new()
             };
             last_module_source = &module.source;
             frames.push(EvalFrame{
                 line: statement_span.begin.line,
                 module_name,
                 procedure,
                 is_func
             });
+        }
         let expr = &heap[expr_id];
         let statements = vec![
             ErrorStatement::from_source_at_span(StatementKind::Error, last_module_source, expr.span(), msg)
         ];
         EvalError{ statements, frames }
+    }
+}
 impl fmt::Display for EvalError {
     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
         // Display error statement(s)
         self.statements[0].fmt(f)?;
         for statement in self.statements.iter().skip(1) {
             writeln!(f)?;
             statement.fmt(f)?;
+        }
         // Display stack trace
         writeln!(f)?;
         writeln!(f, " +-  Stack trace:")?;
         for frame in self.frames.iter().rev() {
             write!(f, " | ")?;
             frame.fmt(f)?;
             writeln!(f)?;
+        }
         Ok(())
+    }
+}
@@ \ No newline at end of file @@

src/protocol/eval/executor.rs

➞

Show inline comments

 use std::collections::VecDeque;
 use super::value::*;
 use super::store::*;
 use super::error::*;
 use crate::protocol::*;
 use crate::protocol::ast::*;
 macro_rules! debug_enabled { () => { true }; }
 macro_rules! debug_log {
     ($format:literal) => {
@@ @@ -21,16 +22,16 @@ pub(crate) enum ExprInstruction { @@
     EvalExpr(ExpressionId),
     PushValToFront,
+}
 #[derive(Debug, Clone)]
 pub(crate) struct Frame {
     definition: DefinitionId,
     position: StatementId,
     expr_stack: VecDeque<ExprInstruction>, // hack for expression evaluation, evaluated by popping from back
     expr_values: VecDeque<Value>, // hack for expression results, evaluated by popping from front/back
     pub(crate) definition: DefinitionId,
     pub(crate) position: StatementId,
     pub(crate) expr_stack: VecDeque<ExprInstruction>, // hack for expression evaluation, evaluated by popping from back
     pub(crate) expr_values: VecDeque<Value>, // hack for expression results, evaluated by popping from front/back
+}
 impl Frame {
     /// Creates a new execution frame. Does not modify the stack in any way.
     pub fn new(heap: &Heap, definition_id: DefinitionId) -> Self {
         let definition = &heap[definition_id];
@@ @@ -147,13 +148,14 @@ impl Frame { @@
                 // No subexpressions
+            }
+        }
+    }
+}
 type EvalResult = Result<EvalContinuation, ()>;
 type EvalResult = Result<EvalContinuation, EvalError>;
 pub enum EvalContinuation {
     Stepping,
     Inconsistent,
     Terminal,
     SyncBlockStart,
     SyncBlockEnd,
@@ @@ -181,13 +183,13 @@ impl Prompt { @@
         prompt.frames.push(Frame::new(heap, def));
         args.into_store(&mut prompt.store);
         prompt
+    }
     pub(crate) fn step(&mut self, heap: &Heap, ctx: &mut EvalContext) -> EvalResult {
+    pub(crate) fn step(&mut self, heap: &Heap, modules: &[Module], ctx: &mut EvalContext) -> EvalResult {
         // Helper function to transfer multiple values from the expression value
         // array into a heap region (e.g. constructing arrays or structs).
         fn transfer_expression_values_front_into_heap(cur_frame: &mut Frame, store: &mut Store, num_values: usize) -> HeapPos {
             let heap_pos = store.alloc_heap();
             // Do the transformation first (because Rust...)
@@ @@ -203,12 +205,31 @@ impl Prompt { @@
                 values.push(cur_frame.expr_values.pop_front().unwrap());
+            }
             heap_pos
+        }
         // Helper function to make sure that an index into an aray is valid.
         fn array_inclusive_index_is_invalid(store: &Store, array_heap_pos: u32, idx: i64) -> bool {
             let array_len = store.heap_regions[array_heap_pos as usize].values.len();
             return idx < 0 || idx >= array_len as i64;
+        }
         fn array_exclusive_index_is_invalid(store: &Store, array_heap_pos: u32, idx: i64) -> bool {
             let array_len = store.heap_regions[array_heap_pos as usize].values.len();
             return idx < 0 || idx > array_len as i64;
+        }
         fn construct_array_error(prompt: &Prompt, modules: &[Module], heap: &Heap, expr_id: ExpressionId, heap_pos: u32, idx: i64) -> EvalError {
             let array_len = prompt.store.heap_regions[heap_pos as usize].values.len();
             return EvalError::new_error_at_expr(
                 prompt, modules, heap, expr_id,
                 format!("index {} is out of bounds: array length is {}", idx, array_len)
+            )
+        }
         // Checking if we're at the end of execution
         let cur_frame = self.frames.last_mut().unwrap();
         if cur_frame.position.is_invalid() {
             if heap[cur_frame.definition].is_function() {
                 todo!("End of function without return, return an evaluation error");
+            }
@@ @@ -263,52 +284,111 @@ impl Prompt { @@
                             let val = cur_frame.expr_values.pop_back().unwrap();
                             let result = apply_unary_operator(&mut self.store, expr.operation, &val);
                             cur_frame.expr_values.push_back(result);
                             self.store.drop_value(val.get_heap_pos());
                         },
                         Expression::Indexing(expr) => {
                             // TODO: Out of bounds checking
                             // Evaluate index. Never heap allocated so we do
                             // not have to drop it.
                             let index = cur_frame.expr_values.pop_back().unwrap();
                             let index = self.store.maybe_read_ref(&index);
                             debug_assert!(index.is_integer());
                             let index = if index.is_signed_integer() {
-                                index.as_signed_integer() as u32
+                                index.as_signed_integer() as i64
                             } else {
-                                index.as_unsigned_integer() as u32
+                                index.as_unsigned_integer() as i64
                             };
                             let subject = cur_frame.expr_values.pop_back().unwrap();
                             let (deallocate_heap_pos, value_to_push) = match subject {
+                            let (deallocate_heap_pos, value_to_push, subject_heap_pos) = match subject {
                                 Value::Ref(value_ref) => {
                                     // Our expression stack value is a reference to something that
                                     // exists in the normal stack/heap. We don't want to deallocate
                                     // this thing. Rather we want to return a reference to it.
                                     let subject = self.store.read_ref(value_ref);
                                     let subject_heap_pos = subject.as_array();
                                     (None, Value::Ref(ValueId::Heap(subject_heap_pos, index)))
                                     if array_inclusive_index_is_invalid(&self.store, subject_heap_pos, index) {
                                         return Err(construct_array_error(self, modules, heap, expr_id, subject_heap_pos, index));
+                                    }
                                     (None, Value::Ref(ValueId::Heap(subject_heap_pos, index as u32)), subject_heap_pos)
                                 },
                                 _ => {
                                     // Our value lives on the expression stack, hence we need to
                                     // clone whatever we're referring to. Then drop the subject.
                                     let subject_heap_pos = subject.as_array();
                                     let subject_indexed = Value::Ref(ValueId::Heap(subject_heap_pos, index));
                                     (Some(subject_heap_pos), self.store.clone_value(subject_indexed))
                                     if array_inclusive_index_is_invalid(&self.store, subject_heap_pos, index) {
                                         return Err(construct_array_error(self, modules, heap, expr_id, subject_heap_pos, index));
+                                    }
                                     let subject_indexed = Value::Ref(ValueId::Heap(subject_heap_pos, index as u32));
                                     (Some(subject_heap_pos), self.store.clone_value(subject_indexed), subject_heap_pos)
                                 },
                             };
                             cur_frame.expr_values.push_back(value_to_push);
                             self.store.drop_value(deallocate_heap_pos);
                         },
                         Expression::Slicing(expr) => {
                             // TODO: Out of bounds checking
                             todo!("implement slicing")
                             // Evaluate indices
                             let from_index = cur_frame.expr_values.pop_back().unwrap();
                             let from_index = self.store.maybe_read_ref(&from_index);
                             let to_index = cur_frame.expr_values.pop_back().unwrap();
                             let to_index = self.store.maybe_read_ref(&to_index);
                             debug_assert!(from_index.is_integer() && to_index.is_integer());
                             let from_index = if from_index.is_signed_integer() {
                                 from_index.as_signed_integer()
                             } else {
                                 from_index.as_unsigned_integer() as i64
                             };
                             let to_index = if to_index.is_signed_integer() {
                                 to_index.as_signed_integer()
                             } else {
                                 to_index.as_unsigned_integer() as i64
                             };
                             // Dereference subject if needed
                             let subject = cur_frame.expr_values.pop_back().unwrap();
                             let deref_subject = self.store.maybe_read_ref(&subject);
                             // Slicing needs to produce a copy anyway (with the
                             // current evaluator implementation)
                             let array_heap_pos = deref_subject.as_array();
                             if array_inclusive_index_is_invalid(&self.store, array_heap_pos, from_index) {
                                 return Err(construct_array_error(self, modules, heap, expr.from_index, array_heap_pos, from_index));
+                            }
                             if array_exclusive_index_is_invalid(&self.store, array_heap_pos, to_index) {
                                 return Err(construct_array_error(self, modules, heap, expr.to_index, array_heap_pos, to_index));
+                            }
                             // Again: would love to push directly, but rust...
                             let new_heap_pos = self.store.alloc_heap();
                             debug_assert!(self.store.heap_regions[new_heap_pos as usize].values.is_empty());
                             if to_index > from_index {
                                 let from_index = from_index as usize;
                                 let to_index = to_index as usize;
                                 let mut values = Vec::with_capacity(to_index - from_index);
                                 for idx in from_index..to_index {
                                     let value = self.store.heap_regions[array_heap_pos as usize].values[idx].clone();
                                     values.push(self.store.clone_value(value));
+                                }
                                 self.store.heap_regions[new_heap_pos as usize].values = values;
                             } // else: empty range
                             cur_frame.expr_values.push_back(Value::Array(new_heap_pos));
                             // Dropping the original subject, because we don't
                             // want to drop something on the stack
                             self.store.drop_value(subject.get_heap_pos());
                         },
                         Expression::Select(expr) => {
                             let subject= cur_frame.expr_values.pop_back().unwrap();
                             let field_idx = expr.field.as_symbolic().field_idx as u32;
                             // Note: same as above: clone if value lives on expr stack, simply
                             // refer to it if it already lives on the stack/heap.
@@ @@ -356,13 +436,13 @@ impl Prompt { @@
                                         CTP::UInt32 => Value::UInt32(lit_value.unsigned_value as u32),
                                         CTP::UInt64 => Value::UInt64(lit_value.unsigned_value as u64),
                                         CTP::SInt8  => Value::SInt8(lit_value.unsigned_value as i8),
                                         CTP::SInt16 => Value::SInt16(lit_value.unsigned_value as i16),
                                         CTP::SInt32 => Value::SInt32(lit_value.unsigned_value as i32),
                                         CTP::SInt64 => Value::SInt64(lit_value.unsigned_value as i64),
                                         _ => unreachable!(),
+                                        _ => unreachable!("got concrete type {:?} for integer literal at expr {:?}", &expr.concrete_type, expr_id),
+                                    }
+                                }
                                 Literal::Struct(lit_value) => {
                                     let heap_pos = transfer_expression_values_front_into_heap(
                                         cur_frame, &mut self.store, lit_value.fields.len()
                                     );
@@ @@ -616,13 +696,13 @@ impl Prompt { @@
             },
         };
         assert!(
             cur_frame.expr_values.is_empty(),
             "This is a debugging assertion that will fail if you perform expressions without \
-            assigning to anything. This should be completely valid, and this assertions should be \
+            assigning to anything. This should be completely valid, and this assertion should be \
             replaced by something that clears the expression values if needed, but I'll keep this \
             in for now for debugging purposes."
         );
         // If the next statement requires evaluating expressions then we push
         // these onto the expression stack. This way we will evaluate this

src/protocol/eval/mod.rs

➞

Show inline comments

@@ @@ -20,11 +20,13 @@ @@
 /// implementation would fully fill out the type table with alignment/size/
 /// offset information and lay out bytecode.
 pub(crate) mod value;
 pub(crate) mod store;
 pub(crate) mod executor;
 pub(crate) mod error;
 pub use error::EvalError;
 pub use value::{Value, ValueGroup};
 pub(crate) use store::{Store};
 pub use executor::{EvalContinuation, Prompt};

src/protocol/eval/value.rs

➞

Show inline comments

         Value::UInt32(v) => *v == rhs.as_uint32(),
         Value::UInt64(v) => *v == rhs.as_uint64(),
         Value::SInt8(v) => *v == rhs.as_sint8(),
         Value::SInt16(v) => *v == rhs.as_sint16(),
         Value::SInt32(v) => *v == rhs.as_sint32(),
         Value::SInt64(v) => *v == rhs.as_sint64(),
         Value::Array(lhs_pos) => eval_equality_heap(store, *lhs_pos, rhs.as_array()),
         Value::Enum(v) => *v == rhs.as_enum(),
         Value::Union(lhs_tag, lhs_pos) => {
             let (rhs_tag, rhs_pos) = rhs.as_union();
             if *lhs_tag != rhs_tag {
                 return false;
+            }

src/protocol/input_source.rs

➞

Show inline comments

@@ @@ -210,25 +210,25 @@ pub enum StatementKind { @@
 pub enum ContextKind {
     SingleLine,
     MultiLine,
+}
 #[derive(Debug)]
-pub struct ParseErrorStatement {
+pub struct ErrorStatement {
     pub(crate) statement_kind: StatementKind,
     pub(crate) context_kind: ContextKind,
     pub(crate) start_line: u32,
     pub(crate) start_column: u32,
     pub(crate) end_line: u32,
     pub(crate) end_column: u32,
     pub(crate) filename: String,
     pub(crate) context: String,
     pub(crate) message: String,
+}
-impl ParseErrorStatement {
+impl ErrorStatement {
     fn from_source_at_pos(statement_kind: StatementKind, source: &InputSource, position: InputPosition, message: String) -> Self {
         // Seek line start and end
         let line_start = source.lookup_line_start_offset(position.line);
         let line_end = source.lookup_line_end_offset(position.line);
         let context = Self::create_context(source, line_start as usize, line_end as usize);
         debug_assert!(position.offset >= line_start);
@@ @@ -244,13 +244,13 @@ impl ParseErrorStatement { @@
             filename: source.filename.clone(),
             context,
             message,
+        }
+    }
     fn from_source_at_span(statement_kind: StatementKind, source: &InputSource, span: InputSpan, message: String) -> Self {
+    pub(crate) fn from_source_at_span(statement_kind: StatementKind, source: &InputSource, span: InputSpan, message: String) -> Self {
         debug_assert!(span.end.line >= span.begin.line);
         debug_assert!(span.end.offset >= span.begin.offset);
         let first_line_start = source.lookup_line_start_offset(span.begin.line);
         let last_line_start = source.lookup_line_start_offset(span.end.line);
         let last_line_end = source.lookup_line_end_offset(span.end.line);
@@ @@ -282,13 +282,13 @@ impl ParseErrorStatement { @@
     fn create_context(source: &InputSource, start: usize, end: usize) -> String {
         let context_raw = &source.input[start..end];
         String::from_utf8_lossy(context_raw).to_string()
+    }
+}
-impl fmt::Display for ParseErrorStatement {
+impl fmt::Display for ErrorStatement {
     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
         // Write kind of statement and message
         match self.statement_kind {
             StatementKind::Info => f.write_str(" INFO: ")?,
             StatementKind::Error => f.write_str("ERROR: ")?,
+        }
@@ @@ -399,13 +399,13 @@ impl fmt::Display for ParseErrorStatement { @@
         Ok(())
+    }
+}
 #[derive(Debug)]
 pub struct ParseError {
-    pub(crate) statements: Vec<ParseErrorStatement>
+    pub(crate) statements: Vec<ErrorStatement>
+}
 impl fmt::Display for ParseError {
     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
         if self.statements.is_empty() {
             return Ok(())
@@ @@ -420,42 +420,42 @@ impl fmt::Display for ParseError { @@
         Ok(())
+    }
+}
 impl ParseError {
     pub fn new_error_at_pos(source: &InputSource, position: InputPosition, message: String) -> Self {
-        Self{ statements: vec!(ParseErrorStatement::from_source_at_pos(
+        Self{ statements: vec!(ErrorStatement::from_source_at_pos(
             StatementKind::Error, source, position, message
         )) }
+    }
     pub fn new_error_str_at_pos(source: &InputSource, position: InputPosition, message: &str) -> Self {
-        Self{ statements: vec!(ParseErrorStatement::from_source_at_pos(
+        Self{ statements: vec!(ErrorStatement::from_source_at_pos(
             StatementKind::Error, source, position, message.to_string()
         )) }
+    }
     pub fn new_error_at_span(source: &InputSource, span: InputSpan, message: String) -> Self {
-        Self{ statements: vec!(ParseErrorStatement::from_source_at_span(
+        Self{ statements: vec!(ErrorStatement::from_source_at_span(
             StatementKind::Error, source, span, message
         )) }
+    }
     pub fn new_error_str_at_span(source: &InputSource, span: InputSpan, message: &str) -> Self {
-        Self{ statements: vec!(ParseErrorStatement::from_source_at_span(
+        Self{ statements: vec!(ErrorStatement::from_source_at_span(
             StatementKind::Error, source, span, message.to_string()
         )) }
+    }
     pub fn with_at_pos(mut self, error_type: StatementKind, source: &InputSource, position: InputPosition, message: String) -> Self {
-        self.statements.push(ParseErrorStatement::from_source_at_pos(error_type, source, position, message));
+        self.statements.push(ErrorStatement::from_source_at_pos(error_type, source, position, message));
         self
+    }
     pub fn with_at_span(mut self, error_type: StatementKind, source: &InputSource, span: InputSpan, message: String) -> Self {
-        self.statements.push(ParseErrorStatement::from_source_at_span(error_type, source, span, message.to_string()));
+        self.statements.push(ErrorStatement::from_source_at_span(error_type, source, span, message.to_string()));
         self
+    }
     pub fn with_info_at_pos(self, source: &InputSource, position: InputPosition, msg: String) -> Self {
         self.with_at_pos(StatementKind::Info, source, position, msg)
+    }

src/protocol/mod.rs

➞

Show inline comments

@@ @@ -4,24 +4,33 @@ pub(crate) mod input_source; @@
 mod parser;
 #[cfg(test)] mod tests;
 pub(crate) mod ast;
 pub(crate) mod ast_printer;
 use std::sync::Mutex;
 use crate::collections::{StringPool, StringRef};
 use crate::common::*;
 use crate::protocol::ast::*;
 use crate::protocol::eval::*;
 use crate::protocol::input_source::*;
 use crate::protocol::parser::*;
 /// A protocol description module
 pub struct Module {
     pub(crate) source: InputSource,
     pub(crate) root_id: RootId,
     pub(crate) name: Option<StringRef<'static>>,
+}
 /// Description of a protocol object, used to configure new connectors.
 #[repr(C)]
 pub struct ProtocolDescription {
     modules: Vec<Module>,
     heap: Heap,
     source: InputSource,
     root: RootId,
     pool: Mutex<StringPool>,
+}
 #[derive(Debug, Clone)]
 pub(crate) struct ComponentState {
     prompt: Prompt,
+}
 pub(crate) enum EvalContext<'a> {
@@ @@ -48,46 +57,65 @@ impl ProtocolDescription { @@
         if let Err(err) = parser.parse() {
             println!("ERROR:\n{}", err);
             return Err(format!("{}", err))
+        }
         debug_assert_eq!(parser.modules.len(), 1, "only supporting one module here for now");
         let module = parser.modules.remove(0);
         let root = module.root_id;
         let source = module.source;
         return Ok(ProtocolDescription { heap: parser.heap, source, root });
         let modules: Vec<Module> = parser.modules.into_iter()
             .map(|module| Module{
                 source: module.source,
                 root_id: module.root_id,
                 name: module.name.map(|(_, name)| name)
             })
             .collect();
         return Ok(ProtocolDescription {
             modules,
             heap: parser.heap,
             pool: Mutex::new(parser.string_pool),
         });
+    }
     pub(crate) fn component_polarities(
         &self,
         module_name: &[u8],
         identifier: &[u8],
     ) -> Result<Vec<Polarity>, AddComponentError> {
         use AddComponentError::*;
         let h = &self.heap;
         let root = &h[self.root];
         let def = root.get_definition_ident(h, identifier);
         let module_root = self.lookup_module_root(module_name);
         if module_root.is_none() {
             return Err(AddComponentError::NoSuchModule);
+        }
         let module_root = module_root.unwrap();
         let root = &self.heap[module_root];
         let def = root.get_definition_ident(&self.heap, identifier);
         if def.is_none() {
             return Err(NoSuchComponent);
+        }
         let def = &h[def.unwrap()];
         let def = &self.heap[def.unwrap()];
         if !def.is_component() {
             return Err(NoSuchComponent);
+        }
         for &param in def.parameters().iter() {
-            let param = &h[param];
+            let param = &self.heap[param];
             let first_element = &param.parser_type.elements[0];
             match first_element.variant {
                 ParserTypeVariant::Input | ParserTypeVariant::Output => continue,
                 _ => {
                     return Err(NonPortTypeParameters);
+                }
+            }
+        }
         let mut result = Vec::new();
         for &param in def.parameters().iter() {
-            let param = &h[param];
+            let param = &self.heap[param];
             let first_element = &param.parser_type.elements[0];
             if first_element.variant == ParserTypeVariant::Input {
                 result.push(Polarity::Getter)
             } else if first_element.variant == ParserTypeVariant::Output {
                 result.push(Polarity::Putter)
@@ @@ -95,37 +123,56 @@ impl ProtocolDescription { @@
                 unreachable!()
+            }
+        }
         Ok(result)
+    }
     // expects port polarities to be correct
     pub(crate) fn new_component(&self, identifier: &[u8], ports: &[PortId]) -> ComponentState {
+    pub(crate) fn new_component(&self, module_name: &[u8], identifier: &[u8], ports: &[PortId]) -> ComponentState {
         let mut args = Vec::new();
         for (&x, y) in ports.iter().zip(self.component_polarities(identifier).unwrap()) {
+        for (&x, y) in ports.iter().zip(self.component_polarities(module_name, identifier).unwrap()) {
             match y {
                 Polarity::Getter => args.push(Value::Input(x)),
                 Polarity::Putter => args.push(Value::Output(x)),
+            }
+        }
         let h = &self.heap;
         let root = &h[self.root];
         let def = root.get_definition_ident(h, identifier).unwrap();
         ComponentState { prompt: Prompt::new(h, def, ValueGroup::new_stack(args)) }
         let module_root = self.lookup_module_root(module_name).unwrap();
         let root = &self.heap[module_root];
         let def = root.get_definition_ident(&self.heap, identifier).unwrap();
         ComponentState { prompt: Prompt::new(&self.heap, def, ValueGroup::new_stack(args)) }
+    }
     fn lookup_module_root(&self, module_name: &[u8]) -> Option<RootId> {
         for module in self.modules.iter() {
             match &module.name {
                 Some(name) => if name.as_bytes() == module_name {
                     return Some(module.root_id);
                 },
                 None => if module_name.is_empty() {
                     return Some(module.root_id);
+                }
+            }
+        }
         return None;
+    }
+}
 impl ComponentState {
     pub(crate) fn nonsync_run<'a: 'b, 'b>(
         &'a mut self,
         context: &'b mut NonsyncProtoContext<'b>,
         pd: &'a ProtocolDescription,
     ) -> NonsyncBlocker {
         let mut context = EvalContext::Nonsync(context);
         loop {
             let result = self.prompt.step(&pd.heap, &mut context);
+            let result = self.prompt.step(&pd.heap, &pd.modules, &mut context);
             match result {
                 Err(_) => todo!("error handling"),
                 Err(err) => {
                     println!("Evaluation error:\n{}", err);
                     panic!("proper error handling when component fails");
                 },
                 Ok(cont) => match cont {
                     EvalContinuation::Stepping => continue,
                     EvalContinuation::Inconsistent => return NonsyncBlocker::Inconsistent,
                     EvalContinuation::Terminal => return NonsyncBlocker::ComponentExit,
                     EvalContinuation::SyncBlockStart => return NonsyncBlocker::SyncBlockStart,
                     // Not possible to end sync block if never entered one
@@ @@ -172,15 +219,18 @@ impl ComponentState { @@
         &'a mut self,
         context: &'b mut SyncProtoContext<'b>,
         pd: &'a ProtocolDescription,
     ) -> SyncBlocker {
         let mut context = EvalContext::Sync(context);
         loop {
             let result = self.prompt.step(&pd.heap, &mut context);
+            let result = self.prompt.step(&pd.heap, &pd.modules, &mut context);
             match result {
                 Err(_) => todo!("error handling"),
                 Err(err) => {
                     println!("Evaluation error:\n{}", err);
                     panic!("proper error handling when component fails");
                 },
                 Ok(cont) => match cont {
                     EvalContinuation::Stepping => continue,
                     EvalContinuation::Inconsistent => return SyncBlocker::Inconsistent,
                     // First need to exit synchronous block before definition may end
                     EvalContinuation::Terminal => unreachable!(),
                     // No nested synchronous blocks

src/protocol/parser/pass_definitions.rs

➞

Show inline comments

@@ @@ -393,24 +393,24 @@ impl PassDefinitions { @@
                 let id = self.consume_if_statement(module, iter, ctx)?;
                 section.push(id.upcast());
                 let end_if = ctx.heap.alloc_end_if_statement(|this| EndIfStatement{
                     this, start_if: id, next: StatementId::new_invalid()
                 });
-                section.push(id.upcast());
+                section.push(end_if.upcast());
                 let if_stmt = &mut ctx.heap[id];
                 if_stmt.end_if = end_if;
             } else if ident == KW_STMT_WHILE {
                 let id = self.consume_while_statement(module, iter, ctx)?;
                 section.push(id.upcast());
                 let end_while = ctx.heap.alloc_end_while_statement(|this| EndWhileStatement{
                     this, start_while: id, next: StatementId::new_invalid()
                 });
-                section.push(id.upcast());
+                section.push(end_while.upcast());
                 let while_stmt = &mut ctx.heap[id];
                 while_stmt.end_while = end_while;
             } else if ident == KW_STMT_BREAK {
                 let id = self.consume_break_statement(module, iter, ctx)?;
                 section.push(id.upcast());
@@ @@ -421,12 +421,13 @@ impl PassDefinitions { @@
                 let id = self.consume_synchronous_statement(module, iter, ctx)?;
                 section.push(id.upcast());
                 let end_sync = ctx.heap.alloc_end_synchronous_statement(|this| EndSynchronousStatement{
                     this, start_sync: id, next: StatementId::new_invalid()
                 });
                 section.push(end_sync.upcast());
                 let sync_stmt = &mut ctx.heap[id];
                 sync_stmt.end_sync = end_sync;
             } else if ident == KW_STMT_RETURN {
                 let id = self.consume_return_statement(module, iter, ctx)?;
                 section.push(id.upcast());

src/protocol/parser/pass_typing.rs

➞

Show inline comments

@@ @@ -42,12 +42,16 @@ @@
 ///  3. Remove the `msg` type?
 ///  4. Disallow certain types in certain operations (e.g. `Void`).
 ///  5. Implement implicit and explicit casting.
 ///  6. Investigate different ways of performing the type-on-type inference,
 ///     maybe there is a better way then flattened trees + markers?
 macro_rules! debug_log_enabled {
     () => { false };
+}
 macro_rules! debug_log {
     ($format:literal) => {
         enabled_debug_print!(false, "types", $format);
     };
     ($format:literal, $($args:expr),*) => {
         enabled_debug_print!(false, "types", $format, $($args),*);
@@ @@ -143,13 +147,12 @@ impl InferenceTypePart { @@
             ITP::ArrayLike | ITP::PortLike => false,
             _ => true
+        }
+    }
     fn is_concrete_number(&self) -> bool {
         // TODO: @float
         use InferenceTypePart as ITP;
         match self {
             ITP::UInt8 | ITP::UInt16 | ITP::UInt32 | ITP::UInt64 |
             ITP::SInt8 | ITP::SInt16 | ITP::SInt32 | ITP::SInt64 => true,
             _ => false,
+        }
@@ @@ -609,13 +612,13 @@ impl InferenceType { @@
         true
+    }
     /// Performs the conversion of the inference type into a concrete type.
     /// By calling this function you must make sure that no unspecified types
     /// (e.g. Unknown or IntegerLike) exist in the type.
     fn write_concrete_type(&self, concrete_type: &mut ConcreteType) {
+    fn write_concrete_type(&self, concrete_type: &mut ConcreteType, discard_marked_types: bool) {
         use InferenceTypePart as ITP;
         use ConcreteTypePart as CTP;
         // Make sure inference type is specified but concrete type is not yet specified
         debug_assert!(!self.parts.is_empty());
         debug_assert!(concrete_type.parts.is_empty());
@@ @@ -623,16 +626,21 @@ impl InferenceType { @@
         let mut idx = 0;
         while idx < self.parts.len() {
             let part = &self.parts[idx];
             let converted_part = match part {
                 ITP::MarkerDefinition(marker) => {
                     // Outer markers are converted to regular markers, we
                     // completely remove the type subtree that follows it
                     idx = InferenceType::find_subtree_end_idx(&self.parts, idx + 1);
                     concrete_type.parts.push(CTP::Marker(*marker));
                     // When annotating the AST we keep the markers. When
                     // determining types for monomorphs we instead want to
                     // keep the type (not the markers)
                     if discard_marked_types {
                         idx = InferenceType::find_subtree_end_idx(&self.parts, idx + 1);
                         concrete_type.parts.push(CTP::Marker(*marker));
                     } else {
                         idx += 1;
+                    }
                     continue;
                 },
                 ITP::MarkerBody(_) => {
                     // Inner markers are removed when writing to the concrete
                     // type.
                     idx += 1;
@@ @@ -872,13 +880,14 @@ pub(crate) struct PassTyping { @@
     extra_data: HashMap<ExpressionId, ExtraData>,       // data for polymorph inference
     // Keeping track of which expressions need to be reinferred because the
     // expressions they're linked to made progression on an associated type
     expr_queued: HashSet<ExpressionId>,
+}
 // TODO: @rename used for calls and struct literals, maybe union literals?
 // TODO: @Rename, this is used for a lot of type inferencing. It seems like
 //  there is a different underlying architecture waiting to surface.
 struct ExtraData {
     /// Progression of polymorphic variables (if any)
     poly_vars: Vec<InferenceType>,
     /// Progression of types of call arguments or struct members
     embedded: Vec<InferenceType>,
     returned: InferenceType,
@@ @@ -1005,12 +1014,23 @@ impl Visitor2 for PassTyping { @@
         let func_def = &ctx.heap[id];
         debug_assert_eq!(func_def.poly_vars.len(), self.poly_vars.len(), "function polyvars do not match imposed polyvars");
         debug_log!("{}", "-".repeat(50));
         debug_log!("Visiting function '{}': {}", func_def.identifier.value.as_str(), id.0.index);
         if debug_log_enabled!() {
             debug_log!("Polymorphic variables:");
             for (idx, poly_var) in self.poly_vars.iter().enumerate() {
                 let mut infer_type_parts = Vec::new();
                 for concrete_part in &poly_var.parts {
                     infer_type_parts.push(InferenceTypePart::from(*concrete_part));
+                }
                 let infer_type = InferenceType::new(false, true, infer_type_parts);
                 debug_log!(" - [{:03}] {:?}", idx, infer_type.display_name(&ctx.heap));
+            }
+        }
         debug_log!("{}", "-".repeat(50));
         for param_id in func_def.parameters.clone() {
             let param = &ctx.heap[param_id];
             let var_type = self.determine_inference_type_from_parser_type_elements(&param.parser_type.elements, true);
             debug_assert!(var_type.is_done, "expected function arguments to be concrete types");
@@ @@ -1379,17 +1399,17 @@ impl PassTyping { @@
                     ));
+                }
+            }
             if !already_checked {
                 let concrete_type = ctx.heap[*expr_id].get_type_mut();
                 expr_type.write_concrete_type(concrete_type);
+                expr_type.write_concrete_type(concrete_type, true);
             } else {
                 if cfg!(debug_assertions) {
                     let mut concrete_type = ConcreteType::default();
                     expr_type.write_concrete_type(&mut concrete_type);
+                    expr_type.write_concrete_type(&mut concrete_type, true);
                     debug_assert_eq!(*ctx.heap[*expr_id].get_type(), concrete_type);
+                }
+            }
+        }
         // All types are fine
@@ @@ -1424,13 +1444,13 @@ impl PassTyping { @@
                                 poly_idx, poly_type.display_name(&ctx.heap)
+                            )
                         ))
+                    }
                     let mut concrete_type = ConcreteType::default();
                     poly_type.write_concrete_type(&mut concrete_type);
+                    poly_type.write_concrete_type(&mut concrete_type, false);
                     monomorph_types.insert(poly_idx, concrete_type);
+                }
                 // Resolve to the appropriate expression and instantiate
                 // monomorphs.
                 match &ctx.heap[*expr_id] {
@@ @@ -1460,13 +1480,13 @@ impl PassTyping { @@
                     },
                     Expression::Literal(lit_expr) => {
                         let definition_id = match &lit_expr.value {
                             Literal::Struct(literal) => &literal.definition,
                             Literal::Enum(literal) => &literal.definition,
                             Literal::Union(literal) => &literal.definition,
                             _ => unreachable!("post-inference monomorph for non-struct, non-enum literal")
+                            _ => unreachable!("post-inference monomorph for non-struct, non-enum, non-union literal")
                         };
                         if !ctx.types.has_monomorph(definition_id, &monomorph_types) {
                             ctx.types.add_monomorph(definition_id, monomorph_types);
+                        }
                     },
                     _ => unreachable!("needs fully inference, but not a struct literal or call expression")
@@ @@ -1782,13 +1802,13 @@ impl PassTyping { @@
         let progress_subject_base = self.apply_forced_constraint(ctx, subject_id, &ARRAYLIKE_TEMPLATE)?;
         let progress_idx_base = self.apply_forced_constraint(ctx, from_id, &INTEGERLIKE_TEMPLATE)?;
         let (progress_from, progress_to) = self.apply_equal2_constraint(ctx, upcast_id, from_id, 0, to_id, 0)?;
         // Make sure if output is of T then subject is Array<T>
         let (progress_expr, progress_subject) =
-            self.apply_equal2_constraint(ctx, upcast_id, upcast_id, 0, subject_id, 1)?;
+            self.apply_equal2_constraint(ctx, upcast_id, upcast_id, 0, subject_id, 0)?;
         debug_log!(" * After:");
         debug_log!("   - Subject type [{}]: {}", progress_subject_base || progress_subject, self.expr_types.get(&subject_id).unwrap().display_name(&ctx.heap));
         debug_log!("   - FromIdx type [{}]: {}", progress_idx_base || progress_from, self.expr_types.get(&from_id).unwrap().display_name(&ctx.heap));
         debug_log!("   - ToIdx   type [{}]: {}", progress_idx_base || progress_to, self.expr_types.get(&to_id).unwrap().display_name(&ctx.heap));
@@ @@ -2813,14 +2833,12 @@ impl PassTyping { @@
                 vacant.insert(inference_type);
             },
             Entry::Occupied(mut preexisting) => {
                 // We already have an entry, this happens if our parent fixed
                 // our type (e.g. we're used in a conditional expression's test)
                 // but we have a different type.
                 // TODO: Is this ever called? Seems like it can't
                 debug_assert!(false, "I am actually called, my ID is {}", expr_id.index);
                 let old_type = preexisting.get_mut();
                 if let SingleInferenceResult::Incompatible = InferenceType::infer_subtree_for_single_type(
                     old_type, 0, &inference_type.parts, 0
                 ) {
                     return Err(self.construct_expr_type_error(ctx, expr_id, expr_id))
+                }

src/protocol/parser/type_table.rs

➞

Show inline comments

@@ @@ -324,13 +324,14 @@ impl TypeTable { @@
         while let Some((root_id, definition_id)) = self.iter.top() {
             // We have a type to resolve
             let definition = &ctx.heap[definition_id];
             let can_pop_breadcrumb = match definition {
                 // TODO: @cleanup Borrow rules hax
                 // Bit ugly, since we already have the definition, but we need
                 // to work around rust borrowing rules...
                 Definition::Enum(_) => self.resolve_base_enum_definition(modules, ctx, root_id, definition_id),
                 Definition::Union(_) => self.resolve_base_union_definition(modules, ctx, root_id, definition_id),
                 Definition::Struct(_) => self.resolve_base_struct_definition(modules, ctx, root_id, definition_id),
                 Definition::Component(_) => self.resolve_base_component_definition(modules, ctx, root_id, definition_id),
                 Definition::Function(_) => self.resolve_base_function_definition(modules, ctx, root_id, definition_id),
             }?;

src/protocol/tests/eval_calls.rs

➞

Show inline comments

@@ @@ -7,13 +7,13 @@ fn test_function_call() { @@
         return value + 2;
+    }
     func foo() -> u32 {
         return add_two(5);
+    }
     ").for_function("foo", |f| {
-        f.call(Some(Value::UInt32(7)));
+        f.call_ok(Some(Value::UInt32(7)));
     });
     println!("\n\n\n\n\n\n\n");
     Tester::new_single_source_expect_ok("with variable arg", "
     func add_two(u32 value) -> u32 {
@@ @@ -22,9 +22,9 @@ fn test_function_call() { @@
+    }
     func foo() -> bool {
         auto initial = 5;
         auto result = add_two(initial);
         return initial == 5 && result == 7;
     }").for_function("foo", |f| {
-        f.call(Some(Value::Bool(true)));
+        f.call_ok(Some(Value::Bool(true)));
     });
+}
@@ \ No newline at end of file @@

src/protocol/tests/eval_operators.rs

➞

Show inline comments

@@ @@ -13,13 +13,13 @@ fn test_assignment_operators() { @@
         );
+    }
     fn perform_test(name: &str, source: String, expected_value: Value) {
         Tester::new_single_source_expect_ok(name, source)
             .for_function("foo", move |f| {
-                f.call(Some(expected_value));
+                f.call_ok(Some(expected_value));
             });
+    }
     perform_test(
         "set",
         construct_source("u32", "1", "= 5"),
@@ @@ -97,13 +97,13 @@ fn test_binary_integer_operators() { @@
         ", value_type, code)
+    }
     fn perform_test(test_name: &str, value_type: &str, code: &str, expected_value: Value) {
         Tester::new_single_source_expect_ok(test_name, construct_source(value_type, code))
             .for_function("foo", move |f| {
-                f.call(Some(expected_value));
+                f.call_ok(Some(expected_value));
             });
+    }
     perform_test(
         "bitwise_or", "u16",
         "auto a = 3; return a | 4;", Value::UInt16(7)

src/protocol/tests/eval_silly.rs

➞

Show inline comments

@@ @@ -51,48 +51,114 @@ fn test_concatenate_operator() { @@
                 !check_pair(total, 2) ||
                 !check_pair(total, 4) ||
                 !check_pair(total, 6);
             auto has_correct_fields =
                 check_values(total, 3, 3, 4) &&
                 check_values(total, 4, 1, 2);
             return is_equal && !is_not_equal && has_correct_fields;
             auto array_check = lhs == rhs && total == total;
             return is_equal && !is_not_equal && has_correct_fields && array_check;
+        }
+        "
     ).for_function("foo", |f| {
-        f.call(Some(Value::Bool(true)));
+        f.call_ok(Some(Value::Bool(true)));
     });
+}
 #[test]
 fn test_struct_fields() {
     Tester::new_single_source_expect_ok("struct field access",
+"
 struct Nester<T> {
     T v,
+}
 fn test_slicing_magic() {
     // TODO: Reimplement polymorphism, then retest with polymorphic types
     Tester::new_single_source_expect_ok("slicing", "
         struct Holder {
             u32[] left,
             u32[] right,
+        }
 func make<T>(T inner) -> Nester<T> {
     return Nester{ v: inner };
+}
         func create_array(u32 first_index, u32 last_index) -> u32[] {
             auto result = {};
             while (first_index < last_index) {
                 // Absolutely rediculous, but we don't have builtin array functions yet...
                 result = result @ { first_index };
                 first_index += 1;
+            }
             return result;
+        }
         func create_holder(u32 left_first, u32 left_last, u32 right_first, u32 right_last) -> Holder {
             return Holder{
                 left: create_array(left_first, left_last),
                 right: create_array(right_first, right_last)
             };
+        }
 func modify<T>(Nester<T> outer, T inner) -> Nester<T> {
     outer.v = inner;
     return outer;
         // Another silly thing, we first slice the full thing. Then subslice a single
         // element, then concatenate. We always return an array of two things.
         func slicing_magic(Holder holder, u32 left_base, u32 left_amount, u32 right_base, u32 right_amount) -> u32[] {
             auto left = holder.left[left_base..left_base + left_amount];
             auto right = holder.right[right_base..right_base + right_amount];
             return left[0..1] @ right[0..1];
+        }
         func foo() -> u32 {
             // left array will be [0, 1, 2, ...] and right array will be [2, 3, 4, ...]
             auto created = create_holder(0, 5, 2, 8);
             // in a convoluted fashion select the value 3 from the lhs and the value 3 from the rhs
             auto result = slicing_magic(create_holder(0, 5, 2, 8), 3, 2, 1, 2);
             // and return 3 + 3
             return result[0] + result[1];
+        }
     ").for_function("foo", |f| {
         f.call_ok(Some(Value::UInt32(6)));
     });
+}
 func foo() -> bool {
     // Single depth modification
     auto original1 = make<u32>(5);
     auto modified1 = modify(original1, 2);
     auto success1 = original1.v == 5 && modified1.v == 2;
 #[test]
 fn test_struct_fields() {
     Tester::new_single_source_expect_ok("struct field access", "
         struct Nester<T> {
             T v,
+        }
         func make<T>(T inner) -> Nester<T> {
             return Nester{ v: inner };
+        }
         func modify<T>(Nester<T> outer, T inner) -> Nester<T> {
             outer.v = inner;
             return outer;
+        }
         func foo() -> bool {
             // Single depth modification
             auto original1 = make<u32>(5);
             auto modified1 = modify(original1, 2);
             auto success1 = original1.v == 5 && modified1.v == 2;
     // Multiple levels of modification
     auto original2 = make(make(make(make(true))));
     auto modified2 = modify(original2.v, make(make(false))); // strip one Nester level
     auto success2 = original2.v.v.v.v == true && modified2.v.v.v == false;
             // Multiple levels of modification
             auto original2 = make(make(make(make(true))));
             auto modified2 = modify(original2.v, make(make(false))); // strip one Nester level
             auto success2 = original2.v.v.v.v == true && modified2.v.v.v == false;
     return success1 && success2;
             return success1 && success2;
+        }
     ").for_function("foo", |f| {
         f.call_ok(Some(Value::Bool(true)));
     });
+}
 ").for_function("foo", |f| {
         f.call(Some(Value::Bool(true)));
 #[test]
 fn test_index_error() {
     Tester::new_single_source_expect_ok("indexing error", "
         func check_array(u32[] vals, u32 idx) -> u32 {
             return vals[idx];
+        }
         func foo() -> u32 {
             auto array = {1, 2, 3, 4, 5, 6, 7};
             check_array(array, 7);
             return array[0];
+        }
     ").for_function("foo", |f| {
         f.call_err("index 7 is out of bounds: array length is 7");
     });
+}
@@ \ No newline at end of file @@

src/protocol/tests/parser_imports.rs

➞

Show inline comments

@@ @@ -80,24 +80,23 @@ fn test_single_symbol_import() { @@
             return Bar{ field: 0 }.field;
+        }
         ")
         .compile()
         .expect_ok();
     // TODO: Re-enable once std lib is properly implemented
     // Tester::new("import all")
     //     .with_source("
     //     #module external
     //     struct Foo { s32 field }
     //     ")
     //     .with_source("
     //     import external::*;
     //     s32 caller() { return Foo{field:0}.field; }
     //     ")
     //     .compile()
     //     .expect_ok();
     Tester::new("import all")
         .with_source("
         #module external
         struct Foo { s32 field }
         ")
         .with_source("
         import external::*;
         func caller() -> s32 { return Foo{field:0}.field; }
         ")
         .compile()
         .expect_ok();
+}
 #[test]
 fn test_multi_symbol_import() {
     Tester::new("specific symbols")
         .with_source("

src/protocol/tests/parser_inference.rs

➞

Show inline comments

@@ @@ -388,13 +388,13 @@ fn test_failed_polymorph_inference() { @@
         .assert_occurs_at(0, ".")
         .assert_msg_has(0, "Conflicting type for polymorphic variable 'Shazam'")
         .assert_msg_has(1, "inferred it to 's8'")
         .assert_msg_has(2, "inferred it to 's32'");
     });
-    // TODO: Needs better error messages anyway, but this failed before
+    // Silly regression test
     Tester::new_single_source_expect_err(
         "nested field access inference mismatch",
+        "
         struct Node<T1, T2>{ T1 l, T2 r }
         func construct<T1, T2>(T1 l, T2 r) -> Node<T1, T2> { return Node{ l: l, r: r }; }
         func fix_poly<T>(Node<T, T> a) -> s32 { return 0; }

src/protocol/tests/parser_validation.rs

➞

Show inline comments

 /// parser_validation.rs
 ///
 /// Simple tests for the validation phase
 /// TODO: If semicolon behind struct definition: should be fine...
 use super::*;
 #[test]
 fn test_correct_struct_instance() {
     Tester::new_single_source_expect_ok(

src/protocol/tests/utils.rs

➞

Show inline comments

 use crate::collections::StringPool;
 use crate::protocol::{
     Module,
     ast::*,
     input_source::*,
     parser::{
-        *,
+        Parser,
         type_table::TypeTable,
         symbol_table::SymbolTable,
         token_parsing::*,
     },
     eval::*,
 };
@@ @@ -129,13 +130,17 @@ pub(crate) struct AstOkTester { @@
+}
 impl AstOkTester {
     fn new(test_name: String, parser: Parser) -> Self {
         Self {
             test_name,
             modules: parser.modules,
             modules: parser.modules.into_iter().map(|module| Module{
                 source: module.source,
                 root_id: module.root_id,
                 name: module.name.map(|(_, name)| name)
             }).collect(),
             heap: parser.heap,
             symbols: parser.symbol_table,
             types: parser.type_table,
             pool: parser.string_pool,
+        }
+    }
@@ @@ -570,44 +575,89 @@ impl<'a> FunctionTester<'a> { @@
         );
         f(tester);
         self
+    }
-    pub(crate) fn call(self, expected_result: Option<Value>) -> Self {
+    pub(crate) fn call_ok(self, expected_result: Option<Value>) -> Self {
         use crate::protocol::*;
         use crate::runtime::*;
         let mut prompt = Prompt::new(&self.ctx.heap, self.def.this.upcast(), ValueGroup::new_stack(Vec::new()));
         let mut call_context = EvalContext::None;
         loop {
             let result = prompt.step(&self.ctx.heap, &mut call_context).unwrap();
             match result {
                 EvalContinuation::Stepping => {},
                 _ => break,
         let (prompt, result) = self.eval_until_end();
         match result {
             Ok(_) => {
                 assert!(
                     prompt.store.stack.len() > 0, // note: stack never shrinks
                     "[{}] No value on stack after calling function for {}",
                     self.ctx.test_name, self.assert_postfix()
                 );
             },
             Err(err) => {
                 assert!(
                     false,
                     "[{}] Expected call to succeed, but got {:?} for {}",
                     self.ctx.test_name, err, self.assert_postfix()
+                )
+            }
+        }
         assert!(
             prompt.store.stack.len() > 0, // note: stack never shrinks
             "[{}] No value on stack after calling function for {}",
             self.ctx.test_name, self.assert_postfix()
         );
         if let Some(expected_result) = expected_result {
             debug_assert!(expected_result.get_heap_pos().is_none(), "comparing against heap thingamajigs is not yet implemented");
             assert!(
                 value::apply_equality_operator(&prompt.store, &prompt.store.stack[0], &expected_result),
                 "[{}] Result from call was {:?}, but expected {:?} for {}",
                 self.ctx.test_name, &prompt.store.stack[0], &expected_result, self.assert_postfix()
+            )
+        }
         self
+    }
     // Keeping this simple for now, will likely change
     pub(crate) fn call_err(self, expected_result: &str) -> Self {
         use crate::protocol::*;
         use crate::runtime::*;
         let (_, result) = self.eval_until_end();
         match result {
             Ok(_) => {
                 assert!(
                     false,
                     "[{}] Expected an error, but evaluation finished successfully for {}",
                     self.ctx.test_name, self.assert_postfix()
                 );
             },
             Err(err) => {
                 println!("DEBUG: Got evaluation error:\n{}", err);
                 debug_assert_eq!(err.statements.len(), 1);
                 assert!(
                     err.statements[0].message.contains(&expected_result),
                     "[{}] Expected error message to contain '{}', but it was '{}' for {}",
                     self.ctx.test_name, expected_result, err.statements[0].message, self.assert_postfix()
                 );
+            }
+        }
         self
+    }
     fn eval_until_end(&self) -> (Prompt, Result<EvalContinuation, EvalError>) {
         use crate::protocol::*;
         use crate::runtime::*;
         let mut prompt = Prompt::new(&self.ctx.heap, self.def.this.upcast(), ValueGroup::new_stack(Vec::new()));
         let mut call_context = EvalContext::None;
         loop {
             let result = prompt.step(&self.ctx.heap, &self.ctx.modules, &mut call_context);
             match result {
                 Ok(EvalContinuation::Stepping) => {},
                 _ => return (prompt, result),
+            }
+        }
+    }
     fn assert_postfix(&self) -> String {
         format!("Function{{ name: {} }}", self.def.identifier.value.as_str())
+    }
+}
 pub(crate) struct VariableTester<'a> {

src/runtime/error.rs

➞

Show inline comments

@@ @@ -14,12 +14,13 @@ pub enum ConnectError { @@
     NetEndpointSetupError(SocketAddr, NetEndpointError),
     SetupAlgMisbehavior,
+}
 #[derive(Eq, PartialEq, Copy, Clone, Debug)]
 pub enum AddComponentError {
     DuplicatePort(PortId),
     NoSuchModule,
     NoSuchComponent,
     NonPortTypeParameters,
     CannotMovePort(PortId),
     WrongNumberOfParamaters { expected: usize },
     UnknownPort(PortId),
     WrongPortPolarity { port: PortId, expected_polarity: Polarity },

src/runtime/mod.rs

➞

Show inline comments

@@ @@ -651,22 +651,23 @@ impl Connector { @@
     /// the given sequence of ports contains a duplicate port,
     /// or if the component is unfit for instantiation with the given port sequence.
     /// # Panics
     /// This function panics if the connector's (large) component id space is exhausted.
     pub fn add_component(
         &mut self,
         module_name: &[u8],
         identifier: &[u8],
         ports: &[PortId],
     ) -> Result<(), AddComponentError> {
         // Check for error cases first before modifying `cu`
         use AddComponentError as Ace;
         let cu = &self.unphased;
         if let Some(port) = duplicate_port(ports) {
             return Err(Ace::DuplicatePort(port));
+        }
         let expected_polarities = cu.proto_description.component_polarities(identifier)?;
+        let expected_polarities = cu.proto_description.component_polarities(module_name, identifier)?;
         if expected_polarities.len() != ports.len() {
             return Err(Ace::WrongNumberOfParamaters { expected: expected_polarities.len() });
+        }
         for (&expected_polarity, &port) in expected_polarities.iter().zip(ports.iter()) {
             let info = cu.ips.port_info.map.get(&port).ok_or(Ace::UnknownPort(port))?;
             if info.owner != cu.native_component_id {
@@ @@ -677,13 +678,13 @@ impl Connector { @@
+            }
+        }
         // No errors! Time to modify `cu`
         // create a new component and identifier
         let Connector { phased, unphased: cu } = self;
         let new_cid = cu.ips.id_manager.new_component_id();
         cu.proto_components.insert(new_cid, cu.proto_description.new_component(identifier, ports));
+        cu.proto_components.insert(new_cid, cu.proto_description.new_component(module_name, identifier, ports));
         // update the ownership of moved ports
         for port in ports.iter() {
             match cu.ips.port_info.map.get_mut(port) {
                 Some(port_info) => port_info.owner = new_cid,
                 None => unreachable!(),
+            }

src/runtime/tests.rs

➞

Show inline comments

@@ @@ -86,13 +86,13 @@ fn new_port_pair() { @@
 #[test]
 fn new_sync() {
     let test_log_path = Path::new("./logs/new_sync");
     let mut c = file_logged_connector(0, test_log_path);
     let [o, i] = c.new_port_pair();
     c.add_component(b"sync", &[i, o]).unwrap();
+    c.add_component(b"", b"sync", &[i, o]).unwrap();
+}
 #[test]
 fn new_net_port() {
     let test_log_path = Path::new("./logs/new_net_port");
     let mut c = file_logged_connector(0, test_log_path);
@@ @@ -337,13 +337,13 @@ fn cannot_use_moved_ports() { @@
     /*
     native p|-->|g sync
     */
     let test_log_path = Path::new("./logs/cannot_use_moved_ports");
     let mut c = file_logged_connector(0, test_log_path);
     let [p, g] = c.new_port_pair();
     c.add_component(b"sync", &[g, p]).unwrap();
+    c.add_component(b"", b"sync", &[g, p]).unwrap();
     c.connect(SEC1).unwrap();
     c.put(p, TEST_MSG.clone()).unwrap_err();
     c.get(g).unwrap_err();
+}
 #[test]
@@ @@ -353,13 +353,13 @@ fn sync_sync() { @@
            g1|<--|p1
     */
     let test_log_path = Path::new("./logs/sync_sync");
     let mut c = file_logged_connector(0, test_log_path);
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     c.add_component(b"sync", &[g0, p1]).unwrap();
+    c.add_component(b"", b"sync", &[g0, p1]).unwrap();
     c.connect(SEC1).unwrap();
     c.put(p0, TEST_MSG.clone()).unwrap();
     c.get(g1).unwrap();
     c.sync(SEC1).unwrap();
     c.gotten(g1).unwrap();
+}
@@ @@ -405,13 +405,13 @@ fn distributed_msg_bounce() { @@
             */
             let mut c = file_logged_connector(0, test_log_path);
             let [p, g] = [
                 c.new_net_port(Putter, sock_addrs[0], Active).unwrap(),
                 c.new_net_port(Getter, sock_addrs[1], Active).unwrap(),
             ];
             c.add_component(b"sync", &[g, p]).unwrap();
+            c.add_component(b"", b"sync", &[g, p]).unwrap();
             c.connect(SEC1).unwrap();
             c.sync(SEC1).unwrap();
         });
         s.spawn(|_| {
             /*
             native p|-->
@@ @@ -569,26 +569,26 @@ fn together() { @@
         s.spawn(|_| {
             let mut c = file_logged_connector(0, test_log_path);
             let [p0, p1] = c.new_port_pair();
             let p2 = c.new_net_port(Getter, sock_addrs[0], Passive).unwrap();
             let p3 = c.new_net_port(Putter, sock_addrs[1], Active).unwrap();
             let [p4, p5] = c.new_port_pair();
             c.add_component(b"together", &[p1, p2, p3, p4]).unwrap();
+            c.add_component(b"", b"together", &[p1, p2, p3, p4]).unwrap();
             c.connect(SEC1).unwrap();
             c.put(p0, TEST_MSG.clone()).unwrap();
             c.get(p5).unwrap();
             c.sync(MS300).unwrap();
             c.gotten(p5).unwrap();
         });
         s.spawn(|_| {
             let mut c = file_logged_connector(1, test_log_path);
             let [p0, p1] = c.new_port_pair();
             let p2 = c.new_net_port(Getter, sock_addrs[1], Passive).unwrap();
             let p3 = c.new_net_port(Putter, sock_addrs[0], Active).unwrap();
             let [p4, p5] = c.new_port_pair();
             c.add_component(b"together", &[p1, p2, p3, p4]).unwrap();
+            c.add_component(b"", b"together", &[p1, p2, p3, p4]).unwrap();
             c.connect(SEC1).unwrap();
             c.put(p0, TEST_MSG.clone()).unwrap();
             c.get(p5).unwrap();
             c.sync(MS300).unwrap();
             c.gotten(p5).unwrap();
         });
@@ @@ -874,13 +874,13 @@ fn ac_not_b() { @@
             let pd = Arc::new(reowolf::ProtocolDescription::parse(pdl).unwrap());
             let mut c = file_logged_configured_connector(1, test_log_path, pd);
             let p0 = c.new_net_port(Getter, sock_addrs[0], Passive).unwrap();
             let p1 = c.new_net_port(Getter, sock_addrs[1], Passive).unwrap();
             let [a, b] = c.new_port_pair();
             c.add_component(b"ac_not_b", &[p0, p1, a]).unwrap();
+            c.add_component(b"", b"ac_not_b", &[p0, p1, a]).unwrap();
             c.connect(SEC1).unwrap();
             c.get(b).unwrap();
             c.sync(SEC1).unwrap_err();
         });
@@ @@ -982,13 +982,13 @@ fn pdl_reo_fifo1full() { @@
+    }
     ";
     let pd = reowolf::ProtocolDescription::parse(pdl).unwrap();
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     let [_p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     c.add_component(b"fifo1full", &[g0, p1]).unwrap();
+    c.add_component(b"", b"fifo1full", &[g0, p1]).unwrap();
     c.connect(None).unwrap();
     c.get(g1).unwrap();
     c.sync(None).unwrap();
     assert_eq!(0, c.gotten(g1).unwrap().len());
+}
@@ @@ -1005,13 +1005,13 @@ fn pdl_msg_consensus() { @@
+    }
     ";
     let pd = reowolf::ProtocolDescription::parse(pdl).unwrap();
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     c.add_component(b"msgconsensus", &[g0, g1]).unwrap();
+    c.add_component(b"", b"msgconsensus", &[g0, g1]).unwrap();
     c.connect(None).unwrap();
     c.put(p0, Payload::from(b"HELLO" as &[_])).unwrap();
     c.put(p1, Payload::from(b"HELLO" as &[_])).unwrap();
     c.sync(SEC1).unwrap();
     c.put(p0, Payload::from(b"HEY" as &[_])).unwrap();
@@ @@ -1040,13 +1040,13 @@ fn sequencer3_prim() { @@
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) sequencer3, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     let [p2, g2] = c.new_port_pair();
     c.add_component(b"sequencer3", &[p0, p1, p2]).unwrap();
+    c.add_component(b"", b"sequencer3", &[p0, p1, p2]).unwrap();
     c.connect(None).unwrap();
     let which_of_three = move |c: &mut Connector| {
         // setup three sync batches. sync. return which succeeded
         c.get(g0).unwrap();
         c.next_batch().unwrap();
@@ @@ -1106,13 +1106,13 @@ fn sequencer3_comp() { @@
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) sequencer3, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     let [p2, g2] = c.new_port_pair();
     c.add_component(b"sequencer3", &[p0, p1, p2]).unwrap();
+    c.add_component(b"", b"sequencer3", &[p0, p1, p2]).unwrap();
     c.connect(None).unwrap();
     let which_of_three = move |c: &mut Connector| {
         // setup three sync batches. sync. return which succeeded
         c.get(g0).unwrap();
         c.next_batch().unwrap();
@@ @@ -1164,13 +1164,13 @@ fn xrouter_prim() { @@
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) xrouter2, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     let [p2, g2] = c.new_port_pair();
     c.add_component(b"xrouter", &[g0, p1, p2]).unwrap();
+    c.add_component(b"", b"xrouter", &[g0, p1, p2]).unwrap();
     c.connect(None).unwrap();
     let now = std::time::Instant::now();
     for item in XROUTER_ITEMS.iter() {
         match item {
             XRouterItem::Silent => {}
@@ @@ -1232,13 +1232,13 @@ fn xrouter_comp() { @@
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) xrouter2, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     let [p2, g2] = c.new_port_pair();
     c.add_component(b"xrouter", &[g0, p1, p2]).unwrap();
+    c.add_component(b"", b"xrouter", &[g0, p1, p2]).unwrap();
     c.connect(None).unwrap();
     let now = std::time::Instant::now();
     for item in XROUTER_ITEMS.iter() {
         match item {
             XRouterItem::Silent => {}
@@ @@ -1271,13 +1271,13 @@ fn count_stream() { @@
     ";
     let pd = reowolf::ProtocolDescription::parse(pdl).unwrap();
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) sequencer3, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     c.add_component(b"count_stream", &[p0]).unwrap();
+    c.add_component(b"", b"count_stream", &[p0]).unwrap();
     c.connect(None).unwrap();
     for expecting in 0u8..16 {
         c.get(g0).unwrap();
         c.sync(None).unwrap();
         assert_eq!(&[expecting], c.gotten(g0).unwrap().as_slice());
@@ @@ -1301,13 +1301,13 @@ fn for_msg_byte() { @@
     ";
     let pd = reowolf::ProtocolDescription::parse(pdl).unwrap();
     let mut c = file_logged_configured_connector(0, test_log_path, Arc::new(pd));
     // setup a session between (a) native, and (b) sequencer3, connected by 3 ports.
     let [p0, g0] = c.new_port_pair();
     c.add_component(b"for_msg_byte", &[p0]).unwrap();
+    c.add_component(b"", b"for_msg_byte", &[p0]).unwrap();
     c.connect(None).unwrap();
     for expecting in 0u8..8 {
         c.get(g0).unwrap();
         c.sync(None).unwrap();
         assert_eq!(&[expecting], c.gotten(g0).unwrap().as_slice());
@@ @@ -1341,22 +1341,22 @@ fn eq_causality() { @@
     [native]p0-->g0[eq]p1--.
                  g1        |
                  ^---------`
     */
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     c.add_component(b"eq", &[g0, g1, p1]).unwrap();
+    c.add_component(b"", b"eq", &[g0, g1, p1]).unwrap();
     /*
                   V--------.
                  g2        |
     [native]p2-->g3[eq]p3--`
     */
     let [p2, g2] = c.new_port_pair();
     let [p3, g3] = c.new_port_pair();
     c.add_component(b"eq", &[g3, g2, p3]).unwrap();
+    c.add_component(b"", b"eq", &[g3, g2, p3]).unwrap();
     c.connect(None).unwrap();
     for _ in 0..4 {
         // everything is fine with LEFT FIRST
         c.put(p0, TEST_MSG.clone()).unwrap();
         c.sync(MS100).unwrap();
@@ @@ -1429,22 +1429,22 @@ fn eq_no_causality() { @@
     [native]p0-->g0[eq]p1--.
                  g1        |
                  ^---------`
     */
     let [p0, g0] = c.new_port_pair();
     let [p1, g1] = c.new_port_pair();
     c.add_component(b"eq", &[g0, g1, p1]).unwrap();
+    c.add_component(b"", b"eq", &[g0, g1, p1]).unwrap();
     /*
                   V--------.
                  g2        |
     [native]p2-->g3[eq]p3--`
     */
     let [p2, g2] = c.new_port_pair();
     let [p3, g3] = c.new_port_pair();
     c.add_component(b"eq", &[g3, g2, p3]).unwrap();
+    c.add_component(b"", b"eq", &[g3, g2, p3]).unwrap();
     c.connect(None).unwrap();
     for _ in 0..32 {
         // ok when they send
         c.put(p0, TEST_MSG.clone()).unwrap();
         c.put(p2, TEST_MSG.clone()).unwrap();

0 comments (0 inline, 0 general)