buffer_sync.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596
  1. /**
  2. * @file buffer_sync.c
  3. *
  4. * @remark Copyright 2002-2009 OProfile authors
  5. * @remark Read the file COPYING
  6. *
  7. * @author John Levon <levon@movementarian.org>
  8. * @author Barry Kasindorf
  9. * @author Robert Richter <robert.richter@amd.com>
  10. *
  11. * This is the core of the buffer management. Each
  12. * CPU buffer is processed and entered into the
  13. * global event buffer. Such processing is necessary
  14. * in several circumstances, mentioned below.
  15. *
  16. * The processing does the job of converting the
  17. * transitory EIP value into a persistent dentry/offset
  18. * value that the profiler can record at its leisure.
  19. *
  20. * See fs/dcookies.c for a description of the dentry/offset
  21. * objects.
  22. */
  23. #include <linux/mm.h>
  24. #include <linux/workqueue.h>
  25. #include <linux/notifier.h>
  26. #include <linux/dcookies.h>
  27. #include <linux/profile.h>
  28. #include <linux/module.h>
  29. #include <linux/fs.h>
  30. #include <linux/oprofile.h>
  31. #include <linux/sched.h>
  32. #include "oprofile_stats.h"
  33. #include "event_buffer.h"
  34. #include "cpu_buffer.h"
  35. #include "buffer_sync.h"
  36. static LIST_HEAD(dying_tasks);
  37. static LIST_HEAD(dead_tasks);
  38. static cpumask_t marked_cpus = CPU_MASK_NONE;
  39. static DEFINE_SPINLOCK(task_mortuary);
  40. static void process_task_mortuary(void);
  41. /* Take ownership of the task struct and place it on the
  42. * list for processing. Only after two full buffer syncs
  43. * does the task eventually get freed, because by then
  44. * we are sure we will not reference it again.
  45. * Can be invoked from softirq via RCU callback due to
  46. * call_rcu() of the task struct, hence the _irqsave.
  47. */
  48. static int
  49. task_free_notify(struct notifier_block *self, unsigned long val, void *data)
  50. {
  51. unsigned long flags;
  52. struct task_struct *task = data;
  53. spin_lock_irqsave(&task_mortuary, flags);
  54. list_add(&task->tasks, &dying_tasks);
  55. spin_unlock_irqrestore(&task_mortuary, flags);
  56. return NOTIFY_OK;
  57. }
  58. /* The task is on its way out. A sync of the buffer means we can catch
  59. * any remaining samples for this task.
  60. */
  61. static int
  62. task_exit_notify(struct notifier_block *self, unsigned long val, void *data)
  63. {
  64. /* To avoid latency problems, we only process the current CPU,
  65. * hoping that most samples for the task are on this CPU
  66. */
  67. sync_buffer(raw_smp_processor_id());
  68. return 0;
  69. }
  70. /* The task is about to try a do_munmap(). We peek at what it's going to
  71. * do, and if it's an executable region, process the samples first, so
  72. * we don't lose any. This does not have to be exact, it's a QoI issue
  73. * only.
  74. */
  75. static int
  76. munmap_notify(struct notifier_block *self, unsigned long val, void *data)
  77. {
  78. unsigned long addr = (unsigned long)data;
  79. struct mm_struct *mm = current->mm;
  80. struct vm_area_struct *mpnt;
  81. down_read(&mm->mmap_sem);
  82. mpnt = find_vma(mm, addr);
  83. if (mpnt && mpnt->vm_file && (mpnt->vm_flags & VM_EXEC)) {
  84. up_read(&mm->mmap_sem);
  85. /* To avoid latency problems, we only process the current CPU,
  86. * hoping that most samples for the task are on this CPU
  87. */
  88. sync_buffer(raw_smp_processor_id());
  89. return 0;
  90. }
  91. up_read(&mm->mmap_sem);
  92. return 0;
  93. }
  94. /* We need to be told about new modules so we don't attribute to a previously
  95. * loaded module, or drop the samples on the floor.
  96. */
  97. static int
  98. module_load_notify(struct notifier_block *self, unsigned long val, void *data)
  99. {
  100. #ifdef CONFIG_MODULES
  101. if (val != MODULE_STATE_COMING)
  102. return 0;
  103. /* FIXME: should we process all CPU buffers ? */
  104. mutex_lock(&buffer_mutex);
  105. add_event_entry(ESCAPE_CODE);
  106. add_event_entry(MODULE_LOADED_CODE);
  107. mutex_unlock(&buffer_mutex);
  108. #endif
  109. return 0;
  110. }
  111. static struct notifier_block task_free_nb = {
  112. .notifier_call = task_free_notify,
  113. };
  114. static struct notifier_block task_exit_nb = {
  115. .notifier_call = task_exit_notify,
  116. };
  117. static struct notifier_block munmap_nb = {
  118. .notifier_call = munmap_notify,
  119. };
  120. static struct notifier_block module_load_nb = {
  121. .notifier_call = module_load_notify,
  122. };
  123. static void end_sync(void)
  124. {
  125. end_cpu_work();
  126. /* make sure we don't leak task structs */
  127. process_task_mortuary();
  128. process_task_mortuary();
  129. }
  130. int sync_start(void)
  131. {
  132. int err;
  133. start_cpu_work();
  134. err = task_handoff_register(&task_free_nb);
  135. if (err)
  136. goto out1;
  137. err = profile_event_register(PROFILE_TASK_EXIT, &task_exit_nb);
  138. if (err)
  139. goto out2;
  140. err = profile_event_register(PROFILE_MUNMAP, &munmap_nb);
  141. if (err)
  142. goto out3;
  143. err = register_module_notifier(&module_load_nb);
  144. if (err)
  145. goto out4;
  146. out:
  147. return err;
  148. out4:
  149. profile_event_unregister(PROFILE_MUNMAP, &munmap_nb);
  150. out3:
  151. profile_event_unregister(PROFILE_TASK_EXIT, &task_exit_nb);
  152. out2:
  153. task_handoff_unregister(&task_free_nb);
  154. out1:
  155. end_sync();
  156. goto out;
  157. }
  158. void sync_stop(void)
  159. {
  160. unregister_module_notifier(&module_load_nb);
  161. profile_event_unregister(PROFILE_MUNMAP, &munmap_nb);
  162. profile_event_unregister(PROFILE_TASK_EXIT, &task_exit_nb);
  163. task_handoff_unregister(&task_free_nb);
  164. end_sync();
  165. }
  166. /* Optimisation. We can manage without taking the dcookie sem
  167. * because we cannot reach this code without at least one
  168. * dcookie user still being registered (namely, the reader
  169. * of the event buffer). */
  170. static inline unsigned long fast_get_dcookie(struct path *path)
  171. {
  172. unsigned long cookie;
  173. if (path->dentry->d_cookie)
  174. return (unsigned long)path->dentry;
  175. get_dcookie(path, &cookie);
  176. return cookie;
  177. }
  178. /* Look up the dcookie for the task's first VM_EXECUTABLE mapping,
  179. * which corresponds loosely to "application name". This is
  180. * not strictly necessary but allows oprofile to associate
  181. * shared-library samples with particular applications
  182. */
  183. static unsigned long get_exec_dcookie(struct mm_struct *mm)
  184. {
  185. unsigned long cookie = NO_COOKIE;
  186. struct vm_area_struct *vma;
  187. if (!mm)
  188. goto out;
  189. for (vma = mm->mmap; vma; vma = vma->vm_next) {
  190. if (!vma->vm_file)
  191. continue;
  192. if (!(vma->vm_flags & VM_EXECUTABLE))
  193. continue;
  194. cookie = fast_get_dcookie(&vma->vm_file->f_path);
  195. break;
  196. }
  197. out:
  198. return cookie;
  199. }
  200. /* Convert the EIP value of a sample into a persistent dentry/offset
  201. * pair that can then be added to the global event buffer. We make
  202. * sure to do this lookup before a mm->mmap modification happens so
  203. * we don't lose track.
  204. */
  205. static unsigned long
  206. lookup_dcookie(struct mm_struct *mm, unsigned long addr, off_t *offset)
  207. {
  208. unsigned long cookie = NO_COOKIE;
  209. struct vm_area_struct *vma;
  210. for (vma = find_vma(mm, addr); vma; vma = vma->vm_next) {
  211. if (addr < vma->vm_start || addr >= vma->vm_end)
  212. continue;
  213. if (vma->vm_file) {
  214. cookie = fast_get_dcookie(&vma->vm_file->f_path);
  215. *offset = (vma->vm_pgoff << PAGE_SHIFT) + addr -
  216. vma->vm_start;
  217. } else {
  218. /* must be an anonymous map */
  219. *offset = addr;
  220. }
  221. break;
  222. }
  223. if (!vma)
  224. cookie = INVALID_COOKIE;
  225. return cookie;
  226. }
  227. static unsigned long last_cookie = INVALID_COOKIE;
  228. static void add_cpu_switch(int i)
  229. {
  230. add_event_entry(ESCAPE_CODE);
  231. add_event_entry(CPU_SWITCH_CODE);
  232. add_event_entry(i);
  233. last_cookie = INVALID_COOKIE;
  234. }
  235. static void add_kernel_ctx_switch(unsigned int in_kernel)
  236. {
  237. add_event_entry(ESCAPE_CODE);
  238. if (in_kernel)
  239. add_event_entry(KERNEL_ENTER_SWITCH_CODE);
  240. else
  241. add_event_entry(KERNEL_EXIT_SWITCH_CODE);
  242. }
  243. static void
  244. add_user_ctx_switch(struct task_struct const *task, unsigned long cookie)
  245. {
  246. add_event_entry(ESCAPE_CODE);
  247. add_event_entry(CTX_SWITCH_CODE);
  248. add_event_entry(task->pid);
  249. add_event_entry(cookie);
  250. /* Another code for daemon back-compat */
  251. add_event_entry(ESCAPE_CODE);
  252. add_event_entry(CTX_TGID_CODE);
  253. add_event_entry(task->tgid);
  254. }
  255. static void add_cookie_switch(unsigned long cookie)
  256. {
  257. add_event_entry(ESCAPE_CODE);
  258. add_event_entry(COOKIE_SWITCH_CODE);
  259. add_event_entry(cookie);
  260. }
  261. static void add_trace_begin(void)
  262. {
  263. add_event_entry(ESCAPE_CODE);
  264. add_event_entry(TRACE_BEGIN_CODE);
  265. }
  266. #ifdef CONFIG_OPROFILE_IBS
  267. static void add_data(struct op_entry *entry, struct mm_struct *mm)
  268. {
  269. unsigned long code, pc, val;
  270. unsigned long cookie;
  271. off_t offset;
  272. if (!op_cpu_buffer_get_data(entry, &code))
  273. return;
  274. if (!op_cpu_buffer_get_data(entry, &pc))
  275. return;
  276. if (!op_cpu_buffer_get_size(entry))
  277. return;
  278. if (mm) {
  279. cookie = lookup_dcookie(mm, pc, &offset);
  280. if (cookie == NO_COOKIE)
  281. offset = pc;
  282. if (cookie == INVALID_COOKIE) {
  283. atomic_inc(&oprofile_stats.sample_lost_no_mapping);
  284. offset = pc;
  285. }
  286. if (cookie != last_cookie) {
  287. add_cookie_switch(cookie);
  288. last_cookie = cookie;
  289. }
  290. } else
  291. offset = pc;
  292. add_event_entry(ESCAPE_CODE);
  293. add_event_entry(code);
  294. add_event_entry(offset); /* Offset from Dcookie */
  295. while (op_cpu_buffer_get_data(entry, &val))
  296. add_event_entry(val);
  297. }
  298. #endif
  299. static inline void add_sample_entry(unsigned long offset, unsigned long event)
  300. {
  301. add_event_entry(offset);
  302. add_event_entry(event);
  303. }
  304. /*
  305. * Add a sample to the global event buffer. If possible the
  306. * sample is converted into a persistent dentry/offset pair
  307. * for later lookup from userspace. Return 0 on failure.
  308. */
  309. static int
  310. add_sample(struct mm_struct *mm, struct op_sample *s, int in_kernel)
  311. {
  312. unsigned long cookie;
  313. off_t offset;
  314. if (in_kernel) {
  315. add_sample_entry(s->eip, s->event);
  316. return 1;
  317. }
  318. /* add userspace sample */
  319. if (!mm) {
  320. atomic_inc(&oprofile_stats.sample_lost_no_mm);
  321. return 0;
  322. }
  323. cookie = lookup_dcookie(mm, s->eip, &offset);
  324. if (cookie == INVALID_COOKIE) {
  325. atomic_inc(&oprofile_stats.sample_lost_no_mapping);
  326. return 0;
  327. }
  328. if (cookie != last_cookie) {
  329. add_cookie_switch(cookie);
  330. last_cookie = cookie;
  331. }
  332. add_sample_entry(offset, s->event);
  333. return 1;
  334. }
  335. static void release_mm(struct mm_struct *mm)
  336. {
  337. if (!mm)
  338. return;
  339. up_read(&mm->mmap_sem);
  340. mmput(mm);
  341. }
  342. static struct mm_struct *take_tasks_mm(struct task_struct *task)
  343. {
  344. struct mm_struct *mm = get_task_mm(task);
  345. if (mm)
  346. down_read(&mm->mmap_sem);
  347. return mm;
  348. }
  349. static inline int is_code(unsigned long val)
  350. {
  351. return val == ESCAPE_CODE;
  352. }
  353. /* Move tasks along towards death. Any tasks on dead_tasks
  354. * will definitely have no remaining references in any
  355. * CPU buffers at this point, because we use two lists,
  356. * and to have reached the list, it must have gone through
  357. * one full sync already.
  358. */
  359. static void process_task_mortuary(void)
  360. {
  361. unsigned long flags;
  362. LIST_HEAD(local_dead_tasks);
  363. struct task_struct *task;
  364. struct task_struct *ttask;
  365. spin_lock_irqsave(&task_mortuary, flags);
  366. list_splice_init(&dead_tasks, &local_dead_tasks);
  367. list_splice_init(&dying_tasks, &dead_tasks);
  368. spin_unlock_irqrestore(&task_mortuary, flags);
  369. list_for_each_entry_safe(task, ttask, &local_dead_tasks, tasks) {
  370. list_del(&task->tasks);
  371. free_task(task);
  372. }
  373. }
  374. static void mark_done(int cpu)
  375. {
  376. int i;
  377. cpu_set(cpu, marked_cpus);
  378. for_each_online_cpu(i) {
  379. if (!cpu_isset(i, marked_cpus))
  380. return;
  381. }
  382. /* All CPUs have been processed at least once,
  383. * we can process the mortuary once
  384. */
  385. process_task_mortuary();
  386. cpus_clear(marked_cpus);
  387. }
  388. /* FIXME: this is not sufficient if we implement syscall barrier backtrace
  389. * traversal, the code switch to sb_sample_start at first kernel enter/exit
  390. * switch so we need a fifth state and some special handling in sync_buffer()
  391. */
  392. typedef enum {
  393. sb_bt_ignore = -2,
  394. sb_buffer_start,
  395. sb_bt_start,
  396. sb_sample_start,
  397. } sync_buffer_state;
  398. /* Sync one of the CPU's buffers into the global event buffer.
  399. * Here we need to go through each batch of samples punctuated
  400. * by context switch notes, taking the task's mmap_sem and doing
  401. * lookup in task->mm->mmap to convert EIP into dcookie/offset
  402. * value.
  403. */
  404. void sync_buffer(int cpu)
  405. {
  406. struct mm_struct *mm = NULL;
  407. struct mm_struct *oldmm;
  408. unsigned long val;
  409. struct task_struct *new;
  410. unsigned long cookie = 0;
  411. int in_kernel = 1;
  412. sync_buffer_state state = sb_buffer_start;
  413. unsigned int i;
  414. unsigned long available;
  415. unsigned long flags;
  416. struct op_entry entry;
  417. struct op_sample *sample;
  418. mutex_lock(&buffer_mutex);
  419. add_cpu_switch(cpu);
  420. op_cpu_buffer_reset(cpu);
  421. available = op_cpu_buffer_entries(cpu);
  422. for (i = 0; i < available; ++i) {
  423. sample = op_cpu_buffer_read_entry(&entry, cpu);
  424. if (!sample)
  425. break;
  426. if (is_code(sample->eip)) {
  427. flags = sample->event;
  428. if (flags & TRACE_BEGIN) {
  429. state = sb_bt_start;
  430. add_trace_begin();
  431. }
  432. if (flags & KERNEL_CTX_SWITCH) {
  433. /* kernel/userspace switch */
  434. in_kernel = flags & IS_KERNEL;
  435. if (state == sb_buffer_start)
  436. state = sb_sample_start;
  437. add_kernel_ctx_switch(flags & IS_KERNEL);
  438. }
  439. if (flags & USER_CTX_SWITCH
  440. && op_cpu_buffer_get_data(&entry, &val)) {
  441. /* userspace context switch */
  442. new = (struct task_struct *)val;
  443. oldmm = mm;
  444. release_mm(oldmm);
  445. mm = take_tasks_mm(new);
  446. if (mm != oldmm)
  447. cookie = get_exec_dcookie(mm);
  448. add_user_ctx_switch(new, cookie);
  449. }
  450. #ifdef CONFIG_OPROFILE_IBS
  451. if (op_cpu_buffer_get_size(&entry))
  452. add_data(&entry, mm);
  453. #endif
  454. continue;
  455. }
  456. if (state < sb_bt_start)
  457. /* ignore sample */
  458. continue;
  459. if (add_sample(mm, sample, in_kernel))
  460. continue;
  461. /* ignore backtraces if failed to add a sample */
  462. if (state == sb_bt_start) {
  463. state = sb_bt_ignore;
  464. atomic_inc(&oprofile_stats.bt_lost_no_mapping);
  465. }
  466. }
  467. release_mm(mm);
  468. mark_done(cpu);
  469. mutex_unlock(&buffer_mutex);
  470. }
  471. /* The function can be used to add a buffer worth of data directly to
  472. * the kernel buffer. The buffer is assumed to be a circular buffer.
  473. * Take the entries from index start and end at index end, wrapping
  474. * at max_entries.
  475. */
  476. void oprofile_put_buff(unsigned long *buf, unsigned int start,
  477. unsigned int stop, unsigned int max)
  478. {
  479. int i;
  480. i = start;
  481. mutex_lock(&buffer_mutex);
  482. while (i != stop) {
  483. add_event_entry(buf[i++]);
  484. if (i >= max)
  485. i = 0;
  486. }
  487. mutex_unlock(&buffer_mutex);
  488. }