--- a/quicksort/quicksort_cbc.cbc	Mon Feb 08 00:35:58 2010 +0900
+++ b/quicksort/quicksort_cbc.cbc	Mon Feb 08 03:50:27 2010 +0900
@@ -6,7 +6,7 @@
 typedef struct {
 	int size;
 	void *interface;
-	__code  (*ret)(void*, stack) ;
+	code  (*ret)(void*, stack) ;
 } frame, *framep;
 
 /* quickstart main routine. */
@@ -15,21 +15,21 @@
 	int s;
 	int e;
 } QS_IF ;
-typedef __code  (*RET)(void*);
+typedef code  (*RET)(void*);
 
 #include"quicksort_cbc.h"
 
 /* for check. */
 void *mustbefreed;
 
-__code  returner(stack sp)
+code  returner(stack sp)
 {
 	framep fp = (framep)sp;
 	sp += fp->size;
 	goto fp->ret(fp->interface, sp);
 }
 
-__code  quicksort_start(void *arg, stack sp)
+code  quicksort_start(void *arg, stack sp)
 {
 	QS_IF *recvif = arg;
 	int a,b,c,p;
@@ -61,18 +61,18 @@
 /* main routine end. */
 
 /* divide routine. */
-__code  quicksort_divider(QS_IF *recvif, int s, int e, int p, stack sp)
+code  quicksort_divider(QS_IF *recvif, int s, int e, int p, stack sp)
 {
 	goto quicksort_divider_s(recvif, s, e, p, sp);
 }
-__code  quicksort_divider_s(QS_IF *recvif, int s, int e, int p, stack sp)
+code  quicksort_divider_s(QS_IF *recvif, int s, int e, int p, stack sp)
 {
 	if (recvif->v[s]<p) {
 		goto quicksort_divider_s(recvif, s+1, e, p, sp);
 	} else
 		goto quicksort_divider_e(recvif, s, e, p, sp);
 }
-__code  quicksort_divider_e(QS_IF *recvif, int s, int e, int p, stack sp)
+code  quicksort_divider_e(QS_IF *recvif, int s, int e, int p, stack sp)
 {
 	if (p<recvif->v[e]) {
 		e--;
@@ -80,7 +80,7 @@
 	} else
 		goto quicksort_swapper(recvif, s, e, p, sp);
 }
-__code  quicksort_swapper(QS_IF *recvif, int s, int e, int p, stack sp)
+code  quicksort_swapper(QS_IF *recvif, int s, int e, int p, stack sp)
 {
 	if (s<e) {
 		int tmp;
@@ -96,7 +96,7 @@
 
 
 /* recursive call routine. */
-__code  quicksort_treecall(QS_IF *recvif, int s, int e, stack sp)
+code  quicksort_treecall(QS_IF *recvif, int s, int e, stack sp)
 {
 	framep fp;
 	QS_IF *outif;
@@ -120,11 +120,11 @@
 #define STACK_SIZE 10240
 
 typedef struct {
-	__code  (*ret)(void*);
+	code  (*ret)(void*);
 	void *ret_arg;
 	stack *sp;
 } QS_FINISH;
-__code 
+code 
 quicksort(int *v, int s, int e,  RET ret, void *arg )
 {
 	framep fp;
@@ -153,7 +153,7 @@
 
 	goto quicksort_start(outif, sp);
 }
-__code 
+code 
 quicksort_finish(void *arg, stack sp)
 {
 	QS_FINISH interface;