| 1 | \chapter{Introduction}
 | 
|---|
| 2 | 
 | 
|---|
| 3 | % The highest level overview of Cforall and EHMs. Get this done right away.
 | 
|---|
| 4 | This thesis covers the design and implementation of the exception handling
 | 
|---|
| 5 | mechanism (EHM) of
 | 
|---|
| 6 | \CFA (pronounced sea-for-all and may be written Cforall or CFA).
 | 
|---|
| 7 | \CFA is a new programming language that extends C, which maintains
 | 
|---|
| 8 | backwards-compatibility while introducing modern programming features.
 | 
|---|
| 9 | Adding exception handling to \CFA gives it new ways to handle errors and
 | 
|---|
| 10 | make large control-flow jumps.
 | 
|---|
| 11 | 
 | 
|---|
| 12 | % Now take a step back and explain what exceptions are generally.
 | 
|---|
| 13 | Exception handling provides dynamic inter-function control flow.
 | 
|---|
| 14 | A language's EHM is a combination of language syntax and run-time
 | 
|---|
| 15 | components that construct, raise, propagate and handle exceptions,
 | 
|---|
| 16 | to provide all of that control flow.
 | 
|---|
| 17 | There are two forms of exception handling covered in this thesis:
 | 
|---|
| 18 | termination, which acts as a multi-level return,
 | 
|---|
| 19 | and resumption, which is a dynamic function call.
 | 
|---|
| 20 | % About other works:
 | 
|---|
| 21 | Often, when this separation is not made, termination exceptions are assumed
 | 
|---|
| 22 | as they are more common and may be the only form of handling provided in
 | 
|---|
| 23 | a language.
 | 
|---|
| 24 | 
 | 
|---|
| 25 | All types of exception handling link a raise with a handler.
 | 
|---|
| 26 | Both operations are usually language primitives, although raises can be
 | 
|---|
| 27 | treated as a function that takes an exception argument.
 | 
|---|
| 28 | Handlers are more complex, as they are added to and removed from the stack
 | 
|---|
| 29 | during execution, must specify what they can handle and must give the code to
 | 
|---|
| 30 | handle the exception.
 | 
|---|
| 31 | 
 | 
|---|
| 32 | Exceptions work with different execution models but for the descriptions
 | 
|---|
| 33 | that follow a simple call stack, with functions added and removed in a
 | 
|---|
| 34 | first-in-last-out order, is assumed.
 | 
|---|
| 35 | 
 | 
|---|
| 36 | Termination exception handling searches the stack for the handler, then
 | 
|---|
| 37 | unwinds the stack to where the handler was found before calling it.
 | 
|---|
| 38 | The handler is run inside the function that defined it and when it finishes
 | 
|---|
| 39 | it returns control to that function.
 | 
|---|
| 40 | \begin{center}
 | 
|---|
| 41 | %\input{termination}
 | 
|---|
| 42 | %
 | 
|---|
| 43 | %\medskip
 | 
|---|
| 44 | \input{termhandle.pstex_t}
 | 
|---|
| 45 | % I hate these diagrams, but I can't access xfig to fix them and they are
 | 
|---|
| 46 | % better than the alternative.
 | 
|---|
| 47 | \end{center}
 | 
|---|
| 48 | 
 | 
|---|
| 49 | Resumption exception handling searches the stack for a handler and then calls
 | 
|---|
| 50 | it without removing any other stack frames.
 | 
|---|
| 51 | The handler is run on top of the existing stack, often as a new function or
 | 
|---|
| 52 | closure capturing the context in which the handler was defined.
 | 
|---|
| 53 | After the handler has finished running, it returns control to the function
 | 
|---|
| 54 | that preformed the raise, usually starting after the raise.
 | 
|---|
| 55 | \begin{center}
 | 
|---|
| 56 | %\input{resumption}
 | 
|---|
| 57 | %
 | 
|---|
| 58 | %\medskip
 | 
|---|
| 59 | \input{resumhandle.pstex_t}
 | 
|---|
| 60 | % The other one.
 | 
|---|
| 61 | \end{center}
 | 
|---|
| 62 | 
 | 
|---|
| 63 | Although a powerful feature, exception handling tends to be complex to set up
 | 
|---|
| 64 | and expensive to use,
 | 
|---|
| 65 | so it is often limited to unusual or ``exceptional" cases.
 | 
|---|
| 66 | The classic example is error handling; exceptions can be used to
 | 
|---|
| 67 | remove error handling logic from the main execution path, and pay
 | 
|---|
| 68 | most of the cost only when the error actually occurs.
 | 
|---|
| 69 | 
 | 
|---|
| 70 | \section{Thesis Overview}
 | 
|---|
| 71 | This work describes the design and implementation of the \CFA EHM.
 | 
|---|
| 72 | The \CFA EHM implements all of the common exception features (or an
 | 
|---|
| 73 | equivalent) found in most other EHMs and adds some features of its own.
 | 
|---|
| 74 | The design of all the features had to be adapted to \CFA's feature set, as
 | 
|---|
| 75 | some of the underlying tools used to implement and express exception handling
 | 
|---|
| 76 | in other languages are absent in \CFA.
 | 
|---|
| 77 | Still, the resulting syntax resembles that of other languages:
 | 
|---|
| 78 | \begin{cfa}
 | 
|---|
| 79 | try {
 | 
|---|
| 80 |         ...
 | 
|---|
| 81 |         T * object = malloc(request_size);
 | 
|---|
| 82 |         if (!object) {
 | 
|---|
| 83 |                 throw OutOfMemory{fixed_allocation, request_size};
 | 
|---|
| 84 |         }
 | 
|---|
| 85 |         ...
 | 
|---|
| 86 | } catch (OutOfMemory * error) {
 | 
|---|
| 87 |         ...
 | 
|---|
| 88 | }
 | 
|---|
| 89 | \end{cfa}
 | 
|---|
| 90 | % A note that yes, that was a very fast overview.
 | 
|---|
| 91 | The design and implementation of all of \CFA's EHM's features are
 | 
|---|
| 92 | described in detail throughout this thesis, whether they are a common feature
 | 
|---|
| 93 | or one unique to \CFA.
 | 
|---|
| 94 | 
 | 
|---|
| 95 | % The current state of the project and what it contributes.
 | 
|---|
| 96 | All of these features have been implemented in \CFA,
 | 
|---|
| 97 | covering both changes to the compiler and the run-time.
 | 
|---|
| 98 | In addition, a suite of test cases and performance benchmarks were created
 | 
|---|
| 99 | alongside the implementation.
 | 
|---|
| 100 | The implementation techniques are generally applicable in other programming
 | 
|---|
| 101 | languages and much of the design is as well.
 | 
|---|
| 102 | Some parts of the EHM use other features unique to \CFA and would be
 | 
|---|
| 103 | harder to replicate in other programming languages.
 | 
|---|
| 104 | 
 | 
|---|
| 105 | The contributions of this work are:
 | 
|---|
| 106 | \begin{enumerate}
 | 
|---|
| 107 | \item Designing \CFA's exception handling mechanism, adapting designs from
 | 
|---|
| 108 | other programming languages and creating new features.
 | 
|---|
| 109 | \item Implementing stack unwinding and the \CFA EHM, including updating
 | 
|---|
| 110 | the \CFA compiler and the run-time environment.
 | 
|---|
| 111 | \item Designing and implementing a prototype virtual system.
 | 
|---|
| 112 | % I think the virtual system and per-call site default handlers are the only
 | 
|---|
| 113 | % "new" features, everything else is a matter of implementation.
 | 
|---|
| 114 | \item Creating tests to check the behaviour of the EHM.
 | 
|---|
| 115 | \item Creating benchmarks to check the performance of the EHM,
 | 
|---|
| 116 | as compared to other languages.
 | 
