/* Minetest Copyright (C) 2013 celeron55, Perttu Ahola This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "debug.h" #include "exceptions.h" #include "threads.h" #include #include #include #include #include "jthread/jmutex.h" #include "jthread/jmutexautolock.h" /* Debug output */ #define DEBUGSTREAM_COUNT 2 FILE *g_debugstreams[DEBUGSTREAM_COUNT] = {stderr, NULL}; #define DEBUGPRINT(...)\ {\ for(int i=0; i g_debug_stacks; JMutex g_debug_stacks_mutex; void debug_stacks_init() { } void debug_stacks_print_to(std::ostream &os) { JMutexAutoLock lock(g_debug_stacks_mutex); os<<"Debug stacks:"<::iterator i = g_debug_stacks.begin(); i != g_debug_stacks.end(); ++i) { i->second->print(os, false); } } void debug_stacks_print() { JMutexAutoLock lock(g_debug_stacks_mutex); DEBUGPRINT("Debug stacks:\n"); for(std::map::iterator i = g_debug_stacks.begin(); i != g_debug_stacks.end(); ++i) { DebugStack *stack = i->second; for(int i=0; iprint(g_debugstreams[i], true); } } } DebugStacker::DebugStacker(const char *text) { threadid_t threadid = get_current_thread_id(); JMutexAutoLock lock(g_debug_stacks_mutex); std::map::iterator n; n = g_debug_stacks.find(threadid); if(n != g_debug_stacks.end()) { m_stack = n->second; } else { /*DEBUGPRINT("Creating new debug stack for thread %x\n", (unsigned int)threadid);*/ m_stack = new DebugStack(threadid); g_debug_stacks[threadid] = m_stack; } if(m_stack->stack_i >= DEBUG_STACK_SIZE) { m_overflowed = true; } else { m_overflowed = false; snprintf(m_stack->stack[m_stack->stack_i], DEBUG_STACK_TEXT_SIZE, "%s", text); m_stack->stack_i++; if(m_stack->stack_i > m_stack->stack_max_i) m_stack->stack_max_i = m_stack->stack_i; } } DebugStacker::~DebugStacker() { JMutexAutoLock lock(g_debug_stacks_mutex); if(m_overflowed == true) return; m_stack->stack_i--; if(m_stack->stack_i == 0) { threadid_t threadid = m_stack->threadid; /*DEBUGPRINT("Deleting debug stack for thread %x\n", (unsigned int)threadid);*/ delete m_stack; g_debug_stacks.erase(threadid); } } #ifdef _MSC_VER #if CATCH_UNHANDLED_EXCEPTIONS == 1 void se_trans_func(unsigned int u, EXCEPTION_POINTERS* pExp) { dstream<<"In trans_func.\n"; if(u == EXCEPTION_ACCESS_VIOLATION) { PEXCEPTION_RECORD r = pExp->ExceptionRecord; dstream<<"Access violation at "<ExceptionAddress <<" write?="<ExceptionInformation[0] <<" address="<ExceptionInformation[1] <