Changeset 4e13e2a for src

Timestamp:

Sep 17, 2019, 12:56:32 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

8e1467d

Parents:

a6f26ca

Message:

Added setting of result in Comma expression.
Added asserts in candidate finder to catch null pointers earlier.
ForAll? substituter now properly uses ShallowCopy?.
Added missing makefile.in

Location:

src

Files:

• AST/Expr.hpp (modified) (1 diff)
• AST/ForallSubstitutionTable.cpp (modified) (3 diffs)
• ResolvExpr/Candidate.hpp (modified) (2 diffs)
• ResolvExpr/CandidateFinder.cpp (modified) (1 diff)
• ResolvExpr/RenameVars.cc (modified) (4 diffs)

src/AST/Expr.hpp

@@ -541 +541 @@
 
         CommaExpr( const CodeLocation & loc, const Expr * a1, const Expr * a2 )
-        : Expr( loc ), arg1( a1 ), arg2( a2 ) {}
+        : Expr( loc ), arg1( a1 ), arg2( a2 ) {
+                this->result = a2->result;
+        }
 
         const Expr * accept( Visitor & v ) const override { return v.visit( this ); }

src/AST/ForallSubstitutionTable.cpp

@@ -19 +19 @@
 #include <vector>
 
+#include "Copy.hpp"                // for shallowCopy
 #include "Decl.hpp"
 #include "Node.hpp"
@@ -26 +27 @@
 namespace ast {
 
-std::vector< ptr< TypeDecl > > ForallSubstitutionTable::clone( 
-        const std::vector< ptr< TypeDecl > > & forall, Visitor & v 
+std::vector< ptr< TypeDecl > > ForallSubstitutionTable::clone(
+        const std::vector< ptr< TypeDecl > > & forall, Visitor & v
 ) {
         std::vector< ptr< TypeDecl > > new_forall;
@@ -34 +35 @@
         for ( const ast::TypeDecl * d : forall ) {
                 // create cloned type decl and insert into substitution map before further mutation
-                auto new_d = new ast::TypeDecl{
-                        d->location, d->name, d->storage, d->base, d->kind, d->sized, d->init };
+                auto new_d = shallowCopy( d );
                 decls.insert( d, new_d );
                 // perform other mutations and add to output

src/ResolvExpr/Candidate.hpp

@@ -51 +51 @@
 
         Candidate( const ast::Expr * x, const ast::TypeEnvironment & e )
-        : expr( x ), cost( Cost::zero ), cvtCost( Cost::zero ), env( e ), open(), need() {}
+        : expr( x ), cost( Cost::zero ), cvtCost( Cost::zero ), env( e ), open(), need() {
+                assert(x->result);
+        }
 
         Candidate( const Candidate & o, const ast::Expr * x, const Cost & addedCost = Cost::zero )
         : expr( x ), cost( o.cost + addedCost ), cvtCost( Cost::zero ), env( o.env ), open( o.open ),
-          need( o.need ) {}
+          need( o.need ) {
+                assert(x->result);
+        }
 
         Candidate(
-                const ast::Expr * x, const ast::TypeEnvironment & e, const ast::OpenVarSet & o, 
+                const ast::Expr * x, const ast::TypeEnvironment & e, const ast::OpenVarSet & o,
                 const ast::AssertionSet & n, const Cost & c, const Cost & cvt = Cost::zero )
-        : expr( x ), cost( c ), cvtCost( cvt ), env( e ), open( o ), need( n.begin(), n.end() ) {}
+        : expr( x ), cost( c ), cvtCost( cvt ), env( e ), open( o ), need( n.begin(), n.end() ) {
+                assert(x->result);
+        }
 
         Candidate(
@@ -66 +72 @@
                 ast::AssertionSet && n, const Cost & c, const Cost & cvt = Cost::zero )
         : expr( x ), cost( c ), cvtCost( cvt ), env( std::move( e ) ), open( std::move( o ) ),
-          need( n.begin(), n.end() ) {}
+          need( n.begin(), n.end() ) {
+                assert(x->result);
+        }
 };
 

src/ResolvExpr/CandidateFinder.cpp

@@ -1485 +1485 @@
                         {
                                 ast::ptr< ast::Type > newType = candidate->expr->result;
+                                assertf(candidate->expr->result, "Result of expression %p for candidate is null", candidate->expr.get());
                                 candidate->env.apply( newType );
                                 mangleName = Mangle::mangle( newType );

src/ResolvExpr/RenameVars.cc

@@ -83 +83 @@
                         auto it = nameMap.find( type->name );
                         if ( it != nameMap.end() ) {
-                                // unconditionally mutate because map will *always* have different name, 
+                                // unconditionally mutate because map will *always* have different name,
                                 // if this mutates, will *always* have been mutated by ForallSubstitutor above
                                 ast::TypeInstType * mut = ast::mutate( type );
@@ -96 +96 @@
                 const NodeT * openLevel( const NodeT * type ) {
                         if ( type->forall.empty() ) return type;
-                        
+
                         nameMap.beginScope();
 
@@ -121 +121 @@
                 void closeLevel( const ast::ParameterizedType * type ) {
                         if ( type->forall.empty() ) return;
-                        
+
                         nameMap.endScope();
                 }
@@ -141 +141 @@
                 }
         };
-        
+
         struct RenameVars_new /*: public ast::WithForallSubstitutor*/ {
                 #warning when old RenameVars goes away, replace hack below with global pass inheriting from WithForallSubstitutor