[PATCH] D90094: [BasicAA] Handle recursive queries more efficiently (NFCI)

[Reid Kleckner via Phabricator via llvm-commits]

rnk added a comment.

CReduce on plain C code is lightning fast, no template goo grind away. I got this reduced test case that crashes when this patch is applied:

  char b, c;
  void d(char *e, char *__restrict h, long j) {
    char *a = e + j;
    for (; e < a; e++, h++)
      b = *e, *e = *h;
  }
  int f;
  char *g;
  void m(long e) {
    char *i, *k;
    char l;
    g = i = k = &l;
    while (k)
      for (; i < k;) {
        if (i)
          d(g, i, e);
        g += e;
        if (f) {
          d(k, &c, e);
          i += e;
        }
      }
  }

Compile like so:
`clang -cc1 -triple aarch64-unknown-linux-android21 -O3 -emit-llvm hb-ot-map-6508fc.reduced.cpp`


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D90094/new/

https://reviews.llvm.org/D90094