1 /*
2 * Copyright (c) 2023-2023 Huawei Device Co., Ltd. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without modification,
5 * are permitted provided that the following conditions are met:
6 *
7 * 1. Redistributions of source code must retain the above copyright notice, this list of
8 * conditions and the following disclaimer.
9 *
10 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
11 * of conditions and the following disclaimer in the documentation and/or other materials
12 * provided with the distribution.
13 *
14 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
15 * to endorse or promote products derived from this software without specific prior written
16 * permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
20 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
22 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30 #include "it_pthread_test.h"
31
ChildProcess(void)32 static int ChildProcess(void)
33 {
34 int ret;
35 int currPolicy = 0;
36 volatile unsigned int count = 0;
37 struct sched_param currSchedParam = { 0 };
38 struct sched_param param = {
39 .sched_deadline = 1000000, /* 1000000, 1s */
40 .sched_runtime = 20000, /* 20000, 20ms */
41 .sched_period = 1000000, /* 1000000, 1s */
42 };
43
44 ret = sched_getparam(getpid(), &currSchedParam);
45 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
46
47 currPolicy = sched_getscheduler(getpid());
48 ICUNIT_ASSERT_EQUAL(currPolicy, SCHED_RR, LOS_NOK);
49 currSchedParam.sched_runtime = 0;
50 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_deadline, 0, LOS_NOK);
51 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_runtime, 0, LOS_NOK);
52 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_period, 0, LOS_NOK);
53
54 ret = sched_setscheduler(getpid(), SCHED_DEADLINE, ¶m);
55 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
56
57 currPolicy = sched_getscheduler(getpid());
58 ICUNIT_ASSERT_EQUAL(currPolicy, SCHED_DEADLINE, LOS_NOK);
59
60 ret = sched_getparam(getpid(), &currSchedParam);
61 ICUNIT_ASSERT_EQUAL(ret, 0, ret);
62 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_deadline, 1000000, LOS_NOK); /* 1000000, 1s */
63 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_runtime, 20000, LOS_NOK); /* 20000, 20ms */
64 ICUNIT_ASSERT_EQUAL(currSchedParam.sched_period, 1000000, LOS_NOK); /* 1000000, 1s */
65
66 printf("--- 1 edf thread start ---\n\r");
67 do {
68 for (volatile int i = 0; i < 10000; i++) { /* 10000, no special meaning */
69 for (volatile int j = 0; j < 5; j++) { /* 5, no special meaning */
70 int tmp = i - j;
71 }
72 }
73 if (count % 3 == 0) { /* 3, no special meaning */
74 printf("--- 2 edf thread running ---\n\r");
75 }
76 count++;
77 } while (count <= 6); /* 6, no special meaning */
78 printf("--- 3 edf thread end ---\n\r");
79
80 return 0;
81 }
82
TestCase(void)83 static int TestCase(void)
84 {
85 int ret, pid, status;
86
87 pid = fork();
88 if (pid == 0) {
89 ret = ChildProcess();
90 if (ret != 0) {
91 exit(-1);
92 }
93 exit(0);
94 } else if (pid > 0) {
95 waitpid(pid, &status, 0);
96 } else {
97 exit(__LINE__);
98 }
99
100 return WEXITSTATUS(status) == 0 ? 0 : -1;
101 }
102
ItTestPthread026(void)103 void ItTestPthread026(void)
104 {
105 TEST_ADD_CASE("IT_POSIX_PTHREAD_026", TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
106 }
107