? ? ? ?最近在工作中遇到需要將程序中的數(shù)據(jù)存到文件中，等下次開(kāi)機(jī)可以讀出來(lái)，我想到最好是可以結(jié)構(gòu)化的存儲(chǔ)，最好可以支持鍵值查詢和匹配。本來(lái)想用xml實(shí)現(xiàn)這個(gè)功能。可是我用的交叉編譯工具不支持xml解析器的交叉編譯。于是我就只好自己利用周末的時(shí)間研究了一波。

????? ?現(xiàn)在在以經(jīng)實(shí)現(xiàn)了基本的存儲(chǔ)和讀取功能，主要用的是文件流相關(guān)的操作函數(shù)實(shí)現(xiàn)的，像

????????fopen

????????fprintf

????????fwrite

????????flseek

????????fscanf

????????fread

????????fclose

我的想法是之間利用fwrite存結(jié)構(gòu)體的方式，在結(jié)構(gòu)體之間利用'$'符和‘>’符分割開(kāi)方便監(jiān)測(cè)，當(dāng)然你存儲(chǔ)的結(jié)構(gòu)體元素不能包含指針，因?yàn)橹羔槾娴轿募惺菦](méi)有意義的。我的實(shí)現(xiàn)中數(shù)據(jù)結(jié)構(gòu)體中必須包含名為name的字符數(shù)組，這有利于后期鍵值匹配的實(shí)現(xiàn)。

????????廢話少說(shuō)，下面是我的實(shí)現(xiàn)：

fwsStruct.c

#include?
#include?
#include?"fwsStruct.h"

Head?*creat_head(void)
{
	Head?*head?=?(Head?*)malloc(sizeof(Head));
	head->next?=?NULL;
	return?head;
}

Node?*creat_node(void)
{
	return?(Node?*)malloc(sizeof(Node));
}

void?list_append(Head?*head,Node?*node)
{
	Node?*temp;
	if(head->next?==?NULL)
	{
		head->next?=?node;
		node->next?=?NULL;
		return;
	}
	else
		temp?=?head->next;
	while(temp->next?!=?NULL)
	{
		temp?=?temp->next;
	}
	temp->next?=?node;
	node->next?=?NULL;
}

void?list_insert(Node?*p,Node?*node)
{
	node->next?=?p->next;
	p->next?=?node;
}

void?list_delete(Node?*p)
{
	Node?*temp?=?p->next;
	p->next?=?p->next->next;
	free(temp);
}

Head?*fwsStruct_perser(const?char?*path,?const?char?*mode,?void?*data,?size_t?size)
{
	FILE?*fp;
	char?ch;
	Node?*node;
	Head?*head?=?creat_head();
	if(head?==?NULL)
		return?NULL;
	if((fp?=?fopen(path,mode))?==?NULL)
	{
		return?NULL;
	}
	while((ch?=?fgetc(fp))?>=?0)
	{
		if(ch?==?'$')
		{
			node?=?creat_node();
			data?=?malloc(size);
			if((node?!=?NULL)&&(data?!=?NULL))
			{
				if(fwsStruct_read(fp,data,size)?==?1)
				{
					node->data?=?data;
					list_append(head,node);
				}
				else
					continue;
			}
		}
	}
	fclose(fp);
	return?head;
}


int?fwsStruct_write(FILE?*fp,?void?*data,size_t?size)
{
	fprintf(fp,"$\n");
	if((fwrite(data,size,?1,?fp)?\n");
	return?1;
}

size_t?fwsStruct_read(FILE?*fp,?void?*data,?size_t?size)
{
	fscanf(fp,"\n");
	return?fread(data,size,?1,?fp);
}

size_t?fwsStruct_append(FILE?*fp,?void?*data,?size_t?size)
{
	if(fseek(fp,SEEK_END,0)?
#include?

typedef?struct?node
{
	struct?node?*next;
	void????????*data;
}Node;

typedef?struct?
{
	Node?*next;
}Head;

Head?*creat_head(void);
Node?*creat_node(void);
void?list_append(Head?*head,Node?*node);
void?list_insert(Node?*p,Node?*node);
void?list_delete(Node?*p);

Head?*fwsStruct_perser(const?char?*path,?const?char?*mode,?void?*data,?size_t?size);
int?fwsStruct_write(FILE?*fp,?void?*data,?size_t?size);
size_t?fwsStruct_read(FILE?*fp,?void?*data,?size_t?size);
size_t?fwsStruct_append(FILE?*fp,?void?*data,?size_t?size);

#endif

寫(xiě)入結(jié)構(gòu)體的測(cè)試代碼：
#include?
#include?
#include?
#include?"fwsStruct.h"

struct?work
{
	char?name[10];
	char?msg[100];
	int?id;
};

int?main()
{
	struct?work?wk;
	FILE?*fp;
	int?i;

	strcpy(wk.name,"wang");
	strcpy(wk.msg,"hello?world!");
	wk.id?=?10;

	if((fp?=?fopen("./batt.struct","w+"))?==?NULL)
	{
		printf("The?file?%s?can?not?be?opened?or?not?exit.\n","batt");
		return?0;
	}
	for(i?=?0;?i?
#include?
#include?"fwsStruct.h"
struct?work
{
	char?name[10];
	char?msg[100];
	int?id;
};

int?main()
{
	struct?work?*wk;
	Node?*node;
	Head?*head?=?creat_head();
	head?=?fwsStruct_perser("./batt.struct","r",wk,sizeof(struct?work));
	node?=?creat_node();
	node?=?head->next;
	while(node?!=?NULL)
	{
		wk?=?(struct?work?*)node->data;
		printf("%s\n%s\n%d\n",wk->name,wk->msg,wk->id);
		node?=?node->next;
	}
	return?0;
}

由于時(shí)間比較緊，沒(méi)有時(shí)間寫(xiě)注釋。另外鍵值匹配還沒(méi)有實(shí)現(xiàn)。