aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGravatar Per Lindgren <per.lindgren@ltu.se> 2019-09-28 21:48:03 +0200
committerGravatar Per Lindgren <per.lindgren@ltu.se> 2019-09-28 21:48:03 +0200
commit98c44c154c872e24fdbf272d0bc89ba569ae5a47 (patch)
tree109e105c6591d5120d33629299b235a5a62309a0
parentcb7486ed4f93a10dd7efd74ff79d2df1cb954f1d (diff)
downloadrtic-98c44c154c872e24fdbf272d0bc89ba569ae5a47.tar.gz
rtic-98c44c154c872e24fdbf272d0bc89ba569ae5a47.tar.zst
rtic-98c44c154c872e24fdbf272d0bc89ba569ae5a47.zip
Lock Optimization RFC (Notes updated)
-rw-r--r--Notes.md1
1 files changed, 0 insertions, 1 deletions
diff --git a/Notes.md b/Notes.md
index aadd475e..1ee64c25 100644
--- a/Notes.md
+++ b/Notes.md
@@ -140,7 +140,6 @@ Basically we create `Priority` (on stack) and use that to create a `Context`. Th
Overall, using this approach, we don't need a trampoline (`run`). We reduce the overhead by at least two machine instructions (additional reading/writing of BASEPRI) for each interrupt. It also reduces the register pressure (as less information needs to be stored).
-
## Evaluation
The `examples/lockopt.rs` shows that locks are effectively optimized out.