tekknolagi

8 ms·

61.
Optimizing Django by not being silly(bernsteinbear.com)
2 points by tekknolagi 2y ago|0 comments
62.
by tekknolagi 2y ago
I don't know how deep call stacks go (and also separately don't know if I am allowed to quote stats like that) but people tend to not do points-to with k higher than 2 or 3 because it explodes the whole graph
63.
by tekknolagi 2y ago
It's not really supposed to be for any particular language. We didn't want to even say Ruby in the title because the experiment is on a very very (very!) stripped-down Ruby. IMO the more interesting thing here is incrementally d
64.
by tekknolagi 2y ago
One of the authors here. Would enjoy hearing what you think
65.
by tekknolagi 2y ago
Probably a different thing entirely than the specialization. A new lattice. A pair of uint64 for int ranges that has its own join function, maybe. CF Bolz-Tereick has a good blog post about this for pypy and it also talks about known bits
66.
by tekknolagi 2y ago
Have a link to the implementation?
67.
by tekknolagi 2y ago
Excellent, thanks for the pointer. Mentioned!
68.
by tekknolagi 2y ago
I added a couple of sentences in the intro to clarify.
69.
by tekknolagi 2y ago
This is not about surface level typing. This is about compiler internals.
70.
by tekknolagi 2y ago
And another bit of info: it's much harder to reliably track that, because as soon as the list (for example) escapes, its elements could have any type and it could be any size. PyPy has storage strategies and speculative typing (with
71.
by tekknolagi 2y ago
It's in the context of a Python JIT, where we're looking for a different kind of type information
72.
Representing Type Lattices Compactly(bernsteinbear.com)
87 points by tekknolagi 2y ago|27 comments
73.
by tekknolagi 2y ago
Can I use this instead as a frontend for an existing server? UI is perfect for me but I don't want to fully self host anything but the UI.
74.
Interprocedural sparse conditional type propagation(railsatscale.com)
2 points by tekknolagi 2y ago|0 comments
75.
by tekknolagi 2y ago
Thank you!
76.
by tekknolagi 2y ago
Mind if I quote you on this in the post?
77.
by tekknolagi 2y ago
Please write up your "Pizlo special" on Phi nodes
78.
by tekknolagi 2y ago
Yes but that is not what makes irreducible control flow graphs, I think. You'll still have structured control flow
79.
by tekknolagi 2y ago
What source language are you working with that has go-to?
80.
A Compiler IR for Scrapscript(bernsteinbear.com)
5 points by tekknolagi 2y ago|0 comments
81.
Weak references and garbage collectors(bernsteinbear.com)
3 points by tekknolagi 2y ago|0 comments
82.
by tekknolagi 2y ago
Why do you use a combination of `__class_getitem__` and `__getitem__`?
83.
by tekknolagi 2y ago
I got one 1.5 years ago and still enjoying. I hope it will be the laptop of Theseus of the rest of my life, but some unexpected development will probably happen that will make that unlikely.
84.
by tekknolagi 2y ago
I haven't manually checked every case but it's normally folded into the load or shift or whatever and completely erased
85.
by tekknolagi 2y ago
This is so great. I've been watching the project develop and it's really neat to see this milestone!
86.
by tekknolagi 2y ago
We used memcpy everywhere in our runtime and after the 10th or so time doing it, it becomes less awkward.
87.
by tekknolagi 2y ago
I'll get back to this in more detail soon, but I did have lambda expressions in my blog post...
88.
by tekknolagi 2y ago
See also: retool
89.
by tekknolagi 2y ago
Taking a look now. A couple of questions: * Why give literal ints their own temporaries? * Why not support lambda expressions? Is it tricky in this approach or just accidentally missing?
90.
by tekknolagi 2y ago
Please show this gist. I would enjoy linking to it

More ›