C++实现死锁的监测

C++实现死锁的监测

#include"iostream"

#include"fstream"

#include"vector"

#include"windows.h"

using namespace std;

vector have[500]; //每个进程已经有的资源

vector want[500]; //各个进程想要的资源

int pro_size; //进程数

int res_size; //资源种类数

int res[500]; //每类资源的个数

int work[500]; //当前可用资源数

vector Deadlock;

bool* visited;

bool* Dead_res;

void DeadlockChain(int beg){

visited[beg] = true;

cout << "Process:" << beg << endl;

for (int i = 0; i < want[beg].size(); i++)

for (int j = 0; j < Deadlock.size(); j++)

for (int k = 0; k < have[Deadlock[j]].size(); k++)

if (have[Deadlock[j]][k] == want[beg][i]){

Dead_res[want[beg][i]] = true;

if (!visited[j])

DeadlockChain(j);

}

for (int t = 0; t < have[beg].size(); t++)

for (int j = 0; j < Deadlock.size(); j++)

for (int k = 0; k < want[Deadlock[j]].size(); k++) if (want[Deadlock[j]][k] == have[beg][t]){

Dead_res[have[beg][t]] = true; if (!visited[j])

DeadlockChain(j);

}

}

void read_data(){

ifstream in;

in.open("D://a.txt");

if (!in)

cout << "FILE OPEN FAILED!" << endl;

memset(res, 0, 500);

memset(work, 0, 500);

//**********************************************

//Read res

in >> res_size;

if (res_size > 500){

cout << "Number of res should be small than 500" << endl;

exit(-1);

}

for (int i = 0; i < res_size; i++){

int temp;

in >> temp;

if (temp < 0){

cout << "Illegal No. of res!" << endl;

cout << "Please check your input data!" << endl;

exit(-1);

}

res[i] = work[i] = temp;

}

//************************************************

//Read pro

in >> pro_size;

if (pro_size > 500){

cout << "Number of pro should be small than 500" << endl;

exit(-1);

}

for (int k = 0; k < pro_size; k++){

int num;

in >> num;

int have_size;

in >> have_size;

for (int i = 0; i < have_size; i++){

int temp;

in >> temp;

if (temp >= res_size){

cout << "illegal res No.!" << endl;

cout << "Please check your input data!" << endl;

exit(-1);

}

work[temp]--;

if (work[temp] < 0){

cout << "Impossible res dispatch situation!" << endl;

cout << "Please check your input data!" << endl;

exit(-1);

}

have[num].push_back(temp);

}

//-------------------------------------------------------- int want_size;

in >> want_size;

for (int j = 0; j < want_size; j++){

int temp;

in >> temp;

if (temp >= res_size){

cout << "illegal res No.!" << endl;

cout << "Please check your input data!" << endl;

exit(-1);

}

want[num].push_back(temp);

}

}

}

//**********************************************************

void Draw(){

HWND hWnd = FindWindow("ConsoleWindowClass", NULL);

HDC hDc = GetDC(hWnd);

HPEN hPen1 = CreatePen(PS_SOLID, 2, 0x000000FF);//生成红线

HPEN hPen2 = CreatePen(PS_SOLID, 2, 0x0000FF00);//生成蓝线

SelectObject(hDc, hPen1);

int i;

for (i = 0; i < res_size; i++){

Ellipse(hDc, i * 100, 0, i * 100 + 50, 50);

char s[5];

s[0] = 'R';

s[1] = i + 48;

s[2] = '/0';

TextOut(hDc, i * 100 + 20, 25, s, 2);

for (int k = 0; k < res[i]; k++)

Ellipse(hDc, i * 100 + k * 10 + 5, 10, i * 100 + k * 10 + 15, 20);

}

for (i = 0; i < pro_size; i++){

Rectangle(hDc, i * 100, 100, i * 100 + 50, 150);

char s[5];

s[0] = 'P';

s[1] = i + 48;

s[2] = '/0';

TextOut(hDc, i * 100 + 20, 125, s, 2);

}

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

cout << endl;

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

for (int k = 0; k < res_size; k++){

int cnt = 5;

int j;

for (j = 0; j < have[i].size(); j++){

if (have[i][j] == k){

SelectObject(hDc, hPen2);

MoveToEx(hDc, i * 100 + cnt, 100, NULL);

LineTo(hDc, k * 100 + cnt, 50);

cnt += 10;

}

cnt = 5;

for (j = 0; j < want[i].size(); j++){

if (want[i][j] == k){

SelectObject(hDc, hPen1);

MoveToEx(hDc, i * 100 + 50 + cnt, 100, NULL);

LineTo(hDc, k * 100 + cnt, 50);

cnt -= 10;

}

}

}

}

//**********************************************************

void ers(int i){

system("pause");

HWND hWnd = FindWindow("ConsoleWindowClass", NULL);

HDC hDc = GetDC(hWnd);

HPEN hPen = CreatePen(PS_SOLID, 2, 0x00000000);

SelectObject(hDc, hPen);

for (int k = 0; k < res_size; k++){

int cnt = 5;

int j;

for (j = 0; j < have[i].size(); j++){

if (have[i][j] == k){

MoveToEx(hDc, i * 100 + cnt, 100, NULL);

LineTo(hDc, k * 100 + cnt, 50);

cnt += 10;

}

}

cnt = 5;

for (j = 0; j < want[i].size(); j++){

if (want[i][j] == k){

MoveToEx(hDc, i * 100 + 50 + cnt, 100, NULL);

LineTo(hDc, k * 100 + cnt, 50);

cnt -= 10;

}

}

}

}

//**********************************************************

void predigest(){

Draw();

bool finish[500]; //记录进程是否完成

for (int index = 0; index < pro_size; index++){

if (want[index].size() != 0){

finish[index] = false;

else{

finish[index] = true;

ers(index);

for (int i = 0; i < have[index].size(); i++)

work[have[index][i]]++;

} //此时就可以回收资源

}

bool flag;

do{

flag = false;

for (int i = 0; i < pro_size; i++)

if (!finish[i]){

int temp[500];

memset(temp, 0, 500);

for (int k = 0; k < want[i].size(); k++){

temp[want[i][k]]++;

}

bool ok = true;

for (int j = 0; j < res_size; j++)

if (temp[j] > work[j]){

ok = false;

break;

}//可以分配？

if (ok){

ers(i);

for (int t = 0; t < have[i].size(); t++){

work[have[i][t]]++;

} //回收资源

have[i].clear();

finish[i] = true;

flag = true;

}

}

} while (flag);

for (int i = 0; i < pro_size; i++)

if (finish[i] == false)

Deadlock.push_back(i);

if (Deadlock.size() != 0){

cout << "DeadLock has happened!" << endl << endl;

cout << "The processes & resources related to the deadlock is: " << endl;

visited = new bool[Deadlock.size() + 5]; //use to id wheather the pro is visited DFS

memset(visited, 0, Deadlock.size() + 5);

Dead_res = new bool[res_size + 5];

for (int i = 0; i < Deadlock.size(); i++){

if (!visited[i]){

memset(Dead_res, 0, res_size + 5);

DeadlockChain(i);

cout << "Resource: ";

for (int j = 0; j < res_size; j++)

if (Dead_res[j])

cout << j << " ";

}

cout << endl;

}

}

else

cout << "All process had execued!" << endl; }

int main()

{

read_data();

predigest();

return 0;

}