/src/elfutils/libelf/elf32_xlatetom.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Convert from file to memory representation. |
2 | | Copyright (C) 1998, 1999, 2000, 2002, 2012, 2015 Red Hat, Inc. |
3 | | This file is part of elfutils. |
4 | | Written by Ulrich Drepper <drepper@redhat.com>, 1998. |
5 | | |
6 | | This file is free software; you can redistribute it and/or modify |
7 | | it under the terms of either |
8 | | |
9 | | * the GNU Lesser General Public License as published by the Free |
10 | | Software Foundation; either version 3 of the License, or (at |
11 | | your option) any later version |
12 | | |
13 | | or |
14 | | |
15 | | * the GNU General Public License as published by the Free |
16 | | Software Foundation; either version 2 of the License, or (at |
17 | | your option) any later version |
18 | | |
19 | | or both in parallel, as here. |
20 | | |
21 | | elfutils is distributed in the hope that it will be useful, but |
22 | | WITHOUT ANY WARRANTY; without even the implied warranty of |
23 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
24 | | General Public License for more details. |
25 | | |
26 | | You should have received copies of the GNU General Public License and |
27 | | the GNU Lesser General Public License along with this program. If |
28 | | not, see <http://www.gnu.org/licenses/>. */ |
29 | | |
30 | | #ifdef HAVE_CONFIG_H |
31 | | # include <config.h> |
32 | | #endif |
33 | | |
34 | | #include <assert.h> |
35 | | #include <string.h> |
36 | | |
37 | | #include "libelfP.h" |
38 | | |
39 | | #ifndef LIBELFBITS |
40 | | # define LIBELFBITS 32 |
41 | | #endif |
42 | | |
43 | | |
44 | | Elf_Data * |
45 | | elfw2(LIBELFBITS, xlatetom) (Elf_Data *dest, const Elf_Data *src, |
46 | | unsigned int encode) |
47 | 298k | { |
48 | 298k | if (src == NULL || dest == NULL) |
49 | 0 | return NULL; |
50 | | |
51 | 298k | if (src->d_type >= ELF_T_NUM) |
52 | 0 | { |
53 | 0 | __libelf_seterrno (ELF_E_UNKNOWN_TYPE); |
54 | 0 | return NULL; |
55 | 0 | } |
56 | | |
57 | | /* First test whether the input data is really suitable for this |
58 | | type. This means, whether there is an integer number of records. |
59 | | Note that for this implementation the memory and file size of the |
60 | | data types are identical. */ |
61 | 298k | size_t recsize = __libelf_type_sizes[ELFW(ELFCLASS,LIBELFBITS) - 1][src->d_type]; |
62 | | |
63 | | |
64 | | /* We shouldn't require integer number of records when processing |
65 | | notes. Payload bytes follow the header immediately, it's not an |
66 | | array of records as is the case otherwise. */ |
67 | 298k | if (src->d_type != ELF_T_NHDR && src->d_type != ELF_T_NHDR8 |
68 | 298k | && src->d_size % recsize != 0) |
69 | 31 | { |
70 | 31 | __libelf_seterrno (ELF_E_INVALID_DATA); |
71 | 31 | return NULL; |
72 | 31 | } |
73 | | |
74 | | /* Next see whether the converted data fits in the output buffer. */ |
75 | 298k | if (src->d_size > dest->d_size) |
76 | 0 | { |
77 | 0 | __libelf_seterrno (ELF_E_DEST_SIZE); |
78 | 0 | return NULL; |
79 | 0 | } |
80 | | |
81 | | /* Test the encode parameter. */ |
82 | 298k | if (encode != ELFDATA2LSB && encode != ELFDATA2MSB) |
83 | 413 | { |
84 | 413 | __libelf_seterrno (ELF_E_INVALID_ENCODING); |
85 | 413 | return NULL; |
86 | 413 | } |
87 | | |
88 | | /* Determine the translation function to use. |
89 | | |
90 | | At this point we make an assumption which is valid for all |
91 | | existing implementations so far: the memory and file sizes are |
92 | | the same. This has very important consequences: |
93 | | a) The requirement that the source and destination buffer can |
94 | | overlap can easily be fulfilled. |
95 | | b) We need only one function to convert from and memory to file |
96 | | and vice versa since the function only has to copy and/or |
97 | | change the byte order. |
98 | | */ |
99 | 297k | if ((BYTE_ORDER == LITTLE_ENDIAN && encode == ELFDATA2LSB) |
100 | 297k | || (BYTE_ORDER == BIG_ENDIAN && encode == ELFDATA2MSB)) |
101 | 70.3k | { |
102 | | /* We simply have to copy since the byte order is the same. */ |
103 | 70.3k | if (src->d_buf != dest->d_buf) |
104 | 37.1k | memmove (dest->d_buf, src->d_buf, src->d_size); |
105 | 70.3k | } |
106 | 227k | else |
107 | 227k | { |
108 | 227k | xfct_t fctp; |
109 | 227k | fctp = __elf_xfctstom[ELFW(ELFCLASS, LIBELFBITS) - 1][src->d_type]; |
110 | | |
111 | | /* Do the real work. */ |
112 | 227k | (*fctp) (dest->d_buf, src->d_buf, src->d_size, 0); |
113 | 227k | } |
114 | | |
115 | | /* Now set the real destination type and length since the operation was |
116 | | successful. */ |
117 | 297k | dest->d_type = src->d_type; |
118 | 297k | dest->d_size = src->d_size; |
119 | | |
120 | 297k | return dest; |
121 | 298k | } Line | Count | Source | 47 | 276k | { | 48 | 276k | if (src == NULL || dest == NULL) | 49 | 0 | return NULL; | 50 | | | 51 | 276k | if (src->d_type >= ELF_T_NUM) | 52 | 0 | { | 53 | 0 | __libelf_seterrno (ELF_E_UNKNOWN_TYPE); | 54 | 0 | return NULL; | 55 | 0 | } | 56 | | | 57 | | /* First test whether the input data is really suitable for this | 58 | | type. This means, whether there is an integer number of records. | 59 | | Note that for this implementation the memory and file size of the | 60 | | data types are identical. */ | 61 | 276k | size_t recsize = __libelf_type_sizes[ELFW(ELFCLASS,LIBELFBITS) - 1][src->d_type]; | 62 | | | 63 | | | 64 | | /* We shouldn't require integer number of records when processing | 65 | | notes. Payload bytes follow the header immediately, it's not an | 66 | | array of records as is the case otherwise. */ | 67 | 276k | if (src->d_type != ELF_T_NHDR && src->d_type != ELF_T_NHDR8 | 68 | 276k | && src->d_size % recsize != 0) | 69 | 14 | { | 70 | 14 | __libelf_seterrno (ELF_E_INVALID_DATA); | 71 | 14 | return NULL; | 72 | 14 | } | 73 | | | 74 | | /* Next see whether the converted data fits in the output buffer. */ | 75 | 276k | if (src->d_size > dest->d_size) | 76 | 0 | { | 77 | 0 | __libelf_seterrno (ELF_E_DEST_SIZE); | 78 | 0 | return NULL; | 79 | 0 | } | 80 | | | 81 | | /* Test the encode parameter. */ | 82 | 276k | if (encode != ELFDATA2LSB && encode != ELFDATA2MSB) | 83 | 205 | { | 84 | 205 | __libelf_seterrno (ELF_E_INVALID_ENCODING); | 85 | 205 | return NULL; | 86 | 205 | } | 87 | | | 88 | | /* Determine the translation function to use. | 89 | | | 90 | | At this point we make an assumption which is valid for all | 91 | | existing implementations so far: the memory and file sizes are | 92 | | the same. This has very important consequences: | 93 | | a) The requirement that the source and destination buffer can | 94 | | overlap can easily be fulfilled. | 95 | | b) We need only one function to convert from and memory to file | 96 | | and vice versa since the function only has to copy and/or | 97 | | change the byte order. | 98 | | */ | 99 | 276k | if ((BYTE_ORDER == LITTLE_ENDIAN && encode == ELFDATA2LSB) | 100 | 276k | || (BYTE_ORDER == BIG_ENDIAN && encode == ELFDATA2MSB)) | 101 | 51.9k | { | 102 | | /* We simply have to copy since the byte order is the same. */ | 103 | 51.9k | if (src->d_buf != dest->d_buf) | 104 | 25.8k | memmove (dest->d_buf, src->d_buf, src->d_size); | 105 | 51.9k | } | 106 | 224k | else | 107 | 224k | { | 108 | 224k | xfct_t fctp; | 109 | 224k | fctp = __elf_xfctstom[ELFW(ELFCLASS, LIBELFBITS) - 1][src->d_type]; | 110 | | | 111 | | /* Do the real work. */ | 112 | 224k | (*fctp) (dest->d_buf, src->d_buf, src->d_size, 0); | 113 | 224k | } | 114 | | | 115 | | /* Now set the real destination type and length since the operation was | 116 | | successful. */ | 117 | 276k | dest->d_type = src->d_type; | 118 | 276k | dest->d_size = src->d_size; | 119 | | | 120 | 276k | return dest; | 121 | 276k | } |
Line | Count | Source | 47 | 21.8k | { | 48 | 21.8k | if (src == NULL || dest == NULL) | 49 | 0 | return NULL; | 50 | | | 51 | 21.8k | if (src->d_type >= ELF_T_NUM) | 52 | 0 | { | 53 | 0 | __libelf_seterrno (ELF_E_UNKNOWN_TYPE); | 54 | 0 | return NULL; | 55 | 0 | } | 56 | | | 57 | | /* First test whether the input data is really suitable for this | 58 | | type. This means, whether there is an integer number of records. | 59 | | Note that for this implementation the memory and file size of the | 60 | | data types are identical. */ | 61 | 21.8k | size_t recsize = __libelf_type_sizes[ELFW(ELFCLASS,LIBELFBITS) - 1][src->d_type]; | 62 | | | 63 | | | 64 | | /* We shouldn't require integer number of records when processing | 65 | | notes. Payload bytes follow the header immediately, it's not an | 66 | | array of records as is the case otherwise. */ | 67 | 21.8k | if (src->d_type != ELF_T_NHDR && src->d_type != ELF_T_NHDR8 | 68 | 21.8k | && src->d_size % recsize != 0) | 69 | 17 | { | 70 | 17 | __libelf_seterrno (ELF_E_INVALID_DATA); | 71 | 17 | return NULL; | 72 | 17 | } | 73 | | | 74 | | /* Next see whether the converted data fits in the output buffer. */ | 75 | 21.8k | if (src->d_size > dest->d_size) | 76 | 0 | { | 77 | 0 | __libelf_seterrno (ELF_E_DEST_SIZE); | 78 | 0 | return NULL; | 79 | 0 | } | 80 | | | 81 | | /* Test the encode parameter. */ | 82 | 21.8k | if (encode != ELFDATA2LSB && encode != ELFDATA2MSB) | 83 | 208 | { | 84 | 208 | __libelf_seterrno (ELF_E_INVALID_ENCODING); | 85 | 208 | return NULL; | 86 | 208 | } | 87 | | | 88 | | /* Determine the translation function to use. | 89 | | | 90 | | At this point we make an assumption which is valid for all | 91 | | existing implementations so far: the memory and file sizes are | 92 | | the same. This has very important consequences: | 93 | | a) The requirement that the source and destination buffer can | 94 | | overlap can easily be fulfilled. | 95 | | b) We need only one function to convert from and memory to file | 96 | | and vice versa since the function only has to copy and/or | 97 | | change the byte order. | 98 | | */ | 99 | 21.6k | if ((BYTE_ORDER == LITTLE_ENDIAN && encode == ELFDATA2LSB) | 100 | 21.6k | || (BYTE_ORDER == BIG_ENDIAN && encode == ELFDATA2MSB)) | 101 | 18.4k | { | 102 | | /* We simply have to copy since the byte order is the same. */ | 103 | 18.4k | if (src->d_buf != dest->d_buf) | 104 | 11.3k | memmove (dest->d_buf, src->d_buf, src->d_size); | 105 | 18.4k | } | 106 | 3.20k | else | 107 | 3.20k | { | 108 | 3.20k | xfct_t fctp; | 109 | 3.20k | fctp = __elf_xfctstom[ELFW(ELFCLASS, LIBELFBITS) - 1][src->d_type]; | 110 | | | 111 | | /* Do the real work. */ | 112 | 3.20k | (*fctp) (dest->d_buf, src->d_buf, src->d_size, 0); | 113 | 3.20k | } | 114 | | | 115 | | /* Now set the real destination type and length since the operation was | 116 | | successful. */ | 117 | 21.6k | dest->d_type = src->d_type; | 118 | 21.6k | dest->d_size = src->d_size; | 119 | | | 120 | 21.6k | return dest; | 121 | 21.8k | } |
|
122 | | INTDEF(elfw2(LIBELFBITS, xlatetom)) |