esp8266-hal VS mimalloc

Hi! ESP8266 is not really supported! You can use https://github.com/esp-rs/esp8266-hal but it may even fail to compile. I would suggest using any ESP32. All the ESP32 Series (ESP32, ESP32-Cx, ESP32-Sx) do have support for Rust (see the esp-rs organization) for more information. Just take into account that Xtensa targets (ESP32 and ESP32-Sx) require to install Espressif fork of Rust with support for Xtensa targets, see https://esp-rs.github.io/book/installation/index.html

Hi, I'm trying to run a simple Rust program on my D1 Mini clone (using the ESP8266-HAL. After a bunch of problems along the way, I have reached a point, where my programs seemingly compile and flash to the board without error.

I'm trying to get the ESP8266-HAL up and running. I've worked my way through a bunch of problems, but I'm currently stuck with the following error when trying to run an example using: cargo +esp espflash --release --example blinky COM3:

mimalloc: mimalloc is an open source implementation of malloc, currently the best performing allocator.

Some compiler writers thought that was the case, if [0] is related to OP. I don't have a "modern" (after 6th gen) Intel CPU to test it on, but note that most programs are compiled for a relatively generic CPU.

[0]: https://github.com/microsoft/mimalloc/issues/807

Yes, it's very efficient and that's not where the main problem lies. However, small allocations with modern C heap allocators like mimalloc or snmalloc has gotten extremely efficient as well. Would be interesting to see a benchmark comparison with Java's G1 and ZGC.

Memory management for C is not itself a solved problem, not only is there a lot of performance to squeeze out of malloc itself (the benchmarks on https://github.com/microsoft/mimalloc exemplifies the variance between the implementations), but it's up to the programmer to implement memory management in the large in an efficient way, which is not an easy task. One sure mark of a slow C program is one with a ton of mallocs and frees strewn all over.

It's a very terse howto for replacing Factorio's memory allocator with Microsoft's mimalloc, and configuring mimalloc so that memory is always allocated on huge pages by using madvise().

I was wondering if Koka's perceus referencing counting style is any different from the reference counting that Lean4 implements? I understand that both rely upon the mimalloc (https://github.com/microsoft/mimalloc) library in the backend.

If you are fine with heap allocations then there are only few dozens operator new/delete to override to regain control over normal C++ code memory use. Allocators and STL all need to call those. At least that's what gaming does on all platforms. If you need examples you can check Mimalloc on github ( https://github.com/microsoft/mimalloc/blob/master/include/mimalloc-new-delete.h ).

What's the difference between this and Microsoft's? https://github.com/microsoft/mimalloc

Version 0.1.31 of the Rust wrapper for the mimalloc memory allocator has just been released!