at v2.6.26-rc3 436 lines 12 kB view raw
1/* 2 * File: arch/blackfin/kernel/module.c 3 * Based on: 4 * Author: 5 * 6 * Created: 7 * Description: 8 * 9 * Modified: 10 * Copyright 2004-2006 Analog Devices Inc. 11 * 12 * Bugs: Enter bugs at http://blackfin.uclinux.org/ 13 * 14 * This program is free software; you can redistribute it and/or modify 15 * it under the terms of the GNU General Public License as published by 16 * the Free Software Foundation; either version 2 of the License, or 17 * (at your option) any later version. 18 * 19 * This program is distributed in the hope that it will be useful, 20 * but WITHOUT ANY WARRANTY; without even the implied warranty of 21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 22 * GNU General Public License for more details. 23 * 24 * You should have received a copy of the GNU General Public License 25 * along with this program; if not, see the file COPYING, or write 26 * to the Free Software Foundation, Inc., 27 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 28 */ 29 30 31#include <linux/moduleloader.h> 32#include <linux/elf.h> 33#include <linux/vmalloc.h> 34#include <linux/fs.h> 35#include <linux/string.h> 36#include <linux/kernel.h> 37#include <asm/dma.h> 38#include <asm/cacheflush.h> 39 40/* 41 * handle arithmetic relocations. 42 * See binutils/bfd/elf32-bfin.c for more details 43 */ 44#define RELOC_STACK_SIZE 100 45static uint32_t reloc_stack[RELOC_STACK_SIZE]; 46static unsigned int reloc_stack_tos; 47 48#define is_reloc_stack_empty() ((reloc_stack_tos > 0)?0:1) 49 50static void reloc_stack_push(uint32_t value) 51{ 52 reloc_stack[reloc_stack_tos++] = value; 53} 54 55static uint32_t reloc_stack_pop(void) 56{ 57 return reloc_stack[--reloc_stack_tos]; 58} 59 60static uint32_t reloc_stack_operate(unsigned int oper, struct module *mod) 61{ 62 uint32_t value; 63 64 switch (oper) { 65 case R_add: 66 value = reloc_stack[reloc_stack_tos - 2] + 67 reloc_stack[reloc_stack_tos - 1]; 68 reloc_stack_tos -= 2; 69 break; 70 case R_sub: 71 value = reloc_stack[reloc_stack_tos - 2] - 72 reloc_stack[reloc_stack_tos - 1]; 73 reloc_stack_tos -= 2; 74 break; 75 case R_mult: 76 value = reloc_stack[reloc_stack_tos - 2] * 77 reloc_stack[reloc_stack_tos - 1]; 78 reloc_stack_tos -= 2; 79 break; 80 case R_div: 81 value = reloc_stack[reloc_stack_tos - 2] / 82 reloc_stack[reloc_stack_tos - 1]; 83 reloc_stack_tos -= 2; 84 break; 85 case R_mod: 86 value = reloc_stack[reloc_stack_tos - 2] % 87 reloc_stack[reloc_stack_tos - 1]; 88 reloc_stack_tos -= 2; 89 break; 90 case R_lshift: 91 value = reloc_stack[reloc_stack_tos - 2] << 92 reloc_stack[reloc_stack_tos - 1]; 93 reloc_stack_tos -= 2; 94 break; 95 case R_rshift: 96 value = reloc_stack[reloc_stack_tos - 2] >> 97 reloc_stack[reloc_stack_tos - 1]; 98 reloc_stack_tos -= 2; 99 break; 100 case R_and: 101 value = reloc_stack[reloc_stack_tos - 2] & 102 reloc_stack[reloc_stack_tos - 1]; 103 reloc_stack_tos -= 2; 104 break; 105 case R_or: 106 value = reloc_stack[reloc_stack_tos - 2] | 107 reloc_stack[reloc_stack_tos - 1]; 108 reloc_stack_tos -= 2; 109 break; 110 case R_xor: 111 value = reloc_stack[reloc_stack_tos - 2] ^ 112 reloc_stack[reloc_stack_tos - 1]; 113 reloc_stack_tos -= 2; 114 break; 115 case R_land: 116 value = reloc_stack[reloc_stack_tos - 2] && 117 reloc_stack[reloc_stack_tos - 1]; 118 reloc_stack_tos -= 2; 119 break; 120 case R_lor: 121 value = reloc_stack[reloc_stack_tos - 2] || 122 reloc_stack[reloc_stack_tos - 1]; 123 reloc_stack_tos -= 2; 124 break; 125 case R_neg: 126 value = -reloc_stack[reloc_stack_tos - 1]; 127 reloc_stack_tos--; 128 break; 129 case R_comp: 130 value = ~reloc_stack[reloc_stack_tos - 1]; 131 reloc_stack_tos -= 1; 132 break; 133 default: 134 printk(KERN_WARNING "module %s: unhandled reloction\n", 135 mod->name); 136 return 0; 137 } 138 139 /* now push the new value back on stack */ 140 reloc_stack_push(value); 141 142 return value; 143} 144 145void *module_alloc(unsigned long size) 146{ 147 if (size == 0) 148 return NULL; 149 return vmalloc(size); 150} 151 152/* Free memory returned from module_alloc */ 153void module_free(struct module *mod, void *module_region) 154{ 155 vfree(module_region); 156} 157 158/* Transfer the section to the L1 memory */ 159int 160module_frob_arch_sections(Elf_Ehdr * hdr, Elf_Shdr * sechdrs, 161 char *secstrings, struct module *mod) 162{ 163 /* 164 * XXX: sechdrs are vmalloced in kernel/module.c 165 * and would be vfreed just after module is loaded, 166 * so we hack to keep the only information we needed 167 * in mod->arch to correctly free L1 I/D sram later. 168 * NOTE: this breaks the semantic of mod->arch structure. 169 */ 170 Elf_Shdr *s, *sechdrs_end = sechdrs + hdr->e_shnum; 171 void *dest = NULL; 172 173 for (s = sechdrs; s < sechdrs_end; ++s) { 174 if ((strcmp(".l1.text", secstrings + s->sh_name) == 0) || 175 ((strcmp(".text", secstrings + s->sh_name) == 0) && 176 (hdr->e_flags & FLG_CODE_IN_L1) && (s->sh_size > 0))) { 177 dest = l1_inst_sram_alloc(s->sh_size); 178 mod->arch.text_l1 = dest; 179 if (dest == NULL) { 180 printk(KERN_ERR 181 "module %s: L1 instruction memory allocation failed\n", 182 mod->name); 183 return -1; 184 } 185 dma_memcpy(dest, (void *)s->sh_addr, s->sh_size); 186 s->sh_flags &= ~SHF_ALLOC; 187 s->sh_addr = (unsigned long)dest; 188 } 189 if ((strcmp(".l1.data", secstrings + s->sh_name) == 0) || 190 ((strcmp(".data", secstrings + s->sh_name) == 0) && 191 (hdr->e_flags & FLG_DATA_IN_L1) && (s->sh_size > 0))) { 192 dest = l1_data_sram_alloc(s->sh_size); 193 mod->arch.data_a_l1 = dest; 194 if (dest == NULL) { 195 printk(KERN_ERR 196 "module %s: L1 data memory allocation failed\n", 197 mod->name); 198 return -1; 199 } 200 memcpy(dest, (void *)s->sh_addr, s->sh_size); 201 s->sh_flags &= ~SHF_ALLOC; 202 s->sh_addr = (unsigned long)dest; 203 } 204 if (strcmp(".l1.bss", secstrings + s->sh_name) == 0 || 205 ((strcmp(".bss", secstrings + s->sh_name) == 0) && 206 (hdr->e_flags & FLG_DATA_IN_L1) && (s->sh_size > 0))) { 207 dest = l1_data_sram_alloc(s->sh_size); 208 mod->arch.bss_a_l1 = dest; 209 if (dest == NULL) { 210 printk(KERN_ERR 211 "module %s: L1 data memory allocation failed\n", 212 mod->name); 213 return -1; 214 } 215 memset(dest, 0, s->sh_size); 216 s->sh_flags &= ~SHF_ALLOC; 217 s->sh_addr = (unsigned long)dest; 218 } 219 if (strcmp(".l1.data.B", secstrings + s->sh_name) == 0) { 220 dest = l1_data_B_sram_alloc(s->sh_size); 221 mod->arch.data_b_l1 = dest; 222 if (dest == NULL) { 223 printk(KERN_ERR 224 "module %s: L1 data memory allocation failed\n", 225 mod->name); 226 return -1; 227 } 228 memcpy(dest, (void *)s->sh_addr, s->sh_size); 229 s->sh_flags &= ~SHF_ALLOC; 230 s->sh_addr = (unsigned long)dest; 231 } 232 if (strcmp(".l1.bss.B", secstrings + s->sh_name) == 0) { 233 dest = l1_data_B_sram_alloc(s->sh_size); 234 mod->arch.bss_b_l1 = dest; 235 if (dest == NULL) { 236 printk(KERN_ERR 237 "module %s: L1 data memory allocation failed\n", 238 mod->name); 239 return -1; 240 } 241 memset(dest, 0, s->sh_size); 242 s->sh_flags &= ~SHF_ALLOC; 243 s->sh_addr = (unsigned long)dest; 244 } 245 } 246 return 0; 247} 248 249int 250apply_relocate(Elf_Shdr * sechdrs, const char *strtab, 251 unsigned int symindex, unsigned int relsec, struct module *me) 252{ 253 printk(KERN_ERR "module %s: .rel unsupported\n", me->name); 254 return -ENOEXEC; 255} 256 257/*************************************************************************/ 258/* FUNCTION : apply_relocate_add */ 259/* ABSTRACT : Blackfin specific relocation handling for the loadable */ 260/* modules. Modules are expected to be .o files. */ 261/* Arithmetic relocations are handled. */ 262/* We do not expect LSETUP to be split and hence is not */ 263/* handled. */ 264/* R_byte and R_byte2 are also not handled as the gas */ 265/* does not generate it. */ 266/*************************************************************************/ 267int 268apply_relocate_add(Elf_Shdr * sechdrs, const char *strtab, 269 unsigned int symindex, unsigned int relsec, 270 struct module *mod) 271{ 272 unsigned int i; 273 unsigned short tmp; 274 Elf32_Rela *rel = (void *)sechdrs[relsec].sh_addr; 275 Elf32_Sym *sym; 276 uint32_t *location32; 277 uint16_t *location16; 278 uint32_t value; 279 280 pr_debug("Applying relocate section %u to %u\n", relsec, 281 sechdrs[relsec].sh_info); 282 for (i = 0; i < sechdrs[relsec].sh_size / sizeof(*rel); i++) { 283 /* This is where to make the change */ 284 location16 = 285 (uint16_t *) (sechdrs[sechdrs[relsec].sh_info].sh_addr + 286 rel[i].r_offset); 287 location32 = (uint32_t *) location16; 288 /* This is the symbol it is referring to. Note that all 289 undefined symbols have been resolved. */ 290 sym = (Elf32_Sym *) sechdrs[symindex].sh_addr 291 + ELF32_R_SYM(rel[i].r_info); 292 if (is_reloc_stack_empty()) { 293 value = sym->st_value; 294 } else { 295 value = reloc_stack_pop(); 296 } 297 value += rel[i].r_addend; 298 pr_debug("location is %x, value is %x type is %d \n", 299 (unsigned int) location32, value, 300 ELF32_R_TYPE(rel[i].r_info)); 301 302 switch (ELF32_R_TYPE(rel[i].r_info)) { 303 304 case R_pcrel24: 305 case R_pcrel24_jump_l: 306 /* Add the value, subtract its postition */ 307 location16 = 308 (uint16_t *) (sechdrs[sechdrs[relsec].sh_info]. 309 sh_addr + rel[i].r_offset - 2); 310 location32 = (uint32_t *) location16; 311 value -= (uint32_t) location32; 312 value >>= 1; 313 pr_debug("value is %x, before %x-%x after %x-%x\n", value, 314 *location16, *(location16 + 1), 315 (*location16 & 0xff00) | (value >> 16 & 0x00ff), 316 value & 0xffff); 317 *location16 = 318 (*location16 & 0xff00) | (value >> 16 & 0x00ff); 319 *(location16 + 1) = value & 0xffff; 320 break; 321 case R_pcrel12_jump: 322 case R_pcrel12_jump_s: 323 value -= (uint32_t) location32; 324 value >>= 1; 325 *location16 = (value & 0xfff); 326 break; 327 case R_pcrel10: 328 value -= (uint32_t) location32; 329 value >>= 1; 330 *location16 = (value & 0x3ff); 331 break; 332 case R_luimm16: 333 pr_debug("before %x after %x\n", *location16, 334 (value & 0xffff)); 335 tmp = (value & 0xffff); 336 if ((unsigned long)location16 >= L1_CODE_START) { 337 dma_memcpy(location16, &tmp, 2); 338 } else 339 *location16 = tmp; 340 break; 341 case R_huimm16: 342 pr_debug("before %x after %x\n", *location16, 343 ((value >> 16) & 0xffff)); 344 tmp = ((value >> 16) & 0xffff); 345 if ((unsigned long)location16 >= L1_CODE_START) { 346 dma_memcpy(location16, &tmp, 2); 347 } else 348 *location16 = tmp; 349 break; 350 case R_rimm16: 351 *location16 = (value & 0xffff); 352 break; 353 case R_byte4_data: 354 pr_debug("before %x after %x\n", *location32, value); 355 *location32 = value; 356 break; 357 case R_push: 358 reloc_stack_push(value); 359 break; 360 case R_const: 361 reloc_stack_push(rel[i].r_addend); 362 break; 363 case R_add: 364 case R_sub: 365 case R_mult: 366 case R_div: 367 case R_mod: 368 case R_lshift: 369 case R_rshift: 370 case R_and: 371 case R_or: 372 case R_xor: 373 case R_land: 374 case R_lor: 375 case R_neg: 376 case R_comp: 377 reloc_stack_operate(ELF32_R_TYPE(rel[i].r_info), mod); 378 break; 379 default: 380 printk(KERN_ERR "module %s: Unknown relocation: %u\n", 381 mod->name, ELF32_R_TYPE(rel[i].r_info)); 382 return -ENOEXEC; 383 } 384 } 385 return 0; 386} 387 388int 389module_finalize(const Elf_Ehdr * hdr, 390 const Elf_Shdr * sechdrs, struct module *mod) 391{ 392 unsigned int i, strindex = 0, symindex = 0; 393 char *secstrings; 394 395 secstrings = (void *)hdr + sechdrs[hdr->e_shstrndx].sh_offset; 396 397 for (i = 1; i < hdr->e_shnum; i++) { 398 /* Internal symbols and strings. */ 399 if (sechdrs[i].sh_type == SHT_SYMTAB) { 400 symindex = i; 401 strindex = sechdrs[i].sh_link; 402 } 403 } 404 405 for (i = 1; i < hdr->e_shnum; i++) { 406 const char *strtab = (char *)sechdrs[strindex].sh_addr; 407 unsigned int info = sechdrs[i].sh_info; 408 409 /* Not a valid relocation section? */ 410 if (info >= hdr->e_shnum) 411 continue; 412 413 if ((sechdrs[i].sh_type == SHT_RELA) && 414 ((strcmp(".rela.l1.text", secstrings + sechdrs[i].sh_name) == 0) || 415 ((strcmp(".rela.text", secstrings + sechdrs[i].sh_name) == 0) && 416 (hdr->e_flags & FLG_CODE_IN_L1)))) { 417 apply_relocate_add((Elf_Shdr *) sechdrs, strtab, 418 symindex, i, mod); 419 } 420 } 421 return 0; 422} 423 424void module_arch_cleanup(struct module *mod) 425{ 426 if (mod->arch.text_l1) 427 l1_inst_sram_free((void *)mod->arch.text_l1); 428 if (mod->arch.data_a_l1) 429 l1_data_sram_free((void *)mod->arch.data_a_l1); 430 if (mod->arch.bss_a_l1) 431 l1_data_sram_free((void *)mod->arch.bss_a_l1); 432 if (mod->arch.data_b_l1) 433 l1_data_B_sram_free((void *)mod->arch.data_b_l1); 434 if (mod->arch.bss_b_l1) 435 l1_data_B_sram_free((void *)mod->arch.bss_b_l1); 436}