- Hat - Haskell.org

Update hat-check for 64 bits
by nlavine＠haverford.edu 19 Jun '08

19 Jun '08

Hat-check assumes that sizeof(unsigned long) is 32 bits, with the result that it can't read trace files correctly on 64 bit machines. This patch changes unsigned longs to FileOffsets. Experimentally, it now works in 64 bits, although there are still some assumptions about sizeof(float) and sizeof(double) that might make files unportable - I don't know how much those change across architectures. Noah Lavine --- hat-check.c 2006-10-10 09:57:51.000000000 -0400 +++ hat-check.c 2008-06-19 09:14:03.694050843 -0400 @@ -20,6 +20,17 @@ * Added -g option to generate dot-code for graph diagram. * 4 August 2004 - Olaf * Update to extended position format (begin and end location). + * 18 June 2008 - Noah Lavine + * Change (unsigned long) to (FileOffset) for compatibility with 64-bit + * system. + * / + +/* Further changes that would be good - remove assumption that sizeof(char) + * is one byte. Add range checks (for -n <offset>, the file size, maybe other + * things too). Look at readfloat() and readdouble(), maybe set definitive + * size (right now hat files are not portable across platforms with different + * sizeof(float) and sizeof(double)). make sure (unsigned long) is at least + * as big as both (FileOffset) and (unsigned int), for function pc(). */ /* #include <unistd.h> */ @@ -27,6 +38,7 @@ #include <sys/stat.h> #include <stdlib.h> #include <stdio.h> +#include <stdint.h> #include <string.h> #include <signal.h> @@ -48,9 +60,9 @@ void header (void); void nodes (void); void nextnode (void); -void markfromheader (unsigned long *buf); -void markfromoutput (char *bridgefile, unsigned long *buf); -void markfrom (unsigned long root, unsigned long *buf); +void markfromheader (FileOffset *buf); +void markfromoutput (char *bridgefile, FileOffset *buf); +void markfrom (FileOffset root, FileOffset *buf); /* strings for symbolic constants */ char* @@ -112,7 +124,7 @@ */ FILE* f; /* file descriptor for archive */ -unsigned long nextoffset=0; /* current position in file */ +FileOffset nextoffset=0; /* current position in file */ int vmode = 0; /* verify -- check tag-types of pointer destinations */ int smode = 0; /* statistics -- counts and space usage for node types */ @@ -122,7 +134,7 @@ int rmode = 0; /* reachable -- show how many nodes are reachable */ int xmode = 0; /* exit mode -- cleanup after signal to halt */ -unsigned filesize = 0; /* used in precondition for seeks ... */ +FileOffset filesize = 0; /* used in precondition for seeks ... */ struct stat statbuf; /* ... to catch seek beyond EOF */ #define FILENAMESIZE 200 @@ -130,7 +142,7 @@ /* byte buffer for use in reachability mark-phase */ #define BUFFERSIZE 100000 -unsigned long buffer[BUFFERSIZE]; +FileOffset buffer[BUFFERSIZE]; /* signal handler -- only installed for -r */ void @@ -139,8 +151,8 @@ fprintf(stderr, "hat-check cleaning up -- please wait\n"); amode = 0; rmode = 0; smode = 0; vmode = 0; xmode = 1; - fseek(f,0,SEEK_SET); - nextoffset = 0; + fseek(f,(long int)(FileOffset)0,SEEK_SET); + nextoffset = (FileOffset)0; header(); nodes(); exit(1); @@ -199,7 +211,7 @@ fprintf(stderr," but this tool deals with format version %s\n",FILEVERSION); fprintf(stderr," I'm continuing, but there may be unexpected errors.\n"); } - fseek(f,0,SEEK_SET); /* reset to beginning of file */ + fseek(f,(long int)(FileOffset)0,SEEK_SET); /* reset to beginning of file */ free(header); } @@ -210,7 +222,7 @@ } amode = 1; rmode = 0; smode = 0; } else { - nextoffset = 0L; + nextoffset = (FileOffset)0; } if (rmode) { signal(SIGINT, restoretags); @@ -220,9 +232,9 @@ markfromheader(buffer); strcat(filename, ".bridge"); markfromoutput(filename,buffer); - fseek(f,0,SEEK_SET); + fseek(f,(long int)(FileOffset)0,SEEK_SET); } - fseek(f,nextoffset,SEEK_SET); + fseek(f,(long int)nextoffset,SEEK_SET); if (nmode) { nextnode(); } else { @@ -258,8 +270,8 @@ #define MAX_TAG 32 unsigned int count[MAX_TAG]; /* indexed by tag byte: Module, SrcPos, etc */ -unsigned long space[MAX_TAG];/* ditto */ -unsigned long headspace; /* space oocupied by header */ +FileOffset space[MAX_TAG];/* ditto */ +FileOffset headspace; /* space oocupied by header */ unsigned int reachcount[MAX_TAG]; void @@ -284,7 +296,7 @@ { unsigned int grandcount = 1; unsigned int grandreachcount = 1; - unsigned long grandspace = headspace; + FileOffset grandspace = headspace; int k; for (k=0; k<MAX_TAG; k++) { grandcount += count[k]; @@ -296,12 +308,14 @@ "Number", "Description", "Bytes", "% Space"); if (rmode) printf("%7.1f", pc(1,1)); printf("%10u %-20s%12u%10.1f\n", - 1, "header", headspace, pc(headspace,grandspace)); + 1, "header", headspace, + pc((unsigned long)headspace,(unsigned long)grandspace)); for (k=0; k<=ListCons; (k==ExpDoStmt? k=AtomVariable: k++)) { - if (rmode) printf("%7.1f", pc(reachcount[k], count[k])); + if (rmode) printf("%7.1f", pc((unsigned long)reachcount[k], + (unsigned long)count[k])); printf("%10u %-20s%12u%10.1f\n", count[k], tag2str(k), space[k], - pc(space[k],grandspace)); + pc((unsigned long)space[k],(unsigned long)grandspace)); } { int w; putchar('\n'); @@ -309,9 +323,11 @@ for (w=0; w<55; w++) putchar(w<13 ? ' ' : '-'); putchar('\n'); } - if (rmode) printf("%7.1f", pc(grandreachcount,grandcount)); + if (rmode) printf("%7.1f", pc((unsigned long)grandreachcount, + (unsigned long)grandcount)); printf("%10u %-20s%12u%10.1f\n", - grandcount, "whole trace file", grandspace, pc(grandspace,grandspace)); + grandcount, "whole trace file", grandspace, pc((unsigned long)grandspace, + (unsigned long)grandspace)); } char @@ -360,7 +376,7 @@ return buf; } -typedef unsigned long fourbytes; +typedef uint32_t fourbytes; fourbytes readfourbytes (void) @@ -384,16 +400,16 @@ char* readposn (void) { - unsigned long begin = readfourbytes(); - unsigned long end = readfourbytes(); + FileOffset begin = (FileOffset)readfourbytes(); + FileOffset end = (FileOffset)readfourbytes(); sprintf(posnbuf, "position %u:%u-%u:%u,", begin/10000, begin%10000, end/10000, end%10000); return posnbuf; } -unsigned long +FileOffset readpointer (void) -{ return readfourbytes(); } +{ return (FileOffset)readfourbytes(); } char readchar (void) @@ -401,7 +417,7 @@ int readint (void) -{ return readfourbytes(); } +{ return (int)readfourbytes(); } char* readinteger (void) @@ -487,25 +503,25 @@ } int -tagat (unsigned long offset) +tagat (FileOffset offset) { char byte[1]; int i; if (offset <= filesize) { - fseek(f, offset, SEEK_SET); + fseek(f, (long int)offset, SEEK_SET); i = fread(byte,sizeof(char),1,f); - fseek(f, nextoffset, SEEK_SET); + fseek(f, (long int)nextoffset, SEEK_SET); if (rmode) cleartag(byte); return (i==1 ? lo5(*byte) : INVALID); } else return BEYOND; } void -newtagat (char *t, unsigned long offset) +newtagat (char *t, FileOffset offset) { - fseek(f, offset, SEEK_SET); + fseek(f, (FileOffset)offset, SEEK_SET); fwrite(t,sizeof(char),1,f); - fseek(f, nextoffset, SEEK_SET); + fseek(f, (FileOffset)nextoffset, SEEK_SET); } @@ -525,8 +541,8 @@ void dopointer (int okzero, - int requiretag, unsigned long requireoffset, - int contexttag, unsigned long contextoffset, + int requiretag, FileOffset requireoffset, + int contexttag, FileOffset contextoffset, char *edgelabel) { if (vmode && ((okzero==NONZERO && requireoffset <= Interrupted) @@ -590,9 +606,9 @@ nextoffset = 8; if (amode) printf("%s", s); if (amode) printf("\nEntry point: "); - dopointer(MAYBEZERO, ANYEXP, readpointer(), HEADER, 0L, ""); + dopointer(MAYBEZERO, ANYEXP, readpointer(), HEADER, (FileOffset)0, ""); if (amode) printf("\nError message: "); - dopointer(MAYBEZERO, AtomAbstract, readpointer(), HEADER, 0L, ""); + dopointer(MAYBEZERO, AtomAbstract, readpointer(), HEADER, (FileOffset)0, ""); if (amode) printf("\n"); headspace = nextoffset; } @@ -604,7 +620,7 @@ void nextnode (void) { - unsigned long offset = nextoffset; + FileOffset offset = nextoffset; char b; int marked, err; err = fread(&b,sizeof(char),1,f); nextoffset+=1; @@ -893,28 +909,28 @@ /* Traverse the trail structure starting from output and error * roots, marking all reachable nodes. */ -unsigned long -getpointer (unsigned long *buf) +FileOffset +getpointer (FileOffset *buf) { return ntohl(*buf); } /* reading, checking and/or writing header and node information */ void -markfromheader (unsigned long *buf) +markfromheader (FileOffset *buf) { fseek(f,8L,SEEK_SET); - fread(buf,sizeof(unsigned long),2,f); + fread(buf,sizeof(FileOffset),2,f); markfrom(getpointer(buf+1),buf+1); markfrom(getpointer(buf), buf); } void -markfromoutput (char *bridgefile, unsigned long *buf) +markfromoutput (char *bridgefile, FileOffset *buf) { FILE* bridge = fopen(bridgefile, "rb"); if (bridge==(FILE*)0) return; for (;;) { - int n = fread(buf,sizeof(unsigned long),1,bridge); + int n = fread(buf,sizeof(FileOffset),1,bridge); if (n<1) return; markfrom(getpointer(buf),buf); } @@ -926,18 +942,18 @@ * tag byte */ void -markfrom (unsigned long root, unsigned long *buf) +markfrom (FileOffset root, FileOffset *buf) { char tag; if (root > 8 && root < filesize) { /* First read the tag byte. If it is marked, return. * If it is not marked, then mark it now. */ - fseek(f,root,SEEK_SET); + fseek(f,(long int)root,SEEK_SET); fread(&tag,sizeof(char),1,f); if (ismarked(tag)) return; marktag(&tag); - fseek(f,root,SEEK_SET); + fseek(f,(long int)root,SEEK_SET); fwrite(&tag,sizeof(char),1,f); cleartag(&tag); /* Examine the tag to determine the kind of node. @@ -956,7 +972,7 @@ } switch (k) { case ListCons: - fread(buf,sizeof(unsigned long),2,f); /* two pointers */ + fread(buf,sizeof(FileOffset),2,f); /* two pointers */ markfrom(getpointer(buf+1),buf+1); markfrom(getpointer(buf),buf); break; @@ -966,41 +982,41 @@ case SrcPos: case AtomVariable: case AtomConstructor: /* ignore fieldnames for now */ - fread(buf,sizeof(unsigned long),1,f); /* points to module mode */ + fread(buf,sizeof(FileOffset),1,f); /* points to module mode */ markfrom(getpointer(buf),buf); break; default: { int pos = 0; if (hasSrcPos(tag)) { - fread(buf+pos,sizeof(unsigned long),1,f); + fread(buf+pos,sizeof(FileOffset),1,f); pos++; } - fread(buf+pos,sizeof(unsigned long),1,f); /* parent pointer */ + fread(buf+pos,sizeof(FileOffset),1,f); /* parent pointer */ pos++; switch (k) { case ExpApp: - fread(buf+pos,sizeof(unsigned long),2,f); /* result+fun */ + fread(buf+pos,sizeof(FileOffset),2,f); /* result+fun */ pos += 2; { unsigned char arity; fread(&arity,sizeof(unsigned char),1,f); - fread(buf+pos,sizeof(unsigned long),(unsigned int)arity,f); + fread(buf+pos,sizeof(FileOffset),(unsigned int)arity,f); pos += (int)arity; } break; case ExpValueApp: - fread(buf+pos,sizeof(unsigned long),1,f); /* fun */ + fread(buf+pos,sizeof(FileOffset),1,f); /* fun */ pos += 1; { unsigned char arity; fread(&arity,sizeof(unsigned char),1,f); - fread(buf+pos,sizeof(unsigned long),(unsigned int)arity,f); + fread(buf+pos,sizeof(FileOffset),(unsigned int)arity,f); pos += (int)arity; } break; case ExpValueUse: case ExpConstUse: case ExpProjection: - fread(buf+pos,sizeof(unsigned long),1,f); /* one extra pointer */ + fread(buf+pos,sizeof(FileOffset),1,f); /* one extra pointer */ pos++; break; case ExpHidden: @@ -1009,7 +1025,7 @@ case ExpGuard: case ExpCase: case ExpIf: - fread(buf+pos,sizeof(unsigned long),2,f); /* two pointers */ + fread(buf+pos,sizeof(FileOffset),2,f); /* two pointers */ pos+=2; break; default: break; /* no pointers */

