kabi.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (C) 2024 Google LLC
  4. */
  5. #define _GNU_SOURCE
  6. #include <errno.h>
  7. #include <stdio.h>
  8. #include "gendwarfksyms.h"
  9. #define KABI_RULE_SECTION ".discard.gendwarfksyms.kabi_rules"
  10. #define KABI_RULE_VERSION "1"
  11. /*
  12. * The rule section consists of four null-terminated strings per
  13. * entry:
  14. *
  15. * 1. version
  16. * Entry format version. Must match KABI_RULE_VERSION.
  17. *
  18. * 2. type
  19. * Type of the kABI rule. Must be one of the tags defined below.
  20. *
  21. * 3. target
  22. * Rule-dependent target, typically the fully qualified name of
  23. * the target DIE.
  24. *
  25. * 4. value
  26. * Rule-dependent value.
  27. */
  28. #define KABI_RULE_MIN_ENTRY_SIZE \
  29. (/* version\0 */ 2 + /* type\0 */ 2 + /* target\0" */ 1 + \
  30. /* value\0 */ 1)
  31. #define KABI_RULE_EMPTY_VALUE ""
  32. /*
  33. * Rule: declonly
  34. * - For the struct/enum/union in the target field, treat it as a
  35. * declaration only even if a definition is available.
  36. */
  37. #define KABI_RULE_TAG_DECLONLY "declonly"
  38. /*
  39. * Rule: enumerator_ignore
  40. * - For the enum_field in the target field, ignore the enumerator.
  41. */
  42. #define KABI_RULE_TAG_ENUMERATOR_IGNORE "enumerator_ignore"
  43. /*
  44. * Rule: enumerator_value
  45. * - For the fqn_field in the target field, set the value to the
  46. * unsigned integer in the value field.
  47. */
  48. #define KABI_RULE_TAG_ENUMERATOR_VALUE "enumerator_value"
  49. /*
  50. * Rule: byte_size
  51. * - For the fqn_field in the target field, set the byte_size
  52. * attribute to the value in the value field.
  53. */
  54. #define KABI_RULE_TAG_BYTE_SIZE "byte_size"
  55. /*
  56. * Rule: type_string
  57. * - For the type reference in the fqn field, use the type string
  58. * in the value field.
  59. */
  60. #define KABI_RULE_TAG_TYPE_STRING "type_string"
  61. enum kabi_rule_type {
  62. KABI_RULE_TYPE_UNKNOWN,
  63. KABI_RULE_TYPE_DECLONLY,
  64. KABI_RULE_TYPE_ENUMERATOR_IGNORE,
  65. KABI_RULE_TYPE_ENUMERATOR_VALUE,
  66. KABI_RULE_TYPE_BYTE_SIZE,
  67. KABI_RULE_TYPE_TYPE_STRING,
  68. };
  69. #define RULE_HASH_BITS 7
  70. struct rule {
  71. enum kabi_rule_type type;
  72. const char *target;
  73. const char *value;
  74. struct hlist_node hash;
  75. };
  76. /* { type, target } -> struct rule */
  77. static HASHTABLE_DEFINE(rules, 1 << RULE_HASH_BITS);
  78. static inline unsigned int rule_values_hash(enum kabi_rule_type type,
  79. const char *target)
  80. {
  81. return hash_32(type) ^ hash_str(target);
  82. }
  83. static inline unsigned int rule_hash(const struct rule *rule)
  84. {
  85. return rule_values_hash(rule->type, rule->target);
  86. }
  87. static inline const char *get_rule_field(const char **pos, ssize_t *left)
  88. {
  89. const char *start = *pos;
  90. size_t len;
  91. if (*left <= 0)
  92. error("unexpected end of kABI rules");
  93. len = strnlen(start, *left) + 1;
  94. *pos += len;
  95. *left -= len;
  96. return start;
  97. }
  98. void kabi_read_rules(int fd)
  99. {
  100. GElf_Shdr shdr_mem;
  101. GElf_Shdr *shdr;
  102. Elf_Data *rule_data = NULL;
  103. Elf_Scn *scn;
  104. Elf *elf;
  105. size_t shstrndx;
  106. const char *rule_str;
  107. ssize_t left;
  108. int i;
  109. const struct {
  110. enum kabi_rule_type type;
  111. const char *tag;
  112. } rule_types[] = {
  113. {
  114. .type = KABI_RULE_TYPE_DECLONLY,
  115. .tag = KABI_RULE_TAG_DECLONLY,
  116. },
  117. {
  118. .type = KABI_RULE_TYPE_ENUMERATOR_IGNORE,
  119. .tag = KABI_RULE_TAG_ENUMERATOR_IGNORE,
  120. },
  121. {
  122. .type = KABI_RULE_TYPE_ENUMERATOR_VALUE,
  123. .tag = KABI_RULE_TAG_ENUMERATOR_VALUE,
  124. },
  125. {
  126. .type = KABI_RULE_TYPE_BYTE_SIZE,
  127. .tag = KABI_RULE_TAG_BYTE_SIZE,
  128. },
  129. {
  130. .type = KABI_RULE_TYPE_TYPE_STRING,
  131. .tag = KABI_RULE_TAG_TYPE_STRING,
  132. },
  133. };
  134. if (!stable)
  135. return;
  136. if (elf_version(EV_CURRENT) != EV_CURRENT)
  137. error("elf_version failed: %s", elf_errmsg(-1));
  138. elf = elf_begin(fd, ELF_C_READ_MMAP, NULL);
  139. if (!elf)
  140. error("elf_begin failed: %s", elf_errmsg(-1));
  141. if (elf_getshdrstrndx(elf, &shstrndx) < 0)
  142. error("elf_getshdrstrndx failed: %s", elf_errmsg(-1));
  143. scn = elf_nextscn(elf, NULL);
  144. while (scn) {
  145. const char *sname;
  146. shdr = gelf_getshdr(scn, &shdr_mem);
  147. if (!shdr)
  148. error("gelf_getshdr failed: %s", elf_errmsg(-1));
  149. sname = elf_strptr(elf, shstrndx, shdr->sh_name);
  150. if (!sname)
  151. error("elf_strptr failed: %s", elf_errmsg(-1));
  152. if (!strcmp(sname, KABI_RULE_SECTION)) {
  153. rule_data = elf_getdata(scn, NULL);
  154. if (!rule_data)
  155. error("elf_getdata failed: %s", elf_errmsg(-1));
  156. break;
  157. }
  158. scn = elf_nextscn(elf, scn);
  159. }
  160. if (!rule_data) {
  161. debug("kABI rules not found");
  162. check(elf_end(elf));
  163. return;
  164. }
  165. rule_str = rule_data->d_buf;
  166. left = shdr->sh_size;
  167. if (left < KABI_RULE_MIN_ENTRY_SIZE)
  168. error("kABI rule section too small: %zd bytes", left);
  169. if (rule_str[left - 1] != '\0')
  170. error("kABI rules are not null-terminated");
  171. while (left > KABI_RULE_MIN_ENTRY_SIZE) {
  172. enum kabi_rule_type type = KABI_RULE_TYPE_UNKNOWN;
  173. const char *field;
  174. struct rule *rule;
  175. /* version */
  176. field = get_rule_field(&rule_str, &left);
  177. if (strcmp(field, KABI_RULE_VERSION))
  178. error("unsupported kABI rule version: '%s'", field);
  179. /* type */
  180. field = get_rule_field(&rule_str, &left);
  181. for (i = 0; i < ARRAY_SIZE(rule_types); i++) {
  182. if (!strcmp(field, rule_types[i].tag)) {
  183. type = rule_types[i].type;
  184. break;
  185. }
  186. }
  187. if (type == KABI_RULE_TYPE_UNKNOWN)
  188. error("unsupported kABI rule type: '%s'", field);
  189. rule = xmalloc(sizeof(*rule));
  190. rule->type = type;
  191. rule->target = xstrdup(get_rule_field(&rule_str, &left));
  192. rule->value = xstrdup(get_rule_field(&rule_str, &left));
  193. hash_add(rules, &rule->hash, rule_hash(rule));
  194. debug("kABI rule: type: '%s', target: '%s', value: '%s'", field,
  195. rule->target, rule->value);
  196. }
  197. if (left > 0)
  198. warn("unexpected data at the end of the kABI rules section");
  199. check(elf_end(elf));
  200. }
  201. static char *get_enumerator_target(const char *fqn, const char *field)
  202. {
  203. char *target = NULL;
  204. if (asprintf(&target, "%s %s", fqn, field) < 0)
  205. error("asprintf failed for '%s %s'", fqn, field);
  206. return target;
  207. }
  208. static struct rule *find_rule(enum kabi_rule_type type, const char *target)
  209. {
  210. struct rule *rule;
  211. if (!stable)
  212. return NULL;
  213. if (!target || !*target)
  214. return NULL;
  215. hash_for_each_possible(rules, rule, hash,
  216. rule_values_hash(type, target)) {
  217. if (rule->type == type && !strcmp(target, rule->target))
  218. return rule;
  219. }
  220. return NULL;
  221. }
  222. static struct rule *find_enumerator_rule(enum kabi_rule_type type,
  223. const char *fqn, const char *field)
  224. {
  225. struct rule *rule;
  226. char *target;
  227. if (!stable)
  228. return NULL;
  229. if (!fqn || !*fqn || !field || !*field)
  230. return NULL;
  231. target = get_enumerator_target(fqn, field);
  232. rule = find_rule(type, target);
  233. free(target);
  234. return rule;
  235. }
  236. bool kabi_is_declonly(const char *fqn)
  237. {
  238. return !!find_rule(KABI_RULE_TYPE_DECLONLY, fqn);
  239. }
  240. static unsigned long get_ulong_value(const char *value)
  241. {
  242. unsigned long result = 0;
  243. char *endptr = NULL;
  244. errno = 0;
  245. result = strtoul(value, &endptr, 10);
  246. if (errno || *endptr)
  247. error("invalid unsigned value '%s'", value);
  248. return result;
  249. }
  250. bool kabi_is_enumerator_ignored(const char *fqn, const char *field)
  251. {
  252. return !!find_enumerator_rule(KABI_RULE_TYPE_ENUMERATOR_IGNORE, fqn,
  253. field);
  254. }
  255. bool kabi_get_enumerator_value(const char *fqn, const char *field,
  256. unsigned long *value)
  257. {
  258. struct rule *rule;
  259. rule = find_enumerator_rule(KABI_RULE_TYPE_ENUMERATOR_VALUE, fqn,
  260. field);
  261. if (rule) {
  262. *value = get_ulong_value(rule->value);
  263. return true;
  264. }
  265. return false;
  266. }
  267. bool kabi_get_byte_size(const char *fqn, unsigned long *value)
  268. {
  269. struct rule *rule;
  270. rule = find_rule(KABI_RULE_TYPE_BYTE_SIZE, fqn);
  271. if (rule) {
  272. *value = get_ulong_value(rule->value);
  273. return true;
  274. }
  275. return false;
  276. }
  277. bool kabi_get_type_string(const char *type, const char **str)
  278. {
  279. struct rule *rule;
  280. rule = find_rule(KABI_RULE_TYPE_TYPE_STRING, type);
  281. if (rule) {
  282. *str = rule->value;
  283. return true;
  284. }
  285. return false;
  286. }
  287. void kabi_free(void)
  288. {
  289. struct hlist_node *tmp;
  290. struct rule *rule;
  291. hash_for_each_safe(rules, rule, tmp, hash) {
  292. free((void *)rule->target);
  293. free((void *)rule->value);
  294. free(rule);
  295. }
  296. hash_init(rules);
  297. }