--- a/CbC-examples/quicksort/quicksort_cbc2.cbc	Tue Jan 05 17:33:06 2010 +0900
+++ b/CbC-examples/quicksort/quicksort_cbc2.cbc	Mon Jan 25 16:14:42 2010 +0900
@@ -13,7 +13,7 @@
 typedef struct {
 	int size;
 	QS_IF interface;
-	RET code;
+	RET ret;
 } frame, *framep;
 
 typedef __code (*RETTYPE)(void*);
@@ -30,7 +30,7 @@
 {
 	framep fp = (framep)sp;
 	sp += fp->size;
-	goto fp->code(fp->interface, sp);
+	goto fp->ret(fp->interface, sp);
 }
 
 __code quicksort_start(QS_IF recvif, stack sp)
@@ -95,7 +95,7 @@
 		e--;
 		goto quicksort_divider(recvif, s, e, p, sp);
 	} else {
-		assert(e+1==s || s==e);
+		//assert(e+1==s || s==e);
 		goto quicksort_treecall(recvif, s, e, sp);
 	}
 }
@@ -109,7 +109,7 @@
 
 	/* interface for first quicksort_start this segment directly jump to.  */
 	fp = (sp-=sizeof(frame));
-	fp->code = quicksort_start;
+	fp->ret = quicksort_start;
 	fp->size = sizeof(frame);
 	fp->interface.v = recvif.v;
 	fp->interface.s = e+1;
@@ -140,7 +140,7 @@
 	/* interface for quicksort_start.  */
 	/* frame for quicksort_finish.  */
 	fp = (sp -= sizeof(frame));
-	fp->code = quicksort_finish;
+	fp->ret = quicksort_finish;
 	fp->size = sizeof(frame);
 	fp->interface.v = v;
 	fp->interface.s = s;