builtin-sched.c 51.7 KB
Newer Older
I
Ingo Molnar 已提交
1
#include "builtin.h"
2
#include "perf.h"
I
Ingo Molnar 已提交
3 4

#include "util/util.h"
5
#include "util/evlist.h"
I
Ingo Molnar 已提交
6
#include "util/cache.h"
7
#include "util/evsel.h"
I
Ingo Molnar 已提交
8 9 10
#include "util/symbol.h"
#include "util/thread.h"
#include "util/header.h"
11
#include "util/session.h"
12
#include "util/tool.h"
13
#include "util/cloexec.h"
J
Jiri Olsa 已提交
14
#include "util/thread_map.h"
15
#include "util/color.h"
I
Ingo Molnar 已提交
16

17
#include <subcmd/parse-options.h>
18
#include "util/trace-event.h"
I
Ingo Molnar 已提交
19 20 21

#include "util/debug.h"

22
#include <sys/prctl.h>
23
#include <sys/resource.h>
I
Ingo Molnar 已提交
24

25 26 27
#include <semaphore.h>
#include <pthread.h>
#include <math.h>
28
#include <api/fs/fs.h>
29
#include <linux/time64.h>
30

31 32 33 34
#define PR_SET_NAME		15               /* Set process name */
#define MAX_CPUS		4096
#define COMM_LEN		20
#define SYM_LEN			129
35
#define MAX_PID			1024000
I
Ingo Molnar 已提交
36

37
struct sched_atom;
I
Ingo Molnar 已提交
38

39 40 41 42
struct task_desc {
	unsigned long		nr;
	unsigned long		pid;
	char			comm[COMM_LEN];
I
Ingo Molnar 已提交
43

44 45
	unsigned long		nr_events;
	unsigned long		curr_event;
46
	struct sched_atom	**atoms;
47 48 49

	pthread_t		thread;
	sem_t			sleep_sem;
I
Ingo Molnar 已提交
50

51 52 53 54 55 56 57 58 59 60
	sem_t			ready_for_work;
	sem_t			work_done_sem;

	u64			cpu_usage;
};

enum sched_event_type {
	SCHED_EVENT_RUN,
	SCHED_EVENT_SLEEP,
	SCHED_EVENT_WAKEUP,
61
	SCHED_EVENT_MIGRATION,
62 63
};

64
struct sched_atom {
65
	enum sched_event_type	type;
66
	int			specific_wait;
67 68 69 70 71 72 73
	u64			timestamp;
	u64			duration;
	unsigned long		nr;
	sem_t			*wait_sem;
	struct task_desc	*wakee;
};

74
#define TASK_STATE_TO_CHAR_STR "RSDTtZXxKWP"
75 76 77 78 79 80 81 82 83 84 85

enum thread_state {
	THREAD_SLEEPING = 0,
	THREAD_WAIT_CPU,
	THREAD_SCHED_IN,
	THREAD_IGNORE
};

struct work_atom {
	struct list_head	list;
	enum thread_state	state;
86
	u64			sched_out_time;
87 88 89 90 91
	u64			wake_up_time;
	u64			sched_in_time;
	u64			runtime;
};

92 93
struct work_atoms {
	struct list_head	work_list;
94 95 96
	struct thread		*thread;
	struct rb_node		node;
	u64			max_lat;
97
	u64			max_lat_at;
98 99 100
	u64			total_lat;
	u64			nb_atoms;
	u64			total_runtime;
101
	int			num_merged;
102 103
};

104
typedef int (*sort_fn_t)(struct work_atoms *, struct work_atoms *);
105

106
struct perf_sched;
107

108 109 110
struct trace_sched_handler {
	int (*switch_event)(struct perf_sched *sched, struct perf_evsel *evsel,
			    struct perf_sample *sample, struct machine *machine);
111

112 113
	int (*runtime_event)(struct perf_sched *sched, struct perf_evsel *evsel,
			     struct perf_sample *sample, struct machine *machine);
114

115 116
	int (*wakeup_event)(struct perf_sched *sched, struct perf_evsel *evsel,
			    struct perf_sample *sample, struct machine *machine);
117

118 119 120
	/* PERF_RECORD_FORK event, not sched_process_fork tracepoint */
	int (*fork_event)(struct perf_sched *sched, union perf_event *event,
			  struct machine *machine);
121 122

	int (*migrate_task_event)(struct perf_sched *sched,
123 124 125
				  struct perf_evsel *evsel,
				  struct perf_sample *sample,
				  struct machine *machine);
126 127
};

J
Jiri Olsa 已提交
128
#define COLOR_PIDS PERF_COLOR_BLUE
J
Jiri Olsa 已提交
129
#define COLOR_CPUS PERF_COLOR_BG_RED
J
Jiri Olsa 已提交
130

131 132 133 134
struct perf_sched_map {
	DECLARE_BITMAP(comp_cpus_mask, MAX_CPUS);
	int			*comp_cpus;
	bool			 comp;
J
Jiri Olsa 已提交
135 136
	struct thread_map	*color_pids;
	const char		*color_pids_str;
J
Jiri Olsa 已提交
137 138
	struct cpu_map		*color_cpus;
	const char		*color_cpus_str;
139 140
	struct cpu_map		*cpus;
	const char		*cpus_str;
141 142
};

143 144 145 146
struct perf_sched {
	struct perf_tool tool;
	const char	 *sort_order;
	unsigned long	 nr_tasks;
147
	struct task_desc **pid_to_task;
148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
	struct task_desc **tasks;
	const struct trace_sched_handler *tp_handler;
	pthread_mutex_t	 start_work_mutex;
	pthread_mutex_t	 work_done_wait_mutex;
	int		 profile_cpu;
/*
 * Track the current task - that way we can know whether there's any
 * weird events, such as a task being switched away that is not current.
 */
	int		 max_cpu;
	u32		 curr_pid[MAX_CPUS];
	struct thread	 *curr_thread[MAX_CPUS];
	char		 next_shortname1;
	char		 next_shortname2;
	unsigned int	 replay_repeat;
	unsigned long	 nr_run_events;
	unsigned long	 nr_sleep_events;
	unsigned long	 nr_wakeup_events;
	unsigned long	 nr_sleep_corrections;
	unsigned long	 nr_run_events_optimized;
	unsigned long	 targetless_wakeups;
	unsigned long	 multitarget_wakeups;
	unsigned long	 nr_runs;
	unsigned long	 nr_timestamps;
	unsigned long	 nr_unordered_timestamps;
	unsigned long	 nr_context_switch_bugs;
	unsigned long	 nr_events;
	unsigned long	 nr_lost_chunks;
	unsigned long	 nr_lost_events;
	u64		 run_measurement_overhead;
	u64		 sleep_measurement_overhead;
	u64		 start_time;
	u64		 cpu_usage;
	u64		 runavg_cpu_usage;
	u64		 parent_cpu_usage;
	u64		 runavg_parent_cpu_usage;
	u64		 sum_runtime;
	u64		 sum_fluct;
	u64		 run_avg;
	u64		 all_runtime;
	u64		 all_count;
	u64		 cpu_last_switched[MAX_CPUS];
190
	struct rb_root	 atom_root, sorted_atom_root, merged_atom_root;
191
	struct list_head sort_list, cmp_pid;
192
	bool force;
193
	bool skip_merge;
194
	struct perf_sched_map map;
195
};
196 197

static u64 get_nsecs(void)
I
Ingo Molnar 已提交
198 199 200 201 202
{
	struct timespec ts;

	clock_gettime(CLOCK_MONOTONIC, &ts);

203
	return ts.tv_sec * NSEC_PER_SEC + ts.tv_nsec;
I
Ingo Molnar 已提交
204 205
}

206
static void burn_nsecs(struct perf_sched *sched, u64 nsecs)
I
Ingo Molnar 已提交
207
{
208
	u64 T0 = get_nsecs(), T1;
I
Ingo Molnar 已提交
209 210 211

	do {
		T1 = get_nsecs();
212
	} while (T1 + sched->run_measurement_overhead < T0 + nsecs);
I
Ingo Molnar 已提交
213 214
}

215
static void sleep_nsecs(u64 nsecs)
I
Ingo Molnar 已提交
216 217 218 219 220 221 222 223 224
{
	struct timespec ts;

	ts.tv_nsec = nsecs % 999999999;
	ts.tv_sec = nsecs / 999999999;

	nanosleep(&ts, NULL);
}

225
static void calibrate_run_measurement_overhead(struct perf_sched *sched)
I
Ingo Molnar 已提交
226
{
227
	u64 T0, T1, delta, min_delta = NSEC_PER_SEC;
I
Ingo Molnar 已提交
228 229 230 231
	int i;

	for (i = 0; i < 10; i++) {
		T0 = get_nsecs();
232
		burn_nsecs(sched, 0);
I
Ingo Molnar 已提交
233 234 235 236
		T1 = get_nsecs();
		delta = T1-T0;
		min_delta = min(min_delta, delta);
	}
237
	sched->run_measurement_overhead = min_delta;
I
Ingo Molnar 已提交
238

239
	printf("run measurement overhead: %" PRIu64 " nsecs\n", min_delta);
I
Ingo Molnar 已提交
240 241
}

242
static void calibrate_sleep_measurement_overhead(struct perf_sched *sched)
I
Ingo Molnar 已提交
243
{
244
	u64 T0, T1, delta, min_delta = NSEC_PER_SEC;
I
Ingo Molnar 已提交
245 246 247 248 249 250 251 252 253 254
	int i;

	for (i = 0; i < 10; i++) {
		T0 = get_nsecs();
		sleep_nsecs(10000);
		T1 = get_nsecs();
		delta = T1-T0;
		min_delta = min(min_delta, delta);
	}
	min_delta -= 10000;
255
	sched->sleep_measurement_overhead = min_delta;
I
Ingo Molnar 已提交
256

257
	printf("sleep measurement overhead: %" PRIu64 " nsecs\n", min_delta);
I
Ingo Molnar 已提交
258 259
}

