Diff [5541ea3d192c866061ad89a360daabc4e33e3429:0640189e9e66678dab5d7f80793687fa10ff24c3] for / – Cforall

doc/theses/andrew_beach_MMath/code/ThrowFinally.java

-              r5541ea3d
+              r0640189e
                         throws EmptyException {
                 if (0 < frames) {
+                        try {
+                                unwind_finally(frames - 1);
+                        } finally {
+                                // ...
+                        }
+                        unwind_finally(frames - 1);
                 } else {
                         throw new EmptyException();

doc/theses/andrew_beach_MMath/code/ThrowOther.java

-              r5541ea3d
+              r0640189e
                                 // ...
+                        }
-                } else if (should_throw) {
-                        throw new NotRaisedException();
                 } else {
+                        if (should_throw) {
+                                throw new NotRaisedException();
+                        }
                         throw new EmptyException();
+                }

doc/theses/andrew_beach_MMath/code/cond-catch.cfa

r5541ea3d	r0640189e
19	19	throw_exception();
20	20	} catch (empty_exception * exc ; should_catch) {
21		~~asm volatile ("# catch block (conditional)");~~
	21	// ...
22	22	}
23	23	}
…	…
37	37	cond_catch();
38	38	} catch (empty_exception * exc) {
39		~~asm volatile ("# catch block (unconditional)");~~
	39	// ...
40	40	}
41	41	}

doc/theses/andrew_beach_MMath/code/cond-catch.cpp

r5541ea3d	r0640189e
22	22	throw;
23	23	}
24		~~asm volatile ("# catch block (conditional)");~~
25	24	}
26	25	}
…	…
40	39	cond_catch();
41	40	} catch (EmptyException &) {
42		~~asm volatile ("# catch block (unconditional)");~~
	41	// ...
43	42	}
44	43	}

doc/theses/andrew_beach_MMath/code/cond-fixup.cfa

r5541ea3d	r0640189e
12	12
13	13	void throw_exception() {
14		throw~~Resume~~ (empty_exception){&empty_vt};
	14	throw (empty_exception){&empty_vt};
15	15	}
16	16
…	…
18	18	try {
19	19	throw_exception();
20		} catch~~Resume~~ (empty_exception * exc ; should_catch) {
21		~~asm volatile ("# fixup block (conditional)");~~
	20	} catch (empty_exception * exc ; should_catch) {
	21	// ...
22	22	}
23	23	}
…	…
36	36	try {
37	37	cond_catch();
38		} catch~~Resume~~ (empty_exception * exc) {
39		~~asm volatile ("# fixup block (unconditional)");~~
	38	} catch (empty_exception * exc) {
	39	// ...
40	40	}
41	41	}

doc/theses/andrew_beach_MMath/code/cross-catch.cfa

-              r5541ea3d
+              r0640189e
 EHM_EXCEPTION(not_raised_exception)();
