基于内存缓冲区的流媒体数据缓存(5)

} //将缓冲区中的数据聚集到一个存储体中 remainer=remaindata(0,poutdata);

fseek(targetfilepoint,outdataoffset,SEEK_SET); fwrite(poutdata,remainer,1,targetfilepoint); outdataoffset=outdataoffset+remainer; cleardata(remainer);

}//输出缓冲区剩余数据函数；处理尾数据不需要endnumber的更新

int program::computer(int baglength){ int totaldata=0; int temp; b* help; help=buffer;

while(help!=NULL) {

totaldata=totaldata+help->arra.size(); help=help->next; }

temp=512*1024-totaldata; if(temp>=baglength) return 0;

return (baglength-temp); }//judge缓冲区大小函数

int program::forceout(int baglength) {

int remainer; int judge;

char* poutdata=NULL; b* help=NULL; judge=0; help=buffer;

while(help!=NULL) {

if((endnumber==help->offset)&&(help->arra.size()!=0)) {

help->judge=1;

poutdata=help->arra.data(); remainer=help->arra.size();

endnumber=endnumber+remainer; if(originaltwo.size()<1)

originaltwo.push_back(help->offset);//获取疑似第一个输出到目的文件中的数据包的首元素偏移量

judge=1;break; }

help=help->next; }//输出连续数据 if(judge==1) {

fseek(targetfilepoint,outdataoffset,SEEK_SET); fwrite(poutdata,remainer,1,targetfilepoint); outdataoffset=outdataoffset+remainer; cleardata(remainer); return 1;

}//如果连续数据存储体标记成功，数据输出 help=buffer;

while(help!=NULL) {

if(help->arra.size()!=0) {

help->judge=1;

poutdata=help->arra.data(); remainer=help->arra.size();

endnumber=help->offset+remainer; if(originaltwo.size()<1)

originaltwo.push_back(help->offset);//获取疑似第一个输出到目的文件中的数据包的首元素偏移量 judge=1;break; }

help=help->next; }

if(judge==1) {

fseek(targetfilepoint,outdataoffset,SEEK_SET); fwrite(poutdata,remainer,1,targetfilepoint); outdataoffset=outdataoffset+remainer; cleardata(remainer); return 1;

}//如果不连续数据存储体标记成功，数据输出 return 0; }//强制输出函数

void program::receivedata(int indataoffset,int length,char* databag){ b* helpone;b* helptwo;int totalone,totaltwo; helptwo=buffer;

helpone=buffer;//初始化两个辅助指针 while(helpone!=NULL)

{

totalone=helpone->arra.size()+helpone->offset;//计算当前存储体下一个数据的偏移量 totaltwo=length+indataoffset;//计算当前数据包下一个数据的偏移量 if(indataoffset==totalone) {

b* follow;follow=helpone->next; int total=0;

for(int i=0;i

helpone->arra.push_back(databag[i]); total=helpone->arra.size()+helpone->offset; if(follow!=NULL) {

while(total==follow->offset) {

for(unsigned int i=0;iarra.size();i++)

helpone->arra.push_back(follow->arra[i]); helpone->next=follow->next; delete follow; …… 此处隐藏：318字，全部文档内容请下载后查看。喜欢就下载吧 ……