260
static struct sched_atom *
261
get_new_event(struct task_desc *task, u64 timestamp)
I
Ingo Molnar 已提交
262
{
263
	struct sched_atom *event = zalloc(sizeof(*event));
I
Ingo Molnar 已提交
264 265 266 267 268 269 270
	unsigned long idx = task->nr_events;
	size_t size;

	event->timestamp = timestamp;
	event->nr = idx;

	task->nr_events++;
271 272 273
	size = sizeof(struct sched_atom *) * task->nr_events;
	task->atoms = realloc(task->atoms, size);
	BUG_ON(!task->atoms);
I
Ingo Molnar 已提交
274

275
	task->atoms[idx] = event;
I
Ingo Molnar 已提交
276 277 278 279

	return event;
}

280
static struct sched_atom *last_event(struct task_desc *task)
I
Ingo Molnar 已提交
281 282 283 284
{
	if (!task->nr_events)
		return NULL;

285
	return task->atoms[task->nr_events - 1];
I
Ingo Molnar 已提交
286 287
}

288 289
static void add_sched_event_run(struct perf_sched *sched, struct task_desc *task,
				u64 timestamp, u64 duration)
I
Ingo Molnar 已提交
290
{
291
	struct sched_atom *event, *curr_event = last_event(task);
I
Ingo Molnar 已提交
292 293

	/*
294 295 296
	 * optimize an existing RUN event by merging this one
	 * to it:
	 */
I
Ingo Molnar 已提交
297
	if (curr_event && curr_event->type == SCHED_EVENT_RUN) {
298
		sched->nr_run_events_optimized++;
I
Ingo Molnar 已提交
299 300 301 302 303 304 305 306 307
		curr_event->duration += duration;
		return;
	}

	event = get_new_event(task, timestamp);

	event->type = SCHED_EVENT_RUN;
	event->duration = duration;

308
	sched->nr_run_events++;
I
Ingo Molnar 已提交
309 310
}

311 312
static void add_sched_event_wakeup(struct perf_sched *sched, struct task_desc *task,
				   u64 timestamp, struct task_desc *wakee)
I
Ingo Molnar 已提交
313
{
314
	struct sched_atom *event, *wakee_event;
I
Ingo Molnar 已提交
315 316 317 318 319 320 321

	event = get_new_event(task, timestamp);
	event->type = SCHED_EVENT_WAKEUP;
	event->wakee = wakee;

	wakee_event = last_event(wakee);
	if (!wakee_event || wakee_event->type != SCHED_EVENT_SLEEP) {
322
		sched->targetless_wakeups++;
I
Ingo Molnar 已提交
323 324 325
		return;
	}
	if (wakee_event->wait_sem) {
326
		sched->multitarget_wakeups++;
I
Ingo Molnar 已提交
327 328 329
		return;
	}

330
	wakee_event->wait_sem = zalloc(sizeof(*wakee_event->wait_sem));
I
Ingo Molnar 已提交
331 332 333 334
	sem_init(wakee_event->wait_sem, 0, 0);
	wakee_event->specific_wait = 1;
	event->wait_sem = wakee_event->wait_sem;

335
	sched->nr_wakeup_events++;
I
Ingo Molnar 已提交
336 337
}

338 339
static void add_sched_event_sleep(struct perf_sched *sched, struct task_desc *task,
				  u64 timestamp, u64 task_state __maybe_unused)
I
Ingo Molnar 已提交
340
{
341
	struct sched_atom *event = get_new_event(task, timestamp);
I
Ingo Molnar 已提交
342 343 344

	event->type = SCHED_EVENT_SLEEP;

345
	sched->nr_sleep_events++;
I
Ingo Molnar 已提交
346 347
}

348 349
static struct task_desc *register_pid(struct perf_sched *sched,
				      unsigned long pid, const char *comm)
I
Ingo Molnar 已提交
350 351
{
	struct task_desc *task;
352
	static int pid_max;
I
Ingo Molnar 已提交
353

354 355 356 357 358
	if (sched->pid_to_task == NULL) {
		if (sysctl__read_int("kernel/pid_max", &pid_max) < 0)
			pid_max = MAX_PID;
		BUG_ON((sched->pid_to_task = calloc(pid_max, sizeof(struct task_desc *))) == NULL);
	}
359 360 361 362 363 364
	if (pid >= (unsigned long)pid_max) {
		BUG_ON((sched->pid_to_task = realloc(sched->pid_to_task, (pid + 1) *
			sizeof(struct task_desc *))) == NULL);
		while (pid >= (unsigned long)pid_max)
			sched->pid_to_task[pid_max++] = NULL;
	}
I
Ingo Molnar 已提交
365

366
	task = sched->pid_to_task[pid];
I
Ingo Molnar 已提交
367 368 369 370

	if (task)
		return task;

371
	task = zalloc(sizeof(*task));
I
Ingo Molnar 已提交
372
	task->pid = pid;
373
	task->nr = sched->nr_tasks;
I
Ingo Molnar 已提交
374 375 376 377 378
	strcpy(task->comm, comm);
	/*
	 * every task starts in sleeping state - this gets ignored
	 * if there's no wakeup pointing to this sleep state:
	 */
379
	add_sched_event_sleep(sched, task, 0, 0);
I
Ingo Molnar 已提交
380

381 382
	sched->pid_to_task[pid] = task;
	sched->nr_tasks++;
383
	sched->tasks = realloc(sched->tasks, sched->nr_tasks * sizeof(struct task_desc *));
384 385
	BUG_ON(!sched->tasks);
	sched->tasks[task->nr] = task;
I
Ingo Molnar 已提交
386

I
Ingo Molnar 已提交
387
	if (verbose)
388
		printf("registered task #%ld, PID %ld (%s)\n", sched->nr_tasks, pid, comm);
I
Ingo Molnar 已提交
389 390 391 392 393

	return task;
}


394
static void print_task_traces(struct perf_sched *sched)
I
Ingo Molnar 已提交
395 396 397 398
{
	struct task_desc *task;
	unsigned long i;

399 400
	for (i = 0; i < sched->nr_tasks; i++) {
		task = sched->tasks[i];
I
Ingo Molnar 已提交
401
		printf("task %6ld (%20s:%10ld), nr_events: %ld\n",
I
Ingo Molnar 已提交
402 403 404 405
			task->nr, task->comm, task->pid, task->nr_events);
	}
}

406
static void add_cross_task_wakeups(struct perf_sched *sched)
I
Ingo Molnar 已提交
407 408 409 410
{
	struct task_desc *task1, *task2;
	unsigned long i, j;

411 412
	for (i = 0; i < sched->nr_tasks; i++) {
		task1 = sched->tasks[i];
I
Ingo Molnar 已提交
413
		j = i + 1;
414
		if (j == sched->nr_tasks)
I
Ingo Molnar 已提交
415
			j = 0;
416 417
		task2 = sched->tasks[j];
		add_sched_event_wakeup(sched, task1, 0, task2);
I
Ingo Molnar 已提交
418 419 420
	}
}

421 422
static void perf_sched__process_event(struct perf_sched *sched,
				      struct sched_atom *atom)
I
Ingo Molnar 已提交
423 424 425
{
	int ret = 0;

426
	switch (atom->type) {
I
Ingo Molnar 已提交
427
		case SCHED_EVENT_RUN:
428
			burn_nsecs(sched, atom->duration);
I
Ingo Molnar 已提交
429 430
			break;
		case SCHED_EVENT_SLEEP:
431 432
			if (atom->wait_sem)
				ret = sem_wait(atom->wait_sem);
I
Ingo Molnar 已提交
433 434 435
			BUG_ON(ret);
			break;
		case SCHED_EVENT_WAKEUP:
436 437
			if (atom->wait_sem)
				ret = sem_post(atom->wait_sem);
I
Ingo Molnar 已提交
438 439
			BUG_ON(ret);
			break;
440 441
		case SCHED_EVENT_MIGRATION:
			break;
I
Ingo Molnar 已提交
442 443 444 445 446
		default:
			BUG_ON(1);
	}
}

447
static u64 get_cpu_usage_nsec_parent(void)
I
Ingo Molnar 已提交
448 449
{
	struct rusage ru;
450
	u64 sum;
I
Ingo Molnar 已提交
451 452 453 454 455
	int err;

	err = getrusage(RUSAGE_SELF, &ru);
	BUG_ON(err);

456 457
	sum =  ru.ru_utime.tv_sec * NSEC_PER_SEC + ru.ru_utime.tv_usec * NSEC_PER_USEC;
	sum += ru.ru_stime.tv_sec * NSEC_PER_SEC + ru.ru_stime.tv_usec * NSEC_PER_USEC;
I
Ingo Molnar 已提交
458 459 460 461

	return sum;
}

462
static int self_open_counters(struct perf_sched *sched, unsigned long cur_task)
I
Ingo Molnar 已提交
463
{
464
	struct perf_event_attr attr;
465
	char sbuf[STRERR_BUFSIZE], info[STRERR_BUFSIZE];
466
	int fd;
467 468
	struct rlimit limit;
	bool need_privilege = false;
I
Ingo Molnar 已提交
469

470
	memset(&attr, 0, sizeof(attr));
I
Ingo Molnar 已提交
471

472 473
	attr.type = PERF_TYPE_SOFTWARE;
	attr.config = PERF_COUNT_SW_TASK_CLOCK;
I
Ingo Molnar 已提交
474

475
force_again:
476 477
	fd = sys_perf_event_open(&attr, 0, -1, -1,
				 perf_event_open_cloexec_flag());
478

479
	if (fd < 0) {
480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
		if (errno == EMFILE) {
			if (sched->force) {
				BUG_ON(getrlimit(RLIMIT_NOFILE, &limit) == -1);
				limit.rlim_cur += sched->nr_tasks - cur_task;
				if (limit.rlim_cur > limit.rlim_max) {
					limit.rlim_max = limit.rlim_cur;
					need_privilege = true;
				}
				if (setrlimit(RLIMIT_NOFILE, &limit) == -1) {
					if (need_privilege && errno == EPERM)
						strcpy(info, "Need privilege\n");
				} else
					goto force_again;
			} else
				strcpy(info, "Have a try with -f option\n");
		}
496
		pr_err("Error: sys_perf_event_open() syscall returned "
497
		       "with %d (%s)\n%s", fd,
498
		       str_error_r(errno, sbuf, sizeof(sbuf)), info);
499 500
		exit(EXIT_FAILURE);
	}
501 502 503 504 505 506 507 508 509 510 511 512
	return fd;
}

