spintest_user.c 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <stdio.h>
  3. #include <unistd.h>
  4. #include <linux/bpf.h>
  5. #include <string.h>
  6. #include <assert.h>
  7. #include <sys/resource.h>
  8. #include "libbpf.h"
  9. #include "bpf_load.h"
  10. #include "trace_helpers.h"
  11. int main(int ac, char **argv)
  12. {
  13. struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
  14. long key, next_key, value;
  15. char filename[256];
  16. struct ksym *sym;
  17. int i;
  18. snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
  19. setrlimit(RLIMIT_MEMLOCK, &r);
  20. if (load_kallsyms()) {
  21. printf("failed to process /proc/kallsyms\n");
  22. return 2;
  23. }
  24. if (load_bpf_file(filename)) {
  25. printf("%s", bpf_log_buf);
  26. return 1;
  27. }
  28. for (i = 0; i < 5; i++) {
  29. key = 0;
  30. printf("kprobing funcs:");
  31. while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) {
  32. bpf_map_lookup_elem(map_fd[0], &next_key, &value);
  33. assert(next_key == value);
  34. sym = ksym_search(value);
  35. printf(" %s", sym->name);
  36. key = next_key;
  37. }
  38. if (key)
  39. printf("\n");
  40. key = 0;
  41. while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0)
  42. bpf_map_delete_elem(map_fd[0], &next_key);
  43. sleep(1);
  44. }
  45. return 0;
  46. }