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 #include "sched.h"
33
Testcase()34 static int Testcase()
35 {
36 #define CURRENT_PROCESS_POLICY SCHED_RR
37
38 struct sched_param param = { 0 };
39 int ret = OS_ERROR;
40
41 int currProcessPri = getpriority(PRIO_PROCESS, getpid());
42 ICUNIT_GOTO_WITHIN_EQUAL(currProcessPri, 0, 31, currProcessPri, ERROR_OUT); // 31, assert function Result equal to this.
43
44 #define PROCESS_TEST_PRI1 (currProcessPri + 1)
45 #define PROCESS_TEST_PRI2 (currProcessPri - 1)
46
47 ret = sched_getparam(getpid(), ¶m);
48 ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
49 ICUNIT_GOTO_EQUAL(param.sched_priority, currProcessPri, param.sched_priority, ERROR_OUT);
50
51 ret = sched_getscheduler(getpid());
52 ICUNIT_GOTO_EQUAL(ret, CURRENT_PROCESS_POLICY, ret, ERROR_OUT);
53
54 param.sched_priority = PROCESS_TEST_PRI1;
55 ret = sched_setscheduler(getpid(), SCHED_RR, ¶m);
56 ICUNIT_GOTO_WITHIN_EQUAL(ret, 0, 100000, ret, ERROR_OUT); // 100000, assert ret equal to this.
57
58 ret = sched_getparam(getpid(), ¶m);
59 ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
60 ICUNIT_GOTO_EQUAL(param.sched_priority, PROCESS_TEST_PRI1, param.sched_priority, ERROR_OUT);
61
62 param.sched_priority = PROCESS_TEST_PRI2;
63 ret = sched_setparam(getpid(), ¶m);
64 ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
65
66 ret = getpriority(PRIO_PROCESS, getpid());
67 ICUNIT_GOTO_EQUAL(ret, PROCESS_TEST_PRI2, ret, ERROR_OUT);
68
69 ret = setpriority(PRIO_PROCESS, getpid(), currProcessPri);
70 ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
71
72 ret = getpriority(PRIO_PROCESS, getpid());
73 ICUNIT_GOTO_EQUAL(ret, currProcessPri, ret, ERROR_OUT);
74
75 param.sched_priority = currProcessPri;
76 ret = sched_setscheduler(getpid(), CURRENT_PROCESS_POLICY, ¶m);
77 ICUNIT_GOTO_WITHIN_EQUAL(ret, 0, 100000, ret, ERROR_OUT); // 100000, assert ret equal to this.
78
79 ret = setpgid(getpid(), 1);
80 ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
81 ICUNIT_GOTO_EQUAL(errno, EPERM, errno, ERROR_OUT);
82
83 ret = setpgid(getpid(), 2); // 2, set pid num.
84 ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
85 ICUNIT_GOTO_EQUAL(errno, EPERM, errno, ERROR_OUT);
86
87 return 0;
88 ERROR_OUT:
89 return ret;
90 }
91
ItTestProcess002(void)92 void ItTestProcess002(void)
93 {
94 TEST_ADD_CASE("IT_POSIX_PROCESS_002", Testcase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
95 }
96