• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2023-2023 Huawei Device Co., Ltd. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without modification,
5  * are permitted provided that the following conditions are met:
6  *
7  * 1. Redistributions of source code must retain the above copyright notice, this list of
8  * conditions and the following disclaimer.
9  *
10  * 2. Redistributions in binary form must reproduce the above copyright notice, this list
11  * of conditions and the following disclaimer in the documentation and/or other materials
12  * provided with the distribution.
13  *
14  * 3. Neither the name of the copyright holder nor the names of its contributors may be used
15  * to endorse or promote products derived from this software without specific prior written
16  * permission.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
20  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
22  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29  */
30 #include "It_container_test.h"
31 
ChildFun(void * p)32 static int ChildFun(void *p)
33 {
34     (void)p;
35     int ret;
36     int status = 0;
37     pid_t pid;
38     int count = 100;
39     int processCount = 0;
40 
41     pid = getpid();
42     if (pid != CONTAINER_FIRST_PID) {
43         return EXIT_CODE_ERRNO_1;
44     }
45 
46     for (int i = 0; i < count; i++) {
47         pid = fork();
48         if (pid == 0) {
49             sleep(2); /* delay 2s */
50             exit(0);
51         } else if (pid < 0) {
52             if (errno != EAGAIN) {
53                 sleep(1);
54             }
55             ret = wait(&status);
56             if (ret > 0) {
57                 processCount--;
58             }
59             continue;
60         } else {
61             processCount++;
62             continue;
63         }
64     }
65 
66     ret = 0;
67     while (processCount > 0) {
68         ret = wait(&status);
69         if (ret > 0) {
70             processCount--;
71         } else {
72             sleep(1);
73         }
74     }
75     exit(EXIT_CODE_ERRNO_255);
76 }
77 
ItPidContainer009(void)78 void ItPidContainer009(void)
79 {
80     int ret = 0;
81     int status;
82     void *pstk = malloc(STACK_SIZE);
83     ASSERT_TRUE(pstk != NULL);
84     int childPid = clone(ChildFun, (char *)pstk + STACK_SIZE, CLONE_NEWPID | SIGCHLD, NULL);
85     free(pstk);
86     ASSERT_NE(childPid, -1);
87 
88     ret = waitpid(childPid, &status, 0);
89     ASSERT_EQ(ret, childPid);
90     ret = WIFEXITED(status);
91     ASSERT_NE(ret, 0);
92     ret = WEXITSTATUS(status);
93     ASSERT_EQ(ret, EXIT_CODE_ERRNO_255);
94 
95     sleep(5); /* 5: Wait for process resources to be reclaimed */
96 }
97