DOS的文件分配表策略的模拟实现

#include <windows.h>

#include <iostream>

#include <time.h>

#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#define Request_num 13 //循环次数

using namespace std;

int filesize; //簇数

int start; //起始

struct File *next;

}File, *FileLink;

//设置输出字体的颜色 textcolor(15);//白 textcolor(12); textcolor(10);

void textcolor (int color)

{

SetConsoleTextAttribute (GetStdHandle (STD_OUTPUT_HANDLE), color);

}

//初始化 FAT 数组

}

//检查数组空闲空间大小

int CheckSpace(int size)

{

int i, j, space=0;

for(i = 0; i < 30; i++)

for(j = 0; j < 10; j++)

{

if(FAT[i][j] == -1) space++;

if(space >= size) return 1;

}

return -1;

}

//随机产生删除的结点（即随机产生删除第几个文件）

int xRandom(int length)

int number;

//随机生成文件大小

{

int random1, random2, random;

if(iname % 10 == 0)

random1 = -2 + (rand() % 15);

else if(iname % 10 == 1)

random1 = -5 + (rand() % 20);

random1 = 4 + (rand() % 10);

else if(iname % 10 == 6)

random1 = -6 + (rand() % 25);

else if(iname % 10 == 7)

random1 = -2 + (rand() % 15);

else if(iname % 10 == 8)

random1 = 5 + (rand() % 10);

else if(iname % 10 == 9)

random1 = -3 + (rand() % 20);

random2 = -5 + (rand() % 15);

random = random1 + random2;

if(random < 0) random += 15;

if(random <= 2) random += 3;

return random;

}

//分配簇

{

flag++;

if(flag2 == 1)

{

FAT[k][l] = i*10 + j + 1;

}

if(flag1 == 0)

{

flag1 = 1;

if(flag >= size)

{

FAT[i][j] = 0;

flag2 = 0;

return first;

}

}

}

return first;