Join GitHub today
GitHub is home to over 31 million developers working together to host and review code, manage projects, and build software together.
Sign upIdea: "compact" enums and structs #311
Comments
glaebhoerl
referenced this issue
Jul 25, 2015
Open
repr(packed) allows invalid unaligned loads #27060
glaebhoerl
referenced this issue
Sep 5, 2015
Merged
References into repr(packed) structs should be `unsafe`. #1240
This comment has been minimized.
This comment has been minimized.
comex
commented
Dec 29, 2016
|
Bump. I just wrote some code that uses a manual struct S {
a: Option<u64>,
b: Option<u64>,
c: Option<u64>,
}has a size/stride of 48 bytes (16 bytes for each @glaebhoerl was incorrect about it being possible to fully preserve semantics, though. Local borrows can be simulated as they indicated, but with normal layout you can write |
This comment has been minimized.
This comment has been minimized.
creationix
commented
Dec 30, 2016
|
I love this idea. I would like to start writing interpreters for microcontrollers in rust, but manual bit twiddling is a pain and I stick with C bitfields or macros. (still painful). |
glaebhoerl
referenced this issue
Sep 20, 2017
Closed
"Unreferencable" annotation to improve packing of booleans (and enums) #2159
Centril
added
the
T-lang
label
Feb 23, 2018
Centril
added
A-syntax
A-repr
A-optimization
A-machine
labels
Nov 26, 2018
This comment has been minimized.
This comment has been minimized.
moonheart08
commented
Dec 7, 2018
|
I love this idea as well. It would be Very helpful in cases where you are constrained by memory. In fact, making data smaller has TWO advantages, and both can be used to great effect on modern systems:
The time it takes to perform a single bitfield operation is flat out negated if the data isn't in L1 cache, and multiple bitfield operations can occur in the time it takes to read from L3 cache. The ability to improve memory locality using this is a very lucrative possibility for high performance code. |
rust-highfive commentedSep 24, 2014
Saturday Mar 01, 2014 at 12:33 GMT
For earlier discussion, see rust-lang/rust#12642
This issue was labelled with: B-RFC in the Rust repository
TL;DR By optionally taking away interior references, enums and structs can be represented much more compactly, potentially taking over most of the current use cases for manual bit twiddling code.
Rust leaves the layout of its enum types undefined for optimization purposes, but in practice most optimization possibilities are ruled out by the fact that interior references need to work. For instance, if you have an enum which contains another enum, you may want to collapse their discriminants together into a single field:
Here we could use a single discrimant field for both
XandOption, so that it ranges 0..2, e.g. 0 =>Foo(None), 1 =>Foo(Some), 2 =>Bar. Going further, we could pack in thebools as well, and representXas a singleu8: 0 =>Foo(None), 1 =>Foo(Some(false)), 2 =>Foo(Some(true)), 3 =>Bar(false), 4 =>Bar(true). But in both cases, this makes interior references, e.g.match some_x { Foo(ref opt_bool) => ..., _ => ... }impossible, so we must refrain.The idea would be to allow annotating an enum as "compact", in which case interior references are made illegal (but see below), and these optimization possibilities are opened back up: the compiler would be free to use any magic it wants to make the representation of the enum as compact as it is able, combining discriminants as above, taking advantage of tag bits in pointers, NaN-boxing, and so on. When generating code, the compiler would insert the necessary bit twiddling operations to pack the original values into this representation, and to take them back out again.
The same thing is possible for structs. For instance, a struct of
bools could be represented as a bunch of bits:Now
size_of::<Flags>()==size_of::<u8>()! If we let our imagination run further ahead, given types likei31,i30and so on, we could also take advantage of those extra bits.(It's important to note that this "compactifying" could always be deep, because the restriction against interior references would also be deep. If we have a non-compact struct type and store it in a compact one, references to the interior of the inner struct would likewise be forbidden, so it could be compacted as well. The example from above of representing
enum Xas a singleu8also relies on this property.)I think this feature could be a much nicer solution for most of the use cases where manual bit twiddling code is currently necessary (and also most of the use cases for bitfields in C).
Up until now, for simplicity's sake I've been assuming that interior references would be forbidden. But it may be possible to allow them. The idea is that when you take an interior reference:
the value would first be copied out onto the stack (only physically, not semantically!), and then the reference would point to the stack value. This is not dissimilar to what happens if you write
let nine = &9;. Because&is an immutable reference, the difference would not be observable.Going deeper into the woods, assuming #12624,
&mutborrows could also be represented by copying out the value at the beginning of the borrow, and then copying it back at the end. Again, because&mutwould have exclusive access to the given object, the difference should not be observable.I'm not sure if this would definitely work, but it seems like it might. Whether this is feasible has repercussions for syntax: if compact enums/structs are semantically identical to normal ones, and differ only in representation and performance,
#[compact]could just be an attribute. If, however, the semantics differ, it would be more appropriate to use actual syntax to mark the difference.