• 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 #include "sched.h"
33 
TestCase()34 static int TestCase()
35 {
36 #define PROCESS_TEST_PRI1 (currProcessPri + 1)
37     struct sched_param param = { 0 };
38     int ret = OS_ERROR;
39     int val, currPolicy;
40     int currProcessPri = getpriority(PRIO_PROCESS, getpid());
41     ICUNIT_GOTO_WITHIN_EQUAL(currProcessPri, 0, 31, currProcessPri, ERROR_OUT); // 31, assert currProcessPri equal to this.
42 
43     currPolicy = sched_getscheduler(getpid());
44     ICUNIT_GOTO_EQUAL(currPolicy, SCHED_RR, currPolicy, ERROR_OUT);
45 
46     val = getpriority(PRIO_PROCESS, 0);
47     ICUNIT_GOTO_EQUAL(val, currProcessPri, val, ERROR_OUT);
48 
49     ret = sched_getparam(0, &param);
50     ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
51     ICUNIT_GOTO_EQUAL(param.sched_priority, currProcessPri, param.sched_priority, ERROR_OUT);
52 
53     val = sched_getscheduler(0);
54     ICUNIT_GOTO_EQUAL(val, currPolicy, val, ERROR_OUT);
55 
56     ret = setpriority(PRIO_PROCESS, 0, PROCESS_TEST_PRI1);
57     ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
58 
59     ret = getpriority(PRIO_PROCESS, 0);
60     ICUNIT_GOTO_EQUAL(ret, PROCESS_TEST_PRI1, ret, ERROR_OUT);
61 
62     param.sched_priority = currProcessPri;
63     ret = sched_setparam(0, &param);
64     ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
65 
66     ret = getpriority(PRIO_PROCESS, getpid());
67     ICUNIT_GOTO_EQUAL(ret, currProcessPri, ret, ERROR_OUT);
68 
69     ret = sched_setscheduler(0, SCHED_FIFO, &param);
70     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
71     ret = errno;
72     ICUNIT_GOTO_EQUAL(ret, EINVAL, ret, ERROR_OUT);
73 
74     ret = sched_setscheduler(0, SCHED_RR, &param);
75     ICUNIT_GOTO_EQUAL(ret, 0, ret, ERROR_OUT);
76 
77     ret = sched_setscheduler(1, SCHED_FIFO, &param);
78     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
79     ret = errno;
80     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
81 
82     ret = sched_setscheduler(2, SCHED_FIFO, &param); // 2, input the pid.
83     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
84     ret = errno;
85     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
86 
87     ret = sched_setparam(1, &param);
88     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
89     ret = errno;
90     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
91 
92     ret = sched_setparam(2, &param); // 2, set the param.
93     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
94     ret = errno;
95     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
96 
97     ret = setpriority(PRIO_PROCESS, 1, PROCESS_TEST_PRI1);
98     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
99     ret = errno;
100     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
101 
102     ret = setpriority(PRIO_PROCESS, 2, PROCESS_TEST_PRI1); // 2, Used to calculate priorities.
103     ICUNIT_GOTO_EQUAL(ret, -1, ret, ERROR_OUT);
104     ret = errno;
105     ICUNIT_GOTO_EQUAL(ret, EPERM, ret, ERROR_OUT);
106 
107     return 0;
108 
109 ERROR_OUT:
110     return ret;
111 }
112 
ItTestProcess013(void)113 void ItTestProcess013(void)
114 {
115     TEST_ADD_CASE("IT_POSIX_PROCESS_013", TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
116 }
117