ebpf_hardirq.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499
  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. static struct bpf_link **probe_links = NULL;
  123. static struct bpf_object *objects = NULL;
  124. static int read_thread_closed = 1;
  125. // store for "published" data from the reader thread, which the collector
  126. // thread will write to netdata agent.
  127. static avl_tree_lock hardirq_pub;
  128. // tmp store for dynamic hard IRQ values we get from a per-CPU eBPF map.
  129. static hardirq_ebpf_val_t *hardirq_ebpf_vals = NULL;
  130. // tmp store for static hard IRQ values we get from a per-CPU eBPF map.
  131. static hardirq_ebpf_static_val_t *hardirq_ebpf_static_vals = NULL;
  132. static struct netdata_static_thread hardirq_threads = {"HARDIRQ KERNEL",
  133. NULL, NULL, 1, NULL,
  134. NULL, NULL };
  135. /**
  136. * Clean up the main thread.
  137. *
  138. * @param ptr thread data.
  139. */
  140. static void hardirq_cleanup(void *ptr)
  141. {
  142. for (int i = 0; hardirq_tracepoints[i].class != NULL; i++) {
  143. ebpf_disable_tracepoint(&hardirq_tracepoints[i]);
  144. }
  145. ebpf_module_t *em = (ebpf_module_t *)ptr;
  146. if (!em->enabled) {
  147. return;
  148. }
  149. heartbeat_t hb;
  150. heartbeat_init(&hb);
  151. uint32_t tick = 1 * USEC_PER_MS;
  152. while (!read_thread_closed) {
  153. usec_t dt = heartbeat_next(&hb, tick);
  154. UNUSED(dt);
  155. }
  156. freez(hardirq_ebpf_vals);
  157. freez(hardirq_ebpf_static_vals);
  158. freez(hardirq_threads.thread);
  159. if (probe_links) {
  160. struct bpf_program *prog;
  161. size_t i = 0 ;
  162. bpf_object__for_each_program(prog, objects) {
  163. bpf_link__destroy(probe_links[i]);
  164. i++;
  165. }
  166. bpf_object__close(objects);
  167. }
  168. }
  169. /*****************************************************************
  170. * MAIN LOOP
  171. *****************************************************************/
  172. /**
  173. * Compare hard IRQ values.
  174. *
  175. * @param a `hardirq_val_t *`.
  176. * @param b `hardirq_val_t *`.
  177. *
  178. * @return 0 if a==b, 1 if a>b, -1 if a<b.
  179. */
  180. static int hardirq_val_cmp(void *a, void *b)
  181. {
  182. hardirq_val_t *ptr1 = a;
  183. hardirq_val_t *ptr2 = b;
  184. if (ptr1->irq > ptr2->irq) {
  185. return 1;
  186. }
  187. else if (ptr1->irq < ptr2->irq) {
  188. return -1;
  189. }
  190. else {
  191. return 0;
  192. }
  193. }
  194. static void hardirq_read_latency_map(int mapfd)
  195. {
  196. hardirq_ebpf_key_t key = {};
  197. hardirq_ebpf_key_t next_key = {};
  198. hardirq_val_t search_v = {};
  199. hardirq_val_t *v = NULL;
  200. while (bpf_map_get_next_key(mapfd, &key, &next_key) == 0) {
  201. // get val for this key.
  202. int test = bpf_map_lookup_elem(mapfd, &key, hardirq_ebpf_vals);
  203. if (unlikely(test < 0)) {
  204. key = next_key;
  205. continue;
  206. }
  207. // is this IRQ saved yet?
  208. //
  209. // if not, make a new one, mark it as unsaved for now, and continue; we
  210. // will insert it at the end after all of its values are correctly set,
  211. // so that we can safely publish it to the collector within a single,
  212. // short locked operation.
  213. //
  214. // otherwise simply continue; we will only update the latency, which
  215. // can be republished safely without a lock.
  216. //
  217. // NOTE: lock isn't strictly necessary for this initial search, as only
  218. // this thread does writing, but the AVL is using a read-write lock so
  219. // there is no congestion.
  220. bool v_is_new = false;
  221. search_v.irq = key.irq;
  222. v = (hardirq_val_t *)avl_search_lock(&hardirq_pub, (avl_t *)&search_v);
  223. if (unlikely(v == NULL)) {
  224. // latency/name can only be added reliably at a later time.
  225. // when they're added, only then will we AVL insert.
  226. v = callocz(1, sizeof(hardirq_val_t));
  227. v->irq = key.irq;
  228. v->dim_exists = false;
  229. v_is_new = true;
  230. }
  231. // note two things:
  232. // 1. we must add up latency value for this IRQ across all CPUs.
  233. // 2. the name is unfortunately *not* available on all CPU maps - only
  234. // a single map contains the name, so we must find it. we only need
  235. // to copy it though if the IRQ is new for us.
  236. bool name_saved = false;
  237. uint64_t total_latency = 0;
  238. int i;
  239. int end = (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs;
  240. for (i = 0; i < end; i++) {
  241. total_latency += hardirq_ebpf_vals[i].latency/1000;
  242. // copy name for new IRQs.
  243. if (v_is_new && !name_saved && hardirq_ebpf_vals[i].name[0] != '\0') {
  244. strncpyz(
  245. v->name,
  246. hardirq_ebpf_vals[i].name,
  247. NETDATA_HARDIRQ_NAME_LEN
  248. );
  249. name_saved = true;
  250. }
  251. }
  252. // can now safely publish latency for existing IRQs.
  253. v->latency = total_latency;
  254. // can now safely publish new IRQ.
  255. if (v_is_new) {
  256. avl_t *check = avl_insert_lock(&hardirq_pub, (avl_t *)v);
  257. if (check != (avl_t *)v) {
  258. error("Internal error, cannot insert the AVL tree.");
  259. }
  260. }
  261. key = next_key;
  262. }
  263. }
  264. static void hardirq_read_latency_static_map(int mapfd)
  265. {
  266. uint32_t i;
  267. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  268. uint32_t map_i = hardirq_static_vals[i].idx;
  269. int test = bpf_map_lookup_elem(mapfd, &map_i, hardirq_ebpf_static_vals);
  270. if (unlikely(test < 0)) {
  271. continue;
  272. }
  273. uint64_t total_latency = 0;
  274. int cpu_i;
  275. int end = (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs;
  276. for (cpu_i = 0; cpu_i < end; cpu_i++) {
  277. total_latency += hardirq_ebpf_static_vals[cpu_i].latency/1000;
  278. }
  279. hardirq_static_vals[i].latency = total_latency;
  280. }
  281. }
  282. /**
  283. * Read eBPF maps for hard IRQ.
  284. */
  285. static void *hardirq_reader(void *ptr)
  286. {
  287. read_thread_closed = 0;
  288. heartbeat_t hb;
  289. heartbeat_init(&hb);
  290. ebpf_module_t *em = (ebpf_module_t *)ptr;
  291. usec_t step = NETDATA_HARDIRQ_SLEEP_MS * em->update_every;
  292. while (!close_ebpf_plugin) {
  293. usec_t dt = heartbeat_next(&hb, step);
  294. UNUSED(dt);
  295. hardirq_read_latency_map(hardirq_maps[HARDIRQ_MAP_LATENCY].map_fd);
  296. hardirq_read_latency_static_map(hardirq_maps[HARDIRQ_MAP_LATENCY_STATIC].map_fd);
  297. }
  298. read_thread_closed = 1;
  299. return NULL;
  300. }
  301. static void hardirq_create_charts(int update_every)
  302. {
  303. ebpf_create_chart(
  304. NETDATA_EBPF_SYSTEM_GROUP,
  305. "hardirq_latency",
  306. "Hardware IRQ latency",
  307. EBPF_COMMON_DIMENSION_MILLISECONDS,
  308. "interrupts",
  309. NULL,
  310. NETDATA_EBPF_CHART_TYPE_STACKED,
  311. NETDATA_CHART_PRIO_HARDIRQ_LATENCY,
  312. NULL, NULL, 0, update_every,
  313. NETDATA_EBPF_MODULE_NAME_HARDIRQ
  314. );
  315. fflush(stdout);
  316. }
  317. static void hardirq_create_static_dims()
  318. {
  319. uint32_t i;
  320. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  321. ebpf_write_global_dimension(
  322. hardirq_static_vals[i].name, hardirq_static_vals[i].name,
  323. ebpf_algorithms[NETDATA_EBPF_INCREMENTAL_IDX]
  324. );
  325. }
  326. }
  327. // callback for avl tree traversal on `hardirq_pub`.
  328. static int hardirq_write_dims(void *entry, void *data)
  329. {
  330. UNUSED(data);
  331. hardirq_val_t *v = entry;
  332. // IRQs get dynamically added in, so add the dimension if we haven't yet.
  333. if (!v->dim_exists) {
  334. ebpf_write_global_dimension(
  335. v->name, v->name,
  336. ebpf_algorithms[NETDATA_EBPF_INCREMENTAL_IDX]
  337. );
  338. v->dim_exists = true;
  339. }
  340. write_chart_dimension(v->name, v->latency);
  341. return 1;
  342. }
  343. static inline void hardirq_write_static_dims()
  344. {
  345. uint32_t i;
  346. for (i = 0; i < HARDIRQ_EBPF_STATIC_END; i++) {
  347. write_chart_dimension(
  348. hardirq_static_vals[i].name,
  349. hardirq_static_vals[i].latency
  350. );
  351. }
  352. }
  353. /**
  354. * Main loop for this collector.
  355. */
  356. static void hardirq_collector(ebpf_module_t *em)
  357. {
  358. hardirq_ebpf_vals = callocz(
  359. (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs,
  360. sizeof(hardirq_ebpf_val_t)
  361. );
  362. hardirq_ebpf_static_vals = callocz(
  363. (running_on_kernel < NETDATA_KERNEL_V4_15) ? 1 : ebpf_nprocs,
  364. sizeof(hardirq_ebpf_static_val_t)
  365. );
  366. avl_init_lock(&hardirq_pub, hardirq_val_cmp);
  367. // create reader thread.
  368. hardirq_threads.thread = mallocz(sizeof(netdata_thread_t));
  369. hardirq_threads.start_routine = hardirq_reader;
  370. netdata_thread_create(
  371. hardirq_threads.thread,
  372. hardirq_threads.name,
  373. NETDATA_THREAD_OPTION_JOINABLE,
  374. hardirq_reader,
  375. em
  376. );
  377. // create chart and static dims.
  378. pthread_mutex_lock(&lock);
  379. hardirq_create_charts(em->update_every);
  380. hardirq_create_static_dims();
  381. ebpf_update_stats(&plugin_statistics, em);
  382. pthread_mutex_unlock(&lock);
  383. // loop and read from published data until ebpf plugin is closed.
  384. int update_every = em->update_every;
  385. int counter = update_every - 1;
  386. while (!close_ebpf_plugin) {
  387. pthread_mutex_lock(&collect_data_mutex);
  388. pthread_cond_wait(&collect_data_cond_var, &collect_data_mutex);
  389. if (++counter == update_every) {
  390. counter = 0;
  391. pthread_mutex_lock(&lock);
  392. // write dims now for all hitherto discovered IRQs.
  393. write_begin_chart(NETDATA_EBPF_SYSTEM_GROUP, "hardirq_latency");
  394. avl_traverse_lock(&hardirq_pub, hardirq_write_dims, NULL);
  395. hardirq_write_static_dims();
  396. write_end_chart();
  397. pthread_mutex_unlock(&lock);
  398. }
  399. pthread_mutex_unlock(&collect_data_mutex);
  400. }
  401. }
  402. /*****************************************************************
  403. * EBPF HARDIRQ THREAD
  404. *****************************************************************/
  405. /**
  406. * Hard IRQ latency thread.
  407. *
  408. * @param ptr a `ebpf_module_t *`.
  409. * @return always NULL.
  410. */
  411. void *ebpf_hardirq_thread(void *ptr)
  412. {
  413. netdata_thread_cleanup_push(hardirq_cleanup, ptr);
  414. ebpf_module_t *em = (ebpf_module_t *)ptr;
  415. em->maps = hardirq_maps;
  416. if (!em->enabled) {
  417. goto endhardirq;
  418. }
  419. if (ebpf_enable_tracepoints(hardirq_tracepoints) == 0) {
  420. em->enabled = CONFIG_BOOLEAN_NO;
  421. goto endhardirq;
  422. }
  423. probe_links = ebpf_load_program(ebpf_plugin_dir, em, running_on_kernel, isrh, &objects);
  424. if (!probe_links) {
  425. em->enabled = CONFIG_BOOLEAN_NO;
  426. goto endhardirq;
  427. }
  428. hardirq_collector(em);
  429. endhardirq:
  430. if (!em->enabled)
  431. ebpf_update_disabled_plugin_stats(em);
  432. netdata_thread_cleanup_pop(1);
  433. return NULL;
  434. }