1 0

Add debug printing for resResult in hat-c.c
by nlavine＠haverford.edu 19 Jun '08

19 Jun '08

I found it somewhat disconcerting when I looked at the debugging output from hat-c.c that it showed many entResults and no resResults. This may be an issue of personal style, but this patch was useful for me. It adds a print in resResult to match the one in entResult. Noah Lavine --- hat-c.c 2006-11-15 05:45:17.000000000 -0500 +++ hat-c.c 2008-06-15 18:18:14.247202914 -0400 @@ -1805,6 +1805,7 @@ LastExp = node; node &= hiddenMask; result &= hiddenMask; + HIDE(fprintf(stderr,"\tresResult 0x%x 0x%x 0x%x 0x%x\n", node, result, use, ntohl(node)+1+sizeof(FileOffset)+(use?sizeof(FileOffset):0));) hat_reduce(ntohl(node),1+sizeof(FileOffset)+(use?sizeof(FileOffset):0), result); }

1 0

Fix for Debug Prints in hat-c.c
by nlavine＠haverford.edu 19 Jun '08

19 Jun '08

A few of the print statements that are turned on in hat-c.c when DEBUG is defined don't print all of their arguments, potentially resulting in strange output if they were used. This patch fixes that. Noah Lavine --- hat-c.c 2006-11-15 05:45:17.000000000 -0500 +++ hat-c.c 2008-06-15 18:18:14.247202914 -0400 @@ -749,7 +749,7 @@ writeFileOffset(arg1); writeFileOffset(arg2); writeFileOffset(arg3); - HIDE(fprintf(stderr,"\tmkValueApp3 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,fo);) + HIDE(fprintf(stderr,"\tmkValueApp3 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,fo);) return fo; } @@ -1019,7 +1019,7 @@ writeFileOffset(arg11); writeFileOffset(arg12); writeFileOffset(arg13); - HIDE(fprintf(stderr,"\tmkValueApp13 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,LastExp);) + HIDE(fprintf(stderr,"\tmkValueApp13 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,LastExp);) return fo; } @@ -1053,7 +1053,7 @@ writeFileOffset(arg12); writeFileOffset(arg13); writeFileOffset(arg14); - HIDE(fprintf(stderr,"\tmkValueApp14 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,arg14,LastExp);) + HIDE(fprintf(stderr,"\tmkValueApp14 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,arg14,LastExp);) return fo; } @@ -1088,7 +1088,7 @@ writeFileOffset(arg13); writeFileOffset(arg14); writeFileOffset(arg15); - HIDE(fprintf(stderr,"\tmkValueApp15 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,arg14,arg15,LastExp);) + HIDE(fprintf(stderr,"\tmkValueApp15 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,fun,arg1,arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,arg10,arg11,arg12,arg13,arg14,arg15,LastExp);) return fo; } @@ -1187,7 +1187,7 @@ writeFileOffset(use); writeFileOffset(parent); writeFloat(f); - HIDE(fprintf(stderr,"\tmkFloat 0x%x 0x%x %f -> 0x%x\n",parent,use,f,fp);) + HIDE(fprintf(stderr,"\tmkFloat 0x%x 0x%x %f -> 0x%x\n",parent,use,f,fo);) return fo; } @@ -1315,7 +1315,7 @@ writeByte(1); writeFileOffset(binder1); writeFileOffset(bindee1); - HIDE(fprintf(stderr,"\tmkFieldUpdate1 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate1 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,fo);) return fo; } @@ -1339,7 +1339,7 @@ writeFileOffset(bindee1); writeFileOffset(binder2); writeFileOffset(bindee2); - HIDE(fprintf(stderr,"\tmkFieldUpdate2 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate2 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,fo);) return fo; } @@ -1365,7 +1365,7 @@ writeFileOffset(bindee2); writeFileOffset(binder3); writeFileOffset(bindee3); - HIDE(fprintf(stderr,"\tmkFieldUpdate3 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate3 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,fo);) return fo; } @@ -1394,7 +1394,7 @@ writeFileOffset(bindee3); writeFileOffset(binder4); writeFileOffset(bindee4); - HIDE(fprintf(stderr,"\tmkFieldUpdate4 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate4 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,fo);) return fo; } @@ -1426,7 +1426,7 @@ writeFileOffset(bindee4); writeFileOffset(binder5); writeFileOffset(bindee5); - HIDE(fprintf(stderr,"\tmkFieldUpdate5 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate5 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,fo);) return fo; } @@ -1461,7 +1461,7 @@ writeFileOffset(bindee5); writeFileOffset(binder6); writeFileOffset(bindee6); - HIDE(fprintf(stderr,"\tmkFieldUpdate6 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate6 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,fo);) return fo; } @@ -1499,7 +1499,7 @@ writeFileOffset(bindee6); writeFileOffset(binder7); writeFileOffset(bindee7); - HIDE(fprintf(stderr,"\tmkFieldUpdate7 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate7 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,fo);) return fo; } @@ -1540,7 +1540,7 @@ writeFileOffset(bindee7); writeFileOffset(binder8); writeFileOffset(bindee8); - HIDE(fprintf(stderr,"\tmkFieldUpdate8 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate8 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,fo);) return fo; } @@ -1584,7 +1584,7 @@ writeFileOffset(bindee8); writeFileOffset(binder9); writeFileOffset(bindee9); - HIDE(fprintf(stderr,"\tmkFieldUpdate9 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,binder9,bindee9,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate9 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,binder9,bindee9,fo);) return fo; } @@ -1631,7 +1631,7 @@ writeFileOffset(bindee9); writeFileOffset(binder10); writeFileOffset(bindee10); - HIDE(fprintf(stderr,"\tmkFieldUpdate10 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,binder9,bindee9,binder10,bindee10,fo);) + HIDE(fprintf(stderr,"\tmkFieldUpdate10 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x -> 0x%x\n",parent,use,Unevaluated,arg,binder1,bindee1,binder2,bindee2,binder3,bindee3,binder4,bindee4,binder5,bindee5,binder6,bindee6,binder7,bindee7,binder8,bindee8,binder9,bindee9,binder10,bindee10,fo);) return fo; } @@ -1727,7 +1727,7 @@ writeByte(fixity); writeByte(arity); writeString(name); - HIDE(fprintf(stderr,"\tmkConstructor 0x%x %d %d %d %d %s %d -> 0x%x\n",module,begin,end,fixity,arity,name,fo);) + HIDE(fprintf(stderr,"\tmkConstructor 0x%x %d %d %d %d %s -> 0x%x\n",module,begin,end,fixity,arity,name,fo);) return fo; }

