Advertisement
LeonidR

Esame soa

Jan 18th, 2014
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.85 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <unistd.h>
  4.  
  5. #define N 5
  6. #define T 7
  7.  
  8. int pidPerConcurente[N];
  9. int giri[N];
  10.  
  11. int getConcurrentByPid(int pid){
  12.     int i=0;
  13.     while(pidPerConcurente[i] != pid)
  14.         i++;
  15.     return i+1;
  16. }
  17.  
  18. int main(){
  19.     int i;
  20.     for(i=0; i<N; giri[i] = 0, i++){
  21.         int temp = fork();
  22.         if(!temp)
  23.             execlp("./a", "./a", (char*)0);
  24.         pidPerConcurente[i] = temp;
  25.     }
  26.  
  27.     int status, finePid, finito=0;
  28.  
  29.     while(!finito){
  30.         finePid = wait(&status);
  31.         int c = getConcurrentByPid(finePid);
  32.         giri[c-1] ++;
  33.         if(giri[c-1] == T){
  34.             printf("%d ha vinto\n", c);
  35.             finito = 1;
  36.         }else{
  37.             printf("concorrente %d, ha concluso il suo %d giro\n", c, giri[c-1]);
  38.             if(!(finePid = fork()))
  39.                 execlp("./a", "./a", (char*)0);
  40.  
  41.             pidPerConcurente[c-1] = finePid;
  42.         }
  43.     }
  44.  
  45.     for(i=0; i<N-1; wait(&status), i++);
  46.  
  47.     return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement