html/308allocate-array.subx.html


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
72
73
74
75
76
77
78
79
80
81
82
83
84
85

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>Mu - 308allocate-array.subx</title>
<meta name="Generator" content="Vim/8.1">
<meta name="plugin-version" content="vim8.1_v1">
<meta name="syntax" content="none">
<meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy=">
<meta name="colorscheme" content="minimal-light">
<style type="text/css">
<!--
pre { white-space: pre-wrap; font-family: monospace; color: #000000; background-color: #ffffd7; }
body { font-size:12pt; font-family: monospace; color: #000000; background-color: #ffffd7; }
a { color:inherit; }
* { font-size:12pt; font-size: 1em; }
.subxComment { color: #005faf; }
.LineNr { }
.subxS1Comment { color: #0000af; }
.subxFunction { color: #af5f00; text-decoration: underline; }
.Constant { color: #008787; }
-->
</style>

<script type='text/javascript'>
<!--

/* function to open any folds containing a jumped-to line before jumping to it */
function JumpToLine()
{
  var lineNum;
  lineNum = window.location.hash;
  lineNum = lineNum.substr(1); /* strip off '#' */

  if (lineNum.indexOf('L') == -1) {
    lineNum = 'L'+lineNum;
  }
  var lineElem = document.getElementById(lineNum);
  /* Always jump to new location even if the line was hidden inside a fold, or
   * we corrected the raw number to a line ID.
   */
  if (lineElem) {
    lineElem.scrollIntoView(true);
  }
  return true;
}
if ('onhashchange' in window) {
  window.onhashchange = JumpToLine;
}

-->
</script>
</head>
<body onload='JumpToLine();'>
<a href='https://github.com/akkartik/mu/blob/main/308allocate-array.subx'>https://github.com/akkartik/mu/blob/main/308allocate-array.subx</a>
<pre id='vimCodeElement'>
<span id="L1" class="LineNr"> 1 </span><span class="subxComment"># 2-arg version of allocate-array.</span>
<span id="L2" class="LineNr"> 2 </span><span class="subxComment"># Really only intended to be called from code generated by mu.subx.</span>
<span id="L3" class="LineNr"> 3 </span>
<span id="L4" class="LineNr"> 4 </span>== code
<span id="L5" class="LineNr"> 5 </span>
<span id="L6" class="LineNr"> 6 </span><span class="subxFunction">allocate-array2</span>:  <span class="subxComment"># ad: (addr allocation-descriptor), array-len: int, elem-size: int, out: (addr handle array _)</span>
<span id="L7" class="LineNr"> 7 </span>    <span class="subxS1Comment"># . prologue</span>
<span id="L8" class="LineNr"> 8 </span>    55/push-ebp
<span id="L9" class="LineNr"> 9 </span>    89/&lt;- %ebp 4/r32/esp
<span id="L10" class="LineNr">10 </span>    <span class="subxS1Comment"># . save registers</span>
<span id="L11" class="LineNr">11 </span>    50/push-eax
<span id="L12" class="LineNr">12 </span>    52/push-edx
<span id="L13" class="LineNr">13 </span>    <span class="subxComment">#</span>
<span id="L14" class="LineNr">14 </span>    8b/-&gt; *(ebp+0xc) 0/r32/eax
<span id="L15" class="LineNr">15 </span>    f7 4/subop/multiply-into-edx-eax *(ebp+0x10)
<span id="L16" class="LineNr">16 </span>    <span class="subxComment"># TODO: check edx for overflow</span>
<span id="L17" class="LineNr">17 </span>    (<a href='120allocate.subx.html#L556'>allocate-array</a> *(ebp+8) %eax *(ebp+0x14))
<span id="L18" class="LineNr">18 </span><span class="Constant">$allocate-array2:end</span>:
<span id="L19" class="LineNr">19 </span>    <span class="subxS1Comment"># . restore registers</span>
<span id="L20" class="LineNr">20 </span>    5a/pop-to-edx
<span id="L21" class="LineNr">21 </span>    58/pop-to-eax
<span id="L22" class="LineNr">22 </span>    <span class="subxS1Comment"># . epilogue</span>
<span id="L23" class="LineNr">23 </span>    89/&lt;- %esp 5/r32/ebp
<span id="L24" class="LineNr">24 </span>    5d/pop-to-ebp
<span id="L25" class="LineNr">25 </span>    c3/return
</pre>
</body>
</html>
<!-- vim: set foldmethod=manual : -->
//: A simple test harness. To create new tests define functions starting with
//: 'test_'. To run all tests so defined, run:
//:   $ wart test
//:
//: So far it seems tasteful for layers to never ever reach back to modify
//: previously-defined tests. Every test is a contract once written, and should
//: pass as-is if it is included, regardless of how much later layers change
//: the program. Avoid writing 'temporary' tests that only work with some
//: subsets of the program.

:(before "End Types")
typedef void (*test_fn)(void);

:(before "End Globals")
const test_fn Tests[] = {
  #include "test_list"  // auto-generated; see makefile
};

bool Run_tests = false;
bool Passed = true;  // set this to false inside any test to indicate failure
long Num_failures = 0;

#define CHECK(X) \
  if (!(X)) { \
    ++Num_failures; \
    cerr << "\nF - " << __FUNCTION__ << "(" << __FILE__ << ":" << __LINE__ << "): " << #X << '\n'; \
    Passed = false; \
    return;  /* Currently we stop at the very first failure. */ \
  }

#define CHECK_EQ(X, Y) \
  if ((X) != (Y)) { \
    ++Num_failures; \
    cerr << "\nF - " << __FUNCTION__ << "(" << __FILE__ << ":" << __LINE__ << "): " << #X << " == " << #Y << '\n'; \
    cerr << "  got " << (X) << '\n';  /* BEWARE: multiple eval */ \
    Passed = false; \
    return;  /* Currently we stop at the very first failure. */ \
  }

:(before "End Setup")
Passed = true;

:(before "End Commandline Parsing")
if (argc > 1 && is_equal(argv[1], "test")) {
  Run_tests = true;  --argc;  ++argv;  // shift 'test' out of commandline args
}

:(before "End Main")
if (Run_tests) {
  // Test Runs
  // we run some tests and then exit; assume no state need be maintained afterward

  // End Test Run Initialization
  time_t t; time(&t);
  cerr << "C tests: " << ctime(&t);
  for (size_t i=0; i < sizeof(Tests)/sizeof(Tests[0]); ++i) {
//?     cerr << i << '\n';
    run_test(i);
  }
  // End Tests
  cerr << '\n';
  if (Num_failures > 0) {
    cerr << Num_failures << " failure"
         << (Num_failures > 1 ? "s" : "")
         << '\n';
    return 1;
  }
  return 0;
}

:(code)
void run_test(size_t i) {
  if (i >= sizeof(Tests)/sizeof(Tests[0])) {
    cerr << "no test " << i << '\n';
    return;
  }
  setup();
  // End Test Setup
  (*Tests[i])();
  teardown();
  if (Passed) cerr << ".";
}

bool is_integer(const string& s) {
  return s.find_first_not_of("0123456789-") == string::npos
      && s.find('-', 1) == string::npos
      && s.find_first_of("0123456789") != string::npos;
}

long long int to_integer(string n) {
  char* end = NULL;
  // safe because string.c_str() is guaranteed to be null-terminated
  long long int result = strtoll(n.c_str(), &end, /*any base*/0);
  if (*end != '\0') cerr << "tried to convert " << n << " to number\n";
  assert(*end == '\0');
  return result;
}

void test_is_integer() {
  CHECK(is_integer("1234"));
  CHECK(is_integer("-1"));
  CHECK(!is_integer("234.0"));
  CHECK(is_integer("-567"));
  CHECK(!is_integer("89-0"));
  CHECK(!is_integer("-"));
  CHECK(!is_integer("1e3"));  // not supported
}

:(before "End Includes")
#include<cstdlib>