实现一个进程管理子系统-Linux课程设计1

程序源代码
#include <iostream>
#include <stdio.h>
using namespace std;
class queuenode
{
  friend class queue;
private:
  char data;
  queuenode* link;
  queuenode(char d = 0, queuenode* l = NULL) : data(d), link(l) {}
};
class queue
{
public:
  queue() : rear(NULL), front(NULL) {};
  ~queue();
  void enqueue(char& item);
  char dequeue();
  void del(char item);
  void display();
  int find(char item);
  int isempty() { return front == NULL; }
private:
  queuenode* front, * rear;
};
queue::~queue()
{
  queuenode* p;
  while (front != NULL)
  {
    p = front;
    front = front->link;
    delete p;
  }
}
void queue::enqueue(char& item)
{
  if (front == NULL)
    front = rear = new queuenode(item, NULL);
  else
    rear = rear->link = new queuenode(item, NULL);
}
char queue::dequeue()
{
  queuenode* p = front;
  char f = p->data;
  front = front->link;
  delete p;
  return f;
}
void queue::display()
{
  queuenode* p;
  p = front;
  while (p != NULL)
  {
    cout << p->data << "->";
    p = p->link;
  }
  cout << "NULL";
}
int queue::find(char item)
{
  queuenode* w;
  w = front;
M:
  while (w != NULL)
  {
    if (item == w->data)
    {
      return 1;
      break;
    }
    else
    {
      w = w->link;
      goto M;
      return 0;
    }
  }
  if (w == NULL)
    return 0;
}
void queue::del(char item)
{
  queuenode* q, * b;
  q = front;
  while (q->data != item)
  {
    b = q;
    q = q->link;
  }
  if (q == front)
  {
    front = front->link;
    delete q;
  }
  else if (q == rear)
  {
    rear = b;
    rear->link = NULL;
    delete q;
  }
  else
  {
    b->link = q->link;
    delete q;
  }
}
int main()
{
  int n;
  char a;
  cout << "\n[-----------操作系统之进程管理模拟系统（先来先服务算法）------------]\n"
    << endl;
  queue execute, ready, clog; //执行，就绪，阻塞
  cout << "\n[-------请用户输入进程名及其到达cpu的顺序（结束进程数请输入x）------]\n"
    << endl;
  char r;
  r = 'x';
  for (int i = 0;; i++)
  {
    char e[100];
    cout << "输入进程名:"
      << " ";
    cin >> e[i];
    if (e[i] != r)
      ready.enqueue(e[i]);
    else
      break;
  }
A:
  cout << "\n  [------------请用户选择操作------------]\n";
  cout << "\n [1、执行进程……2、将阻塞队列中进程调入就绪队列………]\n";
  cout << "\n [3、封锁进程…………………4、结束进程 …………………]\n";
  cout << "\n [5、退出程序………………………………………………… ]\n选项： ";
  cin >> n;
  if (n == 1)
  {
    if (!execute.isempty())
    {
      cout << "已经有进程在执行！,此操作不能执行\n";
      char w;
      cout << endl;
      cout << "如果要继续请输入#；如果要退出按其它任意键 " << endl;
      cout << "要选择的操作:";
      cin >> w;
      if (w == '#')
        goto L;
      else
        goto E;
    }
    else
    {
      if (!ready.isempty())
      {
        a = ready.dequeue();
        if (a != r)
          execute.enqueue(a);
        goto L;
      }
      else
        goto L;
    }
  }
  else if (n == 2)
  {
    if (!clog.isempty())
    {
      a = clog.dequeue();
      if (a != r)
        ready.enqueue(a);
      goto L;
    }
    else
      goto L;
  }
  else if (n == 3)
  {
    if (!execute.isempty())
    {
      a = execute.dequeue();
      if (a != r)
        clog.enqueue(a);
      goto L;
    }
    else
      goto L;
  }
  else if (n == 4)
  {
    cout << "\n请输入要结束的进程名： ";
    cin >> a;
    if (execute.find(a) || ready.find(a) || clog.find(a))
    {
      if (execute.find(a))
      {
        execute.del(a);
      }
      else if (ready.find(a))
      {
        ready.del(a);
      }
      if (clog.find(a))
      {
        clog.del(a);
      }
      cout << "\n结束进程成功！\n"
        << endl;
      goto L;
    }
    else
      cout << "没有此进程 " << endl;
    goto L;
  L:
    if (n == 1 || n == 2 || n == 3 || n == 4)
    {
      cout << "执行队列" << endl;
      execute.display();
      cout << endl;
      cout << "就绪队列" << endl;
      ready.display();
      cout << endl;
      cout << "阻塞队列" << endl;
      clog.display();
      cout << endl;
      goto A;
    }
    else if (n == 5)
      ;
    else
    {
      cout << "\n你的输入错误！\n";
      goto A;
    }
  }
E:;
  return 0;
}