elf.c 22.4 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0-or-later
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/*
 * elf.c - ELF access library
 *
 * Adapted from kpatch (https://github.com/dynup/kpatch):
 * Copyright (C) 2013-2015 Josh Poimboeuf <jpoimboe@redhat.com>
 * Copyright (C) 2014 Seth Jennings <sjenning@redhat.com>
 */

#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
17
#include <errno.h>
P
Peter Zijlstra 已提交
18
#include "builtin.h"
19 20 21 22

#include "elf.h"
#include "warn.h"

23 24
#define MAX_NAME_LEN 128

25 26 27 28 29
static inline u32 str_hash(const char *str)
{
	return jhash(str, strlen(str), 0);
}

30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
static inline int elf_hash_bits(void)
{
	return vmlinux ? ELF_HASH_BITS : 16;
}

#define elf_hash_add(hashtable, node, key) \
	hlist_add_head(node, &hashtable[hash_min(key, elf_hash_bits())])

static void elf_hash_init(struct hlist_head *table)
{
	__hash_init(table, 1U << elf_hash_bits());
}

#define elf_hash_for_each_possible(name, obj, member, key)			\
	hlist_for_each_entry(obj, &name[hash_min(key, elf_hash_bits())], member)

46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
static void rb_add(struct rb_root *tree, struct rb_node *node,
		   int (*cmp)(struct rb_node *, const struct rb_node *))
{
	struct rb_node **link = &tree->rb_node;
	struct rb_node *parent = NULL;

	while (*link) {
		parent = *link;
		if (cmp(node, parent) < 0)
			link = &parent->rb_left;
		else
			link = &parent->rb_right;
	}

	rb_link_node(node, parent, link);
	rb_insert_color(node, tree);
}

64
static struct rb_node *rb_find_first(const struct rb_root *tree, const void *key,
65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
			       int (*cmp)(const void *key, const struct rb_node *))
{
	struct rb_node *node = tree->rb_node;
	struct rb_node *match = NULL;

	while (node) {
		int c = cmp(key, node);
		if (c <= 0) {
			if (!c)
				match = node;
			node = node->rb_left;
		} else if (c > 0) {
			node = node->rb_right;
		}
	}

	return match;
}

static struct rb_node *rb_next_match(struct rb_node *node, const void *key,
				    int (*cmp)(const void *key, const struct rb_node *))
{
	node = rb_next(node);
	if (node && cmp(key, node))
		node = NULL;
	return node;
}

#define rb_for_each(tree, node, key, cmp) \
	for ((node) = rb_find_first((tree), (key), (cmp)); \
	     (node); (node) = rb_next_match((node), (key), (cmp)))

static int symbol_to_offset(struct rb_node *a, const struct rb_node *b)
{
	struct symbol *sa = rb_entry(a, struct symbol, node);
	struct symbol *sb = rb_entry(b, struct symbol, node);

	if (sa->offset < sb->offset)
		return -1;
	if (sa->offset > sb->offset)
		return 1;

	if (sa->len < sb->len)
		return -1;
	if (sa->len > sb->len)
		return 1;

	sa->alias = sb;

	return 0;
}

static int symbol_by_offset(const void *key, const struct rb_node *node)
{
	const struct symbol *s = rb_entry(node, struct symbol, node);
	const unsigned long *o = key;

	if (*o < s->offset)
		return -1;
124
	if (*o >= s->offset + s->len)
125 126 127 128 129
		return 1;

	return 0;
}

130
struct section *find_section_by_name(const struct elf *elf, const char *name)
131 132 133
{
	struct section *sec;

134
	elf_hash_for_each_possible(elf->section_name_hash, sec, name_hash, str_hash(name))
135 136 137 138 139 140 141 142 143 144 145
		if (!strcmp(sec->name, name))
			return sec;

	return NULL;
}

static struct section *find_section_by_index(struct elf *elf,
					     unsigned int idx)
{
	struct section *sec;

146
	elf_hash_for_each_possible(elf->section_hash, sec, hash, idx)
147 148 149 150 151 152 153 154 155 156
		if (sec->idx == idx)
			return sec;

	return NULL;
}

static struct symbol *find_symbol_by_index(struct elf *elf, unsigned int idx)
{
	struct symbol *sym;

157
	elf_hash_for_each_possible(elf->symbol_hash, sym, hash, idx)
158 159
		if (sym->idx == idx)
			return sym;
160 161 162 163 164 165

	return NULL;
}

struct symbol *find_symbol_by_offset(struct section *sec, unsigned long offset)
{
166
	struct rb_node *node;
167

168 169 170 171 172 173
	rb_for_each(&sec->symbol_tree, node, &offset, symbol_by_offset) {
		struct symbol *s = rb_entry(node, struct symbol, node);

		if (s->offset == offset && s->type != STT_SECTION)
			return s;
	}
174 175 176 177 178 179

	return NULL;
}

struct symbol *find_func_by_offset(struct section *sec, unsigned long offset)
{
180
	struct rb_node *node;
181

182 183 184 185 186 187
	rb_for_each(&sec->symbol_tree, node, &offset, symbol_by_offset) {
		struct symbol *s = rb_entry(node, struct symbol, node);

		if (s->offset == offset && s->type == STT_FUNC)
			return s;
	}
188 189 190 191

	return NULL;
}

192
struct symbol *find_symbol_containing(const struct section *sec, unsigned long offset)
193
{
194
	struct rb_node *node;
195

196 197 198 199 200 201
	rb_for_each(&sec->symbol_tree, node, &offset, symbol_by_offset) {
		struct symbol *s = rb_entry(node, struct symbol, node);

		if (s->type != STT_SECTION)
			return s;
	}
202 203 204 205

	return NULL;
}

206
struct symbol *find_func_containing(struct section *sec, unsigned long offset)
207 208 209 210 211 212 213 214 215 216 217 218 219
{
	struct rb_node *node;

	rb_for_each(&sec->symbol_tree, node, &offset, symbol_by_offset) {
		struct symbol *s = rb_entry(node, struct symbol, node);

		if (s->type == STT_FUNC)
			return s;
	}

	return NULL;
}

220
struct symbol *find_symbol_by_name(const struct elf *elf, const char *name)
221 222 223
{
	struct symbol *sym;

224
	elf_hash_for_each_possible(elf->symbol_name_hash, sym, name_hash, str_hash(name))
225 226
		if (!strcmp(sym->name, name))
			return sym;
227 228 229 230

	return NULL;
}

M
Matt Helsley 已提交
231
struct reloc *find_reloc_by_dest_range(const struct elf *elf, struct section *sec,
232
				     unsigned long offset, unsigned int len)
233
{
M
Matt Helsley 已提交
234
	struct reloc *reloc, *r = NULL;
235
	unsigned long o;
236

M
Matt Helsley 已提交
237
	if (!sec->reloc)
238 239
		return NULL;

M
Matt Helsley 已提交
240
	sec = sec->reloc;
241

242
	for_offset_range(o, offset, offset + len) {
M
Matt Helsley 已提交
243
		elf_hash_for_each_possible(elf->reloc_hash, reloc, hash,
244
				       sec_offset_hash(sec, o)) {
M
Matt Helsley 已提交
245
			if (reloc->sec != sec)
246 247
				continue;

M
Matt Helsley 已提交
248 249 250
			if (reloc->offset >= offset && reloc->offset < offset + len) {
				if (!r || reloc->offset < r->offset)
					r = reloc;
251
			}
252
		}
253 254
		if (r)
			return r;
255
	}
256 257 258 259

	return NULL;
}

M
Matt Helsley 已提交
260
struct reloc *find_reloc_by_dest(const struct elf *elf, struct section *sec, unsigned long offset)
261
{
M
Matt Helsley 已提交
262
	return find_reloc_by_dest_range(elf, sec, offset, 1);
263 264
}

265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
void insn_to_reloc_sym_addend(struct section *sec, unsigned long offset,
			      struct reloc *reloc)
{
	if (sec->sym) {
		reloc->sym = sec->sym;
		reloc->addend = offset;
		return;
	}

	/*
	 * The Clang assembler strips section symbols, so we have to reference
	 * the function symbol instead:
	 */
	reloc->sym = find_symbol_containing(sec, offset);
	if (!reloc->sym) {
		/*
		 * Hack alert.  This happens when we need to reference the NOP
		 * pad insn immediately after the function.
		 */
		reloc->sym = find_symbol_containing(sec, offset - 1);
	}

	if (reloc->sym)
		reloc->addend = offset - reloc->sym->offset;
}