-EHM_VIRTUAL_TABLE(not_raised_exception, not_vt);
 int main(int argc, char * argv[]) {
         unsigned int times = 1;
         volatile bool should_throw = false;
+        unsigned int total_frames = 1;
         if (1 < argc) {
                 times = strtol(argv[1], 0p, 10);
+        }
+        if (2 < argc) {
+                total_frames = strtol(argv[2], 0p, 10);
+        }
 …
         for (unsigned int count = 0 ; count < times ; ++count) {
                 try {
+                        asm volatile ("# try block");
+                        if (should_throw) {
+                                throw (not_raised_exception){&not_vt};
+                        }
+                        // ...
                 } catch (not_raised_exception *) {
                         asm volatile ("# catch block");
+                        // ...
+                }
+        }

doc/theses/andrew_beach_MMath/code/cross-catch.cpp

-              r5541ea3d
+              r0640189e
 int main(int argc, char * argv[]) {
         unsigned int times = 1;
-        volatile bool should_throw = false;
         if (1 < argc) {
                 times = strtol(argv[1], nullptr, 10);
 …
         for (unsigned int count = 0 ; count < times ; ++count) {
                 try {
+                        asm volatile ("# try block");
+                        if (should_throw) {
+                                throw NotRaisedException();
+                        }
+                        // ...
                 } catch (NotRaisedException &) {
                         asm volatile ("# catch block");
+                        // ...
+                }
+        }

doc/theses/andrew_beach_MMath/code/cross-finally.cfa

-              r5541ea3d
+              r0640189e
 #include <stdlib.hfa>
-EHM_EXCEPTION(not_raised_exception)();
-EHM_VIRTUAL_TABLE(not_raised_exception, not_vt);
 int main(int argc, char * argv[]) {
         unsigned int times = 1;
         volatile bool should_throw = false;
+        unsigned int total_frames = 1;
         if (1 < argc) {
                 times = strtol(argv[1], 0p, 10);
+        }
+        if (2 < argc) {
+                total_frames = strtol(argv[2], 0p, 10);
+        }
         Time start_time = timeHiRes();
         for (unsigned int count = 0 ; count < times ; ++count) {
+                try {
+                        asm volatile ("# try block");
+                        if (should_throw) {
+                                throw (not_raised_exception){&not_vt};
+                        }
+                 try {
+                        // ...
                 } finally {
                         asm volatile ("# finally block");
+                        // ...
+                }
+        }

doc/theses/andrew_beach_MMath/code/cross-resume.cfa

-              r5541ea3d
+              r0640189e
         for (unsigned int count = 0 ; count < times ; ++count) {
                 try {
                         asm volatile ("");
+                        // ...
                 } catchResume (not_raised_exception *) {
                         asm volatile ("");
+                        // ...
+                }
+        }

doc/theses/andrew_beach_MMath/code/resume-detor.cfa

-              r5541ea3d
+              r0640189e
 void ^?{}(WithDestructor & this) {
+        asm volatile ("# destructor body");
+    // ...
+}
 void unwind_destructor(unsigned int frames) {
         if (frames) {
+    if (frames) {
                 WithDestructor object;
                 unwind_destructor(frames - 1);
         } else {
                 throwResume (empty_exception){&empty_vt};
+        }
+        WithDestructor object;
+        unwind_destructor(frames - 1);
+    } else {
+        throwResume (empty_exception){&empty_vt};
+    }
+}
 …
         Time start_time = timeHiRes();
         for (int count = 0 ; count < times ; ++count) {
                 try {
                         unwind_destructor(total_frames);
                 } catchResume (empty_exception *) {
+                        asm volatile ("# fixup block");
+                }
+        }
+    for (int count = 0 ; count < times ; ++count) {
+        try {
+            unwind_destructor(total_frames);
+        } catchResume (empty_exception *) {
+            // ...
+        }
+    }
         Time end_time = timeHiRes();
         sout | "Run-Time (ns): " | (end_time - start_time)`ns;

doc/theses/andrew_beach_MMath/code/resume-empty.cfa

r5541ea3d	r0640189e
13	13	unwind_empty(frames - 1);
14	14	} else {
15		throw~~Resume~~ (empty_exception){&empty_vt};
	15	throw (empty_exception){&empty_vt};
16	16	}
17	17	}
…	…
31	31	try {
32	32	unwind_empty(total_frames);
33		} catch~~Resume~~ (empty_exception *) {
34		~~asm volatile ("# fixup block");~~
	33	} catch (empty_exception *) {
	34	// ...
35	35	}
36	36	}

doc/theses/andrew_beach_MMath/code/resume-finally.cfa

r5541ea3d	r0640189e
14	14	unwind_finally(frames - 1);
15	15	} finally {
16		~~asm volatile ("# finally block");~~
	16	// ...
17	17	}
18	18	} else {
…	…
36	36	unwind_finally(total_frames);
37	37	} catchResume (empty_exception *) {
38		~~asm volatile ("# fixup block");~~
	38	// ...
39	39	}
40	40	}

doc/theses/andrew_beach_MMath/code/resume-other.cfa

r5541ea3d	r0640189e
16	16	unwind_other(frames - 1);
17	17	} catchResume (not_raised_exception *) {
18		~~asm volatile ("# fixup block (stack)");~~
	18	// ...
19	19	}
20	20	} else {
…	…
38	38	unwind_other(total_frames);
39	39	} catchResume (empty_exception *) {
40		~~asm volatile ("# fixup block (base)");~~
	40	// ...
41	41	}
42	42	}

doc/theses/andrew_beach_MMath/code/test.sh

-              r5541ea3d
+              r0640189e
 #!/usr/bin/env bash
+# Usage:
+# test.sh LANGUAGE TEST
+#   Run the TEST in LANGUAGE.
+# test.sh -b SOURCE_FILE...
+#   Build a test from SOURCE_FILE(s).
+# test.sh -v LANGUAGE TEST FILE
+#   View the result from TEST in LANGUAGE stored in FILE.
+# Usage: LANGUAGE TEST | -b SOURCE_FILE
 readonly ITERATIONS=1000000 # 1 000 000, one million
 …
         done
         exit 0
-elif [ "-v" = "$1" -a 4 = "$#" ]; then
-    TEST_LANG="$2"
-    TEST_CASE="$3"
-    VIEW_FILE="$4"
 elif [ 2 -eq "$#" ]; then
         TEST_LANG="$1"
 …
 case "$TEST_LANG" in
 cfa-t) CALL="$CFAT";;
 cfa-r) CALL="$CFAR";;
 cpp) CALL="$CPP";;
 java) CALL="$JAVA";;
 python) CALL="$PYTHON";;
+cfa-t) echo $CFAT; $CFAT;;
+cfa-r) echo $CFAR; $CFAR;;
+cpp) echo $CPP; $CPP;;
+java) echo $JAVA; $JAVA;;
+python) echo $PYTHON; $PYTHON;;
 *)
         echo "No such language: $TEST_LANG" >&2
 …
         ;;
 esac
-echo $CALL
-if [ -n "$VIEW_FILE" ]; then
-    grep -A 1 -B 0 "$CALL" "$VIEW_FILE" | sed -n -e 's!Run-Time (ns): !!;T;p'
-    exit
-fi
-$CALL

doc/theses/andrew_beach_MMath/code/throw-detor.cfa

r5541ea3d	r0640189e
12	12
13	13	void ^?{}(WithDestructor & this) {
14		~~asm volatile ("# destructor body");~~
	14	// ...
15	15	}
16	16
…	…
39	39	unwind_destructor(total_frames);
40	40	} catch (empty_exception *) {
41		~~asm volatile ("# catch block");~~
	41	// ...
42	42	}
43	43	}

doc/theses/andrew_beach_MMath/code/throw-detor.cpp

-              r5541ea3d
+              r0640189e
 struct WithDestructor {
+        ~WithDestructor() {
+                asm volatile ("# destructor body");
+        }
+        ~WithDestructor() {}
 };
 …
                         unwind_destructor(total_frames);
                 } catch (EmptyException &) {
                         asm volatile ("# catch block");
+                        // ...
+                }
+        }

doc/theses/andrew_beach_MMath/code/throw-empty.cfa

r5541ea3d	r0640189e
32	32	unwind_empty(total_frames);
33	33	} catch (empty_exception *) {
34		~~asm volatile ("# catch block");~~
	34	// ...
35	35	}
36	36	}

doc/theses/andrew_beach_MMath/code/throw-empty.cpp

r5541ea3d	r0640189e
32	32	unwind_empty(total_frames);
33	33	} catch (EmptyException &) {
34		~~asm volatile ("# catch block");~~
	34	// ...
35	35	}
36	36	}

doc/theses/andrew_beach_MMath/code/throw-finally.cfa

r5541ea3d	r0640189e
14	14	unwind_finally(frames - 1);
15	15	} finally {
16		~~asm volatile ("# finally block");~~
	16	// ...
17	17	}
18	18	} else {
…	…
36	36	unwind_finally(total_frames);
37	37	} catch (empty_exception *) {
38		~~asm volatile ("# catch block");~~
	38	// ...
39	39	}
40	40	}

doc/theses/andrew_beach_MMath/code/throw-other.cfa

r5541ea3d	r0640189e
16	16	unwind_other(frames - 1);
17	17	} catch (not_raised_exception *) {
18		~~asm volatile ("# catch block (stack)");~~
	18	// ...
19	19	}
20	20	} else {
…	…
38	38	unwind_other(total_frames);
39	39	} catch (empty_exception *) {
40		~~asm volatile ("# catch block (base)");~~
	40	// ...
41	41	}
42	42	}

doc/theses/andrew_beach_MMath/code/throw-other.cpp

r5541ea3d	r0640189e
16	16	unwind_other(frames - 1);
17	17	} catch (NotRaisedException &) {
18		~~asm volatile ("# catch block (stack)");~~
	18	// ...
19	19	}
20	20	} else {
…	…
38	38	unwind_other(total_frames);
39	39	} catch (EmptyException &) {
40		~~asm volatile ("# catch block (base)");~~
	40	// ...
41	41	}
42	42	}

doc/theses/andrew_beach_MMath/existing.tex

-              r5541ea3d
+              r0640189e
 Only those \CFA features pertaining to this thesis are discussed.
+% Also, only new features of \CFA will be discussed,
+A familiarity with
+Also, only new features of \CFA will be discussed, a familiarity with
 C or C-like languages is assumed.
 …
 \CFA has extensive overloading, allowing multiple definitions of the same name
 to be defined~\cite{Moss18}.
 \begin{lstlisting}[language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
 char @i@; int @i@; double @i@;
 int @f@(); double @f@();
 void @g@( int ); void @g@( double );
 \end{lstlisting}
+\begin{cfa}
+char i; int i; double i;
+int f(); double f();
+void g( int ); void g( double );
+\end{cfa}
 This feature requires name mangling so the assembly symbols are unique for
 different overloads. For compatibility with names in C, there is also a syntax
 …
 int && rri = ri;
 rri = 3;
 &ri = &j; // rebindable
+&ri = &j;
 ri = 5;
 \end{cfa}
 …
 \end{minipage}
 References are intended for pointer situations where dereferencing is the common usage,
 \ie the value is more important than the pointer.
+References are intended to be used when you would use pointers but would
+be dereferencing them (almost) every usage.
 Mutable references may be assigned to by converting them to a pointer
 with a @&@ and then assigning a pointer to them, as in @&ri = &j;@ above
 …
 \section{Operators}
 \CFA implements operator overloading by providing special names, where
 operator usages are translated into function calls using these names.
 An operator name is created by taking the operator symbols and joining them with
+\CFA implements operator overloading by providing special names.
+Operator uses are translated into function calls using these names.
+These names are created by taking the operator symbols and joining them with
 @?@s to show where the arguments go.
 For example,
 infixed multiplication is @?*?@, while prefix dereference is @*?@.
+infixed multiplication is @?*?@ while prefix dereference is @*?@.
 This syntax make it easy to tell the difference between prefix operations
 (such as @++?@) and post-fix operations (@?++@).
+For example, plus and equality operators are defined for a point type.
 \begin{cfa}
 point ?+?(point a, point b) { return point{a.x + b.x, a.y + b.y}; }
 int ?==?(point a, point b) { return a.x == b.x && a.y == b.y; }
+bool ?==?(point a, point b) { return a.x == b.x && a.y == b.y; }
+{
         assert(point{1, 2} + point{3, 4} == point{4, 6});
+}
 \end{cfa}
+Note these special names are not limited to builtin
+operators, and hence, may be used with arbitrary types.
+\begin{cfa}
+double ?+?( int x, point y ); // arbitrary types
+\end{cfa}
+% Some ``near misses", that are that do not match an operator form but looks like
+% it may have been supposed to, will generate warning but otherwise they are
+% left alone.
+Note that these special names are not limited to just being used for these
+operator functions, and may be used name other declarations.
+Some ``near misses", that will not match an operator form but looks like
+it may have been supposed to, will generate wantings but otherwise they are
+left alone.
+%\subsection{Constructors and Destructors}
+Both constructors and destructors are operators, which means they are
+functions with special operator names rather than type names in \Cpp. The
+special operator names may be used to call the functions explicitly.
+% Placement new means that this is actually equivant to C++.
+The special name for a constructor is @?{}@, which comes from the
+initialization syntax in C, \eg @Example e = { ... }@.
+\CFA will generate a constructor call each time a variable is declared,
+passing the initialization arguments to the constructort.
+\begin{cfa}
+struct Example { ... };
+void ?{}(Example & this) { ... }
+{
+        Example a;
+        Example b = {};
+}
+void ?{}(Example & this, char first, int num) { ... }
+{
+        Example c = {'a', 2};
+}
+\end{cfa}
+Both @a@ and @b@ will be initalized with the first constructor,
+while @c@ will be initalized with the second.
+Currently, there is no general way to skip initialation.
+% I don't like the \^{} symbol but $^\wedge$ isn't better.
+Similarly destructors use the special name @^?{}@ (the @^@ has no special
+meaning).
+These are a normally called implicitly called on a variable when it goes out
+of scope. They can be called explicitly as well.
+\begin{cfa}
+void ^?{}(Example & this) { ... }
+{
+        Example d;
+} // <- implicit destructor call
+\end{cfa}
+Whenever a type is defined, \CFA will create a default zero-argument
+constructor, a copy constructor, a series of argument-per-field constructors
+and a destructor. All user constructors are defined after this.
 Because operators are never part of the type definition they may be added
 at any time, including on built-in types.
-%\subsection{Constructors and Destructors}
-\CFA also provides constructors and destructors as operators, which means they
-are functions with special operator names rather than type names in \Cpp.
-While constructors and destructions are normally called implicitly by the compiler,
-the special operator names, allow explicit calls.
-% Placement new means that this is actually equivalent to C++.
-The special name for a constructor is @?{}@, which comes from the
-initialization syntax in C, \eg @Example e = { ... }@.
-\CFA generates a constructor call each time a variable is declared,
-passing the initialization arguments to the constructor.
-\begin{cfa}
-struct Example { ... };
-void ?{}(Example & this) { ... }
-void ?{}(Example & this, char first, int num) { ... }
-Example a;              // implicit constructor calls
-Example b = {};
-Example c = {'a', 2};
-\end{cfa}
-Both @a@ and @b@ are initialized with the first constructor,
-while @c@ is initialized with the second.
-Constructor calls can be replaced with C initialization using special operator \lstinline{@=}.
-\begin{cfa}
-Example d @= {42};
-\end{cfa}
-% I don't like the \^{} symbol but $^\wedge$ isn't better.
-Similarly, destructors use the special name @^?{}@ (the @^@ has no special
-meaning).
-% These are a normally called implicitly called on a variable when it goes out
-% of scope. They can be called explicitly as well.
-\begin{cfa}
-void ^?{}(Example & this) { ... }
+{
-        Example e;      // implicit constructor call
-        ^?{}(e);                // explicit destructor call
-        ?{}(e);         // explicit constructor call
-} // implicit destructor call
-\end{cfa}
-Whenever a type is defined, \CFA creates a default zero-argument
-constructor, a copy constructor, a series of argument-per-field constructors
-and a destructor. All user constructors are defined after this.
 \section{Polymorphism}
 …
 Note, a function named @do_once@ is not required in the scope of @do_twice@ to
 compile it, unlike \Cpp template expansion. Furthermore, call-site inferencing
 allows local replacement of the specific parametric functions needs for a
+allows local replacement of the most specific parametric functions needs for a
 call.
 \begin{cfa}
 …
 to @do_twice@ and called within it.
 The global definition of @do_once@ is ignored, however if quadruple took a
 @double@ argument, then the global definition would be used instead as it
 is a better match.
+@double@ argument then the global definition would be used instead as it
+would be a better match.
 % Aaron's thesis might be a good reference here.
 To avoid typing long lists of assertions, constraints can be collect into
 convenient package called a @trait@, which can then be used in an assertion
+convenient packages called a @trait@, which can then be used in an assertion
 instead of the individual constraints.
 \begin{cfa}
 …
 functionality, like @sumable@, @listable@, \etc.
 Polymorphic structures and unions are defined by qualifying an aggregate type
+Polymorphic structures and unions are defined by qualifying the aggregate type
 with @forall@. The type variables work the same except they are used in field
 declarations instead of parameters, returns, and local variable declarations.
 …
 coroutine CountUp {
         unsigned int next;
 };
+}
 CountUp countup;
-for (10) sout | resume(countup).next; // print 10 values
 \end{cfa}
 Each coroutine has a @main@ function, which takes a reference to a coroutine
 object and returns @void@.
 %[numbers=left] Why numbers on this one?
 \begin{cfa}[numbers=left,numberstyle=\scriptsize\sf]
+\begin{cfa}
 void main(CountUp & this) {
         for (unsigned int up = 0;; ++up) {
                 this.next = up;
+        for (unsigned int next = 0 ; true ; ++next) {
+                next = up;
                 suspend;$\label{suspend}$
+        }
 …
 \end{cfa}
 In this function, or functions called by this function (helper functions), the
 @suspend@ statement is used to return execution to the coroutine's resumer
 without terminating the coroutine's function(s).
+@suspend@ statement is used to return execution to the coroutine's caller
+without terminating the coroutine's function.
 A coroutine is resumed by calling the @resume@ function, \eg @resume(countup)@.
 …
 exclusion on a monitor object by qualifying an object reference parameter with
 @mutex@.
 \begin{lstlisting}[language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
 void example(MonitorA & @mutex@ argA, MonitorB & @mutex@ argB);
 \end{lstlisting}
+\begin{cfa}
+void example(MonitorA & mutex argA, MonitorB & mutex argB);
+\end{cfa}
 When the function is called, it implicitly acquires the monitor lock for all of
 the mutex parameters without deadlock.  This semantics means all functions with
 …
+{
         StringWorker stringworker; // fork thread running in "main"
 } // implicitly join with thread / wait for completion
+} // <- implicitly join with thread / wait for completion
 \end{cfa}
 The thread main is where a new thread starts execution after a fork operation

doc/theses/andrew_beach_MMath/intro.tex

-              r5541ea3d
+              r0640189e
 % The highest level overview of Cforall and EHMs. Get this done right away.
 This thesis covers the design and implementation of the exception handling
+This thesis goes over the design and implementation of the exception handling
 mechanism (EHM) of
 \CFA (pronounced sea-for-all and may be written Cforall or CFA).
 \CFA is a new programming language that extends C, which maintains
+\CFA is a new programming language that extends C, that maintains
 backwards-compatibility while introducing modern programming features.
 Adding exception handling to \CFA gives it new ways to handle errors and
 make large control-flow jumps.
+make other large control-flow jumps.
 % Now take a step back and explain what exceptions are generally.
-A language's EHM is a combination of language syntax and run-time
-components that are used to construct, raise, and handle exceptions,
-including all control flow.
-Exceptions are an active mechanism for replacing passive error/return codes and return unions (Go and Rust).
 Exception handling provides dynamic inter-function control flow.
 There are two forms of exception handling covered in this thesis:
 termination, which acts as a multi-level return,
 and resumption, which is a dynamic function call.
-% PAB: Maybe this sentence was suppose to be deleted?
 Termination handling is much more common,
+to the extent that it is often seen as the only form of handling.
+% PAB: I like this sentence better than the next sentence.
+% This separation is uncommon because termination exception handling is so
+% much more common that it is often assumed.
+to the extent that it is often seen
+This seperation is uncommon because termination exception handling is so
+much more common that it is often assumed.
 % WHY: Mention other forms of continuation and \cite{CommonLisp} here?
+Exception handling relies on the concept of nested functions to create handlers that deal with exceptions.
+A language's EHM is the combination of language syntax and run-time
+components that are used to construct, raise and handle exceptions,
+including all control flow.
+Termination exception handling allows control to return to any previous
+function on the stack directly, skipping any functions between it and the
+current function.
 \begin{center}
+\begin{tabular}[t]{ll}
+\begin{lstlisting}[aboveskip=0pt,belowskip=0pt,language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
+void f( void (*hp)() ) {
+        hp();
+}
+void g( void (*hp)() ) {
+        f( hp );
+}
+void h( int @i@, void (*hp)() ) {
+        void @handler@() { // nested
+                printf( "%d\n", @i@ );
+        }
+        if ( i == 1 ) hp = handler;
+        if ( i > 0 ) h( i - 1, hp );
+        else g( hp );
+}
+h( 2, 0 );
+\end{lstlisting}
+&
+\raisebox{-0.5\totalheight}{\input{handler}}
+\end{tabular}
+\input{callreturn}
 \end{center}
+The nested function @handler@ in the second stack frame is explicitly passed to function @f@.
+When this handler is called in @f@, it uses the parameter @i@ in the second stack frame, which is accessible by an implicit lexical-link pointer.
+Setting @hp@ in @h@ at different points in the recursion, results in invoking a different handler.
+Exception handling extends this idea by eliminating explicit handler passing, and instead, performing a stack search for a handler that matches some criteria (conditional dynamic call), and calls the handler at the top of the stack.
+It is the runtime search $O(N)$ that differentiates an EHM call (raise) from normal dynamic call $O(1)$ via a function or virtual-member pointer.
+Termination exception handling searches the stack for a handler, unwinds the stack to the frame containing the matching handler, and calling the handler at the top of the stack.
+\begin{center}
+\input{termination}
+\end{center}
+Note, since the handler can reference variables in @h@, @h@ must remain on the stack for the handler call.
+After the handler returns, control continues after the lexical location of the handler in @h@ (static return)~\cite[p.~108]{Tennent77}.
+Unwinding allows recover to any previous
+function on the stack, skipping any functions between it and the
+function containing the matching handler.
+Resumption exception handling searches the stack for a handler, does \emph{not} unwind the stack to the frame containing the matching handler, and calls the handler at the top of the stack.
+\begin{center}
+\input{resumption}
+\end{center}
+After the handler returns, control continues after the resume in @f@ (dynamic return).
+Not unwinding allows fix up of the problem in @f@ by any previous function on the stack, without disrupting the current set of stack frames.
+Resumption exception handling seaches the stack for a handler and then calls
+it without adding or removing any other stack frames.
+\todo{Add a diagram showing control flow for resumption.}
 Although a powerful feature, exception handling tends to be complex to set up
 and expensive to use
 so it is often limited to unusual or ``exceptional" cases.
 The classic example is error handling, where exceptions are used to
 remove error handling logic from the main execution path, while paying
+so they are often limited to unusual or ``exceptional" cases.
+The classic example of this is error handling, exceptions can be used to
+remove error handling logic from the main execution path and while paying
 most of the cost only when the error actually occurs.
 …
 some of the underlying tools used to implement and express exception handling
 in other languages are absent in \CFA.
 Still the resulting basic syntax resembles that of other languages:
 \begin{lstlisting}[language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
 @try@ {
+Still the resulting syntax resembles that of other languages:
+\begin{cfa}
+try {
         ...
         T * object = malloc(request_size);
         if (!object) {
                 @throw@ OutOfMemory{fixed_allocation, request_size};
+                throw OutOfMemory{fixed_allocation, request_size};
+        }
         ...
 } @catch@ (OutOfMemory * error) {
+} catch (OutOfMemory * error) {
         ...
+}
+\end{lstlisting}
+\end{cfa}
 % A note that yes, that was a very fast overview.
 The design and implementation of all of \CFA's EHM's features are
 …
 % The current state of the project and what it contributes.
+The majority of the \CFA EHM is implemented in \CFA, except for a small amount of assembler code.
+In addition,
+a suite of tests and performance benchmarks were created as part of this project.
+The \CFA implementation techniques are generally applicable in other programming
+All of these features have been implemented in \CFA, along with
+a suite of test cases as part of this project.
+The implementation techniques are generally applicable in other programming
 languages and much of the design is as well.
+Some parts of the EHM use features unique to \CFA, and hence,
+are harder to replicate in other programming languages.
+Some parts of the EHM use other features unique to \CFA and these would be
+harder to replicate in other programming languages.
 % Talk about other programming languages.
+Three well known programming languages with EHMs, %/exception handling
+C++, Java and Python are examined in the performance work. However, these languages focus on termination
+exceptions, so there is no comparison with resumption.
+Some existing programming languages that include EHMs/exception handling
+include C++, Java and Python. All three examples focus on termination
+exceptions which unwind the stack as part of the
+Exceptions also can replace return codes and return unions.
 The contributions of this work are:
 \begin{enumerate}
 \item Designing \CFA's exception handling mechanism, adapting designs from
 other programming languages, and creating new features.
 \item Implementing stack unwinding for the \CFA EHM, including updating
 the \CFA compiler and run-time environment to generate and execute the EHM code.
 \item Designing and implementing a prototype virtual system.
+other programming languages and the creation of new features.
+\item Implementing stack unwinding and the EHM in \CFA, including updating
+the compiler and the run-time environment.
+\item Designed and implemented a prototype virtual system.
 % I think the virtual system and per-call site default handlers are the only
 % "new" features, everything else is a matter of implementation.
-\item Creating tests and performance benchmarks to compare with EHM's in other languages.
 \end{enumerate}
 %\todo{I can't figure out a good lead-in to the roadmap.}
 The thesis is organization as follows.
 The next section and parts of \autoref{c:existing} cover existing EHMs.
 New \CFA EHM features are introduced in \autoref{c:features},
 covering their usage and design.
 That is followed by the implementation of these features in
+\todo{I can't figure out a good lead-in to the roadmap.}
+The next section covers the existing state of exceptions.
+The existing state of \CFA is also covered in \autoref{c:existing}.
+The new features are introduced in \autoref{c:features},
+which explains their usage and design.
+That is followed by the implementation of those features in
 \autoref{c:implement}.
 Performance results are presented in \autoref{c:performance}.
 Summing up and possibilities for extending this project are discussed in \autoref{c:future}.
+The performance results are examined in \autoref{c:performance}.
+Possibilities to extend this project are discussed in \autoref{c:future}.
 \section{Background}
 \label{s:background}
+Exception handling is a well examined area in programming languages,
+with papers on the subject dating back the 70s~\cite{Goodenough75}.
+Early exceptions were often treated as signals, which carried no information
+except their identity. Ada~\cite{Ada} still uses this system.
+The modern flag-ship for termination exceptions is \Cpp,
+Exception handling is not a new concept,
+with papers on the subject dating back 70s.
+Their were popularised by \Cpp,
 which added them in its first major wave of non-object-orientated features
 in 1990.
 % https://en.cppreference.com/w/cpp/language/history
+While many EHMs have special exception types,
+\Cpp has the ability to use any type as an exception.
+However, this generality is not particularly useful, and has been pushed aside for classes, with a convention of inheriting from
+\code{C++}{std::exception}.
+While \Cpp has a special catch-all syntax @catch(...)@, there is no way to discriminate its exception type, so nothing can
+be done with the caught value because nothing is known about it.
+Instead the base exception-type \code{C++}{std::exception} is defined with common functionality (such as
+the ability to print a message when the exception is raised but not caught) and all
+exceptions have this functionality.
+Having a root exception-type seems to be the standard now, as the guaranteed functionality is worth
+any lost in flexibility from limiting exceptions types to classes.
+Java~\cite{Java} was the next popular language to use exceptions.
+Its exception system largely reflects that of \Cpp, except it requires
+exceptions to be a subtype of \code{Java}{java.lang.Throwable}
+and it uses checked exceptions.
+Checked exceptions are part of a function's interface defining all exceptions it or its called functions raise.
+Using this information, it is possible to statically verify if a handler exists for all raised exception, \ie no uncaught exceptions.
+Making exception information explicit, improves clarity and
+Java was the next popular language to use exceptions. It is also the most
+popular language with checked exceptions.
+Checked exceptions are part of the function interface they are raised from.
+This includes functions they propogate through, until a handler for that
+type of exception is found.
+This makes exception information explicit, which can improve clarity and
 safety, but can slow down programming.
+For example, programming complexity increases when dealing with high-order methods or an overly specified
+throws clause. However some of the issues are more
+programming annoyances, such as writing/updating many exception signatures after adding or remove calls.
+Java programmers have developed multiple programming ``hacks'' to circumvent checked exceptions negating the robustness it is suppose to provide.
+For example, the ``catch-and-ignore" pattern, where the handler is empty because the exception does not appear relevant to the programmer versus
+repairing or recovering from the exception.
+%\subsection
+Resumption exceptions are less popular,
+although resumption is as old as termination;
+hence, few
+programming languages have implemented them.
+Some of these, such as dealing with high-order methods or an overly specified
+throws clause, are technical. However some of the issues are much more
+human, in that writing/updating all the exception signatures can be enough
+of a burden people will hack the system to avoid them.
+Including the ``catch-and-ignore" pattern where a catch block is used without
+anything to repair or recover from the exception.
+%\subsection
+Resumption exceptions have been much less popular.
+Although resumption has a history as old as termination's, very few
+programming languages have implement them.
 % http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/
 %   CSL-79-3_Mesa_Language_Manual_Version_5.0.pdf
 Mesa~\cite{Mesa} is one programming languages that did. Experience with Mesa
 is quoted as being one of the reasons resumptions are not
+Mesa is one programming languages that did and experiance with that
+languages is quoted as being one of the reasons resumptions were not
 included in the \Cpp standard.
 % https://en.wikipedia.org/wiki/Exception_handling
+As a result, resumption has ignored in main-stream programming languages.
+However, ``what goes around comes around'' and resumption is being revisited now (like user-level threading).
+While rejecting resumption might have been the right decision in the past, there are decades
+of developments in computer science that have changed the situation.
+Some of these developments, such as functional programming's resumption
+equivalent, algebraic effects\cite{Zhang19}, are enjoying significant success.
+A complete reexamination of resumptions is beyond this thesis, but their re-emergence is
+enough to try them in \CFA.
+% Especially considering how much easier they are to implement than
+% termination exceptions.
+%\subsection
+Functional languages tend to use other solutions for their primary EHM,
+but exception-like constructs still appear.
+Termination appears in error construct, which marks the result of an
+expression as an error; thereafter, the result of any expression that tries to use it is also an
+error, and so on until an appropriate handler is reached.
+Resumption appears in algebraic effects, where a function dispatches its
+side-effects to its caller for handling.
+%\subsection
+Some programming languages have moved to a restricted kind of EHM
+called ``panic".
+In Rust~\cite{Rust}, a panic is just a program level abort that may be implemented by
+unwinding the stack like in termination exception handling.
+\todo{A comment about why we did include them when they are so unpopular
+might be approprate.}
+%\subsection
+Functional languages, tend to use solutions like the return union, but some
+exception-like constructs still appear.
+For instance Haskell's built in error mechanism can make the result of any
+expression, including function calls. Any expression that examines an
+error value will in-turn produce an error. This continues until the main
+function produces an error or until it is handled by one of the catch
+functions.
+%\subsection
+More recently exceptions seem to be vanishing from newer programming
+languages.
+Rust and Go reduce this feature to panics.
+Panicing is somewhere between a termination exception and a program abort.
+Notably in Rust a panic can trigger either, a panic may unwind the stack or
+simply kill the process.
 % https://doc.rust-lang.org/std/panic/fn.catch_unwind.html
 In Go~\cite{Go}, a panic is very similar to a termination, except it only supports
+a catch-all by calling \code{Go}{recover()}, simplifying the interface at
 the cost of flexibility.
 %\subsection
+While exception handling's most common use cases are in error handling,
 here are other ways to handle errors with comparisons to exceptions.
+Go's panic is much more similar to a termination exception but there is
+only a catch-all function with \code{Go}{recover()}.
+So exceptions still are appearing, just in reduced forms.
+%\subsection
+Exception handling's most common use cases are in error handling.
+Here are some other ways to handle errors and comparisons with exceptions.
 \begin{itemize}
 \item\emph{Error Codes}:
+This pattern has a function return an enumeration (or just a set of fixed values) to indicate
+if an error occurred and possibly which error it was.
+Error codes mix exceptional and normal values, artificially enlarging the type and/or value range.
+Some languages address this issue by returning multiple values or a tuple, separating the error code from the function result.
+However, the main issue with error codes is forgetting to checking them,
+which leads to an error being quietly and implicitly ignored.
+Some new languages have tools that issue warnings, if the error code is
+discarded to avoid this problem.
+Checking error codes also results in bloating the main execution path, especially if an error is not dealt with locally and has to be cascaded down the call stack to a higher-level function..
+This pattern uses an enumeration (or just a set of fixed values) to indicate
+that an error has occured and which error it was.
+There are some issues if a function wants to return an error code and another
+value. The main issue is that it can be easy to forget checking the error
+code, which can lead to an error being quitely and implicitly ignored.
+Some new languages have tools that raise warnings if the return value is
+discarded to avoid this.
+It also puts more code on the main execution path.
 \item\emph{Special Return with Global Store}:
+Some functions only return a boolean indicating success or failure
+and store the exact reason for the error in a fixed global location.
+For example, many C routines return non-zero or -1, indicating success or failure,
+and write error details into the C standard variable @errno@.
+This approach avoids the multiple results issue encountered with straight error codes
+but otherwise has many (if not more) of the disadvantages.
+For example, everything that uses the global location must agree on all possible errors and global variable are unsafe with concurrency.
+A function that encounters an error returns some value indicating that it
+encountered a value but store which error occured in a fixed global location.
+Perhaps the C standard @errno@ is the most famous example of this,
+where some standard library functions will return some non-value (often a
+NULL pointer) and set @errno@.
+This avoids the multiple results issue encountered with straight error codes
+but otherwise many of the same advantages and disadvantages.
+It does however introduce one other major disadvantage:
+Everything that uses that global location must agree on all possible errors.
 \item\emph{Return Union}:
 This pattern replaces error codes with a tagged union.
+Replaces error codes with a tagged union.
 Success is one tag and the errors are another.
 It is also possible to make each possible error its own tag and carry its own
 …
 so that one type can be used everywhere in error handling code.
 This pattern is very popular in functional or any semi-functional language with
 primitive support for tagged unions (or algebraic data types).
+This pattern is very popular in functional or semi-functional language,
+anything with primitive support for tagged unions (or algebraic data types).
 % We need listing Rust/rust to format code snipits from it.
 % Rust's \code{rust}{Result<T, E>}
+The main advantage is providing for more information about an
 error, other than one of a fix-set of ids.
+While some languages use checked union access to force error-code checking,
 it is still possible to bypass the checking.
 The main disadvantage is again significant error code on the main execution path and cascading through called functions.
+The main disadvantage is again it puts code on the main execution path.
+This is also the first technique that allows for more information about an
+error, other than one of a fix-set of ids, to be sent.
+They can be missed but some languages can force that they are checked.
+It is also implicitly forced in any languages with checked union access.
 \item\emph{Handler Functions}:
+This pattern implicitly associates functions with errors.
+On error, the function that produced the error implicitly calls another function to
+On error the function that produced the error calls another function to
 handle it.
 The handler function can be provided locally (passed in as an argument,
 either directly as as a field of a structure/object) or globally (a global
 variable).
+C++ uses this approach as its fallback system if exception handling fails, \eg
+C++ uses this as its fallback system if exception handling fails.
 \snake{std::terminate_handler} and for a time \snake{std::unexpected_handler}
 Handler functions work a lot like resumption exceptions, without the dynamic handler search.
 Therefore, setting setting up the handler can be more complex/expensive, especially if the handle must be passed through multiple function calls, but cheaper to call $O(1)$, and hence,
 are more suited to frequent exceptional situations.
 % The exception being global handlers if they are rarely change as the time
 % in both cases shrinks towards zero.
+Handler functions work a lot like resumption exceptions.
+The difference is they are more expencive to set up but cheaper to use, and
+so are more suited to more fequent errors.
+The exception being global handlers if they are rarely change as the time
+in both cases strinks towards zero.
 \end{itemize}
 %\subsection
+Because of their cost, exceptions are rarely used for hot paths of execution.
+Therefore, there is an element of self-fulfilling prophecy for implementation
+techniques to make exceptions cheap to set-up at the cost
+of expensive usage.
+This cost differential is less important in higher-level scripting languages, where use of exceptions for other tasks is more common.
+An iconic example is Python's @StopIteration@ exception that is thrown by
+an iterator to indicate that it is exhausted, especially when combined with Python's heavy
+use of the iterator-based for-loop.
+Because of their cost exceptions are rarely used for hot paths of execution.
+There is an element of self-fulfilling prophocy here as implementation
+techniques have been designed to make exceptions cheap to set-up at the cost
+of making them expencive to use.
+Still, use of exceptions for other tasks is more common in higher-level
+scripting languages.
+An iconic example is Python's StopIteration exception which is thrown by
+an iterator to indicate that it is exausted. Combined with Python's heavy
+use of the iterator based for-loop.
 % https://docs.python.org/3/library/exceptions.html#StopIteration

doc/theses/andrew_beach_MMath/performance.tex

-              r5541ea3d
+              r0640189e
 \chapter{Performance}
 \label{c:performance}
+\textbf{Just because of the stage of testing there are design notes for
+the tests as well as commentary on them.}
 Performance has been of secondary importance for most of this project.
 …
 \section{Test Set-Up}
+Tests will be run in \CFA, C++, Java and Python.
+In addition there are two sets of tests for \CFA,
+one for termination exceptions and once with resumption exceptions.
+Tests will be run on \CFA, C++ and Java.
 C++ is the most comparable language because both it and \CFA use the same
 …
 comparison. \CFA's EHM has had significantly less time to be optimized and
 does not generate its own assembly. It does have a slight advantage in that
+there are some features it does not handle, through utility functions,
+but otherwise \Cpp has a significant advantage.
+there are some features it does not handle.
 Java is another very popular language with similar termination semantics.
 …
 It also implements the finally clause on try blocks allowing for a direct
 feature-to-feature comparison.
-As with \Cpp, Java's implementation is more mature, has more optimizations
-and more extra features.
-Python was used as a point of comparison because of the \CFA EHM's
-current performance goals, which is not be prohibitively slow while the
-features are designed and examined. Python has similar performance goals for
-creating quick scripts and its wide use suggests it has achieved those goals.
-Unfortunately there are no notable modern programming languages with
-resumption exceptions. Even the older programming languages with resumptions
-seem to be notable only for having resumptions.
-So instead resumptions are compared to a less similar but much more familiar
-feature, termination exceptions.
 All tests are run inside a main loop which will perform the test
 repeatedly. This is to avoids start-up or tear-down time from
 affecting the timing results.
+Most test were run 1 000 000 (a million) times.
+The Java versions of the test also run this loop an extra 1000 times before
+beginning to time the results to ``warm-up" the JVM.
+Timing is done internally, with time measured immediately before and
+immediately after the test loop. The difference is calculated and printed.
+The loop structure and internal timing means it is impossible to test
+unhandled exceptions in \Cpp and Java as that would cause the process to
+terminate.
+Luckily, performance on the ``give-up and kill the process" path is not
+critical.
+A consequence of this is that tests cannot terminate the program,
+which does limit how tests can be implemented.
+There are catch-alls to keep unhandled
+exceptions from terminating tests.
 The exceptions used in these tests will always be a exception based off of
 the base exception. This requirement minimizes performance differences based
+on the object model used to repersent the exception.
+on the object model.
+Catch-alls are done by catching the root exception type (not using \Cpp's
+\code{C++}{catch(...)}).
+All tests were designed to be as minimal as possible while still preventing
+exessive optimizations.
+For example, empty inline assembly blocks are used in \CFA and \Cpp to
+prevent excessive optimizations while adding no actual work.
+% We don't use catch-alls but if we did:
+% Catch-alls are done by catching the root exception type (not using \Cpp's
+% \code{C++}{catch(...)}).
+Tests run in Java were not warmed because exception code paths should not be
+hot.
 \section{Tests}
 …
 components of the exception system.
 The should provide a guide as to where the EHM's costs can be found.
+Tests are run in \CFA, \Cpp and Java.
+Not every test is run in every language, if the feature under test is missing
+the test is skipped. These cases will be noted.
+In addition to the termination tests for every language,
+\CFA has a second set of tests that test resumption. These are the same
+except that the raise statements and handler clauses are replaced with the
+resumption variants.
 \paragraph{Raise and Handle}
 …
 start-up and shutdown on the results.
 Each iteration of the main loop
 \begin{itemize}[nosep]
+\begin{itemize}
 \item Empty Function:
 The repeating function is empty except for the necessary control code.
 …
 The repeating function creates an object with a destructor before calling
 itself.
+(Java is skipped as it does not destructors.)
 \item Finally:
 The repeating function calls itself inside a try block with a finally clause
 attached.
+(\Cpp is skipped as it does not have finally clauses.)
 \item Other Handler:
 The repeating function calls itself inside a try block with a handler that
 …
 In each iteration, a try statement is executed. Entering and leaving a loop
 is all the test wants to do.
 \begin{itemize}[nosep]
+\begin{itemize}
 \item Handler:
 The try statement has a handler (of the matching kind).
 …
 Only \CFA implements the language level conditional match,
 the other languages must mimic with an ``unconditional" match (it still
+checks the exception's type) and conditional re-raise if it was not supposed
+to handle that exception.
+\begin{itemize}[nosep]
+\item Match All:
+checks the exception's type) and conditional re-raise.
+\begin{itemize}
+\item Catch All:
 The condition is always true. (Always matches or never re-raises.)
 \item Match None:
+\item Catch None:
 The condition is always false. (Never matches or always re-raises.)
 \end{itemize}
 …
 %related to -fexceptions.)
+\section{Results}
+Each test is was run five times, the best and worst result were discarded and
+the remaining values were averaged.
+% Some languages I left out:
+% Python: Its a scripting language, different
+% uC++: Not well known and should the same results as C++, except for
+%   resumption which should be the same.
+In cases where a feature is not supported by a language the test is skipped
+for that language. Similarly, if a test is does not change between resumption
+and termination in \CFA, then only one test is written and the result
+was put into the termination column.
+\begin{tabular}{|l|c c c c c|}
+\hline
+              & \CFA (Terminate) & \CFA (Resume) & \Cpp & Java & Python \\
+\hline
+Raise Empty   & 0.0 & 0.0 & 0.0 & 0.0 & 0.0 \\
+Raise D'tor   & 0.0 & 0.0 & 0.0 & N/A & N/A \\
+Raise Finally & 0.0 & 0.0 & N/A & 0.0 & 0.0 \\
+Raise Other   & 0.0 & 0.0 & 0.0 & 0.0 & 0.0 \\
+Cross Handler & 0.0 & 0.0 & 0.0 & 0.0 & 0.0 \\
+Cross Finally & 0.0 & N/A & N/A & 0.0 & 0.0 \\
+Match All     & 0.0 & 0.0 & 0.0 & 0.0 & 0.0 \\
+Match None    & 0.0 & 0.0 & 0.0 & 0.0 & 0.0 \\
+\hline
+\end{tabular}
+%\section{Resumption Comparison}
+\todo{Can we find a good language to compare resumptions in.}

doc/theses/andrew_beach_MMath/uw-ethesis.tex

-              r5541ea3d
+              r0640189e
 \lstMakeShortInline@
 \lstset{language=CFA,style=cfacommon,basicstyle=\linespread{0.9}\tt}
+% PAB causes problems with inline @=
+%\lstset{moredelim=**[is][\protect\color{red}]{@}{@}}
+\lstset{moredelim=**[is][\protect\color{red}]{@}{@}}
 % Annotations from Peter:
 \newcommand{\PAB}[1]{{\color{blue}PAB: #1}}

doc/theses/mubeen_zulfiqar_MMath/allocator.tex

-              r5541ea3d
+              r0640189e
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\section{Added Features and Methods}
+To improve the UHeapLmmm allocator (FIX ME: cite uHeapLmmm) interface and make it more user friendly, we added a few more routines to the C allocator. Also, we built a CFA (FIX ME: cite cforall) interface on top of C interface to increase the usability of the allocator.
+\section{Added Features}
-\subsection{C Interface}
-We added a few more features and routines to the allocator's C interface that can make the allocator more usable to the programmers. THese features will programmer more control on the dynamic memory allocation.
+\subsubsection void * aalloc( size_t dim, size_t elemSize )
+aalloc is an extension of malloc. It allows programmer to allocate a dynamic array of objects without calculating the total size of array explicitly. The only alternate of this routine in the other allocators is calloc but calloc also fills the dynamic memory with 0 which makes it slower for a programmer who only wants to dynamically allocate an array of objects without filling it with 0.
+\paragraph{Usage}
+aalloc takes two parameters.
+\begin{itemize}
+\item
+dim: number of objects in the array
+\item
+elemSize: size of the object in the array.
+\end{itemize}
+It returns address of dynamic object allocatoed on heap that can contain dim number of objects of the size elemSize. On failure, it returns NULL pointer.
+\subsection{Methods}
+Why did we need it?
+The added benefits.
-\subsubsection void * resize( void * oaddr, size_t size )
-resize is an extension of relloc. It allows programmer to reuse a cuurently allocated dynamic object with a new size requirement. Its alternate in the other allocators is realloc but relloc also copy the data in old object to the new object which makes it slower for the programmer who only wants to reuse an old dynamic object for a new size requirement but does not want to preserve the data in the old object to the new object.
-\paragraph{Usage}
-resize takes two parameters.
-\begin{itemize}
-\item
-oaddr: the address of the old object that needs to be resized.
-\item
-size: the new size requirement of the to which the old object needs to be resized.
-\end{itemize}
-It returns an object that is of the size given but it does not preserve the data in the old object. On failure, it returns NULL pointer.
-\subsubsection void * resize( void * oaddr, size_t nalign, size_t size )
-This resize is an extension of the above resize (FIX ME: cite above resize). In addition to resizing the size of of an old object, it can also realign the old object to a new alignment requirement.
-\paragraph{Usage}
-This resize takes three parameters. It takes an additional parameter of nalign as compared to the above resize (FIX ME: cite above resize).
-\begin{itemize}
-\item
-oaddr: the address of the old object that needs to be resized.
-\item
-nalign: the new alignment to which the old object needs to be realigned.
-\item
-size: the new size requirement of the to which the old object needs to be resized.
-\end{itemize}
-It returns an object with the size and alignment given in the parameters. On failure, it returns a NULL pointer.
-\subsubsection void * amemalign( size_t alignment, size_t dim, size_t elemSize )
-amemalign is a hybrid of memalign and aalloc. It allows programmer to allocate an aligned dynamic array of objects without calculating the total size of the array explicitly. It frees the programmer from calculating the total size of the array.
-\paragraph{Usage}
-amemalign takes three parameters.
-\begin{itemize}
-\item
-alignment: the alignment to which the dynamic array needs to be aligned.
-\item
-dim: number of objects in the array
-\item
-elemSize: size of the object in the array.
-\end{itemize}
-It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment. On failure, it returns NULL pointer.
-\subsubsection void * cmemalign( size_t alignment, size_t dim, size_t elemSize )
-cmemalign is a hybrid of amemalign and calloc. It allows programmer to allocate an aligned dynamic array of objects that is 0 filled. The current way to do this in other allocators is to allocate an aligned object with memalign and then fill it with 0 explicitly. This routine provides both features of aligning and 0 filling, implicitly.
-\paragraph{Usage}
-cmemalign takes three parameters.
-\begin{itemize}
-\item
-alignment: the alignment to which the dynamic array needs to be aligned.
-\item
-dim: number of objects in the array
-\item
-elemSize: size of the object in the array.
-\end{itemize}
-It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment and is 0 filled. On failure, it returns NULL pointer.
-\subsubsection size_t malloc_alignment( void * addr )
-malloc_alignment returns the alignment of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required alignment.
-\paragraph{Usage}
-malloc_alignment takes one parameters.
-\begin{itemize}
-\item
-addr: the address of the currently allocated dynamic object.
-\end{itemize}
-malloc_alignment returns the alignment of the given dynamic object. On failure, it return the value of default alignment of the uHeapLmmm allocator.
-\subsubsection bool malloc_zero_fill( void * addr )
-malloc_zero_fill returns whether a currently allocated dynamic object was initially zero filled at the time of allocation. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verifying the zero filled property of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was zero filled at the time of allocation.
-\paragraph{Usage}
-malloc_zero_fill takes one parameters.
-\begin{itemize}
-\item
-addr: the address of the currently allocated dynamic object.
-\end{itemize}
-malloc_zero_fill returns true if the dynamic object was initially zero filled and return false otherwise. On failure, it returns false.
-\subsubsection size_t malloc_size( void * addr )
-malloc_size returns the allocation size of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required size. Its current alternate in the other allocators is malloc_usable_size. But, malloc_size is different from malloc_usable_size as malloc_usabe_size returns the total data capacity of dynamic object including the extra space at the end of the dynamic object. On the other hand, malloc_size returns the size that was given to the allocator at the allocation of the dynamic object. This size is updated when an object is realloced, resized, or passed through a similar allocator routine.
-\paragraph{Usage}
-malloc_size takes one parameters.
-\begin{itemize}
-\item
-addr: the address of the currently allocated dynamic object.
-\end{itemize}
-malloc_size returns the allocation size of the given dynamic object. On failure, it return zero.
-\subsubsection void * realloc( void * oaddr, size_t nalign, size_t size )
-This realloc is an extension of the default realloc (FIX ME: cite default realloc). In addition to reallocating an old object and preserving the data in old object, it can also realign the old object to a new alignment requirement.
-\paragraph{Usage}
-This realloc takes three parameters. It takes an additional parameter of nalign as compared to the default realloc.
-\begin{itemize}
-\item
-oaddr: the address of the old object that needs to be reallocated.
-\item
-nalign: the new alignment to which the old object needs to be realigned.
-\item
-size: the new size requirement of the to which the old object needs to be resized.
-\end{itemize}
-It returns an object with the size and alignment given in the parameters that preserves the data in the old object. On failure, it returns a NULL pointer.
-\subsection{CFA Malloc Interface}
-We added some routines to the malloc interface of CFA. These routines can only be used in CFA and not in our standalone uHeapLmmm allocator as these routines use some features that are only provided by CFA and not by C. It makes the allocator even more usable to the programmers.
-CFA provides the liberty to know the returned type of a call to the allocator. So, mainly in these added routines, we removed the object size parameter from the routine as allocator can calculate the size of the object from the returned type.
-\subsubsection T * malloc( void )
-This malloc is a simplified polymorphic form of defualt malloc (FIX ME: cite malloc). It does not take any parameter as compared to default malloc that takes one parameter.
-\paragraph{Usage}
-This malloc takes no parameters.
-It returns a dynamic object of the size of type T. On failure, it return NULL pointer.
-\subsubsection T * aalloc( size_t dim )
-This aalloc is a simplified polymorphic form of above aalloc (FIX ME: cite aalloc). It takes one parameter as compared to the above aalloc that takes two parameters.
-\paragraph{Usage}
-aalloc takes one parameters.
-\begin{itemize}
-\item
-dim: required number of objects in the array.
-\end{itemize}
-It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. On failure, it return NULL pointer.
-\subsubsection T * calloc( size_t dim )
-This calloc is a simplified polymorphic form of defualt calloc (FIX ME: cite calloc). It takes one parameter as compared to the default calloc that takes two parameters.
-\paragraph{Usage}
-This calloc takes one parameter.
-\begin{itemize}
-\item
-dim: required number of objects in the array.
-\end{itemize}
-It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. On failure, it return NULL pointer.
-\subsubsection T * resize( T * ptr, size_t size )
-This resize is a simplified polymorphic form of above resize (FIX ME: cite resize with alignment). It takes two parameters as compared to the above resize that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation as CFA provides gives allocator the liberty to get the alignment of the returned type.
-\paragraph{Usage}
-This resize takes two parameters.
-\begin{itemize}
-\item
-ptr: address of the old object.
-\item
-size: the required size of the new object.
-\end{itemize}
-It returns a dynamic object of the size given in paramters. The returned object is aligned to the alignemtn of type T. On failure, it return NULL pointer.
-\subsubsection T * realloc( T * ptr, size_t size )
-This realloc is a simplified polymorphic form of defualt realloc (FIX ME: cite realloc with align). It takes two parameters as compared to the above realloc that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation as CFA provides gives allocator the liberty to get the alignment of the returned type.
-\paragraph{Usage}
-This realloc takes two parameters.
-\begin{itemize}
-\item
-ptr: address of the old object.
-\item
-size: the required size of the new object.
-\end{itemize}
-It returns a dynamic object of the size given in paramters that preserves the data in the given object. The returned object is aligned to the alignemtn of type T. On failure, it return NULL pointer.
-\subsubsection T * memalign( size_t align )
-This memalign is a simplified polymorphic form of defualt memalign (FIX ME: cite memalign). It takes one parameters as compared to the default memalign that takes two parameters.
-\paragraph{Usage}
-memalign takes one parameters.
-\begin{itemize}
-\item
-align: the required alignment of the dynamic object.
-\end{itemize}
-It returns a dynamic object of the size of type T that is aligned to given parameter align. On failure, it return NULL pointer.
-\subsubsection T * amemalign( size_t align, size_t dim )
-This amemalign is a simplified polymorphic form of above amemalign (FIX ME: cite amemalign). It takes two parameter as compared to the above amemalign that takes three parameters.
-\paragraph{Usage}
-amemalign takes two parameters.
-\begin{itemize}
-\item
-align: required alignment of the dynamic array.
-\item
-dim: required number of objects in the array.
-\end{itemize}
-It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. The returned object is aligned to the given parameter align. On failure, it return NULL pointer.
-\subsubsection T * cmemalign( size_t align, size_t dim  )
-This cmemalign is a simplified polymorphic form of above cmemalign (FIX ME: cite cmemalign). It takes two parameter as compared to the above cmemalign that takes three parameters.
-\paragraph{Usage}
-cmemalign takes two parameters.
-\begin{itemize}
-\item
-align: required alignment of the dynamic array.
-\item
-dim: required number of objects in the array.
-\end{itemize}
-It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. The returned object is aligned to the given parameter align and is zero filled. On failure, it return NULL pointer.
-\subsubsection T * aligned_alloc( size_t align )
-This aligned_alloc is a simplified polymorphic form of defualt aligned_alloc (FIX ME: cite aligned_alloc). It takes one parameter as compared to the default aligned_alloc that takes two parameters.
-\paragraph{Usage}
-This aligned_alloc takes one parameter.
-\begin{itemize}
-\item
-align: required alignment of the dynamic object.
-\end{itemize}
-It returns a dynamic object of the size of type T that is aligned to the given parameter. On failure, it return NULL pointer.
-\subsubsection int posix_memalign( T ** ptr, size_t align )
-This posix_memalign is a simplified polymorphic form of defualt posix_memalign (FIX ME: cite posix_memalign). It takes two parameters as compared to the default posix_memalign that takes three parameters.
-\paragraph{Usage}
-This posix_memalign takes two parameter.
-\begin{itemize}
-\item
-ptr: variable address to store the address of the allocated object.
-\item
-align: required alignment of the dynamic object.
-\end{itemize}
-It stores address of the dynamic object of the size of type T in given parameter ptr. This object is aligned to the given parameter. On failure, it return NULL pointer.
-\subsubsection T * valloc( void )
-This valloc is a simplified polymorphic form of defualt valloc (FIX ME: cite valloc). It takes no parameters as compared to the default valloc that takes one parameter.
-\paragraph{Usage}
-valloc takes no parameters.
-It returns a dynamic object of the size of type T that is aligned to the page size. On failure, it return NULL pointer.
-\subsubsection T * pvalloc( void )
-This pcvalloc is a simplified polymorphic form of defualt pcvalloc (FIX ME: cite pcvalloc). It takes no parameters as compared to the default pcvalloc that takes one parameter.
-\paragraph{Usage}
-pvalloc takes no parameters.
-It returns a dynamic object of the size that is calcutaed by rouding the size of type T. The returned object is also aligned to the page size. On failure, it return NULL pointer.
 \subsection{Alloc Interface}
+In addition to improve allocator interface both for CFA and our standalone allocator uHeapLmmm in C. We also added a new alloc interface in CFA that increases usability of dynamic memory allocation.
+This interface helps programmers in three major ways.
+\begin{itemize}
+\item
+Routine Name: alloc interfce frees programmers from remmebring different routine names for different kind of dynamic allocations.
+\item
+Parametre Positions: alloc interface frees programmers from remembering parameter postions in call to routines.
+\item
+Object Size: alloc interface does not require programmer to mention the object size as CFA allows allocator to determince the object size from returned type of alloc call.
+\end{itemize}
+Alloc interface uses polymorphism, backtick routines (FIX ME: cite backtick) and ttype parameters of CFA (FIX ME: cite ttype) to provide a very simple dynamic memory allocation interface to the programmers. The new interfece has just one routine name alloc that can be used to perform a wide range of dynamic allocations. The parameters use backtick functions to provide a similar-to named parameters feature for our alloc interface so that programmers do not have to remember parameter positions in alloc call except the position of dimension (dim) parameter.
+\subsubsection{Routine: T * alloc( ... )}
+Call to alloc wihout any parameter returns one object of size of type T allocated dynamically.
+Only the dimension (dim) parameter for array allocation has the fixed position in the alloc routine. If programmer wants to allocate an array of objects that the required number of members in the array has to be given as the first parameter to the alloc routine.
+alocc routine accepts six kinds of arguments. Using different combinations of tha parameters, different kind of allocations can be performed. Any combincation of parameters can be used together except `realloc and `resize that should not be used simultanously in one call to routine as it creates ambiguity about whether to reallocate or resize a currently allocated dynamic object. If both `resize and `realloc are used in a call to alloc then the latter one will take effect or unexpected resulted might be produced.
+\paragraph{Dim}
+This is the only parameter in the alloc routine that has a fixed-position and it is also the only parameter that does not use a backtick function. It has to be passed at the first position to alloc call in-case of an array allocation of objects of type T.
+It represents the required number of members in the array allocation as in CFA's aalloc (FIX ME: cite aalloc).
+This parameter should be of type size_t.
+Example: int a = alloc( 5 )
+This call will return a dynamic array of five integers.
+\paragraph{Align}
+This parameter is position-free and uses a backtick routine align (`align). The parameter passed with `align should be of type size_t. If the alignment parameter is not a power of two or is less than the default alignment of the allocator (that can be found out using routine libAlign in CFA) then the passed alignment parameter will be rejected and the default alignment will be used.
+Example: int b = alloc( 5 , 64`align )
+This call will return a dynamic array of five integers. It will align the allocated object to 64.
+\paragraph{Fill}
+This parameter is position-free and uses a backtick routine fill (`fill). In case of realloc, only the extra space after copying the data in the old object will be filled with given parameter.
+Three types of parameters can be passed using `fill.
+\begin{itemize}
+\item
+char: A char can be passed with `fill to fill the whole dynamic allocation with the given char recursively till the end of required allocation.
+\item
+Object of returned type: An object of type of returned type can be passed with `fill to fill the whole dynamic allocation with the given object recursively till the end of required allocation.
+\item
+Dynamic object of returned type: A dynamic object of type of returned type can be passed with `fill to fill the dynamic allocation with the given dynamic object. In this case, the allocated memory is not filled recursively till the end of allocation. The filling happen untill the end object passed to `fill or the end of requested allocation reaches.
+\end{itemize}
+Example: int b = alloc( 5 , 'a'`fill )
+This call will return a dynamic array of five integers. It will fill the allocated object with character 'a' recursively till the end of requested allocation size.
+Example: int b = alloc( 5 , 4`fill )
+This call will return a dynamic array of five integers. It will fill the allocated object with integer 4 recursively till the end of requested allocation size.
+Example: int b = alloc( 5 , a`fill ) where a is a pointer of int type
+This call will return a dynamic array of five integers. It will copy data in a to the returned object non-recursively untill end of a or the newly allocated object is reached.
+\paragraph{Resize}
+This parameter is position-free and uses a backtick routine resize (`resize). It represents the old dynamic object (oaddr) that the programmer wants to
+\begin{itemize}
+\item
+resize to a new size.
+\item
+realign to a new alignment
+\item
+fill with something.
+\end{itemize}
+The data in old dynamic object will not be preserved in the new object. The type of object passed to `resize and the returned type of alloc call can be different.
+Example: int b = alloc( 5 , a`resize )
+This call will resize object a to a dynamic array that can contain 5 integers.
+Example: int b = alloc( 5 , a`resize , 32`align )
+This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32.
+Example: int b = alloc( 5 , a`resize , 32`align , 2`fill)
+This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32 and will be filled with 2.
+\paragraph{Realloc}
+This parameter is position-free and uses a backtick routine realloc (`realloc). It represents the old dynamic object (oaddr) that the programmer wants to
+\begin{itemize}
+\item
+realloc to a new size.
+\item
+realign to a new alignment
+\item
+fill with something.
+\end{itemize}
+The data in old dynamic object will be preserved in the new object. The type of object passed to `realloc and the returned type of alloc call cannot be different.
+Example: int b = alloc( 5 , a`realloc )
+This call will realloc object a to a dynamic array that can contain 5 integers.
+Example: int b = alloc( 5 , a`realloc , 32`align )
+This call will realloc object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32.
+Example: int b = alloc( 5 , a`realloc , 32`align , 2`fill)
+This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32. The extra space after copying data of a to the returned object will be filled with 2.
+Why did we need it?
+The added benefits.

doc/theses/mubeen_zulfiqar_MMath/benchmarks.tex

-              r5541ea3d
+              r0640189e
 *** FIX ME: Insert a figure of above benchmark with description
 \paragrpah{Relevant Knobs}
+\subsubsection{Relevant Knobs}
 *** FIX ME: Insert Relevant Knobs
 …
 \paragraph{Relevant Knobs}
 *** FIX ME: Insert Relevant Knobs
+\section{Results}
+*** FIX ME: add configuration details of memory allocators
+\subsection{Memory Benchmark}
+\subsubsection{Relevant Knobs}
+\subsection{Speed Benchmark}
+\subsubsection{Speed Time}
+\paragraph{Relevant Knobs}
+\subsubsection{Speed Workload}
+\paragraph{Relevant Knobs}
+\subsection{Cache Scratch}
+\subsubsection{Cache Scratch Time}
+\paragraph{Relevant Knobs}
+\subsubsection{Cache Scratch Layout}
+\paragraph{Relevant Knobs}
+\subsection{Cache Thrash}
+\subsubsection{Cache Thrash Time}
+\paragraph{Relevant Knobs}
+\subsubsection{Cache Thrash Layout}
+\paragraph{Relevant Knobs}

doc/theses/mubeen_zulfiqar_MMath/intro.tex

-              r5541ea3d
+              r0640189e
 \noindent
 ====================
-\section{Introduction}
-Dynamic memory allocation and management is one of the core features of C. It gives programmer the freedom to allocate, free, use, and manage dynamic memory himself. The programmer is not given the complete control of the dynamic memory management instead an interface of memory allocator is given to the progrmmer that can be used to allocate/free dynamic memory for the application's use.
-Memory allocator is a layer between thr programmer and the system. Allocator gets dynamic memory from the system in heap/mmap area of application storage and manages it for programmer's use.
-GNU C Library (FIX ME: cite this) provides an interchangeable memory allocator that can be replaced with a custom memory allocator that supports required features and fulfills application's custom needs. It also allows others to innovate in memory allocation and design their own memory allocator. GNU C Library has set guidelines that should be followed when designing a standalone memory allocator. GNU C Library requires new memory allocators to have atlease following set of functions in their allocator's interface:
-\begin{itemize}
-\item
-malloc: it allocates and returns a chunk of dynamic memory of requested size (FIX ME: cite man page).
-\item
-calloc: it allocates and returns an array in dynamic memory of requested size (FIX ME: cite man page).
-\item
-realloc: it reallocates and returns an already allocated chunk of dynamic memory to a new size (FIX ME: cite man page).
-\item
-free: it frees an already allocated piece of dynamic memory (FIX ME: cite man page).
-\end{itemize}
-In addition to the above functions, GNU C Library also provides some more functions to increase the usability of the dynamic memory allocator. Most standalone allocators also provide all or some of the above additional functions.
-\begin{itemize}
-\item
-aligned_alloc
-\item
-malloc_usable_size
-\item
-memalign
-\item
-posix_memalign
-\item
-pvalloc
-\item
-valloc
-\end{itemize}
-With the rise of concurrent applications, memory allocators should be able to fulfill dynamic memory requests from multiple threads in parallel without causing contention on shared resources. There needs to be a set of a standard benchmarks that can be used to evaluate an allocator's performance in different scenerios.
-\section{Background}
-\subsection{Memory Allocation}
-With dynamic allocation being an important feature of C, there are many standalone memory allocators that have been designed for different purposes. For this thesis, we chose 7 of the most popular and widely used memory allocators.
-\paragraph{dlmalloc}
-dlmalloc (FIX ME: cite allocator) is a thread-safe allocator that is single threaded and single heap. dlmalloc maintains free-lists of different sizes to store freed dynamic memory. (FIX ME: cite wasik)
-\paragraph{hoard}
-Hoard (FIX ME: cite allocator) is a thread-safe allocator that is multi-threaded and using a heap layer framework. It has per-thred heaps that have thread-local free-lists, and a gloabl shared heap. (FIX ME: cite wasik)
-\paragraph{jemalloc}
-jemalloc (FIX ME: cite allocator) is a thread-safe allocator that uses multiple arenas. Each thread is assigned an arena. Each arena has chunks that contain contagious memory regions of same size. An arena has multiple chunks that contain regions of multiple sizes.
-\paragraph{ptmalloc}
-ptmalloc (FIX ME: cite allocator) is a modification of dlmalloc. It is a thread-safe multi-threaded memory allocator that uses multiple heaps. ptmalloc heap has similar design to dlmalloc's heap.
-\paragraph{rpmalloc}
-rpmalloc (FIX ME: cite allocator) is a thread-safe allocator that is multi-threaded and uses per-thread heap. Each heap has multiple size-classes and each size-calss contains memory regions of the relevant size.
-\paragraph{tbb malloc}
-tbb malloc (FIX ME: cite allocator) is a thread-safe allocator that is multi-threaded and uses private heap for each thread. Each private-heap has multiple bins of different sizes. Each bin contains free regions of the same size.
-\paragraph{tc malloc}
-tcmalloc (FIX ME: cite allocator) is a thread-safe allocator. It uses per-thread cache to store free objects that prevents contention on shared resources in multi-threaded application. A central free-list is used to refill per-thread cache when it gets empty.
-\subsection{Benchmarks}
-There are multiple benchmarks that are built individually and evaluate different aspects of a memory allocator. But, there is not standard set of benchamrks that can be used to evaluate multiple aspects of memory allocators.
-\paragraph{threadtest}
-(FIX ME: cite benchmark and hoard) Each thread repeatedly allocates and then deallocates 100,000 objects. Runtime of the benchmark evaluates its efficiency.
-\paragraph{shbench}
-(FIX ME: cite benchmark and hoard) Each thread allocates and randomly frees a number of random-sized objects. It is a stress test that also uses runtime to determine efficiency of the allocator.
-\paragraph{larson}
-(FIX ME: cite benchmark and hoard) Larson simulates a server environment. Multiple threads are created where each thread allocator and free a number of objects within a size range. Some objects are passed from threads to the child threads to free. It caluculates memory operations per second as an indicator of memory allocator's performance.
-\section{Research Objectives}
-Our research objective in this thesis is to:
-\begin{itemize}
-\item
-Design a lightweight concurrent memory allocator with added features and usability that are currently not present in the other memory allocators.
-\item
-Design a suite of benchmarks to evalute multiple aspects of a memory allocator.
-\end{itemize}
-\section{An outline of the thesis}
-LAST FIX ME: add outline at the end

doc/theses/mubeen_zulfiqar_MMath/performance.tex

-              r5541ea3d
+              r0640189e
 \chapter{Performance}
-\noindent
-====================
-Writing Points:
-\begin{itemize}
-\item
-Machine Specification
-\item
-Allocators and their details
-\item
-Benchmarks and their details
-\item
-Results
-\end{itemize}
-\noindent
-====================
-\section{Memory Allocators}
-For these experiments, we used 7 memory allocators excluding our standalone memory allocator uHeapLmmm.
-\begin{tabularx}{0.8\textwidth} {
-        | >{\raggedright\arraybackslash}X
-        | >{\centering\arraybackslash}X
-        | >{\raggedleft\arraybackslash}X |
+}
-\hline
-Memory Allocator & Version     & Configurations \\
-\hline
-dl               &             &  \\
-\hline
-hoard            &             &  \\
-\hline
-je               &             &  \\
-\hline
-pt3              &             &  \\
-\hline
-rp               &             &  \\
-\hline
-tbb              &             &  \\
-\hline
-tc               &             &  \\
-\end{tabularx}
-(FIX ME: complete table)
-\section{Experiment Environment}
-We conducted these experiments ... (FIX ME: what machine and which specifications to add).
-We used our micro becnhmark suite (FIX ME: cite mbench) to evaluate other memory allocators (FIX ME: cite above memory allocators) and our uHeapLmmm.
-\section{Results}
-\subsection{Memory Benchmark}
-FIX ME: add experiment, knobs, graphs, and description
-\subsection{Speed Benchmark}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Speed Time}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Speed Workload}
-FIX ME: add experiment, knobs, graphs, and description
-\subsection{Cache Scratch}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Cache Scratch Time}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Cache Scratch Layout}
-FIX ME: add experiment, knobs, graphs, and description
-\subsection{Cache Thrash}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Cache Thrash Time}
-FIX ME: add experiment, knobs, graphs, and description
-\subsubsection{Cache Thrash Layout}
-FIX ME: add experiment, knobs, graphs, and description

driver/cc1.cc

-              r5541ea3d
+              r0640189e
 // Created On       : Fri Aug 26 14:23:51 2005
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed Jul 21 09:46:24 2021
 // Update Count     : 419
+// Last Modified On : Wed Jul 14 15:42:08 2021
+// Update Count     : 418
 //
 …
                 Stage2( argc, argv );
         } else {
                 cerr << "Usage: " << argv[0] << " [-E input-file [output-file] ] | [-fpreprocessed input-file output-file] [options]" << endl;
+                cerr << "Usage: " << argv[0] << " input-file [output-file] [options]" << endl;
                 exit( EXIT_FAILURE );
         } // if

libcfa/prelude/builtins.c

-              r5541ea3d
+              r0640189e
 // Created On       : Fri Jul 21 16:21:03 2017
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed Jul 21 13:31:34 2021
 // Update Count     : 129
+// Last Modified On : Tue Apr 13 17:26:32 2021
+// Update Count     : 117
 //
 …
 // implicit increment, decrement if += defined, and implicit not if != defined
-// C11 reference manual Section 6.5.16 (page101): "An assignment expression has the value of the left operand after the
-// assignment, but is not an lvalue." Hence, return a value not a reference.
 static inline {
         forall( T | { T ?+=?( T &, one_t ); } )
         T ++?( T & x ) { return x += 1; }
+        forall( DT & | { DT & ?+=?( DT &, one_t ); } )
+        DT & ++?( DT & x ) { return x += 1; }
         forall( T | { T ?+=?( T &, one_t ); } )
         T ?++( T & x ) { T tmp = x; x += 1; return tmp; }
+        forall( DT & | sized(DT) | { void ?{}( DT &, DT ); void ^?{}( DT & ); DT & ?+=?( DT &, one_t ); } )
+        DT & ?++( DT & x ) { DT tmp = x; x += 1; return tmp; }
         forall( T | { T ?-=?( T &, one_t ); } )
         T --?( T & x ) { return x -= 1; }
+        forall( DT & | { DT & ?-=?( DT &, one_t ); } )
+        DT & --?( DT & x ) { return x -= 1; }
         forall( T | { T ?-=?( T &, one_t ); } )
         T ?--( T & x ) { T tmp = x; x -= 1; return tmp; }
+        forall( DT & | sized(DT) | { void ?{}( DT &, DT ); void ^?{}( DT & ); DT & ?-=?( DT &, one_t ); } )
+        DT & ?--( DT & x ) { DT tmp = x; x -= 1; return tmp; }
         forall( T | { int ?!=?( T, zero_t ); } )
         int !?( T & x ) { return !( x != 0 ); }
+        forall( DT & | { int ?!=?( const DT &, zero_t ); } )
+        int !?( const DT & x ) { return !( x != 0 ); }
 } // distribution

libcfa/src/Makefile.am

-              r5541ea3d
+              r0640189e
 ## Created On       : Sun May 31 08:54:01 2015
 ## Last Modified By : Peter A. Buhr
 ## Last Modified On : Fri Jul 16 16:00:40 2021
 ## Update Count     : 255
+## Last Modified On : Sat Apr 24 09:09:56 2021
+## Update Count     : 254
 ###############################################################################
 …
         exception.h \
         gmp.hfa \
-        math.trait.hfa \
         math.hfa \
         time_t.hfa \

libcfa/src/concurrency/locks.cfa

r5541ea3d	r0640189e
120	120	owner = t;
121	121	recursion_count = ( t ? 1 : 0 );
122		~~if ( t )~~ wait_count--;
	122	wait_count--;
123	123	unpark( t );
124	124	}

libcfa/src/fstream.cfa

-              r5541ea3d
+              r0640189e
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Thu Jul 29 22:34:10 2021
 // Update Count     : 454
+// Last Modified On : Wed Apr 28 20:37:53 2021
+// Update Count     : 445
 //
 …
         if ( fclose( (FILE *)(os.file$) ) == EOF ) {
+                throw (Close_Failure){ os };
+                // abort | IO_MSG "close output" | nl | strerror( errno );
+                abort | IO_MSG "close output" | nl | strerror( errno );
         } // if
         os.file$ = 0p;
 …
 ofstream & write( ofstream & os, const char data[], size_t size ) {
         if ( fail( os ) ) {
+                throw (Write_Failure){ os };
+                // abort | IO_MSG "attempt write I/O on failed stream";
+                abort | IO_MSG "attempt write I/O on failed stream";
         } // if
         if ( fwrite( data, 1, size, (FILE *)(os.file$) ) != size ) {
+                throw (Write_Failure){ os };
+                // abort | IO_MSG "write" | nl | strerror( errno );
+                abort | IO_MSG "write" | nl | strerror( errno );
         } // if
         return os;
 …
         if ( fclose( (FILE *)(is.file$) ) == EOF ) {
+                throw (Close_Failure){ is };
+                // abort | IO_MSG "close input" | nl | strerror( errno );
+                abort | IO_MSG "close input" | nl | strerror( errno );
         } // if
         is.file$ = 0p;
 …
 ifstream & read( ifstream & is, char data[], size_t size ) {
         if ( fail( is ) ) {
+                throw (Read_Failure){ is };
+                // abort | IO_MSG "attempt read I/O on failed stream";
+                abort | IO_MSG "attempt read I/O on failed stream";
         } // if
         if ( fread( data, size, 1, (FILE *)(is.file$) ) == 0 ) {
+                throw (Read_Failure){ is };
+                // abort | IO_MSG "read" | nl | strerror( errno );
+                abort | IO_MSG "read" | nl | strerror( errno );
         } // if
         return is;
 …
+static vtable(Open_Failure) Open_Failure_vt;
+// exception I/O constructors
+EHM_VIRTUAL_TABLE(Open_Failure, Open_Failure_main_table);
 void ?{}( Open_Failure & this, ofstream & ostream ) {
         this.virtual_table = &Open_Failure_vt;
+        this.virtual_table = &Open_Failure_main_table;
         this.ostream = &ostream;
         this.tag = 1;
+} // ?{}
+}
 void ?{}( Open_Failure & this, ifstream & istream ) {
         this.virtual_table = &Open_Failure_vt;
+        this.virtual_table = &Open_Failure_main_table;
         this.istream = &istream;
         this.tag = 0;
+} // ?{}
+static vtable(Close_Failure) Close_Failure_vt;
+// exception I/O constructors
+void ?{}( Close_Failure & this, ofstream & ostream ) {
+        this.virtual_table = &Close_Failure_vt;
+        this.ostream = &ostream;
+        this.tag = 1;
+} // ?{}
+void ?{}( Close_Failure & this, ifstream & istream ) {
+        this.virtual_table = &Close_Failure_vt;
+        this.istream = &istream;
+        this.tag = 0;
+} // ?{}
+static vtable(Write_Failure) Write_Failure_vt;
+// exception I/O constructors
+void ?{}( Write_Failure & this, ofstream & ostream ) {
+        this.virtual_table = &Write_Failure_vt;
+        this.ostream = &ostream;
+        this.tag = 1;
+} // ?{}
+void ?{}( Write_Failure & this, ifstream & istream ) {
+        this.virtual_table = &Write_Failure_vt;
+        this.istream = &istream;
+        this.tag = 0;
+} // ?{}
+static vtable(Read_Failure) Read_Failure_vt;
+// exception I/O constructors
+void ?{}( Read_Failure & this, ofstream & ostream ) {
+        this.virtual_table = &Read_Failure_vt;
+        this.ostream = &ostream;
+        this.tag = 1;
+} // ?{}
+void ?{}( Read_Failure & this, ifstream & istream ) {
+        this.virtual_table = &Read_Failure_vt;
+        this.istream = &istream;
+        this.tag = 0;
+} // ?{}
+// void throwOpen_Failure( ofstream & ostream ) {
+//      Open_Failure exc = { ostream };
+// }
+// void throwOpen_Failure( ifstream & istream ) {
+//      Open_Failure exc = { istream };
+// }
+}
+void throwOpen_Failure( ofstream & ostream ) {
+        Open_Failure exc = { ostream };
+}
+void throwOpen_Failure( ifstream & istream ) {
+        Open_Failure exc = { istream };
+}
 // Local Variables: //

libcfa/src/fstream.hfa

-              r5541ea3d
+              r0640189e
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed Jul 28 07:35:50 2021
 // Update Count     : 234
+// Last Modified On : Wed Apr 28 20:37:57 2021
+// Update Count     : 230
 //
 …
+exception Open_Failure {
+EHM_EXCEPTION(Open_Failure)(
         union {
                 ofstream * ostream;
 …
         // TEMPORARY: need polymorphic exceptions
         int tag;                                                                                        // 1 => ostream; 0 => istream
 };
+);
 void ?{}( Open_Failure & this, ofstream & );
 void ?{}( Open_Failure & this, ifstream & );
-exception Close_Failure {
-        union {
-                ofstream * ostream;
-                ifstream * istream;
-        };
-        // TEMPORARY: need polymorphic exceptions
-        int tag;                                                                                        // 1 => ostream; 0 => istream
-};
-void ?{}( Close_Failure & this, ofstream & );
-void ?{}( Close_Failure & this, ifstream & );
-exception Write_Failure {
-        union {
-                ofstream * ostream;
-                ifstream * istream;
-        };
-        // TEMPORARY: need polymorphic exceptions
-        int tag;                                                                                        // 1 => ostream; 0 => istream
-};
-void ?{}( Write_Failure & this, ofstream & );
-void ?{}( Write_Failure & this, ifstream & );
-exception Read_Failure {
-        union {
-                ofstream * ostream;
-                ifstream * istream;
-        };
-        // TEMPORARY: need polymorphic exceptions
-        int tag;                                                                                        // 1 => ostream; 0 => istream
-};
-void ?{}( Read_Failure & this, ofstream & );
-void ?{}( Read_Failure & this, ifstream & );
 // Local Variables: //

libcfa/src/rational.cfa

-              r5541ea3d
+              r0640189e
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jul 20 16:30:06 2021
 // Update Count     : 193
+// Last Modified On : Sat Feb  8 17:56:36 2020
+// Update Count     : 187
 //
 …
 #include "stdlib.hfa"
 forall( T | Arithmetic( T ) ) {
+forall( RationalImpl | arithmetic( RationalImpl ) ) {
         // helper routines
         // Calculate greatest common denominator of two numbers, the first of which may be negative. Used to reduce
         // rationals.  alternative: https://en.wikipedia.org/wiki/Binary_GCD_algorithm
         static T gcd( T a, T b ) {
+        static RationalImpl gcd( RationalImpl a, RationalImpl b ) {
                 for ( ;; ) {                                                                    // Euclid's algorithm
                         T r = a % b;
                   if ( r == (T){0} ) break;
+                        RationalImpl r = a % b;
+                  if ( r == (RationalImpl){0} ) break;
                         a = b;
                         b = r;
 …
         } // gcd
         static T simplify( T & n, T & d ) {
                 if ( d == (T){0} ) {
+        static RationalImpl simplify( RationalImpl & n, RationalImpl & d ) {
+                if ( d == (RationalImpl){0} ) {
                         abort | "Invalid rational number construction: denominator cannot be equal to 0.";
                 } // exit
                 if ( d < (T){0} ) { d = -d; n = -n; } // move sign to numerator
+                if ( d < (RationalImpl){0} ) { d = -d; n = -n; } // move sign to numerator
                 return gcd( abs( n ), d );                                              // simplify
         } // Rationalnumber::simplify
 …
         // constructors
+        void ?{}( Rational(T) & r, zero_t ) {
+                r{ (T){0}, (T){1} };
+        } // rational
+        void ?{}( Rational(T) & r, one_t ) {
+                r{ (T){1}, (T){1} };
+        } // rational
+        void ?{}( Rational(T) & r ) {
+                r{ (T){0}, (T){1} };
+        } // rational
+        void ?{}( Rational(T) & r, T n ) {
+                r{ n, (T){1} };
+        } // rational
+        void ?{}( Rational(T) & r, T n, T d ) {
+                T t = simplify( n, d );                         // simplify
+        void ?{}( Rational(RationalImpl) & r ) {
+                r{ (RationalImpl){0}, (RationalImpl){1} };
+        } // rational
+        void ?{}( Rational(RationalImpl) & r, RationalImpl n ) {
+                r{ n, (RationalImpl){1} };
+        } // rational
+        void ?{}( Rational(RationalImpl) & r, RationalImpl n, RationalImpl d ) {
+                RationalImpl t = simplify( n, d );                              // simplify
                 r.[numerator, denominator] = [n / t, d / t];
         } // rational
+        void ?{}( Rational(RationalImpl) & r, zero_t ) {
+                r{ (RationalImpl){0}, (RationalImpl){1} };
+        } // rational
+        void ?{}( Rational(RationalImpl) & r, one_t ) {
+                r{ (RationalImpl){1}, (RationalImpl){1} };
+        } // rational
         // getter for numerator/denominator
         T numerator( Rational(T) r ) {
+        RationalImpl numerator( Rational(RationalImpl) r ) {
                 return r.numerator;
         } // numerator
         T denominator( Rational(T) r ) {
+        RationalImpl denominator( Rational(RationalImpl) r ) {
                 return r.denominator;
         } // denominator
         [ T, T ] ?=?( & [ T, T ] dest, Rational(T) src ) {
+        [ RationalImpl, RationalImpl ] ?=?( & [ RationalImpl, RationalImpl ] dest, Rational(RationalImpl) src ) {
                 return dest = src.[ numerator, denominator ];
         } // ?=?
 …
         // setter for numerator/denominator
         T numerator( Rational(T) r, T n ) {
                 T prev = r.numerator;
                 T t = gcd( abs( n ), r.denominator ); // simplify
+        RationalImpl numerator( Rational(RationalImpl) r, RationalImpl n ) {
+                RationalImpl prev = r.numerator;
+                RationalImpl t = gcd( abs( n ), r.denominator ); // simplify
                 r.[numerator, denominator] = [n / t, r.denominator / t];
                 return prev;
         } // numerator
         T denominator( Rational(T) r, T d ) {
                 T prev = r.denominator;
                 T t = simplify( r.numerator, d );       // simplify
+        RationalImpl denominator( Rational(RationalImpl) r, RationalImpl d ) {
+                RationalImpl prev = r.denominator;
+                RationalImpl t = simplify( r.numerator, d );    // simplify
                 r.[numerator, denominator] = [r.numerator / t, d / t];
                 return prev;
 …
         // comparison
         int ?==?( Rational(T) l, Rational(T) r ) {
+        int ?==?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return l.numerator * r.denominator == l.denominator * r.numerator;
         } // ?==?
         int ?!=?( Rational(T) l, Rational(T) r ) {
+        int ?!=?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return ! ( l == r );
         } // ?!=?
+        int ?!=?( Rational(T) l, zero_t ) {
+                return ! ( l == (Rational(T)){ 0 } );
+        } // ?!=?
+        int ?<?( Rational(T) l, Rational(T) r ) {
+        int ?<?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return l.numerator * r.denominator < l.denominator * r.numerator;
         } // ?<?
         int ?<=?( Rational(T) l, Rational(T) r ) {
+        int ?<=?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return l.numerator * r.denominator <= l.denominator * r.numerator;
         } // ?<=?
         int ?>?( Rational(T) l, Rational(T) r ) {
+        int ?>?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return ! ( l <= r );
         } // ?>?
         int ?>=?( Rational(T) l, Rational(T) r ) {
+        int ?>=?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 return ! ( l < r );
         } // ?>=?
 …
         // arithmetic
         Rational(T) +?( Rational(T) r ) {
                 return (Rational(T)){ r.numerator, r.denominator };
+        Rational(RationalImpl) +?( Rational(RationalImpl) r ) {
+                return (Rational(RationalImpl)){ r.numerator, r.denominator };
         } // +?
         Rational(T) -?( Rational(T) r ) {
                 return (Rational(T)){ -r.numerator, r.denominator };
+        Rational(RationalImpl) -?( Rational(RationalImpl) r ) {
+                return (Rational(RationalImpl)){ -r.numerator, r.denominator };
         } // -?
         Rational(T) ?+?( Rational(T) l, Rational(T) r ) {
+        Rational(RationalImpl) ?+?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 if ( l.denominator == r.denominator ) {                 // special case
                         return (Rational(T)){ l.numerator + r.numerator, l.denominator };
+                        return (Rational(RationalImpl)){ l.numerator + r.numerator, l.denominator };
                 } else {
                         return (Rational(T)){ l.numerator * r.denominator + l.denominator * r.numerator, l.denominator * r.denominator };
+                        return (Rational(RationalImpl)){ l.numerator * r.denominator + l.denominator * r.numerator, l.denominator * r.denominator };
                 } // if
         } // ?+?
+        Rational(T) ?+=?( Rational(T) & l, Rational(T) r ) {
+                l = l + r;
+                return l;
+        } // ?+?
+        Rational(T) ?+=?( Rational(T) & l, one_t ) {
+                l = l + (Rational(T)){ 1 };
+                return l;
+        } // ?+?
+        Rational(T) ?-?( Rational(T) l, Rational(T) r ) {
+        Rational(RationalImpl) ?-?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
                 if ( l.denominator == r.denominator ) {                 // special case
                         return (Rational(T)){ l.numerator - r.numerator, l.denominator };
+                        return (Rational(RationalImpl)){ l.numerator - r.numerator, l.denominator };
                 } else {
                         return (Rational(T)){ l.numerator * r.denominator - l.denominator * r.numerator, l.denominator * r.denominator };
+                        return (Rational(RationalImpl)){ l.numerator * r.denominator - l.denominator * r.numerator, l.denominator * r.denominator };
                 } // if
         } // ?-?
+        Rational(T) ?-=?( Rational(T) & l, Rational(T) r ) {
+                l = l - r;
+                return l;
+        } // ?-?
+        Rational(T) ?-=?( Rational(T) & l, one_t ) {
+                l = l - (Rational(T)){ 1 };
+                return l;
+        } // ?-?
+        Rational(T) ?*?( Rational(T) l, Rational(T) r ) {
+                return (Rational(T)){ l.numerator * r.numerator, l.denominator * r.denominator };
+        Rational(RationalImpl) ?*?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
+                return (Rational(RationalImpl)){ l.numerator * r.numerator, l.denominator * r.denominator };
         } // ?*?
+        Rational(T) ?*=?( Rational(T) & l, Rational(T) r ) {
+                return l = l * r;
+        } // ?*?
+        Rational(T) ?/?( Rational(T) l, Rational(T) r ) {
+                if ( r.numerator < (T){0} ) {
+        Rational(RationalImpl) ?/?( Rational(RationalImpl) l, Rational(RationalImpl) r ) {
+                if ( r.numerator < (RationalImpl){0} ) {
                         r.[numerator, denominator] = [-r.numerator, -r.denominator];
                 } // if
                 return (Rational(T)){ l.numerator * r.denominator, l.denominator * r.numerator };
+                return (Rational(RationalImpl)){ l.numerator * r.denominator, l.denominator * r.numerator };
         } // ?/?
-        Rational(T) ?/=?( Rational(T) & l, Rational(T) r ) {
-                return l = l / r;
-        } // ?/?
         // I/O
         forall( istype & | istream( istype ) | { istype & ?|?( istype &, T & ); } )
         istype & ?|?( istype & is, Rational(T) & r ) {
+        forall( istype & | istream( istype ) | { istype & ?|?( istype &, RationalImpl & ); } )
+        istype & ?|?( istype & is, Rational(RationalImpl) & r ) {
                 is | r.numerator | r.denominator;
                 T t = simplify( r.numerator, r.denominator );
+                RationalImpl t = simplify( r.numerator, r.denominator );
                 r.numerator /= t;
                 r.denominator /= t;
 …
         } // ?|?
         forall( ostype & | ostream( ostype ) | { ostype & ?|?( ostype &, T ); } ) {
                 ostype & ?|?( ostype & os, Rational(T) r ) {
+        forall( ostype & | ostream( ostype ) | { ostype & ?|?( ostype &, RationalImpl ); } ) {
+                ostype & ?|?( ostype & os, Rational(RationalImpl) r ) {
                         return os | r.numerator | '/' | r.denominator;
                 } // ?|?
                 void ?|?( ostype & os, Rational(T) r ) {
+                void ?|?( ostype & os, Rational(RationalImpl) r ) {
                         (ostype &)(os | r); ends( os );
                 } // ?|?
 …
 } // distribution
+forall( T | Arithmetic( T ) | { T ?\?( T, unsigned long ); } ) {
+        Rational(T) ?\?( Rational(T) x, long int y ) {
+                if ( y < 0 ) {
+                        return (Rational(T)){ x.denominator \ -y, x.numerator \ -y };
+                } else {
+                        return (Rational(T)){ x.numerator \ y, x.denominator \ y };
+                } // if
+        } // ?\?
+        Rational(T) ?\=?( Rational(T) & x, long int y ) {
+                return x = x \ y;
+        } // ?\?
+} // distribution
+forall( RationalImpl | arithmetic( RationalImpl ) | { RationalImpl ?\?( RationalImpl, unsigned long ); } )
+Rational(RationalImpl) ?\?( Rational(RationalImpl) x, long int y ) {
+        if ( y < 0 ) {
+                return (Rational(RationalImpl)){ x.denominator \ -y, x.numerator \ -y };
+        } else {
+                return (Rational(RationalImpl)){ x.numerator \ y, x.denominator \ y };
+        } // if
+}
 // conversion
 forall( T | Arithmetic( T ) | { double convert( T ); } )
 double widen( Rational(T) r ) {
+forall( RationalImpl | arithmetic( RationalImpl ) | { double convert( RationalImpl ); } )
+double widen( Rational(RationalImpl) r ) {
         return convert( r.numerator ) / convert( r.denominator );
 } // widen
 forall( T | Arithmetic( T ) | { double convert( T ); T convert( double ); } )
 Rational(T) narrow( double f, T md ) {
+forall( RationalImpl | arithmetic( RationalImpl ) | { double convert( RationalImpl ); RationalImpl convert( double ); } )
+Rational(RationalImpl) narrow( double f, RationalImpl md ) {
         // http://www.ics.uci.edu/~eppstein/numth/frap.c
         if ( md <= (T){1} ) {                                   // maximum fractional digits too small?
                 return (Rational(T)){ convert( f ), (T){1}}; // truncate fraction
+        if ( md <= (RationalImpl){1} ) {                                        // maximum fractional digits too small?
+                return (Rational(RationalImpl)){ convert( f ), (RationalImpl){1}}; // truncate fraction
         } // if
         // continued fraction coefficients
         T m00 = {1}, m11 = { 1 }, m01 = { 0 }, m10 = { 0 };
         T ai, t;
+        RationalImpl m00 = {1}, m11 = { 1 }, m01 = { 0 }, m10 = { 0 };
+        RationalImpl ai, t;
         // find terms until denom gets too big
 …
           if ( f > (double)0x7FFFFFFF ) break;                          // representation failure
         } // for
         return (Rational(T)){ m00, m10 };
+        return (Rational(RationalImpl)){ m00, m10 };
 } // narrow

libcfa/src/rational.hfa

-              r5541ea3d
+              r0640189e
 // Created On       : Wed Apr  6 17:56:25 2016
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jul 20 17:45:29 2021
 // Update Count     : 118
+// Last Modified On : Tue Mar 26 23:16:10 2019
+// Update Count     : 109
 //
 …
 #include "iostream.hfa"
+#include "math.trait.hfa"                                                               // Arithmetic
+trait scalar( T ) {
+};
+trait arithmetic( T | scalar( T ) ) {
+        int !?( T );
+        int ?==?( T, T );
+        int ?!=?( T, T );
+        int ?<?( T, T );
+        int ?<=?( T, T );
+        int ?>?( T, T );
+        int ?>=?( T, T );
+        void ?{}( T &, zero_t );
+        void ?{}( T &, one_t );
+        T +?( T );
+        T -?( T );
+        T ?+?( T, T );
+        T ?-?( T, T );
+        T ?*?( T, T );
+        T ?/?( T, T );
+        T ?%?( T, T );
+        T ?/=?( T &, T );
+        T abs( T );
+};
 // implementation
 forall( T | Arithmetic( T ) ) {
+forall( RationalImpl | arithmetic( RationalImpl ) ) {
         struct Rational {
                 T numerator, denominator;                                               // invariant: denominator > 0
+                RationalImpl numerator, denominator;                    // invariant: denominator > 0
         }; // Rational
         // constructors
         void ?{}( Rational(T) & r );
         void ?{}( Rational(T) & r, zero_t );
         void ?{}( Rational(T) & r, one_t );
         void ?{}( Rational(T) & r, T n );
         void ?{}( Rational(T) & r, T n, T d );
+        void ?{}( Rational(RationalImpl) & r );
+        void ?{}( Rational(RationalImpl) & r, RationalImpl n );
+        void ?{}( Rational(RationalImpl) & r, RationalImpl n, RationalImpl d );
+        void ?{}( Rational(RationalImpl) & r, zero_t );
+        void ?{}( Rational(RationalImpl) & r, one_t );
         // numerator/denominator getter
         T numerator( Rational(T) r );
         T denominator( Rational(T) r );
         [ T, T ] ?=?( & [ T, T ] dest, Rational(T) src );
+        RationalImpl numerator( Rational(RationalImpl) r );
+        RationalImpl denominator( Rational(RationalImpl) r );
+        [ RationalImpl, RationalImpl ] ?=?( & [ RationalImpl, RationalImpl ] dest, Rational(RationalImpl) src );
         // numerator/denominator setter
         T numerator( Rational(T) r, T n );
         T denominator( Rational(T) r, T d );
+        RationalImpl numerator( Rational(RationalImpl) r, RationalImpl n );
+        RationalImpl denominator( Rational(RationalImpl) r, RationalImpl d );
         // comparison
+        int ?==?( Rational(T) l, Rational(T) r );
+        int ?!=?( Rational(T) l, Rational(T) r );
+        int ?!=?( Rational(T) l, zero_t );                                      // => !
+        int ?<?( Rational(T) l, Rational(T) r );
+        int ?<=?( Rational(T) l, Rational(T) r );
+        int ?>?( Rational(T) l, Rational(T) r );
+        int ?>=?( Rational(T) l, Rational(T) r );
+        int ?==?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        int ?!=?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        int ?<?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        int ?<=?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        int ?>?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        int ?>=?( Rational(RationalImpl) l, Rational(RationalImpl) r );
         // arithmetic
+        Rational(T) +?( Rational(T) r );
+        Rational(T) -?( Rational(T) r );
+        Rational(T) ?+?( Rational(T) l, Rational(T) r );
+        Rational(T) ?+=?( Rational(T) & l, Rational(T) r );
+        Rational(T) ?+=?( Rational(T) & l, one_t );                     // => ++?, ?++
+        Rational(T) ?-?( Rational(T) l, Rational(T) r );
+        Rational(T) ?-=?( Rational(T) & l, Rational(T) r );
+        Rational(T) ?-=?( Rational(T) & l, one_t );                     // => --?, ?--
+        Rational(T) ?*?( Rational(T) l, Rational(T) r );
+        Rational(T) ?*=?( Rational(T) & l, Rational(T) r );
+        Rational(T) ?/?( Rational(T) l, Rational(T) r );
+        Rational(T) ?/=?( Rational(T) & l, Rational(T) r );
+        Rational(RationalImpl) +?( Rational(RationalImpl) r );
+        Rational(RationalImpl) -?( Rational(RationalImpl) r );
+        Rational(RationalImpl) ?+?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        Rational(RationalImpl) ?-?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        Rational(RationalImpl) ?*?( Rational(RationalImpl) l, Rational(RationalImpl) r );
+        Rational(RationalImpl) ?/?( Rational(RationalImpl) l, Rational(RationalImpl) r );
         // I/O
         forall( istype & | istream( istype ) | { istype & ?|?( istype &, T & ); } )
         istype & ?|?( istype &, Rational(T) & );
+        forall( istype & | istream( istype ) | { istype & ?|?( istype &, RationalImpl & ); } )
+        istype & ?|?( istype &, Rational(RationalImpl) & );
         forall( ostype & | ostream( ostype ) | { ostype & ?|?( ostype &, T ); } ) {
                 ostype & ?|?( ostype &, Rational(T) );
                 void ?|?( ostype &, Rational(T) );
+        forall( ostype & | ostream( ostype ) | { ostype & ?|?( ostype &, RationalImpl ); } ) {
+                ostype & ?|?( ostype &, Rational(RationalImpl) );
+                void ?|?( ostype &, Rational(RationalImpl) );
         } // distribution
 } // distribution
+forall( T | Arithmetic( T ) | { T ?\?( T, unsigned long ); } ) {
+        Rational(T) ?\?( Rational(T) x, long int y );
+        Rational(T) ?\=?( Rational(T) & x, long int y );
+} // distribution
+forall( RationalImpl | arithmetic( RationalImpl ) |{RationalImpl ?\?( RationalImpl, unsigned long );} )
+Rational(RationalImpl) ?\?( Rational(RationalImpl) x, long int y );
 // conversion
 forall( T | Arithmetic( T ) | { double convert( T ); } )
 double widen( Rational(T) r );
 forall( T | Arithmetic( T ) | { double convert( T );  T convert( double );} )
 Rational(T) narrow( double f, T md );
+forall( RationalImpl | arithmetic( RationalImpl ) | { double convert( RationalImpl ); } )
+double widen( Rational(RationalImpl) r );
+forall( RationalImpl | arithmetic( RationalImpl ) | { double convert( RationalImpl );  RationalImpl convert( double );} )
+Rational(RationalImpl) narrow( double f, RationalImpl md );
 // Local Variables: //

src/CompilationState.cc

-              r5541ea3d
+              r0640189e
 // Author           : Rob Schluntz
 // Created On       : Mon Ju1 30 10:47:01 2018
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Jul 20 04:27:35 2021
 // Update Count     : 5
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri May  3 13:45:23 2019
+// Update Count     : 4
 //
 …
         ctorinitp = false,
         declstatsp = false,
-        exdeclp = false,
         exprp = false,
         expraltp = false,

src/CompilationState.h

-              r5541ea3d
+              r0640189e
 // Author           : Rob Schluntz
 // Created On       : Mon Ju1 30 10:47:01 2018
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Jul 20 04:27:35 2021
 // Update Count     : 5
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri May  3 13:43:21 2019
+// Update Count     : 4
 //
 …
         ctorinitp,
         declstatsp,
-        exdeclp,
         exprp,
         expraltp,

src/ControlStruct/ExceptTranslate.cc

-              r5541ea3d
+              r0640189e
 // Author           : Andrew Beach
 // Created On       : Wed Jun 14 16:49:00 2017
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Aug 03 10:05:51 2021
 // Update Count     : 18
+// Last Modified By : Andrew Beach
+// Last Modified On : Wed Jun 24 11:18:00 2020
+// Update Count     : 17
 //
 …
                                 static_cast<ObjectDecl *>( handler->get_decl() );
                         ObjectDecl * local_except = handler_decl->clone();
+                        VirtualCastExpr * vcex = new VirtualCastExpr(
+                                nameOf( except_obj ),
+                                local_except->get_type()
+                        local_except->set_init(
+                                new ListInit({ new SingleInit(
+                                        new VirtualCastExpr( nameOf( except_obj ),
+                                                local_except->get_type()
+                                                )
+                                        ) })
                                 );
-                        vcex->location = handler->location;
-                        local_except->set_init( new ListInit({ new SingleInit( vcex ) }) );
                         block->push_back( new DeclStmt( local_except ) );
 …
                 // Check for type match.
+                VirtualCastExpr * vcex = new VirtualCastExpr(
+                        nameOf( except_obj ),
+                        local_except->get_type()->clone()
+                        );
+                vcex->location = modded_handler->location;
+                Expression * cond = UntypedExpr::createAssign(
+                        nameOf( local_except ), vcex );
+                Expression * cond = UntypedExpr::createAssign( nameOf( local_except ),
+                        new VirtualCastExpr( nameOf( except_obj ),
+                                local_except->get_type()->clone() ) );
                 // Add the check on the conditional if it is provided.

src/ControlStruct/module.mk

-              r5541ea3d
+              r0640189e
 ## Author           : Richard C. Bilson
 ## Created On       : Mon Jun  1 17:49:17 2015
 ## Last Modified By : Henry Xue
 ## Last Modified On : Tue Jul 20 04:10:50 2021
 ## Update Count     : 5
+## Last Modified By : Andrew Beach
+## Last Modified On : Wed Jun 28 16:15:00 2017
+## Update Count     : 4
 ###############################################################################
 SRC_CONTROLSTRUCT = \
-        ControlStruct/ExceptDecl.cc \
-        ControlStruct/ExceptDecl.h \
         ControlStruct/ForExprMutator.cc \
         ControlStruct/ForExprMutator.h \

src/Parser/TypeData.cc

-              r5541ea3d
+              r0640189e
 // Author           : Rodolfo G. Esteves
 // Created On       : Sat May 16 15:12:51 2015
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Jul 20 04:10:50 2021
 // Update Count     : 673
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Wed Jul 14 18:57:31 2021
+// Update Count     : 672
 //
 …
           case AggregateDecl::Struct:
           case AggregateDecl::Coroutine:
-          case AggregateDecl::Exception:
           case AggregateDecl::Generator:
           case AggregateDecl::Monitor:

src/Parser/parser.yy

-              r5541ea3d
+              r0640189e
 // Created On       : Sat Sep  1 20:22:55 2001
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jul 20 22:03:04 2021
 // Update Count     : 5031
+// Last Modified On : Wed Jul 14 17:27:54 2021
+// Update Count     : 5030
 //
 …
 vtable:
         VTABLE '(' type_name ')' default_opt
+        VTABLE '(' typedef_name ')' default_opt
                 { $$ = DeclarationNode::newVtableType( $3 ); }
                 // { SemanticError( yylloc, "vtable is currently unimplemented." ); $$ = nullptr; }

src/SynTree/Declaration.h

-              r5541ea3d
+              r0640189e
 // Author           : Richard C. Bilson
 // Created On       : Mon May 18 07:44:20 2015
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Jul 20 04:10:50 2021
 // Update Count     : 160
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri Mar 12 18:35:36 2021
+// Update Count     : 159
 //
 …
         bool is_coroutine() { return kind == Coroutine; }
-        bool is_exception() { return kind == Exception; }
         bool is_generator() { return kind == Generator; }
         bool is_monitor  () { return kind == Monitor  ; }

src/main.cc

-              r5541ea3d
+              r0640189e
 // Author           : Peter Buhr and Rob Schluntz
 // Created On       : Fri May 15 23:12:02 2015
 // Last Modified By : Henry Xue
 // Last Modified On : Tue Jul 20 04:27:35 2021
 // Update Count     : 658
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Sat Mar  6 15:49:00 2021
+// Update Count     : 656
 //
 …
 #include "Common/utility.h"                 // for deleteAll, filter, printAll
 #include "Concurrency/Waitfor.h"            // for generateWaitfor
-#include "ControlStruct/ExceptDecl.h"       // for translateExcept
 #include "ControlStruct/ExceptTranslate.h"  // for translateEHM
 #include "ControlStruct/Mutate.h"           // for mutate
 …
                 CodeTools::fillLocations( translationUnit );
                 Stats::Time::StopBlock();
-                PASS( "Translate Exception Declarations", ControlStruct::translateExcept( translationUnit ) );
-                if ( exdeclp ) {
-                        dump( translationUnit );
-                        return EXIT_SUCCESS;
-                } // if
                 // add the assignment statement after the initialization of a type parameter
 …
         // code dumps
         { "ast", astp, true, "print AST after parsing" },
-        { "exdecl", exdeclp, true, "print AST after translating exception decls" },
         { "symevt", symtabp, true, "print AST after symbol table events" },
         { "altexpr", expraltp, true, "print alternatives for expressions" },

tests/.expect/counter.txt

r5541ea3d	r0640189e
1		~~inc~~ 45
2		~~dec~~ 42
	1	45
	2	42

tests/.expect/rational.txt

-              r5541ea3d
+              r0640189e
 constructor
+a : 3/1 b : 4/1 c : 0/1 d : 0/1 e : 1/1
+a : 1/2 b : 5/7
+a : 2/3 b : -3/2
+a : -2/3 b : 3/2
+comparison
+a : -2/1 b : -3/2
+a == 0 : 0
+a == 1 : 0
+a != 0 : 1
+! a : 0
+a != b : 1
+a <  b : 1
+a <=  b : 1
+a >  b : 0
+a >=  b : 0
+/1 4/1 0/1 0/1 1/1
+/2 5/7
+/3 -3/2
+-2/3 3/2
+logical
+-2/1 -3/2
 arithmetic
+a : -2/1 b : -3/2
+a + b : -7/2
+a += b : -7/2
+++a : -5/2
+a++ : -5/2
+a : -3/2
+a - b : 0/1
+a -= b : 0/1
+--a : -1/1
+a-- : -1/1
+a : -2/1
+a * b : 3/1
+a / b : 4/3
+a \ 2 : 4/1 b \ 2 : 9/4
+a \ -2 : 1/4 b \ -2 : 4/9
+-2/1 -3/2
+-7/2
+-1/2
+/1
+/3
 conversion
 .75
 …
 /7
 /113
+decompose
 more tests
 -3/2

tests/counter.cfa

-              r5541ea3d
+              r0640189e
 // Created On       : Thu Feb 22 15:27:00 2018
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jul 20 21:25:30 2021
 // Update Count     : 4
+// Last Modified On : Tue Nov  6 17:50:23 2018
+// Update Count     : 2
 //
-#include <fstream.hfa>
 // Tests unified increment/decrement builtin functions.
 …
 struct counter { int x; };
+counter ?+=?( counter & c, one_t ) { ++c.x; return c; }
+counter ?-=?( counter & c, one_t ) { --c.x; return c; }
+counter& ?+=?( counter& c, one_t ) { ++c.x; return c; }
+counter& ?-=?( counter& c, one_t ) { --c.x; return c; }
 int main() {
 …
     ++c;
     c++;
     sout | "inc" | c.x;
+    printf("%d\n", c.x);
     c -= 1;
     --c;
     c--;
     sout | "dec" | c.x;
+    printf("%d\n", c.x);
+}

tests/polymorphism.cfa

-              r5541ea3d
+              r0640189e
                 printf("  offset of inner float:  %ld\n", ((char *) & x_inner_float ) - ((char *) & x) );
         void showStatic( thing(long long int) & x ) {
+        void showStatic( thing(int) & x ) {
                 printf("static:\n");
                 SHOW_OFFSETS
 …
         printf("=== checkPlan9offsets\n");
         thing(long long int) x;
+        thing(int) x;
         showStatic(x);
         showDynamic(x);

tests/rational.cfa

-              r5541ea3d
+              r0640189e
 // Created On       : Mon Mar 28 08:43:12 2016
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jul 20 18:13:40 2021
 // Update Count     : 107
+// Last Modified On : Sat Feb  8 18:46:23 2020
+// Update Count     : 86
 //
 …
         sout | "constructor";
         RatInt a = { 3 }, b = { 4 }, c, d = 0, e = 1;
         sout | "a : " | a | "b : " | b | "c : " | c | "d : " | d | "e : " | e;
+        sout | a | b | c | d | e;
         a = (RatInt){ 4, 8 };
         b = (RatInt){ 5, 7 };
         sout | "a : " | a | "b : " | b;
+        sout | a | b;
         a = (RatInt){ -2, -3 };
         b = (RatInt){ 3, -2 };
         sout | "a : " | a | "b : " | b;
+        sout | a | b;
         a = (RatInt){ -2, 3 };
         b = (RatInt){ 3, 2 };
+        sout | "a : " | a | "b : " | b;
+        sout | nl;
+        sout | a | b;
         sout | "comparison";
+        sout | "logical";
         a = (RatInt){ -2 };
         b = (RatInt){ -3, 2 };
+        sout | "a : " | a | "b : " | b;
+        sout | "a == 0 : " | a == (Rational(int)){0}; // FIX ME
+        sout | "a == 1 : " | a == (Rational(int)){1}; // FIX ME
+        sout | "a != 0 : " | a != 0;
+        sout | "! a : " | ! a;
+        sout | "a != b : " | a != b;
+        sout | "a <  b : " | a <  b;
+        sout | "a <=  b : " | a <= b;
+        sout | "a >  b : " | a >  b;
+        sout | "a >=  b : " | a >= b;
+        sout | nl;
+        sout | a | b;
+//      sout | a == 1; // FIX ME
+        sout | a != b;
+        sout | a <  b;
+        sout | a <= b;
+        sout | a >  b;
+        sout | a >= b;
         sout | "arithmetic";
+        sout | "a : " | a | "b : " | b;
+        sout | "a + b : " | a + b;
+        sout | "a += b : " | (a += b);
+        sout | "++a : " | ++a;
+        sout | "a++ : " | a++;
+        sout | "a : " | a;
+        sout | "a - b : " | a - b;
+        sout | "a -= b : " | (a -= b);
+        sout | "--a : " | --a;
+        sout | "a-- : " | a--;
+        sout | "a : " | a;
+        sout | "a * b : " | a * b;
+        sout | "a / b : " | a / b;
+        sout | "a \\ 2 : " | a \ 2u | "b \\ 2 : " | b \ 2u;
+        sout | "a \\ -2 : " | a \ -2 | "b \\ -2 : " | b \ -2;
+        sout | nl;
+        sout | a | b;
+        sout | a + b;
+        sout | a - b;
+        sout | a * b;
+        sout | a / b;
+//      sout | a \ 2 | b \ 2; // FIX ME
+//      sout | a \ -2 | b \ -2;
         sout | "conversion";
 …
         sout | narrow( 0.14285714285714, 16 );
         sout | narrow( 3.14159265358979, 256 );
-        sout | nl;
         // sout | "decompose";
         // int n, d;
         // [n, d] = a;
         // sout | a | n | d;
+        sout | "decompose";
+        int n, d;
+//      [n, d] = a;
+//      sout | a | n | d;
         sout | "more tests";

Context Navigation

Changes in / [5541ea3d:0640189e]

Legend:

Download in other formats: