| [e8a7ca2] | 1 | \chapter{Introduction}
|
|---|
| 2 |
|
|---|
| [471ff17] | 3 | % The highest level overview of Cforall and EHMs. Get this done right away.
|
|---|
| [417e8ea] | 4 | This thesis covers the design and implementation of the exception handling
|
|---|
| [21f2e92] | 5 | mechanism (EHM) of
|
|---|
| [6071efc] | 6 | \CFA (pronounced sea-for-all and may be written Cforall or CFA).
|
|---|
| [417e8ea] | 7 | \CFA is a new programming language that extends C, which maintains
|
|---|
| [6071efc] | 8 | backwards-compatibility while introducing modern programming features.
|
|---|
| 9 | Adding exception handling to \CFA gives it new ways to handle errors and
|
|---|
| [417e8ea] | 10 | make large control-flow jumps.
|
|---|
| [471ff17] | 11 |
|
|---|
| 12 | % Now take a step back and explain what exceptions are generally.
|
|---|
| [417e8ea] | 13 | A language's EHM is a combination of language syntax and run-time
|
|---|
| 14 | components that are used to construct, raise, and handle exceptions,
|
|---|
| 15 | including all control flow.
|
|---|
| 16 | Exceptions are an active mechanism for replacing passive error/return codes and return unions (Go and Rust).
|
|---|
| [21f2e92] | 17 | Exception handling provides dynamic inter-function control flow.
|
|---|
| [553f8abe] | 18 | There are two forms of exception handling covered in this thesis:
|
|---|
| 19 | termination, which acts as a multi-level return,
|
|---|
| 20 | and resumption, which is a dynamic function call.
|
|---|
| [417e8ea] | 21 | % PAB: Maybe this sentence was suppose to be deleted?
|
|---|
| [471ff17] | 22 | Termination handling is much more common,
|
|---|
| [417e8ea] | 23 | to the extent that it is often seen as the only form of handling.
|
|---|
| 24 | % PAB: I like this sentence better than the next sentence.
|
|---|
| 25 | % This separation is uncommon because termination exception handling is so
|
|---|
| 26 | % much more common that it is often assumed.
|
|---|
| [471ff17] | 27 | % WHY: Mention other forms of continuation and \cite{CommonLisp} here?
|
|---|
| [553f8abe] | 28 |
|
|---|
| [417e8ea] | 29 | Exception handling relies on the concept of nested functions to create handlers that deal with exceptions.
|
|---|
| [e46ea00] | 30 | \begin{center}
|
|---|
| [417e8ea] | 31 | \begin{tabular}[t]{ll}
|
|---|
| 32 | \begin{lstlisting}[aboveskip=0pt,belowskip=0pt,language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
|
|---|
| 33 | void f( void (*hp)() ) {
|
|---|
| 34 | hp();
|
|---|
| 35 | }
|
|---|
| 36 | void g( void (*hp)() ) {
|
|---|
| 37 | f( hp );
|
|---|
| 38 | }
|
|---|
| 39 | void h( int @i@, void (*hp)() ) {
|
|---|
| 40 | void @handler@() { // nested
|
|---|
| 41 | printf( "%d\n", @i@ );
|
|---|
| 42 | }
|
|---|
| 43 | if ( i == 1 ) hp = handler;
|
|---|
| 44 | if ( i > 0 ) h( i - 1, hp );
|
|---|
| 45 | else g( hp );
|
|---|
| 46 | }
|
|---|
| 47 | h( 2, 0 );
|
|---|
| 48 | \end{lstlisting}
|
|---|
| 49 | &
|
|---|
| 50 | \raisebox{-0.5\totalheight}{\input{handler}}
|
|---|
| 51 | \end{tabular}
|
|---|
| [e46ea00] | 52 | \end{center}
|
|---|
| [417e8ea] | 53 | The nested function @handler@ in the second stack frame is explicitly passed to function @f@.
|
|---|
| 54 | When this handler is called in @f@, it uses the parameter @i@ in the second stack frame, which is accessible by an implicit lexical-link pointer.
|
|---|
| 55 | Setting @hp@ in @h@ at different points in the recursion, results in invoking a different handler.
|
|---|
| 56 | Exception handling extends this idea by eliminating explicit handler passing, and instead, performing a stack search for a handler that matches some criteria (conditional dynamic call), and calls the handler at the top of the stack.
|
|---|
| 57 | It is the runtime search $O(N)$ that differentiates an EHM call (raise) from normal dynamic call $O(1)$ via a function or virtual-member pointer.
|
|---|
| [e46ea00] | 58 |
|
|---|
| [417e8ea] | 59 | Termination exception handling searches the stack for a handler, unwinds the stack to the frame containing the matching handler, and calling the handler at the top of the stack.
|
|---|
| 60 | \begin{center}
|
|---|
| 61 | \input{termination}
|
|---|
| 62 | \end{center}
|
|---|
| 63 | Note, since the handler can reference variables in @h@, @h@ must remain on the stack for the handler call.
|
|---|
| 64 | After the handler returns, control continues after the lexical location of the handler in @h@ (static return)~\cite[p.~108]{Tennent77}.
|
|---|
| 65 | Unwinding allows recover to any previous
|
|---|
| 66 | function on the stack, skipping any functions between it and the
|
|---|
| 67 | function containing the matching handler.
|
|---|
| 68 |
|
|---|
| 69 | Resumption exception handling searches the stack for a handler, does \emph{not} unwind the stack to the frame containing the matching handler, and calls the handler at the top of the stack.
|
|---|
| 70 | \begin{center}
|
|---|
| 71 | \input{resumption}
|
|---|
| 72 | \end{center}
|
|---|
| 73 | After the handler returns, control continues after the resume in @f@ (dynamic return).
|
|---|
| 74 | Not unwinding allows fix up of the problem in @f@ by any previous function on the stack, without disrupting the current set of stack frames.
|
|---|
| [e46ea00] | 75 |
|
|---|
| [553f8abe] | 76 | Although a powerful feature, exception handling tends to be complex to set up
|
|---|
| 77 | and expensive to use
|
|---|
| [417e8ea] | 78 | so it is often limited to unusual or ``exceptional" cases.
|
|---|
| 79 | The classic example is error handling, where exceptions are used to
|
|---|
| 80 | remove error handling logic from the main execution path, while paying
|
|---|
| [553f8abe] | 81 | most of the cost only when the error actually occurs.
|
|---|
| [e8a7ca2] | 82 |
|
|---|
| [471ff17] | 83 | \section{Thesis Overview}
|
|---|
| [21f2e92] | 84 | This work describes the design and implementation of the \CFA EHM.
|
|---|
| [553f8abe] | 85 | The \CFA EHM implements all of the common exception features (or an
|
|---|
| [e8a7ca2] | 86 | equivalent) found in most other EHMs and adds some features of its own.
|
|---|
| 87 | The design of all the features had to be adapted to \CFA's feature set as
|
|---|
| 88 | some of the underlying tools used to implement and express exception handling
|
|---|
| 89 | in other languages are absent in \CFA.
|
|---|
| [417e8ea] | 90 | Still the resulting basic syntax resembles that of other languages:
|
|---|
| 91 | \begin{lstlisting}[language=CFA,{moredelim=**[is][\color{red}]{@}{@}}]
|
|---|
| 92 | @try@ {
|
|---|
| [e8a7ca2] | 93 | ...
|
|---|
| 94 | T * object = malloc(request_size);
|
|---|
| 95 | if (!object) {
|
|---|
| [417e8ea] | 96 | @throw@ OutOfMemory{fixed_allocation, request_size};
|
|---|
| [e8a7ca2] | 97 | }
|
|---|
| 98 | ...
|
|---|
| [417e8ea] | 99 | } @catch@ (OutOfMemory * error) {
|
|---|
| [e8a7ca2] | 100 | ...
|
|---|
| 101 | }
|
|---|
| [417e8ea] | 102 | \end{lstlisting}
|
|---|
| [e8a7ca2] | 103 | % A note that yes, that was a very fast overview.
|
|---|
| [471ff17] | 104 | The design and implementation of all of \CFA's EHM's features are
|
|---|
| [553f8abe] | 105 | described in detail throughout this thesis, whether they are a common feature
|
|---|
| [e8a7ca2] | 106 | or one unique to \CFA.
|
|---|
| 107 |
|
|---|
| 108 | % The current state of the project and what it contributes.
|
|---|
| [417e8ea] | 109 | The majority of the \CFA EHM is implemented in \CFA, except for a small amount of assembler code.
|
|---|
| 110 | In addition,
|
|---|
| 111 | a suite of tests and performance benchmarks were created as part of this project.
|
|---|
| 112 | The \CFA implementation techniques are generally applicable in other programming
|
|---|
| [553f8abe] | 113 | languages and much of the design is as well.
|
|---|
| [417e8ea] | 114 | Some parts of the EHM use features unique to \CFA, and hence,
|
|---|
| 115 | are harder to replicate in other programming languages.
|
|---|
| [553f8abe] | 116 | % Talk about other programming languages.
|
|---|
| [417e8ea] | 117 | Three well known programming languages with EHMs, %/exception handling
|
|---|
| 118 | C++, Java and Python are examined in the performance work. However, these languages focus on termination
|
|---|
| 119 | exceptions, so there is no comparison with resumption.
|
|---|
| [e46ea00] | 120 |
|
|---|
| 121 | The contributions of this work are:
|
|---|
| 122 | \begin{enumerate}
|
|---|
| [553f8abe] | 123 | \item Designing \CFA's exception handling mechanism, adapting designs from
|
|---|
| [417e8ea] | 124 | other programming languages, and creating new features.
|
|---|
| 125 | \item Implementing stack unwinding for the \CFA EHM, including updating
|
|---|
| 126 | the \CFA compiler and run-time environment to generate and execute the EHM code.
|
|---|
| 127 | \item Designing and implementing a prototype virtual system.
|
|---|
| [553f8abe] | 128 | % I think the virtual system and per-call site default handlers are the only
|
|---|
| 129 | % "new" features, everything else is a matter of implementation.
|
|---|
| [417e8ea] | 130 | \item Creating tests and performance benchmarks to compare with EHM's in other languages.
|
|---|
| [e46ea00] | 131 | \end{enumerate}
|
|---|
| 132 |
|
|---|
| [417e8ea] | 133 | %\todo{I can't figure out a good lead-in to the roadmap.}
|
|---|
| 134 | The thesis is organization as follows.
|
|---|
| 135 | The next section and parts of \autoref{c:existing} cover existing EHMs.
|
|---|
| 136 | New \CFA EHM features are introduced in \autoref{c:features},
|
|---|
| 137 | covering their usage and design.
|
|---|
| 138 | That is followed by the implementation of these features in
|
|---|
| [553f8abe] | 139 | \autoref{c:implement}.
|
|---|
| [417e8ea] | 140 | Performance results are presented in \autoref{c:performance}.
|
|---|
| 141 | Summing up and possibilities for extending this project are discussed in \autoref{c:future}.
|
|---|
| [471ff17] | 142 |
|
|---|
| 143 | \section{Background}
|
|---|
| 144 | \label{s:background}
|
|---|
| 145 |
|
|---|
| [417e8ea] | 146 | Exception handling is a well examined area in programming languages,
|
|---|
| 147 | with papers on the subject dating back the 70s~\cite{Goodenough75}.
|
|---|
| 148 | Early exceptions were often treated as signals, which carried no information
|
|---|
| 149 | except their identity. Ada~\cite{Ada} still uses this system.
|
|---|
| [fcaa1e4] | 150 |
|
|---|
| 151 | The modern flag-ship for termination exceptions is \Cpp,
|
|---|
| [471ff17] | 152 | which added them in its first major wave of non-object-orientated features
|
|---|
| 153 | in 1990.
|
|---|
| 154 | % https://en.cppreference.com/w/cpp/language/history
|
|---|
| [417e8ea] | 155 | While many EHMs have special exception types,
|
|---|
| 156 | \Cpp has the ability to use any type as an exception.
|
|---|
| 157 | However, this generality is not particularly useful, and has been pushed aside for classes, with a convention of inheriting from
|
|---|
| [fcaa1e4] | 158 | \code{C++}{std::exception}.
|
|---|
| [417e8ea] | 159 | While \Cpp has a special catch-all syntax @catch(...)@, there is no way to discriminate its exception type, so nothing can
|
|---|
| 160 | be done with the caught value because nothing is known about it.
|
|---|
| 161 | Instead the base exception-type \code{C++}{std::exception} is defined with common functionality (such as
|
|---|
| 162 | the ability to print a message when the exception is raised but not caught) and all
|
|---|
| 163 | exceptions have this functionality.
|
|---|
| 164 | Having a root exception-type seems to be the standard now, as the guaranteed functionality is worth
|
|---|
| 165 | any lost in flexibility from limiting exceptions types to classes.
|
|---|
| [fcaa1e4] | 166 |
|
|---|
| [417e8ea] | 167 | Java~\cite{Java} was the next popular language to use exceptions.
|
|---|
| 168 | Its exception system largely reflects that of \Cpp, except it requires
|
|---|
| 169 | exceptions to be a subtype of \code{Java}{java.lang.Throwable}
|
|---|
| [fcaa1e4] | 170 | and it uses checked exceptions.
|
|---|
| [417e8ea] | 171 | Checked exceptions are part of a function's interface defining all exceptions it or its called functions raise.
|
|---|
| 172 | Using this information, it is possible to statically verify if a handler exists for all raised exception, \ie no uncaught exceptions.
|
|---|
| 173 | Making exception information explicit, improves clarity and
|
|---|
| [471ff17] | 174 | safety, but can slow down programming.
|
|---|
| [417e8ea] | 175 | For example, programming complexity increases when dealing with high-order methods or an overly specified
|
|---|
| 176 | throws clause. However some of the issues are more
|
|---|
| 177 | programming annoyances, such as writing/updating many exception signatures after adding or remove calls.
|
|---|
| 178 | Java programmers have developed multiple programming ``hacks'' to circumvent checked exceptions negating the robustness it is suppose to provide.
|
|---|
| 179 | For example, the ``catch-and-ignore" pattern, where the handler is empty because the exception does not appear relevant to the programmer versus
|
|---|
| 180 | repairing or recovering from the exception.
|
|---|
| [471ff17] | 181 |
|
|---|
| 182 | %\subsection
|
|---|
| [417e8ea] | 183 | Resumption exceptions are less popular,
|
|---|
| 184 | although resumption is as old as termination;
|
|---|
| 185 | hence, few
|
|---|
| [fcaa1e4] | 186 | programming languages have implemented them.
|
|---|
| [471ff17] | 187 | % http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/
|
|---|
| 188 | % CSL-79-3_Mesa_Language_Manual_Version_5.0.pdf
|
|---|
| [417e8ea] | 189 | Mesa~\cite{Mesa} is one programming languages that did. Experience with Mesa
|
|---|
| 190 | is quoted as being one of the reasons resumptions are not
|
|---|
| [471ff17] | 191 | included in the \Cpp standard.
|
|---|
| 192 | % https://en.wikipedia.org/wiki/Exception_handling
|
|---|
| [417e8ea] | 193 | As a result, resumption has ignored in main-stream programming languages.
|
|---|
| 194 | However, ``what goes around comes around'' and resumption is being revisited now (like user-level threading).
|
|---|
| 195 | While rejecting resumption might have been the right decision in the past, there are decades
|
|---|
| 196 | of developments in computer science that have changed the situation.
|
|---|
| 197 | Some of these developments, such as functional programming's resumption
|
|---|
| 198 | equivalent, algebraic effects\cite{Zhang19}, are enjoying significant success.
|
|---|
| 199 | A complete reexamination of resumptions is beyond this thesis, but their re-emergence is
|
|---|
| 200 | enough to try them in \CFA.
|
|---|
| [fcaa1e4] | 201 | % Especially considering how much easier they are to implement than
|
|---|
| 202 | % termination exceptions.
|
|---|
| [471ff17] | 203 |
|
|---|
| 204 | %\subsection
|
|---|
| [417e8ea] | 205 | Functional languages tend to use other solutions for their primary EHM,
|
|---|
| 206 | but exception-like constructs still appear.
|
|---|
| [fcaa1e4] | 207 | Termination appears in error construct, which marks the result of an
|
|---|
| [417e8ea] | 208 | expression as an error; thereafter, the result of any expression that tries to use it is also an
|
|---|
| 209 | error, and so on until an appropriate handler is reached.
|
|---|
| 210 | Resumption appears in algebraic effects, where a function dispatches its
|
|---|
| [fcaa1e4] | 211 | side-effects to its caller for handling.
|
|---|
| [471ff17] | 212 |
|
|---|
| 213 | %\subsection
|
|---|
| [417e8ea] | 214 | Some programming languages have moved to a restricted kind of EHM
|
|---|
| 215 | called ``panic".
|
|---|
| 216 | In Rust~\cite{Rust}, a panic is just a program level abort that may be implemented by
|
|---|
| [fcaa1e4] | 217 | unwinding the stack like in termination exception handling.
|
|---|
| [471ff17] | 218 | % https://doc.rust-lang.org/std/panic/fn.catch_unwind.html
|
|---|
| [417e8ea] | 219 | In Go~\cite{Go}, a panic is very similar to a termination, except it only supports
|
|---|
| [fcaa1e4] | 220 | a catch-all by calling \code{Go}{recover()}, simplifying the interface at
|
|---|
| [417e8ea] | 221 | the cost of flexibility.
|
|---|
| [471ff17] | 222 |
|
|---|
| 223 | %\subsection
|
|---|
| [417e8ea] | 224 | While exception handling's most common use cases are in error handling,
|
|---|
| 225 | here are other ways to handle errors with comparisons to exceptions.
|
|---|
| [471ff17] | 226 | \begin{itemize}
|
|---|
| 227 | \item\emph{Error Codes}:
|
|---|
| [417e8ea] | 228 | This pattern has a function return an enumeration (or just a set of fixed values) to indicate
|
|---|
| 229 | if an error occurred and possibly which error it was.
|
|---|
| 230 |
|
|---|
| 231 | Error codes mix exceptional and normal values, artificially enlarging the type and/or value range.
|
|---|
| 232 | Some languages address this issue by returning multiple values or a tuple, separating the error code from the function result.
|
|---|
| 233 | However, the main issue with error codes is forgetting to checking them,
|
|---|
| 234 | which leads to an error being quietly and implicitly ignored.
|
|---|
| 235 | Some new languages have tools that issue warnings, if the error code is
|
|---|
| 236 | discarded to avoid this problem.
|
|---|
| 237 | Checking error codes also results in bloating the main execution path, especially if an error is not dealt with locally and has to be cascaded down the call stack to a higher-level function..
|
|---|
| [471ff17] | 238 |
|
|---|
| 239 | \item\emph{Special Return with Global Store}:
|
|---|
| [417e8ea] | 240 | Some functions only return a boolean indicating success or failure
|
|---|
| 241 | and store the exact reason for the error in a fixed global location.
|
|---|
| 242 | For example, many C routines return non-zero or -1, indicating success or failure,
|
|---|
| 243 | and write error details into the C standard variable @errno@.
|
|---|
| [471ff17] | 244 |
|
|---|
| [417e8ea] | 245 | This approach avoids the multiple results issue encountered with straight error codes
|
|---|
| 246 | but otherwise has many (if not more) of the disadvantages.
|
|---|
| 247 | For example, everything that uses the global location must agree on all possible errors and global variable are unsafe with concurrency.
|
|---|
| [471ff17] | 248 |
|
|---|
| 249 | \item\emph{Return Union}:
|
|---|
| [417e8ea] | 250 | This pattern replaces error codes with a tagged union.
|
|---|
| [471ff17] | 251 | Success is one tag and the errors are another.
|
|---|
| 252 | It is also possible to make each possible error its own tag and carry its own
|
|---|
| 253 | additional information, but the two branch format is easy to make generic
|
|---|
| 254 | so that one type can be used everywhere in error handling code.
|
|---|
| 255 |
|
|---|
| [417e8ea] | 256 | This pattern is very popular in functional or any semi-functional language with
|
|---|
| 257 | primitive support for tagged unions (or algebraic data types).
|
|---|
| [471ff17] | 258 | % We need listing Rust/rust to format code snipits from it.
|
|---|
| 259 | % Rust's \code{rust}{Result<T, E>}
|
|---|
| [417e8ea] | 260 | The main advantage is providing for more information about an
|
|---|
| 261 | error, other than one of a fix-set of ids.
|
|---|
| 262 | While some languages use checked union access to force error-code checking,
|
|---|
| 263 | it is still possible to bypass the checking.
|
|---|
| 264 | The main disadvantage is again significant error code on the main execution path and cascading through called functions.
|
|---|
| [471ff17] | 265 |
|
|---|
| 266 | \item\emph{Handler Functions}:
|
|---|
| [417e8ea] | 267 | This pattern implicitly associates functions with errors.
|
|---|
| 268 | On error, the function that produced the error implicitly calls another function to
|
|---|
| [471ff17] | 269 | handle it.
|
|---|
| 270 | The handler function can be provided locally (passed in as an argument,
|
|---|
| 271 | either directly as as a field of a structure/object) or globally (a global
|
|---|
| 272 | variable).
|
|---|
| [417e8ea] | 273 | C++ uses this approach as its fallback system if exception handling fails, \eg
|
|---|
| [471ff17] | 274 | \snake{std::terminate_handler} and for a time \snake{std::unexpected_handler}
|
|---|
| 275 |
|
|---|
| [417e8ea] | 276 | Handler functions work a lot like resumption exceptions, without the dynamic handler search.
|
|---|
| 277 | Therefore, setting setting up the handler can be more complex/expensive, especially if the handle must be passed through multiple function calls, but cheaper to call $O(1)$, and hence,
|
|---|
| 278 | are more suited to frequent exceptional situations.
|
|---|
| 279 | % The exception being global handlers if they are rarely change as the time
|
|---|
| 280 | % in both cases shrinks towards zero.
|
|---|
| [471ff17] | 281 | \end{itemize}
|
|---|
| 282 |
|
|---|
| 283 | %\subsection
|
|---|
| [417e8ea] | 284 | Because of their cost, exceptions are rarely used for hot paths of execution.
|
|---|
| 285 | Therefore, there is an element of self-fulfilling prophecy for implementation
|
|---|
| 286 | techniques to make exceptions cheap to set-up at the cost
|
|---|
| 287 | of expensive usage.
|
|---|
| 288 | This cost differential is less important in higher-level scripting languages, where use of exceptions for other tasks is more common.
|
|---|
| 289 | An iconic example is Python's @StopIteration@ exception that is thrown by
|
|---|
| 290 | an iterator to indicate that it is exhausted, especially when combined with Python's heavy
|
|---|
| 291 | use of the iterator-based for-loop.
|
|---|
| [471ff17] | 292 | % https://docs.python.org/3/library/exceptions.html#StopIteration
|
|---|