ring_buffer_benchmark.c 10.7 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * ring buffer tester and benchmark
 *
 * Copyright (C) 2009 Steven Rostedt <srostedt@redhat.com>
 */
#include <linux/ring_buffer.h>
#include <linux/completion.h>
#include <linux/kthread.h>
#include <linux/module.h>
T
Tina Ruchandani 已提交
10
#include <linux/ktime.h>
11
#include <asm/local.h>
12 13 14 15 16 17 18 19

struct rb_page {
	u64		ts;
	local_t		commit;
	char		data[4080];
};

/* run time and sleep time in seconds */
T
Tina Ruchandani 已提交
20
#define RUN_TIME	10ULL
21 22 23 24 25 26
#define SLEEP_TIME	10

/* number of events for writer to wake up the reader */
static int wakeup_interval = 100;

static int reader_finish;
27 28
static DECLARE_COMPLETION(read_start);
static DECLARE_COMPLETION(read_done);
29 30 31 32 33 34

static struct ring_buffer *buffer;
static struct task_struct *producer;
static struct task_struct *consumer;
static unsigned long read;

35
static unsigned int disable_reader;
36 37 38
module_param(disable_reader, uint, 0644);
MODULE_PARM_DESC(disable_reader, "only run producer");

39
static unsigned int write_iteration = 50;
40 41 42
module_param(write_iteration, uint, 0644);
MODULE_PARM_DESC(write_iteration, "# of writes between timestamp readings");

43 44
static int producer_nice = MAX_NICE;
static int consumer_nice = MAX_NICE;
45 46 47 48

static int producer_fifo = -1;
static int consumer_fifo = -1;

49
module_param(producer_nice, int, 0644);
50 51
MODULE_PARM_DESC(producer_nice, "nice prio for producer");

52
module_param(consumer_nice, int, 0644);
53 54
MODULE_PARM_DESC(consumer_nice, "nice prio for consumer");

55
module_param(producer_fifo, int, 0644);
56 57
MODULE_PARM_DESC(producer_fifo, "fifo prio for producer");

58
module_param(consumer_fifo, int, 0644);
59 60
MODULE_PARM_DESC(consumer_fifo, "fifo prio for consumer");

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
static int read_events;

static int kill_test;

#define KILL_TEST()				\
	do {					\
		if (!kill_test) {		\
			kill_test = 1;		\
			WARN_ON(1);		\
		}				\
	} while (0)

enum event_status {
	EVENT_FOUND,
	EVENT_DROPPED,
};

static enum event_status read_event(int cpu)
{
	struct ring_buffer_event *event;
	int *entry;
	u64 ts;

84
	event = ring_buffer_consume(buffer, cpu, &ts, NULL);
85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108
	if (!event)
		return EVENT_DROPPED;

	entry = ring_buffer_event_data(event);
	if (*entry != cpu) {
		KILL_TEST();
		return EVENT_DROPPED;
	}

	read++;
	return EVENT_FOUND;
}

static enum event_status read_page(int cpu)
{
	struct ring_buffer_event *event;
	struct rb_page *rpage;
	unsigned long commit;
	void *bpage;
	int *entry;
	int ret;
	int inc;
	int i;

109
	bpage = ring_buffer_alloc_read_page(buffer, cpu);
110 111 112
	if (!bpage)
		return EVENT_DROPPED;

113 114 115
	ret = ring_buffer_read_page(buffer, &bpage, PAGE_SIZE, cpu, 1);
	if (ret >= 0) {
		rpage = bpage;
116 117
		/* The commit may have missed event flags set, clear them */
		commit = local_read(&rpage->commit) & 0xfffff;
118 119 120 121 122 123 124 125 126 127 128
		for (i = 0; i < commit && !kill_test; i += inc) {

			if (i >= (PAGE_SIZE - offsetof(struct rb_page, data))) {
				KILL_TEST();
				break;
			}

			inc = -1;
			event = (void *)&rpage->data[i];
			switch (event->type_len) {
			case RINGBUF_TYPE_PADDING:
129 130 131 132
				/* failed writes may be discarded events */
				if (!event->time_delta)
					KILL_TEST();
				inc = event->array[0] + 4;
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
				break;
			case RINGBUF_TYPE_TIME_EXTEND:
				inc = 8;
				break;
			case 0:
				entry = ring_buffer_event_data(event);
				if (*entry != cpu) {
					KILL_TEST();
					break;
				}
				read++;
				if (!event->array[0]) {
					KILL_TEST();
					break;
				}
148
				inc = event->array[0] + 4;
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
				break;
			default:
				entry = ring_buffer_event_data(event);
				if (*entry != cpu) {
					KILL_TEST();
					break;
				}
				read++;
				inc = ((event->type_len + 1) * 4);
			}
			if (kill_test)
				break;

			if (inc <= 0) {
				KILL_TEST();
				break;
			}
		}
	}
	ring_buffer_free_read_page(buffer, bpage);

	if (ret < 0)
		return EVENT_DROPPED;
	return EVENT_FOUND;
}

