1 /* -----------------------------------------------------------------------------
2 * $Id: Sanity.c,v 1.12 1999/03/26 14:55:05 simonm Exp $
4 * (c) The GHC Team, 1998-1999
6 * Sanity checking code for the heap and stack.
8 * Used when debugging: check that the stack looks reasonable.
10 * - All things that are supposed to be pointers look like pointers.
12 * - Objects in text space are marked as static closures, those
13 * in the heap are dynamic.
15 * ---------------------------------------------------------------------------*/
23 #include "BlockAlloc.h"
26 #define LOOKS_LIKE_PTR(r) (IS_DATA_PTR(r) || ((HEAP_ALLOCED(r) && Bdescr((P_)r)->free != (void *)-1)))
28 /* -----------------------------------------------------------------------------
30 -------------------------------------------------------------------------- */
32 StgOffset checkStackClosure( StgClosure* c );
34 StgOffset checkStackObject( StgPtr sp );
36 void checkStackChunk( StgPtr sp, StgPtr stack_end );
38 static StgOffset checkSmallBitmap( StgPtr payload, StgWord32 bitmap );
40 static StgOffset checkLargeBitmap( StgPtr payload,
41 StgLargeBitmap* large_bitmap );
43 void checkClosureShallow( StgClosure* p );
46 checkSmallBitmap( StgPtr payload, StgWord32 bitmap )
51 for(; bitmap != 0; ++i, bitmap >>= 1 ) {
52 if ((bitmap & 1) == 0) {
53 checkClosure(stgCast(StgClosure*,payload[i]));
61 checkLargeBitmap( StgPtr payload, StgLargeBitmap* large_bitmap )
67 for (bmp=0; bmp<large_bitmap->size; bmp++) {
68 StgWord32 bitmap = large_bitmap->bitmap[bmp];
69 for(; bitmap != 0; ++i, bitmap >>= 1 ) {
70 if ((bitmap & 1) == 0) {
71 checkClosure(stgCast(StgClosure*,payload[i]));
79 checkStackClosure( StgClosure* c )
81 const StgInfoTable* info = get_itbl(c);
83 /* All activation records have 'bitmap' style layout info. */
85 case RET_DYN: /* Dynamic bitmap: the mask is stored on the stack */
87 StgRetDyn* r = (StgRetDyn *)c;
88 return sizeofW(StgRetDyn) +
89 checkSmallBitmap(r->payload,r->liveness);
91 case RET_BCO: /* small bitmap (<= 32 entries) */
98 return 1 + checkSmallBitmap((StgPtr)c + 1,info->layout.bitmap);
99 case RET_BIG: /* large bitmap (> 32 entries) */
101 return 1 + checkLargeBitmap((StgPtr)c + 1,info->layout.large_bitmap);
103 case FUN_STATIC: /* probably a slow-entry point return address: */
106 /* if none of the above, maybe it's a closure which looks a
107 * little like an infotable
109 checkClosureShallow(*(StgClosure **)c);
111 /* barf("checkStackClosure: weird activation record found on stack (%p).",c); */
116 * check that it looks like a valid closure - without checking its payload
117 * used to avoid recursion between checking PAPs and checking stack
122 checkClosureShallow( StgClosure* p )
124 ASSERT(LOOKS_LIKE_GHC_INFO(p->header.info));
126 /* Is it a static closure (i.e. in the data segment)? */
127 if (LOOKS_LIKE_STATIC(p)) {
128 ASSERT(closure_STATIC(p));
130 ASSERT(!closure_STATIC(p));
131 ASSERT(LOOKS_LIKE_PTR(p));
135 /* check an individual stack object */
137 checkStackObject( StgPtr sp )
139 if (IS_ARG_TAG(*sp)) {
140 /* Tagged words might be "stubbed" pointers, so there's no
141 * point checking to see whether they look like pointers or
142 * not (some of them will).
144 return ARG_SIZE(*sp) + 1;
145 } else if (LOOKS_LIKE_GHC_INFO(*stgCast(StgPtr*,sp))) {
146 return checkStackClosure(stgCast(StgClosure*,sp));
147 } else { /* must be an untagged closure pointer in the stack */
148 checkClosureShallow(*stgCast(StgClosure**,sp));
153 /* check sections of stack between update frames */
155 checkStackChunk( StgPtr sp, StgPtr stack_end )
160 while (p < stack_end) {
161 p += checkStackObject( p );
163 ASSERT( p == stack_end );
167 checkClosure( StgClosure* p )
169 const StgInfoTable *info;
172 ASSERT(LOOKS_LIKE_GHC_INFO(p->header.info));
175 /* Is it a static closure (i.e. in the data segment)? */
176 if (LOOKS_LIKE_STATIC(p)) {
177 ASSERT(closure_STATIC(p));
179 ASSERT(!closure_STATIC(p));
180 ASSERT(LOOKS_LIKE_PTR(p));
184 switch (info->type) {
187 StgBCO* bco = stgCast(StgBCO*,p);
189 for(i=0; i < bco->n_ptrs; ++i) {
190 ASSERT(LOOKS_LIKE_PTR(bcoConstPtr(bco,i)));
192 return bco_sizeW(bco);
197 StgMVar *mvar = (StgMVar *)p;
198 ASSERT(LOOKS_LIKE_PTR(mvar->head));
199 ASSERT(LOOKS_LIKE_PTR(mvar->tail));
200 ASSERT(LOOKS_LIKE_PTR(mvar->value));
201 return sizeofW(StgMVar);
212 for (i = 0; i < info->layout.payload.ptrs; i++) {
213 ASSERT(LOOKS_LIKE_PTR(payloadPtr(p,i)));
215 return stg_max(sizeW_fromITBL(info), sizeofW(StgHeader) + MIN_UPD_SIZE);
232 case IND_OLDGEN_PERM:
242 case CONSTR_CHARLIKE:
244 case CONSTR_NOCAF_STATIC:
250 for (i = 0; i < info->layout.payload.ptrs; i++) {
251 ASSERT(LOOKS_LIKE_PTR(payloadPtr(p,i)));
253 return sizeW_fromITBL(info);
257 /* deal with these specially - the info table isn't
258 * representative of the actual layout.
260 { StgWeak *w = (StgWeak *)p;
261 ASSERT(LOOKS_LIKE_PTR(w->key));
262 ASSERT(LOOKS_LIKE_PTR(w->value));
263 ASSERT(LOOKS_LIKE_PTR(w->finalizer));
265 ASSERT(LOOKS_LIKE_PTR(w->link));
267 return sizeW_fromITBL(info);
271 ASSERT(LOOKS_LIKE_PTR(stgCast(StgSelector*,p)->selectee));
272 return sizeofW(StgHeader) + MIN_UPD_SIZE;
276 /* we don't expect to see any of these after GC
277 * but they might appear during execution
280 StgInd *ind = stgCast(StgInd*,p);
281 ASSERT(LOOKS_LIKE_PTR(ind->indirectee));
282 q = (P_)p + sizeofW(StgInd);
283 while (!*q) { q++; }; /* skip padding words (see GC.c: evacuate())*/
297 barf("checkClosure: stack frame");
299 case AP_UPD: /* we can treat this as being the same as a PAP */
302 StgPAP *pap = stgCast(StgPAP*,p);
303 ASSERT(LOOKS_LIKE_PTR(pap->fun));
304 checkStackChunk((StgPtr)pap->payload,
305 (StgPtr)pap->payload + pap->n_args
307 return pap_sizeW(pap);
311 return arr_words_sizeW(stgCast(StgArrWords*,p));
314 case MUT_ARR_PTRS_FROZEN:
316 StgMutArrPtrs* a = stgCast(StgMutArrPtrs*,p);
318 for (i = 0; i < a->ptrs; i++) {
319 ASSERT(LOOKS_LIKE_PTR(a->payload[i]));
321 return mut_arr_ptrs_sizeW(a);
325 checkTSO((StgTSO *)p);
326 return tso_sizeW((StgTSO *)p);
331 barf("checkClosure: unimplemented/strange closure type");
333 barf("checkClosure");
335 #undef LOOKS_LIKE_PTR
338 /* -----------------------------------------------------------------------------
341 After garbage collection, the live heap is in a state where we can
342 run through and check that all the pointers point to the right
343 place. This function starts at a given position and sanity-checks
344 all the objects in the remainder of the chain.
345 -------------------------------------------------------------------------- */
348 checkHeap(bdescr *bd, StgPtr start)
359 while (p < bd->free) {
360 nat size = checkClosure(stgCast(StgClosure*,p));
361 /* This is the smallest size of closure that can live in the heap. */
362 ASSERT( size >= MIN_NONUPD_SIZE + sizeofW(StgHeader) );
366 while (p < bd->free &&
367 (*p == 0 || !LOOKS_LIKE_GHC_INFO((void*)*p))) { p++; }
377 checkChain(bdescr *bd)
380 checkClosure((StgClosure *)bd->start);
385 /* check stack - making sure that update frames are linked correctly */
387 checkStack(StgPtr sp, StgPtr stack_end, StgUpdateFrame* su )
389 /* check everything down to the first update frame */
390 checkStackChunk( sp, stgCast(StgPtr,su) );
391 while ( stgCast(StgPtr,su) < stack_end) {
392 sp = stgCast(StgPtr,su);
393 switch (get_itbl(su)->type) {
398 su = stgCast(StgSeqFrame*,su)->link;
401 su = stgCast(StgCatchFrame*,su)->link;
404 /* not quite: ASSERT(stgCast(StgPtr,su) == stack_end); */
407 barf("checkStack: weird record found on update frame list.");
409 checkStackChunk( sp, stgCast(StgPtr,su) );
411 ASSERT(stgCast(StgPtr,su) == stack_end);
415 checkTSO(StgTSO *tso)
418 StgPtr stack = tso->stack;
419 StgUpdateFrame* su = tso->su;
420 StgOffset stack_size = tso->stack_size;
421 StgPtr stack_end = stack + stack_size;
423 if (tso->whatNext == ThreadComplete || tso->whatNext == ThreadKilled) {
424 /* The garbage collector doesn't bother following any pointers
425 * from dead threads, so don't check sanity here.
430 ASSERT(stack <= sp && sp < stack_end);
431 ASSERT(sp <= stgCast(StgPtr,su));
433 checkStack(sp, stack_end, su);
436 /* -----------------------------------------------------------------------------
437 Check Blackhole Sanity
439 Test whether an object is already on the update list.
440 It isn't necessarily an rts error if it is - it might be a programming
443 Future versions might be able to test for a blackhole without traversing
444 the update frame list.
446 -------------------------------------------------------------------------- */
447 rtsBool isBlackhole( StgTSO* tso, StgClosure* p )
449 StgUpdateFrame* su = tso->su;
451 switch (get_itbl(su)->type) {
453 if (su->updatee == p) {
460 su = stgCast(StgSeqFrame*,su)->link;
463 su = stgCast(StgCatchFrame*,su)->link;
468 barf("isBlackhole: weird record found on update frame list.");