static u64 get_cpu_usage_nsec_self(int fd)
{
	u64 runtime;
	int ret;

	ret = read(fd, &runtime, sizeof(runtime));
	BUG_ON(ret != sizeof(runtime));

	return runtime;
I
Ingo Molnar 已提交
513 514
}

515 516 517
struct sched_thread_parms {
	struct task_desc  *task;
	struct perf_sched *sched;
518
	int fd;
519 520
};

I
Ingo Molnar 已提交
521 522
static void *thread_func(void *ctx)
{
523 524 525
	struct sched_thread_parms *parms = ctx;
	struct task_desc *this_task = parms->task;
	struct perf_sched *sched = parms->sched;
526
	u64 cpu_usage_0, cpu_usage_1;
I
Ingo Molnar 已提交
527 528
	unsigned long i, ret;
	char comm2[22];
529
	int fd = parms->fd;
I
Ingo Molnar 已提交
530

531
	zfree(&parms);
532

I
Ingo Molnar 已提交
533 534
	sprintf(comm2, ":%s", this_task->comm);
	prctl(PR_SET_NAME, comm2);
535 536
	if (fd < 0)
		return NULL;
I
Ingo Molnar 已提交
537 538 539
again:
	ret = sem_post(&this_task->ready_for_work);
	BUG_ON(ret);
540
	ret = pthread_mutex_lock(&sched->start_work_mutex);
I
Ingo Molnar 已提交
541
	BUG_ON(ret);
542
	ret = pthread_mutex_unlock(&sched->start_work_mutex);
I
Ingo Molnar 已提交
543 544
	BUG_ON(ret);

545
	cpu_usage_0 = get_cpu_usage_nsec_self(fd);
I
Ingo Molnar 已提交
546 547 548

	for (i = 0; i < this_task->nr_events; i++) {
		this_task->curr_event = i;
549
		perf_sched__process_event(sched, this_task->atoms[i]);
I
Ingo Molnar 已提交
550 551
	}

552
	cpu_usage_1 = get_cpu_usage_nsec_self(fd);
I
Ingo Molnar 已提交
553 554 555 556
	this_task->cpu_usage = cpu_usage_1 - cpu_usage_0;
	ret = sem_post(&this_task->work_done_sem);
	BUG_ON(ret);

557
	ret = pthread_mutex_lock(&sched->work_done_wait_mutex);
I
Ingo Molnar 已提交
558
	BUG_ON(ret);
559
	ret = pthread_mutex_unlock(&sched->work_done_wait_mutex);
I
Ingo Molnar 已提交
560 561 562 563 564
	BUG_ON(ret);

	goto again;
}

565
static void create_tasks(struct perf_sched *sched)
I
Ingo Molnar 已提交
566 567 568 569 570 571 572 573
{
	struct task_desc *task;
	pthread_attr_t attr;
	unsigned long i;
	int err;

	err = pthread_attr_init(&attr);
	BUG_ON(err);
574 575
	err = pthread_attr_setstacksize(&attr,
			(size_t) max(16 * 1024, PTHREAD_STACK_MIN));
I
Ingo Molnar 已提交
576
	BUG_ON(err);
577
	err = pthread_mutex_lock(&sched->start_work_mutex);
I
Ingo Molnar 已提交
578
	BUG_ON(err);
579
	err = pthread_mutex_lock(&sched->work_done_wait_mutex);
I
Ingo Molnar 已提交
580
	BUG_ON(err);
581 582 583 584 585
	for (i = 0; i < sched->nr_tasks; i++) {
		struct sched_thread_parms *parms = malloc(sizeof(*parms));
		BUG_ON(parms == NULL);
		parms->task = task = sched->tasks[i];
		parms->sched = sched;
586
		parms->fd = self_open_counters(sched, i);
I
Ingo Molnar 已提交
587 588 589 590
		sem_init(&task->sleep_sem, 0, 0);
		sem_init(&task->ready_for_work, 0, 0);
		sem_init(&task->work_done_sem, 0, 0);
		task->curr_event = 0;
591
		err = pthread_create(&task->thread, &attr, thread_func, parms);
I
Ingo Molnar 已提交
592 593 594 595
		BUG_ON(err);
	}
}

596
static void wait_for_tasks(struct perf_sched *sched)
I
Ingo Molnar 已提交
597
{
598
	u64 cpu_usage_0, cpu_usage_1;
I
Ingo Molnar 已提交
599 600 601
	struct task_desc *task;
	unsigned long i, ret;

602 603 604
	sched->start_time = get_nsecs();
	sched->cpu_usage = 0;
	pthread_mutex_unlock(&sched->work_done_wait_mutex);
I
Ingo Molnar 已提交
605

606 607
	for (i = 0; i < sched->nr_tasks; i++) {
		task = sched->tasks[i];
I
Ingo Molnar 已提交
608 609 610 611
		ret = sem_wait(&task->ready_for_work);
		BUG_ON(ret);
		sem_init(&task->ready_for_work, 0, 0);
	}
612
	ret = pthread_mutex_lock(&sched->work_done_wait_mutex);
I
Ingo Molnar 已提交
613 614 615 616
	BUG_ON(ret);

	cpu_usage_0 = get_cpu_usage_nsec_parent();

617
	pthread_mutex_unlock(&sched->start_work_mutex);
I
Ingo Molnar 已提交
618

619 620
	for (i = 0; i < sched->nr_tasks; i++) {
		task = sched->tasks[i];
I
Ingo Molnar 已提交
621 622 623
		ret = sem_wait(&task->work_done_sem);
		BUG_ON(ret);
		sem_init(&task->work_done_sem, 0, 0);
624
		sched->cpu_usage += task->cpu_usage;
I
Ingo Molnar 已提交
625 626 627 628
		task->cpu_usage = 0;
	}

	cpu_usage_1 = get_cpu_usage_nsec_parent();
629 630
	if (!sched->runavg_cpu_usage)
		sched->runavg_cpu_usage = sched->cpu_usage;
631
	sched->runavg_cpu_usage = (sched->runavg_cpu_usage * (sched->replay_repeat - 1) + sched->cpu_usage) / sched->replay_repeat;
I
Ingo Molnar 已提交
632

633 634 635
	sched->parent_cpu_usage = cpu_usage_1 - cpu_usage_0;
	if (!sched->runavg_parent_cpu_usage)
		sched->runavg_parent_cpu_usage = sched->parent_cpu_usage;
636 637
	sched->runavg_parent_cpu_usage = (sched->runavg_parent_cpu_usage * (sched->replay_repeat - 1) +
					 sched->parent_cpu_usage)/sched->replay_repeat;
I
Ingo Molnar 已提交
638

639
	ret = pthread_mutex_lock(&sched->start_work_mutex);
I
Ingo Molnar 已提交
640 641
	BUG_ON(ret);

642 643
	for (i = 0; i < sched->nr_tasks; i++) {
		task = sched->tasks[i];
I
Ingo Molnar 已提交
644 645 646 647 648
		sem_init(&task->sleep_sem, 0, 0);
		task->curr_event = 0;
	}
}

649
static void run_one_test(struct perf_sched *sched)
I
Ingo Molnar 已提交
650
{
K
Kyle McMartin 已提交
651
	u64 T0, T1, delta, avg_delta, fluct;
I
Ingo Molnar 已提交
652 653

	T0 = get_nsecs();
654
	wait_for_tasks(sched);
I
Ingo Molnar 已提交
655 656 657
	T1 = get_nsecs();

	delta = T1 - T0;
658 659
	sched->sum_runtime += delta;
	sched->nr_runs++;
I
Ingo Molnar 已提交
660

661
	avg_delta = sched->sum_runtime / sched->nr_runs;
I
Ingo Molnar 已提交
662 663 664 665
	if (delta < avg_delta)
		fluct = avg_delta - delta;
	else
		fluct = delta - avg_delta;
666 667 668
	sched->sum_fluct += fluct;
	if (!sched->run_avg)
		sched->run_avg = delta;
669
	sched->run_avg = (sched->run_avg * (sched->replay_repeat - 1) + delta) / sched->replay_repeat;
I
Ingo Molnar 已提交
670

671
	printf("#%-3ld: %0.3f, ", sched->nr_runs, (double)delta / NSEC_PER_MSEC);
I
Ingo Molnar 已提交
672

673
	printf("ravg: %0.2f, ", (double)sched->run_avg / NSEC_PER_MSEC);
I
Ingo Molnar 已提交
674

I
Ingo Molnar 已提交
675
	printf("cpu: %0.2f / %0.2f",
676
		(double)sched->cpu_usage / NSEC_PER_MSEC, (double)sched->runavg_cpu_usage / NSEC_PER_MSEC);
I
Ingo Molnar 已提交
677 678 679

#if 0
	/*
680
	 * rusage statistics done by the parent, these are less
681
	 * accurate than the sched->sum_exec_runtime based statistics:
682
	 */
I
Ingo Molnar 已提交
683
	printf(" [%0.2f / %0.2f]",
684 685
		(double)sched->parent_cpu_usage / NSEC_PER_MSEC,
		(double)sched->runavg_parent_cpu_usage / NSEC_PER_MSEC);
I
Ingo Molnar 已提交
686 687
#endif

I
Ingo Molnar 已提交
688
	printf("\n");
I
Ingo Molnar 已提交
689

690 691 692
	if (sched->nr_sleep_corrections)
		printf(" (%ld sleep corrections)\n", sched->nr_sleep_corrections);
	sched->nr_sleep_corrections = 0;
I
Ingo Molnar 已提交
693 694
}

695
static void test_calibrations(struct perf_sched *sched)
I
Ingo Molnar 已提交
696
{
697
	u64 T0, T1;
I
Ingo Molnar 已提交
698 699

	T0 = get_nsecs();
700
	burn_nsecs(sched, NSEC_PER_MSEC);
I
Ingo Molnar 已提交
701 702
	T1 = get_nsecs();

703
	printf("the run test took %" PRIu64 " nsecs\n", T1 - T0);
I
Ingo Molnar 已提交
704 705

	T0 = get_nsecs();
706
	sleep_nsecs(NSEC_PER_MSEC);
I
Ingo Molnar 已提交
707 708
	T1 = get_nsecs();

709
	printf("the sleep test took %" PRIu64 " nsecs\n", T1 - T0);
I
Ingo Molnar 已提交
710 711
}

