Changeset 7a052e34

doc/papers/general/Makefile

r1dcd52a3	r7a052e34
18	18
19	19	FIGURES = ${addsuffix .tex, \
	20	Cdecl \
20	21	}
21	22

doc/papers/general/Paper.tex

-                      r1dcd52a3
+                      r7a052e34
 \makeatother
+\newenvironment{cquote}{%
+        \list{}{\lstset{resetmargins=true,aboveskip=0pt,belowskip=0pt}\topsep=4pt\parsep=0pt\leftmargin=\parindent\rightmargin\leftmargin}%
+        \item\relax
+}{%
+        \endlist
+}% cquote
 % CFA programming language, based on ANSI C (with some gcc additions)
 \lstdefinelanguage{CFA}[ANSI]{C}{
 …
 int forty_two = identity( 42 );                         $\C{// T is bound to int, forty\_two == 42}$
 \end{lstlisting}
 The @identity@ function above can be applied to any complete \emph{object type} (or @otype@).
+The @identity@ function above can be applied to any complete \newterm{object type} (or @otype@).
 The type variable @T@ is transformed into a set of additional implicit parameters encoding sufficient information about @T@ to create and return a variable of that type.
 The \CFA implementation passes the size and alignment of the type represented by an @otype@ parameter, as well as an assignment operator, constructor, copy constructor and destructor.
 If this extra information is not needed, \eg for a pointer, the type parameter can be declared as a \emph{data type} (or @dtype@).
+If this extra information is not needed, \eg for a pointer, the type parameter can be declared as a \newterm{data type} (or @dtype@).
 In \CFA, the polymorphism runtime-cost is spread over each polymorphic call, due to passing more arguments to polymorphic functions;
 …
 A design advantage is that, unlike \CC template-functions, \CFA polymorphic-functions are compatible with C \emph{separate compilation}, preventing compilation and code bloat.
 Since bare polymorphic-types provide a restricted set of available operations, \CFA provides a \emph{type assertion}~\cite[pp.~37-44]{Alphard} mechanism to provide further type information, where type assertions may be variable or function declarations that depend on a polymorphic type-variable.
+Since bare polymorphic-types provide a restricted set of available operations, \CFA provides a \newterm{type assertion}~\cite[pp.~37-44]{Alphard} mechanism to provide further type information, where type assertions may be variable or function declarations that depend on a polymorphic type-variable.
 For example, the function @twice@ can be defined using the \CFA syntax for operator overloading:
 \begin{lstlisting}
 …
 \end{lstlisting}
 Here, the single name @MAX@ replaces all the C type-specific names: @SHRT_MAX@, @INT_MAX@, @DBL_MAX@.
-As well, restricted constant overloading is allowed for the values @0@ and @1@, which have special status in C, \eg the value @0@ is both an integer and a pointer literal, so its meaning depends on context.
-In addition, several operations are defined in terms values @0@ and @1@, \eg:
-\begin{lstlisting}
-int x;
-if (x) x++                                                                      $\C{// if (x != 0) x += 1;}$
-\end{lstlisting}
-Every @if@ and iteration statement in C compares the condition with @0@, and every increment and decrement operator is semantically equivalent to adding or subtracting the value @1@ and storing the result.
-Due to these rewrite rules, the values @0@ and @1@ have the types @zero_t@ and @one_t@ in \CFA, which allows overloading various operations for new types that seamlessly connect to all special @0@ and @1@ contexts.
-The types @zero_t@ and @one_t@ have special built in implicit conversions to the various integral types, and a conversion to pointer types for @0@, which allows standard C code involving @0@ and @1@ to work as normal.
 \subsection{Traits}
 \CFA provides \emph{traits} to name a group of type assertions, where the trait name allows specifying the same set of assertions in multiple locations, preventing repetition mistakes at each function declaration:
+\CFA provides \newterm{traits} to name a group of type assertions, where the trait name allows specifying the same set of assertions in multiple locations, preventing repetition mistakes at each function declaration:
 \begin{lstlisting}
 trait summable( otype T ) {
 …
 Given the information provided for an @otype@, variables of polymorphic type can be treated as if they were a complete type: stack-allocatable, default or copy-initialized, assigned, and deleted.
 In summation, the \CFA type-system uses \emph{nominal typing} for concrete types, matching with the C type-system, and \emph{structural typing} for polymorphic types.
+In summation, the \CFA type-system uses \newterm{nominal typing} for concrete types, matching with the C type-system, and \newterm{structural typing} for polymorphic types.
 Hence, trait names play no part in type equivalence;
 the names are simply macros for a list of polymorphic assertions, which are expanded at usage sites.
 …
 Furthermore, writing and using preprocessor macros can be unnatural and inflexible.
 \CC, Java, and other languages use \emph{generic types} to produce type-safe abstract data-types.
+\CC, Java, and other languages use \newterm{generic types} to produce type-safe abstract data-types.
 \CFA also implements generic types that integrate efficiently and naturally with the existing polymorphic functions, while retaining backwards compatibility with C and providing separate compilation.
 However, for known concrete parameters, the generic-type definition can be inlined, like \CC templates.
 …
 \end{lstlisting}
 \CFA classifies generic types as either \emph{concrete} or \emph{dynamic}.
+\CFA classifies generic types as either \newterm{concrete} or \newterm{dynamic}.
 Concrete types have a fixed memory layout regardless of type parameters, while dynamic types vary in memory layout depending on their type parameters.
 A type may have polymorphic parameters but still be concrete, called \emph{dtype-static}.
+A type may have polymorphic parameters but still be concrete, called \newterm{dtype-static}.
 Polymorphic pointers are an example of dtype-static types, \eg @forall(dtype T) T *@ is a polymorphic type, but for any @T@, @T *@  is a fixed-sized pointer, and therefore, can be represented by a @void *@ in code generation.
 …
 Though \CFA implements concrete generic-types efficiently, it also has a fully general system for dynamic generic types.
 As mentioned in Section~\ref{sec:poly-fns}, @otype@ function parameters (in fact all @sized@ polymorphic parameters) come with implicit size and alignment parameters provided by the caller.
 Dynamic generic-types also have an \emph{offset array} containing structure-member offsets.
+Dynamic generic-types also have an \newterm{offset array} containing structure-member offsets.
 A dynamic generic-union needs no such offset array, as all members are at offset 0, but size and alignment are still necessary.
 Access to members of a dynamic structure is provided at runtime via base-displacement addressing with the structure pointer and the member offset (similar to the @offsetof@ macro), moving a compile-time offset calculation to runtime.
 …
 For instance, modularity is generally provided in C by including an opaque forward-declaration of a structure and associated accessor and mutator functions in a header file, with the actual implementations in a separately-compiled @.c@ file.
 \CFA supports this pattern for generic types, but the caller does not know the actual layout or size of the dynamic generic-type, and only holds it by a pointer.
 The \CFA translator automatically generates \emph{layout functions} for cases where the size, alignment, and offset array of a generic struct cannot be passed into a function from that function's caller.
+The \CFA translator automatically generates \newterm{layout functions} for cases where the size, alignment, and offset array of a generic struct cannot be passed into a function from that function's caller.
 These layout functions take as arguments pointers to size and alignment variables and a caller-allocated array of member offsets, as well as the size and alignment of all @sized@ parameters to the generic structure (un@sized@ parameters are forbidden from being used in a context that affects layout).
 Results of these layout functions are cached so that they are only computed once per type per function. %, as in the example below for @pair@.
 …
 Since @pair(T *, T * )@ is a concrete type, there are no implicit parameters passed to @lexcmp@, so the generated code is identical to a function written in standard C using @void *@, yet the \CFA version is type-checked to ensure the fields of both pairs and the arguments to the comparison function match in type.
 Another useful pattern enabled by reused dtype-static type instantiations is zero-cost \emph{tag-structures}.
+Another useful pattern enabled by reused dtype-static type instantiations is zero-cost \newterm{tag-structures}.
 Sometimes information is only used for type-checking and can be omitted at runtime, \eg:
 \begin{lstlisting}
 …
 The addition of multiple-return-value functions (MRVF) are useless without a syntax for accepting multiple values at the call-site.
 The simplest mechanism for capturing the return values is variable assignment, allowing the values to be retrieved directly.
 As such, \CFA allows assigning multiple values from a function into multiple variables, using a square-bracketed list of lvalue expressions (as above), called a \emph{tuple}.
 However, functions also use \emph{composition} (nested calls), with the direct consequence that MRVFs must also support composition to be orthogonal with single-returning-value functions (SRVF), \eg:
+As such, \CFA allows assigning multiple values from a function into multiple variables, using a square-bracketed list of lvalue expressions (as above), called a \newterm{tuple}.
+However, functions also use \newterm{composition} (nested calls), with the direct consequence that MRVFs must also support composition to be orthogonal with single-returning-value functions (SRVF), \eg:
 \begin{lstlisting}
 printf( "%d %d\n", div( 13, 5 ) );                      $\C{// return values seperated into arguments}$
 …
 printf( "%d %d\n", qr );
 \end{lstlisting}
 \CFA also supports \emph{tuple indexing} to access single components of a tuple expression:
+\CFA also supports \newterm{tuple indexing} to access single components of a tuple expression:
 \begin{lstlisting}
 [int, int] * p = &qr;                                           $\C{// tuple pointer}$
 …
 \subsection{Tuple Assignment}
 An assignment where the left side is a tuple type is called \emph{tuple assignment}.
 There are two kinds of tuple assignment depending on whether the right side of the assignment operator has a tuple type or a non-tuple type, called \emph{multiple} and \emph{mass assignment}, respectively.
+An assignment where the left side is a tuple type is called \newterm{tuple assignment}.
+There are two kinds of tuple assignment depending on whether the right side of the assignment operator has a tuple type or a non-tuple type, called \newterm{multiple} and \newterm{mass assignment}, respectively.
 %\lstDeleteShortInline@%
 %\par\smallskip
 …
 \subsection{Member Access}
 It is also possible to access multiple fields from a single expression using a \emph{member-access}.
+It is also possible to access multiple fields from a single expression using a \newterm{member-access}.
 The result is a single tuple-valued expression whose type is the tuple of the types of the members, \eg:
 \begin{lstlisting}
 …
 Matching against a @ttype@ parameter consumes all remaining argument components and packages them into a tuple, binding to the resulting tuple of types.
 In a given parameter list, there must be at most one @ttype@ parameter that occurs last, which matches normal variadic semantics, with a strong feeling of similarity to \CCeleven variadic templates.
 As such, @ttype@ variables are also called \emph{argument packs}.
+As such, @ttype@ variables are also called \newterm{argument packs}.
 Like variadic templates, the main way to manipulate @ttype@ polymorphic functions is via recursion.
 …
 \subsection{Implementation}
 Tuples are implemented in the \CFA translator via a transformation into \emph{generic types}.
+Tuples are implemented in the \CFA translator via a transformation into \newterm{generic types}.
 For each $N$, the first time an $N$-tuple is seen in a scope a generic type with $N$ type parameters is generated, \eg:
 \begin{lstlisting}
 …
 Similarly, tuple member expressions are recursively expanded into a list of member access expressions.
 Expressions that may contain side effects are made into \emph{unique expressions} before being expanded by the flattening conversion.
+Expressions that may contain side effects are made into \newterm{unique expressions} before being expanded by the flattening conversion.
 Each unique expression is assigned an identifier and is guaranteed to be executed exactly once:
 \begin{lstlisting}
 …
 The implicit targets of the current @continue@ and @break@, \ie the closest enclosing loop or @switch@, change as certain constructs are added or removed.
+\TODO{choose and fallthrough here as well?}
+\subsection{\texorpdfstring{Enhanced \LstKeywordStyle{switch} Statement}{Enhanced switch Statement}}
+\CFA also fixes a number of ergonomic defecits in the @switch@ statements of standard C.
+C can specify a number of equivalent cases by using the default ``fall-through'' semantics of @case@ clauses, \eg @case 1: case 2: case 3:@ -- this syntax is cluttered, however, so \CFA includes a more concise list syntax, @case 1, 2, 3:@.
+For contiguous ranges, \CFA provides an even more concise range syntax as well, @case 1~3:@; lists of ranges are also allowed in case selectors.
+Forgotten @break@ statements at the end of @switch@ cases are a persistent sort of programmer error in C, and the @break@ statements themselves introduce visual clutter and an un-C-like keyword-based block delimiter.
+\CFA addresses this error by introducing a @choose@ statement, which works identically to a @switch@ except that its default end-of-case behaviour is to break rather than to fall through for all non-empty cases.
+Since empty cases like @case 7:@ in @case 7: case 11:@ still have fall-through semantics and explicit @break@ is still allowed at the end of a @choose@ case, many idiomatic uses of @switch@ in standard C can be converted to @choose@ statements by simply changing the keyword.
+Where fall-through is desired for a non-empty case, it can be specified with the new @fallthrough@ statement, making @choose@ equivalently powerful to @switch@, but more concise in the common case where most non-empty cases end with a @break@ statement, as in the example below:
+\begin{cfa}
+choose( i ) {
+        case 2:
+                printf("even ");
+                fallthrough;
+        case 3: case 5: case 7:
+                printf("small prime\n");
+        case 4,6,8,9:
+                printf("small composite\n");
+        case 13~19:
+                printf("teen\n");
+        default:
+                printf("something else\n");
+}
+\end{cfa}
 \subsection{\texorpdfstring{\LstKeywordStyle{with} Clause / Statement}{with Clause / Statement}}
 …
 % In object-oriented programming, there is an implicit first parameter, often names @self@ or @this@, which is elided.
 % In any programming language, some functions have a naturally close relationship with a particular data type.
 % Object-oriented programming allows this close relationship to be codified in the language by making such functions \emph{class methods} of their related data type.
+% Object-oriented programming allows this close relationship to be codified in the language by making such functions \newterm{class methods} of their related data type.
 % Class methods have certain privileges with respect to their associated data type, notably un-prefixed access to the fields of that data type.
 % When writing C functions in an object-oriented style, this un-prefixed access is swiftly missed, as access to fields of a @Foo* f@ requires an extra three characters @f->@ every time, which disrupts coding flow and clutters the produced code.
 …
 C declaration syntax is notoriously confusing and error prone.
 For example, many C programmers are confused by a declaration as simple as:
 \begin{flushleft}
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}ll@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{flushleft}
+\end{cquote}
 Is this an array of 5 pointers to integers or a pointer to an array of 5 integers?
 The fact this declaration is unclear to many C programmers means there are productivity and safety issues even for basic programs.
+If there is any doubt, it implies productivity and safety issues even for basic programs.
 Another example of confusion results from the fact that a routine name and its parameters are embedded within the return type, mimicking the way the return value is used at the routine's call site.
 For example, a routine returning a pointer to an array of integers is defined and used in the following way:
 …
 In the following example, \R{red} is the base type and \B{blue} is qualifiers.
 The \CFA declarations move the qualifiers to the left of the base type, \ie move the blue to the left of the red, while the qualifiers have the same meaning but are ordered left to right to specify a variable's type.
 \begin{quote}
+\begin{cquote}
 \lstDeleteShortInline@%
 \lstset{moredelim=**[is][\color{blue}]{+}{+}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
+\end{cquote}
 The only exception is bit field specification, which always appear to the right of the base type.
 % Specifically, the character ©*© is used to indicate a pointer, square brackets ©[©\,©]© are used to represent an array or function return value, and parentheses ©()© are used to indicate a routine parameter.
+% Specifically, the character @*@ is used to indicate a pointer, square brackets @[@\,@]@ are used to represent an array or function return value, and parentheses @()@ are used to indicate a routine parameter.
 However, unlike C, \CFA type declaration tokens are distributed across all variables in the declaration list.
 For instance, variables ©x© and ©y© of type pointer to integer are defined in \CFA as follows:
 \begin{quote}
+For instance, variables @x@ and @y@ of type pointer to integer are defined in \CFA as follows:
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{3em}}l@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
+\end{cquote}
 The downside of this semantics is the need to separate regular and pointer declarations:
 \begin{quote}
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{3em}}l@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
+\end{cquote}
 which is prescribing a safety benefit.
 Other examples are:
 \begin{quote}
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{3em}}l@{\hspace{2em}}l@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
 All type qualifiers, \eg ©const©, ©volatile©, etc., are used in the normal way with the new declarations and also appear left to right, \eg:
 \begin{quote}
+\end{cquote}
+All type qualifiers, \eg @const@, @volatile@, etc., are used in the normal way with the new declarations and also appear left to right, \eg:
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{1em}}l@{\hspace{1em}}l@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
 All declaration qualifiers, \eg ©extern©, ©static©, etc., are used in the normal way with the new declarations but can only appear at the start of a \CFA routine declaration,\footnote{\label{StorageClassSpecifier}
+\end{cquote}
+All declaration qualifiers, \eg @extern@, @static@, etc., are used in the normal way with the new declarations but can only appear at the start of a \CFA routine declaration,\footnote{\label{StorageClassSpecifier}
 The placement of a storage-class specifier other than at the beginning of the declaration specifiers in a declaration is an obsolescent feature.~\cite[\S~6.11.5(1)]{C11}} \eg:
 \begin{quote}
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{3em}}l@{\hspace{2em}}l@{}}
 …
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
 The new declaration syntax can be used in other contexts where types are required, \eg casts and the pseudo-routine ©sizeof©:
 \begin{quote}
+\end{cquote}
+The new declaration syntax can be used in other contexts where types are required, \eg casts and the pseudo-routine @sizeof@:
+\begin{cquote}
 \lstDeleteShortInline@%
 \begin{tabular}{@{}l@{\hspace{3em}}l@{}}
 \multicolumn{1}{c@{\hspace{3em}}}{\textbf{\CFA}}        & \multicolumn{1}{c}{\textbf{C}}        \\
 \begin{cfa}
 y = (`* int`)x;
 i = sizeof(`[ 5 ] * int`);
+y = (* int)x;
+i = sizeof([ 5 ] * int);
 \end{cfa}
+&
 \begin{cfa}
 y = (`int *`)x;
 i = sizeof(`int * [ 5 ]`);
+y = (int *)x;
+i = sizeof(int * [ 5 ]);
 \end{cfa}
 \end{tabular}
 \lstMakeShortInline@%
 \end{quote}
+\end{cquote}
 Finally, new \CFA declarations may appear together with C declarations in the same program block, but cannot be mixed within a specific declaration.
 Therefore, a programmer has the option of either continuing to use traditional C declarations or take advantage of the new style.
 Clearly, both styles need to be supported for some time due to existing C-style header-files, particularly for UNIX systems.
+Clearly, both styles need to be supported for some time due to existing C-style header-files, particularly for UNIX-like systems.
 \subsection{References}
+All variables in C have an \emph{address}, a \emph{value}, and a \emph{type}; at the position in the program's memory denoted by the address, there exists a sequence of bits (the value), with the length and semantic meaning of this bit sequence defined by the type.
+The C type system does not always track the relationship between a value and its address; a value that does not have a corresponding address is called a \emph{rvalue} (for ``right-hand value''), while a value that does have an address is called a \emph{lvalue} (for ``left-hand value''); in @int x; x = 42;@ the variable expression @x@ on the left-hand-side of the assignment is a lvalue, while the constant expression @42@ on the right-hand-side of the assignment is a rvalue.
+Which address a value is located at is sometimes significant; the imperative programming paradigm of C relies on the mutation of values at specific addresses.
+Within a lexical scope, lvalue exressions can be used in either their \emph{address interpretation} to determine where a mutated value should be stored or in their \emph{value interpretation} to refer to their stored value; in @x = y;@ in @{ int x, y = 7; x = y; }@, @x@ is used in its address interpretation, while y is used in its value interpretation.
+Though this duality of interpretation is useful, C lacks a direct mechanism to pass lvalues between contexts, instead relying on \emph{pointer types} to serve a similar purpose.
+In C, for any type @T@ there is a pointer type @T*@, the value of which is the address of a value of type @T@; a pointer rvalue can be explicitly \emph{dereferenced} to the pointed-to lvalue with the dereference operator @*?@, while the rvalue representing the address of a lvalue can be obtained with the address-of operator @&?@.
+All variables in C have an \newterm{address}, a \newterm{value}, and a \newterm{type};
+at the position in the program's memory denoted by the address, there exists a sequence of bits (the value), with the length and semantic meaning of this bit sequence defined by the type.
+The C type-system does not always track the relationship between a value and its address;
+a value that does not have a corresponding address is called a \newterm{rvalue} (for ``right-hand value''), while a value that does have an address is called a \newterm{lvalue} (for ``left-hand value'').
+For example, in @int x; x = 42;@ the variable expression @x@ on the left-hand-side of the assignment is a lvalue, while the constant expression @42@ on the right-hand-side of the assignment is a rvalue.
+Despite the nomenclature of ``left-hand'' and ``right-hand'', an expression's classification as lvalue or rvalue is entirely dependent on whether it has an address or not; in imperative programming, the address of a value is used for both reading and writing (mutating) a value, and as such lvalues can be converted to rvalues and read from, but rvalues cannot be mutated because they lack a location to store the updated value.
+Within a lexical scope, lvalue expressions have an \newterm{address interpretation} for writing a value or a \newterm{value interpretation} to read a value.
+For example, in @x = y@, @x@ has an address interpretation, while @y@ has a value interpretation.
+Though this duality of interpretation is useful, C lacks a direct mechanism to pass lvalues between contexts, instead relying on \newterm{pointer types} to serve a similar purpose.
+In C, for any type @T@ there is a pointer type @T *@, the value of which is the address of a value of type @T@.
+A pointer rvalue can be explicitly \newterm{dereferenced} to the pointed-to lvalue with the dereference operator @*?@, while the rvalue representing the address of a lvalue can be obtained with the address-of operator @&?@.
 \begin{cfa}
 int x = 1, y = 2, * p1, * p2, ** p3;
 p1 = &x;  $\C{// p1 points to x}$
 p2 = &y;  $\C{// p2 points to y}$
 p3 = &p1;  $\C{// p3 points to p1}$
+p1 = &x;                                                                $\C{// p1 points to x}$
+p2 = &y;                                                                $\C{// p2 points to y}$
+p3 = &p1;                                                               $\C{// p3 points to p1}$
 *p2 = ((*p1 + *p2) * (**p3 - *p1)) / (**p3 - 15);
 \end{cfa}
 …
 Unfortunately, the dereference and address-of operators introduce a great deal of syntactic noise when dealing with pointed-to values rather than pointers, as well as the potential for subtle bugs.
 For both brevity and clarity, it would be desirable to have the compiler figure out how to elide the dereference operators in a complex expression such as the assignment to @*p2@ above.
 However, since C defines a number of forms of \emph{pointer arithmetic}, two similar expressions involving pointers to arithmetic types (\eg @*p1 + x@ and @p1 + x@) may each have well-defined but distinct semantics, introducing the possibility that a user programmer may write one when they mean the other, and precluding any simple algorithm for elision of dereference operators.
+However, since C defines a number of forms of \newterm{pointer arithmetic}, two similar expressions involving pointers to arithmetic types (\eg @*p1 + x@ and @p1 + x@) may each have well-defined but distinct semantics, introducing the possibility that a user programmer may write one when they mean the other, and precluding any simple algorithm for elision of dereference operators.
 To solve these problems, \CFA introduces reference types @T&@; a @T&@ has exactly the same value as a @T*@, but where the @T*@ takes the address interpretation by default, a @T&@ takes the value interpretation by default, as below:
 \begin{cfa}
 inx x = 1, y = 2, & r1, & r2, && r3;
+int x = 1, y = 2, & r1, & r2, && r3;
 &r1 = &x;  $\C{// r1 points to x}$
 &r2 = &y;  $\C{// r2 points to y}$
 …
 This allows \CFA references to be default-initialized (\eg to a null pointer), and also to point to different addresses throughout their lifetime.
 This rebinding is accomplished without adding any new syntax to \CFA, but simply by extending the existing semantics of the address-of operator in C.
 In C, the address of a lvalue is always a rvalue, as in general that address is not stored anywhere in memory, and does not itself have an address.
 In \CFA, the address of a @T&@ is a lvalue @T*@, as the address of the underlying @T@ is stored in the reference, and can thus be mutated there.
 …
         if @L@ is an lvalue of type {@T &@$_1 \cdots$@ &@$_l$} where $l \ge 0$ references (@&@ symbols) then @&L@ has type {@T `*`&@$_{\color{red}1} \cdots$@ &@$_{\color{red}l}$}, \\ \ie @T@ pointer with $l$ references (@&@ symbols).
 \end{itemize}
 Since pointers and references share the same internal representation, code using either is equally performant; in fact the \CFA compiler converts references to pointers internally, and the choice between them in user code can be made based solely on convenience.
+By analogy to pointers, \CFA references also allow cv-qualifiers:
+By analogy to pointers, \CFA references also allow cv-qualifiers such as @const@:
 \begin{cfa}
 …
 More generally, this initialization of references from lvalues rather than pointers is an instance of a ``lvalue-to-reference'' conversion rather than an elision of the address-of operator; this conversion can actually be used in any context in \CFA an implicit conversion would be allowed.
 Similarly, use of a the value pointed to by a reference in an rvalue context can be thought of as a ``reference-to-rvalue'' conversion, and \CFA also includes a qualifier-adding ``reference-to-reference'' conversion, analagous to the @T *@ to @const T *@ conversion in standard C.
+Similarly, use of a the value pointed to by a reference in an rvalue context can be thought of as a ``reference-to-rvalue'' conversion, and \CFA also includes a qualifier-adding ``reference-to-reference'' conversion, analogous to the @T *@ to @const T *@ conversion in standard C.
 The final reference conversion included in \CFA is ``rvalue-to-reference'' conversion, implemented by means of an implicit temporary.
 When an rvalue is used to initialize a reference, it is instead used to initialize a hidden temporary value with the same lexical scope as the reference, and the reference is initialized to the address of this temporary.
 This allows complex values to be succinctly and efficiently passed to functions, without the syntactic overhead of explicit definition of a temporary variable or the runtime cost of pass-by-value.
+\CC allows a similar binding, but only for @const@ references; the more general semantics of \CFA are an attempt to avoid the \emph{const hell} problem, in which addition of a @const@ qualifier to one reference requires a cascading chain of added qualifiers.
+\CC allows a similar binding, but only for @const@ references; the more general semantics of \CFA are an attempt to avoid the \newterm{const hell} problem, in which addition of a @const@ qualifier to one reference requires a cascading chain of added qualifiers.
 \subsection{Constructors and Destructors}
 …
 One of the strengths of C is the control over memory management it gives programmers, allowing resource release to be more consistent and precisely timed than is possible with garbage-collected memory management.
 However, this manual approach to memory management is often verbose, and it is useful to manage resources other than memory (\eg file handles) using the same mechanism as memory.
 \CC is well-known for an approach to manual memory management that addresses both these issues, Resource Aquisition Is Initialization (RAII), implemented by means of special \emph{constructor} and \emph{destructor} functions; we have implemented a similar feature in \CFA.
+\CC is well-known for an approach to manual memory management that addresses both these issues, Resource Aquisition Is Initialization (RAII), implemented by means of special \newterm{constructor} and \newterm{destructor} functions; we have implemented a similar feature in \CFA.
 While RAII is a common feature of object-oriented programming languages, its inclusion in \CFA does not violate the design principle that \CFA retain the same procedural paradigm as C.
 In particular, \CFA does not implement class-based encapsulation: neither the constructor nor any other function has privileged access to the implementation details of a type, except through the translation-unit-scope method of opaque structs provided by C.
 …
 \end{cfa}
 In the example above, a \emph{default constructor} (\ie one with no parameters besides the @this@ parameter) and destructor are defined for the @Array@ struct, a dynamic array of @int@.
 @Array@ is an example of a \emph{managed type} in \CFA, a type with a non-trivial constructor or destructor, or with a field of a managed type.
+In the example above, a \newterm{default constructor} (\ie one with no parameters besides the @this@ parameter) and destructor are defined for the @Array@ struct, a dynamic array of @int@.
+@Array@ is an example of a \newterm{managed type} in \CFA, a type with a non-trivial constructor or destructor, or with a field of a managed type.
 As in the example, all instances of managed types are implicitly constructed upon allocation, and destructed upon deallocation; this ensures proper initialization and cleanup of resources contained in managed types, in this case the @data@ array on the heap.
 The exact details of the placement of these implicit constructor and destructor calls are omitted here for brevity, the interested reader should consult \cite{Schluntz17}.
 Constructor calls are intended to seamlessly integrate with existing C initialization syntax, providing a simple and familiar syntax to veteran C programmers and allowing constructor calls to be inserted into legacy C code with minimal code changes.
 As such, \CFA also provides syntax for \emph{copy initialization} and \emph{initialization parameters}:
+As such, \CFA also provides syntax for \newterm{copy initialization} and \newterm{initialization parameters}:
 \begin{cfa}
 …
 In addition to initialization syntax, \CFA provides two ways to explicitly call constructors and destructors.
 Explicit calls to constructors double as a placement syntax, useful for construction of member fields in user-defined constructors and reuse of large storage allocations.
 While the existing function-call syntax works for explicit calls to constructors and destructors, \CFA also provides a more concise \emph{operator syntax} for both:
+While the existing function-call syntax works for explicit calls to constructors and destructors, \CFA also provides a more concise \newterm{operator syntax} for both:
 \begin{cfa}
 …
 For compatibility with C, a copy constructor from the first union member type is also defined.
 For @struct@ types, each of the four functions are implicitly defined to call their corresponding functions on each member of the struct.
 To better simulate the behaviour of C initializers, a set of \emph{field constructors} is also generated for structures.
+To better simulate the behaviour of C initializers, a set of \newterm{field constructors} is also generated for structures.
 A constructor is generated for each non-empty prefix of a structure's member-list which copy-constructs the members passed as parameters and default-constructs the remaining members.
 To allow users to limit the set of constructors available for a type, when a user declares any constructor or destructor, the corresponding generated function and all field constructors for that type are hidden from expression resolution; similarly, the generated default constructor is hidden upon declaration of any constructor.
 …
 In rare situations user programmers may not wish to have constructors and destructors called; in these cases, \CFA provides an ``escape hatch'' to not call them.
 If a variable is initialized using the syntax \lstinline|S x @= {}| it will be an \emph{unmanaged object}, and will not have constructors or destructors called.
+If a variable is initialized using the syntax \lstinline|S x @= {}| it will be an \newterm{unmanaged object}, and will not have constructors or destructors called.
 Any C initializer can be the right-hand side of an \lstinline|@=| initializer, \eg  \lstinline|Array a @= { 0, 0x0 }|, with the usual C initialization semantics.
 In addition to the expressive power, \lstinline|@=| provides a simple path for migrating legacy C code to \CFA, by providing a mechanism to incrementally convert initializers; the \CFA design team decided to introduce a new syntax for this escape hatch because we believe that our RAII implementation will handle the vast majority of code in a desirable way, and we wished to maintain familiar syntax for this common case.
 …
 \section{Literals}
+C already includes limited polymorphism for literals -- @0@ can be either an integer or a pointer literal, depending on context, while the syntactic forms of literals of the various integer and floating-point types are very similar, differing from each other only in suffix.
+In keeping with the general \CFA approach of adding features while respecting ``the C way'' of doing things, we have extended both C's polymorphic zero and typed literal syntax to interoperate with user-defined types, while maintaining a backwards-compatible semantics.
 \subsection{0/1}
+\TODO{Some text already at the end of Section~\ref{sec:poly-fns}}
+In C, @0@ has the special property that it is the only ``false'' value; by the standard, any value which compares equal to @0@ is false, while any value that compares unequal to @0@ is true.
+As such, an expression @x@ in any boolean context (such as the condition of an @if@ or @while@ statement, or the arguments to an @&&@, @||@, or ternary operator) can be rewritten as @x != 0@ without changing its semantics.
+The operator overloading feature of \CFA provides a natural means to implement this truth value comparison for arbitrary types, but the C type system is not precise enough to distinguish an equality comparison with @0@ from an equality comparison with an arbitrary integer or pointer.
+To provide this precision, \CFA introduces a new type @zero_t@ as type type of literal @0@ (somewhat analagous to @nullptr_t@ and @nullptr@ in \CCeleven); @zero_t@ can only take the value @0@, but has implicit conversions to the integer and pointer types so that standard C code involving @0@ continues to work properly.
+With this addition, the \CFA compiler rewrites @if (x)@ and similar expressions to @if ((x) != 0)@ or the appropriate analogue, and any type @T@ can be made ``truthy'' by defining an operator overload @int ?!=?(T, zero_t)@.
+\CC makes types truthy by adding a conversion to @bool@; prior to the addition of explicit cast operators in \CCeleven this approach had the pitfall of making truthy types transitively convertable to any numeric type; our design for \CFA avoids this issue.
+\CFA also includes a special type for @1@, @one_t@; like @zero_t@, @one_t@ has built-in implicit conversions to the various integral types so that @1@ maintains its expected semantics in legacy code.
+The addition of @one_t@ allows generic algorithms to handle the unit value uniformly for types where that is meaningful.
+\TODO{Make this sentence true} In particular, polymorphic functions in the \CFA prelude define @++x@ and @x++@ in terms of @x += 1@, allowing users to idiomatically define all forms of increment for a type @T@ by defining the single function @T& ?+=(T&, one_t)@; analogous overloads for the decrement operators are present as well.
 \subsection{Units}
 …
 \end{cfa}
 }%
 \section{Evaluation}
 …
 Finally, we demonstrate that \CFA performance for some idiomatic cases is better than C and close to \CC, showing the design is practically applicable.
 There is ongoing work on a wide range of \CFA feature extensions, including reference types, arrays with size, exceptions, concurrent primitives and modules.
+There is ongoing work on a wide range of \CFA feature extensions, including arrays with size, exceptions, concurrent primitives, modules, and user-defined conversions.
 (While all examples in the paper compile and run, a public beta-release of \CFA will take another 8--12 months to finalize these additional extensions.)
 In addition, there are interesting future directions for the polymorphism design.

src/libcfa/Makefile.am

-                      r1dcd52a3
+                      r7a052e34
 ## Author           : Peter A. Buhr
 ## Created On       : Sun May 31 08:54:01 2015
 ## Last Modified By : Andrew Beach
 ## Last Modified On : Wed Jul 26 14:15:00 2017
 ## Update Count     : 221
+## Last Modified By : Peter A. Buhr
+## Last Modified On : Fri Feb  9 15:51:24 2018
+## Update Count     : 223
 ###############################################################################
 …
 libcfa_d_a_CFLAGS = -debug -O0 #No need for __CFA_DEBUG__ since we pass -debug
 stdhdr = ${shell echo stdhdr/*}
+stdhdr = ${shell find stdhdr -type f -printf "%p "}
 cfa_includedir = $(CFA_INCDIR)

src/libcfa/Makefile.in

-                      r1dcd52a3
+                      r7a052e34
         containers/result containers/vector concurrency/coroutine \
         concurrency/thread concurrency/kernel concurrency/monitor \
+        ${shell echo stdhdr/*} math gmp bits/align.h bits/containers.h \
+        bits/defs.h bits/debug.h bits/locks.h concurrency/invoke.h
+        ${shell find stdhdr -type f -printf "%p "} math gmp \
+        bits/align.h bits/containers.h bits/defs.h bits/debug.h \
+        bits/locks.h concurrency/invoke.h
 HEADERS = $(nobase_cfa_include_HEADERS)
 am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
 …
 libcfa_d_a_SOURCES = ${libsrc}
 libcfa_d_a_CFLAGS = -debug -O0 #No need for __CFA_DEBUG__ since we pass -debug
 stdhdr = ${shell echo stdhdr/*}
+stdhdr = ${shell find stdhdr -type f -printf "%p "}
 cfa_includedir = $(CFA_INCDIR)
 nobase_cfa_include_HEADERS = \

src/libcfa/concurrency/alarm.c

-                      r1dcd52a3
+                      r7a052e34
 void ?{}( __cfa_time_t & this, zero_t zero ) { this.val = 0; }
 void ?{}( itimerval & this, __cfa_time_t * alarm ) {
         this.it_value.tv_sec = alarm->val / one_second;                 // seconds
         this.it_value.tv_usec = max( (alarm->val % one_second) / one_microsecond, 1000 ); // microseconds
         this.it_interval.tv_sec = 0;
         this.it_interval.tv_usec = 0;
+void ?{}( itimerval & this, __cfa_time_t * alarm ) with( this ) {
+        it_value.tv_sec = alarm->val / one_second;                      // seconds
+        it_value.tv_usec = max( (alarm->val % one_second) / one_microsecond, 1000 ); // microseconds
+        it_interval.tv_sec = 0;
+        it_interval.tv_usec = 0;
+}
 …
 //=============================================================================================
 void ?{}( alarm_node_t & this, thread_desc * thrd, __cfa_time_t alarm = zero_time, __cfa_time_t period = zero_time ) {
+void ?{}( alarm_node_t & this, thread_desc * thrd, __cfa_time_t alarm = zero_time, __cfa_time_t period = zero_time ) with( this ) {
         this.thrd = thrd;
         this.alarm = alarm;
         this.period = period;
         this.next = 0;
         this.set = false;
         this.kernel_alarm = false;
+}
 void ?{}( alarm_node_t & this, processor   * proc, __cfa_time_t alarm = zero_time, __cfa_time_t period = zero_time ) {
+        next = 0;
+        set = false;
+        kernel_alarm = false;
+}
+void ?{}( alarm_node_t & this, processor   * proc, __cfa_time_t alarm = zero_time, __cfa_time_t period = zero_time ) with( this ) {
         this.proc = proc;
         this.alarm = alarm;
         this.period = period;
         this.next = 0;
         this.set = false;
         this.kernel_alarm = true;
+        next = 0;
+        set = false;
+        kernel_alarm = true;
+}

src/libcfa/concurrency/alarm.h

-                      r1dcd52a3
+                      r7a052e34
 };
 static inline void ?{}( alarm_list_t & this ) {
         this.head = 0;
         this.tail = &this.head;
+static inline void ?{}( alarm_list_t & this ) with( this ) {
+        head = 0;
+        tail = &head;
+}

src/libcfa/concurrency/coroutine.c

-                      r1dcd52a3
+                      r7a052e34
 //-----------------------------------------------------------------------------
 // Coroutine ctors and dtors
 void ?{}(coStack_t& this) {
         this.size               = 65000;        // size of stack
         this.storage    = NULL; // pointer to stack
         this.limit              = NULL; // stack grows towards stack limit
         this.base               = NULL; // base of stack
         this.context    = NULL; // address of cfa_context_t
         this.top                = NULL; // address of top of storage
         this.userStack  = false;
+void ?{}(coStack_t& this) with( this ) {
+        size            = 65000;        // size of stack
+        storage = NULL; // pointer to stack
+        limit           = NULL; // stack grows towards stack limit
+        base            = NULL; // base of stack
+        context = NULL; // address of cfa_context_t
+        top             = NULL; // address of top of storage
+        userStack       = false;
+}
 …
+}
 void ?{}(coroutine_desc& this, const char * name) {
+void ?{}(coroutine_desc& this, const char * name) with( this ) {
         this.name = name;
         this.errno_ = 0;
         this.state = Start;
         this.starter = NULL;
         this.last = NULL;
+        errno_ = 0;
+        state = Start;
+        starter = NULL;
+        last = NULL;
+}
 …
 // Wrapper for co
 void CoroutineCtxSwitch(coroutine_desc* src, coroutine_desc* dst) {
         // THREAD_GETMEM( This )->disableInterrupts();
+        disable_interrupts();
         // set state of current coroutine to inactive
 …
         src->state = Active;
         // THREAD_GETMEM( This )->enableInterrupts();
+        enable_interrupts( __cfaabi_dbg_ctx );
 } //ctxSwitchDirect

src/libcfa/concurrency/invoke.c

-                      r1dcd52a3
+                      r7a052e34
 // Created On       : Tue Jan 17 12:27:26 2016
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Thu Feb  8 16:18:11 2018
 // Update Count     : 4
+// Last Modified On : Fri Feb  9 16:37:42 2018
+// Update Count     : 5
 //
 …
         struct coStack_t* stack = &get_coroutine( this )->stack;
 #if defined( __i386__ )
+#if defined( __i386 )
         struct FakeStack {
 …
         ((struct FakeStack *)(((struct machine_context_t *)stack->context)->SP))->fcw = 0x037F;  //Vol. 1 8-7
 #elif defined( __x86_64__ )
+#elif defined( __x86_64 )
         struct FakeStack {
 …
         fs->arg[0] = this;
         fs->arg[1] = invoke;
 #else
         #error Only __i386__ and __x86_64__ is supported for threads in cfa
+        #error uknown hardware architecture
 #endif
+}

src/libcfa/concurrency/invoke.h

-                      r1dcd52a3
+                      r7a052e34
 // Created On       : Tue Jan 17 12:27:26 2016
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Jan 23 14:55:46 2018
 // Update Count     : 3
+// Last Modified On : Fri Feb  9 14:41:55 2018
+// Update Count     : 6
 //
 …
         void CtxSwitch( void * from, void * to ) asm ("CtxSwitch");
+        #if   defined( __x86_64__ )
+        #if   defined( __i386 )
+        #define CtxGet( ctx ) __asm__ ( \
+                        "movl %%esp,%0\n"   \
+                        "movl %%ebp,%1\n"   \
+                : "=rm" (ctx.SP), "=rm" (ctx.FP) )
+        #elif defined( __x86_64 )
         #define CtxGet( ctx ) __asm__ ( \
                         "movq %%rsp,%0\n"   \
                         "movq %%rbp,%1\n"   \
-                : "=rm" (ctx.SP), "=rm" (ctx.FP) )
-        #elif defined( __i386__ )
-        #define CtxGet( ctx ) __asm__ ( \
-                        "movl %%esp,%0\n"   \
-                        "movl %%ebp,%1\n"   \
                 : "=rm" (ctx.SP), "=rm" (ctx.FP) )
         #elif defined( __ARM_ARCH )
 …
                         "mov %1,%%r11\n"   \
                 : "=rm" (ctx.SP), "=rm" (ctx.FP) )
+        #else
+                #error unknown hardware architecture
         #endif

src/libcfa/concurrency/kernel.c

-                      r1dcd52a3
+                      r7a052e34
 // Created On       : Tue Jan 17 12:27:26 2017
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Tue Feb  6 21:51:26 2018
 // Update Count     : 4
+// Last Modified On : Thu Feb  8 23:52:19 2018
+// Update Count     : 5
 //
 //C Includes
 #include <stddef.h>
-#define ftype `ftype`
 extern "C" {
 #include <stdio.h>
 …
 #include <unistd.h>
+}
-#undef ftype
 //CFA Includes
 …
+}
 void ?{}(processor & this, cluster * cltr) {
+void ?{}(processor & this, cluster * cltr) with( this ) {
         this.cltr = cltr;
         this.terminated{ 0 };
         this.do_terminate = false;
         this.preemption_alarm = NULL;
         this.pending_preemption = false;
+        terminated{ 0 };
+        do_terminate = false;
+        preemption_alarm = NULL;
+        pending_preemption = false;
         start( &this );
+}
 void ?{}(processor & this, cluster * cltr, processorCtx_t & runner) {
+void ?{}(processor & this, cluster * cltr, processorCtx_t & runner) with( this ) {
         this.cltr = cltr;
         this.terminated{ 0 };
         this.do_terminate = false;
         this.preemption_alarm = NULL;
         this.pending_preemption = false;
         this.kernel_thread = pthread_self();
+        terminated{ 0 };
+        do_terminate = false;
+        preemption_alarm = NULL;
+        pending_preemption = false;
+        kernel_thread = pthread_self();
         this.runner = &runner;

src/libcfa/concurrency/monitor

-                      r1dcd52a3
+                      r7a052e34
 };
 static inline void ?{}(monitor_desc & this) {
         (this.lock){};
         (this.entry_queue){};
         (this.signal_stack){};
         this.owner         = NULL;
         this.recursion     = 0;
         this.mask.accepted = NULL;
         this.mask.data     = NULL;
         this.mask.size     = 0;
         this.dtor_node     = NULL;
+static inline void ?{}(monitor_desc & this) with( this ) {
+        lock{};
+        entry_queue{};
+        signal_stack{};
+        owner         = NULL;
+        recursion     = 0;
+        mask.accepted = NULL;
+        mask.data     = NULL;
+        mask.size     = 0;
+        dtor_node     = NULL;
+}

src/libcfa/concurrency/monitor.c

-                      r1dcd52a3
+                      r7a052e34
                         // We already have the monitor... but where about to destroy it so the nesting will fail
                         // Abort!
                         abort( "Attempt to destroy monitor %p by thread \"%.256s\" (%p) in nested mutex." );
+                        abort( "Attempt to destroy monitor %p by thread \"%.256s\" (%p) in nested mutex.", this, thrd->self_cor.name, thrd );
+                }
 …
+}
 void ?{}(__condition_criterion_t & this ) {
         this.ready  = false;
         this.target = NULL;
         this.owner  = NULL;
         this.next   = NULL;
+void ?{}(__condition_criterion_t & this ) with( this ) {
+        ready  = false;
+        target = NULL;
+        owner  = NULL;
+        next   = NULL;
+}
 …
                 thread_desc * this_thrd = this_thread;
                 if ( this.monitor_count != this_thrd->monitors.size ) {
                         abort( "Signal on condition %p made with different number of monitor(s), expected %i got %i", &this, this.monitor_count, this_thrd->monitors.size );
+                        abort( "Signal on condition %p made with different number of monitor(s), expected %li got %li", &this, this.monitor_count, this_thrd->monitors.size );
+                }
                 for(int i = 0; i < this.monitor_count; i++) {
                         if ( this.monitors[i] != this_thrd->monitors[i] ) {
                                 abort( "Signal on condition %p made with different monitor, expected %p got %i", &this, this.monitors[i], this_thrd->monitors[i] );
+                                abort( "Signal on condition %p made with different monitor, expected %p got %p", &this, this.monitors[i], this_thrd->monitors[i] );
+                        }
+                }

src/libcfa/concurrency/preemption.c

-                      r1dcd52a3
+                      r7a052e34
 // Created On       : Mon Jun 5 14:20:42 2017
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Thu Feb  8 17:01:56 2018
 // Update Count     : 13
+// Last Modified On : Fri Feb  9 16:38:13 2018
+// Update Count     : 14
 //
 #include "preemption.h"
-#define ftype `ftype`
 extern "C" {
 #include <errno.h>
 …
 #include <unistd.h>
+}
-#undef ftype
 #include "bits/signal.h"
 …
 // Machine specific register name
+#if   defined(__x86_64__)
+#if   defined( __i386 )
+#define CFA_REG_IP gregs[REG_EIP]
+#elif defined( __x86_64 )
 #define CFA_REG_IP gregs[REG_RIP]
+#elif defined(__i386__)
+#define CFA_REG_IP gregs[REG_EIP]
+#elif defined(__ARM_ARCH__)
+#elif defined( __ARM_ARCH )
 #define CFA_REG_IP arm_pc
+#else
+#error unknown hardware architecture
 #endif

src/libcfa/exception.c

-                      r1dcd52a3
+                      r7a052e34
 // Author           : Andrew Beach
 // Created On       : Mon Jun 26 15:13:00 2017
 // Last Modified By : Andrew Beach
 // Last Modified On : Thr Aug 17 15:45:00 2017
 // Update Count     : 7
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri Feb  9 14:41:55 2018
+// Update Count     : 8
 //
 …
 // match, which is no way generic.  Some more works need to be done if we want to have a single call to the try routine.
 #if defined( __x86_64__ ) || defined( __i386__ )
+#if defined( __i386 ) || defined( __x86_64 )
 asm (
         //HEADER
 …
 //      "       .section        .note.GNU-stack,\"x\",@progbits\n"
 );
 #endif // __x86_64__ || __i386__
+#endif // __i386 || __x86_64

src/tests/preempt_longrun/Makefile.am

-                      r1dcd52a3
+                      r7a052e34
 max_time=600
 preempt=1_000ul
+debug=-debug
 REPEAT = ${abs_top_srcdir}/tools/repeat
 TIME = /usr/bin/time -f "%E"
 BUILD_FLAGS = -g -Wall -Wno-unused-function -quiet @CFA_FLAGS@ -debug -O2 -DPREEMPTION_RATE=${preempt}
+BUILD_FLAGS = -g -Wall -Wno-unused-function -quiet @CFA_FLAGS@ -O2 -DPREEMPTION_RATE=${preempt}
 CFLAGS = ${BUILD_FLAGS}
 CC = @CFA_BINDIR@/@CFA_NAME@
 TESTS = block create disjoint enter enter3 processor stack wait yield
+TESTS = block coroutine create disjoint enter enter3 processor stack wait yield
 .INTERMEDIATE: ${TESTS}
 …
 % : %.c ${CC}
         ${AM_V_GEN}${CC} ${CFLAGS} ${<} -o ${@}
+        ${AM_V_GEN}${CC} ${CFLAGS} ${<} $(debug) -o ${@}
 %.run : % ${REPEAT}

src/tests/preempt_longrun/Makefile.in

-                      r1dcd52a3
+                      r7a052e34
 max_time = 600
 preempt = 1_000ul
+debug = -debug
 REPEAT = ${abs_top_srcdir}/tools/repeat
 TIME = /usr/bin/time -f "%E"
 BUILD_FLAGS = -g -Wall -Wno-unused-function -quiet @CFA_FLAGS@ -debug -O2 -DPREEMPTION_RATE=${preempt}
 TESTS = block create disjoint enter enter3 processor stack wait yield
+BUILD_FLAGS = -g -Wall -Wno-unused-function -quiet @CFA_FLAGS@ -O2 -DPREEMPTION_RATE=${preempt}
+TESTS = block coroutine create disjoint enter enter3 processor stack wait yield
 all: all-am
 …
         $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \
         "$$tst" $(AM_TESTS_FD_REDIRECT)
+coroutine.log: coroutine
+        @p='coroutine'; \
+        b='coroutine'; \
+        $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \
+        --log-file $$b.log --trs-file $$b.trs \
+        $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \
+        "$$tst" $(AM_TESTS_FD_REDIRECT)
 create.log: create
         @p='create'; \
 …
 % : %.c ${CC}
         ${AM_V_GEN}${CC} ${CFLAGS} ${<} -o ${@}
+        ${AM_V_GEN}${CC} ${CFLAGS} ${<} $(debug) -o ${@}
 %.run : % ${REPEAT}

Context Navigation

Legend:

doc/papers/general/Makefile

doc/papers/general/Paper.tex

src/libcfa/Makefile.am

src/libcfa/Makefile.in

src/libcfa/concurrency/alarm.c

src/libcfa/concurrency/alarm.h

src/libcfa/concurrency/coroutine.c

src/libcfa/concurrency/invoke.c

src/libcfa/concurrency/invoke.h

src/libcfa/concurrency/kernel.c

src/libcfa/concurrency/monitor

src/libcfa/concurrency/monitor.c

src/libcfa/concurrency/preemption.c

src/libcfa/exception.c

src/tests/preempt_longrun/Makefile.am

src/tests/preempt_longrun/Makefile.in

Download in other formats: