Changeset 12b4ab4 for doc/theses


Ignore:
Timestamp:
Jan 21, 2021, 11:41:23 AM (9 months ago)
Author:
Andrew Beach <ajbeach@…>
Branches:
arm-eh, jacob/cs343-translation, master, new-ast-unique-expr
Children:
1adab3e
Parents:
79c14d6
Message:

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

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/andrew_beach_MMath/implement.tex

    r79c14d6 r12b4ab4  
    407407statement, cause the function to return true.
    408408
     409% Recursive Resumption Stuff:
     410Blocking out part of the stack is accomplished by updating the front of the
     411list as the search continues. Before the handler at a node is called the head
     412of the list is updated to the next node of the current node. After the search
     413is complete, successful or not, the head of the list is reset.
     414
     415This means the current handler and every handler that has already been
     416checked are not on the list while a handler is run. If a resumption is thrown
     417during the handling of another resumption the active handlers and all the
     418other handler checked up to this point will not be checked again.
     419
     420This structure also supports new handler added while the resumption is being
     421handled. These are added to the front of the list, pointing back along the
     422stack -- the first one will point over all the checked handlers -- and the
     423ordering is maintained.
     424
    409425\subsection{Libunwind Compatibility}
    410426Resumption does not use libunwind for two simple reasons. The first is that
Note: See TracChangeset for help on using the changeset viewer.