首页
学习
活动
专区
圈层
工具
发布
社区首页 >问答首页 >创建多代儿童进程

创建多代儿童进程
EN

Stack Overflow用户
提问于 2016-09-25 10:44:16
回答 1查看 894关注 0票数 0

所以我试着理解孙子的概念。我能够创造一个给定数量的儿子(即兄弟),但我不知道如何创造多代人。这就是我创造一个孙子时所做的:

代码语言:javascript
复制
int main ()
{
//Displaying the father
printf("Initial : Father = %d\n\n", getpid()); 

/****** FORK *******/

pid_t varFork, varFork2;

varFork = fork();

if(varFork == -1) //If we have an error, we close the process
{
    printf("ERROR\n");
    exit(-1);
}
else if (varFork == 0) //if we have a son, we display it's ID and it's father's
{
    printf("SON 1\n");
    printf(" ID = %d, Father's ID = %d\n", getpid(), getppid());

    varFork2 = fork();//creation of the second fork

    if(varFork2 == -1) //If we have an error, we close the process
    {
        printf("ERROR\n");
        exit(-1);
    }
    else if (varFork2 == 0) //now we have the son of the first son, so the grandson of the father
    {
        printf("\nGRANDSON 1\n");
        printf(" ID = %d, Father's ID = %d\n", getpid(), getppid());
    }
    else sleep(0.1);/*we wait 0.1sec so that the father doesn't die before we can 
        display it's id (and before the son process gets adopted by a user process descending from the initial              process)*/  
}
else //in the other case, we have a father
{
    sleep(0.1);//again we put the father asleep to avoid adoption
}
return 0;
}

我如何创造X代孙子,X是一个全局变量(1儿子,1孙子,1曾孙,等等)?

EN

回答 1

Stack Overflow用户

回答已采纳

发布于 2016-09-25 11:00:28

我如何创造X代

在分叉之前,减少X并继续在孩子内部分叉,直到X0为止。

或者在子级减少X,并且只有在将其递减之后,X仍然是更大的0时才继续分叉。

代码可能如下所示:

代码语言:javascript
复制
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <errno.h>

void logmsg(const char *, int);

#define MAX_GENERATIONS (4)

int main(void)
{
  pid_t pid = 0;

  for (size_t g = 0; g < MAX_GENERATIONS; ++g)
  {
    logmsg("About to fork.", 0);

    switch (pid = fork())
    {
      case -1:
      {
        logmsg("fork() failed", errno);

        break;
      }

      case 0:
      {
        logmsg("Hello world. I am the new child.", 0);

        break;
      }

      default:
      {
        char s[1024];
        snprintf(s, sizeof s, "Successfully created child carrying PID %d.", (int) pid);
        logmsg(s, 0);
        g = MAX_GENERATIONS; /* Child forked, so we are done, set g to end looping. */

        break;
      }
    }
  }

  logmsg("Sleeping for 3s.", 0);
  sleep(3);

  if (0 != pid) /* In case we forked a child ... */
  {
    logmsg("Waiting for child to end.", 0);
    if (-1 == wait(NULL)) /* ... wait for the child to terminate. */
    {
      logmsg("wait() failed", errno);
    }
  }

  logmsg("Child ended, terminating as well.", 0);

  return EXIT_SUCCESS;
}

void logmsg(const char * msg, int error)
{
  char s[1024];
  snprintf(s, sizeof s, "PID %d: %s", (int) getpid(), msg);
  if (error)
  {
    errno = error;
    perror(s);
    exit(EXIT_FAILURE);
  }

  puts(s);
}

输出应该类似于以下内容:

代码语言:javascript
复制
PID 4887: About to fork.
PID 4887: Successfully created child carrying PID 4888.
PID 4887: Sleeping for 3s.
PID 4888: Hello world. I am the new child.
PID 4888: About to fork.
PID 4888: Successfully created child carrying PID 4889.
PID 4888: Sleeping for 3s.
PID 4889: Hello world. I am the new child.
PID 4889: About to fork.
PID 4889: Successfully created child carrying PID 4890.
PID 4890: Hello world. I am the new child.
PID 4890: About to fork.
PID 4889: Sleeping for 3s.
PID 4890: Successfully created child carrying PID 4891.
PID 4890: Sleeping for 3s.
PID 4891: Hello world. I am the new child.
PID 4891: Sleeping for 3s.
PID 4888: Waiting for child to end.
PID 4890: Waiting for child to end.
PID 4891: Child ended, terminating as well.
PID 4890: Child ended, terminating as well.
PID 4887: Waiting for child to end.
PID 4889: Waiting for child to end.
PID 4889: Child ended, terminating as well.
PID 4888: Child ended, terminating as well.
PID 4887: Child ended, terminating as well.

与我提出的建议相比,上面我的代码的不同之处是,它向上计算到X

票数 1
EN
页面原文内容由Stack Overflow提供。腾讯云小微IT领域专用引擎提供翻译支持
原文链接:

https://stackoverflow.com/questions/39685961

复制
相关文章

相似问题

领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档