1 // Copyright (c) 2006, Google Inc.
2 // All rights reserved.
3 //
4 // Redistribution and use in source and binary forms, with or without
5 // modification, are permitted provided that the following conditions are
6 // met:
7 //
8 // * Redistributions of source code must retain the above copyright
9 // notice, this list of conditions and the following disclaimer.
10 // * Redistributions in binary form must reproduce the above
11 // copyright notice, this list of conditions and the following disclaimer
12 // in the documentation and/or other materials provided with the
13 // distribution.
14 // * Neither the name of Google Inc. nor the names of its
15 // contributors may be used to endorse or promote products derived from
16 // this software without specific prior written permission.
17 //
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 //
30 // file_id.cc: Return a unique identifier for a file
31 //
32 // See file_id.h for documentation
33 //
34
35 #include "common/linux/file_id.h"
36
37 #include <arpa/inet.h>
38 #include <assert.h>
39 #include <string.h>
40
41 #include <algorithm>
42 #include <string>
43
44 #include "common/linux/elf_gnu_compat.h"
45 #include "common/linux/elfutils.h"
46 #include "common/linux/linux_libc_support.h"
47 #include "common/linux/memory_mapped_file.h"
48 #include "third_party/lss/linux_syscall_support.h"
49
50 using std::string;
51
52 namespace google_breakpad {
53
54 // Used in a few places for backwards-compatibility.
55 const size_t kMDGUIDSize = sizeof(MDGUID);
56
FileID(const char * path)57 FileID::FileID(const char* path) : path_(path) {}
58
59 // ELF note name and desc are 32-bits word padded.
60 #define NOTE_PADDING(a) ((a + 3) & ~3)
61
62 // These functions are also used inside the crashed process, so be safe
63 // and use the syscall/libc wrappers instead of direct syscalls or libc.
64
65 template<typename ElfClass>
ElfClassBuildIDNoteIdentifier(const void * section,size_t length,wasteful_vector<uint8_t> & identifier)66 static bool ElfClassBuildIDNoteIdentifier(const void *section, size_t length,
67 wasteful_vector<uint8_t>& identifier) {
68 typedef typename ElfClass::Nhdr Nhdr;
69
70 const void* section_end = reinterpret_cast<const char*>(section) + length;
71 const Nhdr* note_header = reinterpret_cast<const Nhdr*>(section);
72 while (reinterpret_cast<const void *>(note_header) < section_end) {
73 if (note_header->n_type == NT_GNU_BUILD_ID)
74 break;
75 note_header = reinterpret_cast<const Nhdr*>(
76 reinterpret_cast<const char*>(note_header) + sizeof(Nhdr) +
77 NOTE_PADDING(note_header->n_namesz) +
78 NOTE_PADDING(note_header->n_descsz));
79 }
80 if (reinterpret_cast<const void *>(note_header) >= section_end ||
81 note_header->n_descsz == 0) {
82 return false;
83 }
84
85 const uint8_t* build_id = reinterpret_cast<const uint8_t*>(note_header) +
86 sizeof(Nhdr) + NOTE_PADDING(note_header->n_namesz);
87 identifier.insert(identifier.end(),
88 build_id,
89 build_id + note_header->n_descsz);
90
91 return true;
92 }
93
94 // Attempt to locate a .note.gnu.build-id section in an ELF binary
95 // and copy it into |identifier|.
FindElfBuildIDNote(const void * elf_mapped_base,wasteful_vector<uint8_t> & identifier)96 static bool FindElfBuildIDNote(const void* elf_mapped_base,
97 wasteful_vector<uint8_t>& identifier) {
98 void* note_section;
99 size_t note_size;
100 int elfclass;
101 if ((!FindElfSegment(elf_mapped_base, PT_NOTE,
102 (const void**)¬e_section, ¬e_size, &elfclass) ||
103 note_size == 0) &&
104 (!FindElfSection(elf_mapped_base, ".note.gnu.build-id", SHT_NOTE,
105 (const void**)¬e_section, ¬e_size, &elfclass) ||
106 note_size == 0)) {
107 return false;
108 }
109
110 if (elfclass == ELFCLASS32) {
111 return ElfClassBuildIDNoteIdentifier<ElfClass32>(note_section, note_size,
112 identifier);
113 } else if (elfclass == ELFCLASS64) {
114 return ElfClassBuildIDNoteIdentifier<ElfClass64>(note_section, note_size,
115 identifier);
116 }
117
118 return false;
119 }
120
121 // Attempt to locate the .text section of an ELF binary and generate
122 // a simple hash by XORing the first page worth of bytes into |identifier|.
HashElfTextSection(const void * elf_mapped_base,wasteful_vector<uint8_t> & identifier)123 static bool HashElfTextSection(const void* elf_mapped_base,
124 wasteful_vector<uint8_t>& identifier) {
125 identifier.resize(kMDGUIDSize);
126
127 void* text_section;
128 size_t text_size;
129 if (!FindElfSection(elf_mapped_base, ".text", SHT_PROGBITS,
130 (const void**)&text_section, &text_size, NULL) ||
131 text_size == 0) {
132 return false;
133 }
134
135 // Only provide |kMDGUIDSize| bytes to keep identifiers produced by this
136 // function backwards-compatible.
137 my_memset(&identifier[0], 0, kMDGUIDSize);
138 const uint8_t* ptr = reinterpret_cast<const uint8_t*>(text_section);
139 const uint8_t* ptr_end = ptr + std::min(text_size, static_cast<size_t>(4096));
140 while (ptr < ptr_end) {
141 for (unsigned i = 0; i < kMDGUIDSize; i++)
142 identifier[i] ^= ptr[i];
143 ptr += kMDGUIDSize;
144 }
145 return true;
146 }
147
148 // static
ElfFileIdentifierFromMappedFile(const void * base,wasteful_vector<uint8_t> & identifier)149 bool FileID::ElfFileIdentifierFromMappedFile(const void* base,
150 wasteful_vector<uint8_t>& identifier) {
151 // Look for a build id note first.
152 if (FindElfBuildIDNote(base, identifier))
153 return true;
154
155 // Fall back on hashing the first page of the text section.
156 return HashElfTextSection(base, identifier);
157 }
158
ElfFileIdentifier(wasteful_vector<uint8_t> & identifier)159 bool FileID::ElfFileIdentifier(wasteful_vector<uint8_t>& identifier) {
160 MemoryMappedFile mapped_file(path_.c_str(), 0);
161 if (!mapped_file.data()) // Should probably check if size >= ElfW(Ehdr)?
162 return false;
163
164 return ElfFileIdentifierFromMappedFile(mapped_file.data(), identifier);
165 }
166
167 // This function is not ever called in an unsafe context, so it's OK
168 // to allocate memory and use libc.
169 // static
ConvertIdentifierToUUIDString(const wasteful_vector<uint8_t> & identifier)170 string FileID::ConvertIdentifierToUUIDString(
171 const wasteful_vector<uint8_t>& identifier) {
172 uint8_t identifier_swapped[kMDGUIDSize] = { 0 };
173
174 // Endian-ness swap to match dump processor expectation.
175 memcpy(identifier_swapped, &identifier[0],
176 std::min(kMDGUIDSize, identifier.size()));
177 uint32_t* data1 = reinterpret_cast<uint32_t*>(identifier_swapped);
178 *data1 = htonl(*data1);
179 uint16_t* data2 = reinterpret_cast<uint16_t*>(identifier_swapped + 4);
180 *data2 = htons(*data2);
181 uint16_t* data3 = reinterpret_cast<uint16_t*>(identifier_swapped + 6);
182 *data3 = htons(*data3);
183
184 string result;
185 for (unsigned int idx = 0; idx < kMDGUIDSize; ++idx) {
186 char buf[3];
187 snprintf(buf, sizeof(buf), "%02X", identifier_swapped[idx]);
188 result.append(buf);
189 }
190 return result;
191 }
192
193 } // namespace google_breakpad
194