The GC Mutator Scheme language is used to test garbage collectors written with the GC Collector Scheme language. Since collectors support a subset of Scheme’s values, the GC Mutator Scheme language supports a subset of procedures and syntax. In addition, many procedures that can be written in the mutator are omitted as they make good test cases. Therefore, the mutator language provides only primitive procedures, such as +, cons, etc.
The first expression of a mutator must be:
The rest of a mutator module is a sequence of definitions, expressions and test cases. The GC Mutator Scheme language transforms these definitions and statements to use the collector specified in allocator-setup. In particular, many of the primitive forms, such as cons map directly to procedures such as gc:cons, written in the collector.
The GC Mutator Scheme language supports the following syntactic forms:
The language also defines the following procedures:
|add1 sub1 zero? + - * / even? odd? = < > <= >= cons first rest
|set-first! set-rest! cons? symbol? symbol=? number? boolean? empty? eq?
Other common procedures are left undefined as they can be defined in terms of the primitives and may be used to test collectors.
Additional procedures from scheme may be imported with:
|(import-primitives id ...)
For example, the GC Mutator Scheme language does not define modulo:
|(test/value=? (modulo 5 3) 2)
GC Mutator Scheme provides two forms for testing mutators:
|(test/location=? mutator-expr1 mutator-expr2)
|(test/value=? mutator-expr scheme-datum/quoted)
|(printf format mutator-expr ...)
This PLAI library provides a facility for generating random mutators, in order to test your garbage collection implementation.
|file : path-string?
|collector-name : string?
|iterations : exact-positive-integer? = 200
|program-size : exact-positive-integer? = 10
|heap-size : exact-positive-integer? = 100
The mutator is created by first making a random graph whose nodes either have no outgoing edges, two outgoing edges, or some random number of outgoing edges and then picking a random path in the graph that ends at one of the nodes with no edges.
This graph and path are then turned into a PLAI program by creating a let expression that binds one variable per node in the graph. If the node has no outgoing edges, it is bound to a heap-value?. If the node has two outgoing edges, it is bound to a pair and the two edges are put into the first and rest fields. Otherwise, the node is represented as a procedure that accepts an integer index and returns the destination node of the corresponding edge.
Once the let expression has been created, the program creates a bunch of garbage and then traverses the graph, according to the randomly created path. If the result of the path is the expected heap value, the program does this again, up to iterations times. If the result of the path is not the expected heap value, the program terminates with an error.
Elements from the heap-values argument are used as the base values when creating nodes with no outgoing edges. See also find-heap-values.
The iterations argument controls how many times the graph is created (and traversed).
The program-size argument is a bound on how big the program it is; it limits the number of nodes, the maximum number of edges, and the length of the path in the graph.
The heap-size argument controls the size of the heap in the generated mutator.
If input is a port, its contents are assumed to be a well-formed PLAI program. If input is a file, the contents of the file are used.