712
static int
713
replay_wakeup_event(struct perf_sched *sched,
714 715
		    struct perf_evsel *evsel, struct perf_sample *sample,
		    struct machine *machine __maybe_unused)
716
{
717 718
	const char *comm = perf_evsel__strval(evsel, sample, "comm");
	const u32 pid	 = perf_evsel__intval(evsel, sample, "pid");
719
	struct task_desc *waker, *wakee;
720

I
Ingo Molnar 已提交
721
	if (verbose) {
722
		printf("sched_wakeup event %p\n", evsel);
723

724
		printf(" ... pid %d woke up %s/%d\n", sample->tid, comm, pid);
I
Ingo Molnar 已提交
725
	}
726

727
	waker = register_pid(sched, sample->tid, "<unknown>");
728
	wakee = register_pid(sched, pid, comm);
729

730
	add_sched_event_wakeup(sched, waker, sample->time, wakee);
731
	return 0;
I
Ingo Molnar 已提交
732 733
}

734 735 736 737
static int replay_switch_event(struct perf_sched *sched,
			       struct perf_evsel *evsel,
			       struct perf_sample *sample,
			       struct machine *machine __maybe_unused)
I
Ingo Molnar 已提交
738
{
739 740 741 742 743
	const char *prev_comm  = perf_evsel__strval(evsel, sample, "prev_comm"),
		   *next_comm  = perf_evsel__strval(evsel, sample, "next_comm");
	const u32 prev_pid = perf_evsel__intval(evsel, sample, "prev_pid"),
		  next_pid = perf_evsel__intval(evsel, sample, "next_pid");
	const u64 prev_state = perf_evsel__intval(evsel, sample, "prev_state");
744
	struct task_desc *prev, __maybe_unused *next;
745 746
	u64 timestamp0, timestamp = sample->time;
	int cpu = sample->cpu;
747 748
	s64 delta;

I
Ingo Molnar 已提交
749
	if (verbose)
750
		printf("sched_switch event %p\n", evsel);
I
Ingo Molnar 已提交
751

752
	if (cpu >= MAX_CPUS || cpu < 0)
753
		return 0;
754

755
	timestamp0 = sched->cpu_last_switched[cpu];
756 757 758 759 760
	if (timestamp0)
		delta = timestamp - timestamp0;
	else
		delta = 0;

761
	if (delta < 0) {
762
		pr_err("hm, delta: %" PRIu64 " < 0 ?\n", delta);
763 764
		return -1;
	}
765

766 767
	pr_debug(" ... switch from %s/%d to %s/%d [ran %" PRIu64 " nsecs]\n",
		 prev_comm, prev_pid, next_comm, next_pid, delta);
768

769 770
	prev = register_pid(sched, prev_pid, prev_comm);
	next = register_pid(sched, next_pid, next_comm);
771

772
	sched->cpu_last_switched[cpu] = timestamp;
773

774
	add_sched_event_run(sched, prev, timestamp, delta);
775
	add_sched_event_sleep(sched, prev, timestamp, prev_state);
776 777

	return 0;
778 779
}

780 781 782
static int replay_fork_event(struct perf_sched *sched,
			     union perf_event *event,
			     struct machine *machine)
783
{
784 785
	struct thread *child, *parent;

786 787 788 789
	child = machine__findnew_thread(machine, event->fork.pid,
					event->fork.tid);
	parent = machine__findnew_thread(machine, event->fork.ppid,
					 event->fork.ptid);
790 791 792 793

	if (child == NULL || parent == NULL) {
		pr_debug("thread does not exist on fork event: child %p, parent %p\n",
				 child, parent);
794
		goto out_put;
795
	}
796

797
	if (verbose) {
798
		printf("fork event\n");
799 800
		printf("... parent: %s/%d\n", thread__comm_str(parent), parent->tid);
		printf("...  child: %s/%d\n", thread__comm_str(child), child->tid);
801
	}
802

803 804
	register_pid(sched, parent->tid, thread__comm_str(parent));
	register_pid(sched, child->tid, thread__comm_str(child));
805 806 807
out_put:
	thread__put(child);
	thread__put(parent);
808
	return 0;
809
}
810

811 812
struct sort_dimension {
	const char		*name;
813
	sort_fn_t		cmp;
814 815 816
	struct list_head	list;
};

817
static int
818
thread_lat_cmp(struct list_head *list, struct work_atoms *l, struct work_atoms *r)
819 820 821 822
{
	struct sort_dimension *sort;
	int ret = 0;

823 824
	BUG_ON(list_empty(list));

825 826 827 828 829 830 831 832 833
	list_for_each_entry(sort, list, list) {
		ret = sort->cmp(l, r);
		if (ret)
			return ret;
	}

	return ret;
}

834
static struct work_atoms *
835 836 837 838
thread_atoms_search(struct rb_root *root, struct thread *thread,
			 struct list_head *sort_list)
{
	struct rb_node *node = root->rb_node;
839
	struct work_atoms key = { .thread = thread };
840 841

	while (node) {
842
		struct work_atoms *atoms;
843 844
		int cmp;

845
		atoms = container_of(node, struct work_atoms, node);
846 847 848 849 850 851 852 853 854 855 856 857 858 859

		cmp = thread_lat_cmp(sort_list, &key, atoms);
		if (cmp > 0)
			node = node->rb_left;
		else if (cmp < 0)
			node = node->rb_right;
		else {
			BUG_ON(thread != atoms->thread);
			return atoms;
		}
	}
	return NULL;
}

860
static void
861
__thread_latency_insert(struct rb_root *root, struct work_atoms *data,
862
			 struct list_head *sort_list)
863 864 865 866
{
	struct rb_node **new = &(root->rb_node), *parent = NULL;

	while (*new) {
867
		struct work_atoms *this;
868
		int cmp;
869

870
		this = container_of(*new, struct work_atoms, node);
871
		parent = *new;
872 873 874 875

		cmp = thread_lat_cmp(sort_list, data, this);

		if (cmp > 0)
876 877
			new = &((*new)->rb_left);
		else
878
			new = &((*new)->rb_right);
879 880 881 882 883 884
	}

	rb_link_node(&data->node, parent, new);
	rb_insert_color(&data->node, root);
}

885
static int thread_atoms_insert(struct perf_sched *sched, struct thread *thread)
886
{
887
	struct work_atoms *atoms = zalloc(sizeof(*atoms));
888 889 890 891
	if (!atoms) {
		pr_err("No memory at %s\n", __func__);
		return -1;
	}
892

893
	atoms->thread = thread__get(thread);
894
	INIT_LIST_HEAD(&atoms->work_list);
895
	__thread_latency_insert(&sched->atom_root, atoms, &sched->cmp_pid);
896
	return 0;
897 898
}

899
static char sched_out_state(u64 prev_state)
900 901 902
{
	const char *str = TASK_STATE_TO_CHAR_STR;

903
	return str[prev_state];
904 905
}

906
static int
907 908 909
add_sched_out_event(struct work_atoms *atoms,
		    char run_state,
		    u64 timestamp)
910
{
911
	struct work_atom *atom = zalloc(sizeof(*atom));
912 913 914 915
	if (!atom) {
		pr_err("Non memory at %s", __func__);
		return -1;
	}
916

917 918
	atom->sched_out_time = timestamp;

919
	if (run_state == 'R') {
920
		atom->state = THREAD_WAIT_CPU;
921
		atom->wake_up_time = atom->sched_out_time;
922 923
	}

924
	list_add_tail(&atom->list, &atoms->work_list);
925
	return 0;
926 927 928
}

static void
929 930
add_runtime_event(struct work_atoms *atoms, u64 delta,
		  u64 timestamp __maybe_unused)
931 932 933 934 935 936 937 938 939 940 941 942 943
{
	struct work_atom *atom;

	BUG_ON(list_empty(&atoms->work_list));

	atom = list_entry(atoms->work_list.prev, struct work_atom, list);

	atom->runtime += delta;
	atoms->total_runtime += delta;
}

static void
add_sched_in_event(struct work_atoms *atoms, u64 timestamp)
944
{
945
	struct work_atom *atom;
946
	u64 delta;
947

948
	if (list_empty(&atoms->work_list))
949 950
		return;

951
	atom = list_entry(atoms->work_list.prev, struct work_atom, list);
952

953
	if (atom->state != THREAD_WAIT_CPU)
954 955
		return;

956 957
	if (timestamp < atom->wake_up_time) {
		atom->state = THREAD_IGNORE;
958 959 960
		return;
	}

961 962
	atom->state = THREAD_SCHED_IN;
	atom->sched_in_time = timestamp;
963

964
	delta = atom->sched_in_time - atom->wake_up_time;
965
	atoms->total_lat += delta;
966
	if (delta > atoms->max_lat) {
967
		atoms->max_lat = delta;
968 969
		atoms->max_lat_at = timestamp;
	}
970
	atoms->nb_atoms++;
971 972
}

973 974 975 976
static int latency_switch_event(struct perf_sched *sched,
				struct perf_evsel *evsel,
				struct perf_sample *sample,
				struct machine *machine)
