Conversation
OlegHahm
commented
Aug 5, 2015
- unittests
There was a problem hiding this comment.
Why not use the BITFIELD macro with BF_SIZE == 40 here? That would make the code below a little bit easier to read:
BITFIELD(field, BF_SIZE);There was a problem hiding this comment.
I think the rational was to not rely on the BITFIELD macro here.
|
We should mention that for bitfields with at most 32bit there is a more efficient version in bitarithm.h. |
Agreed - though their feature set is a little bit different. |
|
But maybe we could add the missing functionality to |
There was a problem hiding this comment.
skipping words until a positive match is found and then skipping bytes might converge faster
There was a problem hiding this comment.
We had this discussion when @kaspar030 introduced bf_get_unset and decided against it. I think it's mostly a question of what sizes for bitfields you expect and trading code space for performance.
There was a problem hiding this comment.
I guess memory alignment could also be a problem if you read words.
|
Updated. Anyone for an ACK? |
|
Got rid of the need for this in #3561. Should I close this one or does anyone else see a need for it? |
|
Close it, you can always reopen if a use case appears.
|