c
Visual Studio Code C/C++ development (by default-writer)
mps
The Memory Pool System (by Ravenbrook)
c | mps | |
---|---|---|
5 | 9 | |
8 | 580 | |
- | 2.2% | |
9.4 | 5.4 | |
7 months ago | about 2 months ago | |
C | C | |
GNU General Public License v3.0 only | GNU General Public License v3.0 or later |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
c
Posts with mentions or reviews of c.
We have used some of these posts to build our list of alternatives
and similar projects.
- Very bored
- 🏆 Top C open source projects and contributors
-
C Code language help
You can take a look into my C programming language library sample repo:
- VSCode/CMake sample library for studying C memory allocation / simple data structures
mps
Posts with mentions or reviews of mps.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-10-17.
- Jank development update – Moving to LLVM IR
-
Boehm Garbage Collector
I have a library which has an extremely slow free, around 2m for large files, because of unnaturally scattered allocation patterns, but this old conservative GC didn't help at all. It was about 40% slower with libgc. mimalloc was a bit better. Best would be a properly fast GC, like mps https://github.com/Ravenbrook/mps, but this would be too much work.
-
Ask HN: Best compiler/interpreter books for hacking on Scheme?
The first thing you should look at is MPS (see https://github.com/Ravenbrook/mps and https://www.ravenbrook.com/project/mps/). It's open source, professionally maintained and very powerful, and it was used e.g. in Dylan and LispWorks.
- Memory Pool System is a flexible and adaptable memory manager
-
Mmtk: Memory Management Toolkit
I wonder how the MMTK compares to the venerable Ravenbrook MPS https://www.ravenbrook.com/project/mps/ which originated in Harlequin’s programming language implementations, particularly Dylan.
-
Garbage Collection with LLVM
I am trying to implement garbage collection for my language because I want memory management for arrays/lists and strings. I am looking through LLVM's garbage collection page but the documentation isn't great. Are there any other resources that offer more concrete steps to implement garbage collection? Would it be wise to circumvent LLVM all together for garbage collection and only use something like the Memory Pool System? Thanks!
-
Memory Management Reference
This post seems related to the authors of MPS (1) that seems to be a general garbage-collector to use with various languages.
Many GC'd languages really didn't bother with stack-allocating variable-size entities, and regardless of if they did then _precicely_ scanning the stack would be complicated without compiler help.
If the compiler doesn't leave any info to the GC, then it can't know if it's scanning a pointer or a float and if your GC strategy relies on compacting memory (ie moving objects) then trying to guess between a float or a pointer can become fatal.
(1) https://github.com/Ravenbrook/mps
What are some alternatives?
When comparing c and mps you can also consider the following projects:
zpl - 📐 Pushing the boundaries of simplicity
lone - The standalone Linux Lisp