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_testThreadExit = 0;
34 static int g_testExit = 0;
35
ThreadFunc(void * arg)36 static void *ThreadFunc(void *arg)
37 {
38 int count = 0;
39
40 while (count < 5) { // 5, Number of cycles.
41 g_testExit++;
42 count++;
43 usleep(1000 * 10 * 1); // 1000, 10, Used to calculate the delay time.
44 }
45
46 return NULL;
47 }
48
TestCase(void)49 static int TestCase(void)
50 {
51 int ret;
52 int status = 100;
53 pthread_t newPthread;
54 pid_t pid;
55 int count = 0;
56 g_testThreadExit = 0;
57 g_testExit = 0;
58
59 ret = pthread_create(&newPthread, NULL, ThreadFunc, NULL);
60 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
61
62 pid = fork();
63 ICUNIT_GOTO_WITHIN_EQUAL(pid, 0, 100000, pid, EXIT); // 100000, assert pid equal to this.
64
65 if (pid == 0) {
66 while (count < 10) { // 10, Number of cycles.
67 count++;
68 usleep(1000 * 10 * 2); // 1000, 10, 2, Used to calculate the delay time.
69 }
70 exit(0);
71 } else {
72 ret = waitpid(pid, &status, 0);
73 ICUNIT_GOTO_EQUAL(ret, pid, ret, EXIT);
74 status = WEXITSTATUS(status);
75 ICUNIT_GOTO_EQUAL(status, 0, status, EXIT);
76 ICUNIT_GOTO_EQUAL(g_testExit, 5, g_testExit, EXIT); // 5, assert status equal to this.
77 }
78
79 ret = pthread_join(newPthread, NULL);
80 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
81
82 EXIT:
83 return 0;
84 }
85
ItTestProcess014(void)86 void ItTestProcess014(void)
87 {
88 TEST_ADD_CASE("IT_POSIX_PROCESS_014", TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
89 }
90