Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
celeritascelery
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
91.
▲
by
celeritascelery
2y ago
It would, but lisp has prefix operators, so you wouldn’t have to worry about it getting confused.
92.
▲
by
celeritascelery
2y ago
I tried doing something similar to this once. I ran into an issue where I couldn’t define symbols with a dash in them (DEFINE MY-FN…). This is because rust will split the tokens on a dash. It was a small thing, but it meant I couldn’t just
93.
▲
by
celeritascelery
2y ago
Why would that impact speculative loads/branch prediction? The pointers are untagged before they are accessed so it should not impact the loads.
94.
▲
by
celeritascelery
2y ago
I wrote the snippets in x86 asm because I assumed that more people are familiar with it than ARM. Also I ran them on an x86 processor as well.
95.
▲
What is the best pointer tagging method?
(coredumped.dev)
115 points
by
celeritascelery
2y ago
|
31 comments
96.
▲
by
celeritascelery
2y ago
Wouldn’t a stack map have that value as well?
97.
▲
by
celeritascelery
2y ago
I don’t know which is worse, that they sold my data or that it was worth so little.
98.
▲
by
celeritascelery
2y ago
Interesting write up. I am curious about the usage of this framework. One thing in reference counting’s favor is that it is hard to screw up. You just use the rc type and when it is no longer accessible it will magically get freed. That is
99.
▲
by
celeritascelery
2y ago
You can switch to it, but there are still crashes.
100.
▲
by
celeritascelery
2y ago
Imagine if instead he had been using a car without autopilot and had killed himself and or others. That’s how these “falling asleep at the wheel” stories usually go.
101.
▲
by
celeritascelery
2y ago
I know there are still some bugs and corner cases that need to be worked out, but I am really impressed with how well this is working. I would think that moving from a traditional single-threaded mark and sweep to a moving, concurrent GC wo
102.
▲
by
celeritascelery
2y ago
> Even Copilot loses money, to the tune of around $20 to $80 a month per user, according to The Wall Street Journal Wow. Does that mean that once the VC money dries up that will be the real cost of the products ($30-$90 a month)? That is
103.
▲
by
celeritascelery
2y ago
Runtime functions (eg dyn Trait) can’t be inlined for one, so this would help there. But also if you can make calls cheaper then you don’t have to be so aggressive with inlining, which can help with code size and compile times.
104.
▲
by
celeritascelery
3y ago
It looks like you intended to say that on the sibling comment.
105.
▲
by
celeritascelery
3y ago
That is just using a RefCell under the hood[1] so it is effectively the same trade-offs as the RefCell example from the article. [1] https://docs.rs/gc/0.5.0/src/gc/lib.rs.html#495-498
106.
▲
by
celeritascelery
3y ago
What other representations of "start/current/end" do you know of? Both versions just use 3 pointers. I am not aware of specific instructions on any architecture that would impact the direction the heap grows. They essent
107.
▲
Bump Allocation: Up or Down?
(coredumped.dev)
103 points
by
celeritascelery
3y ago
|
21 comments
108.
▲
by
celeritascelery
3y ago
Given how much research there is into this topic, I am sure that I just don't understand the complexity of it. But to me it seems like you could have a function that associates one value with another in the GC. Something like `gc_borro
109.
▲
Cycles All the Way Down
(coredumped.dev)
2 points
by
celeritascelery
3y ago
|
0 comments
110.
▲
by
celeritascelery
3y ago
Wait… you switch away from Emacs?
111.
▲
by
celeritascelery
3y ago
Have you ever had problem where two of your dependencies are each using a different version of the same library? Or have you ever wanted to incrementally upgrade an API so that you don’t have to change your entire code base in one fell swoo
112.
▲
by
celeritascelery
3y ago
This looks like a cool project. It looks like it is up to the host language to compile to bytecode and do all the type analysis before passing that info to the verifier. Looks like there is no VM yet, it just verifies the bytecode and then
113.
▲
by
celeritascelery
3y ago
This is really clever. I was surprised at how much speedup they got by just adding type information. But also the trick to make it ABI compatible with the current API. Takes a certain amount of madness. I think the GraalVM approach of trans
114.
▲
by
celeritascelery
3y ago
If you are going to comment, then you should read the article. But most things posted here (especially by science and tech journalists) are not worth reading and you can get right to the actual information by looking at the comments. No nee
115.
▲
by
celeritascelery
3y ago
> Will we have a way to hint a core/hart to dodge prediction for some branches, fine-grained and "cleanly"? Why would you want to avoid the branch predictor? All it can do is speedup your code.
116.
▲
by
celeritascelery
3y ago
I looked into the jump table optimization. The normal Lua version is here[1] and it uses the opcode as a index into a static array to jump to the label. The “faster” Pluto version is here[2] and it just uses a switch statement on the labels
117.
▲
by
celeritascelery
3y ago
How do you store power cheaply? We don’t have the have capability yet. Doesn’t mean we can’t figure it out, but until then we need consistent power. nuclear power is great because the materials are cheap and abundant and the power is very s
118.
▲
by
celeritascelery
3y ago
Not OP, but one thing that surprised me was if you are doing rust Simd in a library, and part of the code is marked #[inline] but others are not you might see catastrophic performance regressions. We saw an issue where the SIMD version was
119.
▲
by
celeritascelery
3y ago
Not for customers per se, but the company I work for will regularly send “scam” emails to us. If you click on the link you get assigned mandatory corporate phishing trainings. Makes you extra cautious.
120.
▲
On Safepoints
(wingolog.org)
2 points
by
celeritascelery
3y ago
|
0 comments
More ›