/*
Time-stamp: <Wed Mar 21 2001 16:32:47 Stardate: [-30]6363.44 hwloidl>
- $Id: Pack.c,v 1.6 2001/03/22 03:51:11 hwloidl Exp $
+ $Id: Pack.c,v 1.8 2001/07/24 05:04:59 ken Exp $
Graph packing and unpacking code for sending it to another processor
and retrieving the original graph structure from the packet.
unpacked_size += PACK_FETCHME_SIZE;
}
-#endif DIST
+#endif /* DIST */
//@node Packing Closures, , Packing Sections of Nearby Graph, Packing Functions
//@subsubsection Packing Closures
nat n, i, j, pack_start;
StgPtr p, q;
const StgInfoTable* info;
- StgWord32 bitmap;
+ StgWord bitmap;
/* debugging only */
StgPtr end;
nat size, ptrs, nonptrs, vhs;
for (j=0; j<large_bitmap->size; j++) {
bitmap = large_bitmap->bitmap[j];
- q = p + sizeof(W_) * 8;
+ q = p + BITS_IN(W_);
while (bitmap != 0) {
if ((bitmap & 1) == 0) {
Pack((StgWord)(ARGTAG_MAX+1));
ga->weight=0;
// ***************************************************************************
// ***************************************************************************
-#endif DIST
+#endif /* DIST */
/* Two closures, one global name. Someone loses */
oldip = get_itbl(existing);
nat n, i, j, packed_size = 0;
StgPtr p, q, end, payload_start, p_FMs;
const StgInfoTable* info;
- StgWord32 bitmap;
+ StgWord bitmap;
StgWord **bufptr = *bufptrP;
#if defined(DEBUG)
nat FMs_in_PAP=0;
for (j=0; j<large_bitmap->size; j++) {
bitmap = large_bitmap->bitmap[j];
- q = p + sizeof(W_) * 8;
+ q = p + BITS_IN(W_);
while (bitmap != 0) {
if ((bitmap & 1) == 0) {
*p++ = (StgWord)UnpackFetchMe(&bufptr, (StgClosure**)&p_FMs);