[操作系统作业]os22

the pages that will be touch:
2 5 3 6 2 4 4 3 2 4 3 6 7 5 7    最大的内存页面数:5

FIFO child pid:3311 , my father pid:
2
2 5
2 5 3
2 5 3 6
2 5 3 6
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
5 3 6 4 7
5 3 6 4 7
5 3 6 4 7
FIFO child end, ming : 9,que : 6.

the pages that will be touch:
2 5 3 6 2 4 4 3 2 4 3 6 7 5 7    最大的内存页面数:6

FIFO child pid:3355 , my father pid:
2
2 5
2 5 3
2 5 3 6
2 5 3 6
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4
2 5 3 6 4 7
2 5 3 6 4 7
2 5 3 6 4 7
FIFO child end, ming : 9,que : 6.

#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>
#include <string.h>
#include  <sys/stat.h>
#include  <fcntl.h>
#include  <error.h>
#include  <wait.h>
#define PSIZE 2
#define total_instruction 10
#define frame_num 4

int Acess_Series[total_instruction];//存访问页面序列
struct one_frame {
   int page_no;
   char flag;
};
struct one_frame M_Frame[frame_num];
//这里frame_num是给一个进程分配的最大的内存页面数
int isExist(int page){
  int i;
  for(i = 0; i < frame_num; i++){
    if(M_Frame[i].page_no==page)
      return 1;
  }
  return 0;
};
int getPagePtr(int page){
  int i;
  for(i = 0; i < frame_num; i++){
    if(M_Frame[i].page_no==page)
      return i;
  }
  return 0;
};
void printMsg(int full_ptr){
  int i;
  for(i = 0; i < full_ptr; i++){
    printf("%d ",M_Frame[i].page_no);
  }
  printf("\n");
}


int main(){
  int i;
  //随机产生内存访问页面序列，存于数组Acess_Series[total_instruction]中
  srand(time(NULL));
  for(i = 0; i < total_instruction; i++){
    Acess_Series[i] = rand()%7 + 1;//1 ~ 7
  }
  printf("the pages that will be touch:\n");
  for(i = 0; i < total_instruction; i++){
    printf("%d ",Acess_Series[i]);
  }
  printf("   最大的内存页面数:%d \n",frame_num);
  pid_t pid_1,pid_2;
  if((pid_1=fork()) == -1){
    printf("error in fork()!");
    exit(1);
  }else if(pid_1 == 0){
    printf("FIFO child pid:%d , my father pid:\n",getpid(),getppid());
    int full_ptr = 0;
    int ming_num = 0,que_num = 0;
    for(i = 0; i < total_instruction; i++){
      if(isExist(Acess_Series[i])){
        ming_num++;
      }else{
        que_num++;//看M_Frame[]中有无空闲页面，如果有，装入待访问页，并统计缺页情况，缺页次数加1
        if(full_ptr < frame_num){//isFull(M_Frame)
          M_Frame[full_ptr].page_no = Acess_Series[i];
          M_Frame[full_ptr].flag = 'y';
          full_ptr++; 
        }else{//如果M_Frame[]中的所有页面均被占满，则淘汰M_Frame[0]，装入待访问页，重新调整各页面在数组中的位置。并统计缺页情况，缺页次数加1
          int j;
          printf("ss\n");
          for(j = 1; j < frame_num; j++){
            M_Frame[j - 1].page_no = M_Frame[j].page_no;
            M_Frame[j - 1].flag = M_Frame[j].flag;
          }
          M_Frame[j - 1].page_no = Acess_Series[i];
          M_Frame[j - 1].flag = 'y';
        }
      }
      printMsg(full_ptr);
    }
    printf("FIFO child end, ming : %d,que : %d.\n",ming_num,que_num);
    exit(0);
  }else{
    if((pid_2=fork()) == -1){
      printf("error in fork()!");
      exit(1);
    }else if(pid_2 == 0){
      printf("LRU child pid:%d , my father pid:\n",getpid(),getppid());
      int full_ptr = 0;
      int ming_num = 0,que_num = 0;
      for(i = 0; i < total_instruction; i++){
        if(isExist(Acess_Series[i])){
          ming_num++; 
          int page_ptr = getPagePtr(Acess_Series[i]);
          int j;
          struct one_frame frame_temp;
          frame_temp.page_no = M_Frame[page_ptr].page_no;
          frame_temp.flag = M_Frame[page_ptr].flag;
          for(j = page_ptr+1; j < full_ptr; j++){
            M_Frame[j - 1].page_no = M_Frame[j].page_no;
            M_Frame[j - 1].flag = M_Frame[j].flag;
          }
          M_Frame[j - 1].page_no = frame_temp.page_no;
          M_Frame[j - 1].flag = frame_temp.flag;
        }else{
          que_num++;//看M_Frame[]中有无空闲页面，如果有，装入待访问页，并统计缺页情况，缺页次数加1
          if(full_ptr < frame_num){//isFull(M_Frame)
            M_Frame[full_ptr].page_no = Acess_Series[i];
            M_Frame[full_ptr].flag = 'y';
            full_ptr++; 
          }else{//如果M_Frame[]中的所有页面均被占满，则淘汰M_Frame[0]，装入待访问页，重新调整各页面在数组中的位置。并统计缺页情况，缺页次数加1
            int j;
            for(j = 1; j < frame_num; j++){
              M_Frame[j - 1].page_no = M_Frame[j].page_no;
              M_Frame[j - 1].flag = M_Frame[j].flag;
            }
            M_Frame[j - 1].page_no = Acess_Series[i];
            M_Frame[j - 1].flag = 'y';
          }
        }
        printMsg(full_ptr);
      }
      printf("LRU child end, ming : %d,que : %d.\n",ming_num,que_num);
      exit(0);
    }else{//等待子进程执行结束，退出。
      pid_t pid;
      while(i < PSIZE){
        if((pid = wait(0)) < 0){
          printf("error in waitepid.\n");
          exit(1);
        }else{
          printf("child process %d is endreturn.\n",pid);
        }
        i++;
      }
      exit(0);
    }
  }
}