about summary refs log tree commit diff stats
path: root/html/apps/dquotes.subx.html
Commit message (Expand)AuthorAgeFilesLines
* 6015Kartik Agaram2020-02-171-8/+8
* 6001Kartik Agaram2020-02-091-14/+14
* 5925Kartik Agaram2020-01-271-26/+26
* 5901Kartik Agaram2020-01-191-2/+2
* 5897 - rename comparison instructionsKartik Agaram2020-01-161-25/+25
* 5889Kartik Agaram2020-01-141-1/+1
* 5884Kartik Agaram2020-01-121-7/+7
* 5881Kartik Agaram2020-01-101-1/+1
* 5876 - address -> addrKartik Agaram2020-01-031-10/+10
* 5806Kartik Agaram2019-12-091-104/+104
* 5753Kartik Agaram2019-11-181-1495/+1504
* 5716Kartik Agaram2019-10-261-1308/+1290
* 5701Kartik Agaram2019-10-171-42/+42
* 5684Kartik Agaram2019-09-211-8/+8
* 5683Kartik Agaram2019-09-201-663/+239
* 5661Kartik Agaram2019-09-151-1/+1
* 5629Kartik Agaram2019-09-061-1317/+1342
* 5607Kartik Agaram2019-09-011-3/+3
* 5600Kartik Agaram2019-08-311-2097/+2099
* 5592 - switch register names to lowercaseKartik Agaram2019-08-261-646/+646
* 5590Kartik Agaram2019-08-251-1/+1
* 5589Kartik Agaram2019-08-251-605/+178
* 5582Kartik Agaram2019-08-251-2358/+2359
* 5499Kartik Agaram2019-07-311-1/+1
* 5490Kartik Agaram2019-07-271-2/+2
* 5485 - promote SubX to top-levelKartik Agaram2019-07-271-0/+2617
me the previous revision' href='/akkartik/mu/blame/cpp/037call_reply?h=main&id=c18e17f22feaf308376f53f2f61775ddad0e4a9d'>^
88be3dbc ^
8dacba82 ^




























1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71

                                                    
                 



                                     
                               



                                         
                   
                             
                   
                             
 

                                             

                                        






                                                                           
                            



                                                                                           
                                                                             




                                                                    
 
                                                                                   
                           




























                                          
//: Calls can also generate products, using 'reply'.

:(scenario reply)
recipe main [
  3:integer, 4:integer <- f 2:literal
]
recipe f [
  12:integer <- next-ingredient
  13:integer <- add 1:literal, 12:integer
  reply 12:integer, 13:integer
]
+run: instruction main/0
+run: result 0 is 2
+mem: storing 2 in location 3
+run: result 1 is 3
+mem: storing 3 in location 4

:(before "End Primitive Recipe Declarations")
REPLY,
:(before "End Primitive Recipe Numbers")
Recipe_number["reply"] = REPLY;
:(before "End Primitive Recipe Implementations")
case REPLY: {
  vector<vector<int> > callee_results;
  for (size_t i = 0; i < instructions[pc].ingredients.size(); ++i) {
    callee_results.push_back(read_memory(instructions[pc].ingredients[i]));
  }
  rr.calls.pop();
  assert(!rr.calls.empty());
  size_t& caller_pc = rr.calls.top().pc;
  instruction& caller_instruction = Recipe[rr.calls.top().running_recipe].steps[caller_pc];
  assert(caller_instruction.products.size() <= callee_results.size());
  for (size_t i = 0; i < caller_instruction.products.size(); ++i) {
    trace("run") << "result " << i << " is " << to_string(callee_results[i]);
    write_memory(caller_instruction.products[i], callee_results[i]);
  }
  ++caller_pc;
  break;
}

//: Products can include containers and exclusive containers, addresses and arrays.
:(scenario reply_container)
recipe main [
  3:point <- f 2:literal
]
recipe f [
  12:integer <- next-ingredient
  13:integer <- copy 35:literal
  reply 12:point
]
+run: instruction main/0
+run: result 0 is [2, 35]
+mem: storing 2 in location 3
+mem: storing 35 in location 4

:(code)
string to_string(const vector<int>& in) {
  if (in.empty()) return "[]";
  ostringstream out;
  if (in.size() == 1) {
    out << in[0];
    return out.str();
  }
  out << "[";
  for (size_t i = 0; i < in.size(); ++i) {
    if (i > 0) out << ", ";
    out << in[i];
  }
  out << "]";
  return out.str();
}