Contiki 2.5
cle_avr.c
1 /*
2  * Copyright (c) 2007, Swedish Institute of Computer Science
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  * notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  * notice, this list of conditions and the following disclaimer in the
12  * documentation and/or other materials provided with the distribution.
13  * 3. Neither the name of the Institute nor the names of its contributors
14  * may be used to endorse or promote products derived from this software
15  * without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * @(#)$Id: cle_avr.c,v 1.3 2007/06/04 17:50:25 bg- Exp $
30  */
31 
32 /*
33  * The Contiki dynamic Link Editor (CLE), ELF version.
34  */
35 
36 #include <stdio.h>
37 
38 #include "contiki.h"
39 
40 #include "loader/elf32.h"
41 #include "loader/cle.h"
42 
43 #define NDEBUG
44 #include "lib/assert.h"
45 
46 #ifdef NDEBUG
47 #define PRINTF(...) do {} while (0)
48 #else
49 #define PRINTF(...) printf(__VA_ARGS__)
50 #endif
51 
52 #define R_AVR_NONE 0
53 #define R_AVR_32 1
54 #define R_AVR_7_PCREL 2
55 #define R_AVR_13_PCREL 3
56 #define R_AVR_16 4
57 #define R_AVR_16_PM 5
58 #define R_AVR_LO8_LDI 6
59 #define R_AVR_HI8_LDI 7
60 #define R_AVR_HH8_LDI 8
61 #define R_AVR_LO8_LDI_NEG 9
62 #define R_AVR_HI8_LDI_NEG 10
63 #define R_AVR_HH8_LDI_NEG 11
64 #define R_AVR_LO8_LDI_PM 12
65 #define R_AVR_HI8_LDI_PM 13
66 #define R_AVR_HH8_LDI_PM 14
67 #define R_AVR_LO8_LDI_PM_NEG 15
68 #define R_AVR_HI8_LDI_PM_NEG 16
69 #define R_AVR_HH8_LDI_PM_NEG 17
70 #define R_AVR_CALL 18
71 
72 /*
73  * Writing relocs is machine dependent and this function is AVR
74  * specific!
75  */
76 int
77 cle_write_reloc(void *pos_,
78  const struct elf32_rela *rela,
79  cle_addr addr,
80  const struct cle_info *info)
81 {
82  unsigned char *pos = pos_;
83  unsigned char byte;
84 
85  switch(ELF32_R_TYPE(rela->r_info)) {
86  default:
87  PRINTF("cle_upd_reloc: unsupported relocation type: %d\n",
88  ELF32_R_TYPE(rela->r_info));
89  return CLE_UNKNOWN_RELOC;
90 
91  case R_AVR_7_PCREL: /* 2 */
92  /* Reloc in bits 0x03f8 (0000 00kk kkkk k000). */
93  byte = addr - (/* text */ + rela->r_offset + 2);
94  byte = byte >> 1;
95  pos[0] = (pos[0] & 0x07) | (byte << 3); /* 0xf8 */
96  pos[1] = (pos[1] & 0xfc) | (byte >> 5); /* 0x03 */
97  return CLE_OK;
98 
99  case R_AVR_13_PCREL: /* 3 */
100  /* Reloc in bits 0x0fff (0000 kkkk kkkk kkkk). */
101  addr = addr - (info->text + rela->r_offset + 2);
102  addr = addr >> 1;
103  pos[0] = addr;
104  pos[1] = (pos[1] & 0xf0) | ((addr >> 8) & 0x0f);
105  return CLE_OK;
106 
107  case R_AVR_CALL: /* 18 */
108  addr = addr >> 1;
109  pos[2] = addr;
110  pos[3] = addr >> 8;
111  return CLE_OK;
112 
113  case R_AVR_16: /* 4 */
114  pos[0] = addr;
115  pos[1] = addr >> 8;
116  return CLE_OK;
117 
118  case R_AVR_16_PM: /* 5 */
119  addr = addr >> 1;
120  pos[0] = addr;
121  pos[1] = addr >> 8;
122  return CLE_OK;
123 
124  /*
125  * Remaining relocs all have immediate value in bits 0x0f0f.
126  */
127  case R_AVR_LO8_LDI: /* 6 */
128  byte = addr;
129  break;
130 
131  case R_AVR_HI8_LDI: /* 7 */
132  byte = addr >> 8;
133  break;
134 
135  case R_AVR_HH8_LDI: /* 8 */
136  byte = addr >> 16;
137  break;
138 
139  case R_AVR_LO8_LDI_NEG: /* 9 */
140  byte = (-addr);
141  break;
142 
143  case R_AVR_HI8_LDI_NEG: /* 10 */
144  byte = (-addr) >> 8;
145  break;
146 
147  case R_AVR_HH8_LDI_NEG: /* 11 */
148  byte = (-addr) >> 16;
149  break;
150 
151  case R_AVR_LO8_LDI_PM: /* 12 */
152  byte = addr >> 1;
153  break;
154 
155  case R_AVR_HI8_LDI_PM: /* 13 */
156  byte = addr >> 9;
157  break;
158 
159  case R_AVR_HH8_LDI_PM: /* 14 */
160  byte = addr >> 17;
161  break;
162 
163  case R_AVR_LO8_LDI_PM_NEG: /* 15 */
164  byte = (-addr) >> 1;
165  break;
166 
167  case R_AVR_HI8_LDI_PM_NEG: /* 16 */
168  byte = (-addr) >> 9;
169  break;
170 
171  case R_AVR_HH8_LDI_PM_NEG: /* 17 */
172  byte = (-addr) >> 17;
173  break;
174  }
175  /* Relocation in bits 0x0f0f (0000 kkkk 0000 kkkk). */
176  pos[0] = (pos[0] & 0xf0) | (byte & 0x0f);
177  pos[1] = (pos[1] & 0xf0) | (byte >> 4);
178 
179  return CLE_OK;
180 }