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
|
/******************************** -*- C -*- ****************************
*
* Object table module Inlines.
*
*
***********************************************************************/
/***********************************************************************
*
* Copyright 2000, 2001, 2002, 2006 Free Software Foundation, Inc.
* Written by Steve Byrne.
*
* This file is part of GNU Smalltalk.
*
* GNU Smalltalk is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2, or (at your option) any later
* version.
*
* Linking GNU Smalltalk statically or dynamically with other modules is
* making a combined work based on GNU Smalltalk. Thus, the terms and
* conditions of the GNU General Public License cover the whole
* combination.
*
* In addition, as a special exception, the Free Software Foundation
* give you permission to combine GNU Smalltalk with free software
* programs or libraries that are released under the GNU LGPL and with
* independent programs running under the GNU Smalltalk virtual machine.
*
* You may copy and distribute such a system following the terms of the
* GNU GPL for GNU Smalltalk and the licenses of the other code
* concerned, provided that you include the source code of that other
* code when and as the GNU GPL requires distribution of source code.
*
* Note that people who make modified versions of GNU Smalltalk are not
* obligated to grant this special exception for their modified
* versions; it is their choice whether to do so. The GNU General
* Public License gives permission to release a modified version without
* this exception; this exception also makes it possible to release a
* modified version which carries forward this exception.
*
* GNU Smalltalk 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 General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* GNU Smalltalk; see the file COPYING. If not, write to the Free Software
* Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
***********************************************************************/
static inline OOP alloc_oop (PTR obj, intptr_t flags);
/* Copy the OOP object because it is part of the root set. Integers
and already-copied OOPs are not processed silently. */
#define MAYBE_COPY_OOP(oop) do { \
if (!IS_OOP_COPIED(oop)) { \
_gst_copy_an_oop(oop); \
} \
} while(0)
/* Mark the OOPs starting at STARTOOP (included) and ending at ENDOOP
(excluded). */
#define COPY_OOP_RANGE(startOOP, endOOP) do { \
if ((startOOP) < (endOOP)) { \
_gst_copy_oop_range((startOOP), (endOOP)); \
} \
} while(0)
/* Mark the OOP object because it is part of the root set. Integers
and already-marked OOPs are not processed silently. */
#define MAYBE_MARK_OOP(oop) do { \
if (IS_OOP(oop) && !IS_OOP_MARKED(oop)) { \
_gst_mark_an_oop_internal((oop), NULL, NULL); \
} \
} while(0)
/* Mark the OOPs starting at STARTOOP (included) and ending at ENDOOP
(excluded). */
#define MARK_OOP_RANGE(startOOP, endOOP) do { \
if ((startOOP) < (endOOP)) { \
_gst_mark_an_oop_internal(NULL, (startOOP), (endOOP));\
} \
} while(0)
#define IS_OOP_COPIED(oop) \
(IS_INT(oop) || IS_OOP_VALID_GC (oop))
#define IS_OOP_NEW(oop) \
((oop)->flags & F_SPACES)
/* This can only be used at the start or the end of an incremental
GC cycle. */
#define IS_OOP_VALID_GC(oop) \
((oop)->flags & _gst_mem.live_flags)
/* After a global GC, the live_flags say that an object is live
if it is marked reachable. Old objects that have already survived
the incremental sweep pass, however, are not marked as reachable. */
#define IS_OOP_VALID(oop) \
((oop)->flags & _gst_mem.live_flags \
|| ((oop) <= _gst_mem.last_swept_oop && !IS_OOP_NEW (oop)))
#define IS_OOP_MARKED(oop) \
((oop)->flags & F_REACHABLE)
#define IS_OOP_FREE(oop) \
((oop)->flags == 0)
/* Checks to see if INDEX (a long index into the OOP table, 1 based
due to being called from Smalltalk via a primitive) represents a
valid OOP. Returns true if so. */
#define OOP_INDEX_VALID(index) \
((index) >= FIRST_OOP_INDEX && (index) < _gst_mem.ot_size)
/* Answer the INDEX-th OOP in the table. */
#define OOP_AT(index) \
( &_gst_mem.ot[index] )
/* Answer the index of OOP in the table. */
#define OOP_INDEX(oop) \
( (OOP)(oop) - _gst_mem.ot )
/* Answer whether OOP is a builtin OOP (a Character, true, false, nil). */
#define IS_BUILTIN_OOP(oop) \
( (OOP)(oop) - _gst_mem.ot < 0 )
/* Set the indirect object pointer OOP to point to OBJ. */
#define SET_OOP_OBJECT(oop, obj) do { \
(oop)->object = (gst_object) (obj); \
} while(0)
/* Answer whether ADDR is part of the OOP table. */
#define IS_OOP_ADDR(addr) \
((OOP)(addr) >= _gst_mem.ot_base \
&& (OOP)(addr) <= _gst_mem.last_allocated_oop \
&& (((intptr_t)addr & (sizeof (struct oop_s) - 1)) == 0))
/* Answer whether ADDR is part of newspace. */
#define IS_EDEN_ADDR(addr) \
((OOP *)(addr) >= _gst_mem.eden.minPtr && \
(OOP *)(addr) < _gst_mem.eden.maxPtr)
/* Answer whether ADDR is part of survivor space N. */
#define IS_SURVIVOR_ADDR(addr, n) \
((OOP *)(addr) >= _gst_mem.surv[(n)].minPtr && \
(OOP *)(addr) < _gst_mem.surv[(n)].maxPtr)
#define INC_ADD_OOP(oop) \
((_gst_mem.inc_ptr >= _gst_mem.inc_end ? \
_gst_inc_grow_registry() : (void)0), \
*_gst_mem.inc_ptr++ = (oop))
#define INC_SAVE_POINTER() \
(_gst_mem.inc_ptr - _gst_mem.inc_base)
#define INC_RESTORE_POINTER(ptr) \
_gst_mem.inc_ptr = (ptr) + _gst_mem.inc_base;
/* Given an object OBJ, allocate an OOP table slot for it and returns
it. It marks the OOP so that it indicates the object is in new
space, and that the oop has been referenced on this pass (to keep
the OOP table reaper from reclaiming this OOP). */
static inline OOP
alloc_oop (PTR objData, intptr_t flags)
{
REGISTER (1, OOP oop);
gst_object obj;
obj = (gst_object) objData;
if UNCOMMON (_gst_mem.last_allocated_oop ==
_gst_mem.last_swept_oop)
{
oop = ++_gst_mem.last_allocated_oop;
++_gst_mem.last_swept_oop;
}
else
{
for (oop = _gst_mem.last_swept_oop;
++oop, IS_OOP_VALID (oop);
oop->flags &= ~F_REACHABLE)
#if defined(ENABLE_JIT_TRANSLATION)
if (oop->flags & F_XLAT)
{
if (oop->flags & F_XLAT_REACHABLE)
/* Reachable, and referenced by active contexts. Keep it
around. */
oop->flags &= ~F_XLAT_2NDCHANCE;
else
{
/* Reachable, but not referenced by active contexts. We
give it a second chance... */
if (oop->flags & F_XLAT_2NDCHANCE)
_gst_release_native_code (oop);
oop->flags ^= F_XLAT_2NDCHANCE;
}
}
#else
;
#endif
if (oop > _gst_mem.last_allocated_oop)
_gst_mem.last_allocated_oop = oop;
_gst_sweep_oop (oop);
PREFETCH_LOOP (oop, PREF_READ);
}
/* Force a GC as soon as possible if we're low on OOPs. */
if UNCOMMON (_gst_mem.num_free_oops-- < LOW_WATER_OOP_THRESHOLD)
_gst_mem.eden.maxPtr = _gst_mem.eden.allocPtr;
oop->object = obj;
oop->flags = flags;
return (oop);
}
|