291 292 293 294 295 296 297 298
static int read_sections(struct elf *elf)
{
	Elf_Scn *s = NULL;
	struct section *sec;
	size_t shstrndx, sections_nr;
	int i;

	if (elf_getshdrnum(elf->elf, &sections_nr)) {
299
		WARN_ELF("elf_getshdrnum");
300 301 302 303
		return -1;
	}

	if (elf_getshdrstrndx(elf->elf, &shstrndx)) {
304
		WARN_ELF("elf_getshdrstrndx");
305 306 307 308 309 310 311 312 313 314 315
		return -1;
	}

	for (i = 0; i < sections_nr; i++) {
		sec = malloc(sizeof(*sec));
		if (!sec) {
			perror("malloc");
			return -1;
		}
		memset(sec, 0, sizeof(*sec));

316
		INIT_LIST_HEAD(&sec->symbol_list);
M
Matt Helsley 已提交
317
		INIT_LIST_HEAD(&sec->reloc_list);
318 319 320

		s = elf_getscn(elf->elf, i);
		if (!s) {
321
			WARN_ELF("elf_getscn");
322 323 324 325 326 327
			return -1;
		}

		sec->idx = elf_ndxscn(s);

		if (!gelf_getshdr(s, &sec->sh)) {
328
			WARN_ELF("gelf_getshdr");
329 330 331 332 333
			return -1;
		}

		sec->name = elf_strptr(elf->elf, shstrndx, sec->sh.sh_name);
		if (!sec->name) {
334
			WARN_ELF("elf_strptr");
335 336 337
			return -1;
		}

338 339 340 341 342 343 344 345 346 347 348 349
		if (sec->sh.sh_size != 0) {
			sec->data = elf_getdata(s, NULL);
			if (!sec->data) {
				WARN_ELF("elf_getdata");
				return -1;
			}
			if (sec->data->d_off != 0 ||
			    sec->data->d_size != sec->sh.sh_size) {
				WARN("unexpected data attributes for %s",
				     sec->name);
				return -1;
			}
350
		}
351
		sec->len = sec->sh.sh_size;
352 353

		list_add_tail(&sec->list, &elf->sections);
354 355
		elf_hash_add(elf->section_hash, &sec->hash, sec->idx);
		elf_hash_add(elf->section_name_hash, &sec->name_hash, str_hash(sec->name));
356 357
	}

P
Peter Zijlstra 已提交
358 359 360
	if (stats)
		printf("nr_sections: %lu\n", (unsigned long)sections_nr);

361 362 363 364 365 366 367 368 369 370 371
	/* sanity check, one more call to elf_nextscn() should return NULL */
	if (elf_nextscn(elf->elf, s)) {
		WARN("section entry mismatch");
		return -1;
	}

	return 0;
}

