begin.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429
  1. /*
  2. * begin.c - implementation of the elf_begin(3) and elf_memory(3) functions.
  3. * Copyright (C) 1995 - 2004 Michael Riepe
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Library General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Library General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Library General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  18. */
  19. #include <private.h>
  20. #ifndef lint
  21. static const char rcsid[] = "@(#) $Id: begin.c,v 1.22 2009/11/01 13:04:19 michael Exp $";
  22. #endif /* lint */
  23. static const Elf _elf_init = INIT_ELF;
  24. static const char fmag[] = ARFMAG;
  25. static unsigned long
  26. getnum(const char *str, size_t len, int base, size_t *err) {
  27. unsigned long result = 0;
  28. while (len && *str == ' ') {
  29. str++; len--;
  30. }
  31. while (len && *str >= '0' && (*str - '0') < base) {
  32. result = base * result + *str++ - '0'; len--;
  33. }
  34. while (len && *str == ' ') {
  35. str++; len--;
  36. }
  37. if (len) {
  38. *err = len;
  39. }
  40. return result;
  41. }
  42. static void
  43. _elf_init_ar(Elf *elf) {
  44. struct ar_hdr *hdr;
  45. size_t offset;
  46. size_t size;
  47. size_t err = 0;
  48. elf->e_kind = ELF_K_AR;
  49. elf->e_idlen = SARMAG;
  50. elf->e_off = SARMAG;
  51. /* process special members */
  52. offset = SARMAG;
  53. while (!elf->e_strtab && offset + sizeof(*hdr) <= elf->e_size) {
  54. hdr = (struct ar_hdr*)(elf->e_data + offset);
  55. if (memcmp(hdr->ar_fmag, fmag, sizeof(fmag) - 1)) {
  56. break;
  57. }
  58. if (hdr->ar_name[0] != '/') {
  59. break;
  60. }
  61. size = getnum(hdr->ar_size, sizeof(hdr->ar_size), 10, &err);
  62. if (err || !size) {
  63. break;
  64. }
  65. offset += sizeof(*hdr);
  66. if (offset + size > elf->e_size) {
  67. break;
  68. }
  69. if (hdr->ar_name[1] == '/' && hdr->ar_name[2] == ' ') {
  70. elf->e_strtab = elf->e_data + offset;
  71. elf->e_strlen = size;
  72. break;
  73. }
  74. if (hdr->ar_name[1] != ' ') {
  75. break;
  76. }
  77. /*
  78. * Windows (.lib) archives provide two symbol tables
  79. * The first one is the one we want.
  80. */
  81. if (!elf->e_symtab) {
  82. elf->e_symtab = elf->e_data + offset;
  83. elf->e_symlen = size;
  84. }
  85. offset += size + (size & 1);
  86. }
  87. }
  88. static Elf_Arhdr*
  89. _elf_arhdr(Elf *arf) {
  90. struct ar_hdr *hdr;
  91. Elf_Arhdr *arhdr;
  92. size_t namelen;
  93. size_t tmp;
  94. char *name;
  95. size_t err = 0;
  96. if (arf->e_off == arf->e_size) {
  97. /* no error! */
  98. return NULL;
  99. }
  100. if (arf->e_off < 0 || arf->e_off > arf->e_size) {
  101. seterr(ERROR_OUTSIDE);
  102. return NULL;
  103. }
  104. if (arf->e_off + sizeof(*hdr) > arf->e_size) {
  105. seterr(ERROR_TRUNC_ARHDR);
  106. return NULL;
  107. }
  108. elf_assert(arf->e_data != NULL);
  109. hdr = (struct ar_hdr*)(arf->e_data + arf->e_off);
  110. if (memcmp(hdr->ar_fmag, fmag, sizeof(fmag) - 1)) {
  111. seterr(ERROR_ARFMAG);
  112. return NULL;
  113. }
  114. name = hdr->ar_name;
  115. for (namelen = sizeof(hdr->ar_name); namelen > 0; namelen--) {
  116. if (name[namelen - 1] != ' ') {
  117. break;
  118. }
  119. }
  120. if (name[0] == '/') {
  121. if (name[1] >= '0' && name[1] <= '9') {
  122. if (!arf->e_strtab) {
  123. seterr(ERROR_ARSTRTAB);
  124. return NULL;
  125. }
  126. tmp = getnum(&name[1], namelen - 1, 10, &err);
  127. if (err) {
  128. seterr(ERROR_ARSPECIAL);
  129. return NULL;
  130. }
  131. if (tmp < 0 || tmp >= arf->e_strlen) {
  132. seterr(ERROR_ARSTRTAB);
  133. return NULL;
  134. }
  135. for (namelen = tmp; namelen < arf->e_strlen; namelen++) {
  136. if (arf->e_strtab[namelen] == '/') {
  137. break;
  138. }
  139. }
  140. if (namelen == arf->e_strlen) {
  141. seterr(ERROR_ARSTRTAB);
  142. return NULL;
  143. }
  144. name = arf->e_strtab + tmp;
  145. namelen -= tmp;
  146. }
  147. else if (namelen != 1 && !(namelen == 2 && name[1] == '/')) {
  148. seterr(ERROR_ARSPECIAL);
  149. return NULL;
  150. }
  151. }
  152. else if (namelen > 0 && name[namelen - 1] == '/') {
  153. namelen--;
  154. }
  155. /* XXX some broken software omits the trailing slash
  156. else {
  157. namelen = 0;
  158. }
  159. */
  160. if (!(arhdr = (Elf_Arhdr*)malloc(sizeof(*arhdr) +
  161. sizeof(hdr->ar_name) + namelen + 2))) {
  162. seterr(ERROR_MEM_ARHDR);
  163. return NULL;
  164. }
  165. arhdr->ar_name = NULL;
  166. arhdr->ar_rawname = (char*)(arhdr + 1);
  167. arhdr->ar_date = getnum(hdr->ar_date, sizeof(hdr->ar_date), 10, &err);
  168. arhdr->ar_uid = getnum(hdr->ar_uid, sizeof(hdr->ar_uid), 10, &err);
  169. arhdr->ar_gid = getnum(hdr->ar_gid, sizeof(hdr->ar_gid), 10, &err);
  170. arhdr->ar_mode = getnum(hdr->ar_mode, sizeof(hdr->ar_mode), 8, &err);
  171. arhdr->ar_size = getnum(hdr->ar_size, sizeof(hdr->ar_size), 10, &err);
  172. if (err) {
  173. free(arhdr);
  174. seterr(ERROR_ARHDR);
  175. return NULL;
  176. }
  177. if (arf->e_off + sizeof(struct ar_hdr) + arhdr->ar_size > arf->e_size) {
  178. free(arhdr);
  179. seterr(ERROR_TRUNC_MEMBER);
  180. return NULL;
  181. }
  182. memcpy(arhdr->ar_rawname, hdr->ar_name, sizeof(hdr->ar_name));
  183. arhdr->ar_rawname[sizeof(hdr->ar_name)] = '\0';
  184. if (namelen) {
  185. arhdr->ar_name = arhdr->ar_rawname + sizeof(hdr->ar_name) + 1;
  186. memcpy(arhdr->ar_name, name, namelen);
  187. arhdr->ar_name[namelen] = '\0';
  188. }
  189. return arhdr;
  190. }
  191. static void
  192. _elf_check_type(Elf *elf, size_t size) {
  193. elf->e_idlen = size;
  194. if (size >= EI_NIDENT && !memcmp(elf->e_data, ELFMAG, SELFMAG)) {
  195. elf->e_kind = ELF_K_ELF;
  196. elf->e_idlen = EI_NIDENT;
  197. elf->e_class = elf->e_data[EI_CLASS];
  198. elf->e_encoding = elf->e_data[EI_DATA];
  199. elf->e_version = elf->e_data[EI_VERSION];
  200. }
  201. else if (size >= SARMAG && !memcmp(elf->e_data, ARMAG, SARMAG)) {
  202. _elf_init_ar(elf);
  203. }
  204. }
  205. Elf*
  206. elf_begin(int fd, Elf_Cmd cmd, Elf *ref) {
  207. Elf_Arhdr *arhdr = NULL;
  208. size_t size = 0;
  209. off_t off;
  210. Elf *elf;
  211. elf_assert(_elf_init.e_magic == ELF_MAGIC);
  212. if (_elf_version == EV_NONE) {
  213. seterr(ERROR_VERSION_UNSET);
  214. return NULL;
  215. }
  216. else if (cmd == ELF_C_NULL) {
  217. return NULL;
  218. }
  219. else if (cmd == ELF_C_WRITE) {
  220. ref = NULL;
  221. }
  222. else if (cmd != ELF_C_READ && cmd != ELF_C_RDWR) {
  223. seterr(ERROR_INVALID_CMD);
  224. return NULL;
  225. }
  226. else if (ref) {
  227. elf_assert(ref->e_magic == ELF_MAGIC);
  228. if (!ref->e_readable || (cmd == ELF_C_RDWR && !ref->e_writable)) {
  229. seterr(ERROR_CMDMISMATCH);
  230. return NULL;
  231. }
  232. if (ref->e_kind != ELF_K_AR) {
  233. ref->e_count++;
  234. return ref;
  235. }
  236. if (cmd == ELF_C_RDWR) {
  237. seterr(ERROR_MEMBERWRITE);
  238. return NULL;
  239. }
  240. if (ref->e_memory) {
  241. fd = ref->e_fd;
  242. }
  243. else if (fd != ref->e_fd) {
  244. seterr(ERROR_FDMISMATCH);
  245. return NULL;
  246. }
  247. if (!(arhdr = _elf_arhdr(ref))) {
  248. return NULL;
  249. }
  250. size = arhdr->ar_size;
  251. }
  252. else if ((off = lseek(fd, (off_t)0, SEEK_END)) == (off_t)-1
  253. || (off_t)(size = off) != off) {
  254. seterr(ERROR_IO_GETSIZE);
  255. return NULL;
  256. }
  257. if (!(elf = (Elf*)malloc(sizeof(Elf)))) {
  258. seterr(ERROR_MEM_ELF);
  259. return NULL;
  260. }
  261. *elf = _elf_init;
  262. elf->e_fd = fd;
  263. elf->e_parent = ref;
  264. elf->e_size = elf->e_dsize = size;
  265. if (cmd != ELF_C_READ) {
  266. elf->e_writable = 1;
  267. }
  268. if (cmd != ELF_C_WRITE) {
  269. elf->e_readable = 1;
  270. }
  271. else {
  272. return elf;
  273. }
  274. if (ref) {
  275. size_t offset = ref->e_off + sizeof(struct ar_hdr);
  276. Elf *xelf;
  277. elf_assert(arhdr);
  278. elf->e_arhdr = arhdr;
  279. elf->e_base = ref->e_base + offset;
  280. /*
  281. * Share the archive's memory image. To avoid
  282. * multiple independent elf descriptors if the
  283. * same member is requested twice, scan the list
  284. * of open members for duplicates.
  285. *
  286. * I don't know how SVR4 handles this case. Don't rely on it.
  287. */
  288. for (xelf = ref->e_members; xelf; xelf = xelf->e_link) {
  289. elf_assert(xelf->e_parent == ref);
  290. if (xelf->e_base == elf->e_base) {
  291. free(arhdr);
  292. free(elf);
  293. xelf->e_count++;
  294. return xelf;
  295. }
  296. }
  297. if (size == 0) {
  298. elf->e_data = NULL;
  299. }
  300. #if 1
  301. else {
  302. /*
  303. * Archive members may be misaligned. Freezing them will
  304. * cause libelf to allocate buffers for translated data,
  305. * which should be properly aligned in all cases.
  306. */
  307. elf_assert(!ref->e_cooked);
  308. elf->e_data = elf->e_rawdata = ref->e_data + offset;
  309. }
  310. #else
  311. else if (ref->e_data == ref->e_rawdata) {
  312. elf_assert(!ref->e_cooked);
  313. /*
  314. * archive is frozen - freeze member, too
  315. */
  316. elf->e_data = elf->e_rawdata = ref->e_data + offset;
  317. }
  318. else {
  319. elf_assert(!ref->e_memory);
  320. elf->e_data = ref->e_data + offset;
  321. /*
  322. * The member's memory image may have been modified if
  323. * the member has been processed before. Since we need the
  324. * original image, we have to re-read the archive file.
  325. * Will fail if the archive's file descriptor is disabled.
  326. */
  327. if (!ref->e_cooked) {
  328. ref->e_cooked = 1;
  329. }
  330. else if (!_elf_read(ref, elf->e_data, offset, size)) {
  331. free(arhdr);
  332. free(elf);
  333. return NULL;
  334. }
  335. }
  336. #endif
  337. elf->e_next = offset + size + (size & 1);
  338. elf->e_disabled = ref->e_disabled;
  339. elf->e_memory = ref->e_memory;
  340. /* parent/child linking */
  341. elf->e_link = ref->e_members;
  342. ref->e_members = elf;
  343. ref->e_count++;
  344. /* Slowaris compatibility - do not rely on this! */
  345. ref->e_off = elf->e_next;
  346. }
  347. else if (size) {
  348. #if HAVE_MMAP
  349. /*
  350. * Using mmap on writable files will interfere with elf_update
  351. */
  352. if (!elf->e_writable && (elf->e_data = _elf_mmap(elf))) {
  353. elf->e_unmap_data = 1;
  354. }
  355. else
  356. #endif /* HAVE_MMAP */
  357. if (!(elf->e_data = _elf_read(elf, NULL, 0, size))) {
  358. free(elf);
  359. return NULL;
  360. }
  361. }
  362. _elf_check_type(elf, size);
  363. return elf;
  364. }
  365. Elf*
  366. elf_memory(char *image, size_t size) {
  367. Elf *elf;
  368. elf_assert(_elf_init.e_magic == ELF_MAGIC);
  369. if (_elf_version == EV_NONE) {
  370. seterr(ERROR_VERSION_UNSET);
  371. return NULL;
  372. }
  373. else if (size == 0 || image == NULL) {
  374. /* TODO: set error code? */
  375. return NULL;
  376. }
  377. if (!(elf = (Elf*)malloc(sizeof(Elf)))) {
  378. seterr(ERROR_MEM_ELF);
  379. return NULL;
  380. }
  381. *elf = _elf_init;
  382. elf->e_size = elf->e_dsize = size;
  383. elf->e_data = elf->e_rawdata = image;
  384. elf->e_readable = 1;
  385. elf->e_disabled = 1;
  386. elf->e_memory = 1;
  387. _elf_check_type(elf, size);
  388. return elf;
  389. }
  390. #if __LIBELF64
  391. int
  392. gelf_getclass(Elf *elf) {
  393. if (elf && elf->e_kind == ELF_K_ELF && valid_class(elf->e_class)) {
  394. return elf->e_class;
  395. }
  396. return ELFCLASSNONE;
  397. }
  398. #endif /* __LIBELF64 */