977
{
978 979 980
	const u32 prev_pid = perf_evsel__intval(evsel, sample, "prev_pid"),
		  next_pid = perf_evsel__intval(evsel, sample, "next_pid");
	const u64 prev_state = perf_evsel__intval(evsel, sample, "prev_state");
981
	struct work_atoms *out_events, *in_events;
982
	struct thread *sched_out, *sched_in;
983
	u64 timestamp0, timestamp = sample->time;
984
	int cpu = sample->cpu, err = -1;
I
Ingo Molnar 已提交
985 986
	s64 delta;

987
	BUG_ON(cpu >= MAX_CPUS || cpu < 0);
I
Ingo Molnar 已提交
988

989 990
	timestamp0 = sched->cpu_last_switched[cpu];
	sched->cpu_last_switched[cpu] = timestamp;
I
Ingo Molnar 已提交
991 992 993 994 995
	if (timestamp0)
		delta = timestamp - timestamp0;
	else
		delta = 0;

996 997 998 999
	if (delta < 0) {
		pr_err("hm, delta: %" PRIu64 " < 0 ?\n", delta);
		return -1;
	}
1000

1001 1002
	sched_out = machine__findnew_thread(machine, -1, prev_pid);
	sched_in = machine__findnew_thread(machine, -1, next_pid);
1003 1004
	if (sched_out == NULL || sched_in == NULL)
		goto out_put;
1005

1006
	out_events = thread_atoms_search(&sched->atom_root, sched_out, &sched->cmp_pid);
1007
	if (!out_events) {
1008
		if (thread_atoms_insert(sched, sched_out))
1009
			goto out_put;
1010
		out_events = thread_atoms_search(&sched->atom_root, sched_out, &sched->cmp_pid);
1011 1012
		if (!out_events) {
			pr_err("out-event: Internal tree error");
1013
			goto out_put;
1014
		}
1015
	}
1016
	if (add_sched_out_event(out_events, sched_out_state(prev_state), timestamp))
1017
		return -1;
1018

1019
	in_events = thread_atoms_search(&sched->atom_root, sched_in, &sched->cmp_pid);
1020
	if (!in_events) {
1021
		if (thread_atoms_insert(sched, sched_in))
1022
			goto out_put;
1023
		in_events = thread_atoms_search(&sched->atom_root, sched_in, &sched->cmp_pid);
1024 1025
		if (!in_events) {
			pr_err("in-event: Internal tree error");
1026
			goto out_put;
1027
		}
1028 1029 1030 1031
		/*
		 * Take came in we have not heard about yet,
		 * add in an initial atom in runnable state:
		 */
1032
		if (add_sched_out_event(in_events, 'R', timestamp))
1033
			goto out_put;
1034
	}
1035
	add_sched_in_event(in_events, timestamp);
1036 1037 1038 1039 1040
	err = 0;
out_put:
	thread__put(sched_out);
	thread__put(sched_in);
	return err;
1041
}
1042

1043 1044 1045 1046
static int latency_runtime_event(struct perf_sched *sched,
				 struct perf_evsel *evsel,
				 struct perf_sample *sample,
				 struct machine *machine)
1047
{
1048 1049
	const u32 pid	   = perf_evsel__intval(evsel, sample, "pid");
	const u64 runtime  = perf_evsel__intval(evsel, sample, "runtime");
1050
	struct thread *thread = machine__findnew_thread(machine, -1, pid);
1051
	struct work_atoms *atoms = thread_atoms_search(&sched->atom_root, thread, &sched->cmp_pid);
1052
	u64 timestamp = sample->time;
1053 1054 1055 1056
	int cpu = sample->cpu, err = -1;

	if (thread == NULL)
		return -1;
1057 1058 1059

	BUG_ON(cpu >= MAX_CPUS || cpu < 0);
	if (!atoms) {
1060
		if (thread_atoms_insert(sched, thread))
1061
			goto out_put;
1062
		atoms = thread_atoms_search(&sched->atom_root, thread, &sched->cmp_pid);
1063
		if (!atoms) {
1064
			pr_err("in-event: Internal tree error");
1065
			goto out_put;
1066 1067
		}
		if (add_sched_out_event(atoms, 'R', timestamp))
1068
			goto out_put;
1069 1070
	}

1071
	add_runtime_event(atoms, runtime, timestamp);
1072 1073 1074 1075
	err = 0;
out_put:
	thread__put(thread);
	return err;
1076 1077
}

1078 1079 1080 1081
static int latency_wakeup_event(struct perf_sched *sched,
				struct perf_evsel *evsel,
				struct perf_sample *sample,
				struct machine *machine)
1082
{
1083
	const u32 pid	  = perf_evsel__intval(evsel, sample, "pid");
1084
	struct work_atoms *atoms;
1085
	struct work_atom *atom;
1086
	struct thread *wakee;
1087
	u64 timestamp = sample->time;
1088
	int err = -1;
1089

1090
	wakee = machine__findnew_thread(machine, -1, pid);
1091 1092
	if (wakee == NULL)
		return -1;
1093
	atoms = thread_atoms_search(&sched->atom_root, wakee, &sched->cmp_pid);
1094
	if (!atoms) {
1095
		if (thread_atoms_insert(sched, wakee))
1096
			goto out_put;
1097
		atoms = thread_atoms_search(&sched->atom_root, wakee, &sched->cmp_pid);
1098
		if (!atoms) {
1099
			pr_err("wakeup-event: Internal tree error");
1100
			goto out_put;
1101 1102
		}
		if (add_sched_out_event(atoms, 'S', timestamp))
1103
			goto out_put;
1104 1105
	}

1106
	BUG_ON(list_empty(&atoms->work_list));
1107

1108
	atom = list_entry(atoms->work_list.prev, struct work_atom, list);
1109

1110
	/*
1111 1112 1113 1114 1115 1116
	 * As we do not guarantee the wakeup event happens when
	 * task is out of run queue, also may happen when task is
	 * on run queue and wakeup only change ->state to TASK_RUNNING,
	 * then we should not set the ->wake_up_time when wake up a
	 * task which is on run queue.
	 *
1117 1118
	 * You WILL be missing events if you've recorded only
	 * one CPU, or are only looking at only one, so don't
1119
	 * skip in this case.
1120
	 */
1121
	if (sched->profile_cpu == -1 && atom->state != THREAD_SLEEPING)
1122
		goto out_ok;
1123

1124
	sched->nr_timestamps++;
1125
	if (atom->sched_out_time > timestamp) {
1126
		sched->nr_unordered_timestamps++;
1127
		goto out_ok;
1128
	}
1129

1130 1131
	atom->state = THREAD_WAIT_CPU;
	atom->wake_up_time = timestamp;
1132 1133 1134 1135 1136
out_ok:
	err = 0;
out_put:
	thread__put(wakee);
	return err;
1137 1138
}

1139 1140 1141 1142
static int latency_migrate_task_event(struct perf_sched *sched,
				      struct perf_evsel *evsel,
				      struct perf_sample *sample,
				      struct machine *machine)
1143
{
1144
	const u32 pid = perf_evsel__intval(evsel, sample, "pid");
1145
	u64 timestamp = sample->time;
1146 1147 1148
	struct work_atoms *atoms;
	struct work_atom *atom;
	struct thread *migrant;
1149
	int err = -1;
1150 1151 1152 1153

	/*
	 * Only need to worry about migration when profiling one CPU.
	 */
1154
	if (sched->profile_cpu == -1)
1155
		return 0;
1156

1157
	migrant = machine__findnew_thread(machine, -1, pid);
1158 1159
	if (migrant == NULL)
		return -1;
1160
	atoms = thread_atoms_search(&sched->atom_root, migrant, &sched->cmp_pid);
1161
	if (!atoms) {
1162
		if (thread_atoms_insert(sched, migrant))
1163
			goto out_put;
1164
		register_pid(sched, migrant->tid, thread__comm_str(migrant));
1165
		atoms = thread_atoms_search(&sched->atom_root, migrant, &sched->cmp_pid);
1166
		if (!atoms) {
1167
			pr_err("migration-event: Internal tree error");
1168
			goto out_put;
1169 1170
		}
		if (add_sched_out_event(atoms, 'R', timestamp))
1171
			goto out_put;
1172 1173 1174 1175 1176 1177 1178
	}

	BUG_ON(list_empty(&atoms->work_list));

	atom = list_entry(atoms->work_list.prev, struct work_atom, list);
	atom->sched_in_time = atom->sched_out_time = atom->wake_up_time = timestamp;

1179
	sched->nr_timestamps++;
1180 1181

	if (atom->sched_out_time > timestamp)
1182
		sched->nr_unordered_timestamps++;
1183 1184 1185 1186
	err = 0;
out_put:
	thread__put(migrant);
	return err;
1187 1188
}

1189
static void output_lat_thread(struct perf_sched *sched, struct work_atoms *work_list)
1190 1191 1192
{
	int i;
	int ret;
1193
	u64 avg;
1194

1195
	if (!work_list->nb_atoms)
1196
		return;
1197 1198 1199
	/*
	 * Ignore idle threads:
	 */
1200
	if (!strcmp(thread__comm_str(work_list->thread), "swapper"))
1201
		return;
1202

1203 1204
	sched->all_runtime += work_list->total_runtime;
	sched->all_count   += work_list->nb_atoms;
1205

1206 1207 1208 1209
	if (work_list->num_merged > 1)
		ret = printf("  %s:(%d) ", thread__comm_str(work_list->thread), work_list->num_merged);
	else
		ret = printf("  %s:%d ", thread__comm_str(work_list->thread), work_list->thread->tid);
1210

M
mingo 已提交
1211
	for (i = 0; i < 24 - ret; i++)
1212 1213
		printf(" ");

1214
	avg = work_list->total_lat / work_list->nb_atoms;
1215

1216
	printf("|%11.3f ms |%9" PRIu64 " | avg:%9.3f ms | max:%9.3f ms | max at: %13.6f s\n",
1217 1218 1219 1220
	      (double)work_list->total_runtime / NSEC_PER_MSEC,
		 work_list->nb_atoms, (double)avg / NSEC_PER_MSEC,
		 (double)work_list->max_lat / NSEC_PER_MSEC,
		 (double)work_list->max_lat_at / NSEC_PER_SEC);
1221 1222
}

1223
static int pid_cmp(struct work_atoms *l, struct work_atoms *r)
1224
{
1225 1226
	if (l->thread == r->thread)
		return 0;
1227
	if (l->thread->tid < r->thread->tid)
1228
		return -1;
1229
	if (l->thread->tid > r->thread->tid)
1230
		return 1;
1231
	return (int)(l->thread - r->thread);
1232 1233
}

1234
static int avg_cmp(struct work_atoms *l, struct work_atoms *r)
1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254
{
	u64 avgl, avgr;

	if (!l->nb_atoms)
		return -1;

	if (!r->nb_atoms)
		return 1;

	avgl = l->total_lat / l->nb_atoms;
	avgr = r->total_lat / r->nb_atoms;

	if (avgl < avgr)
		return -1;
	if (avgl > avgr)
		return 1;

	return 0;
}

1255
static int max_cmp(struct work_atoms *l, struct work_atoms *r)
1256 1257 1258 1259 1260 1261 1262 1263 1264
{
	if (l->max_lat < r->max_lat)
		return -1;
	if (l->max_lat > r->max_lat)
		return 1;

	return 0;
}

1265
static int switch_cmp(struct work_atoms *l, struct work_atoms *r)
1266 1267 1268 1269 1270 1271 1272 1273 1274
{
	if (l->nb_atoms < r->nb_atoms)
		return -1;
	if (l->nb_atoms > r->nb_atoms)
		return 1;

	return 0;
}

