• 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     return getpid();
36 }
37 
ChildFunClone2()38 static int ChildFunClone2()
39 {
40     void *pstk = malloc(STACK_SIZE);
41     if (pstk == NULL) {
42         return -1;
43     }
44     int childPid = clone(ChildFun, (char *)pstk + STACK_SIZE, SIGCHLD, NULL);
45 
46     free(pstk);
47     return childPid;
48 }
49 
ChildFunClone1(void * p)50 static int ChildFunClone1(void *p)
51 {
52     (void)p;
53     pid_t pid = getpid();
54     const int COUNT = 100;
55     int childPid;
56     int childFunRet = (int)pid;
57     int processCount = 0;
58     int ret;
59     int status;
60 
61     for (int i = 0; i < COUNT; i++) {
62         childPid = ChildFunClone2();
63         if (childPid != -1) {
64             processCount++;
65         } else {
66             ret = wait(&status);
67             if (ret > 0) {
68                 processCount--;
69             } else {
70                 sleep(1);
71             }
72             continue;
73         }
74     }
75 
76     ret = 0;
77     while (processCount > 0) {
78         ret = wait(&status);
79         if (ret > 0) {
80             processCount--;
81         }
82     }
83 
84     return childFunRet;
85 }
86 
ItPidContainer003(void)87 void ItPidContainer003(void)
88 {
89     int status;
90     int ret;
91     void *pstk = malloc(STACK_SIZE);
92     ASSERT_TRUE(pstk != NULL);
93     int childPid = clone(ChildFunClone1, (char *)pstk + STACK_SIZE, CLONE_NEWPID | SIGCHLD, NULL);
94     ASSERT_NE(childPid, -1);
95 
96     ret = waitpid(childPid, &status, 0);
97     ASSERT_EQ(ret, childPid);
98     ret = WIFEXITED(status);
99     ASSERT_NE(ret, 0);
100     ret = WEXITSTATUS(status);
101     ASSERT_EQ(ret, CONTAINER_FIRST_PID);
102 
103     sleep(5); /* 5: Wait for process resources to be reclaimed */
104 }
105