1 /* ----------------------------------------------------------------------------
2 * $Id: InfoTables.h,v 1.29 2003/05/14 09:14:02 simonmar Exp $
4 * (c) The GHC Team, 1998-2002
8 * -------------------------------------------------------------------------- */
13 /* -----------------------------------------------------------------------------
15 -------------------------------------------------------------------------- */
22 /* -----------------------------------------------------------------------------
24 -------------------------------------------------------------------------- */
26 #if 0 && (defined(PAR) || defined(GRAN))
29 // ToDo: use this in StgInfoTable (mutually recursive) -- HWL
32 StgInfoTable *rbh_infoptr; /* infoptr to the RBH */
38 Copied from ghc-0.29; ToDo: check this code -- HWL
40 In the parallel system, all updatable closures have corresponding
41 revertible black holes. When we are assembly-mangling, we guarantee
42 that the revertible black hole code precedes the normal entry code, so
43 that the RBH info table resides at a fixed offset from the normal info
44 table. Otherwise, we add the RBH info table pointer to the end of the
45 normal info table and vice versa.
47 Currently has to use a !RBH_MAGIC_OFFSET setting.
48 Still todo: init of par.infoptr field in all infotables!!
51 #if defined(PAR) || defined(GRAN)
53 # ifdef RBH_MAGIC_OFFSET
55 # error magic offset not yet implemented
57 # define RBH_INFO_WORDS 0
58 # define INCLUDE_RBH_INFO(infoptr)
60 # define RBH_INFOPTR(infoptr) (((P_)infoptr) - RBH_MAGIC_OFFSET)
61 # define REVERT_INFOPTR(infoptr) (((P_)infoptr) + RBH_MAGIC_OFFSET)
65 # define RBH_INFO_WORDS 1
66 # define INCLUDE_RBH_INFO(info) rbh_infoptr : &(info)
68 # define RBH_INFOPTR(infoptr) (((StgInfoTable *)(infoptr))->rbh_infoptr)
69 # define REVERT_INFOPTR(infoptr) (((StgInfoTable *)(infoptr))->rbh_infoptr)
73 /* see ParallelRts.h */
75 //StgClosure *convertToRBH(StgClosure *closure);
77 //void convertFromRBH(StgClosure *closure);
79 //void convertToFetchMe(StgPtr closure, globalAddr *ga);
84 /* -----------------------------------------------------------------------------
86 -------------------------------------------------------------------------- */
92 /* -----------------------------------------------------------------------------
94 -------------------------------------------------------------------------- */
102 #else /* !DEBUG_CLOSURE */
108 #endif /* DEBUG_CLOSURE */
110 /* -----------------------------------------------------------------------------
112 -------------------------------------------------------------------------- */
114 /* The type flags provide quick access to certain properties of a closure. */
116 #define _HNF (1<<0) /* head normal form? */
117 #define _BTM (1<<1) /* bitmap-style layout? */
118 #define _NS (1<<2) /* non-sparkable */
119 #define _STA (1<<3) /* static? */
120 #define _THU (1<<4) /* thunk? */
121 #define _MUT (1<<5) /* mutable? */
122 #define _UPT (1<<6) /* unpointed? */
123 #define _SRT (1<<7) /* has an SRT? */
124 #define _IND (1<<8) /* is an indirection? */
126 #define isSTATIC(flags) ((flags) &_STA)
127 #define isMUTABLE(flags) ((flags) &_MUT)
128 #define isBITMAP(flags) ((flags) &_BTM)
129 #define isTHUNK(flags) ((flags) &_THU)
130 #define isUNPOINTED(flags) ((flags) &_UPT)
131 #define hasSRT(flags) ((flags) &_SRT)
133 extern StgWord16 closure_flags[];
135 #define closureFlags(c) (closure_flags[get_itbl(c)->type])
137 #define closure_HNF(c) ( closureFlags(c) & _HNF)
138 #define closure_BITMAP(c) ( closureFlags(c) & _BTM)
139 #define closure_NON_SPARK(c) ( (closureFlags(c) & _NS))
140 #define closure_SHOULD_SPARK(c) (!(closureFlags(c) & _NS))
141 #define closure_STATIC(c) ( closureFlags(c) & _STA)
142 #define closure_THUNK(c) ( closureFlags(c) & _THU)
143 #define closure_MUTABLE(c) ( closureFlags(c) & _MUT)
144 #define closure_UNPOINTED(c) ( closureFlags(c) & _UPT)
145 #define closure_SRT(c) ( closureFlags(c) & _SRT)
146 #define closure_IND(c) ( closureFlags(c) & _IND)
148 /* same as above but for info-ptr rather than closure */
149 #define ipFlags(ip) (closure_flags[ip->type])
151 #define ip_HNF(ip) ( ipFlags(ip) & _HNF)
152 #define ip_BITMAP(ip) ( ipFlags(ip) & _BTM)
153 #define ip_SHOULD_SPARK(ip) (!(ipFlags(ip) & _NS))
154 #define ip_STATIC(ip) ( ipFlags(ip) & _STA)
155 #define ip_THUNK(ip) ( ipFlags(ip) & _THU)
156 #define ip_MUTABLE(ip) ( ipFlags(ip) & _MUT)
157 #define ip_UNPOINTED(ip) ( ipFlags(ip) & _UPT)
158 #define ip_SRT(ip) ( ipFlags(ip) & _SRT)
159 #define ip_IND(ip) ( ipFlags(ip) & _IND)
161 /* -----------------------------------------------------------------------------
164 These are used to describe the pointerhood of a sequence of words
165 (usually on the stack) to the garbage collector. The two primary
166 uses are for stack frames, and functions (where we need to describe
167 the layout of a PAP to the GC).
168 -------------------------------------------------------------------------- */
171 // Small bitmaps: for a small bitmap, we store the size and bitmap in
172 // the same word, using the following macros. If the bitmap doesn't
173 // fit in a single word, we use a pointer to an StgLargeBitmap below.
175 #define MK_SMALL_BITMAP(size,bits) (((bits)<<BITMAP_BITS_SHIFT) | (size))
177 #define BITMAP_SIZE(bitmap) ((bitmap) & BITMAP_SIZE_MASK)
178 #define BITMAP_BITS(bitmap) ((bitmap) >> BITMAP_BITS_SHIFT)
185 StgWord bitmap[FLEXIBLE_ARRAY];
188 /* -----------------------------------------------------------------------------
189 SRTs (Static Reference Tables)
191 These tables are used to keep track of the static objects referred
192 to by the code for a closure or stack frame, so that we can follow
193 static data references from code and thus accurately
194 garbage-collect CAFs.
195 -------------------------------------------------------------------------- */
197 // An SRT is just an array of closure pointers:
198 typedef StgClosure* StgSRT[];
200 // Each info table refers to some subset of the closure pointers in an
201 // SRT. It does this using a pair of an StgSRT pointer and a
202 // half-word bitmap. If the half-word bitmap isn't large enough, then
203 // we fall back to a large SRT, including an unbounded bitmap. If the
204 // half-word bitmap is set to all ones (0xffff), then the StgSRT
205 // pointer instead points to an StgLargeSRT:
206 typedef struct StgLargeSRT_ {
211 /* ----------------------------------------------------------------------------
213 ------------------------------------------------------------------------- */
216 // Stuff describing the closure layout. Well, actually, it might
217 // contain the selector index for a THUNK_SELECTOR. This union is one
221 struct { // Heap closure payload layout:
222 StgHalfWord ptrs; // number of pointers
223 StgHalfWord nptrs; // number of non-pointers
226 StgWord bitmap; // word-sized bit pattern describing
227 // a stack frame: see below
229 StgLargeBitmap* large_bitmap; // pointer to large bitmap structure
231 StgWord selector_offset; // used in THUNK_SELECTORs
237 // The "standard" part of an info table. Every info table has this bit.
239 typedef struct _StgInfoTable {
241 #ifndef TABLES_NEXT_TO_CODE
242 StgFunPtr entry; // pointer to the entry code
245 #if defined(PAR) || defined(GRAN)
246 struct _StgInfoTable *rbh_infoptr;
258 StgClosureInfo layout; // closure layout info (one word)
260 StgHalfWord type; // closure type
261 StgHalfWord srt_bitmap; // number of entries in SRT (or constructor tag)
263 #ifdef TABLES_NEXT_TO_CODE
264 StgCode code[FLEXIBLE_ARRAY];
269 /* -----------------------------------------------------------------------------
272 This is the general form of function info tables. The compiler
273 will omit some of the fields in common cases:
275 - If fun_type is not ARG_GEN or ARG_GEN_BIG, then the slow_apply
276 and bitmap fields may be left out (they are at the end, so omitting
277 them doesn't affect the layout).
279 - If srt_bitmap (in the std info table part) is zero, then the srt
280 field may be omitted. This only applies if the slow_apply and
281 bitmap fields have also been omitted.
282 -------------------------------------------------------------------------- */
284 typedef struct _StgFunInfoTable {
285 #if defined(TABLES_NEXT_TO_CODE)
286 StgFun *slow_apply; // apply to args on the stack
287 StgWord bitmap; // arg ptr/nonptr bitmap
288 StgSRT *srt; // pointer to the SRT table
289 StgHalfWord fun_type; // function type
290 StgHalfWord arity; // function arity
294 StgHalfWord fun_type; // function type
295 StgHalfWord arity; // function arity
296 StgSRT *srt; // pointer to the SRT table
297 StgWord bitmap; // arg ptr/nonptr bitmap
298 StgFun *slow_apply; // apply to args on the stack
302 /* -----------------------------------------------------------------------------
304 -------------------------------------------------------------------------- */
306 // When info tables are laid out backwards, we can omit the SRT
307 // pointer iff srt_bitmap is zero.
309 typedef struct _StgRetInfoTable {
310 #if !defined(TABLES_NEXT_TO_CODE)
313 StgSRT *srt; // pointer to the SRT table
314 #if defined(TABLES_NEXT_TO_CODE)
317 #if !defined(TABLES_NEXT_TO_CODE)
318 StgFunPtr vector[FLEXIBLE_ARRAY];
322 /* -----------------------------------------------------------------------------
324 -------------------------------------------------------------------------- */
326 // When info tables are laid out backwards, we can omit the SRT
327 // pointer iff srt_bitmap is zero.
329 typedef struct _StgThunkInfoTable {
330 #if !defined(TABLES_NEXT_TO_CODE)
333 StgSRT *srt; // pointer to the SRT table
334 #if defined(TABLES_NEXT_TO_CODE)
339 #endif /* INFOTABLES_H */