1275
static int runtime_cmp(struct work_atoms *l, struct work_atoms *r)
1276 1277 1278 1279 1280 1281 1282 1283 1284
{
	if (l->total_runtime < r->total_runtime)
		return -1;
	if (l->total_runtime > r->total_runtime)
		return 1;

	return 0;
}

1285
static int sort_dimension__add(const char *tok, struct list_head *list)
1286
{
1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314
	size_t i;
	static struct sort_dimension avg_sort_dimension = {
		.name = "avg",
		.cmp  = avg_cmp,
	};
	static struct sort_dimension max_sort_dimension = {
		.name = "max",
		.cmp  = max_cmp,
	};
	static struct sort_dimension pid_sort_dimension = {
		.name = "pid",
		.cmp  = pid_cmp,
	};
	static struct sort_dimension runtime_sort_dimension = {
		.name = "runtime",
		.cmp  = runtime_cmp,
	};
	static struct sort_dimension switch_sort_dimension = {
		.name = "switch",
		.cmp  = switch_cmp,
	};
	struct sort_dimension *available_sorts[] = {
		&pid_sort_dimension,
		&avg_sort_dimension,
		&max_sort_dimension,
		&switch_sort_dimension,
		&runtime_sort_dimension,
	};
1315

1316
	for (i = 0; i < ARRAY_SIZE(available_sorts); i++) {
1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
		if (!strcmp(available_sorts[i]->name, tok)) {
			list_add_tail(&available_sorts[i]->list, list);

			return 0;
		}
	}

	return -1;
}

1327
static void perf_sched__sort_lat(struct perf_sched *sched)
1328 1329
{
	struct rb_node *node;
1330 1331
	struct rb_root *root = &sched->atom_root;
again:
1332
	for (;;) {
1333
		struct work_atoms *data;
1334
		node = rb_first(root);
1335 1336 1337
		if (!node)
			break;

1338
		rb_erase(node, root);
1339
		data = rb_entry(node, struct work_atoms, node);
1340
		__thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list);
1341
	}
1342 1343 1344 1345
	if (root == &sched->atom_root) {
		root = &sched->merged_atom_root;
		goto again;
	}
1346 1347
}

1348
static int process_sched_wakeup_event(struct perf_tool *tool,
1349
				      struct perf_evsel *evsel,
1350
				      struct perf_sample *sample,
1351
				      struct machine *machine)
1352
{
1353
	struct perf_sched *sched = container_of(tool, struct perf_sched, tool);
1354

1355 1356
	if (sched->tp_handler->wakeup_event)
		return sched->tp_handler->wakeup_event(sched, evsel, sample, machine);
1357

1358
	return 0;
1359 1360
}

J
Jiri Olsa 已提交
1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392
union map_priv {
	void	*ptr;
	bool	 color;
};

static bool thread__has_color(struct thread *thread)
{
	union map_priv priv = {
		.ptr = thread__priv(thread),
	};

	return priv.color;
}

static struct thread*
map__findnew_thread(struct perf_sched *sched, struct machine *machine, pid_t pid, pid_t tid)
{
	struct thread *thread = machine__findnew_thread(machine, pid, tid);
	union map_priv priv = {
		.color = false,
	};

	if (!sched->map.color_pids || !thread || thread__priv(thread))
		return thread;

	if (thread_map__has(sched->map.color_pids, tid))
		priv.color = true;

	thread__set_priv(thread, priv.ptr);
	return thread;
}

1393 1394
static int map_switch_event(struct perf_sched *sched, struct perf_evsel *evsel,
			    struct perf_sample *sample, struct machine *machine)
1395
{
1396 1397
	const u32 next_pid = perf_evsel__intval(evsel, sample, "next_pid");
	struct thread *sched_in;
1398
	int new_shortname;
1399
	u64 timestamp0, timestamp = sample->time;
1400
	s64 delta;
1401 1402 1403
	int i, this_cpu = sample->cpu;
	int cpus_nr;
	bool new_cpu = false;
1404
	const char *color = PERF_COLOR_NORMAL;
1405 1406 1407

	BUG_ON(this_cpu >= MAX_CPUS || this_cpu < 0);

1408 1409
	if (this_cpu > sched->max_cpu)
		sched->max_cpu = this_cpu;
1410

1411 1412 1413 1414 1415 1416 1417 1418 1419
	if (sched->map.comp) {
		cpus_nr = bitmap_weight(sched->map.comp_cpus_mask, MAX_CPUS);
		if (!test_and_set_bit(this_cpu, sched->map.comp_cpus_mask)) {
			sched->map.comp_cpus[cpus_nr++] = this_cpu;
			new_cpu = true;
		}
	} else
		cpus_nr = sched->max_cpu;

1420 1421
	timestamp0 = sched->cpu_last_switched[this_cpu];
	sched->cpu_last_switched[this_cpu] = timestamp;
1422 1423 1424 1425 1426
	if (timestamp0)
		delta = timestamp - timestamp0;
	else
		delta = 0;

1427
	if (delta < 0) {
1428
		pr_err("hm, delta: %" PRIu64 " < 0 ?\n", delta);
1429 1430
		return -1;
	}
1431

J
Jiri Olsa 已提交
1432
	sched_in = map__findnew_thread(sched, machine, -1, next_pid);
1433 1434
	if (sched_in == NULL)
		return -1;
1435

1436
	sched->curr_thread[this_cpu] = thread__get(sched_in);
1437 1438 1439 1440 1441

	printf("  ");

	new_shortname = 0;
	if (!sched_in->shortname[0]) {
1442 1443 1444 1445 1446 1447 1448
		if (!strcmp(thread__comm_str(sched_in), "swapper")) {
			/*
			 * Don't allocate a letter-number for swapper:0
			 * as a shortname. Instead, we use '.' for it.
			 */
			sched_in->shortname[0] = '.';
			sched_in->shortname[1] = ' ';
1449
		} else {
1450 1451 1452 1453 1454
			sched_in->shortname[0] = sched->next_shortname1;
			sched_in->shortname[1] = sched->next_shortname2;

			if (sched->next_shortname1 < 'Z') {
				sched->next_shortname1++;
1455
			} else {
1456 1457 1458 1459 1460
				sched->next_shortname1 = 'A';
				if (sched->next_shortname2 < '9')
					sched->next_shortname2++;
				else
					sched->next_shortname2 = '0';
1461 1462 1463 1464 1465
			}
		}
		new_shortname = 1;
	}

1466 1467
	for (i = 0; i < cpus_nr; i++) {
		int cpu = sched->map.comp ? sched->map.comp_cpus[i] : i;
J
Jiri Olsa 已提交
1468 1469
		struct thread *curr_thread = sched->curr_thread[cpu];
		const char *pid_color = color;
J
Jiri Olsa 已提交
1470
		const char *cpu_color = color;
J
Jiri Olsa 已提交
1471 1472 1473

		if (curr_thread && thread__has_color(curr_thread))
			pid_color = COLOR_PIDS;
1474

1475 1476 1477
		if (sched->map.cpus && !cpu_map__has(sched->map.cpus, cpu))
			continue;

J
Jiri Olsa 已提交
1478 1479 1480
		if (sched->map.color_cpus && cpu_map__has(sched->map.color_cpus, cpu))
			cpu_color = COLOR_CPUS;

1481
		if (cpu != this_cpu)
J
Jiri Olsa 已提交
1482
			color_fprintf(stdout, cpu_color, " ");
1483
		else
J
Jiri Olsa 已提交
1484
			color_fprintf(stdout, cpu_color, "*");
1485

1486
		if (sched->curr_thread[cpu])
J
Jiri Olsa 已提交
1487
			color_fprintf(stdout, pid_color, "%2s ", sched->curr_thread[cpu]->shortname);
1488
		else
1489
			color_fprintf(stdout, color, "   ");
1490 1491
	}

1492 1493 1494
	if (sched->map.cpus && !cpu_map__has(sched->map.cpus, this_cpu))
		goto out;

1495
	color_fprintf(stdout, color, "  %12.6f secs ", (double)timestamp / NSEC_PER_SEC);
1496
	if (new_shortname) {
J
Jiri Olsa 已提交
1497 1498 1499 1500 1501 1502
		const char *pid_color = color;

		if (thread__has_color(sched_in))
			pid_color = COLOR_PIDS;

		color_fprintf(stdout, pid_color, "%s => %s:%d",
1503
		       sched_in->shortname, thread__comm_str(sched_in), sched_in->tid);
1504
	}
1505

1506
	if (sched->map.comp && new_cpu)
1507
		color_fprintf(stdout, color, " (CPU %d)", this_cpu);
1508

1509
out:
1510
	color_fprintf(stdout, color, "\n");
1511

1512 1513
	thread__put(sched_in);

1514
	return 0;
1515 1516
}

1517
static int process_sched_switch_event(struct perf_tool *tool,
1518
				      struct perf_evsel *evsel,
1519
				      struct perf_sample *sample,
1520
				      struct machine *machine)
1521
{
1522
	struct perf_sched *sched = container_of(tool, struct perf_sched, tool);
1523
	int this_cpu = sample->cpu, err = 0;
1524 1525
	u32 prev_pid = perf_evsel__intval(evsel, sample, "prev_pid"),
	    next_pid = perf_evsel__intval(evsel, sample, "next_pid");
1526

1527
	if (sched->curr_pid[this_cpu] != (u32)-1) {
1528 1529 1530 1531
		/*
		 * Are we trying to switch away a PID that is
		 * not current?
		 */
1532
		if (sched->curr_pid[this_cpu] != prev_pid)
1533
			sched->nr_context_switch_bugs++;
1534 1535
	}

1536 1537
	if (sched->tp_handler->switch_event)
		err = sched->tp_handler->switch_event(sched, evsel, sample, machine);
1538 1539

	sched->curr_pid[this_cpu] = next_pid;
1540
	return err;
1541 1542
}

1543
static int process_sched_runtime_event(struct perf_tool *tool,
1544
				       struct perf_evsel *evsel,
1545
				       struct perf_sample *sample,
1546
				       struct machine *machine)
