1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* 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 security libraries.
*
* The Initial Developer of the Original Code is Netscape
* Communications Corporation. Portions created by Netscape are
* Copyright (C) 1998-2000 Netscape Communications Corporation. All
* Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the
* terms of the GNU General Public License Version 2 or later (the
* "GPL"), in which case the provisions of the GPL are applicable
* instead of those above. If you wish to allow use of your
* version of this file only under the terms of the GPL and not to
* allow others to use your version of this file under the MPL,
* indicate your decision by deleting the provisions above and
* replace them with the notice and other provisions required by
* the GPL. If you do not delete the provisions above, a recipient
* may use your version of this file under either the MPL or the
* GPL.
*/
#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;
ptd = t->privateData;
for (index = 0; index < t->tpdLength; index++, ptd++) {
status = scanFun(t, (void**)ptd, 1, scanClosure);
if (status != PR_SUCCESS)
return status;
}
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_CurrentThread();
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);
}
|
