mirror of
https://github.com/signalwire/freeswitch.git
synced 2025-04-15 08:29:45 +00:00
fff98f6316
git-svn-id: http://svn.freeswitch.org/svn/freeswitch/trunk@3693 d0543943-73ff-0310-b7d9-9358b9ac24b2
248 lines
7.5 KiB
C
248 lines
7.5 KiB
C
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is the Netscape Portable Runtime (NSPR).
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Netscape Communications Corporation.
|
|
* Portions created by the Initial Developer are Copyright (C) 1998-2000
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
#include "prlog.h"
|
|
#include "prthread.h"
|
|
#ifdef XP_MAC
|
|
#include "pprthred.h"
|
|
#else
|
|
#include "private/pprthred.h"
|
|
#endif
|
|
#include "primpl.h"
|
|
|
|
PR_IMPLEMENT(PRWord *)
|
|
PR_GetGCRegisters(PRThread *t, int isCurrent, int *np)
|
|
{
|
|
return _MD_HomeGCRegisters(t, isCurrent, np);
|
|
}
|
|
|
|
PR_IMPLEMENT(PRStatus)
|
|
PR_ThreadScanStackPointers(PRThread* t,
|
|
PRScanStackFun scanFun, void* scanClosure)
|
|
{
|
|
PRThread* current = PR_GetCurrentThread();
|
|
PRWord *sp, *esp, *p0;
|
|
int n;
|
|
void **ptd;
|
|
PRStatus status;
|
|
PRUint32 index;
|
|
int stack_end;
|
|
|
|
/*
|
|
** Store the thread's registers in the thread structure so the GC
|
|
** can scan them. Then scan them.
|
|
*/
|
|
p0 = _MD_HomeGCRegisters(t, t == current, &n);
|
|
status = scanFun(t, (void**)p0, n, scanClosure);
|
|
if (status != PR_SUCCESS)
|
|
return status;
|
|
|
|
/* Scan the C stack for pointers into the GC heap */
|
|
#if defined(XP_PC) && defined(WIN16)
|
|
/*
|
|
** Under WIN16, the stack of the current thread is always mapped into
|
|
** the "task stack" (at SS:xxxx). So, if t is the current thread, scan
|
|
** the "task stack". Otherwise, scan the "cached stack" of the inactive
|
|
** thread...
|
|
*/
|
|
if (t == current) {
|
|
sp = (PRWord*) &stack_end;
|
|
esp = (PRWord*) _pr_top_of_task_stack;
|
|
|
|
PR_ASSERT(sp <= esp);
|
|
} else {
|
|
sp = (PRWord*) PR_GetSP(t);
|
|
esp = (PRWord*) t->stack->stackTop;
|
|
|
|
PR_ASSERT((t->stack->stackSize == 0) ||
|
|
((sp > (PRWord*)t->stack->stackBottom) &&
|
|
(sp <= (PRWord*)t->stack->stackTop)));
|
|
}
|
|
#else /* ! WIN16 */
|
|
#ifdef HAVE_STACK_GROWING_UP
|
|
if (t == current) {
|
|
esp = (PRWord*) &stack_end;
|
|
} else {
|
|
esp = (PRWord*) PR_GetSP(t);
|
|
}
|
|
sp = (PRWord*) t->stack->stackTop;
|
|
if (t->stack->stackSize) {
|
|
PR_ASSERT((esp > (PRWord*)t->stack->stackTop) &&
|
|
(esp < (PRWord*)t->stack->stackBottom));
|
|
}
|
|
#else /* ! HAVE_STACK_GROWING_UP */
|
|
if (t == current) {
|
|
sp = (PRWord*) &stack_end;
|
|
} else {
|
|
sp = (PRWord*) PR_GetSP(t);
|
|
}
|
|
esp = (PRWord*) t->stack->stackTop;
|
|
if (t->stack->stackSize) {
|
|
PR_ASSERT((sp > (PRWord*)t->stack->stackBottom) &&
|
|
(sp < (PRWord*)t->stack->stackTop));
|
|
}
|
|
#endif /* ! HAVE_STACK_GROWING_UP */
|
|
#endif /* ! WIN16 */
|
|
|
|
#if defined(WIN16)
|
|
{
|
|
prword_t scan;
|
|
prword_t limit;
|
|
|
|
scan = (prword_t) sp;
|
|
limit = (prword_t) esp;
|
|
while (scan < limit) {
|
|
prword_t *test;
|
|
|
|
test = *((prword_t **)scan);
|
|
status = scanFun(t, (void**)&test, 1, scanClosure);
|
|
if (status != PR_SUCCESS)
|
|
return status;
|
|
scan += sizeof(char);
|
|
}
|
|
}
|
|
#else
|
|
if (sp < esp) {
|
|
status = scanFun(t, (void**)sp, esp - sp, scanClosure);
|
|
if (status != PR_SUCCESS)
|
|
return status;
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
** Mark all of the per-thread-data items attached to this thread
|
|
**
|
|
** The execution environment better be accounted for otherwise it
|
|
** will be collected
|
|
*/
|
|
status = scanFun(t, (void**)&t->environment, 1, scanClosure);
|
|
if (status != PR_SUCCESS)
|
|
return status;
|
|
|
|
#ifndef GC_LEAK_DETECTOR
|
|
/* if thread is not allocated on stack, this is redundant. */
|
|
ptd = t->privateData;
|
|
for (index = 0; index < t->tpdLength; index++, ptd++) {
|
|
status = scanFun(t, (void**)ptd, 1, scanClosure);
|
|
if (status != PR_SUCCESS)
|
|
return status;
|
|
}
|
|
#endif
|
|
|
|
return PR_SUCCESS;
|
|
}
|
|
|
|
/* transducer for PR_EnumerateThreads */
|
|
typedef struct PRScanStackData {
|
|
PRScanStackFun scanFun;
|
|
void* scanClosure;
|
|
} PRScanStackData;
|
|
|
|
static PRStatus PR_CALLBACK
|
|
pr_ScanStack(PRThread* t, int i, void* arg)
|
|
{
|
|
#if defined(XP_MAC)
|
|
#pragma unused (i)
|
|
#endif
|
|
PRScanStackData* data = (PRScanStackData*)arg;
|
|
return PR_ThreadScanStackPointers(t, data->scanFun, data->scanClosure);
|
|
}
|
|
|
|
PR_IMPLEMENT(PRStatus)
|
|
PR_ScanStackPointers(PRScanStackFun scanFun, void* scanClosure)
|
|
{
|
|
PRScanStackData data;
|
|
data.scanFun = scanFun;
|
|
data.scanClosure = scanClosure;
|
|
return PR_EnumerateThreads(pr_ScanStack, &data);
|
|
}
|
|
|
|
PR_IMPLEMENT(PRUword)
|
|
PR_GetStackSpaceLeft(PRThread* t)
|
|
{
|
|
PRThread *current = PR_GetCurrentThread();
|
|
PRWord *sp, *esp;
|
|
int stack_end;
|
|
|
|
#if defined(WIN16)
|
|
/*
|
|
** Under WIN16, the stack of the current thread is always mapped into
|
|
** the "task stack" (at SS:xxxx). So, if t is the current thread, scan
|
|
** the "task stack". Otherwise, scan the "cached stack" of the inactive
|
|
** thread...
|
|
*/
|
|
if (t == current) {
|
|
sp = (PRWord*) &stack_end;
|
|
esp = (PRWord*) _pr_top_of_task_stack;
|
|
|
|
PR_ASSERT(sp <= esp);
|
|
} else {
|
|
sp = (PRWord*) PR_GetSP(t);
|
|
esp = (PRWord*) t->stack->stackTop;
|
|
|
|
PR_ASSERT((t->stack->stackSize == 0) ||
|
|
((sp > (PRWord*)t->stack->stackBottom) &&
|
|
(sp <= (PRWord*)t->stack->stackTop)));
|
|
}
|
|
#else /* ! WIN16 */
|
|
#ifdef HAVE_STACK_GROWING_UP
|
|
if (t == current) {
|
|
esp = (PRWord*) &stack_end;
|
|
} else {
|
|
esp = (PRWord*) PR_GetSP(t);
|
|
}
|
|
sp = (PRWord*) t->stack->stackTop;
|
|
if (t->stack->stackSize) {
|
|
PR_ASSERT((esp > (PRWord*)t->stack->stackTop) &&
|
|
(esp < (PRWord*)t->stack->stackBottom));
|
|
}
|
|
#else /* ! HAVE_STACK_GROWING_UP */
|
|
if (t == current) {
|
|
sp = (PRWord*) &stack_end;
|
|
} else {
|
|
sp = (PRWord*) PR_GetSP(t);
|
|
}
|
|
esp = (PRWord*) t->stack->stackTop;
|
|
if (t->stack->stackSize) {
|
|
PR_ASSERT((sp > (PRWord*)t->stack->stackBottom) &&
|
|
(sp < (PRWord*)t->stack->stackTop));
|
|
}
|
|
#endif /* ! HAVE_STACK_GROWING_UP */
|
|
#endif /* ! WIN16 */
|
|
return (PRUword)t->stack->stackSize - ((PRWord)esp - (PRWord)sp);
|
|
}
|