aboutsummaryrefslogtreecommitdiff
path: root/book
diff options
context:
space:
mode:
authorPer Lindgren <per.lindgren@ltu.se>2020-11-12 19:06:56 +0100
committerPer Lindgren <per.lindgren@ltu.se>2020-11-12 19:06:56 +0100
commit15bd12916140c99d3d740e7c7fe092a5b0d5f33d (patch)
treeb1744393366d7a890f59a75a447d81949617a394 /book
parent0cb7cb0ba81d2918ebc8c9d36f8ccc447b365889 (diff)
resources fix
Diffstat (limited to 'book')
-rw-r--r--book/en/src/by-example/resources.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/book/en/src/by-example/resources.md b/book/en/src/by-example/resources.md
index 8bfa922..91d143e 100644
--- a/book/en/src/by-example/resources.md
+++ b/book/en/src/by-example/resources.md
@@ -47,12 +47,12 @@ The only method on this trait, [`lock`], runs its closure argument in a critical
[`lock`]: ../../../api/rtic/trait.Mutex.html#method.lock
The critical section created by the `lock` API is based on dynamic priorities: it temporarily raises the dynamic priority of the context to a *ceiling* priority that prevents other tasks from preempting the critical section. This synchronization protocol is known as the [Immediate Ceiling Priority Protocol
-(ICPP)][icpp], and complies with [Stack Resource Policy(SRP)](srp) based scheduling of RTIC.
+(ICPP)][icpp], and complies with [Stack Resource Policy(SRP)][srp] based scheduling of RTIC.
[icpp]: https://en.wikipedia.org/wiki/Priority_ceiling_protocol
[srp]: https://en.wikipedia.org/wiki/Stack_Resource_Policy
-In the ex ample below we have three interrupt handlers with priorities ranging from one to three. The two handlers with the lower priorities contend for the `shared` resource and need to lock the resource for accessing the data. The highest priority handler, which do nat access the `shared` resource, is free to preempt the critical section created by the
+In the example below we have three interrupt handlers with priorities ranging from one to three. The two handlers with the lower priorities contend for the `shared` resource and need to lock the resource for accessing the data. The highest priority handler, which do nat access the `shared` resource, is free to preempt the critical section created by the
lowest priority handler.
``` rust