Changed from Generator to Trnasformer everywhere.

Author: waywardgeek

Makefile

@@ -54,10 +54,10 @@ database/string.c \
 database/util.c \
 database/value.c \
 database/variable.c \
-generator/constprop.c \
-generator/generator.c \
-generator/iterator.c \
-generator/memmanage.c \
+transformer/constprop.c \
+transformer/transformer.c \
+transformer/iterator.c \
+transformer/memmanage.c \
 llvm/debug.c \
 llvm/genllvm.c \
 llvm/lldatabase.c \
@@ -145,7 +145,7 @@ clean:
 	cd bootstrap/database ; make clean
 
 obj: include/dedatabase.h llvm/lldatabase.h
-	mkdir -p obj/database obj/llvm obj/parse obj/runtime obj/src obj/util obj/rpc obj/bind obj/generator
+	mkdir -p obj/database obj/llvm obj/parse obj/runtime obj/src obj/util obj/rpc obj/bind obj/transformer
 
 obj/%.o: %.c $(DEPS)
 	$(CC) $(CFLAGS) -c -o $@ $<

README.md

@@ -26,7 +26,13 @@ than C++ for most memory-intensive applications, due to its Structure-of-Array
 \([SoA](https://en.wikipedia.org/wiki/AoS_and_SoA#:~:text=AoS%20vs.,AoS%20case%20easier%20to%20handle.)\)
 memory management.
 
-It provides many of its features by deeply integrating the ["DataDraw"](https://datadraw.sourceforge.net) tool into the primitives and constructs of the language. DataDraw is a code-generation tool that generates highly-optimized C code which outperforms e.g., the C++ STL given a declarative description of data-structures and relationships between them. For more information, see the [DataDraw 3.0 Manual](https://datadraw.sourceforge.net/manual.pdf).
+It provides many of its features by deeply integrating features similar to the
+["DataDraw"](https://datadraw.sourceforge.net) tool into the primitives and
+constructs of the language. DataDraw is a code-generation tool that generates
+highly-optimized C code which outperforms e.g., the C++ STL given a declarative
+description of data-structures and relationships between them. For more
+information, see the [DataDraw 3.0
+Manual](https://datadraw.sourceforge.net/manual.pdf).
 
 Additional documentation:
 
@@ -90,9 +96,8 @@ both SQL and Rune.
 class Human(self: Human, name: string, mother: Human? = null(self), father: Human? = null(self)) {
   self.name = name
 
-  // The methods "appendMotheredHuman" and "appendFatheredHuman" are generated by the "datadraw"
-  // code-generation tool -- an embedded part of the Rune compiler toolchain and vital ingredient
-  // to Rune's performance.
+  // The methods "appendMotheredHuman" and "appendFatheredHuman" are generated
+  // by code "transformers", a key factor in Rune's performance.
   //
   // We'll learn more about these methods in the next section ("How does this work?").
   if !isnull(mother) {
@@ -123,8 +128,8 @@ class Human(self: Human, name: string, mother: Human? = null(self), father: Huma
 // its children are recursively destroyed.
 // (In other words, manual invalidation of pointers is not required)
 //
-// This ability is also provided by the "datadraw" code-generation tool.
-// See: Page 6 of the DataDraw 3.0 Manual: https://datadraw.sourceforge.net/manual.pdf
+// This ability is also provided by code transformers.  See
+// builtin/doublylinked.rn
 relation DoublyLinked Human:"Mother" Human:"Mothered" cascade
 relation DoublyLinked Human:"Father" Human:"Fathered" cascade
 

TODO

@@ -6,14 +6,14 @@ Add an option for generating SoA vs AoS memory layout so folks can do their own
 Write a C or C++ backend code generator for improved debugging of Rune, and so folks can benchmark with
     full front-end optimization of different C compilers for benchmarking.
 Enhance gdb pretty printer so that we don't have to generate show methods.
-Figure out when relationship generators should run.  Right now it is in the order statements are bound so that module-level variables can be passed into the generators, but we assume all generators are run before binding a constructor, which is currently false.  Figure out the right thing and do it.
+Figure out when relationship transformers should run.  Right now it is in the order statements are bound so that module-level variables can be passed into the transformers, but we assume all transformers are run before binding a constructor, which is currently false.  Figure out the right thing and do it.
 Use concrete type constraints in binding.  This can help eleminate problems
     in binding recursive functions, and also non-template classes.
 Don't allow generated fields to be written outside of generated code.
 Add an Object class that matches all types, so we can have case (Object, Object, Object).
 Defend vs Spectre/Meltdown: duplicate bignum functions in runtime to have constant-time vs
     non-constant time APIs.  Do not pass in a secret bit.
-Figure out how to programatically manipulate labels in generators.
+Figure out how to programatically manipulate labels in transformers.
 Flesh out index overloading: write is not yet supported.
 Support Overloading method get/set methods.
 Improve safe mode:
@@ -52,7 +52,7 @@ Support overloading modular operations, so we can support modular polynomials, e
 Add multi-threading support.
 Add schema-level reuse statements
 Write a schema generator for Rune similar to the dataview program for DataDraw schemas.
-Flush out generator's Rune code interpreter.
+Flush out transformers's Rune code interpreter.
 Finish transition to memory pools, and allocation of global arrays with mmap of the memory available on the machine so large arrays never move.
 Add support for 32-bit mode.
 

bind/bind.c

@@ -24,7 +24,7 @@ Binding in Rune is challenging.  The usual one-pass per function fails because:
 
 * Recursive binding: While binding a function signature that calls itself, we
   are blocked on the recursive call since the return type is still unknown.
-* Code generation: While binding a function signature, there is an undefined
+* Code transforms: While binding a function signature, there is an undefined
   identifier.  This may be real, or maybe it hasn't been generated yet.
 * Undefined class data members: While binding class A, we refer to a method in
   class B that uses an undefined member variable on B.  These members are
@@ -85,13 +85,13 @@ In A.rn:
       ...  The rest is unit test code that does not use B.
     }
 
-The problem is that the DoublyLinked code generator added lines to A's
+The problem is that the DoublyLinked code transformer added lines to A's
 constructor:
 
     self.firstB = null(B)
     self.lastB = null(B)
 
-In A's destructor, the code generator added a loop to destroy all the B
+In A's destructor, the code transformer added a loop to destroy all the B
 objects, and that loop refers to self.firstB.  The statement self.firstB =
 null(B) does not provide enough information to fully specify the type of B,
 which is a template class due to the <value> parameter.  The type hint gets
@@ -112,7 +112,7 @@ will be uniquified per signature, before binding, so binding can be done once.
 Similarly a Binding has a list of Expression objects representing the queue
 of expressions to be bound for a statement, default value expression, or type
 expression.  The new scheme allows multiple expression trees to be bound in
-parallel, and the assembly code generator no longer has to rebind a function
+parallel, and the assembly code transformer no longer has to rebind a function
 signature before generating code.
 
 Binding objects, when created, are appended to a global queue of binding objects

bind/bindexpr.c

@@ -942,7 +942,7 @@ static void bindNotExpression(deBlock scopeBlock, deExpression expression) {
 // can also cast a string to a [u8] array and vise-versa.  Object references
 // can be cast to their underlying integer type and back, e.g  <u32>Point(1,2),
 // or <Point(u64, u64)>1u32.  Object-to-integer casts are dangerous and we
-// should probably restrict its use to code generators.
+// should probably restrict its use to code transformers and unsafe code.
 static void verifyCast(deExpression expression, deDatatype leftDatatype,
     deDatatype rightDatatype, deLine line) {
   if (leftDatatype == rightDatatype) {

bind/bindformat.c

@@ -22,7 +22,7 @@ static void checkExpressionIsPrintable(deExpression expression) {
   deDatatype datatype = deExpressionGetDatatype(expression);
   switch (deDatatypeGetType(datatype)) {
   case DE_TYPE_EXPR:
-    deExprError(expression, "Cannot print generator expressions");
+    deExprError(expression, "Cannot print transformer expressions");
     break;
   case DE_TYPE_NONE:
     deExprError(expression, "Printed argument has no type");

bootstrap/database/function.rn

@@ -35,7 +35,7 @@ enum FuncType {
   Final
   Struct
   Enum
-  Generator
+  Transformer
   Unittest
 }
 
@@ -64,7 +64,7 @@ func getFuncTypeName(type: FuncType) -> string {
     FuncType.Final => return "final"
     FuncType.Struct => return "struct"
     FuncType.Enum => return "enum"
-    FuncType.Generator => return "generator"
+    FuncType.Transformer => return "transformer"
   }
 }
 

bootstrap/database/rel.rn

@@ -12,16 +12,16 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-use gen
+use trans
 use template
 use root
 
-class Relation(self, gen: Generator, parent: Template, child: Template) {
+class Relation(self, gen: Transformer, parent: Template, child: Template) {
   gen.appendRelation(self)
   parent.appendChildRelation(self)
   child.appendParentRelation(self)
 }
 
-relation DoublyLinked Generator Relation cascade
+relation DoublyLinked Transformer Relation cascade
 relation DoublyLinked Template:"Parent" Relation:"Child" cascade
 relation DoublyLinked Template:"Child" Relation:"Parent" cascade

bootstrap/database/gen.rn bootstrap/database/trans.rn

@@ -15,8 +15,8 @@
 use function
 use root
 
-class Generator(self, function: Function) {
-  function.insertGenerator(self)
+class Transformer(self, function: Function) {
+  function.insertTransformer(self)
 }
 
-relation OneToOne Function Generator cascade
+relation OneToOne Function Transformer cascade

builtin/arraylist.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator ArrayList(A: Class, B: Class, cascadeDelete:bool = false,
+transformer ArrayList(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "", pluralB = "") {
   if pluralB == "" {
     pluralB = "$B_s"

builtin/doublylinked.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator DoublyLinked(A: Class, B: Class, cascadeDelete:bool = false,
+transformer DoublyLinked(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "", pluralB: string = "") {
   if pluralB == "" {
     pluralB = "$B_s"

builtin/hashed.rn

@@ -74,16 +74,16 @@ func hashValue(value) -> u64 {
   }
 }
 
-// This is a one-to-many relation generator that adds a hash table between
+// This is a one-to-many relation transformer that adds a hash table between
 // class A and B.  The hash table is always a power of 2, and dynamically grows
 // as needed, when the number of hash table elements equals the size of the
 // table.  The child class B must have a data member matching the value of keyField.
 // No two elements in the hash table can have the same keyField value.
 //
-// This generator embeds a singly-linked list between A and B, which on average
+// This transformer embeds a singly-linked list between A and B, which on average
 // will never have more than one element, so the expected insert/remove time is
 // still constant.
-generator Hashed(A: Class, B: Class, cascadeDelete: bool = false,
+transformer Hashed(A: Class, B: Class, cascadeDelete: bool = false,
     labelA: string = "", labelB: string = "", keyField: string = "hash", pluralB: string = "") {
   if pluralB == "" {
     pluralB = "$B_s";

builtin/hashedclass.rn

@@ -12,17 +12,17 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-// This is a one-to-many relation generator that adds a hash table between
+// This is a one-to-many relation transformer that adds a hash table between
 // class A and B.  The hash table is always a power of 2, and dynamically grows
 // as needed, when the number of hash table elements equals the size of the
 // table.  The child class B must have two methods: hash() -> u64, and
 // equals(other) which compares the two instances of class B and returns true
 // if they are equivalent.
 //
-// This generator embeds a singly-linked list between A and B, which on average
+// This transformer embeds a singly-linked list between A and B, which on average
 // will never have more than one element, so the expected insert/remove time is
 // still constant.
-generator HashedClass(A: Class, B: Class, cascadeDelete: bool = false,
+transformer HashedClass(A: Class, B: Class, cascadeDelete: bool = false,
     labelA: string = "", labelB: string = "", pluralB: string = "") {
   if pluralB == "" {
     pluralB = "$B_s";

builtin/heapqlist.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator HeapqList(A: Class, B: Class, cascadeDelete:bool = false,
+transformer HeapqList(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "", ascend: bool = true, pluralB = "") {
   if pluralB == "" {
     pluralB = "$B_s"

builtin/linkedlist.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator LinkedList(A: Class, B: Class, cascadeDelete:bool = false,
+transformer LinkedList(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "", pluralB = "") {
   if pluralB == "" {
     pluralB = "$B_s"

builtin/onetoone.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator OneToOne(A: Class, B: Class, cascadeDelete:bool = false,
+transformer OneToOne(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "") {
   prependcode A {
     self.$labelB$B = null(B)

builtin/taillinked.rn

@@ -12,7 +12,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-generator TailLinked(A: Class, B: Class, cascadeDelete:bool = false,
+transformer TailLinked(A: Class, B: Class, cascadeDelete:bool = false,
     labelA: string = "", labelB: string = "", pluralB = "") {
   if pluralB == "" {
     pluralB = "$B_s"

database/Rune.dd

@@ -30,7 +30,7 @@ enum StatementType
   DE_STATEMENT_PRINT  // print "Hello, World!\n"
   DE_STATEMENT_THROW
   DE_STATEMENT_RETURN
-  DE_STATEMENT_GENERATE
+  DE_STATEMENT_TRANSFORM
   DE_STATEMENT_RELATION
   DE_STATEMENT_APPENDCODE
   DE_STATEMENT_PREPENDCODE
@@ -40,7 +40,7 @@ enum StatementType
   DE_STATEMENT_IMPORTRPC
   DE_STATEMENT_FOREACH
   DE_STATEMENT_YIELD
-  DE_STATEMENT_REF  // These two are used by generators to manage reference counts.
+  DE_STATEMENT_REF  // These two are used by transformers to manage reference counts.
   DE_STATEMENT_UNREF
 
 enum ExpressionType
@@ -154,7 +154,7 @@ enum DatatypeType
   DE_TYPE_STRUCT
   DE_TYPE_ENUM
   DE_TYPE_ENUMCLASS
-  DE_TYPE_EXPR  // Only used to pass expression values to generators.
+  DE_TYPE_EXPR  // Only used to pass expression values to transformers.
 
 enum IdentType
   DE_IDENT_FUNCTION
@@ -176,7 +176,7 @@ enum FunctionType
   DE_FUNC_FINAL
   DE_FUNC_STRUCT
   DE_FUNC_ENUM
-  DE_FUNC_GENERATOR
+  DE_FUNC_TRANSFORMER
   DE_FUNC_UNITTEST
 
 enum BlockType
@@ -313,8 +313,8 @@ class Function
   bool Extern  // Provided by an external library or RPC.
   ExpressionType opType  // For functions that overload operators.
 
-// A code generator definition.
-class Generator
+// A code transformer definition.
+class Transformer
   Line line
 
 class Variable
@@ -330,12 +330,12 @@ class Variable
   bool initializedAtTop
   bool inTemplateSignature
   sym savedName
-  Value value cascade  // Used in generation.
+  Value value cascade  // Used in code transforms.
   bool generated  // We don't reference count via generated variables.
   uint32 entryValue  // Set for variables representing enum entries.
   Datatype savedDatatype  // Used in matching overloaded operators.
 
-// Used during generation to compute expression values.  May also get used for constant propagation.
+// Used by code transoforms to compute expression values.  May also get used for constant propagation.
 class Value
   DatatypeType type
   Variable variable
@@ -355,7 +355,7 @@ class Statement
   Line line
   bool instantiated
   bool executed  // Only for relation statements, so we don't execute them twice.
-  bool generated  // This statement was generated by a generator.
+  bool generated  // This statement was generated by a transformer.
   bool isFirstAssignment  // True if this is the first assignment to a variable, at top level.
 
 // Hash table bins for data types.
@@ -447,7 +447,7 @@ class Binding
 // that are blocked on this event.  These events take certain forms:  A
 // signature has been bound, a module's global variable has been assigned a
 // non-null type, or a local variable in a class or function as been bound to
-// non-null type.  Sometimes a code generator runs and creates an identifier
+// non-null type.  Sometimes a code transformer runs and creates an identifier
 // that was previously undefined.
 class Event
   EventType type
@@ -521,7 +521,7 @@ relationship Template Class doubly_linked mandatory
 relationship Class:Owning Block:Sub cascade
 relationship Function:Owning Block:Sub cascade
 relationship Function:Type Expression:Type cascade
-relationship Function Generator cascade
+relationship Function Transformer cascade
 relationship Statement:Owning Block:Sub cascade
 relationship Statement Expression cascade
 relationship Expression Expression doubly_linked cascade
@@ -534,7 +534,7 @@ relationship Template:Parent Relation:Child doubly_linked mandatory
 relationship Template:Child Relation:Parent doubly_linked mandatory
 relationship Relation:Generated Statement:Generated doubly_linked cascade
 relationship Relation:Generated Function:Generated doubly_linked cascade
-relationship Generator Relation doubly_linked mandatory
+relationship Transformer Relation doubly_linked mandatory
 relationship Variable MemberRel mandatory
 relationship Class:Parent MemberRel:Child doubly_linked mandatory
 relationship Class:Child MemberRel:Parent doubly_linked mandatory

database/block.c

@@ -293,7 +293,7 @@ static void updateReachability(deStatement statement, bool* canContinue, bool* c
     case DE_STATEMENT_APPENDCODE:
     case DE_STATEMENT_PREPENDCODE:
     case DE_STATEMENT_RELATION:
-    case DE_STATEMENT_GENERATE:
+    case DE_STATEMENT_TRANSFORM:
       utExit("Unexpected statement type");
       break;
   }