Skip to content

Commit a99015d

Browse files
committed
Apply suggestions from code review
1 parent 219edd6 commit a99015d

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

content/courses/ada-in-practice/chapters/silent_task_termination.rst

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -183,7 +183,7 @@ The second scenario involves execution within the task's actual sequence of
183183
statements. Therefore it does apply to the caveat above. Here's why.
184184

185185
When called, the execution of a given subprogram requires a representation in
186-
storage, often known as a "frame." Because subprogram calls and their returns
186+
storage, often known as a *frame*. Because subprogram calls and their returns
187187
can be seen as a series of stack pushes and pops, the representation for
188188
execution is typically via a stack of these frames. Calls cause stack frame
189189
pushes, creating new frames on the stack, and returns cause stack pops,
@@ -568,7 +568,7 @@ ramifications momentarily. Here are the bodies for the two handlers:
568568
end Obituary;
569569

570570
Now, about those calls to :ada:`Ada.Text_IO.Put_Line`. Procedure
571-
:ada:`Put_Line` is a "potentially blocking" operation. Consequently, a call
571+
:ada:`Put_Line` is a *potentially blocking* operation. Consequently, a call
572572
within a protected operation is a bounded error (see RM 9.5.1(8)) and the
573573
resulting execution is not portable. For example, the :ada:`Put_Line` calls
574574
will likely work as expected on a native OS. However, their execution may do

0 commit comments

Comments
 (0)