static int read_symbols(struct elf *elf)
{
372
	struct section *symtab, *symtab_shndx, *sec;
373 374 375
	struct symbol *sym, *pfunc;
	struct list_head *entry;
	struct rb_node *pnode;
376
	int symbols_nr, i;
377
	char *coldstr;
378 379
	Elf_Data *shndx_data = NULL;
	Elf32_Word shndx;
380 381 382

	symtab = find_section_by_name(elf, ".symtab");
	if (!symtab) {
383 384 385 386 387
		/*
		 * A missing symbol table is actually possible if it's an empty
		 * .o file.  This can happen for thunk_64.o.
		 */
		return 0;
388 389
	}

390 391 392 393
	symtab_shndx = find_section_by_name(elf, ".symtab_shndx");
	if (symtab_shndx)
		shndx_data = symtab_shndx->data;

394 395 396 397 398 399 400 401 402
	symbols_nr = symtab->sh.sh_size / symtab->sh.sh_entsize;

	for (i = 0; i < symbols_nr; i++) {
		sym = malloc(sizeof(*sym));
		if (!sym) {
			perror("malloc");
			return -1;
		}
		memset(sym, 0, sizeof(*sym));
403
		sym->alias = sym;
404 405 406

		sym->idx = i;

407 408 409
		if (!gelf_getsymshndx(symtab->data, shndx_data, i, &sym->sym,
				      &shndx)) {
			WARN_ELF("gelf_getsymshndx");
410 411 412 413 414 415
			goto err;
		}

		sym->name = elf_strptr(elf->elf, symtab->sh.sh_link,
				       sym->sym.st_name);
		if (!sym->name) {
416
			WARN_ELF("elf_strptr");
417 418 419 420 421 422
			goto err;
		}

		sym->type = GELF_ST_TYPE(sym->sym.st_info);
		sym->bind = GELF_ST_BIND(sym->sym.st_info);

423 424 425 426 427 428 429
		if ((sym->sym.st_shndx > SHN_UNDEF &&
		     sym->sym.st_shndx < SHN_LORESERVE) ||
		    (shndx_data && sym->sym.st_shndx == SHN_XINDEX)) {
			if (sym->sym.st_shndx != SHN_XINDEX)
				shndx = sym->sym.st_shndx;

			sym->sec = find_section_by_index(elf, shndx);
430 431 432 433 434 435 436 437 438 439 440 441 442 443 444
			if (!sym->sec) {
				WARN("couldn't find section for symbol %s",
				     sym->name);
				goto err;
			}
			if (sym->type == STT_SECTION) {
				sym->name = sym->sec->name;
				sym->sec->sym = sym;
			}
		} else
			sym->sec = find_section_by_index(elf, 0);

		sym->offset = sym->sym.st_value;
		sym->len = sym->sym.st_size;

445 446 447 448 449 450
		rb_add(&sym->sec->symbol_tree, &sym->node, symbol_to_offset);
		pnode = rb_prev(&sym->node);
		if (pnode)
			entry = &rb_entry(pnode, struct symbol, node)->list;
		else
			entry = &sym->sec->symbol_list;
451
		list_add(&sym->list, entry);
452 453
		elf_hash_add(elf->symbol_hash, &sym->hash, sym->idx);
		elf_hash_add(elf->symbol_name_hash, &sym->name_hash, str_hash(sym->name));
454 455 456 457 458 459 460

		/*
		 * Don't store empty STT_NOTYPE symbols in the rbtree.  They
		 * can exist within a function, confusing the sorting.
		 */
		if (!sym->len)
			rb_erase(&sym->node, &sym->sec->symbol_tree);
461 462
	}

P
Peter Zijlstra 已提交
463 464 465
	if (stats)
		printf("nr_symbols: %lu\n", (unsigned long)symbols_nr);

466 467 468
	/* Create parent/child links for any cold subfunctions */
	list_for_each_entry(sec, &elf->sections, list) {
		list_for_each_entry(sym, &sec->symbol_list, list) {
469 470
			char pname[MAX_NAME_LEN + 1];
			size_t pnamelen;
471 472
			if (sym->type != STT_FUNC)
				continue;
473 474 475 476 477 478 479

			if (sym->pfunc == NULL)
				sym->pfunc = sym;

			if (sym->cfunc == NULL)
				sym->cfunc = sym;

480
			coldstr = strstr(sym->name, ".cold");
481 482 483
			if (!coldstr)
				continue;

484 485 486 487 488 489 490 491 492 493
			pnamelen = coldstr - sym->name;
			if (pnamelen > MAX_NAME_LEN) {
				WARN("%s(): parent function name exceeds maximum length of %d characters",
				     sym->name, MAX_NAME_LEN);
				return -1;
			}

			strncpy(pname, sym->name, pnamelen);
			pname[pnamelen] = '\0';
			pfunc = find_symbol_by_name(elf, pname);
494 495 496 497

			if (!pfunc) {
				WARN("%s(): can't find parent function",
				     sym->name);
498
				return -1;
499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
			}

			sym->pfunc = pfunc;
			pfunc->cfunc = sym;

			/*
			 * Unfortunately, -fnoreorder-functions puts the child
			 * inside the parent.  Remove the overlap so we can
			 * have sane assumptions.
			 *
			 * Note that pfunc->len now no longer matches
			 * pfunc->sym.st_size.
			 */
			if (sym->sec == pfunc->sec &&
			    sym->offset >= pfunc->offset &&
			    sym->offset + sym->len == pfunc->offset + pfunc->len) {
				pfunc->len -= sym->len;
516 517 518 519
			}
		}
	}

520 521 522 523 524 525 526
	return 0;

err:
	free(sym);
	return -1;
}

M
Matt Helsley 已提交
527
void elf_add_reloc(struct elf *elf, struct reloc *reloc)
528
{
M
Matt Helsley 已提交
529
	struct section *sec = reloc->sec;
530

M
Matt Helsley 已提交
531 532
	list_add_tail(&reloc->list, &sec->reloc_list);
	elf_hash_add(elf->reloc_hash, &reloc->hash, reloc_hash(reloc));
533 534
}

