[m-rev.] trivial diff: mercury_heap.h: move comment

Fergus Henderson fjh at cs.mu.OZ.AU
Wed Nov 12 21:52:16 AEDT 2003


Estimated hours taken: 0.1
Branches: main

runtime/mercury_heap.h:
	Move a comment, so that it is properly located above the code on
	which it is commenting.

Workspace: /home/jupiter/fjh/ws-jupiter/mercury
Index: runtime/mercury_heap.h
===================================================================
RCS file: /home/mercury1/repository/mercury/runtime/mercury_heap.h,v
retrieving revision 1.29
diff -u -d -r1.29 mercury_heap.h
--- runtime/mercury_heap.h	21 Oct 2003 10:04:26 -0000	1.29
+++ runtime/mercury_heap.h	6 Nov 2003 18:09:07 -0000
@@ -345,12 +345,6 @@
 
 #else /* ! MR_HIGHLEVEL_CODE */
 
-/*
-** Note that gcc optimizes `hp += 2; return hp - 2;'
-** to `tmp = hp; hp += 2; return tmp;', so we don't need to use
-** gcc's expression statements in the code below.
-*/
-
 #ifdef	MR_RECORD_TERM_SIZES
   #define MR_SIZE_SLOT_SIZE	1
   #ifdef MR_RECORD_TERM_SIZES_AS_CELLS
@@ -390,6 +384,12 @@
   #define MR_fill_create2_size(hp, ti1, w1, ti2, w2)		0
   #define MR_fill_create3_size(hp, ti1, w1, ti2, w2, ti3, w3)	0
 #endif
+
+/*
+** Note that gcc optimizes `hp += 2; return hp - 2;'
+** to `tmp = hp; hp += 2; return tmp;', so we don't need to use
+** gcc's expression statements in the code below.
+*/
 
 /* used only by hand-written code not by the automatically generated code */
 #define MR_create1(ti1, w1)						\

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
The University of Melbourne         |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
mercury-reviews mailing list
post:  mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------



More information about the reviews mailing list