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_test03.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 scheduling fairness with respect to number */
28 /*              of classes and number of jobs in each class                   */
29 /*                                                                            */
30 /* Total Tests: 1                                                             */
31 /*                                                                            */
32 /* Test 6:      N X M (N groups with M tasks each)                            */
33 /* Test 7:      N*M X 1 (N*M groups with 1 task each)                         */
34 /* Test 8:      1 X N*M (1 group with N*M tasks each)                         */
35 /*                                                                            */
36 /* Test Name:   cpu_controller_test03                                         */
37 /*                                                                            */
38 /* Test Assertion                                                             */
39 /*              Please refer to the file cpuctl_testplan.txt                  */
40 /*                                                                            */
41 /* Author:      Sudhir Kumar skumar@linux.vnet.ibm.com                        */
42 /*                                                                            */
43 /* History:                                                                   */
44 /* Created-     20/12/2007 -Sudhir Kumar <skumar@linux.vnet.ibm.com>          */
45 /*                                                                            */
46 /******************************************************************************/
47 
48 #include <unistd.h>
49 #include <math.h>
50 #include <signal.h>
51 #include <stdio.h>
52 #include <stdlib.h>
53 #include <string.h>
54 #include <sys/resource.h>
55 #include <sys/syscall.h>
56 #include <sys/stat.h>
57 #include <fcntl.h>
58 #include <sys/time.h>
59 #include <sys/types.h>
60 #include <time.h>
61 
62 #include "../libcontrollers/libcontrollers.h"
63 #include "test.h"		/* LTP harness APIs */
64 
65 #define TIME_INTERVAL	30	/* Time interval in seconds */
66 #define NUM_INTERVALS	2	/* How many iterations of TIME_INTERVAL */
67 
68 char *TCID = "cpuctl_test03";
69 int TST_TOTAL = 3;
70 pid_t scriptpid;
71 char path[] = "/dev/cpuctl";
cleanup(void)72 extern void cleanup(void)
73 {
74 	kill(scriptpid, SIGUSR1);	/* Inform the shell to do cleanup */
75 	tst_exit();		/* Report exit status */
76 }
77 
78 volatile int timer_expired = 0;
79 
main(int argc,char * argv[])80 int main(int argc, char *argv[])
81 {
82 
83 	int test_num;
84 	int task_num;
85 	int len;
86 	int num_cpus;		/* Total time = TIME_INTERVAL *num_cpus in the machine */
87 	char mygroup[FILENAME_MAX], mytaskfile[FILENAME_MAX];
88 	char mysharesfile[FILENAME_MAX], ch;
89 	/* Following variables are to capture parameters from script */
90 	char *group_num_p, *mygroup_p, *script_pid_p, *num_cpus_p, *test_num_p,
91 	    *task_num_p;
92 	pid_t pid;
93 	int mygroup_num,	/* A number attached with a group */
94 	 fd,			/* A descriptor to open a fifo for synchronized start */
95 	 counter = 0;		/* To take n number of readings */
96 	double total_cpu_time,	/* Accumulated cpu time */
97 	 delta_cpu_time,	/* Time the task could run on cpu(s) (in an interval) */
98 	 prev_cpu_time = 0;
99 	double exp_cpu_time;	/* Expected time in % as obtained by shares calculation */
100 	struct rusage cpu_usage;
101 	time_t current_time, prev_time, delta_time;
102 	unsigned int fmyshares, num_tasks;	/* f-> from file. num_tasks is tasks in this group */
103 	struct sigaction newaction, oldaction;
104 
105 	mygroup_num = -1;
106 	num_cpus = 0;
107 	task_num = 0;
108 	test_num = 0;
109 
110 	/* Signal handling for alarm */
111 	sigemptyset(&newaction.sa_mask);
112 	newaction.sa_handler = signal_handler_alarm;
113 	newaction.sa_flags = 0;
114 	sigaction(SIGALRM, &newaction, &oldaction);
115 
116 	/* Collect the parameters passed by the script */
117 	group_num_p = getenv("GROUP_NUM");
118 	mygroup_p = getenv("MYGROUP");
119 	script_pid_p = getenv("SCRIPT_PID");
120 	num_cpus_p = getenv("NUM_CPUS");
121 	test_num_p = getenv("TEST_NUM");
122 	task_num_p = getenv("TASK_NUM");
123 	/* Check if all of them are valid */
124 	if ((test_num_p != NULL)
125 	    && (((test_num = atoi(test_num_p)) <= 8)
126 		&& ((test_num = atoi(test_num_p)) >= 6))) {
127 		if ((group_num_p != NULL) && (mygroup_p != NULL)
128 		    && (script_pid_p != NULL) && (num_cpus_p != NULL)
129 		    && (task_num_p != NULL)) {
130 			mygroup_num = atoi(group_num_p);
131 			scriptpid = atoi(script_pid_p);
132 			num_cpus = atoi(num_cpus_p);
133 			task_num = atoi(task_num_p);
134 			sprintf(mygroup, "%s", mygroup_p);
135 		} else {
136 			tst_brkm(TBROK, cleanup,
137 				 "Invalid other input parameters\n");
138 		}
139 	} else {
140 		tst_brkm(TBROK, cleanup, "Invalid test number passed\n");
141 	}
142 
143 	sprintf(mytaskfile, "%s", mygroup);
144 	sprintf(mysharesfile, "%s", mygroup);
145 	strcat(mytaskfile, "/tasks");
146 	strcat(mysharesfile, "/cpu.shares");
147 	pid = getpid();
148 	write_to_file(mytaskfile, "a", pid);	/* Assign the task to it's group */
149 
150 	fd = open("./myfifo", 0);
151 	if (fd == -1) {
152 		tst_brkm(TBROK, cleanup,
153 			 "Could not open fifo for synchronization");
154 	}
155 
156 	read(fd, &ch, 1);	/* To block all tasks here and fire them up at the same time */
157 
158 	/*
159 	 * We now calculate the expected % cpu time of this task by getting
160 	 * it's group's shares, the total shares of all the groups and the
161 	 * number of tasks in this group.
162 	 */
163 	FLAG = 0;
164 	total_shares = 0;
165 	shares_pointer = &total_shares;
166 	len = strlen(path);
167 	if (!strncpy(fullpath, path, len))
168 		tst_brkm(TBROK, cleanup, "Could not copy directory path %s ",
169 			 path);
170 
171 	if (scan_shares_files(shares_pointer) != 0)
172 		tst_brkm(TBROK, cleanup,
173 			 "From function scan_shares_files in %s ", fullpath);
174 
175 	/* return val: -1 in case of function error, else 2 is min share value */
176 	if ((fmyshares = read_shares_file(mysharesfile)) < 2)
177 		tst_brkm(TBROK, cleanup, "in reading shares files  %s ",
178 			 mysharesfile);
179 
180 	if ((read_file(mytaskfile, GET_TASKS, &num_tasks)) < 0)
181 		tst_brkm(TBROK, cleanup, "in reading tasks files  %s ",
182 			 mytaskfile);
183 
184 	exp_cpu_time = (double)(fmyshares * 100) / (total_shares * num_tasks);
185 
186 	prev_time = time(NULL);	/* Note down the time */
187 
188 	while (1) {
189 		/* Need to run some cpu intensive task, which also frequently checks the timer value */
190 		double f = 274.345, mytime;	/*just a float number to take sqrt */
191 		alarm(TIME_INTERVAL);
192 		timer_expired = 0;
193 		while (!timer_expired)	/* Let the task run on cpu for TIME_INTERVAL */
194 			f = sqrt(f * f);	/* Time of this operation should not be high otherwise we can
195 						 * exceed the TIME_INTERVAL to measure cpu usage
196 						 */
197 		current_time = time(NULL);
198 		delta_time = current_time - prev_time;	/* Duration in case its not exact TIME_INTERVAL */
199 
200 		getrusage(0, &cpu_usage);
201 		total_cpu_time = (cpu_usage.ru_utime.tv_sec + cpu_usage.ru_utime.tv_usec * 1e-6 +	/* user time */
202 				  cpu_usage.ru_stime.tv_sec + cpu_usage.ru_stime.tv_usec * 1e-6);	/* system time */
203 		delta_cpu_time = total_cpu_time - prev_cpu_time;
204 
205 		prev_cpu_time = total_cpu_time;
206 		prev_time = current_time;
207 
208 		/* calculate % cpu time each task gets */
209 		if (delta_time > TIME_INTERVAL)
210 			mytime =
211 			    (delta_cpu_time * 100) / (delta_time * num_cpus);
212 		else
213 			mytime =
214 			    (delta_cpu_time * 100) / (TIME_INTERVAL * num_cpus);
215 
216 		fprintf(stdout, "Grp:-%3d task-%3d:CPU TIME{calc:-%6.2f(s)i.e. %6.2f(%%) exp:-%6.2f(%%)}\
217  in %lu (s) INTERVAL\n", mygroup_num, task_num, delta_cpu_time, mytime,
218 			exp_cpu_time, delta_time);
219 
220 		counter++;
221 
222 		if (counter >= NUM_INTERVALS) {	/* Take n sets of readings for each shares value */
223 			switch (test_num) {
224 			case 6:	/* Test 06 */
225 			case 7:	/* Test 07 */
226 			case 8:	/* Test 08 */
227 				exit(0);	/* This task is done with its job */
228 				break;
229 			default:
230 				tst_brkm(TBROK, cleanup,
231 					 "Invalid test number passed\n");
232 				break;
233 
234 			}	/* end switch */
235 		}		/* end if */
236 	}			/* end while */
237 }				/* end main */
238