static void ring_buffer_consumer(void)
{
	/* toggle between reading pages and events */
	read_events ^= 1;

	read = 0;
181 182 183 184 185 186
	/*
	 * Continue running until the producer specifically asks to stop
	 * and is ready for the completion.
	 */
	while (!READ_ONCE(reader_finish)) {
		int found = 1;
187

188
		while (found && !kill_test) {
189 190 191 192 193 194 195 196 197 198 199 200 201
			int cpu;

			found = 0;
			for_each_online_cpu(cpu) {
				enum event_status stat;

				if (read_events)
					stat = read_event(cpu);
				else
					stat = read_page(cpu);

				if (kill_test)
					break;
202

203 204
				if (stat == EVENT_FOUND)
					found = 1;
205

206
			}
207
		}
208

209 210 211
		/* Wait till the producer wakes us up when there is more data
		 * available or when the producer wants us to finish reading.
		 */
212 213 214 215 216 217
		set_current_state(TASK_INTERRUPTIBLE);
		if (reader_finish)
			break;

		schedule();
	}
218
	__set_current_state(TASK_RUNNING);
219 220 221 222 223 224
	reader_finish = 0;
	complete(&read_done);
}

static void ring_buffer_producer(void)
{
T
Tina Ruchandani 已提交
225
	ktime_t start_time, end_time, timeout;
226 227 228 229 230 231 232 233 234 235 236 237
	unsigned long long time;
	unsigned long long entries;
	unsigned long long overruns;
	unsigned long missed = 0;
	unsigned long hit = 0;
	unsigned long avg;
	int cnt = 0;

	/*
	 * Hammer the buffer for 10 secs (this may
	 * make the system stall)
	 */
238
	trace_printk("Starting ring buffer hammer\n");
T
Tina Ruchandani 已提交
239 240
	start_time = ktime_get();
	timeout = ktime_add_ns(start_time, RUN_TIME * NSEC_PER_SEC);
241 242 243
	do {
		struct ring_buffer_event *event;
		int *entry;
244 245 246 247 248 249 250 251 252 253 254 255
		int i;

		for (i = 0; i < write_iteration; i++) {
			event = ring_buffer_lock_reserve(buffer, 10);
			if (!event) {
				missed++;
			} else {
				hit++;
				entry = ring_buffer_event_data(event);
				*entry = smp_processor_id();
				ring_buffer_unlock_commit(buffer, event);
			}
256
		}
T
Tina Ruchandani 已提交
257
		end_time = ktime_get();
258

259 260
		cnt++;
		if (consumer && !(cnt % wakeup_interval))
261 262
			wake_up_process(consumer);

263
#ifndef CONFIG_PREEMPT
264 265 266 267 268
		/*
		 * If we are a non preempt kernel, the 10 second run will
		 * stop everything while it runs. Instead, we will call
		 * cond_resched and also add any time that was lost by a
		 * rescedule.
269 270 271
		 *
		 * Do a cond resched at the same frequency we would wake up
		 * the reader.
272
		 */
273 274 275
		if (cnt % wakeup_interval)
			cond_resched();
#endif
276 277
		if (kthread_should_stop())
			kill_test = 1;
278

T
Tina Ruchandani 已提交
279
	} while (ktime_before(end_time, timeout) && !kill_test);
280
	trace_printk("End ring buffer hammer\n");
281 282 283 284 285 286 287 288 289 290 291 292 293 294

	if (consumer) {
		/* Init both completions here to avoid races */
		init_completion(&read_start);
		init_completion(&read_done);
		/* the completions must be visible before the finish var */
		smp_wmb();
		reader_finish = 1;
		/* finish var visible before waking up the consumer */
		smp_wmb();
		wake_up_process(consumer);
		wait_for_completion(&read_done);
	}

T
Tina Ruchandani 已提交
295
	time = ktime_us_delta(end_time, start_time);
296 297 298 299

	entries = ring_buffer_entries(buffer);
	overruns = ring_buffer_overruns(buffer);

300
	if (kill_test && !kthread_should_stop())
301
		trace_printk("ERROR!\n");
302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319

	if (!disable_reader) {
		if (consumer_fifo < 0)
			trace_printk("Running Consumer at nice: %d\n",
				     consumer_nice);
		else
			trace_printk("Running Consumer at SCHED_FIFO %d\n",
				     consumer_fifo);
	}
	if (producer_fifo < 0)
		trace_printk("Running Producer at nice: %d\n",
			     producer_nice);
	else
		trace_printk("Running Producer at SCHED_FIFO %d\n",
			     producer_fifo);

	/* Let the user know that the test is running at low priority */
	if (producer_fifo < 0 && consumer_fifo < 0 &&
320
	    producer_nice == MAX_NICE && consumer_nice == MAX_NICE)
321 322
		trace_printk("WARNING!!! This test is running at lowest priority.\n");

323 324
	trace_printk("Time:     %lld (usecs)\n", time);
	trace_printk("Overruns: %lld\n", overruns);
325
	if (disable_reader)
326
		trace_printk("Read:     (reader disabled)\n");
327
	else
328
		trace_printk("Read:     %ld  (by %s)\n", read,
329
			read_events ? "events" : "pages");
330 331 332 333
	trace_printk("Entries:  %lld\n", entries);
	trace_printk("Total:    %lld\n", entries + overruns + read);
	trace_printk("Missed:   %ld\n", missed);
	trace_printk("Hit:      %ld\n", hit);
334

335 336
	/* Convert time from usecs to millisecs */
	do_div(time, USEC_PER_MSEC);
337 338 339
	if (time)
		hit /= (long)time;
	else
340
		trace_printk("TIME IS ZERO??\n");
341

342
	trace_printk("Entries per millisec: %ld\n", hit);
343 344

	if (hit) {
345 346
		/* Calculate the average time in nanosecs */
		avg = NSEC_PER_MSEC / hit;
347
		trace_printk("%ld ns per entry\n", avg);
348
	}
349 350 351 352 353

	if (missed) {
		if (time)
			missed /= (long)time;

354 355
		trace_printk("Total iterations per millisec: %ld\n",
			     hit + missed);
356

357 358
		/* it is possible that hit + missed will overflow and be zero */
		if (!(hit + missed)) {
359
			trace_printk("hit + missed overflowed and totalled zero!\n");
360 361 362
			hit--; /* make it non zero */
		}

363 364
		/* Caculate the average time in nanosecs */
		avg = NSEC_PER_MSEC / (hit + missed);
365
		trace_printk("%ld ns per entry\n", avg);
366
	}
367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
}

