DBGFStack.cpp revision dc7e0f093e66df3ea06a27af17713dea87186b9c
/* $Id$ */
/** @file
* DBGF - Debugger Facility, Call Stack Analyser.
*/
/*
* Copyright (C) 2006-2007 Sun Microsystems, Inc.
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa
* Clara, CA 95054 USA or visit http://www.sun.com if you need
* additional information or have any questions.
*/
/*******************************************************************************
* Header Files *
*******************************************************************************/
#define LOG_GROUP LOG_GROUP_DBGF
#include "DBGFInternal.h"
/**
* Read stack memory.
*/
{
if (VBOX_FAILURE(rc))
{
{
if (VBOX_FAILURE(rc))
break;
}
if (cbRead)
rc = VINF_SUCCESS;
}
else
return rc;
}
/**
* Internal worker routine.
*
* On x86 the typical stack frame layout is like this:
* .. ..
* 16 parameter 2
* 12 parameter 1
* 8 parameter 0
* 4 return address
* 0 old ebp; current ebp points here
*
* @todo Add AMD64 support (needs teaming up with the module management for
* unwind tables).
*/
{
/*
* Stop if we got a read error in the previous run.
*/
return VERR_NO_MORE_FILES;
/*
* Read the raw frame data.
*/
unsigned cbStackItem;
{
}
union
{
void *pv;
uBp = u;
if ( VBOX_FAILURE(rc)
/*
* The first step is taken in a different way than the others.
*/
{
/* Current PC - set by caller, just find symbol & line. */
{
}
}
else /* 2nd and subsequent steps */
{
/* frame, pc and stack is taken from the existing frames return members. */
/* increment the frame number. */
}
/*
* Return Frame address.
*/
switch (cbStackItem)
{
}
/*
* Return PC and Stack Addresses.
*/
/** @todo AddrReturnStack is not correct for stdcall and pascal. (requires scope info) */
switch (pFrame->enmReturnType)
{
case DBGFRETURNTYPE_NEAR16:
{
}
else
break;
case DBGFRETURNTYPE_NEAR32:
{
}
else
break;
case DBGFRETURNTYPE_NEAR64:
{
}
else
break;
case DBGFRETURNTYPE_FAR16:
break;
case DBGFRETURNTYPE_FAR32:
break;
case DBGFRETURNTYPE_FAR64:
break;
case DBGFRETURNTYPE_IRET16:
break;
case DBGFRETURNTYPE_IRET32:
break;
break;
break;
case DBGFRETURNTYPE_IRET64:
break;
default:
return VERR_INVALID_PARAMETER;
}
/*
* The arguments.
*/
return VINF_SUCCESS;
}
/**
* Walks the entire stack allocating memory as we walk.
*/
static DECLCALLBACK(int) dbgfR3StackWalkCtxFull(PVM pVM, PDBGFSTACKFRAME pFrame, PCCPUMCTXCORE pCtxCore, bool fGuest)
{
/* alloc first frame. */
if (!pCur)
return VERR_NO_MEMORY;
/* copy input frame */
int rc = VINF_SUCCESS;
{
{
}
}
/*
* The first frame.
*/
if (VBOX_SUCCESS(rc))
if (VBOX_FAILURE(rc))
{
return rc;
}
/*
* The other frames.
*/
while (!(pCur->fFlags & (DBGFSTACKFRAME_FLAGS_LAST | DBGFSTACKFRAME_FLAGS_MAX_DEPTH | DBGFSTACKFRAME_FLAGS_LOOP)))
{
/* try walk. */
if (VBOX_FAILURE(rc))
break;
/* add the next frame to the chain. */
if (!pNext)
{
return VERR_NO_MEMORY;
}
/* check for loop */
{
break;
}
/* check for insane recursion */
}
return rc;
}
/**
* Begins a stack walk.
* This will construct and obtain the first frame.
*
* @returns VINF_SUCCESS on success.
* @returns VERR_NO_MEMORY if we're out of memory.
* @param pVM The VM handle.
* @param pFrame The stack frame info structure.
* On input this structure must be memset to zero.
* If wanted, the AddrPC, AddrStack and AddrFrame fields may be set
* to valid addresses after memsetting it. Any of those fields not set
* will be fetched from the guest CPU state.
* On output the structure will contain all the information we were able to
* obtain about the stack frame.
*/
{
int rc = VMR3ReqCall(pVM, VMREQDEST_ANY, &pReq, RT_INDEFINITE_WAIT, (PFNRT)dbgfR3StackWalkCtxFull, 4,
if (VBOX_SUCCESS(rc))
return rc;
}
/**
* Begins a stack walk.
* This will construct and obtain the first frame.
*
* @returns VINF_SUCCESS on success.
* @returns VERR_NO_MEMORY if we're out of memory.
* @param pVM The VM handle.
* @param pFrame The stack frame info structure.
* On input this structure must be memset to zero.
* If wanted, the AddrPC, AddrStack and AddrFrame fields may be set
* to valid addresses after memsetting it. Any of those fields not set
* will be fetched from the hypervisor CPU state.
* On output the structure will contain all the information we were able to
* obtain about the stack frame.
*/
{
int rc = VMR3ReqCall(pVM, VMREQDEST_ANY, &pReq, RT_INDEFINITE_WAIT, (PFNRT)dbgfR3StackWalkCtxFull, 4,
if (VBOX_SUCCESS(rc))
return rc;
}
/**
* Gets the next stack frame.
*
* @returns VINF_SUCCESS
* @returns VERR_NO_MORE_FILES if not more stack frames.
* @param pVM The VM handle.
* @param pFrame Pointer to the current frame on input, content is replaced with the next frame on successful return.
*/
{
{
return VINF_SUCCESS;
}
return VERR_NO_MORE_FILES;
}
/**
* Ends a stack walk process.
*
* This *must* be called after a successful first call to any of the stack
* walker functions. If not called we will leak memory or other resources.
*
* @param pVM The VM handle.
* @param pFrame The stackframe as returned by the last stack walk call.
*/
{
return;
while (pFrame)
{
if (pFrame)
{
}
}
}