| OLD | NEW |
| 1 // Copyright (c) 2009, Google Inc. | 1 |
| 2 // Copyright 2015, Google Inc. |
| 2 // All rights reserved. | 3 // All rights reserved. |
| 3 // | 4 // |
| 4 // Redistribution and use in source and binary forms, with or without | 5 // Redistribution and use in source and binary forms, with or without |
| 5 // modification, are permitted provided that the following conditions are | 6 // modification, are permitted provided that the following conditions are |
| 6 // met: | 7 // met: |
| 7 // | 8 // |
| 8 // * Redistributions of source code must retain the above copyright | 9 // * Redistributions of source code must retain the above copyright |
| 9 // notice, this list of conditions and the following disclaimer. | 10 // notice, this list of conditions and the following disclaimer. |
| 10 // * Redistributions in binary form must reproduce the above | 11 // * Redistributions in binary form must reproduce the above |
| 11 // copyright notice, this list of conditions and the following disclaimer | 12 // copyright notice, this list of conditions and the following disclaimer |
| 12 // in the documentation and/or other materials provided with the | 13 // in the documentation and/or other materials provided with the |
| 13 // distribution. | 14 // distribution. |
| 14 // * Neither the name of Google Inc. nor the names of its | 15 // * Neither the name of Google Inc. nor the names of its |
| 15 // contributors may be used to endorse or promote products derived from | 16 // contributors may be used to endorse or promote products derived from |
| 16 // this software without specific prior written permission. | 17 // this software without specific prior written permission. |
| 17 // | 18 // |
| 18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 20 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 28 // (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 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 | 30 |
| 30 // This code exists to generate minidump files for testing. | 31 syntax = "proto3"; |
| 31 | 32 |
| 32 #include <stdlib.h> | 33 package math; |
| 33 | 34 |
| 34 #include <unistd.h> | 35 message DivArgs { |
| 36 int64 dividend = 1; |
| 37 int64 divisor = 2; |
| 38 } |
| 35 | 39 |
| 36 #include "breakpad/src/client/linux/handler/exception_handler.h" | 40 message DivReply { |
| 37 #include "breakpad/src/common/linux/linux_libc_support.h" | 41 int64 quotient = 1; |
| 38 #include "third_party/lss/linux_syscall_support.h" | 42 int64 remainder = 2; |
| 43 } |
| 39 | 44 |
| 40 static bool DumpCallback(const google_breakpad::MinidumpDescriptor& descriptor, | 45 message FibArgs { |
| 41 void* context, bool success) { | 46 int64 limit = 1; |
| 42 if (!success) { | 47 } |
| 43 static const char msg[] = "Failed to write minidump\n"; | 48 |
| 44 sys_write(2, msg, sizeof(msg) - 1); | 49 message Num { |
| 45 return false; | 50 int64 num = 1; |
| 51 } |
| 52 |
| 53 message FibReply { |
| 54 int64 count = 1; |
| 55 } |
| 56 |
| 57 service Math { |
| 58 // Div divides args.dividend by args.divisor and returns the quotient and |
| 59 // remainder. |
| 60 rpc Div (DivArgs) returns (DivReply) { |
| 46 } | 61 } |
| 47 | 62 |
| 48 static const char msg[] = "Wrote minidump: "; | 63 // DivMany accepts an arbitrary number of division args from the client stream |
| 49 sys_write(2, msg, sizeof(msg) - 1); | 64 // and sends back the results in the reply stream. The stream continues until |
| 50 sys_write(2, descriptor.path(), strlen(descriptor.path())); | 65 // the client closes its end; the server does the same after sending all the |
| 51 sys_write(2, "\n", 1); | 66 // replies. The stream ends immediately if either end aborts. |
| 67 rpc DivMany (stream DivArgs) returns (stream DivReply) { |
| 68 } |
| 52 | 69 |
| 53 return true; | 70 // Fib generates numbers in the Fibonacci sequence. If args.limit > 0, Fib |
| 71 // generates up to limit numbers; otherwise it continues until the call is |
| 72 // canceled. Unlike Fib above, Fib has no final FibReply. |
| 73 rpc Fib (FibArgs) returns (stream Num) { |
| 74 } |
| 75 |
| 76 // Sum sums a stream of numbers, returning the final result once the stream |
| 77 // is closed. |
| 78 rpc Sum (stream Num) returns (Num) { |
| 79 } |
| 54 } | 80 } |
| 55 | |
| 56 static void DoSomethingWhichCrashes() { | |
| 57 int local_var = 1; | |
| 58 *reinterpret_cast<volatile char*>(NULL) = 1; | |
| 59 } | |
| 60 | |
| 61 int main() { | |
| 62 google_breakpad::MinidumpDescriptor minidump("."); | |
| 63 google_breakpad::ExceptionHandler breakpad(minidump, NULL, DumpCallback, NULL, | |
| 64 true, -1); | |
| 65 DoSomethingWhichCrashes(); | |
| 66 return 0; | |
| 67 } | |
| OLD | NEW |