|---|
| 117 | \end{enumerate}
 | 
|---|
| 118 | 
 | 
|---|
| 119 | The rest of this thesis is organized as follows.
 | 
|---|
| 120 | The current state of exceptions is covered in \autoref{s:background}.
 | 
|---|
| 121 | The existing state of \CFA is covered in \autoref{c:existing}.
 | 
|---|
| 122 | New EHM features are introduced in \autoref{c:features},
 | 
|---|
| 123 | covering their usage and design.
 | 
|---|
| 124 | That is followed by the implementation of these features in
 | 
|---|
| 125 | \autoref{c:implement}.
 | 
|---|
| 126 | Performance results are examined in \autoref{c:performance}.
 | 
|---|
| 127 | Possibilities to extend this project are discussed in \autoref{c:future}.
 | 
|---|
| 128 | Finally, the project is summarized in \autoref{c:conclusion}.
 | 
|---|
| 129 | 
 | 
|---|
| 130 | \section{Background}
 | 
|---|
| 131 | \label{s:background}
 | 
|---|
| 132 | 
 | 
|---|
| 133 | Exception handling has been examined before in programming languages,
 | 
|---|
| 134 | with papers on the subject dating back 70s.\cite{Goodenough75}
 | 
|---|
| 135 | Early exceptions were often treated as signals, which carried no information
 | 
|---|
| 136 | except their identity.
 | 
|---|
| 137 | Ada originally used this system\cite{Ada}, but now allows for a string
 | 
|---|
| 138 | message as a payload\cite{Ada12}.
 | 
|---|
| 139 | 
 | 
|---|
| 140 | The modern flagship for termination exceptions -- if one exists -- is \Cpp,
 | 
|---|
| 141 | which added them in its first major wave of non-object-orientated features
 | 
|---|
| 142 | in 1990.\cite{CppHistory}
 | 
|---|
| 143 | Many EHMs have special exception types,
 | 
|---|
| 144 | however \Cpp has the ability to use any type as an exception.
 | 
|---|
| 145 | These were found to be not very useful and have been pushed aside for classes
 | 
|---|
| 146 | inheriting from
 | 
|---|
| 147 | \code{C++}{std::exception}.
 | 
|---|
| 148 | Although there is a special catch-all syntax (@catch(...)@), there are no
 | 
|---|
| 149 | operations that can be performed on the caught value, not even type inspection.
 | 
|---|
| 150 | Instead, the base exception-type \code{C++}{std::exception} defines common
 | 
|---|
| 151 | functionality (such as
 | 
|---|
| 152 | the ability to describe the reason the exception was raised) and all
 | 
|---|
| 153 | exceptions have this functionality.
 | 
|---|
| 154 | That trade-off, restricting usable types to gain guaranteed functionality,
 | 
|---|
| 155 | is almost universal now, as without some common functionality it is almost
 | 
|---|
| 156 | impossible to actually handle any errors.
 | 
|---|
| 157 | 
 | 
|---|
| 158 | Java was the next popular language to use exceptions.\cite{Java8}
 | 
|---|
| 159 | Its exception system largely reflects that of \Cpp, except that it requires
 | 
|---|
| 160 | you throw a child type of \code{Java}{java.lang.Throwable}
 | 
|---|
| 161 | and it uses checked exceptions.
 | 
|---|
| 162 | Checked exceptions are part of a function's interface,
 | 
|---|
| 163 | the exception signature of the function.
 | 
|---|
| 164 | Every exception that could be raised from a function, either directly or
 | 
|---|
| 165 | because it is not handled from a called function, is given.
 | 
|---|
| 166 | Using this information, it is possible to statically verify if any given
 | 
|---|
| 167 | exception is handled, and guarantee that no exception will go unhandled.
 | 
|---|
| 168 | Making exception information explicit improves clarity and safety,
 | 
|---|
| 169 | but can slow down or restrict programming.
 | 