535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560
static int read_rel_reloc(struct section *sec, int i, struct reloc *reloc, unsigned int *symndx)
{
	if (!gelf_getrel(sec->data, i, &reloc->rel)) {
		WARN_ELF("gelf_getrel");
		return -1;
	}
	reloc->type = GELF_R_TYPE(reloc->rel.r_info);
	reloc->addend = 0;
	reloc->offset = reloc->rel.r_offset;
	*symndx = GELF_R_SYM(reloc->rel.r_info);
	return 0;
}

static int read_rela_reloc(struct section *sec, int i, struct reloc *reloc, unsigned int *symndx)
{
	if (!gelf_getrela(sec->data, i, &reloc->rela)) {
		WARN_ELF("gelf_getrela");
		return -1;
	}
	reloc->type = GELF_R_TYPE(reloc->rela.r_info);
	reloc->addend = reloc->rela.r_addend;
	reloc->offset = reloc->rela.r_offset;
	*symndx = GELF_R_SYM(reloc->rela.r_info);
	return 0;
}

M
Matt Helsley 已提交
561
static int read_relocs(struct elf *elf)
562 563
{
	struct section *sec;
M
Matt Helsley 已提交
564
	struct reloc *reloc;
565 566
	int i;
	unsigned int symndx;
M
Matt Helsley 已提交
567
	unsigned long nr_reloc, max_reloc = 0, tot_reloc = 0;
568 569

	list_for_each_entry(sec, &elf->sections, list) {
570 571
		if ((sec->sh.sh_type != SHT_RELA) &&
		    (sec->sh.sh_type != SHT_REL))
572 573
			continue;

574
		sec->base = find_section_by_index(elf, sec->sh.sh_info);
575
		if (!sec->base) {
M
Matt Helsley 已提交
576
			WARN("can't find base section for reloc section %s",
577 578 579 580
			     sec->name);
			return -1;
		}

M
Matt Helsley 已提交
581
		sec->base->reloc = sec;
582

M
Matt Helsley 已提交
583
		nr_reloc = 0;
584
		for (i = 0; i < sec->sh.sh_size / sec->sh.sh_entsize; i++) {
M
Matt Helsley 已提交
585 586
			reloc = malloc(sizeof(*reloc));
			if (!reloc) {
587 588 589
				perror("malloc");
				return -1;
			}
M
Matt Helsley 已提交
590
			memset(reloc, 0, sizeof(*reloc));
591 592 593 594 595 596 597 598 599 600
			switch (sec->sh.sh_type) {
			case SHT_REL:
				if (read_rel_reloc(sec, i, reloc, &symndx))
					return -1;
				break;
			case SHT_RELA:
				if (read_rela_reloc(sec, i, reloc, &symndx))
					return -1;
				break;
			default: return -1;
601 602
			}

M
Matt Helsley 已提交
603
			reloc->sec = sec;
604 605
			reloc->idx = i;
			reloc->sym = find_symbol_by_index(elf, symndx);
M
Matt Helsley 已提交
606 607
			if (!reloc->sym) {
				WARN("can't find reloc entry symbol %d for %s",
608 609 610
				     symndx, sec->name);
				return -1;
			}
611

M
Matt Helsley 已提交
612 613
			elf_add_reloc(elf, reloc);
			nr_reloc++;
614
		}
M
Matt Helsley 已提交
615 616
		max_reloc = max(max_reloc, nr_reloc);
		tot_reloc += nr_reloc;
P
Peter Zijlstra 已提交
617 618 619
	}

	if (stats) {
M
Matt Helsley 已提交
620 621
		printf("max_reloc: %lu\n", max_reloc);
		printf("tot_reloc: %lu\n", tot_reloc);
622 623 624 625 626
	}

	return 0;
}

