blocks|key|4112229|text|您可以尝试使用tpl库：http://tpl.sourceforge.net/|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|4112230|Tpl是一个用于序列化C数据的库。数据以其自然的二进制形式存储。API很小，并且试图保持“不碍事”。与使用XML相比，在C程序中使用tpl更快、更容易。Tpl可以序列化许多C数据类型，包括结构。|4112231|entityMap|0|LINK|mutability|MUTABLE|url|http://tpl.sourceforge.net/^0|C|R|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

You can try tpl library: <a href="http://tpl.sourceforge.net/" rel="nofollow">http://tpl.sourceforge.net/</a>

Tpl is a library for serializing C data. The data is stored in its natural binary form. The API is small and tries to stay "out of the way". Compared to using XML, tpl is faster and easier to use in C programs. Tpl can serialize many C data types, including structures.

blocks|key|4203632|text|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4203633|是否可以通过简单的方式编写结构。|blockquote|4203634|4203635|我不能使用任何外部库|4203636|4203637|那就不是了。无论是C的TPL还是C%2B%2B的优秀Boost.Serialization，库都是最简单的方法。C和C%2B%2B没有用于序列化数据结构的内置机制。因此，如果您不能使用库，那么您将不得不自己手动编写序列化。|4203638|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|-4|4|5|6|L|7|@]|8|@]|9|$]]|$1|A|3|B|4|C|6|M|7|@]|8|@]|9|$]]|$1|D|3|-4|4|5|6|N|7|@]|8|@]|9|$]]|$1|E|3|F|4|5|6|O|7|@]|8|@]|9|$]]|$1|G|3|-4|4|5|6|P|7|@]|8|@]|9|$]]|$1|H|3|I|4|5|6|Q|7|@]|8|@]|9|$]]|$1|J|3|-4|4|5|6|R|7|@]|8|@]|9|$]]]|K|$]]

<blockquote>
Is it possible to write structure by easy way.
i can't use any external library
</blockquote>
Then no. Libraries are the easy way, whether TPL for C or the excellent Boost.Serialization for C++. C and C++ do not have built-in mechanisms for serializing data structures. So if you're not able to use a library, then you're going to have to hand-code the serialization yourself.

blocks|key|4112300|text|只需使用两个write调用：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4112301|f.write+((LPBYTE)&towrite,+sizeof(TOWRITE));
f.write+((LPBYTE)&towrite.lpData,+towrite.datacount+*+sizeof(BYTE));|code-block|syntax|javascript|4112302|然后你可以再读一遍：|4112303|TOWRITE+towrite;
f.read+((LPBYTE)&towrite,+sizeof(TOWRITE));
towrite.lpData+=+(LPBYTE)+new+BYTE[towrite.datacount];
f.read+((LPBYTE)&towrite.lpData,+towrite.datacount+*+sizeof(BYTE));|4112304|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

just use two write calls:

<pre><code>f.write ((LPBYTE)&amp;towrite, sizeof(TOWRITE));
f.write ((LPBYTE)&amp;towrite.lpData, towrite.datacount * sizeof(BYTE));
</code></pre>

and then you can read it again with:

<pre><code>TOWRITE towrite;
f.read ((LPBYTE)&amp;towrite, sizeof(TOWRITE));
towrite.lpData = (LPBYTE) new BYTE[towrite.datacount];
f.read ((LPBYTE)&amp;towrite.lpData, towrite.datacount * sizeof(BYTE));
</code></pre>

blocks|key|2476434|text|typedef+struct+TOWRITE
{
+++DWORD+dwHeader;
+++WORD+datacount;
+++WORD+checksum;
+++LPBYTE+lpData;+//Put+the+ptr+at+the+end
}

//+-+sizeof(LPBYTE)+avoid+the+ptr+@+to+be+written
f.write(+(LPBYTE)&towrite,+sizeof(TOWRITE)+-+sizeof(LPBYTE));++

//+write+the+ptr+data.
//+sorry+I+don't+know+windows+C.
//+fix+the+size+of+the+array+element+:)
f.write(+towrite.lpData,+towrite.datacount+*+sizeof(????));++|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|2476435|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>typedef struct TOWRITE
{
 DWORD dwHeader;
 WORD datacount;
 WORD checksum;
 LPBYTE lpData; //Put the ptr at the end
}

// - sizeof(LPBYTE) avoid the ptr @ to be written
f.write( (LPBYTE)&amp;towrite, sizeof(TOWRITE) - sizeof(LPBYTE)); 

// write the ptr data.
// sorry I don't know windows C.
// fix the size of the array element :)
f.write( towrite.lpData, towrite.datacount * sizeof(????)); 
</code></pre>

blocks|key|2293892|text|使用这种方法可以避免有时由于结构填充而产生的冗余数据。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2293893|char*+data+=malloc(sizeof(towrite)-sizeof(LPBYTE)%2Bvar_data);
CopyMemory(+data,+towrite.dwHeader,+sizeof(DWORD)+);
CopyMemory(+data,+towrite.datacount,+sizeof(WORD)+);
CopyMemory(+data,+szTemp,+datalength);
CopyMemory(+data,+towrite.checksum,+sizeof(WORD)+);
f.write(+data,sizeof(towrite)-sizeof(LPBYTE)%2Bvar_data);|code-block|syntax|javascript|2293894|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Using this approach may avoid redundant data that sometimes come as a result of structure padding.

<pre><code>char* data =malloc(sizeof(towrite)-sizeof(LPBYTE)+var_data);
CopyMemory( data, towrite.dwHeader, sizeof(DWORD) );
CopyMemory( data, towrite.datacount, sizeof(WORD) );
CopyMemory( data, szTemp, datalength);
CopyMemory( data, towrite.checksum, sizeof(WORD) );
f.write( data,sizeof(towrite)-sizeof(LPBYTE)+var_data);
</code></pre>

blocks|key|4203689|text|我只是修改了我的代码|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4203690|typedef+struct+TOWRITE
{
+DWORD+dwHeader;
+WORD+datacount;
}

TOWRITE+towrite;
LPBYTE+lpData;
WORD+checksum;

ZeroMemory(+&towrite,+sizeof(+TOWRITE+));
lpData+=+(LPBYTE)+new+BYTE[256];

towrite.dwHeader+=+0xF1F1E1E1;
towrite.datacount+=+256;
cheksum+=+3849;
CopyMemory(+lpData,+szTemp,+256+);

.....

.....

.....

f.write(+(LPBYTE)&towrite,+sizeof(TOWRITE)+);
f.write(+(LPBYTE)&lpData,+datacount+);
f.write(+(LPBYTE)&checksum,+2+);
....
....
....
....|code-block|syntax|javascript|4203691|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Just i modified my code to 

<pre><code>typedef struct TOWRITE
{
 DWORD dwHeader;
 WORD datacount;
}

TOWRITE towrite;
LPBYTE lpData;
WORD checksum;

ZeroMemory( &amp;towrite, sizeof( TOWRITE ));
lpData = (LPBYTE) new BYTE[256];

towrite.dwHeader = 0xF1F1E1E1;
towrite.datacount = 256;
cheksum = 3849;
CopyMemory( lpData, szTemp, 256 );

.....

.....

.....

f.write( (LPBYTE)&amp;towrite, sizeof(TOWRITE) );
f.write( (LPBYTE)&amp;lpData, datacount );
f.write( (LPBYTE)&amp;checksum, 2 );
....
....
....
....
</code></pre>

I have A structure named TOWRITE. I want to write the contents the structure into a file. But one thing is size of a member of structure is unfixed. It depends on data received from another source. Is it possible to write structure by easy way. please refer below code snippet.

thanks

<pre><code>typedef struct TOWRITE
{
 DWORD dwHeader;
 WORD datacount;
 LPBYTE lpData;
 WORD checksum;
}

TOWRITE towrite;
ZeroMemory( &amp;towrite, sizeof( TOWRITE ));
towrite.lpData = (LPBYTE) new BYTE[256];

towrite.dwHeader = 0xF1F1E1E1;
towrite.datacount = 256;
towrite.cheksum = 3849;
CopyMemory( towrite.lpData, szTemp, 256 );

.....

.....

.....

f.write( (LPBYTE)&amp;towrite, sizeof(TOWRITE) );
....
....
....
....
</code></pre>

Unfixed structure in C/C++

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我有一个叫TOWRITE的建筑。我想把结构的内容写到一个文件中.但有一件事是结构成员的大小是不固定的。它取决于从其他来源收到的数据。有没有可能用一种简单的方式写出结构。请参考下面的代码片段。谢谢typedef struct TOWRITE{   DWORD dwHeader;   WORD datacount;   L...

问C/C++中的非固定结构
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问C/C++中的非固定结构EN