|---|
| 170 | For example, programming high-order functions becomes much more complex
 | 
|---|
| 171 | if the argument functions could raise exceptions.
 | 
|---|
| 172 | However, as odd it may seem, the worst problems are rooted in the simple
 | 
|---|
| 173 | inconvenience of writing and updating exception signatures.
 | 
|---|
| 174 | This has caused Java programmers to develop multiple programming ``hacks''
 | 
|---|
| 175 | to circumvent checked exceptions, negating their advantages.
 | 
|---|
| 176 | One particularly problematic example is the ``catch-and-ignore'' pattern,
 | 
|---|
| 177 | where an empty handler is used to handle an exception without doing any
 | 
|---|
| 178 | recovery or repair. In theory that could be good enough to properly handle
 | 
|---|
| 179 | the exception, but more often is used to ignore an exception that the       
 | 
|---|
| 180 | programmer does not feel is worth the effort of handling, for instance if
 | 
|---|
| 181 | they do not believe it will ever be raised.
 | 
|---|
| 182 | If they are incorrect, the exception will be silenced, while in a similar
 | 
|---|
| 183 | situation with unchecked exceptions the exception would at least activate    
 | 
|---|
| 184 | the language's unhandled exception code (usually, a program abort with an
 | 
|---|
| 185 | error message).
 | 
|---|
| 186 | 
 | 
|---|
| 187 | %\subsection
 | 
|---|
| 188 | Resumption exceptions are less popular,
 | 
|---|
| 189 | although resumption is as old as termination; that is, few
 | 
|---|
| 190 | programming languages have implemented them.
 | 
|---|
| 191 | % http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/
 | 
|---|
| 192 | %   CSL-79-3_Mesa_Language_Manual_Version_5.0.pdf
 | 
|---|
| 193 | Mesa is one programming language that did.\cite{Mesa} Experience with Mesa
 | 
|---|
| 194 | is quoted as being one of the reasons resumptions were not
 | 
|---|
| 195 | included in the \Cpp standard.
 | 
|---|
| 196 | % https://en.wikipedia.org/wiki/Exception_handling
 | 
|---|
| 197 | Since then, resumptions have been ignored in mainstream programming languages.
 | 
|---|
| 198 | However, resumption is being revisited in the context of decades of other
 | 
|---|
| 199 | developments in programming languages.
 | 
|---|
| 200 | While rejecting resumption may have been the right decision in the past,
 | 
|---|
| 201 | the situation has changed since then.
 | 
|---|
| 202 | Some developments, such as the functional programming equivalent to resumptions,
 | 
|---|
| 203 | algebraic effects\cite{Zhang19}, are enjoying success.
 | 
|---|
| 204 | A complete reexamination of resumption is beyond this thesis,
 | 
|---|
| 205 | but their reemergence is enough reason to try them in \CFA.
 | 
|---|
| 206 | % Especially considering how much easier they are to implement than
 | 
|---|
| 207 | % termination exceptions and how much Peter likes them.
 | 
|---|
| 208 | 
 | 
|---|
| 209 | %\subsection
 | 
|---|
| 210 | Functional languages tend to use other solutions for their primary error
 | 
|---|
| 211 | handling mechanism, but exception-like constructs still appear.
 | 
|---|
| 212 | Termination appears in the error construct, which marks the result of an
 | 
|---|
| 213 | expression as an error; then the result of any expression that tries to use
 | 
|---|
| 214 | it also results in an error, and so on until an appropriate handler is reached.
 | 
|---|
| 215 | Resumption appears in algebraic effects, where a function dispatches its
 | 
|---|
| 216 | side-effects to its caller for handling.
 | 
|---|
| 217 | 
 | 
|---|
| 218 | %\subsection
 | 
|---|
| 219 | More recently, exceptions seem to be vanishing from newer programming
 | 
|---|
| 220 | languages, replaced by ``panic".
 | 
|---|
| 221 | In Rust, a panic is just a program level abort that may be implemented by
 | 
