1 /******************************************************************************/
2 /*                                                                            */
3 /* Copyright (c) International Business Machines  Corp., 2007                 */
4 /*                                                                            */
5 /* This program is free software;  you can redistribute it and/or modify      */
6 /* it under the terms of the GNU General Public License as published by       */
7 /* the Free Software Foundation; either version 2 of the License, or          */
8 /* (at your option) any later version.                                        */
9 /*                                                                            */
10 /* This program is distributed in the hope that it will be useful,            */
11 /* but WITHOUT ANY WARRANTY;  without even the implied warranty of            */
12 /* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See                  */
13 /* the GNU General Public License for more details.                           */
14 /*                                                                            */
15 /* You should have received a copy of the GNU General Public License          */
16 /* along with this program;  if not, write to the Free Software               */
17 /* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA    */
18 /*                                                                            */
19 /******************************************************************************/
20 
21 /******************************************************************************/
22 /*                                                                            */
23 /* File:        cpuctl_test02.c                                               */
24 /*                                                                            */
25 /* Description: This is a c program that tests the cpucontroller fairness of  */
26 /*              scheduling the tasks according to their group shares. This    */
27 /*              testcase tests the ability of the cpu controller to provide   */
28 /*              fairness for share values (absolute).                         */
29 /*                                                                            */
30 /* Total Tests: 2                                                             */
31 /*                                                                            */
32 /* Test 04:     Nice value effect on group scheduling                         */
33 /* Test 05:     Task migration test                                           */
34 /*                                                                            */
35 /* Test Name:   cpu_controller_test02                                         */
36 /*                                                                            */
37 /* Test Assertion                                                             */
38 /*              Please refer to the file cpuctl_testplan.txt                  */
39 /*                                                                            */
40 /* Author:      Sudhir Kumar skumar@linux.vnet.ibm.com                        */
41 /*                                                                            */
42 /* History:                                                                   */
43 /* Created-     20/12/2007 -Sudhir Kumar <skumar@linux.vnet.ibm.com>          */
44 /*                                                                            */
45 /******************************************************************************/
46 
47 #include <unistd.h>
48 #include <math.h>
49 #include <signal.h>
50 #include <stdio.h>
51 #include <stdlib.h>
52 #include <string.h>
53 #include <sys/resource.h>
54 #include <sys/syscall.h>
55 #include <sys/time.h>
56 #include <sys/types.h>
57 #include <sys/stat.h>
58 #include <fcntl.h>
59 #include <time.h>
60 #include <unistd.h>
61 
62 #include "../libcontrollers/libcontrollers.h"
63 #include "test.h"		/* LTP harness APIs */
64 #include "safe_macros.h"
65 
66 #define TIME_INTERVAL	30	/* Time interval in seconds */
67 #define NUM_INTERVALS	3	/* How many iterations of TIME_INTERVAL */
68 
69 char *TCID = "cpuctl_test02";
70 int TST_TOTAL = 1;
71 pid_t scriptpid;
72 char path[] = "/dev/cpuctl";
73 
cleanup(void)74 extern void cleanup(void)
75 {
76 	kill(scriptpid, SIGUSR1);	/* Inform the shell to do cleanup */
77 	tst_exit();		/* Report exit status */
78 }
79 
80 int migrate_task();
81 volatile int timer_expired = 0;
82 
main(void)83 int main(void)
84 {
85 
86 	int test_num;
87 	int task_num;
88 	int len;
89 	int num_cpus;		/* Total time = TIME_INTERVAL *num_cpus in the machine */
90 	int migrate = 0;	/* For task migration */
91 	char mygroup[FILENAME_MAX], mytaskfile[FILENAME_MAX];
92 	char mysharesfile[FILENAME_MAX], ch;
93 	/* Following variables are to capture parameters from script */
94 	char *group_num_p, *mygroup_p, *script_pid_p, *num_cpus_p, *test_num_p,
95 	    *task_num_p;
96 	pid_t pid;
97 	gid_t mygroup_num;	/* A number attached with a group */
98 	int fd;			/* A descriptor to open a fifo for synchronized start */
99 	int counter = 0;	/* To take n number of readings */
100 	double total_cpu_time,	/* Accumulated cpu time */
101 	 delta_cpu_time,	/* Time the task could run on cpu(s) (in an interval) */
102 	 prev_cpu_time = 0;
103 	double exp_cpu_time;	/* Expected time in % as obtained by shares calculation */
104 
105 	struct rusage cpu_usage;
106 	time_t current_time, prev_time, delta_time;
107 	unsigned int fmyshares, num_tasks;	/* f-> from file. num_tasks is tasks in this group */
108 	struct sigaction newaction, oldaction;
109 
110 	mygroup_num = -1;
111 	num_cpus = 0;
112 	task_num = 0;
113 	test_num = 0;
114 
115 	/* Signal handling for alarm */
116 	sigemptyset(&newaction.sa_mask);
117 	newaction.sa_handler = signal_handler_alarm;
118 	newaction.sa_flags = 0;
119 	sigaction(SIGALRM, &newaction, &oldaction);
120 
121 	/* Collect the parameters passed by the script */
122 	group_num_p = getenv("GROUP_NUM");
123 	mygroup_p = getenv("MYGROUP");
124 	script_pid_p = getenv("SCRIPT_PID");
125 	num_cpus_p = getenv("NUM_CPUS");
126 	test_num_p = getenv("TEST_NUM");
127 	task_num_p = getenv("TASK_NUM");
128 	/* Check if all of them are valid */
129 	if ((test_num_p != NULL)
130 	    && (((test_num = atoi(test_num_p)) == 4)
131 		|| ((test_num = atoi(test_num_p)) == 5))) {
132 		if ((group_num_p != NULL) && (mygroup_p != NULL)
133 		    && (script_pid_p != NULL) && (num_cpus_p != NULL)
134 		    && (task_num_p != NULL)) {
135 			mygroup_num = atoi(group_num_p);
136 			scriptpid = atoi(script_pid_p);
137 			num_cpus = atoi(num_cpus_p);
138 			task_num = atoi(task_num_p);
139 			sprintf(mygroup, "%s", mygroup_p);
140 		} else {
141 			tst_brkm(TBROK, cleanup,
142 				 "Invalid other input parameters\n");
143 		}
144 	} else {
145 		tst_brkm(TBROK, cleanup, "Invalid test number passed\n");
146 	}
147 
148 	sprintf(mytaskfile, "%s", mygroup);
149 	sprintf(mysharesfile, "%s", mygroup);
150 	strcat(mytaskfile, "/tasks");
151 	strcat(mysharesfile, "/cpu.shares");
152 	pid = getpid();
153 	write_to_file(mytaskfile, "a", pid);	/* Assign the task to it's group */
154 
155 	fd = SAFE_OPEN(cleanup, "./myfifo", 0);
156 
157 	read(fd, &ch, 1);	/* To block all tasks here and fire them up at the same time */
158 
159 	/*
160 	 * We now calculate the expected % cpu time of this task by getting
161 	 * it's group's shares, the total shares of all the groups and the
162 	 * number of tasks in this group.
163 	 */
164 	FLAG = 0;
165 	total_shares = 0;
166 	shares_pointer = &total_shares;
167 	len = strlen(path);
168 	if (!strncpy(fullpath, path, len))
169 		tst_brkm(TBROK, cleanup, "Could not copy directory path %s ",
170 			 path);
171 
172 	if (scan_shares_files(shares_pointer) != 0)
173 		tst_brkm(TBROK, cleanup,
174 			 "From function scan_shares_files in %s ", fullpath);
175 
176 	/* return val: -1 in case of function error, else 2 is min share value */
177 	if ((fmyshares = read_shares_file(mysharesfile)) < 2)
178 		tst_brkm(TBROK, cleanup, "in reading shares files  %s ",
179 			 mysharesfile);
180 
181 	if ((read_file(mytaskfile, GET_TASKS, &num_tasks)) < 0)
182 		tst_brkm(TBROK, cleanup, "in reading tasks files  %s ",
183 			 mytaskfile);
184 
185 	exp_cpu_time = (double)(fmyshares * 100) / (total_shares * num_tasks);
186 
187 	prev_time = time(NULL);	/* Note down the time */
188 
189 	while (1) {
190 		/* Need to run some cpu intensive task, which also frequently checks the timer value */
191 		double f = 274.345, mytime;	/*just a float number to take sqrt */
192 		alarm(TIME_INTERVAL);
193 		timer_expired = 0;
194 		while (!timer_expired)	/* Let the task run on cpu for TIME_INTERVAL */
195 			f = sqrt(f * f);	/* Time of this operation should not be high otherwise we can
196 						 * exceed the TIME_INTERVAL to measure cpu usage
197 						 */
198 		current_time = time(NULL);
199 		delta_time = current_time - prev_time;	/* Duration in case its not exact TIME_INTERVAL */
200 
201 		getrusage(0, &cpu_usage);
202 		total_cpu_time = (cpu_usage.ru_utime.tv_sec + cpu_usage.ru_utime.tv_usec * 1e-6 +	/* user time */
203 				  cpu_usage.ru_stime.tv_sec + cpu_usage.ru_stime.tv_usec * 1e-6);	/* system time */
204 		delta_cpu_time = total_cpu_time - prev_cpu_time;
205 
206 		prev_cpu_time = total_cpu_time;
207 		prev_time = current_time;
208 
209 		/* calculate % cpu time each task gets */
210 		if (delta_time > TIME_INTERVAL)
211 			mytime =
212 			    (delta_cpu_time * 100) / (delta_time * num_cpus);
213 		else
214 			mytime =
215 			    (delta_cpu_time * 100) / (TIME_INTERVAL * num_cpus);
216 
217 		fprintf(stdout, "Grp:-%3d task-%3d:CPU TIME{calc:-%6.2f(s)i.e. %6.2f(%%)exp:-%6.2f(%%)}\
218 with %u(shares) in %lu (s) INTERVAL\n", mygroup_num, task_num, delta_cpu_time,
219 			mytime, exp_cpu_time, fmyshares, delta_time);
220 
221 		counter++;
222 
223 		if (counter >= NUM_INTERVALS) {	/* Take n sets of readings for each shares value */
224 			switch (test_num) {
225 			case 4:	/* Test04 */
226 				exit(0);	/* This task is done with its job */
227 				break;
228 			case 5:	/* Test 05 */
229 				if (migrate == 0) {
230 					counter = 0;
231 					fprintf(stdout,
232 						"FIRST RUN COMPLETED FOR TASK %d\n",
233 						task_num);
234 					migrate = 1;
235 				} else {
236 					fprintf(stdout,
237 						"SECOND RUN COMPLETED FOR TASK %d\n",
238 						task_num);
239 					exit(0);
240 				}
241 				break;
242 			default:
243 				tst_brkm(TBROK, cleanup,
244 					 "Invalid test number passed\n");
245 				break;
246 
247 			}	/* end switch */
248 		}
249 		if ((migrate == 1) && (counter == 0)) {
250 			if (task_num == 1) {
251 				if (migrate_task() != 0)
252 					tst_brkm(TFAIL, cleanup,
253 						 "Could not migrate task 1 ");
254 				else
255 					fprintf(stdout,
256 						"TASK 1 MIGRATED FROM GROUP 1 TO GROUP 2\n");
257 				strcpy(mytaskfile, "/dev/cpuctl/group_2/tasks");
258 			}
259 			/*
260 			 * Read the shares files and again calculate the cpu fraction
261 			 * In test 2(case 4) we need to read tasks file as we migrate task
262 			 * Q?? How to ensure other tasks do not read before task 1 migration
263 			 */
264 			if ((read_file(mytaskfile, GET_TASKS, &num_tasks)) < 0)
265 				tst_brkm(TBROK, cleanup,
266 					 "in reading tasks files  %s ",
267 					 mytaskfile);
268 			exp_cpu_time =
269 			    (double)(fmyshares * 100) / (total_shares *
270 							 num_tasks);
271 		}
272 	}			/* end while */
273 }				/* end main */
274 
migrate_task(void)275 int migrate_task(void)
276 {
277 	char target[32] = "/dev/cpuctl/group_2/tasks";	/* Hard coding..Will try dynamic */
278 	pid_t pid = getpid();
279 	return (write_to_file(target, "a", pid));
280 }
281