blob: af479c8d194d34e5210f37003d782a70b9c000ff [file] [log] [blame]
nealsidb0baafc2009-08-17 23:12:53 +00001// Copyright (c) 2009, 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// This code deals with the mechanics of getting information about a crashed
31// process. Since this code may run in a compromised address space, the same
32// rules apply as detailed at the top of minidump_writer.h: no libc calls and
33// use the alternative allocator.
34
35#include "client/linux/minidump_writer/linux_dumper.h"
36
37#include <assert.h>
38#include <limits.h>
39#include <stddef.h>
40#include <stdlib.h>
41#include <stdio.h>
42#include <string.h>
43
44#include <unistd.h>
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +000045#include <elf.h>
nealsidb0baafc2009-08-17 23:12:53 +000046#include <errno.h>
47#include <fcntl.h>
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +000048#include <link.h>
nealsidb0baafc2009-08-17 23:12:53 +000049
50#include <sys/types.h>
51#include <sys/ptrace.h>
52#include <sys/wait.h>
53
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +000054#include <algorithm>
55
nealsidb0baafc2009-08-17 23:12:53 +000056#include "client/linux/minidump_writer/directory_reader.h"
57#include "client/linux/minidump_writer/line_reader.h"
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +000058#include "common/linux/file_id.h"
nealsidb0baafc2009-08-17 23:12:53 +000059#include "common/linux/linux_libc_support.h"
60#include "common/linux/linux_syscall_support.h"
61
nealsid6bc523c2010-05-10 20:35:54 +000062static const char kMappedFileUnsafePrefix[] = "/dev/";
63
nealsidb0baafc2009-08-17 23:12:53 +000064// Suspend a thread by attaching to it.
65static bool SuspendThread(pid_t pid) {
66 // This may fail if the thread has just died or debugged.
67 errno = 0;
68 if (sys_ptrace(PTRACE_ATTACH, pid, NULL, NULL) != 0 &&
69 errno != 0) {
70 return false;
71 }
72 while (sys_waitpid(pid, NULL, __WALL) < 0) {
73 if (errno != EINTR) {
74 sys_ptrace(PTRACE_DETACH, pid, NULL, NULL);
75 return false;
76 }
77 }
thestig@chromium.orgf5c8f6f2010-08-14 01:41:39 +000078#if defined(__i386) || defined(__x86_64)
79 // On x86, the stack pointer is NULL or -1, when executing trusted code in
80 // the seccomp sandbox. Not only does this cause difficulties down the line
81 // when trying to dump the thread's stack, it also results in the minidumps
82 // containing information about the trusted threads. This information is
83 // generally completely meaningless and just pollutes the minidumps.
84 // We thus test the stack pointer and exclude any threads that are part of
85 // the seccomp sandbox's trusted code.
86 user_regs_struct regs;
87 if (sys_ptrace(PTRACE_GETREGS, pid, NULL, &regs) == -1 ||
88#if defined(__i386)
89 !regs.esp
90#elif defined(__x86_64)
91 !regs.rsp
92#endif
93 ) {
94 sys_ptrace(PTRACE_DETACH, pid, NULL, NULL);
95 return false;
96 }
97#endif
nealsidb0baafc2009-08-17 23:12:53 +000098 return true;
99}
100
101// Resume a thread by detaching from it.
102static bool ResumeThread(pid_t pid) {
103 return sys_ptrace(PTRACE_DETACH, pid, NULL, NULL) >= 0;
104}
105
nealsid6bc523c2010-05-10 20:35:54 +0000106inline static bool IsMappedFileOpenUnsafe(
107 const google_breakpad::MappingInfo* mapping) {
108 // It is unsafe to attempt to open a mapped file that lives under /dev,
109 // because the semantics of the open may be driver-specific so we'd risk
110 // hanging the crash dumper. And a file in /dev/ almost certainly has no
111 // ELF file identifier anyways.
112 return my_strncmp(mapping->name,
113 kMappedFileUnsafePrefix,
114 sizeof(kMappedFileUnsafePrefix) - 1) == 0;
115}
116
nealsidb0baafc2009-08-17 23:12:53 +0000117namespace google_breakpad {
118
119LinuxDumper::LinuxDumper(int pid)
120 : pid_(pid),
nealsidde545c02010-03-02 00:39:48 +0000121 threads_suspended_(false),
nealsidb0baafc2009-08-17 23:12:53 +0000122 threads_(&allocator_, 8),
123 mappings_(&allocator_) {
124}
125
126bool LinuxDumper::Init() {
127 return EnumerateThreads(&threads_) &&
128 EnumerateMappings(&mappings_);
129}
130
131bool LinuxDumper::ThreadsSuspend() {
nealsidde545c02010-03-02 00:39:48 +0000132 if (threads_suspended_)
nealsidb0baafc2009-08-17 23:12:53 +0000133 return true;
thestig@chromium.orgf5c8f6f2010-08-14 01:41:39 +0000134 for (size_t i = 0; i < threads_.size(); ++i) {
135 if (!SuspendThread(threads_[i])) {
136 // If the thread either disappeared before we could attach to it, or if
137 // it was part of the seccomp sandbox's trusted code, it is OK to
138 // silently drop it from the minidump.
139 memmove(&threads_[i], &threads_[i+1],
140 (threads_.size() - i - 1) * sizeof(threads_[i]));
141 threads_.resize(threads_.size() - 1);
142 --i;
143 }
144 }
nealsidde545c02010-03-02 00:39:48 +0000145 threads_suspended_ = true;
thestig@chromium.orgf5c8f6f2010-08-14 01:41:39 +0000146 return threads_.size() > 0;
nealsidb0baafc2009-08-17 23:12:53 +0000147}
148
149bool LinuxDumper::ThreadsResume() {
nealsidde545c02010-03-02 00:39:48 +0000150 if (!threads_suspended_)
nealsidb0baafc2009-08-17 23:12:53 +0000151 return false;
152 bool good = true;
153 for (size_t i = 0; i < threads_.size(); ++i)
154 good &= ResumeThread(threads_[i]);
nealsidde545c02010-03-02 00:39:48 +0000155 threads_suspended_ = false;
nealsidb0baafc2009-08-17 23:12:53 +0000156 return good;
157}
158
159void
160LinuxDumper::BuildProcPath(char* path, pid_t pid, const char* node) const {
161 assert(path);
162 if (!path) {
163 return;
164 }
165
166 path[0] = '\0';
167
168 const unsigned pid_len = my_int_len(pid);
169
170 assert(node);
171 if (!node) {
172 return;
173 }
174
175 size_t node_len = my_strlen(node);
176 assert(node_len < NAME_MAX);
177 if (node_len >= NAME_MAX) {
178 return;
179 }
180
181 assert(node_len > 0);
182 if (node_len == 0) {
183 return;
184 }
185
186 assert(pid > 0);
187 if (pid <= 0) {
188 return;
189 }
190
191 const size_t total_length = 6 + pid_len + 1 + node_len;
192
193 assert(total_length < NAME_MAX);
194 if (total_length >= NAME_MAX) {
195 return;
196 }
197
198 memcpy(path, "/proc/", 6);
199 my_itos(path + 6, pid, pid_len);
200 memcpy(path + 6 + pid_len, "/", 1);
201 memcpy(path + 6 + pid_len + 1, node, node_len);
202 memcpy(path + total_length, "\0", 1);
203}
204
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +0000205bool
206LinuxDumper::ElfFileIdentifierForMapping(unsigned int mapping_id,
207 uint8_t identifier[sizeof(MDGUID)])
208{
209 assert(mapping_id < mappings_.size());
nealsid6bc523c2010-05-10 20:35:54 +0000210 my_memset(identifier, 0, sizeof(MDGUID));
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +0000211 const MappingInfo* mapping = mappings_[mapping_id];
nealsid6bc523c2010-05-10 20:35:54 +0000212 if (IsMappedFileOpenUnsafe(mapping)) {
213 return false;
214 }
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +0000215 int fd = sys_open(mapping->name, O_RDONLY, 0);
216 if (fd < 0)
217 return false;
218 struct kernel_stat st;
219 if (sys_fstat(fd, &st) != 0) {
220 sys_close(fd);
221 return false;
222 }
ted.mielczarek9f211b42009-12-23 20:44:32 +0000223#if defined(__x86_64)
224#define sys_mmap2 sys_mmap
225#endif
ted.mielczarek0a5fc5d2009-12-23 17:09:27 +0000226 void* base = sys_mmap2(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
227 sys_close(fd);
228 if (base == MAP_FAILED)
229 return false;
230
231 bool success = FileID::ElfFileIdentifierFromMappedFile(base, identifier);
232 sys_munmap(base, st.st_size);
233 return success;
234}
235
nealsidb0baafc2009-08-17 23:12:53 +0000236void*
237LinuxDumper::FindBeginningOfLinuxGateSharedLibrary(const pid_t pid) const {
238 char auxv_path[80];
239 BuildProcPath(auxv_path, pid, "auxv");
240
241 // If BuildProcPath errors out due to invalid input, we'll handle it when
242 // we try to sys_open the file.
243
244 // Find the AT_SYSINFO_EHDR entry for linux-gate.so
245 // See http://www.trilithium.com/johan/2005/08/linux-gate/ for more
246 // information.
247 int fd = sys_open(auxv_path, O_RDONLY, 0);
248 if (fd < 0) {
249 return NULL;
250 }
251
252 elf_aux_entry one_aux_entry;
253 while (sys_read(fd,
254 &one_aux_entry,
255 sizeof(elf_aux_entry)) == sizeof(elf_aux_entry) &&
256 one_aux_entry.a_type != AT_NULL) {
257 if (one_aux_entry.a_type == AT_SYSINFO_EHDR) {
258 close(fd);
259 return reinterpret_cast<void*>(one_aux_entry.a_un.a_val);
260 }
261 }
262 close(fd);
263 return NULL;
264}
265
266bool
267LinuxDumper::EnumerateMappings(wasteful_vector<MappingInfo*>* result) const {
268 char maps_path[80];
269 BuildProcPath(maps_path, pid_, "maps");
270
271 // linux_gate_loc is the beginning of the kernel's mapping of
272 // linux-gate.so in the process. It doesn't actually show up in the
273 // maps list as a filename, so we use the aux vector to find it's
274 // load location and special case it's entry when creating the list
275 // of mappings.
276 const void* linux_gate_loc;
277 linux_gate_loc = FindBeginningOfLinuxGateSharedLibrary(pid_);
278
279 const int fd = sys_open(maps_path, O_RDONLY, 0);
280 if (fd < 0)
281 return false;
282 LineReader* const line_reader = new(allocator_) LineReader(fd);
283
284 const char* line;
285 unsigned line_len;
286 while (line_reader->GetNextLine(&line, &line_len)) {
287 uintptr_t start_addr, end_addr, offset;
288
289 const char* i1 = my_read_hex_ptr(&start_addr, line);
290 if (*i1 == '-') {
291 const char* i2 = my_read_hex_ptr(&end_addr, i1 + 1);
292 if (*i2 == ' ') {
293 const char* i3 = my_read_hex_ptr(&offset, i2 + 6 /* skip ' rwxp ' */);
294 if (*i3 == ' ') {
295 MappingInfo* const module = new(allocator_) MappingInfo;
296 memset(module, 0, sizeof(MappingInfo));
297 module->start_addr = start_addr;
298 module->size = end_addr - start_addr;
299 module->offset = offset;
300 const char* name = NULL;
301 // Only copy name if the name is a valid path name, or if
302 // we've found the VDSO image
303 if ((name = my_strchr(line, '/')) != NULL) {
304 const unsigned l = my_strlen(name);
305 if (l < sizeof(module->name))
306 memcpy(module->name, name, l);
307 } else if (linux_gate_loc &&
308 reinterpret_cast<void*>(module->start_addr) ==
309 linux_gate_loc) {
310 memcpy(module->name,
311 kLinuxGateLibraryName,
312 my_strlen(kLinuxGateLibraryName));
313 module->offset = 0;
314 }
315 result->push_back(module);
316 }
317 }
318 }
319 line_reader->PopLine(line_len);
320 }
321
322 sys_close(fd);
323
324 return result->size() > 0;
325}
326
327// Parse /proc/$pid/task to list all the threads of the process identified by
328// pid.
329bool LinuxDumper::EnumerateThreads(wasteful_vector<pid_t>* result) const {
330 char task_path[80];
331 BuildProcPath(task_path, pid_, "task");
332
333 const int fd = sys_open(task_path, O_RDONLY | O_DIRECTORY, 0);
334 if (fd < 0)
335 return false;
336 DirectoryReader* dir_reader = new(allocator_) DirectoryReader(fd);
337
338 // The directory may contain duplicate entries which we filter by assuming
339 // that they are consecutive.
340 int last_tid = -1;
341 const char* dent_name;
342 while (dir_reader->GetNextEntry(&dent_name)) {
343 if (my_strcmp(dent_name, ".") &&
344 my_strcmp(dent_name, "..")) {
345 int tid = 0;
346 if (my_strtoui(&tid, dent_name) &&
347 last_tid != tid) {
348 last_tid = tid;
349 result->push_back(tid);
350 }
351 }
352 dir_reader->PopEntry();
353 }
354
355 sys_close(fd);
356 return true;
357}
358
359// Read thread info from /proc/$pid/status.
nealsidde545c02010-03-02 00:39:48 +0000360// Fill out the |tgid|, |ppid| and |pid| members of |info|. If unavailable,
nealsidb0baafc2009-08-17 23:12:53 +0000361// these members are set to -1. Returns true iff all three members are
nealsidde545c02010-03-02 00:39:48 +0000362// available.
nealsidb0baafc2009-08-17 23:12:53 +0000363bool LinuxDumper::ThreadInfoGet(pid_t tid, ThreadInfo* info) {
364 assert(info != NULL);
365 char status_path[80];
366 BuildProcPath(status_path, tid, "status");
367
368 const int fd = open(status_path, O_RDONLY);
369 if (fd < 0)
370 return false;
371
372 LineReader* const line_reader = new(allocator_) LineReader(fd);
373 const char* line;
374 unsigned line_len;
375
376 info->ppid = info->tgid = -1;
377
378 while (line_reader->GetNextLine(&line, &line_len)) {
379 if (my_strncmp("Tgid:\t", line, 6) == 0) {
380 my_strtoui(&info->tgid, line + 6);
381 } else if (my_strncmp("PPid:\t", line, 6) == 0) {
382 my_strtoui(&info->ppid, line + 6);
383 }
384
385 line_reader->PopLine(line_len);
386 }
387
388 if (info->ppid == -1 || info->tgid == -1)
389 return false;
390
391 if (sys_ptrace(PTRACE_GETREGS, tid, NULL, &info->regs) == -1 ||
392 sys_ptrace(PTRACE_GETFPREGS, tid, NULL, &info->fpregs) == -1) {
393 return false;
394 }
395
nealsid096992f2009-12-01 21:35:52 +0000396#if defined(__i386)
nealsidb0baafc2009-08-17 23:12:53 +0000397 if (sys_ptrace(PTRACE_GETFPXREGS, tid, NULL, &info->fpxregs) == -1)
398 return false;
nealsid096992f2009-12-01 21:35:52 +0000399#endif
nealsidb0baafc2009-08-17 23:12:53 +0000400
nealsid096992f2009-12-01 21:35:52 +0000401#if defined(__i386) || defined(__x86_64)
nealsidb0baafc2009-08-17 23:12:53 +0000402 for (unsigned i = 0; i < ThreadInfo::kNumDebugRegisters; ++i) {
403 if (sys_ptrace(
404 PTRACE_PEEKUSER, tid,
405 reinterpret_cast<void*> (offsetof(struct user,
406 u_debugreg[0]) + i *
407 sizeof(debugreg_t)),
408 &info->dregs[i]) == -1) {
409 return false;
410 }
411 }
412#endif
413
414 const uint8_t* stack_pointer;
415#if defined(__i386)
416 memcpy(&stack_pointer, &info->regs.esp, sizeof(info->regs.esp));
417#elif defined(__x86_64)
418 memcpy(&stack_pointer, &info->regs.rsp, sizeof(info->regs.rsp));
nealsidde545c02010-03-02 00:39:48 +0000419#elif defined(__ARM_EABI__)
420 memcpy(&stack_pointer, &info->regs.uregs[R13], sizeof(info->regs.uregs[R13]));
nealsidb0baafc2009-08-17 23:12:53 +0000421#else
422#error "This code hasn't been ported to your platform yet."
423#endif
424
425 if (!GetStackInfo(&info->stack, &info->stack_len,
426 (uintptr_t) stack_pointer))
427 return false;
428
429 return true;
430}
431
432// Get information about the stack, given the stack pointer. We don't try to
433// walk the stack since we might not have all the information needed to do
434// unwind. So we just grab, up to, 32k of stack.
435bool LinuxDumper::GetStackInfo(const void** stack, size_t* stack_len,
436 uintptr_t int_stack_pointer) {
nealsidb0baafc2009-08-17 23:12:53 +0000437 // Move the stack pointer to the bottom of the page that it's in.
nealsidde545c02010-03-02 00:39:48 +0000438 const uintptr_t page_size = getpagesize();
439
nealsidb0baafc2009-08-17 23:12:53 +0000440 uint8_t* const stack_pointer =
441 reinterpret_cast<uint8_t*>(int_stack_pointer & ~(page_size - 1));
442
443 // The number of bytes of stack which we try to capture.
nealsidbb618862009-12-10 19:15:44 +0000444 static ptrdiff_t kStackToCapture = 32 * 1024;
nealsidb0baafc2009-08-17 23:12:53 +0000445
446 const MappingInfo* mapping = FindMapping(stack_pointer);
447 if (!mapping)
448 return false;
nealsidde545c02010-03-02 00:39:48 +0000449 const ptrdiff_t offset = stack_pointer - (uint8_t*) mapping->start_addr;
450 const ptrdiff_t distance_to_end =
451 static_cast<ptrdiff_t>(mapping->size) - offset;
452 *stack_len = distance_to_end > kStackToCapture ?
453 kStackToCapture : distance_to_end;
454 *stack = stack_pointer;
nealsidb0baafc2009-08-17 23:12:53 +0000455 return true;
456}
457
458// static
459void LinuxDumper::CopyFromProcess(void* dest, pid_t child, const void* src,
460 size_t length) {
nealsidde545c02010-03-02 00:39:48 +0000461 unsigned long tmp = 55;
nealsidb0baafc2009-08-17 23:12:53 +0000462 size_t done = 0;
463 static const size_t word_size = sizeof(tmp);
464 uint8_t* const local = (uint8_t*) dest;
465 uint8_t* const remote = (uint8_t*) src;
466
467 while (done < length) {
468 const size_t l = length - done > word_size ? word_size : length - done;
nealsidde545c02010-03-02 00:39:48 +0000469 if (sys_ptrace(PTRACE_PEEKDATA, child, remote + done, &tmp) == -1) {
nealsidb0baafc2009-08-17 23:12:53 +0000470 tmp = 0;
nealsidde545c02010-03-02 00:39:48 +0000471 }
nealsidb0baafc2009-08-17 23:12:53 +0000472 memcpy(local + done, &tmp, l);
473 done += l;
474 }
475}
476
477// Find the mapping which the given memory address falls in.
478const MappingInfo* LinuxDumper::FindMapping(const void* address) const {
479 const uintptr_t addr = (uintptr_t) address;
480
481 for (size_t i = 0; i < mappings_.size(); ++i) {
482 const uintptr_t start = static_cast<uintptr_t>(mappings_[i]->start_addr);
483 if (addr >= start && addr - start < mappings_[i]->size)
484 return mappings_[i];
485 }
486
487 return NULL;
488}
489
490} // namespace google_breakpad