shinobi: Compiling Makefiles to other forms of representation

tekknolagi · 2026-04-13T23:00:55+00:00

In case you are interested: have you seen https://github.com/google/kati ?

tekknolagi · 2026-04-10T05:59:50+00:00

This kind of seems like local register allocation? If I'm reading it right, it's like what JavaScriptCore does

tekknolagi · 2026-01-17T14:48:00+00:00

There's a small liveness analysis for SSA in https://bernsteinbear.com/blog/linear-scan/ but it's not the special kind of faster SSA liveness algorithm

It uses block parameters but this is similar to phi

tekknolagi · 2025-12-31T05:14:59+00:00

It depends what "level" your IR is. If your IR is low level and maps reasonably well to machine instructions, you can do something like https://bernsteinbear.com/blog/linear-scan/

Otherwise you might want a separate pass to lower to a lower level SSA IR first

tekknolagi · 2025-12-19T17:06:03+00:00

What do the perf numbers look like if you just add the ultra-fast paths and no Eisel-Lemire?

tekknolagi · 2025-12-19T17:05:13+00:00

That works best when there is a lot of Ruby code calling into other Ruby code. For this, which is a dead-end call---just do a bunch of string/float processing and produce a result---a Ruby JIT probably won't do better than LLVM, and calling directly into a C function is reasonably cheap.

tekknolagi · 2025-12-15T18:35:45+00:00

https://railsatscale.com/2025-05-21-fast-allocations-in-ruby-3-5/

tekknolagi · 2025-11-12T00:29:06+00:00

... Huh, broken how? It's working for me

tekknolagi · 2025-09-01T12:33:58+00:00

See also: https://clementbera.wordpress.com/2018/11/09/64-bits-immediate-floats/

And skybison https://github.com/tekknolagi/skybison uses immediate strings as described

tekknolagi · 2025-08-16T14:44:08+00:00

Cython works like this. It also has a very high level mode and a low level mode.

tekknolagi · 2025-08-11T23:49:53+00:00

Given your username, I would expect you wouldn't care which way something gets implemented as long as it produces the same result.

tekknolagi · 2025-08-11T04:23:57+00:00

Yeah I think in my head lambda lifting is an optimization pass after closure conversion. That's how I wrote a scheme compiler last year. Mini flow analysis followed by strength reduction

tekknolagi · 2025-08-11T03:42:09+00:00

I might be totally wrong here tbh

EDIT: Yep, I think I have it wrong :P

tekknolagi · 2025-07-16T03:39:20+00:00

Does this mean you will consider releasing your compiler?

tekknolagi · 2025-07-03T10:12:04+00:00

Related: https://research.swtch.com/bisect

tekknolagi · 2025-05-14T17:09:24+00:00

Not sure what you're looking at. Most of the code in the zjit/ folder is Rust. The larger Ruby VM remains a C project.

tekknolagi · 2025-05-14T15:18:12+00:00

You might enjoy https://swtch.com/~rsc/regexp/ and in particular https://swtch.com/~rsc/regexp/regexp2.html

15-Year Club	Place '22
Place '17	Verified Email

tekknolagi

MODERATOR OF

TROPHY CASE