1 0

Visualising Program Traces With Hat
by nlavine＠haverford.edu 02 Jun '08

02 Jun '08

Hello, I am writing to let you know that I am working on a project to use Hat ARTs to trace programs written in a pure functional subset of Python. The goal is to let students in the introductory computer science classes at my school (Haverford College) generate traces of their programs to help with debugging and, hopefully, understanding what the programs do. This introductory course uses Python first with a functional style and then with an imperative style, and debugging/visualization tools are sadly lacking in the first half. My plan is to first write a program to transform a subset of Python for tracing, as hat-trans does, and then perhaps work on new GUI tools for viewing traces and perhaps add Eclipse integration, since the classes here use Eclipse. Thanks to all of you who have done work on Hat and made it available to us. I would appreciate any ideas or suggestions you might have, or any information you have on other projects like this. If you're interested, I will hopefully have some GUI trace-viewing tools to contribute to Hat in a few months. Noah Lavine

2 1

Possibly incorrect Hat file
by Thomas Davie 05 Nov '07

05 Nov '07

Hi guys, I'm not sure, but I think I've found a bug in hat-trans. I have an instance of map being applied to a single element list, however, only one element is ever demanded from the result, so the empty list is never evaluated. This results in these nodes in the hat file (the result pointer of the application of map is 0xa76d): 0xec6: AtomConstructor (Module 0xeb2) position 0:0-0:0, infixr 5, arity=2, : 0xa76d: ExpHidden parent=(Exp 0xa544) result=(Exp 0xa784) children=(ListCons 0xa7c7) ... 0xa77f: ExpForward result=(Exp 0xa76d) 0xa784: ExpValueApp parent=(Exp 0xa76d) fun=(Atom 0xec6) arity=2, args (Exp 0xa77a)(Exp 0xa77f) It makes sense that the result is a hidden node, and as expected the result of that is an application of cons. But look at the result of the cons -- it's the same hidden node as before, shouldn't this point to an unevaluated node? If I try to resurrect an expression from result of map, I get an infinite list, which is obviously rather odd for applying map to a single element list. On the other hand, hat-observe appears to figure out that the list argument of cons is unevaluated, but I can't see exactly what the condition here is that allows hat-observe to tell that this is indeed an unevaluated structure rather than an infinite list. Bob