627
struct elf *elf_open_read(const char *name, int flags)
628 629
{
	struct elf *elf;
630
	Elf_Cmd cmd;
631 632 633 634 635 636 637 638

	elf_version(EV_CURRENT);

	elf = malloc(sizeof(*elf));
	if (!elf) {
		perror("malloc");
		return NULL;
	}
639
	memset(elf, 0, offsetof(struct elf, sections));
640 641 642

	INIT_LIST_HEAD(&elf->sections);

643 644 645 646
	elf_hash_init(elf->symbol_hash);
	elf_hash_init(elf->symbol_name_hash);
	elf_hash_init(elf->section_hash);
	elf_hash_init(elf->section_name_hash);
M
Matt Helsley 已提交
647
	elf_hash_init(elf->reloc_hash);
648

649
	elf->fd = open(name, flags);
650
	if (elf->fd == -1) {
651 652
		fprintf(stderr, "objtool: Can't open '%s': %s\n",
			name, strerror(errno));
653 654 655
		goto err;
	}

656 657 658 659 660 661 662 663
	if ((flags & O_ACCMODE) == O_RDONLY)
		cmd = ELF_C_READ_MMAP;
	else if ((flags & O_ACCMODE) == O_RDWR)
		cmd = ELF_C_RDWR;
	else /* O_WRONLY */
		cmd = ELF_C_WRITE;

	elf->elf = elf_begin(elf->fd, cmd, NULL);
664
	if (!elf->elf) {
665
		WARN_ELF("elf_begin");
666 667 668 669
		goto err;
	}

	if (!gelf_getehdr(elf->elf, &elf->ehdr)) {
670
		WARN_ELF("gelf_getehdr");
671 672 673 674 675 676 677 678 679
		goto err;
	}

	if (read_sections(elf))
		goto err;

	if (read_symbols(elf))
		goto err;

M
Matt Helsley 已提交
680
	if (read_relocs(elf))
681 682 683 684 685 686 687 688 689
		goto err;

	return elf;

err:
	elf_close(elf);
	return NULL;
}

690
struct section *elf_create_section(struct elf *elf, const char *name,
691
				   unsigned int sh_flags, size_t entsize, int nr)
692 693 694
{
	struct section *sec, *shstrtab;
	size_t size = entsize * nr;
695
	Elf_Scn *s;
696 697 698 699 700 701 702 703 704 705
	Elf_Data *data;

	sec = malloc(sizeof(*sec));
	if (!sec) {
		perror("malloc");
		return NULL;
	}
	memset(sec, 0, sizeof(*sec));

	INIT_LIST_HEAD(&sec->symbol_list);
M
Matt Helsley 已提交
706
	INIT_LIST_HEAD(&sec->reloc_list);
707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750

	s = elf_newscn(elf->elf);
	if (!s) {
		WARN_ELF("elf_newscn");
		return NULL;
	}

	sec->name = strdup(name);
	if (!sec->name) {
		perror("strdup");
		return NULL;
	}

	sec->idx = elf_ndxscn(s);
	sec->len = size;
	sec->changed = true;

	sec->data = elf_newdata(s);
	if (!sec->data) {
		WARN_ELF("elf_newdata");
		return NULL;
	}

	sec->data->d_size = size;
	sec->data->d_align = 1;

	if (size) {
		sec->data->d_buf = malloc(size);
		if (!sec->data->d_buf) {
			perror("malloc");
			return NULL;
		}
		memset(sec->data->d_buf, 0, size);
	}

	if (!gelf_getshdr(s, &sec->sh)) {
		WARN_ELF("gelf_getshdr");
		return NULL;
	}

	sec->sh.sh_size = size;
	sec->sh.sh_entsize = entsize;
	sec->sh.sh_type = SHT_PROGBITS;
	sec->sh.sh_addralign = 1;
751
	sec->sh.sh_flags = SHF_ALLOC | sh_flags;
752 753


754
	/* Add section name to .shstrtab (or .strtab for Clang) */
755
	shstrtab = find_section_by_name(elf, ".shstrtab");
756 757
	if (!shstrtab)
		shstrtab = find_section_by_name(elf, ".strtab");
758
	if (!shstrtab) {
759
		WARN("can't find .shstrtab or .strtab section");
760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783
		return NULL;
	}

	s = elf_getscn(elf->elf, shstrtab->idx);
	if (!s) {
		WARN_ELF("elf_getscn");
		return NULL;
	}

	data = elf_newdata(s);
	if (!data) {
		WARN_ELF("elf_newdata");
		return NULL;
	}

	data->d_buf = sec->name;
	data->d_size = strlen(name) + 1;
	data->d_align = 1;

	sec->sh.sh_name = shstrtab->len;

	shstrtab->len += strlen(name) + 1;
	shstrtab->changed = true;

784
	list_add_tail(&sec->list, &elf->sections);
785 786
	elf_hash_add(elf->section_hash, &sec->hash, sec->idx);
	elf_hash_add(elf->section_name_hash, &sec->name_hash, str_hash(sec->name));
787

788 789
	elf->changed = true;

790 791 792
	return sec;
}

