mirror of
https://github.com/beefytech/Beef.git
synced 2025-06-25 19:18:01 +02:00
Moving BeefMem
This commit is contained in:
parent
b3487d733b
commit
65bf1915af
337 changed files with 0 additions and 4 deletions
83
BeefTools/BeefMem/gperftools/src/stacktrace_generic-inl.h
Normal file
83
BeefTools/BeefMem/gperftools/src/stacktrace_generic-inl.h
Normal file
|
@ -0,0 +1,83 @@
|
|||
// Copyright (c) 2005, Google Inc.
|
||||
// All rights reserved.
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google Inc. nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
// ---
|
||||
// Author: Sanjay Ghemawat
|
||||
//
|
||||
// Portable implementation - just use glibc
|
||||
//
|
||||
// Note: The glibc implementation may cause a call to malloc.
|
||||
// This can cause a deadlock in HeapProfiler.
|
||||
|
||||
#ifndef BASE_STACKTRACE_GENERIC_INL_H_
|
||||
#define BASE_STACKTRACE_GENERIC_INL_H_
|
||||
// Note: this file is included into stacktrace.cc more than once.
|
||||
// Anything that should only be defined once should be here:
|
||||
|
||||
#include <execinfo.h>
|
||||
#include <string.h>
|
||||
#include "gperftools/stacktrace.h"
|
||||
#endif // BASE_STACKTRACE_GENERIC_INL_H_
|
||||
|
||||
// Note: this part of the file is included several times.
|
||||
// Do not put globals below.
|
||||
|
||||
// The following 4 functions are generated from the code below:
|
||||
// GetStack{Trace,Frames}()
|
||||
// GetStack{Trace,Frames}WithContext()
|
||||
//
|
||||
// These functions take the following args:
|
||||
// void** result: the stack-trace, as an array
|
||||
// int* sizes: the size of each stack frame, as an array
|
||||
// (GetStackFrames* only)
|
||||
// int max_depth: the size of the result (and sizes) array(s)
|
||||
// int skip_count: how many stack pointers to skip before storing in result
|
||||
// void* ucp: a ucontext_t* (GetStack{Trace,Frames}WithContext only)
|
||||
int GET_STACK_TRACE_OR_FRAMES {
|
||||
static const int kStackLength = 64;
|
||||
void * stack[kStackLength];
|
||||
int size;
|
||||
|
||||
size = backtrace(stack, kStackLength);
|
||||
skip_count++; // we want to skip the current frame as well
|
||||
int result_count = size - skip_count;
|
||||
if (result_count < 0)
|
||||
result_count = 0;
|
||||
if (result_count > max_depth)
|
||||
result_count = max_depth;
|
||||
for (int i = 0; i < result_count; i++)
|
||||
result[i] = stack[i + skip_count];
|
||||
|
||||
#if IS_STACK_FRAMES
|
||||
// No implementation for finding out the stack frame sizes yet.
|
||||
memset(sizes, 0, sizeof(*sizes) * result_count);
|
||||
#endif
|
||||
|
||||
return result_count;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue