C语言模拟FIFO算法，随机生成320条指令，有四块物理块，为什么错了？ 为什么一般情况下，lru具有比fifo更好的性能
\u6211\u7684\u8f66\u662f\u5e7b\u901fH3\u7528\u7684\u662f195/60R15\u7684\u8f6e\u80ce\uff0c\u6211\u60f3\u7528205\u7684\u53ef\u4ee5\u5417\uff1f\u4f60\u597d\uff0c\u53ef\u4ee5\u4f7f\u7528\u3002\u795d\u4f60\u7528\u8f66\u6109\u5feb\u3002
\u8fd9\u53ef\u662fhen\u5b9d\u8d35\u7684\u554a
#include
#include
#include
#include
#define Bsize 4
typedef struct BLOCK//\u58f0\u660e\u4e00\u79cd\u65b0\u7c7b\u578b\u2014\u2014\u7269\u7406\u5757\u7c7b\u578b
{
int pagenum;//\u9875\u53f7
int accessed;//\u8bbf\u95ee\u5b57\u6bb5\uff0c\u5176\u503c\u8868\u793a\u591a\u4e45\u672a\u88ab\u8bbf\u95ee
}BLOCK;
int pc;//\u7a0b\u5e8f\u8ba1\u6570\u5668\uff0c\u7528\u6765\u8bb0\u5f55\u6307\u4ee4\u7684\u5e8f\u53f7
int n;//\u7f3a\u9875\u8ba1\u6570\u5668\uff0c\u7528\u6765\u8bb0\u5f55\u7f3a\u9875\u7684\u6b21\u6570
static int temp[320];//\u7528\u6765\u5b58\u50a8320\u6761\u968f\u673a\u6570
BLOCK block[Bsize]; //\u5b9a\u4e49\u4e00\u5927\u5c0f\u4e3a4\u7684\u7269\u7406\u5757\u6570\u7ec4
//*************************************************************
void init( ); //\u7a0b\u5e8f\u521d\u59cb\u5316\u51fd\u6570
int findExist(int curpage);//\u67e5\u627e\u7269\u7406\u5757\u4e2d\u662f\u5426\u6709\u8be5\u9875\u9762
int findSpace( );//\u67e5\u627e\u662f\u5426\u6709\u7a7a\u95f2\u7269\u7406\u5757
int findReplace( );//\u67e5\u627e\u5e94\u4e88\u7f6e\u6362\u7684\u9875\u9762
void display ( );//\u663e\u793a
void suijishu( );//\u4ea7\u751f320\u6761\u968f\u673a\u6570,\u663e\u793a\u5e76\u5b58\u50a8\u5230temp[320]
void pagestring( );//\u663e\u793a\u8c03\u7528\u7684\u9875\u9762\u961f\u5217
void OPT( );//OPT\u7b97\u6cd5
void LRU( );// LRU\u7b97\u6cd5
void FIFO( );//FIFO\u7b97\u6cd5
//*************************************************************
void init( )
{
for(int i=0;i<Bsize;i++)
{
block[i].pagenum=-1;
block[i].accessed=0;
pc=n=0;
}
}
//-------------------------------------------------------------
int findExist(int curpage)
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum == curpage )
return i;//\u68c0\u6d4b\u5230\u5185\u5b58\u4e2d\u6709\u8be5\u9875\u9762\uff0c\u8fd4\u56deblock\u4e2d\u7684\u4f4d\u7f6e
}
return -1;
}
//-------------------------------------------------------------
int findSpace( )
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum == -1)
return i;//\u627e\u5230\u7a7a\u95f2\u7684block\uff0c\u8fd4\u56deblock\u4e2d\u7684\u4f4d\u7f6e
}
return -1;
}
//-------------------------------------------------------------
int findReplace( )
{
int pos = 0;
for(int i=0; i<Bsize; i++)
{
if(block[i].accessed >block[pos].accessed)
pos = i;//\u627e\u5230\u5e94\u4e88\u7f6e\u6362\u9875\u9762\uff0c\u8fd4\u56deBLOCK\u4e2d\u4f4d\u7f6e
}
return pos;
}
//-------------------------------------------------------------
void display( )
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum != -1)
{ printf(" %02d",block[i].pagenum);}
}
cout<<endl;
}
//-------------------------------------------------------------
void suijishu( )
{ int flag=0;
cin>>pc;
cout<<"******\u6309\u7167\u8981\u6c42\u4ea7\u751f\u7684320\u4e2a\u968f\u673a\u6570\uff1a*******"<<endl;
for(int i=0;i<320;i++)
{
temp[i]=pc;
if(flag%2==0) pc=++pc%320;
if(flag==1) pc=rand( )% (pc-1);
if(flag==3) pc=pc+1+(rand( )%(320-(pc+1)));
flag=++flag%4;
printf(" %03d",temp[i]);
if((i+1)%10==0) cout<<endl;
}
}
//-------------------------------------------------------------
void pagestring( )
{
for(int i=0;i<320;i++)
{
printf(" %02d",temp[i]/10);
if((i+1)%10==0) cout<<endl;
}
}
//-------------------------------------------------------------
void OPT( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace ( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
for(int k=0;k<Bsize;k++)
{
for(int j=i;j<320;j++)
{
if(block[k].pagenum!= temp[j]/10)
{
block[k].accessed = 1000;
}//\u5c06\u6765\u4e0d\u4f1a\u7528\uff0c\u8bbe\u7f6e\u4e3a\u4e00\u4e2a\u5f88\u5927\u6570
else
{
block[k].accessed = j;
break;
}
}
}
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
}
}
}
cout<<"\u7f3a\u9875\u6b21\u6570:"<<n<<endl;
cout<<"\u7f3a\u9875\u7387:"<<(n/320.0)*100<<"%"<<endl;
}
//-------------------------------------------------------------
void LRU( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
}
}
else block[exist].accessed = -1;//\u6062\u590d\u5b58\u5728\u7684\u5e76\u521a\u8bbf\u95ee\u8fc7\u7684BLOCK\u4e2d\u9875\u9762accessed\u4e3a-1
for(int j=0; j<4; j++)
{block[j].accessed++;}
}
cout<<"\u7f3a\u9875\u6b21\u6570:"<<n<<endl;
cout<<"\u7f3a\u9875\u7387:"<<(n/320.0)*100<<"%"<<endl;
}
//-------------------------------------------------------------
void FIFO( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
block[position].accessed--;
}
}
for(int j=0; j<Bsize; j++)
block[j].accessed++;
}
cout<<"\u7f3a\u9875\u6b21\u6570:"<<n<<endl;
cout<<"\u7f3a\u9875\u7387:"<<(n/320.0)*100<<"%"<<endl;
}
//*************************************************************
void main( )
{
int select;
cout<<"\u8bf7\u8f93\u5165\u7b2c\u4e00\u6761\u6307\u4ee4\u53f7(0~320)\uff1a";
suijishu( );
cout<<"*****\u5bf9\u5e94\u7684\u8c03\u7528\u9875\u9762\u961f\u5217*******"<<endl;
pagestring( );
do
{
cout<<"****************************************"<<endl;
cout<<"------1:OPT 2:LRU 3:FIFO 4:\u9000\u51fa-----"<<endl;
cout<<"****************************************"<<endl;
cout<<" \u8bf7\u9009\u62e9\u4e00\u79cd\u9875\u9762\u7f6e\u6362\u7b97\u6cd5:";
cin>>select;
cout<<"****************************************"<<endl;
init( );
switch(select)
{
case 1:cout<<"\u6700\u4f73\u7f6e\u6362\u7b97\u6cd5OPT:"<<endl;
cout<<"*****************"<<endl;
OPT( );
break;
case 2:cout<<"\u6700\u8fd1\u6700\u4e45\u672a\u4f7f\u7528\u7f6e\u6362\u7b97\u6cd5LRU:"<<endl;
cout<<"**************************"<<endl;
LRU( );
break;
case 3:cout<<"\u5148\u8fdb\u5148\u51fa\u7f6e\u6362\u7b97\u6cd5FIFO:"<<endl;
cout<<"*********************"<<endl;
FIFO( );
break;
default: ;
}
}while(select!=4);
}
\u4f60\u8bd5\u8bd5\u53ef\u4ee5\u4e0d\uff0c\u5e94\u8be5\u6ca1\u95ee\u9898\u7684
\u8981\u6ce8\u610f\u8fd9\u662f\u7528C++\u7f16\u5199\u7684\uff0c\u4f60\u6539\u4e00\u4e0b\u5c31\u53ef\u4ee5\u7528\u4e86
#include
#include
#include
#include
#define Bsize 4
typedef struct BLOCK//声明一种新类型——物理块类型
{
int pagenum;//页号
int accessed;//访问字段，其值表示多久未被访问
}BLOCK;
int pc;//程序计数器，用来记录指令的序号
int n;//缺页计数器，用来记录缺页的次数
static int temp[320];//用来存储320条随机数
BLOCK block[Bsize]; //定义一大小为4的物理块数组
//*************************************************************
void init( ); //程序初始化函数
int findExist(int curpage);//查找物理块中是否有该页面
int findSpace( );//查找是否有空闲物理块
int findReplace( );//查找应予置换的页面
void display ( );//显示
void suijishu( );//产生320条随机数,显示并存储到temp[320]
void pagestring( );//显示调用的页面队列
void OPT( );//OPT算法
void LRU( );// LRU算法
void FIFO( );//FIFO算法
//*************************************************************
void init( )
{
for(int i=0;i<Bsize;i++)
{
block[i].pagenum=-1;
block[i].accessed=0;
pc=n=0;
}
}
//-------------------------------------------------------------
int findExist(int curpage)
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum == curpage )
return i;//检测到内存中有该页面，返回block中的位置
}
return -1;
}
//-------------------------------------------------------------
int findSpace( )
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum == -1)
return i;//找到空闲的block，返回block中的位置
}
return -1;
}
//-------------------------------------------------------------
int findReplace( )
{
int pos = 0;
for(int i=0; i<Bsize; i++)
{
if(block[i].accessed >block[pos].accessed)
pos = i;//找到应予置换页面，返回BLOCK中位置
}
return pos;
}
//-------------------------------------------------------------
void display( )
{
for(int i=0; i<Bsize; i++)
{
if(block[i].pagenum != -1)
{ printf(" %02d",block[i].pagenum);}
}
cout<<endl;
}
//-------------------------------------------------------------
void suijishu( )
{ int flag=0;
cin>>pc;
cout<<"******按照要求产生的320个随机数：*******"<<endl;
for(int i=0;i<320;i++)
{
temp[i]=pc;
if(flag%2==0) pc=++pc%320;
if(flag==1) pc=rand( )% (pc-1);
if(flag==3) pc=pc+1+(rand( )%(320-(pc+1)));
flag=++flag%4;
printf(" %03d",temp[i]);
if((i+1)%10==0) cout<<endl;
}
}
//-------------------------------------------------------------
void pagestring( )
{
for(int i=0;i<320;i++)
{
printf(" %02d",temp[i]/10);
if((i+1)%10==0) cout<<endl;
}
}
//-------------------------------------------------------------
void OPT( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace ( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
for(int k=0;k<Bsize;k++)
{
for(int j=i;j<320;j++)
{
if(block[k].pagenum!= temp[j]/10)
{
block[k].accessed = 1000;
}//将来不会用，设置为一个很大数
else
{
block[k].accessed = j;
break;
}
}
}
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
}
}
}
cout<<"缺页次数:"<<n<<endl;
cout<<"缺页率:"<<(n/320.0)*100<<"%"<<endl;
}
//-------------------------------------------------------------
void LRU( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
}
}
else block[exist].accessed = -1;//恢复存在的并刚访问过的BLOCK中页面accessed为-1
for(int j=0; j<4; j++)
{block[j].accessed++;}
}
cout<<"缺页次数:"<<n<<endl;
cout<<"缺页率:"<<(n/320.0)*100<<"%"<<endl;
}
//-------------------------------------------------------------
void FIFO( )
{
int exist,space,position ;
int curpage;
for(int i=0;i<320;i++)
{
if(i%100==0) getch( );
pc=temp[i];
curpage=pc/10;
exist = findExist(curpage);
if(exist==-1)
{
space = findSpace( );
if(space != -1)
{
block[space].pagenum = curpage;
display( );
n=n+1;
}
else
{
position = findReplace( );
block[position].pagenum = curpage;
display( );
n++;
block[position].accessed--;
}
}
for(int j=0; j<Bsize; j++)
block[j].accessed++;
}
cout<<"缺页次数:"<<n<<endl;
cout<<"缺页率:"<<(n/320.0)*100<<"%"<<endl;
}
//*************************************************************
void main( )
{
int select;
cout<<"请输入第一条指令号(0~320)：";
suijishu( );
cout<<"*****对应的调用页面队列*******"<<endl;
pagestring( );
do
{
cout<<"****************************************"<<endl;
cout<<"------1:OPT 2:LRU 3:FIFO 4:退出-----"<<endl;
cout<<"****************************************"<<endl;
cout<<" 请选择一种页面置换算法:";
cin>>select;
cout<<"****************************************"<<endl;
init( );
switch(select)
{
case 1:cout<<"最佳置换算法OPT:"<<endl;
cout<<"*****************"<<endl;
OPT( );
break;
case 2:cout<<"最近最久未使用置换算法LRU:"<<endl;
cout<<"**************************"<<endl;
LRU( );
break;
case 3:cout<<"先进先出置换算法FIFO:"<<endl;
cout<<"*********************"<<endl;
FIFO( );
break;
default: ;
}
}while(select!=4);
}
你试试可以不，应该没问题的
要注意这是用C++编写的，你改一下就可以用了
绛旓細2涓▼搴忕殑鍖哄埆灏卞湪浜巌f閲岀殑鏉′欢澶氫簡涓嫭鍙枫傜涓涓▼搴廼f(checksum!=FIFO[count]&0xff) 锛!= 鐨勪紭鍏堢骇楂樹簬 &锛屾墍浠ュ厛鎵цchecksum!=FIFO[count]鍒ゆ柇锛屼唬鍏ヤ綘缁欑殑鏁版嵁缁撴灉涓1锛1 鍐嶄笌 0xff 鎸変綅姹備笌缁撴灉鏄1锛岀粨鏋渞esult=FALSE;绗竴涓▼搴廼f(checksum!=(FIFO[count]&0xff)) 锛屽浜嗕竴涓嫭鍙...
绛旓細閽堝妯℃嫙杩涚▼锛屽埄鐢–PU璋冨害绠楁硶杩涜璋冨害 杩涜绠楁硶璇勪环锛岃绠楀钩鍧囧懆杞椂闂村拰骞冲潎绛夊緟鏃堕棿 瑕佹眰锛氳皟搴︽墍闇鐨勮繘绋嬪弬鏁扮敱杈撳叆浜х敓 鎵嬪伐杈撳叆 闅忔満鏁颁骇鐢 杈撳嚭璋冨害缁撴灉 杈撳嚭楦℃幐鎯刀鐢欓潪杞ㄧ煶鎲ㄥ皢绠楁硶璇勪环鎸囨爣 2璁捐棰樼洰锛氳櫄鎷熷唴瀛 (椤甸潰缃崲绠楁硶鐨勬ā鎷熷疄鐜)鍏蜂綋鍐呭锛氱紪鍐绠楁硶锛瀹炵幇椤甸潰缃崲绠楁硶FIFO銆丩RU 閽堝鍐呭瓨...
绛旓細//鐢ㄥ湪S1涓叆鏍妯℃嫙鍏ラ槦鍔ㄤ綔锛岀畝鍗 enqueue(stack s1,elemtp x){ PUSH锛坰1 锛 x锛;} //鍑洪槦姣旇緝楹荤儲锛屼篃鏄棰樼殑闅剧偣 dequeue(stack s2, stack s1){ while(!Sempty(S1))//鎶奡1涓殑鍏冪礌鍏ㄩ儴瀵煎叆S2 { POP(S1,x) ;PUSH(S2,x);} POP锛圫2锛寈锛;//妯℃嫙鍑洪槦 while(!Sempty(S2))//...
绛旓細閾捐〃鍜岄槦鍒楀彲浠ョ敤浜"楗簵鐐硅彍","ktv鐐规瓕",鐐瑰ソ鑿,"楗簵鐐硅彍"鐨勬椂鍊欏彲浠ユ洿鏂拌嚜宸辩殑璁㈣彍淇℃伅鎴栧彇娑堝畾鍗,鍏堢偣鍏堜笂;鏍堝彲浠ョ敤鍦"闆嗚绠辫揣鐗╂彁鍙"涓,鏂板埌鐨勮揣鐗╁緢鏈夊彲鑳藉帇鍦ㄤ箣鍓嶇殑璐х墿涓,鍙栬揣鐗╁繀椤诲厛鎷夸笅鏈涓婇潰鐨勮揣鐗,浣撶幇浜嗘墍璋"鍚庤繘鍏堝嚭"鐨勬濇兂,涔熷彲浠ョ敤"浠庤繍閽炶溅涓彇閽"杩欎簺浜嬫儏鏉ヤ綋鐜版爤 ...
绛旓細绠楁硶鐨勫熀鏈绱:涓鏄鏁版嵁瀵硅薄鐨勮繍绠楀拰鎿嶄綔;浜屾槸绠楁硶鐨勬帶鍒剁粨鏋勩 鎸囦护绯荤粺:涓涓绠楁満绯荤粺鑳芥墽琛岀殑...闃熷垪鏄滃厛杩涜鍑衡(fifo)鎴栤滃悗杩涘悗鍑衡(lilo)鐨勭嚎鎬ц〃銆 闃熷垪杩愮畻鍖呮嫭(1)鍏ラ槦杩愮畻:浠庨槦灏炬彃鍏...C璇█鐨勮瘽涔熸湁鐐,涓や釜濉┖棰樼殑鏍峰瓙銆 涓婄骇娴嬭瘯鍢涘緢瀹规槗鐨,C璇█缂栫▼ok鐨勮瘽鍙兘鎷挎弧鍒嗗摝銆 宸茶禐...
绛旓細鑰宎pp_fifo.c閲岄潰瀵瑰嚱鏁癮pp_fifo_put杩涜浜嗗畾涔夛紙鍏蜂綋鍑芥暟鍐呭锛夈傛墍浠ュ湪test1.c閲岄潰鍙槸寮曠敤鍖呭惈app_fifo.h杩欎釜澶存枃浠剁殑璇濓紝鍥犱负鍑芥暟app_fifo_put娌℃湁琚畾涔夛紝鍚庢潵鎵ц杩欎釜鍑芥暟鏃跺氨浼氭姤閿 undefined symbol app_fifo_put锛堟湭瀹氫箟绗﹀彿app_fifo_put锛夈傚鏋滄槸寮曠敤鍖呭惈app_fifo.c锛灏变笉浼氭姤閿欙紙鍥犱负鍑芥暟...
绛旓細闃熷垪鏄竴绉嶇壒娈婄殑绾挎ц〃銆傞槦鍒椾竴绉嶅彲浠ュ疄鐜扳滃厛杩涘厛鍑衡濈殑瀛樺偍缁撴瀯锛屽嵆鈥滀竴绔叆锛屼竴绔嚭鈥濓紝闃熼(front)鍑洪槦锛岄槦灏(rear)鍏ラ槦锛岃嫢front鎸囧悜闃熼锛屽垯rear鎸囧悜闃熷熬鏈鍚庝竴涓湁鏁堝厓绱犵殑涓嬩竴涓厓绱狅紱鑻ear鎸囧悜闃熷熬锛屽垯front鎸囧悜闃熼绗竴涓湁鏁堝厓绱犵殑涓嬩竴涓厓绱犮傞槦鍒楃壒娈婁箣澶勫湪浜庡畠鍙厑璁稿湪琛ㄧ殑鍓嶇锛...
绛旓細濡傛灉浣犵敤vc锛#include<deque>灏卞ソ浜嗭紝浣嗘槸娉ㄦ剰瑕佸姞涓妘sing naemspace std锛涙垜鏄綋浣犵敤鐨刢++鐨凷TL锛孲TL涓病鏈夌湡姝ｇ殑闃熷垪鍜屾爤锛屼粬浠兘鏄氳繃瀵瑰弻绔槦鍒楃殑鏀归犲緱鍒扮殑锛屾墍浠ュ寘鍚殑鏂囦欢鍙兘鍜屼綘鎯崇殑涓嶄竴鏍枫傝屼笖杩欎簺澶存枃浠堕兘娌℃湁.h缁撳熬锛佸緢鐗瑰埆 濡傛灉浣犱笉鏄痸c锛屽綋鎴戞病璇 ...
绛旓細寰幆闃熷垪鏈韩鏄竴绉嶉『搴忓瓨鍌ㄧ粨鏋勶紝鑰屽惊鐜垪琛ㄦ槸涓绉嶉摼寮忓瓨鍌ㄧ粨鏋勩備袱鑰呬箣闂存槸骞崇骇鍏崇郴銆傜嚎鎬ч摼琛ㄦ槸绾挎ц〃鐨勯摼寮忓瓨鍌ㄧ粨鏋勶紝鍖呮嫭鍗曢摼琛紝鍙岄摼琛紝寰幆閾捐〃绛夈傞槦鍒楃殑椤哄簭瀛樺偍缁撴瀯涓鑸噰鐢ㄥ惊鐜槦鍒楃殑褰㈠紡銆傚惊鐜槦鍒楃殑鎿嶄綔鏄寜鏁扮粍鍙栨懜杩愮畻鐨勶紝鎵浠ユ槸椤哄簭瀛樺偍锛岃屽惊鐜摼琛ㄦ湰韬氨鏄敹灏剧浉杩炵殑锛屾墍浠ュ惊鐜摼琛ㄤ笉鏄惊鐜...
绛旓細鍥惧儚璇嗗埆绠楁硶寰堥噸瑕侊紝寮鍙戠畻娉曚竴鑸敤matlab绛夋暟瀛﹁蒋浠朵豢鐪燂紝鍏惰瑷鍜c璇█宸笉澶氥俤sp鑺墖鍜屽崟鐗囨満宸埆杩樻槸寰堝ぇ鐨 鎵璋撳崟鐗囨満灏辨槸鍦ㄤ竴鍧楄姱鐗囦笂闆嗘垚浜哻pu銆乺am銆乺om(eprom鎴杄eprom)銆佹椂閽熴佸畾鏃/璁℃暟鍣ㄣ佸绉嶅姛鑳界殑涓茶鍜屽苟琛宨/o鍙ｃ傞櫎浜嗕互涓婂熀鏈姛鑳藉锛屾湁鐨勮繕闆嗘垚鏈塧/d銆乨/a锛岀敋鑷虫棤绾块氫俊绛夊姛鑳斤紙...
