Function Main

ppcc/adlib/test1.cc:37–62

static const int max_depth = 15; // 2^16-1 nodes.

void Main() {
  Str *cmd = new Str(CMD);
  StrArr *args = (new Str(ARGS))->split(' ');
  Int n = 0;
  Str *output;
  for (int j = 0; j < iter; j++) {
    output = ReadProcess(cmd, args);
    n += output->len();
  }
  Check(n == iter * 48894, "read process output as bytes");
  Node *tree;
  static Node *permtree;
  Int counter;
  counter = 0;
  GCVar(permtree, make_tree(max_depth, counter));
  for (int i = 0; i < iter; i++) {
    counter = 0;
    tree = make_tree(max_depth, counter);
  }
  // This may overflow on 32-bit machines, so we use unsigned
  // modulo arithmetic without division.
  Check(sum_tree(tree) * 2 == counter * (counter - 1),
      "stress test memory allocation");
  Check(NormalizePath(S("/foo/x/../bar/./"))->eq("/foo/bar"), "normalize path");
  Check(BaseName(ProgramPath())->eq("test1"), "program path");
}