2 Time-stamp: <Fri Jan 14 2000 13:52:00 Stardate: [-30]4202.88 hwloidl>
4 Various debugging routines for GranSim and GUM
7 #if defined(GRAN) || defined(PAR) /* whole file */
9 //@node Debugging routines for GranSim and GUM, , ,
10 //@section Debugging routines for GranSim and GUM
14 //* Constants and Variables::
21 //* Printing info type::
22 //* Printing Pack:et Contents::
27 //@node Includes, Prototypes, Debugging routines for GranSim and GUM, Debugging routines for GranSim and GUM
28 //@subsection Includes
32 #include "GranSimRts.h"
33 #include "ParallelRts.h"
34 #include "StgMiscClosures.h"
37 # include "ParallelDebug.h"
40 //@node Prototypes, Constants and Variables, Includes, Debugging routines for GranSim and GUM
41 //@subsection Prototypes
43 rtsBool isOffset(globalAddr *ga);
44 rtsBool isFixed(globalAddr *ga);
46 //@node Constants and Variables, Closures, Prototypes, Debugging routines for GranSim and GUM
47 //@subsection Constants and Variables
49 #if defined(GRAN) && defined(GRAN_CHECK)
50 //@node Closures, Threads, Constants and Variables, Debugging routines for GranSim and GUM
51 //@subsection Closures
57 StgInfoTable *info_ptr;
59 nat size = 0, ptrs = 0, nonptrs = 0, i, vhs = 0;
60 char info_hdr_ty[80], info_ty[80];
63 fprintf(stderr,"NULL\n");
65 } else if (node==END_TSO_QUEUE) {
66 fprintf(stderr,"END_TSO_QUEUE\n");
69 /* size_and_ptrs(node,&size,&ptrs); */
70 info_ptr = get_closure_info(node, &size, &ptrs, &nonptrs, &vhs, info_hdr_ty);
72 /* vhs = var_hdr_size(node); */
73 display_info_type(info_ptr,info_ty);
75 fprintf(stderr,"Node: 0x%lx", node);
78 fprintf(stderr," [GA: 0x%lx]",GA(node));
81 #if defined(USE_COST_CENTRES)
82 fprintf(stderr," [CC: 0x%lx]",CC_HDR(node));
86 fprintf(stderr," [Bitmask: 0%lo]",PROCS(node));
89 if (info_ptr->type==TSO)
90 fprintf(stderr," TSO: 0x%lx (%x) IP: 0x%lx (%s), type %s \n ",
91 (StgTSO*)node, ((StgTSO*)node)->id, info_ptr, info_hdr_ty, info_ty);
93 fprintf(stderr," IP: 0x%lx (%s), type %s \n VHS: %d, size: %ld, ptrs:%ld, nonptrs: %ld\n ",
94 info_ptr,info_hdr_ty,info_ty,vhs,size,ptrs,nonptrs);
96 /* For now, we ignore the variable header */
98 fprintf(stderr," Ptrs: ");
99 for(i=0; i < ptrs; ++i)
102 fprintf(stderr,"\n ");
103 fprintf(stderr," 0x%lx[P]",node->payload[i]);
106 fprintf(stderr," Data: ");
107 for(i=0; i < nonptrs; ++i)
110 fprintf(stderr,"\n ");
111 fprintf(stderr," %lu[D]",node->payload[ptrs+i]);
113 fprintf(stderr, "\n");
116 switch (info_ptr->type)
119 fprintf(stderr,"\n TSO_LINK: %#lx",
120 ((StgTSO*)node)->link);
125 bqe = ((StgBlockingQueue*)node)->blocking_queue;
126 fprintf(stderr," BQ of %#lx: ", node);
131 printf("Panic: found FETCH_ME or FETCH_ME_BQ Infotable in GrAnSim system.\n");
139 G_PPN(node) /* Extracted from PrintPacket in Pack.lc */
143 nat size = 0, ptrs = 0, nonptrs = 0, i, vhs = 0, locn = 0;
146 /* size_and_ptrs(node,&size,&ptrs); */
147 info = get_closure_info(node, &size, &ptrs, &nonptrs, &vhs, info_type);
149 if (info->type == FETCH_ME || info->type == FETCH_ME_BQ ||
150 info->type == BLACKHOLE || info->type == RBH )
151 size = ptrs = nonptrs = vhs = 0;
153 if (closure_THUNK(node)) {
154 if (!closure_UNPOINTED(node))
155 fputs("SHARED ", stderr);
157 fputs("UNSHARED ", stderr);
159 if (info->type==BLACKHOLE) {
160 fputs("BLACK HOLE\n", stderr);
163 fprintf(stderr, "(%s) FH [%#lx", info_type, node[locn++]);
164 for (i = 1; i < FIXED_HS; i++)
165 fprintf(stderr, " %#lx", node[locn++]);
167 /* Variable header */
169 fprintf(stderr, "] VH [%#lx", node->payload[0]);
171 for (i = 1; i < vhs; i++)
172 fprintf(stderr, " %#lx", node->payload[i]);
175 fprintf(stderr, "] PTRS %u", ptrs);
179 fprintf(stderr, " NPTRS [%#lx", node->payload[ptrs]);
181 for (i = 1; i < nonptrs; i++)
182 fprintf(stderr, " %#lx", node->payload[ptrs+i]);
192 // ToDo: fix this!! -- HWL
197 StgInfoTable *info_ptr;
198 nat size = 0, ptrs = 0, nonptrs = 0, vhs = 0;
199 char info_type[80], hdr_type[80];
201 info_hdr_type(info_ptr, hdr_type);
204 info_ptr = get_closure_info(node, &size, &ptrs, &nonptrs, &vhs, info_type);
205 fprintf(stderr,"%s Info Ptr @0x%lx; Entry: 0x%lx; Size: %lu; Ptrs: %lu\n\n",
206 info_type,info_ptr,(W_) ENTRY_CODE(info_ptr),
208 // INFO_SIZE(info_ptr),INFO_NoPTRS(info_ptr));
210 if (closure_THUNK(node) && !closure_UNPOINTED(node) ) {
211 fprintf(stderr," RBH InfoPtr: %#lx\n",
212 RBH_INFOPTR(info_ptr));
216 fprintf(stderr,"Enter Flush Entry: 0x%lx;\tExit Flush Entry: 0x%lx\n",INFO_FLUSHENT(info_ptr),INFO_FLUSH(info_ptr));
219 #if defined(USE_COST_CENTRES)
220 fprintf(stderr,"Cost Centre (???): 0x%lx\n",INFO_CAT(info_ptr));
223 #if defined(_INFO_COPYING)
224 fprintf(stderr,"Evacuate Entry: 0x%lx;\tScavenge Entry: 0x%lx\n",
225 INFO_EVAC_2S(info_ptr),INFO_SCAV_2S(info_ptr));
228 #if defined(_INFO_COMPACTING)
229 fprintf(stderr,"Scan Link: 0x%lx;\tScan Move: 0x%lx\n",
230 (W_) INFO_SCAN_LINK_1S(info_ptr), (W_) INFO_SCAN_MOVE_1S(info_ptr));
231 fprintf(stderr,"Mark: 0x%lx;\tMarked: 0x%lx;\t",
232 (W_) INFO_MARK_1S(info_ptr), (W_) INFO_MARKED_1S(info_ptr));
233 #if 0 /* avoid INFO_TYPE */
234 if(BASE_INFO_TYPE(info_ptr)==INFO_SPEC_TYPE)
235 fprintf(stderr,"plus specialised code\n");
237 fprintf(stderr,"Marking: 0x%lx\n",(W_) INFO_MARKING_1S(info_ptr));
239 #endif /* _INFO_COMPACTING */
250 char str[80], str0[80];
252 fprintf(stderr,"\n[PE %d] @ %lu BQ: ",
253 CurrentProc,CurrentTime[CurrentProc]);
254 if ( node == (StgClosure*)NULL ) {
255 fprintf(stderr," NULL.\n");
258 if ( node == END_TSO_QUEUE ) {
259 fprintf(stderr," _|_\n");
262 tso = ((StgBlockingQueue*)node)->blocking_queue;
263 while (node != END_TSO_QUEUE) {
266 /* Find where the tso lives */
267 proc = where_is(node);
268 info = get_itbl(node);
270 switch (info->type) {
275 strcpy(str0,"BLOCKED_FETCH");
282 if(proc == CurrentProc)
283 fprintf(stderr," %#lx (%x) L %s,",
284 node, ((StgBlockingQueue*)node)->blocking_queue, str0);
286 fprintf(stderr," %#lx (%x) G (PE %d) %s,",
287 node, ((StgBlockingQueue*)node)->blocking_queue, proc, str0);
292 if ( tso == END_TSO_QUEUE )
293 fprintf(stderr," _|_\n");
296 //@node Threads, Events, Closures, Debugging routines for GranSim and GUM
297 //@subsection Threads
300 G_CURR_THREADQ(verbose)
303 fprintf(stderr,"Thread Queue on proc %d: ", CurrentProc);
304 G_THREADQ(run_queue_hd, verbose);
308 G_THREADQ(closure, verbose)
314 fprintf(stderr,"Thread Queue: ");
315 for (x=closure; x!=END_TSO_QUEUE; x=x->link)
319 fprintf(stderr," %#lx",x);
321 if (closure==END_TSO_QUEUE)
322 fprintf(stderr,"NIL\n");
324 fprintf(stderr,"\n");
328 G_TSO(closure,verbose)
333 if (closure==END_TSO_QUEUE) {
334 fprintf(stderr,"TSO at %#lx is END_TSO_QUEUE!\n");
338 if ( verbose & 0x08 ) { /* short info */
339 fprintf(stderr,"[TSO @ %#lx, PE %d]: Id: %#lx, Link: %#lx\n",
340 closure,where_is(closure),
341 closure->id,closure->link);
345 fprintf(stderr,"TSO at %#lx has the following contents:\n",
348 fprintf(stderr,"> Id: \t%#lx",closure->id);
349 // fprintf(stderr,"\tstate: \t%#lx",closure->state);
350 fprintf(stderr,"\twhatNext: \t%#lx",closure->whatNext);
351 fprintf(stderr,"\tlink: \t%#lx\n",closure->link);
352 // fprintf(stderr,"\tType: \t%s\n",type_name[TSO_TYPE(closure)]);
353 fprintf(stderr,">PRI: \t%#lx", closure->gran.pri);
354 fprintf(stderr,"\tMAGIC: \t%#lx %s\n", closure->gran.magic,
355 (closure->gran.magic==TSO_MAGIC ? "it IS a TSO" : "THIS IS NO TSO!!"));
356 if ( verbose & 0x04 ) {
357 fprintf(stderr, "Stack: stack @ %#lx (stack_size: %u; max_stack_size: %u)\n",
358 closure->stack, closure->stack_size, closure->max_stack_size);
359 fprintf(stderr, " sp: %#lx, su: %#lx, splim: %#lx\n",
360 closure->sp, closure->su, closure->splim);
362 // fprintf(stderr,"\n");
363 if (verbose & 0x01) {
364 // fprintf(stderr,"} LOCKED: \t%#lx",closure->locked);
365 fprintf(stderr,"} SPARKNAME: \t%#lx\n", closure->gran.sparkname);
366 fprintf(stderr,"} STARTEDAT: \t%#lx", closure->gran.startedat);
367 fprintf(stderr,"\tEXPORTED: \t%#lx\n", closure->gran.exported);
368 fprintf(stderr,"} BASICBLOCKS: \t%#lx", closure->gran.basicblocks);
369 fprintf(stderr,"\tALLOCS: \t%#lx\n", closure->gran.allocs);
370 fprintf(stderr,"} EXECTIME: \t%#lx", closure->gran.exectime);
371 fprintf(stderr,"\tFETCHTIME: \t%#lx\n", closure->gran.fetchtime);
372 fprintf(stderr,"} FETCHCOUNT: \t%#lx", closure->gran.fetchcount);
373 fprintf(stderr,"\tBLOCKTIME: \t%#lx\n", closure->gran.blocktime);
374 fprintf(stderr,"} BLOCKCOUNT: \t%#lx", closure->gran.blockcount);
375 fprintf(stderr,"\tBLOCKEDAT: \t%#lx\n", closure->gran.blockedat);
376 fprintf(stderr,"} GLOBALSPARKS:\t%#lx", closure->gran.globalsparks);
377 fprintf(stderr,"\tLOCALSPARKS:\t%#lx\n", closure->gran.localsparks);
379 if ( verbose & 0x02 ) {
380 fprintf(stderr,"BQ that starts with this TSO: ");
385 //@node Events, Sparks, Threads, Debugging routines for GranSim and GUM
389 G_EVENT(event, verbose)
396 fprintf(stderr," %#lx",event);
404 extern rtsEventQ EventHd;
407 fprintf(stderr,"RtsEventQ (hd @%#lx):\n",EventHd);
408 for (x=EventHd; x!=NULL; x=x->next) {
412 fprintf(stderr,"NIL\n");
414 fprintf(stderr,"\n");
422 extern rtsEventQ EventHd;
425 fprintf(stderr,"RtsEventQ (hd @%#lx):\n",EventHd);
426 for (x=EventHd; x!=NULL; x=x->next) {
431 fprintf(stderr,"NIL\n");
433 fprintf(stderr,"\n");
436 //@node Sparks, Processors, Events, Debugging routines for GranSim and GUM
440 G_SPARK(spark, verbose)
444 if (spark==(rtsSpark*)NULL) {
445 belch("G_SPARK: NULL spark; aborting");
451 fprintf(stderr," %#lx",spark);
455 G_SPARKQ(spark,verbose)
461 if (spark==(rtsSpark*)NULL) {
462 belch("G_SPARKQ: NULL spark; aborting");
466 fprintf(stderr,"RtsSparkQ (hd @%#lx):\n",spark);
467 for (x=spark; x!=NULL; x=x->next) {
471 fprintf(stderr,"NIL\n");
473 fprintf(stderr,"\n");
477 G_CURR_SPARKQ(verbose)
480 G_SPARKQ(pending_sparks_hd,verbose);
483 //@node Processors, Shortcuts, Sparks, Debugging routines for GranSim and GUM
484 //@subsection Processors
491 extern rtsEventQ EventHd;
492 extern char *proc_status_names[];
494 fprintf(stderr,"Status of proc %d at time %d (%#lx): %s (%s)\n",
495 proc,CurrentTime[proc],CurrentTime[proc],
496 (CurrentProc==proc)?"ACTIVE":"INACTIVE",
497 proc_status_names[procStatus[proc]]);
498 G_THREADQ(run_queue_hds[proc],verbose & 0x2);
499 if ( (CurrentProc==proc) )
503 fprintf(stderr,"Next event (%s) is on proc %d\n",
504 event_names[EventHd->evttype],EventHd->proc);
507 fprintf(stderr,"\nREQUIRED sparks: ");
508 G_SPARKQ(pending_sparks_hds[proc],1);
509 fprintf(stderr,"\nADVISORY_sparks: ");
510 G_SPARKQ(pending_sparks_hds[proc],1);
514 //@node Shortcuts, Printing info type, Processors, Debugging routines for GranSim and GUM
515 //@subsection Shortcuts
517 /* Debug Processor */
524 /* Debug Current Processor */
526 GCP(){ G_PROC(CurrentProc,2); }
534 /* Debug CurrentTSO */
537 fprintf(stderr,"Current Proc: %d\n",CurrentProc);
541 /* Shorthand for debugging event queue */
543 GEQ() { G_EVENTQ(1); }
545 /* Shorthand for debugging thread queue of a processor */
547 GTQ(PEs p) { G_THREADQ(run_queue_hds[p],1); }
549 /* Shorthand for debugging thread queue of current processor */
551 GCTQ() { G_THREADQ(run_queue_hds[CurrentProc],1); }
553 /* Shorthand for debugging spark queue of a processor */
555 GSQ(PEs p) { G_SPARKQ(pending_sparks_hds[p],1); }
557 /* Shorthand for debugging spark queue of current processor */
559 GCSQ() { G_CURR_SPARKQ(1); }
561 /* Shorthand for printing a node */
563 GN(StgPtr node) { G_PRINT_NODE(node); }
565 /* Shorthand for printing info table */
569 GIT(StgPtr node) { G_INFO_TABLE(node); }
573 printThreadQPtrs(void)
576 for (p=0; p<RtsFlags.GranFlags.proc; p++) {
577 fprintf(stderr,", PE %d: (hd=%p,tl=%p)",
578 run_queue_hds[p], run_queue_tls[p]);
583 printThreadQ(StgTSO *tso) { G_THREADQ(tso, 0); };
586 printSparkQ(rtsSpark *spark) { G_SPARKQ(spark, 0); };
589 printThreadQ_verbose(StgTSO *tso) { G_THREADQ(tso, 1); };
592 printSparkQ_verbose(rtsSpark *spark) { G_SPARKQ(spark, 1); };
594 /* Shorthand for some of ADRs debugging functions */
596 #endif /* GRAN && GRAN_CHECK*/
600 DEBUG_PRINT_NODE(node)
603 W_ info_ptr = INFO_PTR(node);
604 StgInt size = 0, ptrs = 0, i, vhs = 0;
607 info_hdr_type(info_ptr, info_type);
609 size_and_ptrs(node,&size,&ptrs);
610 vhs = var_hdr_size(node);
612 fprintf(stderr,"Node: 0x%lx", (W_) node);
615 fprintf(stderr," [GA: 0x%lx]",GA(node));
618 #if defined(PROFILING)
619 fprintf(stderr," [CC: 0x%lx]",CC_HDR(node));
623 fprintf(stderr," [Bitmask: 0%lo]",PROCS(node));
626 fprintf(stderr," IP: 0x%lx (%s), size %ld, %ld ptrs\n",
627 info_ptr,info_type,size,ptrs);
629 /* For now, we ignore the variable header */
631 for(i=0; i < size; ++i)
634 fprintf(stderr,"Data: ");
637 fprintf(stderr,"\n ");
640 fprintf(stderr," 0x%lx[P]",*(node+_FHS+vhs+i));
642 fprintf(stderr," %lu[D]",*(node+_FHS+vhs+i));
644 fprintf(stderr, "\n");
648 #define INFO_MASK 0x80000000
654 W_ size = 0, ptrs = 0, i, vhs = 0;
656 /* Don't print cycles */
657 if((INFO_PTR(node) & INFO_MASK) != 0)
660 size_and_ptrs(node,&size,&ptrs);
661 vhs = var_hdr_size(node);
663 DEBUG_PRINT_NODE(node);
664 fprintf(stderr, "\n");
666 /* Mark the node -- may be dangerous */
667 INFO_PTR(node) |= INFO_MASK;
669 for(i = 0; i < ptrs; ++i)
670 DEBUG_TREE((StgPtr)node[i+vhs+_FHS]);
672 /* Unmark the node */
673 INFO_PTR(node) &= ~INFO_MASK;
678 DEBUG_INFO_TABLE(node)
681 W_ info_ptr = INFO_PTR(node);
682 char *iStgPtrtype = info_hdr_type(info_ptr);
684 fprintf(stderr,"%s Info Ptr @0x%lx; Entry: 0x%lx; Size: %lu; Ptrs: %lu\n\n",
685 iStgPtrtype,info_ptr,(W_) ENTRY_CODE(info_ptr),INFO_SIZE(info_ptr),INFO_NoPTRS(info_ptr));
687 fprintf(stderr,"Enter Flush Entry: 0x%lx;\tExit Flush Entry: 0x%lx\n",INFO_FLUSHENT(info_ptr),INFO_FLUSH(info_ptr));
690 #if defined(PROFILING)
691 fprintf(stderr,"Cost Centre (???): 0x%lx\n",INFO_CAT(info_ptr));
694 #if defined(_INFO_COPYING)
695 fprintf(stderr,"Evacuate Entry: 0x%lx;\tScavenge Entry: 0x%lx\n",
696 INFO_EVAC_2S(info_ptr),INFO_SCAV_2S(info_ptr));
699 #if defined(_INFO_COMPACTING)
700 fprintf(stderr,"Scan Link: 0x%lx;\tScan Move: 0x%lx\n",
701 (W_) INFO_SCAN_LINK_1S(info_ptr), (W_) INFO_SCAN_MOVE_1S(info_ptr));
702 fprintf(stderr,"Mark: 0x%lx;\tMarked: 0x%lx;\t",
703 (W_) INFO_MARK_1S(info_ptr), (W_) INFO_MARKED_1S(info_ptr));
704 #if 0 /* avoid INFO_TYPE */
705 if(BASE_INFO_TYPE(info_ptr)==INFO_SPEC_TYPE)
706 fprintf(stderr,"plus specialised code\n");
708 fprintf(stderr,"Marking: 0x%lx\n",(W_) INFO_MARKING_1S(info_ptr));
710 #endif /* _INFO_COMPACTING */
714 //@node Printing info type, Printing Packet Contents, Shortcuts, Debugging routines for GranSim and GUM
715 //@subsection Printing info type
718 display_info_type(closure, str)
723 if ( closure_HNF(closure) )
724 strcat(str,"|_HNF ");
725 else if ( closure_BITMAP(closure) )
727 else if ( !closure_SHOULD_SPARK(closure) )
729 else if ( closure_STATIC(closure) )
731 else if ( closure_THUNK(closure) )
733 else if ( closure_MUTABLE(closure) )
735 else if ( closure_UNPOINTED(closure) )
737 else if ( closure_SRT(closure) )
744 PrintPacket is in Pack.c because it makes use of closure queues
747 #if defined(GRAN) || defined(PAR)
750 Print graph rooted at q. The structure of this recursive printing routine
751 should be the same as in the graph traversals when packing a graph in
752 GUM. Thus, it demonstrates the structure of such a generic graph
753 traversal, and in particular, how to extract pointer and non-pointer info
754 from the multitude of different heap objects available.
756 {evacuate}Daq ngoqvam nIHlu'pu'!!
760 PrintGraph(StgClosure *p, int indent_level)
763 rtsBool printed = rtsFalse;
765 const StgInfoTable *info;
767 q = p; /* save ptr to object */
770 for (j=0; j<indent_level; j++)
773 ASSERT(p && (LOOKS_LIKE_GHC_INFO(GET_INFO((StgClosure *)p))
774 || IS_HUGS_CONSTR_INFO(GET_INFO((StgClosure *)p))));
776 printClosure(p); // prints contents of this one closure
779 for (j=0; j<indent_level; j++)
782 info = get_itbl((StgClosure *)p);
783 /* the rest of this fct recursively traverses the graph */
784 switch (info -> type) {
788 StgBCO* bco = stgCast(StgBCO*,p);
790 fprintf(stderr, "BCO (%p) with %d pointers\n", p, bco->n_ptrs);
791 for (i = 0; i < bco->n_ptrs; i++) {
792 // bcoConstCPtr(bco,i) =
793 PrintGraph(bcoConstCPtr(bco,i), indent_level+1);
795 // p += bco_sizeW(bco);
800 /* treat MVars specially, because we don't want to PrintGraph the
801 * mut_link field in the middle of the closure.
804 StgMVar *mvar = ((StgMVar *)p);
806 fprintf(stderr, "MVAR (%p) with 3 pointers (head, tail, value)\n", p);
807 // (StgClosure *)mvar->head =
808 PrintGraph((StgClosure *)mvar->head, indent_level+1);
809 // (StgClosure *)mvar->tail =
810 PrintGraph((StgClosure *)mvar->tail, indent_level+1);
811 //(StgClosure *)mvar->value =
812 PrintGraph((StgClosure *)mvar->value, indent_level+1);
813 // p += sizeofW(StgMVar);
814 // evac_gen = saved_evac_gen;
820 fprintf(stderr, "THUNK_2_0 (%p) with 2 pointers\n", p);
825 fprintf(stderr, "FUN_2_0 (%p) with 2 pointers\n", p);
828 // scavenge_srt(info);
831 fprintf(stderr, "CONSTR_2_0 (%p) with 2 pointers\n", p);
834 // ((StgClosure *)p)->payload[0] =
835 PrintGraph(((StgClosure *)p)->payload[0],
837 // ((StgClosure *)p)->payload[1] =
838 PrintGraph(((StgClosure *)p)->payload[1],
840 // p += sizeofW(StgHeader) + 2;
844 // scavenge_srt(info);
845 fprintf(stderr, "THUNK_1_0 (%p) with 1 pointer\n", p);
846 // ((StgClosure *)p)->payload[0] =
847 PrintGraph(((StgClosure *)p)->payload[0],
849 // p += sizeofW(StgHeader) + 2; /* MIN_UPD_SIZE */
854 fprintf(stderr, "FUN_1_0 (%p) with 1 pointer\n", p);
857 // scavenge_srt(info);
860 fprintf(stderr, "CONSTR_2_0 (%p) with 2 pointers\n", p);
863 // ((StgClosure *)p)->payload[0] =
864 PrintGraph(((StgClosure *)p)->payload[0],
866 // p += sizeofW(StgHeader) + 1;
870 fprintf(stderr, "THUNK_0_1 (%p) with 0 pointers\n", p);
871 // scavenge_srt(info);
872 // p += sizeofW(StgHeader) + 2; /* MIN_UPD_SIZE */
876 fprintf(stderr, "FUN_0_1 (%p) with 0 pointers\n", p);
877 //scavenge_srt(info);
879 fprintf(stderr, "CONSTR_0_1 (%p) with 0 pointers\n", p);
880 //p += sizeofW(StgHeader) + 1;
885 fprintf(stderr, "THUNK_0_2 (%p) with 0 pointers\n", p);
890 fprintf(stderr, "FUN_0_2 (%p) with 0 pointers\n", p);
893 // scavenge_srt(info);
896 fprintf(stderr, "CONSTR_0_2 (%p) with 0 pointers\n", p);
899 // p += sizeofW(StgHeader) + 2;
904 fprintf(stderr, "THUNK_1_1 (%p) with 1 pointer\n", p);
909 fprintf(stderr, "FUN_1_1 (%p) with 1 pointer\n", p);
912 // scavenge_srt(info);
915 fprintf(stderr, "CONSTR_1_1 (%p) with 1 pointer\n", p);
918 // ((StgClosure *)p)->payload[0] =
919 PrintGraph(((StgClosure *)p)->payload[0],
921 // p += sizeofW(StgHeader) + 2;
926 fprintf(stderr, "FUN (%p) with %d pointers\n", p, info->layout.payload.ptrs);
933 fprintf(stderr, "THUNK (%p) with %d pointers\n", p, info->layout.payload.ptrs);
936 // scavenge_srt(info);
941 fprintf(stderr, "CONSTR (%p) with %d pointers\n", p, info->layout.payload.ptrs);
944 /* basically same as loop in STABLE_NAME case */
945 for (i=0; i<info->layout.payload.ptrs; i++)
946 PrintGraph(((StgClosure *)p)->payload[i],
949 /* NOT fall through */
953 fprintf(stderr, "WEAK (%p) with %d pointers\n", p, info->layout.payload.ptrs);
960 fprintf(stderr, "FOREIGN (%p) with %d pointers\n", p, info->layout.payload.ptrs);
970 fprintf(stderr, "STABLE_NAME (%p) with %d pointers (not followed!)\n",
971 p, info->layout.payload.ptrs);
974 end = (StgPtr)((StgClosure *)p)->payload + info->layout.payload.ptrs;
975 for (p = (StgPtr)((StgClosure *)p)->payload; p < end; p++) {
976 // (StgClosure *)*p =
977 //PrintGraph((StgClosure *)*p, indent_level+1);
978 fprintf(stderr, ", %p", *p);
980 //fputs("\n", stderr);
981 // p += info->layout.payload.nptrs;
986 //if (step->gen->no != 0) {
987 // SET_INFO(((StgClosure *)p), &IND_OLDGEN_PERM_info);
990 fprintf(stderr, "IND_PERM (%p) with indirection to\n",
991 p, ((StgIndOldGen *)p)->indirectee);
996 case IND_OLDGEN_PERM:
998 fprintf(stderr, "IND_OLDGEN_PERM (%p) with indirection to %p\n",
999 p, ((StgIndOldGen *)p)->indirectee);
1002 // ((StgIndOldGen *)p)->indirectee =
1003 PrintGraph(((StgIndOldGen *)p)->indirectee,
1005 //if (failed_to_evac) {
1006 // failed_to_evac = rtsFalse;
1007 // recordOldToNewPtrs((StgMutClosure *)p);
1009 // p += sizeofW(StgIndOldGen);
1014 StgCAF *caf = (StgCAF *)p;
1016 fprintf(stderr, "CAF_UNENTERED (%p) pointing to %p\n", p, caf->body);
1017 PrintGraph(caf->body, indent_level+1);
1018 //if (failed_to_evac) {
1019 // failed_to_evac = rtsFalse;
1020 // recordOldToNewPtrs((StgMutClosure *)p);
1022 // caf->mut_link = NULL;
1024 //p += sizeofW(StgCAF);
1030 StgCAF *caf = (StgCAF *)p;
1032 fprintf(stderr, "CAF_ENTERED (%p) pointing to %p and %p\n",
1033 p, caf->body, caf->value);
1035 PrintGraph(caf->body, indent_level+1);
1037 PrintGraph(caf->value, indent_level+1);
1038 //if (failed_to_evac) {
1039 // failed_to_evac = rtsFalse;
1040 // recordOldToNewPtrs((StgMutClosure *)p);
1042 // caf->mut_link = NULL;
1044 //p += sizeofW(StgCAF);
1049 /* ignore MUT_CONSs */
1050 fprintf(stderr, "MUT_VAR (%p) pointing to %p\n", p, ((StgMutVar *)p)->var);
1051 if (((StgMutVar *)p)->header.info != &MUT_CONS_info) {
1053 PrintGraph(((StgMutVar *)p)->var, indent_level+1);
1054 //evac_gen = saved_evac_gen;
1056 //p += sizeofW(StgMutVar);
1061 fprintf(stderr, "CAF_BLACKHOLE (%p) with 0 pointers\n", p);
1064 case SE_CAF_BLACKHOLE:
1066 fprintf(stderr, "SE_CAF_BLACKHOLE (%p) with 0 pointers\n", p);
1071 fprintf(stderr, "SE_BLACKHOLE (%p) with 0 pointers\n", p);
1076 fprintf(stderr, "BLACKHOLE (%p) with 0 pointers\n", p);
1079 //p += BLACKHOLE_sizeW();
1084 StgBlockingQueue *bh = (StgBlockingQueue *)p;
1085 // (StgClosure *)bh->blocking_queue =
1086 fprintf(stderr, "BLACKHOLE_BQ (%p) pointing to %p\n",
1087 p, (StgClosure *)bh->blocking_queue);
1088 PrintGraph((StgClosure *)bh->blocking_queue, indent_level+1);
1089 //if (failed_to_evac) {
1090 // failed_to_evac = rtsFalse;
1091 // recordMutable((StgMutClosure *)bh);
1093 // p += BLACKHOLE_sizeW();
1097 case THUNK_SELECTOR:
1099 StgSelector *s = (StgSelector *)p;
1100 fprintf(stderr, "THUNK_SELECTOR (%p) pointing to %p\n",
1102 PrintGraph(s->selectee, indent_level+1);
1103 // p += THUNK_SELECTOR_sizeW();
1108 fprintf(stderr, "IND (%p) pointing to %p\n", p, ((StgInd*)p)->indirectee);
1109 PrintGraph(((StgInd*)p)->indirectee, indent_level+1);
1113 fprintf(stderr, "IND_OLDGEN (%p) pointing to %p\n",
1114 p, ((StgIndOldGen*)p)->indirectee);
1115 PrintGraph(((StgIndOldGen*)p)->indirectee, indent_level+1);
1118 case CONSTR_INTLIKE:
1119 fprintf(stderr, "CONSTR_INTLIKE (%p) with 0 pointers\n", p);
1121 case CONSTR_CHARLIKE:
1122 fprintf(stderr, "CONSTR_CHARLIKE (%p) with 0 pointers\n", p);
1125 fprintf(stderr, "CONSTR_STATIC (%p) with 0 pointers\n", p);
1127 case CONSTR_NOCAF_STATIC:
1128 fprintf(stderr, "CONSTR_NOCAF_STATIC (%p) with 0 pointers\n", p);
1131 fprintf(stderr, "THUNK_STATIC (%p) with 0 pointers\n", p);
1134 fprintf(stderr, "FUN_STATIC (%p) with 0 pointers\n", p);
1137 fprintf(stderr, "IND_STATIC (%p) with 0 pointers\n", p);
1141 fprintf(stderr, "RET_BCO (%p) with 0 pointers\n", p);
1144 fprintf(stderr, "RET_SMALL (%p) with 0 pointers\n", p);
1147 fprintf(stderr, "RET_VEC_SMALL (%p) with 0 pointers\n", p);
1150 fprintf(stderr, "RET_BIG (%p) with 0 pointers\n", p);
1153 fprintf(stderr, "RET_VEC_BIG (%p) with 0 pointers\n", p);
1156 fprintf(stderr, "RET_DYN (%p) with 0 pointers\n", p);
1159 fprintf(stderr, "UPDATE_FRAME (%p) with 0 pointers\n", p);
1162 fprintf(stderr, "STOP_FRAME (%p) with 0 pointers\n", p);
1165 fprintf(stderr, "CATCH_FRAME (%p) with 0 pointers\n", p);
1168 fprintf(stderr, "SEQ_FRAME (%p) with 0 pointers\n", p);
1171 case AP_UPD: /* same as PAPs */
1172 fprintf(stderr, "AP_UPD (%p) with 0 pointers\n", p);
1174 /* Treat a PAP just like a section of stack, not forgetting to
1175 * PrintGraph the function pointer too...
1178 StgPAP* pap = stgCast(StgPAP*,p);
1180 fprintf(stderr, "PAP (%p) pointing to %p\n", p, pap->fun);
1182 PrintGraph(pap->fun, indent_level+1);
1183 //scavenge_stack((P_)pap->payload, (P_)pap->payload + pap->n_args);
1184 //p += pap_sizeW(pap);
1189 fprintf(stderr, "ARR_WORDS (%p) with 0 pointers\n", p);
1190 /* nothing to follow */
1191 //p += arr_words_sizeW(stgCast(StgArrWords*,p));
1195 /* follow everything */
1199 fprintf(stderr, "MUT_ARR_PTRS (%p) with %d pointers (not followed)\n",
1200 p, mut_arr_ptrs_sizeW((StgMutArrPtrs*)p));
1201 // evac_gen = 0; /* repeatedly mutable */
1202 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
1203 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
1204 // (StgClosure *)*p =
1205 // PrintGraph((StgClosure *)*p, indent_level+1);
1206 fprintf(stderr, ", %p", *p);
1208 fputs("\n", stderr);
1209 //evac_gen = saved_evac_gen;
1213 case MUT_ARR_PTRS_FROZEN:
1214 /* follow everything */
1216 StgPtr start = p, next;
1218 fprintf(stderr, "MUT_ARR_PTRS (%p) with %d pointers (not followed)",
1219 p, mut_arr_ptrs_sizeW((StgMutArrPtrs*)p));
1220 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
1221 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
1222 // (StgClosure *)*p =
1223 // PrintGraph((StgClosure *)*p, indent_level+1);
1224 fprintf(stderr, ", %p", *p);
1226 fputs("\n", stderr);
1227 //if (failed_to_evac) {
1228 /* we can do this easier... */
1229 // recordMutable((StgMutClosure *)start);
1230 // failed_to_evac = rtsFalse;
1240 fprintf(stderr, "TSO (%p) with link field %p\n", p, (StgClosure *)tso->link);
1242 /* chase the link field for any TSOs on the same queue */
1243 // (StgClosure *)tso->link =
1244 PrintGraph((StgClosure *)tso->link, indent_level+1);
1245 //if (tso->blocked_on) {
1246 // tso->blocked_on = PrintGraph(tso->blocked_on);
1248 /* scavenge this thread's stack */
1249 //scavenge_stack(tso->sp, &(tso->stack[tso->stack_size]));
1250 //evac_gen = saved_evac_gen;
1251 //p += tso_sizeW(tso);
1255 #if defined(GRAN) || defined(PAR)
1258 StgInfoTable *rip = REVERT_INFOPTR(get_itbl(p));
1259 //if (LOOKS_LIKE_GHC_INFO(rip))
1260 // fprintf(stderr, "RBH (%p) with 0 pointers (reverted type=%s)\n",
1261 // p, info_type_by_ip(rip));
1263 fprintf(stderr, "RBH (%p) with 0 pointers (reverted IP=%x)\n",
1270 fprintf(stderr, "BLOCKED_FETCH (%p) with 0 pointers (link=%p)\n",
1271 p, ((StgBlockedFetch *)p)->link);
1274 fprintf(stderr, "FETCH_ME (%p) with 0 pointers\n", p);
1277 fprintf(stderr, "FETCH_ME_BQ (%p) with 0 pointers (blocking_queue=%p)\n",
1278 p, ((StgFetchMeBlockingQueue *)p)->blocking_queue);
1282 fprintf(stderr, "EVACUATED (%p) with 0 pointers (evacuee=%p)\n",
1283 p, ((StgEvacuated *)p)->evacuee);
1287 barf("PrintGraph: unknown closure %d (%s)",
1288 info -> type, info_type(info));
1291 /* If we didn't manage to promote all the objects pointed to by
1292 * the current object, then we have to designate this object as
1293 * mutable (because it contains old-to-new generation pointers).
1295 //if (failed_to_evac) {
1296 // mkMutCons((StgClosure *)q, &generations[evac_gen]);
1297 // failed_to_evac = rtsFalse;
1303 #endif /* GRAN || PAR */
1305 //@node End of File, , Printing Packet Contents, Debugging routines for GranSim and GUM
1306 //@subsection End of File