OLD | NEW |
1 // Copyright (c) 2005, Google Inc. | 1 // Copyright (c) 2005, Google Inc. |
2 // All rights reserved. | 2 // All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions are | 5 // modification, are permitted provided that the following conditions are |
6 // met: | 6 // met: |
7 // | 7 // |
8 // * Redistributions of source code must retain the above copyright | 8 // * Redistributions of source code must retain the above copyright |
9 // notice, this list of conditions and the following disclaimer. | 9 // notice, this list of conditions and the following disclaimer. |
10 // * Redistributions in binary form must reproduce the above | 10 // * Redistributions in binary form must reproduce the above |
(...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
142 targ.skip_count = skip_count; | 142 targ.skip_count = skip_count; |
143 targ.count = 0; | 143 targ.count = 0; |
144 | 144 |
145 _Unwind_Backtrace(GetOneFrame, &targ); | 145 _Unwind_Backtrace(GetOneFrame, &targ); |
146 | 146 |
147 // No implementation for finding out the stack frame sizes yet. | 147 // No implementation for finding out the stack frame sizes yet. |
148 memset(sizes, 0, sizeof(*sizes) * targ.count); | 148 memset(sizes, 0, sizeof(*sizes) * targ.count); |
149 | 149 |
150 return targ.count; | 150 return targ.count; |
151 } | 151 } |
OLD | NEW |