• 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 
33 static int g_waitPid;
34 static int g_backPid;
35 static int g_backPid1;
36 
37 static int g_thread001;
38 static int g_thread002;
ThreadFunc(void * arg)39 static void *ThreadFunc(void *arg)
40 {
41     int status = 0;
42 
43     int ret = waitpid(-1, &status, 0);
44     printf("%s 3333333 pid : %d\n", __FUNCTION__, ret);
45     ICUNIT_ASSERT_NOT_EQUAL_NULL(ret, -1, ret);
46     g_thread001++;
47 
48 EXIT:
49     return NULL;
50 }
51 
ThreadFunc2(void * arg)52 static void *ThreadFunc2(void *arg)
53 {
54     int status = 0;
55 
56     int ret = waitpid(0, &status, 0);
57     g_thread002++;
58     printf("%s 11111111 pid %d\n", __FUNCTION__, ret);
59     ICUNIT_ASSERT_NOT_EQUAL_NULL(ret, -1, ret);
60 
61 EXIT:
62     return NULL;
63 }
64 
ProcessTest(void)65 static int ProcessTest(void)
66 {
67     int ret;
68     int status = 100;
69     pthread_t newPthread, newPthread1;
70     pid_t pid, pid1, pid2;
71     int count = 0;
72 
73     g_thread001 = 0;
74     g_thread002 = 0;
75 
76     pid = fork();
77     ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, assert pid equal to this.
78     g_backPid = pid;
79     if (pid == 0) {
80         usleep(1000 * 10 * 20); // 1000, 10, 20, Used to calculate the delay time.
81         exit(3); // 3, exit args
82     }
83 
84     pid1 = fork();
85     ICUNIT_GOTO_WITHIN_EQUAL(pid1, 0, 100000, pid, EXIT); // 100000, assert pid1 equal to this.
86     g_backPid1 = pid1;
87     if (pid1 == 0) {
88         usleep(1000 * 10 * 15); // 1000, 10, 15, Used to calculate the delay time.
89         exit(4); // 4, exit args
90     }
91 
92     pid2 = fork();
93     ICUNIT_GOTO_WITHIN_EQUAL(pid2, 0, 100000, pid, EXIT); // 100000, assert pid2 equal to this.
94     if (pid2 == 0) {
95         usleep(1000 * 10 * 10); // 1000, 10, 10, Used to calculate the delay time.
96         exit(4); // 4, exit args
97     }
98 
99     ret = pthread_create(&newPthread, NULL, ThreadFunc, NULL);
100     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
101 
102     usleep(1000 * 10 * 2); // 1000, 10, 2, Used to calculate the delay time.
103 
104     ret = pthread_create(&newPthread1, NULL, ThreadFunc2, NULL);
105     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
106 
107     usleep(1000 * 10 * 2); // 1000, 10, 2, Used to calculate the delay time.
108 
109     ret = waitpid(-1, &status, 0);
110     g_thread001++;
111     printf("%s 222222 pid : %d\n", __FUNCTION__, ret);
112     ICUNIT_ASSERT_NOT_EQUAL(ret, -1, ret);
113     ICUNIT_ASSERT_NOT_EQUAL(g_thread002, 0, g_thread002);
114 
115     ret = pthread_join(newPthread1, NULL);
116     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
117 
118     ret = pthread_join(newPthread, NULL);
119     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
120 
121     ICUNIT_ASSERT_EQUAL(g_thread001, 2, g_thread001); // 2, assert that function Result is equal to this.
122 
123     exit(255); // 255, exit args
124 EXIT:
125     return 0;
126 }
127 
TestCase(void)128 static int TestCase(void)
129 {
130     int ret;
131     int status = 0;
132     pid_t pid = fork();
133     ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, assert pid equal to this.
134     if (pid == 0) {
135         ProcessTest();
136         exit(g_iCunitErrLineNo);
137     }
138 
139     ret = waitpid(pid, &status, 0);
140     ICUNIT_GOTO_EQUAL(ret, pid, ret, EXIT);
141     status = WEXITSTATUS(status);
142     ICUNIT_GOTO_EQUAL(status, 255, status, EXIT); // 255, assert status equal to this.
143 
144     return 0;
145 EXIT:
146     return 1;
147 }
148 
ItTestProcess024(void)149 void ItTestProcess024(void)
150 {
151     TEST_ADD_CASE("IT_POSIX_PROCESS_024", TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
152 }
153