793 794 795 796 797 798 799 800 801 802 803 804 805
static struct section *elf_create_rel_reloc_section(struct elf *elf, struct section *base)
{
	char *relocname;
	struct section *sec;

	relocname = malloc(strlen(base->name) + strlen(".rel") + 1);
	if (!relocname) {
		perror("malloc");
		return NULL;
	}
	strcpy(relocname, ".rel");
	strcat(relocname, base->name);

806
	sec = elf_create_section(elf, relocname, 0, sizeof(GElf_Rel), 0);
807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823
	free(relocname);
	if (!sec)
		return NULL;

	base->reloc = sec;
	sec->base = base;

	sec->sh.sh_type = SHT_REL;
	sec->sh.sh_addralign = 8;
	sec->sh.sh_link = find_section_by_name(elf, ".symtab")->idx;
	sec->sh.sh_info = base->idx;
	sec->sh.sh_flags = SHF_INFO_LINK;

	return sec;
}

static struct section *elf_create_rela_reloc_section(struct elf *elf, struct section *base)
824
{
M
Matt Helsley 已提交
825
	char *relocname;
826 827
	struct section *sec;

M
Matt Helsley 已提交
828 829
	relocname = malloc(strlen(base->name) + strlen(".rela") + 1);
	if (!relocname) {
830 831 832
		perror("malloc");
		return NULL;
	}
M
Matt Helsley 已提交
833 834
	strcpy(relocname, ".rela");
	strcat(relocname, base->name);
835

836
	sec = elf_create_section(elf, relocname, 0, sizeof(GElf_Rela), 0);
M
Matt Helsley 已提交
837
	free(relocname);
838 839 840
	if (!sec)
		return NULL;

M
Matt Helsley 已提交
841
	base->reloc = sec;
842 843 844 845 846 847 848 849 850 851 852
	sec->base = base;

	sec->sh.sh_type = SHT_RELA;
	sec->sh.sh_addralign = 8;
	sec->sh.sh_link = find_section_by_name(elf, ".symtab")->idx;
	sec->sh.sh_info = base->idx;
	sec->sh.sh_flags = SHF_INFO_LINK;

	return sec;
}

853 854 855 856 857 858 859 860 861 862 863 864
struct section *elf_create_reloc_section(struct elf *elf,
					 struct section *base,
					 int reltype)
{
	switch (reltype) {
	case SHT_REL:  return elf_create_rel_reloc_section(elf, base);
	case SHT_RELA: return elf_create_rela_reloc_section(elf, base);
	default:       return NULL;
	}
}

static int elf_rebuild_rel_reloc_section(struct section *sec, int nr)
865
{
M
Matt Helsley 已提交
866
	struct reloc *reloc;
867 868
	int idx = 0, size;
	GElf_Rel *relocs;
869

870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891
	/* Allocate a buffer for relocations */
	size = nr * sizeof(*relocs);
	relocs = malloc(size);
	if (!relocs) {
		perror("malloc");
		return -1;
	}

	sec->data->d_buf = relocs;
	sec->data->d_size = size;

	sec->sh.sh_size = size;

	idx = 0;
	list_for_each_entry(reloc, &sec->reloc_list, list) {
		relocs[idx].r_offset = reloc->offset;
		relocs[idx].r_info = GELF_R_INFO(reloc->sym->idx, reloc->type);
		idx++;
	}

	return 0;
}
892

893 894 895 896 897 898 899
static int elf_rebuild_rela_reloc_section(struct section *sec, int nr)
{
	struct reloc *reloc;
	int idx = 0, size;
	GElf_Rela *relocs;

	/* Allocate a buffer for relocations with addends */
M
Matt Helsley 已提交
900 901 902
	size = nr * sizeof(*relocs);
	relocs = malloc(size);
	if (!relocs) {
903 904 905 906
		perror("malloc");
		return -1;
	}

M
Matt Helsley 已提交
907
	sec->data->d_buf = relocs;
908 909 910 911 912
	sec->data->d_size = size;

	sec->sh.sh_size = size;

	idx = 0;
M
Matt Helsley 已提交
913 914 915 916
	list_for_each_entry(reloc, &sec->reloc_list, list) {
		relocs[idx].r_offset = reloc->offset;
		relocs[idx].r_addend = reloc->addend;
		relocs[idx].r_info = GELF_R_INFO(reloc->sym->idx, reloc->type);
917 918 919 920 921 922
		idx++;
	}

	return 0;
}

