• 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_signal.h"
32 #include "signal.h"
33 #include "sys/wait.h"
34 
35 static const int SIG_TEST_COUNT = 3;
36 static int g_sigCount = 0;
SigPrint(int sig)37 static void SigPrint(int sig)
38 {
39     g_sigCount++;
40 }
41 
TestRaise()42 static int TestRaise()
43 {
44     int count = 0;
45     int status = 0;
46     int fpid;
47     int fatherPid;
48     int sonPid;
49     void (*ret)(int) = NULL;
50     int retValue;
51 
52     g_sigCount = 0;
53     ret = signal(SIGTERM, SigPrint);
54     ICUNIT_ASSERT_NOT_EQUAL(ret, NULL, ret);
55     retValue = raise(SIGTERM);
56     ICUNIT_ASSERT_EQUAL(retValue, 0, retValue);
57     fatherPid = getpid();
58     fpid = fork();
59     // fpid check err
60     ICUNIT_ASSERT_WITHIN_EQUAL(fpid, 0, UINT_MAX, fpid);
61     if (fpid == 0) {
62         while (1) {
63             usleep(500000); // 500000, Used to calculate the delay time.
64             count++;
65             if (g_sigCount == SIG_TEST_COUNT) {
66                 break;
67             }
68             // check child process num
69             // 0 means count should be positive and 2 controls the upper bound of count
70             if ((count) < (0) || (count) > (SIG_TEST_COUNT * 2)) {
71                 exit(count);
72             }
73         }
74         exit(0);
75     } else { // parent threa
76         sonPid = fpid;
77         usleep(10); // 10, Used to calculate the delay time.
78         while (1) {
79             retValue = kill(sonPid, SIGTERM);
80 
81             sleep(1);
82             count++;
83             if (count == SIG_TEST_COUNT) {
84                 break;
85             }
86         }
87         retValue = waitpid(sonPid, &status, 0);
88         ICUNIT_ASSERT_EQUAL(retValue, sonPid, retValue);
89         ICUNIT_ASSERT_EQUAL(WEXITSTATUS(status), 0, WEXITSTATUS(status));
90     }
91     return g_sigCount;
92 }
93 
TestCase(void)94 static int TestCase(void)
95 {
96     int count = TestRaise();
97     // count should be 1, for global variables are not shared between different processors
98     ICUNIT_ASSERT_EQUAL(count, 1, count);
99     return 0;
100 }
101 
ItPosixSignal003(void)102 void ItPosixSignal003(void)
103 {
104     TEST_ADD_CASE("IT_POSIX_SIGNAL_003", TestCase, TEST_POSIX, TEST_SIGNAL, TEST_LEVEL0, TEST_FUNCTION);
105 }
106