mindleyhilner

5 ms·

1.
by mindleyhilner 20d ago
Actual meat: https://arxiv.org/abs/2510.20765
2.
OpenAI to purchase 10 gigawatts of chips from Broadcom(ft.com)
3 points by mindleyhilner 1y ago|0 comments
3.
by mindleyhilner 4y ago
Just skimmed, central idea is to linear scan in reverse?
4.
by mindleyhilner 5y ago
Paper: http://people.csail.mit.edu/lamanda/assets/documents/LiuPOPL...
5.
by mindleyhilner 9y ago
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_SHARED, fb, 0); +uint32_t *buf
6.
by mindleyhilner 9y ago
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 if taller buildings always need more shafts or some
7.
by mindleyhilner 9y ago
Small typo: "hunt-and-pack" should be "hunt-and-peck."
8.
by mindleyhilner 9y ago
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 remain the same. Though this might be information that
9.
by mindleyhilner 10y ago
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... (:
10.
by mindleyhilner 10y ago
How do you move up towards exit?
11.
by mindleyhilner 10y ago
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 dominates all P_i if the expression is available at each P
12.
by mindleyhilner 10y ago
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 generated code as well. [Emphasis added.] Typo? PRE