Data Structure alignment

​​​​​​​reference: Data Structure alignment - GeeksforGeeks

Data structure alignment is the way data is arranged and accessed in computer memory. Data alignment and Data structure padding are two different issues but are related to each other and together known as Data Structure alignment. 
Data alignment: Data alignment means putting the data in memory at address equal to some multiple of the word size. This increases the performance of system due to the way the CPU handles memory. 
Data Structure Padding: Now, to align the data, it may be necessary to insert some extra bytes between the end of the last data structure and the start of the next data structure as the data is placed in memory as multiples of fixed word size. This insertion of extra bytes of memory to align the data is called data structure padding.
Consider the structure as shown below: 
 

struct 
{
    char a;
    short int b;
    int c;
    char d;
}

Now we may think that the processor will allocate memory to this structure as shown below: 

The total memory allocated in this case is 8 bytes. But this never happens as the processor can access memory as fixed word size of 4 bytes. So, the integer variable c can not be allocated memory as shown above. An integer variable requires 4 bytes. The correct way of allocation of memory is shown below for this structure using padding bytes. 
 

The processor will require a total of 12 bytes for the above structure to maintain the data alignment. 
Look at the below C++ program: 

  • CPP

// CPP program to test

// size of struct

#include <iostream>

using namespace std;

// first structure

struct test1

{

    short s;

    int i;

    char c;

};

// second structure

struct test2

{

    int i;

    char c;

    short s;

};

// driver program

int main()

{

    test1 t1;

    test2 t2;

    cout << "size of struct test1 is " << sizeof(t1) << "\n";

    cout << "size of struct test2 is " << sizeof(t2) << "\n";

    return 0;

}

Output: 
 

size of struct test1 is 12
size of struct test2 is 8

For the first structure test1 the short variable takes 2 byte. Now the next variable is int which requires 4 bytes. So, 2 bytes padding is added after short variable. Now, the char variable requires 1 byte but memory will be accessed in word size of 4 byte so 3 byte of padding is added again. So, total 12 bytes of memory is required. We can similarly calculate the padding for the second structure also. Padding for both of the structures is shown below: 
 

struct test1
{
    short s; 
    // 2 bytes
    // 2 padding bytes
    int i;
    // 4 bytes
    char c;
    // 1 byte
    // 3 padding bytes
};

struct test2
{
    int i;
    // 4 bytes
    char c;
    // 1 byte
    // 1 padding byte
    short s;
    // 2 bytes
};

Note :You can minimize the size of memory allocated for a structure by sorting members by alignment.
References : 
1) https://en.wikipedia.org/wiki/Data_structure_alignment 
2) c++ - Why isn't sizeof for a struct equal to the sum of sizeof of each member? - Stack Overflow
This article is contributed by Mandeep Singh. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

内容概要:本文详细介绍了施耐德M580系列PLC的存储结构、系统硬件架构、上电写入程序及CPU冗余特性。在存储结构方面,涵盖拓扑寻址、Device DDT远程寻址以及寄存器寻址三种方式,详细解释了不同类型的寻址方法及其应用场景。系统硬件架构部分,阐述了最小系统的构建要素,包括CPU、机架和模块的选择与配置,并介绍了常见的系统拓扑结构,如简单的机架间拓扑和远程子站以太网菊花链等。上电写入程序环节,说明了通过USB和以太网两种接口进行程序下载的具体步骤,特别是针对初次下载时IP地址的设置方法。最后,CPU冗余部分重点描述了热备功能的实现机制,包括IP通讯地址配置和热备拓扑结构。 适合人群:从事工业自动化领域工作的技术人员,特别是对PLC编程及系统集成有一定了解的工程师。 使用场景及目标:①帮助工程师理解施耐德M580系列PLC的寻址机制,以便更好地进行模块配置和编程;②指导工程师完成最小系统的搭建,优化系统拓扑结构的设计;③提供详细的上电写入程序指南,确保程序下载顺利进行;④解释CPU冗余的实现方式,提高系统的稳定性和可靠性。 其他说明:文中还涉及一些特殊模块的功能介绍,如定时器事件和Modbus串口通讯模块,这些内容有助于用户深入了解M580系列PLC的高级应用。此外,附录部分提供了远程子站和热备冗余系统的实物图片,便于用户直观理解相关概念。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值