|---|
| 222 | unwinding the stack like in termination exception
 | 
|---|
| 223 | handling.\cite{RustPanicMacro}\cite{RustPanicModule}
 | 
|---|
| 224 | Go's panic though is very similar to a termination, except it only supports
 | 
|---|
| 225 | a catch-all by calling \code{Go}{recover()}, simplifying the interface at
 | 
|---|
| 226 | the cost of flexibility.\cite{Go:2021}
 | 
|---|
| 227 | 
 | 
|---|
| 228 | %\subsection
 | 
|---|
| 229 | As exception handling's most common use cases are in error handling,
 | 
|---|
| 230 | here are some other ways to handle errors with comparisons with exceptions.
 | 
|---|
| 231 | \begin{itemize}
 | 
|---|
| 232 | \item\emph{Error Codes}:
 | 
|---|
| 233 | This pattern has a function return an enumeration (or just a set of fixed
 | 
|---|
| 234 | values) to indicate if an error has occurred and possibly which error it was.
 | 
|---|
| 235 | 
 | 
|---|
| 236 | Error codes mix exceptional/error and normal values, enlarging the range of
 | 
|---|
| 237 | possible return values. This can be addressed with multiple return values
 | 
|---|
| 238 | (or a tuple) or a tagged union.
 | 
|---|
| 239 | However, the main issue with error codes is forgetting to check them,
 | 
|---|
| 240 | which leads to an error being quietly and implicitly ignored.
 | 
|---|
| 241 | Some new languages and tools will try to issue warnings when an error code
 | 
|---|
| 242 | is discarded to avoid this problem.
 | 
|---|
| 243 | Checking error codes also bloats the main execution path,
 | 
|---|
| 244 | especially if the error is not handled immediately and has to be passed
 | 
|---|
| 245 | through multiple functions before it is addressed.
 | 
|---|
| 246 | 
 | 
|---|
| 247 | Here is an example of the pattern in Bash, where commands can only  ``return"
 | 
|---|
| 248 | numbers and most output is done through streams of text.
 | 
|---|
| 249 | \begin{lstlisting}[language=bash,escapechar={}]
 | 
|---|
| 250 | # Immediately after running a command:
 | 
|---|
| 251 | case $? in
 | 
|---|
| 252 | 0)
 | 
|---|
| 253 |         # Success
 | 
|---|
| 254 |         ;;
 | 
|---|
| 255 | 1)
 | 
|---|
| 256 |         # Error Code 1
 | 
|---|
| 257 |         ;;
 | 
|---|
| 258 | 2|3)
 | 
|---|
| 259 |         # Error Code 2 or Error Code 3
 | 
|---|
| 260 |         ;;
 | 
|---|
| 261 | # Add more cases as needed.
 | 
|---|
| 262 | asac
 | 
|---|
| 263 | \end{lstlisting}
 | 
|---|
| 264 | 
 | 
|---|
| 265 | \item\emph{Special Return with Global Store}:
 | 
|---|
| 266 | Similar to the error codes pattern but the function itself only returns
 | 
|---|
| 267 | that there was an error,
 | 
|---|
| 268 | and stores the reason for the error in a fixed global location.
 | 
|---|
| 269 | For example, many routines in the C standard library will only return some
 | 
|---|
| 270 | error value (such as -1 or a null pointer) and the error code is written into
 | 
|---|
| 271 | the standard variable @errno@.
 | 
|---|
| 272 | 
 | 
|---|
| 273 | This approach avoids the multiple results issue encountered with straight
 | 
|---|
| 274 | error codes as only a single error value has to be returned,
 | 
|---|
| 275 | but otherwise has the same disadvantages and more.
 | 
|---|
| 276 | Every function that reads or writes to the global store must agree on all
 | 
|---|
| 277 | possible errors and managing it becomes more complex with concurrency.
 | 
|---|
| 278 | 
 | 
|---|
| 279 | This example shows some of what has to be done to robustly handle a C
 | 
|---|
| 280 | standard library function that reports errors this way.
 | 
|---|
| 281 | \begin{lstlisting}[language=C]
 | 
|---|
| 282 | // Now a library function can set the error.
 | 
|---|
| 283 | int handle = open(path_name, flags);
 | 
|---|
| 284 | if (-1 == handle) {
 | 
|---|
| 285 |         switch (errno) {
 | 
|---|
| 286 |     case ENAMETOOLONG:
 | 
|---|
| 287 |                 // path_name is a bad argument.
 | 
|---|
| 288 |                 break;
 | 
|---|
| 289 |         case ENFILE:
 | 
|---|
| 290 |                 // A system resource has been exausted.
 | 
|---|
| 291 |                 break;
 | 
|---|
| 292 |         // And many more...
 | 
|---|
| 293 |     }
 | 
|---|
| 294 | }
 | 
|---|
| 295 | \end{lstlisting}
 | 
|---|
| 296 | % cite open man page?
 | 
|---|
| 297 | 
 | 
|---|
| 298 | \item\emph{Return Union}:
 | 
|---|
| 299 | This pattern replaces error codes with a tagged union.
 | 
|---|
| 300 | Success is one tag and the errors are another.
 | 
|---|
| 301 | It is also possible to make each possible error its own tag and carry its own
 | 
|---|
| 302 | additional information, but the two-branch format is easy to make generic
 | 
|---|
| 303 | so that one type can be used everywhere in error handling code.
 | 
|---|
| 304 | 
 | 
|---|
| 305 | This pattern is very popular in any functional or semi-functional language
 | 
|---|
| 306 | with primitive support for tagged unions (or algebraic data types).
 | 
|---|
| 307 | Return unions can also be expressed as monads (evaluation in a context)
 | 
|---|
| 308 | and often are in languages with special syntax for monadic evaluation,
 | 
|---|
| 309 | such as Haskell's \code{haskell}{do} blocks.
 | 
|---|
| 310 | 
 | 
|---|
| 311 | The main advantage is that an arbitrary object can be used to represent an
 | 
|---|
| 312 | error, so it can include a lot more information than a simple error code.
 | 
|---|
| 313 | The disadvantages include that the it does have to be checked along the main
 | 
|---|
| 314 | execution, and if there aren't primitive tagged unions proper, usage can be
 | 
|---|
| 315 | hard to enforce.
 | 
|---|
| 316 | % We need listing Rust/rust to format code snippets from it.
 | 
|---|
| 317 | % Rust's \code{rust}{Result<T, E>}
 | 
|---|
| 318 | 
 | 
|---|
| 319 | This is a simple example of examining the result of a failing function in
 | 
|---|
| 320 | Haskell, using its \code{haskell}{Either} type.
 | 
|---|
| 321 | Examining \code{haskell}{error} further would likely involve more matching,
 | 
|---|
| 322 | but the type of \code{haskell}{error} is user defined so there are no
 | 
|---|
| 323 | general cases.
 | 
|---|
| 324 | \begin{lstlisting}[language=haskell]
 | 
|---|
| 325 | case failingFunction argA argB of
 | 
|---|
| 326 |     Right value -> -- Use the successful computed value.
 | 
|---|
| 327 |     Left error -> -- Handle the produced error.
 | 
|---|
| 328 | \end{lstlisting}
 | 
|---|
| 329 | 
 | 
|---|
| 330 | Return unions as monads will result in the same code, but can hide most
 | 
|---|
| 331 | of the work to propagate errors in simple cases. The code to actually handle
 | 
|---|
| 332 | the errors, or to interact with other monads (a common case in these
 | 
|---|
| 333 | languages) still has to be written by hand.
 | 
|---|
| 334 | 
 | 
|---|
| 335 | If \code{haskell}{failingFunction} is implemented with two helpers that
 | 
|---|
| 336 | use the same error type, then it can be implemented with a \code{haskell}{do}
 | 
