Changeset 12b4ab4 for doc/theses/andrew_beach_MMath

Timestamp:

Jan 21, 2021, 11:41:23 AM (4 years ago)

Author:

Andrew Beach <ajbeach@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

1adab3e

Parents:

79c14d6

Message:

Andrew MMath: Added a bit on the implementation of rcursive resumption avoidance.

File:

• doc/theses/andrew_beach_MMath/implement.tex (modified) (1 diff)

doc/theses/andrew_beach_MMath/implement.tex

@@ -407 +407 @@
 statement, cause the function to return true.
 
+% Recursive Resumption Stuff:
+Blocking out part of the stack is accomplished by updating the front of the
+list as the search continues. Before the handler at a node is called the head
+of the list is updated to the next node of the current node. After the search
+is complete, successful or not, the head of the list is reset.
+
+This means the current handler and every handler that has already been
+checked are not on the list while a handler is run. If a resumption is thrown
+during the handling of another resumption the active handlers and all the
+other handler checked up to this point will not be checked again.
+
+This structure also supports new handler added while the resumption is being
+handled. These are added to the front of the list, pointing back along the
+stack -- the first one will point over all the checked handlers -- and the
+ordering is maintained.
+
 \subsection{Libunwind Compatibility}
 Resumption does not use libunwind for two simple reasons. The first is that