Automated field re-ordering in C structs to avoid padding

by

If every single word you can squeeze out of the storage is critical, then I have to recommend optimizing the struct by hand. A tool could arrange the members optimally for you, but it doesn’t know, for example, that this value here that you’re storing in 16 bits actually never goes above 1024, so you could steal the upper 6 bits for this value over here…

So a human will almost certainly beat a robot on this job.

[Edit] But it seems like you really don’t want to hand-optimize your structs for each architecture. Maybe you really have a great many architectures to support?

I do think this problem isn’t amenable to a general solution, but you might be able to encode your domain knowledge into a custom Perl/Python/something script that generates the struct definition for each architecture.

Also, if all your members have sizes that are powers of two, then you will get optimal packing simply by sorting members by size (largest first.) In that case, you can just use good old-fashioned macro-based struct-building – something like this:

#define MYSTRUCT_POINTERS      \
    Something*  m_pSomeThing;  \
    OtherThing* m_pOtherThing; 

#define MYSTRUCT_FLOATS        \
    FLOAT m_aFloat;            \
    FLOAT m_bFloat;

#if 64_BIT_POINTERS && 64_BIT_FLOATS
    #define MYSTRUCT_64_BIT_MEMBERS MYSTRUCT_POINTERS MYSTRUCT_FLOATS
#else if 64_BIT_POINTERS
    #define MYSTRUCT_64_BIT_MEMBERS MYSTRUCT_POINTERS
#else if 64_BIT_FLOATS
    #define MYSTRUCT_64_BIT_MEMBERS MYSTRUCT_FLOATS
#else
    #define MYSTRUCT_64_BIT_MEMBERS
#endif

// blah blah blah

struct MyStruct
{
    MYSTRUCT_64_BIT_MEMBERS
    MYSTRUCT_32_BIT_MEMBERS
    MYSTRUCT_16_BIT_MEMBERS
    MYSTRUCT_8_BIT_MEMBERS
};

More Related Contents:

  1. Find the Biggest Number in C, BUT with characters
  2. Recursive and non-recursive traversal of three degree tree
  3. How are multi-dimensional arrays formatted in memory?
  4. How to reverse a singly linked list using only two pointers?
  5. Is using flexible array members in C bad practice?
  6. Quick Way to Implement Dictionary in C
  7. Are there any open source C libraries with common data structures? [closed]
  8. How do you implement a circular buffer in C?
  9. C – How to implement Set data structure?
  10. Good STL-like library for C [closed]
  11. What is a hash table and how do you make it in C? [closed]
  12. Deleting a middle node from a single linked list when pointer to the previous node is not available
  13. Implementing a HashMap in C [closed]
  14. Merging two sorted linked lists
  15. Does C have any tools for doing string addition?
  16. Standard data structure library in C? [closed]
  17. Getting an error while running following code
  18. Correctly allocating multi-dimensional arrays
  19. Should I use #include in headers?
  20. Constant pointer vs Pointer to constant [duplicate]
  21. C function pointer syntax
  22. Can a conforming C implementation #define NULL to be something wacky
  23. Listing directory contents using C and Windows
  24. Should I free memory before exit?
  25. atoi() — string to int
  26. Flexible array member in C-structure
  27. how to correctly use fork, exec, wait
  28. Program doesn’t execute gets() after scanf(), even using fflush(stdin)
  29. Easiest way of using min priority queue with key update in C++
  30. What are trade offs for “busy wait” vs “sleep”?

Leave a Comment