Changeset e02e13f for doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex

Timestamp:

Apr 4, 2023, 10:12:57 PM (15 months ago)

Author:

Mike Brooks <mlbrooks@…>

Branches:

ADT, ast-experimental, master

Children:

9bb8ee42

Parents:

ff71057 (diff), bb7422a (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex (modified) (7 diffs)

doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex

@@ -12 +12 @@
 Additionally, it provides the safety guarantee of deadlock-freedom, both by acquiring the locks in a deadlock-free manner, and by ensuring that the locks release on error, or normal program execution via \gls{raii}.
 
-\begin{cfacode}[tabsize=3,caption={\CFA mutex statement usage},label={l:cfa_mutex_ex}]
+\begin{cfa}[tabsize=3,caption={\CFA mutex statement usage},label={l:cfa_mutex_ex}]
 owner_lock lock1, lock2, lock3;
 int count = 0; 
@@ -20 +20 @@
 }
 mutex( lock2, lock3 ) count++; // or inline statement
-\end{cfacode}
+\end{cfa}
 
 \section{Other Languages}
@@ -32 +32 @@
 An example of \CC scoped\_lock usage is shown in Listing~\ref{l:cc_scoped_lock}.
 
-\begin{cppcode}[tabsize=3,caption={\CC scoped\_lock usage},label={l:cc_scoped_lock}]
+\begin{cfa}[tabsize=3,caption={\CC scoped\_lock usage},label={l:cc_scoped_lock}]
 std::mutex lock1, lock2, lock3;
 {
@@ -38 +38 @@
     // locks are released via raii at end of scope
 }
-\end{cppcode}
+\end{cfa}
 
 \section{\CFA implementation}
@@ -58 +58 @@
 This use case is shown in Listing~\ref{l:sout}.
 
-\begin{cfacode}[tabsize=3,caption={\CFA sout with mutex statement},label={l:sout}]
+\begin{cfa}[tabsize=3,caption={\CFA sout with mutex statement},label={l:sout}]
 mutex( sout )
     sout | "This output is protected by mutual exclusion!"; 
-\end{cfacode}
+\end{cfa}
 
 \section{Deadlock Avoidance}
@@ -70 +70 @@
 The algorithm presented is taken directly from the source code of the \code{<mutex>} header, with some renaming and comments for clarity.
 
-\begin{cppcode}[caption={\CC scoped\_lock deadlock avoidance algorithm},label={l:cc_deadlock_avoid}]
+\begin{cfa}[caption={\CC scoped\_lock deadlock avoidance algorithm},label={l:cc_deadlock_avoid}]
 int first = 0;  // first lock to attempt to lock
 do {
@@ -86 +86 @@
 // if first lock is still held then all have been acquired
 } while (!locks[first].owns_lock());  // is first lock held?
-\end{cppcode}
+\end{cfa}
 
 The algorithm in \ref{l:cc_deadlock_avoid} successfully avoids deadlock, however there is a potential livelock scenario.