static void wait_to_die(void)
{
	set_current_state(TASK_INTERRUPTIBLE);
	while (!kthread_should_stop()) {
		schedule();
		set_current_state(TASK_INTERRUPTIBLE);
	}
	__set_current_state(TASK_RUNNING);
}

static int ring_buffer_consumer_thread(void *arg)
{
	while (!kthread_should_stop() && !kill_test) {
		complete(&read_start);

		ring_buffer_consumer();

		set_current_state(TASK_INTERRUPTIBLE);
		if (kthread_should_stop() || kill_test)
			break;

		schedule();
	}
	__set_current_state(TASK_RUNNING);

394
	if (!kthread_should_stop())
395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410
		wait_to_die();

	return 0;
}

static int ring_buffer_producer_thread(void *arg)
{
	while (!kthread_should_stop() && !kill_test) {
		ring_buffer_reset(buffer);

		if (consumer) {
			wake_up_process(consumer);
			wait_for_completion(&read_start);
		}

		ring_buffer_producer();
411 412
		if (kill_test)
			goto out_kill;
413

414
		trace_printk("Sleeping for 10 secs\n");
415 416 417 418
		set_current_state(TASK_INTERRUPTIBLE);
		schedule_timeout(HZ * SLEEP_TIME);
	}

419 420
out_kill:
	if (!kthread_should_stop())
421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449
		wait_to_die();

	return 0;
}

static int __init ring_buffer_benchmark_init(void)
{
	int ret;

	/* make a one meg buffer in overwite mode */
	buffer = ring_buffer_alloc(1000000, RB_FL_OVERWRITE);
	if (!buffer)
		return -ENOMEM;

	if (!disable_reader) {
		consumer = kthread_create(ring_buffer_consumer_thread,
					  NULL, "rb_consumer");
		ret = PTR_ERR(consumer);
		if (IS_ERR(consumer))
			goto out_fail;
	}

	producer = kthread_run(ring_buffer_producer_thread,
			       NULL, "rb_producer");
	ret = PTR_ERR(producer);

	if (IS_ERR(producer))
		goto out_kill;

450 451 452
	/*
	 * Run them as low-prio background tasks by default:
	 */
453 454 455 456 457 458 459 460 461 462 463 464
	if (!disable_reader) {
		if (consumer_fifo >= 0) {
			struct sched_param param = {
				.sched_priority = consumer_fifo
			};
			sched_setscheduler(consumer, SCHED_FIFO, &param);
		} else
			set_user_nice(consumer, consumer_nice);
	}

	if (producer_fifo >= 0) {
		struct sched_param param = {
465
			.sched_priority = producer_fifo
466 467 468 469
		};
		sched_setscheduler(producer, SCHED_FIFO, &param);
	} else
		set_user_nice(producer, producer_nice);
470

471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
	return 0;

 out_kill:
	if (consumer)
		kthread_stop(consumer);

 out_fail:
	ring_buffer_free(buffer);
	return ret;
}

static void __exit ring_buffer_benchmark_exit(void)
{
	kthread_stop(producer);
	if (consumer)
		kthread_stop(consumer);
	ring_buffer_free(buffer);
}

module_init(ring_buffer_benchmark_init);
module_exit(ring_buffer_benchmark_exit);

MODULE_AUTHOR("Steven Rostedt");
MODULE_DESCRIPTION("ring_buffer_benchmark");
MODULE_LICENSE("GPL");