1547
{
1548
	struct perf_sched *sched = container_of(tool, struct perf_sched, tool);
1549

1550 1551
	if (sched->tp_handler->runtime_event)
		return sched->tp_handler->runtime_event(sched, evsel, sample, machine);
1552

1553
	return 0;
1554 1555
}

1556 1557 1558 1559
static int perf_sched__process_fork_event(struct perf_tool *tool,
					  union perf_event *event,
					  struct perf_sample *sample,
					  struct machine *machine)
1560
{
1561
	struct perf_sched *sched = container_of(tool, struct perf_sched, tool);
1562

1563 1564 1565 1566
	/* run the fork event through the perf machineruy */
	perf_event__process_fork(tool, event, sample, machine);

	/* and then run additional processing needed for this command */
1567
	if (sched->tp_handler->fork_event)
1568
		return sched->tp_handler->fork_event(sched, event, machine);
1569

1570
	return 0;
1571 1572
}

1573
static int process_sched_migrate_task_event(struct perf_tool *tool,
1574
					    struct perf_evsel *evsel,
1575
					    struct perf_sample *sample,
1576
					    struct machine *machine)
1577
{
1578
	struct perf_sched *sched = container_of(tool, struct perf_sched, tool);
1579

1580 1581
	if (sched->tp_handler->migrate_task_event)
		return sched->tp_handler->migrate_task_event(sched, evsel, sample, machine);
1582

1583
	return 0;
1584 1585
}

1586
typedef int (*tracepoint_handler)(struct perf_tool *tool,
1587
				  struct perf_evsel *evsel,
1588
				  struct perf_sample *sample,
1589
				  struct machine *machine);
I
Ingo Molnar 已提交
1590

1591 1592
static int perf_sched__process_tracepoint_sample(struct perf_tool *tool __maybe_unused,
						 union perf_event *event __maybe_unused,
1593 1594 1595
						 struct perf_sample *sample,
						 struct perf_evsel *evsel,
						 struct machine *machine)
I
Ingo Molnar 已提交
1596
{
1597
	int err = 0;
I
Ingo Molnar 已提交
1598

1599 1600
	if (evsel->handler != NULL) {
		tracepoint_handler f = evsel->handler;
1601
		err = f(tool, evsel, sample, machine);
1602
	}
I
Ingo Molnar 已提交
1603

1604
	return err;
I
Ingo Molnar 已提交
1605 1606
}

1607
static int perf_sched__read_events(struct perf_sched *sched)
I
Ingo Molnar 已提交
1608
{
1609 1610 1611 1612 1613 1614 1615
	const struct perf_evsel_str_handler handlers[] = {
		{ "sched:sched_switch",	      process_sched_switch_event, },
		{ "sched:sched_stat_runtime", process_sched_runtime_event, },
		{ "sched:sched_wakeup",	      process_sched_wakeup_event, },
		{ "sched:sched_wakeup_new",   process_sched_wakeup_event, },
		{ "sched:sched_migrate_task", process_sched_migrate_task_event, },
	};
1616
	struct perf_session *session;
1617 1618 1619
	struct perf_data_file file = {
		.path = input_name,
		.mode = PERF_DATA_MODE_READ,
1620
		.force = sched->force,
1621
	};
1622
	int rc = -1;
1623

1624
	session = perf_session__new(&file, false, &sched->tool);
1625 1626 1627 1628
	if (session == NULL) {
		pr_debug("No Memory for session\n");
		return -1;
	}
1629

1630
	symbol__init(&session->header.env);
1631

1632 1633
	if (perf_session__set_tracepoints_handlers(session, handlers))
		goto out_delete;
1634

1635
	if (perf_session__has_traces(session, "record -R")) {
1636
		int err = perf_session__process_events(session);
1637 1638 1639 1640
		if (err) {
			pr_err("Failed to process events, error %d", err);
			goto out_delete;
		}
1641

1642 1643 1644
		sched->nr_events      = session->evlist->stats.nr_events[0];
		sched->nr_lost_events = session->evlist->stats.total_lost;
		sched->nr_lost_chunks = session->evlist->stats.nr_events[PERF_RECORD_LOST];
1645
	}
1646

1647
	rc = 0;
1648 1649
out_delete:
	perf_session__delete(session);
1650
	return rc;
I
Ingo Molnar 已提交
1651 1652
}

1653
static void print_bad_events(struct perf_sched *sched)
1654
{
1655
	if (sched->nr_unordered_timestamps && sched->nr_timestamps) {
1656
		printf("  INFO: %.3f%% unordered timestamps (%ld out of %ld)\n",
1657 1658
			(double)sched->nr_unordered_timestamps/(double)sched->nr_timestamps*100.0,
			sched->nr_unordered_timestamps, sched->nr_timestamps);
1659
	}
1660
	if (sched->nr_lost_events && sched->nr_events) {
1661
		printf("  INFO: %.3f%% lost events (%ld out of %ld, in %ld chunks)\n",
1662 1663
			(double)sched->nr_lost_events/(double)sched->nr_events * 100.0,
			sched->nr_lost_events, sched->nr_events, sched->nr_lost_chunks);
1664
	}
1665
	if (sched->nr_context_switch_bugs && sched->nr_timestamps) {
1666
		printf("  INFO: %.3f%% context switch bugs (%ld out of %ld)",
1667 1668 1669
			(double)sched->nr_context_switch_bugs/(double)sched->nr_timestamps*100.0,
			sched->nr_context_switch_bugs, sched->nr_timestamps);
		if (sched->nr_lost_events)
1670 1671 1672 1673 1674
			printf(" (due to lost events?)");
		printf("\n");
	}
}

1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727
static void __merge_work_atoms(struct rb_root *root, struct work_atoms *data)
{
	struct rb_node **new = &(root->rb_node), *parent = NULL;
	struct work_atoms *this;
	const char *comm = thread__comm_str(data->thread), *this_comm;

	while (*new) {
		int cmp;

		this = container_of(*new, struct work_atoms, node);
		parent = *new;

		this_comm = thread__comm_str(this->thread);
		cmp = strcmp(comm, this_comm);
		if (cmp > 0) {
			new = &((*new)->rb_left);
		} else if (cmp < 0) {
			new = &((*new)->rb_right);
		} else {
			this->num_merged++;
			this->total_runtime += data->total_runtime;
			this->nb_atoms += data->nb_atoms;
			this->total_lat += data->total_lat;
			list_splice(&data->work_list, &this->work_list);
			if (this->max_lat < data->max_lat) {
				this->max_lat = data->max_lat;
				this->max_lat_at = data->max_lat_at;
			}
			zfree(&data);
			return;
		}
	}

	data->num_merged++;
	rb_link_node(&data->node, parent, new);
	rb_insert_color(&data->node, root);
}

static void perf_sched__merge_lat(struct perf_sched *sched)
{
	struct work_atoms *data;
	struct rb_node *node;

	if (sched->skip_merge)
		return;

	while ((node = rb_first(&sched->atom_root))) {
		rb_erase(node, &sched->atom_root);
		data = rb_entry(node, struct work_atoms, node);
		__merge_work_atoms(&sched->merged_atom_root, data);
	}
}

1728
static int perf_sched__lat(struct perf_sched *sched)
1729 1730 1731 1732
{
	struct rb_node *next;

	setup_pager();
1733

1734
	if (perf_sched__read_events(sched))
1735
		return -1;
1736

1737
	perf_sched__merge_lat(sched);
1738
	perf_sched__sort_lat(sched);
1739

1740 1741 1742
	printf("\n -----------------------------------------------------------------------------------------------------------------\n");
	printf("  Task                  |   Runtime ms  | Switches | Average delay ms | Maximum delay ms | Maximum delay at       |\n");
	printf(" -----------------------------------------------------------------------------------------------------------------\n");
1743

1744
	next = rb_first(&sched->sorted_atom_root);
1745 1746 1747 1748 1749

	while (next) {
		struct work_atoms *work_list;

		work_list = rb_entry(next, struct work_atoms, node);
1750
		output_lat_thread(sched, work_list);
1751
		next = rb_next(next);
1752
		thread__zput(work_list->thread);
1753 1754
	}

1755
	printf(" -----------------------------------------------------------------------------------------------------------------\n");
1756
	printf("  TOTAL:                |%11.3f ms |%9" PRIu64 " |\n",
1757
		(double)sched->all_runtime / NSEC_PER_MSEC, sched->all_count);
1758 1759 1760

	printf(" ---------------------------------------------------\n");

1761
	print_bad_events(sched);
1762 1763
	printf("\n");

1764
	return 0;
1765 1766
}

1767 1768
static int setup_map_cpus(struct perf_sched *sched)
{
1769 1770
	struct cpu_map *map;

1771 1772 1773 1774
	sched->max_cpu  = sysconf(_SC_NPROCESSORS_CONF);

	if (sched->map.comp) {
		sched->map.comp_cpus = zalloc(sched->max_cpu * sizeof(int));
J
Jiri Olsa 已提交
1775 1776
		if (!sched->map.comp_cpus)
			return -1;
1777 1778
	}

1779 1780 1781 1782 1783 1784 1785 1786 1787 1788
	if (!sched->map.cpus_str)
		return 0;

	map = cpu_map__new(sched->map.cpus_str);
	if (!map) {
		pr_err("failed to get cpus map from %s\n", sched->map.cpus_str);
		return -1;
	}

	sched->map.cpus = map;
1789 1790 1791
	return 0;
}

J
Jiri Olsa 已提交
1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808
static int setup_color_pids(struct perf_sched *sched)
{
	struct thread_map *map;

	if (!sched->map.color_pids_str)
		return 0;

	map = thread_map__new_by_tid_str(sched->map.color_pids_str);
	if (!map) {
		pr_err("failed to get thread map from %s\n", sched->map.color_pids_str);
		return -1;
	}

	sched->map.color_pids = map;
	return 0;
}

J
Jiri Olsa 已提交
1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825
static int setup_color_cpus(struct perf_sched *sched)
{
	struct cpu_map *map;

	if (!sched->map.color_cpus_str)
		return 0;

	map = cpu_map__new(sched->map.color_cpus_str);
	if (!map) {
		pr_err("failed to get thread map from %s\n", sched->map.color_cpus_str);
		return -1;
	}

	sched->map.color_cpus = map;
	return 0;
}