2 1

OS 10.5
by Thomas Davie 26 Oct '07

26 Oct '07

The news is both good and bad when trying to run Hat on OS X 10.5... The bad: • The ghcsym bug appears to have returned. The good: • Readline is there by default, so nice stuff happens in hat-observe, and the make file glitch doesn't bite. • Other than the ghcsym bug, the compile went through smoothly first time, that's a new one for OS X! Bob

1 0

ghc + hat
by Guillaume Hoffmann 28 Sep '07

28 Sep '07

Hi, is there a way to compile a program with GHC and Hat support, directly by calling GHC with the adequate flag(s) (withour using hmake, as the official documentation stipulates) ? guillaume

2 1

Tracing of standard libraries
by Matthias Neubauer 28 Sep '07

28 Sep '07

Hi, I just pulled the latest darcs version of hat, compiled it using ghc-6.6.1 and tried to debug a program. Unfortunately, there seems to be no tracing information for standard libraries by default. ... During compilation using "hmake -hat" hat-trans says ... hat-trans: /usr/local/include/hat-2.05/System/IO/Unsafe.hx: openFile: does not exist (No such file or directory) Is there a way to generate tracing information for (parts of) the standard libraries? (I realizied there is a script called "start" in the hat root directory?) Or, is there another version of hat that works with ghc-6.6.1? -Matthias -- Matthias Neubauer | Universität Freiburg, Institut für Informatik | tel +49 761 203 8060 Georges-Köhler-Allee 79, 79110 Freiburg i. Br., Germany | fax +49 761 203 8052

