• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3  * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without modification,
6  * are permitted provided that the following conditions are met:
7  *
8  * 1. Redistributions of source code must retain the above copyright notice, this list of
9  * conditions and the following disclaimer.
10  *
11  * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12  * of conditions and the following disclaimer in the documentation and/or other materials
13  * provided with the distribution.
14  *
15  * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16  * to endorse or promote products derived from this software without specific prior written
17  * permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30  */
31 #include "it_test_process.h"
32 
GroupProcess(void)33 static int GroupProcess(void)
34 {
35     int ret;
36     int status = 0;
37     pid_t pid, pid1;
38     int count = 1000;
39     int waitProcess = 0;
40     int testPid;
41     bool thread = false;
42     int processCount = 0;
43 
44     for (int i = 0; i < count; i++) {
45         pid = fork();
46         if (pid == 0) {
47             usleep(1000 * 10 * 50); // 1000, 10, 50, Used to calculate the delay time.
48             exit(0);
49         } else if (pid < 0) {
50             if (errno != EAGAIN) {
51                 sleep(1);
52             }
53             ret = wait(&status);
54             if (ret > 0) {
55                 processCount--;
56             }
57             continue;
58         } else {
59             testPid = pid;
60             processCount++;
61             continue;
62         }
63     }
64 
65     ret = 0;
66     while (processCount > 0) {
67         ret = wait(&status);
68         if (ret > 0) {
69             processCount--;
70         } else {
71             sleep(1);
72         }
73     }
74 
75     exit(255); // 255, exit args
76 EXIT:
77     return 0;
78 }
79 
TestCase(void)80 static int TestCase(void)
81 {
82     int ret;
83     int status = 0;
84     pid_t pid, pid1;
85     int currGid = getpgrp();
86     pid = fork();
87     ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, assert pid equal to this.
88 
89     if (pid == 0) {
90         prctl(PR_SET_NAME, "mainFork", 0UL, 0UL, 0UL);
91         GroupProcess();
92         printf("[Failed] - [Errline : %d RetCode : 0x%x\n", g_iCunitErrLineNo, g_iCunitErrCode);
93         exit(g_iCunitErrLineNo);
94     }
95 
96     ret = waitpid(pid, &status, 0);
97     ICUNIT_ASSERT_EQUAL(ret, pid, ret);
98     status = WEXITSTATUS(status);
99     ICUNIT_GOTO_EQUAL(status, 255, status, EXIT); // 255, assert status equal to this.
100 
101     return 0;
102 EXIT:
103     return 1;
104 }
105 
ItTestProcess040(void)106 void ItTestProcess040(void)
107 {
108     TEST_ADD_CASE("IT_POSIX_PROCESS_040", TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
109 }
110