计算机系统基础2:实验1 用C语言编写程序模拟Cache
提示:根据《计算机系统基础》 中给出的解释来解决更容易
题目要求:
- 能够描述利用高速缓存加速数据存取的过程。
- 能够使用高级语言仿真高速缓存
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
//cache结构体数组录入 前6位是标记位 78位是cache组号 后面两位是块内地址位
struct cache{
char Valid;
char CacheTag[7];
char CacheData[34];
int count;
}cae[4][4]={
{
{'1',"000000","00000000000000000000000000000001",1},
{'1',"000001","00000000000000000000000000000010",2},
{'1',"000010","00000000000000000000000000000011",0},
{'1',"000011","00000000000000000000000000000100",3}
},{
{'0',"000000","00000000000000000000000000000101",3},
{'1',"000001","00000000000000000000000000000110",0},
{'1',"000010","00000000000000000000000000000111",1},
{'1',"000011","00000000000000000000000000001000",2}
},{
{'0',"000000","00000000000000000000000000001001",3},
{'1',"000001","00000000000000000000000000001010",1},
{'1',"000010","00000000000000000000000000001011",2},
{'1',"000011","00000000000000000000000000001100",0}
},{
{'0',"000000","00000000000000000000000000001101",3},
{'1',"000001","00000000000000000000000000001110",2},
{'1',"000010","00000000000000000000000000001111",1},
{'1',"000011","00000000000000000000000000000000",0}
}
};
//count更新函数,具体是把一组中比[z][h]行count小的count加1,[z][h]行count变0
void Count(int z,int h){
int j;
for(j = 0;j < 4;j++){
if(cae[z][j].count<3){
cae[z][j].count++;
}
}
cae[z][h].count = 0;
}
char* Cache(char binary[]){
//int w,i,t = 4,c,o;
int w,t = 4,i,c = -1,o = -1;//w是组数 t记录w组中的空闲行号
char *sc;
sc = (char *)malloc(36);//动态分配
strcpy(sc,"10001000100010001111111111111111");//分配固定主存值
w = (binary[6]-'0')*2+(binary[7]-'0');//算出组号 (0 1 2 3)
char binary1[6] ;
strncpy(binary1, binary, 6);//把binary前六位截取到 binary1
for(i = 0;i<4;i++){
//等于0说明binary1等于CacheTag 同时有效位为'1'
if(strcmp(binary1, cae[w][i].CacheTag) == 0 && cae[w][i].Valid =='1'){
c = 1; //命中为1
Count(w,i);
printf("测试命中!\n");
printf("%s\n",cae[w][i].CacheData);
}
if((cae[w][i].Valid - '0') == 0){
t = i;//如果有空闲行,记录是第几行为空闲行
}
if(cae[w][i].count == 3){
o = i;//记录第几行count为3
}
}
if(t == 4&&c != 1){
printf("测试未命中且没有空闲行。\n");//如果有空闲行会等于1/2/3,等于4说明无空闲
Count(w,o);//count更新
strcpy(cae[w][o].CacheTag,binary1) ;
strcpy(cae[w][o].CacheData,sc);//没有空闲行就将最近最少使用的行来替换固定主存值 即此组count=3的行
printf("%s\n",sc);
}if(t != 4&&c != 1){
printf("测试未命中且有空闲行。\n");//t不为4,并且不命中
Count(w,t); //count更新
strcpy(cae[w][t].CacheTag,binary1);
strcpy(cae[w][t].CacheData,sc);//
cae[w][t].Valid = 1+'0';//空闲行V变成1
printf("%s\n",sc);
}
return sc;
}
int main(int argc, char *argv[]) {
char binary[10];
int i,j;
for(i = 0;i < 3;i++){//输入3个测试用例,运行完3个再结束
printf("Test%d:",i+1);
scanf("%s",binary);
char *sc;
sc = Cache(binary);//输入3个测试用例一起,因为测试用例3count更新了两次,所以3个测试用例要一起输入
}
printf("\ncache数据:\n");
printf("valid TLBTag cacheData count\n");
for(i = 0;i<2;i++){
for(j = 0;j<4;j++){
printf("%c %s %s %d",cae[i][j].Valid,cae[i][j].CacheTag,cae[i][j].CacheData,cae[i][j].count);//输出0 1组更新后的cache
printf("\n");
}
}
return 0;
}
测试举例:
提示:这个我在Windows上的dev c++运行是没有问题的,但是在macos 的 Xcode上运行会出现bug,目前我没有解决!
总结:
秘诀:一定要看书,一定要看书!!
那什么我C语言基础比较差,所以这个如果理解了原理再做起来是很快的,B站的搜的袁春风老师的课就很好理解!