2 1

no "-package" option for hat-trans?
by Ivan Tarasov 17 Jul '07

17 Jul '07

Hi, I'm trying to hat-transform my program, but I feel that I'm stuck. The problem is that my program uses external package (namely NumericPrelude) which I compiled and installed myself (it is visible through ghc-pkg), but I can't find a way to explain it to hat-trans. More precisely, I have the following imports in one of the files: ---- {-# OPTIONS -fno-implicit-prelude #-} import MyPrelude ---- MyPrelude is exported from the NumericPrelude package. However hat-trans tries to find the MyPrelude.hx. I read the hat-trans man page and found that there is "-package" option, however it doesn't work. I started to read the Hat-Trans sources and found that there is actually no such option in Hat-Trans! So, this seems to be a man page problem, but solving it by changing man file obviously wouldn't help my source transformation :-) I tried using hmake -hat, but it didn't help either. I'm using GHC 6.6.1 (6.6.12), hat 2.5 (2.5+rerolled-3), hmake 3.12 (3.12-1), all from the Debian repository. Is there some solution I'm missing, or the documentation page I ought to read? Ivan

2 1

Re: [Haskell-cafe] update on SoC projects?
by Kenn Knowles 06 Jul '07

06 Jul '07

On Fri, Jul 06, 2007 at 04:30:36PM +0100, Claus Reinke wrote: > there still seem to be only three entries for status reports (of 9 projects) > on that page. have the other projects been abandoned? The updating of Hat hasn't been abandoned, and I just added an update. Sorry about the delay; I've been too busy for mailing lists and blogging! Anyone particularly interested in this project is invited to chat (I'm kenn in #haskell on chat.freenode.net) or email me about examples or issues. :-) - Kenn

1 0