Changeset 7951100

doc/papers/concurrency/Paper.tex

-                      rb4e1876
+                      r7951100
 \newcommand{\Textbf}[2][red]{{\color{#1}{\textbf{#2}}}}
 \newcommand{\Emph}[2][red]{{\color{#1}\textbf{\emph{#2}}}}
-\newcommand{\R}[1]{\Textbf{#1}}
-\newcommand{\B}[1]{{\Textbf[blue]{#1}}}
-\newcommand{\G}[1]{{\Textbf[OliveGreen]{#1}}}
 \newcommand{\uC}{$\mu$\CC}
+\newcommand{\cit}{\textsuperscript{[Citation Needed]}\xspace}
+\newcommand{\TODO}{{\Textbf{TODO}}}
+\newcommand{\TODO}[1]{{\Textbf{#1}}}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 …
 \section{Introduction}
 This paper provides a minimal concurrency \newterm{Abstract Program Interface} (API) that is simple, efficient and can be used to build other concurrency features.
+This paper provides a minimal concurrency \newterm{Application Program Interface} (API) that is simple, efficient and can be used to build other concurrency features.
 While the simplest concurrency system is a thread and a lock, this low-level approach is hard to master.
 An easier approach for programmers is to support higher-level constructs as the basis of concurrency.
 …
 As such, library support for threading is far from widespread.
 At the time of writing the paper, neither \protect\lstinline|gcc| nor \protect\lstinline|clang| support ``threads.h'' in their standard libraries.}.
 On modern architectures, a lack of threading is unacceptable~\cite{Sutter05, Sutter05b}, and therefore existing and new programming languages must have tools for writing efficient concurrent programs to take advantage of parallelism.
+In modern programming languages, a lack of threading is unacceptable~\cite{Sutter05, Sutter05b}, and therefore existing and new programming languages must have tools for writing efficient concurrent programs to take advantage of parallelism.
 As an extension of C, \CFA needs to express these concepts in a way that is as natural as possible to programmers familiar with imperative languages.
 Furthermore, because C is a system-level language, programmers expect to choose precisely which features they need and which cost they are willing to pay.
 …
 \newbox\myboxA
 \begin{lrbox}{\myboxA}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 `int f1, f2, state = 1;`   // single global variables
 int fib() {
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \newbox\myboxB
 \begin{lrbox}{\myboxB}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 #define FIB_INIT `{ 0, 1 }`
 typedef struct { int f2, f1; } Fib;
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 …
 \newbox\myboxA
 \begin{lrbox}{\myboxA}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 `coroutine` Fib { int fn; };
 void main( Fib & fib ) with( fib ) {
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \newbox\myboxB
 \begin{lrbox}{\myboxB}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 `coroutine` Fib { int ret; };
 void main( Fib & f ) with( fib ) {
 …
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \subfloat[3 States, internal variables]{\label{f:Coroutine3States}\usebox\myboxA}
 …
 \newbox\myboxA
 \begin{lrbox}{\myboxA}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 `coroutine` Format {
         char ch;   // used for communication
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \newbox\myboxB
 \begin{lrbox}{\myboxB}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 struct Format {
         char ch;
 …
         format( &fmt );
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \subfloat[\CFA Coroutine]{\label{f:CFAFmt}\usebox\myboxA}
 …
 };
 \end{cfa}
+& {\Large $\Rightarrow$} &
+&
+{\Large $\Rightarrow$}
+&
 \begin{tabular}{@{}ccc@{}}
 \begin{cfa}
 …
 \label{s:InternalScheduling}
 While monitor mutual-exclusion provides safe access to shared data, the monitor data may indicate that a thread accessing it cannot proceed, \eg a bounded buffer, Figure~\ref{f:BoundedBuffer}, may be full/empty so produce/consumer threads must block.
+While monitor mutual-exclusion provides safe access to shared data, the monitor data may indicate that a thread accessing it cannot proceed, \eg a bounded buffer, Figure~\ref{f:GenericBoundedBuffer}, may be full/empty so produce/consumer threads must block.
 Leaving the monitor and trying again (busy waiting) is impractical for high-level programming.
 Monitors eliminate busy waiting by providing internal synchronization to schedule threads needing access to the shared data, where the synchronization is blocking (threads are parked) versus spinning.
 The synchronization is generally achieved with internal~\cite{Hoare74} or external~\cite[\S~2.9.2]{uC++} scheduling, where \newterm{scheduling} is defined as indicating which thread acquires the critical section next.
 \newterm{Internal scheduling} is characterized by each thread entering the monitor and making an individual decision about proceeding or blocking, while \newterm{external scheduling} is characterized by an entering thread making a decision about proceeding for itself and behalf of other threads attempting entry.
+\newterm{Internal scheduling} is characterized by each thread entering the monitor and making an individual decision about proceeding or blocking, while \newterm{external scheduling} is characterized by an entering thread making a decision about proceeding for itself and on behalf of other threads attempting entry.
 Figure~\ref{f:BBInt} shows a \CFA bounded-buffer with internal scheduling, where producers/consumers enter the monitor, see the buffer is full/empty, and block on an appropriate condition lock, @full@/@empty@.
 …
 \begin{enumerate}
 \item
 The signalling thread leaves immediately, and the signalled thread continues.
+The signalling thread returns immediately, and the signalled thread continues.
 \item
 The signalling thread continues and the signalled thread is marked for urgent unblocking at subsequent scheduling points (exit/wait).
+The signalling thread continues and the signalled thread is marked for urgent unblocking at the next scheduling point (exit/wait).
 \item
 The signalling thread blocks but is marked for urgrent unblocking and the signalled thread continues.
+The signalling thread blocks but is marked for urgrent unblocking at the next scheduling point and the signalled thread continues.
 \end{enumerate}
 The first approach is too restrictive, as it precludes solving a reasonable class of problems (\eg dating service).
 \CFA supports the next two semantics as both are useful.
 Finally, while it is common to store a @condition@ as a field of the monitor, in \CFA, a @condition@ variable can be created/stored independently.
+Furthermore, a condition variable is tied to a \emph{group} of monitors on first use (called \newterm{branding}), which means that using internal scheduling with distinct sets of monitors requires one condition variable per set of monitors.
 \begin{figure}
 …
 \newbox\myboxA
 \begin{lrbox}{\myboxA}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 forall( otype T ) { // distribute forall
         monitor Buffer {
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 \newbox\myboxB
 \begin{lrbox}{\myboxB}
 \begin{lstlisting}[aboveskip=0pt,belowskip=0pt]
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
 forall( otype T ) { // distribute forall
         monitor Buffer {
 …
+        }
+}
 \end{lstlisting}
+\end{cfa}
 \end{lrbox}
 …
 \subfloat[External Scheduling]{\label{f:BBExt}\usebox\myboxB}
 \caption{Generic Bounded-Buffer}
 \label{f:BoundedBuffer}
+\label{f:GenericBoundedBuffer}
 \end{figure}
 …
 External scheduling is controlled by the @waitfor@ statement, which atomically blocks the calling thread, releases the monitor lock, and restricts the routine calls that can next acquire mutual exclusion.
 If the buffer is full, only calls to @remove@ can acquire the buffer, and if the buffer is empty, only calls to @insert@ can acquire the buffer.
+Threads making calls to routines that are currently excluded wait outside (externally) of the monitor on a calling queue.
+An important aspect of monitor implementation is barging, \ie can calling threads barge ahead of signalled threads?
+Threads making calls to routines that are currently excluded block outside (externally) of the monitor on a calling queue, versus blocking on condition queues inside the monitor.
+Both internal and external scheduling extend to multiple monitors in a natural way.
+\begin{cfa}
+monitor M { `condition e`; ... };
+void foo( M & mutex m1, M & mutex m2 ) {
+        ... wait( `e` ); ...                                    $\C{// wait( e, m1, m2 )}$
+        ... wait( `e, m1` ); ...
+        ... wait( `e, m2` ); ...
+}
+void rtn$\(_1\)$( M & mutex m1, M & mutex m2 );
+void rtn$\(_2\)$( M & mutex m1 );
+void bar( M & mutex m1, M & mutex m2 ) {
+        ... waitfor( `rtn` ); ...                               $\C{// waitfor( rtn\(_1\), m1, m2 )}$
+        ... waitfor( `rtn, m1` ); ...                   $\C{// waitfor( rtn\(_2\), m1 )}$
+}
+\end{cfa}
+For @wait( e )@, the default semantics is to atomically block the signaller and release all acquired mutex types in the parameter list, \ie @wait( e, m1, m2 )@.
+To override the implicit multi-monitor wait, specific mutex parameter(s) can be specified, \eg @wait( e, m1 )@.
+Wait statically verifies the released monitors are the acquired mutex-parameters so unconditional release is safe.
+Similarly, for @waitfor( rtn, ... )@, the default semantics is to atomically block the acceptor and release all acquired mutex types in the parameter list, \ie @waitfor( rtn, m1, m2 )@.
+To override the implicit multi-monitor wait, specific mutex parameter(s) can be specified, \eg @waitfor( rtn, m1 )@.
+Waitfor statically verifies the released monitors are the same as the acquired mutex-parameters of the given routine or routine pointer.
+To statically verify the released monitors match with the accepted routine's mutex parameters, the routine (pointer) prototype must be accessible.
+Given the ability to release a subset of acquired monitors can result in a \newterm{nested monitor}~\cite{Lister77} deadlock.
+\begin{cfa}
+void foo( M & mutex m1, M & mutex m2 ) {
+        ... wait( `e, m1` ); ...                                $\C{// release m1, keeping m2 acquired )}$
+void baz( M & mutex m1, M & mutex m2 ) {        $\C{// must acquire m1 and m2 )}$
+        ... signal( `e` ); ...
+\end{cfa}
+The @wait@ only releases @m1@ so the signalling thread cannot acquire both @m1@ and @m2@ to  enter @baz@ to get to the @signal@.
+While deadlock issues can occur with multiple/nesting acquisition, this issue results from the fact that locks, and by extension monitors, are not perfectly composable.
+Finally, an important aspect of monitor implementation is barging, \ie can calling threads barge ahead of signalled threads?
 If barging is allowed, synchronization between a singller and signallee is difficult, often requiring multiple unblock/block cycles (looping around a wait rechecking if a condition is met).
+\CFA scheduling does \emph{not} have barging, which simplifies synchronization among threads in the monitor.
+\begin{quote}
+However, we decree that a signal operation be followed immediately by resumption of a waiting program, without possibility of an intervening procedure call from yet a third program.
+It is only in this way that a waiting program has an absolute guarantee that it can acquire the resource just released by the signalling program without any danger that a third program will interpose a monitor entry and seize the resource instead.~\cite[p.~550]{Hoare74}
+\end{quote}
+\CFA scheduling \emph{precludes} barging, which simplifies synchronization among threads in the monitor and increases correctness.
+For example, there are no loops in either bounded buffer solution in Figure~\ref{f:GenericBoundedBuffer}.
 Supporting barging prevention as well as extending internal scheduling to multiple monitors is the main source of complexity in the design and implementation of \CFA concurrency.
+Indeed, like the bulk acquire semantics, internal scheduling extends to multiple monitors in a way that is natural to the user but requires additional complexity on the implementation side.
+First, here is a simple example of internal scheduling:
+\begin{cfa}
+monitor A {
+        condition e;
+}
+void foo(A& mutex a1, A& mutex a2) {
+\subsection{Barging Prevention}
+Figure~\ref{f:BargingPrevention} shows \CFA code where bulk acquire adds complexity to the internal-signalling semantics.
+The complexity begins at the end of the inner @mutex@ statement, where the semantics of internal scheduling need to be extended for multiple monitors.
+The problem is that bulk acquire is used in the inner @mutex@ statement where one of the monitors is already acquired.
+When the signalling thread reaches the end of the inner @mutex@ statement, it should transfer ownership of @m1@ and @m2@ to the waiting thread to prevent barging into the outer @mutex@ statement by another thread.
+However, both the signalling and signalled threads still need monitor @m1@.
+\begin{figure}
+\newbox\myboxA
+\begin{lrbox}{\myboxA}
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
+monitor M m1, m2;
+condition c;
+mutex( m1 ) {
         ...
+        // Wait for cooperation from bar()
+        wait(a1.e);
+        mutex( m1, m2 ) {
+                ... `wait( c )`; // block and release m1, m2
+                // m1, m2 acquired
+        } // $\LstCommentStyle{\color{red}release m2}$
+        // m1 acquired
+} // release m1
+\end{cfa}
+\end{lrbox}
+\newbox\myboxB
+\begin{lrbox}{\myboxB}
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
+mutex( m1 ) {
         ...
+}
+void bar(A& mutex a1, A& mutex a2) {
+        // Provide cooperation for foo()
+        ...
+        // Unblock foo
+        signal(a1.e);
+}
+\end{cfa}
+% ======================================================================
+% ======================================================================
+\subsection{Internal Scheduling - Multi-Monitor}
+% ======================================================================
+% ======================================================================
+It is easy to understand the problem of multi-monitor scheduling using a series of pseudo-code examples.
+Note that for simplicity in the following snippets of pseudo-code, waiting and signalling is done using an implicit condition variable, like Java built-in monitors.
+Indeed, @wait@ statements always use the implicit condition variable as parameters and explicitly name the monitors (A and B) associated with the condition.
+Note that in \CFA, condition variables are tied to a \emph{group} of monitors on first use (called branding), which means that using internal scheduling with distinct sets of monitors requires one condition variable per set of monitors.
+The example below shows the simple case of having two threads (one for each column) and a single monitor A.
+\begin{multicols}{2}
+thread 1
+\begin{cfa}
+acquire A
+        wait A
+release A
+\end{cfa}
+\columnbreak
+thread 2
+\begin{cfa}
+acquire A
+        signal A
+release A
+\end{cfa}
+\end{multicols}
+One thread acquires before waiting (atomically blocking and releasing A) and the other acquires before signalling.
+It is important to note here that both @wait@ and @signal@ must be called with the proper monitor(s) already acquired.
+This semantic is a logical requirement for barging prevention.
+A direct extension of the previous example is a bulk acquire version:
+\begin{multicols}{2}
+\begin{cfa}
+acquire A & B
+        wait A & B
+release A & B
+\end{cfa}
+\columnbreak
+\begin{cfa}
+acquire A & B
+        signal A & B
+release A & B
+\end{cfa}
+\end{multicols}
+\noindent This version uses bulk acquire (denoted using the {\sf\&} symbol), but the presence of multiple monitors does not add a particularly new meaning.
+Synchronization happens between the two threads in exactly the same way and order.
+The only difference is that mutual exclusion covers a group of monitors.
+On the implementation side, handling multiple monitors does add a degree of complexity as the next few examples demonstrate.
+While deadlock issues can occur when nesting monitors, these issues are only a symptom of the fact that locks, and by extension monitors, are not perfectly composable.
+For monitors, a well-known deadlock problem is the Nested Monitor Problem~\cite{Lister77}, which occurs when a @wait@ is made by a thread that holds more than one monitor.
+For example, the following cfa-code runs into the nested-monitor problem:
+\begin{multicols}{2}
+\begin{cfa}
+acquire A
+        acquire B
+                wait B
+        release B
+release A
+\end{cfa}
+\columnbreak
+\begin{cfa}
+acquire A
+        acquire B
+                signal B
+        release B
+release A
+\end{cfa}
+\end{multicols}
+\noindent The @wait@ only releases monitor @B@ so the signalling thread cannot acquire monitor @A@ to get to the @signal@.
+Attempting release of all acquired monitors at the @wait@ introduces a different set of problems, such as releasing monitor @C@, which has nothing to do with the @signal@.
+However, for monitors as for locks, it is possible to write a program using nesting without encountering any problems if nesting is done correctly.
+For example, the next cfa-code snippet acquires monitors {\sf A} then {\sf B} before waiting, while only acquiring {\sf B} when signalling, effectively avoiding the Nested Monitor Problem~\cite{Lister77}.
+\begin{multicols}{2}
+\begin{cfa}
+acquire A
+        acquire B
+                wait B
+        release B
+release A
+\end{cfa}
+\columnbreak
+\begin{cfa}
+acquire B
+        signal B
+release B
+\end{cfa}
+\end{multicols}
+\noindent However, this simple refactoring may not be possible, forcing more complex restructuring.
+% ======================================================================
+% ======================================================================
+\subsection{Internal Scheduling - In Depth}
+% ======================================================================
+% ======================================================================
+A larger example is presented to show complex issues for bulk acquire and its implementation options are analyzed.
+Figure~\ref{f:int-bulk-cfa} shows an example where bulk acquire adds a significant layer of complexity to the internal signalling semantics, and listing \ref{f:int-bulk-cfa} shows the corresponding \CFA code to implement the cfa-code in listing \ref{f:int-bulk-cfa}.
+For the purpose of translating the given cfa-code into \CFA-code, any method of introducing a monitor is acceptable, \eg @mutex@ parameters, global variables, pointer parameters, or using locals with the @mutex@ statement.
+\begin{figure}
+\begin{multicols}{2}
+Waiting thread
+\begin{cfa}[numbers=left]
+acquire A
+        // Code Section 1
+        acquire A & B
+                // Code Section 2
+                wait A & B
+                // Code Section 3
+        release A & B
+        // Code Section 4
+release A
+\end{cfa}
+\columnbreak
+Signalling thread
+\begin{cfa}[numbers=left, firstnumber=10,escapechar=|]
+acquire A
+        // Code Section 5
+        acquire A & B
+                // Code Section 6
+                |\label{line:signal1}|signal A & B
+                // Code Section 7
+        |\label{line:releaseFirst}|release A & B
+        // Code Section 8
+|\label{line:lastRelease}|release A
+\end{cfa}
+\end{multicols}
+\begin{cfa}[caption={Internal scheduling with bulk acquire},label={f:int-bulk-cfa}]
+\end{cfa}
+\begin{center}
+\begin{cfa}[xleftmargin=.4\textwidth]
+monitor A a;
+monitor B b;
+condition c;
+\end{cfa}
+\end{center}
+\begin{multicols}{2}
+Waiting thread
+\begin{cfa}
+mutex(a) {
+        // Code Section 1
+        mutex(a, b) {
+                // Code Section 2
+                wait(c);
+                // Code Section 3
+        }
+        // Code Section 4
+}
+\end{cfa}
+\columnbreak
+Signalling thread
+\begin{cfa}
+mutex(a) {
+        // Code Section 5
+        mutex(a, b) {
+                // Code Section 6
+                signal(c);
+                // Code Section 7
+        }
+        // Code Section 8
+}
+\end{cfa}
+\end{multicols}
+\begin{cfa}[caption={Equivalent \CFA code for listing \ref{f:int-bulk-cfa}},label={f:int-bulk-cfa}]
+\end{cfa}
+\begin{multicols}{2}
+Waiter
+\begin{cfa}[numbers=left]
+acquire A
+        acquire A & B
+                wait A & B
+        release A & B
+release A
+\end{cfa}
+\columnbreak
+Signaller
+\begin{cfa}[numbers=left, firstnumber=6,escapechar=|]
+acquire A
+        acquire A & B
+                signal A & B
+        release A & B
+        |\label{line:secret}|// Secretly keep B here
+release A
+// Wakeup waiter and transfer A & B
+\end{cfa}
+\end{multicols}
+\begin{cfa}[caption={Figure~\ref{f:int-bulk-cfa}, with delayed signalling comments},label={f:int-secret}]
+\end{cfa}
+        mutex( m1, m2 ) {
+                ... `signal( c )`; ...
+                // m1, m2 acquired
+        } // $\LstCommentStyle{\color{red}release m2}$
+        // m1 acquired
+} // release m1
+\end{cfa}
+\end{lrbox}
+\newbox\myboxC
+\begin{lrbox}{\myboxC}
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
+mutex( m1 ) {
+        ... `wait( c )`; ...
+        // m1 acquired
+} // $\LstCommentStyle{\color{red}release m1}$
+\end{cfa}
+\end{lrbox}
+\begin{cquote}
+\subfloat[Waiting Thread]{\label{f:WaitingThread}\usebox\myboxA}
+\hspace{2\parindentlnth}
+\subfloat[Signalling Thread]{\label{f:SignallingThread}\usebox\myboxB}
+\hspace{2\parindentlnth}
+\subfloat[Other Waiting Thread]{\label{f:SignallingThread}\usebox\myboxC}
+\end{cquote}
+\caption{Barging Prevention}
+\label{f:BargingPrevention}
 \end{figure}
-The complexity begins at code sections 4 and 8 in listing \ref{f:int-bulk-cfa}, which are where the existing semantics of internal scheduling needs to be extended for multiple monitors.
-The root of the problem is that bulk acquire is used in a context where one of the monitors is already acquired, which is why it is important to define the behaviour of the previous cfa-code.
-When the signaller thread reaches the location where it should ``release @A & B@'' (listing \ref{f:int-bulk-cfa} line \ref{line:releaseFirst}), it must actually transfer ownership of monitor @B@ to the waiting thread.
-This ownership transfer is required in order to prevent barging into @B@ by another thread, since both the signalling and signalled threads still need monitor @A@.
-There are three options:
-\subsubsection{Delaying Signals}
 The obvious solution to the problem of multi-monitor scheduling is to keep ownership of all locks until the last lock is ready to be transferred.
 It can be argued that that moment is when the last lock is no longer needed, because this semantics fits most closely to the behaviour of single-monitor scheduling.
 …
 Depending on the order of signals (listing \ref{f:dependency} line \ref{line:signal-ab} and \ref{line:signal-a}) two cases can happen:
+\begin{comment}
 \paragraph{Case 1: thread $\alpha$ goes first.} In this case, the problem is that monitor @A@ needs to be passed to thread $\beta$ when thread $\alpha$ is done with it.
 \paragraph{Case 2: thread $\beta$ goes first.} In this case, the problem is that monitor @B@ needs to be retained and passed to thread $\alpha$ along with monitor @A@, which can be done directly or possibly using thread $\beta$ as an intermediate.
 …
 In both cases, the threads need to be able to distinguish, on a per monitor basis, which ones need to be released and which ones need to be transferred, which means knowing when to release a group becomes complex and inefficient (see next section) and therefore effectively precludes this approach.
 \subsubsection{Dependency graphs}
 \begin{figure}
 …
 \subsubsection{Partial Signalling} \label{partial-sig}
+\end{comment}
 Finally, the solution that is chosen for \CFA is to use partial signalling.
 Again using listing \ref{f:int-bulk-cfa}, the partial signalling solution transfers ownership of monitor @B@ at lines \ref{line:signal1} to the waiter but does not wake the waiting thread since it is still using monitor @A@.
 …
 \end{itemize}
+% ======================================================================
+% ======================================================================
 \subsection{Signalling: Now or Later}
+% ======================================================================
+% ======================================================================
+\begin{table}
+\begin{tabular}{|c|c|}
+@signal@ & @signal_block@ \\
+\hline
+\begin{cfa}[tabsize=3]
+monitor DatingService {
+        // compatibility codes
+        enum{ CCodes = 20 };
+        int girlPhoneNo
+        int boyPhoneNo;
+\begin{figure}
+\centering
+\newbox\myboxA
+\begin{lrbox}{\myboxA}
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
+enum { CCodes = 20 };
+monitor DS {
+        int GirlPhNo, BoyPhNo;
+        condition Girls[CCodes], Boys[CCodes];
+        condition exchange;
 };
+condition girls[CCodes];
+condition boys [CCodes];
+condition exchange;
+int girl(int phoneNo, int cfa) {
+        // no compatible boy ?
+        if(empty(boys[cfa])) {
+                wait(girls[cfa]);               // wait for boy
+                girlPhoneNo = phoneNo;          // make phone number available
+                signal(exchange);               // wake boy from chair
+int girl( DS & mutex ds, int phNo, int ccode ) {
+        if ( is_empty( Boys[ccode] ) ) {
+                wait( Girls[ccode] );
+                GirlPhNo = phNo;
+                exchange.signal();
         } else {
+                girlPhoneNo = phoneNo;          // make phone number available
+                signal(boys[cfa]);              // wake boy
+                wait(exchange);         // sit in chair
+        }
+        return boyPhoneNo;
+}
+int boy(int phoneNo, int cfa) {
+        // same as above
+        // with boy/girl interchanged
+}
+\end{cfa}&\begin{cfa}[tabsize=3]
+monitor DatingService {
+        enum{ CCodes = 20 };    // compatibility codes
+        int girlPhoneNo;
+        int boyPhoneNo;
+                GirlPhNo = phNo;
+                signal( Boys[ccode] );
+                exchange.wait();
+        } // if
+        return BoyPhNo;
+}
+int boy( DS & mutex ds, int phNo, int ccode ) {
+        // as above with boy/girl interchanged
+}
+\end{cfa}
+\end{lrbox}
+\newbox\myboxB
+\begin{lrbox}{\myboxB}
+\begin{cfa}[aboveskip=0pt,belowskip=0pt]
+monitor DS {
+        int GirlPhNo, BoyPhNo;
+        condition Girls[CCodes], Boys[CCodes];
 };
+condition girls[CCodes];
+condition boys [CCodes];
+// exchange is not needed
+int girl(int phoneNo, int cfa) {
+        // no compatible boy ?
+        if(empty(boys[cfa])) {
+                wait(girls[cfa]);               // wait for boy
+                girlPhoneNo = phoneNo;          // make phone number available
+                signal(exchange);               // wake boy from chair
+int girl( DS & mutex ds, int phNo, int ccode ) {
+        if ( is_empty( Boys[ccode] ) ) { // no compatible
+                wait( Girls[ccode] ); // wait for boy
+                GirlPhNo = phNo; // make phone number available
         } else {
+                girlPhoneNo = phoneNo;          // make phone number available
+                signal_block(boys[cfa]);                // wake boy
+                // second handshake unnecessary
+        }
+        return boyPhoneNo;
+}
+int boy(int phoneNo, int cfa) {
+        // same as above
+        // with boy/girl interchanged
+}
+\end{cfa}
+\end{tabular}
+\caption{Dating service example using \protect\lstinline|signal| and \protect\lstinline|signal_block|. }
+\label{tbl:datingservice}
+\end{table}
+                GirlPhNo = phNo; // make phone number available
+                signal_block( Boys[ccode] ); // restart boy
+        } // if
+        return BoyPhNo;
+}
+int boy( DS & mutex ds, int phNo, int ccode ) {
+        // as above with boy/girl interchanged
+}
+\end{cfa}
+\end{lrbox}
+\subfloat[\lstinline@signal@]{\label{f:DatingSignal}\usebox\myboxA}
+\qquad
+\subfloat[\lstinline@signal_block@]{\label{f:DatingSignalBlock}\usebox\myboxB}
+\caption{Dating service. }
+\label{f:Dating service}
+\end{figure}
 An important note is that, until now, signalling a monitor was a delayed operation.
 The ownership of the monitor is transferred only when the monitor would have otherwise been released, not at the point of the @signal@ statement.
 …
 % ======================================================================
 An alternative to internal scheduling is external scheduling (see Table~\ref{tbl:sched}).
+\begin{comment}
 \begin{table}
 \begin{tabular}{|c|c|c|}
 …
 \label{tbl:sched}
 \end{table}
+\end{comment}
 This method is more constrained and explicit, which helps users reduce the non-deterministic nature of concurrency.
 Indeed, as the following examples demonstrate, external scheduling allows users to wait for events from other threads without the concern of unrelated events occurring.

src/Common/SemanticError.cc

-                      rb4e1876
+                      r7951100
 // Created On       : Mon May 18 07:44:20 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed May 16 15:01:20 2018
 // Update Count     : 9
+// Last Modified On : Thu Jun  7 08:05:26 2018
+// Update Count     : 10
 //
 …
 void SemanticError( CodeLocation location, std::string error ) {
         SemanticErrorThrow = true;
         throw SemanticErrorException(location, error);
+        throw SemanticErrorException( location, error );
+}

src/Parser/DeclarationNode.cc

-                      rb4e1876
+                      r7951100
 // Created On       : Sat May 16 12:34:05 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed Jun  6 15:57:50 2018
 // Update Count     : 1076
+// Last Modified On : Thu Jun  7 12:08:55 2018
+// Update Count     : 1079
 //
 …
                                         type->aggregate.params->appendList( q->type->forall ); // augment forall qualifier
                                 } else {                                                                // not polymorphic
+                                        type->aggregate.params = q->type->forall; // make polymorphic type
+                                        // change implicit typedef from TYPEDEFname to TYPEGENname
+                                        typedefTable.changeKind( *type->aggregate.name, TYPEGENname );
+                                        type->aggregate.params = q->type->forall; // set forall qualifier
                                 } // if
                         } else {                                                                        // not polymorphic

src/Parser/TypedefTable.cc

-                      rb4e1876
+                      r7951100
 // Created On       : Sat May 16 15:20:13 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Fri Jun  1 16:54:18 2018
 // Update Count     : 155
+// Last Modified On : Thu Jun  7 13:17:56 2018
+// Update Count     : 192
 //
 …
 #include "TypedefTable.h"
 #include <cassert>                                                                              // for assert
+#include <iostream>
 #if 0
-#include <iostream>
 #define debugPrint( code ) code
 #else
 …
 using namespace std;                                                                    // string, iostream
+debugPrint(
+static const char *kindName( int kind ) {
+        switch ( kind ) {
+          case IDENTIFIER: return "identifier";
+          case TYPEDEFname: return "typedef";
+          case TYPEGENname: return "typegen";
+          default:
+                cerr << "Error: cfa-cpp internal error, invalid kind of identifier" << endl;
+                abort();
+        } // switch
+} // kindName
+)
 TypedefTable::~TypedefTable() {
         if ( ! SemanticErrorThrow && kindTable.currentScope() != 0 ) {
+                std::cerr << "scope failure " << kindTable.currentScope() << endl;
+                cerr << "Error: cfa-cpp internal error, scope failure " << kindTable.currentScope() << endl;
+                abort();
         } // if
 } // TypedefTable::~TypedefTable
 …
 } // TypedefTable::isKind
-void TypedefTable::changeKind( const string & identifier, int kind ) {
-        KindTable::iterator posn = kindTable.find( identifier );
-        if ( posn != kindTable.end() ) posn->second = kind;     // exists => update
-} // TypedefTable::changeKind
 // SKULLDUGGERY: Generate a typedef for the aggregate name so the aggregate does not have to be qualified by
 // "struct". Only generate the typedef, if the name is not in use. The typedef is implicitly (silently) removed if the
 // name is explicitly used.
+void TypedefTable::makeTypedef( const string & name ) {
+void TypedefTable::makeTypedef( const string & name, int kind ) {
+//    Check for existence is necessary to handle:
+//        struct Fred {};
+//        void Fred();
+//        void fred() {
+//           struct Fred act; // do not add as type in this scope
+//           Fred();
+//        }
         if ( ! typedefTable.exists( name ) ) {
                 typedefTable.addToEnclosingScope( name, TYPEDEFname, "MTD" );
+                typedefTable.addToEnclosingScope( name, kind, "MTD" );
         } // if
 } // TypedefTable::makeTypedef
 void TypedefTable::addToScope( const std::string & identifier, int kind, const char * locn __attribute__((unused)) ) {
+void TypedefTable::addToScope( const string & identifier, int kind, const char * locn __attribute__((unused)) ) {
         auto scope = kindTable.currentScope();
         debugPrint( cerr << "Adding at " << locn << " " << identifier << " as kind " << kind << " scope " << scope << endl );
+        debugPrint( cerr << "Adding current at " << locn << " " << identifier << " as " << kindName( kind ) << " scope " << scope << endl );
         auto ret = kindTable.insertAt( scope, identifier, kind );
         if ( ! ret.second ) ret.first->second = kind;           // exists => update
 } // TypedefTable::addToScope
 void TypedefTable::addToEnclosingScope( const std::string & identifier, int kind, const char * locn __attribute__((unused)) ) {
+void TypedefTable::addToEnclosingScope( const string & identifier, int kind, const char * locn __attribute__((unused)) ) {
         assert( kindTable.currentScope() >= 1 );
         auto scope = kindTable.currentScope() - 1;
         debugPrint( cerr << "Adding+1 at " << locn << " " << identifier << " as kind " << kind << " scope " << scope << endl );
+        debugPrint( cerr << "Adding enclosing at " << locn << " " << identifier << " as " << kindName( kind ) << " scope " << scope << endl );
         auto ret = kindTable.insertAt( scope, identifier, kind );
         if ( ! ret.second ) ret.first->second = kind;           // exists => update
 …
                         debugPrint( cerr << endl << "[" << scope << "]" );
                 } // while
                 debugPrint( cerr << " " << (*i).first << ":" << (*i).second );
+                debugPrint( cerr << " " << (*i).first << ":" << kindName( (*i).second ) );
         } // for
         while ( scope > 0 ) {

src/Parser/TypedefTable.h

-                      rb4e1876
+                      r7951100
 // Created On       : Sat May 16 15:24:36 2015
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Thu May 31 23:23:47 2018
 // Update Count     : 83
+// Last Modified On : Thu Jun  7 12:10:17 2018
+// Update Count     : 85
 //
 …
         bool exists( const std::string & identifier );
         int isKind( const std::string & identifier ) const;
+        void changeKind( const std::string & identifier, int kind );
+        void makeTypedef( const std::string & name );
+        void makeTypedef( const std::string & name, int kind = TYPEDEFname );
         void addToScope( const std::string & identifier, int kind, const char * );
         void addToEnclosingScope( const std::string & identifier, int kind, const char * );

src/Parser/lex.ll

-                      rb4e1876
+                      r7951100
  * Created On       : Sat Sep 22 08:58:10 2001
  * Last Modified By : Peter A. Buhr
  * Last Modified On : Wed Jun  6 17:31:09 2018
  * Update Count     : 677
+ * Last Modified On : Thu Jun  7 08:27:40 2018
+ * Update Count     : 679
  */
 …
 %%
 // ----end of lexer----
 void yyerror( const char * errmsg ) {
+        SemanticErrorThrow = true;
         cout << (yyfilename ? yyfilename : "*unknown file*") << ':' << yylineno << ':' << column - yyleng + 1
                  << ": " << ErrorHelpers::error_str() << errmsg << " at token \"" << (yytext[0] == '\0' ? "EOF" : yytext) << '"' << endl;

src/Parser/parser.yy

-                      rb4e1876
+                      r7951100
 // Created On       : Sat Sep  1 20:22:55 2001
 // Last Modified By : Peter A. Buhr
 // Last Modified On : Wed Jun  6 14:53:38 2018
 // Update Count     : 3522
+// Last Modified On : Thu Jun  7 10:07:12 2018
+// Update Count     : 3527
 //
 …
         | aggregate_key attribute_list_opt no_attr_identifier
+                {
                         typedefTable.makeTypedef( *$3 );                        // create typedef
                         if ( forall ) typedefTable.changeKind( *$3, TYPEGENname ); // possibly update
+                        typedefTable.makeTypedef( *$3, forall ? TYPEGENname : TYPEDEFname ); // create typedef
+                        //if ( forall ) typedefTable.changeKind( *$3, TYPEGENname ); // possibly update
                         forall = false;                                                         // reset
+                }
 …
         | aggregate_key attribute_list_opt type_name
+                {
                         typedefTable.makeTypedef( *$3->type->symbolic.name ); // create typedef
                         if ( forall ) typedefTable.changeKind( *$3->type->symbolic.name, TYPEGENname ); // possibly update
+                        typedefTable.makeTypedef( *$3->type->symbolic.name, forall ? TYPEGENname : TYPEDEFname ); // create typedef
+                        //if ( forall ) typedefTable.changeKind( *$3->type->symbolic.name, TYPEGENname ); // possibly update
                         forall = false;                                                         // reset
+                }
 …
         aggregate_key attribute_list_opt no_attr_identifier
+                {
                         typedefTable.makeTypedef( *$3 );
                         if ( forall ) typedefTable.changeKind( *$3, TYPEGENname ); // possibly update
+                        typedefTable.makeTypedef( *$3, forall ? TYPEGENname : TYPEDEFname );
+                        //if ( forall ) typedefTable.changeKind( *$3, TYPEGENname ); // possibly update
                         forall = false;                                                         // reset
                         $$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
 …
 %%
 // ----end of grammar----

src/libcfa/bits/locks.h

-                      rb4e1876
+                      r7951100
 #include "bits/debug.h"
 #include "bits/defs.h"
+#include <assert.h>
+#ifdef __cforall
+        extern "C" {
+                #include <pthread.h>
+        }
+#endif
 // pause to prevent excess processor bus usage
 …
                 __atomic_clear( &this.lock, __ATOMIC_RELEASE );
+        }
+        #ifdef __CFA_WITH_VERIFY__
+                extern bool __cfaabi_dbg_in_kernel();
+        #endif
+        struct __bin_sem_t {
+                int_fast8_t     counter;
+                pthread_mutex_t lock;
+                pthread_cond_t  cond;
+        };
+        static inline void ?{}(__bin_sem_t & this) with( this ) {
+                counter = 0;
+                pthread_mutex_init(&lock, NULL);
+                pthread_cond_init (&cond, NULL);
+        }
+        static inline void ^?{}(__bin_sem_t & this) with( this ) {
+                pthread_mutex_destroy(&lock);
+                pthread_cond_destroy (&cond);
+        }
+        static inline void wait(__bin_sem_t & this) with( this ) {
+                verify(__cfaabi_dbg_in_kernel());
+                pthread_mutex_lock(&lock);
+                if(counter != 0) {   // this must be a loop, not if!
+                        pthread_cond_wait(&cond, &lock);
+                }
+                counter = 1;
+                pthread_mutex_unlock(&lock);
+        }
+        static inline void post(__bin_sem_t & this) with( this ) {
+                verify(__cfaabi_dbg_in_kernel());
+                pthread_mutex_lock(&lock);
+                bool needs_signal = counter == 0;
+                counter = 1;
+                pthread_mutex_unlock(&lock);
+                if (!needs_signal)
+                        pthread_cond_signal(&cond);
+                }
 #endif

src/libcfa/concurrency/kernel

-                      rb4e1876
+                      r7951100
         // Idle lock
         sem_t idleLock;
+        // __bin_sem_t idleLock;
         // Link lists fields
         struct {
+        struct __dbg_node_proc {
                 struct processor * next;
                 struct processor * prev;
 …
         // Link lists fields
         struct {
+        struct __dbg_node_cltr {
                 cluster * next;
                 cluster * prev;

src/libcfa/concurrency/kernel.c

-                      rb4e1876
+                      r7951100
 #include <stddef.h>
 #include <errno.h>
+#include <string.h>
 extern "C" {
 #include <stdio.h>
 …
 thread_desc * mainThread;
+struct { __dllist_t(cluster) list; __spinlock_t lock; } global_clusters;
+extern "C" {
+struct { __dllist_t(cluster) list; __spinlock_t lock; } __cfa_dbg_global_clusters;
+}
 //-----------------------------------------------------------------------------
 …
 void ^?{}(processor & this) with( this ){
         if( ! do_terminate ) {
+        if( ! __atomic_load_n(&do_terminate, __ATOMIC_ACQUIRE) ) {
                 __cfaabi_dbg_print_safe("Kernel : core %p signaling termination\n", &this);
                 terminate(&this);
                 verify(this.do_terminate);
+                verify( __atomic_load_n(&do_terminate, __ATOMIC_SEQ_CST) );
                 verify( kernelTLS.this_processor != &this);
                 P( terminated );
 …
                 thread_desc * readyThread = NULL;
                 for( unsigned int spin_count = 0; ! this->do_terminate; spin_count++ )
+                for( unsigned int spin_count = 0; ! __atomic_load_n(&this->do_terminate, __ATOMIC_SEQ_CST); spin_count++ )
+                {
                         readyThread = nextThread( this->cltr );
 …
                         else
+                        {
+                                spin(this, &spin_count);
+                                // spin(this, &spin_count);
+                                halt(this);
+                        }
+                }
 …
         __cfaabi_dbg_print_safe("Kernel : Starting\n");
         global_clusters.list{ __get };
         global_clusters.lock{};
+        __cfa_dbg_global_clusters.list{ __get };
+        __cfa_dbg_global_clusters.lock{};
         // Initialize the main cluster
 …
         // When its coroutine terminates, it return control to the mainThread
         // which is currently here
         mainProcessor->do_terminate = true;
+        __atomic_store_n(&mainProcessor->do_terminate, true, __ATOMIC_RELEASE);
         returnToKernel();
+        mainThread->self_cor.state = Halted;
         // THE SYSTEM IS NOW COMPLETELY STOPPED
 …
         ^(mainThread){};
         ^(global_clusters.list){};
         ^(global_clusters.lock){};
+        ^(__cfa_dbg_global_clusters.list){};
+        ^(__cfa_dbg_global_clusters.lock){};
         __cfaabi_dbg_print_safe("Kernel : Shutdown complete\n");
 …
 void halt(processor * this) with( *this ) {
+        verify( ! __atomic_load_n(&do_terminate, __ATOMIC_SEQ_CST) );
         with( *cltr ) {
                 lock      (proc_list_lock __cfaabi_dbg_ctx2);
 …
         __cfaabi_dbg_print_safe("Kernel : Processor %p ready to sleep\n", this);
+        verify( ({int sval = 0; sem_getvalue(&this->idleLock, &sval); sval; }) < 200);
+        // #ifdef __CFA_WITH_VERIFY__
+        //      int sval = 0;
+        //      sem_getvalue(&this->idleLock, &sval);
+        //      verifyf(sval < 200, "Binary semaphore reached value %d : \n", sval);
+        // #endif
+        verify( ! __atomic_load_n(&do_terminate, __ATOMIC_SEQ_CST) );
         int __attribute__((unused)) ret = sem_wait(&idleLock);
+        verify(ret > 0 || errno == EINTR);
+        // verifyf(ret >= 0 || errno == EINTR, "Sem_wait returned %d (errno %d : %s\n", ret, errno, strerror(errno));
+        // wait( idleLock );
         __cfaabi_dbg_print_safe("Kernel : Processor %p woke up and ready to run\n", this);
 …
         __cfaabi_dbg_print_safe("Kernel : Waking up processor %p\n", this);
         int __attribute__((unused)) ret = sem_post(&this->idleLock);
+        verify(ret > 0 || errno == EINTR);
+        verify( ({int sval = 0; sem_getvalue(&this->idleLock, &sval); sval; }) < 200);
+        // verifyf(ret >= 0 || errno == EINTR, "Sem_post returned %d (errno %d : %s\n", ret, errno, strerror(errno));
+        // #ifdef __CFA_WITH_VERIFY__
+        //      int sval = 0;
+        //      sem_getvalue(&this->idleLock, &sval);
+        //      verifyf(sval < 200, "Binary semaphore reached value %d\n", sval);
+        // #endif
+        // post( this->idleLock );
+}
 …
 // Global Queues
 void doregister( cluster     & cltr ) {
         lock      ( global_clusters.lock __cfaabi_dbg_ctx2);
         push_front( global_clusters.list, cltr );
         unlock    ( global_clusters.lock );
+        lock      ( __cfa_dbg_global_clusters.lock __cfaabi_dbg_ctx2);
+        push_front( __cfa_dbg_global_clusters.list, cltr );
+        unlock    ( __cfa_dbg_global_clusters.lock );
+}
 void unregister( cluster     & cltr ) {
         lock  ( global_clusters.lock __cfaabi_dbg_ctx2);
         remove( global_clusters.list, cltr );
         unlock( global_clusters.lock );
+        lock  ( __cfa_dbg_global_clusters.lock __cfaabi_dbg_ctx2);
+        remove( __cfa_dbg_global_clusters.list, cltr );
+        unlock( __cfa_dbg_global_clusters.lock );
+}

src/libcfa/concurrency/preemption.c

-                      rb4e1876
+                      r7951100
 // kill wrapper : signal a processor
 void terminate(processor * this) {
+        this->do_terminate = true;
+        wake(this);
+        disable_interrupts();
+        __atomic_store_n(&this->do_terminate, true, __ATOMIC_SEQ_CST);
+        wake( this );
         sigval_t value = { PREEMPT_TERMINATE };
+        enable_interrupts( __cfaabi_dbg_ctx );
         pthread_sigqueue( this->kernel_thread, SIGUSR1, value );
+}
 …
         choose(sfp->si_value.sival_int) {
                 case PREEMPT_NORMAL   : ;// Normal case, nothing to do here
                 case PREEMPT_TERMINATE: verify( kernelTLS.this_processor->do_terminate);
+                case PREEMPT_TERMINATE: verify( __atomic_load_n( &kernelTLS.this_processor->do_terminate, __ATOMIC_SEQ_CST ) );
                 default:
                         abort( "internal error, signal value is %d", sfp->si_value.sival_int );
 …
+}
+#ifdef __CFA_WITH_VERIFY__
+bool __cfaabi_dbg_in_kernel() {
+        return !kernelTLS.preemption_state.enabled;
+}
+#endif
 // Local Variables: //
 // mode: c //

src/libcfa/stdhdr/assert.h

rb4e1876	r7951100
33	33	#define verify(x) assert(x)
34	34	#define verifyf(x, ...) assertf(x, __VA_ARGS__)
	35	#define __CFA_WITH_VERIFY__
35	36	#else
36	37	#define verify(x)

src/prelude/sync-builtins.cf

-                      rb4e1876
+                      r7951100
 #endif
+_Bool __atomic_load_n(const volatile _Bool *, int);
+void __atomic_load(const volatile _Bool *, volatile _Bool *, int);
 char __atomic_load_n(const volatile char *, int);
 char __atomic_load_1(const volatile char *, int);
 …
 void __atomic_store_n(volatile _Bool *, _Bool, int);
-void __atomic_store_1(volatile _Bool *, _Bool, int);
 void __atomic_store(volatile _Bool *, _Bool *, int);
 void __atomic_store_n(volatile char *, char, int);

src/tests/preempt_longrun/processor.c

-                      rb4e1876
+                      r7951100
 #include <thread>
 #include <time>
+#include <unistd.h>
 #ifndef PREEMPTION_RATE
 …
 int main(int argc, char* argv[]) {
         processor * p[15];
+        write(STDERR_FILENO, "Preparing\n", sizeof("Preparing\n"));
         for ( int pi = 0; pi < 15; pi++ ) {
                 p[pi] = new();
+        }
+        write(STDERR_FILENO, "Starting\n", sizeof("Starting\n"));
         for ( int i = 0; i < N; i++) {
                 int pi = i % 15;
 …
                 p[pi] = new();
+        }
+        write(STDERR_FILENO, "Stopping\n", sizeof("Stopping\n"));
         for ( int pi = 0; pi < 15; pi++ ) {
                 delete( p[pi] );
+        }
+        write(STDERR_FILENO, "Done\n", sizeof("Done\n"));
+}

Context Navigation

Legend:

doc/papers/concurrency/Paper.tex

src/Common/SemanticError.cc

src/Parser/DeclarationNode.cc

src/Parser/TypedefTable.cc

src/Parser/TypedefTable.h

src/Parser/lex.ll

src/Parser/parser.yy

src/libcfa/bits/locks.h

src/libcfa/concurrency/kernel

src/libcfa/concurrency/kernel.c

src/libcfa/concurrency/preemption.c

src/libcfa/stdhdr/assert.h

src/prelude/sync-builtins.cf

src/tests/preempt_longrun/processor.c

Download in other formats: