Changes in / [8dac2cc:64bc131]

Files:

• doc/generic_types/generic_types.tex (modified) (1 diff)
• doc/nda/Aaron_Moss-Rob_Schluntz-Thierry_Delisle.pdf (deleted)
• doc/nda/Cover_Letter.pdf (deleted)
• doc/nda/Daniel_Caccamo.pdf (deleted)
• doc/nda/NDA.pdf (deleted)
• doc/nda/Neda_Paryab.pdf (deleted)
• doc/nda/Peter_Buhr-30-jul-2014.pdf (deleted)
• doc/rob_thesis/thesis.bib (modified) (1 prop)
• src/InitTweak/FixInit.cc (modified) (2 diffs)

doc/generic_types/generic_types.tex

@@ -1020 +1020 @@
 While \CC provides good backwards compatibility with C, it has a steep learning curve for many of its extensions.
 For example, polymorphism is provided via three disjoint mechanisms: overloading, inheritance, and templates.
-The overloading is restricted because resolution does not use the return type, inheritance requires learning object-oriented programming and coping with a restricted nominal-inheritance hierarchy, templates cannot be separately compiled resulting in compilation/code bloat and poor error messages, and determining how these mechanisms interact and which to use is confusing.
+The overloading is restricted because resolution does not using the return type, inheritance requires learning object-oriented programming and coping with a restricted nominal-inheritance hierarchy, templates cannot be separately compiled resulting in compilation/code bloat and poor error messages, and determining how these mechanisms interact and which to use is confusing.
 In contrast, \CFA has a single facility for polymorphic code supporting type-safe separate-compilation of polymorphic functions and generic (opaque) types, which uniformly leverage the C procedural paradigm.
 The key mechanism to support separate compilation is \CFA's \emph{explicit} use of assumed properties for a type.

src/InitTweak/FixInit.cc

@@ -656 +656 @@
                                 unqExpr->set_result( maybeClone( unqExpr->get_expr()->get_result() ) );
                                 if ( unqCount[ unqExpr->get_id() ] == 0 ) {  // insert destructor after the last use of the unique expression
-                                        stmtsToAddAfter.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] );
+                                        stmtsToAdd.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] );
                                 }
                                 if ( addDeref.count( unqExpr->get_id() ) ) {
@@ -668 +668 @@
                         stmtsToAdd.splice( stmtsToAdd.end(), fixer.stmtsToAdd );
                         unqMap[unqExpr->get_id()] = unqExpr;
-                        if ( unqCount[ unqExpr->get_id() ] == 0 ) {  // insert destructor after the last use of the unique expression
-                                stmtsToAddAfter.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] );
-                        } else { // remember dtors for last instance of unique expr
-                                dtors[ unqExpr->get_id() ] = fixer.stmtsToAddAfter;
-                        }
                         if ( UntypedExpr * deref = dynamic_cast< UntypedExpr * >( unqExpr->get_expr() ) ) {
+                                if ( unqCount[ unqExpr->get_id() ] == 0 ) {  // insert destructor after the last use of the unique expression
+                                        stmtsToAdd.splice( stmtsToAddAfter.end(), dtors[ unqExpr->get_id() ] );
+                                } else { // remember dtors for last instance of unique expr
+                                        dtors[ unqExpr->get_id() ] = fixer.stmtsToAddAfter;
+                                }
                                 // unique expression is now a dereference, because the inner expression is an lvalue returning function call.
                                 // Normalize the expression by dereferencing the unique expression, rather than the inner expression