Changes in / [a29c6e2:04bdc26]

2 deleted
4 edited


  • doc/theses/aaron_moss_PhD/phd/Makefile

    ra29c6e2 r04bdc26  
    11BUILD = build
    22BIBDIR = ../../../bibliography
    3 EVALDIR = evaluation
    43TEXLIB = .:${BUILD}:${BIBDIR}:
    6 # LATEX = TEXINPUTS=${TEXLIB} && export TEXINPUTS && pdflatex -interaction=nonstopmode -halt-on-error -output-directory=${BUILD}
    7 LATEX = TEXINPUTS=${TEXLIB} && export TEXINPUTS && latex -halt-on-error -output-directory=${BUILD}
     5LATEX = TEXINPUTS=${TEXLIB} && export TEXINPUTS && pdflatex -interaction= -output-directory=${BUILD}
    86BIBTEX = BIBINPUTS=${TEXLIB} && export BIBINPUTS && bibtex
    10 VPATH = ${EVALDIR}
    128BASE = thesis
    29 GRAPHS = ${addsuffix .tex, \
    30 generic-timing \
    31 }
    3325.PHONY : all rebuild-refs clean wc
    4133        wc ${SOURCES}
    43 ${DOCUMENT} : ${BASE}.ps
    44         ps2pdf ${BUILD}/$<
     35${DOCUMENT} : ${SOURCES} ${BUILD}
     36        ${LATEX} ${BASE}
     37        ${LATEX} ${BASE}
    46 ${BASE}.ps : ${BASE}.dvi
    47         dvips ${BUILD}/$< -o ${BUILD}/$@
    49 ${BASE}.dvi : Makefile ${SOURCES} ${GRAPHS} ${BIBFILE} ${BUILD}
     39rebuild-refs : ${SOURCES} ${BIBFILE} ${BUILD}
    5040        ${LATEX} ${BASE}
    5141        ${BIBTEX} ${BUILD}/${BASE}
    5343        ${LATEX} ${BASE}
    55 ${GRAPHS} : generic-timing.dat ${BUILD}
    56         gnuplot -e BUILD="'${BUILD}/'" ${EVALDIR}/
    5946        mkdir -p ${BUILD}
  • doc/theses/aaron_moss_PhD/phd/generic-types.tex

    ra29c6e2 r04bdc26  
    136136\CC{}, Java, and other languages use \emph{generic types} to produce type-safe abstract data types.
    137 Design and implementation of generic types for \CFA{} is the first major contribution of this thesis, a summary of which is published in \cite{Moss18} and from which this chapter is closely based.
     137Design and implementation of generic types for \CFA{} is the first major contribution of this thesis, a summary of which is published in \cite{Moss18}.
    138138\CFA{} generic types integrate efficiently and naturally with the existing polymorphic functions in \CFA{}, while retaining backward compatibility with C in layout and support for separate compilation.
    139139A generic type can be declared in \CFA{} by placing a !forall! specifier on a !struct! or !union! declaration, and instantiated using a parenthesized list of types after the generic name.
    179179\subsection{Related Work}
    181 One approach to the design of generic types is that taken by \CC{} templates\cite{C++}.
     181One approach to the design of generic types is that taken by \CC{} templates\cit{}.
    182182The template approach is closely related to the macro-expansion approach to C polymorphism demonstrated in Figure~\ref{macro-generic-fig}, but where the macro-expansion syntax has been given first-class language support.
    183183Template expansion has the benefit of generating code with near-optimal runtime efficiency, as distinct optimizations can be applied for each instantiation of the template.
    185185The most significant restriction of the \CC{} template model is that it breaks separate compilation and C's translation-unit-based encapsulation mechanisms.
    186186Because a \CC{} template is not actually code, but rather a sort of ``recipe'' to generate code, template code must be visible at its call site to be used.
    187 Furthermore, \CC{} template code cannot be type-checked without instantiating it, a time consuming process with no hope of improvement until \CC{} concepts\cite{C++Concepts} are standardized in \CCtwenty{}.
    188187C code, by contrast, only needs a !struct! or function declaration to call that function or use (by-pointer) values of that type, a desirable property to maintain for \CFA{}.
    190 Java\cite{Java8} has another prominent implementation for generic types, introduced in Java~5 and based on a significantly different approach than \CC{}.
     189Java\cit{} has another prominent implementation for generic types, based on a significantly different approach than \CC{}.
    191190The Java approach has much more in common with the !void*!-polymorphism shown in Figure~\ref{void-generic-fig}; since in Java nearly all data is stored by reference, the Java approach to polymorphic data is to store pointers to arbitrary data and insert type-checked implicit casts at compile-time.
    192191This process of \emph{type erasure} has the benefit of allowing a single instantiation of polymorphic code, but relies heavily on Java's object model and garbage collector.
    193192To use this model, a more C-like language such as \CFA{} would be required to dynamically allocate internal storage for variables, track their lifetime, and properly clean them up afterward.
    195 Cyclone\cite{Grossman06} is another language extending C, and also provides capabilities for polymorphic functions and existential types, similar to \CFA{}'s !forall! functions and generic types.
    196 Cyclone existential types can include function pointers in a construct similar to a virtual function table, but these pointers must be explicitly initialized at some point in the code, which is tedious and error-prone compared to \CFA{}'s implicit assertion satisfaction.
    197 Furthermore, Cyclone's polymorphic functions and types are restricted to abstraction over types with the same layout and calling convention as !void*!, \ie{} only pointer types and !int!.
    198 In the \CFA{} terminology discussed in Section~\ref{generic-impl-sec}, all Cyclone polymorphism must be dtype-static.
    199 While the Cyclone polymorphism design provides the efficiency benefits discussed in Section~\ref{dtype-static-sec} for dtype-static polymorphism, it is more restrictive than the more general model of \CFA{}.
    201 Many other languages include some form of generic types.
    202 As a brief survey, ML\cite{ML} was the first language to support parameteric polymorphism, but unlike \CFA{} does not support the use of assertions and traits to constrain type arguments.
    203 Haskell\cite{Haskell10} combines ML-style polymorphism with the notion of type classes, similar to \CFA{} traits, but requiring an explicit association with their implementing types, unlike \CFA{}.
    204 Objective-C\cite{obj-c-book} is an extension to C which has had some industrial success; however, it did not support type-checked generics until recently\cite{xcode7}, and it's garbage-collected, message-passing object-oriented model is a radical departure from C.
    205 Go\cite{Go}, and Rust\cite{Rust} are modern compiled languages with abstraction features similar to \CFA{} traits, \emph{interfaces} in Go and \emph{traits} in Rust.
    206 Go has implicit interface implementation and uses a ``fat pointer'' construct to pass polymorphic objects to functions, similar in principle to \CFA{}'s implicit forall paramters.
    207 Go does not, however, allow user code to define generic types, restricting Go programmers to the small set of generic types defined by the compiler.
    208 Rust has powerful abstractions for generic programming, including explicit implemenation of traits and options for both separately-compiled virtual dispatch and template-instantiated static dispatch in functions.
    209 On the other hand, the safety guarantees of Rust's \emph{lifetime} abstraction and borrow checker impose a distinctly idiosyncratic programming style and steep learning curve; \CFA{}, with its more modest safety features, allows direct ports of C code while maintaining the idiomatic style of the original source.
     194\TODO{Talk about Go, maybe Rust, Swift, etc. as well; specifically mention ``fat pointer'' polymorphism}
     196\TODO{Talk about Cyclone as well, and why my generics are more powerful}
    211198\subsection{\CFA{} Generics}
    226213In this example, !with_len! is defined at the same scope as !pair!, but it could be called from any context that can see the definition of !pair! and a declaration of !with_len!.
    227 If its return type was !pair(const char*, int)*!, callers of !with_len! would only need the declaration !forall(otype R, otype S) struct pair! to call it, in accordance with the usual C rules for opaque types.
     214If its return type was !pair(const char*, int)*!, callers of !with_len! would only need the declaration !forall(otype R, otype S) struct pair;! to call it, in accordance with the usual C rules for opaque types.
    229216!with_len! is itself a monomorphic function, returning a type that is structurally identical to !struct { const char* first; int second; }!, and as such could be called from C given an appropriate redeclaration and demangling flags.
    249 \CFA{} generic types also support the type constraints from !forall! functions.
    250 For example, the following declaration of a sorted set type ensures that the set key implements equality and relational comparison:
    252 \begin{cfa}
    253 forall(otype Key | { int ?==?(Key, Key); int ?<?(Key, Key); }) struct sorted_set;
    254 \end{cfa}
    256 These constraints are implemented by applying equivalent constraints to the compiler-generated constructors for this type.
    258 \section{Implementation} \label{generic-impl-sec}
    260 The ability to use generic types in polymorphic contexts means that the \CFA{} implementation in \CFACC{} must support a mechanism for accessing fields of generic types dynamically at runtime.
    261 While \CFACC{} could in principle use this same mechanism for accessing fields of all generic types, such an approach would throw away compiler knowledge of static types and impose an unnecessary runtime cost, limiting the utility of the generic type design.
    262 Instead, my design for generic type support in \CFACC{} distinguishes between \emph{concrete} generic types that have a fixed memory layout regardless of type parameters and \emph{dynamic} generic types that may vary in memory layout depending on their type parameters.
    263 A \emph{dtype-static} type has polymorphic parameters but is still concrete.
    264 Polymorphic pointers are an example of dtype-static types; given some type variable !T!, T is a polymorphic type, but !T*! has a fixed size and can therefore be represented by a !void*! in code generation.
    265 In particular, generic types where all parameters are un-!sized! (\ie{} they do not conform to the built-in !sized! trait because the compiler does not know their size and alignment) are always concrete, as there is no possibility for their layout to vary based on type parameters of unknown size and alignment.
    266 More precisely, a type is concrete if and only if all of its !sized! type parameters are concrete, and a concrete type is dtype-static if any of its type parameters are (possibly recursively) polymorphic.
    267 To illustrate, the following code using the !pair! type from above \TODO{test this} has each use of !pair! commented with its class:
    269 \begin{cfa}
    270 //dynamic, layout varies based on T
    271 forall(otype T) T value( pair(const char*, T) p ) { return p.second; }
    273 // dtype-static, F* and T* are concrete but recursively polymorphic
    274 forall(dtype F, otype T) T value( pair(F*, T*) ) { return *p.second; }
    276 pair(const char*, int) p = {"magic", 42}; $\C[2.5in]{// concrete}$
    277 int i = value(p);
    278 pair(void*, int*) q = {0, &p.second}; $\C[2.5in]{// concrete}$
    279 i = value(q);
    280 double d = 1.0;
    281 pair(double*, double*) r = {&d, &d}; $\C[2.5in]{// concrete}$
    282 d = value(r);
    283 \end{cfa}
    285 \subsection{Concrete Generic Types}
    287 The \CFACC{} translator template expands concrete generic types into new structure types, affording maximal inlining.
    288 To enable interoperation among equivalent instantiations of a generic type, \CFACC{} saves the set of instantiations currently in scope and reuses the generated structure declarations where appropriate.
    289 In particular, tuple types are implemented as a single compiler-generated generic type definition per tuple arity, and can be instantiated and reused according to the usual rules for generic types.
    290 A function declaration that accepts or returns a concrete generic type produces a declaration for the instantiated structure in the same scope, which all callers may reuse.
    291 As an example, the concrete instantiation for !pair(const char*, int)! is\footnote{This omits the field name mangling performed by \CFACC{} for overloading purposes.\label{mangle-foot}}
    293 \begin{cfa}
    294 struct _pair_conc0 { const char * first; int second; };
    295 \end{cfa}
    297 A concrete generic type with dtype-static parameters is also expanded to a structure type, but this type is used for all matching instantiations.
    298 In the example above, the !pair(F*, T*)! parameter to !value! is such a type; its expansion is below\footref{mangle-foot}, and it is used as the type of the variables !q! and !r! as well, with casts for member access where appropriate.
    300 \begin{cfa}
    301 struct _pair_conc1 { void* first; void* second; };
    302 \end{cfa}
    304 \subsection{Dynamic Generic Types}
    306 In addition to this efficient implementation of concrete generic types, \CFA{} also offers flexibility with powerful support for dynamic generic types.
    307 In the pre-existing compiler design, !otype! (and all !sized!) type parameters come with implicit size and alignment parameters provided by the caller.
    308 The design for generic types presented here adds an \emph{offset array} containing structure-member offsets for dynamic generic !struct! types.
    309 A dynamic generic !union! needs no such offset array, as all members are at offset 0, but size and alignment are still necessary.
    310 Access to members of a dynamic structure is provided at runtime via base displacement addressing the structure pointer and the member offset (similar to the !offsetof! macro), moving a compile-time offset calculation to runtime.
    312 the offset arrays are statically generated where possible.
    313 If a dynamic generic type is passed or returned by value from a polymorphic function, \CFACC{} can safely assume that the generic type is complete (\ie{} has a known layout) at any call site, and the offset array is passed from the caller; if the generic type is concrete at the call site, the elements of this offset array can even be statically generated using the C !offsetof! macro.
    314 As an example, the body of the second !value! function above is implemented as
    316 \begin{cfa}
    317 _assign_T( _retval, p + _offsetof_pair[1] ); $\C[2in]{// return *p.second}$
    318 \end{cfa}
    320 Here, !_assign_T! is passed in as an implicit parameter from !otype T! and takes two !T*! (!void*! in the generated code), a destination and a source, and !_retval! is the pointer to a caller-allocated buffer for the return value, the usual \CFA{} method to handle dynamically-sized return types.
    321 !_offsetof_pair! is the offset array passed into !value!; this array is generated at the call site as
    323 \begin{cfa}
    324 size_t _offsetof_pair[] = {offsetof(_pair_conc0, first),  offsetof(_pair_conc0, second)};
    325 \end{cfa}
    327 \subsubsection{Layout Functions}
    329 In some cases, the offset arrays cannot be statically generated.
    330 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 \texttt{.c} file.
    331 \CFA{} supports this pattern for generic types, implying that the caller of a polymorphic function may not know the actual layout or size of a dynamic generic type and only holds it by pointer.
    332 \CFACC{} 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 functions's caller.
    333 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.
    334 Un!sized! parameters not passed because they are forbidden from being used in a context that affects layout by C's usual rules about incomplete types.
    335 Similarly, the layout function can only safely be called from a context where the generic type definition is visible, because otherwise the caller will not know how large to allocate the array of member offsets.
    337 The C standard does not specify a memory layout for structs, but the POSIX ABI for x86\cit{} does; this memory layout is common for C implementations, but is a platform-specific issue for porting \CFA{}.
    338 This algorithm, sketched below in pseudo-\CFA{}, is a straightforward mapping of consecutive fields into the first properly-aligned offset in the !struct! layout; layout functions for !union! types omit the offset array and simply calculate the maximum size and alignment over all union variants.
    339 Since \CFACC{} generates a distinct layout function for each type, constant-folding and loop unrolling are applied.
    341 \begin{cfa}
    342 forall(dtype T1, dtype T2, ... | sized(T1) | sized(T2) | ...)
    343 void layout(size_t* size, size_t* align, size_t* offsets) {
    344         // initialize values
    345         *size = 0; *align = 1;
    346         // set up members
    347         for ( int i = 0; i < n_fields; ++i ) {
    348                 // pad to alignment
    349                 size_t off_align = *size % alignof(field[i]);
    350                 if ( off_align != 0 ) { *size += alignof(field[i]) - off_align; }
    351                 // mark member, increase size, and fix alignment
    352                 offsets[i] = *size;
    353                 *size += sizeof(field[i]);
    354                 if ( *align < alignof(field[i]) ) { *align = alignof(field[i]); }
    355         }
    356         // final padding to alignment
    357         size_t off_align = *size % *align;
    358         if ( off_align != 0 ) { *size += *align - off_align; }
    359 }
    360 \end{cfa}
    362 Results of layout function calls are cached so that they are only computed once per type per function.
    363 Layout functions also allow generic types to be used in a function definition without reflecting them in the function signature, an important implemenation-hiding constraint of the design.
    364 For instance, a function that strips duplicate values from an unsorted !list(T)! likely has a reference to the list as its only explicit parameter, but uses some sort of !set(T)! internally to test for duplicate values.
    365 This function could acquire the layout for !set(T)! by calling its layout function, providing as an argument the layout of !T! implicitly passed into that function.
    367 Whether a type is concrete, dtype-static, or dynamic is decided solely on the basis of the type arguments and !forall! clause type paramters.
    368 This design allows opaque forward declarations of generic types, \eg{} !forall(otype T) struct Box;! like in C, all uses of $Box(T)$ can be separately compiled, and callers from other translation units know the proper calling conventions to use.
    369 In an alternate design where the definition of a structure type is included in deciding whether a generic type is dynamic or concrete, some further types may be recognized as dtype-static --- \eg{} !Box! could be defined with a body !{ T* p; }!, and would thus not depend on !T! for its layout.
    370 However, the existence of an !otype! parameter !T! means that !Box! \emph{could} depend on !T! for its layout if this definition is not visible, and we judged preserving separate compilation (and the associated C compatibility) in the implemented design to be an acceptable trade-off.
    372 \subsection{Applications of Dtype-static Types} \label{dtype-static-sec}
    374 The reuse of dtype-static structure instantiations enables useful programming patterns at zero runtime cost.
    375 The most important such pattern is using !forall(dtype T) T*! as a type-checked replacement for !void*!, \eg{} creating a lexicographic comparison function for pairs of pointers.
    377 \begin{cfa}
    378 forall(dtype T)
    379 int lexcmp( pair(T*, T*)* a, pair(T*, T*)* b, int (*cmp)(T*, T*) ) {
    380         int c = cmp( a->first, b->first );
    381         return c ? c : cmp( a->second, b->second );
    382 }
    383 \end{cfa}
    385 Since !pair(T*, T*)! is a concrete type, there are no implicit parameters passed to !lexcmp!; hence, the generated code is identical to a function written in standard C using !void*!, yet the \CFA{} version is type-checked to ensure members of both pairs and arguments to the comparison function match in type.
    387 Another useful pattern enabled by reused dtype-static type instantiations is zero-cost \emph{tag structures}.
    388 Sometimes, information is only used for type checking and can be omitted at runtime.
    389 In the example below, !scalar! is a dtype-static type; hence, all uses have a single structure definition containing !unsigned long! and can share the same implementations of common functions like !?+?!.
    390 These implementations may even be separately compiled, unlike \CC{} template functions.
    391 However, the \CFA{} type checker ensures matching types are used by all calls to !?+?!, preventing nonsensical computations like adding a length to a volume.
    393 \begin{cfa}
    394 forall(dtype Unit) struct scalar { unsigned long value; };
    395 struct metres {};
    396 struct litres {};
    398 forall(dtype U) scalar(U) ?+?(scalar(U) a, scalar(U) b) {
    399         return (scalar(U)){ a.value + b.value };
    400 }
    402 scalar(metres) half_marathon = { 21098 };
    403 scalar(litres) pool = { 2500000 };
    404 scalar(metres) marathon = half_marathon + half_marathon;
    405 `marathon + pool;` $\C[4in]{// compiler ERROR, mismatched types}$
    406 \end{cfa}
    408 \section{Performance Experiments} \label{generic-performance-sec}
    410 To validate the practicality of this generic type design I have conducted microbenchmark-based tests against a number of comparable code designs in C and \CC{}, first published in \cite{Moss18}.
    411 Since all these languages are compiled with the same compiler backend and share a subset essentially comprising standard C, maximal-performance benchmarks should show little runtime variance, differing only in length and clarity of source code.
    412 A more illustrative comparison measures the costs of idiomatic usage of each language's features.
    413 The code below shows the \CFA{} benchmark tests for a generic stack based on a singly-linked list; the test suite is equivalent for the other other languages.
    414 The experiment uses element types !int! and !pair(short, char)! and pushes $N = 40M$ elements on a generic stack, copies the stack, clears one of the stacks, and finds the maximum value in the other stack.
    416 \begin{cfa}
    417 int main() {
    418         int max = 0, val = 42;
    419         stack( int ) si, ti;
    421         REPEAT_TIMED( "push_int", N, push( si, val ); )
    422         TIMED( "copy_int", ti{ si }; )
    423         TIMED( "clear_int", clear( si ); )
    424         REPEAT_TIMED( "pop_int", N, int x = pop( ti ); if ( x > max ) max = x; )
    426         pair( short, char ) max = { 0h, '\0' }, val = { 42h, 'a' };
    427         stack( pair( short, char ) ) sp, tp;
    429         REPEAT_TIMED( "push_pair", N, push( sp, val ); )
    430         TIMED( "copy_pair", tp{ sp }; )
    431         TIMED( "clear_pair", clear( sp ); )
    432         REPEAT_TIMED( "pop_pair", N, pair(short, char) x = pop( tp );
    433                 if ( x > max ) max = x; )
    434 }
    435 \end{cfa}
    437 The four versions of the benchmark implemented are C with !void*!-based polymorphism, \CFA{} with parameteric polymorphism, \CC{} with templates, and \CC{} using only class inheritance for polymorphism, denoted \CCV{}.
    438 The \CCV{} variant illustrates an alternative object-oriented idiom where all objects inherit from a base !object! class, mimicking a Java-like interface; in particular, runtime checks are necessary to safely downcast objects.
    439 The most notable difference among the implementations is the memory layout of generic types: \CFA{} and \CC{} inline the stack and pair elements into corresponding list and pair nodes, while C and \CCV{} lack such capability and, instead, must store generic objects via pointers to separately allocated objects.
    440 Note that the C benchmark uses unchecked casts as C has no runtime mechanism to perform such checks, whereas \CFA{} and \CC{} provide type safety statically.
    442 Figure~\ref{generic-eval-fig} and Table~\ref{generic-eval-table} show the results of running the described benchmark.
    443 The graph plots the median of five consecutive runs of each program, with an initial warm-up run omitted.
    444 All code is compiled at \texttt{-O2} by gcc or g++ 6.4.0, with all \CC{} code compiled as \CCfourteen{}.
    445 The benchmarks are run on an Ubuntu 16.04 workstation with 16 GB of RAM and a 6-core AMD FX-6300 CPU with 3.5 GHz maximum clock frequency.
    446 I conjecture that these results scale across most uses of generic types, given the constant underlying polymorphism implementation.
    448 \begin{figure}
    449 \centering
    450 \input{generic-timing}
    451 \caption{Benchmark timing results (smaller is better)} \label{generic-eval-fig}
    452 \end{figure}
    454 \begin{table}
    455 \caption{Properties of benchmark code} \label{generic-eval-table}
    456 \centering
    457 \newcommand{\CT}[1]{\multicolumn{1}{c}{#1}}
    458 \begin{tabular}{lrrrr}
    459                                                                         & \CT{C}        & \CT{\CFA}     & \CT{\CC}      & \CT{\CCV}             \\
    460 maximum memory usage (MB)                       & 10\,001       & 2\,502        & 2\,503        & 11\,253               \\
    461 source code size (lines)                        & 201           & 191           & 125           & 294                   \\
    462 redundant type annotations (lines)      & 27            & 0                     & 2                     & 16                    \\
    463 binary size (KB)                                        & 14            & 257           & 14            & 37                    \\
    464 \end{tabular}
    465 \end{table}
    467 The C and \CCV{} variants are generally the slowest and have the largest memory footprint, due to their less-efficient memory layout and the pointer indirection necessary to implement generic types in those languages; this inefficiency is exacerbated by the second level of generic types in the pair benchmarks.
    468 By contrast, the \CFA{} and \CC{} variants run in roughly equivalent time for both the integer and pair because of the equivalent storage layout, with the inlined libraries (\ie{} no separate compilation) and greater maturity of the \CC{} compiler contributing to its lead.
    469 \CCV{} is slower than C largely due to the cost of runtime type checking of downcasts (implemented with !dynamic_cast!); the outlier for \CFA{}, pop !pair!, results from the complexity of the generated-C polymorphic code.
    470 The gcc compiler is unable to optimize some dead code and condense nested calls; a compiler designed for \CFA{} could more easily perform these optimizations.
    471 Finally, the binary size for \CFA{} is larger because of static linking with \CFA{} libraries.
    473 \CFA{} is also competitive in terms of source code size, measured as a proxy for programmer effort.
    474 The line counts in Table~\ref{generic-eval-table} include implementations of !pair! and !stack! types for all four languages for purposes of direct comparison, although it should be noted that \CFA{} and \CC{} have prewritten data structures in their standard libraries that programmers would generally use instead.
    475 Use of these standard library types has minimal impact on the performance benchmarks, but shrinks the \CFA{} and \CC{} code to 39 and 42 lines, respectively.
    476 The difference between the \CFA{} and \CC{} line counts is primarily declaration duplication to implement separate compilation; a header-only \CFA{} library is similar in length to the \CC{} version.
    477 On the other hand, due to the language shortcomings mentioned at the beginning of the chapter, C does not have a generic collections library in its standard distribution, resulting in frequent reimplementation of such collection types by C programmers.
    478 \CCV{} does not use the \CC{} standard template library by construction, and, in fact, includes the definition of !object! and wrapper classes for !char!, !short!, and !int! in its line count, which inflates this count somewhat, as an actual object-oriented language would include these in the standard library.
    479 I justify the given line count by noting that many object-oriented languages do not allow implementing new interfaces on library types without subclassing or wrapper types, which may be similarly verbose.
    481 Line count is a fairly rough measure of code complexity; another important factor is how much type information the programmer must specify manually, especially where that information is not type-checked.
    482 Such unchecked type information produces a heavier documentation burden and increased potential for runtime bugs and is much less common in \CFA{} than C, with its manually specified function pointer arguments and format codes, or \CCV{}, with its extensive use of un-type-checked downcasts, \eg{} !object! to !integer! when popping a stack.
    483 To quantify this manual typing, the ``redundant type annotations'' line in Table~\ref{generic-eval-table} counts the number of lines on which the known type of a variable is respecified, either as a format specifier, explicit downcast, type-specific function, or by name in a !sizeof!, !struct! literal, or !new! expression.
    484 The \CC{} benchmark uses two redundant type annotations to create new stack nodes, whereas the C and \CCV{} benchmarks have several such annotations spread throughout their code.
    485 The \CFA{} benchmark is able to eliminate \emph{all} redundant type annotations through use of the return-type polymorphic !alloc! function in the \CFA{} standard library.
     238% forall constraints on struct/union constrain default constructor (TODO check with Rob)
     240% TODO discuss layout function algorithm, application to separate compilation
     241% TODO put a static const field in for _n_fields for each generic, describe utility for separate compilation (actually no, you need to be able to see the type for it to be sized)
     243% mention that tuples are implemented on top of a per-arity generic type
     245\section{Performance Experiments}
     247% TODO pull benchmarks from Moss et al.
    487249\section{Future Work}
    489 The generic types design presented here is already sufficiently expressive to implement a variety of useful library types.
    490 However, some other features based on this design could further improve \CFA{}.
    492 The most pressing addition is the ability to have non-type generic parameters.
    493 C already supports fixed-length array types, \eg{} !int[10]!; these types are essentially generic types with unsigned integer parameters, and allowing \CFA{} users the capability to build similar types is a requested feature.
    494 More exotically, the ability to have these non-type parameters depend on dynamic runtime values rather than static compile-time constants opens up interesting opportunities for type-checking problematic code patterns.
    495 For example, if a collection iterator was parameterized over the pointer to the collection it was drawn from, then a sufficiently powerful static analysis pass could ensure that that iterator was only used for that collection, eliminating one source of hard-to-find bugs.
    497 The implementation mechanisms behind this generic types design can also be used to add new features to \CFA{}.
    498 One such potential feature would be to add \emph{field assertions} to the existing function and variable assertions on polymorphic type variables.
    499 Implementation of these field assertions would be based on the same code that supports member access by dynamic offset calculation for dynamic generic types.
    500 Simulating field access can already be done more flexibly in \CFA{} by declaring a trait containing an accessor function to be called from polymorphic code, but these accessor functions impose some overhead both to write and call, and directly providing field access via an implicit offset parameter would be both more concise and more efficient.
    501 Of course, there are language design trade-offs to such an approach, notably that providing the two similar features of field and function assertions would impose a burden of choice on programmers writing traits, with field assertions more efficient, but function assertions more general; given this open design question we have deferred a decision on field assertions until we have more experience using \CFA{}.
    502 If field assertions are included in the language, a natural extension would be to provide a structural inheritance mechanism for every !struct! type that simply turns the list of !struct! fields into a list of field assertions, allowing monomorphic functions over that type to be generalized to polymorphic functions over other similar types with added or reordered fields.
    503 \CFA{} could also support a packed or otherwise size-optimized representation for generic types based on a similar mechanism --- the layout function would need to be re-written, but nothing in the use of the offset arrays implies that the field offsets need be monotonically increasing.
    505 With respect to the broader \CFA{} polymorphism design, the experimental results in Section~\ref{generic-performance-sec} demonstrate that though the runtime impact of \CFA{}'s dynamic virtual dispatch is low, it is not as low as the static dispatch of \CC{} template inlining.
    506 However, rather than subject all \CFA{} users to the compile-time costs of ubiquitous template expansion, we are considering more targeted mechanisms for performance-sensitive code.
    507 Two promising approaches are are an !inline! annotation at polymorphic function call sites to create a template specialization of the function (provided the code is visible) or placing a different !inline! annotation on polymorphic function definitions to instantiate a specialized version of the function for some set of types.
    508 These approaches are not mutually exclusive and allow performance optimizations to be applied only when necessary, without suffering global code bloat.
    509 In general, the \CFA{} team believes that separate compilation works well with loaded hardware caches by producing smaller code, which may offset the benefit of larger inlined code.
     251% mention future work adding non-type generic parameters, like ints
     253% taking advantage of generic layout functions to provide field assertions in forall qualifiers
     255% mention packed generic layouts (significantly more complex layout function, but possible)
  • doc/theses/aaron_moss_PhD/phd/macros.tex

    ra29c6e2 r04bdc26  
    1212\newcommand{\CCseventeen}{\textrm{C}\kern-.1em\hbox{+\kern-.25em+}17} % C++17 symbolic name
    1313\newcommand{\CCtwenty}{\textrm{C}\kern-.1em\hbox{+\kern-.25em+}20} % C++20 symbolic name
    14 \newcommand{\CCV}{\rm C\kern-.1em\hbox{+\kern-.25em+}obj} % C++ virtual symbolic name
    1514\newcommand{\Csharp}{C\raisebox{-0.7ex}{\Large$^\sharp$}} % C# symbolic name
  • doc/theses/aaron_moss_PhD/phd/thesis.tex

    ra29c6e2 r04bdc26  
    2222\usepackage{amsmath,amssymb,amstext} % Lots of math symbols and environments
    23 % \usepackage[pdftex]{graphicx} % For including graphics N.B. pdftex graphics driver
    24 \usepackage{graphicx}
    26 \usepackage{footmisc} % for double refs to the same footnote
     23\usepackage[pdftex]{graphicx} % For including graphics N.B. pdftex graphics driver
    2825% Hyperlinks make it very easy to navigate an electronic document.
    3128% Use the "hyperref" package
    33 %\usepackage[pdftex,pagebackref=false]{hyperref} % with basic options
    34 \usepackage[pagebackref=false]{hyperref}
     30\usepackage[pdftex,pagebackref=false]{hyperref} % with basic options
    3531% N.B. pagebackref=true provides links back from the References to the body text. This can cause trouble for printing.
Note: See TracChangeset for help on using the changeset viewer.