|---|
| 337 | block.
 | 
|---|
| 338 | \begin{lstlisting}[language=haskell,literate={}]
 | 
|---|
| 339 | failingFunction x y = do
 | 
|---|
| 340 |         z <- helperOne x
 | 
|---|
| 341 |         helperTwo y z
 | 
|---|
| 342 | \end{lstlisting}
 | 
|---|
| 343 | 
 | 
|---|
| 344 | \item\emph{Handler Functions}:
 | 
|---|
| 345 | This pattern associates errors with functions.
 | 
|---|
| 346 | On error, the function that produced the error calls another function to
 | 
|---|
| 347 | handle it.
 | 
|---|
| 348 | The handler function can be provided locally (passed in as an argument,
 | 
|---|
| 349 | either directly as as a field of a structure/object) or globally (a global
 | 
|---|
| 350 | variable).
 | 
|---|
| 351 | C++ uses this approach as its fallback system if exception handling fails,
 | 
|---|
| 352 | such as \snake{std::terminate} and, for a time,
 | 
|---|
| 353 | \snake{std::unexpected}.\footnote{\snake{std::unexpected} was part of the
 | 
|---|
| 354 | Dynamic Exception Specification, which has been removed from the standard
 | 
|---|
| 355 | as of C++20.\cite{CppExceptSpec}}
 | 
|---|
| 356 | 
 | 
|---|
| 357 | Handler functions work a lot like resumption exceptions,
 | 
|---|
| 358 | but without the dynamic search for a handler.
 | 
|---|
| 359 | Since setting up the handler can be more complex/expensive,
 | 
|---|
| 360 | especially when the handler has to be passed through multiple layers of
 | 
|---|
| 361 | function calls, but cheaper (constant time) to call,
 | 
|---|
| 362 | they are more suited to more frequent (less exceptional) situations.
 | 
|---|
| 363 | Although, in \Cpp and other languages that do not have checked exceptions,
 | 
|---|
| 364 | they can actually be enforced by the type system be more reliable.
 | 
|---|
| 365 | 
 | 
|---|
| 366 | This is a more local example in \Cpp, using a function to provide
 | 
|---|
| 367 | a default value for a mapping.
 | 
|---|
| 368 | \begin{lstlisting}[language=C++]
 | 
|---|
| 369 | ValueT Map::key_or_default(KeyT key, ValueT(*make_default)(KeyT)) {
 | 
|---|
| 370 |         ValueT * value = find_value(key);
 | 
|---|
| 371 |         if (nullptr != value) {
 | 
|---|
| 372 |                 return *value;
 | 
|---|
| 373 |         } else {
 | 
|---|
| 374 |                 return make_default(key);
 | 
|---|
| 375 |         }
 | 
|---|
| 376 | }
 | 
|---|
| 377 | \end{lstlisting}
 | 
|---|
| 378 | \end{itemize}
 | 
|---|
| 379 | 
 | 
|---|
| 380 | %\subsection
 | 
|---|
| 381 | Because of their cost, exceptions are rarely used for hot paths of execution.
 | 
|---|
| 382 | Hence, there is an element of self-fulfilling prophecy as implementation
 | 
|---|
| 383 | techniques have been focused on making them cheap to set up,
 | 
|---|
| 384 | happily making them expensive to use in exchange.
 | 
|---|
| 385 | This difference is less important in higher-level scripting languages,
 | 
|---|
| 386 | where using exceptions for other tasks is more common.
 | 
|---|
| 387 | An iconic example is Python's
 | 
|---|
| 388 | \code{Python}{StopIteration}\cite{PythonExceptions} exception, that
 | 
|---|
| 389 | is thrown by an iterator to indicate that it is exhausted.
 | 
|---|
| 390 | When paired with Python's iterator-based for-loop, this will be thrown every
 | 
|---|
| 391 | time the end of the loop is reached.\cite{PythonForLoop}
 | 
|---|