lineiform
tree-flat
lineiform | tree-flat | |
---|---|---|
8 | 2 | |
155 | 25 | |
- | - | |
0.0 | 1.9 | |
about 1 year ago | about 1 year ago | |
Rust | Rust | |
- | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
lineiform
-
JITting functions in Rust for runtime performance flexibility
Sounds similar to lineiform. Which isn't all that stable or actively developed, but it is a cute approach to writing a meta-jit in rust. It's a weird approach, but IMO it's worth more experimentation.
-
What’s everyone working on this week (9/2022)?
Working on Lineiform, my meta-JIT library, some more.
-
Lineiform, a meta-JIT library for Rust interpreters
In response to Cranelift, switching to my own Tangle IR won't be using Cranelift at all (it uses raw dynasm-rs for emitting instructions). I go into a bit in https://github.com/chc4/lineiform/issues/19, but Cranelift specifically has some rules about iflags, the type they use to conceptualize processor flags effects (e.g. add's carryout or overflow). You can only have one iflags value live at a time, and it can't overlap with any other math operation. This is a problem because the x86 we're lifting doesn't always follow that rule, so if we just emit Cranelift as we go it will panic and say we built an invalid function.
I go into a bit in https://github.com/chc4/lineiform/issues/19, but it's less a problem with its optimizer and more a problem with its IR constraints. Cranelift specifically has some rules about `iflags`, the type they use to conceptualize processor flags effects (e.g. add's carryout or overflow). You can only have one `iflags` value live at a time, and it can't overlap with any other math operation. This is a problem because the x86 we're lifting doesn't always follow that rule, so if we just emit Cranelift as we go it will panic and say we built an invalid function.
The iflags design in general is kinda awkward too, and was being rethought a few months ago when I was first getting this working; I think they're planning on redesigning the add carryout interface and things to be slightly more streamlined. I suspect that any redesigned interface will have similar problems with mismatch between what I want from Cranelift and what 90% of other uses of Cranelfit want, though, and so I decided to just make my own IR instead.
-
What's everyone working on this week (3/2022)?
Working on the codegen backend for Lineiform again. I sketched out a plan on how to implement register allocation in a way that hopefully doesn't have horrible behavior in the majority of cases, and implemented ~half of it last week, and hopefully I'll implement the other half and instruction scheduling this week.
-
HN: == Happy New Year HN == (What is your “plans” for the new year?)
Yup, https://github.com/chc4/lineiform. It's not usable at all yet - I was building it on top of Cranelift, which turned out to be a fairly bad idea, so I'm going to have to essentially rewrite all of it with my own codegen backend I think. I've been hacking on it on and off but it's been much slower progress due to work (and writing a codegen backend is hard...)
-
What's everyone working on this week (32/2021)?
I got struck by either a very dumb or very good idea a few days ago, and finally have a working (minimal) proof-of-concept for it: Lineiform is a meta-JIT library to nearly automatically get an optimizing method JIT from a Rust interpreter. It does dynamic recompilation on closures by lifting from x86 to Cranelift IR for runtime function inlining and constant propagation.
tree-flat
-
Ask HN: What are some 'cool' but obscure data structures you know about?
I made https://github.com/mamcx/tree-flat as flattened stored tree in pre-order that allows for very fast iterations even for childs/parent queries. Is based on APL, so not that novel.
I also like a lot the relational model, is not that much represented so I making a language on top of it: https://tablam.org.
-
What’s everyone working on this week (9/2022)?
Working in the flattest tree library for Rust (https://github.com/mamcx/tree-flat), inspired by the talk “High-performance Tree Wrangling, the APL Way” by Aaron Hsu.
What are some alternatives?
soundfingerprinting - Open source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.
multiversion-concurrency-control - Implementation of multiversion concurrency control, Raft, Left Right concurrency Hashmaps and a multi consumer multi producer Ringbuffer, concurrent and parallel load-balanced loops, parallel actors implementation in Main.java, Actor2.java and a parallel interpreter
cranelift-jit-demo - JIT compiler and runtime for a toy language, using Cranelift
atomic-server - An open source headless CMS / real-time database. Powerful table editor, full-text search, and SDKs for JS / React / Svelte.
augmented-audio - Rust - Augmented Audio Libraries
indicatif - A command line progress reporting library for Rust
Nova - Implementation of "Ray Tracing in One Weekend": https://raytracing.github.io/books/RayTracingInOneWeekend.html
conserve - 🌲 Robust file backup tool in Rust
uom - Units of measurement -- type-safe zero-cost dimensional analysis
TablaM - The practical relational programing language for data-oriented applications
entt - Gaming meets modern C++ - a fast and reliable entity component system (ECS) and much more