found_entry: /* Trick: most of the ELF64_R_TYPE field is unused. There are 42 valid relocation types, and a 32-bit field. Co-opt the
bits above 256 to store the got offset for this reloc. */
rela->r_info |= g->got_offset << 8;
}
/* Find out how large the symbol table is. Allocate one got_entry head per symbol. Normally this will be enough, but not always.
We'll chain different offsets for the symbol down each head. */ for (s = sechdrs; s < esechdrs; ++s) if (s->sh_type == SHT_SYMTAB)
symtab = s; elseif (!strcmp(".got", secstrings + s->sh_name)) {
got = s;
me->arch.gotsecindex = s - sechdrs;
}
if (!symtab) {
printk(KERN_ERR "module %s: no symbol table\n", me->name); return -ENOEXEC;
} if (!got) {
printk(KERN_ERR "module %s: no got section\n", me->name); return -ENOEXEC;
}
nsyms = symtab->sh_size / sizeof(Elf64_Sym);
chains = kcalloc(nsyms, sizeof(struct got_entry), GFP_KERNEL); if (!chains) {
printk(KERN_ERR "module %s: no memory for symbol chain buffer\n",
me->name); return -ENOMEM;
}
/* Examine all LITERAL relocations to find out what GOT entries
are required. This sizes the GOT section as well. */ for (s = sechdrs; s < esechdrs; ++s) if (s->sh_type == SHT_RELA) {
nrela = s->sh_size / sizeof(Elf64_Rela);
rela = (void *)hdr + s->sh_offset; for (i = 0; i < nrela; ++i)
process_reloc_for_got(rela+i, chains,
&got->sh_size);
}
/* Free the memory we allocated. */ for (i = 0; i < nsyms; ++i) { struct got_entry *g, *n; for (g = chains[i].next; g ; g = n) {
n = g->next;
kfree(g);
}
}
kfree(chains);
/* This is where to make the change. */
location = base + rela[i].r_offset;
/* This is the symbol it is referring to. Note that all
unresolved symbols have been resolved. */
sym = symtab + r_sym;
value = sym->st_value + rela[i].r_addend;
switch (r_type) { case R_ALPHA_NONE: break; case R_ALPHA_REFLONG:
*(u32 *)location = value; break; case R_ALPHA_REFQUAD: /* BUG() can produce misaligned relocations. */
((u32 *)location)[0] = value;
((u32 *)location)[1] = value >> 32; break; case R_ALPHA_GPREL32:
value -= gp; if ((int)value != value) goto reloc_overflow;
*(u32 *)location = value; break; case R_ALPHA_LITERAL:
hi = got + r_got_offset;
lo = hi - gp; if ((short)lo != lo) goto reloc_overflow;
*(u16 *)location = lo;
*(u64 *)hi = value; break; case R_ALPHA_LITUSE: break; case R_ALPHA_GPDISP:
value = gp - (u64)location;
lo = (short)value;
hi = (int)(value - lo); if (hi + lo != value) goto reloc_overflow;
*(u16 *)location = hi >> 16;
*(u16 *)(location + rela[i].r_addend) = lo; break; case R_ALPHA_BRSGP: /* BRSGP is only allowed to bind to local symbols. If the section is undef, this means that the
value was resolved from somewhere else. */ if (sym->st_shndx == SHN_UNDEF) goto reloc_overflow; if ((sym->st_other & STO_ALPHA_STD_GPLOAD) ==
STO_ALPHA_STD_GPLOAD) /* Omit the prologue. */
value += 8;
fallthrough; case R_ALPHA_BRADDR:
value -= (u64)location + 4; if (value & 3) goto reloc_overflow;
value = (long)value >> 2; if (value + (1<<21) >= 1<<22) goto reloc_overflow;
value &= 0x1fffff;
value |= *(u32 *)location & ~0x1fffff;
*(u32 *)location = value; break; case R_ALPHA_HINT: break; case R_ALPHA_SREL32:
value -= (u64)location; if ((int)value != value) goto reloc_overflow;
*(u32 *)location = value; break; case R_ALPHA_SREL64:
value -= (u64)location;
*(u64 *)location = value; break; case R_ALPHA_GPRELHIGH:
value = (long)(value - gp + 0x8000) >> 16; if ((short) value != value) goto reloc_overflow;
*(u16 *)location = value; break; case R_ALPHA_GPRELLOW:
value -= gp;
*(u16 *)location = value; break; case R_ALPHA_GPREL16:
value -= gp; if ((short) value != value) goto reloc_overflow;
*(u16 *)location = value; break; default:
printk(KERN_ERR "module %s: Unknown relocation: %lu\n",
me->name, r_type); return -ENOEXEC;
reloc_overflow: if (ELF64_ST_TYPE (sym->st_info) == STT_SECTION)
printk(KERN_ERR "module %s: Relocation (type %lu) overflow vs section %d\n",
me->name, r_type, sym->st_shndx); else
printk(KERN_ERR "module %s: Relocation (type %lu) overflow vs %s\n",
me->name, r_type, strtab + sym->st_name); return -ENOEXEC;
}
}
return 0;
}
Messung V0.5
¤ Dauer der Verarbeitung: 0.0 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.