1826
static int perf_sched__map(struct perf_sched *sched)
1827
{
1828 1829
	if (setup_map_cpus(sched))
		return -1;
1830

J
Jiri Olsa 已提交
1831 1832 1833
	if (setup_color_pids(sched))
		return -1;

J
Jiri Olsa 已提交
1834 1835 1836
	if (setup_color_cpus(sched))
		return -1;

1837
	setup_pager();
1838
	if (perf_sched__read_events(sched))
1839
		return -1;
1840
	print_bad_events(sched);
1841
	return 0;
1842 1843
}

1844
static int perf_sched__replay(struct perf_sched *sched)
1845 1846 1847
{
	unsigned long i;

1848 1849
	calibrate_run_measurement_overhead(sched);
	calibrate_sleep_measurement_overhead(sched);
1850

1851
	test_calibrations(sched);
1852

1853
	if (perf_sched__read_events(sched))
1854
		return -1;
1855

1856 1857 1858
	printf("nr_run_events:        %ld\n", sched->nr_run_events);
	printf("nr_sleep_events:      %ld\n", sched->nr_sleep_events);
	printf("nr_wakeup_events:     %ld\n", sched->nr_wakeup_events);
1859

1860 1861 1862 1863 1864
	if (sched->targetless_wakeups)
		printf("target-less wakeups:  %ld\n", sched->targetless_wakeups);
	if (sched->multitarget_wakeups)
		printf("multi-target wakeups: %ld\n", sched->multitarget_wakeups);
	if (sched->nr_run_events_optimized)
1865
		printf("run atoms optimized: %ld\n",
1866
			sched->nr_run_events_optimized);
1867

1868 1869
	print_task_traces(sched);
	add_cross_task_wakeups(sched);
1870

1871
	create_tasks(sched);
1872
	printf("------------------------------------------------------------\n");
1873 1874
	for (i = 0; i < sched->replay_repeat; i++)
		run_one_test(sched);
1875 1876

	return 0;
1877 1878
}

1879 1880
static void setup_sorting(struct perf_sched *sched, const struct option *options,
			  const char * const usage_msg[])
1881
{
1882
	char *tmp, *tok, *str = strdup(sched->sort_order);
1883 1884 1885

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
1886
		if (sort_dimension__add(tok, &sched->sort_list) < 0) {
1887 1888
			usage_with_options_msg(usage_msg, options,
					"Unknown --sort key: `%s'", tok);
1889 1890 1891 1892 1893
		}
	}

	free(str);

1894
	sort_dimension__add("pid", &sched->cmp_pid);
1895 1896
}

1897 1898 1899 1900
static int __cmd_record(int argc, const char **argv)
{
	unsigned int rec_argc, i, j;
	const char **rec_argv;
1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913
	const char * const record_args[] = {
		"record",
		"-a",
		"-R",
		"-m", "1024",
		"-c", "1",
		"-e", "sched:sched_switch",
		"-e", "sched:sched_stat_wait",
		"-e", "sched:sched_stat_sleep",
		"-e", "sched:sched_stat_iowait",
		"-e", "sched:sched_stat_runtime",
		"-e", "sched:sched_process_fork",
		"-e", "sched:sched_wakeup",
1914
		"-e", "sched:sched_wakeup_new",
1915 1916
		"-e", "sched:sched_migrate_task",
	};
1917 1918 1919 1920

	rec_argc = ARRAY_SIZE(record_args) + argc - 1;
	rec_argv = calloc(rec_argc + 1, sizeof(char *));

1921
	if (rec_argv == NULL)
1922 1923
		return -ENOMEM;

1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934
	for (i = 0; i < ARRAY_SIZE(record_args); i++)
		rec_argv[i] = strdup(record_args[i]);

	for (j = 1; j < (unsigned int)argc; j++, i++)
		rec_argv[i] = argv[j];

	BUG_ON(i != rec_argc);

	return cmd_record(i, rec_argv, NULL);
}

1935
int cmd_sched(int argc, const char **argv, const char *prefix __maybe_unused)
I
Ingo Molnar 已提交
1936
{
1937 1938 1939 1940 1941 1942 1943
	const char default_sort_order[] = "avg, max, switch, runtime";
	struct perf_sched sched = {
		.tool = {
			.sample		 = perf_sched__process_tracepoint_sample,
			.comm		 = perf_event__process_comm,
			.lost		 = perf_event__process_lost,
			.fork		 = perf_sched__process_fork_event,
1944
			.ordered_events = true,
1945 1946 1947 1948 1949 1950 1951 1952 1953 1954
		},
		.cmp_pid	      = LIST_HEAD_INIT(sched.cmp_pid),
		.sort_list	      = LIST_HEAD_INIT(sched.sort_list),
		.start_work_mutex     = PTHREAD_MUTEX_INITIALIZER,
		.work_done_wait_mutex = PTHREAD_MUTEX_INITIALIZER,
		.sort_order	      = default_sort_order,
		.replay_repeat	      = 10,
		.profile_cpu	      = -1,
		.next_shortname1      = 'A',
		.next_shortname2      = '0',
1955
		.skip_merge           = 0,
1956
	};
1957 1958 1959 1960 1961 1962 1963 1964 1965
	const struct option latency_options[] = {
	OPT_STRING('s', "sort", &sched.sort_order, "key[,key2...]",
		   "sort by key(s): runtime, switch, avg, max"),
	OPT_INCR('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
	OPT_INTEGER('C', "CPU", &sched.profile_cpu,
		    "CPU to profile on"),
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
1966 1967
	OPT_BOOLEAN('p', "pids", &sched.skip_merge,
		    "latency stats per pid instead of per comm"),
1968 1969 1970 1971 1972 1973 1974 1975 1976
	OPT_END()
	};
	const struct option replay_options[] = {
	OPT_UINTEGER('r', "repeat", &sched.replay_repeat,
		     "repeat the workload replay N times (-1: infinite)"),
	OPT_INCR('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
1977
	OPT_BOOLEAN('f', "force", &sched.force, "don't complain, do it"),
1978 1979 1980
	OPT_END()
	};
	const struct option sched_options[] = {
1981
	OPT_STRING('i', "input", &input_name, "file",
1982 1983 1984 1985 1986 1987 1988
		    "input file name"),
	OPT_INCR('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
	OPT_END()
	};
1989 1990 1991
	const struct option map_options[] = {
	OPT_BOOLEAN(0, "compact", &sched.map.comp,
		    "map output in compact mode"),
J
Jiri Olsa 已提交
1992 1993
	OPT_STRING(0, "color-pids", &sched.map.color_pids_str, "pids",
		   "highlight given pids in map"),
J
Jiri Olsa 已提交
1994 1995
	OPT_STRING(0, "color-cpus", &sched.map.color_cpus_str, "cpus",
                    "highlight given CPUs in map"),
1996 1997
	OPT_STRING(0, "cpus", &sched.map.cpus_str, "cpus",
                    "display given CPUs in map"),
1998 1999
	OPT_END()
	};
2000 2001 2002 2003 2004 2005 2006 2007
	const char * const latency_usage[] = {
		"perf sched latency [<options>]",
		NULL
	};
	const char * const replay_usage[] = {
		"perf sched replay [<options>]",
		NULL
	};
2008 2009 2010 2011
	const char * const map_usage[] = {
		"perf sched map [<options>]",
		NULL
	};
2012 2013 2014 2015
	const char *const sched_subcommands[] = { "record", "latency", "map",
						  "replay", "script", NULL };
	const char *sched_usage[] = {
		NULL,
2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031
		NULL
	};
	struct trace_sched_handler lat_ops  = {
		.wakeup_event	    = latency_wakeup_event,
		.switch_event	    = latency_switch_event,
		.runtime_event	    = latency_runtime_event,
		.migrate_task_event = latency_migrate_task_event,
	};
	struct trace_sched_handler map_ops  = {
		.switch_event	    = map_switch_event,
	};
	struct trace_sched_handler replay_ops  = {
		.wakeup_event	    = replay_wakeup_event,
		.switch_event	    = replay_switch_event,
		.fork_event	    = replay_fork_event,
	};
A
Adrian Hunter 已提交
2032 2033 2034 2035
	unsigned int i;

	for (i = 0; i < ARRAY_SIZE(sched.curr_pid); i++)
		sched.curr_pid[i] = -1;
2036

2037 2038
	argc = parse_options_subcommand(argc, argv, sched_options, sched_subcommands,
					sched_usage, PARSE_OPT_STOP_AT_NON_OPTION);
2039 2040
	if (!argc)
		usage_with_options(sched_usage, sched_options);
I
Ingo Molnar 已提交
2041

2042
	/*
2043
	 * Aliased to 'perf script' for now:
2044
	 */
2045 2046
	if (!strcmp(argv[0], "script"))
		return cmd_script(argc, argv, prefix);
2047

2048 2049 2050
	if (!strncmp(argv[0], "rec", 3)) {
		return __cmd_record(argc, argv);
	} else if (!strncmp(argv[0], "lat", 3)) {
2051
		sched.tp_handler = &lat_ops;
2052 2053 2054 2055 2056
		if (argc > 1) {
			argc = parse_options(argc, argv, latency_options, latency_usage, 0);
			if (argc)
				usage_with_options(latency_usage, latency_options);
		}
2057 2058
		setup_sorting(&sched, latency_options, latency_usage);
		return perf_sched__lat(&sched);
2059
	} else if (!strcmp(argv[0], "map")) {
2060
		if (argc) {
J
Jiri Olsa 已提交
2061
			argc = parse_options(argc, argv, map_options, map_usage, 0);
2062 2063 2064
			if (argc)
				usage_with_options(map_usage, map_options);
		}
2065 2066 2067
		sched.tp_handler = &map_ops;
		setup_sorting(&sched, latency_options, latency_usage);
		return perf_sched__map(&sched);
2068
	} else if (!strncmp(argv[0], "rep", 3)) {
2069
		sched.tp_handler = &replay_ops;
2070 2071 2072 2073 2074
		if (argc) {
			argc = parse_options(argc, argv, replay_options, replay_usage, 0);
			if (argc)
				usage_with_options(replay_usage, replay_options);
		}
2075
		return perf_sched__replay(&sched);
2076 2077 2078 2079
	} else {
		usage_with_options(sched_usage, sched_options);
	}

I
Ingo Molnar 已提交
2080
	return 0;
I
Ingo Molnar 已提交
2081
}