• 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 
Testcase(VOID)33 static int Testcase(VOID)
34 {
35     int priority;
36     int err;
37     int ret;
38     int currProcessPri = getpriority(PRIO_PROCESS, getpid());
39     int count = 0;
40     priority = getpriority(PRIO_PGRP, 0);
41     struct sched_param param = { 0 };
42     err = errno;
43 
44     priority = getpriority(PRIO_PGRP, 0);
45     err = errno;
46     ICUNIT_ASSERT_EQUAL(priority, -1, priority);
47     ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
48 
49     priority = getpriority(PRIO_USER, 0);
50     err = errno;
51     ICUNIT_ASSERT_EQUAL(priority, -1, priority);
52     ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
53 
54     for (count = 1; count < 1000; ++count) { // 1000, Number of cycles.
55         priority = getpriority(PRIO_USER + count, 0);
56         err = errno;
57         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
58         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
59 
60         priority = setpriority(PRIO_USER + count, getpid(), currProcessPri);
61         err = errno;
62         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
63         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
64 
65         priority = getpriority(-count, 0);
66         err = errno;
67         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
68         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
69 
70         priority = setpriority(-count, getpid(), currProcessPri);
71         err = errno;
72         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
73         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
74 
75         priority = sched_get_priority_max(SCHED_RR - count);
76         err = errno;
77         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
78         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
79 
80         priority = sched_get_priority_max(SCHED_RR + count);
81         err = errno;
82         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
83         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
84 
85         priority = sched_get_priority_min(SCHED_RR - count);
86         err = errno;
87         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
88         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
89 
90         priority = sched_get_priority_min(SCHED_RR + count);
91         err = errno;
92         ICUNIT_ASSERT_EQUAL(priority, -1, priority);
93         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
94 
95         ret = sched_setscheduler(getpid(), SCHED_RR - count, &param);
96         err = errno;
97         ICUNIT_ASSERT_EQUAL(ret, -1, ret);
98         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
99 
100         ret = sched_setscheduler(getpid(), SCHED_RR + count, &param);
101         err = errno;
102         ICUNIT_ASSERT_EQUAL(ret, -1, ret);
103         ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
104     }
105 
106     priority = setpriority(PRIO_PGRP, getpid(), currProcessPri);
107     err = errno;
108     ICUNIT_ASSERT_EQUAL(priority, -1, priority);
109     ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
110 
111     priority = setpriority(PRIO_USER, getpid(), currProcessPri);
112     err = errno;
113     ICUNIT_ASSERT_EQUAL(priority, -1, priority);
114     ICUNIT_ASSERT_EQUAL(err, EINVAL, err);
115 
116     return 0;
117 }
118 
ItTestProcess043(void)119 void ItTestProcess043(void)
120 {
121     TEST_ADD_CASE("IT_POSIX_PROCESS_043", Testcase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
122 }
123