Parse bitfields #339
Open
Parse bitfields #339
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
phadej
force-pushed
the
bitfield-a
branch
5 times, most recently
from
c8e6ce7 to
621f413
Compare
Do not yet generate any Haskell code for them though. We store bitfields separately from rest of the fields. An idea is that in Haskell representation we could have a single field in the data-record for all the bitfields, even if they are spread across / interleaved between other fields in the C struct.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Do not yet generate any Haskell code for them though.
We store bitfields separately from rest of the fields.
An idea is that in Haskell representation we could have a single
field in the data-record for all the bitfields,
even if they are spread across / interleaved between other fields
in the C struct.