testing_helpers.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251
  1. // SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
  2. /* Copyright (C) 2019 Netronome Systems, Inc. */
  3. /* Copyright (C) 2020 Facebook, Inc. */
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include <errno.h>
  7. #include <bpf/bpf.h>
  8. #include <bpf/libbpf.h>
  9. #include "test_progs.h"
  10. #include "testing_helpers.h"
  11. int parse_num_list(const char *s, bool **num_set, int *num_set_len)
  12. {
  13. int i, set_len = 0, new_len, num, start = 0, end = -1;
  14. bool *set = NULL, *tmp, parsing_end = false;
  15. char *next;
  16. while (s[0]) {
  17. errno = 0;
  18. num = strtol(s, &next, 10);
  19. if (errno)
  20. return -errno;
  21. if (parsing_end)
  22. end = num;
  23. else
  24. start = num;
  25. if (!parsing_end && *next == '-') {
  26. s = next + 1;
  27. parsing_end = true;
  28. continue;
  29. } else if (*next == ',') {
  30. parsing_end = false;
  31. s = next + 1;
  32. end = num;
  33. } else if (*next == '\0') {
  34. parsing_end = false;
  35. s = next;
  36. end = num;
  37. } else {
  38. return -EINVAL;
  39. }
  40. if (start > end)
  41. return -EINVAL;
  42. if (end + 1 > set_len) {
  43. new_len = end + 1;
  44. tmp = realloc(set, new_len);
  45. if (!tmp) {
  46. free(set);
  47. return -ENOMEM;
  48. }
  49. for (i = set_len; i < start; i++)
  50. tmp[i] = false;
  51. set = tmp;
  52. set_len = new_len;
  53. }
  54. for (i = start; i <= end; i++)
  55. set[i] = true;
  56. }
  57. if (!set || parsing_end)
  58. return -EINVAL;
  59. *num_set = set;
  60. *num_set_len = set_len;
  61. return 0;
  62. }
  63. int parse_test_list(const char *s,
  64. struct test_filter_set *set,
  65. bool is_glob_pattern)
  66. {
  67. char *input, *state = NULL, *next;
  68. struct test_filter *tmp, *tests = NULL;
  69. int i, j, cnt = 0;
  70. input = strdup(s);
  71. if (!input)
  72. return -ENOMEM;
  73. while ((next = strtok_r(state ? NULL : input, ",", &state))) {
  74. char *subtest_str = strchr(next, '/');
  75. char *pattern = NULL;
  76. int glob_chars = 0;
  77. tmp = realloc(tests, sizeof(*tests) * (cnt + 1));
  78. if (!tmp)
  79. goto err;
  80. tests = tmp;
  81. tests[cnt].subtest_cnt = 0;
  82. tests[cnt].subtests = NULL;
  83. if (is_glob_pattern) {
  84. pattern = "%s";
  85. } else {
  86. pattern = "*%s*";
  87. glob_chars = 2;
  88. }
  89. if (subtest_str) {
  90. char **tmp_subtests = NULL;
  91. int subtest_cnt = tests[cnt].subtest_cnt;
  92. *subtest_str = '\0';
  93. subtest_str += 1;
  94. tmp_subtests = realloc(tests[cnt].subtests,
  95. sizeof(*tmp_subtests) *
  96. (subtest_cnt + 1));
  97. if (!tmp_subtests)
  98. goto err;
  99. tests[cnt].subtests = tmp_subtests;
  100. tests[cnt].subtests[subtest_cnt] =
  101. malloc(strlen(subtest_str) + glob_chars + 1);
  102. if (!tests[cnt].subtests[subtest_cnt])
  103. goto err;
  104. sprintf(tests[cnt].subtests[subtest_cnt],
  105. pattern,
  106. subtest_str);
  107. tests[cnt].subtest_cnt++;
  108. }
  109. tests[cnt].name = malloc(strlen(next) + glob_chars + 1);
  110. if (!tests[cnt].name)
  111. goto err;
  112. sprintf(tests[cnt].name, pattern, next);
  113. cnt++;
  114. }
  115. tmp = realloc(set->tests, sizeof(*tests) * (cnt + set->cnt));
  116. if (!tmp)
  117. goto err;
  118. memcpy(tmp + set->cnt, tests, sizeof(*tests) * cnt);
  119. set->tests = tmp;
  120. set->cnt += cnt;
  121. free(tests);
  122. free(input);
  123. return 0;
  124. err:
  125. for (i = 0; i < cnt; i++) {
  126. for (j = 0; j < tests[i].subtest_cnt; j++)
  127. free(tests[i].subtests[j]);
  128. free(tests[i].name);
  129. }
  130. free(tests);
  131. free(input);
  132. return -ENOMEM;
  133. }
  134. __u32 link_info_prog_id(const struct bpf_link *link, struct bpf_link_info *info)
  135. {
  136. __u32 info_len = sizeof(*info);
  137. int err;
  138. memset(info, 0, sizeof(*info));
  139. err = bpf_obj_get_info_by_fd(bpf_link__fd(link), info, &info_len);
  140. if (err) {
  141. printf("failed to get link info: %d\n", -errno);
  142. return 0;
  143. }
  144. return info->prog_id;
  145. }
  146. int extra_prog_load_log_flags = 0;
  147. int bpf_prog_test_load(const char *file, enum bpf_prog_type type,
  148. struct bpf_object **pobj, int *prog_fd)
  149. {
  150. LIBBPF_OPTS(bpf_object_open_opts, opts,
  151. .kernel_log_level = extra_prog_load_log_flags,
  152. );
  153. struct bpf_object *obj;
  154. struct bpf_program *prog;
  155. __u32 flags;
  156. int err;
  157. obj = bpf_object__open_file(file, &opts);
  158. if (!obj)
  159. return -errno;
  160. prog = bpf_object__next_program(obj, NULL);
  161. if (!prog) {
  162. err = -ENOENT;
  163. goto err_out;
  164. }
  165. if (type != BPF_PROG_TYPE_UNSPEC)
  166. bpf_program__set_type(prog, type);
  167. flags = bpf_program__flags(prog) | BPF_F_TEST_RND_HI32;
  168. bpf_program__set_flags(prog, flags);
  169. err = bpf_object__load(obj);
  170. if (err)
  171. goto err_out;
  172. *pobj = obj;
  173. *prog_fd = bpf_program__fd(prog);
  174. return 0;
  175. err_out:
  176. bpf_object__close(obj);
  177. return err;
  178. }
  179. int bpf_test_load_program(enum bpf_prog_type type, const struct bpf_insn *insns,
  180. size_t insns_cnt, const char *license,
  181. __u32 kern_version, char *log_buf,
  182. size_t log_buf_sz)
  183. {
  184. LIBBPF_OPTS(bpf_prog_load_opts, opts,
  185. .kern_version = kern_version,
  186. .prog_flags = BPF_F_TEST_RND_HI32,
  187. .log_level = extra_prog_load_log_flags,
  188. .log_buf = log_buf,
  189. .log_size = log_buf_sz,
  190. );
  191. return bpf_prog_load(type, NULL, license, insns, insns_cnt, &opts);
  192. }
  193. __u64 read_perf_max_sample_freq(void)
  194. {
  195. __u64 sample_freq = 5000; /* fallback to 5000 on error */
  196. FILE *f;
  197. f = fopen("/proc/sys/kernel/perf_event_max_sample_rate", "r");
  198. if (f == NULL) {
  199. printf("Failed to open /proc/sys/kernel/perf_event_max_sample_rate: err %d\n"
  200. "return default value: 5000\n", -errno);
  201. return sample_freq;
  202. }
  203. if (fscanf(f, "%llu", &sample_freq) != 1) {
  204. printf("Failed to parse /proc/sys/kernel/perf_event_max_sample_rate: err %d\n"
  205. "return default value: 5000\n", -errno);
  206. }
  207. fclose(f);
  208. return sample_freq;
  209. }