6 releases

0.3.2 Jun 26, 2023
0.3.1 Sep 13, 2022
0.3.0 Jun 25, 2022
0.2.2 Jun 21, 2022
0.1.1 Jun 6, 2022

#139 in Data structures

Download history 139/week @ 2023-10-26 141/week @ 2023-11-02 109/week @ 2023-11-09 66/week @ 2023-11-16 148/week @ 2023-11-23 82/week @ 2023-11-30 19/week @ 2023-12-07 26/week @ 2023-12-14 40/week @ 2023-12-21 19/week @ 2023-12-28 15/week @ 2024-01-04 20/week @ 2024-01-11 21/week @ 2024-01-18 36/week @ 2024-01-25 26/week @ 2024-02-01 33/week @ 2024-02-08

120 downloads per month
Used in 3 crates (via maitake-sync)

MIT license

3.5K SLoC


🍄 the Mycelium intrusive data structures library.

crates.io Documentation Documentation (HEAD) MIT licensed Test Status Sponsor @hawkw on GitHub Sponsors

what is it?

This library provides a collection of intrusive data structures originally implemented for the Mycelium operating system. Currently, it provides an intrusive doubly-linked list and an intrusive, lock-free MPSC queue.

intrusive data structures

Intrusive data structures are node-based data structures where the node data (pointers to other nodes and, potentially, any associated metadata) are stored within the values that are contained by the data structure, rather than owning those values.

when should i use intrusive data structures?

  • Because node data is stored inside of the elements of a collection, no additional heap allocation is required for those nodes. This means that when an element is already heap allocated, it can be added to a collection without requiring an additional allocation.
  • Similarly, when elements are at fixed memory locations (such as pages in a page allocator, or statics), they can be added to intrusive data structures without allocating at all. This makes intrusive data structures useful in code that cannot allocate — for example, we might use intrusive lists of memory regions to implement a heap allocator.
  • Intrusive data structures may offer better performance than other linked or node-based data structures, since allocator overhead is avoided.

when shouldn't i use intrusive data structures?

  • Intrusive data structures require the elements stored in a collection to be aware of the collection. If a struct is to be stored in an intrusive collection, it will need to store a Links struct for that structure as a field, and implement the Linked trait to allow the intrusive data structure to access its Links.
  • A given instance of a Linked type may not be added to multiple intrusive data structures of the same type. This can sometimes be worked around with multiple wrapper types. An object may be a member of multiple intrusive data structures of different types.
  • Using intrusive data structures requires unsafe code. The Linked trait is unsafe to implement, as it requires that types implementing Linked uphold additional invariants. In particular, members of intrusive collections must be pinned in memory; they may not move (or be dropped) while linked into an intrusive collection.

about the name

In keeping with Mycelium's fungal naming theme, Cordyceps is a genus of ascomycete fungi that's (in)famous for its intrusive behavior.


The following features are available (this list is incomplete; you can help by expanding it.)

Feature Default Explanation
no-cache-pad false Inhibits cache padding for the CachePadded struct used for many linked list pointers. When this feature is NOT enabled, the size will be determined based on target platform.
alloc false Enables liballoc dependency and features that depend on liballoc.
std false Enables libstd dependency and features that depend on the Rust standard library. Implies alloc.


~411K SLoC