ebpf_hardirq.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458
  1. // SPDX-License-Identifier: GPL-3.0-or-later
  2. #include "ebpf.h"
  3. #include "ebpf_hardirq.h"
  4. struct config hardirq_config = { .first_section = NULL,
  5. .last_section = NULL,
  6. .mutex = NETDATA_MUTEX_INITIALIZER,
  7. .index = { .avl_tree = { .root = NULL, .compar = appconfig_section_compare },
  8. .rwlock = AVL_LOCK_INITIALIZER } };
  9. #define HARDIRQ_MAP_LATENCY 0
  10. #define HARDIRQ_MAP_LATENCY_STATIC 1
  11. static ebpf_local_maps_t hardirq_maps[] = {
  12. {
  13. .name = "tbl_hardirq",
  14. .internal_input = NETDATA_HARDIRQ_MAX_IRQS,
  15. .user_input = 0,
  16. .type = NETDATA_EBPF_MAP_STATIC,
  17. .map_fd = ND_EBPF_MAP_FD_NOT_INITIALIZED
  18. },
  19. {
  20. .name = "tbl_hardirq_static",
  21. .internal_input = HARDIRQ_EBPF_STATIC_END,
  22. .user_input = 0,
  23. .type = NETDATA_EBPF_MAP_STATIC,
  24. .map_fd = ND_EBPF_MAP_FD_NOT_INITIALIZED
  25. },
  26. /* end */
  27. {
  28. .name = NULL,
  29. .internal_input = 0,
  30. .user_input = 0,
  31. .type = NETDATA_EBPF_MAP_CONTROLLER,
  32. .map_fd = ND_EBPF_MAP_FD_NOT_INITIALIZED
  33. }
  34. };
  35. #define HARDIRQ_TP_CLASS_IRQ "irq"
  36. #define HARDIRQ_TP_CLASS_IRQ_VECTORS "irq_vectors"
  37. static ebpf_tracepoint_t hardirq_tracepoints[] = {
  38. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ, .event = "irq_handler_entry"},
  39. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ, .event = "irq_handler_exit"},
  40. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "thermal_apic_entry"},
  41. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "thermal_apic_exit"},
  42. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "threshold_apic_entry"},
  43. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "threshold_apic_exit"},
  44. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "error_apic_entry"},
  45. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "error_apic_exit"},
  46. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "deferred_error_apic_entry"},
  47. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "deferred_error_apic_exit"},
  48. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "spurious_apic_entry"},
  49. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "spurious_apic_exit"},
  50. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "call_function_entry"},
  51. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "call_function_exit"},
  52. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "call_function_single_entry"},
  53. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "call_function_single_exit"},
  54. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "reschedule_entry"},
  55. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "reschedule_exit"},
  56. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "local_timer_entry"},
  57. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "local_timer_exit"},
  58. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "irq_work_entry"},
  59. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "irq_work_exit"},
  60. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "x86_platform_ipi_entry"},
  61. {.enabled = false, .class = HARDIRQ_TP_CLASS_IRQ_VECTORS, .event = "x86_platform_ipi_exit"},
  62. /* end */
  63. {.enabled = false, .class = NULL, .event = NULL}
  64. };
  65. static hardirq_static_val_t hardirq_static_vals[] = {
  66. {
  67. .idx = HARDIRQ_EBPF_STATIC_APIC_THERMAL,
  68. .name = "apic_thermal",
  69. .latency = 0
  70. },
  71. {
  72. .idx = HARDIRQ_EBPF_STATIC_APIC_THRESHOLD,
  73. .name = "apic_threshold",
  74. .latency = 0
  75. },
  76. {
  77. .idx = HARDIRQ_EBPF_STATIC_APIC_ERROR,
  78. .name = "apic_error",
  79. .latency = 0
  80. },
  81. {
  82. .idx = HARDIRQ_EBPF_STATIC_APIC_DEFERRED_ERROR,
  83. .name = "apic_deferred_error",
  84. .latency = 0
  85. },
  86. {
  87. .idx = HARDIRQ_EBPF_STATIC_APIC_SPURIOUS,
  88. .name = "apic_spurious",
  89. .latency = 0
  90. },
  91. {
  92. .idx = HARDIRQ_EBPF_STATIC_FUNC_CALL,
  93. .name = "func_call",
  94. .latency = 0
  95. },
  96. {
  97. .idx = HARDIRQ_EBPF_STATIC_FUNC_CALL_SINGLE,
  98. .name = "func_call_single",
  99. .latency = 0
  100. },
  101. {
  102. .idx = HARDIRQ_EBPF_STATIC_RESCHEDULE,
  103. .name = "reschedule",
  104. .latency = 0
  105. },
  106. {
  107. .idx = HARDIRQ_EBPF_STATIC_LOCAL_TIMER,
  108. .name = "local_timer",
  109. .latency = 0
  110. },
  111. {
  112. .idx = HARDIRQ_EBPF_STATIC_IRQ_WORK,
  113. .name = "irq_work",
  114. .latency = 0
  115. },
  116. {
  117. .idx = HARDIRQ_EBPF_STATIC_X86_PLATFORM_IPI,
  118. .name = "x86_platform_ipi",
  119. .latency = 0
  120. },
  121. };
  122. // store for "published" data from the reader thread, which the collector
  123. // thread will write to netdata agent.
  124. static avl_tree_lock hardirq_pub;
  125. // tmp store for dynamic hard IRQ values we get from a per-CPU eBPF map.
  126. static hardirq_ebpf_val_t *hardirq_ebpf_vals = NULL;
  127. // tmp store for static hard IRQ values we get from a per-CPU eBPF map.
  128. static hardirq_ebpf_static_val_t *hardirq_ebpf_static_vals = NULL;
  129. /**
  130. * Hardirq Free
  131. *
  132. * Cleanup variables after child threads to stop
  133. *
  134. * @param ptr thread data.
  135. */
  136. static void ebpf_hardirq_free(ebpf_module_t *em)
  137. {
  138. pthread_mutex_lock(&ebpf_exit_cleanup);
  139. em->thread->enabled = NETDATA_THREAD_EBPF_STOPPING;
  140. pthread_mutex_unlock(&ebpf_exit_cleanup);
  141. for (int i = 0; hardirq_tracepoints[i].class != NULL; i++) {
  142. ebpf_disable_tracepoint(&hardirq_tracepoints[i]);
  143. }
  144. freez(hardirq_ebpf_vals);
  145. freez(hardirq_ebpf_static_vals);
  146. pthread_mutex_lock(&ebpf_exit_cleanup);
  147. em->thread->enabled = NETDATA_THREAD_EBPF_STOPPED;
  148. pthread_mutex_unlock(&ebpf_exit_cleanup);
  149. }
  150. /**
  151. * Hardirq Exit
  152. *
  153. * Cancel child and exit.
  154. *
  155. * @param ptr thread data.
  156. */
  157. static void hardirq_exit(void *ptr)
  158. {
  159. ebpf_module_t *em = (ebpf_module_t *)ptr;
  160. ebpf_hardirq_free(em);
  161. }
  162. /*****************************************************************
  163. * MAIN LOOP
  164. *****************************************************************/
  165. /**
  166. * Compare hard IRQ values.
  167. *
  168. * @param a `hardirq_val_t *`.
  169. * @param b `hardirq_val_t *`.
  170. *
  171. * @return 0 if a==b, 1 if a>b, -1 if a<b.
  172. */
  173. static int hardirq_val_cmp(void *a, void *b)
  174. {
  175. hardirq_val_t *ptr1 = a;
  176. hardirq_val_t *ptr2 = b;
  177. if (ptr1->irq > ptr2->irq) {
  178. return 1;
  179. }
  180. else if (ptr1->irq < ptr2->irq) {
  181. return -1;
  182. }
  183. else {
  184. return 0;
  185. }
  186. }
  187. static void hardirq_read_latency_map(int mapfd)
  188. {
  189. hardirq_ebpf_key_t key = {};
  190. hardirq_ebpf_key_t next_key = {};
  191. hardirq_val_t search_v = {};
  192. hardirq_val_t *v = NULL;
  193. while (bpf_map_get_next_key(mapfd, &key, &next_key) == 0) {
  194. // get val for this key.
  195. int test = bpf_map_lookup_elem(mapfd, &key, hardirq_ebpf_vals);
  196. if (unlikely(test < 0)) {
  197. key = next_key;
  198. continue;
  199. }
  200. // is this IRQ saved yet?
  201. //
  202. // if not, make a new one, mark it as unsaved for now, and continue; we
  203. // will insert it at the end after all of its values are correctly set,
  204. // so that we can safely publish it to the collector within a single,
  205. // short locked operation.
  206. //
  207. // otherwise simply continue; we will only update the latency, which
  208. // can be republished safely without a lock.
  209. //
  210. // NOTE: lock isn't strictly necessary for this initial search, as only
  211. // this thread does writing, but the AVL is using a read-write lock so
  212. // there is no congestion.
  213. bool v_is_new = false;
  214. search_v.irq = key.irq;
  215. v = (hardirq_val_t *)avl_search_lock(&hardirq_pub, (avl_t *)&search_v);
  216. if (unlikely(v == NULL)) {
  217. // latency/name can only be added reliably at a later time.
  218. // when they're added, only then will we AVL insert.
  219. v = callocz(1, sizeof(hardirq_val_t));
  220. v->irq = key.irq;
  221. v->dim_exists = false;
  222. v_is_new = true;
  223. }
  224. // note two things:
  225. // 1. we must add up latency value for this IRQ across all CPUs.
  226. // 2. the name is unfortunately *not* available on all CPU maps - only
  227. // a single map contains the name, so we must find it. we only need
  228. // to copy it though if the IRQ is new for us.
  229. bool name_saved = false;
  230. uint64_t total_latency = 0;
  231. int i;
  232. int end = (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs;
  233. for (i = 0; i < end; i++) {
  234. total_latency += hardirq_ebpf_vals[i].latency/1000;
  235. // copy name for new IRQs.
  236. if (v_is_new && !name_saved && hardirq_ebpf_vals[i].name[0] != '\0') {
  237. strncpyz(
  238. v->name,
  239. hardirq_ebpf_vals[i].name,
  240. NETDATA_HARDIRQ_NAME_LEN
  241. );
  242. name_saved = true;
  243. }
  244. }
  245. // can now safely publish latency for existing IRQs.
  246. v->latency = total_latency;
  247. // can now safely publish new IRQ.
  248. if (v_is_new) {
  249. avl_t *check = avl_insert_lock(&hardirq_pub, (avl_t *)v);
  250. if (check != (avl_t *)v) {
  251. error("Internal error, cannot insert the AVL tree.");
  252. }
  253. }
  254. key = next_key;
  255. }
  256. }
  257. static void hardirq_read_latency_static_map(int mapfd)
  258. {
  259. uint32_t i;
  260. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  261. uint32_t map_i = hardirq_static_vals[i].idx;
  262. int test = bpf_map_lookup_elem(mapfd, &map_i, hardirq_ebpf_static_vals);
  263. if (unlikely(test < 0)) {
  264. continue;
  265. }
  266. uint64_t total_latency = 0;
  267. int cpu_i;
  268. int end = (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs;
  269. for (cpu_i = 0; cpu_i < end; cpu_i++) {
  270. total_latency += hardirq_ebpf_static_vals[cpu_i].latency/1000;
  271. }
  272. hardirq_static_vals[i].latency = total_latency;
  273. }
  274. }
  275. /**
  276. * Read eBPF maps for hard IRQ.
  277. */
  278. static void hardirq_reader()
  279. {
  280. hardirq_read_latency_map(hardirq_maps[HARDIRQ_MAP_LATENCY].map_fd);
  281. hardirq_read_latency_static_map(hardirq_maps[HARDIRQ_MAP_LATENCY_STATIC].map_fd);
  282. }
  283. static void hardirq_create_charts(int update_every)
  284. {
  285. ebpf_create_chart(
  286. NETDATA_EBPF_SYSTEM_GROUP,
  287. "hardirq_latency",
  288. "Hardware IRQ latency",
  289. EBPF_COMMON_DIMENSION_MILLISECONDS,
  290. "interrupts",
  291. NULL,
  292. NETDATA_EBPF_CHART_TYPE_STACKED,
  293. NETDATA_CHART_PRIO_HARDIRQ_LATENCY,
  294. NULL, NULL, 0, update_every,
  295. NETDATA_EBPF_MODULE_NAME_HARDIRQ
  296. );
  297. fflush(stdout);
  298. }
  299. static void hardirq_create_static_dims()
  300. {
  301. uint32_t i;
  302. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  303. ebpf_write_global_dimension(
  304. hardirq_static_vals[i].name, hardirq_static_vals[i].name,
  305. ebpf_algorithms[NETDATA_EBPF_INCREMENTAL_IDX]
  306. );
  307. }
  308. }
  309. // callback for avl tree traversal on `hardirq_pub`.
  310. static int hardirq_write_dims(void *entry, void *data)
  311. {
  312. UNUSED(data);
  313. hardirq_val_t *v = entry;
  314. // IRQs get dynamically added in, so add the dimension if we haven't yet.
  315. if (!v->dim_exists) {
  316. ebpf_write_global_dimension(
  317. v->name, v->name,
  318. ebpf_algorithms[NETDATA_EBPF_INCREMENTAL_IDX]
  319. );
  320. v->dim_exists = true;
  321. }
  322. write_chart_dimension(v->name, v->latency);
  323. return 1;
  324. }
  325. static inline void hardirq_write_static_dims()
  326. {
  327. uint32_t i;
  328. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  329. write_chart_dimension(
  330. hardirq_static_vals[i].name,
  331. hardirq_static_vals[i].latency
  332. );
  333. }
  334. }
  335. /**
  336. * Main loop for this collector.
  337. */
  338. static void hardirq_collector(ebpf_module_t *em)
  339. {
  340. hardirq_ebpf_vals = callocz(
  341. (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs,
  342. sizeof(hardirq_ebpf_val_t)
  343. );
  344. hardirq_ebpf_static_vals = callocz(
  345. (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs,
  346. sizeof(hardirq_ebpf_static_val_t)
  347. );
  348. avl_init_lock(&hardirq_pub, hardirq_val_cmp);
  349. // create chart and static dims.
  350. pthread_mutex_lock(&lock);
  351. hardirq_create_charts(em->update_every);
  352. hardirq_create_static_dims();
  353. ebpf_update_stats(&plugin_statistics, em);
  354. pthread_mutex_unlock(&lock);
  355. // loop and read from published data until ebpf plugin is closed.
  356. heartbeat_t hb;
  357. heartbeat_init(&hb);
  358. int update_every = em->update_every;
  359. int counter = update_every - 1;
  360. //This will be cancelled by its parent
  361. while (!ebpf_exit_plugin) {
  362. (void)heartbeat_next(&hb, USEC_PER_SEC);
  363. if (ebpf_exit_plugin || ++counter != update_every)
  364. continue;
  365. counter = 0;
  366. hardirq_reader();
  367. pthread_mutex_lock(&lock);
  368. // write dims now for all hitherto discovered IRQs.
  369. write_begin_chart(NETDATA_EBPF_SYSTEM_GROUP, "hardirq_latency");
  370. avl_traverse_lock(&hardirq_pub, hardirq_write_dims, NULL);
  371. hardirq_write_static_dims();
  372. write_end_chart();
  373. pthread_mutex_unlock(&lock);
  374. }
  375. }
  376. /*****************************************************************
  377. * EBPF HARDIRQ THREAD
  378. *****************************************************************/
  379. /**
  380. * Hard IRQ latency thread.
  381. *
  382. * @param ptr a `ebpf_module_t *`.
  383. * @return always NULL.
  384. */
  385. void *ebpf_hardirq_thread(void *ptr)
  386. {
  387. netdata_thread_cleanup_push(hardirq_exit, ptr);
  388. ebpf_module_t *em = (ebpf_module_t *)ptr;
  389. em->maps = hardirq_maps;
  390. if (ebpf_enable_tracepoints(hardirq_tracepoints) == 0) {
  391. em->thread->enabled = NETDATA_THREAD_EBPF_STOPPED;
  392. goto endhardirq;
  393. }
  394. em->probe_links = ebpf_load_program(ebpf_plugin_dir, em, running_on_kernel, isrh, &em->objects);
  395. if (!em->probe_links) {
  396. em->thread->enabled = NETDATA_THREAD_EBPF_STOPPED;
  397. goto endhardirq;
  398. }
  399. hardirq_collector(em);
  400. endhardirq:
  401. ebpf_update_disabled_plugin_stats(em);
  402. netdata_thread_cleanup_pop(1);
  403. return NULL;
  404. }