ring_buffer_benchmark.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483
  1. /*
  2. * ring buffer tester and benchmark
  3. *
  4. * Copyright (C) 2009 Steven Rostedt <srostedt@redhat.com>
  5. */
  6. #include <linux/ring_buffer.h>
  7. #include <linux/completion.h>
  8. #include <linux/kthread.h>
  9. #include <linux/module.h>
  10. #include <linux/ktime.h>
  11. #include <asm/local.h>
  12. struct rb_page {
  13. u64 ts;
  14. local_t commit;
  15. char data[4080];
  16. };
  17. /* run time and sleep time in seconds */
  18. #define RUN_TIME 10ULL
  19. #define SLEEP_TIME 10
  20. /* number of events for writer to wake up the reader */
  21. static int wakeup_interval = 100;
  22. static int reader_finish;
  23. static struct completion read_start;
  24. static struct completion read_done;
  25. static struct ring_buffer *buffer;
  26. static struct task_struct *producer;
  27. static struct task_struct *consumer;
  28. static unsigned long read;
  29. static int disable_reader;
  30. module_param(disable_reader, uint, 0644);
  31. MODULE_PARM_DESC(disable_reader, "only run producer");
  32. static int write_iteration = 50;
  33. module_param(write_iteration, uint, 0644);
  34. MODULE_PARM_DESC(write_iteration, "# of writes between timestamp readings");
  35. static int producer_nice = MAX_NICE;
  36. static int consumer_nice = MAX_NICE;
  37. static int producer_fifo = -1;
  38. static int consumer_fifo = -1;
  39. module_param(producer_nice, uint, 0644);
  40. MODULE_PARM_DESC(producer_nice, "nice prio for producer");
  41. module_param(consumer_nice, uint, 0644);
  42. MODULE_PARM_DESC(consumer_nice, "nice prio for consumer");
  43. module_param(producer_fifo, uint, 0644);
  44. MODULE_PARM_DESC(producer_fifo, "fifo prio for producer");
  45. module_param(consumer_fifo, uint, 0644);
  46. MODULE_PARM_DESC(consumer_fifo, "fifo prio for consumer");
  47. static int read_events;
  48. static int kill_test;
  49. #define KILL_TEST() \
  50. do { \
  51. if (!kill_test) { \
  52. kill_test = 1; \
  53. WARN_ON(1); \
  54. } \
  55. } while (0)
  56. enum event_status {
  57. EVENT_FOUND,
  58. EVENT_DROPPED,
  59. };
  60. static enum event_status read_event(int cpu)
  61. {
  62. struct ring_buffer_event *event;
  63. int *entry;
  64. u64 ts;
  65. event = ring_buffer_consume(buffer, cpu, &ts, NULL);
  66. if (!event)
  67. return EVENT_DROPPED;
  68. entry = ring_buffer_event_data(event);
  69. if (*entry != cpu) {
  70. KILL_TEST();
  71. return EVENT_DROPPED;
  72. }
  73. read++;
  74. return EVENT_FOUND;
  75. }
  76. static enum event_status read_page(int cpu)
  77. {
  78. struct ring_buffer_event *event;
  79. struct rb_page *rpage;
  80. unsigned long commit;
  81. void *bpage;
  82. int *entry;
  83. int ret;
  84. int inc;
  85. int i;
  86. bpage = ring_buffer_alloc_read_page(buffer, cpu);
  87. if (!bpage)
  88. return EVENT_DROPPED;
  89. ret = ring_buffer_read_page(buffer, &bpage, PAGE_SIZE, cpu, 1);
  90. if (ret >= 0) {
  91. rpage = bpage;
  92. /* The commit may have missed event flags set, clear them */
  93. commit = local_read(&rpage->commit) & 0xfffff;
  94. for (i = 0; i < commit && !kill_test; i += inc) {
  95. if (i >= (PAGE_SIZE - offsetof(struct rb_page, data))) {
  96. KILL_TEST();
  97. break;
  98. }
  99. inc = -1;
  100. event = (void *)&rpage->data[i];
  101. switch (event->type_len) {
  102. case RINGBUF_TYPE_PADDING:
  103. /* failed writes may be discarded events */
  104. if (!event->time_delta)
  105. KILL_TEST();
  106. inc = event->array[0] + 4;
  107. break;
  108. case RINGBUF_TYPE_TIME_EXTEND:
  109. inc = 8;
  110. break;
  111. case 0:
  112. entry = ring_buffer_event_data(event);
  113. if (*entry != cpu) {
  114. KILL_TEST();
  115. break;
  116. }
  117. read++;
  118. if (!event->array[0]) {
  119. KILL_TEST();
  120. break;
  121. }
  122. inc = event->array[0] + 4;
  123. break;
  124. default:
  125. entry = ring_buffer_event_data(event);
  126. if (*entry != cpu) {
  127. KILL_TEST();
  128. break;
  129. }
  130. read++;
  131. inc = ((event->type_len + 1) * 4);
  132. }
  133. if (kill_test)
  134. break;
  135. if (inc <= 0) {
  136. KILL_TEST();
  137. break;
  138. }
  139. }
  140. }
  141. ring_buffer_free_read_page(buffer, bpage);
  142. if (ret < 0)
  143. return EVENT_DROPPED;
  144. return EVENT_FOUND;
  145. }
  146. static void ring_buffer_consumer(void)
  147. {
  148. /* toggle between reading pages and events */
  149. read_events ^= 1;
  150. read = 0;
  151. while (!reader_finish && !kill_test) {
  152. int found;
  153. do {
  154. int cpu;
  155. found = 0;
  156. for_each_online_cpu(cpu) {
  157. enum event_status stat;
  158. if (read_events)
  159. stat = read_event(cpu);
  160. else
  161. stat = read_page(cpu);
  162. if (kill_test)
  163. break;
  164. if (stat == EVENT_FOUND)
  165. found = 1;
  166. }
  167. } while (found && !kill_test);
  168. set_current_state(TASK_INTERRUPTIBLE);
  169. if (reader_finish)
  170. break;
  171. schedule();
  172. }
  173. reader_finish = 0;
  174. complete(&read_done);
  175. }
  176. static void ring_buffer_producer(void)
  177. {
  178. ktime_t start_time, end_time, timeout;
  179. unsigned long long time;
  180. unsigned long long entries;
  181. unsigned long long overruns;
  182. unsigned long missed = 0;
  183. unsigned long hit = 0;
  184. unsigned long avg;
  185. int cnt = 0;
  186. /*
  187. * Hammer the buffer for 10 secs (this may
  188. * make the system stall)
  189. */
  190. trace_printk("Starting ring buffer hammer\n");
  191. start_time = ktime_get();
  192. timeout = ktime_add_ns(start_time, RUN_TIME * NSEC_PER_SEC);
  193. do {
  194. struct ring_buffer_event *event;
  195. int *entry;
  196. int i;
  197. for (i = 0; i < write_iteration; i++) {
  198. event = ring_buffer_lock_reserve(buffer, 10);
  199. if (!event) {
  200. missed++;
  201. } else {
  202. hit++;
  203. entry = ring_buffer_event_data(event);
  204. *entry = smp_processor_id();
  205. ring_buffer_unlock_commit(buffer, event);
  206. }
  207. }
  208. end_time = ktime_get();
  209. cnt++;
  210. if (consumer && !(cnt % wakeup_interval))
  211. wake_up_process(consumer);
  212. #ifndef CONFIG_PREEMPT
  213. /*
  214. * If we are a non preempt kernel, the 10 second run will
  215. * stop everything while it runs. Instead, we will call
  216. * cond_resched and also add any time that was lost by a
  217. * rescedule.
  218. *
  219. * Do a cond resched at the same frequency we would wake up
  220. * the reader.
  221. */
  222. if (cnt % wakeup_interval)
  223. cond_resched();
  224. #endif
  225. } while (ktime_before(end_time, timeout) && !kill_test);
  226. trace_printk("End ring buffer hammer\n");
  227. if (consumer) {
  228. /* Init both completions here to avoid races */
  229. init_completion(&read_start);
  230. init_completion(&read_done);
  231. /* the completions must be visible before the finish var */
  232. smp_wmb();
  233. reader_finish = 1;
  234. /* finish var visible before waking up the consumer */
  235. smp_wmb();
  236. wake_up_process(consumer);
  237. wait_for_completion(&read_done);
  238. }
  239. time = ktime_us_delta(end_time, start_time);
  240. entries = ring_buffer_entries(buffer);
  241. overruns = ring_buffer_overruns(buffer);
  242. if (kill_test)
  243. trace_printk("ERROR!\n");
  244. if (!disable_reader) {
  245. if (consumer_fifo < 0)
  246. trace_printk("Running Consumer at nice: %d\n",
  247. consumer_nice);
  248. else
  249. trace_printk("Running Consumer at SCHED_FIFO %d\n",
  250. consumer_fifo);
  251. }
  252. if (producer_fifo < 0)
  253. trace_printk("Running Producer at nice: %d\n",
  254. producer_nice);
  255. else
  256. trace_printk("Running Producer at SCHED_FIFO %d\n",
  257. producer_fifo);
  258. /* Let the user know that the test is running at low priority */
  259. if (producer_fifo < 0 && consumer_fifo < 0 &&
  260. producer_nice == MAX_NICE && consumer_nice == MAX_NICE)
  261. trace_printk("WARNING!!! This test is running at lowest priority.\n");
  262. trace_printk("Time: %lld (usecs)\n", time);
  263. trace_printk("Overruns: %lld\n", overruns);
  264. if (disable_reader)
  265. trace_printk("Read: (reader disabled)\n");
  266. else
  267. trace_printk("Read: %ld (by %s)\n", read,
  268. read_events ? "events" : "pages");
  269. trace_printk("Entries: %lld\n", entries);
  270. trace_printk("Total: %lld\n", entries + overruns + read);
  271. trace_printk("Missed: %ld\n", missed);
  272. trace_printk("Hit: %ld\n", hit);
  273. /* Convert time from usecs to millisecs */
  274. do_div(time, USEC_PER_MSEC);
  275. if (time)
  276. hit /= (long)time;
  277. else
  278. trace_printk("TIME IS ZERO??\n");
  279. trace_printk("Entries per millisec: %ld\n", hit);
  280. if (hit) {
  281. /* Calculate the average time in nanosecs */
  282. avg = NSEC_PER_MSEC / hit;
  283. trace_printk("%ld ns per entry\n", avg);
  284. }
  285. if (missed) {
  286. if (time)
  287. missed /= (long)time;
  288. trace_printk("Total iterations per millisec: %ld\n",
  289. hit + missed);
  290. /* it is possible that hit + missed will overflow and be zero */
  291. if (!(hit + missed)) {
  292. trace_printk("hit + missed overflowed and totalled zero!\n");
  293. hit--; /* make it non zero */
  294. }
  295. /* Caculate the average time in nanosecs */
  296. avg = NSEC_PER_MSEC / (hit + missed);
  297. trace_printk("%ld ns per entry\n", avg);
  298. }
  299. }
  300. static void wait_to_die(void)
  301. {
  302. set_current_state(TASK_INTERRUPTIBLE);
  303. while (!kthread_should_stop()) {
  304. schedule();
  305. set_current_state(TASK_INTERRUPTIBLE);
  306. }
  307. __set_current_state(TASK_RUNNING);
  308. }
  309. static int ring_buffer_consumer_thread(void *arg)
  310. {
  311. while (!kthread_should_stop() && !kill_test) {
  312. complete(&read_start);
  313. ring_buffer_consumer();
  314. set_current_state(TASK_INTERRUPTIBLE);
  315. if (kthread_should_stop() || kill_test)
  316. break;
  317. schedule();
  318. }
  319. __set_current_state(TASK_RUNNING);
  320. if (kill_test)
  321. wait_to_die();
  322. return 0;
  323. }
  324. static int ring_buffer_producer_thread(void *arg)
  325. {
  326. init_completion(&read_start);
  327. while (!kthread_should_stop() && !kill_test) {
  328. ring_buffer_reset(buffer);
  329. if (consumer) {
  330. smp_wmb();
  331. wake_up_process(consumer);
  332. wait_for_completion(&read_start);
  333. }
  334. ring_buffer_producer();
  335. trace_printk("Sleeping for 10 secs\n");
  336. set_current_state(TASK_INTERRUPTIBLE);
  337. schedule_timeout(HZ * SLEEP_TIME);
  338. }
  339. if (kill_test)
  340. wait_to_die();
  341. return 0;
  342. }
  343. static int __init ring_buffer_benchmark_init(void)
  344. {
  345. int ret;
  346. /* make a one meg buffer in overwite mode */
  347. buffer = ring_buffer_alloc(1000000, RB_FL_OVERWRITE);
  348. if (!buffer)
  349. return -ENOMEM;
  350. if (!disable_reader) {
  351. consumer = kthread_create(ring_buffer_consumer_thread,
  352. NULL, "rb_consumer");
  353. ret = PTR_ERR(consumer);
  354. if (IS_ERR(consumer))
  355. goto out_fail;
  356. }
  357. producer = kthread_run(ring_buffer_producer_thread,
  358. NULL, "rb_producer");
  359. ret = PTR_ERR(producer);
  360. if (IS_ERR(producer))
  361. goto out_kill;
  362. /*
  363. * Run them as low-prio background tasks by default:
  364. */
  365. if (!disable_reader) {
  366. if (consumer_fifo >= 0) {
  367. struct sched_param param = {
  368. .sched_priority = consumer_fifo
  369. };
  370. sched_setscheduler(consumer, SCHED_FIFO, &param);
  371. } else
  372. set_user_nice(consumer, consumer_nice);
  373. }
  374. if (producer_fifo >= 0) {
  375. struct sched_param param = {
  376. .sched_priority = consumer_fifo
  377. };
  378. sched_setscheduler(producer, SCHED_FIFO, &param);
  379. } else
  380. set_user_nice(producer, producer_nice);
  381. return 0;
  382. out_kill:
  383. if (consumer)
  384. kthread_stop(consumer);
  385. out_fail:
  386. ring_buffer_free(buffer);
  387. return ret;
  388. }
  389. static void __exit ring_buffer_benchmark_exit(void)
  390. {
  391. kthread_stop(producer);
  392. if (consumer)
  393. kthread_stop(consumer);
  394. ring_buffer_free(buffer);
  395. }
  396. module_init(ring_buffer_benchmark_init);
  397. module_exit(ring_buffer_benchmark_exit);
  398. MODULE_AUTHOR("Steven Rostedt");
  399. MODULE_DESCRIPTION("ring_buffer_benchmark");
  400. MODULE_LICENSE("GPL");