923
int elf_rebuild_reloc_section(struct elf *elf, struct section *sec)
924 925 926 927
{
	struct reloc *reloc;
	int nr;

928 929 930
	sec->changed = true;
	elf->changed = true;

931 932 933 934 935 936 937 938 939 940 941
	nr = 0;
	list_for_each_entry(reloc, &sec->reloc_list, list)
		nr++;

	switch (sec->sh.sh_type) {
	case SHT_REL:  return elf_rebuild_rel_reloc_section(sec, nr);
	case SHT_RELA: return elf_rebuild_rela_reloc_section(sec, nr);
	default:       return -1;
	}
}

942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960
int elf_write_insn(struct elf *elf, struct section *sec,
		   unsigned long offset, unsigned int len,
		   const char *insn)
{
	Elf_Data *data = sec->data;

	if (data->d_type != ELF_T_BYTE || data->d_off) {
		WARN("write to unexpected data for section: %s", sec->name);
		return -1;
	}

	memcpy(data->d_buf + offset, insn, len);
	elf_flagdata(data, ELF_C_SET, ELF_F_DIRTY);

	elf->changed = true;

	return 0;
}

961
int elf_write_reloc(struct elf *elf, struct reloc *reloc)
962
{
963
	struct section *sec = reloc->sec;
964

965 966 967
	if (sec->sh.sh_type == SHT_REL) {
		reloc->rel.r_info = GELF_R_INFO(reloc->sym->idx, reloc->type);
		reloc->rel.r_offset = reloc->offset;
968

969 970 971 972 973 974 975 976 977 978 979 980 981
		if (!gelf_update_rel(sec->data, reloc->idx, &reloc->rel)) {
			WARN_ELF("gelf_update_rel");
			return -1;
		}
	} else {
		reloc->rela.r_info = GELF_R_INFO(reloc->sym->idx, reloc->type);
		reloc->rela.r_addend = reloc->addend;
		reloc->rela.r_offset = reloc->offset;

		if (!gelf_update_rela(sec->data, reloc->idx, &reloc->rela)) {
			WARN_ELF("gelf_update_rela");
			return -1;
		}
982 983 984 985 986 987 988
	}

	elf->changed = true;

	return 0;
}

989
int elf_write(struct elf *elf)
990 991 992 993
{
	struct section *sec;
	Elf_Scn *s;

994
	/* Update section headers for changed sections: */
995 996 997 998 999 1000 1001
	list_for_each_entry(sec, &elf->sections, list) {
		if (sec->changed) {
			s = elf_getscn(elf->elf, sec->idx);
			if (!s) {
				WARN_ELF("elf_getscn");
				return -1;
			}
1002
			if (!gelf_update_shdr(s, &sec->sh)) {
1003 1004 1005
				WARN_ELF("gelf_update_shdr");
				return -1;
			}
1006 1007

			sec->changed = false;
1008 1009 1010
		}
	}

1011 1012 1013 1014
	/* Make sure the new section header entries get updated properly. */
	elf_flagelf(elf->elf, ELF_C_SET, ELF_F_DIRTY);

	/* Write all changes to the file. */
1015 1016 1017 1018 1019
	if (elf_update(elf->elf, ELF_C_WRITE) < 0) {
		WARN_ELF("elf_update");
		return -1;
	}

1020 1021
	elf->changed = false;

1022 1023 1024
	return 0;
}

1025 1026 1027 1028
void elf_close(struct elf *elf)
{
	struct section *sec, *tmpsec;
	struct symbol *sym, *tmpsym;
M
Matt Helsley 已提交
1029
	struct reloc *reloc, *tmpreloc;
1030

1031 1032 1033 1034 1035 1036
	if (elf->elf)
		elf_end(elf->elf);

	if (elf->fd > 0)
		close(elf->fd);

1037
	list_for_each_entry_safe(sec, tmpsec, &elf->sections, list) {
1038
		list_for_each_entry_safe(sym, tmpsym, &sec->symbol_list, list) {
1039
			list_del(&sym->list);
1040
			hash_del(&sym->hash);
1041 1042
			free(sym);
		}
M
Matt Helsley 已提交
1043 1044 1045 1046
		list_for_each_entry_safe(reloc, tmpreloc, &sec->reloc_list, list) {
			list_del(&reloc->list);
			hash_del(&reloc->hash);
			free(reloc);
1047 1048 1049 1050
		}
		list_del(&sec->list);
		free(sec);
	}
1051

1052 1053
	free(elf);
}