about summary refs log tree commit diff stats
path: root/062scheduler.cc
diff options
context:
space:
mode:
authorKartik K. Agaram <vc@akkartik.com>2016-01-19 23:18:03 -0800
committerKartik K. Agaram <vc@akkartik.com>2016-01-19 23:18:03 -0800
commit455fbac64f101b05f7eaca89b84470569e4df3fd (patch)
tree32cfd5b092ad86086e4d15992bb10fd06a12bf13 /062scheduler.cc
parent7163e18a774781c62f0c0542e4cb9037f6a71d22 (diff)
downloadmu-455fbac64f101b05f7eaca89b84470569e4df3fd.tar.gz
2576 - distinguish allocated addresses from others
This is the one major refinement on the C programming model I'm planning
to introduce in mu. Instead of Rust's menagerie of pointer types and
static checking, I want to introduce just one new type, and use it to
perform ref-counting at runtime.

So far all we're doing is updating new's interface. The actual
ref-counting implementation is next.

One implication: I might sometimes need duplicate implementations for a
recipe with allocated vs vanilla addresses of the same type. So far it
seems I can get away with just always passing in allocated addresses;
the situations when you want to pass an unallocated address to a recipe
should be few and far between.
Diffstat (limited to '062scheduler.cc')
-rw-r--r--062scheduler.cc6
1 files changed, 3 insertions, 3 deletions
diff --git a/062scheduler.cc b/062scheduler.cc
index cd52f48c..a68646d7 100644
--- a/062scheduler.cc
+++ b/062scheduler.cc
@@ -517,16 +517,16 @@ case LIMIT_TIME: {
 :(scenario new_concurrent)
 recipe f1 [
   start-running f2
-  1:address:number/raw <- new number:type
+  1:address:shared:number/raw <- new number:type
   # wait for f2 to complete
   {
     loop-unless 4:number/raw
   }
 ]
 recipe f2 [
-  2:address:number/raw <- new number:type
+  2:address:shared:number/raw <- new number:type
   # hack: assumes scheduler implementation
-  3:boolean/raw <- equal 1:address:number/raw, 2:address:number/raw
+  3:boolean/raw <- equal 1:address:shared:number/raw, 2:address:shared:number/raw
   # signal f2 complete
   4:number/raw <- copy 1
 ]