Live data from Hacker News

Viewing profile — mindleyhilner

mindleyhilner

HN member
Joined
Tue, Dec 02, 2014, 3:48 AM UTC
HN karma
17
Public activity
11 items

About mindleyhilner

No profile information was provided.

Recent public activity

  1. story
  2. comment
    Comment #33088102

    Just skimmed, central idea is to linear scan in reverse?

  3. comment
    Comment #30307505

    Paper: http://people.csail.mit.edu/lamanda/assets/documents/LiuPOPL...

  4. comment
    Comment #16279005

    Small typo: --- before 2018-01-31 17:12:13.626560688 -0800 +++ after 2018-01-31 17:12:17.494580179 -0800 @@ -1 +1 @@ -uint32_t buf = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHA…

  5. comment
    Comment #14936544

    Sorry to sound stupid, but how is that exponential? Isn't it O(mn) where m = number of floors and n = number of shafts? EDIT: Unless there's some dependence between m and n, like i…

  6. comment
    Comment #14546767

    Small typo: "hunt-and-pack" should be "hunt-and-peck."

  7. comment
    Comment #14517924

    Doesn't `let x = xs[i]` immutably borrow from xs? So for the duration of x's lifetime (which is the entire for-body block), xs cannot be changed and therefore its length must remai…

  8. comment
    Comment #14073273

    It's actually not. It's what GVNHoist does, but not MLSM. MLSM only handles diamonds. Fine, it's what MLSM aspires to: http://llvm-cs.pcc.me.uk/lib/Transforms/Scalar/MergedLoadSto.…

  9. comment
    Comment #14073242

    How do you move up towards exit?

  10. comment
    Comment #14073239

    The point of hoisting towards entry is to reduce code size, as the changelog indicates. It's safe to hoist the expression from program points P_{0..i..n-1} to some point Q that dom…

  11. comment
    Comment #14073116

    It attempts to move evaluation of expressions executed on all paths to the function *exit* as early as possible, which helps primarily for code size, but can be useful for speed of…