diff --git a/eli/README b/eli/README
index 00fe0703..40d94be9 100644
--- a/eli/README
+++ b/eli/README
@@ -5,6 +5,7 @@ Usage:
 Copy sc-mode.el and tcell-mode.el to your emacs library path
 and add the following code into your .emacs file.
 
+(require 'cl)
 (require 'tcell-mode) ; recursively requires sc-mode
 (add-to-list 'auto-mode-alist (cons "\\.sc$" 'sc-mode))
 (add-to-list 'auto-mode-alist (cons "\\.tcell$" 'tcell-mode))
diff --git a/eli/sc-mode.el b/eli/sc-mode.el
index e57fcfa9..26aee77a 100644
--- a/eli/sc-mode.el
+++ b/eli/sc-mode.el
@@ -125,9 +125,11 @@
 
 
 (define-derived-mode sc-mode lisp-mode "SC"
-  (setf (car font-lock-defaults)
-	(list 'sc-font-lock-keywords
-	      'sc-font-lock-keywords-1 'sc-font-lock-keywords-2))
+  (setq font-lock-defaults
+	(cons
+	 (list 'sc-font-lock-keywords
+	       'sc-font-lock-keywords-1 'sc-font-lock-keywords-2)
+	 (cdr font-lock-defaults)))
   (let ((tag 'lisp-indent-function))
     ;; SC constructs
     (put 'def tag 2)
diff --git a/eli/tcell-mode.el b/eli/tcell-mode.el
index 644f49cc..6ba829f3 100644
--- a/eli/tcell-mode.el
+++ b/eli/tcell-mode.el
@@ -107,7 +107,9 @@
 	      ;; pseudo variables
 	      (,(concat
 		 "\\<" (regexp-opt
-			'("PROBABILITY" "WDATA" "WORKER-ID" "this") t)
+			'("PROBABILITY" "WDATA" "WORKER-ID" "EXITING"
+                          "EXITING-NORMAL" "EXITING-EXCEPTION" "EXITING-CANCEL" "EXITING-SPAWN"
+                          "this") t)
 		 "\\(\\.\\sw+\\)?\\>")
 	       (1 tcell-variable-name-face))
 	      ))))
@@ -120,9 +122,11 @@
   "Default expressions to highlight in Tascell mode.")
 
 (define-derived-mode tcell-mode sc-mode "Tascell"
-  (setf (car font-lock-defaults)
-	(list 'tcell-font-lock-keywords
-	      'tcell-font-lock-keywords-1 'tcell-font-lock-keywords-2))
+  (setq font-lock-defaults
+	(cons
+	 (list 'tcell-font-lock-keywords
+	       'tcell-font-lock-keywords-1 'tcell-font-lock-keywords-2)
+	 (cdr font-lock-defaults)))
   (let ((tag 'lisp-indent-function))
     ;; Tascell constructs
     (put 'do-two tag 2)
diff --git a/src/c2sc-lex.lsp b/src/c2sc-lex.lsp
index 1fb7244a..bd63260e 100644
--- a/src/c2sc-lex.lsp
+++ b/src/c2sc-lex.lsp
@@ -288,7 +288,7 @@
 (defun lex-prev-token ()  *prev-token*)
 (defun lex-colon-follows () *colon-follows*)
 
-;; 字句解析の親分
+;; 絖���ヨВ������荀����
 (defun lex-get-token (&aux (le *lex-env*) (line nil))
   (the lex-env *lex-env*)
   (unless (setq line (skip-whitespace le (lex-env-lptr le)))
diff --git a/src/c2sc-parser.lsp b/src/c2sc-parser.lsp
index 36f4aa64..8717a02b 100644
--- a/src/c2sc-parser.lsp
+++ b/src/c2sc-parser.lsp
@@ -67,14 +67,14 @@
 ;;; whether c2sc::piece-c2sc is being processed
 (defvar *parsing-piece* nil)
 
-;;; c2sc-getline 中に preprocessing directive が現れたらここに溜めておく。
+;;; c2sc-getline 筝���� preprocessing directive ����憗�����������������羣����������������
 ;;; %defmacro, %defconstant, %undef
 ;;;  --> *scpp-macro-buffer* 
-;;;  --> translation-unit の末尾につなげる
-;;; それ以外 
+;;;  --> translation-unit ������絨障����ゃ��������
+;;; ������篁ュ�� 
 ;;;  --> *scpp-directive-buffer* 
-;;;  --> *directive-emit-functions* に指定されている関数の返り値の頭に
-;;;      つなげて一緒に吐き出す
+;;;  --> *directive-emit-functions* ������絎������������������∽�違��菴������ゃ��������
+;;;      ��ゃ��������筝�膩������������冴��
 (defvar *scpp-directive-buffer* nil)
 (defvar *scpp-macro-buffer* nil)
 (defparameter *directive-emit-functions* '(declaration statement))
@@ -298,7 +298,7 @@
 
 ;;;; 
 
-;; get-gensymid で mark をつけたところの identifier を決定する
+;; get-gensymid ��� mark �����ゃ����������������� identifier ���羆阪��������
 (defun decide-unidentified (sc-program)
   (let ((dec-id (memoize
                  #'(lambda (usym)
@@ -319,7 +319,7 @@
                                       (ragrs *required-aggregates*))
   (if (and (eq t rvars) (eq t ragrs)) sc-program
     (loop for df in sc-program
-        when (or (atom df) (not (defsymbol-p (car df))) ; 宣言・定義以外
+        when (or (atom df) (not (defsymbol-p (car df))) ; 絎ｈ����糸��臂�篁ュ��
                  (if (consp (second df))
                      (if (member (car (second df)) ~(struct union enum))
                          (aggregate-required-p (second (second df)))
@@ -330,8 +330,8 @@
 (defun defsymbol-p (sym)
   (rule:declaration-tag? sym :sc2c))
 
-;; 無名のstructなどは，SCでは無名にできないので，
-;; mark をつけておいて,後で identifier を決定する
+;; ��≦�����struct���������鐚�SC��с����≦�������с�������������э��
+;; mark �����ゃ��������������,緇���� identifier ���羆阪��������
 (defvar *gensym-num*)
 (defun get-gensymid ()
   (prog1
@@ -1658,9 +1658,9 @@
   (aif (read-line stream nil)
       (if (eql #\$ (string-ref it 0))
           (progn
-            ;; S-expression としてreadして、、、
+            ;; S-expression ���������read���������������
             (handle-c2sc-directive (string-left-ntrim it))
-            ;; あらためて次の行を読む
+            ;; ���������������罨＜��茵����茯����
             (c2sc-getline stream))
         (funcall (if *want-debugging-output* #'print #'identity)
                  (string+ it #.(format nil "~%"))))
@@ -1706,8 +1706,8 @@
         (otherwise
          (push directive *scpp-directive-buffer*))))))
 
-;; *directive-emit-functions* の関数（構文単位）処理後，
-;; *scpp-direcive-buffer*にたまったプリプロセッサ指令を吐き出す
+;; *directive-emit-functions* �����∽�逸��罕�������篏�鐚�������緇�鐚�
+;; *scpp-direcive-buffer*��������障�ｃ����������������祉����究��篁ゃ����������冴��
 (dolist (de-func *directive-emit-functions*)
   (let ((orig-func (symbol-function de-func)))
     (setf (symbol-function de-func)
@@ -1718,12 +1718,12 @@
             (nconc emit-directive
                    (apply orig-func args)))))))
 
-;;; %defconstant-cexp 中のCコードの断片を可能ならSC化
+;;; %defconstant-cexp 筝����C��潟�若�������������������純�����SC���
 (defun defconstant-cexp-c2sc (defconstant-exp-directive)
   (assert (eq '%defconstant-cexp (car defconstant-exp-directive)))
   (let* ((const-name (second defconstant-exp-directive))
          (piece-c-code (third defconstant-exp-directive))
-         ;; C の "~" は "~~" になっているので
+         ;; C ��� "~" ��� "~~" ��������ｃ��������������
          (formatted-c-code #|(format nil|# piece-c-code #|)|#))
     (if (not (macro-required-p const-name)) nil
       (progn
@@ -1742,8 +1742,8 @@
                (format *error-output* "==> <give up...>~%"))
              `(sc::c-exp ,piece-c-code)) ))))))
 
-;;; defmacro における c-code の "$<arg_num>$" の部分を引数名に置き換える
-;;; 返り値は
+;;; defmacro ������������ c-code ��� "$<arg_num>$" ������������綣���医�����臀�������������
+;;; 菴������ゃ��
 ;;; (values `(c-exp ...)
 ;;;         <formatted-c-code>)
 (defun replace-arguments (piece-c-code arg-list)
@@ -1770,7 +1770,7 @@
       (values `(cl:list 'sc::c-exp ,cexpstr ,@arg-list)
               formatted-c-code) )))
 
-;; マクロ本体を backquote-macro に変換
+;; ������������篏���� backquote-macro ���紊����
 (defun to-eval-macroarg (scized-defmacro macro-arg-list)
   (if (atom scized-defmacro)
       (if (member scized-defmacro macro-arg-list)
@@ -1779,7 +1779,7 @@
     `(cl:list ,@(mapcar (suffixed-func #'to-eval-macroarg macro-arg-list)
                         scized-defmacro))))
 
-;;; %defmacro-cexp 中のCコードの断片を可能ならSC化
+;;; %defmacro-cexp 筝����C��潟�若�������������������純�����SC���
 (defun defmacro-cexp-c2sc (defmacro-exp-directive)
   (assert (eq '%defmacro-cexp (car defmacro-exp-directive)))
   (destructuring-bind (macro-name piece-c-code arg-list)
@@ -1807,7 +1807,7 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-;; 環境を整えてinitiatorから構文解析開始
+;; ��医�������眼�����initiator������罕����茹ｆ�����紮�
 ;; input : input-stream or string
 (defun parser-main (input
                     &key
@@ -1879,8 +1879,8 @@
         fixed-typename-entries
         (mapcar #'make-typename-entry typename-list) )))))
 
-;; 同じ変換結果を削除する．
-;; 複数の候補の原因が型変数(or not)の場合，その変数名を特定する．
+;; ������紊����腟������������ゃ�����鐚�
+;; 茲���違�����茖����������������紊����(or not)�����翫��鐚�������紊���医�������劫��������鐚�
 (defun remove-duplicate-candidates (all-candidates)
   (let ((ret (list)))   ;; (<candidate> <typename-list> <not-typename-list>)
     (dolist (cand all-candidates)
@@ -1889,7 +1889,7 @@
                            (intersection (second (car it)) (second cand))
                            (intersection (third  (car it)) (third  cand)) ))
         (push cand ret)))
-    ;; 候補の違いに影響してない変数名を除く
+    ;; ���茖�������������綵演�帥�����������紊���医�������ゃ��
     (mapc
      #'(lambda (get-place &aux (get-placea (compose #'car get-place)))
          (dolist (tn (funcall get-placea (first ret)))
@@ -1902,7 +1902,7 @@
      (list #'cdr #'cddr))
     ret))
 
-;; tried-functionで指定された全ての場所からparsingを試みる
+;; tried-function��ф��絎���������������������贋��������parsing���荅���帥��
 (defun try-all-parsing (istring &key (tried-function *tried-function*))
   (check-type istring string)
   (let* ((all-candidates)               ; list of (<result> <tn-list> <not-tn-list>)
@@ -2031,8 +2031,8 @@
 
 ;;; (c2sc "csample/c_parser.c")
 
-;;; 対話環境での利用向けpiece-c2sc 
-;;; sc:: などの情報を除いてすっきり出力
+;;; 絲乗�援�医����с��������������piece-c2sc 
+;;; sc:: ��������������宴����ゃ����������ｃ�������阪��
 (defun pcsc (x &rest try)
   (unless try (setq try *tried-function*))
   (immigrate-package (piece-c2sc x :tried-function try) *package*))
diff --git a/src/c2scpp/src/set_mcpp.sh b/src/c2scpp/src/set_mcpp.sh
old mode 100755
new mode 100644
diff --git a/src/c2scpp/src/unset_mcpp.sh b/src/c2scpp/src/unset_mcpp.sh
old mode 100755
new mode 100644
diff --git a/src/c2scpp/tests/after_test.sh b/src/c2scpp/tests/after_test.sh
old mode 100755
new mode 100644
diff --git a/src/c2scpp/tests/set_test.sh b/src/c2scpp/tests/set_test.sh
old mode 100755
new mode 100644
diff --git a/src/init.lsp b/src/init.lsp
index 5af69d7b..9d0fba34 100644
--- a/src/init.lsp
+++ b/src/init.lsp
@@ -33,11 +33,11 @@
 
 ;;; Implementation-dependent settings
 #+cmu (setq ext:*gc-verbose* nil)
-#+clisp (progn (setq custom:*default-file-encoding* charset:euc-jp)
+#+clisp (progn (setq custom:*default-file-encoding* charset:utf-8)
                (unuse-package :ext))
 #+allegro (progn (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t)
                  (require :osi))
-#+(and allegro mswindows) (setq *locale* (find-locale "japan.EUC"))
+#+(and allegro mswindows) (setq *locale* (find-locale "ja_JP.utf8"))
 ;; #+(and composer allegro) (wt:start-composer)
 
 ;;; Printer settings
diff --git a/src/rule/hoist.rule b/src/rule/hoist.rule
index 392bb723..b62d982d 100644
--- a/src/rule/hoist.rule
+++ b/src/rule/hoist.rule
@@ -63,7 +63,7 @@
     (return-from remove-const (remove-const (car x))))
   (mapcar #'remove-const x))
 
-;; declaration, block-item の返り値を宣言部とbody部に分ける
+;; declaration, block-item ���菴������ゃ��絎ｈ��������body���������������
 (defun split-decl-and-body (x)
   (list (apply #'append (mapcar #'first x))
         (remove nil (mapcar #'second x))))
@@ -80,9 +80,9 @@
    (hst:with-hoist-env (call-next-rule) ))
   )
 
-;;; 以下, declaration, block-item の返り値は、
-;;; (<関数本体の先頭に出すS式のリスト>
-;;;  <元の場所に残すS式>)
+;;; 篁ヤ��, declaration, block-item ���菴������ゃ�����
+;;; (<��∽�井��篏���������������冴��S綣���������鴻��>
+;;;  <��������贋�����罧����S綣�>)
 
 ;;; declaration
 (defrule inlined-declaration hoist
@@ -153,12 +153,12 @@
 
 (defrule struct-declaration hoist
   (otherwise
-   (hst:with-new-func                   ; ダミーの関数を置いて，add-declされた宣言を捕まえる
+   (hst:with-new-func                   ; ��������若����∽�違��臀�������鐚�add-decl���������絎ｈ����������障�����
        (with1 ret (call-next-rule)
          ~(%splice ,.(hst:finfo-flush-decls) ,ret) )))
   )
 
-;;; 配列初期化子で参照される最大のindex数
+;;; ���������������絖���у����с�����������紊с��index���
 (defrule max-referred-index hoist
   (#?(array ,@inits)
    (with1 cnt 0
@@ -170,7 +170,7 @@
 (defrule referred-index hoist
   ;; initializer with designator
   (#?((aref-this ,@exp-list) ,init)
-   (eval (car exp-list)) )              ; 添字がLispで評価できる式であることを仮定
+   (eval (car exp-list)) )              ; 羞糸�����Lisp��ц��箴＜�с�����綣���с��������������篁�絎�
   (#?((aref ,desig ,@exp-list) ,init)
    (referred-index ~(,desig ,init)))
   ;; initializer without designator
diff --git a/src/rule/hsc-defs.lsp b/src/rule/hsc-defs.lsp
index 8bee0598..9e47e700 100644
--- a/src/rule/hsc-defs.lsp
+++ b/src/rule/hsc-defs.lsp
@@ -51,8 +51,8 @@
 ;;; function information
 (defstruct finfo
   variables                             ; list of (<id> . <type>)
-  tmp-variables                         ; 追加された一時変数 list of (<id> . <type>)
-  (function-head t)                     ; 関数の先頭のブロック通過時にnilにする
+  tmp-variables                         ; 菴遵�����������筝����紊���� list of (<id> . <type>)
+  (function-head t)                     ; ��∽�違�����������������������������������nil���������
   main-p
   )
 
@@ -100,12 +100,12 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;;; struct information
 (defstruct sinfo
-  id                                    ; 元の構造体名
+  id                                    ; ������罕����篏����
   members                               ; list of (<id> . <type>) 
-  hsc-sid                               ; 変換後の構造体名
-  data-sid                              ; データ部の構造体名（今の実装ではidと同一）
-  smap-id                               ; マップ配列の変数名
-  sdesc-id                              ; 構造体ごとのdesc情報を保持する変数名
+  hsc-sid                               ; 紊����緇����罕����篏����
+  data-sid                              ; �����若�翠�����罕����篏����鐚�篁����絎�茖���с��id������筝�鐚�
+  smap-id                               ; ������������������紊���医��
+  sdesc-id                              ; 罕����篏����������desc�����宴��篆����������紊���医��
   )
 
 (defun sinfo-asize (&optional (sinfo *sinfo*))
@@ -121,18 +121,18 @@
 
 ;; make expression for aligned size
 
-;; sinfo追加
+;; sinfo菴遵��
 (defun add-sinfo (&optional (sinfo *sinfo*))
   (push sinfo *sinfo-list*))
 
-;; sinfoをidで検索
+;; sinfo���id��ф��膣�
 (defun find-sinfo (id)
   (find id *sinfo-list* :key #'sinfo-id))
 
 (defun add-member (id type &optional (sinfo *sinfo*))
   (push (cons id type) (sinfo-members sinfo)))
 
-;; オブジェクト内の参照の位置を示す配列式
+;; ��������吾�с����������������с��篏�臀����腓冴��������綣�
 (defun make-struct-map (&optional (sinfo *sinfo*))
   (let ((vars (sinfo-members sinfo))
         (hsc-sid (sinfo-hsc-sid sinfo))
@@ -152,7 +152,7 @@
                 ,member-id)))
   )
 
-;; オブジェクト情報構造体式を作る
+;; ��������吾�с����������掩�����篏�綣����篏����
 (defun make-descriptor (&optional (sinfo *sinfo*))
   (let ((hsc-sid (sinfo-hsc-sid sinfo))
         (smap-id (sinfo-smap-id sinfo)))
diff --git a/src/rule/hsc.rule b/src/rule/hsc.rule
index e19fc723..570c04e3 100644
--- a/src/rule/hsc.rule
+++ b/src/rule/hsc.rule
@@ -24,10 +24,10 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;;; HSC -> LW-SC （要hoisting, type, temp）
+;;; HSC -> LW-SC 鐚�荀�hoisting, type, temp鐚�
 
-;; 未対応
-;; ・構造体がメンバとして構造体を持つ場合
+;; ���絲上��
+;; ��紙�����篏������＜�潟�����������罕����篏���������ゅ�翫��
 
 (scr:require "HSC-DEFS")
 
@@ -60,7 +60,7 @@
   (#?(,scs[storage-class-specifier]
       (,fname ,@arg-list) (,fntag[function-tag] ,rtype ,@type-list {,va-arg[vaarg-tag]})
       ,@body)
-     (if (or (cid-p fname) (cid-p fntag)) (list x)   ; csym::なら何もしない
+     (if (or (cid-p fname) (cid-p fntag)) (list x)   ; csym::������篏�������������
        (let* ((hsc:*finfo* (hsc:make-finfo :main-p (eq fname ~hsc-main)))
 	      (vaarg-ret (if-pattern-variable va-arg (list (get-retval va-arg))))
               (rtype-ret (type-expression! rtype))
@@ -86,12 +86,12 @@
        (let ((sbody-ret (mapcar #'struct-declaration sbody)))
          (list
           'splice
-          ~(def (struct ,data-sid) ,@sbody-ret) ; 元の構造体情報
+          ~(def (struct ,data-sid) ,@sbody-ret) ; ������罕����篏�������
           ~(def (struct ,hsc-sid)	; <sid> --> {<type_info>, <ptr to descriptor>, <sid>_data}
 	     (def d desc-t)
 	     (def data (struct ,data-sid)))
-          ~(def ,smap-id (array size-t) ,(hsc:make-struct-map)) ; オブジェクト中の参照の位置
-          ~(def ,sdesc-id descriptor ,(hsc:make-descriptor)) ; 構造体固有の情報(descriptor)
+          ~(def ,smap-id (array size-t) ,(hsc:make-struct-map)) ; ��������吾�с�����筝���������с��篏�臀�
+          ~(def ,sdesc-id descriptor ,(hsc:make-descriptor)) ; 罕����篏���堺�����������(descriptor)
           )))))
   ;; union (not featured)
   (#?(def (union ,sid) ,@sbody)
@@ -106,7 +106,7 @@
      ~(,scs ,id ,texp-ret 0)))
   ;; variable (otherwise)
   (#?(,scs[storage-class-specifier] ,id[identifier] ,texp {,init})
-   ;;ptrならmove対象としてリストに加える。csym::がついていたらmove対象から外す。
+   ;;ptr������move絲乗院��������������鴻�����������������csym::�����ゃ��������������move絲乗院������紊�������
    (if (cid-p id) x
      (let* ((texp-ret (type-expression texp))
             (init-ret (if-pattern-variable init (list (initializer init))
@@ -115,7 +115,7 @@
        ~(,scs ,id ,texp-ret ,@init-ret))))
   )
 
-;; メンバを*sinfo*に登録
+;; ��＜�潟�����*sinfo*�����脂��
 (defrule struct-declaration hsc
   (#?(def ,id ,texp)
    (let ((texp-ret (type-expression texp)))
@@ -123,9 +123,9 @@
      ~(def ,id ,texp-ret))))
 
 ;; type-expression
-;; * fn型に第一引数 (入れ子関数sht型)追加
+;; * fn������膃�筝�綣���� (��ャ��絖���∽��sht���)菴遵��
 ;; * array -> ptr
-;; * 構造体名を変換
+;; * 罕����篏�������紊����
 (defrule type-expression hsc
   (#?,atom[#'atom]
    x)
@@ -145,7 +145,7 @@
   (otherwise
    (mapcar #'type-expression x)))
 
-;; texpが参照型かどうかの判定
+;; texp��������у�������������������ゅ��
 (defrule ref-type-p hsc
   ((#?(ptr ,texp)
     #?(array ,@rem))
@@ -153,7 +153,7 @@
   (otherwise
    nil))
 
-;; 宣言の最後に一時変数の宣言および入れ子関数の追加
+;; 絎ｈ��������緇����筝����紊���違��絎ｈ����������喝�ャ��絖���∽�違��菴遵��
 (defrule function-body hsc
   (#?({:attr ,f-attr} { ,r-decl[register-declarator] }
                       ,@bi-list)
@@ -163,16 +163,16 @@
                             (list (get-retval r-decl)))))
             (fhead (hsc:function-head-p))
             (rembody bi-list)
-            (decls (loop for bi in bi-list ; body先頭の宣言部
+            (decls (loop for bi in bi-list ; body���������絎ｈ�����
                        as ret = (inlined-declaration (car rembody))
                        until (eq 'rule::no-match ret)
                        do (pop rembody)
                        collect ret))
-            (stats (mapcar #'statement! rembody))) ; 残りのstatement部
+            (stats (mapcar #'statement! rembody))) ; 罧�������statement���
        (nconc pre decls
               (when fhead
-                (nconc (hsc:make-add-decls) ; 一時変数の宣言
-                       (list (hsc:make-nestfunc)))) ; 入れ子関数定義
+                (nconc (hsc:make-add-decls) ; 筝����紊���違��絎ｈ��
+                       (list (hsc:make-nestfunc)))) ; ��ャ��絖���∽�医��臂�
               stats)))
   )
 
@@ -232,22 +232,22 @@
 				     (bit-or TYPE-STRUCT ; type-id (see "hsc.sh")
 					     (cast size-t ; descriptor
 						   (ptr ,(hsc:sinfo-sdesc-id sinfo)))))
-                               ,init-ret) ; もともとのデータ
+                               ,init-ret) ; ��������������������若��
                        ))))
   ;; field reference
-  ;; (struct d data) に変わっているのでdata部を指すように変更
+  ;; (struct d data) ���紊������ｃ��������������data���������������������紊����
   (#?(the ,texp (fref ,exp ,@id-list))
-   (let* ((exp-ret (expression! exp))   ; fref第一式
+   (let* ((exp-ret (expression! exp))   ; fref膃�筝�綣�
           (exp-type (second exp-ret)))
      (aif (and (tagged-p ~struct exp-type)
                (hsc:find-sinfo (second exp-type)))
          ~(the ,texp (fref ,exp-ret data ,@id-list))
-       (progn                           ; 未定義または構造体型でない
+       (progn                           ; ���絎�臂���障�����罕����篏������с�����
          (warn "~S (type of ~S) is not defined as structure"
                exp-type (third exp))
          ~(the ,texp (fref ,exp-ret ,@id-list))))))
-  ;; array object: body部を参照するように変更
-  ;; indexがない場合は，Cへの関数渡し用に，単にbodyを参照する
+  ;; array object: body�����������с��������������紊����
+  ;; index�����������翫�����鐚�C��吾����∽�井検���������鐚�������body��������с�����
   (#?(the (array ,texp) (aref ,exp))
    (let* ((texp-ret (type-expression! texp))
 	  (exp-ret (expression! exp)))
@@ -266,7 +266,7 @@
   ;; function call
   (#?(the ,texp (call (the (ptr (,ftag ,@texp-list)) ,exp)
                       ,@exp-list))
-     (let ((exp-ret (expression! (second (third x)))) ; call第一式
+     (let ((exp-ret (expression! (second (third x)))) ; call膃�筝�綣�
            (expl-ret (mapcar #'expression! exp-list)))
        (if (or (eq 'csym::fn ftag) (cid-p exp))
            ~(the ,texp (call ,exp-ret ,@expl-ret))
diff --git a/src/rule/hsc.sc b/src/rule/hsc.sc
index 26140fd1..df7c6ddf 100644
--- a/src/rule/hsc.sc
+++ b/src/rule/hsc.sc
@@ -39,7 +39,7 @@
 (%include "rule/nestfunc-setrule.sh")
 (%include "hsc.sh")
 
-;;; gc-initで無指定(=0)の場合に採用される値
+;;; gc-init��х�≧��絎�(=0)�����翫������｡���������������
 (%ifndef TOSIZE
     ((%defconstant TOSIZE (* 5 1024 1024))) )
 ;; (%ifndef ROOTSIZEMAX
@@ -51,7 +51,7 @@
 (%ifndef GC-LIMITED-STACK-MAX
     ((%defconstant GC-LIMITED-STACK-MAX 32)) )
 
-;;; ポインタ判定
+;;; �����ゃ�潟�水�ゅ��
 (%defmacro MREF-AS (tp p)
   `(mref (cast (ptr ,tp) ,p)))
 
@@ -111,7 +111,7 @@
 (static-def new-memory-end (ptr char))
 
 ;; Referred in move & gc-breadth-first
-(static-def b (ptr char))               ; moveの次の移動先
+(static-def b (ptr char))               ; move���罨＜��腱糸�����
 
 ;; *link = move(*link);
 (def (csym::move vp) (csym::fn (ptr void) (ptr void))
@@ -128,7 +128,7 @@
   ;; Object not located in From Space
   (if (not (IN-FROM p))
       (return vp))
-  ;; オブジェクトの先頭 (sizeof size-t)[byte] は
+  ;; ��������吾�с�������������� (sizeof size-t)[byte] ���
   ;; fowarding pointer OR (bit-or least2bit-tag pointer-to-descriptor)
   (= tag (bit-and #b11 (MREF-AS size-t p)))
   (= fwp (cast (ptr void)
@@ -137,7 +137,7 @@
   (if (IN-TOSP fwp)
       (return fwp))
   
-  ;; オブジェクトの先頭 sizeof(int) bytes --- (fref ,obj type)
+  ;; ��������吾�с�������������� sizeof(int) bytes --- (fref ,obj type)
   ;; LSB==1: type-id
   ;; LSB==0: forwarding pointer
   (switch tag
@@ -155,13 +155,13 @@
     (default)
     (error "Illegal type ID!"))
   
-  (= np b)                              ; 移動先
-  (= nb (+ np asize))                   ; 次の移動先
+  (= np b)                              ; 腱糸�����
+  (= nb (+ np asize))                   ; 罨＜��腱糸�����
   (if (>= nb new-memory-end)
       (error "buffer overrun."))
   (MEMCPY np p size)
-  (= b nb)                              ; 移動先を更新
-  (= (FWPTR p) np)                      ; 跡地にfowarding pointer
+  (= b nb)                              ; 腱糸����������贋��
+  (= (FWPTR p) np)                      ; 莊≦�違��fowarding pointer
   (return np))
 
 ;; BREADTH-FIRST-GC
@@ -180,7 +180,7 @@
   (if (fref params gcv)
       (csym::printf "BREADTH-FIRST-GC start~%"))
   (= b new-memory) (= s b)
-  (scan)                                ; stackから直接指されているobjをcopy
+  (scan)                                ; stack��������贋･������������������obj���copy
   (while (< s b)                        ; for each copied object
     (= tag (bit-and #b11 (MREF-AS size-t s)))
     (switch tag
@@ -222,12 +222,12 @@
       (csym::printf "GC complete (%d)~%" allocated-size))
   )
 
-;; 性能測定用
+;; ��ц�醇謙絎����
 (def gc-ttime double)
 (def tp1 (struct timeval))
 (def tp2 (struct timeval))
 
-;; GC開始
+;; GC���紮�
 (def (gc scan) (fn void sht)
   (csym::gettimeofday (ptr tp1) 0)
   (switch (fref params gctype)
@@ -252,7 +252,7 @@
   (if (== (fref params tosize) 0) (= (fref params tosize) TOSIZE))
   (+= (fref params tosize) 3)
   (-= (fref params tosize) (bit-and (fref params tosize) 3))
-                                        ; 下位2bitが00になるように繰り上げ
+                                        ; 筝�篏�2bit���00������������������膵違��筝����
   (if (== (fref params stack-size) 0) 
       (= (fref params stack-size) GC-STACK-SIZE))
   (if (== (fref params limited-stack-max) 0)
@@ -262,7 +262,7 @@
                 (fref params tosize)
                 (fref params stack-size)
                 (fref params limited-stack-max) )
-  ;; heap領域の確保
+  ;; heap���������腆坂��
   (= old-memory (csym::myalloc (fref params tosize)))
   (= old-memory-end (+ old-memory (fref params tosize)))
   (= new-memory (csym::myalloc (fref params tosize)))
diff --git a/src/rule/hsc.sh b/src/rule/hsc.sh
index 0b989daa..a46f3a4e 100644
--- a/src/rule/hsc.sh
+++ b/src/rule/hsc.sh
@@ -32,13 +32,13 @@
 ;; (deftype size-t long)
 (deftype align-t double)
 
-;;; (def d desc-t) の下位2ビットに埋め込む
+;;; (def d desc-t) ���筝�篏�2������������������莨若��
 (%defconstant TYPE-STRUCT 0)
 (%defconstant TYPE-REF-ARRAY 1)
 (%defconstant TYPE-NONREF-ARRAY 3)
 
-;;; 構造体<sid>の構造（hsc.ruleより）
-;; ~(def (struct ,data-sid) ,@sbody-ret) ; 元の構造体情報は <sid>_data
+;;; 罕����篏�<sid>���罕����鐚�hsc.rule������鐚�
+;; ~(def (struct ,data-sid) ,@sbody-ret) ; ������罕����篏������宴�� <sid>_data
 ;; ~(def (struct ,sid)     ; <sid> --> {<type_info>, <ptr to descriptor>, <sid>_data}
 ;;   (def d desc-t)        ; (ptr (struct desc-struct))
 ;;   (def data (struct ,data-sid))
@@ -54,7 +54,7 @@
 (deftype desc-t (ptr descriptor))
 
 (def (struct array-object)
-  (decl d desc-t)   ; 下位2bit以外はダミー
+  (decl d desc-t)   ; 筝�篏�2bit篁ュ��������������
   (decl length int)
   (decl el-size size-t)
   (decl size size-t)
diff --git a/src/rule/labeled-break.rule b/src/rule/labeled-break.rule
index 27dfdf3a..08870c50 100644
--- a/src/rule/labeled-break.rule
+++ b/src/rule/labeled-break.rule
@@ -22,10 +22,10 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;;;;; Javaとかで使うlabelつきbreak,continueをSCでも使用できるようにする．
-;;; *label-list* = list of (<do-while等についたラベル>
-;;;                         <continue用のgoto先ラベル>
-;;;                         <break用のgoto先ラベル>) 
+;;;;; Java��������т戎���label��ゃ��break,continue���SC��с��篏睡����с��������������������鐚�
+;;; *label-list* = list of (<do-while膈������ゃ��������������>
+;;;                         <continue������goto������������>
+;;;                         <break������goto������������>) 
 
 (defvar *label-list*)
 
diff --git a/src/rule/multithread-defs.lsp b/src/rule/multithread-defs.lsp
index 94311437..b9245eeb 100644
--- a/src/rule/multithread-defs.lsp
+++ b/src/rule/multithread-defs.lsp
@@ -37,22 +37,22 @@
 
 (defvar *current-func* nil)
 
-;(<ラベル 変数><入れ子関数名><ローカル変数><スレッドの判断(生成か継続か)>)
+;(<��������� 紊����><��ャ��絖���∽�医��><�����若�����紊����><��鴻�������������ゆ��(���������膓�膓����)>)
 (defstruct finfo
-  ;; 関数名? <- 違った。たぶん李さんの勘違い
-  ;; 関数名として使うことにする
+  ;; ��∽�医��? <- �����ｃ����������吟�����������������������
+  ;; ��∽�医�����������篏帥�����������������
   id
-  ;; 返り値の型
+  ;; 菴������ゃ�����
   rettype 
-  ;; 関数の先頭に追加する宣言のリスト
+  ;; ��∽�違�����������菴遵��������絎ｈ����������鴻��
   decl
-  ;; 計算がどこまで終わったかを示すラベル名のリスト
+  ;; 荐�膊������������障�х�������ｃ��������腓冴����������������������鴻��
   ;; list of ( <label-id> <retval-id> )
-  ;; 出現順にpush
+  ;; ��榊憥�����push
   label
-  ;; 入れ子関数の名前
+  ;; ��ャ��絖���∽�違��������
   nfunc-id
-  ;; 次につけるlnの値?
+  ;; 罨＜����ゃ�����ln������?
   ;; ln)
   )
 
@@ -84,7 +84,7 @@
 (defun make-nestfunc-id (f-id)  
   (generate-id (string+ (identifier f-id) "_c")))
 
-; block-item-listから先頭の宣言部分を取り出す
+; block-item-list���������������絎ｈ�������������������冴��
 (defun separate-decl (bil &aux dcl-list oth-list)
   (dolist (bi bil (list (nreverse dcl-list) (nreverse oth-list)))
     (if (and (consp bi)
@@ -92,7 +92,7 @@
 	(push bi dcl-list)
         (push bi oth-list))))
 
-;; 入れ子関数の定義を生成
+;; ��ャ��絖���∽�違��絎�臂����������
 (defun make-nestfunc (nf-body)
   #|
   (setq label-l (get-id-from-string (string+ "@L" (write-to-string ln))))
@@ -113,10 +113,10 @@
 		  (return))
 	  (return)
 	  
-	  ;;<入れ子関数の文>部分
+	  ;;<��ャ��絖���∽�違�����>������
 	  ,@nf-body
-	  ;;関数の最後にreturnがない場合もちゃんと呼び出し元のスレッドを
-	  ;;runnableにしてからスケジューラにreturn
+	  ;;��∽�違�����緇����return�����������翫�������＜����������若�喝�冴����������鴻�����������
+	  ;;runnable�����������������鴻�宴�吾�ャ�若�����return
 	  (= (fref cp -> c) c_p)
 	  (= (fref cp -> stat) thr_runnable)
 	  (return))
diff --git a/src/rule/multithread-hoist.rule b/src/rule/multithread-hoist.rule
index 0a31c2e1..5c2512d1 100644
--- a/src/rule/multithread-hoist.rule
+++ b/src/rule/multithread-hoist.rule
@@ -24,7 +24,7 @@
 
 (define-ruleset multithread-hoist (hoist))
 
-;; マルチスレッド用プリミティブ
+;; �����������鴻�������������������������ｃ��
 (extendrule block-item multithread-hoist
   ((#?(thread-create ,@body) )
    (let ((body-ret (function-body body)))
diff --git a/src/rule/multithread-rename.rule b/src/rule/multithread-rename.rule
index 5c082e59..40110086 100644
--- a/src/rule/multithread-rename.rule
+++ b/src/rule/multithread-rename.rule
@@ -24,7 +24,7 @@
 
 (define-ruleset multithread-rename (rename))
 
-;; マルチスレッド用プリミティブ
+;; �����������鴻�������������������������ｃ��
 (extendrule block-item multithread-rename
   ((#?(thread-create ,@body) )
    (ren:inc-block-level
diff --git a/src/rule/multithread-sc1.rule b/src/rule/multithread-sc1.rule
index e4602bfa..b3a065b7 100644
--- a/src/rule/multithread-sc1.rule
+++ b/src/rule/multithread-sc1.rule
@@ -24,7 +24,7 @@
 
 (define-ruleset multithread-sc1 (sc1-to-sc0))
 
-;; マルチスレッド用プリミティブ
+;; �����������鴻�������������������������ｃ��
 (extendrule statement multithread-sc1
   (#?(thread-create ,@body)
    ~(thread-create ,@(function-body body)) )
diff --git a/src/rule/multithread-temp.rule b/src/rule/multithread-temp.rule
index 79be7802..5730fa3d 100644
--- a/src/rule/multithread-temp.rule
+++ b/src/rule/multithread-temp.rule
@@ -24,7 +24,7 @@
 
 (define-ruleset multithread-temp (temp))
 
-;; マルチスレッド用プリミティブ
+;; �����������鴻�������������������������ｃ��
 (extendrule statement multithread-temp
   (#?(thread-create ,@body)
    ~(thread-create ,@(function-body body)) )
diff --git a/src/rule/multithread-type.rule b/src/rule/multithread-type.rule
index 7f19d711..1f6ade48 100644
--- a/src/rule/multithread-type.rule
+++ b/src/rule/multithread-type.rule
@@ -24,7 +24,7 @@
 
 (define-ruleset multithread-type (type-info))
 
-;;; マルチスレッド用プリミティブ
+;;; �����������鴻�������������������������ｃ��
 (extendrule statement multithread-type
   (#?(thread-create ,@body)
    (type:with-new-environment
diff --git a/src/rule/multithread.rule b/src/rule/multithread.rule
index 55abc024..1a1ee287 100755
--- a/src/rule/multithread.rule
+++ b/src/rule/multithread.rule
@@ -42,8 +42,8 @@
 
 ;;;;;; declaration ;;;;;;
 
-;; declaration, block-item, expression の返り値は
-;;(<入れ子関数のitem-list> <元の関数のitem-list>)
+;; declaration, block-item, expression ���菴������ゃ��
+;;(<��ャ��絖���∽�違��item-list> <��������∽�違��item-list>)
 (extendrule inlined-declaration multithread
   ;; function
   ((#?(,scs[storage-class-specifier] (,func-id ,@arg-id[identifier])
@@ -69,7 +69,7 @@
                 ~(,scs (,func-id c-p ,@arg-id)
                        (fn ,func-texp cont-f ,@arg-texp)
                        ,@new-decl ,@add-decl ,def-nfunc ,@new-body)
-                ;;msc-main関数なら、main関数の定義を追加
+                ;;msc-main��∽�違��������main��∽�違��絎�臂����菴遵��
                 (when (eq ~msc-main func-id)
                   (list ~(%include "rule/multithread-main.sc"))))) ))))
   (otherwise
@@ -154,7 +154,7 @@
                  ,@caller-resume
                  (return))
                ~((return ,return-exp)))))) )
-  ;;; <--- マルチスレッド用プリミティブ
+  ;;; <--- �����������鴻�������������������������ｃ��
   ((#?(thread-create ,@body))
    (let* ((ln (1+ (length (mt:finfo-label mt:*current-func*))))
           (label-l (generate-id (string+ "L" (write-to-string ln))))
@@ -214,13 +214,13 @@
   ((#?(thread-resume ,exp))
    (list (list ~(thr-resume ,exp))
          (list ~(thr-resume ,exp))) )
-  ;;; マルチスレッド用プリミティブ --->
+  ;;; �����������鴻�������������������������ｃ�� --->
   ;; expression-statement
   (otherwise
    (expression x))
   )
 
-;;; thread-createの最初の宣言用
+;;; thread-create������������絎ｈ�����
 (defrule mtcreate-decl multithread
   ((#?(,id[identifier] ,texp ,@init))
    (mtcreate-decl (cons ~def x)))
@@ -230,16 +230,16 @@
 
 ;;;;;;;;;;;
 ;;; expression
-;;; tmp.ruleの変換結果により、callは
+;;; tmp.rule���紊����腟����������������call���
 ;;; (the void (call (the ,texp ,exp) ,@exp-list))
-;;; か、
+;;; ������
 ;;; (the ,texp (= (the ,texp ,id) (the ,texp (call (the ,texp ,exp) ,@exp-list)))
-;;; のどちらかの形で現れるようになっている。
+;;; ��������＜��������綵≪�х憗�������������������ｃ�����������
 
 (defrule expression multithread
   ;; function-call
-  ;; ・引数の値を保存
-  ;; ・呼び出す関数のポインタも保存
+  ;; ��糸����違����ゃ��篆�絖�
+  ;; ��糸�若�喝�冴����∽�違�������ゃ�潟�帥��篆�絖�
   ((#? #1=(the ,texp (call (the (ptr (,fn-tag[function-tag] ,fexp1 ,@fexp)) ,exp-f)
                            ,@arg-list))
     #?(the ,texp0 (= (the ,texp1 ,id) #1#)))
@@ -251,14 +251,14 @@
             (renew-ln ~(= ln ,ln))
             (label-stat ~(label ,label-l nil))
             (tmp-id (if-pattern-variable id id nil))
-            ;; 第1引数に入れ子関数へのポインタを追加
+            ;; 膃�1綣���違����ャ��絖���∽�違�吾�������ゃ�潟�帥��菴遵��
             (call-exp ~(,exp-f ,nfunc-id ,@arg-list))
             (new-exp (if-pattern-variable id ~(= ,id ,call-exp) call-exp)))
        (push (list label-l tmp-id)
              (mt:finfo-label mt:*current-func*))
        (list (list renew-ln new-exp label-stat)
              (list renew-ln new-exp)) )))
-  ;; その他の式，c-exp
+  ;; ������篁����綣�鐚�c-exp
   ((#?(the ,@rem))
    (list (list x) (list x)) )
   ((#?(c-exp ,@rem))
diff --git a/src/rule/multithread.sh b/src/rule/multithread.sh
index eb16d27d..739ccdcc 100644
--- a/src/rule/multithread.sh
+++ b/src/rule/multithread.sh
@@ -32,28 +32,28 @@
 
 (decl (struct _thstelm))
 
-;; 継続用入れ子関数の呼び出し理由
+;; 膓�膓������ャ��絖���∽�違����若�喝�冴��������
 (deftype reason enum rsn-cont rsn-retval)
 
-;; 継続用入れ子関数のポインタ
+;; 膓�膓������ャ��絖���∽�違�������ゃ�潟��
 (deftype
     cont-f 
     (ptr (NESTFUNC-TAG (ptr void) (ptr (struct _thstelm)) reason)))
 
-;; スレッドの状態
+;; ��鴻�������������倶��
 (def (enum _stat)
-     ;; 停止中で，暗黙的継続も有効
+     ;; ���罩≫賢��э�����藥����膓�膓����������
      thr-new-suspended
-     ;; 実行可能で、暗黙的継続も有効
+     ;; 絎�茵������純�с�����藥����膓�膓����������
      thr-new-runnable
-     ;; 停止中で、明示的継続のみ有効
+     ;; ���罩≫賢��с�����腓榊��膓�膓������炊�����
      thr-suspended
-     ;; 実行可能で、明示的継続のみ有効
+     ;; 絎�茵������純�с�����腓榊��膓�膓������炊�����
      thr-runnable
-     ;; 明示的継続(cont-f c)は無効
+     ;; ���腓榊��膓�膓�(cont-f c)�����≦��
      thr-scheduled)
 
-;; スレッド管理用スタックの要素
+;; ��鴻��������膊∞�������鴻�帥��������荀�膣�
 (def (struct _thstelm)
      (def c cont-f)
      (def stat (enum _stat)))
@@ -63,24 +63,24 @@
 (deftype thst-ptr (ptr (struct _thstelm)))
 (deftype cont thst-ptr)
 
-;; スレッド管理用スタック
+;; ��鴻��������膊∞�������鴻�帥�����
 (def thst (array thstelm 65536))
 
-;; スレッド管理用スタックのトップ
+;; ��鴻��������膊∞�������鴻�帥�����������������
 (def thst-top thst-ptr thst)
 
 (deftype schdexit (ptr (NESTFUNC-TAG void)))
 
-;; スケジューラの非局所脱出先
+;; ��鴻�宴�吾�ャ�若��������絮������怨�阪��
 (def cur-schd-exit schdexit 0)
 (def cur-schd-thst-top thst-ptr thst)
 
 (def scheduling (fn void)
      (def L0 --label--)
-     ;;元のスケジューラの情報
+     ;;��������鴻�宴�吾�ャ�若�����������
      (def prev-exit schdexit cur-schd-exit)
      (def prev-thst-top thst-ptr cur-schd-thst-top)
-     ;;このスケジュラの情報
+     ;;��������鴻�宴�吾�ャ�����������
      (def mythst-top thst-ptr thst-top)
      (def nonlocalexit (NESTFUNC-TAG void) (goto L0))
 
@@ -89,15 +89,15 @@
      (= cur-schd-thst-top (= thst-top mythst-top))
      (while 1
        (let ((cp thst-ptr))
-	 ;;ここで元のスケジューラへの非局所脱出を試みる
+	 ;;��������у�������鴻�宴�吾�ャ�若����吾�����絮������怨�冴��荅���帥��
 	 (for ((= cp prev-thst-top)
 	       (< cp mythst-top)
 	       (inc cp))
 	    (if (!= (fref cp -> stat) thr-scheduled) (break))
-	    ;; 間が全て thr-scheduled なら
+	    ;; ������������ thr-scheduled ������
 	    (if (== cp mythst-top) (if prev-exit (prev-exit)))))
 
-       ;; runnableなスレッドを探す
+       ;; runnable�����鴻������������｢���
        (let ((cp thst-ptr)
 	     (cc cont-f))
 	 (for ((= cp (- thst-top 1))
@@ -108,8 +108,8 @@
 		  (break)))
 	 (if (< cp thst)
 	     (begin
-	      ;; 見つからなかったときは他のプロセッサからの要求を処理すべし
-	      ;; 今回は何もしない
+	      ;; 荀���ゃ�������������ｃ�����������篁������������祉����泣��������荀�羆���������������鴻��
+	      ;; 篁�������篏�������������
 	      (c-exp "fprintf(stderr, ~A)" "No Active thread!~%")
 	      (c-exp "exit(1)")
 	      ))
@@ -118,12 +118,12 @@
 	   (= (fref cp -> c) 0)
            (= (fref cp -> stat) thr-scheduled)
 	   (cc cp rsn-cont)))
-       ;;直下がnew-runnableならpopし、そちらに制御を移す
+       ;;��岩�����new-runnable������pop�����������＜�������九勝���腱祉��
        (if (and (> thst-top thst)
 		(== (fref (- thst-top 1) -> stat) thr-new-runnable))
 	   (begin (dec thst-top) (break))))
 
-     ;; 元のスケジューラの情報を戻す
+     ;; ��������鴻�宴�吾�ャ�若����������宴����祉��
      (= cur-schd-exit prev-exit)
      (= cur-schd-thst-top prev-thst-top))
 
diff --git a/src/rule/nestfunc-defs.lsp b/src/rule/nestfunc-defs.lsp
index 272cd88b..5b7cf794 100644
--- a/src/rule/nestfunc-defs.lsp
+++ b/src/rule/nestfunc-defs.lsp
@@ -52,51 +52,51 @@
 
 
 (defstruct finfo 
-  name                                  ;関数名
-  parent-func                           ;親関数のfinfo構造体（非nil iff 入れ子関数）
-  ret-type                              ;返り値の型
-  argp                                  ;argpの要/不要 (=入れ子関数呼び出しの有無)
-  ;; (<復帰位置を示すラベル名> . <フレーム復帰用コード>) のリスト(逆順)
+  name                                  ;��∽�医��
+  parent-func                           ;荀���∽�違��finfo罕����篏�鐚����nil iff ��ャ��絖���∽�逸��
+  ret-type                              ;菴������ゃ�����
+  argp                                  ;argp���荀�/筝�荀� (=��ャ��絖���∽�医�若�喝�冴�����������)
+  ;; (<緇�絽遺��臀����腓冴��������������> . <��������若��緇�絽亥����潟�若��>) ��������鴻��(������)
   label-list
   ;; ( <symbol> . <texp> )
-  ;; frameには var-list #|と tmp-listの両方を|# 入れる
-  ;; （nf-list の orig-name も入れる）
-  ;; frame-save, frame-resume はvar-listのみ
-  ;; tmp-list は不要か？
-  var-list                              ;通常のローカル変数のリスト＋関数のポインタ保存用
-  tmp-list                              ;一時変数のリスト（call時の引数，入れ子関数ポインタ保存用）
-  nf-list                               ;定義された入れ子関数のリスト ( <orig-name> . <ext-name> )
-  ;; 明示的スタックを参照するローカル変数．list of <id(symbol)>
-  ;; var-listと重複．入れ子関数は nf-listで管理するのでここには入れない
-  ;; search-ptr での収集方針により，var-listでないものも入り得る．
+  ;; frame������ var-list #|��� tmp-list���筝≧�鴻��|# ��ャ�����
+  ;; 鐚�nf-list ��� orig-name �����ャ�����鐚�
+  ;; frame-save, frame-resume ���var-list������
+  ;; tmp-list ���筝�荀����鐚�
+  var-list                              ;���絽吾�������若�����紊���違�������鴻��鐚���∽�違�������ゃ�潟�推��絖����
+  tmp-list                              ;筝����紊���違�������鴻��鐚�call������綣���逸����ャ��絖���∽�違����ゃ�潟�推��絖����鐚�
+  nf-list                               ;絎�臂������������ャ��絖���∽�違�������鴻�� ( <orig-name> . <ext-name> )
+  ;; ���腓榊����鴻�帥�������������с����������若�����紊���逸��list of <id(symbol)>
+  ;; var-list������茲�鐚���ャ��絖���∽�違�� nf-list��х�∞�������������с�������������ャ��������
+  ;; search-ptr ��с����������拷�����������鐚�var-list��с����������������ャ��緇����鐚�
   estack-var
-  ;; staticで定義された変数 (<orig-name> . <ext-name>)．var-listと重複．
+  ;; static��у��臂����������紊���� (<orig-name> . <ext-name>)鐚�var-list������茲�鐚�
   static-var
-  ;; 局所ラベルのリスト(def ,id __label__)で定義。入れ子関数脱出用
-  ;; (<ラベル名> . <復帰コード>)。宣言と逆順
+  ;; 絮���������������������鴻��(def ,id __label__)��у��臂������ャ��絖���∽�域�怨�榊��
+  ;; (<������������> . <緇�絽違�潟�若��>)���絎ｈ�����������
   local-label
   )
 
-;; フレーム構造体の管理
+;; ��������若��罕����篏����膊∞��
 (defstruct frame-struct-info
-  name                                  ; 構造体名 (SCのid)
-  func-name                             ; 対応する関数名 (SCのid)
+  name                                  ; 罕����篏���� (SC���id)
+  func-name                             ; 絲上����������∽�医�� (SC���id)
   )
 
-;;; global関数名
+;;; global��∽�医��
 (defvar *global-funcs* '())
 
-;;; 関数フレームの構造体情報
-;;; ( <関数名(symbol)> . <構造体情報> ) のリスト
-;;; <構造体情報> := ( <構造体名> ) 
+;;; ��∽�違�������若�����罕����篏�������
+;;; ( <��∽�医��(symbol)> . <罕����篏�������> ) ��������鴻��
+;;; <罕����篏�������> := ( <罕����篏����> ) 
 (defvar *frame-alist* '() )
-;;; 現在いる関数の情報
+;;; �憜����������∽�違��������
 (defvar *current-func* nil)
 
 (defvar *estack-size* 65536)
 (defvar *all-in-estack* nil)
 
-;;;; 環境設定
+;;;; ��医��荐�絎�
 (defmacro with-nestfunc-environment (&body body)
   `(let ((*global-funcs* '())
          (*estack-size* (ruleset-param 'rule::estack-size))
@@ -106,7 +106,7 @@
      ,@body))
 
 
-;;;; 関数
+;;;; ��∽��
 
 (defun add-global-func (fid)
   (push fid *global-funcs*))
@@ -114,17 +114,17 @@
 (defun global-func-p (fid)
   (member fid *global-funcs* :test #'eq))
 
-;;; マルチスレッド環境で，スタックの最初のフレームを判断する条件
+;;; �����������鴻����������医����э����鴻�帥�������������������������若�������ゆ����������＞散
 (defun thread-origin-p (finfo-or-fid)
   (let ((fid (if (symbolp finfo-or-fid)
                  finfo-or-fid
                (finfo-name finfo-or-fid))))
     (or (eq ~main fid)
-        (eq ~thread-origin fid))))      ; 不要か？
+        (eq ~thread-origin fid))))      ; 筝�荀����鐚�
 
 
-;;; 関数名を*frame-alist*から探して関数フレームの構造体情報を得る。
-;;; 未登録の場合は登録して、登録した構造体情報を返す。
+;;; ��∽�医�����*frame-alist*�������｢��������∽�違�������若�����罕����篏������宴��緇�������
+;;; �����脂�蚊����翫�������脂�蚊����������脂�蚊�����罕����篏������宴��菴�������
 (defun get-frame (x)
   (let* ((asc (assoc x *frame-alist* :test #'eq)))
     (if asc
@@ -135,34 +135,34 @@
         (push (cons x frame-info) *frame-alist*)
         frame-info))))
 
-;;; 関数名=>関数のフレーム構造体名
+;;; ��∽�医��=>��∽�違����������若��罕����篏����
 (defun get-frame-name (fname)
   (frame-struct-info-name (get-frame fname)))
 
-;;; 現関数（親は含まない）のlocal-variableか？
-;;; tmp-list内のもの，入れ子関数は検索対象ではない．
+;;; �憥�∽�逸��荀���������障�����鐚����local-variable���鐚�
+;;; tmp-list������������鐚���ャ��絖���∽�違��罎�膣√�乗院��с��������鐚�
 (defun local-variable-p (id &optional (finfo *current-func*))
   (and *current-func*
        (assoc id (finfo-var-list finfo) :test #'eq)))
 
-;;; 現関数（親は含まない）の明示的スタックに値があるlocal-variableか？
+;;; �憥�∽�逸��荀���������障�����鐚�������腓榊����鴻�帥����������ゃ��������local-variable���鐚�
 (defun estack-variable-p (id &optional (finfo *current-func*)
-                                       (skip-lv-check nil)) ; local-variable-p のチェックを省略
+                                       (skip-lv-check nil)) ; local-variable-p ��������������������
   (and (or skip-lv-check (local-variable-p id finfo))
        (member id (finfo-estack-var finfo) :test #'eq)))
 
-;;; 現関数（親は含まない）でstaticで定義されたlocal-variableか？
-;;; そうなら，ext-idを返す．
+;;; �憥�∽�逸��荀���������障�����鐚����static��у��臂����������local-variable���鐚�
+;;; ������������鐚�ext-id���菴����鐚�
 (defun static-variable-p (id &optional (finfo *current-func*)
-                                       (skip-lv-check nil)) ; local-variable-p のチェックを省略
+                                       (skip-lv-check nil)) ; local-variable-p ��������������������
   (and (or skip-lv-check (local-variable-p id finfo))
        (cdr (assoc id (finfo-static-var finfo) :test #'eq))))
 
-;;; 現関数(=0)からいくつ外の関数で定義された local-variable/nestfunc か?
-;;; 見つからなければ -1
-;;; 第二返り値は local-varriable-> :var, nestfunc-> :nestfunc
-;;; 第三返り値は 見つかった関数のfinfo
-;;; 第四返り値は local-variable-p/nestfunc-extid の返り値
+;;; �憥�∽��(=0)��������������ゅ�������∽�違�у��臂���������� local-variable/nestfunc ���?
+;;; 荀���ゃ����������������� -1
+;;; 膃�篋�菴������ゃ�� local-varriable-> :var, nestfunc-> :nestfunc
+;;; 膃�筝�菴������ゃ�� 荀���ゃ����ｃ����∽�違��finfo
+;;; 膃����菴������ゃ�� local-variable-p/nestfunc-extid ���菴�������
 (defun howmany-outer (id &optional (finfo *current-func*))
   (labels ((rec (curfunc acc)
              (acond
@@ -175,7 +175,7 @@
               (t (rec (finfo-parent-func curfunc) (1+ acc))) )))
     (rec finfo 0)))
 
-;;; 与えられた関数情報からフレーム構造体の定義を作る
+;;; 筝���������������∽�井����宴�������������若��罕����篏����絎�臂����篏����
 (defun make-frame-def (fi)
   (let* ((frm-info (get-frame (finfo-name fi)))
          (frame-name (frame-struct-info-name frm-info))
@@ -186,19 +186,19 @@
          (member-defs (mapcar #'(lambda (x) ~(def ,(car x) ,(cdr x)))
                               member-list)))
     ~(def (struct ,frame-name)
-         (def tmp-esp (ptr char))       ; これは、絶対に先頭
+         (def tmp-esp (ptr char))       ; ������������腟九�障��������
        (def argp (ptr char))
        (def call-id int)
        ,@member-defs)))
 
-;;; 全ての関数フレーム構造体の宣言を作る
+;;; �����������∽�違�������若��罕����篏����絎ｈ�����篏����
 (defun make-all-frame-decls ()
-  (nreverse                             ; nreverseは必須ではない
+  (nreverse                             ; nreverse���綽������с��������
    (loop for (fn-name . frm-info) in *frame-alist*
        collect (with1 frame-name (frame-struct-info-name frm-info)
                  ~(decl (struct ,frame-name))))) )
 
-;;; トップレベルに追加する宣言の処理
+;;; ���������������������菴遵��������絎ｈ�����������
 (defvar *static-var-defs* ())
 (defvar *frame-defs* ())
 (defvar *nestfunc-defs* ())
@@ -221,7 +221,7 @@
   (prog1 (nreverse *nestfunc-defs*)
     (setq *nestfunc-defs* ())))
 
-;;; ブロックの先頭に追加する宣言の処理
+;;; ������������������������菴遵��������絎ｈ�����������
 (defvar *additional-local-decls* ())
 (defmacro with-new-block (&body body)
   `(let ((*additional-local-decls* ())) ,@body))
@@ -231,7 +231,7 @@
   (prog1 (nreverse *additional-local-decls*)
     (setq *additional-local-decls* ())))
 
-;;; 各文の直前に追加する文の処理
+;;; �����������翫�����菴遵��������������������
 (defvar *precedents* ())
 (defmacro with-block-item (&body body)
   `(let ((*precedents* ())) ,@body))
@@ -241,37 +241,37 @@
   (prog1 (nreverse *precedents*)
     (setq *precedents* ())))
 
-;;; 今トップレベルにいるかどうかの判定
+;;; 篁���������������������������������������������ゅ��
 (defun top-level-p (&key (finfo *current-func*))
   (not finfo))
 
-;;; --local-- で宣言された局所ラベルを追加
-;;; cons の cdr 部はフレーム復帰用コードで，後から追加
+;;; --local-- ��у�ｈ�����������絮����������������菴遵��
+;;; cons ��� cdr ��������������若��緇�絽亥����潟�若����э��緇�������菴遵��
 (defun finfo-add-local-label (id &key (finfo *current-func*))
   (push (cons id nil) (finfo-local-label finfo)))
 
-;;; *current-func*に変数情報を追加して、declaration文を返す
+;;; *current-func*���紊���井����宴��菴遵�����������declaration������菴����
 (defun finfo-add-local (id texp mode &key (init nil) (finfo *current-func*))
-  ;; mode： :var or :temp
+  ;; mode鐚� :var or :temp
   (when finfo
     (case mode
-      ((:var)                           ; （estack-varでなければ）save/resume の対象
+      ((:var)                           ; 鐚�estack-var��с����������逸��save/resume ���絲乗院
        (when (let ((ttexp (remove-type-qualifier texp)))
                (or (and (listp ttexp)
                         (eq ~array (car ttexp)))
                    *all-in-estack*))
          (pushnew id (finfo-estack-var finfo) :test #'eq))
        (push (cons id texp) (finfo-var-list finfo)))
-      ((:tmp)                           ; save/resume の対象にならない
+      ((:tmp)                           ; save/resume ���絲乗院���������������
        (push (cons id texp) (finfo-tmp-list finfo)))
-      ((:static)                        ; 外に出す．frameにも入れない．
+      ((:static)                        ; 紊������冴��鐚�frame��������ャ��������鐚�
        (let ((ext-id (generate-id
                       (string+ (identifier0! id :sc2c) "_in_" 
                                (identifier0! (finfo-name finfo) :sc2c)))))
          (push (cons id texp) (finfo-var-list finfo))
          (push (cons id ext-id) (finfo-static-var finfo))
-         (setq id ext-id)))             ; 名前を衝突しないように変更
-      ((:system)                        ; 補助変数（特に副作用なし）
+         (setq id ext-id)))             ; ���������茵�腦�������������������紊����
+      ((:system)                        ; 茖����紊���逸����鴻�����篏����������鐚�
        )
       (otherwise
        (error "unexpected value of 'mode'(~s)" mode))))
@@ -279,22 +279,22 @@
       ~(def ,id ,texp ,init)
     ~(def ,id ,texp)))
 
-;;; *current-func* に入れ子関数情報を追加
+;;; *current-func* �����ャ��絖���∽�井����宴��菴遵��
 (defun finfo-add-nestfunc (id extid &optional (finfo *current-func*))
   (push (cons id extid)
         (finfo-nf-list finfo)) )
 
-;;; 次のcall-idの数字
+;;; 罨＜��call-id�����医��
 (defun finfo-next-call-id (&optional (finfo *current-func*))
   (length (finfo-label-list finfo)))
 
-;;; 復帰位置を示すラベルを追加．ラベル名を返す．
+;;; 緇�絽遺��臀����腓冴��������������菴遵��鐚����������������菴����鐚�
 (defun finfo-add-resume-label (&optional (finfo *current-func*) (base-name "L_CALL"))
   (with1 label-id (rule:generate-id base-name)
     (push (cons label-id nil) (finfo-label-list finfo))
     label-id))
 
-;;; 与えられた関数情報から復帰処理を行うstatementを作る
+;;; 筝���������������∽�井����宴�����緇�絽医��������茵����statement���篏����
 (defun make-resume (fi)
   (unless (or (finfo-label-list fi)
               (finfo-local-label fi))
@@ -303,10 +303,10 @@
   (let ((reconst-impossible (or (eq ~main (finfo-name fi))
                                 (finfo-parent-func fi)
                                 *all-in-estack*))
-                                        ; スタックの積み直し中に成り得ない
+                                        ; ��鴻�帥��������腥���睡�眼��筝����������緇�������
         (case-goto
          (append
-          ;; 入れ子関数呼び出し終了後の復帰
+          ;; ��ャ��絖���∽�医�若�喝�冴��腟�篋�緇����緇�絽�
           (do ((ret nil)
                (k 0 (1+ k))
                (lb (reverse (finfo-label-list fi)) (cdr lb)))
@@ -315,7 +315,7 @@
                     ,@(cdar lb) 
                     (goto ,(caar lb)))
                   ret))
-          ;; gotoによる入れ子関数から親関数への脱出先
+          ;; goto�����������ャ��絖���∽�違�����荀���∽�違�吾����怨�阪��
           (do ((ret nil)
                (k -1 (1- k))
                (lb (reverse (finfo-local-label fi)) (cdr lb)))
@@ -341,7 +341,7 @@
            ,@(when (finfo-label-list fi)
                ~( (goto ,(caar (last (finfo-label-list fi)))) )))))))
 
-;;; efp(xfp)の設定および espをフレームサイズ分移動させる
+;;; efp(xfp)���荐�絎���������� esp�����������若����泣�ゃ�阪��腱糸�����������
 (defun make-init-efp-esp (fi)
   (let ((frame-type  ~(struct ,(get-frame-name (finfo-name fi)))))
     (list*
@@ -352,17 +352,17 @@
        (list ~(= (fref efp -> xfp) xfp) )))
     ))
 
-;;; parmp の初期値
+;;; parmp ������������
 (defun make-parmp-init (&optional (all-in-estack *all-in-estack*))
   ~(cast (ptr char)
      ,(if all-in-estack
           ~esp
         ~(bit-xor (cast size-t esp) esp-flag))) )
 
-;;; （*all-in-estack*時）引数の値をestackに保存
+;;; 鐚�*all-in-estack*���鐚�綣���違����ゃ��estack���篆�絖�
 (defun save-args-into-estack (argid-list argtexp-list
                               &optional (finfo *current-func*))
-  ;; ちょっと手抜きで型情報 (the)なし
+  ;; ��＜����ｃ�������������у�������� (the)������
   (mapcar #'(lambda (id texp)
               (if (finfo-parent-func finfo)
                   ~(= (fref efp -> ,id) (pop-arg ,texp parmp)) 
@@ -370,24 +370,24 @@
           argid-list
           argtexp-list) )
 
-;;; 入れ子関数のid -> トップレベルに移した関数のid
+;;; ��ャ��絖���∽�違��id -> ���������������������腱祉�������∽�違��id
 (defun make-extid (id &optional (pfinfo *current-func*))
   (generate-id (string+ (identifier0! id :sc2c) "_in_"
                         (identifier0! (finfo-name pfinfo) :sc2c))) )
 
-;;; idが現在の関数（親は除く）内で定義された入れ子関数か？
-;;; もしそうなら，ext-name を返す
+;;; id����憜�������∽�逸��荀������ゃ��鐚������у��臂������������ャ��絖���∽�違��鐚�
+;;; ������������������鐚�ext-name ���菴����
 (defun nestfunc-extid (id &optional (finfo *current-func*))
   (and *current-func*
        (cdr (assoc id (finfo-nf-list finfo) :test #'eq))))
 
-;;; 入れ子関数の参照 -> etackへの参照
-;;; （pfinfo: 親関数情報）
+;;; ��ャ��絖���∽�違�������� -> etack��吾��������
+;;; 鐚�pfinfo: 荀���∽�井����縁��
 (defun nestfunc-in-estack (fid &optional (pfinfo *current-func*))
   (declare (ignore pfinfo))
   ~(ptr (fref efp -> ,fid)))
 
-;;; 与えられた関数情報から入れ子関数を正規化するコードを作る
+;;; 筝���������������∽�井����宴�������ャ��絖���∽�違��罩ｈ�������������潟�若�����篏����
 (defun make-normalize-nf (&optional (fi *current-func*))
   (let ((nf-list (finfo-nf-list fi)))
     (apply #'nconc
@@ -399,7 +399,7 @@
                       (cast (ptr void) efp)) ))
             nf-list))))
 
-;;; 与えられた関数情報からフレーム情報を保存するコードを作る
+;;; 筝���������������∽�井����宴�������������若�������宴��篆�絖���������潟�若�����篏����
 (defun make-frame-save (&optional (fi *current-func*))
   (mapcar
    #'(lambda (x)
@@ -409,7 +409,7 @@
                       (eq ~closure-t (cdr x))))
               (finfo-var-list fi))))
 
-;;; 与えられた関数情報からフレーム情報を復活するコードを作る
+;;; 筝���������������∽�井����宴�������������若�������宴��緇�羇祉�������潟�若�����篏����
 (defun make-frame-resume (&optional (fi *current-func*))
   (mapcar
    #'(lambda (x) 
@@ -419,7 +419,7 @@
                       (eq ~closure-t (cdr x))))
               (finfo-var-list fi))))
 
-;;; 与えられた関数情報から関数中断用のreturnを生成するコードを作る
+;;; 筝���������������∽�井����宴�������∽�遺賢���������return�����������������潟�若�����篏����
 (defun make-suspend-return (&optional (fi *current-func*))
   (cond ((finfo-parent-func fi)
          ;;~(return (fref efp -> tmp-esp)))
@@ -429,11 +429,11 @@
         (t
          ~(return (SPECIAL ,(finfo-ret-type *current-func*))))))
 
-;;; 与えられたラベル名が、親関数の局所ラベルとして定義されているか調べる。
-;;; 定義されていなければ,返り値はnil。定義されていれば、
-;;; (values <自分からみて何番目の親関数に定義されていたか>
-;;;         <その定義 ( <label> . <復帰処理> )> 
-;;;         <そのラベルが関数内で何番目にpushされたものか>)
+;;; 筝�������������������������������荀���∽�違��絮����������������������絎�臂�������������������茯帥�鴻�����
+;;; 絎�臂�������������������������,菴������ゃ��nil���絎�臂������������������違��
+;;; (values <��������������帥��篏����������荀���∽�違��絎�臂�������������������>
+;;;         <������絎�臂� ( <label> . <緇�絽医�����> )> 
+;;;         <��������������������∽�医����т�����������push������������������>)
 (defun finfo-find-local-label (lid &optional (fi *current-func*) &aux (lids (identifier0! lid :sc2c)))
   (labels ((find-local-label-tail (cfi acc &aux memb)
              (cond ((null cfi)
@@ -450,8 +450,8 @@
                      (finfo-parent-func cfi) (1+ acc))))))
     (find-local-label-tail fi 0)))
 
-;; beginとかの(Nfb0 body)の返り値から、
-;; beginそのものの返り値を作る。
+;; begin���������(Nfb0 body)���菴������ゃ��������
+;; begin���������������菴������ゃ��篏�������
 ;; ((r1-1 r1-2 r1-3 r1-4) ... (rn-1 rn-2 rn-3 rn-4))
 ;; => ( (,@r1-1 ... ,@rn-1)
 ;;      (,@r1-2 ... ,@rn-2) 
@@ -468,10 +468,10 @@
           nil
           (remove nil (apply #'append prev-4th thd-4th)))))
 
-;; 一時変数を使う必要がない，つまり
-;; * 入れ子関数呼出し中に変更が加えられない(permit-change=nil時）
-;; * 副作用を起こさない
-;; ことが保証できる式
+;; 筝����紊���違��篏帥��綽�荀����������鐚���ゃ�障��
+;; * ��ャ��絖���∽�医�弱�冴��筝����紊���眼��������������������(permit-change=nil���鐚�
+;; * ���篏�������莎激�����������
+;; ���������篆�荐若�с�����綣�
 (defun simple-exp-p (the-exp &optional (permit-change nil))
   (let ((type (second the-exp))
         (exp (third the-exp)))
diff --git a/src/rule/nestfunc-setrule.sh b/src/rule/nestfunc-setrule.sh
index a940182a..68756ee2 100644
--- a/src/rule/nestfunc-setrule.sh
+++ b/src/rule/nestfunc-setrule.sh
@@ -22,8 +22,8 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;; NF-TYPEを%defconstantで定義したうえでこれを%includeすると
-;; ruleを自動設定，出力ファイル名変更
+;; NF-TYPE���%defconstant��у��臂���������������с��������%include���������
+;; rule���������荐�絎�鐚���阪�������＜�ゃ�����紊����
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL RAWC)
diff --git a/src/rule/nestfunc.rule b/src/rule/nestfunc.rule
index b8bf20ff..2292b313 100644
--- a/src/rule/nestfunc.rule
+++ b/src/rule/nestfunc.rule
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2015 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -23,18 +23,18 @@
 ;;; SUCH DAMAGE.
 
 ;;; LW-SC0(with typeinfo) -> SC-0(with incomplete typeinfo)
-;;; :nestfunc-rename :nestfunc-type :nestfunc-temp が適用済みであること
+;;; :nestfunc-rename :nestfunc-type :nestfunc-temp ���������羝���帥�с�����������
 ;;;
-;;; 入れ子関数の定義は
+;;; ��ャ��絖���∽�違��絎�臂����
 ;;; (def (<identifier-list>) (lightweight <type-expression-list>) ...)
 
 ;;; to be rewritten as an extension of the sc0t-to-sc0t rule-set.
 
 (define-ruleset nestfunc (sc0t-to-sc0t)
   (thread-creator ~pthread-create)
-  (estack-size #.(* 4 65536))           ; 明示的スタックのサイズ（sizeof char）
-  (all-in-estack nil)                   ; 局所変数などを全て明示的スタックに置く(= CL-SC)
-  (use-builtin-expect t)                ; GCCの __builtin_expectを使って最適化する
+  (estack-size #.(* 4 65536))           ; ���腓榊����鴻�帥����������泣�ゃ�削��sizeof char鐚�
+  (all-in-estack nil)                   ; 絮����紊���違�����������������腓榊����鴻�帥��������臀����(= CL-SC)
+  (use-builtin-expect t)                ; GCC��� __builtin_expect���篏帥�ｃ�����������������
   )
 
 (scr:require "NESTFUNC-DEFS")
@@ -69,194 +69,194 @@
       ((lw:top-level-p)
        ~(,scs ,id ,texp-ret ,@(if-pattern-variable init (list (initializer init)) nil)) )
       ((eq texp ~--label--)             ; local-label
-       ;; フレーム復帰用コード（cdr部分）は、あとでlabelのある場所で追加
+       ;; ��������若��緇�絽亥����潟�若��鐚�cdr������鐚����������������label�����������贋����ц申���
        (lw:finfo-add-local-label id)
        ~(%splice) )
       ((string= "static" (storage-class-specifier! scs :sc2c)) ; static local
-       ;; 入れ子関数からも見えるように，名前を変えて外に出す
+       ;; ��ャ��絖���∽�違��������荀����������������鐚����������紊�������紊������冴��
        (lw:add-static-var-def (lw:finfo-add-local id texp-ret :static
                                                   :init (if-pattern-variable init init)))
        ~(%splice) )
       (t
        ;; local variable:
-       ;; 常にestack上で扱う変数は宣言せず，フレーム構造体への登録のみ行う
+       ;; 絽吾��estack筝���ф�宴��紊���違��絎ｈ��������鐚���������若��罕����篏���吾����脂�蚊����粋�����
        (with* (init-ret (if-pattern-variable init (initializer! init))
                decl-ret (lw:finfo-add-local id texp-ret :var :init init-ret))
-         ;; 例外（初期値が文字列 or 配列）
+         ;; 箴�紊�鐚���������ゃ�����絖���� or ������鐚�
          (if (lw:estack-variable-p id)
              ~(%splice)
            decl-ret ))))))
   ;; function(top-level)
-  ;; ・main以外の第一引数にespを追加
-  ;; ・esp,estack(main), new-espの付加。call-idの追加
-  ;; ・入れ子関数(closure-t)を呼ぶ関数ではargpを付加
-  ;; ・復帰処理の挿入
-  ;; ・efp, esp, new-expの初期化;
-  ;; ・関数の引数の保存用変数を付加
-  ;; ・関数の結果の保存用変数を付加 (<- tmp.ruleで)
-  ;; ・フレーム情報構造体を付加して構造体の定義を外に出す
-  ;; ・tmp_esp, argp, call-id, その他ローカル変数の追加
-  ;; ・入れ子関数の定義を外に出して、関数内ではclosure-t型に
-  ;; ・関数呼び出しをwhile( tmp-res = ... ){ <保存>,return,<復帰> } に変える。
-  ;;   mainとその他では{ ... } のとこの処理が違う
+  ;; ���main篁ュ�����膃�筝�綣���違��esp���菴遵��
+  ;; ���esp,estack(main), new-esp���篁�������call-id���菴遵��
+  ;; ��糸�ャ��絖���∽��(closure-t)�����若�狗�∽�違�с��argp���篁����
+  ;; ��糸奨絽医����������水��
+  ;; ���efp, esp, new-exp������������;
+  ;; ��脂�∽�違��綣���違��篆�絖����紊���違��篁����
+  ;; ��脂�∽�違��腟�������篆�絖����紊���違��篁���� (<- tmp.rule���)
+  ;; ��祉�������若�������掩�����篏����篁����������罕����篏����絎�臂����紊������冴��
+  ;; ���tmp_esp, argp, call-id, ������篁������若�����紊���違��菴遵��
+  ;; ��糸�ャ��絖���∽�違��絎�臂����紊������冴����������∽�医����с��closure-t������
+  ;; ��脂�∽�医�若�喝�冴�����while( tmp-res = ... ){ <篆�絖�>,return,<緇�絽�> } ���紊����������
+  ;;   main���������篁���с��{ ... } ���������������������������
   (#?(,scs[storage-class-specifier] (,fid[identifier] ,@id-list)
           (,fn-tag[function-tag] ,@texp-list) ,@body)
    (error-indent (format nil "In ordinary function ~S:" fid)
-     ;; global functionとして登録
+     ;; global function�����������脂��
      (when (lw:top-level-p) (lw:add-global-func fid))
-     ;; Cの関数ならなにもしない
+     ;; C�����∽�違�����������������������
      (when (or (cid-p fid) (eq 'csym::fn fn-tag))
        (return-from inlined-declaration x))
-     (let* ((thr-orig-p (lw:thread-origin-p fid)) ; mainや生成されたスレッドの最初の関数には追加引数なし
+     (let* ((thr-orig-p (lw:thread-origin-p fid)) ; main��������������������鴻����������������������∽�違�����菴遵��綣���違�����
             (add-arg-p (not thr-orig-p))
-            (new-id-list (if add-arg-p (cons ~esp id-list) id-list)) ; 追加引数 esp
+            (new-id-list (if add-arg-p (cons ~esp id-list) id-list)) ; 菴遵��綣���� esp
             (texp-rets (mapcar #'type-expression! texp-list))
-            (new-texp-list (if add-arg-p (insert1 ~(ptr char) texp-rets 1) texp-rets))) ; 追加引数
-       ;; 関数ポインタを局所変数として登録
+            (new-texp-list (if add-arg-p (insert1 ~(ptr char) texp-rets 1) texp-rets))) ; 菴遵��綣����
+       ;; ��∽�違����ゃ�潟�帥��絮����紊���違����������脂��
        (unless (lw:top-level-p)
          (lw:finfo-add-local fid ~(ptr (,fn-tag ,@new-texp-list)) :var))
-       ;; bodyがからっぽなら引数追加だけ行って終了
+       ;; body�����������ｃ�純�����綣���域申���������茵���ｃ��腟�篋�
        (when (null body)
          (return-from inlined-declaration ~(,scs (,fid ,@new-id-list) (,fn-tag ,@new-texp-list)) ))
        (let ((lw:*current-func* (lw:make-finfo
                                  :name fid :ret-type (car texp-rets)
                                  :estack-var (search-ptr body)))
-             (add-decl-list ()))        ;追加する宣言のリスト
-         ;; frame構造体を新規登録
+             (add-decl-list ()))        ;菴遵��������絎ｈ����������鴻��
+         ;; frame罕����篏������域����脂��
          (lw:get-frame fid)
-         ;; 引数をframeに追加
+         ;; 綣���違��frame���菴遵��
          (loop for argid in id-list
              as argtype in (cdr texp-rets)
              do (lw:finfo-add-local argid argtype :var))
 
-         ;; 先頭の宣言の追加
+         ;; ���������絎ｈ�����菴遵��
          (progn
-           ;; estack: 明示的スタック
-           ;; esp (main以外では追加引数): 明示的スタックポインタ+下位2ビットフラグ
+           ;; estack: ���腓榊����鴻�帥�����
+           ;; esp (main篁ュ����с��菴遵��綣����): ���腓榊����鴻�帥����������ゃ�潟��+筝�篏�2������������������
            (when thr-orig-p
              (pushs (lw:finfo-add-local ~estack ~(array char ,lw:*estack-size*) :system)
                     (lw:finfo-add-local ~esp ~(ptr char) :system :init ~estack)
                     add-decl-list))
-           ;; esp-flag: espの下位2ビットのフラグ部分
-           ;;   最下位 -- スタック積み直し中フラグ
-           ;;   下から2つめ -- 未使用
+           ;; esp-flag: esp���筝�篏�2��������������������育�����
+           ;;   ���筝�篏� -- ��鴻�帥�����腥���睡�眼��筝����������
+           ;;   筝�������2��ゃ�� -- ���篏睡��
            (when (and (not thr-orig-p) (not lw:*all-in-estack*))
              (push (lw:finfo-add-local ~esp-flag ~size-t :system
                                        :init ~(bit-and (cast size-t esp) 3))
                    add-decl-list))
-           ;; new-esp: espにフラグを追加したりして関数呼出しの引数にする
+           ;; new-esp: esp�����������違��菴遵�������������������∽�医�弱�冴�����綣���違��������
            (unless lw:*all-in-estack*
              (push (lw:finfo-add-local ~new-esp ~(ptr char) :system) add-decl-list))
-           ;; efp: 明示的スタックフレームポインタ
+           ;; efp: ���腓榊����鴻�帥�������������若�������ゃ�潟��
            (push (lw:finfo-add-local ~efp ~(ptr (struct ,(lw:get-frame-name fid))) :system)
                  add-decl-list))
 
          (with* (body-ret (function-body body)
                  (body-ret-decl body-ret-body) (list-until body-ret ~%%stat :key #'car))
-           ;; 入れ子関数callが存在した場合，
-           ;; argp (入れ子関数call時のestack上にある引数へのポインタ)の宣言を追加
+           ;; ��ャ��絖���∽��call���絖������������翫��鐚�
+           ;; argp (��ャ��絖���∽��call������estack筝����������綣���違�吾�������ゃ�潟��)���絎ｈ�����菴遵��
            (when (lw:finfo-argp lw:*current-func*)
              (push (lw:finfo-add-local ~argp ~(ptr char) :system) add-decl-list))
-           ;; 最終的に必要な宣言を追加
+           ;; ���腟�������綽�荀����絎ｈ�����菴遵��
            (setq body-ret-decl
              (nconc body-ret-decl
                     (nreverse add-decl-list)
-                    ;; スタック積み直し時用の復帰処理
+                    ;; ��鴻�帥�����腥���睡�眼�����������緇�絽医�����
                     (lw:make-resume lw:*current-func*) 
-                    ;; estackフレームポインタ初期化
+                    ;; estack��������若�������ゃ�潟�水��������
                     (lw:make-init-efp-esp lw:*current-func*) 
                     (when lw:*all-in-estack*
                       (nconc
-                       ;; CL-SC時，引数の値をestackに保存
+                       ;; CL-SC���鐚�綣���違����ゃ��estack���篆�絖�
                        (lw:save-args-into-estack id-list (cdr texp-rets))
-                       ;; CL-SC時，入れ子関数をここで初期化（LW-SCと違って遅延されない）
+                       ;; CL-SC���鐚���ャ��絖���∽�違����������у��������鐚�LW-SC��������ｃ�����綮吟�����������鐚�
                        (lw:make-normalize-nf)))))
-           ;; フレーム構造体の定義を作って登録
+           ;; ��������若��罕����篏����絎�臂����篏���ｃ����脂��
            (lw:add-frame-def (lw:make-frame-def lw:*current-func*))
-           ;; 関数定義の変換結果
+           ;; ��∽�医��臂����紊����腟����
            ~(,scs (,fid ,@new-id-list) (,fn-tag ,@new-texp-list)
                   ,.body-ret-decl ,@body-ret-body) )))))
 
-  ;; lightweightの関数宣言
-  ;; ・引数と返り値の型を変更。
-  ;; ・関数の先頭でestackから引数の値を受け取る処理を追加
-  ;; ・別途statement規則でreturnをいじる必要
+  ;; lightweight�����∽�医�ｈ��
+  ;; ��糸����違��菴������ゃ��������紊���眼��
+  ;; ��脂�∽�違�����������estack������綣���違����ゃ�����������������������菴遵��
+  ;; ��糸�ラ��statement荀�������return������������綽�荀�
   (#?(,scs[storage-class-specifier] (,fid[identifier] ,@id-list[identifier])
           (lightweight ,@texp-list) ,@body)
    (error-indent (format nil "In nested function ~S:" fid)
      (let* ((parent-name (lw:finfo-name lw:*current-func*))
             (parent-func lw:*current-func*)
             (extid (lw:make-extid fid))
-            (texp-rets (mapcar #'type-expression texp-list))) ;外に出す関数名
-       ;; 入れ子関数リストに追加
+            (texp-rets (mapcar #'type-expression texp-list))) ;紊������冴����∽�医��
+       ;; ��ャ��絖���∽�違����鴻�����菴遵��
        (lw:finfo-add-nestfunc fid extid)
-       ;; ここで *current-func* をバインド
+       ;; ��������� *current-func* ��������ゃ�潟��
        (let ((lw:*current-func* (lw:make-finfo :name extid
                                                :parent-func parent-func
                                                :ret-type (car texp-rets)
                                                :estack-var (search-ptr body)))
-             (add-decl-list nil))       ;追加の変数定義
-         ;; frame構造体を新規登録
+             (add-decl-list nil))       ;菴遵�����紊���医��臂�
+         ;; frame罕����篏������域����脂��
          (lw:get-frame extid)
-         ;; 先頭の宣言の追加
+         ;; ���������絎ｈ�����菴遵��
          (progn
-           ;; new-esp: esp + 呼出し先の関数に渡す下位2ビットフラグ
-           (unless lw:*all-in-estack*   ; LW-SCのみ
+           ;; new-esp: esp + ��弱�冴����������∽�違��羝＜��筝�篏�2������������������
+           (unless lw:*all-in-estack*   ; LW-SC������
              (push (lw:finfo-add-local ~new-esp ~(ptr char) :system) add-decl-list) )
-           ;; efp: etack上のフレームポインタ
+           ;; efp: etack筝������������若�������ゃ�潟��
            (push (lw:finfo-add-local ~efp ~(ptr (struct ,(lw:get-frame-name extid))) :system)
                  add-decl-list)
-           ;; xfp: 親関数のetack上のフレームポインタ
+           ;; xfp: 荀���∽�違��etack筝������������若�������ゃ�潟��
            (push (lw:finfo-add-local ~xfp
                                      ~(ptr (struct ,(lw:get-frame-name parent-name)))
                                      :var :init ~xfp0)
                  add-decl-list)
-           ;; esp-flag: espの下位2ビットフラグ
-           (unless lw:*all-in-estack*   ; LW-SCのみ
+           ;; esp-flag: esp���筝�篏�2������������������
+           (unless lw:*all-in-estack*   ; LW-SC������
              (push (lw:finfo-add-local ~esp-flag ~size-t :system
                                        :init ~(bit-and (cast size-t esp) 3))
                    add-decl-list) )
-           ;; parmp: 引数受け取りの作業用変数
+           ;; parmp: 綣���医��������������篏�罐����紊����
            (push (lw:finfo-add-local ~parmp ~(ptr char) :system :init (lw:make-parmp-init))
                  add-decl-list) )
 
-         ;; 引数を明示的スタックのトップからpopしながら獲得
+         ;; 綣���違�����腓榊����鴻�帥�����������������������pop��������������峨��
          (loop
              for argid in id-list
              as argtp in (cdr texp-rets)
              do (with1 decl (lw:finfo-add-local argid argtp :var)
-                  (unless lw:*all-in-estack* ; CL-SCではestackを直接参照するので不要
+                  (unless lw:*all-in-estack* ; CL-SC��с��estack�����贋･�����с����������т��荀�
                     (push ~(,@decl (pop-arg ,argtp parmp))
                           add-decl-list) )))
 
          (with1 body-ret (function-body body)
            (multiple-value-bind (body-ret-decl body-ret-body)
                (list-until body-ret ~%%stat :key #'car)
-             ;; 入れ子関数callが存在した場合，
-             ;; argp (入れ子関数call時のestack上にある引数へのポインタ)の宣言を追加
+             ;; ��ャ��絖���∽��call���絖������������翫��鐚�
+             ;; argp (��ャ��絖���∽��call������estack筝����������綣���違�吾�������ゃ�潟��)���絎ｈ�����菴遵��
              (when (lw:finfo-argp lw:*current-func*)
                (push (lw:finfo-add-local ~argp ~(ptr char) :system) add-decl-list))
-             ;; 最終的に必要な宣言を追加
+             ;; ���腟�������綽�荀����絎ｈ�����菴遵��
              (setq body-ret-decl
                (nconc body-ret-decl
                       (nreverse add-decl-list)
-                      ;; スタック積み直し時の復帰処理
+                      ;; ��鴻�帥�����腥���睡�眼��������緇�絽医�����
                       (lw:make-resume lw:*current-func*)
-                      ;; estackフレームポインタ初期化
+                      ;; estack��������若�������ゃ�潟�水��������
                       (lw:make-init-efp-esp lw:*current-func*)
                       (when lw:*all-in-estack*
                         (nconc
-                         ;; CL-SC時，引数の値をestackに保存
+                         ;; CL-SC���鐚�綣���違����ゃ��estack���篆�絖�
                          (lw:save-args-into-estack id-list (cdr texp-rets))
-                         ;; CL-SC時，入れ子関数をここで初期化（LW-SCと違って遅延されない）
+                         ;; CL-SC���鐚���ャ��絖���∽�違����������у��������鐚�LW-SC��������ｃ�����綮吟�����������鐚�
                          (lw:make-normalize-nf)))) )
-             ;; フレーム構造体定義を作って登録
+             ;; ��������若��罕����篏�絎�臂����篏���ｃ����脂��
              (lw:add-frame-def (lw:make-frame-def lw:*current-func*))
-             ;; 関数定義をトップレベルに
+             ;; ��∽�医��臂�������������������������
              (lw:add-nestfunc-def
               ~(,scs (,extid esp xfp0) (fn (ptr char) (ptr char) (ptr void))
                      ,.body-ret-decl ,@body-ret-body (return 0))) )))
-       ;; 入れ子関数はestack内のものを参照するので親関数内での宣言は不要
+       ;; ��ャ��絖���∽�違��estack��������������������с����������цΚ��∽�医����с��絎ｈ�����筝�荀�
        ~(%splice) )))
   )
 
@@ -267,8 +267,8 @@
      ~(fn ,(car texp-rets) (ptr char) ,@(cdr texp-rets)) )))
 
 ;;; Function body & block item:
-;;; * with-new-blockの追加
-;;; * 各block-itemにdeclかstatかを識別できるタグを付与
+;;; * with-new-block���菴遵��
+;;; * ���block-item���decl���stat������茘���ャ�с�������帥�違��篁�筝�
 (defrule function-body nestfunc
   (#?({:attr ,f-attr} { ,r-decl[register-declarator] } ,@bi-list)
 
@@ -289,8 +289,8 @@
 (extendrule statement nestfunc
   ;; label
   (#?(label ,id ,stat)
-   ;; 局所ラベルとして宣言済のラベルに対して、
-   ;; 入れ子関数からgotoで脱出してきたとき用の復帰情報を付与
+   ;; 絮����������������������絎ｈ��羝����������������絲障��������
+   ;; ��ャ��絖���∽�違�����goto��ц�怨�冴�����������������������緇�絽井����宴��篁�筝�
    (multiple-value-bind (lab-level llab-info)
        (lw:finfo-find-local-label id)
      (when (and lab-level (= lab-level 0))
@@ -301,43 +301,43 @@
    (multiple-value-bind (lab-level llab-info labnum)
        (lw:finfo-find-local-label id)
      (declare (ignore llab-info))
-     (if (or (null lab-level) (= lab-level 0)) ; __label__で定義されていないか，親関数のラベルではない場合
-         x                              ; 通常のgoto
-       ;; 親関数へのgotoによる脱出：
-       ;; nested-funcからreturnのようにCスタックを巻き戻すが，呼出し元までではなく，
-       ;; ジャンプ先の親（祖先）関数のところまで巻き戻す．その後，指定されたラベルの場所に
-       ;; 通常のgotoで飛ぶ．ジャンプ先はetack上のcall-idによる条件分岐で特定（return時と同様）．
-       (let* ((xfp-exp (butlast         ; ジャンプ先関数のestack上のフレームポインタ
+     (if (or (null lab-level) (= lab-level 0)) ; __label__��у��臂����������������������鐚�荀���∽�違�������������с����������翫��
+         x                              ; ���絽吾��goto
+       ;; 荀���∽�違�吾��goto�����������怨�削��
+       ;; nested-func������return������������C��鴻�帥��������綏祉����祉�����鐚���弱�冴�������障�с�с��������鐚�
+       ;; ��吾�ｃ�潟��������荀�鐚�腑����鐚���∽�違�������������障�у兄�����祉��鐚�������緇�鐚����絎������������������������贋�����
+       ;; ���絽吾��goto��ч����駈����吾�ｃ�潟��������etack筝����call-id�����������＞散���絏���х�劫��鐚�return���������罕�鐚�鐚�
+       (let* ((xfp-exp (butlast         ; ��吾�ｃ�潟�������∽�違��estack筝������������若�������ゃ�潟��
                         ~(fref
                           ,@(apply #'append
                                    (make-list lab-level
                                               :initial-element ~(xfp ->))))))
               (callid-exp ~(,@xfp-exp -> call-id)))
          ~(begin
-           (= ,callid-exp ,(- labnum))  ; goto先のcall-id書き換え
-           (return (cast (ptr char) ,xfp-exp))) )))) ; goto先のefpをreturn
-  ;; 返り値なしreturn
+           (= ,callid-exp ,(- labnum))  ; goto������call-id��吾��������
+           (return (cast (ptr char) ,xfp-exp))) )))) ; goto������efp���return
+  ;; 菴������ゃ�����return
   (#?(return)
    (if (lw:finfo-parent-func lw:*current-func*)
-       ~(return 0)                      ; 入れ子関数なら正常終了を示す0を返す
+       ~(return 0)                      ; ��ャ��絖���∽�違�����罩ｅ幻腟�篋����腓冴��0���菴����
      ~(return) ))
-  ;; 返り値つきreturn
+  ;; 菴������ゃ�ゃ��return
   (#?(return ,exp)
    (with1 exp-ret (expression! exp)
-     (if (lw:finfo-parent-func lw:*current-func*) ; 入れ子関数の場合
+     (if (lw:finfo-parent-func lw:*current-func*) ; ��ャ��絖���∽�違����翫��
          ~(begin
            (= (mref-t ,(lw:finfo-ret-type lw:*current-func*) efp) ,exp-ret)
-           (return 0))             ; return自体の返り値は正常終了を示す0
-       ~(return ,exp-ret) )))           ; 入れ子関数でなければ普通にreturn
+           (return 0))             ; return���篏����菴������ゃ��罩ｅ幻腟�篋����腓冴��0
+       ~(return ,exp-ret) )))           ; ��ャ��絖���∽�違�с����������井��������return
   )
 
 ;;; expression (with type-info)
 
-;;; :nestfunc-temp の変換結果により、callは
-;;; #1=(the ,texp (call (the ,texp ,exp) ,@exp-list))  ; 代入なし
-;;; か，
-;;; (the ,texp (= (the ,texp ,id) #1#))                ; 代入あり
-;;; のどちらかの形で現れるようになっている。
+;;; :nestfunc-temp ���紊����腟����������������call���
+;;; #1=(the ,texp (call (the ,texp ,exp) ,@exp-list))  ; 篁ｅ�ャ�����
+;;; ���鐚�
+;;; (the ,texp (= (the ,texp ,id) #1#))                ; 篁ｅ�ャ�����
+;;; ��������＜��������綵≪�х憗�������������������ｃ�����������
 
 (defrule thread-creator nestfunc
   (#?,id[#'(lambda (xx) (eq xx (ruleset-param 'thread-creator)))]
@@ -346,14 +346,14 @@
 
 (extendrule expression nestfunc
   ;; thread-create (typically pthread-create)
-  ;; thread-origin 関数を中継してstart-routineを呼びだす．
-  ;; thread-origin は新しいestackなどを用意するライブラリ関数．
+  ;; thread-origin ��∽�違��筝�膓�������start-routine�����若�潟�����鐚�
+  ;; thread-origin �����違�����estack��������������������������ゃ����������∽�逸��
   ((#?#1=(the ,texp (call (the ,texp-p ,exp-f[thread-creator])
                           ,thread ,attr ,start-routine ,arg))
     #?(the ,texp0 (= (the ,texp1 ,id) #1#)) )
    (let* ((farg-id (generate-id "farg"))
           (farg-decl (lw:finfo-add-local farg-id ~(ptr (struct func-arg)) :system))
-          (tcreate-exp                  ; func-arg構造体: もともとのfuncとargをパック
+          (tcreate-exp                  ; func-arg罕����篏�: ���������������func���arg������������
            ~(exps (= ,farg-id (cast (ptr (struct func-arg))
                                 (csym::malloc (sizeof (struct func-arg)))))
                   (= (fref ,farg-id -> func) ,start-routine)
@@ -364,9 +364,9 @@
      (if-pattern-variable id            ; assignment expression?
          ~(the ,texp0 (= ,(expression! ~(the ,texp1 ,id)) ,tcreate-exp))
        tcreate-exp )))
-  ;; 通常のfunction-call
-  ;; ・引数の値を保存
-  ;; ・呼び出す関数のポインタも保存
+  ;; ���絽吾��function-call
+  ;; ��糸����違����ゃ��篆�絖�
+  ;; ��糸�若�喝�冴����∽�違�������ゃ�潟�帥��篆�絖�
   ((#?#2=(the ,texp (call (the (ptr (,fn-tag[function-tag] ,@texp-list)) ,exp-f)
                           ,@exp-list))
     #?(the ,texp0 (= (the ,texp1 ,id) #2#)) )
@@ -376,15 +376,15 @@
            rettype-ret (type-expression! (car texp-list))
            exp-rets (mapcar #'expression! exp-list))
      (declare (ignorable id-ret rettype-ret))
-     ;; Cの関数ならなにもしない
+     ;; C�����∽�違�����������������������
      (when (or (cid-p exp-f) (eq 'csym::fn fn-tag))
        (with1 r-exp ~(the ,texp (call ,fexp-ret ,@exp-rets))
          (return-from expression (if-pattern-variable id
                                                       ~(= ,id-ret ,r-exp)
                                                       r-exp)) ))
      (let* ((decl-prev-tmpid-list
-             ;; 副作用を何回も起こさないように関数ポインタと引数の値を一時変数に保存
-             ;; そのために必要な宣言，先行の式，一時変数名をcollect
+             ;; ���篏�������篏�������莎激����������������������∽�違����ゃ�潟�帥��綣���違����ゃ��筝����紊���違��篆�絖�
+             ;; ���������������綽�荀����絎ｈ��鐚����茵����綣�鐚�筝����紊���医�����collect
              (loop
                  for exp-ret in (cons fexp-ret exp-rets)
                  if (lw:simple-exp-p exp-ret)
@@ -399,17 +399,17 @@
             (prev-list (remove nil (mapcar #'second decl-prev-tmpid-list)))
             (tmpid-list (mapcar #'third decl-prev-tmpid-list))
             (fcall-exp ~(call ,(car tmpid-list)
-                              ,(if lw:*all-in-estack* ~esp ~new-esp) ; 追加引数
+                              ,(if lw:*all-in-estack* ~esp ~new-esp) ; 菴遵��綣����
                               ,@(cdr tmpid-list)))
-            (eq-exp (if-pattern-variable id ; 返り値による正常終了判定
+            (eq-exp (if-pattern-variable id ; 菴������ゃ��������罩ｅ幻腟�篋���ゅ��
                         ~(== (= ,id-ret ,fcall-exp) (SPECIAL ,rettype-ret))))
-            (neq-exp ~(!= (= (fref efp -> tmp-esp) ; フレームポインタによる正常終了判定
+            (neq-exp ~(!= (= (fref efp -> tmp-esp) ; ��������若�������ゃ�潟�帥��������罩ｅ幻腟�篋���ゅ��
                              (mref-t (ptr char) esp))
                           0)))
        (declare (ignorable eq-exp))
        (unless lw:*all-in-estack* (push ~(= new-esp esp) prev-list))
        (dolist (decl decl-list) (lw:add-local-decl decl))
-       ;; 以下が返り値（変換結果）
+       ;; 篁ヤ�����菴������わ��紊����腟����鐚�
        ~(begin
          ,.prev-list
          (while ,(if-pattern-variable id
@@ -421,10 +421,10 @@
                        ~(exps ,fcall-exp
                               (csym::--builtin-expect ,neq-exp 0))
                      ~(exps ,fcall-exp ,neq-exp)))
-           ;; 関数が正常終了しなかったとき (LW-SC時の入れ子関数call or gotoによる脱出）
-           ;; 以下が実行される
+           ;; ��∽�違��罩ｅ幻腟�篋������������ｃ�������� (LW-SC��������ャ��絖���∽��call or goto�����������怨�削��
+           ;; 篁ヤ�����絎�茵����������
            ,@(cond
-              ;; CL-SC時: gotoによる非局所脱出の面倒を見る
+              ;; CL-SC���: goto������������絮������怨�冴����√�����荀����
               (lw:*all-in-estack*
                ~((if (< (cast (ptr char) (fref efp -> tmp-esp))
                         (cast (ptr char) efp))
@@ -434,12 +434,12 @@
                  (= (fref efp -> tmp-esp) 0)
                  (goto LGOTO)
                  ) )
-              ;; LW-SC，main および 入れ子関数
+              ;; LW-SC鐚�main ��������� ��ャ��絖���∽��
               ((or (lw:thread-origin-p (lw:finfo-name lw:*current-func*))
                    (lw:finfo-parent-func lw:*current-func*))
                ~((def goto-fr (ptr char))
                  (= (mref-t (ptr char) esp) 0)
-                 ;; フレーム情報保存＆入れ子関数の正規化
+                 ;; ��������若�������延��絖�鐚���ャ��絖���∽�違��罩ｈ�����
                  ,@(lw:make-frame-save)
                  ,@(lw:make-normalize-nf)
                  (= goto-fr (lw-call (fref efp -> tmp-esp)))
@@ -451,29 +451,29 @@
                  (if (== (cast (ptr char) goto-fr)
                          (cast (ptr char) efp))
                      (goto LGOTO))
-                 ,@(lw:make-frame-resume) ; 入れ子関数での変更を反映
+                 ,@(lw:make-frame-resume) ; ��ャ��絖���∽�違�с��紊���眼��������
                  ) )
-              ;; LW-SC，main 以外の通常関数
+              ;; LW-SC鐚�main 篁ュ��������絽檎�∽��
               (t
-               ~(;; フレーム情報の保存,入れ子関数の正規化 
+               ~(;; ��������若�������宴��篆�絖�,��ャ��絖���∽�違��罩ｈ����� 
                  ,@(lw:make-frame-save)
                    ,@(lw:make-normalize-nf)
-                   ;; call-idの更新
+                   ;; call-id�����贋��
                    (= (fref efp -> call-id) ,(lw:finfo-next-call-id))
                    ;; return
                    ,(lw:make-suspend-return)
-                   ;; 復帰位置
+                   ;; 緇�絽遺��臀�
                    (label ,(lw:finfo-add-resume-label) ())
-                   ;; Cフレーム状態の復元
+                   ;; C��������若����倶�����緇����
                    ,@(lw:make-frame-resume)
                    ) ))
-           ;; LW-SC時，main/main以外共通（Cスタック積み直しフラグを立てる）
+           ;; LW-SC���鐚�main/main篁ュ����演��鐚�C��鴻�帥�����腥���睡�眼����������違��腴�������鐚�
            ,@(unless lw:*all-in-estack*
                ~((= new-esp (+ esp 1)))))) )))
-  ;; lightweightのfunction-call
-  ;; * argp (estack上の引数の場所へのポインタ)をpush
-  ;; * 引数の値も順にpush
-  ;; * フレーム情報の保存．resume用のラベル設置，およびresume処理．
+  ;; lightweight���function-call
+  ;; * argp (estack筝����綣���違����贋����吾�������ゃ�潟��)���push
+  ;; * 綣���違����ゃ��������push
+  ;; * ��������若�������宴��篆�絖�鐚�resume���������������荐�臀�鐚����������resume������鐚�
   ((#?#3=(the ,texp (call (the (ptr (lightweight ,@texp-list)) ,fexp) ,@exp-list))
     #?(the ,texp0 (= (the ,texp1 ,id) #3#)) )
    (with* (return-p (not (or (lw:thread-origin-p (lw:finfo-name lw:*current-func*))
@@ -483,8 +483,8 @@
            exp-rets (mapcar #'expression! exp-list)
            id-ret  (if-pattern-variable id (expression! ~(the ,texp1 ,id)))
            (fp-decl fp-prev fp-id)
-           ;; （global化した）入れ子関数ポインタの値を求めて一時変数に保存
-           (if (lw:simple-exp-p fexp-ret t) ; 副作用がないことが明らかな場合
+           ;; 鐚�global���������鐚���ャ��絖���∽�違����ゃ�潟�帥����ゃ��羆�������筝����紊���違��篆�絖�
+           (if (lw:simple-exp-p fexp-ret t) ; ���篏������������������������������������翫��
                (values nil nil fexp-ret)
              (with* (fp-type (type-expression! ~(ptr (lightweight ,@texp-list)))
                      new-id (generate-id "nf_tmp_fp"))
@@ -492,85 +492,85 @@
                        ~(= ,new-id ,fexp-ret)
                        new-id))))
      (declare (ignorable id-ret))
-     ;; 関数内に入れ子関数が存在する（argpが必要である）フラグ
+     ;; ��∽�医�������ャ��絖���∽�違��絖����������鐚�argp���綽�荀���с�����鐚����������
      (setf (lw:finfo-argp lw:*current-func*) t)
-     ;; 追加の一時変数が発生していれば宣言を追加
+     ;; 菴遵�����筝����紊���違����榊����������������医�ｈ�����菴遵��
      (when fp-decl (lw:add-local-decl fp-decl))
-     ;; 返り値
+     ;; 菴�������
      ~(begin
        ,.(unless return-p
            (list ~(def goto-fr (ptr char)) ))
        ,.(when fp-prev (list fp-prev))
        (= argp (aligned-add esp (sizeof (ptr char))))
-       ;; 引数を順にpush（先頭の引数がtopにくるように）
+       ;; 綣���違��������push鐚����������綣���違��top������������������鐚�
        ,.(loop for exp-ret in (reverse exp-rets)
              collect (with1 type (gettype exp-ret) ~(push-arg ,type ,exp-ret argp)))
-       ;; 入れ子関数へのポインタをargpに置く
+       ;; ��ャ��絖���∽�違�吾�������ゃ�潟�帥��argp���臀����
        (= (mref-t (ptr closure-t) argp) ,fp-id)
-       ;; 入れ子関数の正規化（CL-SCでは関数の先頭ですでにやっている）
+       ;; ��ャ��絖���∽�違��罩ｈ�����鐚�CL-SC��с����∽�違����������с����с�������ｃ��������鐚�
        ,@(unless lw:*all-in-estack* (lw:make-normalize-nf))
-       ;; フレーム情報（今実行中の関数の局所変数や引数）の保存
+       ;; ��������若�������縁��篁�絎�茵�筝������∽�違��絮����紊���違��綣���逸�����篆�絖�
        ,@(lw:make-frame-save)
        ,@(when return-p
-           ~((= (fref efp -> argp) argp) ; 後で返り値を獲得するため
-             (= (fref efp -> tmp-esp) argp))) ; returnしながら伝えるため
+           ~((= (fref efp -> argp) argp) ; 緇���ц�������ゃ����峨��������������
+             (= (fref efp -> tmp-esp) argp))) ; return������������篌�������������
        ,@(if return-p
-             ;; LW-SC時，main以外の関数
-             ~(;; call-idの更新．入れ子関数実行後この場所に戻ってこれるように
+             ;; LW-SC���鐚�main篁ュ�������∽��
+             ~(;; call-id�����贋�逸����ャ��絖���∽�医��茵�緇���������贋�������祉�ｃ��������������������
                (= (fref efp -> call-id) ,(lw:finfo-next-call-id))
-               ;; return文（Cスタックの巻き戻し開始）
+               ;; return���鐚�C��鴻�帥��������綏祉����祉�����紮�鐚�
                ,(lw:make-suspend-return)
-               ;; 復帰位置のラベル．入れ子関数の実行後，ここにgotoで跳んでくる．
+               ;; 緇�絽遺��臀�������������鐚���ャ��絖���∽�違��絎�茵�緇�鐚����������goto��ц軍�����с�����鐚�
                (label ,(lw:finfo-add-resume-label) nil)
-               ;; Cフレーム情報の復元
+               ;; C��������若�������宴��緇����
                ,@(lw:make-frame-resume))
-             ;; CL-SC時，またはLW-SC時のmainおよび入れ子関数
+             ;; CL-SC���鐚���障�����LW-SC������main��������喝�ャ��絖���∽��
              ~((= goto-fr (lw-call argp))
-               (if goto-fr              ; 正常終了 or gotoによる非局所脱出のチェック
-                                        ; gotoなら，goto-frにはジャンプ先関数のestack上のフレームポインタ
+               (if goto-fr              ; 罩ｅ幻腟�篋� or goto������������絮������怨�冴�������с�����
+                                        ; goto������鐚�goto-fr��������吾�ｃ�潟�������∽�違��estack筝������������若�������ゃ�潟��
                    (if (< (cast (ptr char) goto-fr)
                           (cast (ptr char) efp))
-                       ;; 自分より前の関数がジャンプ先
+                       ;; ��������������������∽�違����吾�ｃ�潟�����
                        ,(if (lw:finfo-parent-func lw:*current-func*)
                             ~(return goto-fr)
                             ~(begin
                               (= (fref efp -> tmp-esp) goto-fr)
                               ,(lw:make-suspend-return)))
-                     ;; 自分がジャンプ先
-                     ;; -> 関数の先頭にある swtich-case-gotoによって所望の場所にジャンプ
+                     ;; �����������吾�ｃ�潟�����
+                     ;; -> ��∽�違����������������� swtich-case-goto��������ｃ�������������贋�������吾�ｃ�潟��
                      (begin
                       (= (fref efp -> tmp-esp) 0)
                       (goto LGOTO))))
-               ;; 正常終了なら続きをやる．
-               ;; LW-SCでもmainのフレームは潰されていないが，
-               ;; 入れ子関数によって書き換えられているかもしれないのでresumeは必要．
+               ;; 罩ｅ幻腟�篋�������膓�������������鐚�
+               ;; LW-SC��с��main�����������若�����羹違��������������������鐚�
+               ;; ��ャ��絖���∽�違�������ｃ����吾�����������������������������������������������resume���綽�荀�鐚�
                ,@(unless lw:*all-in-estack* (lw:make-frame-resume)))
              )
-       ;; 返り値をestackから獲得
+       ;; 菴������ゃ��estack��������峨��
        ,@(if-pattern-variable id
              ~((= ,id-ret (mref-t ,texp1 ,(if return-p ~(fref efp -> argp) ~argp)) ))))))
-  ;; 識別子：
-  ;; ＊ 入れ子関数内における親関数の変数への参照は xfp->idの形に置き換える
-  ;; ＊ ポインタを獲得しているローカル変数への参照は efp->id に置き換える
-  ;; ＊ 入れ子関数への参照は estack への参照に置き換える
+  ;; 茘���ュ��鐚�
+  ;; 鐚� ��ャ��絖���∽�医��������������荀���∽�違��紊���違�吾�������с�� xfp->id���綵≪��臀�������������
+  ;; 鐚� �����ゃ�潟�帥����峨�������������������若�����紊���違�吾�������с�� efp->id ���臀�������������
+  ;; 鐚� ��ャ��絖���∽�違�吾�������с�� estack ��吾�������с��臀�������������
   (#?(the ,texp ,id[identifier])
    (multiple-value-bind (n-up kind find-finfo) (lw:howmany-outer id)
      (case kind
        ((:var)
         (acond 
-         ;; 親関数のid -- "xfp->..."
+         ;; 荀���∽�違��id -- "xfp->..."
          ((> n-up 0)
           ~(fref 
             ,@(apply #'append
                      (make-list n-up :initial-element ~(xfp ->)) )
             ,id))
-         ;; 明示的スタックの現在のフレームに置かれたもの -- "efp->... "
+         ;; ���腓榊����鴻�帥���������憜�������������若�����臀���������������� -- "efp->... "
          ((and (= n-up 0) (lw:estack-variable-p id find-finfo t))
           ~(the ,texp (fref efp -> ,id)) )
-         ;; static定義されたlocal変数 -> 名前をext-idに変更
+         ;; static絎�臂����������local紊���� -> ���������ext-id���紊����
          ((and (= n-up 0) (lw:static-variable-p id find-finfo t))
           ~(the ,texp ,it))
-         ;; その他．処理不要
+         ;; ������篁�鐚�������筝�荀�
          (t ~(the ,texp ,id)) ))
        ((:nestfunc)
         (cond
@@ -581,13 +581,13 @@
                  ,id)) )
          (t
           ~(ptr (fref efp -> ,id))) ))
-       ((nil)                           ; 処理不要
+       ((nil)                           ; ������筝�荀�
         ~(the ,texp ,id) )
        (otherwise
         (ierror "Unknown kind of variable: ~S." kind)) )) )
   )
 
-;;; expression-with-typeinfo からtype-expressionを得る。
+;;; expression-with-typeinfo ������type-expression���緇�������
 (defrule gettype nestfunc
   ((#?(the ,texp ,exp))
    texp)
@@ -595,7 +595,7 @@
    (ierror "gettype: ~S is not expression." x))
   )
 
-;;; body中の ptrでポインタを獲得している変数のリストを返す
+;;; body筝���� ptr��с����ゃ�潟�帥����峨��������������紊���違�������鴻�����菴����
 (defrule search-ptr nestfunc
   ((#?(,@body))
    (remove-duplicates (mapcan #'search-ptr2 body) :test #'eq))
diff --git a/src/rule/nestfunc.sc b/src/rule/nestfunc.sc
index 78a4a144..2c1f6d76 100644
--- a/src/rule/nestfunc.sc
+++ b/src/rule/nestfunc.sc
@@ -27,7 +27,7 @@
 (c-exp "#include<stdlib.h>")
 (c-exp "#include<pthread.h>")
 
-;;; 追加する型、マクロ定義
+;;; 菴遵�����������������������絎�臂�
 (deftype nestfn-t (ptr (fn (ptr char) (ptr char) (ptr void))))
 
 (deftype closure-t struct
@@ -38,13 +38,13 @@
 (%defmacro mref-t (tp p)
   `(mref (cast (ptr ,tp) ,p)))
 
-;;; nonlocalexit-goto に対応
+;;; nonlocalexit-goto ���絲上��
 (def (lw-call esp) (fn (ptr char) (ptr char))
   (def clos (ptr closure-t) (mref-t (ptr closure-t) esp))
-  ;; 入れ子関数を呼び出す。
-  ;; goto で脱出してきた場合は、脱出先のefp
-  ;; (stackのreconstructionをefpのところのフレームで止める)
-  ;; そうでない場合は、0 が返り値となる。 
+  ;; ��ャ��絖���∽�違����若�喝�冴�����
+  ;; goto ��ц�怨�冴�������������翫����������怨�阪�����efp
+  ;; (stack���reconstruction���efp�����������������������若����ф�≪�����)
+  ;; ��������с�������翫��������0 ���菴������ゃ����������� 
   (return ((fref clos -> fun) esp (fref clos -> fr))))
 
 ;; for handling pthread
diff --git a/src/rule/nestfunc.sh b/src/rule/nestfunc.sh
index 02107912..d2fc1038 100644
--- a/src/rule/nestfunc.sh
+++ b/src/rule/nestfunc.sh
@@ -26,7 +26,7 @@
 
 ;; (c-exp "#include<stdio.h>")
 
-;;; 追加する型、マクロ定義
+;;; 菴遵�����������������������絎�臂�
 (deftype nestfn-t (ptr (fn (ptr char) (ptr char) (ptr void))))
 
 (deftype closure-t struct
@@ -71,18 +71,18 @@
 
 (decl (lw-call esp) (fn (ptr char) (ptr char)))
 
-;;; nonlocalexit-goto に対応させてみる．
+;;; nonlocalexit-goto ���絲上�������������帥��鐚�
 #+obsolete                              ; moved to nestfunc.sc
 (def (lw-call esp) (fn (ptr char) (ptr char))
   (def clos (ptr closure-t) (mref-t (ptr closure-t) esp))
-  ;; 入れ子関数を呼び出す。
-  ;; goto で脱出してきた場合は、脱出先のefp,
-  ;; そうでない場合は、0 が返り値となる。 
+  ;; ��ャ��絖���∽�違����若�喝�冴�����
+  ;; goto ��ц�怨�冴�������������翫����������怨�阪�����efp,
+  ;; ��������с�������翫��������0 ���菴������ゃ����������� 
   (return ((fref clos -> fun) esp (fref clos -> fr))))
 
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; pthread-create 対応用
+;; pthread-create 絲上�����
 (def (struct func-arg)
     (def func (ptr (fn (ptr void) (ptr char) (ptr void))))
   (def arg (ptr void)))
diff --git a/src/rule/rename-defs.lsp b/src/rule/rename-defs.lsp
index c9ef026a..3bf54c9a 100644
--- a/src/rule/rename-defs.lsp
+++ b/src/rule/rename-defs.lsp
@@ -36,8 +36,8 @@
   
 (defvar *id-alist* nil)      ; list of (<id> . <block-level>)
 (defvar *replace-alist* nil) ; list of (<oldid> . <newid>)
-(defvar *block-id* 0)        ; 現在のブロックID
-(defvar *next-block-id* 0)   ; 次に使用するブロックID-1
+(defvar *block-id* 0)        ; �憜�����������������ID
+(defvar *next-block-id* 0)   ; 罨＜��篏睡��������������������ID-1
 
 (defmacro with-rename-environment (&body body)
   `(let ((*id-alist* *id-alist*)
@@ -56,19 +56,19 @@
       id))
 
 ; entry identifier
-; 返り値は更新先の (values *id-alist* *replace-alist*) 
+; 菴������ゃ����贋�医����� (values *id-alist* *replace-alist*) 
 (defun entry-identifier (id)
   (let ((lev (assoc-id-level id)))
     (if lev 
 	(if (= *block-id* lev)     
-	    ;同一スコープで宣言済 ->そのまま
+	    ;���筝���鴻�潟�若����у�ｈ��羝� ->��������障��
 	    (values *id-alist* *replace-alist*)
-	    ;別のスコープで宣言済
+	    ;��ャ����鴻�潟�若����у�ｈ��羝�
 	    (let* ((new-id (generate-id (identifier0 id :sc2c))))
 	      (values
 	       (cons (cons id *block-id*) *id-alist*)
 	       (cons (cons id new-id) *replace-alist*))))
-      ; 未宣言
+      ; ���絎ｈ��
       (values 
        (cons (cons id *block-id*) *id-alist*)
        (cons (cons id id) *replace-alist*)))))
diff --git a/src/rule/sc0-to-sc0.rule b/src/rule/sc0-to-sc0.rule
index 655d090f..63df1103 100644
--- a/src/rule/sc0-to-sc0.rule
+++ b/src/rule/sc0-to-sc0.rule
@@ -394,7 +394,7 @@
    x)
   )
 
-;;; 返り値は今のところ意味なし
+;;; 菴������ゃ��篁������������������潟�����
 (defrule iteration-statement-tag sc0-to-sc0
   ((#?do-while)     x)
   )
@@ -588,7 +588,7 @@
                    (not (sc-keyword? x))))])
    (identifier0 id)) )
 
-;; keywordでないチェックを省きたいときはこちら
+;; keyword��с����������с����������������������������������＜��
 (defrule identifier0 sc0-to-sc0
   ((#?,id[#'sc2c:identifier-sc2c])
    id)
diff --git a/src/rule/sc1.rule b/src/rule/sc1.rule
index 3a9d2e5b..aa8bc2e8 100644
--- a/src/rule/sc1.rule
+++ b/src/rule/sc1.rule
@@ -23,8 +23,8 @@
 ;;; SUCH DAMAGE.
 
 ;;; sc1=>sc0 
-;;; multithread 用プリミティブにも対応(2003/12/26)
-;;; lightweight 入れ子関数に対応(2003/12/28)
+;;; multithread �����������������ｃ��������絲上��(2003/12/26)
+;;; lightweight ��ャ��絖���∽�違��絲上��(2003/12/28)
 (defpackage "SC1"
   (:nicknames "BASIC")
   (:use "RULE" "CL" "SC-MISC")
diff --git a/src/rule/sc2c-defs.lsp b/src/rule/sc2c-defs.lsp
index 5ce1416c..fb55b0c2 100644
--- a/src/rule/sc2c-defs.lsp
+++ b/src/rule/sc2c-defs.lsp
@@ -59,7 +59,7 @@
    (t
     ~(if ,(caar clauses) (begin ,@(cdar clauses)) ,(cond->if (cdr clauses))))))
 
-;; identifierの処理
+;; identifier���������
 (defun get-idstring (symstr)
   #+readtable-case
   (funcall
@@ -121,8 +121,8 @@
         (otherwise
          (format nil "\\x~x" (char-code ch)))))))
 
-;;; string-sc2c用の拡張format関数。
-;;; ~|xxx| (xxx=は8進の整数) で、その数字コードの文字が埋め込まれる 
+;;; string-sc2c��������≦宍format��∽�違��
+;;; ~|xxx| (xxx=���8��蚊����贋��) ��с����������医����潟�若��������絖����������莨若�障����� 
 (defun sc-format (format-string &rest args)
   (labels ((sc-format-list (str-list)
              (multiple-value-bind (before-tilde after-tilde)
@@ -145,7 +145,7 @@
                     (sc-format-list (concatenate 'list format-string)))
       (apply #'format nil retstr args) )))
 
-;;; SC文字列->C文字列( princ でCのstring-literalが出力される)
+;;; SC���絖����->C���絖����( princ ���C���string-literal�����阪�����������)
 (defun string-sc2c (str &rest args)
   (when (stringp str)
     (let ((f-str (apply #'sc-format str args)))
diff --git a/src/rule/sc2c.rule b/src/rule/sc2c.rule
index eb2f24bf..1fbecc13 100644
--- a/src/rule/sc2c.rule
+++ b/src/rule/sc2c.rule
@@ -375,7 +375,7 @@
            (first retval-texp1)
            (sc2c:parenthesize-t (list cid
                                       "( "
-                                      ;; 引数リスト
+                                      ;; 綣���違����鴻��
                                       (separate-list (mapcar #'(lambda (xx)
                                                                  (funcall xx ""))
                                                              (get-retval texp-list))
@@ -527,14 +527,14 @@
   )
 
 (defrule selection-statement sc2c
-  ;; [trick] 余分なbeginをとる（↓のtrickが使えるパターンを増やすため）
+  ;; [trick] 篏�������begin���������鐚�������trick���篏帥����������帥�若�潟��紜�������������鐚�
   (#?(if ,exp (begin (,stag[statement-tag] ,@rem)))
    (statement ~(if ,exp (,stag ,@rem))))
   ;;
   (#?(cond ,@clauses)
    (statement (sc2c:cond->if clauses)))
   (#?(if ,exp[expression] ,stat1[statement] {,stat2[statement]})
-   ;; [trick] sc1.ruleでできた if + do-while を while, forにできればする
+   ;; [trick] sc1.rule��с�с����� if + do-while ��� while, for�����с�������違�����
    (when (and (not (pattern-variable-p stat2))
               (consp stat1)
               (eq ~do-while (car stat1)))
@@ -558,14 +558,14 @@
   )
 
 (defrule iteration-statement sc2c
-  ;; [trick] 余分なbeginをとる
+  ;; [trick] 篏�������begin���������
   ((#?(,tag[~(while do-while for)] ,exp (begin ,@body)))
    (iteration-statement ~(,tag ,exp ,@body)))
   ;;
   ((#?(while ,exp[expression] ,@bi-list[block-item])
     #?(do-while ,exp[expression] ,@bi-list[block-item]))
    (let ((prev nil) (post nil))
-     (case (if (eql 1 exp) ~while (car x)) ; (do-while 1 ...) なら (while 1 ...) にする
+     (case (if (eql 1 exp) ~while (car x)) ; (do-while 1 ...) ������ (while 1 ...) ���������
        ((sc::while) (setq prev (list "while( " (get-retval exp) " )")
                           post ""))
        ((sc::do-while) (setq prev "do "
@@ -644,7 +644,7 @@
   ((#?switch)       "switch")
   )
 
-;;; 返り値は今のところ意味なし
+;;; 菴������ゃ��篁������������������潟�����
 (defrule iteration-statement-tag sc2c
   ((#?while)        "while")            ; sc1
   ((#?do-while)     (cons "do" "while"))
@@ -854,7 +854,7 @@
    (list #\" (get-retval str) #\") ))
 
 ;;; operator
-;;; 返り値は (<Cでの表現> <優先度> {<単位元>})
+;;; 菴������ゃ�� (<C��с��茵����> <������綺�> {<���篏����>})
 (defrule operator sc2c
   ((#?,op[postfix-operator]
     #?,op[unary-operator]
@@ -997,7 +997,7 @@
                    (not (c-keyword? x))))])
    (identifier0 id)) )
 
-;; keywordでないチェックを省きたいときはこちら
+;; keyword��с����������с����������������������������������＜��
 (defrule identifier0 sc2c
   ((#?,id[#'sc2c:identifier-sc2c])
    (get-retval id)))
diff --git a/src/rule/stack-scan.rule b/src/rule/stack-scan.rule
index 6992ba90..c935cc74 100644
--- a/src/rule/stack-scan.rule
+++ b/src/rule/stack-scan.rule
@@ -23,8 +23,8 @@
 ;;; SUCH DAMAGE.
 
 ;;; stack-scan 
-;;; n 回ごとにスタック情報を出力する．
-;;; 要 type.rule
+;;; n ��������������鴻�帥����������宴����阪��������鐚�
+;;; 荀� type.rule
 
 (defpackage "STACK-SCAN"
   (:nicknames "STSC")
@@ -60,7 +60,7 @@
 	   (return))
 	 ~(,(ruleset-param 'scan0)))) )
 
-;;; 関数型に引数を追加
+;;; ��∽�医�����綣���違��菴遵��
 (defun push-nestfunc-type (texp)
   (if (and (consp texp)
 	   (or (eq 'fn (car texp))
@@ -68,7 +68,7 @@
       ~(,(car texp) ,(scan-type) ,@(cdr texp))
       texp))
 
-;; scan の型
+;; scan ������
 (defun scan-type (&optional (nf-tag (ruleset-param 'nestfunc-tag)))
   ~(ptr (,nf-tag void void)))
 (defun scan-ftype (&optional (nf-tag (ruleset-param 'nestfunc-tag)))
@@ -78,10 +78,10 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (define-ruleset stack-scan (sc2c)
   (entry 'sc-program)
-  (scan0-name ~scan0)  ; 呼び出し元のスキャン
-  (scan1-name ~scan1)  ; 自分自身のスキャン
+  (scan0-name ~scan0)  ; ��若�喝�冴����������鴻����ｃ��
+  (scan1-name ~scan1)  ; ���������荳������鴻����ｃ��
   (nestfunc-tag ~fn)
-  (scan-start ~10)     ; 何回の関数呼び出しごとにscan?
+  (scan-start ~10)     ; 篏���������∽�医�若�喝�冴�����������scan?
   (scan-increment ~3)
   (default-handler #'no-match-error))
 
@@ -164,10 +164,10 @@
    (if-pattern-variable stat2
        ~(if ,(the-expression the-exp) ,(statement stat1) ,(statement stat2))
      ~(if ,(the-expression the-exp) ,(statement stat1))) )
-  ;; switch (exp から外にでるものはないはず)
+  ;; switch (exp ������紊������с�����������������������)
   ((#?(switch ,the-exp ,@body) )
    ~(switch ,(the-expression the-exp) ,@(function-body body)) )
-  ;; do-while (exp から外にでるものはないはず)
+  ;; do-while (exp ������紊������с�����������������������)
   ((#?(do-while ,the-exp ,@body) )
    ~(do-while ,(the-expression the-exp) ,@(function-body body)) )
   ;; goto, continue, break
@@ -175,7 +175,7 @@
     #?(continue) 
     #?(break) )
    x)
-  ;; 返り値なしreturn
+  ;; 菴������ゃ�����return
   ((#?(return) )
    x)
   ;; return 
diff --git a/src/rule/sxcc2c.rule b/src/rule/sxcc2c.rule
index 1cf8d564..7822f29e 100644
--- a/src/rule/sxcc2c.rule
+++ b/src/rule/sxcc2c.rule
@@ -105,7 +105,7 @@
                        (sc2c:parenthesize-t (list cid " "
                                                   (ruleset-param 'closure-keyword) ; addition
                                                   " ( "
-                                                  ;; 引数リスト
+                                                  ;; 綣���違����鴻��
                                                   (separate-list (mapcar #'(lambda (xx)
                                                                              (funcall xx ""))
                                                                          (get-retval texp-list))
diff --git a/src/rule/tcell-defs.lsp b/src/rule/tcell-defs.lsp
index 771a1b65..5072fccb 100644
--- a/src/rule/tcell-defs.lsp
+++ b/src/rule/tcell-defs.lsp
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008-2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2020 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -31,7 +31,7 @@
            :with-new-bk :latest-bk
            :task-id :task-cid :current-task :add-task
            :make-task-struct-id :task-struct-id :task-no
-           :task-body-function
+           :task-body-function :nonlocal-goto
            :set-task-send :set-task-recv :set-rslt-send :set-rslt-recv
            :task-add-field :task-add-input-var :task-add-output-var
            :task-field-p
@@ -45,7 +45,7 @@
 (in-package "TCELL")
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; task の管理
+;;; task ���膊∞��
 (defvar *tasks* (list))
 (defvar *current-task* nil)
 (defstruct (task-info
@@ -56,21 +56,23 @@
                               (struct-id (make-task-struct-id cid))
                               (do-task (make-do-task-id cid))
                               (task-send (make-task-send-id cid))
+                              (task-alloc (make-task-alloc-id cid))
                               (task-recv (make-task-recv-id cid))
                               (rslt-send (make-rslt-send-id cid))
                               (rslt-recv (make-rslt-recv-id cid)) )))
   (id nil :type symbol)
   (cid "" :type string)
-  (no -1 :type fixnum)                     ; task の通し番号
+  (no -1 :type fixnum)                     ; task ���������������
   (struct-id nil :type symbol)
   (do-task   nil :type symbol)
   (task-send nil :type symbol)  (task-send-body nil)
+  (task-alloc nil :type symbol)
   (task-recv nil :type symbol)  (task-recv-body nil)
   (rslt-send nil :type symbol)  (rslt-send-body nil)
   (rslt-recv nil :type symbol)  (rslt-recv-body nil)
   (fields (list))                       ; list of (<id> <texp>)
-  ;; fields のうち :in, :out指定されたもの
-  ;; <tsize>: 転送する配列の要素数．整数 or taskメンバ変数．
+  ;; fields ��������� :in, :out���絎����������������
+  ;; <tsize>: 荵∫�����������������荀�膣���逸����贋�� or task��＜�潟��紊���逸��
   (input-vars (list))                   ; list of (<id> <texp> <size>)
   (output-vars (list))                  ; list of (<id> <texp> <size>)
   )
@@ -83,12 +85,13 @@
       (find task-or-scid *tasks* :key #'task-info-id :test #'eq)
       (error "Task ~S is undefined." task-or-scid)))
  
-;; task番号と処理関数への対応表（配列）を定義するコード
+;; task����垩����������∽�違�吾��絲上��茵�鐚�������鐚����絎�臂���������潟�若��
 (defun task-maps ()
   (let ((rev-tasks (reverse *tasks*))
-        (len ~TASK-MAX)                 ; worker.sh で %defconstant
+        (len ~TASK-MAX)                 ; worker.sh ��� %defconstant
         (doer-type      ~(ptr ,(task-body-type ~void)))
         (tsender-type   ~(ptr ,(task-sender-type ~void)))
+        (tallocator-type ~(ptr ,(task-allocator-type ~void)))
         (treceiver-type ~(ptr ,(task-receiver-type ~void)))
         (rsender-type   ~(ptr ,(rslt-sender-type ~void)))
         (rreceiver-type ~(ptr ,(rslt-receiver-type ~void))))
@@ -99,6 +102,9 @@
      ~(def task-senders (array ,tsender-type ,len)
            (array ,@(mapcar (compose (tagger ~cast tsender-type) #'task-send-id)
                             rev-tasks)))
+     ~(def task-allocators (array ,tallocator-type ,len)
+           (array ,@(mapcar (compose (tagger ~cast tallocator-type) #'task-alloc-id)
+                            rev-tasks)))
      ~(def task-receivers (array ,treceiver-type ,len)
            (array ,@(mapcar (compose (tagger ~cast treceiver-type) #'task-recv-id)
                             rev-tasks)))
@@ -118,6 +124,8 @@
   (generate-id (string+ "do_" cid "_task")))
 (defun make-task-send-id (cid)
   (generate-id (string+ "send_" cid "_task")))
+(defun make-task-alloc-id (cid)
+  (generate-id (string+ "alloc_" cid "_task")))
 (defun make-task-recv-id (cid)
   (generate-id (string+ "recv_" cid "_task")))
 (defun make-rslt-send-id (cid)
@@ -138,6 +146,8 @@
   (task-info-do-task (get-task task-or-scid)))
 (defun task-send-id (&optional (task-or-scid *current-task*))
   (task-info-task-send (get-task task-or-scid)))
+(defun task-alloc-id (&optional (task-or-scid *current-task*))
+  (task-info-task-alloc (get-task task-or-scid)))
 (defun task-recv-id (&optional (task-or-scid *current-task*))
   (task-info-task-recv (get-task task-or-scid)))
 (defun rslt-send-id (&optional (task-or-scid *current-task*))
@@ -157,23 +167,26 @@
   (push (list id texp size)
         (task-info-output-vars (get-task task-or-scid))))
 
-;;; Generate the body of "task-body" method
+;;; Generate the body of "task-body" method.
+;;; The generated function is set to task-doers[] and called from
+;;; recv-exec-send() in "worker.sc".
 (defun task-body-function (body &optional (task *current-task*))
   (let ((id (do-task-id task))
 	(struct-id (task-struct-id task))
 	(label-id (generate-id (string+ (task-cid task) "_exit"))))
     ~(def (,id -thr pthis) ,(task-body-type ~(struct ,struct-id))
-       (def ,label-id __label__)
+       ,@(unless (ruleset-param 'rule::no-exception)
+           (list ~(def ,label-id __label__)))
        ,@(unless (ruleset-param 'rule::no-nestfunc)
 	   (list
 	    ;; Nested function
 	    ~(def (-bk) ,(nestfunc-type)
-	       ;; * When worker is handling an exception, exit this task
-	       ;; with returning an "abrt" message.
-	       (if -thr->exiting
+	       ;; * When worker is propagating an exception or cancelling the task,
+	       ;;   exit the task with returning an abort flag.
+	       (if (or (== -thr->exiting EXITING-EXCEPTION)
+		       (== -thr->exiting EXITING-CANCEL))
 		   (begin
-		     (= -thr->exiting 0)
-		     (goto ,label-id)))
+		     ,(nonlocal-goto label-id)))
 	       ;; * The terminal of temporary backtracking
 	       (return 0)) ))
        ,@body
@@ -181,7 +194,14 @@
        )
     ))
 
-;;; task/rslt sender/receiver （変形済み）本体のset
+(defun nonlocal-goto (label-id)
+  (if (not (ruleset-param 'rule::no-exception))
+      ~(goto ,label-id)
+      ~(begin
+         (csym::fprintf stderr "Error: Exception is thrown but this program is complied invalidating exception support.~%")
+         (csym::exit 99) )))
+
+;;; task/rslt sender/receiver 鐚�紊�綵∽����随�����篏����set
 (defun set-task-send (body &optional (task *current-task*))
   (setf (task-info-task-send-body task) body))
 (defun set-task-recv (body &optional (task *current-task*))
@@ -191,13 +211,14 @@
 (defun set-rslt-recv (body &optional (task *current-task*))
   (setf (task-info-rslt-recv-body task) body))
 
-;;; task/rslt sender/receiver を作る．
+;;; task/rslt sender/receiver ���篏����鐚�
 (defun sender-and-receiver-functions-all ()
   (mapcan #'sender-and-receiver-functions *tasks*))
 
 (defun sender-and-receiver-functions (task)
   (mapcar #'(lambda (f) (funcall f task))
           (list #'task-send-function
+                #'task-alloc-function
                 #'task-recv-function
                 #'rslt-send-function
                 #'rslt-recv-function)))
@@ -210,17 +231,23 @@
           ,@(task-info-task-send-body task))
     ))
 
-(defun task-recv-function (task)
-  (let ((id (task-recv-id task))
+(defun task-alloc-function (task)
+  (let ((id (task-alloc-id task))
         (struct-id (task-struct-id task)))
-    ~(def (,id) ,(task-receiver-type ~(struct ,struct-id))
+    ~(def (,id) ,(task-allocator-type ~(struct ,struct-id))
           (def pthis (ptr (struct ,struct-id))
             (csym::malloc (sizeof (struct ,struct-id))))
-          ,@(mapcar #'make-recv-var (reverse (task-info-input-vars task)))
-          ,@(task-info-task-recv-body task)
           (return pthis))
     ))
 
+(defun task-recv-function (task)
+  (let ((id (task-recv-id task))
+        (struct-id (task-struct-id task)))
+    ~(def (,id pthis) ,(task-receiver-type ~(struct ,struct-id))
+       ,@(mapcar #'make-recv-var (reverse (task-info-input-vars task)))
+       ,@(task-info-task-recv-body task) )
+    ))
+
 (defun rslt-send-function (task)
   (let ((id (rslt-send-id task))
         (struct-id (task-struct-id task)))
@@ -238,7 +265,7 @@
     ))
 
 
-;; !!! 今のところ適当
+;; !!! 篁����������������綵�
 (defvar *var-sender*
     ~((int . csym::send-int) (long . csym::send-long) (double . csym::send-double)))
 (defvar *var-receiver*
@@ -253,7 +280,7 @@
   (destructuring-bind (id texp tsize) i-t-s
     (make-sendrecv-var-array id texp tsize () #'make-recv-var-unit)))
 
-;; 配列を送受信するforループを作る．sr-unitで送信or受信を指定
+;; ���������������篆＜�����for�����若�����篏����鐚�sr-unit��ч��篆�or���篆＜�����絎�
 (defun make-sendrecv-var-array (id texp tsize subsc sr-unit)
   (if (and (consp texp) (eq ~array (car texp)))
       (let ((tsize-exp (or (car tsize) (third texp)))
@@ -285,7 +312,7 @@
     (warn "Default receiver for ~S is not prepeared." texp)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; worker-data管理
+;; worker-data膊∞��
 (defvar *defined-worker-data* nil)
 (defvar *defined-worker-init* nil)
 (defvar *wdata-accessible* nil)
@@ -314,24 +341,26 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-;; 入れ子関数の型
+;; ��ャ��絖���∽�違�����
 (defun nestfunc-type (&optional (fn-tag (ruleset-param 'rule::nestfunc-tag)))
   ~(,fn-tag int void))
 
-;; タスク授受，実行関数の型
+;; ��帥�鴻��������鐚�絎�茵���∽�違�����
 (defun task-body-type (data-type)
   ~(fn void (ptr (struct thread-data)) (ptr ,data-type)) )
 (defun task-sender-type (data-type)
   ~(csym::fn void (ptr ,data-type)) )
+(defun task-allocator-type (data-type)
+  ~(csym::fn (ptr ,data-type) void))
 (defun task-receiver-type (data-type)
-  ~(csym::fn (ptr ,data-type) ))
+  ~(csym::fn void (ptr ,data-type)))
 (defun rslt-sender-type (data-type)
   ~(csym::fn void (ptr ,data-type)) )
 (defun rslt-receiver-type (data-type)
   ~(csym::fn void (ptr ,data-type)) )
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; 直近の入れ子関数
+;; ��頑�������ャ��絖���∽��
 (defvar *latest-bk* nil)
 
 (defun latest-bk ()
@@ -346,7 +375,7 @@
      ,@body))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; 定義された関数名リスト
+;; 絎�臂������������∽�医�������鴻��
 (defvar *defined-func-names* ())
 
 (defun add-defined-func-name (id)
diff --git a/src/rule/tcell-setrule.sh b/src/rule/tcell-setrule.sh
index 8802b0bd..d0b5b5e7 100644
--- a/src/rule/tcell-setrule.sh
+++ b/src/rule/tcell-setrule.sh
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2017 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -25,14 +25,23 @@
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC))           ; one of (GCC LW-SC CL-SC XCC XCCCL RAWC)
 
+(%ifndef* NO-EXCEPTION                  ; Invalidate exception support if non-zero
+  (%defconstant NO-EXCEPTION 0))
+(%if* NO-EXCEPTION
+  (%defconstant _NO-EXCEPTION-P (%splice :no-exception t))
+  %else
+  (%defconstant _NO-EXCEPTION-P (%splice :no-exception nil))
+  )
+                
+
 (%if* (eq 'NF-TYPE 'RAWC)
   (%defconstant RULE-TCELL
-                (:tcell-sc1 :tcell-type (:tcell :no-nestfunc t) :untype))
+                (:tcell-sc1 :tcell-type (:tcell :no-nestfunc t _NO-EXCEPTION-P) :untype))
   (%output-file INPUTFILE-NAME "-c")
 %else
   (%include "rule/nestfunc-setrule.sh")
   (%defconstant RULE-TCELL
-                (:tcell-sc1 :tcell-type (:tcell :nestfunc-tag NESTFN) :untype)))
+                (:tcell-sc1 :tcell-type (:tcell :nestfunc-tag NESTFN _NO-EXCEPTION-P) :untype)))
 
 (%rule RULE-TCELL RULE)
 (%error "RULE: ~S" RULE)
diff --git a/src/rule/tcell.rule b/src/rule/tcell.rule
index 65ed1e83..20f1b091 100644
--- a/src/rule/tcell.rule
+++ b/src/rule/tcell.rule
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008-2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2020 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -23,12 +23,12 @@
 ;;; SUCH DAMAGE.
 
 ;;; Tascell --> LW-SC
-;;; To be rewritten as an extension of sc0t-to-sc0t
 
 (define-ruleset tcell (sc0t-to-sc0t)
   (ignore-cfunc t)
   (nestfunc-tag ~fn)
-  (no-nestfunc nil)                     ; 入れ子関数を持たないコードを生成（比較評価用）
+  (no-nestfunc nil)                     ; ��ャ��絖���∽�違����������������潟�若�����������鐚�罸�莠�荅�箴∞��鐚�
+  (no-exception nil)                    ; If t, invalidate exception support.
   (padding-size 1000)
   )
 
@@ -40,23 +40,18 @@
        (let ((pg (mapcar #'external-declaration decl-list)))
          (append
           (list ~(%include "rule/tcell.sh")
-                ~(decl (handle-req) (fn void
-                                        (ptr ,(tcell:nestfunc-type))
-                                        (ptr (struct thread-data))))
-                ~(decl (handle-exception) (fn void
+		~(c-exp "#include \"sendrecv.h\"")
+		~(c-exp "#include <stdlib.h>")
+                ~(decl (handle-reqs) (fn void
+					 (ptr ,(tcell:nestfunc-type))
+					 (ptr (struct thread-data))))
+		~(decl (handle-exception) (fn void
 					      (ptr ,(tcell:nestfunc-type))
 					      (ptr (struct thread-data))
 					      long))
 		)
           pg
-          ;; データ系の関数が定義されてなければ空定義の関数を追加する
-          (unless (tcell:func-name-exists-p ~csym::data-allocate)
-            (list ~(def (csym::data-allocate n1) (csym::fn void int))))
-          (unless (tcell:func-name-exists-p ~csym::data-send)
-            (list ~(def (csym::data-send n1 n2) (csym::fn void int int))))
-          (unless (tcell:func-name-exists-p ~csym::data-receive)
-            (list ~(def (csym::data-receive n1 n2) (csym::fn void int int))))
-          ;; sender/receiver関数およびその配列
+          ;; sender/receiver/allocator��∽�違�������潟�����������
           (tcell:sender-and-receiver-functions-all)
           (tcell:task-maps)
           ;; worker local storage
@@ -65,7 +60,7 @@
   )
 
 (extendrule inlined-declaration tcell
-  ;; 定義・宣言された関数名を記憶（判定は適当だが）
+  ;; 絎�臂���糸�ｈ�������������∽�医�����荐���駈����ゅ��������綵�������鐚�
   (#?(,scs[storage-class-specifier] (,id[identifier] ,@id-list) ,@rest)
    (tcell:add-defined-func-name id)
    (next-pattern))
@@ -85,7 +80,7 @@
    (tcell:with-task id
      (tcell:task-body-function
       (tcell:with-new-bk ~-bk (function-body! body))) ))
-  ;;; 以下はtaskに登録しておくだけ．最後にまとめてコードを作る
+  ;;; 篁ヤ�����task�����脂�蚊�����������������鐚����緇������障����������潟�若�����篏����
   ;; * send_task_body
   (#?(def (task-sender ,id) ,@body)
    (tcell:with-task id
@@ -120,14 +115,14 @@
        ~(def (csym::worker-init ,@tcell:*worker-init-args*) ,tcell:*worker-init-type*
           ,@(function-body! body))))
   ;; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-  ;; task-work用の関数定義/宣言
+  ;; task-work��������∽�医��臂�/絎ｈ��
   (#?(,scs[storage-class-specifier] (,@id-list[identifier])
           (wfn ,@texp-list) ,@body)
    (tcell:with-worker-data
        ~(,scs ,(wfn-add-argids-decl id-list)
               ,(type-expression! ~(wfn ,@texp-list))
               ,@(tcell:with-new-bk ~-bk (function-body! body))) ))
-  ;; 通常の関数定義/宣言
+  ;; ���絽吾����∽�医��臂�/絎ｈ��
   (#?(,scs[storage-class-specifier] (,fid[identifier] ,@id-list[identifier])
           (,fn-tag[function-tag] ,@texp-list) ,@body)
    (if (and (ruleset-param 'ignore-cfunc)
@@ -161,7 +156,7 @@
   (#?() (values))
   )
 
-;; 送受信サイズの指定．定数またはそれまでに定義されているメンバ名を指定可能
+;; ������篆＜�泣�ゃ�冴�����絎�鐚�絎���違�障�������������障�с��絎�臂������������������＜�潟�����������絎�������
 (defrule transfer-size-specifier tcell
   (#?,num[sc-number]
    x)
@@ -170,20 +165,20 @@
      (ierror "~S is not defined as a field of task ~A" id (tcell:task-id)))
    ~(fref (mref pthis) ,id) ))
 
-;;; 関数定義の仮引数追加
+;;; ��∽�医��臂����篁�綣���域申���
 (defrule wfn-add-argids-decl tcell
-  (#?(,@id-list)                        ; id-listには関数名も含む
+  (#?(,@id-list)                        ; id-list��������∽�医�����������
    (if (ruleset-param 'no-nestfunc) id-list
      (insert (list ~-bk ~-thr) id-list 1) ))
   )
-;;; 関数呼出の実引数追加
+;;; ��∽�医�弱�冴��絎�綣���域申���
 (defrule wfn-add-argids tcell
-  (#?(,@id-list)                        ; id-listには関数名も含む
+  (#?(,@id-list)                        ; id-list��������∽�医�����������
    (if (ruleset-param 'no-nestfunc) id-list
      (insert (list (tcell:latest-bk) ~-thr) id-list 1) ))
   )
 
-;;; wfn関数型の仮引数の型追加
+;;; wfn��∽�医�����篁�綣���違�����菴遵��
 (extendrule type-expression tcell
   (#?(wfn ,@texp-list)
    (let ((texp-rets (mapcar #'type-expression! texp-list)))
@@ -196,9 +191,9 @@
 (extendrule statement tcell
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;; do-two
-  ;; * stat1->stat2 の順に実行
-  ;; * stat2 実行中に仕事の要求がきたら，:put以下を実行してsendする．
-  ;;   <stat1>が終わり，sendした仕事の結果が返ってきたら，:get 以下を実行．
+  ;; * stat1->stat2 ���������絎�茵�
+  ;; * stat2 絎�茵�筝����篁�篋����荀�羆�������������鐚�:put篁ヤ�����絎�茵�������send������鐚�
+  ;;   <stat1>���腟�������鐚�send������篁�篋����腟�������菴���ｃ�����������鐚�:get 篁ヤ�����絎�茵�鐚�
   (#?(do-two ,stat1 ,stat2 ({handles} ,id 
                             {(:guard ,@guard-body ,guard-exp)}
                             (:put ,@put-body) (:get ,@get-body)))
@@ -214,54 +209,71 @@
             (b-put-body (function-body put-body))
             (b-get-body (function-body get-body)))
        ~(begin
-         (def ,tdat-id (struct ,(tcell:task-struct-id))) ; 送信用 task-body
-         (def pthis (ptr (struct ,(tcell:task-struct-id))) (ptr ,tdat-id))
-         (def ,spn-id int 0)            ; すでに仕事をsendしていたら '1'
-         (begin
-          ;; Called for backtracking to handle a task request or an exception
-          (def (,bk-id) ,(tcell:nestfunc-type)
-	    ;; If this nested function is called by an exception:
-	    (if -thr->exiting
-		(begin
-		  ;; Wait for spawned tasks to be completed
-		  (while (> (dec ,spn-id) 0)
-		    (wait-rslt -thr 0))
-		  ;; Continue backtracking (never returns)
-		  (,(tcell:latest-bk))))
-	    ;; If this do-two has spawned a task:
+	  #+comment 
+	  (def ,tdat-id (struct ,(tcell:task-struct-id))) ; ���篆∞�� task-body
+	  (def pthis (ptr (struct ,(tcell:task-struct-id)))
+	    #+comment (ptr ,tdat-id))
+	  (def ,spn-id int 0)            ; �����с��篁�篋����send��������������� '1'
+	  (begin
+	    ;; <-- Nestfunc start ---
+	    ;; Called for backtracking to handle a task request or an exception
+	    (def (,bk-id) ,(tcell:nestfunc-type)
+	      ;; If this nested function is called for abnormal exit:
+	      (if (or (== -thr->exiting EXITING-EXCEPTION)
+		      (== -thr->exiting EXITING-CANCEL))
+		  (begin
+		    ;; Wait for spawned tasks to be completed
+		    (while (> (dec ,spn-id) 0)
+		      (wait-rslt -thr 0))
+		    ;; Continue backtracking (never returns)
+		    (,(tcell:latest-bk))))
+	      ;; If this do-two has spawned a task:
             (if ,spn-id  (return 0))
 	    ;; Try further backtracking
-            (,(tcell:latest-bk))        ; より根元での分割を試みる
-            (while (fref (mref -thr) treq-top) ; タスク作成待ちスタックに要素があれば
-                (begin
-                  ,@(if-pattern-variable guard-exp
-                        (list
-                         ~(begin 
-                            ,@guard-body
-                            (if (csym::guard-task-request-prob -thr ,guard-exp)
-                                (continue)))))
-                  (begin ,@b-put-body)
-                  (= ,spn-id 1)
-                  (csym::make-and-send-task -thr ,(tcell:task-no) pthis)
-                  (return 1)))
+            (,(tcell:latest-bk))        ; ��������劫����с�������蚊��荅���帥��
+            (while -thr->treq-top       ; ��帥�鴻��篏����緇���＜�鴻�帥��������荀�膣�������������
+	      (begin
+		,@(if-pattern-variable guard-exp
+		    (list
+		     ~(begin 
+			,@guard-body
+			(if (csym::guard-task-request-prob -thr ,guard-exp)
+			    (continue)))))
+		(= pthis
+		   (cast (ptr (struct ,(tcell:task-struct-id)))
+		     (csym::malloc (sizeof (struct ,(tcell:task-struct-id))))))
+		(begin ,@b-put-body)
+		(= ,spn-id 1)
+		(csym::make-and-send-task -thr ,(tcell:task-no) pthis 1)
+		(return 1)))
             (return 0))
-          ;; ここから仕事本体
-          (if (fref (mref -thr) req)    ; （ポーリング）タスク要求がきていたら
-              ,(tcell:with-new-bk bk-id ; 分割を試みる
-                 (wfn-add-argids ~(handle-req))))
-          ,b-stat1)
-         (if (and ,spn-id
-                  (wait-rslt -thr 1))
-             (begin ,@b-get-body)
-           (begin ,b-stat2))
-         ) )))
+	    ;; --- Nestfunc End -->
+	    ;; Polling for cancel message requests, cancellation flags,
+	    ;; and task requests.
+	    (if (or -thr->req-cncl
+		    -thr->task-top->cancellation
+		    -thr->req)
+		,(tcell:with-new-bk bk-id
+		   (wfn-add-argids ~(handle-reqs))))
+	    ,b-stat1)
+	  (if ,spn-id
+	      ;; If a subtask is spawned, wait for the result.
+	      (if (= pthis (wait-rslt -thr 1))
+		  (begin
+		    (begin ,@b-get-body)
+		    (csym::free pthis))
+		;; If the subtask has thrown an exception, propagate it.
+		(if (== -thr->exiting EXITING-EXCEPTION)
+		    ,(wfn-add-argids ~(handle-exception -thr->exception-tag))))
+	    (begin ,b-stat2))
+	  ) )))
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;; do-many
-  ;; * ,var を制御変数として，,fromから ,toまでについて ,@bodyを実行
-  ;; * body実行中に仕事の要求がきたら，残り範囲の半分を渡す
-  ;; * 渡し方は :put 中で指定，渡す仕事の範囲の先頭は ,put-from，,put-to
-  ;;   に渡され，:put 中の文で使用することができる．
-  ;; * 受け取ったtaskの結果の結合は:getで指定
+  ;; * ,var �����九勝紊���違��������鐚�,from������ ,to��障�с����ゃ����� ,@body���絎�茵�
+  ;; * body絎�茵�筝����篁�篋����荀�羆�������������鐚�罧����膀���蚊�����������羝＜��
+  ;; * 羝＜����鴻�� :put 筝���ф��絎�鐚�羝＜��篁�篋����膀���蚊����������� ,put-from鐚�,put-to
+  ;;   ���羝＜�����鐚�:put 筝���������т戎��������������������с�����鐚�
+  ;; * �����������ｃ��task���腟�������腟�������:get��ф��絎�
   (#?(do-many for ,var[identifier] from ,from to ,to
               ,@body
               ({handles} ,id
@@ -284,14 +296,15 @@
      (tcell:with-task id
        ~(begin
          (def ,var  int ,(expression from))
-         (def ,var2 int ,(expression to)) ; ,var <= i < ,var2 が未処理
-         (def pthis (ptr (struct ,(tcell:task-struct-id)))) ; 送信用 task-body
-         (def ,spn-id int 0)            ; 仕事を他所にsendしている数
-	 ;; <-- Nestfunc start
+         (def ,var2 int ,(expression to)) ; ,var <= i < ,var2 ������������
+         (def pthis (ptr (struct ,(tcell:task-struct-id)))) ; ���篆∞�� task-body
+         (def ,spn-id int 0)            ; 篁�篋����篁�������send���������������
+	 ;; <-- Nestfunc start ---
 	 ;; Called for backtracking to handle a task request or an exception
          (def (,bk-id) ,(tcell:nestfunc-type)
-	   ;; If this nested function is called by an exception:
-	   (if -thr->exiting
+	   ;; If this nested function is called for abnormal exit
+	   (if (or (== -thr->exiting EXITING-EXCEPTION)
+		   (== -thr->exiting EXITING-CANCEL))
 	       (begin
 		 ;; Wait for spawned tasks to be completed
 		 (while (> (dec ,spn-id) 0)
@@ -302,7 +315,7 @@
 		 (,(tcell:latest-bk))))
            ;; If this do-many has not spawned any tasks, continue backtracking
            (if (not ,spn-id) (,(tcell:latest-bk)))
-           (while (and (fref (mref -thr) treq-top) ; there remains a treq?
+           (while (and -thr->treq-top              ; there remains a treq?
                        (<= 2 (- ,var2 ,var)))      ; there remains any spawnable iterations?
              (def ,put-to int ,var2)
              (def ,put-from int)
@@ -328,13 +341,16 @@
                   (csym::malloc (sizeof (struct ,(tcell:task-struct-id))))))
              (begin ,@(function-body put-body))
              (inc ,spn-id)
-             (csym::make-and-send-task -thr ,(tcell:task-no) pthis))
+             (csym::make-and-send-task -thr ,(tcell:task-no) pthis (== ,spn-id 1)))
            (return 0))
-	 ;; Nestfunc End -->
-	 ;; Polling for task requests
-         (if (fref (mref -thr) req)
-             ,(tcell:with-new-bk bk-id
-                (wfn-add-argids ~(handle-req))))
+	 ;; --- Nestfunc End -->
+	 ;; Polling for cancel message requests, cancellation flags,
+	 ;; and task requests.
+	 (if (or -thr->req-cncl
+		 -thr->task-top->cancellation
+		 -thr->req)
+	     ,(tcell:with-new-bk bk-id
+	        (wfn-add-argids ~(handle-reqs))))
 	 ;; Loop body
          (for ((< ,var ,var2) (inc ,var))
            ,@(tcell:with-new-bk bk-id (function-body body)))
@@ -342,13 +358,18 @@
          (while (> (dec ,spn-id) 0)
            (= pthis (cast (ptr (struct ,(tcell:task-struct-id)))
                       (wait-rslt -thr 1)))
-           ,@(function-body get-body)
-           (csym::free pthis))) )))
+	   (if pthis (begin
+		       ,@(function-body get-body)
+		       (csym::free pthis))))
+	 ;; If there is a subtask that has thrown an exception, propagate it.
+	 (if (== -thr->exiting EXITING-EXCEPTION)
+	     ,(wfn-add-argids ~(handle-exception -thr->exception-tag)))
+	 ) )))
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;; do-many*
-  ;; * Space Stealing用のdo-many
-  ;; * 通常のfor文と同様に記述することができる
-  ;; * ポーリングはイテレーション毎に行う
+  ;; * Space Stealing������do-many
+  ;; * ���絽吾��for���������罕����荐�菴違����������������с�����
+  ;; * �����若����潟�違����ゃ�������若�激�с�恰�����茵����
   ;; !!! does not support non-local exit by "throw" yet
   (#?(do-many* (,init-exp ,cond-exp ,loop-exp)
                ,@body
@@ -359,12 +380,13 @@
           (bk-id (generate-id "do_many_bk")))
       (tcell:with-task id
        ~(begin
-          (def pthis (ptr (struct ,(tcell:task-struct-id)))) ; 送信用 task-body
-          (def ,spn-id int 0)            ; 仕事を他所にsendしている数
-          ;; タスク要求がきたら呼ばれる
+          (def pthis (ptr (struct ,(tcell:task-struct-id)))) ; ���篆∞�� task-body
+          (def ,spn-id int 0)            ; 篁�篋����篁�������send���������������
+	  ;; <-- Nestfunc start ---
+          ;; ��帥�鴻��荀�羆���������������若�違�����
           (def (,bk-id) ,(tcell:nestfunc-type)
             (if (not ,spn-id) (,(tcell:latest-bk)))
-            (if (fref (mref -thr) treq-top) ; タスク作成待ちスタックに要素があれば
+            (if -thr->treq-top           ; ��帥�鴻��篏����緇���＜�鴻�帥��������荀�膣�������������
               (begin
                 (= pthis (cast (ptr (struct ,(tcell:task-struct-id)))
                          (csym::malloc (sizeof (struct ,(tcell:task-struct-id))))))
@@ -372,21 +394,28 @@
                 (inc ,spn-id)
                 (csym::make-and-send-task -thr ,(tcell:task-no) pthis)))
             (return 0))
+	  ;; --- Nestfunc end -->
           (for (,(expression! init-exp) ,(expression! cond-exp) ,(expression! loop-exp))
-            (if (fref (mref -thr) req)     ; （ポーリング）タスク要求がきていたら
-             ,(tcell:with-new-bk bk-id  ; 分割を試みる
+            (if -thr->req                   ; 鐚������若����潟�逸����帥�鴻��荀�羆�������������������
+             ,(tcell:with-new-bk bk-id  ; �����蚊��荅���帥��
                 (wfn-add-argids ~(handle-req))))
             ,@(function-body body))
           (while (> (dec ,spn-id) 0)
             (= pthis (cast (ptr (struct ,(tcell:task-struct-id)))
                        (wait-rslt -thr 1)))
-            ,@(function-body get-body)
-            (csym::free pthis))) )))
+	    (if pthis
+		(begin
+		  ,@(function-body get-body)
+		  (csym::free pthis))))
+	  ;; If there is a subtask that has thrown an exception, propagate it.
+	  (if (== -thr->exiting EXITING-EXCEPTION)
+	      ,(wfn-add-argids ~(handle-exception -thr->exception-tag)))
+	  ) )))
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;; tcell-broadcast
-  ;; * タスクを全ノードに送りつける
-  ;; * 全ノードからのackを待ち合わせる
-  ;; * タスクオブジェクトの初期化方法は:putで指定
+  ;; * ��帥�鴻�������������若�������������ゃ�����
+  ;; * ��������若�����������ack���緇���≦�����������
+  ;; * ��帥�鴻����������吾�с�������������������号�����:put��ф��絎�
   (#?(tcell-broadcast ,id (:put ,@put-body))
    (tcell:with-task id
      ~(begin
@@ -398,11 +427,11 @@
        (csym::broadcast-task -thr ,(tcell:task-no) pthis))))
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;; dynamic-wind
-  ;; * do-two, do-many の（動的）スコープ内で使用
-  ;; * bef-body, body, aft-body の順で実行
-  ;; * body実行中に仕事の要求がきたら，aft-bodyを実行してから
-  ;;   do-two, do-many の仕事分割を実行する．
-  ;;   分割作業が終わったら，再び bef-bodyを実行してから自分の仕事に戻る．
+  ;; * do-two, do-many ���鐚�������鐚���鴻�潟�若�������т戎���
+  ;; * bef-body, body, aft-body ��������у��茵�
+  ;; * body絎�茵�筝����篁�篋����荀�羆�������������鐚�aft-body���絎�茵�������������
+  ;;   do-two, do-many ���篁�篋������蚊��絎�茵�������鐚�
+  ;;   �����俄��罐����腟������ｃ�����鐚������� bef-body���絎�茵����������������������篁�篋������祉��鐚�
   (#?(dynamic-wind
       (:before ,@bef-body)
       (:body ,@body)
@@ -449,8 +478,9 @@
 	  (e-exp (expression! exp))
           (b-body (tcell:with-new-bk bk-id (function-body body))))
      ~(begin
-	(def ,label-id __label__)
-	(def ,catchval-id long)
+	,.(unless (ruleset-param 'no-exception)
+            (list ~(def ,label-id __label__)))
+	(def ,catchval-id int)
         ,.(unless (ruleset-param 'no-nestfunc)
             (list
 	     ;; nestfunc: If worker is handling an exception and
@@ -458,12 +488,15 @@
 	     ;; exit from the catch block. Otherwise, continue
 	     ;; backtracking.
              ~(def (,bk-id) ,(tcell:nestfunc-type)
-		(if (and -thr->exiting
+		(if (and (== -thr->exiting EXITING-EXCEPTION)
 			 (== ,e-exp -thr->exception-tag))
 		    (begin 
-		      (= -thr->exiting 0)
-		      (goto ,label-id))
-		  (,(tcell:latest-bk))))))
+		      (= -thr->exiting EXITING-NORMAL)
+		      (PROF-CODE
+		       (csym::tcounter-change-state -thr TCOUNTER-EXEC OBJ-NULL 0))
+                      ,(tcell:nonlocal-goto label-id)
+                      )
+                    (,(tcell:latest-bk))))))
 	(= ,catchval-id ,e-exp)	
         (begin ,@b-body)
 	(label ,label-id ())
@@ -471,7 +504,7 @@
   )
 
 (extendrule expression tcell
-  ;; dreq, data関連
+  ;; dreq, data��∫��
   (#?(the ,texp (call (the ,ftexp setup-data) ,@exp-list))
    ~(the ,texp (call (the ,ftexp csym::-setup-data) ,@(mapcar #'expression exp-list))) )
   (#?(the ,texp (call (the ,ftexp request-data) ,@exp-list))
@@ -480,30 +513,30 @@
    ~(the ,texp (call (the ,ftexp csym::-wait-data) ,@(mapcar #'expression exp-list))) )
   (#?(the ,texp (call (the ,ftexp set-exist-flag) ,@exp-list))
    ~(the ,texp (call (the ,ftexp csym::-set-exist-flag) ,@(mapcar #'expression exp-list))) )
-  ;; wfn関数呼び出し
-  ;; * 引数の追加 
+  ;; wfn��∽�医�若�喝�冴��
+  ;; * 綣���違��菴遵�� 
   (#?(the ,texp (call (the (ptr (wfn ,@texp-list)) ,exp-f) ,@exp-list))
    ~(the ,texp (call ,@(wfn-add-argids ~((the (ptr ,(type-expression! ~(wfn ,@texp-list))) ,exp-f)
                                          ,@(mapcar #'expression! exp-list))))) )
   ;; get acceptance probability
   (#?(the ,texp PROBABILITY)
    (if (tcell:wdata-accessible-p)
-       ~(fref (mref -thr) probability)
+       ~-thr->probability
      x))
   ;; access to worker local storage
   (#?(the ,texp WDATA)
    (if (tcell:wdata-accessible-p)
-       ~(mref (cast (ptr (struct worker-data)) (fref (mref -thr) wdptr)))
+       ~(mref (cast (ptr (struct worker-data)) -thr->wdptr))
        x))
   ;; get WORKER-ID
   (#?(the ,texp WORKER-ID)
    (if (tcell:wdata-accessible-p)
-       ~(fref (mref -thr) id)
+       ~-thr->id
        -1))
   ;; get whether propagating an exception
   (#?(the ,texp EXITING)
    (if (tcell:wdata-accessible-p)
-       ~(fref (mref -thr) exiting)
+       ~-thr->exiting
        0))
   ;; this -> (mref pthis)
   (#?(the ,texp this)
diff --git a/src/rule/temp-defs.lsp b/src/rule/temp-defs.lsp
index 70a2d9cd..a97ff780 100644
--- a/src/rule/temp-defs.lsp
+++ b/src/rule/temp-defs.lsp
@@ -56,7 +56,7 @@
     `(let* ((*current-block* (make-c-block :add-here-p ,add-here-p
                                            :parent *current-block*))
             (,ret-var (progn ,@body)))
-       (nconc (flush-add-decls)         ; tmpの定義列を返す or 外ブロックに回してnilを返す
+       (nconc (flush-add-decls)         ; tmp���絎�臂�������菴���� or 紊�������������������������nil���菴����
               ,ret-var))))
 
 (defmacro with-new-block-item (initial-subexpression-depth &body body)
@@ -94,8 +94,8 @@
   (prog1 (nreverse *precedents*)
     (setq *precedents* nil)))
 
-;; 宣言の変換で先行の文が必要になった場合，
-;; <decl> ... --> ,@precds (begin <decl> ...) とする
+;; 絎ｈ�����紊������у��茵����������綽�荀���������ｃ����翫��鐚�
+;; <decl> ... --> ,@precds (begin <decl> ...) ���������
 (defun flush-precedents-decl (decl-exp orig-exp)
   (let ((precds (flush-precedents)))
     (if precds
diff --git a/src/rule/temp.rule b/src/rule/temp.rule
index 1578733f..00c37b8c 100644
--- a/src/rule/temp.rule
+++ b/src/rule/temp.rule
@@ -26,8 +26,8 @@
 ;;; (A-normalization)
 
 (define-ruleset temp (sc0t-to-sc0t)
-  (ignore-cfn t)                        ; csymの関数呼出し，csymの関数定義は変形しない
-  (decl-each-block nil)                 ; tmpの宣言を，t: 関数の先頭 nil: 各ブロックの先頭
+  (ignore-cfn t)                        ; csym�����∽�医�弱�冴��鐚�csym�����∽�医��臂����紊�綵≪��������
+  (decl-each-block nil)                 ; tmp���絎ｈ�����鐚�t: ��∽�違�������� nil: ������������������������
   )
 
 (scr:require "TEMP-DEFS")
@@ -141,7 +141,7 @@
        (let ((the-fexp ~(the ,ftexp ,fexp)))
          (cond
           ((or (not (temp:subexpression-p))
-               (and (ruleset-param 'ignore-cfn) ; 「csym::fnは無視」オプション
+               (and (ruleset-param 'ignore-cfn) ; ���csym::fn�����∴�������������激�с��
                     (or (cid-p fexp)
                         (and (tagged-p ~ptr ftexp)
                              (tagged-p ~csym::fn (second ftexp))))))
@@ -160,10 +160,10 @@
                  (temp:add-precedent ~(the ,texp (= ,tmp-exp ,call-exp)))
                  tmp-exp)) ))))) )
   ;; operators
-  ;; もともと (= a (f x)) の形のものは変形しないようにするため
-  ;; with-deeper-subexpressionで被せない
+  ;; ������������ (= a (f x)) ���綵≪�����������紊�綵≪�����������������������������
+  ;; with-deeper-subexpression��ц←���������
   (#?(the ,texp (= (the ,idtexp ,id[identifier]) ,exp2))
-   (let ((exp2-ret (expression! exp2))) ; sub-expression でなくてよい
+   (let ((exp2-ret (expression! exp2))) ; sub-expression ��������������
      ~(the ,texp (= (the ,idtexp ,id) ,exp2-ret))))
   (otherwise
    (temp:with-deeper-subexpression
diff --git a/src/rule/type-defs.lsp b/src/rule/type-defs.lsp
index 97969cd8..dd709caa 100644
--- a/src/rule/type-defs.lsp
+++ b/src/rule/type-defs.lsp
@@ -48,13 +48,13 @@
 ;;; (struct $str) (enum $en) etc.
 (defvar *str-alist* (list))
 (defvar *var-alist* (list))
-(defvar *interim-str-alist* (list (cons '$dummy nil))) ; 未定義時の仮定義（未使用）
-(defvar *interim-var-alist* (list (cons '$dummy nil))) ; 未定義時の仮定義
+(defvar *interim-str-alist* (list (cons '$dummy nil))) ; ���絎�臂�������篁�絎�臂�鐚����篏睡��鐚�
+(defvar *interim-var-alist* (list (cons '$dummy nil))) ; ���絎�臂�������篁�絎�臂�
 
 (defvar *flow-printed* '())
 
 ;;;;;;;;;;;;;;;;;;;;
-;;; 環境設定
+;;; ��医��荐�絎�
 
 (defmacro with-typerule-environment (&body body)
   `(let ((*interim-str-alist* (list (cons '$dummy nil)))
@@ -65,7 +65,7 @@
 
 (defmacro with-function (id &body body)
   `(error-indent (format nil "In function ~S:" ,id)
-                 (let ((*flow-printed* '())) ; print-flow用
+                 (let ((*flow-printed* '())) ; print-flow���
                    ,@body)))
 
 (defmacro with-new-environment (&body body)
@@ -82,7 +82,7 @@
                        ,@body))) ))
 
 ;;;;;;;;;;;;;;;;;;;;
-;;; 変数登録
+;;; 紊���亥�脂��
 
 ;;; Add variable declaration
 (defun add-variable (id type &optional (remove-type-qualifier t))
@@ -107,12 +107,12 @@
   (assume-variable id (list '$type type) remove-type-qualifier))
 
 ;;; Get struct member definition
-;;; メンバ定義のalistとstruct-declaration による変形結果を返す
+;;; ��＜�潟��絎�臂����alist���struct-declaration ���������紊�綵∝��������菴����
 (defun get-struct-member-info (sdeclist)
   (let* ((orig-var-alist *var-alist*)
          (*var-alist* *var-alist*)
          (sdecl-with-type (mapcar #'rule:struct-declaration! sdeclist))
-                                        ; ここで*var-alist*に登録される
+                                        ; ���������*var-alist*�����脂�蚊��������
          (member-alist (ldiff *var-alist* orig-var-alist)))
     (values member-alist sdecl-with-type)))
 
@@ -129,7 +129,7 @@
   (push (cons id member-alist) (cdr *interim-str-alist*)))
 
 ;;;;;;;;;;;;;;;;;;;;
-;;; 変数リストのフィルタリング
+;;; 紊���違����鴻����������ｃ����帥����潟��
 
 ;;; leave only type-entry from *var-alist*
 (defun leave-typename (&optional (alist *var-alist*))
@@ -139,10 +139,10 @@
    alist))
 
 ;;;;;;;;;;;;;;;;;;;;
-;;; 変数検索
+;;; 紊���井��膣�
 
 ;;; get type of variable
-;;; expect: idは変数，型名のどちらであるはずか（期待と一致しなければerror）
+;;; expect: id���紊���逸����������������＜����с��������������鐚����緇����筝���眼��������������error鐚�
 (defun assoc-vartype (id &optional (expect nil))
   ;; (format t "(assoc-vartype ~s)~%" id)
   (acond
@@ -157,7 +157,7 @@
           (when (and expect (not (eq :variable expect)))
             (ierror "~S is declared as variable." id))
           (values datum :variable)))))
-   ;; 見つからなかった場合
+   ;; 荀���ゃ�������������ｃ����翫��
    ((eq :typename expect)
     (iwarn "The type ~S is undefined." id)
     (assume-typename id id)
@@ -196,16 +196,16 @@
 ;;           (expand-typedef-name asc))))))
 
 ;;; * operator
-;;; * 引数の型リスト->式全体の型 の関数
-;;; * operatorの引数リスト (expressionのみ)
-;;; を受けとって，式の変換結果を返す
+;;; * 綣���違����������鴻��->綣����篏������� �����∽��
+;;; * operator���綣���違����鴻�� (expression������)
+;;; ��������������ｃ��鐚�綣����紊����腟�������菴����
 (defun handle-exp-args (op fun exp-list)
   (let* ((exp-rets (mapcar #'rule:expression! exp-list))
          (exp-types (mapcar #'second exp-rets))
          (ret-type (funcall fun exp-types)))
     ~(the ,ret-type (,op ,@exp-rets))))
 
-;; argが1個のとき用
+;; arg���1���������������
 (defun handle-exp-1arg (op fun exp)
   (let* ((exp-ret (rule:expression! exp))
          (exp-type (second exp-ret))
@@ -213,7 +213,7 @@
     ~(the ,ret-type (,op ,exp-ret))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; print-flow 用
+;;; print-flow ���
 (defun add-flow-printed (fexp)
   (push fexp *flow-printed*))
 
diff --git a/src/rule/type-info.rule b/src/rule/type-info.rule
index a9fe47e7..c92d416c 100644
--- a/src/rule/type-info.rule
+++ b/src/rule/type-info.rule
@@ -24,11 +24,11 @@
 
 ;;; sc0 => sc0-with-type-information (the <type> <expression>)
 
-;;; 全てのexpressionを (the <type-expression> <expression>) の形にする。
-;;; 関数呼び出し式の先頭に'call'を付ける。
+;;; ���������expression��� (the <type-expression> <expression>) ���綵≪�����������
+;;; ��∽�医�若�喝�冴��綣�������������'call'���篁����������
 
 (define-ruleset type-info (sc0-to-sc0)
-  ;; (ignore-cfunc t)                      ; csym::fn の内部を無視（関数型情報の登録はする）
+  ;; (ignore-cfunc t)                      ; csym::fn ��������������∴��鐚���∽�医�������宴����脂�蚊��������鐚�
   (print-flow nil))
 
 (scr:require "TYPE-DEFS")
@@ -78,8 +78,8 @@
            (type:add-variable en ~(enum ,id))
            (push en new-enum-list))))
      ~(def (enum ,id) ,@(nreverse new-enum-list))))
-  ;; ; 変換でtypedef-nameは展開してしまうため，
-  ;; ; deftypeそのものは削除する
+  ;; ; 紊�������typedef-name���絮���������������障��������鐚�
+  ;; ; deftype��������������������ゃ�����
   ;; deftype (struct)
   ((#?(deftype ,id struct ,@sdeclist) )
    (multiple-value-bind (member-alist sdecl-with-type)
@@ -167,9 +167,9 @@
 
 ;;;;;;; expression ;;;;;;;
 ;; operator
-;; SC0-to-SC0の返り値
-;; argsを処理するための関数
-;; 式全体の型を得るための関数
+;; SC0-to-SC0���菴�������
+;; args��������������������������∽��
+;; 綣����篏����������緇���������������∽��
 
 (defrule int-oparator type-info
   ((#?,op[~(and or < > <= >= == !=)])
@@ -195,7 +195,7 @@
    (type:handle-exp-args
     ~aref
     (compose (compose-n (length (cdr expr-list)) #'deref-type)
-             #'car)                     ; 先頭の型にderef n-1回
+             #'car)                     ; ���������������deref n-1���
     expr-list))
   ;; fref
   ((#?(fref ,exp1 ,@id-list) )
@@ -297,12 +297,12 @@
                    ~AAssume its type as ~S."
                   fexp *error-indent-spaces* kari-type))
          (setq fn-type kari-type)))
-     ;; 関数呼出フロー表示
+     ;; ��∽�医�弱�冴�������取；腓�
      (when (ruleset-param 'print-flow)
        (unless (type:already-printed fexp)
          (type:add-flow-printed fexp)
          (iformat "-> ~S~%" fexp)))
-     ;; これが変換結果
+     ;; ���������紊����腟����
      ~(the ,(second (second fn-type))
            (call (the ,fn-type ,(third fexp-with-type))
                  ,@(mapcar #'expression! arg-list))) ))
diff --git a/src/rule/untype.rule b/src/rule/untype.rule
index 448c00c2..2d6ed03b 100644
--- a/src/rule/untype.rule
+++ b/src/rule/untype.rule
@@ -24,8 +24,8 @@
 
 ;;;; sc0 with-type-information => sc0
 
-;;; (the <type-expression> <expression>) を <expression> に戻す。
-;;; call を消す。
+;;; (the <type-expression> <expression>) ��� <expression> �����祉�����
+;;; call ���羔�������
 
 (defpackage "UNTYPE"
   (:export :begin-with-$ :remove-$)
diff --git a/src/sample/delete-intermediate b/src/sample/delete-intermediate
index 442c44ca..61676a5a 100755
Binary files a/src/sample/delete-intermediate and b/src/sample/delete-intermediate differ
diff --git a/src/sample/hsc/bin2list.hsc b/src/sample/hsc/bin2list.hsc
index 064312b4..114fc847 100644
--- a/src/sample/hsc/bin2list.hsc
+++ b/src/sample/hsc/bin2list.hsc
@@ -1,4 +1,4 @@
-;; 先頭の#include は手動ではずして
+;; ���������#include ��������������������
 ;(%rule (:basic :type :tmp (:nestfunc) :untype))
 
 (c-exp "#include<sys/time.h>")
@@ -7,7 +7,7 @@
 (c-exp "#include<string.h>")
 (%include "rule/hsc-setrule.sh")
 
-;;; 構造体定義
+;;; 罕����篏�絎�臂�
 (def (struct _Bintree)
   (def key int)
   (def val int)
@@ -25,7 +25,7 @@
   (def cdr (ptr (struct _Alist))) )
 (deftype Alist (struct _Alist))
 
-;;; 計測パラメータ
+;;; 荐�羝���������＜�若��
 (static-def maxins int)
 (static-def maxsearch int)
 
@@ -34,7 +34,7 @@
   (= p (new (init Bintree (struct k v 0 0))))
   (return p))
 
-;;; x がすでに存在する場合
+;;; x ��������с��絖������������翫��
 (def (insert x k v) (fn void (ptr Bintree) int int)
   (def y (ptr Bintree) 0)
 
diff --git a/src/sample/hsc/bintree.hsc b/src/sample/hsc/bintree.hsc
index 9ff4348e..5b4fb086 100644
--- a/src/sample/hsc/bintree.hsc
+++ b/src/sample/hsc/bintree.hsc
@@ -5,7 +5,7 @@
 (c-exp "#include<string.h>")
 ;; (c-exp "#include<sys/time.h>")
        
-;;; 構造体定義
+;;; 罕����篏�絎�臂�
 (def (struct _Bintree)
   (def key int)
   (def val int)
@@ -14,19 +14,19 @@
 
 (deftype Bintree (struct _Bintree))
 
-;;; 計測パラメータ
+;;; 荐�羝���������＜�若��
 (static-def maxins int)
 (static-def maxsearch int)
 
 (def (newBintree k v) (fn (ptr Bintree) int int)
   (def p (ptr Bintree) 0)
   ;; (def ar (array int 20))
-  (= p (new (init Bintree (struct k v 0 0)))) ;ポインタはちゃんと初期化しないとエラーにする。
+  (= p (new (init Bintree (struct k v 0 0)))) ;�����ゃ�潟�帥����＜�������������������������������������若�����������
   ;; (= ar (new (init (array int 20) (array 0))))
   ;; ((aref-this 15) 3)))))
   (return p))
 
-;;; x がすでに存在する場合
+;;; x ��������с��絖������������翫��
 (def (insert x k v) (fn void (ptr Bintree) int int)
   (def y (ptr Bintree) 0)
   (do-while 1
@@ -49,7 +49,7 @@
     (= x y))
   )
 
-;;; insertと同様。
+;;; insert������罕����
 (def (search x k v0) (fn int (ptr Bintree) int int)
   (while x
    (if (== (fref (mref x) key) k)
diff --git a/src/sample/lightweight/nonlocalexit.sc b/src/sample/lightweight/nonlocalexit.sc
index 44c54802..41276418 100644
--- a/src/sample/lightweight/nonlocalexit.sc
+++ b/src/sample/lightweight/nonlocalexit.sc
@@ -30,10 +30,10 @@
 (decl (csym::printf) (fn int (ptr (const char)) va-arg))
 (deftype size-t unsigned-int)
 
-;;;; 1^2 + 2^2 + ... + n^2 の計算
-;;;; 結果がlimitを超えたら -1 を返す。
+;;;; 1^2 + 2^2 + ... + n^2 ���荐�膊�
+;;;; 腟�������limit���莇���������� -1 ���菴�������
 (def (square-sum n pflag) (fn int int (ptr int))
-  (def O-FLOW __label__)  ; この宣言はgccでも必須、2パス解析すればはずせる?
+  (def O-FLOW __label__)  ; ������絎ｈ�����gcc��с��綽�������2�����壕В�����������違�����������?
   (def limit int 8192)
 
   (def (square-sum-t n acc) (lightweight int int int)
diff --git a/src/sample/lightweight/nonlocalexit2.sc b/src/sample/lightweight/nonlocalexit2.sc
index f35c7363..9fe960ea 100644
--- a/src/sample/lightweight/nonlocalexit2.sc
+++ b/src/sample/lightweight/nonlocalexit2.sc
@@ -27,8 +27,8 @@
   (%defconstant NF-TYPE LW-SC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
 (%include "rule/nestfunc-setrule.sh")
 
-;;; goto による入れ子関数脱出例
-;;; (複雑なケース)
+;;; goto �����������ャ��絖���∽�域�怨�坂��
+;;; (茲���������宴�若��)
 ;;; g -> f -> g1 -> g -> g1 ==goto==> g
 (%rule (:nestfunc-sc1 :nestfunc-type :nestfunc-temp :nestfunc :untype))
 
@@ -38,7 +38,7 @@
   (pg 0)
   (return 0))
 
-;; 親関数への呼出しがあるときはプロトタイプ宣言が必須
+;; 荀���∽�違�吾����弱�冴�������������������������������帥�ゃ��絎ｈ�����綽����
 (decl (g pg) (fn int (ptr (lightweight void int))))
 
 (def (g pg) (fn int (ptr (lightweight void int)))
@@ -51,13 +51,13 @@
   (if (== pg 0)
       (return (f g1))
       (begin
-       (g1 1)  ; goto先は後で呼び出されたg
+       (g1 1)  ; goto������緇���у�若�喝�冴��������g
        (return 0)))
   
   (label L1
    (if (== pg 0)
        (return 0)
-       (pg 1)  ; goto先は最初に呼び出されたg
+       (pg 1)  ; goto�����������������若�喝�冴��������g
        )))
   
 (def (main) (fn int)
diff --git a/src/sample/tcell/LOAD.lsp b/src/sample/tcell/LOAD.lsp
index 70c5ad57..d422881e 100644
--- a/src/sample/tcell/LOAD.lsp
+++ b/src/sample/tcell/LOAD.lsp
@@ -38,10 +38,10 @@
 ;; (push :use-body-buffer *features*)
 
 #+mswindows
-(setq *locale* (find-locale "japan.EUC"))
+(setq *locale* (find-locale "japan.UTF-8"))
 
 #+sbcl
-(setq sb-impl::*default-external-format* :euc-jp)
+(setq sb-impl::*default-external-format* :utf-8)
 
 
 ;; The most debuggable (and yet reasonably fast) code, use
diff --git a/src/sample/tcell/Makefile b/src/sample/tcell/Makefile
index c9823f76..42f2994b 100644
--- a/src/sample/tcell/Makefile
+++ b/src/sample/tcell/Makefile
@@ -1,19 +1,36 @@
 OS=${shell uname}
+# Command for sc2c compiler
 SC2C=sc2c
+# Options for SC-to-C compiler
 SC2C_OPT=
+# SC2C_OPT+=-m              # don't remove intermediate files
+# SC2C_OPT+=-D DEBUG=0      # invalidate debugging code
+SC2C_OPT+=-D USEMPI=1       # validate MPI
+SC2C_OPT+=-D NO-EXCEPTION # invalidate exception support
+SC2C_OPT+=-D PROFILE        # validate profiling
+# Command for XC Cube (an extended GCC that supports L-Closures and Closures)
 XCC=xcc
+# Command for gcc
 GCC=gcc #$(XCC)
+GCC=mpiicc
+# Command for Intel C Compiler
 ICC=icc
-OPT=-O3 -g -msse4.2$(MOPT)
+# Optimization options for C Compilers
+OPT=-O3 -g $(MOPT)
+OPT+=-D USEMPI
+
+# Keyword for L-Closures and Closures in XC Cube. Don't modify.
 XCCOPT=-DCT=lightweight
 XCCCLOPT=-DCT=closure
 
+# setaffinity options
 ifeq ($(OS),SunOS)
     SC2C_OPT += -D USE_AFFINITY=PBIND
-else
+else ifeq ($(OS),Linux)
     SC2C_OPT += -D USE_AFFINITY=SCHED
 endif
 
+# library options
 ifeq ($(OS),SunOS)
     THROPTS=-lthread
 else
@@ -24,12 +41,17 @@ ifeq ($(OS),SunOS)
     LIBOPTS += -lsocket -lnsl
 endif
 
+# Use vsnprintf() instead of vasprintf().
 ifeq ($(OS),SunOS)
     OPT += -DNO_VASPRINTF
 endif
 
-
-APPS=fib fib-guard fib-excep lu cmp pen pen6x17 pen6x17-guard nq grav matmul spanning bcast copine0 copine1 copine2 copine3 copine4
+# Set targets
+# The set of all targets (ALL_PROGS) is {(apps)-(imp) | (apps) is one of APPS and (imp) is one of c, gcc, lw, clos, xcc, xcccl,
+# icc-c, icc-lw, and icc-clos}
+# By default, this Makefile makes all ALL_PROGS. You can make just one of targets by specifying the target file name,
+# (e.g., "make fib-gcc")
+APPS=fib fib-guard fib-try fib-thr lu cmp pen pen-excep pen6x17 pen6x17-guard pen6x17-try pen6x17-thr nq nq-try nq-thr grav matmul spanning bcast copine0 copine1 copine2 copine3 copine4 copine0d copine1d copine3d
 
 C_PROGS=$(addsuffix -c,$(APPS))
 GCC_PROGS=$(addsuffix -gcc,$(APPS))
@@ -132,11 +154,9 @@ $(addsuffix .c,$(XCCCL_PROGS)): %-xcccl.c: %.tcell
 $(XCCCL_PROGS): %: $(WORKER_XCCCL) $(LIBS) %.c
 	$(XCC) $(OPT) $+ $(LIBOPTS) -o $@
 
-
-
-# demo
-# pen-demo: $(WORKER_GCC) pen-gcc-gtk.c $(LIBS)
-#	$(GCC) $(OPT)  $(THROPT) $(WORKER_GCC) pen-gcc-gtk.c $(LIBS) -o pen-demo `pkg-config --cflags --libs gtk+-2.0`
-
-# clean:
-# 	rm -f $(PROGS)
+# "make clean" to delete all target files
+clean:
+	rm -f $(ALL_PROGS)
+# "make clean" to delete all target files and intermediate files
+allclean:
+	rm -f $(ALL_PROGS) cinclude_tmp.h cinclude_tmp.se cinclude_tmp.se1 cinclude_tmp.se2 cinclude_tmp.se3 cinclude_tmp.se4 cinclude_tmp.se5 cinclude_tmp.se6 cinclude_tmp.se7
diff --git a/src/sample/tcell/Messages.txt b/src/sample/tcell/Messages.txt
index 7473054c..b0b21353 100644
--- a/src/sample/tcell/Messages.txt
+++ b/src/sample/tcell/Messages.txt
@@ -1,25 +1,25 @@
 treq <task-head> <treq-head>
-  <task-head>  タスク返答先
-  <treq-head>  要求送信先
+  <task-head>  ��帥�鴻��菴�膈����
+  <treq-head>  荀�羆����篆≦��
 
-;; <task-no> を追加
+;; <task-no> ���菴遵��
 task <ndiv> <rslt-head> <task-head> <task-no>
-  <wsize>      仕事のサイズの目安 (sp2が子の判断に使う)
-  <rslt-head>  結果返答先
-  <task-head>  タスク送信先
-  <task-no>    タスク番号（fibとかluとか）
+  <wsize>      篁�篋������泣�ゃ�冴�����絎� (sp2���絖������ゆ�����篏帥��)
+  <rslt-head>  腟����菴�膈����
+  <task-head>  ��帥�鴻�����篆≦��
+  <task-no>    ��帥�鴻������埦��fib������lu������鐚�
   
 rslt <rslt-head>
-  <rslt-head>  結果送信先
+  <rslt-head>  腟�������篆≦��
 
 rack <task-head>
-  <task-head>  rack送信先
+  <task-head>  rack���篆≦��
 
 none <task-head>
-  <task-head>  タスクを要求してた人
+  <task-head>  ��帥�鴻�����荀�羆����������篋�
 
 ==============================
-※ <*-head> の書式
+��� <*-head> �����後��
 message-address:
   [address:]opt thread-id [:task-id]opt
 
diff --git a/src/sample/tcell/README b/src/sample/tcell/README
index 4d8b8867..b656b073 100644
--- a/src/sample/tcell/README
+++ b/src/sample/tcell/README
@@ -1,42 +1,42 @@
-* worker.{c,sc}, worker.{h,sh}:  Tascellのワーカ用プログラム
-* Messages.txt: worker におけるメッセージフォーマットの簡易説明
-* xxx.tcell: T-CELLプログラム
-* 上記に対応する *-{c,gcc,lw,clos,xcc,xccl,icc-c,icc-lw,icc-clos}.c:
-   T-CELLプログラムをそれぞれの入れ子関数のバージョンのCに変換したもの
-* server.lsp: Lispで実装したTascell server
+* worker.{c,sc}, worker.{h,sh}:  Tascell��������若�������������違�����
+* Messages.txt: worker ��������������＜����祉�若�吾�������若�����������膂≧��茯����
+* xxx.tcell: T-CELL��������違�����
+* 筝�荐����絲上�������� *-{c,gcc,lw,clos,xcc,xccl,icc-c,icc-lw,icc-clos}.c:
+   T-CELL��������違�������������������������ャ��絖���∽�違�������若�吾�с�潟��C���紊����������������
+* server.lsp: Lisp��у��茖�������Tascell server
 * Makefile
 
-（実行例）
-(1)サーバ側（要Allegro Common Lisp)
+鐚�絎�茵�箴�鐚�
+(1)��泣�若����器��荀�Allegro Common Lisp)
 ===
 % alisp
 > :cl server.lsp
 > (make-and-start-server :local-host "gero00")
 ===
 
-(2)計算ノード側
+(2)荐�膊������若�����
 ===
 % ./fib-gcc 2 -s gero
 ===
-※ サーバのポート番号は，make-and-start-serverのキーワード引数で変更可
-※ 計算ノードのポート番号は -p オプションで変更可
-※ ポート番号のデフォルトは，双方とも9865
-※ 2はノード内worker数
+��� ��泣�若����������若������垩��鐚�make-and-start-server��������若����若��綣���違�у����翫��
+��� 荐�膊������若����������若������垩�� -p ��������激�с�潟�у����翫��
+��� �����若������垩��������������������鐚������鴻�����9865
+��� 2��������若�����worker���
 
-(3)サーバに計算要求を流しこむ
-alispが標準入力待ち状態になっているので，
+(3)��泣�若�����荐�膊�荀�羆����羌����������
+alisp���罔�羣���ュ��緇���∞�倶����������ｃ�������������э��
 ===
 task 0 0 0:0 0
 30
-<空行>
+<腥肴��>
 ===
-とすればよい（fibの場合）．
+�����������違�����鐚�fib�����翫��鐚�鐚�
 
-なお，1つの計算ノードをとりあえず動かしたい場合（サーバをユーザからの入力で代用）は，単に
+������鐚�1��ゃ��荐�膊������若�������������������������������������翫��鐚���泣�若����������若�吟����������ュ����т撮���鐚����鐚�������
 ===
 % ./fib-gcc -n 2
 task 0 0 0 0
 20
-<空行>
+<腥肴��>
 ===
-などとすればよい．
+�����������������違�����鐚�
diff --git a/src/sample/tcell/README4COPINE b/src/sample/tcell/README4COPINE
index 6674bb01..492e3c7a 100644
--- a/src/sample/tcell/README4COPINE
+++ b/src/sample/tcell/README4COPINE
@@ -11,17 +11,17 @@ extracts all connected subgraphs, each of which shares a common itemset whose
 size is not less than a given threshold, from a given graph in which each 
 vertex is associated to an itemset. For this problem, an efficient sequential 
 backtrack search algorithm called COmmon Pattern Itemset NEtwork mining 
-(COPINE) [Seki et al., BIBE���08] has been already proposed. COPINE reduces the 
-search space of a dynamically growing tree structure by pruning its branches 
-corresponding to the following subgraphs; already visited, having itemsets 
-smaller than a given threshold, and having already-visited supergraphs with 
-identical itemsets. For the third pruning, we use a table associating already-
-visited subgraphs and their itemsets. To avoid excess pruning in a parallel 
-search where a unique set of subtrees (tasks) is assigned to each worker, we 
-should put a certain restriction on a worker when it is referring to a table 
-entry registered by another worker. I designed a parallel algorithm as an 
-extension of COPINE by introducing this restriction, and implemented it using 
-the task-parallel language Tascell [Hiraishi et al., PPoPP'09].
+(COPINE) [J. Sese et al., CIKM'10] has been already proposed. COPINE reduces 
+the search space of a dynamically growing tree structure by pruning its 
+branches corresponding to the following subgraphs; already visited, having 
+itemsets smaller than a given threshold, and having already-visited supergraphs
+with identical itemsets. For the third pruning, we use a table associating 
+already-visited subgraphs and their itemsets. To avoid excess pruning in a 
+parallel search where a unique set of subtrees (tasks) is assigned to each 
+worker, we should put a certain restriction on a worker when it is referring 
+to a table entry registered by another worker. I designed a parallel algorithm
+as an extension of COPINE by introducing this restriction, and implemented it 
+using the task-parallel language Tascell [T. Hiraishi et al., PPoPP'09].
 
 2. Files
 -------------------------
@@ -60,13 +60,14 @@ Input files
 (2) Run the program.
      e.g.) $ ./copine3-gcc -n <# of threads>
 
-Note that input files are specified in the main function currently. For more information about runtime arguments, see each source code.
+Note that input files are specified in the main function currently. For more 
+information about runtime arguments, see each source code.
 
 4. Publication
 -------------------------
-[1] S. Okuno, T. Hiraishi, H. Nakashima, M. Yasugi and J. Sese: Parallelization 
+[1] S. Okuno, T. Hiraishi, H. Nakashima, M. Yasugi and J. Sese: Parallelization
 of Extracting Connected Subgraphs with Common Itemsets, IPSJ Transactions on 
-Programming, Vol. 7, No. 3, pp. 22-39, 2014. (IPSJ Online Transactions, Vol. 7, 
+Programming, Vol. 7, No. 3, pp. 22-39, 2014. (IPSJ Online Transactions, Vol. 7,
 pp. 93-110.).
 
 5. Contact information
diff --git a/src/sample/tcell/buffer.lsp b/src/sample/tcell/buffer.lsp
index f8d25475..4888fb2f 100644
--- a/src/sample/tcell/buffer.lsp
+++ b/src/sample/tcell/buffer.lsp
@@ -1,7 +1,7 @@
-;;; 未完成
+;;; ���絎����
 
-;;; サイズ可変バッファ
-;;; reader と writer がそれぞれ最大1スレッド同時に動いても大丈夫なことを保証
+;;; ��泣�ゃ�阪��紊�������������
+;;; reader ��� writer ������������������紊�1��鴻�����������������������������紊т��紊�������������篆�荐�
 
 (defconstant *buffer-init-size* 4096)
 (defconstant *init-buffer-unit-length* 1)
@@ -12,7 +12,7 @@
 ;;    (wp :accessor buf-wp :type fixnum :initform 0)
 ;;    (rp :accessor buf-rp :type fixnum :initform 0)
 ;;    (lock :accessor buf-lock :type mp:process-lock :initform (mp:make-process-lock))
-;;    空でなくなったことを通知
+;;    腥冴�с����������ｃ�����������������
 ;;    (gate :accessor buf-gate :type gate :initform (mp:make-gate nil)))
 ;;   )
 
@@ -27,22 +27,22 @@
 (defclass buffer-unit ()
   ((size :accessor buf-u-size :type fixnum :initform *buffer-unit-size*)
    (body :accessor buf-u-body :type (array unsigned-byte))
-   ;; 配列の先頭からの一部を一旦読んで，次に続きを読むということは可能
-   ;; ユニットのうち，一部読まれた先頭部分に書き込むことは不可能（バッファを拡張する）
+   ;; ������������������������筝�������筝����茯������э��罨＜��膓�������茯����������������������������
+   ;; ��������������������￥��筝����茯���障����������������������吾��莨若�����������筝������緒�������������＜����≦宍������鐚�
    (written-to :accessor buf-u-written :type fixnum :initform 0)
-                                        ; データが書き込まれた範囲が 0~(1- <written-to>)
+                                        ; �����若�帥����吾��莨若�障�����膀���蚊�� 0鐔�(1- <written-to>)
    (read-to :accessor buf-u-read :type fixnum :initform 0)
-                                        ; データを読んだ範囲が 0~(1- <read-to>)
+                                        ; �����若�帥��茯�������膀���蚊�� 0鐔�(1- <read-to>)
    (lock :accessor buf-u-lock :type mp:process-lock :initform (mp:make-process-lock)))
   )
 
 (defclass buffer ()
-  ((body :accessor buf-body :type list) ; bodyの循環リスト
-   (read-pointer :accessor buf-p-rd)     ; 次に読み込むところ
-   (write-pointer :accessor buf-p-wr)    ; 最後に書き込んだところ
-   ;; buffer-unitリストの構造を変化させるとき，リストを辿るときに獲得
+  ((body :accessor buf-body :type list) ; body���緇���違����鴻��
+   (read-pointer :accessor buf-p-rd)     ; 罨＜��茯���粋昭������������
+   (write-pointer :accessor buf-p-wr)    ; ���緇������吾��莨若��������������
+   ;; buffer-unit�����鴻�����罕�������紊�������������������鐚������鴻�����莨帥�������������峨��
    (lock :accessor buf-lock :type mp:process-lock :initform (mp:make-proces-lock))
-   ;; 空でなくなったことを通知
+   ;; 腥冴�с����������ｃ�����������������
    (gate :accessor buf-gate :type gate :initform (mp:make-gate nil)))
   )
 
@@ -70,17 +70,17 @@
 
 ;;;
 
-;;; size は 読み書きする最大のサイズ
-;;; 実際読み書きしたサイズ & unitの最後まで読み書きしたか(t/nil)  を返り値とする
+;;; size ��� 茯���炊�吾�����������紊с����泣�ゃ��
+;;; 絎����茯���炊�吾����������泣�ゃ�� & unit������緇���障�ц����炊�吾�����������(t/nil)  ���菴������ゃ��������
 
-;; streamから読んでbuffer-unit に書き込む
+;; stream������茯�������buffer-unit �����吾��莨若��
 (defmethod read-into-buffer-unit ((bu buffer-unit) (s input-stream) size)
   (mp:with-process-lock ((buf-u-lock bu))
     (setf (buf-u-read bu) 0)
     (read-sequence (buf-u-body bu) :end size)
     (setf (buf-u-written bu) size)))
 
-;;; buffer-unitから読んで streamに流す
+;;; buffer-unit������茯������� stream���羌����
 (defmethod write-from-buffer-unit ((bu buffer-unit) (s output-stream) size)
   )
 
diff --git a/src/sample/tcell/cmd-serial.sc b/src/sample/tcell/cmd-serial.sc
index 77c1e2a1..29377257 100644
--- a/src/sample/tcell/cmd-serial.sc
+++ b/src/sample/tcell/cmd-serial.sc
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2016 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -22,7 +22,7 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;;;; コマンドのシリアライズ・デシリアライズ関数
+;;;; ��潟����潟�������激����≪����ゃ�冴�祉����激����≪����ゃ�咲�∽��
 (c-exp "#include <pthread.h>")
 (%include "rule/nestfunc-setrule.sh")
 
@@ -32,7 +32,7 @@
 (%include "worker.sh")
 
 
-;; 文字列の最初の空白以外の位置を返す
+;; ���絖����������������腥榊�巡札紊����篏�臀����菴����
 (def (csym::skip-whitespace str) (fn (ptr char) (ptr char))
   (def ch char)
   (= ch (mref str))
@@ -40,7 +40,7 @@
         (= ch (mref (++ str)))))
   (return str))
 
-;; 文字列の最初の空白の位置を返す
+;; ���絖����������������腥榊�純��篏�臀����菴����
 (def (csym::skip-notwhitespace str) (fn (ptr char) (ptr char))
   (def ch char)
   (= ch (mref str))
@@ -49,7 +49,7 @@
   (return str))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; (struct cmd)構造体表示
+;; (struct cmd)罕����篏�茵�腓�
 (def (csym::print-cmd pcmd) (fn void (ptr (struct cmd)))
   (defs int i j)
   (csym::fprintf stderr "cmd.w: %d~%" pcmd->w)
@@ -64,13 +64,8 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;;;;;;;;;;
-;; (enum command)の値が配列添字に対応
-;; ここを変えると deserilalize-cmdname の「ゆるい文字列比較」も変える必要があるので注意
-(def cmd-strings (array (ptr char))
-  (array "task" "rslt" "treq" "none" "rack" "dreq" "data"
-         "bcst" "bcak" "stat" "verb" "exit" "leav" "lack" "abrt" "cncl" "wrng" 0))
 
-;; コマンド->文字列 (returns 書いた文字数)
+;; ��潟����潟��->���絖���� (returns ��吾��������絖����)
 (def (csym::serialize-cmdname buf w) (fn int (ptr char) (enum command))
   (def p (ptr char) buf)
   (if (and (>= w 0) (< w WRNG))
@@ -82,13 +77,13 @@
      (= (mref p) #\NULL)
      (return 0))))
 
-;; 文字列->コマンド (returns 読んだ文字数)
+;; ���絖����->��潟����潟�� (returns 茯����������絖����)
 (def (csym::deserialize-cmdname buf str) (fn int (ptr (enum command)) (ptr char))
   (def i int)
   (def p (ptr char))
   (def cmdstr (ptr char))
   (= p str)
-  ;; ゆるい文字列比較ver.
+  ;; ������������絖����罸�莠�ver.
   (begin
    (switch (mref (inc p))
      (case #\t)
@@ -97,13 +92,6 @@
        (case #\r) (= (mref buf) TREQ) (break)
        (default) (= (mref buf) WRNG) (return 0))
      (break)
-
-     (case #\d)
-     (switch (mref (inc p))
-       (case #\r) (= (mref buf) DREQ) (break)
-       (case #\a) (= (mref buf) DATA) (break)
-       (default) (= (mref buf) WRNG) (return 0))
-     (break)
      
      (case #\r)
      (switch (mref (inc p))
@@ -127,26 +115,18 @@
      (case #\s) (= (mref buf) STAT) (break)
      (case #\v) (= (mref buf) VERB) (break)
      (case #\e) (= (mref buf) EXIT) (break)
-     (case #\a) (= (mref buf) ABRT) (break)
      (case #\c) (= (mref buf) CNCL) (break)
-  
-     (case #\l)
-     (switch (mref (inc p))
-       (case #\e) (= (mref buf) LEAV) (break)
-       (case #\a) (= (mref buf) LACK) (break)
-       (default) (= (mref buf) WRNG) (return 0))
-     (break)
-          
+     
      (default) (= (mref buf) WRNG) (return 0))
    (= p (csym::skip-notwhitespace p))
    (= p (csym::skip-whitespace p))
    (return (- p str)))
-  #+comment                             ; 厳密に文字列比較ver.
+  #+comment                             ; �ｳ絲�������絖����罸�莠�ver.
   (begin
    (for ((= i 0) (= cmdstr (aref cmd-strings i)) (inc i))
      (if (== 0 (csym::strncmp p cmdstr 4))
          (begin
-          (= (mref buf) i)              ; コマンドをセット
+          (= (mref buf) i)              ; ��潟����潟�������祉�����
           (+= p 4)
           (= p (csym::skip-whitespace p))
           (return (- p str))
@@ -156,7 +136,7 @@
   )
 
 ;;;;;;;;;;
-;; [整数|ノード]列->文字列 (returns 書いた文字数)
+;; [��贋��|�����若��]���->���絖���� (returns ��吾��������絖����)
 (def (csym::serialize-arg buf arg) (fn int (ptr char) (ptr (enum addr)))
   (def p (ptr char) buf)
   (def addr (enum addr))
@@ -177,7 +157,7 @@
   (= (mref (-- p)) #\NULL)
   (return (- p buf)))
 
-;; 文字列->ノード
+;; ���絖����->�����若��
 (def (csym::deserialize-addr str) (fn (enum addr) (ptr char))
   (cond
    ((== #\p (aref str 0))
@@ -189,7 +169,7 @@
    (else
     (return (csym::atoi str)))))
 
-;; 文字列->[整数|ノード]列 (returns 読んだ文字数)
+;; ���絖����->[��贋��|�����若��]��� (returns 茯����������絖����)
 (def (csym::deserialize-arg buf str) (fn int (ptr (enum addr)) (ptr char))
   (defs (ptr char) p0 p1)
   (def ch int)
@@ -201,30 +181,30 @@
     (cond 
      ((or (== ch #\:) (== ch #\Space) (== ch #\Newline) (== ch #\NULL))
       (= (mref p1) #\NULL)
-      (= (mref (inc paddr)) (csym::deserialize-addr p0)) ; p0--p1までdeserialize
+      (= (mref (inc paddr)) (csym::deserialize-addr p0)) ; p0--p1��障��deserialize
       (= (mref p1) ch)
       (if (!= ch #\:)                   ; NULL, Space, Newline
           (break))
       (= p0 (+ 1 p1)))))
-  (= (mref paddr) TERM)  ; 番兵
+  (= (mref paddr) TERM)  ; ������
   (= p1 (csym::skip-whitespace p1))
   (return (- p1 str)))
 
 ;;;;;;;;;;
-;; コマンド->文字列 (return 書いた文字数)
+;; ��潟����潟��->���絖���� (return ��吾��������絖����)
 (def (csym::serialize-cmd buf pcmd) (fn int (ptr char) (ptr (struct cmd)))
   (def p (ptr char))
   (def ret int)
   (def i int)
   (= p buf)
-  ;; コマンド名
+  ;; ��潟����潟�����
   (if (not (= ret (csym::serialize-cmdname p pcmd->w)))
       (begin
        (csym::fprintf stderr "Serialize-cmd failed.~%")
        (csym::print-cmd pcmd)
        (csym::exit 1)))
   (+= p ret) (= (mref (inc p)) #\Space)
-  ;; 引数
+  ;; 綣����
   (for ((= i 0) (< i pcmd->c) (inc i))
     (+= p (csym::serialize-arg p (aref pcmd->v i)))
     (= (mref (inc p)) #\Space))
@@ -232,23 +212,23 @@
   (= (mref (-- p)) #\NULL)
   (return (- p buf)))
 
-;; 文字列->コマンド (return 読んだ文字数)
+;; ���絖����->��潟����潟�� (return 茯����������絖����)
 (def (csym::deserialize-cmd pcmd str) (fn int (ptr (struct cmd)) (ptr char))
   (def p (ptr char))
   (def i int)
   (= p str)
-  ;; コマンド名
+  ;; ��潟����潟�����
   (+= p (csym::deserialize-cmdname (ptr pcmd->w) p))
   (if (== pcmd->w WRNG) (return (- p str)))
-  ;; 引数
+  ;; 綣����
   (for ((= i 0) (and (mref p) (< i MAXCMDC)) (inc i))
        (+= p (csym::deserialize-arg (aref pcmd->v i) p)))
-  ;; 引数の数
+  ;; 綣���違�����
   (= pcmd->c i)
   (return (- p str)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; ノード列コピー (returns TERMを除くノード数)
+;; �����若�������潟����� (returns TERM�����ゃ�������若�����)
 (def (csym::copy-address dst src) (fn int (ptr (enum addr)) (ptr (enum addr)))
   (def i int)
   (for ((= i 0) (!= TERM (aref src i)) (inc i))
@@ -256,7 +236,7 @@
   (= (aref dst i) TERM)
   (return i))
 
-;; ノード列比較 (同一なら非0)
+;; �����若�����罸�莠� (���筝����������0)
 (def (csym::address-equal adr1 adr2) (fn int (ptr (enum addr)) (ptr (enum addr)))
   (def i int)
   (for ((= i 0) (< i MAXCMDC) (inc i))
diff --git a/src/sample/tcell/cmp.tcell b/src/sample/tcell/cmp.tcell
index edb5415a..2a0e8d21 100644
--- a/src/sample/tcell/cmp.tcell
+++ b/src/sample/tcell/cmp.tcell
@@ -78,6 +78,7 @@
 
 (def (task-sender cmp)
   ;;   (def i int)
+  (DEBUG-PRINT 1 "tasksender~%")
   (if (> 0 this.n2) (return)) 
   (csym::send-int32s this.d1 this.n1)
   ;;   (for ((= i 0) (< i this.n1) (inc i))
@@ -89,6 +90,7 @@
 
 (def (task-receiver cmp)
   (def i int)
+  (DEBUG-PRINT 1 "taskreceiver~%")
   (if (not (> 0 this.n2))
       (begin
        (= this.d1
@@ -117,8 +119,9 @@
 (def (task-body cmp)
   (decl tp (array (struct timeval) 2))
   (def i int) (def j int)
+  (DEBUG-PRINT 1 "taskbody~%")
   (DEBUG-PRINT 1 "start %d %d~%" this.n1 this.n2)
-  (if (> 0 this.n2)              ; n2<0 のときは，新しい問題を作って解く
+  (if (> 0 this.n2)              ; n2<0 ������������鐚���違�������馹����篏���ｃ��茹ｃ��
       (begin
        (= this.d1
           (cast (ptr INT32)
diff --git a/src/sample/tcell/cmpdebug.sh b/src/sample/tcell/cmpdebug.sh
new file mode 100644
index 00000000..3d1ec8a0
--- /dev/null
+++ b/src/sample/tcell/cmpdebug.sh
@@ -0,0 +1,15 @@
+
+#============ Options ============
+#QSUB -q gr10034b
+#QSUB -ug gr10034
+#QSUB -W 2:00
+#QSUB -A p=1:t=1:c=1:m=120G
+#QSUB -N cmpdebug711
+#============ Shell Script ============
+set -x
+cd $QSUB_WORKDIR
+
+# automatically
+# export OMP_NUM_THREADS=$QSUB_THREADS
+
+mpiexec.hydra ./cmp-gcc -n 1 -v 1 -i "0 10000 -1"
\ No newline at end of file
diff --git a/src/sample/tcell/copine.tcell b/src/sample/tcell/copine.tcell
index 39385166..079911db 100644
--- a/src/sample/tcell/copine.tcell
+++ b/src/sample/tcell/copine.tcell
@@ -245,7 +245,7 @@
 ;; Start traversals from the node s1~s2
 (def (visit-start s1 s2 th) (wfn void int int int)
   (def dfs (ptr int) 0)
-  ;; s: traversalの開始ノード
+  ;; s: traversal������紮������若��
   (do-many for s from s1 to s2
     (def pnd (ptr node) (ptr (aref Nodes s)))
     (if (< pnd->nitem th) (break))
@@ -271,55 +271,55 @@
   )
 
        
-;; データ構造
-;; ・ノード
-;; - 入力ファイルのノードID ＝ Node配列のindex
-;; - オリジナルではノードをitem数順でソートしている
-;;   Cにおいてこれをやるとすると，次のいずれか．
-;;   * 配列の順序はいじらず，Nodeの要素に「整列したときの次」のIDを持たせる
-;;   * 配列自体を並べ替えて，Nodeの要素にIDを持たせる
-;;     → Edgeの指す先をindex番号としているので一貫性を保つ必要
-;; ・枝
-;; - ノードは枝のリスト（の始点）を要素に持つ．
-;;   ここでいうリストは配列で実現されたリスト
-;; - 例えばNode1からNode3,6,10に枝をはる場合：
+;; �����若�炊�����
+;; ��祉����若��
+;; - ��ュ�������＜�ゃ����������若��ID 鐚� Node���������index
+;; - ��������吾�������с�������若�����item��育����с�純�若��������������
+;;   C���������������������������������������鐚�罨＜��������������鐚�
+;;   * ������������綺����������������鐚�Node���荀�膣���������翫�����������������罨＜�����ID���������������
+;;   * ���������篏����筝���号�帥�����鐚�Node���荀�膣����ID���������������
+;;     ��� Edge���������������index����垩�������������������т��莢���с��篆���ゅ��荀�
+;; ��紙��
+;; - �����若����������������鴻��鐚����紮���刻�����荀�膣���������わ��
+;;   ��������с����������鴻�������������у���憗�������������鴻��
+;; - 箴�������Node1������Node3,6,10�����������������翫��鐚�
 ;;   Node[1].first_edge=a,
 ;;   Edge[a]={.to=3, .next=b},
 ;;   Edge[b]={.to=6, .next=c},
-;;   Edge[c]={.to=6, .next=-1},（a,b,cは互いに異なる任意のindex）
-;; - 枝は「ある順序付け」において小さいほうから大きいほうにしかはらない
-;;  （問題の入力は無向グラフだが，traverseは片方向にしか行わないため）
-;; - 現実装の「ある順序付け」は単にIndex番号だが，「item数の少ない順」
-;;   のほうがよいと思われる．
-;; ・ノードが持つアイテム集合
-;; - Node<x> が アイテム<i> を持つことは
-;;   Node[x].items[i/32] の下位(i%32)ビット目が1であることで表わす
-;; - アイテムの種類が多いのであればリストなど別の表現にする必要
+;;   Edge[c]={.to=6, .next=-1},鐚�a,b,c���篋���������違�����篁紙�����index鐚�
+;; - ������������������綺鋌�������������������絨���������祉��������紊с�������祉�����������������������
+;;  鐚���馹������ュ�������≦����違�����������鐚�traverse��������劫�����������茵����������������鐚�
+;; - �憜��茖����������������綺鋌����������������Index����垩�����鐚����item��違��絨�������������
+;;   �����祉��������������������������鐚�
+;; ��祉����若����������ゃ�≪�ゃ�����������
+;; - Node<x> ��� ��≪�ゃ�����<i> ��������ゃ��������
+;;   Node[x].items[i/32] ���筝�篏�(i%32)���������������1��с�������������ц；������
+;; - ��≪�ゃ��������腮�蕁����紊���������с�������違����鴻����������ャ��茵��憗��������綽�荀�
 ;;
-;; アルゴリズム
-;; ・main部 (visit-start)
-;; θ：共通アイテム数の下限，
-;; 1. そもそもitem数がθ未満のノードを削除（Todo）
-;;    - そこへの枝と，2.の始点候補から外せばOK？
-;; 2. 始点候補←全てのノード(-item数がθ未満のノード)
-;; 3. 始点候補が空になるまで以下を繰り返す
-;; 3.1. v ← 始点候補からノードを一個選ぶ
-;; 3.2. V' ← Vの複製
-;; 3.3. VISIT(V', v, root)を適用
-;; 3.4. Vからvを取り除く（V'⊂V であることは本質的に必要か？）
-;; 4. L（解候補の集合）をノード数順でソート
-;; 5. L内のの要素間のペアについてoverlap値がユーザ指定閾値r
-;;    より高いものがあれば，1つだけ残す
-;; ・VISIT(V', v, n)
-;; n: これまで辿ってきたノードの集合（=DFSの1ノード）
-;; V.1. V'の中にvから指されるノードがなければnをL（解候補）に加える
-;; V.2. C ← V'内のvの全ての隣接ノード
-;; V.3. Cの各要素cについて以下を実行
-;; V.3.1. NEXT if c が v より順序が前
-;; V.3.2. I ← I(c)∩I(n)
-;; V.3.3. NEXT if #(I) < θ
-;; V.3.4. NEXT if これまでcを含むDFSノードを発見したときのIのうち，今のIを含むものがある
-;; V.3.5 nにcを追加，V'からcを取り除く
+;; ��≪����眼����冴��
+;; ���main��� (visit-start)
+;; 慮鐚���演����≪�ゃ�������違��筝����鐚�
+;; 1. ������������item��違��慮���羣���������若����������わ��Todo鐚�
+;;    - ��������吾��������鐚�2.���紮���劫��茖�������紊�������OK鐚�
+;; 2. 紮���劫��茖������������������若��(-item��違��慮���羣���������若��)
+;; 3. 紮���劫��茖����腥冴����������障�т札筝����膵違��菴����
+;; 3.1. v ��� 紮���劫��茖������������若�����筝������吾��
+;; 3.2. V' ��� V���茲�茖�
+;; 3.3. VISIT(V', v, root)���������
+;; 3.4. V������v�����������ゃ��鐚�V'���V ��с�����������������莖�������綽�荀����鐚�鐚�
+;; 4. L鐚�茹ｅ��茖����������鐚���������若����育����с�純�若��
+;; 5. L���������荀�膣������������≪����ゃ�����overlap��ゃ�������若�倶��絎���上��r
+;;    ������蕭���������������������逸��1��ゃ�����罧����
+;; ���VISIT(V', v, n)
+;; n: ��������障�ц梢��ｃ�������������若�����������鐚�=DFS���1�����若��鐚�
+;; V.1. V'���筝����v�����������������������若�����������������n���L鐚�茹ｅ��茖�鐚�������������
+;; V.2. C ��� V'������v��������������ｆ･�����若��
+;; V.3. C������荀�膣�c�����ゃ�����篁ヤ�����絎�茵�
+;; V.3.1. NEXT if c ��� v ���������綺�������
+;; V.3.2. I ��� I(c)���I(n)
+;; V.3.3. NEXT if #(I) < 慮
+;; V.3.4. NEXT if ��������障��c���������DFS�����若�������肴�����������������I��������￥��篁����I������������������������
+;; V.3.5 n���c���菴遵��鐚�V'������c�����������ゃ��
 ;; V.3.6 VISIT(V', v, n)
-;; V.4 「itemsetがnと同じであるようなnの子がいなければ
-;;     （極大な集合のみを出力するため）」nをL（解候補）に追加
\ No newline at end of file
+;; V.4 ���itemset���n�����������с��������������n���絖�������������������
+;;     鐚�罐球ぇ��������������帥����阪��������������鐚����n���L鐚�茹ｅ��茖�鐚����菴遵��
\ No newline at end of file
diff --git a/src/sample/tcell/copine0.tcell b/src/sample/tcell/copine0.tcell
index 2f0925dc..ab5dd22a 100644
--- a/src/sample/tcell/copine0.tcell
+++ b/src/sample/tcell/copine0.tcell
@@ -31,6 +31,7 @@
 ;; task 0 0 0 2
 ;; <th>         ; threshold
 ;; <it>         ; # of iterations left for a victim worker
+;; <dv>         ; # of divisions of the higher layer of the search tree
 
 
 (c-exp "#include <stdio.h>")
@@ -42,7 +43,10 @@
 (c-exp "#include <stdint.h>")
 (c-exp "#include <sys/time.h>")
 (c-exp "#include <sys/resource.h>")
-;(c-exp "#include <nmmintrin.h>")
+(c-exp "#include <nmmintrin.h>")
+
+(c-exp "#define  __USE_GNU")
+(c-exp "#include <search.h>")
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
@@ -60,15 +64,16 @@
 (%defconstant USE-SSE 0)
 
 ;;; Max # of workers
-(%defconstant NUM-WORKERS 16)
+(%defconstant NUM-WORKERS 32)
 
 ;;; Constants
-(%defconstant E-SIZE 500000)  ; # of edges
-(%defconstant V-SIZE 20000)   ; # of vertices
-(%defconstant BIT-LEN 32)     ; bit length of bitset
-(%defconstant BIT-ITEM 5)     ; # of items = BIT-ITEM * BIT-LEN
-(%defconstant BIT-EDGE 8125)  ; # of edges = BIT-EDGE * BIT-LEN
-(%defconstant BIT-VERTEX 625) ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant E-SIZE 500000)               ; # of edges
+(%defconstant V-SIZE 15500)                ; # of vertices
+(%defconstant BIT-LEN 64)                  ; bit length of bitset
+(%defconstant BIT-ITEM 3)                  ; # of items = BIT-ITEM * BIT-LEN
+(%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
+(%defconstant BIT-VERTEX 625)              ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant I-SIZE (* BIT-LEN BIT-ITEM)) ; 
 
 ;;; Debug Flags
 (%defconstant DEBUG-DATA 0) ; flag to show some data
@@ -79,7 +84,7 @@
 (%defconstant DEBUG-COPY 0) ; flag to output copy file
 
 ;;; Typedef
-(deftype set uint32-t) ; bitset
+(deftype set uint64_t) ; bitset
 (deftype vtx uint32_t) ; vertex
 
 ;;; Structure of ITnode
@@ -129,7 +134,11 @@
 
 ;;; Worker Data
 (decl searchSpace (array uint64_t NUM-WORKERS))
+(decl visit2Vertices (array uint64_t NUM-WORKERS))
+(decl thresholdPruning (array uint64_t NUM-WORKERS))
+(decl inclusivePruning (array uint64_t NUM-WORKERS))
 (decl taskRequest (array int NUM-WORKERS))
+(decl tableReference (array uint64_t NUM-WORKERS))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
@@ -145,18 +154,28 @@
 (def (csym::elapsedTime t1 t2) (fn double (ptr (struct timeval)) (ptr (struct timeval)))
   (return (+ (- (fref t2 -> tv-sec) (fref t1 -> tv-sec)) (* 0.000001 (- (fref t2 -> tv-usec) (fref t1 -> tv-usec))))))
 
-;;; Function: countBits - count the number of "i-th bit == 1"
-(def (csym::countBits x) (fn int set)
+;;; Function: countBits32 - count the number of "i-th bit == 1"
+(def (csym::countBits32 x) (fn int uint32_t)
   (= x (+ (bit-and x #x55555555) (bit-and (>> x 1) #x55555555))) 
   (= x (+ (bit-and x #x33333333) (bit-and (>> x 2) #x33333333))) 
   (= x (+ (bit-and x #x0f0f0f0f) (bit-and (>> x 4) #x0f0f0f0f))) 
   (= x (+ (bit-and x #x00ff00ff) (bit-and (>> x 8) #x00ff00ff))) 
   (return (+ (bit-and x #x0000ffff) (bit-and (>> x 16) #x0000ffff))))
 
+;;; Function: countBits64 - count the number of "i-th bit == 1"
+(def (csym::countBits64 x) (fn int uint64_t)
+  (= x (+ (bit-and x (c-exp "0x5555555555555555UL")) (>> (bit-and x (c-exp "0xaaaaaaaaaaaaaaaaUL")) 1)))
+  (= x (+ (bit-and x (c-exp "0x3333333333333333UL")) (>> (bit-and x (c-exp "0xccccccccccccccccUL")) 2)))
+  (= x (+ (bit-and x (c-exp "0x0f0f0f0f0f0f0f0fUL")) (>> (bit-and x (c-exp "0xf0f0f0f0f0f0f0f0UL")) 4)))
+  (= x (+ (bit-and x (c-exp "0x00ff00ff00ff00ffUL")) (>> (bit-and x (c-exp "0xff00ff00ff00ff00UL")) 8)))
+  (= x (+ (bit-and x (c-exp "0x0000ffff0000ffffUL")) (>> (bit-and x (c-exp "0xffff0000ffff0000UL")) 16)))
+  (= x (+ (bit-and x (c-exp "0x00000000ffffffffUL")) (>> (bit-and x (c-exp "0xffffffff00000000UL")) 32)))
+  (return x))
+
 ;;; Function: printBits - print a variable with set data type by binary representation
 (def (csym::printBits x) (fn void (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf stderr "1")
@@ -166,7 +185,7 @@
 ;;; Function: fprintBits - write a variable with set data type by binary representation to stream
 (def (csym::fprintBits fp x) (fn void (ptr FILE) (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf fp "1")
@@ -307,18 +326,15 @@
   (def numSubgraph uint64_t)
   (def numSearch uint64_t)
   (def numThreshold uint64_t)
-  (def numPruning int))
+  (def numPruning int)
+  (def numTableReference uint64_t))
 
 ;;;Function: initExploreCCIG - 
-(def (initExploreCCIG vTraversed vItemTable C T pTsk) (fn void int (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+(def (initExploreCCIG vTraversed vItemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
   (decl i int)
 
   ;; initialize vTraversed
-  (if (== vTraversed 0)
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int)))))
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::malloc (* V-SIZE (sizeof int)))))))
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
 
   ;; initialize vItemTable
   ;(= (fref pTsk -> vItemTable) (cast (ptr ITlist) (csym::malloc (* V-SIZE (sizeof ITlist)))))
@@ -327,12 +343,12 @@
 
   ;; initialize C
   (= (fref pTsk -> numC) 0)
-  (= (fref pTsk -> sizeOfC) 50000)
+  (= (fref pTsk -> sizeOfC) 10000)
   (= (fref pTsk -> C) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfC) (sizeof vtx)))))
 
   ;; initialize T
   (= (fref pTsk -> numT) 0)
-  (= (fref pTsk -> sizeOfT) 100)
+  (= (fref pTsk -> sizeOfT) 1000)
   (= (fref pTsk -> T) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))
 
   ;; init subgraph
@@ -344,7 +360,8 @@
   (= (fref pTsk -> numSubgraph) 0)
   (= (fref pTsk -> numSearch) 0)
   (= (fref pTsk -> numThreshold) 0) 
-  (= (fref pTsk -> numPruning) 0))
+  (= (fref pTsk -> numPruning) 0)
+  (= (fref pTsk -> numTableReference) 0))
 
 ;;; Function: exploreCCIG - create a common-itemset tree with recursive call
 (def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
@@ -366,13 +383,13 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        (inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
-          (+= commonNum (csym::countBits (aref commonItem k)))
-          ;(+= commonNum (csym::--builtin-popcount (aref commonItem k)))
+          ;(+= commonNum (csym::countBits32 (aref commonItem k)))
+          ;(+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
+          (+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
         (if (== m BIT-ITEM)
@@ -384,6 +401,8 @@
             (inc (fref pTsk -> numTraversed))
             (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
 
+            (inc (fref pTsk -> numSearch))
+
             ;; add new candidates 
             (if (>= (+ (fref pTsk -> numC) (aref vDegree vv)) (fref pTsk -> sizeOfC))
               (begin
@@ -453,7 +472,7 @@
         (= (fref this maxC) i2)
         (= (fref this v) v)
         (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
-        (initExploreCCIG 1 NULL NULL NULL (ptr this))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
         (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
         (for ((= j 0) (< j i1) (inc j))
           (inc (aref (fref this vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))
@@ -466,14 +485,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
-        (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref this treeDepth))
         (+= (fref pTsk -> numTraversed) (fref this numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref this numThreshold))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 3) 0)
           (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
@@ -492,9 +511,11 @@
   (csym::gettimeofday tp 0)
   (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref this numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref this numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-exploreCCIG(%d): %f[sec](%f[sec]), %llu, ID:%d~%" (aref (fref this T) 0) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch))))
   (csym::free (fref this vTraversed))
   (csym::free (fref this C))
@@ -527,6 +548,8 @@
         (%if* DEBUG-SHOW (begin
           (csym::fprintf stderr "+++ Allons-y! +++~%")))
 
+        (inc (fref pTsk -> numSearch))
+
         (for ((= j (aref vFirstEdge i)) (!= j -1) (= j (aref eNext j)))
           (if (< i (aref eTo j))
             (begin
@@ -563,20 +586,20 @@
           (csym::gettimeofday tpc 0)))
         (= (fref this minVertex) i1)
         (= (fref this maxVertex) i2)
-        (initExploreCCIG 1 NULL NULL NULL (ptr (fref this tsk)))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 1) 0))))
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
         (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref (fref this tsk) numThreshold))
         (csym::free (fref (fref this tsk) vTraversed))
         (csym::free (fref (fref this tsk) C))
         (csym::free (fref (fref this tsk) T))
@@ -591,9 +614,11 @@
   (csym::gettimeofday tp 0)
   (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk)))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" (fref this minVertex) (fref this maxVertex) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch)))))
 
 ;;; Function: thresholdItem - delete the vertex whose # of items is less than the user-specified threshold
@@ -631,12 +656,16 @@
             (= l k)))))))
 
 ;;; Function: loadPatternFile - load pattern file
-(def (loadPatternFile patternFile maxNumItems) (fn void (ptr (const char)) (ptr int))
-  (decl n int)                 ; item number
-  (decl v int)                 ; vertex number
-  (decl item (ptr char))       ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ; 
+  (decl n int)                    ; item number
+  (decl v int)                    ; vertex number
+  (decl item (ptr char))          ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open pattern file
   (if (== (= fp (csym::fopen patternFile "r")) NULL)
@@ -650,10 +679,30 @@
     (if (!= (csym::strncmp buff "#" 1) 0)
       (begin
         (= v (csym::atoi (csym::strtok buff "~|11|")))
+
+        ;; find v from eHash
+        (csym::sprintf temp "%d" v)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (continue))
+        (= v (cast int (fref hep -> data)))
+
         ;; add item to Vertex Data
         (while (!= (= item (csym::strtok NULL ",")) NULL)
           (= n (csym::atoi item))
-          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< 1 (cast int (% n BIT-LEN))))
+
+          ;; enter n to iHash
+          (csym::sprintf temp "%d" n)
+          (= (fref he key) temp)
+          (csym::hsearch_r he FIND (ptr hep) iHash)
+          (if (== hep NULL)
+            (begin
+              (= (fref he data) (cast (ptr void) (inc i)))
+              (csym::hsearch_r he ENTER (ptr hep) iHash)))
+          (= n (cast int (fref hep -> data)))
+
+          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< (cast set 1) (cast int (% n BIT-LEN))))
           (inc (aref vNumItems v)) ; increase # of items
           ;; evaluate maximum # of items
           (if (> n (mref maxNumItems))
@@ -708,12 +757,16 @@
   (inc (aref vDegree v1)))
 
 ;;; Function: loadGraphFile - load graph file
-(def (loadGraphFile graphFile edgeMax minVertex maxVertex) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int))
-  (defs int v1 v2)             ; starting point, ending point
-  (decl eLabel (ptr char))     ; label of edge
-  (decl empty (ptr char))      ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ; 
+  (defs int v1 v2)                ; starting point, ending point
+  (decl eLabel (ptr char))        ; label of edge
+  (decl empty (ptr char))         ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open graph file
   (if (== (= fp (csym::fopen graphFile "r")) NULL)
@@ -730,6 +783,27 @@
         (= eLabel (csym::strtok NULL "~|11|"))
         (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
         (= empty (csym::strtok NULL "~|11|"))
+
+        ;; enter v1 to eHash
+        (csym::sprintf temp "%d" v1)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v1 (cast int (fref hep -> data)))
+
+        ;; enter v2 to eHash
+        (csym::sprintf temp "%d" v2)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v2 (cast int (fref hep -> data)))
+
         ;; add edge to Edge List
         (if (== empty NULL)
           (if (!= v1 v2)
@@ -741,7 +815,7 @@
   (csym::fclose fp))
 
 ;;; Function: initData - initialize Edge Data & Vertex Data & Debug Data
-(def (initData edgeMax minVertex maxVertex maxNumItems) (fn void (ptr int) (ptr int) (ptr int) (ptr int))
+(def (initData edgeMax minVertex maxVertex maxNumItems eHash iHash) (fn void (ptr int) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
   (defs int i j) ; temporary variable
 
   ;; initialize Edge Data
@@ -764,20 +838,33 @@
   ;; initialize Debug Data
   (for ((= i 0) (< i NUM-WORKERS) (inc i))
     (= (aref searchSpace i) 0)
-    (= (aref taskRequest i) 0))
+    (= (aref visit2Vertices i) 0)
+    (= (aref thresholdPruning i) 0)
+    (= (aref inclusivePruning i) 0)
+    (= (aref taskRequest i) 0)
+    (= (aref tableReference i) 0))
+
   (for ((= i 0) (< i V-SIZE) (inc i))
-    (= (aref doneID i) 0)))
+    (= (aref doneID i) 0))
+
+  ;; initialize Hash Data
+  (csym::memset eHash 0 (sizeof (mref eHash)))
+  (csym::memset iHash 0 (sizeof (mref iHash)))
+  (csym::hcreate_r E-SIZE eHash)
+  (csym::hcreate_r I-SIZE iHash))
 
 ;;; 
 (def (task T-startCCIG)
   (def th int :in)
-  (def spawnSize int :in))
+  (def spawnSize int :in)
+  (def loopRatio int :in))
 
 ;;; Main 
 (def (task-body T-startCCIG)
   (defs int i j)                       ; temporary variable
   (decl tp (array (struct timeval) 2)) ; start time, end time
   (defs double t1 t2)                  ; start user time, end user time
+  (decl loopRange int)                 ; loop range of enumCCIG
   (decl patternFile (ptr char))        ; name of pattern file
   (decl graphFile (ptr char))          ; name of graph file
   (decl resultFile (ptr char))         ; name of result file
@@ -800,17 +887,25 @@
   ;; Subgraph Data
   (decl Gptr (ptr Gnode))
 
+  ;; Hash Data
+  (defs (struct hsearch_data) eHash iHash)
+
   ;; Debug Data
-  (def numSearch uint64_t 0)             ; # of search space
-  (def avgWorkerSearch double 0.0)       ; 
-  (def workerSearchSD double 0.0)        ;
-  (def avgWorkerSearchPerSec double 0.0) ; 
-  (def workerSearchPerSecSD double 0.0)  ;
-  (def numTaskRequest int 0)             ; # of task request 
-  (def avgTaskRequest double 0.0)        ;
-  (def taskRequestSD double 0.0)         ;
-  (def avgSizeSubgraph uint64_t 0)       ;
-  (def maxSizeSubgraph int 0)            ;
+  (def numSearch uint64_t 0)                      ; # of search space
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ;  
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task request 
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
 
   ;; arguments
   (= patternFile "data/symatlas_pattern.txt")
@@ -840,19 +935,22 @@
       (csym::sprintf copyFile "copy0-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))
 
   ;; initialize Edge Data & Vertex Data & Debug Data
-  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems))
+  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; load graph file
-  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex))
+  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
 
   ;; load pattern file
-  (loadPatternFile patternFile (ptr maxNumItems))
+  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; delete the vertex whose # of items is less than the user-specified threshold
   (thresholdItem minVertex maxVertex)
 
+  ;; set the range of enumCCIG loop
+  (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
+
   ;; init T-ExploreCCIG
-  (initExploreCCIG 0 NULL NULL NULL (ptr tsk))
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
 
   ;; open task file
   (%if* DEBUG-TASK (begin
@@ -874,21 +972,31 @@
   (csym::gettimeofday tp 0)
 
   ;; enumerate CCIG
-  (enumCCIG minVertex (+ maxVertex 1) (ptr tsk))
+  (= i minVertex)
+  (for ((< (+ i loopRange) maxVertex) (+= i loopRange))
+    (enumCCIG i (+ i loopRange) (ptr tsk)))
+  (enumCCIG i (+ maxVertex 1) (ptr tsk))
 
   ;; get end time of program
   (csym::gettimeofday (+ tp 1) 0)
   (= t2 (csym::getrusageSec))
 
+  ;; dispose of hash tables
+  (csym::hdestroy_r (ptr eHash))
+  (csym::hdestroy_r (ptr iHash))
+
   ;; close copy file
   (%if* DEBUG-COPY (begin
     (csym::fclose fpCopy)))
 
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" minVertex maxVertex (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch))
     (csym::fclose fpTask)))
-  (+= (aref searchSpace (fref -thr -> id)) (fref tsk numSearch))
+
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
 
   (%if* DEBUG-TIME (begin
     ;; open time file
@@ -967,36 +1075,45 @@
   ;; show debug datas
   (csym::fprintf stderr "time = %f[sec]~%" (csym::elapsedTime tp (+ tp 1)))
   (csym::fprintf stderr "user time = %f[sec]~%" (- t2 t1))
-  (csym::fprintf stderr "# of subgraphs = %llu~%" (fref tsk numSubgraph))
-  (csym::fprintf stderr "# of thresholds = %llu~%" (fref tsk numThreshold))
-  (csym::fprintf stderr "# of prunings = %u~%" (fref tsk numPruning))
-  (csym::fprintf stderr "Avg. tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
+  (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
+  (csym::fprintf stderr "Avg. size of tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
   (%if* DEBUG-RSLT (begin
     (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
     (csym::fprintf stderr "Avg. size of subgraph = %f~%" (/ (cast double avgSizeSubgraph) (cast double (fref tsk numSubgraph))))))
 
   (csym::fprintf stderr "~%# of searches & task-requests~%")
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
-    (csym::fprintf stderr " ID:%d, %llu, %d~%" j (aref searchSpace j) (aref taskRequest j))
+    (= (aref searchSpace j) (+ (+ (aref visit2Vertices j) (aref thresholdPruning j)) (
+aref inclusivePruning j)))
+    (csym::fprintf stderr " ID:%d, %llu(%llu, %llu, %llu), %d, %llu~%" j (aref searchSpace j) (aref visit2Vertices j) (aref thresholdPruning j) (aref inclusivePruning j) (aref taskRequest j) (aref tableReference j))
     (+= numSearch (aref searchSpace j))
+    (if (< maxWorkerSearch (aref searchSpace j))
+      (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
     (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
-    (+= numTaskRequest (aref taskRequest j)))
+    (+= numTaskRequest (aref taskRequest j))
+    (+= numTableReference (aref tableReference j)))
   (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
   (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
   (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
+  (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
 
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
     (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
     (+= workerSearchPerSecSD (csym::pow (- (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec) 2.0))
-    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0)))
-
+    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
   (/= workerSearchSD (fref option num-thrs))
   (/= workerSearchPerSecSD (fref option num-thrs))
   (/= taskRequestSD (fref option num-thrs))
+  (/= tableReferenceSD (fref option num-thrs))
   (= workerSearchSD (csym::sqrt workerSearchSD))
   (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
   (= taskRequestSD (csym::sqrt taskRequestSD))
+  (= tableReferenceSD (csym::sqrt tableReferenceSD))
 
-  (csym::fprintf stderr "# of searches = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch avgWorkerSearch workerSearchSD)
-  (csym::fprintf stderr "# of task requests = %d, Avg. = %.2f, S.D. = %.2f~%" numTaskRequest avgTaskRequest taskRequestSD)
-  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD))
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
+  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
+  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD))
diff --git a/src/sample/tcell/copine1.tcell b/src/sample/tcell/copine1.tcell
index 8a62bfae..39b98096 100644
--- a/src/sample/tcell/copine1.tcell
+++ b/src/sample/tcell/copine1.tcell
@@ -31,6 +31,7 @@
 ;; task 0 0 0 2
 ;; <th>         ; threshold
 ;; <it>         ; # of iterations left for a victim worker
+;; <dv>         ; # of divisions of the higher layer of the search tree
 
 
 (c-exp "#include <stdio.h>")
@@ -42,7 +43,10 @@
 (c-exp "#include <stdint.h>")
 (c-exp "#include <sys/time.h>")
 (c-exp "#include <sys/resource.h>")
-;(c-exp "#include <nmmintrin.h>")
+(c-exp "#include <nmmintrin.h>")
+
+(c-exp "#define  __USE_GNU")
+(c-exp "#include <search.h>")
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
@@ -60,15 +64,17 @@
 (%defconstant USE-SSE 0)
 
 ;;; Max # of workers
-(%defconstant NUM-WORKERS 16)
+(%defconstant NUM-WORKERS 32)
 
 ;;; Constants
-(%defconstant E-SIZE 500000)  ; # of edges
-(%defconstant V-SIZE 20000)   ; # of vertices
-(%defconstant BIT-LEN 32)     ; bit length of bitset
-(%defconstant BIT-ITEM 5)     ; # of items = BIT-ITEM * BIT-LEN
-(%defconstant BIT-EDGE 8125)  ; # of edges = BIT-EDGE * BIT-LEN
-(%defconstant BIT-VERTEX 625) ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant E-SIZE 500000)               ; # of edges
+(%defconstant V-SIZE 15500)                ; # of vertices
+(%defconstant BIT-LEN 32)                  ; bit length of bitset
+(%defconstant BIT-ITEM 5)                  ; # of items = BIT-ITEM * BIT-LEN
+(%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
+(%defconstant BIT-VERTEX 625)              ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant I-SIZE (* BIT-LEN BIT-ITEM)) ; 
+
 
 ;;; Debug Flags
 (%defconstant DEBUG-DATA 0) ; flag to show some data
@@ -129,7 +135,11 @@
 
 ;;; Worker Data
 (decl searchSpace (array uint64_t NUM-WORKERS))
+(decl visit2Vertices (array uint64_t NUM-WORKERS))
+(decl thresholdPruning (array uint64_t NUM-WORKERS))
+(decl inclusivePruning (array uint64_t NUM-WORKERS))
 (decl taskRequest (array int NUM-WORKERS))
+(decl tableReference (array uint64_t NUM-WORKERS))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
@@ -145,18 +155,28 @@
 (def (csym::elapsedTime t1 t2) (fn double (ptr (struct timeval)) (ptr (struct timeval)))
   (return (+ (- (fref t2 -> tv-sec) (fref t1 -> tv-sec)) (* 0.000001 (- (fref t2 -> tv-usec) (fref t1 -> tv-usec))))))
 
-;;; Function: countBits - count the number of "i-th bit == 1"
-(def (csym::countBits x) (fn int set)
+;;; Function: countBits32 - count the number of "i-th bit == 1"
+(def (csym::countBits32 x) (fn int uint32_t)
   (= x (+ (bit-and x #x55555555) (bit-and (>> x 1) #x55555555))) 
   (= x (+ (bit-and x #x33333333) (bit-and (>> x 2) #x33333333))) 
   (= x (+ (bit-and x #x0f0f0f0f) (bit-and (>> x 4) #x0f0f0f0f))) 
   (= x (+ (bit-and x #x00ff00ff) (bit-and (>> x 8) #x00ff00ff))) 
   (return (+ (bit-and x #x0000ffff) (bit-and (>> x 16) #x0000ffff))))
 
+;;; Function: countBits64 - count the number of "i-th bit == 1"
+(def (csym::countBits64 x) (fn int uint64_t)
+  (= x (+ (bit-and x (c-exp "0x5555555555555555UL")) (>> (bit-and x (c-exp "0xaaaaaaaaaaaaaaaaUL")) 1)))
+  (= x (+ (bit-and x (c-exp "0x3333333333333333UL")) (>> (bit-and x (c-exp "0xccccccccccccccccUL")) 2)))
+  (= x (+ (bit-and x (c-exp "0x0f0f0f0f0f0f0f0fUL")) (>> (bit-and x (c-exp "0xf0f0f0f0f0f0f0f0UL")) 4)))
+  (= x (+ (bit-and x (c-exp "0x00ff00ff00ff00ffUL")) (>> (bit-and x (c-exp "0xff00ff00ff00ff00UL")) 8)))
+  (= x (+ (bit-and x (c-exp "0x0000ffff0000ffffUL")) (>> (bit-and x (c-exp "0xffff0000ffff0000UL")) 16)))
+  (= x (+ (bit-and x (c-exp "0x00000000ffffffffUL")) (>> (bit-and x (c-exp "0xffffffff00000000UL")) 32)))
+  (return x))
+
 ;;; Function: printBits - print a variable with set data type by binary representation
 (def (csym::printBits x) (fn void (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf stderr "1")
@@ -166,7 +186,7 @@
 ;;; Function: fprintBits - write a variable with set data type by binary representation to stream
 (def (csym::fprintBits fp x) (fn void (ptr FILE) (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf fp "1")
@@ -307,18 +327,15 @@
   (def numSubgraph int)
   (def numSearch uint64_t)
   (def numThreshold uint64_t)
-  (def numPruning int))
+  (def numPruning int)
+  (def numTableReference uint64_t))
 
 ;;;Function: initExploreCCIG - 
-(def (initExploreCCIG traversed itemTable C T pTsk) (fn void int (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+(def (initExploreCCIG traversed itemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
   (decl i int)
 
   ;; initialize vTraversed
-  (if (== traversed 0)
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int)))))
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::malloc (* V-SIZE (sizeof int)))))))
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
 
   ;; initialize vItemTable
   (= (fref pTsk -> vItemTable) (cast (ptr ITlist) (csym::malloc (* V-SIZE (sizeof ITlist)))))
@@ -332,7 +349,7 @@
 
   ;; initialize T
   (= (fref pTsk -> numT) 0)
-  (= (fref pTsk -> sizeOfT) 100)
+  (= (fref pTsk -> sizeOfT) 1000)
   (= (fref pTsk -> T) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))
 
   ;; init subgraph
@@ -344,7 +361,8 @@
   (= (fref pTsk -> numSubgraph) 0)
   (= (fref pTsk -> numSearch) 0)
   (= (fref pTsk -> numThreshold) 0) 
-  (= (fref pTsk -> numPruning) 0))
+  (= (fref pTsk -> numPruning) 0)
+  (= (fref pTsk -> numTableReference) 0))
 
 ;;; Function: exploreCCIG - create a common-itemset tree with recursive call
 (def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
@@ -366,13 +384,13 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        (inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
-          (+= commonNum (csym::countBits (aref commonItem k)))
-          ;(+= commonNum (csym::--builtin-popcount (aref commonItem k)))
+          ;(+= commonNum (csym::countBits32 (aref commonItem k)))
+          ;(+= commonNum (csym::countBits64 (aref commonItem k)))
+          (+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
         (if (== m BIT-ITEM)
@@ -386,6 +404,7 @@
             ;; check that common-itemset is subset of item table
             (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) vv) head) -> next))
             (while (!= ITptr (fref (aref (fref pTsk -> vItemTable) vv) head))
+              (inc (fref pTsk -> numTableReference))
               (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
                 (if (== (cast set (bit-and (aref commonItem k) (aref (fref ITptr -> item) k))) (aref commonItem k))
                   (inc m)))
@@ -403,6 +422,7 @@
 
                 (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) vv) head) -> next))
                 (while (!= ITptr (fref (aref (fref pTsk -> vItemTable) vv) head))
+                  (inc (fref pTsk -> numTableReference))
                   (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
                     (if (== (cast set (bit-and (aref (fref ITptr -> item) k) (aref commonItem k))) (aref (fref ITptr -> item) k))
                       (inc m)))
@@ -411,6 +431,8 @@
                     (csym::removeITnode (ptr (aref (fref pTsk -> vItemTable) vv)) (fref ITptr -> prev))))
                 (csym::insertITnodeAfter (ptr (aref (fref pTsk -> vItemTable) vv)) (fref (aref (fref pTsk -> vItemTable) vv) head) commonItem)
 
+                (inc (fref pTsk -> numSearch))
+
                 ;; add new candidates 
                 (if (>= (+ (fref pTsk -> numC) (aref vDegree vv)) (fref pTsk -> sizeOfC))
                   (begin
@@ -435,7 +457,7 @@
                     (+= (fref pTsk -> numC) cc)
                     (inc (fref pTsk -> numT))
 
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (inc (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1))))))))
@@ -452,7 +474,7 @@
                     (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
                       (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))
                   (:after
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))))
@@ -488,7 +510,7 @@
         (= (fref this maxC) i2)
         (= (fref this v) v)
         (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
-        (initExploreCCIG 1 NULL NULL NULL (ptr this))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
         (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
         (for ((= j 0) (< j i1) (inc j))
           (inc (aref (fref this vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))
@@ -501,15 +523,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
-        (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref this treeDepth))
         (+= (fref pTsk -> numTraversed) (fref this numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref this numThreshold))
-        (+= (fref pTsk -> numPruning) (fref this numPruning))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 3) 0)
           (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
@@ -529,9 +550,11 @@
   (csym::gettimeofday tp 0)
   (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref this numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref this numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-exploreCCIG(%d): %f[sec](%f[sec]), %llu, ID:%d~%" (aref (fref this T) 0) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch))))
   (csym::free (fref this vTraversed))
   (for ((= i 0) (< i V-SIZE) (inc i))
@@ -566,6 +589,7 @@
 
         ;; check that itemset of 'i' is subset of itemset-table
         (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) i) head) -> next))
+        (inc (fref pTsk -> numTableReference))
         (for ((= k 0) (< k BIT-ITEM) (inc k))
           (if (!= (cast set (bit-and (aref vItem i k) (aref (fref ITptr -> item) k))) (aref vItem i k))
             (begin 
@@ -581,6 +605,8 @@
             (csym::clearITlist (ptr (aref (fref pTsk -> vItemTable) i)))
             (csym::insertITnodeAfter (ptr (aref (fref pTsk -> vItemTable) i)) (fref (aref (fref pTsk -> vItemTable) i) head) (aref vItem i))
 
+            (inc (fref pTsk -> numSearch))
+
             (for ((= j (aref vFirstEdge i)) (!= j -1) (= j (aref eNext j)))
               (if (< i (aref eTo j))
                 (begin
@@ -622,21 +648,20 @@
           (csym::gettimeofday tpc 0)))
         (= (fref this minVertex) i1)
         (= (fref this maxVertex) i2)
-        (initExploreCCIG 0 NULL NULL NULL (ptr (fref this tsk)))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 1) 0))))
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
         (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref (fref this tsk) numThreshold))
-        (+= (fref pTsk -> numPruning) (fref (fref this tsk) numPruning))
         (csym::free (fref (fref this tsk) vTraversed))
         (for ((= j 0) (< j V-SIZE) (inc j))
           (csym::termITlist (ptr (aref (fref (fref this tsk) vItemTable) j))))
@@ -654,9 +679,11 @@
   (csym::gettimeofday tp 0)
   (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk)))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" (fref this minVertex) (fref this maxVertex) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch)))))
 
 ;;; Function: thresholdItem - delete the vertex whose # of items is less than the user-specified threshold
@@ -694,12 +721,16 @@
             (= l k)))))))
 
 ;;; Function: loadPatternFile - load pattern file
-(def (loadPatternFile patternFile maxNumItems) (fn void (ptr (const char)) (ptr int))
-  (decl n int)                 ; item number
-  (decl v int)                 ; vertex number
-  (decl item (ptr char))       ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ; 
+  (decl n int)                    ; item number
+  (decl v int)                    ; vertex number
+  (decl item (ptr char))          ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open pattern file
   (if (== (= fp (csym::fopen patternFile "r")) NULL)
@@ -713,10 +744,30 @@
     (if (!= (csym::strncmp buff "#" 1) 0)
       (begin
         (= v (csym::atoi (csym::strtok buff "~|11|")))
+
+        ;; find v from eHash
+        (csym::sprintf temp "%d" v)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (continue))
+        (= v (cast int (fref hep -> data)))
+
         ;; add item to Vertex Data
         (while (!= (= item (csym::strtok NULL ",")) NULL)
           (= n (csym::atoi item))
-          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< 1 (cast int (% n BIT-LEN))))
+
+          ;; enter n to iHash
+          (csym::sprintf temp "%d" n)
+          (= (fref he key) temp)
+          (csym::hsearch_r he FIND (ptr hep) iHash)
+          (if (== hep NULL)
+            (begin
+              (= (fref he data) (cast (ptr void) (inc i)))
+              (csym::hsearch_r he ENTER (ptr hep) iHash)))
+          (= n (cast int (fref hep -> data)))
+
+          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< (cast set 1) (cast int (% n BIT-LEN))))
           (inc (aref vNumItems v)) ; increase # of items
           ;; evaluate maximum # of items
           (if (> n (mref maxNumItems))
@@ -771,12 +822,16 @@
   (inc (aref vDegree v1)))
 
 ;;; Function: loadGraphFile - load graph file
-(def (loadGraphFile graphFile edgeMax minVertex maxVertex) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int))
-  (defs int v1 v2)             ; starting point, ending point
-  (decl eLabel (ptr char))     ; label of edge
-  (decl empty (ptr char))      ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ; 
+  (defs int v1 v2)                ; starting point, ending point
+  (decl eLabel (ptr char))        ; label of edge
+  (decl empty (ptr char))         ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open graph file
   (if (== (= fp (csym::fopen graphFile "r")) NULL)
@@ -793,6 +848,27 @@
         (= eLabel (csym::strtok NULL "~|11|"))
         (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
         (= empty (csym::strtok NULL "~|11|"))
+
+        ;; enter v1 to eHash
+        (csym::sprintf temp "%d" v1)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v1 (cast int (fref hep -> data)))
+
+        ;; enter v2 to eHash
+        (csym::sprintf temp "%d" v2)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v2 (cast int (fref hep -> data)))
+
         ;; add edge to Edge List
         (if (== empty NULL)
           (if (!= v1 v2)
@@ -804,7 +880,7 @@
   (csym::fclose fp))
 
 ;;; Function: initData - initialize Edge Data & Vertex Data & Debug Data
-(def (initData edgeMax minVertex maxVertex maxNumItems) (fn void (ptr int) (ptr int) (ptr int) (ptr int))
+(def (initData edgeMax minVertex maxVertex maxNumItems eHash iHash) (fn void (ptr int) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
   (defs int i j) ; temporary variable
 
   ;; initialize Edge Data
@@ -827,20 +903,33 @@
   ;; initialize Debug Data
   (for ((= i 0) (< i NUM-WORKERS) (inc i))
     (= (aref searchSpace i) 0)
-    (= (aref taskRequest i) 0))
+    (= (aref visit2Vertices i) 0)
+    (= (aref thresholdPruning i) 0)
+    (= (aref inclusivePruning i) 0)
+    (= (aref taskRequest i) 0)
+    (= (aref tableReference i) 0))
+
   (for ((= i 0) (< i V-SIZE) (inc i))
-    (= (aref doneID i) 0)))
+    (= (aref doneID i) 0))
+
+  ;; initialize Hash Data
+  (csym::memset eHash 0 (sizeof (mref eHash)))
+  (csym::memset iHash 0 (sizeof (mref iHash)))
+  (csym::hcreate_r E-SIZE eHash)
+  (csym::hcreate_r I-SIZE iHash))
 
 ;;; 
 (def (task T-startCCIG)
   (def th int :in)
-  (def spawnSize int :in))
+  (def spawnSize int :in)
+  (def loopRatio int :in))
 
 ;;; Main 
 (def (task-body T-startCCIG)
   (defs int i j)                       ; temporary variable
   (decl tp (array (struct timeval) 2)) ; start time, end time
   (defs double t1 t2)                  ; start user time, end user time
+  (decl loopRange int)                 ; loop range of enumCCIG
   (decl patternFile (ptr char))        ; name of pattern file
   (decl graphFile (ptr char))          ; name of graph file
   (decl resultFile (ptr char))         ; name of result file
@@ -863,17 +952,25 @@
   ;; Subgraph Data
   (decl Gptr (ptr Gnode))
 
+  ;; Hash Data
+  (defs (struct hsearch_data) eHash iHash)
+
   ;; Debug Data
-  (def numSearch uint64_t 0)             ; # of search space
-  (def avgWorkerSearch double 0.0)       ; 
-  (def workerSearchSD double 0.0)        ;
-  (def avgWorkerSearchPerSec double 0.0) ; 
-  (def workerSearchPerSecSD double 0.0)  ;
-  (def numTaskRequest int 0)             ; # of task request 
-  (def avgTaskRequest double 0.0)        ;
-  (def taskRequestSD double 0.0)         ;
-  (def avgSizeSubgraph uint64_t 0)       ;
-  (def maxSizeSubgraph int 0)            ;
+  (def numSearch uint64_t 0)                      ; # of search space
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ;  
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task request 
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
 
   ;; arguments
   (= patternFile "data/symatlas_pattern.txt")
@@ -903,19 +1000,22 @@
       (csym::sprintf copyFile "copy1-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))
 
   ;; initialize Edge Data & Vertex Data & Debug Data
-  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems))
+  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; load graph file
-  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex))
+  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
 
   ;; load pattern file
-  (loadPatternFile patternFile (ptr maxNumItems))
+  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; delete the vertex whose # of items is less than the user-specified threshold
   (thresholdItem minVertex maxVertex)
 
+  ;; set the range of enumCCIG loop
+  (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
+
   ;; init T-exploreCCIG
-  (initExploreCCIG 0 NULL NULL NULL (ptr tsk))
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
 
   ;; open task file
   (%if* DEBUG-TASK (begin
@@ -937,21 +1037,31 @@
   (csym::gettimeofday tp 0)
 
   ;; enumerate CCIG
-  (enumCCIG minVertex (+ maxVertex 1) (ptr tsk))
+  (= i minVertex)
+  (for ((< (+ i loopRange) maxVertex) (+= i loopRange))
+    (enumCCIG i (+ i loopRange) (ptr tsk)))
+  (enumCCIG i (+ maxVertex 1) (ptr tsk))
 
   ;; get end time of program
   (csym::gettimeofday (+ tp 1) 0)
   (= t2 (csym::getrusageSec))
 
+  ;; dispose of hash tables
+  (csym::hdestroy_r (ptr eHash))
+  (csym::hdestroy_r (ptr iHash))
+
   ;; close copy file
   (%if* DEBUG-COPY (begin
     (csym::fclose fpCopy)))
 
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" minVertex maxVertex (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch))
     (csym::fclose fpTask)))
-  (+= (aref searchSpace (fref -thr -> id)) (fref tsk numSearch))
+
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
 
   (%if* DEBUG-TIME (begin
     ;; open time file
@@ -1030,35 +1140,45 @@
   ;; show debug datas
   (csym::fprintf stderr "time = %f[sec]~%" (csym::elapsedTime tp (+ tp 1)))
   (csym::fprintf stderr "user time = %f[sec]~%" (- t2 t1))
-   (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
-  (csym::fprintf stderr "# of thresholds = %llu~%" (fref tsk numThreshold))
-  (csym::fprintf stderr "# of prunings = %u~%" (fref tsk numPruning))
-  (csym::fprintf stderr "Avg. tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
+  (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
+  (csym::fprintf stderr "Avg. size of tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
   (%if* DEBUG-RSLT (begin
     (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
     (csym::fprintf stderr "Avg. size of subgraph = %f~%" (/ (cast double avgSizeSubgraph) (cast double (fref tsk numSubgraph))))))
 
   (csym::fprintf stderr "~%# of searches & task-requests~%")
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
-    (csym::fprintf stderr " ID:%d, %llu, %d~%" j (aref searchSpace j) (aref taskRequest j))
+    (= (aref searchSpace j) (+ (+ (aref visit2Vertices j) (aref thresholdPruning j)) (
+aref inclusivePruning j)))
+    (csym::fprintf stderr " ID:%d, %llu(%llu, %llu, %llu), %d, %llu~%" j (aref searchSpace j) (aref visit2Vertices j) (aref thresholdPruning j) (aref inclusivePruning j) (aref taskRequest j) (aref tableReference j))
     (+= numSearch (aref searchSpace j))
+    (if (< maxWorkerSearch (aref searchSpace j))
+      (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
     (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
-    (+= numTaskRequest (aref taskRequest j)))
+    (+= numTaskRequest (aref taskRequest j))
+    (+= numTableReference (aref tableReference j)))
   (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
   (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
   (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
+  (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
 
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
     (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
-(+= workerSearchPerSecSD (csym::pow (- (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec) 2.0))
-    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0)))
+    (+= workerSearchPerSecSD (csym::pow (- (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec) 2.0))
+    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
   (/= workerSearchSD (fref option num-thrs))
   (/= workerSearchPerSecSD (fref option num-thrs))
   (/= taskRequestSD (fref option num-thrs))
+  (/= tableReferenceSD (fref option num-thrs))
   (= workerSearchSD (csym::sqrt workerSearchSD))
   (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
   (= taskRequestSD (csym::sqrt taskRequestSD))
+  (= tableReferenceSD (csym::sqrt tableReferenceSD))
 
-  (csym::fprintf stderr "# of searches = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch avgWorkerSearch workerSearchSD)
-  (csym::fprintf stderr "# of task requests = %d, Avg. = %.2f, S.D. = %.2f~%" numTaskRequest avgTaskRequest taskRequestSD)
-  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD))
\ No newline at end of file
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
+  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
+  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD))
diff --git a/src/sample/tcell/copine2.tcell b/src/sample/tcell/copine2.tcell
index 0fd31d25..533a75a8 100644
--- a/src/sample/tcell/copine2.tcell
+++ b/src/sample/tcell/copine2.tcell
@@ -43,7 +43,10 @@
 (c-exp "#include <stdint.h>")
 (c-exp "#include <sys/time.h>")
 (c-exp "#include <sys/resource.h>")
-;(c-exp "#include <nmmintrin.h>")
+(c-exp "#include <nmmintrin.h>")
+
+(c-exp "#define  __USE_GNU")
+(c-exp "#include <search.h>")
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
@@ -61,15 +64,17 @@
 (%defconstant USE-SSE 0)
 
 ;;; Max # of workers
-(%defconstant NUM-WORKERS 16)
+(%defconstant NUM-WORKERS 32)
 
 ;;; Constants
-(%defconstant E-SIZE 500000)  ; # of edges
-(%defconstant V-SIZE 20000)   ; # of vertices
-(%defconstant BIT-LEN 32)     ; bit length of bitset
-(%defconstant BIT-ITEM 5)     ; # of items = BIT-ITEM * BIT-LEN
-(%defconstant BIT-EDGE 8125)  ; # of edges = BIT-EDGE * BIT-LEN
-(%defconstant BIT-VERTEX 625) ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant E-SIZE 500000)               ; # of edges
+(%defconstant V-SIZE 15500)                ; # of vertices
+(%defconstant BIT-LEN 64)                  ; bit length of bitset
+(%defconstant BIT-ITEM 3)                  ; # of items = BIT-ITEM * BIT-LEN
+(%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
+(%defconstant BIT-VERTEX 625)              ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant I-SIZE (* BIT-LEN BIT-ITEM)) ; 
+
 
 ;;; Debug Flags
 (%defconstant DEBUG-DATA 0) ; flag to show some data
@@ -80,7 +85,7 @@
 (%defconstant DEBUG-COPY 0) ; flag to output copy file
 
 ;;; Typedef
-(deftype set uint32_t) ; bitset
+(deftype set uint64_t) ; bitset
 (deftype vtx uint32_t) ; vertex
 
 ;;; Structure of ITnode
@@ -130,7 +135,11 @@
 
 ;;; Worker Data
 (decl searchSpace (array uint64_t NUM-WORKERS))
+(decl visit2Vertices (array uint64_t NUM-WORKERS))
+(decl thresholdPruning (array uint64_t NUM-WORKERS))
+(decl inclusivePruning (array uint64_t NUM-WORKERS))
 (decl taskRequest (array int NUM-WORKERS))
+(decl tableReference (array uint64_t NUM-WORKERS))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
@@ -146,18 +155,28 @@
 (def (csym::elapsedTime t1 t2) (fn double (ptr (struct timeval)) (ptr (struct timeval)))
   (return (+ (- (fref t2 -> tv-sec) (fref t1 -> tv-sec)) (* 0.000001 (- (fref t2 -> tv-usec) (fref t1 -> tv-usec))))))
 
-;;; Function: countBits - count the number of "i-th bit == 1"
-(def (csym::countBits x) (fn int set)
+;;; Function: countBits32 - count the number of "i-th bit == 1"
+(def (csym::countBits32 x) (fn int uint32_t)
   (= x (+ (bit-and x #x55555555) (bit-and (>> x 1) #x55555555))) 
   (= x (+ (bit-and x #x33333333) (bit-and (>> x 2) #x33333333))) 
   (= x (+ (bit-and x #x0f0f0f0f) (bit-and (>> x 4) #x0f0f0f0f))) 
   (= x (+ (bit-and x #x00ff00ff) (bit-and (>> x 8) #x00ff00ff))) 
   (return (+ (bit-and x #x0000ffff) (bit-and (>> x 16) #x0000ffff))))
 
+;;; Function: countBits64 - count the number of "i-th bit == 1"
+(def (csym::countBits64 x) (fn int uint64_t)
+  (= x (+ (bit-and x (c-exp "0x5555555555555555UL")) (>> (bit-and x (c-exp "0xaaaaaaaaaaaaaaaaUL")) 1)))
+  (= x (+ (bit-and x (c-exp "0x3333333333333333UL")) (>> (bit-and x (c-exp "0xccccccccccccccccUL")) 2)))
+  (= x (+ (bit-and x (c-exp "0x0f0f0f0f0f0f0f0fUL")) (>> (bit-and x (c-exp "0xf0f0f0f0f0f0f0f0UL")) 4)))
+  (= x (+ (bit-and x (c-exp "0x00ff00ff00ff00ffUL")) (>> (bit-and x (c-exp "0xff00ff00ff00ff00UL")) 8)))
+  (= x (+ (bit-and x (c-exp "0x0000ffff0000ffffUL")) (>> (bit-and x (c-exp "0xffff0000ffff0000UL")) 16)))
+  (= x (+ (bit-and x (c-exp "0x00000000ffffffffUL")) (>> (bit-and x (c-exp "0xffffffff00000000UL")) 32)))
+  (return x))
+
 ;;; Function: printBits - print a variable with set data type by binary representation
 (def (csym::printBits x) (fn void (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf stderr "1")
@@ -167,7 +186,7 @@
 ;;; Function: fprintBits - write a variable with set data type by binary representation to stream
 (def (csym::fprintBits fp x) (fn void (ptr FILE) (const set))
   (decl i int)
-  (def mask set (<< 1 (- BIT-LEN 1)))
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
   (for ((= i 0) (< i BIT-LEN) (inc i))
     (if (bit-and x mask)
       (csym::fprintf fp "1")
@@ -308,18 +327,15 @@
   (def numSubgraph int)
   (def numSearch uint64_t)
   (def numThreshold uint64_t)
-  (def numPruning int))
+  (def numPruning int)
+  (def numTableReference uint64_t))
 
 ;;;Function: initExploreCCIG - 
-(def (initExploreCCIG traversed itemTable C T pTsk) (fn void int (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+(def (initExploreCCIG traversed itemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
   (decl i int)
 
   ;; initialize vTraversed
-  (if (== traversed 0)
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int)))))
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::malloc (* V-SIZE (sizeof int)))))))
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
 
   ;; initialize vItemTable
   (= (fref pTsk -> vItemTable) (cast (ptr ITlist) (csym::malloc (* V-SIZE (sizeof ITlist)))))
@@ -328,12 +344,12 @@
 
   ;; initialize C
   (= (fref pTsk -> numC) 0)
-  (= (fref pTsk -> sizeOfC) 15000)
+  (= (fref pTsk -> sizeOfC) 10000)
   (= (fref pTsk -> C) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfC) (sizeof vtx)))))
 
   ;; initialize T
   (= (fref pTsk -> numT) 0)
-  (= (fref pTsk -> sizeOfT) 100)
+  (= (fref pTsk -> sizeOfT) 1000)
   (= (fref pTsk -> T) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))
 
   ;; init subgraph
@@ -345,7 +361,8 @@
   (= (fref pTsk -> numSubgraph) 0)
   (= (fref pTsk -> numSearch) 0)
   (= (fref pTsk -> numThreshold) 0) 
-  (= (fref pTsk -> numPruning) 0))
+  (= (fref pTsk -> numPruning) 0)
+  (= (fref pTsk -> numTableReference) 0))
 
 ;;; Function: exploreCCIG - create a common-itemset tree with recursive call
 (def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
@@ -367,13 +384,12 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        (inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
-          (+= commonNum (csym::countBits (aref commonItem k)))
-          ;(+= commonNum (csym::--builtin-popcount (aref commonItem k)))
+          ;(+= commonNum (csym::countBits32 (aref commonItem k)))
+          (+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
         (if (== m BIT-ITEM)
@@ -387,6 +403,7 @@
             ;; check that common-itemset is subset of item table
             (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) vv) head) -> next))
             (while (!= ITptr (fref (aref (fref pTsk -> vItemTable) vv) head))
+              (inc (fref pTsk -> numTableReference))
               (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
                 (if (== (cast set (bit-and (aref commonItem k) (aref (fref ITptr -> item) k))) (aref commonItem k))
                   (inc m)))
@@ -404,6 +421,7 @@
 
                 (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) vv) head) -> next))
                 (while (!= ITptr (fref (aref (fref pTsk -> vItemTable) vv) head))
+                  (inc (fref pTsk -> numTableReference))
                   (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
                     (if (== (cast set (bit-and (aref (fref ITptr -> item) k) (aref commonItem k))) (aref (fref ITptr -> item) k))
                       (inc m)))
@@ -412,6 +430,8 @@
                     (csym::removeITnode (ptr (aref (fref pTsk -> vItemTable) vv)) (fref ITptr -> prev))))
                 (csym::insertITnodeAfter (ptr (aref (fref pTsk -> vItemTable) vv)) (fref (aref (fref pTsk -> vItemTable) vv) head) commonItem)
 
+                (inc (fref pTsk -> numSearch))
+
                 ;; add new candidates 
                 (if (>= (+ (fref pTsk -> numC) (aref vDegree vv)) (fref pTsk -> sizeOfC))
                   (begin
@@ -436,7 +456,7 @@
                     (+= (fref pTsk -> numC) cc)
                     (inc (fref pTsk -> numT))
 
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (inc (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1))))))))
@@ -453,7 +473,7 @@
                     (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
                       (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))
                   (:after
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))))
@@ -489,7 +509,7 @@
         (= (fref this maxC) i2)
         (= (fref this v) v)
         (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
-        (initExploreCCIG 1 NULL NULL NULL (ptr this))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
         (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
         (for ((= j 0) (< j i1) (inc j))
           (inc (aref (fref this vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))
@@ -507,15 +527,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
-        (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref this treeDepth))
         (+= (fref pTsk -> numTraversed) (fref this numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref this numThreshold))
-        (+= (fref pTsk -> numPruning) (fref this numPruning))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 3) 0)
           (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
@@ -535,9 +554,11 @@
   (csym::gettimeofday tp 0)
   (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref this numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref this numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-exploreCCIG(%d): %f[sec](%f[sec]), %llu, ID:%d~%" (aref (fref this T) 0) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch))))
   (csym::free (fref this vTraversed))
   (for ((= i 0) (< i V-SIZE) (inc i))
@@ -572,6 +593,7 @@
 
         ;; check that itemset of 'i' is subset of itemset-table
         (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) i) head) -> next))
+        (inc (fref pTsk -> numTableReference))
         (for ((= k 0) (< k BIT-ITEM) (inc k))
           (if (!= (cast set (bit-and (aref vItem i k) (aref (fref ITptr -> item) k))) (aref vItem i k))
             (begin 
@@ -587,6 +609,8 @@
             (csym::clearITlist (ptr (aref (fref pTsk -> vItemTable) i)))
             (csym::insertITnodeAfter (ptr (aref (fref pTsk -> vItemTable) i)) (fref (aref (fref pTsk -> vItemTable) i) head) (aref vItem i))
 
+            (inc (fref pTsk -> numSearch))
+
             (for ((= j (aref vFirstEdge i)) (!= j -1) (= j (aref eNext j)))
               (if (< i (aref eTo j))
                 (begin
@@ -628,7 +652,7 @@
           (csym::gettimeofday tpc 0)))
         (= (fref this minVertex) i1)
         (= (fref this maxVertex) i2)
-        (initExploreCCIG 0 NULL NULL NULL (ptr (fref this tsk)))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
         (for ((= j (+ i1 1)) (< j V-SIZE) (inc j))
           (= ITptr (fref (fref (aref (fref pTsk -> vItemTable) j) head) -> next))
           (while (!= ITptr (fref (aref (fref pTsk -> vItemTable) j) head))
@@ -639,15 +663,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
         (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
-        (+= (fref pTsk -> numThreshold) (fref (fref this tsk) numThreshold))
-        (+= (fref pTsk -> numPruning) (fref (fref this tsk) numPruning))
         (csym::free (fref (fref this tsk) vTraversed))
         (for ((= j 0) (< j V-SIZE) (inc j))
           (csym::termITlist (ptr (aref (fref (fref this tsk) vItemTable) j))))
@@ -665,9 +688,11 @@
   (csym::gettimeofday tp 0)
   (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk)))
   (csym::gettimeofday (+ tp 1) 0)
-  (+= (aref searchSpace (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" (fref this minVertex) (fref this maxVertex) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch)))))
 
 ;;; Function: thresholdItem - delete the vertex whose # of items is less than the user-specified threshold
@@ -705,12 +730,16 @@
             (= l k)))))))
 
 ;;; Function: loadPatternFile - load pattern file
-(def (loadPatternFile patternFile maxNumItems) (fn void (ptr (const char)) (ptr int))
-  (decl n int)                 ; item number
-  (decl v int)                 ; vertex number
-  (decl item (ptr char))       ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ; 
+  (decl n int)                    ; item number
+  (decl v int)                    ; vertex number
+  (decl item (ptr char))          ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open pattern file
   (if (== (= fp (csym::fopen patternFile "r")) NULL)
@@ -724,10 +753,30 @@
     (if (!= (csym::strncmp buff "#" 1) 0)
       (begin
         (= v (csym::atoi (csym::strtok buff "~|11|")))
+
+        ;; find v from eHash
+        (csym::sprintf temp "%d" v)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (continue))
+        (= v (cast int (fref hep -> data)))
+
         ;; add item to Vertex Data
         (while (!= (= item (csym::strtok NULL ",")) NULL)
           (= n (csym::atoi item))
-          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< 1 (cast int (% n BIT-LEN))))
+
+          ;; enter n to iHash
+          (csym::sprintf temp "%d" n)
+          (= (fref he key) temp)
+          (csym::hsearch_r he FIND (ptr hep) iHash)
+          (if (== hep NULL)
+            (begin
+              (= (fref he data) (cast (ptr void) (inc i)))
+              (csym::hsearch_r he ENTER (ptr hep) iHash)))
+          (= n (cast int (fref hep -> data)))
+
+          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< (cast set 1) (cast int (% n BIT-LEN))))
           (inc (aref vNumItems v)) ; increase # of items
           ;; evaluate maximum # of items
           (if (> n (mref maxNumItems))
@@ -782,12 +831,16 @@
   (inc (aref vDegree v1)))
 
 ;;; Function: loadGraphFile - load graph file
-(def (loadGraphFile graphFile edgeMax minVertex maxVertex) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int))
-  (defs int v1 v2)             ; starting point, ending point
-  (decl eLabel (ptr char))     ; label of edge
-  (decl empty (ptr char))      ; 
-  (decl buff (array char 256)) ; buffer
-  (decl fp (ptr FILE))         ; file pointer
+(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ; 
+  (defs int v1 v2)                ; starting point, ending point
+  (decl eLabel (ptr char))        ; label of edge
+  (decl empty (ptr char))         ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
 
   ;; open graph file
   (if (== (= fp (csym::fopen graphFile "r")) NULL)
@@ -804,6 +857,27 @@
         (= eLabel (csym::strtok NULL "~|11|"))
         (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
         (= empty (csym::strtok NULL "~|11|"))
+
+        ;; enter v1 to eHash
+        (csym::sprintf temp "%d" v1)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v1 (cast int (fref hep -> data)))
+
+        ;; enter v2 to eHash
+        (csym::sprintf temp "%d" v2)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v2 (cast int (fref hep -> data)))
+
         ;; add edge to Edge List
         (if (== empty NULL)
           (if (!= v1 v2)
@@ -815,7 +889,7 @@
   (csym::fclose fp))
 
 ;;; Function: initData - initialize Edge Data & Vertex Data & Debug Data
-(def (initData edgeMax minVertex maxVertex maxNumItems) (fn void (ptr int) (ptr int) (ptr int) (ptr int))
+(def (initData edgeMax minVertex maxVertex maxNumItems eHash iHash) (fn void (ptr int) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
   (defs int i j) ; temporary variable
 
   ;; initialize Edge Data
@@ -838,9 +912,20 @@
   ;; initialize Debug Data
   (for ((= i 0) (< i NUM-WORKERS) (inc i))
     (= (aref searchSpace i) 0)
-    (= (aref taskRequest i) 0))
+    (= (aref visit2Vertices i) 0)
+    (= (aref thresholdPruning i) 0)
+    (= (aref inclusivePruning i) 0)
+    (= (aref taskRequest i) 0)
+    (= (aref tableReference i) 0))
+
   (for ((= i 0) (< i V-SIZE) (inc i))
-    (= (aref doneID i) 0)))
+    (= (aref doneID i) 0))
+
+  ;; initialize Hash Data
+  (csym::memset eHash 0 (sizeof (mref eHash)))
+  (csym::memset iHash 0 (sizeof (mref iHash)))
+  (csym::hcreate_r E-SIZE eHash)
+  (csym::hcreate_r I-SIZE iHash))
 
 ;;; 
 (def (task T-startCCIG)
@@ -876,17 +961,25 @@
   ;; Subgraph Data
   (decl Gptr (ptr Gnode))
 
+  ;; Hash Data
+  (defs (struct hsearch_data) eHash iHash)
+
   ;; Debug Data
-  (def numSearch uint64_t 0)             ; # of search space
-  (def avgWorkerSearch double 0.0)       ; 
-  (def workerSearchSD double 0.0)        ;
-  (def avgWorkerSearchPerSec double 0.0) ; 
-  (def workerSearchPerSecSD double 0.0)  ;
-  (def numTaskRequest int 0)             ; # of task request 
-  (def avgTaskRequest double 0.0)        ;
-  (def taskRequestSD double 0.0)         ;
-  (def avgSizeSubgraph uint64_t 0)       ;
-  (def maxSizeSubgraph int 0)            ;
+  (def numSearch uint64_t 0)                      ; # of search space
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ;  
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task request 
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
 
   ;; arguments
   (= patternFile "data/symatlas_pattern.txt")
@@ -913,13 +1006,13 @@
           (csym::sprintf copyFile "copy2-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
 
   ;; initialize Edge Data & Vertex Data & Debug Data
-  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems))
+  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; load graph file
-  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex))
+  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
 
   ;; load pattern file
-  (loadPatternFile patternFile (ptr maxNumItems))
+  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
   ;; delete the vertex whose # of items is less than the user-specified threshold
   (thresholdItem minVertex maxVertex)
@@ -928,7 +1021,7 @@
   (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
 
   ;; init T-exploreCCIG
-  (initExploreCCIG 0 NULL NULL NULL (ptr tsk))
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
 
   ;; open task file
   (%if* DEBUG-TASK (begin
@@ -953,24 +1046,30 @@
 
   ;; enumerate CCIG
   (= i minVertex)
-  (for ((= j 1) (< j (fref this loopRatio)) (inc j)) 
-    (enumCCIG i (+ i loopRange) (ptr tsk))
-    (+= i loopRange))
-  (enumCCIG i (+ maxVertex 1) (ptr tsk))
+  (for ((< (+ i loopRange) maxVertex) (+= i loopRange))
+    (enumCCIG i (+ i loopRange) (ptr tsk)))
+  (enumCCIG i (+ maxVertex 1) (ptr tsk)) 
 
   ;; get end time of program
   (csym::gettimeofday (+ tp 1) 0)
   (= t2 (csym::getrusageSec))
 
+  ;; dispose of hash tables
+  (csym::hdestroy_r (ptr eHash))
+  (csym::hdestroy_r (ptr iHash))
+
   ;; close copy file
   (%if* DEBUG-COPY (begin
     (csym::fclose fpCopy)))
 
   (%if* DEBUG-TASK (begin
-    ;(csym::fprintf stderr "T-enumCCIG(from %d to %d): %f[sec](%f[sec]), %llu, ID:%d~%" minVertex maxVertex (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
     (csym::fprintf fpTask "%f, %f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch))
     (csym::fclose fpTask)))
-  (+= (aref searchSpace (fref -thr -> id)) (fref tsk numSearch))
+
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
 
   (%if* DEBUG-TIME (begin
     ;; open time file
@@ -1047,36 +1146,45 @@
   ;; show debug datas
   (csym::fprintf stderr "time = %f[sec]~%" (csym::elapsedTime tp (+ tp 1)))
   (csym::fprintf stderr "user time = %f[sec]~%" (- t2 t1))
-  (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
   (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
-  (csym::fprintf stderr "# of thresholds = %llu~%" (fref tsk numThreshold))
-  (csym::fprintf stderr "# of prunings = %u~%" (fref tsk numPruning))
-  (csym::fprintf stderr "Avg. tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
+  (csym::fprintf stderr "Avg. size of tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
   (%if* DEBUG-RSLT (begin
     (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
     (csym::fprintf stderr "Avg. size of subgraph = %f~%" (/ (cast double avgSizeSubgraph) (cast double (fref tsk numSubgraph))))))
 
   (csym::fprintf stderr "~%# of searches & task-requests~%")
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
-    (csym::fprintf stderr " ID:%d, %llu, %d~%" j (aref searchSpace j) (aref taskRequest j))
+    (= (aref searchSpace j) (+ (+ (aref visit2Vertices j) (aref thresholdPruning j)) (
+aref inclusivePruning j)))
+    (csym::fprintf stderr " ID:%d, %llu(%llu, %llu, %llu), %d, %llu~%" j (aref searchSpace j) (aref visit2Vertices j) (aref thresholdPruning j) (aref inclusivePruning j) (aref taskRequest j) (aref tableReference j))
     (+= numSearch (aref searchSpace j))
+    (if (< maxWorkerSearch (aref searchSpace j))
+      (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
     (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
-    (+= numTaskRequest (aref taskRequest j)))
+    (+= numTaskRequest (aref taskRequest j))
+    (+= numTableReference (aref tableReference j)))
   (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
   (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
   (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
+  (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
 
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
     (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
     (+= workerSearchPerSecSD (csym::pow (- (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec) 2.0))
-    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0)))
+    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
   (/= workerSearchSD (fref option num-thrs))
   (/= workerSearchPerSecSD (fref option num-thrs))
   (/= taskRequestSD (fref option num-thrs))
+  (/= tableReferenceSD (fref option num-thrs))
   (= workerSearchSD (csym::sqrt workerSearchSD))
   (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
   (= taskRequestSD (csym::sqrt taskRequestSD))
+  (= tableReferenceSD (csym::sqrt tableReferenceSD))
 
-  (csym::fprintf stderr "# of searches = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch avgWorkerSearch workerSearchSD)
-  (csym::fprintf stderr "# of task requests = %d, Avg. = %.2f, S.D. = %.2f~%" numTaskRequest avgTaskRequest taskRequestSD)
-  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD))
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
+  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
+  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD))
diff --git a/src/sample/tcell/copine3.tcell b/src/sample/tcell/copine3.tcell
index 9e1f2088..869a4ca0 100644
--- a/src/sample/tcell/copine3.tcell
+++ b/src/sample/tcell/copine3.tcell
@@ -43,9 +43,10 @@
 (c-exp "#include <stdint.h>")
 ;(c-exp "#include <pthread.h>")
 (c-exp "#include <inttypes.h>")
+(c-exp "#include <execinfo.h>")
 (c-exp "#include <sys/time.h>")
 (c-exp "#include <sys/resource.h>")
-(c-exp "#include <nmmintrin.h>")
+;(c-exp "#include <nmmintrin.h>")
 
 (c-exp "#define  __USE_GNU")
 (c-exp "#include <search.h>")
@@ -66,15 +67,15 @@
 (%defconstant USE-SSE 0)
 
 ;;; Max # of workers
-(%defconstant NUM-WORKERS 16)
+(%defconstant NUM-WORKERS 68)
 
 ;;; Constants
-(%defconstant E-SIZE 500000)  ; # of edges
-(%defconstant V-SIZE 25000)   ; # of vertices
-(%defconstant BIT-LEN 64)     ; bit length of bitset
-(%defconstant BIT-ITEM 3)     ; # of items = BIT-ITEM * BIT-LEN
-(%defconstant BIT-EDGE 8125)  ; # of edges = BIT-EDGE * BIT-LEN
-(%defconstant BIT-VERTEX 625) ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant E-SIZE 500000)               ; # of edges
+(%defconstant V-SIZE 15500)                ; # of vertices
+(%defconstant BIT-LEN 64)                  ; bit length of bitset
+(%defconstant BIT-ITEM 3)                  ; # of items = BIT-ITEM * BIT-LEN
+(%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
+(%defconstant BIT-VERTEX 625)              ; # of vertices = BIT-VERTEX * BIT-LEN
 (%defconstant I-SIZE (* BIT-LEN BIT-ITEM)) ; 
 
 ;;; Debug Flags
@@ -85,11 +86,12 @@
 (%defconstant DEBUG-TIME 0) ; flag to output time file
 (%defconstant DEBUG-LOCK 0) ; flag to output lock file
 (%defconstant DEBUG-COPY 0) ; flag to output copy file
+(%defconstant DEBUG-ENTY 0) ; flag to output table entry file
 
 ;;; Typedef
-(deftype set uint64_t)     ; bitset
-(deftype vtx uint32_t)     ; vertex
-(deftype task-id uint64_t) ; task ID
+(deftype set uint64_t)        ; bitset
+(deftype vtx uint32_t)        ; vertex
+(deftype task-id __uint128_t) ; task ID
 
 ;;; Structure of ITnode
 (def (struct --ITnode)
@@ -134,6 +136,10 @@
 (decl vItem (array (array set BIT-ITEM) V-SIZE)) ; itemset ("i-th bit ==1" means the vertex has the item 'i')
 (decl vNumItems (array int V-SIZE))              ; # of items the vertex has
 
+;;; Input File
+(%defconstant P-FILE "data/symatlas_pattern.txt")
+(%defconstant G-FILE "data/symatlas_graph.txt")
+
 ;;; Global Variables
 (decl th int) ; threshold of common itemset size
 (decl spawnSize int)
@@ -143,6 +149,9 @@
 (decl fpTask (ptr FILE))
 (decl fpLock (ptr FILE))
 (decl fpCopy (ptr FILE))
+(decl fpEnty (ptr FILE))
+(def timeTableReference (volatile double) 0.0)
+(def timeMutexLocked (volatile double) 0.0)
 
 ;;; Worker Data
 (decl searchSpace (array uint64_t NUM-WORKERS))
@@ -152,6 +161,8 @@
 (decl taskRequest (array int NUM-WORKERS))
 (decl seqTaskRequest (array int NUM-WORKERS))
 (decl tableReference (array uint64_t NUM-WORKERS))
+(decl tableMutexTrylock (array uint64_t NUM-WORKERS))
+(decl tableMutexLocked (array uint64_t NUM-WORKERS))
 
 ;;; Item Table
 (def vItemTable (ptr ITlist))
@@ -373,15 +384,11 @@
   (def numMutexLocked uint64_t))
 
 ;;;Function: initExploreCCIG - 
-(def (initExploreCCIG traversed itemTable C T pTsk) (fn void int (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+(def (initExploreCCIG traversed itemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
   (decl i int)
 
   ;; initialize vTraversed
-  (if (== traversed 0)
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int)))))
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::malloc (* V-SIZE (sizeof int)))))))
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
 
   ;; initialize vItemTable
   ;(if (== itemTable NULL)
@@ -399,7 +406,7 @@
 
   ;; initialize T
   (= (fref pTsk -> numT) 0)
-  (= (fref pTsk -> sizeOfT) 100)
+  (= (fref pTsk -> sizeOfT) 1000)
   (= (fref pTsk -> T) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))
 
   ;; init subgraph
@@ -417,7 +424,7 @@
   (= (fref pTsk -> numMutexLocked) 0))
 
 ;;; Function: exploreCCIG2 - create a common-itemset tree with recursive call
-(def (exploreCCIG2 minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+(def (exploreCCIG2 minC maxC v itemSet pTsk) (wfn void int int int (ptr set) (ptr (struct T-exploreCCIG)))
   (defs int i j k l m)                   ; temporary variable
   (def cc int 0)                         ; # of newly added candidates
   (decl vv int)                          ; vertex whice is searched next time
@@ -429,6 +436,7 @@
   (decl ITptr (ptr ITnode))              ; pointer to the ITnode
   (decl locked int)                      ; 
   (decl tp (array (struct timeval) 2))   ;
+  (decl tempTableReference uint64_t)     ; 
 
   ;; DFS
   (for ((= i minC) (< i maxC) (inc i))
@@ -437,13 +445,12 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        ;(inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
           ;(+= commonNum (csym::countBits32 (aref commonItem k)))
           (+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
           ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
@@ -457,21 +464,31 @@
 
             ;; check that common-itemset is subset of item table
             (%if* DEBUG-LOCK (begin
-              (= locked 0)))
+              (= locked 0)
+              (csym::gettimeofday tp 0)
+              ))
             (inc (fref pTsk -> numMutexTrylock))
             (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
               (begin
                 (inc (fref pTsk -> numMutexLocked))
                 (%if* DEBUG-LOCK (begin
                   (= locked 1)
-                  (csym::gettimeofday tp 0)))
+                  ;(csym::gettimeofday tp 0)
+                  ))
                 (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
             (%if* DEBUG-LOCK (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
               (if locked
                 (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                  ;(csym::gettimeofday (+ tp 1) 0)
+                  ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                  ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+                  ))))
             (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+            (%if* DEBUG-ENTY (begin
+              (= tempTableReference (fref pTsk -> numTableReference))
+              (csym::gettimeofday tp 0)))
             (while (!= ITptr (fref (aref vItemTable vv) head))
               (inc (fref pTsk -> numTableReference))
               (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
@@ -484,7 +501,12 @@
                       (= pruning 1)
                       (break)))))
               (= ITptr (fref ITptr -> next)))
-            (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+            (%if* DEBUG-ENTY (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+              ;(csym::fprintf fpEnty "%f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (- (fref pTsk -> numTableReference) tempTableReference))
+              ))
+            ;(csym::pthread_mutex_unlock (ptr (aref mutex vv)))
 
             ;; if common-itemset is not subset of item table, then
             (if (not pruning)
@@ -492,22 +514,32 @@
                 (inc (fref pTsk -> numTraversed))
                 (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
 
-                (%if* DEBUG-LOCK (begin
-                  (= locked 0)))
-                (inc (fref pTsk -> numMutexTrylock))
-                (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
-                  (begin
-                    (inc (fref pTsk -> numMutexLocked))
-                    (%if* DEBUG-LOCK (begin
-                      (= locked 1)
-                      (csym::gettimeofday tp 0)))
-                    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
-                (%if* DEBUG-LOCK (begin
-                  (if locked
-                    (begin
-                      (csym::gettimeofday (+ tp 1) 0)
-                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (= locked 0)
+                ;  (csym::gettimeofday tp 0)
+                ;  ))
+                ;(inc (fref pTsk -> numMutexTrylock))
+                ;(if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+                ;  (begin
+                ;    (inc (fref pTsk -> numMutexLocked))
+                ;    (%if* DEBUG-LOCK (begin
+                ;      (= locked 1)
+                ;      ;(csym::gettimeofday tp 0)
+                ;      ))
+                ;    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (csym::gettimeofday (+ tp 1) 0)
+                ;  (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                ;  (if locked
+                ;    (begin
+                ;      ;(csym::gettimeofday (+ tp 1) 0)
+                ;      ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                ;      ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+                ;      ))))
                 (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+                (%if* DEBUG-ENTY (begin
+                  (= tempTableReference (fref pTsk -> numTableReference))
+                  (csym::gettimeofday tp 0)))
                 (while (!= ITptr (fref (aref vItemTable vv) head))
                   (inc (fref pTsk -> numTableReference))
                   (if (>= (fref ITptr -> minID) (fref pTsk -> minID))
@@ -521,6 +553,11 @@
                     (begin
                       (= ITptr (fref ITptr -> next)))))
                 (csym::insertITnodeAfter (ptr (aref vItemTable vv)) (fref (aref vItemTable vv) head) (fref pTsk -> minID) (fref pTsk -> maxID) commonItem)
+                (%if* DEBUG-ENTY (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+                  ;(csym::fprintf fpEnty "%f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (- (fref pTsk -> numTableReference) tempTableReference))
+                  ))
                 (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
 
                 (inc (fref pTsk -> numSearch))
@@ -562,6 +599,7 @@
                 (-= (fref pTsk -> numC) cc)
                 (dec (fref pTsk -> numT)))
               (begin
+                (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
                 (inc (fref pTsk -> numPruning))
                 (%if* DEBUG-SHOW (begin
                   (begin
@@ -586,7 +624,7 @@
       (inc (fref pTsk -> numSubgraph)))))
 
 ;;; Function: exploreCCIG - create a common-itemset tree with recursive call
-(def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+(def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (ptr set) (ptr (struct T-exploreCCIG)))
   (defs int i j k l m)                   ; temporary variable
   (def cc int 0)                         ; # of newly added candidates
   (decl vv int)                          ; vertex whice is searched next time
@@ -599,6 +637,7 @@
   (decl locked int)                      ; 
   (decl tp (array (struct timeval) 2))   ;
   (decl tpc (array (struct timeval) 4))  ;
+  (decl tempTableReference uint64_t)     ; 
 
   ;; DFS
   (do-many for i from minC to maxC
@@ -607,13 +646,12 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        ;(inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
           ;(+= commonNum (csym::countBits32 (aref commonItem k)))
           (+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
           ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
@@ -627,21 +665,31 @@
 
             ;; check that common-itemset is subset of item table
             (%if* DEBUG-LOCK (begin
-              (= locked 0)))
+              (= locked 0)
+              (csym::gettimeofday tp 0)
+              ))
             (inc (fref pTsk -> numMutexTrylock))
             (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
               (begin
                 (inc (fref pTsk -> numMutexLocked))
                 (%if* DEBUG-LOCK (begin
                   (= locked 1)
-                  (csym::gettimeofday tp 0)))
+                  ;(csym::gettimeofday tp 0)
+                  ))
                 (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
             (%if* DEBUG-LOCK (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
               (if locked
                 (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                  ;(csym::gettimeofday (+ tp 1) 0)
+                  ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                  ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+                  ))))
             (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+            (%if* DEBUG-ENTY (begin
+              (= tempTableReference (fref pTsk -> numTableReference))
+              (csym::gettimeofday tp 0)))
             (while (!= ITptr (fref (aref vItemTable vv) head))
               (inc (fref pTsk -> numTableReference))
               (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
@@ -654,7 +702,12 @@
                       (= pruning 1)
                       (break)))))
               (= ITptr (fref ITptr -> next)))
-            (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+            (%if* DEBUG-ENTY (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+              ;(csym::fprintf fpEnty "%f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (- (fref pTsk -> numTableReference) tempTableReference))
+              ))
+            ;(csym::pthread_mutex_unlock (ptr (aref mutex vv)))
 
             ;; if common-itemset is not subset of item table, then
             (if (not pruning)
@@ -662,22 +715,32 @@
                 (inc (fref pTsk -> numTraversed))
                 (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
 
-                (%if* DEBUG-LOCK (begin
-                  (= locked 0)))
-                (inc (fref pTsk -> numMutexTrylock))
-                (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
-                  (begin
-                    (inc (fref pTsk -> numMutexLocked))
-                    (%if* DEBUG-LOCK (begin
-                      (= locked 1)
-                      (csym::gettimeofday tp 0)))
-                    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
-                (%if* DEBUG-LOCK (begin
-                  (if locked
-                    (begin
-                      (csym::gettimeofday (+ tp 1) 0)
-                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (= locked 0)
+                ;  (csym::gettimeofday tp 0)
+                ;  ))
+                ;(inc (fref pTsk -> numMutexTrylock))
+                ;(if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+                ;  (begin
+                ;    (inc (fref pTsk -> numMutexLocked))
+                ;    (%if* DEBUG-LOCK (begin
+                ;      (= locked 1)
+                ;      ;(csym::gettimeofday tp 0)
+                ;      ))
+                ;    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (csym::gettimeofday (+ tp 1) 0)
+                ;  (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                ;  (if locked
+                ;    (begin
+                ;      ;(csym::gettimeofday (+ tp 1) 0)
+                ;      ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+                ;      ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+                ;      ))))
                 (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+                (%if* DEBUG-ENTY (begin
+                  (= tempTableReference (fref pTsk -> numTableReference))
+                  (csym::gettimeofday tp 0)))
                 (while (!= ITptr (fref (aref vItemTable vv) head))
                   (inc (fref pTsk -> numTableReference))
                   (if (>= (fref ITptr -> minID) (fref pTsk -> minID))
@@ -691,6 +754,11 @@
                     (begin
                       (= ITptr (fref ITptr -> next)))))
                 (csym::insertITnodeAfter (ptr (aref vItemTable vv)) (fref (aref vItemTable vv) head) (fref pTsk -> minID) (fref pTsk -> maxID) commonItem)
+                (%if* DEBUG-ENTY (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+                  ;(csym::fprintf fpEnty "%f, %llu~%" (csym::elapsedTime tp (+ tp 1)) (- (fref pTsk -> numTableReference) tempTableReference))
+                  ))
                 (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
 
                 (inc (fref pTsk -> numSearch))
@@ -719,7 +787,7 @@
                     (+= (fref pTsk -> numC) cc)
                     (inc (fref pTsk -> numT))
 
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (inc (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1))))))))
@@ -731,9 +799,14 @@
                         (csym::fprintf stderr "> %d~%" (aref (fref pTsk -> T) (- (fref pTsk -> numT) 1))))))
 
                     ;; recursive call
-                    (if (> (- (fref pTsk -> maxID) (fref pTsk -> minID)) (fref pTsk -> numC))
-                      (begin
-                        (exploreCCIG 0 (fref pTsk -> numC) vv commonItem pTsk))
+                    (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
+                      (begin 
+                        (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (fref option num-thrs))
+                          (begin
+                            (exploreCCIG 0 (fref pTsk -> numC) vv commonItem pTsk))
+                          (begin
+                            (inc (aref seqTaskRequest (fref -thr -> id)))
+                            (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk))))
                       (begin
                         (inc (aref seqTaskRequest (fref -thr -> id)))
                         (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk)))
@@ -741,7 +814,7 @@
                     (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
                       (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))
                   (:after
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))))
@@ -749,6 +822,7 @@
                     (-= (fref pTsk -> numC) cc)
                     (dec (fref pTsk -> numT)))))
               (begin
+                (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
                 (inc (fref pTsk -> numPruning))
                 (%if* DEBUG-SHOW (begin
                   (begin
@@ -777,8 +851,8 @@
         (= (fref this maxC) i2)
         (= (fref this maxID) (fref pTsk -> maxID))
         (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
-        (= (fref this minID) (fref pTsk -> maxID))
-        (initExploreCCIG 1 NULL NULL NULL (ptr this))
+        (= (fref this minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
         (= (fref this v) v)
         (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
         (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
@@ -793,17 +867,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
-        (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref this treeDepth))
-        (+= (fref pTsk -> numMutexTrylock) (fref this numMutexTrylock))
-        (+= (fref pTsk -> numMutexLocked) (fref this numMutexLocked))
         (+= (fref pTsk -> numTraversed) (fref this numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
-        ;(+= (fref pTsk -> numThreshold) (fref this numThreshold))
-        ;(+= (fref pTsk -> numPruning) (fref this numPruning))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 3) 0)
           (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
@@ -824,10 +895,16 @@
   (if (> (fref this minID) (fref this maxID))
     (csym::fprintf stderr "minID = %llu, maxID = %llu~%" (fref this minID) (fref this maxID)))
   (csym::gettimeofday tp 0)
-  (if (> (- (fref this maxID) (fref this minID)) (- (fref this maxC) (fref this minC)))
+  (if (!= (fref this minID) (fref this maxID))
     (begin
-      (= seq 0)
-      (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))
+      (if (>= (cast int (csym::log2 (cast double (- (fref this maxID) (fref this minID))))) (fref option num-thrs))
+        (begin
+          (= seq 0)
+          (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (exploreCCIG2 (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))))
     (begin
       (= seq 1)
       (inc (aref seqTaskRequest (fref -thr -> id)))
@@ -837,6 +914,8 @@
   (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref this numMutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref this numMutexLocked))
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) seq (fref -thr -> id))))
   (csym::free (fref this vTraversed))
@@ -851,11 +930,11 @@
 
 ;;; Function: enumCCIG2 - enumerate CCIG 
 (def (enumCCIG2 minVertex maxVertex pTsk) (wfn void int int (ptr (struct T-exploreCCIG)))
-  (defs int i j k)          ; temporary variable
-  (decl visiting int)       ; flag to search
-  (decl ITptr (ptr ITnode)) ; 
-  (decl locked int) 
-  (decl tp (array (struct timeval) 2))
+  (defs int i j k)                     ; temporary variable
+  (decl visiting int)                  ; flag to search
+  (decl ITptr (ptr ITnode))            ; 
+  (decl locked int)                    ; 
+  (decl tp (array (struct timeval) 2)) ; 
 
   (for ((= i minVertex) (< i maxVertex) (inc i))
     (%if* DEBUG-TIME (begin
@@ -870,21 +949,30 @@
 
         ;; check that itemset of 'i' is subset of itemset-table
         (%if* DEBUG-LOCK (begin
-          (= locked 0)))
+          (= locked 0)
+          (csym::gettimeofday tp 0)
+          ))
         (inc (fref pTsk -> numMutexTrylock))
         (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
           (begin
             (inc (fref pTsk -> numMutexLocked))
             (%if* DEBUG-LOCK (begin
               (= locked 1)
-              (csym::gettimeofday tp 0)))
+              ;(csym::gettimeofday tp 0)
+              ))
             (csym::pthread_mutex_lock (ptr (aref mutex i)))))
         (%if* DEBUG-LOCK (begin
+          (csym::gettimeofday (+ tp 1) 0)
+          (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
           (if locked
             (begin
-              (csym::gettimeofday (+ tp 1) 0)
-              (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+              ;(csym::gettimeofday (+ tp 1) 0)
+              ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+              ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+              ))))
         (= ITptr (fref (fref (aref vItemTable i) head) -> next))
+        (%if* DEBUG-ENTY (begin
+          (csym::gettimeofday tp 0)))
         (inc (fref pTsk -> numTableReference))
         (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
           (begin
@@ -895,7 +983,12 @@
                   (break)))))
           (begin
             (= visiting 1)))
-        (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+        (%if* DEBUG-ENTY (begin
+          (csym::gettimeofday (+ tp 1) 0)
+          (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+          ;(csym::fprintf fpEnty "%f, 1~%" (csym::elapsedTime tp (+ tp 1)))
+          ))
+        ;(csym::pthread_mutex_unlock (ptr (aref mutex i)))
 
         ;; if search the CCIG whose starting point is 'i', then
         (if visiting
@@ -903,21 +996,28 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "+++ Allons-y! +++~%")))
 
-            (%if* DEBUG-LOCK (begin
-              (= locked 0)))
-            (inc (fref pTsk -> numMutexTrylock))
-            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
-              (begin
-                (inc (fref pTsk -> numMutexLocked))
-                (%if* DEBUG-LOCK (begin
-                  (= locked 1)
-                  (csym::gettimeofday tp 0)))
-                (csym::pthread_mutex_lock (ptr (aref mutex i)))))
-            (%if* DEBUG-LOCK (begin
-              (if locked
-                (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (= locked 0)
+            ;  (csym::gettimeofday tp 0)
+            ;  ))
+            ;(inc (fref pTsk -> numMutexTrylock))
+            ;(if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+            ;  (begin
+            ;    (inc (fref pTsk -> numMutexLocked))
+            ;    (%if* DEBUG-LOCK (begin
+            ;      (= locked 1)
+            ;      ;(csym::gettimeofday tp 0)
+            ;      ))
+            ;    (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (csym::gettimeofday (+ tp 1) 0)
+            ;  (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+            ;  (if locked
+            ;    (begin
+            ;      ;(csym::gettimeofday (+ tp 1) 0)
+            ;      ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+            ;      ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+            ;      ))))
             (csym::clearITlist (ptr (aref vItemTable i)))
             (csym::insertITnodeAfter (ptr (aref vItemTable i)) (fref (aref vItemTable i) head) (fref pTsk -> minID) (fref pTsk -> maxID) (aref vItem i))
             (csym::pthread_mutex_unlock (ptr (aref mutex i)))
@@ -946,6 +1046,7 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "~%"))))
           (begin
+            (csym::pthread_mutex_unlock (ptr (aref mutex i)))
             (inc (fref pTsk -> numPruning))
 
             (%if* DEBUG-SHOW (begin
@@ -957,12 +1058,12 @@
 
 ;;; Function: enumCCIG - enumerate CCIG
 (def (enumCCIG minVertex maxVertex pTsk) (wfn void int int (ptr (struct T-exploreCCIG)))
-  (defs int i j k)          ; temporary variable
-  (decl visiting int)       ; flag to search
-  (decl ITptr (ptr ITnode)) ; 
-  (decl locked int) 
-  (decl tp (array (struct timeval) 2))
-  (decl tpc (array (struct timeval) 4))
+  (defs int i j k)                      ; temporary variable
+  (decl visiting int)                   ; flag to search
+  (decl ITptr (ptr ITnode))             ; 
+  (decl locked int)                     ; 
+  (decl tp (array (struct timeval) 2))  ; 
+  (decl tpc (array (struct timeval) 4)) ; 
 
   (do-many for i from minVertex to maxVertex
     (%if* DEBUG-TIME (begin
@@ -977,21 +1078,30 @@
 
         ;; check that itemset of 'i' is subset of itemset-table
         (%if* DEBUG-LOCK (begin
-          (= locked 0)))
+          (= locked 0)
+          (csym::gettimeofday tp 0)
+          ))
         (inc (fref pTsk -> numMutexTrylock))
         (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
           (begin
             (inc (fref pTsk -> numMutexLocked))
             (%if* DEBUG-LOCK (begin
               (= locked 1)
-              (csym::gettimeofday tp 0)))
+              ;(csym::gettimeofday tp 0)
+              ))
             (csym::pthread_mutex_lock (ptr (aref mutex i)))))
         (%if* DEBUG-LOCK (begin
+          (csym::gettimeofday (+ tp 1) 0)
+          (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
           (if locked
             (begin
-              (csym::gettimeofday (+ tp 1) 0)
-              (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+              ;(csym::gettimeofday (+ tp 1) 0)
+              ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+              ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+              ))))
         (= ITptr (fref (fref (aref vItemTable i) head) -> next))
+        (%if* DEBUG-ENTY (begin
+          (csym::gettimeofday tp 0)))
         (inc (fref pTsk -> numTableReference))
         (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
           (begin
@@ -1002,7 +1112,12 @@
                   (break)))))
           (begin
             (= visiting 1)))
-        (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+        (%if* DEBUG-ENTY (begin
+          (csym::gettimeofday (+ tp 1) 0)
+          (+= timeTableReference (csym::elapsedTime tp (+ tp 1)))
+          ;(csym::fprintf fpEnty "%f, 1~%" (csym::elapsedTime tp (+ tp 1)))
+          ))
+        ;(csym::pthread_mutex_unlock (ptr (aref mutex i)))
 
         ;; if search the CCIG whose starting point is 'i', then
         (if visiting
@@ -1010,21 +1125,28 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "+++ Allons-y! +++~%")))
 
-            (%if* DEBUG-LOCK (begin
-              (= locked 0)))
-            (inc (fref pTsk -> numMutexTrylock))
-            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
-              (begin
-                (inc (fref pTsk -> numMutexLocked))
-                (%if* DEBUG-LOCK (begin
-                  (= locked 1)
-                  (csym::gettimeofday tp 0)))
-                (csym::pthread_mutex_lock (ptr (aref mutex i)))))
-            (%if* DEBUG-LOCK (begin
-              (if locked
-                (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (= locked 0)
+            ;  (csym::gettimeofday tp 0)
+            ;  ))
+            ;(inc (fref pTsk -> numMutexTrylock))
+            ;(if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+            ;  (begin
+            ;    (inc (fref pTsk -> numMutexLocked))
+            ;    (%if* DEBUG-LOCK (begin
+            ;      (= locked 1)
+            ;      ;(csym::gettimeofday tp 0)
+            ;      ))
+            ;    (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (csym::gettimeofday (+ tp 1) 0)
+            ;  (+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+            ;  (if locked
+            ;    (begin
+            ;      ;(csym::gettimeofday (+ tp 1) 0)
+            ;      ;(+= timeMutexLocked (csym::elapsedTime tp (+ tp 1)))
+            ;      ;(csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)
+            ;      ))))
             (csym::clearITlist (ptr (aref vItemTable i)))
             (csym::insertITnodeAfter (ptr (aref vItemTable i)) (fref (aref vItemTable i) head) (fref pTsk -> minID) (fref pTsk -> maxID) (aref vItem i))
             (csym::pthread_mutex_unlock (ptr (aref mutex i)))
@@ -1042,9 +1164,14 @@
             (inc (fref pTsk -> treeDepth))
             (inc (fref pTsk -> numTraversed))
 
-            (if (> (- (fref pTsk -> maxID) (fref pTsk -> minID)) (fref pTsk -> numC))
+            (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
               (begin
-                (exploreCCIG 0 (fref pTsk -> numC) i (aref vItem i) pTsk))
+                (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (fref option num-thrs))
+                  (begin
+                    (exploreCCIG 0 (fref pTsk -> numC) i (aref vItem i) pTsk))
+                  (begin
+                    (inc (aref seqTaskRequest (fref -thr -> id)))
+                    (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk))))
               (begin
                 (inc (aref seqTaskRequest (fref -thr -> id)))
                 (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk)))
@@ -1058,6 +1185,7 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "~%"))))
           (begin
+            (csym::pthread_mutex_unlock (ptr (aref mutex i)))
             (inc (fref pTsk -> numPruning))
 
             (%if* DEBUG-SHOW (begin
@@ -1080,24 +1208,21 @@
         (= (fref this maxVertex) i2)
         (= (fref (fref this tsk) maxID) (fref pTsk -> maxID))
         (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
-        (= (fref (fref this tsk) minID) (fref pTsk -> maxID))
-        (initExploreCCIG 0 NULL NULL NULL (ptr (fref this tsk)))
+        (= (fref (fref this tsk) minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 1) 0))))
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
-        (+= (fref pTsk -> numMutexTrylock) (fref (fref this tsk) numMutexTrylock))
-        (+= (fref pTsk -> numMutexLocked) (fref (fref this tsk) numMutexLocked))
         (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
-        ;(+= (fref pTsk -> numThreshold) (fref (fref this tsk) numThreshold))
-        ;(+= (fref pTsk -> numPruning) (fref (fref this tsk) numPruning))
         (csym::free (fref (fref this tsk) vTraversed))
         (csym::free (fref (fref this tsk) C))
         (csym::free (fref (fref this tsk) T))
@@ -1111,10 +1236,16 @@
   (decl tp (array (struct timeval) 2))
   (inc (aref taskRequest (fref -thr -> id)))
   (csym::gettimeofday tp 0)
-  (if (> (- (fref (fref this tsk) maxID) (fref (fref this tsk) minID)) (- (fref this maxVertex) (fref this minVertex)))
+  (if (!= (fref (fref this tsk) minID) (fref (fref this tsk) maxID))
     (begin
-      (= seq 0)
-      (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))
+      (if (>= (cast int (csym::log2 (cast double (- (fref (fref this tsk) maxID) (fref (fref this tsk) minID))))) (fref option num-thrs))
+        (begin
+          (= seq 0)
+          (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (enumCCIG2 (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))))
     (begin
       (= seq 1)
       (inc (aref seqTaskRequest (fref -thr -> id)))
@@ -1124,6 +1255,8 @@
   (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref (fref this tsk) numMutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref (fref this tsk) numMutexLocked))
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) seq (fref -thr -> id)))))
 
@@ -1162,21 +1295,22 @@
             (= l k)))))))
 
 ;;; Function: loadPatternFile - load pattern file
-(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
-  (def i int 0)                   ; 
+(def (loadPatternFile maxNumItems eHash iHash) (fn void (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ;
   (decl n int)                    ; item number
   (decl v int)                    ; vertex number
-  (decl item (ptr char))          ; 
+  (def v0 int 1)                  ;
+  (decl item (ptr char))          ;
   (decl buff (array char 256))    ; buffer
   (decl temp (array char 256))    ;
   (decl he (struct entry))        ;
-  (decl hep (ptr (struct entry))) ; 
+  (decl hep (ptr (struct entry))) ;
   (decl fp (ptr FILE))            ; file pointer
 
   ;; open pattern file
-  (if (== (= fp (csym::fopen patternFile "r")) NULL)
+  (if (== (= fp (csym::fopen P-FILE "r")) NULL)
     (begin
-      (csym::fprintf stderr "Cannot open pattern file: %s~%" patternFile)
+      (csym::fprintf stderr "Cannot open pattern file: %s~%" P-FILE)
       (exit EXIT-FAILURE)))
 
   ;; read a line of data from pattern file
@@ -1186,16 +1320,18 @@
       (begin
         (= v (csym::atoi (csym::strtok buff "~|11|")))
 
-        ;; find v from eHash
+        ;; enter v to eHash
         (csym::sprintf temp "%d" v)
         (= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (continue))
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v0)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
         (= v (cast int (fref hep -> data)))
 
         ;; add item to Vertex Data
-        (while (!= (= item (csym::strtok NULL ",")) NULL)
+	(while (!= (= item (csym::strtok NULL ",")) NULL)
           (= n (csym::atoi item))
 
           ;; enter n to iHash
@@ -1263,21 +1399,21 @@
   (inc (aref vDegree v1)))
 
 ;;; Function: loadGraphFile - load graph file
-(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
-  (def v int 1)                   ; 
+(def (loadGraphFile edgeMax minVertex maxVertex eHash) (fn void (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ;
   (defs int v1 v2)                ; starting point, ending point
   (decl eLabel (ptr char))        ; label of edge
-  (decl empty (ptr char))         ; 
+  (decl empty (ptr char))         ;
   (decl buff (array char 256))    ; buffer
   (decl temp (array char 256))    ;
   (decl he (struct entry))        ;
-  (decl hep (ptr (struct entry))) ; 
+  (decl hep (ptr (struct entry))) ;
   (decl fp (ptr FILE))            ; file pointer
 
   ;; open graph file
-  (if (== (= fp (csym::fopen graphFile "r")) NULL)
+  (if (== (= fp (csym::fopen G-FILE "r")) NULL)
     (begin
-      (csym::fprintf stderr "Cannot open graph file: %s~%" graphFile)
+      (csym::fprintf stderr "Cannot open graph file: %s~%" G-FILE)
       (exit EXIT-FAILURE)))
 
   ;; read a line of data from graph file
@@ -1290,32 +1426,29 @@
         (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
         (= empty (csym::strtok NULL "~|11|"))
 
-        ;; enter v1 to eHash
+        ;; find v1 from eHash
         (csym::sprintf temp "%d" v1)
-        (= (fref he key) temp)
+	(= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (begin
-            (= (fref he data) (cast (ptr void) (inc v)))
-            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+          (continue))
         (= v1 (cast int (fref hep -> data)))
 
-        ;; enter v2 to eHash
+	;; find v2 from eHash
         (csym::sprintf temp "%d" v2)
         (= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (begin
-            (= (fref he data) (cast (ptr void) (inc v)))
-            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+          (continue))
         (= v2 (cast int (fref hep -> data)))
 
         ;; add edge to Edge List
         (if (== empty NULL)
           (if (!= v1 v2)
-            (begin
-              (createEdge v1 v2 edgeMax minVertex maxVertex)
-              (createEdge v2 v1 edgeMax minVertex maxVertex)))))))
+            (if (and (< th (aref vNumItems v1)) (< th (aref vNumItems v2)))
+              (begin
+	                    (createEdge v1 v2 edgeMax minVertex maxVertex)
+                (createEdge v2 v1 edgeMax minVertex maxVertex))))))))
 
   ;; close graph file
   (csym::fclose fp))
@@ -1354,7 +1487,9 @@
     (= (aref inclusivePruning i) 0)
     (= (aref taskRequest i) 0)
     (= (aref seqTaskRequest i) 0)
-    (= (aref tableReference i) 0))
+    (= (aref tableReference i) 0)
+    (= (aref tableMutexTrylock i) 0)
+    (= (aref tableMutexLocked i) 0))
 
   (for ((= i 0) (< i V-SIZE) (inc i))
     (= (aref doneID i) 0))
@@ -1377,15 +1512,12 @@
   (decl tp (array (struct timeval) 2)) ; start time, end time
   (defs double t1 t2)                  ; start user time, end user time
   (decl loopRange int)                 ; loop range of enumCCIG
-  (decl patternFile (ptr char))        ; name of pattern file
-  (decl graphFile (ptr char))          ; name of graph file
   (decl resultFile (ptr char))         ; name of result file
-  ;(decl patternFile (array char 128))
-  ;(decl graphFile (array char 128))
   (decl timeFile (array char 128))     ; name of time file
   (decl taskFile (array char 128))     ; name of task file
   (decl lockFile (array char 128))     ; name of lock file
   (decl copyFile (array char 128))     ; name of copy file
+  (decl entyFile (array char 128))     ; name of table entry file
   (decl ITptr (ptr ITnode))            ; pointer to the ITnode
   (defs (ptr FILE) fp fpt)             ; file pointer
 
@@ -1412,37 +1544,35 @@
   (defs (struct hsearch_data) eHash iHash)
 
   ;; Debug Data
-  (def numSearch uint64_t 0)             ; # of search space
-  (def maxWorkerSearch uint64_t 0)       ; 
-  (def avgWorkerSearch double 0.0)       ;  
-  (def workerSearchSD double 0.0)        ;
-  (def avgWorkerSearchPerSec double 0.0) ; 
-  (def workerSearchPerSecSD double 0.0)  ;
-  (def numTaskRequest int 0)             ; # of task request 
-  (def avgTaskRequest double 0.0)        ;
-  (def taskRequestSD double 0.0)         ;
-  (def numSeqTaskRequest int 0)          ; # of seq. task request
-  (def avgSeqTaskRequest double 0.0)     ;
-  (def seqTaskRequestSD double 0.0)      ;
-  (def numAllTaskRequest int 0)          ; # of all task request
-  (def avgAllTaskRequest double 0.0)     ;
-  (def allTaskRequestSD double 0.0)      ;
-  (def numTableReference uint64_t 0)     ; 
-  (def avgTableReference double 0.0)     ; 
-  (def tableReferenceSD double 0.0)      ; 
-  (def avgSizeSubgraph uint64_t 0)       ;
-  (def maxSizeSubgraph int 0)            ;
-
+  (def numSearch uint64_t 0)                      ; # of search space
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ;  
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task request 
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numSeqTaskRequest int 0)                   ; # of seq. task request
+  (def avgSeqTaskRequest double 0.0)              ; 
+  (def seqTaskRequestSD double 0.0)               ; 
+  (def numAllTaskRequest int 0)                   ; # of all task request
+  (def avgAllTaskRequest double 0.0)              ; 
+  (def allTaskRequestSD double 0.0)               ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ; 
+  (def numTableMutexTrylock uint64_t 0)           ; 
+  (def avgTableMutexTrylock double 0.0)           ; 
+  (def tableMutexTrylockSD double 0.0)            ; 
+  (def numTableMutexLocked uint64_t 0)            ; 
+  (def avgTableMutexLocked double 0.0)            ; 
+  (def tableMutexLockedSD double 0.0)             ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
 
   ;; arguments
-  (= patternFile "data/symatlas_pattern.txt")
-  (= graphFile "data/symatlas_graph.txt")
-  ;(= patternFile "data/dblp_author-of.tab")
-  ;(= graphFile "data/dblp_cites_network.tab")
-  ;(= patternFile "data/eg_pattern.txt")
-  ;(= graphFile "data/eg_graph.txt")
-  ;(= patternFile "data/eg2_pattern.txt")
-  ;(= graphFile "data/eg2_graph.txt")
   (= th (fref this th))
   (= spawnSize (fref this spawnSize))
   (= resultFile "result.txt")
@@ -1451,23 +1581,26 @@
       (csym::sprintf timeFile "time3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
       (csym::sprintf taskFile "task3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
       (csym::sprintf lockFile "lock3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-      (csym::sprintf copyFile "copy3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+      (csym::sprintf copyFile "copy3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf entyFile "enty3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
     (begin
       (if USE-SPN-RATIO
         (begin
           (csym::sprintf timeFile "time3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
           (csym::sprintf taskFile "task3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
           (csym::sprintf lockFile "lock3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-          (csym::sprintf copyFile "copy3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+          (csym::sprintf copyFile "copy3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf entyFile "enty3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
         (begin
           (csym::sprintf timeFile "time3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
           (csym::sprintf taskFile "task3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
           (csym::sprintf lockFile "lock3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
-          (csym::sprintf copyFile "copy3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
+          (csym::sprintf copyFile "copy3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf entyFile "enty3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
 
   ;; set ID
   (= (fref tsk minID) 0)
-  (= (fref tsk maxID) UINT-LEAST64-MAX)
+  (= (fref tsk maxID) -1)
 
   ;; init pthread
   ;(csym::pthread_attr_init (ptr attr))
@@ -1476,14 +1609,14 @@
   ;; initialize Edge Data & Vertex Data & Debug Data
   (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
-  ;; load graph file
-  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
-
   ;; load pattern file
-  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+  (loadPatternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+
+  ;; load graph file
+  (loadGraphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
 
   ;; delete the vertex whose # of items is less than the user-specified threshold
-  (thresholdItem minVertex maxVertex)
+  ;(thresholdItem minVertex maxVertex)
 
   ;; set the range of enumCCIG loop
   (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
@@ -1494,7 +1627,7 @@
   ;  (= (fref (aref data i) loopEnd) (* (/ (- maxVertex minVertex) (fref option num-thrs)) (+ i 1))))
 
   ;; init T-exploreCCIG
-  (initExploreCCIG 0 NULL NULL NULL (ptr tsk))
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
 
   ;; init mutex
   (for ((= i 0) (< i V-SIZE) (inc i))
@@ -1521,6 +1654,13 @@
         (csym::fprintf stderr "Cannot open copy file: %s~%" copyFile)
         (exit EXIT-FAILURE)))))
 
+  ;; open table entry file
+  (%if* DEBUG-ENTY (begin
+    (if (== (= fpEnty (csym::fopen entyFile "w")) NULL)
+      (begin
+        (csym::fprintf stderr "Cannot open table entry file: %s~%" entyFile)
+        (exit EXIT-FAILURE)))))
+
   ;; get start time of program
   (= t1 (csym::getrusageSec))
   (csym::gettimeofday (ptr t0) 0)
@@ -1531,7 +1671,7 @@
   (for ((< (+ i loopRange) maxVertex) (+= i loopRange))
     (enumCCIG i (+ i loopRange) (ptr tsk))
 
-    (for ((= k minVertex) (< k (+ maxVertex 1)) (inc k))
+    (for ((= k i) (< k (+ loopRange i)) (inc k))
       (= ITptr (fref (fref (aref vItemTable k) head) -> next))
       (while (!= ITptr (fref (aref vItemTable k) head))
         (= (fref ITptr -> minID) (cast task-id 0))
@@ -1540,7 +1680,7 @@
 
     ;; re-set ID
     (= (fref tsk minID) 0)
-    (= (fref tsk maxID) UINT-LEAST64-MAX))
+    (= (fref tsk maxID) -1))
   (enumCCIG i (+ maxVertex 1) (ptr tsk))
 
   ;(for ((= j 1) (< j (fref this loopRatio)) (inc j)) 
@@ -1586,14 +1726,21 @@
   (%if* DEBUG-COPY (begin
     (csym::fclose fpCopy)))
 
+  ;; close table entry file
+  (%if* DEBUG-ENTY (begin
+    (csym::fclose fpEnty)))
+
   ;; close task file
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, 0, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
     (csym::fclose fpTask)))
+
   (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
   (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref tsk numMutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref tsk numMutexLocked))
 
   (%if* DEBUG-TIME (begin
     ;; open time file
@@ -1673,8 +1820,6 @@
   (csym::fprintf stderr "time = %f[sec]~%" (csym::elapsedTime tp (+ tp 1)))
   (csym::fprintf stderr "user time = %f[sec]~%" (- t2 t1))
   (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
-  (csym::fprintf stderr "# of thresholds = %llu~%" (fref tsk numThreshold))
-  (csym::fprintf stderr "# of prunings = %u~%" (fref tsk numPruning))
   (csym::fprintf stderr "Avg. size of tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
   (%if* DEBUG-RSLT (begin
     (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
@@ -1688,18 +1833,24 @@ aref inclusivePruning j)))
     (+= numSearch (aref searchSpace j))
     (if (< maxWorkerSearch (aref searchSpace j))
       (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
     (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
     (+= numTaskRequest (aref taskRequest j))
     (+= numSeqTaskRequest (aref seqTaskRequest j))
     (+= numAllTaskRequest (aref taskRequest j))
     (+= numAllTaskRequest (aref seqTaskRequest j))
-    (+= numTableReference (aref tableReference j)))
+    (+= numTableReference (aref tableReference j))
+    (+= numTableMutexTrylock (aref tableMutexTrylock j))
+    (+= numTableMutexLocked (aref tableMutexLocked j)))
   (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
   (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
   (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
   (= avgSeqTaskRequest (/ (cast double numSeqTaskRequest) (cast double (fref option num-thrs))))
   (= avgAllTaskRequest (/ (cast double (+ numTaskRequest numSeqTaskRequest)) (cast double (fref option num-thrs))))
   (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
+  (= avgTableMutexTrylock (/ (cast double numTableMutexTrylock) (cast double (fref option num-thrs))))
+  (= avgTableMutexLocked (/ (cast double numTableMutexLocked) (cast double (fref option num-thrs))))
 
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
     (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
@@ -1707,25 +1858,31 @@ aref inclusivePruning j)))
     (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
     (+= seqTaskRequestSD (csym::pow (- (aref seqTaskRequest j) avgSeqTaskRequest) 2.0))
     (+= allTaskRequestSD (csym::pow (- (+ (aref taskRequest j) (aref seqTaskRequest j)) avgAllTaskRequest) 2.0))
-    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0))
+    (+= tableMutexTrylockSD (csym::pow (- (aref tableMutexTrylock j) avgTableMutexTrylock) 2.0))
+    (+= tableMutexLockedSD (csym::pow (- (aref tableMutexLocked j) avgTableMutexLocked) 2.0)))
   (/= workerSearchSD (fref option num-thrs))
   (/= workerSearchPerSecSD (fref option num-thrs))
   (/= taskRequestSD (fref option num-thrs))
   (/= seqTaskRequestSD (fref option num-thrs))
   (/= allTaskRequestSD (fref option num-thrs))
   (/= tableReferenceSD (fref option num-thrs))
+  (/= tableMutexTrylockSD (fref option num-thrs))
+  (/= tableMutexLockedSD (fref option num-thrs))
   (= workerSearchSD (csym::sqrt workerSearchSD))
   (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
   (= taskRequestSD (csym::sqrt taskRequestSD))
   (= seqTaskRequestSD (csym::sqrt seqTaskRequestSD))
   (= allTaskRequestSD (csym::sqrt allTaskRequestSD))
   (= tableReferenceSD (csym::sqrt tableReferenceSD))
+  (= tableMutexTrylockSD (csym::sqrt tableMutexTrylockSD))
+  (= tableMutexLockedSD (csym::sqrt tableMutexLockedSD))  
 
-  (csym::fprintf stderr "# of searches = %llu, Max = %d, Avg. = %.1f, S.D. = %.1f~%" numSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
   (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
   (csym::fprintf stderr "# of seq. task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numSeqTaskRequest avgSeqTaskRequest seqTaskRequestSD)
   (csym::fprintf stderr "# of all task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numAllTaskRequest avgAllTaskRequest allTaskRequestSD)
   (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
-  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD)
-  (csym::fprintf stderr "# of ITmutex trylock = %llu, " (fref tsk numMutexTrylock))
-  (csym::fprintf stderr "# of ITmutex locked = %llu(%.3f%%)~%" (fref tsk numMutexLocked) (* (/ (cast double (fref tsk numMutexLocked)) (cast double (fref tsk numMutexTrylock))) 100.0)))
\ No newline at end of file
+  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f, time: %f[s]~%" numTableReference avgTableReference tableReferenceSD timeTableReference)
+  (csym::fprintf stderr "# of ITmutex trylock = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableMutexTrylock avgTableMutexTrylock tableMutexTrylockSD)
+  (csym::fprintf stderr "# of ITmutex locked = %llu(%.3f%%, %f[s]), Avg. = %.1f, S.D. = %.1f~%" numTableMutexLocked (* (/ (cast double numTableMutexLocked) (cast double numTableMutexTrylock)) 100.0) timeMutexLocked avgTableMutexLocked tableMutexLockedSD))
\ No newline at end of file
diff --git a/src/sample/tcell/copine3d.tcell b/src/sample/tcell/copine3d.tcell
new file mode 100644
index 00000000..07a66855
--- /dev/null
+++ b/src/sample/tcell/copine3d.tcell
@@ -0,0 +1,1894 @@
+;;; Copyright (c) 2013 Shingo OKUNO <shingo@sys.i.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; copine3d.tcell
+
+;;; Extract all connected subgraphs, each of which shares a common itemset
+;;; whose size is not less than a given threshold, from a given graph
+;;; in which each vertex is associated to an itemset
+
+;; task 0 0 0 2
+;; <th>         ; threshold
+;; <it>         ; # of iterations left for a victim worker
+;; <dv>         ; # of divisions of the higher layer of the search tree
+
+
+(c-exp "#include <stdio.h>")
+(c-exp "#include <stdlib.h>")
+(c-exp "#include <math.h>")
+(c-exp "#include <time.h>")
+(c-exp "#include <limits.h>")
+(c-exp "#include <string.h>")
+(c-exp "#include <stdint.h>")
+;(c-exp "#include <pthread.h>")
+(c-exp "#include <inttypes.h>")
+(c-exp "#include <sys/time.h>")
+(c-exp "#include <sys/resource.h>")
+(c-exp "#include <nmmintrin.h>")
+
+(c-exp "#define  __USE_GNU")
+(c-exp "#include <search.h>")
+
+(%ifndef* NF-TYPE
+  (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
+(%include "rule/tcell-setrule.sh")
+
+(%include "clib.sh")
+(%include "dprint.sh")
+
+;;; Set # of iterations left for a victim worker
+;;; default: half of the unexecuted iterations
+(%defconstant USE-SPN-RANGE 1) ; set # directly
+(%defconstant USE-SPN-RATIO 0) ; set # by the ratio to the number of unexecuted iterations
+
+;;; Use "popcount (SSE4.2)"
+(%defconstant USE-SSE 0)
+
+;;; Max # of workers
+(%defconstant NUM-WORKERS 32)
+(%defconstant NUM-NODES 2)
+
+;;; Constants
+(%defconstant E-SIZE 500000)               ; # of edges
+(%defconstant V-SIZE 15500)                ; # of vertices
+(%defconstant BIT-LEN 64)                  ; bit length of bitset
+(%defconstant BIT-ITEM 3)                  ; # of items = BIT-ITEM * BIT-LEN
+(%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
+(%defconstant BIT-VERTEX 625)              ; # of vertices = BIT-VERTEX * BIT-LEN
+(%defconstant I-SIZE (* BIT-LEN BIT-ITEM)) ; 
+
+;;; Debug Flags
+(%defconstant DEBUG-DATA 0) ; flag to show some data
+(%defconstant DEBUG-RSLT 0) ; flag to output result file
+(%defconstant DEBUG-SHOW 0) ; flag to show traversal
+(%defconstant DEBUG-TASK 0) ; flag to show task request
+(%defconstant DEBUG-TIME 0) ; flag to output time file
+(%defconstant DEBUG-LOCK 0) ; flag to output lock file
+(%defconstant DEBUG-COPY 0) ; flag to output copy file
+
+;;; Typedef
+(deftype set uint64_t)        ; bitset
+(deftype vtx uint32_t)        ; vertex
+(deftype task-id uint64_t) ; task ID
+
+;;; Structure of ITnode
+(def (struct --ITnode)
+  (decl minID task-id)                 ; task ID
+  (decl maxID task-id)                 ; task ID
+  (decl item (array set BIT-ITEM))     ; itemset
+  (decl prev (ptr (struct --ITnode)))  ; pointer to the previous node
+  (decl next (ptr (struct --ITnode)))) ; pointer to the next node
+(deftype ITnode (struct --ITnode))
+
+;;; Structure of ITlist
+(deftype ITlist struct
+  (decl head (ptr ITnode))  ; pointer to the head node
+  (decl crnt (ptr ITnode))) ; pointer to the current node
+
+;;; Structure of Gnode
+(def (struct --Gnode)
+  (decl T (ptr vtx))                  ; vertices of CCIG
+  (decl numT int)                     ; element counts of T
+  (decl item (array set BIT-ITEM))    ; common itemset
+  (decl prev (ptr (struct --Gnode)))  ; pointer to the previsou node
+  (decl next (ptr (struct --Gnode)))) ; pointer to the next node
+(deftype Gnode (struct --Gnode))
+
+;;; Structure of Glist
+(deftype Glist struct
+  (decl head (ptr Gnode))  ; pointer to the head node
+  (decl crnt (ptr Gnode))) ; pointer to the current node
+
+;;; Structure of threadInfo
+(deftype threadInfo struct
+  (decl loopStart int)
+  (decl loopEnd int))
+
+;;; Edge Data
+(decl eTo (array int E-SIZE))   ; vertex that this edge points to
+(decl eNext (array int E-SIZE)) ; next edge (index for eTo)
+
+;;; Vertex Data
+(decl vDegree (array int V-SIZE))                ; # of edges from this vertex
+(decl vFirstEdge (array int V-SIZE))             ; first edge (index for eTo)
+(decl vItem (array (array set BIT-ITEM) V-SIZE)) ; itemset ("i-th bit ==1" means the vertex has the item 'i')
+(decl vNumItems (array int V-SIZE))              ; # of items the vertex has
+
+;;; Global Variables
+(decl th int) ; threshold of common itemset size
+(decl spawnSize int)
+(decl t0 (struct timeval))
+(decl t (array (array (struct timeval) 2) V-SIZE))
+(decl doneID  (array int V-SIZE))
+(decl fpTask (ptr FILE))
+(decl fpLock (ptr FILE))
+(decl fpCopy (ptr FILE))
+(def inited int 0)
+
+;;; Worker Data
+(decl searchSpace (array uint64_t NUM-WORKERS))
+(decl visit2Vertices (array uint64_t NUM-WORKERS))
+(decl thresholdPruning (array uint64_t NUM-WORKERS))
+(decl inclusivePruning (array uint64_t NUM-WORKERS))
+(decl taskRequest (array int NUM-WORKERS))
+(decl seqTaskRequest (array int NUM-WORKERS))
+(decl tableReference (array uint64_t NUM-WORKERS))
+
+;;; Item Table
+(def vItemTable (ptr ITlist))
+
+;;; Mutex
+(decl mutex (array pthread_mutex_t V-SIZE))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+;;; Function: getrusageSec - have the user time
+(def (csym::getrusageSec) (fn double void)
+  (decl t (struct rusage))
+  (decl tv (struct timeval))
+  (csym::getrusage RUSAGE-SELF (ptr t))
+  (= tv t.ru-utime)
+  (return (+ tv.tv-sec (* (cast double tv.tv-usec) 0.000001))))
+
+;;; Function: elapsedTime - have the time
+(def (csym::elapsedTime t1 t2) (fn double (ptr (struct timeval)) (ptr (struct timeval)))
+  (return (+ (- (fref t2 -> tv-sec) (fref t1 -> tv-sec)) (* 0.000001 (- (fref t2 -> tv-usec) (fref t1 -> tv-usec))))))
+
+;;; Function: countBits32 - count the number of "i-th bit == 1"
+(def (csym::countBits32 x) (fn int uint32_t)
+  (= x (+ (bit-and x #x55555555) (bit-and (>> x 1) #x55555555))) 
+  (= x (+ (bit-and x #x33333333) (bit-and (>> x 2) #x33333333))) 
+  (= x (+ (bit-and x #x0f0f0f0f) (bit-and (>> x 4) #x0f0f0f0f))) 
+  (= x (+ (bit-and x #x00ff00ff) (bit-and (>> x 8) #x00ff00ff))) 
+  (return (+ (bit-and x #x0000ffff) (bit-and (>> x 16) #x0000ffff))))
+
+;;; Function: countBits64 - count the number of "i-th bit == 1"
+(def (csym::countBits64 x) (fn int uint64_t)
+  (= x (+ (bit-and x (c-exp "0x5555555555555555UL")) (>> (bit-and x (c-exp "0xaaaaaaaaaaaaaaaaUL")) 1)))
+  (= x (+ (bit-and x (c-exp "0x3333333333333333UL")) (>> (bit-and x (c-exp "0xccccccccccccccccUL")) 2)))
+  (= x (+ (bit-and x (c-exp "0x0f0f0f0f0f0f0f0fUL")) (>> (bit-and x (c-exp "0xf0f0f0f0f0f0f0f0UL")) 4)))
+  (= x (+ (bit-and x (c-exp "0x00ff00ff00ff00ffUL")) (>> (bit-and x (c-exp "0xff00ff00ff00ff00UL")) 8)))
+  (= x (+ (bit-and x (c-exp "0x0000ffff0000ffffUL")) (>> (bit-and x (c-exp "0xffff0000ffff0000UL")) 16)))
+  (= x (+ (bit-and x (c-exp "0x00000000ffffffffUL")) (>> (bit-and x (c-exp "0xffffffff00000000UL")) 32)))
+  (return x))
+
+;;; Function: printBits - print a variable with set data type by binary representation
+(def (csym::printBits x) (fn void (const set))
+  (decl i int)
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
+  (for ((= i 0) (< i BIT-LEN) (inc i))
+    (if (bit-and x mask)
+      (csym::fprintf stderr "1")
+      (csym::fprintf stderr "0"))
+    (>>= mask 1)))
+
+;;; Function: fprintBits - write a variable with set data type by binary representation to stream
+(def (csym::fprintBits fp x) (fn void (ptr FILE) (const set))
+  (decl i int)
+  (def mask set (<< (cast set 1) (- BIT-LEN 1)))
+  (for ((= i 0) (< i BIT-LEN) (inc i))
+    (if (bit-and x mask)
+      (csym::fprintf fp "1")
+      (csym::fprintf fp "0"))
+    (>>= mask 1)))
+
+;;; Function: fprintDecimally - write a variable with set date type by decimal representation to stream
+(def (csym::fprintDecimally fp x k) (fn void (ptr FILE) (const set) int)
+  (decl i int)
+  (def mask set 1)
+  (for ((= i 0) (< i BIT-LEN) (inc i))
+    (if (bit-and x mask)
+      (csym::fprintf fp "%d " (+ i (* k BIT-LEN))))
+    (<<= mask 1)))
+
+;;; Function: resetTaskID - 
+(def (csym::resetTaskID param) (fn (ptr void) (ptr void))
+  (decl i int)
+  (def data (ptr threadInfo) (cast (ptr threadInfo) param))
+  (decl ITptr (ptr ITnode))    ; pointer to the ITnode
+
+  (for ((= i (fref data -> loopStart)) (< i (fref data -> loopEnd)) (inc i))
+    (= ITptr (fref (fref (aref vItemTable i) head) -> next))
+    (while (!= ITptr (fref (aref vItemTable i) head))
+      (= (fref ITptr -> minID) (cast task-id 0))
+      (= (fref ITptr -> maxID) (cast task-id 0))
+      (= ITptr (fref ITptr -> next))))
+
+  (csym::pthread_exit 0))
+
+;;; Function: allocITnode - allocate a ITnode
+(def (csym::allocITnode) (fn (ptr ITnode))
+  (return (cast (ptr ITnode) (csym::malloc(sizeof ITnode)))))
+
+;;; Function: isEmptyITlist - determine whether ITlist is empty
+(def (csym::isEmptyITlist list) (fn int (ptr ITlist))
+  (return (== (fref (fref list -> head) -> next) (fref list -> head))))
+
+;;; Function: initITlist - initialize ITlist
+(def (csym::initITlist list) (fn void (ptr ITlist))
+  (decl i int)
+  (def dummyNode (ptr ITnode) (csym::allocITnode))
+  (= (fref dummyNode -> minID) (cast task-id 0))
+  (= (fref dummyNode -> maxID) (cast task-id 0))
+  (for ((= i 0) (< i BIT-ITEM) (inc i))
+    (= (aref (fref dummyNode -> item) i) (cast set 0)))
+  (= (fref list -> crnt) dummyNode)
+  (= (fref list -> head) dummyNode)
+  (= (fref dummyNode -> next) dummyNode)
+  (= (fref dummyNode -> prev) dummyNode))
+
+;;; Function: insertITnodeAfter - insert a new ITnode after the pointer 'p'
+(def (csym::insertITnodeAfter list p minID maxID item) (fn void (ptr ITlist) (ptr ITnode) task-id task-id (array set))
+  (decl i int)
+  (def new (ptr ITnode) (csym::allocITnode))
+  (def nxt (ptr ITnode) (fref p -> next))
+  (= (fref (fref p -> next) -> prev) new)
+  (= (fref p -> next) new)
+  (= (fref new -> minID) minID)
+  (= (fref new -> maxID) maxID)
+  (for ((= i 0) (< i BIT-ITEM) (inc i))
+    (= (aref (fref new -> item) i) (aref item i)))
+  (= (fref new -> prev) p)
+  (= (fref new -> next) nxt)
+  (= (fref list -> crnt) new))
+
+;;; Function: removeITnode - remove ITnode
+(def (csym::removeITnode list p) (fn void (ptr ITlist) (ptr ITnode))
+  (= (fref (fref p -> prev) -> next) (fref p -> next))
+  (= (fref (fref p -> next) -> prev) (fref p -> prev))
+  (= (fref list -> crnt) (fref p -> prev))
+  (csym::free p))
+
+;;; Function: clearITlist - remove all ITnodes of ITlist
+(def (csym::clearITlist list) (fn void (ptr ITlist))
+  (while (not (csym::isEmptyITlist list))
+    (csym::removeITnode list (fref (fref list -> head) -> next))))
+
+;;; Function: termITlist - dispose of ITlist
+(def (csym::termITlist list) (fn void (ptr ITlist))
+  (while (not (csym::isEmptyITlist list))
+    (csym::removeITnode list (fref (fref list -> head) -> next)))
+  (csym::free (fref list -> head))
+  (= (fref list -> crnt) NULL)
+  (= (fref list -> head) NULL))
+
+;;; Function: allocGnode - allocate a Gnode
+(def (csym::allocGnode) (fn (ptr Gnode))
+  (return (cast (ptr Gnode) (csym::malloc(sizeof Gnode)))))
+
+;;; Function: isEmptyGlist - determine whether Glist is empty
+(def (csym::isEmptyGlist list) (fn int (ptr Glist))
+  (return (== (fref (fref list -> head) -> next) (fref list -> head))))
+
+;;; Function: initGlist - initialize Glist
+(def (csym::initGlist list) (fn void (ptr Glist))
+  (def dummyNode (ptr Gnode) (csym::allocGnode))
+  (= (fref list -> crnt) dummyNode)
+  (= (fref list -> head) dummyNode)
+  (= (fref dummyNode -> next) dummyNode)
+  (= (fref dummyNode -> prev) dummyNode))
+
+;;; Function: insertGnodeAfter - insert a new Gnode after the pointer 'p'
+(def (csym::insertGnodeAfter list p T numT item) (fn void (ptr Glist) (ptr Gnode) (array vtx) int (array set))
+  (decl i int)
+  (def new (ptr Gnode) (csym::allocGnode))
+  (def nxt (ptr Gnode) (fref p -> next))
+
+  (= (fref (fref p -> next) -> prev) new)
+  (= (fref p -> next) new)
+
+  (= (fref new -> numT) numT)
+
+  (= (fref new -> T) (cast (ptr vtx) (csym::malloc (* (fref new ->  numT) (sizeof vtx)))))
+  (for ((= i 0) (< i (fref new -> numT)) (inc i))
+    (= (aref (fref new -> T) i) (aref T i)))
+
+  (for ((= i 0) (< i BIT-ITEM) (inc i))
+    (= (aref (fref new -> item) i) (aref item i)))
+
+  (= (fref new -> prev) p)
+  (= (fref new -> next) nxt)
+  (= (fref list -> crnt) new))
+
+;;; Function: removeGnode - remove Gnode
+(def (csym::removeGnode list p) (fn void (ptr Glist) (ptr Gnode))
+  (= (fref (fref p -> prev) -> next) (fref p -> next))
+  (= (fref (fref p -> next) -> prev) (fref p -> prev))
+  (= (fref list -> crnt) (fref p -> prev))
+  (csym::free p))
+
+;;; Function: termGlist - dispose of Glist
+(def (csym::termGlist list) (fn void (ptr Glist))
+  (while (not (csym::isEmptyGlist list))
+    (csym::removeGnode list (fref (fref list -> head) -> next)))
+  (csym::free (fref list -> head))
+  (= (fref list -> crnt) NULL)
+  (= (fref list -> head) NULL))
+
+
+;;;
+(def (task T-exploreCCIG)
+  (def minID task-id)
+  (def maxID task-id)
+  (def minC int)
+  (def maxC int)
+  (def v int)
+  (def itemSet (array set BIT-ITEM))
+  (def vTraversed (ptr int))
+  ;(def vItemTable (ptr ITlist))
+  (def C (ptr vtx))
+  (def numC int)
+  (def sizeOfC int)
+  (def T (ptr vtx))
+  (def numT int)
+  (def sizeOfT int)
+  (def subgraph Glist)
+  (def treeDepth uint64_t)
+  (def numTraversed uint64_t)
+  (def numSubgraph int)
+  (def numSearch uint64_t)
+  (def numThreshold uint64_t)
+  (def numPruning int)
+  (def numTableReference uint64_t)
+  (def numMutexTrylock uint64_t)
+  (def numMutexLocked uint64_t))
+
+(def (task-sender T-exploreCCIG)
+  (def i int 0)
+  (def temp int 0)
+  (decl tp (array (struct timeval) 2))
+  ;(csym::fprintf stderr "start sending_exploreCCIG~%")
+  (csym::gettimeofday tp 0)
+  (csym::send-int th)
+  (csym::send-int (fref this minC))
+  (csym::send-int (fref this maxC))
+  (csym::send-longlong (cast long-long (fref this minID)))
+  (csym::send-longlong (cast long-long (fref this maxID)))
+  (csym::send-int (fref this v))
+  (for ((= i 0) (< i BIT-ITEM) (inc i))
+    (csym::send-longlong (aref (fref this itemSet) i)))
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (csym::send-int (aref (fref this vTraversed) i)))
+  (csym::send-int (fref this numC))
+  (for ((= i 0) (< i (fref this numC)) (inc i))
+    (= temp (cast int (aref (fref this C) i)))
+    (csym::send-int temp))
+  (csym::send-int (fref this numT))
+  (for ((= i 0) (< i (fref this numT)) (inc i))
+    (= temp (cast int (aref (fref this T) i)))
+    (csym::send-int temp))
+  (csym::gettimeofday (+ tp 1) 0)
+  (csym::fprintf stderr "end sending_exploreCCIG, %f, %d, %d~%" (csym::elapsedTime tp (+ tp 1)) (fref this numC) (fref this numT)))
+
+(def (task-receiver T-exploreCCIG)
+  (def i int 0)
+  (def temp int 0)
+  (decl tp (array (struct timeval) 2))
+  (initExploreCCIG NULL NULL NULL NULL (ptr this))
+  ;(csym::fprintf stderr "start receiving_exploreCCIG~%")
+  (if (not inited)
+    (csym::gettimeofday (ptr t0) 0))
+  (csym::gettimeofday tp 0)
+  (= th (csym::recv-int))
+  (= (fref this minC) (csym::recv-int))
+  (= (fref this maxC) (csym::recv-int))
+  (= (fref this minID) (cast task-id (csym::recv-longlong)))
+  (= (fref this maxID) (cast task-id (csym::recv-longlong)))
+  (= (fref this v) (csym::recv-int))
+  (for ((= i 0) (< i BIT-ITEM) (inc i))
+    (= (aref (fref this itemSet) i) (cast set (csym::recv-longlong))))
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (= (aref (fref this vTraversed) i) (csym::recv-int)))
+  (= (fref this numC) (csym::recv-int))
+  (for ((= i 0) (< i (fref this numC)) (inc i))
+    (= temp (csym::recv-int))
+    (= (aref (fref this C) i) (cast vtx temp)))
+  (= (fref this numT) (csym::recv-int))
+  (for ((= i 0) (< i (fref this numT)) (inc i))
+    (= temp (csym::recv-int))
+    (= (aref (fref this T) i) (cast vtx temp)))
+  (csym::gettimeofday (+ tp 1) 0)
+  (csym::fprintf stderr "end receiving_exploreCCIG, %f, %f, %d, %d~%" (csym::elapsedTime (ptr t0) (+ tp 1)) (csym::elapsedTime tp (+ tp 1)) (fref this numC) (fref this numT))
+  (if (not inited)
+    (begin
+      (decl edgeMax int)
+      (decl minVertex int)
+      (decl maxVertex int)
+      (decl maxNumItems int)
+      (decl patternFile (ptr char))
+      (decl graphFile (ptr char))
+      (= patternFile "data/symatlas_pattern.txt")
+      (= graphFile "data/symatlas_graph.txt")
+      (defs (struct hsearch_data) eHash iHash)
+      (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
+      (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
+      (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+      (thresholdItem minVertex maxVertex)
+      (for ((= i 0) (< i V-SIZE) (inc i))
+        (csym::pthread_mutex_init (ptr (aref mutex i)) NULL))
+      (csym::hdestroy_r (ptr eHash))
+      (csym::hdestroy_r (ptr iHash))
+      (= inited 1))))
+
+;(def (rslt-sender T-exploreCCIG)
+;  (csym::fprintf stderr "start: rslt-sender_exploreCCIG~%")
+;  (csym::fprintf stderr "end: rslt-sender_exploreCCIG~%"))
+
+;(def (rslt-receiver T-exploreCCIG)
+;  (csym::fprintf stderr "start: rslt-receiver_exploreCCIG~%")
+;  (csym::fprintf stderr "end: rslt-receiver_exploreCCIG~%"))
+
+;;;Function: initExploreCCIG - 
+(def (initExploreCCIG traversed itemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+  (decl i int)
+
+  ;; initialize vTraversed
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
+
+  ;; initialize vItemTable
+  ;(if (== itemTable NULL)
+  ;  (begin
+  ;    (= (fref pTsk -> vItemTable) (cast (ptr ITlist) (csym::malloc (* V-SIZE (sizeof ITlist)))))
+  ;    (for ((= i 0) (< i V-SIZE) (inc i))
+  ;      (csym::initITlist (ptr (aref (fref pTsk -> vItemTable) i)))))
+  ;  (begin
+  ;    (= (fref pTsk -> vItemTable) itemTable)))
+
+  ;; initialize C
+  (= (fref pTsk -> numC) 0)
+  (= (fref pTsk -> sizeOfC) 10000)
+  (= (fref pTsk -> C) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfC) (sizeof vtx)))))
+
+  ;; initialize T
+  (= (fref pTsk -> numT) 0)
+  (= (fref pTsk -> sizeOfT) 1000)
+  (= (fref pTsk -> T) (cast (ptr vtx) (csym::malloc (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))
+
+  ;; init subgraph
+  (csym::initGlist (ptr (fref pTsk -> subgraph)))
+
+  ;; init Debug Data
+  (= (fref pTsk -> treeDepth) 0)
+  (= (fref pTsk -> numTraversed) 0)
+  (= (fref pTsk -> numSubgraph) 0)
+  (= (fref pTsk -> numSearch) 0)
+  (= (fref pTsk -> numThreshold) 0) 
+  (= (fref pTsk -> numPruning) 0)
+  (= (fref pTsk -> numTableReference) 0)
+  (= (fref pTsk -> numMutexTrylock) 0)
+  (= (fref pTsk -> numMutexLocked) 0))
+
+;;; Function: exploreCCIG2 - create a common-itemset tree with recursive call
+(def (exploreCCIG2 minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+  (defs int i j k l m)                   ; temporary variable
+  (def cc int 0)                         ; # of newly added candidates
+  (decl vv int)                          ; vertex whice is searched next time
+  (def numC int (fref pTsk -> numC))     ; 
+  (decl commonNum int)                   ; # of common itemset
+  (decl commonItem (array set BIT-ITEM)) ; common itemset
+  (def closed int 1)                     ; flag which denotes subgraph is closed
+  (decl pruning int)                     ; flag to prune
+  (decl ITptr (ptr ITnode))              ; pointer to the ITnode
+  (decl locked int)                      ; 
+  (decl tp (array (struct timeval) 2))   ;
+
+  ;; DFS
+  (for ((= i minC) (< i maxC) (inc i))
+    (= vv (aref (fref pTsk -> C) (- (- (fref pTsk -> numC) i) 1)))
+    (inc (aref (fref pTsk -> vTraversed) vv))
+
+    (if (== (aref (fref pTsk -> vTraversed) vv) 1)
+      (begin
+        ;; evaluate common itemset
+        (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
+          (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
+          ;(+= commonNum (csym::countBits32 (aref commonItem k)))
+          ;(+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
+          (+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
+          (if (== (aref commonItem k) (aref itemSet k))
+            (inc m)))
+        (if (== m BIT-ITEM)
+          (= closed 0))
+
+        ;; if # of common-itemset >= th, then
+        (if (>= commonNum th)
+          (begin
+            (= pruning 0)
+
+            ;; check that common-itemset is subset of item table
+            (%if* DEBUG-LOCK (begin
+              (= locked 0)))
+            (inc (fref pTsk -> numMutexTrylock))
+            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+              (begin
+                (inc (fref pTsk -> numMutexLocked))
+                (%if* DEBUG-LOCK (begin
+                  (= locked 1)
+                  (csym::gettimeofday tp 0)))
+                (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+            (%if* DEBUG-LOCK (begin
+              (if locked
+                (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+            (while (!= ITptr (fref (aref vItemTable vv) head))
+              (inc (fref pTsk -> numTableReference))
+              (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
+                (begin
+                  (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
+                    (if (== (cast set (bit-and (aref commonItem k) (aref (fref ITptr -> item) k))) (aref commonItem k))
+                      (inc m)))
+                  (if (== m BIT-ITEM)
+                    (begin
+                      (= pruning 1)
+                      (break)))))
+              (= ITptr (fref ITptr -> next)))
+            (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+
+            ;; if common-itemset is not subset of item table, then
+            (if (not pruning)
+              (begin
+                (inc (fref pTsk -> numTraversed))
+                (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
+
+                (%if* DEBUG-LOCK (begin
+                  (= locked 0)))
+                (inc (fref pTsk -> numMutexTrylock))
+                (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+                  (begin
+                    (inc (fref pTsk -> numMutexLocked))
+                    (%if* DEBUG-LOCK (begin
+                      (= locked 1)
+                      (csym::gettimeofday tp 0)))
+                    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+                (%if* DEBUG-LOCK (begin
+                  (if locked
+                    (begin
+                      (csym::gettimeofday (+ tp 1) 0)
+                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+                (while (!= ITptr (fref (aref vItemTable vv) head))
+                  (inc (fref pTsk -> numTableReference))
+                  (if (>= (fref ITptr -> minID) (fref pTsk -> minID))
+                    (begin
+                      (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
+                        (if (== (cast set (bit-and (aref (fref ITptr -> item) k) (aref commonItem k))) (aref (fref ITptr -> item) k))
+                          (inc m)))
+                      (= ITptr (fref ITptr -> next))
+                      (if (== m BIT-ITEM)
+                        (csym::removeITnode (ptr (aref vItemTable vv)) (fref ITptr -> prev))))
+                    (begin
+                      (= ITptr (fref ITptr -> next)))))
+                (csym::insertITnodeAfter (ptr (aref vItemTable vv)) (fref (aref vItemTable vv) head) (fref pTsk -> minID) (fref pTsk -> maxID) commonItem)
+                (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+
+                (inc (fref pTsk -> numSearch))
+
+                ;; add new candidates 
+                (if (>= (+ (fref pTsk -> numC) (aref vDegree vv)) (fref pTsk -> sizeOfC))
+                  (begin
+                    (*= (fref pTsk -> sizeOfC) 2)
+                    (= (fref pTsk -> C) (cast (ptr vtx) (csym::realloc (fref pTsk -> C) (* (fref pTsk ->  sizeOfC) (sizeof vtx)))))))
+                (for ((= cc 0) (= j (aref vFirstEdge vv)) (!= j -1) (= j (aref eNext j)))
+                  (if (and (< (aref (fref pTsk -> T) 0) (aref eTo j)) (== (aref (fref pTsk -> vTraversed) (aref eTo j)) 0))
+                    (begin
+                      (= (aref (fref pTsk -> C) (+ cc (fref pTsk -> numC))) (aref eTo j))
+                      (inc cc))))
+
+                ;; update vertices of CCIG
+                (if (== (+ (fref pTsk -> numT) 1) (fref pTsk -> sizeOfT))
+                  (begin
+                    (*= (fref pTsk -> sizeOfT) 2)
+                    (= (fref pTsk -> T) (cast (ptr vtx) (csym::realloc (fref pTsk -> T) (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))))
+                (= (aref (fref pTsk -> T) (fref pTsk -> numT)) vv)
+
+                ;; update numC & numT
+                (+= (fref pTsk -> numC) cc)
+                (inc (fref pTsk -> numT))
+
+                (%if* DEBUG-SHOW (begin
+                  (begin
+                    (for ((= l 0) (< l (- (fref pTsk -> numT) 1)) (inc l))
+                      (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                    (csym::fprintf stderr "> %d~%" (aref (fref pTsk -> T) (- (fref pTsk -> numT) 1))))))
+
+                ;; recursive call
+                (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk)
+                    
+                (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                  (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j))))
+
+                (-= (fref pTsk -> numC) cc)
+                (dec (fref pTsk -> numT)))
+              (begin
+                (inc (fref pTsk -> numPruning))
+                (%if* DEBUG-SHOW (begin
+                  (begin
+                    (csym::fprintf stderr " pruning!! ")
+                    (for ((= l 0) (< l (fref pTsk -> numT)) (inc l))
+                      (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                    (csym::fprintf stderr "> %d~%" vv)))))))
+          (begin
+            (inc (fref pTsk -> numThreshold))
+            (%if* DEBUG-SHOW (begin
+              (begin
+                (csym::fprintf stderr " threshold!! ")
+                (for ((= l 0) (< l (fref pTsk -> numT)) (inc l))
+                  (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                (csym::fprintf stderr "> %d~%" vv)))))))))
+
+  (if closed
+    ;; output common-itemset subgraph
+    (begin
+      (%if* DEBUG-RSLT (begin
+        (csym::insertGnodeAfter (ptr (fref pTsk -> subgraph)) (fref (fref pTsk -> subgraph) crnt) (fref pTsk -> T) (fref pTsk -> numT) itemSet)))
+      (inc (fref pTsk -> numSubgraph)))))
+
+;;; Function: exploreCCIG - create a common-itemset tree with recursive call
+(def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+  (defs int i j k l m)                   ; temporary variable
+  (def cc int 0)                         ; # of newly added candidates
+  (decl vv int)                          ; vertex whice is searched next time
+  (def numC int (fref pTsk -> numC))     ; 
+  (decl commonNum int)                   ; # of common itemset
+  (decl commonItem (array set BIT-ITEM)) ; common itemset
+  (def closed int 1)                     ; flag which denotes subgraph is closed
+  (decl pruning int)                     ; flag to prune
+  (decl ITptr (ptr ITnode))              ; pointer to the ITnode
+  (decl locked int)                      ; 
+  (decl tp (array (struct timeval) 2))   ;
+  (decl tpc (array (struct timeval) 4))  ;
+
+  ;; DFS
+  (do-many for i from minC to maxC
+    (= vv (aref (fref pTsk -> C) (- (- (fref pTsk -> numC) i) 1)))
+    (inc (aref (fref pTsk -> vTraversed) vv))
+
+    (if (== (aref (fref pTsk -> vTraversed) vv) 1)
+      (begin
+        ;; evaluate common itemset
+        (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
+          (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
+          ;(+= commonNum (csym::countBits32 (aref commonItem k)))
+          ;(+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
+          (+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
+          (if (== (aref commonItem k) (aref itemSet k))
+            (inc m)))
+        (if (== m BIT-ITEM)
+          (= closed 0))
+
+        ;; if # of common-itemset >= th, then
+        (if (>= commonNum th)
+          (begin
+            (= pruning 0)
+
+            ;; check that common-itemset is subset of item table
+            (%if* DEBUG-LOCK (begin
+              (= locked 0)))
+            (inc (fref pTsk -> numMutexTrylock))
+            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+              (begin
+                (inc (fref pTsk -> numMutexLocked))
+                (%if* DEBUG-LOCK (begin
+                  (= locked 1)
+                  (csym::gettimeofday tp 0)))
+                (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+            (%if* DEBUG-LOCK (begin
+              (if locked
+                (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+            (while (!= ITptr (fref (aref vItemTable vv) head))
+              (inc (fref pTsk -> numTableReference))
+              (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
+                (begin
+                  (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
+                    (if (== (cast set (bit-and (aref commonItem k) (aref (fref ITptr -> item) k))) (aref commonItem k))
+                      (inc m)))
+                  (if (== m BIT-ITEM)
+                    (begin
+                      (= pruning 1)
+                      (break)))))
+              (= ITptr (fref ITptr -> next)))
+            (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+
+            ;; if common-itemset is not subset of item table, then
+            (if (not pruning)
+              (begin
+                (inc (fref pTsk -> numTraversed))
+                (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
+
+                (%if* DEBUG-LOCK (begin
+                  (= locked 0)))
+                (inc (fref pTsk -> numMutexTrylock))
+                (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex vv))) 0)
+                  (begin
+                    (inc (fref pTsk -> numMutexLocked))
+                    (%if* DEBUG-LOCK (begin
+                      (= locked 1)
+                      (csym::gettimeofday tp 0)))
+                    (csym::pthread_mutex_lock (ptr (aref mutex vv)))))
+                (%if* DEBUG-LOCK (begin
+                  (if locked
+                    (begin
+                      (csym::gettimeofday (+ tp 1) 0)
+                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
+                (while (!= ITptr (fref (aref vItemTable vv) head))
+                  (inc (fref pTsk -> numTableReference))
+                  (if (>= (fref ITptr -> minID) (fref pTsk -> minID))
+                    (begin
+                      (for ((= k 0) (= m 0) (< k BIT-ITEM) (inc k))
+                        (if (== (cast set (bit-and (aref (fref ITptr -> item) k) (aref commonItem k))) (aref (fref ITptr -> item) k))
+                          (inc m)))
+                      (= ITptr (fref ITptr -> next))
+                      (if (== m BIT-ITEM)
+                        (csym::removeITnode (ptr (aref vItemTable vv)) (fref ITptr -> prev))))
+                    (begin
+                      (= ITptr (fref ITptr -> next)))))
+                (csym::insertITnodeAfter (ptr (aref vItemTable vv)) (fref (aref vItemTable vv) head) (fref pTsk -> minID) (fref pTsk -> maxID) commonItem)
+                (csym::pthread_mutex_unlock (ptr (aref mutex vv)))
+
+                (inc (fref pTsk -> numSearch))
+
+                ;; add new candidates 
+                (if (>= (+ (fref pTsk -> numC) (aref vDegree vv)) (fref pTsk -> sizeOfC))
+                  (begin
+                    (*= (fref pTsk -> sizeOfC) 2)
+                    (= (fref pTsk -> C) (cast (ptr vtx) (csym::realloc (fref pTsk -> C) (* (fref pTsk ->  sizeOfC) (sizeof vtx)))))))
+                (for ((= cc 0) (= j (aref vFirstEdge vv)) (!= j -1) (= j (aref eNext j)))
+                  (if (and (< (aref (fref pTsk -> T) 0) (aref eTo j)) (== (aref (fref pTsk -> vTraversed) (aref eTo j)) 0))
+                    (begin
+                      (= (aref (fref pTsk -> C) (+ cc (fref pTsk -> numC))) (aref eTo j))
+                      (inc cc))))
+
+                ;; update vertices of CCIG
+                (if (== (+ (fref pTsk -> numT) 1) (fref pTsk -> sizeOfT))
+                  (begin
+                    (*= (fref pTsk -> sizeOfT) 2)
+                    (= (fref pTsk -> T) (cast (ptr vtx) (csym::realloc (fref pTsk -> T) (* (fref pTsk ->  sizeOfT) (sizeof vtx)))))))
+                (= (aref (fref pTsk -> T) (fref pTsk -> numT)) vv)
+
+                (dynamic-wind
+                  (:before
+                    ;; update numC & numT
+                    (+= (fref pTsk -> numC) cc)
+                    (inc (fref pTsk -> numT))
+
+                    (if (== EXITING EXITING-SPAWN)
+                      (begin
+                        (for ((= j 0) (<= j i) (inc j))
+                          (inc (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1))))))))
+                  (:body
+                    (%if* DEBUG-SHOW (begin
+                      (begin
+                        (for ((= l 0) (< l (- (fref pTsk -> numT) 1)) (inc l))
+                          (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                        (csym::fprintf stderr "> %d~%" (aref (fref pTsk -> T) (- (fref pTsk -> numT) 1))))))
+
+                    ;; recursive call
+                    (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
+                      (begin 
+                        (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (* (fref option num-thrs) NUM-NODES))
+                          (begin
+                            (exploreCCIG 0 (fref pTsk -> numC) vv commonItem pTsk))
+                          (begin
+                            (inc (aref seqTaskRequest (fref -thr -> id)))
+                            (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk))))
+                      (begin
+                        (inc (aref seqTaskRequest (fref -thr -> id)))
+                        (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk)))
+                    
+                    (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                      (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))
+                  (:after
+                    (if (== EXITING EXITING-SPAWN)
+                      (begin
+                        (for ((= j 0) (<= j i) (inc j))
+                          (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))))
+
+                    (-= (fref pTsk -> numC) cc)
+                    (dec (fref pTsk -> numT)))))
+              (begin
+                (inc (fref pTsk -> numPruning))
+                (%if* DEBUG-SHOW (begin
+                  (begin
+                    (csym::fprintf stderr " pruning!! ")
+                    (for ((= l 0) (< l (fref pTsk -> numT)) (inc l))
+                      (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                    (csym::fprintf stderr "> %d~%" vv)))))))
+          (begin
+            (inc (fref pTsk -> numThreshold))
+            (%if* DEBUG-SHOW (begin
+              (begin
+                (csym::fprintf stderr " threshold!! ")
+                (for ((= l 0) (< l (fref pTsk -> numT)) (inc l))
+                  (csym::fprintf stderr " %d -" (aref (fref pTsk -> T) l)))
+                (csym::fprintf stderr "> %d~%" vv))))))))
+
+    (handles T-exploreCCIG
+      (%if* USE-SPN-RANGE
+        (:spawn-from (if-exp (> (- i2 i) spawnSize) (+ i spawnSize) (/ (+ 1 i i2) 2))))
+      (%if* USE-SPN-RATIO
+        (:spawn-from (/ (+ 1 i i2) spawnSize)))
+      (:put from i1 to i2
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday tpc 0)))
+        (= (fref this minC) i1)
+        (= (fref this maxC) i2)
+        (= (fref this maxID) (fref pTsk -> maxID))
+        (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
+        (= (fref this minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
+        (= (fref this v) v)
+        (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
+        (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
+        (for ((= j 0) (< j i1) (inc j))
+          (inc (aref (fref this vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))
+        (csym::memcpy (fref this C) (fref pTsk -> C) (* (sizeof vtx) numC))
+        (= (fref this numC) numC)
+        (csym::memcpy (fref this T) (fref pTsk -> T) (* (sizeof vtx) (fref pTsk -> numT)))
+        (= (fref this numT) (fref pTsk -> numT))
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 1) 0))))
+      (:get
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 2) 0)))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
+        (+= (fref pTsk -> treeDepth) (fref this treeDepth))
+        (+= (fref pTsk -> numMutexTrylock) (fref this numMutexTrylock))
+        (+= (fref pTsk -> numMutexLocked) (fref this numMutexLocked))
+        (+= (fref pTsk -> numTraversed) (fref this numTraversed))
+        (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 3) 0)
+          (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
+
+  (if closed
+    ;; output common-itemset subgraph
+    (begin
+      (%if* DEBUG-RSLT (begin
+        (csym::insertGnodeAfter (ptr (fref pTsk -> subgraph)) (fref (fref pTsk -> subgraph) crnt) (fref pTsk -> T) (fref pTsk -> numT) itemSet)))
+      (inc (fref pTsk -> numSubgraph)))))
+
+;;; 
+(def (task-body T-exploreCCIG)
+  (decl i int)
+  (decl seq int)
+  (decl tp (array (struct timeval) 2))
+  (inc (aref taskRequest (fref -thr -> id)))
+  ;(csym::fprintf stderr "start: task-body_exploreCCIG / worker-%d~%" (fref -thr -> id))
+  (if (> (fref this minID) (fref this maxID))
+    (csym::fprintf stderr "minID = %llu, maxID = %llu~%" (fref this minID) (fref this maxID)))
+  (csym::gettimeofday tp 0)
+  (if (!= (fref this minID) (fref this maxID))
+    (begin
+      (if (>= (cast int (csym::log2 (cast double (- (fref this maxID) (fref this minID))))) (* (fref option num-thrs) NUM-NODES))
+        (begin
+          (= seq 0)
+          (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (exploreCCIG2 (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))))
+    (begin
+      (= seq 1)
+      (inc (aref seqTaskRequest (fref -thr -> id)))
+      (exploreCCIG2 (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))))
+  (csym::gettimeofday (+ tp 1) 0)
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref this numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
+  (csym::fprintf stderr "end: task-body_exploreCCIG, %f, %llu, %llu, %llu, %d, %llu, %llu, %llu, %d, %d~%" (csym::elapsedTime tp (+ tp 1)) (+ (fref this numSearch) (+ (fref this numThreshold) (fref this numPruning))) (fref this numSearch) (fref this numThreshold) (fref this numPruning) (fref this numTableReference) (fref this numMutexTrylock) (fref this numMutexLocked) (fref -thr -> id) seq)
+  (%if* DEBUG-TASK (begin
+    (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) seq (fref -thr -> id))))
+  (csym::free (fref this vTraversed))
+  (csym::free (fref this C))
+  (csym::free (fref this T)))
+
+;;; 
+(def (task T-enumCCIG)
+  (def minVertex int :in)
+  (def maxVertex int :in)
+  (def tsk (struct T-exploreCCIG)))
+
+(def (task-sender T-enumCCIG)
+  (def i int 0)
+  (decl tp (array (struct timeval) 2))
+  ;(csym::fprintf stderr "start sending_enumCCIG~%")
+  (csym::gettimeofday tp 0)
+  (csym::send-int th)
+  (csym::send-longlong (cast long-long (fref (fref this tsk) minID)))
+  (csym::send-longlong (cast long-long (fref (fref this tsk) maxID)))
+  (csym::gettimeofday (+ tp 1) 0)
+  (csym::fprintf stderr "end sending_enumCCIG, %f~%" (csym::elapsedTime tp (+ tp 1))))
+
+(def (task-receiver T-enumCCIG)
+  (def i int 0)
+  (decl tp (array (struct timeval) 2))
+  (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
+  ;(csym::fprintf stderr "start receiving_enumCCIG~%")
+  (if (not inited)
+    (csym::gettimeofday (ptr t0) 0))
+  (csym::gettimeofday tp 0)
+  (= th (csym::recv-int))
+  (= (fref (fref this tsk) minID) (cast task-id (csym::recv-longlong)))
+  (= (fref (fref this tsk) maxID) (cast task-id (csym::recv-longlong)))
+  (csym::gettimeofday (+ tp 1) 0)
+  (csym::fprintf stderr "end receiving_enumCCIG, %f, %f~%" (csym::elapsedTime (ptr t0) (+ tp 1)) (csym::elapsedTime tp (+ tp 1)))
+  (if (not inited)
+    (begin
+      (decl edgeMax int)
+      (decl minVertex int)
+      (decl maxVertex int)
+      (decl maxNumItems int)
+      (decl patternFile (ptr char))
+      (decl graphFile (ptr char))
+      (= patternFile "data/symatlas_pattern.txt")
+      (= graphFile "data/symatlas_graph.txt")
+      (defs (struct hsearch_data) eHash iHash)
+      (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
+      (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
+      (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+      (thresholdItem minVertex maxVertex)
+      (for ((= i 0) (< i V-SIZE) (inc i))
+        (csym::pthread_mutex_init (ptr (aref mutex i)) NULL))
+      (csym::hdestroy_r (ptr eHash))
+      (csym::hdestroy_r (ptr iHash))
+      (= inited 1))))
+
+(def (rslt-sender T-enumCCIG)
+  ;(csym::fprintf stderr "start: rslt-sender_enumCCIG~%")
+  (csym::free (fref (fref this tsk) vTraversed))
+  (csym::free (fref (fref this tsk) C))
+  (csym::free (fref (fref this tsk) T))
+  (csym::fprintf stderr "end: rslt-sender_enumCCIG~%"))
+
+(def (rslt-receiver T-enumCCIG)
+  ;(csym::fprintf stderr "start: rslt-receiver_enumCCIG~%")
+  (csym::fprintf stderr "end: rslt-receiver_enumCCIG~%"))
+
+;;; Function: enumCCIG2 - enumerate CCIG 
+(def (enumCCIG2 minVertex maxVertex pTsk) (wfn void int int (ptr (struct T-exploreCCIG)))
+  (defs int i j k)          ; temporary variable
+  (decl visiting int)       ; flag to search
+  (decl ITptr (ptr ITnode)) ; 
+  (decl locked int) 
+  (decl tp (array (struct timeval) 2))
+
+  (for ((= i minVertex) (< i maxVertex) (inc i))
+    (%if* DEBUG-TIME (begin
+      (csym::gettimeofday (aref t i) 0)))
+    (if (> (aref vDegree i) 0)
+      (begin
+        (%if* DEBUG-SHOW (begin
+          (csym::fprintf stderr "Starting Point: %d~%" i)))
+
+        (= (aref (fref pTsk -> vTraversed) i) 2)
+        (= visiting 0)
+
+        ;; check that itemset of 'i' is subset of itemset-table
+        (%if* DEBUG-LOCK (begin
+          (= locked 0)))
+        (inc (fref pTsk -> numMutexTrylock))
+        (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+          (begin
+            (inc (fref pTsk -> numMutexLocked))
+            (%if* DEBUG-LOCK (begin
+              (= locked 1)
+              (csym::gettimeofday tp 0)))
+            (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+        (%if* DEBUG-LOCK (begin
+          (if locked
+            (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+        (= ITptr (fref (fref (aref vItemTable i) head) -> next))
+        (inc (fref pTsk -> numTableReference))
+        (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
+          (begin
+            (for ((= k 0) (< k BIT-ITEM) (inc k))
+              (if (!= (cast set (bit-and (aref vItem i k) (aref (fref ITptr -> item) k))) (aref vItem i k))
+                (begin 
+                  (= visiting 1)
+                  (break)))))
+          (begin
+            (= visiting 1)))
+        (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+
+        ;; if search the CCIG whose starting point is 'i', then
+        (if visiting
+          (begin
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "+++ Allons-y! +++~%")))
+
+            (%if* DEBUG-LOCK (begin
+              (= locked 0)))
+            (inc (fref pTsk -> numMutexTrylock))
+            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+              (begin
+                (inc (fref pTsk -> numMutexLocked))
+                (%if* DEBUG-LOCK (begin
+                  (= locked 1)
+                  (csym::gettimeofday tp 0)))
+                (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+            (%if* DEBUG-LOCK (begin
+              (if locked
+                (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            (csym::clearITlist (ptr (aref vItemTable i)))
+            (csym::insertITnodeAfter (ptr (aref vItemTable i)) (fref (aref vItemTable i) head) (fref pTsk -> minID) (fref pTsk -> maxID) (aref vItem i))
+            (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+
+            (inc (fref pTsk -> numSearch))
+
+            (for ((= j (aref vFirstEdge i)) (!= j -1) (= j (aref eNext j)))
+              (if (< i (aref eTo j))
+                (begin
+                  (= (aref (fref pTsk -> C) (fref pTsk -> numC)) (aref eTo j))
+                  (inc (fref pTsk -> numC)))))
+
+            (= (aref (fref pTsk -> T) (fref pTsk -> numT)) i)
+            (inc (fref pTsk -> numT))
+            (inc (fref pTsk -> treeDepth))
+            (inc (fref pTsk -> numTraversed))
+
+            (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk)
+              
+            (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+              (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0))
+            (= (fref pTsk -> numC) 0)
+
+            (= (fref pTsk -> numT) 0)
+
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "~%"))))
+          (begin
+            (inc (fref pTsk -> numPruning))
+
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "- PRUNING! -~%~%")))))))
+
+    (%if* DEBUG-TIME (begin
+      (csym::gettimeofday (+ (aref t i) 1) 0)
+      (= (aref doneID i) (fref -thr -> id))))))
+
+;;; Function: enumCCIG - enumerate CCIG
+(def (enumCCIG minVertex maxVertex pTsk) (wfn void int int (ptr (struct T-exploreCCIG)))
+  (defs int i j k)          ; temporary variable
+  (decl visiting int)       ; flag to search
+  (decl ITptr (ptr ITnode)) ; 
+  (decl locked int) 
+  (decl tp (array (struct timeval) 2))
+  (decl tpc (array (struct timeval) 4))
+
+  (do-many for i from minVertex to maxVertex
+    (%if* DEBUG-TIME (begin
+      (csym::gettimeofday (aref t i) 0)))
+    (if (> (aref vDegree i) 0)
+      (begin
+        (%if* DEBUG-SHOW (begin
+          (csym::fprintf stderr "Starting Point: %d~%" i)))
+
+        (= (aref (fref pTsk -> vTraversed) i) 2)
+        (= visiting 0)
+
+        ;; check that itemset of 'i' is subset of itemset-table
+        (%if* DEBUG-LOCK (begin
+          (= locked 0)))
+        (inc (fref pTsk -> numMutexTrylock))
+        (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+          (begin
+            (inc (fref pTsk -> numMutexLocked))
+            (%if* DEBUG-LOCK (begin
+              (= locked 1)
+              (csym::gettimeofday tp 0)))
+            (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+        (%if* DEBUG-LOCK (begin
+          (if locked
+            (begin
+              (csym::gettimeofday (+ tp 1) 0)
+              (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+        (= ITptr (fref (fref (aref vItemTable i) head) -> next))
+        (inc (fref pTsk -> numTableReference))
+        (if (<= (fref ITptr -> minID) (fref pTsk -> minID))
+          (begin
+            (for ((= k 0) (< k BIT-ITEM) (inc k))
+              (if (!= (cast set (bit-and (aref vItem i k) (aref (fref ITptr -> item) k))) (aref vItem i k))
+                (begin 
+                  (= visiting 1)
+                  (break)))))
+          (begin
+            (= visiting 1)))
+        (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+
+        ;; if search the CCIG whose starting point is 'i', then
+        (if visiting
+          (begin
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "+++ Allons-y! +++~%")))
+
+            (%if* DEBUG-LOCK (begin
+              (= locked 0)))
+            (inc (fref pTsk -> numMutexTrylock))
+            (if (!= (csym::pthread_mutex_trylock (ptr (aref mutex i))) 0)
+              (begin
+                (inc (fref pTsk -> numMutexLocked))
+                (%if* DEBUG-LOCK (begin
+                  (= locked 1)
+                  (csym::gettimeofday tp 0)))
+                (csym::pthread_mutex_lock (ptr (aref mutex i)))))
+            (%if* DEBUG-LOCK (begin
+              (if locked
+                (begin
+                  (csym::gettimeofday (+ tp 1) 0)
+                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            (csym::clearITlist (ptr (aref vItemTable i)))
+            (csym::insertITnodeAfter (ptr (aref vItemTable i)) (fref (aref vItemTable i) head) (fref pTsk -> minID) (fref pTsk -> maxID) (aref vItem i))
+            (csym::pthread_mutex_unlock (ptr (aref mutex i)))
+
+            (inc (fref pTsk -> numSearch))
+
+            (for ((= j (aref vFirstEdge i)) (!= j -1) (= j (aref eNext j)))
+              (if (< i (aref eTo j))
+                (begin
+                  (= (aref (fref pTsk -> C) (fref pTsk -> numC)) (aref eTo j))
+                  (inc (fref pTsk -> numC)))))
+
+            (= (aref (fref pTsk -> T) (fref pTsk -> numT)) i)
+            (inc (fref pTsk -> numT))
+            (inc (fref pTsk -> treeDepth))
+            (inc (fref pTsk -> numTraversed))
+
+            (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
+              (begin
+                (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (* (fref option num-thrs) NUM-NODES))
+                  (begin
+                    (exploreCCIG 0 (fref pTsk -> numC) i (aref vItem i) pTsk))
+                  (begin
+                    (inc (aref seqTaskRequest (fref -thr -> id)))
+                    (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk))))
+              (begin
+                (inc (aref seqTaskRequest (fref -thr -> id)))
+                (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk)))
+              
+            (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+              (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0))
+            (= (fref pTsk -> numC) 0)
+
+            (= (fref pTsk -> numT) 0)
+
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "~%"))))
+          (begin
+            (inc (fref pTsk -> numPruning))
+
+            (%if* DEBUG-SHOW (begin
+              (csym::fprintf stderr "- PRUNING! -~%~%")))))))
+
+    (%if* DEBUG-TIME (begin
+      (csym::gettimeofday (+ (aref t i) 1) 0)
+      (= (aref doneID i) (fref -thr -> id))))
+
+    (handles T-enumCCIG
+      (%if* USE-SPN-RANGE
+        ;(:spawn-from i2))
+        (:spawn-from (if-exp (> (- i2 i) spawnSize) (+ i spawnSize) (/ (+ 1 i i2) 2))))
+      (%if* USE-SPN-RATIO
+        (:spawn-from (/ (+ 1 i i2) spawnSize)))
+      (:put from i1 to i2
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday tpc 0)))
+        (= (fref this minVertex) i1)
+        (= (fref this maxVertex) i2)
+        (= (fref (fref this tsk) maxID) (fref pTsk -> maxID))
+        (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
+        (= (fref (fref this tsk) minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 1) 0))))
+      (:get
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 2) 0)))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
+        (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
+        (+= (fref pTsk -> numMutexTrylock) (fref (fref this tsk) numMutexTrylock))
+        (+= (fref pTsk -> numMutexLocked) (fref (fref this tsk) numMutexLocked))
+        (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
+        (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
+        (csym::free (fref (fref this tsk) vTraversed))
+        (csym::free (fref (fref this tsk) C))
+        (csym::free (fref (fref this tsk) T))
+        (%if* DEBUG-COPY (begin
+          (csym::gettimeofday (+ tpc 3) 0)
+          (csym::fprintf fpCopy "%f, 2~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3))))))))))
+
+;;;
+(def (task-body T-enumCCIG)
+  (decl seq int)
+  (decl tp (array (struct timeval) 2))
+  (inc (aref taskRequest (fref -thr -> id)))
+  ;(csym::fprintf stderr "start: task-body_enumCCIG / worker-%d~%" (fref -thr -> id))
+  (csym::gettimeofday tp 0)
+  (if (!= (fref (fref this tsk) minID) (fref (fref this tsk) maxID))
+    (begin
+      (if (>= (cast int (csym::log2 (cast double (- (fref (fref this tsk) maxID) (fref (fref this tsk) minID))))) (fref option num-thrs))
+        (begin
+          (= seq 0)
+          (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (enumCCIG2 (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))))
+    (begin
+      (= seq 1)
+      (inc (aref seqTaskRequest (fref -thr -> id)))
+      (enumCCIG2 (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk)))))
+  (csym::gettimeofday (+ tp 1) 0)
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref (fref this tsk) numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
+  (csym::fprintf stderr "end: task-body_enumCCIG, %f, %llu, %llu, %llu, %d, %llu, %llu, %llu, %d, %d~%" (csym::elapsedTime tp (+ tp 1)) (+ (fref (fref this tsk) numSearch) (+ (fref (fref this tsk) numThreshold) (fref (fref this tsk) numPruning))) (fref (fref this tsk) numSearch) (fref (fref this tsk) numThreshold) (fref (fref this tsk) numPruning) (fref (fref this tsk) numTableReference) (fref (fref this tsk) numMutexTrylock) (fref (fref this tsk) numMutexLocked) (fref -thr -> id) seq)
+  (%if* DEBUG-TASK (begin
+    (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) seq (fref -thr -> id)))))
+
+;;; Function: thresholdItem - delete the vertex whose # of items is less than the user-specified threshold
+(def (thresholdItem minVertex maxVertex) (fn void (const int) (const int))
+  (defs int i j k l) ; temporary variable
+
+  (for ((= i minVertex) (< i maxVertex) (inc i))
+    ;; if # of items is less than the use-specified threshold, then
+    (if (and (> (aref vDegree i) 0) (< (aref vNumItems i) th))
+      (begin
+        ;; delete edges connected from the vertex
+        (= (aref vDegree i) 0)
+        (= (aref vFirstEdge i) -1)
+
+        (for ((= j minVertex) (< j maxVertex) (inc j))
+          (for ((= k (aref vFirstEdge j)) (!= k -1) (= k (aref eNext k)))
+            ;; delete edges connected to the vertex
+            (if (== (aref eTo k) i)
+              (begin
+                ;; if degree of starting point == 1, then
+                (if (== (aref vDegree j) 1)
+                  (begin
+                    (= (aref vDegree j) 0)
+                    (= (aref vFirstEdge j) -1))
+                  ;; if degree of starting point >= 2, then
+                  (begin
+                    (if (== k (aref vFirstEdge j))
+                      (begin
+                        (= (aref vFirstEdge j) (aref eNext k)))
+                      (if (== (aref eNext k) -1)
+                        (= (aref eNext l) -1)
+                        (begin 
+                          (= (aref eNext l) (aref eNext k)))))
+                    (dec (aref vDegree j))))))
+            (= l k)))))))
+
+;;; Function: loadPatternFile - load pattern file
+(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ; 
+  (decl n int)                    ; item number
+  (decl v int)                    ; vertex number
+  (decl item (ptr char))          ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
+
+  ;; open pattern file
+  (if (== (= fp (csym::fopen patternFile "r")) NULL)
+    (begin
+      (csym::fprintf stderr "Cannot open pattern file: %s~%" patternFile)
+      (exit EXIT-FAILURE)))
+
+  ;; read a line of data from pattern file
+  (while (!= (csym::fgets buff 256 fp) NULL)
+    ;; skip a comment line
+    (if (!= (csym::strncmp buff "#" 1) 0)
+      (begin
+        (= v (csym::atoi (csym::strtok buff "~|11|")))
+
+        ;; find v from eHash
+        (csym::sprintf temp "%d" v)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (continue))
+        (= v (cast int (fref hep -> data)))
+
+        ;; add item to Vertex Data
+        (while (!= (= item (csym::strtok NULL ",")) NULL)
+          (= n (csym::atoi item))
+
+          ;; enter n to iHash
+          (csym::sprintf temp "%d" n)
+          (= (fref he key) temp)
+          (csym::hsearch_r he FIND (ptr hep) iHash)
+          (if (== hep NULL)
+            (begin
+              (= (fref he data) (cast (ptr void) (inc i)))
+              (csym::hsearch_r he ENTER (ptr hep) iHash)))
+          (= n (cast int (fref hep -> data)))
+
+          (bit-or= (aref vItem v (cast int (/ n BIT-LEN))) (<< (cast set 1) (cast int (% n BIT-LEN))))
+          (inc (aref vNumItems v)) ; increase # of items
+          ;; evaluate maximum # of items
+          (if (> n (mref maxNumItems))
+            (= (mref maxNumItems) n))))))
+
+  ;; close pattern file
+  (csym::fclose fp))
+
+;;; Function: createEdge - add edge to eTo 
+(def (createEdge v1 v2 edgeMax minVertex maxVertex) (fn void int int (ptr int) (ptr int) (ptr int))
+  (defs int i j temp1 temp2) ; temporary variable
+
+  ;; if degree of the starting point == 0, then
+  (if (== (aref vDegree v1) 0)
+    (begin
+      (inc (mref edgeMax))
+      (= (aref eTo (mref edgeMax)) v2)
+      (= (aref vFirstEdge v1) (mref edgeMax)))
+
+    ;; if degree of starting point >= 1, then
+    (begin
+      (= temp1 v2)
+      (for ((= i (aref vFirstEdge v1)) 1 (= i (aref eNext i)))
+        (if (== temp1 (aref eTo i))
+          (return)) ; the edge already exists
+        (if (> temp1 (aref eTo i))
+          (begin
+            (= temp2 (aref eTo i))
+            (= (aref eTo i) temp1)
+            (= temp1 temp2)))
+        (if (== (aref eNext i) -1)
+          (break)))
+
+      ;; update Edge Data
+      (inc (mref edgeMax))
+      (= (aref eTo (mref edgeMax)) temp1)
+      (= (aref eNext i) (mref edgeMax))))
+
+  ;; evaluate mimimum vertex number
+  (if (< v1 (mref minVertex))
+    (= (mref minVertex) v1))
+  (if (< v2 (mref minVertex))
+    (= (mref minVertex) v2))
+
+  ;; evaluate maximum vertex number
+  (if (> v1 (mref maxVertex))
+    (= (mref maxVertex) v1))
+  (if (> v2 (mref maxVertex))
+    (= (mref maxVertex) v2))
+
+  ;; increase degree of the starting point
+  (inc (aref vDegree v1)))
+
+;;; Function: loadGraphFile - load graph file
+(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ; 
+  (defs int v1 v2)                ; starting point, ending point
+  (decl eLabel (ptr char))        ; label of edge
+  (decl empty (ptr char))         ; 
+  (decl buff (array char 256))    ; buffer
+  (decl temp (array char 256))    ;
+  (decl he (struct entry))        ;
+  (decl hep (ptr (struct entry))) ; 
+  (decl fp (ptr FILE))            ; file pointer
+
+  ;; open graph file
+  (if (== (= fp (csym::fopen graphFile "r")) NULL)
+    (begin
+      (csym::fprintf stderr "Cannot open graph file: %s~%" graphFile)
+      (exit EXIT-FAILURE)))
+
+  ;; read a line of data from graph file
+  (while (!= (csym::fgets buff 256 fp) NULL)
+    ;; skip a comment line
+    (if (!= (csym::strncmp buff "#" 1) 0)
+      (begin
+        (= v1 (csym::atoi (csym::strtok buff "~|11|")))
+        (= eLabel (csym::strtok NULL "~|11|"))
+        (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
+        (= empty (csym::strtok NULL "~|11|"))
+
+        ;; enter v1 to eHash
+        (csym::sprintf temp "%d" v1)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v1 (cast int (fref hep -> data)))
+
+        ;; enter v2 to eHash
+        (csym::sprintf temp "%d" v2)
+        (= (fref he key) temp)
+        (csym::hsearch_r he FIND (ptr hep) eHash)
+        (if (== hep NULL)
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+        (= v2 (cast int (fref hep -> data)))
+
+        ;; add edge to Edge List
+        (if (== empty NULL)
+          (if (!= v1 v2)
+            (begin
+              (createEdge v1 v2 edgeMax minVertex maxVertex)
+              (createEdge v2 v1 edgeMax minVertex maxVertex)))))))
+
+  ;; close graph file
+  (csym::fclose fp))
+
+;;; Function: initData - initialize Edge Data & Vertex Data & Debug Data
+(def (initData edgeMax minVertex maxVertex maxNumItems eHash iHash) (fn void (ptr int) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (defs int i j) ; temporary variable
+
+  ;; initialize Edge Data
+  (= (mref edgeMax) -1)
+  (for ((= i 0) (< i E-SIZE) (inc i))
+    (= (aref eTo i) -1)
+    (= (aref eNext i) -1))
+
+  ;; initialize Vertex Data
+  (= (mref minVertex) INT_MAX)
+  (= (mref maxVertex) -1)
+  (= (mref maxNumItems) -1)
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (= (aref vDegree i) 0)
+    (= (aref vFirstEdge i) -1)
+    (= (aref vNumItems i) 0)
+    (for ((= j 0) (< j BIT-ITEM) (inc j))
+      (= (aref vItem i j) 0)))
+
+  ;; initialize Item Table
+  (= vItemTable (cast (ptr ITlist) (csym::malloc (* V-SIZE (sizeof ITlist)))))
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (csym::initITlist (ptr (aref vItemTable i))))
+
+  ;; initialize Debug Data
+  (for ((= i 0) (< i NUM-WORKERS) (inc i))
+    (= (aref searchSpace i) 0)
+    (= (aref visit2Vertices i) 0)
+    (= (aref thresholdPruning i) 0)
+    (= (aref inclusivePruning i) 0)
+    (= (aref taskRequest i) 0)
+    (= (aref seqTaskRequest i) 0)
+    (= (aref tableReference i) 0))
+
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (= (aref doneID i) 0))
+
+  ;; initialize Hash Data
+  (csym::memset eHash 0 (sizeof (mref eHash)))
+  (csym::memset iHash 0 (sizeof (mref iHash)))
+  (csym::hcreate_r E-SIZE eHash)
+  (csym::hcreate_r I-SIZE iHash))
+
+;;; 
+(def (task T-startCCIG)
+  (def th int :in)
+  (def spawnSize int :in)
+  (def loopRatio int :in))
+
+;;; Main 
+(def (task-body T-startCCIG)
+  (defs int i j k)                     ; temporary variable
+  (decl tp (array (struct timeval) 2)) ; start time, end time
+  (defs double t1 t2)                  ; start user time, end user time
+  (decl loopRange int)                 ; loop range of enumCCIG
+  (decl patternFile (ptr char))        ; name of pattern file
+  (decl graphFile (ptr char))          ; name of graph file
+  (decl resultFile (ptr char))         ; name of result file
+  ;(decl patternFile (array char 128))
+  ;(decl graphFile (array char 128))
+  (decl timeFile (array char 128))     ; name of time file
+  (decl taskFile (array char 128))     ; name of task file
+  (decl lockFile (array char 128))     ; name of lock file
+  (decl copyFile (array char 128))     ; name of copy file
+  (decl ITptr (ptr ITnode))            ; pointer to the ITnode
+  (defs (ptr FILE) fp fpt)             ; file pointer
+
+  ;; pthread data
+  ;(decl resetThread (array pthread_t (fref option num-thrs)))
+  ;(decl data (array threadInfo (fref option num-thrs)))
+  ;(decl attr pthread_attr_t)
+
+  ;; Task
+  (def tsk (struct T-exploreCCIG))
+
+  ;; Edge Data
+  (decl edgeMax int)     ; maximum edge number
+
+  ;; Vertex Data
+  (decl minVertex int)           ; minimum vertex number
+  (decl maxVertex int)           ; maximum vertex number
+  (decl maxNumItems int)         ; maximum # of items
+
+  ;; Subgraph Data
+  (decl Gptr (ptr Gnode))
+
+  ;; Hash Data
+  (defs (struct hsearch_data) eHash iHash)
+
+  ;; Debug Data
+  (def numSearch uint64_t 0)                      ; # of search space
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ;  
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task request 
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numSeqTaskRequest int 0)                   ; # of seq. task request
+  (def avgSeqTaskRequest double 0.0)              ; 
+  (def seqTaskRequestSD double 0.0)               ; 
+  (def numAllTaskRequest int 0)                   ; # of all task request
+  (def avgAllTaskRequest double 0.0)              ; 
+  (def allTaskRequestSD double 0.0)               ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
+
+  ;; arguments
+  (= patternFile "data/symatlas_pattern.txt")
+  (= graphFile "data/symatlas_graph.txt")
+  ;(= patternFile "data/dblp_author-of.tab")
+  ;(= graphFile "data/dblp_cites_network.tab")
+  ;(= patternFile "data/eg_pattern.txt")
+  ;(= graphFile "data/eg_graph.txt")
+  ;(= patternFile "data/eg2_pattern.txt")
+  ;(= graphFile "data/eg2_graph.txt")
+  (= th (fref this th))
+  (= spawnSize (fref this spawnSize))
+  (= resultFile "result.txt")
+  (if USE-SPN-RANGE
+    (begin
+      (csym::sprintf timeFile "time3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf taskFile "task3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf lockFile "lock3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf copyFile "copy3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+    (begin
+      (if USE-SPN-RATIO
+        (begin
+          (csym::sprintf timeFile "time3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf taskFile "task3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf lockFile "lock3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf copyFile "copy3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+        (begin
+          (csym::sprintf timeFile "time3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf taskFile "task3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf lockFile "lock3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf copyFile "copy3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
+
+  ;; set ID
+  (= (fref tsk minID) 0)
+  (= (fref tsk maxID) -1)
+
+  ;; init pthread
+  ;(csym::pthread_attr_init (ptr attr))
+  ;(csym::pthread_attr_setdetachstate (ptr attr) PTHREAD_CREATE_JOINABLE)
+
+  ;; initialize Edge Data & Vertex Data & Debug Data
+  (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
+
+  ;; load graph file
+  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
+
+  ;; load pattern file
+  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+
+  ;; delete the vertex whose # of items is less than the user-specified threshold
+  (thresholdItem minVertex maxVertex)
+
+  ;; set the range of enumCCIG loop
+  (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
+
+  ;; set the range of resetTaskID loop
+  ;(for ((= i 0) (< i (fref option num-thrs)) (inc i))
+  ;  (= (fref (aref data i) loopStart) (* (/ (- maxVertex minVertex) (fref option num-thrs)) i))
+  ;  (= (fref (aref data i) loopEnd) (* (/ (- maxVertex minVertex) (fref option num-thrs)) (+ i 1))))
+
+  ;; init T-exploreCCIG
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
+
+  ;; init mutex
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (csym::pthread_mutex_init (ptr (aref mutex i)) NULL))
+  (= inited 1)
+
+  ;; open task file
+  (%if* DEBUG-TASK (begin
+    (if (== (= fpTask (csym::fopen taskFile "w")) NULL)
+      (begin
+        (csym::fprintf stderr "Cannot open task file: %s~%" taskFile)
+        (exit EXIT-FAILURE)))))
+
+  ;; open lock file
+  (%if* DEBUG-LOCK (begin
+    (if (== (= fpLock (csym::fopen lockFile "w")) NULL)
+      (begin
+        (csym::fprintf stderr "Cannot open lock file: %s~%" lockFile)
+        (exit EXIT-FAILURE)))))
+
+  ;; open copy file
+  (%if* DEBUG-COPY (begin
+    (if (== (= fpCopy (csym::fopen copyFile "w")) NULL)
+      (begin
+        (csym::fprintf stderr "Cannot open copy file: %s~%" copyFile)
+        (exit EXIT-FAILURE)))))
+
+  ;; get start time of program
+  (= t1 (csym::getrusageSec))
+  (csym::gettimeofday (ptr t0) 0)
+  (csym::gettimeofday tp 0)
+
+  ;; enumerate CCIG
+  (= i minVertex)
+  (for ((< (+ i loopRange) maxVertex) (+= i loopRange))
+    (enumCCIG i (+ i loopRange) (ptr tsk))
+
+    (for ((= k minVertex) (< k (+ maxVertex 1)) (inc k))
+      (= ITptr (fref (fref (aref vItemTable k) head) -> next))
+      (while (!= ITptr (fref (aref vItemTable k) head))
+        (= (fref ITptr -> minID) (cast task-id 0))
+        (= (fref ITptr -> maxID) (cast task-id 0))
+        (= ITptr (fref ITptr -> next))))
+
+    ;; re-set ID
+    (= (fref tsk minID) 0)
+    (= (fref tsk maxID) -1))
+  (enumCCIG i (+ maxVertex 1) (ptr tsk))
+
+  ;(for ((= j 1) (< j (fref this loopRatio)) (inc j)) 
+  ;  (enumCCIG i (+ i loopRange) (ptr tsk))
+
+  ;  ;(for ((= k 0) (< k (fref option num-thrs)) (inc k))
+  ;  ;  (csym::pthread_create (ptr (aref resetThread k)) (ptr attr) resetTaskID (ptr (aref data k))))
+  ;  ;(for ((= k 0) (< k (fref option num-thrs)) (inc k))
+  ;  ;  (csym::pthread_join (aref resetThread k) NULL))
+
+  ;  (for ((= k minVertex) (< k (+ maxVertex 1)) (inc k))
+  ;    (= ITptr (fref (fref (aref vItemTable k) head) -> next))
+  ;    (while (!= ITptr (fref (aref vItemTable k) head))
+  ;      (= (fref ITptr -> minID) (cast task-id 0))
+  ;      (= (fref ITptr -> maxID) (cast task-id 0))
+  ;      (= ITptr (fref ITptr -> next))))
+
+  ;  ;; re-set ID
+  ;  (= (fref tsk minID) 0)
+  ;  (= (fref tsk maxID) UINT-LEAST64-MAX)
+
+  ;  (+= i loopRange))
+  ;(enumCCIG i (+ maxVertex 1) (ptr tsk))
+
+  ;; get end time of program
+  (csym::gettimeofday (+ tp 1) 0)
+  (= t2 (csym::getrusageSec))
+
+  ;; dispose of pthread & mutex & item table & hash tables
+  ;(csym::pthread_attr_destroy (ptr attr))
+  (for ((= i 0) (< i V-SIZE) (inc i))
+    (csym::pthread_mutex_destroy (ptr (aref mutex i)))
+    (csym::termITlist (ptr (aref vItemTable i))))
+  (csym::free vItemTable)
+  (csym::hdestroy_r (ptr eHash))
+  (csym::hdestroy_r (ptr iHash))
+
+  ;; close lock file
+  (%if* DEBUG-LOCK (begin
+    (csym::fclose fpLock)))
+
+  ;; close copy file
+  (%if* DEBUG-COPY (begin
+    (csym::fclose fpCopy)))
+
+  ;; close task file
+  (%if* DEBUG-TASK (begin
+    (csym::fprintf fpTask "%f, %f, %f, %llu, 0, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
+    (csym::fclose fpTask)))
+
+  (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
+  (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
+  (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
+  (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
+
+  (%if* DEBUG-TIME (begin
+    ;; open time file
+    (if (== (= fpt (csym::fopen timeFile "w")) NULL)
+      (begin
+        (csym::fprintf stderr "Cannot open time file: %s~%" timeFile)
+        (exit EXIT-FAILURE)))
+
+    (for ((= i minVertex) (< i maxVertex) (inc i))
+      (csym::fprintf fpt "%d, %f, %f, %d~%" i (csym::elapsedTime tp (+ (aref t i) 1)) (csym::elapsedTime (aref t i) (+ (aref t i) 1)) (aref doneID i)))
+
+    ;; close time file
+    (csym::fclose fpt)))
+
+  ;; debug mode
+  (%if* DEBUG-DATA (begin
+    (begin
+      (csym::fprintf stderr "~%----- Edge Data -----~%")
+      (for ((= i 0) (<= i edgeMax) (inc i))
+        (csym::fprintf stderr "Edge %d: %d, %d~%" i (aref eTo i) (aref eNext i)))
+      (csym::fprintf stderr "~%----- Vertex Data -----~%")
+      (for ((= i minVertex) (<= i maxVertex) (inc i))
+        (csym::fprintf stderr "Vertex %d: %d, %d, " i (aref vDegree i) (aref vFirstEdge i))
+        (for ((= j (/ maxNumItems BIT-LEN)) (>= j 0) (dec j))
+          (printBits (aref vItem i j)))
+        (csym::fprintf stderr ", %d~%" (aref vNumItems i)))
+      (csym::fprintf stderr "~%----- Subgraph List -----~%")
+      (= i 0)
+      (= Gptr (fref (fref (fref tsk subgraph) head) -> next))
+      (while (!= Gptr (fref (fref tsk subgraph) head))
+        ;; print vertices of CCIG
+        (csym::fprintf stderr "Subgraph %d:" i)
+        (for ((= j 0) (< j (fref Gptr -> numT)) (inc j))
+          (csym::fprintf stderr " %d" (aref (fref Gptr -> T) j)))
+        (csym::fprintf stderr " ( ")
+        ;; print common itemset of CCIG
+        (for ((= j 0) (< j BIT-ITEM) (inc j))
+          (csym::fprintDecimally stderr (aref (fref Gptr -> item) j) j))
+        (inc i)
+        (= Gptr (fref Gptr -> next))
+        (csym::fprintf stderr ")~%"))
+      (csym::fprintf stderr "~%")
+      (csym::fprintf stderr "edgeMax = %d, minVertex = %d, maxVertex = %d, maxNumItems = %d~%" edgeMax minVertex maxVertex maxNumItems))))
+
+  ;; output result file
+  (%if* DEBUG-RSLT (begin
+    (begin
+      ;; open result file
+      (if (== (= fp (csym::fopen resultFile "w")) NULL)
+        (begin
+          (csym::fprintf stderr "Cannot open result file: %s~%" resultFile)
+          (exit EXIT-FAILURE)))
+      (= Gptr (fref (fref (fref tsk subgraph) head) -> next))
+      (while (!= Gptr (fref (fref tsk subgraph) head))
+        ;; write vertices of CCIG to stream
+        (for ((= j 0) (< j (fref Gptr -> numT)) (inc j))
+          (csym::fprintf fp "%d " (aref (fref Gptr -> T) j)))
+        (csym::fprintf fp "( ")
+        ;; write common itemset of CCIG to stream
+        (for ((= j 0) (< j BIT-ITEM) (inc j))
+          (csym::fprintDecimally fp (aref (fref Gptr -> item) j) j))
+        (= Gptr (fref Gptr -> next))
+        (csym::fprintf fp ")~%"))
+
+      ;; close result file
+      (csym::fclose fp))))
+
+  (%if* DEBUG-RSLT (begin
+    (= Gptr (fref (fref (fref tsk subgraph) head) -> next))
+    (while (!= Gptr (fref (fref tsk subgraph) head))
+      (+= avgSizeSubgraph (fref Gptr -> numT))
+      (if (< maxSizeSubgraph (fref Gptr -> numT))
+        (= maxSizeSubgraph (fref Gptr -> numT)))
+      (= Gptr (fref Gptr -> next)))))
+
+  ;; show debug datas
+  (csym::fprintf stderr "time = %f[sec]~%" (csym::elapsedTime tp (+ tp 1)))
+  (csym::fprintf stderr "user time = %f[sec]~%" (- t2 t1))
+  (csym::fprintf stderr "# of subgraphs = %d~%" (fref tsk numSubgraph))
+  (csym::fprintf stderr "Avg. size of tree depth = %f~%" (/ (cast double (fref tsk treeDepth)) (cast double (fref tsk numTraversed))))
+  (%if* DEBUG-RSLT (begin
+    (csym::fprintf stderr "Max size of subgraph = %d~%" maxSizeSubgraph)
+    (csym::fprintf stderr "Avg. size of subgraph = %f~%" (/ (cast double avgSizeSubgraph) (cast double (fref tsk numSubgraph))))))
+
+  (csym::fprintf stderr "~%# of searches & task-requests~%")
+  (for ((= j 0) (< j (fref option num-thrs)) (inc j))
+    (= (aref searchSpace j) (+ (+ (aref visit2Vertices j) (aref thresholdPruning j)) (
+aref inclusivePruning j)))
+    (csym::fprintf stderr " ID:%d, %llu(%llu, %llu, %llu), %d/%d, %llu~%" j (aref searchSpace j) (aref visit2Vertices j) (aref thresholdPruning j) (aref inclusivePruning j) (aref taskRequest j) (aref seqTaskRequest j) (aref tableReference j))
+    (+= numSearch (aref searchSpace j))
+    (if (< maxWorkerSearch (aref searchSpace j))
+      (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
+    (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
+    (+= numTaskRequest (aref taskRequest j))
+    (+= numSeqTaskRequest (aref seqTaskRequest j))
+    (+= numAllTaskRequest (aref taskRequest j))
+    (+= numAllTaskRequest (aref seqTaskRequest j))
+    (+= numTableReference (aref tableReference j)))
+  (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
+  (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
+  (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
+  (= avgSeqTaskRequest (/ (cast double numSeqTaskRequest) (cast double (fref option num-thrs))))
+  (= avgAllTaskRequest (/ (cast double (+ numTaskRequest numSeqTaskRequest)) (cast double (fref option num-thrs))))
+  (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
+
+  (for ((= j 0) (< j (fref option num-thrs)) (inc j))
+    (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
+    (+= workerSearchPerSecSD (csym::pow (- (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec) 2.0))
+    (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
+    (+= seqTaskRequestSD (csym::pow (- (aref seqTaskRequest j) avgSeqTaskRequest) 2.0))
+    (+= allTaskRequestSD (csym::pow (- (+ (aref taskRequest j) (aref seqTaskRequest j)) avgAllTaskRequest) 2.0))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
+  (/= workerSearchSD (fref option num-thrs))
+  (/= workerSearchPerSecSD (fref option num-thrs))
+  (/= taskRequestSD (fref option num-thrs))
+  (/= seqTaskRequestSD (fref option num-thrs))
+  (/= allTaskRequestSD (fref option num-thrs))
+  (/= tableReferenceSD (fref option num-thrs))
+  (= workerSearchSD (csym::sqrt workerSearchSD))
+  (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
+  (= taskRequestSD (csym::sqrt taskRequestSD))
+  (= seqTaskRequestSD (csym::sqrt seqTaskRequestSD))
+  (= allTaskRequestSD (csym::sqrt allTaskRequestSD))
+  (= tableReferenceSD (csym::sqrt tableReferenceSD))
+
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
+  (csym::fprintf stderr "# of seq. task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numSeqTaskRequest avgSeqTaskRequest seqTaskRequestSD)
+  (csym::fprintf stderr "# of all task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numAllTaskRequest avgAllTaskRequest allTaskRequestSD)
+  (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
+  (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD)
+  (csym::fprintf stderr "# of ITmutex trylock = %llu, " (fref tsk numMutexTrylock))
+  (csym::fprintf stderr "# of ITmutex locked = %llu(%.3f%%)~%" (fref tsk numMutexLocked) (* (/ (cast double (fref tsk numMutexLocked)) (cast double (fref tsk numMutexTrylock))) 100.0)))
\ No newline at end of file
diff --git a/src/sample/tcell/copine4.tcell b/src/sample/tcell/copine4.tcell
index b0a00ba7..4260701e 100644
--- a/src/sample/tcell/copine4.tcell
+++ b/src/sample/tcell/copine4.tcell
@@ -45,7 +45,7 @@
 (c-exp "#include <inttypes.h>")
 (c-exp "#include <sys/time.h>")
 (c-exp "#include <sys/resource.h>")
-(c-exp "#include <nmmintrin.h>")
+;(c-exp "#include <nmmintrin.h>")
 
 (c-exp "#define  __USE_GNU")
 (c-exp "#include <search.h>")
@@ -66,11 +66,11 @@
 (%defconstant USE-SSE 0)
 
 ;;; Max # of workers
-(%defconstant NUM-WORKERS 16)
+(%defconstant NUM-WORKERS 68)
 
 ;;; Constants
 (%defconstant E-SIZE 500000)               ; # of edges
-(%defconstant V-SIZE 25000)                ; # of vertices
+(%defconstant V-SIZE 15500)                ; # of vertices
 (%defconstant BIT-LEN 64)                  ; bit length of bitset
 (%defconstant BIT-ITEM 3)                  ; # of items = BIT-ITEM * BIT-LEN
 (%defconstant BIT-EDGE 8125)               ; # of edges = BIT-EDGE * BIT-LEN
@@ -88,9 +88,9 @@
 (%defconstant DEBUG-COPY 0) ; flag to output copy file
 
 ;;; Typedef
-(deftype set uint64_t)     ; bitset
-(deftype vtx uint32_t)     ; vertex
-(deftype task-id uint64_t) ; task ID
+(deftype set uint64_t)        ; bitset
+(deftype vtx uint32_t)        ; vertex
+(deftype task-id __uint128_t) ; task ID
 
 ;;; Structure of ITnode
 (def (struct --ITnode)
@@ -137,6 +137,10 @@
 (decl vItem (array (array set BIT-ITEM) V-SIZE)) ; itemset ("i-th bit ==1" means the vertex has the item 'i')
 (decl vNumItems (array int V-SIZE))              ; # of items the vertex has
 
+;;; Input File
+(%defconstant P-FILE "data/symatlas_pattern.txt")
+(%defconstant G-FILE "data/symatlas_graph.txt")
+
 ;;; Global Variables
 (decl th int) ; threshold of common itemset size
 (decl spawnSize int)
@@ -155,6 +159,10 @@
 (decl taskRequest (array int NUM-WORKERS))
 (decl seqTaskRequest (array int NUM-WORKERS))
 (decl tableReference (array uint64_t NUM-WORKERS))
+(decl tableMutexTrylock (array uint64_t NUM-WORKERS))
+(decl tableMutexLocked (array uint64_t NUM-WORKERS))
+(decl excpMutexTrylock (array uint64_t NUM-WORKERS))
+(decl excpMutexLocked (array uint64_t NUM-WORKERS))
 (decl numRedundantSearch (array int NUM-WORKERS))
 (decl numThrow (array int NUM-WORKERS))
 
@@ -164,7 +172,6 @@
 ;; Exception Queue
 (def Qe (array (array vtx Q-SIZE) NUM-WORKERS))
 (def numQe (array int NUM-WORKERS))
-(def flagQe (array int NUM-WORKERS))
 
 ;;; Mutex
 (decl itMutex (array pthread_mutex_t V-SIZE))
@@ -390,15 +397,11 @@
   (def numEmutexLocked uint64_t))
 
 ;;;Function: initExploreCCIG - 
-(def (initExploreCCIG traversed itemTable C T pTsk) (fn void int (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
+(def (initExploreCCIG traversed itemTable C T pTsk) (fn void (ptr int) (ptr ITlist) (ptr vtx) (ptr vtx) (ptr (struct T-exploreCCIG)))
   (decl i int)
 
   ;; initialize vTraversed
-  (if (== traversed 0)
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int)))))
-    (begin
-      (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::malloc (* V-SIZE (sizeof int)))))))
+  (= (fref pTsk -> vTraversed) (cast (ptr int) (csym::calloc V-SIZE (sizeof int))))
 
   ;; initialize vItemTable
   ;(if (== itemTable NULL)
@@ -436,7 +439,7 @@
   (= (fref pTsk -> numEmutexLocked) 0))
 
 ;;; Function: exploreCCIG2 - create a common-itemset tree with recursive call
-(def (exploreCCIG2 minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+(def (exploreCCIG2 minC maxC v itemSet pTsk) (wfn void int int int (ptr set) (ptr (struct T-exploreCCIG)))
   (defs int i j k l m)                   ; temporary variable
   (def cc int 0)                         ; # of newly added candidates
   (decl vv int)                          ; vertex whice is searched next time
@@ -484,13 +487,12 @@
 
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        ;(inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
           ;(+= commonNum (csym::countBits32 (aref commonItem k)))
           (+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
           ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
@@ -531,7 +533,7 @@
                       (= pruning 1)
                       (break)))))
               (= ITptr (fref ITptr -> next)))
-            (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
+            ;(csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
 
             ;; if common-itemset is not subset of item table, then
             (if (not pruning)
@@ -539,21 +541,21 @@
                 (inc (fref pTsk -> numTraversed))
                 (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
 
-                (%if* DEBUG-LOCK (begin
-                  (= locked 0)))
-                (inc (fref pTsk -> numITmutexTrylock))
-                (if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex vv))) 0)
-                  (begin
-                    (inc (fref pTsk -> numITmutexLocked))
-                    (%if* DEBUG-LOCK (begin
-                      (= locked 1)
-                      (csym::gettimeofday tp 0)))
-                    (csym::pthread_mutex_lock (ptr (aref itMutex vv)))))
-                (%if* DEBUG-LOCK (begin
-                  (if locked
-                    (begin
-                      (csym::gettimeofday (+ tp 1) 0)
-                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (= locked 0)))
+                ;(inc (fref pTsk -> numITmutexTrylock))
+                ;(if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex vv))) 0)
+                ;  (begin
+                ;    (inc (fref pTsk -> numITmutexLocked))
+                ;    (%if* DEBUG-LOCK (begin
+                ;      (= locked 1)
+                ;      (csym::gettimeofday tp 0)))
+                ;    (csym::pthread_mutex_lock (ptr (aref itMutex vv)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (if locked
+                ;    (begin
+                ;      (csym::gettimeofday (+ tp 1) 0)
+                ;      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
                 (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
                 (while (!= ITptr (fref (aref vItemTable vv) head))
                   (inc (fref pTsk -> numTableReference))
@@ -644,6 +646,7 @@
                 (-= (fref pTsk -> numC) cc)
                 (dec (fref pTsk -> numT)))
               (begin
+                (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
                 (inc (fref pTsk -> numPruning))
                 (%if* DEBUG-SHOW (begin
                   (begin
@@ -668,7 +671,7 @@
       (inc (fref pTsk -> numSubgraph)))))
 
 ;;; Function: exploreCCIG - create a common-itemset tree with recursive call
-(def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (array set) (ptr (struct T-exploreCCIG)))
+(def (exploreCCIG minC maxC v itemSet pTsk) (wfn void int int int (ptr set) (ptr (struct T-exploreCCIG)))
   (defs int i j k l m)                   ; temporary variable
   (def cc int 0)                         ; # of newly added candidates
   (decl vv int)                          ; vertex whice is searched next time
@@ -685,13 +688,14 @@
   (decl tp (array (struct timeval) 2))   ;
   (decl tpc (array (struct timeval) 4))  ;
 
-  (inc (fref pTsk -> numEmutexTrylock))
-  (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-    (begin
-      (inc (fref pTsk -> numEmutexLocked))
-      (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
   (if (aref numQe (fref -thr -> id))
     (begin
+      (inc (fref pTsk -> numEmutexTrylock))
+      (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
+        (begin
+          (inc (fref pTsk -> numEmutexLocked))
+          (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
+      (= excpValue -1)
       (= excpIndex INT_MAX)
       (for ((= j 0) (< j (aref numQe (fref -thr -> id))) (inc j))
         (for ((= k 0) (< k (fref pTsk -> numT)) (inc k))
@@ -701,79 +705,27 @@
                 (begin
                   (= excpValue (cast int (aref (fref pTsk -> T) k)))
                   (= excpIndex k)))
-              (break)))))))
-  (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-  (if (!= excpValue -1)
-    (begin
-      (inc (aref numThrow (fref -thr -> id)))
-      (= (aref flagQe (fref -thr -> id)) 1)
-      (throw excpValue)))
-
-  ;(if (aref numQe (fref -thr -> id))
-  ;  (begin
-  ;    (inc (fref pTsk -> numEmutexTrylock))
-  ;    (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-  ;      (begin
-  ;        (inc (fref pTsk -> numEmutexLocked))
-  ;        (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
-  ;    (= excpValue -1)
-  ;    (= excpIndex INT_MAX)
-  ;    (for ((= j 0) (< j (aref numQe (fref -thr -> id))) (inc j))
-  ;      (for ((= k 0) (< k (fref pTsk -> numT)) (inc k))
-  ;        (if (== (aref Qe (fref -thr -> id) j) (aref (fref pTsk -> T) k))
-  ;          (begin
-  ;            (if (< k excpIndex)
-  ;              (begin
-  ;                (= excpValue (cast int (aref (fref pTsk -> T) k)))
-  ;                (= excpIndex k)))
-  ;            (break)))))
-  ;    (= (aref numQe (fref -thr -> id)) 0)
-  ;    (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-  ;    (if (!= excpValue -1)
-  ;      (begin
-  ;        (inc (aref numThrow (fref -thr -> id)))
-  ;        (= (aref flagQe (fref -thr -> id)) 1)
-  ;        (throw excpValue)))))
+              (break)))))
+      (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
+      (if (!= excpValue -1)
+        (begin
+          (inc (aref numThrow (fref -thr -> id)))
+          (= (aref numQe (fref -thr -> id)) 0)
+          (throw excpValue)))))
 
   ;; DFS
   (do-many for i from minC to maxC
     (= vv (aref (fref pTsk -> C) (- (- (fref pTsk -> numC) i) 1)))
     (inc (aref (fref pTsk -> vTraversed) vv))
 
-    ;(if (aref numQe (fref -thr -> id))
-    ;  (begin
-    ;    (inc (fref pTsk -> numEmutexTrylock))
-    ;    (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-    ;      (begin
-    ;        (inc (fref pTsk -> numEmutexLocked))
-    ;        (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
-    ;    (= excpValue -1)
-    ;    (= excpIndex INT_MAX)
-    ;    (for ((= j 0) (< j (aref numQe (fref -thr -> id))) (inc j))
-    ;      (for ((= k 0) (< k (fref pTsk -> numT)) (inc k))
-    ;        (if (== (aref Qe (fref -thr -> id) j) (aref (fref pTsk -> T) k))
-    ;          (begin
-    ;            (if (< k excpIndex)
-    ;              (begin
-    ;                (= excpValue (cast int (aref (fref pTsk -> T) k)))
-    ;                (= excpIndex k)))
-    ;            (break)))))
-    ;    (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-    ;    (if (!= excpValue -1)
-    ;      (begin
-    ;        (inc (aref numThrow (fref -thr -> id)))
-    ;        (= (aref flagQe (fref -thr -> id)) 1)
-    ;        (throw excpValue)))))
-
     (if (== (aref (fref pTsk -> vTraversed) vv) 1)
       (begin
-        ;(inc (fref pTsk -> numSearch))
-
         ;; evaluate common itemset
         (for ((= k 0) (= m 0) (= commonNum 0) (< k BIT-ITEM) (inc k))
           (= (aref commonItem k) (cast set (bit-and (aref itemSet k) (aref vItem vv k))))
           ;(+= commonNum (csym::countBits32 (aref commonItem k)))
           (+= commonNum (csym::countBits64 (aref commonItem k)))
+          ;(+= commonNum (csym::_mm_popcnt_u32 (aref commonItem k)))
           ;(+= commonNum (csym::_mm_popcnt_u64 (aref commonItem k)))
           (if (== (aref commonItem k) (aref itemSet k))
             (inc m)))
@@ -814,7 +766,7 @@
                       (= pruning 1)
                       (break)))))
               (= ITptr (fref ITptr -> next)))
-            (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
+            ;(csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
 
             ;; if common-itemset is not subset of item table, then
             (if (not pruning)
@@ -822,21 +774,21 @@
                 (inc (fref pTsk -> numTraversed))
                 (+= (fref pTsk -> treeDepth) (+ (fref pTsk -> numT) 1))
 
-                (%if* DEBUG-LOCK (begin
-                  (= locked 0)))
-                (inc (fref pTsk -> numITmutexTrylock))
-                (if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex vv))) 0)
-                  (begin
-                    (inc (fref pTsk -> numITmutexLocked))
-                    (%if* DEBUG-LOCK (begin
-                      (= locked 1)
-                      (csym::gettimeofday tp 0)))
-                    (csym::pthread_mutex_lock (ptr (aref itMutex vv)))))
-                (%if* DEBUG-LOCK (begin
-                  (if locked
-                    (begin
-                      (csym::gettimeofday (+ tp 1) 0)
-                      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (= locked 0)))
+                ;(inc (fref pTsk -> numITmutexTrylock))
+                ;(if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex vv))) 0)
+                ;  (begin
+                ;    (inc (fref pTsk -> numITmutexLocked))
+                ;    (%if* DEBUG-LOCK (begin
+                ;      (= locked 1)
+                ;      (csym::gettimeofday tp 0)))
+                ;    (csym::pthread_mutex_lock (ptr (aref itMutex vv)))))
+                ;(%if* DEBUG-LOCK (begin
+                ;  (if locked
+                ;    (begin
+                ;      (csym::gettimeofday (+ tp 1) 0)
+                ;      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
                 (= ITptr (fref (fref (aref vItemTable vv) head) -> next))
                 (while (!= ITptr (fref (aref vItemTable vv) head))
                   (inc (fref pTsk -> numTableReference))
@@ -893,7 +845,7 @@
                     (+= (fref pTsk -> numC) cc)
                     (inc (fref pTsk -> numT))
 
-                    (if BACKTRACKING
+                    (if (== EXITING EXITING-SPAWN)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (inc (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1))))))))
@@ -905,30 +857,27 @@
                         (csym::fprintf stderr "> %d~%" (aref (fref pTsk -> T) (- (fref pTsk -> numT) 1))))))
 
                     ;; recursive call
-                    (if (> (- (fref pTsk -> maxID) (fref pTsk -> minID)) (fref pTsk -> numC))
+                    (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
                       (begin
-                        (catch vv
-                          (exploreCCIG 0 (fref pTsk -> numC) vv commonItem pTsk)
-                          (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
-                            (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j))))))
+                        (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (fref option num-thrs))
+                          (begin
+                            (catch vv
+                              (exploreCCIG 0 (fref pTsk -> numC) vv commonItem pTsk)
+                              (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                                (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j))))))
+                          (begin
+                            (inc (aref seqTaskRequest (fref -thr -> id)))
+                            (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk)
+                            (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                              (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))))
                       (begin
                         (inc (aref seqTaskRequest (fref -thr -> id)))
                         (exploreCCIG2 0 (fref pTsk -> numC) vv commonItem pTsk)
                         (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
-                          (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j))))))
-
-                    (if (== (aref flagQe (fref -thr -> id)) 1)
-                      (begin
-                        (inc (fref pTsk -> numEmutexTrylock))
-                        (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-                          (begin
-                            (inc (fref pTsk -> numEmutexLocked))
-                            (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
-                        (= (aref numQe (fref -thr -> id)) 0)
-                        (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-                        (= (aref flagQe (fref -thr -> id)) 0))))
+                          (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)))))))
                   (:after
-                    (if EXITING
+                   (if (or (== EXITING EXITING-CANCEL)
+                           (== EXITING EXITING-EXCEPTION))
                       (begin
                         (%if* DEBUG-LOCK (begin
                           (= locked 0)))
@@ -948,7 +897,7 @@
                         (csym::removeITnode (ptr (aref vItemTable vv)) ITadd)
                         (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))))
 
-                    (if (and (not BACKTRACKING) (not EXITING))
+                    (if (== EXITING EXITING-NORMAL)
                       (begin
                         (%if* DEBUG-LOCK (begin
                           (= locked 0)))
@@ -971,14 +920,35 @@
                             (csym::removeITnode (ptr (aref vItemTable vv)) ITadd)))
                         (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))))
 
-                    (if (or BACKTRACKING EXITING)
+                    (if (!= EXITING EXITING-NORMAL)
                       (begin
                         (for ((= j 0) (<= j i) (inc j))
                           (dec (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) (- (- numC j) 1)))))))
 
+                    (if (or (== EXITING EXITING-NORMAL)
+                            (== EXITING EXITING-CANCEL)
+                            (== EXITING EXITING-EXCEPTION))
+                      (begin
+                        (if (aref numQe (fref -thr -> id))
+                          (begin
+                            (inc (fref pTsk -> numEmutexTrylock))
+                            (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
+                              (begin
+                                (inc (fref pTsk -> numEmutexLocked))
+                                (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
+                            (for ((= j 0) (< j (aref numQe (fref -thr -> id))) (inc j))
+                              (if (== (aref Qe (fref -thr -> id) j) v)
+                                (begin
+                                  (if (!= j (- (aref numQe (fref -thr -> id)) 1))
+                                    (begin
+                                      (csym::memmove (+ (aref Qe (fref -thr -> id)) j) (+ (aref Qe (fref -thr -> id)) (+ j 1)) (* (sizeof vtx) (- (aref numQe (fref -thr -> id)) (+ j 1))))))
+                                  (dec (aref numQe (fref -thr -> id))))))
+                            (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))))))
+
                     (-= (fref pTsk -> numC) cc)
                     (dec (fref pTsk -> numT)))))
               (begin
+                (csym::pthread_mutex_unlock (ptr (aref itMutex vv)))
                 (inc (fref pTsk -> numPruning))
                 (%if* DEBUG-SHOW (begin
                   (begin
@@ -1007,8 +977,8 @@
         (= (fref this maxC) i2)
         (= (fref this maxID) (fref pTsk -> maxID))
         (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
-        (= (fref this minID) (fref pTsk -> maxID))
-        (initExploreCCIG 1 NULL NULL NULL (ptr this))
+        (= (fref this minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr this))
         (= (fref this v) v)
         (csym::memcpy (fref this itemSet) itemSet (* (sizeof set) BIT-ITEM))
         (csym::memcpy (fref this vTraversed) (fref pTsk -> vTraversed) (* (sizeof int) V-SIZE))
@@ -1023,19 +993,14 @@
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
-        (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref this subgraph) head) -> next))
+          (= (fref (fref (fref (fref this subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref this subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref this subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref this treeDepth))
-        (+= (fref pTsk -> numITmutexTrylock) (fref this numITmutexTrylock))
-        (+= (fref pTsk -> numITmutexLocked) (fref this numITmutexLocked))
-        (+= (fref pTsk -> numEmutexTrylock) (fref this numEmutexTrylock))
-        (+= (fref pTsk -> numEmutexLocked) (fref this numEmutexLocked))
         (+= (fref pTsk -> numTraversed) (fref this numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref this numSubgraph))
-        ;(+= (fref pTsk -> numThreshold) (fref this numThreshold))
-        ;(+= (fref pTsk -> numPruning) (fref this numPruning))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 3) 0)
           (csym::fprintf fpCopy "%f, 1~%" (+ (csym::elapsedTime tpc (+ tpc 1)) (csym::elapsedTime (+ tpc 2) (+ tpc 3)))))))))
@@ -1056,30 +1021,30 @@
   (if (> (fref this minID) (fref this maxID))
     (csym::fprintf stderr "minID = %llu, maxID = %llu~%" (fref this minID) (fref this maxID)))
   (csym::gettimeofday tp 0)
-  (if (> (- (fref this maxID) (fref this minID)) (- (fref this maxC) (fref this minC)))
+  (if (!= (fref this minID) (fref this maxID))
     (begin
-      (= seq 0)
-      (catch (fref this v)
-        (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))))
+      (if (>= (cast int (csym::log2 (cast double (- (fref this maxID) (fref this minID))))) (fref option num-thrs))
+        (begin
+          (= seq 0)
+          (catch (fref this v)
+            (exploreCCIG (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (exploreCCIG2 (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this)))))
     (begin
       (= seq 1)
       (inc (aref seqTaskRequest (fref -thr -> id)))
       (exploreCCIG2 (fref this minC) (fref this maxC) (fref this v) (fref this itemSet) (ptr this))))
   (csym::gettimeofday (+ tp 1) 0)
-  (if (== (aref flagQe (fref -thr -> id)) 1)
-    (begin
-      (inc (fref this numEmutexTrylock))
-      (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-        (begin
-          (inc (fref this numEmutexLocked))
-          (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
-      (= (aref numQe (fref -thr -> id)) 0)
-      (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-      (= (aref flagQe (fref -thr -> id)) 0)))
   (+= (aref visit2Vertices (fref -thr -> id)) (fref this numSearch))
   (+= (aref thresholdPruning (fref -thr -> id)) (fref this numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref this numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref this numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref this numITmutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref this numITmutexLocked))
+  (+= (aref excpMutexTrylock (fref -thr -> id)) (fref this numEmutexTrylock))
+  (+= (aref excpMutexLocked (fref -thr -> id)) (fref this numEmutexLocked))
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref this numSearch) seq (fref -thr -> id))))
   (csym::free (fref this vTraversed))
@@ -1139,7 +1104,7 @@
                   (break)))))
           (begin
             (= visiting 1)))
-        (csym::pthread_mutex_unlock (ptr (aref itMutex i)))
+        ;(csym::pthread_mutex_unlock (ptr (aref itMutex i)))
 
         ;; if search the CCIG whose starting point is 'i', then
         (if visiting
@@ -1147,21 +1112,21 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "+++ Allons-y! +++~%")))
 
-            (%if* DEBUG-LOCK (begin
-              (= locked 0)))
-            (inc (fref pTsk -> numITmutexTrylock))
-            (if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex i))) 0)
-              (begin
-                (inc (fref pTsk -> numITmutexLocked))
-                (%if* DEBUG-LOCK (begin
-                  (= locked 1)
-                  (csym::gettimeofday tp 0)))
-                (csym::pthread_mutex_lock (ptr (aref itMutex i)))))
-            (%if* DEBUG-LOCK (begin
-              (if locked
-                (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (= locked 0)))
+            ;(inc (fref pTsk -> numITmutexTrylock))
+            ;(if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex i))) 0)
+            ;  (begin
+            ;    (inc (fref pTsk -> numITmutexLocked))
+            ;    (%if* DEBUG-LOCK (begin
+            ;      (= locked 1)
+            ;      (csym::gettimeofday tp 0)))
+            ;    (csym::pthread_mutex_lock (ptr (aref itMutex i)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (if locked
+            ;    (begin
+            ;      (csym::gettimeofday (+ tp 1) 0)
+            ;      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
             (= ITptr (fref (fref (aref vItemTable i) head) -> next))
             (while (!= ITptr (fref (aref vItemTable i) head))
               (inc (fref pTsk -> numTableReference))
@@ -1237,6 +1202,7 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "~%"))))
           (begin
+            (csym::pthread_mutex_unlock (ptr (aref itMutex i)))
             (inc (fref pTsk -> numPruning))
 
             (%if* DEBUG-SHOW (begin
@@ -1294,7 +1260,7 @@
                   (break)))))
           (begin
             (= visiting 1)))
-        (csym::pthread_mutex_unlock (ptr (aref itMutex i)))
+        ;(csym::pthread_mutex_unlock (ptr (aref itMutex i)))
 
         ;; if search the CCIG whose starting point is 'i', then
         (if visiting
@@ -1302,21 +1268,21 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "+++ Allons-y! +++~%")))
 
-            (%if* DEBUG-LOCK (begin
-              (= locked 0)))
-            (inc (fref pTsk -> numITmutexTrylock))
-            (if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex i))) 0)
-              (begin
-                (inc (fref pTsk -> numITmutexLocked))
-                (%if* DEBUG-LOCK (begin
-                  (= locked 1)
-                  (csym::gettimeofday tp 0)))
-                (csym::pthread_mutex_lock (ptr (aref itMutex i)))))
-            (%if* DEBUG-LOCK (begin
-              (if locked
-                (begin
-                  (csym::gettimeofday (+ tp 1) 0)
-                  (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (= locked 0)))
+            ;(inc (fref pTsk -> numITmutexTrylock))
+            ;(if (!= (csym::pthread_mutex_trylock (ptr (aref itMutex i))) 0)
+            ;  (begin
+            ;    (inc (fref pTsk -> numITmutexLocked))
+            ;    (%if* DEBUG-LOCK (begin
+            ;      (= locked 1)
+            ;      (csym::gettimeofday tp 0)))
+            ;    (csym::pthread_mutex_lock (ptr (aref itMutex i)))))
+            ;(%if* DEBUG-LOCK (begin
+            ;  (if locked
+            ;    (begin
+            ;      (csym::gettimeofday (+ tp 1) 0)
+            ;      (csym::fprintf fpLock "%f, %d~%" (csym::elapsedTime tp (+ tp 1)) locked)))))
             (= ITptr (fref (fref (aref vItemTable i) head) -> next))
             (while (!= ITptr (fref (aref vItemTable i) head))
               (inc (fref pTsk -> numTableReference))
@@ -1360,29 +1326,25 @@
             (inc (fref pTsk -> treeDepth))
             (inc (fref pTsk -> numTraversed))
 
-            (if (> (- (fref pTsk -> maxID) (fref pTsk -> minID)) (fref pTsk -> numC))
+            (if (!= (fref pTsk -> minID) (fref pTsk -> maxID))
               (begin
-                (catch i
-                  (exploreCCIG 0 (fref pTsk -> numC) i (aref vItem i) pTsk)
-                  (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
-                    (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0))))
+                (if (>= (cast int (csym::log2 (cast double (- (fref pTsk -> maxID) (fref pTsk -> minID))))) (fref option num-thrs))
+                  (begin
+                    (catch i
+                      (exploreCCIG 0 (fref pTsk -> numC) i (aref vItem i) pTsk)
+                      (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                        (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0))))
+                  (begin
+                    (inc (aref seqTaskRequest (fref -thr -> id)))
+                    (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk)
+                    (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
+                      (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0)))))
               (begin
                 (inc (aref seqTaskRequest (fref -thr -> id)))
                 (exploreCCIG2 0 (fref pTsk -> numC) i (aref vItem i) pTsk)
                 (for ((= j 0) (< j (fref pTsk -> numC)) (inc j))
                   (= (aref (fref pTsk -> vTraversed) (aref (fref pTsk -> C) j)) 0))))
 
-            (if (== (aref flagQe (fref -thr -> id)) 1)
-              (begin
-                (inc (fref pTsk -> numEmutexTrylock))
-                (if (!= (csym::pthread_mutex_trylock (ptr (aref excpMutex (fref -thr -> id)))) 0)
-                  (begin
-                    (inc (fref pTsk -> numEmutexLocked))
-                    (csym::pthread_mutex_lock (ptr (aref excpMutex (fref -thr -> id))))))
-                (= (aref numQe (fref -thr -> id)) 0)
-                (csym::pthread_mutex_unlock (ptr (aref excpMutex (fref -thr -> id))))
-                (= (aref flagQe (fref -thr -> id)) 0)))
-
             (%if* DEBUG-LOCK (begin
               (= locked 0)))
             (inc (fref pTsk -> numITmutexTrylock))
@@ -1410,6 +1372,7 @@
             (%if* DEBUG-SHOW (begin
               (csym::fprintf stderr "~%"))))
           (begin
+            (csym::pthread_mutex_unlock (ptr (aref itMutex i)))
             (inc (fref pTsk -> numPruning))
 
             (%if* DEBUG-SHOW (begin
@@ -1432,26 +1395,21 @@
         (= (fref this maxVertex) i2)
         (= (fref (fref this tsk) maxID) (fref pTsk -> maxID))
         (= (fref pTsk -> maxID) (+ (cast task-id (* (- (fref pTsk -> maxID) (fref pTsk -> minID)) 0.5)) (fref pTsk -> minID)))
-        (= (fref (fref this tsk) minID) (fref pTsk -> maxID))
-        (initExploreCCIG 0 NULL NULL NULL (ptr (fref this tsk)))
+        (= (fref (fref this tsk) minID) (+ (fref pTsk -> maxID) 1))
+        (initExploreCCIG NULL NULL NULL NULL (ptr (fref this tsk)))
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 1) 0))))
       (:get
         (%if* DEBUG-COPY (begin
           (csym::gettimeofday (+ tpc 2) 0)))
-        (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
-        (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
-        (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))
+        (%if* DEBUG-RSLT (begin
+          (= (fref (fref (fref (fref pTsk -> subgraph) head) -> prev) -> next) (fref (fref (fref (fref this tsk) subgraph) head) -> next))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> next) -> prev) (fref (fref (fref pTsk -> subgraph) head) -> prev))
+          (= (fref (fref (fref (fref (fref this tsk) subgraph) head) -> prev) -> next) (fref (fref pTsk -> subgraph) head))
+          (= (fref (fref (fref pTsk -> subgraph) head) -> prev) (fref (fref (fref (fref this tsk) subgraph) head) -> prev))))
         (+= (fref pTsk -> treeDepth) (fref (fref this tsk) treeDepth))
-        (+= (fref pTsk -> numITmutexTrylock) (fref (fref this tsk) numITmutexTrylock))
-        (+= (fref pTsk -> numITmutexLocked) (fref (fref this tsk) numITmutexLocked))
-        (+= (fref pTsk -> numEmutexTrylock) (fref (fref this tsk) numEmutexTrylock))
-        (+= (fref pTsk -> numEmutexLocked) (fref (fref this tsk) numEmutexLocked))
         (+= (fref pTsk -> numTraversed) (fref (fref this tsk) numTraversed))
         (+= (fref pTsk -> numSubgraph) (fref (fref this tsk) numSubgraph))
-        ;(+= (fref pTsk -> numThreshold) (fref (fref this tsk) numThreshold))
-        ;(+= (fref pTsk -> numPruning) (fref (fref this tsk) numPruning))
         (csym::free (fref (fref this tsk) vTraversed))
         (csym::free (fref (fref this tsk) C))
         (csym::free (fref (fref this tsk) T))
@@ -1465,10 +1423,16 @@
   (decl tp (array (struct timeval) 2))
   (inc (aref taskRequest (fref -thr -> id)))
   (csym::gettimeofday tp 0)
-  (if (> (- (fref (fref this tsk) maxID) (fref (fref this tsk) minID)) (- (fref this maxVertex) (fref this minVertex)))
+  (if (!= (fref (fref this tsk) minID) (fref (fref this tsk) maxID))
     (begin
-      (= seq 0)
-      (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))
+      (if (>= (cast int (csym::log2 (cast double (- (fref (fref this tsk) maxID) (fref (fref this tsk) minID))))) (fref option num-thrs))
+        (begin
+          (= seq 0)
+          (enumCCIG (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))
+        (begin
+          (= seq 1)
+          (inc (aref seqTaskRequest (fref -thr -> id)))
+          (enumCCIG2 (fref this minVertex) (fref this maxVertex) (ptr (fref this tsk))))))
     (begin
       (= seq 1)
       (inc (aref seqTaskRequest (fref -thr -> id)))
@@ -1478,6 +1442,10 @@
   (+= (aref thresholdPruning (fref -thr -> id)) (fref (fref this tsk) numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref (fref this tsk) numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref (fref this tsk) numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref (fref this tsk) numITmutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref (fref this tsk) numITmutexLocked))
+  (+= (aref excpMutexTrylock (fref -thr -> id)) (fref (fref this tsk) numEmutexTrylock))
+  (+= (aref excpMutexLocked (fref -thr -> id)) (fref (fref this tsk) numEmutexLocked))
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, %d, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref (fref this tsk) numSearch) seq (fref -thr -> id)))))
 
@@ -1516,21 +1484,22 @@
             (= l k)))))))
 
 ;;; Function: loadPatternFile - load pattern file
-(def (loadPatternFile patternFile maxNumItems eHash iHash) (fn void (ptr (const char)) (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
-  (def i int 0)                   ; 
+(def (loadPatternFile maxNumItems eHash iHash) (fn void (ptr int) (ptr (struct hsearch_data)) (ptr (struct hsearch_data)))
+  (def i int 0)                   ;
   (decl n int)                    ; item number
   (decl v int)                    ; vertex number
-  (decl item (ptr char))          ; 
+  (def v0 int 1)                  ;
+  (decl item (ptr char))          ;
   (decl buff (array char 256))    ; buffer
   (decl temp (array char 256))    ;
   (decl he (struct entry))        ;
-  (decl hep (ptr (struct entry))) ; 
+  (decl hep (ptr (struct entry))) ;
   (decl fp (ptr FILE))            ; file pointer
 
   ;; open pattern file
-  (if (== (= fp (csym::fopen patternFile "r")) NULL)
+  (if (== (= fp (csym::fopen P-FILE "r")) NULL)
     (begin
-      (csym::fprintf stderr "Cannot open pattern file: %s~%" patternFile)
+      (csym::fprintf stderr "Cannot open pattern file: %s~%" P-FILE)
       (exit EXIT-FAILURE)))
 
   ;; read a line of data from pattern file
@@ -1540,16 +1509,18 @@
       (begin
         (= v (csym::atoi (csym::strtok buff "~|11|")))
 
-        ;; find v from eHash
+        ;; enter v to eHash
         (csym::sprintf temp "%d" v)
         (= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (continue))
+          (begin
+            (= (fref he data) (cast (ptr void) (inc v0)))
+            (csym::hsearch_r he ENTER (ptr hep) eHash)))
         (= v (cast int (fref hep -> data)))
 
         ;; add item to Vertex Data
-        (while (!= (= item (csym::strtok NULL ",")) NULL)
+	(while (!= (= item (csym::strtok NULL ",")) NULL)
           (= n (csym::atoi item))
 
           ;; enter n to iHash
@@ -1617,21 +1588,21 @@
   (inc (aref vDegree v1)))
 
 ;;; Function: loadGraphFile - load graph file
-(def (loadGraphFile graphFile edgeMax minVertex maxVertex eHash) (fn void (ptr (const char)) (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
-  (def v int 1)                   ; 
+(def (loadGraphFile edgeMax minVertex maxVertex eHash) (fn void (ptr int) (ptr int) (ptr int) (ptr (struct hsearch_data)))
+  (def v int 1)                   ;
   (defs int v1 v2)                ; starting point, ending point
   (decl eLabel (ptr char))        ; label of edge
-  (decl empty (ptr char))         ; 
+  (decl empty (ptr char))         ;
   (decl buff (array char 256))    ; buffer
   (decl temp (array char 256))    ;
   (decl he (struct entry))        ;
-  (decl hep (ptr (struct entry))) ; 
+  (decl hep (ptr (struct entry))) ;
   (decl fp (ptr FILE))            ; file pointer
 
   ;; open graph file
-  (if (== (= fp (csym::fopen graphFile "r")) NULL)
+  (if (== (= fp (csym::fopen G-FILE "r")) NULL)
     (begin
-      (csym::fprintf stderr "Cannot open graph file: %s~%" graphFile)
+      (csym::fprintf stderr "Cannot open graph file: %s~%" G-FILE)
       (exit EXIT-FAILURE)))
 
   ;; read a line of data from graph file
@@ -1644,32 +1615,29 @@
         (= v2 (csym::atoi (csym::strtok NULL "~|11|")))
         (= empty (csym::strtok NULL "~|11|"))
 
-        ;; enter v1 to eHash
+        ;; find v1 from eHash
         (csym::sprintf temp "%d" v1)
-        (= (fref he key) temp)
+	(= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (begin
-            (= (fref he data) (cast (ptr void) (inc v)))
-            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+          (continue))
         (= v1 (cast int (fref hep -> data)))
 
-        ;; enter v2 to eHash
+	;; find v2 from eHash
         (csym::sprintf temp "%d" v2)
         (= (fref he key) temp)
         (csym::hsearch_r he FIND (ptr hep) eHash)
         (if (== hep NULL)
-          (begin
-            (= (fref he data) (cast (ptr void) (inc v)))
-            (csym::hsearch_r he ENTER (ptr hep) eHash)))
+          (continue))
         (= v2 (cast int (fref hep -> data)))
 
         ;; add edge to Edge List
         (if (== empty NULL)
           (if (!= v1 v2)
-            (begin
-              (createEdge v1 v2 edgeMax minVertex maxVertex)
-              (createEdge v2 v1 edgeMax minVertex maxVertex)))))))
+            (if (and (< th (aref vNumItems v1)) (< th (aref vNumItems v2)))
+              (begin
+	                    (createEdge v1 v2 edgeMax minVertex maxVertex)
+                (createEdge v2 v1 edgeMax minVertex maxVertex))))))))
 
   ;; close graph file
   (csym::fclose fp))
@@ -1704,17 +1672,21 @@
   (for ((= i 0) (< i NUM-WORKERS) (inc i))
     (for ((= j 0) (< j Q-SIZE) (inc j))
       (= (aref Qe i j) 0))
-    (= (aref numQe i) 0)
-    (= (aref flagQe i) 0))
+    (= (aref numQe i) 0))
 
   ;; initialize Debug Data
   (for ((= i 0) (< i NUM-WORKERS) (inc i))
+    (= (aref searchSpace i) 0)
     (= (aref visit2Vertices i) 0)
     (= (aref thresholdPruning i) 0)
     (= (aref inclusivePruning i) 0)
     (= (aref taskRequest i) 0)
     (= (aref seqTaskRequest i) 0)
     (= (aref tableReference i) 0)
+    (= (aref tableMutexTrylock i) 0)
+    (= (aref tableMutexLocked i) 0)
+    (= (aref excpMutexTrylock i) 0)
+    (= (aref excpMutexLocked i) 0)
     (= (aref numRedundantSearch i) 0)
     (= (aref numThrow i) 0))
 
@@ -1774,62 +1746,72 @@
   (defs (struct hsearch_data) eHash iHash)
 
   ;; Debug Data
-  (def numSearch uint64_t 0)             ; # of search space
-  (def maxWorkerSearch uint64_t 0)       ; 
-  (def avgWorkerSearch double 0.0)       ;  
-  (def workerSearchSD double 0.0)        ;
-  (def avgWorkerSearchPerSec double 0.0) ; 
-  (def workerSearchPerSecSD double 0.0)  ;
-  (def numTaskRequest int 0)             ; # of task request 
-  (def avgTaskRequest double 0.0)        ;
-  (def taskRequestSD double 0.0)         ;
-  (def numSeqTaskRequest int 0)          ; # of seq. task request
-  (def avgSeqTaskRequest double 0.0)     ;
-  (def seqTaskRequestSD double 0.0)      ;
-  (def numAllTaskRequest int 0)          ; # of all task request
-  (def avgAllTaskRequest double 0.0)     ;
-  (def allTaskRequestSD double 0.0)      ;
-  (def numTableReference uint64_t 0)     ; 
-  (def avgTableReference double 0.0)     ; 
-  (def tableReferenceSD double 0.0)      ; 
-  (def avgSizeSubgraph uint64_t 0)       ;
-  (def maxSizeSubgraph int 0)            ;
-  (def numThrowException int 0)          ; # of thrown exceptions
+  (def numSearch uint64_t 0)                      ; # of search spaces
+  (def maxWorkerSearch uint64_t 0)                ; 
+  (def minWorkerSearch uint64_t UINT-LEAST64-MAX) ; 
+  (def avgWorkerSearch double 0.0)                ; 
+  (def workerSearchSD double 0.0)                 ; 
+  (def avgWorkerSearchPerSec double 0.0)          ; 
+  (def workerSearchPerSecSD double 0.0)           ; 
+  (def numTaskRequest int 0)                      ; # of task requests
+  (def avgTaskRequest double 0.0)                 ; 
+  (def taskRequestSD double 0.0)                  ; 
+  (def numSeqTaskRequest int 0)                   ; # of seq. task requests
+  (def avgSeqTaskRequest double 0.0)              ; 
+  (def seqTaskRequestSD double 0.0)               ; 
+  (def numAllTaskRequest int 0)                   ; # of all task requests
+  (def avgAllTaskRequest double 0.0)              ; 
+  (def allTaskRequestSD double 0.0)               ; 
+  (def numTableReference uint64_t 0)              ; 
+  (def avgTableReference double 0.0)              ; 
+  (def tableReferenceSD double 0.0)               ;
+  (def numTableMutexTrylock uint64_t 0)           ; 
+  (def avgTableMutexTrylock double 0.0)           ; 
+  (def tableMutexTrylockSD double 0.0)            ; 
+  (def numTableMutexLocked uint64_t 0)            ; 
+  (def avgTableMutexLocked double 0.0)            ; 
+  (def tableMutexLockedSD double 0.0)             ; 
+  (def numExcpMutexTrylock uint64_t 0)            ; 
+  (def avgExcpMutexTrylock double 0.0)            ; 
+  (def excpMutexTrylockSD double 0.0)             ; 
+  (def numExcpMutexLocked uint64_t 0)             ; 
+  (def avgExcpMutexLocked double 0.0)             ; 
+  (def excpMutexLockedSD double 0.0)              ; 
+  (def avgSizeSubgraph uint64_t 0)                ; 
+  (def maxSizeSubgraph int 0)                     ; 
+  (def numFindRedundant int 0)                    ; # of finding redundant searches
+  (def avgFindRedundant double 0.0)               ; 
+  (def findRedundantSD double 0.0)                ; 
+  (def numThrowException int 0)                   ; # of thrown exceptions
+  (def avgThrowException double 0.0)              ; 
+  (def throwExceptionSD double 0.0)               ; 
 
   ;; arguments
-  (= patternFile "data/symatlas_pattern.txt")
-  (= graphFile "data/symatlas_graph.txt")
-  ;(= patternFile "data/dblp_author-of.tab")
-  ;(= graphFile "data/dblp_cites_network.tab")
-  ;(= patternFile "data/eg_pattern.txt")
-  ;(= graphFile "data/eg_graph.txt")
-  ;(= patternFile "data/eg2_pattern.txt")
-  ;(= graphFile "data/eg2_graph.txt")
   (= th (fref this th))
   (= spawnSize (fref this spawnSize))
   (= resultFile "result.txt")
   (if USE-SPN-RANGE
     (begin
-      (csym::sprintf timeFile "time3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-      (csym::sprintf taskFile "task3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-      (csym::sprintf lockFile "lock3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-      (csym::sprintf copyFile "copy3-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+      (csym::sprintf timeFile "time4-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf taskFile "task4-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf lockFile "lock4-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+      (csym::sprintf copyFile "copy4-%02d_%d-%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
     (begin
       (if USE-SPN-RATIO
         (begin
-          (csym::sprintf timeFile "time3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-          (csym::sprintf taskFile "task3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-          (csym::sprintf lockFile "lock3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
-          (csym::sprintf copyFile "copy3-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
+          (csym::sprintf timeFile "time4-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf taskFile "task4-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf lockFile "lock4-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize))
+          (csym::sprintf copyFile "copy4-%02d_%d_%d.csv" (fref option num-thrs) (fref this th) (fref this spawnSize)))
         (begin
-          (csym::sprintf timeFile "time3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
-          (csym::sprintf taskFile "task3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
-          (csym::sprintf lockFile "lock3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
-          (csym::sprintf copyFile "copy3-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
+          (csym::sprintf timeFile "time4-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf taskFile "task4-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf lockFile "lock4-%02d_%d-half.csv" (fref option num-thrs) (fref this th))
+          (csym::sprintf copyFile "copy4-%02d_%d-half.csv" (fref option num-thrs) (fref this th))))))
 
   ;; set ID
   (= (fref tsk minID) 0)
-  (= (fref tsk maxID) UINT-LEAST64-MAX)
+  (= (fref tsk maxID) -1)
 
   ;; init pthread
   ;(csym::pthread_attr_init (ptr attr))
@@ -1838,14 +1820,14 @@
   ;; initialize Edge Data & Vertex Data & Debug Data
   (initData (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr maxNumItems) (ptr eHash) (ptr iHash))
 
-  ;; load graph file
-  (loadGraphFile graphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
-
   ;; load pattern file
-  (loadPatternFile patternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+  (loadPatternFile (ptr maxNumItems) (ptr eHash) (ptr iHash))
+
+  ;; load graph file
+  (loadGraphFile (ptr edgeMax) (ptr minVertex) (ptr maxVertex) (ptr eHash))
 
   ;; delete the vertex whose # of items is less than the user-specified threshold
-  (thresholdItem minVertex maxVertex)
+  ;(thresholdItem minVertex maxVertex)
 
   ;; set the range of enumCCIG loop
   (= loopRange (cast int (/ (- (+ maxVertex 1) minVertex) (fref this loopRatio))))
@@ -1856,7 +1838,7 @@
   ;  (= (fref (aref data i) loopEnd) (* (/ (- maxVertex minVertex) (fref option num-thrs)) (+ i 1))))
 
   ;; init T-exploreCCIG
-  (initExploreCCIG 0 NULL NULL NULL (ptr tsk))
+  (initExploreCCIG NULL NULL NULL NULL (ptr tsk))
 
   ;; init mutex
   (for ((= i 0) (< i V-SIZE) (inc i))
@@ -1904,7 +1886,7 @@
 
     ;; re-set ID
     (= (fref tsk minID) 0)
-    (= (fref tsk maxID) UINT-LEAST64-MAX))
+    (= (fref tsk maxID) -1))
   (enumCCIG i (+ maxVertex 1) (ptr tsk))
 
   ;(for ((= j 1) (< j (fref this loopRatio)) (inc j)) 
@@ -1956,10 +1938,15 @@
   (%if* DEBUG-TASK (begin
     (csym::fprintf fpTask "%f, %f, %f, %llu, 0, %d~%" (csym::elapsedTime (ptr t0) tp) (csym::elapsedTime tp (+ tp 1)) (csym::elapsedTime (ptr t0) (+ tp 1)) (fref tsk numSearch) (fref -thr -> id))
     (csym::fclose fpTask)))
+
   (+= (aref visit2Vertices (fref -thr -> id)) (fref tsk numSearch))
   (+= (aref thresholdPruning (fref -thr -> id)) (fref tsk numThreshold))
   (+= (aref inclusivePruning (fref -thr -> id)) (fref tsk numPruning))
   (+= (aref tableReference (fref -thr -> id)) (fref tsk numTableReference))
+  (+= (aref tableMutexTrylock (fref -thr -> id)) (fref tsk numITmutexTrylock))
+  (+= (aref tableMutexLocked (fref -thr -> id)) (fref tsk numITmutexLocked))
+  (+= (aref excpMutexTrylock (fref -thr -> id)) (fref tsk numEmutexTrylock))
+  (+= (aref excpMutexLocked (fref -thr -> id)) (fref tsk numEmutexLocked))
 
   (%if* DEBUG-TIME (begin
     ;; open time file
@@ -2051,18 +2038,32 @@
     (+= numSearch (aref searchSpace j))
     (if (< maxWorkerSearch (aref searchSpace j))
       (= maxWorkerSearch (aref searchSpace j)))
+    (if (> minWorkerSearch (aref searchSpace j))
+      (= minWorkerSearch (aref searchSpace j)))
     (+= avgWorkerSearchPerSec (/ (aref searchSpace j) (csym::elapsedTime tp (+ tp 1))))
     (+= numTaskRequest (aref taskRequest j))
     (+= numSeqTaskRequest (aref seqTaskRequest j))
     (+= numAllTaskRequest (aref taskRequest j))
     (+= numAllTaskRequest (aref seqTaskRequest j))
-    (+= numTableReference (aref tableReference j)))
+    (+= numTableReference (aref tableReference j))
+    (+= numTableMutexTrylock (aref tableMutexTrylock j))
+    (+= numTableMutexLocked (aref tableMutexLocked j))
+    (+= numExcpMutexTrylock (aref excpMutexTrylock j))
+    (+= numExcpMutexLocked (aref excpMutexLocked j))
+    (+= numFindRedundant (aref numRedundantSearch j))
+    (+= numThrowException (aref numThrow j)))
   (= avgWorkerSearch (/ (cast double numSearch) (cast double (fref option num-thrs))))
   (= avgWorkerSearchPerSec (/ avgWorkerSearchPerSec (cast double (fref option num-thrs))))
   (= avgTaskRequest (/ (cast double numTaskRequest) (cast double (fref option num-thrs))))
   (= avgSeqTaskRequest (/ (cast double numSeqTaskRequest) (cast double (fref option num-thrs))))
   (= avgAllTaskRequest (/ (cast double (+ numTaskRequest numSeqTaskRequest)) (cast double (fref option num-thrs))))
   (= avgTableReference (/ (cast double numTableReference) (cast double (fref option num-thrs))))
+  (= avgTableMutexTrylock (/ (cast double numTableMutexTrylock) (cast double (fref option num-thrs))))
+  (= avgTableMutexLocked (/ (cast double numTableMutexLocked) (cast double (fref option num-thrs))))
+  (= avgExcpMutexTrylock (/ (cast double numExcpMutexTrylock) (cast double (fref option num-thrs))))
+  (= avgExcpMutexLocked (/ (cast double numExcpMutexLocked) (cast double (fref option num-thrs))))
+  (= avgFindRedundant (/ (cast double numFindRedundant) (cast double (fref option num-thrs))))
+  (= avgThrowException (/ (cast double numThrowException) (cast double (fref option num-thrs))))
 
   (for ((= j 0) (< j (fref option num-thrs)) (inc j))
     (+= workerSearchSD (csym::pow (- (aref searchSpace j) avgWorkerSearch) 2.0))
@@ -2070,27 +2071,47 @@
     (+= taskRequestSD (csym::pow (- (aref taskRequest j) avgTaskRequest) 2.0))
     (+= seqTaskRequestSD (csym::pow (- (aref seqTaskRequest j) avgSeqTaskRequest) 2.0))
     (+= allTaskRequestSD (csym::pow (- (+ (aref taskRequest j) (aref seqTaskRequest j)) avgAllTaskRequest) 2.0))
-    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0)))
+    (+= tableReferenceSD (csym::pow (- (aref tableReference j) avgTableReference) 2.0))
+    (+= tableMutexTrylockSD (csym::pow (- (aref tableMutexTrylock j) avgTableMutexTrylock) 2.0))
+    (+= tableMutexLockedSD (csym::pow (- (aref tableMutexLocked j) avgTableMutexLocked) 2.0))
+    (+= excpMutexTrylockSD (csym::pow (- (aref excpMutexTrylock j) avgExcpMutexTrylock) 2.0))
+    (+= excpMutexLockedSD (csym::pow (- (aref excpMutexLocked j) avgExcpMutexLocked) 2.0))
+    (+= findRedundantSD (csym::pow (- (aref numRedundantSearch j) avgFindRedundant) 2.0))
+    (+= throwExceptionSD (csym::pow (- (aref numThrow j) avgThrowException) 2.0)))
   (/= workerSearchSD (fref option num-thrs))
   (/= workerSearchPerSecSD (fref option num-thrs))
   (/= taskRequestSD (fref option num-thrs))
   (/= seqTaskRequestSD (fref option num-thrs))
   (/= allTaskRequestSD (fref option num-thrs))
   (/= tableReferenceSD (fref option num-thrs))
+  (/= tableMutexTrylockSD (fref option num-thrs))
+  (/= tableMutexLockedSD (fref option num-thrs))
+  (/= excpMutexTrylockSD (fref option num-thrs))
+  (/= excpMutexLockedSD (fref option num-thrs))
+  (/= findRedundantSD (fref option num-thrs))
+  (/= throwExceptionSD (fref option num-thrs))
   (= workerSearchSD (csym::sqrt workerSearchSD))
   (= workerSearchPerSecSD (csym::sqrt workerSearchPerSecSD))
   (= taskRequestSD (csym::sqrt taskRequestSD))
   (= seqTaskRequestSD (csym::sqrt seqTaskRequestSD))
   (= allTaskRequestSD (csym::sqrt allTaskRequestSD))
   (= tableReferenceSD (csym::sqrt tableReferenceSD))
-
-  (csym::fprintf stderr "# of searches = %llu, Max = %d, Avg. = %.1f, S.D. = %.1f~%" numSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
+  (= tableMutexTrylockSD (csym::sqrt tableMutexTrylockSD))
+  (= tableMutexLockedSD (csym::sqrt tableMutexLockedSD))
+  (= excpMutexTrylockSD (csym::sqrt excpMutexTrylockSD))
+  (= excpMutexLockedSD (csym::sqrt excpMutexLockedSD))
+  (= findRedundantSD (csym::sqrt findRedundantSD))
+  (= throwExceptionSD (csym::sqrt throwExceptionSD))
+
+  (csym::fprintf stderr "# of searches = %llu, Min = %llu, Max = %llu, Avg. = %.1f, S.D. = %.1f~%" numSearch minWorkerSearch maxWorkerSearch avgWorkerSearch workerSearchSD)
   (csym::fprintf stderr "# of task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numTaskRequest avgTaskRequest taskRequestSD)
   (csym::fprintf stderr "# of seq. task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numSeqTaskRequest avgSeqTaskRequest seqTaskRequestSD)
   (csym::fprintf stderr "# of all task requests = %d, Avg. = %.1f, S.D. = %.1f~%" numAllTaskRequest avgAllTaskRequest allTaskRequestSD)
   (csym::fprintf stderr "# of searches / sec = %.1f, Avg. = %.1f, S.D. = %.1f~%" (/ numSearch (csym::elapsedTime tp (+ tp 1))) avgWorkerSearchPerSec workerSearchPerSecSD)
   (csym::fprintf stderr "# of table references = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableReference avgTableReference tableReferenceSD)
-  (csym::fprintf stderr "# of ITmutex trylock = %llu, " (fref tsk numITmutexTrylock))
-  (csym::fprintf stderr "# of ITmutex locked = %llu(%.3f%%)~%" (fref tsk numITmutexLocked) (* (/ (cast double (fref tsk numITmutexLocked)) (cast double (fref tsk numITmutexTrylock))) 100.0))
-  (csym::fprintf stderr "# of Emutex trylock = %llu, " (fref tsk numEmutexTrylock))
-  (csym::fprintf stderr "# of Emutex locked = %llu(%.3f%%)~%" (fref tsk numEmutexLocked) (* (/ (cast double (fref tsk numEmutexLocked)) (cast double (fref tsk numEmutexTrylock))) 100.0)))
+  (csym::fprintf stderr "# of ITmutex trylock = %llu, Avg. = %.1f, S.D. = %.1f~%" numTableMutexTrylock avgTableMutexTrylock tableMutexTrylockSD)
+  (csym::fprintf stderr "# of ITmutex locked = %llu(%.3f%%), Avg. = %.1f, S.D. = %.1f~%" numTableMutexLocked (* (/ (cast double numTableMutexLocked) (cast double numTableMutexTrylock)) 100.0) avgTableMutexLocked tableMutexLockedSD)
+  (csym::fprintf stderr "# of Emutex trylock = %llu, Avg. = %.1f, S.D. = %.1f~%" numExcpMutexTrylock avgExcpMutexTrylock excpMutexTrylockSD)
+  (csym::fprintf stderr "# of Emutex locked = %llu(%.3f%%), Avg. = %.1f, S.D. = %.1f~%" numExcpMutexLocked (* (/ (cast double numExcpMutexLocked) (cast double numExcpMutexTrylock)) 100.0) avgExcpMutexLocked excpMutexLockedSD)
+  (csym::fprintf stderr "# of finding redundant searches = %d, Avg. = %.1f, S.D. = %.1f~%" numFindRedundant avgFindRedundant findRedundantSD)
+  (csym::fprintf stderr "# of throwing exceptions = %d, Avg. = %.1f, S.D. = %.1f~%" numThrowException avgThrowException throwExceptionSD))
diff --git a/src/sample/tcell/dprint.sh b/src/sample/tcell/dprint.sh
index 8a406b1d..65b3e56a 100644
--- a/src/sample/tcell/dprint.sh
+++ b/src/sample/tcell/dprint.sh
@@ -8,3 +8,12 @@
  %else
  (%defmacro DEBUG-STMTS (n &rest stmts) `(begin))
  (%defmacro DEBUG-PRINT (n &rest args) `(begin)))
+
+;;; Profiler
+(%ifndef* PROFILE
+  (%defconstant PROFILE 0))             ; non-nil: Profiler ON
+(%if* PROFILE
+ (%defmacro PROF-CODE (&rest stmts) `(%splice ,@stmts))
+ %else
+ (%defmacro PROF-CODE (n &rest stmts) `(%splice))
+ )
diff --git a/src/sample/tcell/fib-guard.tcell b/src/sample/tcell/fib-guard.tcell
index 46f52e2d..af5593a5 100644
--- a/src/sample/tcell/fib-guard.tcell
+++ b/src/sample/tcell/fib-guard.tcell
@@ -29,7 +29,7 @@
 
 (c-exp "#include<sys/time.h>")
 
-;; ワーカごとに処理したタスクの数をカウントして表示
+;; �����若�������������������������帥�鴻�������違����������潟��������茵�腓�
 ;; (%defconstant COUNT-NTASK 1)
 
 (%ifndef* NF-TYPE
diff --git a/src/sample/tcell/fib-thr.tcell b/src/sample/tcell/fib-thr.tcell
new file mode 100644
index 00000000..b5f16db2
--- /dev/null
+++ b/src/sample/tcell/fib-thr.tcell
@@ -0,0 +1,166 @@
+;;; Copyright (c) 2008-2017 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Fibonacci
+;;; An example and benchmark of aborting tasks by a "throw" statement.
+;;; This is based on fib.tcell but aborts when the intermediate sum exceeds 
+;;; <threshold>% of the real answer.
+
+;; task 0 0 0 1
+;; <n>
+;; <threshold>
+
+(c-exp "#include<sys/time.h>")
+
+;; �����若�������������������������帥�鴻�������違����������潟��������茵�腓�
+(%defconstant COUNT-NTASK 0)
+;; Probability guard���篏帥��
+(%defconstant USE-PROBGUARD 0)
+
+(%ifndef* NF-TYPE
+  (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
+(%include "rule/tcell-setrule.sh")
+
+(%include "clib.sh")
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(%if* COUNT-NTASK
+  (def worker-data
+      (def n-task long))
+  (def worker-init
+      (= WDATA.n-task 0))
+  )
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(def N0 long 0)
+(def (csym::my-probability n) (fn double int)
+  (if (< n 20)
+    (return (/ (cast double n) 20.0))
+    (return 1.0)))
+  ; threshold based probability
+  ; (if (< n 20)
+  ;   (return 0.0)
+  ;   (return 1.0)))
+  
+(decl (fib n) (wfn long long))
+  
+(def (task fib)
+  (def n long :in)
+  (def r long :out))
+
+(def (task-body fib)
+    ;;(csym::fprintf stderr "start fib(%d)~%" (fref this n))
+  (%if* COUNT-NTASK
+    (++ WDATA.n-task)
+    (csym::fprintf stderr "%d starts %d-th task.~%" WORKER-ID WDATA.n-task))
+  (%if* USE-PROBGUARD
+    (= PROBABILITY (csym::my-probability this.n)))
+  (= this.r (fib this.n))
+  )
+
+(def Threshold long)
+(def Tp (array (struct timeval) 2))
+(def (task fib-start)
+  (def n long :in)
+  (def threshold long :in)
+  (def r long :out))
+
+(def (csym::fib-seq n) (csym::fn long long)
+  (def s int 1)
+  (def n1 int 1)
+  (def n2 int)
+  (def i int)
+  (for ((= i 3) (<= i n) (inc i))
+    (= n2 n1)
+    (= n1 s)
+    (= s (+ n1 n2)))
+  (return s))
+
+(def (task-body fib-start)
+  (decl tp (array (struct timeval) 2))
+  (csym::fprintf stderr "start fib(%ld)~%" this.n)
+  (%if* COUNT-NTASK
+    (++ WDATA.n-task)
+    (csym::fprintf stderr "%d starts %ld-th task.~%" WORKER-ID WDATA.n-task))
+  (= N0 this.n)
+  (= Threshold (/ (* (csym::fib-seq this.n) this.threshold) 100))
+  (csym::fprintf stderr "Threshold: %ld * %ld / 100 = %ld~%"
+		 (csym::fib-seq this.n) this.threshold Threshold)
+  (csym::gettimeofday tp 0)
+  (= (aref Tp 0) (aref tp 0))
+  (catch 1
+    (= this.r 1)
+    (fib this.n)
+    (= this.r 0))
+  (csym::gettimeofday (+ tp 1) 0)
+  (csym::fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+
+(def (task-receiver fib)
+    ;;(csym::fprintf stderr "receive %d~%" this.n)
+    )
+
+(def (task-sender fib)
+    ;;(csym::fprintf stderr "send %d~%" this.n)
+    )
+
+(def (rslt-sender fib)
+    ;;(csym::fprintf stderr "send fib(%d)=%d~%" this.n this.r)
+    )
+
+(def (rslt-receiver fib)
+    ;;(csym::fprintf stderr "receive fib(%d)=%d~%" this.n this.r)
+    )
+
+(def (fib n) (wfn long long)
+  (if (<= n 2)
+      (return 1)
+    (begin
+      (def s1 long)
+      (def s2 long)
+      (do-two
+          (= s1 (fib (- n 1)))
+	  (= s2 (fib (- n 2)))
+        (handles fib
+         (:put
+          (%if* USE-PROBGUARD
+            (= PROBABILITY (csym::my-probability (- n 2))))
+          (= this.n (- n 2)))
+         (:get (= s2 this.r))))
+      (if (> (+ s1 s2) Threshold)
+          (begin
+           (csym::gettimeofday (+ Tp 1) 0)
+           (csym::fprintf stderr "etime: %lf~%s=%ld~%"  (csym::elapsed-time Tp) (+ s1 s2))
+           (throw 1)))
+      (return (+ s1 s2)))))
diff --git a/src/sample/tcell/fib-excep.tcell b/src/sample/tcell/fib-try.tcell
similarity index 71%
rename from src/sample/tcell/fib-excep.tcell
rename to src/sample/tcell/fib-try.tcell
index 532fc281..96087d50 100644
--- a/src/sample/tcell/fib-excep.tcell
+++ b/src/sample/tcell/fib-try.tcell
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2015-2017 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -22,16 +22,17 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;;; An example of aborting tasks by a "throw" statement.
-;;; This is based on fib.tcell but aborts when fib(42) is called.
+;;; Fibonacci (useless try block is added for performance evaluations)
 
 ;; task 0 0 0 0
 ;; <n>
 
 (c-exp "#include<sys/time.h>")
 
-;; ワーカごとに処理したタスクの数をカウントして表示
-;; (%defconstant COUNT-NTASK 1)
+;; �����若�������������������������帥�鴻�������違����������潟��������茵�腓�
+(%defconstant COUNT-NTASK 0)
+;; Probability guard���篏帥��
+(%defconstant USE-PROBGUARD 0)
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
@@ -50,44 +51,54 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(%ifdef* COUNT-NTASK
+(%if* COUNT-NTASK
   (def worker-data
-      (def n-task int))
+      (def n-task long))
   (def worker-init
       (= WDATA.n-task 0))
   )
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(def N0 int 0)
+(def N0 long 0)
+(def (csym::my-probability n) (fn double int)
+  (if (< n 20)
+    (return (/ (cast double n) 20.0))
+    (return 1.0)))
+  ; threshold based probability
+  ; (if (< n 20)
+  ;   (return 0.0)
+  ;   (return 1.0)))
   
-(decl (fib n) (wfn int int))
+(decl (fib n) (wfn long long))
   
 (def (task fib)
-  (def n int :in)
-  (def r int :out))
+  (def n long :in)
+  (def r long :out))
 
 (def (task-body fib)
-  (%ifdef* COUNT-NTASK
+    ;;(csym::fprintf stderr "start fib(%d)~%" (fref this n))
+  (%if* COUNT-NTASK
     (++ WDATA.n-task)
     (csym::fprintf stderr "%d starts %d-th task.~%" WORKER-ID WDATA.n-task))
+  (%if* USE-PROBGUARD
+    (= PROBABILITY (csym::my-probability this.n)))
   (= this.r (fib this.n))
   )
 
 (def (task fib-start)
-  (def n int :in)
-  (def r int :out))
+  (def n long :in)
+  (def r long :out))
 
 (def (task-body fib-start)
   (decl tp (array (struct timeval) 2))
-  (csym::fprintf stderr "start fib(%d)~%" this.n)
-  (%ifdef* COUNT-NTASK
+  (csym::fprintf stderr "start fib(%ld)~%" this.n)
+  (%if* COUNT-NTASK
     (++ WDATA.n-task)
-    (csym::fprintf stderr "%d starts %d-th task.~%" WORKER-ID WDATA.n-task))
+    (csym::fprintf stderr "%d starts %ld-th task.~%" WORKER-ID WDATA.n-task))
   (= N0 this.n)
   (csym::gettimeofday tp 0)
-  (catch 0
-    (= this.r (fib this.n)))
+  (= this.r (fib this.n))
   (csym::gettimeofday (+ tp 1) 0)
   (csym::fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
 
@@ -107,23 +118,20 @@
     ;;(csym::fprintf stderr "receive fib(%d)=%d~%" this.n this.r)
     )
 
-(def (fib n) (wfn int int)
-  ;; When non-zero is thrown here, the exception is not caught in task-body
-  ;; and thus execution time is not printed.
-  (if (== n 42)
-      (throw 0))
-  (if (<= n 2)
+(def (fib n) (wfn long long)
+  (catch 1 ; meaningless catch for performance evaluation
+   (if (<= n 2)
       (return 1)
     (begin
-      (def s1 int)
-      (def s2 int)
+      (def s1 long)
+      (def s2 long)
       (do-two
           (= s1 (fib (- n 1)))
 	  (= s2 (fib (- n 2)))
         (handles fib
          (:put
-          (%ifdef* USE-PROBGUARD
+          (%if* USE-PROBGUARD
             (= PROBABILITY (csym::my-probability (- n 2))))
           (= this.n (- n 2)))
          (:get (= s2 this.r))))
-      (return (+ s1 s2)))))
+      (return (+ s1 s2))))) )
diff --git a/src/sample/tcell/fib.tcell b/src/sample/tcell/fib.tcell
index aaeca21c..77751637 100644
--- a/src/sample/tcell/fib.tcell
+++ b/src/sample/tcell/fib.tcell
@@ -29,10 +29,10 @@
 
 (c-exp "#include<sys/time.h>")
 
-;; ワーカごとに処理したタスクの数をカウントして表示
-;; (%defconstant COUNT-NTASK 1)
-;; Probability guardを使う
-(%defconstant USE-PROBGUARD 1)
+;; �����若�������������������������帥�鴻�������違����������潟��������茵�腓�
+(%defconstant COUNT-NTASK 0)
+;; Probability guard���篏帥��
+(%defconstant USE-PROBGUARD 0)
 
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC)) ; one of (GCC LW-SC CL-SC XCC XCCCL)
@@ -51,16 +51,16 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(%ifdef* COUNT-NTASK
+(%if* COUNT-NTASK
   (def worker-data
-      (def n-task int))
+      (def n-task long))
   (def worker-init
       (= WDATA.n-task 0))
   )
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(def N0 int 0)
+(def N0 long 0)
 (def (csym::my-probability n) (fn double int)
   (if (< n 20)
     (return (/ (cast double n) 20.0))
@@ -70,32 +70,32 @@
   ;   (return 0.0)
   ;   (return 1.0)))
   
-(decl (fib n) (wfn int int))
+(decl (fib n) (wfn long long))
   
 (def (task fib)
-  (def n int :in)
-  (def r int :out))
+  (def n long :in)
+  (def r long :out))
 
 (def (task-body fib)
     ;;(csym::fprintf stderr "start fib(%d)~%" (fref this n))
-  (%ifdef* COUNT-NTASK
+  (%if* COUNT-NTASK
     (++ WDATA.n-task)
     (csym::fprintf stderr "%d starts %d-th task.~%" WORKER-ID WDATA.n-task))
-  (%ifdef* USE-PROBGUARD
+  (%if* USE-PROBGUARD
     (= PROBABILITY (csym::my-probability this.n)))
   (= this.r (fib this.n))
   )
 
 (def (task fib-start)
-  (def n int :in)
-  (def r int :out))
+  (def n long :in)
+  (def r long :out))
 
 (def (task-body fib-start)
   (decl tp (array (struct timeval) 2))
-  (csym::fprintf stderr "start fib(%d)~%" this.n)
-  (%ifdef* COUNT-NTASK
+  (csym::fprintf stderr "start fib(%ld)~%" this.n)
+  (%if* COUNT-NTASK
     (++ WDATA.n-task)
-    (csym::fprintf stderr "%d starts %d-th task.~%" WORKER-ID WDATA.n-task))
+    (csym::fprintf stderr "%d starts %ld-th task.~%" WORKER-ID WDATA.n-task))
   (= N0 this.n)
   (csym::gettimeofday tp 0)
   (= this.r (fib this.n))
@@ -103,11 +103,11 @@
   (csym::fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
 
 (def (task-receiver fib)
-    ;;(csym::fprintf stderr "receive %d~%" this.n)
+    ;; (csym::fprintf stderr "receive %d~%" this.n)
     )
 
 (def (task-sender fib)
-    ;;(csym::fprintf stderr "send %d~%" this.n)
+    ;; (csym::fprintf stderr "send %d~%" this.n)
     )
 
 (def (rslt-sender fib)
@@ -118,19 +118,20 @@
     ;;(csym::fprintf stderr "receive fib(%d)=%d~%" this.n this.r)
     )
 
-(def (fib n) (wfn int int)
+(def (fib n) (wfn long long)
   (if (<= n 2)
       (return 1)
     (begin
-      (def s1 int)
-      (def s2 int)
+      (def s1 long)
+      (def s2 long)
       (do-two
           (= s1 (fib (- n 1)))
 	  (= s2 (fib (- n 2)))
         (handles fib
          (:put
-          (%ifdef* USE-PROBGUARD
+          (%if* USE-PROBGUARD
             (= PROBABILITY (csym::my-probability (- n 2))))
           (= this.n (- n 2)))
-         (:get (= s2 this.r))))
+         (:get 
+         (= s2 this.r))))
       (return (+ s1 s2)))))
diff --git a/src/sample/tcell/grav.tcell b/src/sample/tcell/grav.tcell
index 3dad1f51..7f419007 100644
--- a/src/sample/tcell/grav.tcell
+++ b/src/sample/tcell/grav.tcell
@@ -53,26 +53,30 @@
              (* 0.000001
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;a
 
 (def (task gravity)
   (def f (array double 3))   ; result
-  (def rf (array double 3))  ; 小さい値を蓄積してく場所
-  (def minx int :in)
-  (def miny int :in)
-  (def minz int :in)
-  (def maxx int :in)
-  (def maxy int :in)
-  (def maxz int :in)
-  (def cur (array double 3))  ; 入力座標：ここへの重力ベクトルを計算
+  (def rf (array double 3))  ; 絨���������ゃ�����腥������������贋��
+  (def minx int )
+  (def miny int )
+  (def minz int )
+  (def maxx int )
+  (def maxy int )
+  (def maxz int )
+  (def cur (array double 3))  ; ��ュ��綺ф��鐚���������吾�����������������������荐�膊�
   ;;(def dummy (array char 4000))
   )
   
 (def (task-sender gravity)
-  (csym::send-doubles this.cur 3))
+  (csym::send-bytes (cast (ptr void) (ptr this.minx)) (- (sizeof this) (- (cast (ptr char)(ptr this.minx)) (cast (ptr char)(ptr this)))))
+  )
+
+;; sizeof (this) - ((char*)&this.minx - (char*)&this))
 
 (def (task-receiver gravity)
-  (csym::recv-doubles this.cur 3))
+  (csym::recv-bytes (cast (ptr void) (ptr this.minx)) (- (sizeof this) (- (cast (ptr char)(ptr this.minx)) (cast (ptr char)(ptr this)))))
+  )
 
 (def (rslt-sender gravity)
   (csym::send-doubles this.f 3))
diff --git a/src/sample/tcell/lu.tcell b/src/sample/tcell/lu.tcell
index 9ef31bed..9833caeb 100644
--- a/src/sample/tcell/lu.tcell
+++ b/src/sample/tcell/lu.tcell
@@ -78,7 +78,7 @@
 (deftype task-tp enum TASK-CMD TASK-LU TASK-R TASK-D TASK-RD)
 
 (def (task task-lu)
-  (def tt task-tp) ; 仕事の種類．0(=TASK-CMD)で新規に開始
+  (def tt task-tp) ; 篁�篋����腮�蕁�鐚�0(=TASK-CMD)��ф�域��������紮�
   (def n1 int)
   (def n2 int)
   (def n3 int)
@@ -245,10 +245,10 @@
       (begin
        (def n1-1 int (/ n1 2))
        (def n1-2 int (- n1 n1-1))
-       ;; Cilkとの比較用
+       ;; Cilk������罸�莠����
        (decomp-rd n1-1 n2 n3 b1 b2 a nx anx)
        (decomp-rd n1-2 n2 n3 (+ b1 n1-1) (+ b2 (* n1-1 nx)) a nx anx)
-       ;; 本来
+       ;; ������
        ;;        (do-two 
        ;;            (decomp-rd n1-1 n2 n3 b1 b2 a nx anx)
        ;;          (decomp-rd n1-2 n2 n3 (+ b1 n1-1) (+ b2 (* n1-1 nx)) a nx anx)
@@ -284,9 +284,9 @@
                       (+ a (+ (+ (* i nx) i) n1)) nx anx)))
 
 
-;; 適当なデータが入ったサイズn の配列を作る
-;; a: 出力先
-;; nx: 1行あたりのメモリサイズ
+;; ���綵���������若�帥����ャ�ｃ����泣�ゃ��n ������������篏����
+;; a: ��阪�����
+;; nx: 1茵���������������＜�≪����泣�ゃ��
 (def (csym::genmat n a nx) (fn void int (ptr double) int)
   (decl i int)
   (decl j int)
@@ -311,7 +311,7 @@
       (= (aref l (+ (* i nx) j))
          (if-exp (< i j) 0.0 (aref a (+ (* i nx) j)))))))
 
-;; uの対角成分が1 （Crout型）
+;; u���絲乗�����������1 鐚�Crout���鐚�
 (def (csym::copy-u n a u nx) (fn void int (ptr double) (ptr double) int)
   (decl i int) (decl j int)
   (for ((= i 0) (< i n) (inc i))
@@ -357,31 +357,31 @@
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-(def (csym::input-mat a n1 n2 nx) (csym::fn void (ptr double) int int int)
-  (decl i int)
-  (def swp int)
-  (= swp (csym::recv-binary-header 0 0))
-  (for ((= i 0) (< i n1) (inc i))
-    (csym::recv-double-seq (+ a (* i nx)) n2))
-  (csym::recv-binary-terminator)
-  (if swp
-      (for ((= i 0) (< i n1) (inc i))
-        (csym::swap-doubles (+ a (* i nx)) n2))))
-
-(def (csym::output-mat a n1 n2 nx) (fn void (ptr double) int int int)
-  (def i int)
-  (csym::send-binary-header (sizeof double) (* n1 n2))
-  (for ((= i 0) (< i n1) (inc i))
-    (csym::send-double-seq (+ a (* i nx)) n2))
-  (csym::send-binary-terminator))
-
-#+comment                               ; easy but less efficient implementation
+;; (def (csym::input-mat a n1 n2 nx) (csym::fn void (ptr double) int int int)
+;;   (decl i int)
+;;   (def swp int)
+;;   (= swp (csym::recv-binary-header 0 0))
+;;   (for ((= i 0) (< i n1) (inc i))
+;;     (csym::recv-double-seq (+ a (* i nx)) n2))
+;;   (csym::recv-binary-terminator)
+;;   (if swp
+;;       (for ((= i 0) (< i n1) (inc i))
+;;         (csym::swap-doubles (+ a (* i nx)) n2))))
+
+;; (def (csym::output-mat a n1 n2 nx) (fn void (ptr double) int int int)
+;;   (def i int)
+;;   (csym::send-binary-header (sizeof double) (* n1 n2))
+;;   (for ((= i 0) (< i n1) (inc i))
+;;     (csym::send-double-seq (+ a (* i nx)) n2))
+;;   (csym::send-binary-terminator))
+
+;; #+comment                               ; easy but less efficient implementation
 (def (csym::input-mat a n1 n2 nx) (csym::fn void (ptr double) int int int)
   (decl i int)
   (for ((= i 0) (< i n1) (inc i))
     (csym::recv-doubles (+ a (* i nx)) n2)))
 
-#+comment                               ; easy but less efficient implementation
+;; #+comment                               ; easy but less efficient implementation
 (def (csym::output-mat a n1 n2 nx) (fn void (ptr double) int int int)
   (def i int)
   (for ((= i 0) (< i n1) (inc i))
@@ -389,39 +389,63 @@
 
 (def (csym::input-mat-l a n1 nx) (fn void (ptr double) int int)
   (decl i int)
-  (decl swp int)
-  (= swp (csym::recv-binary-header 0 0))
   (for ((= i 0) (< i n1) (inc i)) 
-    (csym::recv-double-seq (+ a (* i nx)) (+ i 1)))
-  (csym::recv-binary-terminator)
-  (if swp
-      (for ((= i 0) (< i n1) (inc i))
-        (csym::swap-doubles (+ a (* i nx)) (+ i 1)))))
+    (csym::recv-doubles (+ a (* i nx)) (+ i 1)))
+  )
 
 (def (csym::output-mat-l a n1 nx) (fn void (ptr double) int int)
   (decl i int)
-  (csym::send-binary-header (sizeof double) (/ (* n1 (+ n1 1)) 2))
   (for ((= i 0) (< i n1) (inc i))
-    (csym::send-double-seq (+ a (* i nx)) (+ i 1)))
-  (csym::send-binary-terminator))
+    (csym::send-doubles (+ a (* i nx)) (+ i 1)))
+  )
 
 (def (csym::input-mat-u a n1 nx) (fn void (ptr double) int int)
   (decl i int)
-  (decl swp int)
-  (= swp (csym::recv-binary-header 0 0))
   (for ((= i 0) (< i n1) (inc i))
-    (csym::recv-double-seq (+ a (* i nx) i 1) (- n1 i 1)))
-  (csym::recv-binary-terminator)
-  (if swp
-      (for ((= i 0) (< i n1) (inc i))
-        (csym::swap-doubles (+ a (* i nx) i 1) (- n1 i 1)))))
+    (csym::recv-doubles (+ a (* i nx) i 1) (- n1 i 1)))
+  )
 
 (def (csym::output-mat-u a n1 nx) (csym::fn void (ptr double) int int)
   (decl i int) 
-  (csym::send-binary-header (sizeof double) (/ (* n1 (- n1 1)) 2))
   (for ((= i 0) (< i n1) (inc i)) 
-    (csym::send-double-seq (+ a (* i nx) i 1) (- n1 i 1)))
-  (csym::send-binary-terminator))
+    (csym::send-doubles (+ a (* i nx) i 1) (- n1 i 1)))
+  )
+
+;; (def (csym::input-mat-l a n1 nx) (fn void (ptr double) int int)
+;;   (decl i int)
+;;   (decl swp int)
+;;   (= swp (csym::recv-binary-header 0 0))
+;;   (for ((= i 0) (< i n1) (inc i)) 
+;;     (csym::recv-double-seq (+ a (* i nx)) (+ i 1)))
+;;   (csym::recv-binary-terminator)
+;;   (if swp
+;;       (for ((= i 0) (< i n1) (inc i))
+;;         (csym::swap-doubles (+ a (* i nx)) (+ i 1)))))
+
+;; (def (csym::output-mat-l a n1 nx) (fn void (ptr double) int int)
+;;   (decl i int)
+;;   (csym::send-binary-header (sizeof double) (/ (* n1 (+ n1 1)) 2))
+;;   (for ((= i 0) (< i n1) (inc i))
+;;     (csym::send-double-seq (+ a (* i nx)) (+ i 1)))
+;;   (csym::send-binary-terminator))
+
+;; (def (csym::input-mat-u a n1 nx) (fn void (ptr double) int int)
+;;   (decl i int)
+;;   (decl swp int)
+;;   (= swp (csym::recv-binary-header 0 0))
+;;   (for ((= i 0) (< i n1) (inc i))
+;;     (csym::recv-double-seq (+ a (* i nx) i 1) (- n1 i 1)))
+;;   (csym::recv-binary-terminator)
+;;   (if swp
+;;       (for ((= i 0) (< i n1) (inc i))
+;;         (csym::swap-doubles (+ a (* i nx) i 1) (- n1 i 1)))))
+
+;; (def (csym::output-mat-u a n1 nx) (csym::fn void (ptr double) int int)
+;;   (decl i int) 
+;;   (csym::send-binary-header (sizeof double) (/ (* n1 (- n1 1)) 2))
+;;   (for ((= i 0) (< i n1) (inc i)) 
+;;     (csym::send-double-seq (+ a (* i nx) i 1) (- n1 i 1)))
+;;   (csym::send-binary-terminator))
 
 (def (csym::zero-mat a n1 n2 nx) (fn void (ptr double) int int int)
   (decl i int)
diff --git a/src/sample/tcell/matmul.tcell b/src/sample/tcell/matmul.tcell
index e4484f42..3393cb54 100644
--- a/src/sample/tcell/matmul.tcell
+++ b/src/sample/tcell/matmul.tcell
@@ -77,7 +77,7 @@
   (return d))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; 要求時取得データ
+;; 荀�羆�������緇������若��
 (defs (ptr double) A B C)               ; C = A B
 (def N int)                             ; size of matrices
 (def NX int)                            ; distance between a(i,j) and a(i+1,j)
@@ -188,7 +188,7 @@
 (def (task-sender tmatmul)
     )
 
-;;; Cのうち，計算した範囲を送受信する
+;;; C��������￥��荐�膊�������膀���蚊��������篆＜�����
 (def (rslt-sender tmatmul)
   (defs int i j)
   (defs int idiff jdiff)
@@ -277,7 +277,7 @@
   (request-data i0 i1)
   (request-data j0 j1)
 
-  ;; キューにタスクがあれば実行
+  ;; �����ャ�若����帥�鴻�������������医��茵�
   (if (fref (aref sq head) fl)
       (begin
         (= h-i0 (fref (aref sq head) i0))
@@ -289,7 +289,7 @@
         (wait-data h-j0 h-j1)
         (csym::matmul-m h-i0 h-i1 h-j0 h-j1 0 n a b c nx)))
 
-  ;; キューにタスクを書き込む
+  ;; �����ャ�若����帥�鴻�������吾��莨若��
   (= (fref (aref sq head) i0) i0)
   (= (fref (aref sq head) i1) i1)
   (= (fref (aref sq head) j0) j0)
@@ -339,7 +339,7 @@
       (handles tmatmul
        (:put (= this.n n)
              (= this.i0 half) (= this.i1 i1) (= this.j0 j0) (= this.j1 j1))
-       (:get ;; Cに書き込む処理はreceiveにて
+       (:get ;; C�����吾��莨若�����������receive������
         ))) )
    (else
     (= half (/ (+ j0 j1) 2))
@@ -349,7 +349,7 @@
       (handles tmatmul
        (:put (= this.n n)
              (= this.i0 i0) (= this.i1 i1) (= this.j0 half) (= this.j1 j1))
-       (:get ;; Cに書き込む処理はreceiveにて
+       (:get ;; C�����吾��莨若�����������receive������
         ))) )
    )
   (return))
diff --git a/src/sample/tcell/mk-hostnames.pl b/src/sample/tcell/mk-hostnames.pl
old mode 100755
new mode 100644
diff --git a/src/sample/tcell/nq-copy.tcell b/src/sample/tcell/nq-copy.tcell
index 0bba3303..61be3808 100644
--- a/src/sample/tcell/nq-copy.tcell
+++ b/src/sample/tcell/nq-copy.tcell
@@ -36,14 +36,14 @@
 
 ;;; thread local strogae
 (def (task nqueens)
-  (def r int :out)  ; （部分）解の数
-  (def n int :in)   ;  問題サイズ
-  (def k int :in)   ;  初期化->探索開始(-1) or 部分探索開始かのフラグ(>=0)
-  (def i1 int)  ;  探索範囲 start
-  (def i2 int)  ;  探索範囲 end
-  (def a (array int 20)) ; 使用済み行の管理
-  (def lb (array int 40)) ; 盤面情報1
-  (def rb (array int 40)) ; 盤面情報2
+  (def r int :out)  ; 鐚�������鐚�茹ｃ�����
+  (def n int :in)   ;  ��馹���泣�ゃ��
+  (def k int :in)   ;  ���������->�｢膣∫��紮�(-1) or �������｢膣∫��紮����������������(>=0)
+  (def i1 int)  ;  �｢膣∝����� start
+  (def i2 int)  ;  �｢膣∝����� end
+  (def a (array int 20)) ; 篏睡��羝���粋�����膊∞��
+  (def lb (array int 40)) ; ��ら�∽�����1
+  (def rb (array int 40)) ; ��ら�∽�����2
   )
 
 (def (task-sender nqueens)
@@ -74,8 +74,8 @@
             (= (aref this.rb i) (csym::recv-int)))
   )))
 
-;; k: a[j] (0<k)までの行にはもう置いた
-;; ix, iy:  探索範囲
+;; k: a[j] (0<k)��障�с��茵�������������臀�������
+;; ix, iy:  �｢膣∝�����
 (def (nqueens n k ix iy tsk)
     (wfn int int int int int (ptr (struct nqueens)))
   (def s int 0)
@@ -84,7 +84,7 @@
   (= st (ptr this-tsk))
   (do-many for i from ix to iy
     (def ai int (aref tsk->a i))
-    ;; 駒が置けるかチェック
+    ;; 薈����臀���������������с�����
     (if (not (or (aref tsk->lb (+ n -1 (- ai) k))
                  (aref tsk->rb (+ ai k))))
         (begin
diff --git a/src/sample/tcell/nq-thr.tcell b/src/sample/tcell/nq-thr.tcell
new file mode 100644
index 00000000..9edf9368
--- /dev/null
+++ b/src/sample/tcell/nq-thr.tcell
@@ -0,0 +1,183 @@
+;;; Copyright (c) 2008-2017 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Find all the solutions of the n-queen problem
+;;; An example and benchmark of aborting tasks by a "throw" statement.
+;;; This is based on nq.tcell but aborts when the intermediate sum exceeds 
+;;; <threshold>% * 95815104(The answer of Nq(17)).
+
+;; task 0 0 0 0
+;; <n>
+;; -<threshold>
+
+(c-exp "#include<sys/time.h>")
+
+(%include "rule/tcell-setrule.sh")
+(%include "clib.sh")
+(%include "dprint.sh")
+(%cinclude "sendrecv.h" (:macro))
+
+;; Use "user defined spawned range"
+(%defconstant USE-SPN-RANGE 0)
+;; Use "Probability guard"
+(%defconstant USE-PROBGUARD 0)
+
+(def (csym::my-probability n k) (fn double int int)
+  (if (>= k 2)
+    (return (/ (cast double (- n (+ k 1))) (cast double (- n 2))))
+    (return 1.0)))
+  ; constant probability
+  ; (if (>= k 2)
+  ;   (return (/ 1.0 16.0))
+  ;   (return 1.0)))
+  ; threshold based probability
+  ; (if (>= k 2)
+  ;   (return 0.0)
+  ;   (return 1.0)))
+
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+;;; thread local strogae
+(def Threshold int)
+(def Tp (array (struct timeval) 2))
+(def (task nqueens)
+  (def r int :out)  ; 鐚�������鐚�茹ｃ�����
+  (def n int :in)   ;  ��馹���泣�ゃ��
+  (def k int :in)   ;  ���������->�｢膣∫��紮�(k<0) or �������｢膣∫��紮����������������(>=0)
+  (def i1 int)  ;  �｢膣∝����� start
+  (def i2 int)  ;  �｢膣∝����� end
+  (def a (array int 20)) ; 篏睡��羝���粋�����膊∞��
+  (def lb (array int 40)) ; ��ら�∽�����1
+  (def rb (array int 40)) ; ��ら�∽�����2
+  )
+
+(def (task-sender nqueens)
+  (def i int 0)
+  (if (>= this.k 0)
+      (begin
+       (csym::send-int this.i1)
+       (csym::send-int this.i2)
+       (for ((= i 0) (< i this.n) (inc i))
+            (csym::send-int (aref this.a i)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (csym::send-int (aref this.lb i)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (csym::send-int (aref this.rb i)))))
+  )
+
+(def (task-receiver nqueens)
+  (def i int 0)
+  (if (>= this.k 0)
+      (begin
+       (= this.i1 (csym::recv-int))
+       (= this.i2 (csym::recv-int))
+       (for ((= i 0) (< i this.n) (inc i))
+            (= (aref this.a i) (csym::recv-int)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (= (aref this.lb i) (csym::recv-int)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (= (aref this.rb i) (csym::recv-int)))
+  )))
+
+
+;; k: a[j] (0<k)��障�с��茵�������������臀�������
+;; ix, iy:  �｢膣∝�����
+(def (nqueens n k ix iy tsk)
+    (wfn int int int int int (ptr (struct nqueens)))
+  (def s int 0)
+  (do-many for i from ix to iy
+    (def ai int (aref tsk->a i))
+    ;; 薈����臀���������������с�����
+    (if (not (or (aref tsk->lb (+ n -1 (- ai) k))
+                 (aref tsk->rb (+ ai k))))
+        (begin
+         (if (== k (- n 1)) (inc s)
+             (begin
+             (dynamic-wind
+              (:before
+               (= (aref tsk->lb (+ n -1 (- ai) k)) 1)
+               (= (aref tsk->rb (+ ai k)) 1)
+               (= (aref tsk->a i) (aref tsk->a k))
+               (= (aref tsk->a k) ai))
+              (:body
+               (+= s (nqueens n (+ k 1) (+ k 1) n tsk)))
+              (:after
+               (= (aref tsk->lb (+ n -1 (- ai) k)) 0)
+               (= (aref tsk->rb (+ ai k)) 0)
+               (= ai (aref tsk->a k))
+               (= (aref tsk->a k) (aref tsk->a i))
+               (= (aref tsk->a i) ai)))))))
+    (handles nqueens
+     (%if* USE-SPN-RANGE
+        (:spawn-from (+ i 3)))
+     (:put from i1 to i2
+           (%if* USE-PROBGUARD
+             (= PROBABILITY (csym::my-probability n k)))
+           (= this (mref tsk))
+           (= this.k k)
+           (= this.i1 i1)
+           (= this.i2 i2))
+     (:get (+= s this.r))))
+  (if (> s Threshold) 
+      (begin
+       (csym::gettimeofday (+ Tp 1) 0)
+       (csym::fprintf stderr "etime: %lf~%s=%ld~%"  (csym::elapsed-time Tp) s)
+       (throw 1)))
+  (return s))
+
+(def (task-body nqueens)
+  (def i int)
+  (def n int this.n)
+  (def k int this.k)
+  (decl tp (array (struct timeval) 2))
+  (if (> option.verbose 0) (csym::fprintf stderr "start %d %d %d %d~%" n k this.i1 this.i2))
+  (%if* USE-PROBGUARD
+    (= PROBABILITY (csym::my-probability n k)))
+  (if (< k 0)
+      (begin
+       (= Threshold (/ (* (cast long 95815104) (- this.k)) 100))  ; 95815104 = Nq(17)
+       (csym::fprintf stderr "Threshold: %ld %ld~%" (- this.k) Threshold)
+       (for ((= i 0) (< i n) (inc i))
+            (= (aref this.a i) i))
+       (for ((= i 0) (< i (- (* 2 n) 1)) (inc i))
+            (= (aref this.lb i) 0)
+            (= (aref this.rb i) 0))
+       (csym::gettimeofday tp 0)
+       (= (aref Tp 0) (aref tp 0))
+       (catch 1
+         (= this.r 1)
+         (nqueens n 0 0 n (ptr this))
+         (= this.r 0))
+       (csym::gettimeofday (+ tp 1) 0)
+       (csym::fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+      (= this.r
+         (nqueens n k this.i1 this.i2 (ptr this))))
+  (DEBUG-PRINT 1 "end %d %d %d %d~%" k n this.i1 this.i2)
+  )
diff --git a/src/sample/tcell/nq-try.tcell b/src/sample/tcell/nq-try.tcell
new file mode 100644
index 00000000..2af0ef7f
--- /dev/null
+++ b/src/sample/tcell/nq-try.tcell
@@ -0,0 +1,171 @@
+;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Find all the solutions of the n-queen problem
+
+;; task 0 0 0 0
+;; <n>
+;; -1
+
+(c-exp "#include<sys/time.h>")
+
+(%include "rule/tcell-setrule.sh")
+(%include "clib.sh")
+(%include "dprint.sh")
+(%cinclude "sendrecv.h" (:macro))
+
+;; Use "user defined spawned range"
+(%defconstant USE-SPN-RANGE 0)
+;; Use "Probability guard"
+(%defconstant USE-PROBGUARD 0)
+
+(def (csym::my-probability n k) (fn double int int)
+  (if (>= k 2)
+    (return (/ (cast double (- n (+ k 1))) (cast double (- n 2))))
+    (return 1.0)))
+  ; constant probability
+  ; (if (>= k 2)
+  ;   (return (/ 1.0 16.0))
+  ;   (return 1.0)))
+  ; threshold based probability
+  ; (if (>= k 2)
+  ;   (return 0.0)
+  ;   (return 1.0)))
+
+;;; thread local strogae
+(def (task nqueens)
+  (def r int :out)  ; 鐚�������鐚�茹ｃ�����
+  (def n int :in)   ;  ��馹���泣�ゃ��
+  (def k int :in)   ;  ���������->�｢膣∫��紮�(-1) or �������｢膣∫��紮����������������(>=0)
+  (def i1 int)  ;  �｢膣∝����� start
+  (def i2 int)  ;  �｢膣∝����� end
+  (def a (array int 20)) ; 篏睡��羝���粋�����膊∞��
+  (def lb (array int 40)) ; ��ら�∽�����1
+  (def rb (array int 40)) ; ��ら�∽�����2
+  )
+
+(def (task-sender nqueens)
+  (def i int 0)
+  (if (>= this.k 0)
+      (begin
+       (csym::send-int this.i1)
+       (csym::send-int this.i2)
+       (for ((= i 0) (< i this.n) (inc i))
+            (csym::send-int (aref this.a i)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (csym::send-int (aref this.lb i)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (csym::send-int (aref this.rb i)))))
+  )
+
+(def (task-receiver nqueens)
+  (def i int 0)
+  (if (>= this.k 0)
+      (begin
+       (= this.i1 (csym::recv-int))
+       (= this.i2 (csym::recv-int))
+       (for ((= i 0) (< i this.n) (inc i))
+            (= (aref this.a i) (csym::recv-int)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (= (aref this.lb i) (csym::recv-int)))
+       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
+            (= (aref this.rb i) (csym::recv-int)))
+  )))
+
+
+;; k: a[j] (0<k)��障�с��茵�������������臀�������
+;; ix, iy:  �｢膣∝�����
+(def (nqueens n k ix iy tsk)
+    (wfn int int int int int (ptr (struct nqueens)))
+  (def s int 0)
+  (catch 1 ; meaningless catch for performance evaluation
+   (do-many for i from ix to iy
+    (def ai int (aref tsk->a i))
+    ;; 薈����臀���������������с�����
+    (if (not (or (aref tsk->lb (+ n -1 (- ai) k))
+                 (aref tsk->rb (+ ai k))))
+        (begin
+         (if (== k (- n 1)) (inc s)
+             (begin
+             (dynamic-wind
+              (:before
+               (= (aref tsk->lb (+ n -1 (- ai) k)) 1)
+               (= (aref tsk->rb (+ ai k)) 1)
+               (= (aref tsk->a i) (aref tsk->a k))
+               (= (aref tsk->a k) ai))
+              (:body
+               (+= s (nqueens n (+ k 1) (+ k 1) n tsk)))
+              (:after
+               (= (aref tsk->lb (+ n -1 (- ai) k)) 0)
+               (= (aref tsk->rb (+ ai k)) 0)
+               (= ai (aref tsk->a k))
+               (= (aref tsk->a k) (aref tsk->a i))
+               (= (aref tsk->a i) ai)))))))
+    (handles nqueens
+     (%if* USE-SPN-RANGE
+        (:spawn-from (+ i 3)))
+     (:put from i1 to i2
+           (%if* USE-PROBGUARD
+             (= PROBABILITY (csym::my-probability n k)))
+           (= this (mref tsk))
+           (= this.k k)
+           (= this.i1 i1)
+           (= this.i2 i2))
+     (:get (+= s this.r))))
+  )
+  (return s))
+
+
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+(def (task-body nqueens)
+  (def i int)
+  (def n int this.n)
+  (def k int this.k)
+  (decl tp (array (struct timeval) 2))
+  (if (> option.verbose 0) (csym::fprintf stderr "start %d %d %d %d~%" n k this.i1 this.i2))
+  (%if* USE-PROBGUARD
+    (= PROBABILITY (csym::my-probability n k)))
+  (if (< k 0)
+      (begin
+       (for ((= i 0) (< i n) (inc i))
+            (= (aref this.a i) i))
+       (for ((= i 0) (< i (- (* 2 n) 1)) (inc i))
+            (= (aref this.lb i) 0)
+            (= (aref this.rb i) 0))
+       (csym::gettimeofday tp 0)
+       (= this.r
+          (nqueens n 0 0 n (ptr this)))
+       (csym::gettimeofday (+ tp 1) 0)
+       (csym::fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+      (= this.r
+         (nqueens n k this.i1 this.i2 (ptr this))))
+  (DEBUG-PRINT 1 "end %d %d %d %d~%" k n this.i1 this.i2)
+  )
diff --git a/src/sample/tcell/nq.tcell b/src/sample/tcell/nq.tcell
index 21f113b7..3e0c071e 100644
--- a/src/sample/tcell/nq.tcell
+++ b/src/sample/tcell/nq.tcell
@@ -38,7 +38,7 @@
 ;; Use "user defined spawned range"
 (%defconstant USE-SPN-RANGE 0)
 ;; Use "Probability guard"
-(%defconstant USE-PROBGUARD 1)
+(%defconstant USE-PROBGUARD 0)
 
 (def (csym::my-probability n k) (fn double int int)
   (if (>= k 2)
@@ -55,53 +55,37 @@
 
 ;;; thread local strogae
 (def (task nqueens)
-  (def r int :out)  ; （部分）解の数
-  (def n int :in)   ;  問題サイズ
-  (def k int :in)   ;  初期化->探索開始(-1) or 部分探索開始かのフラグ(>=0)
-  (def i1 int)  ;  探索範囲 start
-  (def i2 int)  ;  探索範囲 end
-  (def a (array int 20)) ; 使用済み行の管理
-  (def lb (array int 40)) ; 盤面情報1
-  (def rb (array int 40)) ; 盤面情報2
+  (def r int :out)  ; 鐚�������鐚�茹ｃ�����
+  (def n int :in)   ;  ��馹���泣�ゃ��
+  (def k int :in)   ;  ���������->�｢膣∫��紮�(-1) or �������｢膣∫��紮����������������(>=0)
+  (def i1 int)  ;  �｢膣∝����� start
+  (def i2 int)  ;  �｢膣∝����� end
+  (def a (array int 20)) ; 篏睡��羝���粋�����膊∞��
+  (def lb (array int 40)) ; ��ら�∽�����1
+  (def rb (array int 40)) ; ��ら�∽�����2
   )
 
 (def (task-sender nqueens)
-  (def i int 0)
   (if (>= this.k 0)
       (begin
-       (csym::send-int this.i1)
-       (csym::send-int this.i2)
-       (for ((= i 0) (< i this.n) (inc i))
-            (csym::send-int (aref this.a i)))
-       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
-            (csym::send-int (aref this.lb i)))
-       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
-            (csym::send-int (aref this.rb i)))))
-  )
+       (csym::send-bytes (cast (ptr void) (ptr this)) (sizeof this))
+  )))
 
 (def (task-receiver nqueens)
-  (def i int 0)
   (if (>= this.k 0)
       (begin
-       (= this.i1 (csym::recv-int))
-       (= this.i2 (csym::recv-int))
-       (for ((= i 0) (< i this.n) (inc i))
-            (= (aref this.a i) (csym::recv-int)))
-       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
-            (= (aref this.lb i) (csym::recv-int)))
-       (for ((= i 0) (< i (- (* 2 this.n) 1)) (inc i))
-            (= (aref this.rb i) (csym::recv-int)))
+       (csym::recv-bytes (cast (ptr void) (ptr this)) (sizeof this))
   )))
 
 
-;; k: a[j] (0<k)までの行にはもう置いた
-;; ix, iy:  探索範囲
+;; k: a[j] (0<k)��障�с��茵�������������臀�������
+;; ix, iy:  �｢膣∝�����
 (def (nqueens n k ix iy tsk)
     (wfn int int int int int (ptr (struct nqueens)))
   (def s int 0)
   (do-many for i from ix to iy
     (def ai int (aref tsk->a i))
-    ;; 駒が置けるかチェック
+    ;; 薈����臀���������������с�����
     (if (not (or (aref tsk->lb (+ n -1 (- ai) k))
                  (aref tsk->rb (+ ai k))))
         (begin
@@ -149,7 +133,7 @@
   (def k int this.k)
   (decl tp (array (struct timeval) 2))
   (if (> option.verbose 0) (csym::fprintf stderr "start %d %d %d %d~%" n k this.i1 this.i2))
-  (%ifdef* USE-PROBGUARD
+  (%if* USE-PROBGUARD
     (= PROBABILITY (csym::my-probability n k)))
   (if (< k 0)
       (begin
diff --git a/src/sample/tcell/pen-copy.tcell b/src/sample/tcell/pen-copy.tcell
index 984253d1..97bdd083 100644
--- a/src/sample/tcell/pen-copy.tcell
+++ b/src/sample/tcell/pen-copy.tcell
@@ -72,7 +72,7 @@
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
 
-;; 新しい問題を解く
+;; ��違�������馹����茹ｃ��
 (def (task-body start-pentomino)
     (decl tp (array (struct timeval) 2))
   (def pen (struct pentomino))
@@ -89,7 +89,7 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def ps (array int 57 5)
   (array
-   (array 1 1 1 1) (array 7 7 7 7)      ; ***** とその縦向き
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
    (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
                                         ; ****    *
                                         ;         *
@@ -154,9 +154,9 @@
 (def pos (array int 13) (array 0 2 4 12 16 20 24 32 36 37 45 53 57))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; k: 最初の空きセル
+;; k: ���������腥冴����祉��
 ;; j0:
-;; j1--j2: 試すビースの種類
+;; j1--j2: 荅���������若�鴻��腮�蕁�
 (def (search k j0 j1 j2 tsk) (wfn int int int int int (ptr (struct pentomino)))
   (def s int 0)
   (def tsk-copy (struct pentomino))
diff --git a/src/sample/tcell/pen-excep.tcell b/src/sample/tcell/pen-excep.tcell
new file mode 100644
index 00000000..c16bec5b
--- /dev/null
+++ b/src/sample/tcell/pen-excep.tcell
@@ -0,0 +1,223 @@
+;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Find solutions of Pentomino puzzle
+;;; Based on pen.tcell but throws an exception when # solutions exceeds 100
+
+;; task 0 0 0 1
+;;
+
+
+(c-exp "#include<sys/time.h>")
+
+(%include "rule/tcell-setrule.sh")
+(%include "clib.sh")
+(%include "dprint.sh")
+(%cinclude "sendrecv.h" (:macro))
+
+(%defconstant ASIZE 12)
+(%defconstant BSIZE 70)
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (task pentomino)
+  (def r int :out)
+  (def k int :in)
+  (def i0 int :in)
+  (def i1 int :in)
+  (def i2 int :in)
+  (def a (array int ASIZE) :in)
+  (def b (array int BSIZE) :in))
+
+;; task/rslt-sender/receiver = default
+
+(decl (search k j0 j1 j2 tsk) (wfn int int int int int (ptr (struct pentomino))))
+(def (task-body pentomino)
+  (decl i int)
+  (def k int this.k)
+  (def i0 int this.i0)
+  (def i1 int this.i1)
+  (def i2 int this.i2)
+  (DEBUG-PRINT 1 "start %d %d %d %d~%" k i0 i1 i2)
+  (= this.r (search k i0 i1 i2 (ptr this)))
+  (DEBUG-PRINT 1 "end %d~%" this.r))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (task start-pentomino)
+  (def r int :out))
+
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+;; ��違�������馹����茹ｃ��
+(def (task-body start-pentomino)
+  (decl tp (array (struct timeval) 2))
+  (def pen (struct pentomino))
+  (def i int)
+  (for ((= i 0) (< i ASIZE) (inc i)) (= (aref pen.a i) i))
+  (for ((= i 0) (< i BSIZE) (inc i)) (= (aref pen.b i) 0))
+  (for ((= i 6) (< i BSIZE) (+= i 7))
+    (= (aref pen.b i) #\Newline))
+  (csym::gettimeofday tp 0)
+  (= this.r (search 0 0 0 ASIZE (ptr pen)))
+  (csym::gettimeofday (+ tp 1) 0)
+  (fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def ps (array int 57 5)
+  (array
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
+   (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
+                                        ; ****    *
+                                        ;         *
+                                        ;        **
+   (array 6 1 1 1) (array 5 1 1 1) (array 1 1 1 5) (array 1 1 1 6)
+   ;;     *                 *            ****          ****
+   ;;    ****             ****            *              * 
+   (array 7 1 6 7) (array 7 7 1 6) (array 7 6 1 7) (array 6 1 7 7)
+   ;;     *                 *              *                *
+   ;;     **                *              *               **
+   ;;     *                 **            **                *
+   ;;     *                 *              *                *
+   (array 7 7 1 1) (array 1 1 5 7) (array 1 1 7 7) (array 7 5 1 1)
+   ;;     *                 ***          ***               *
+   ;;     *                 *              *               *
+   ;;     ***               *              *             ***
+   (array 2 5 1 1) (array 1 1 5 2) (array 1 6 7 1) (array 1 7 6 1)
+   ;;     * *              ***            **              **
+   ;;     ***              * *            *                *
+   ;;                                     **              **
+   (array 7 1 1 5) (array 5 1 1 7) (array 7 6 1 1) (array 1 1 6 7)
+   ;;     *                 *              *              ***
+   ;;     ***             ***              *               *
+   ;;     *                 *             ***              *
+   (array 7 1 1 6) (array 5 1 1 6) (array 6 1 1 5) (array 6 1 1 7) 
+   ;;     *                 *              *              *
+   ;;     ***             ***             ***            ***
+   ;;      *               *              *                *
+   (array 1 7 1 6) (array 7 1 5 1) (array 1 5 1 7) (array 6 1 7 1) 
+   ;;     **               *              **              *
+   ;;      **              **            **              **
+   ;;      *              **              *               **
+   (array 7 1 1 7) (array 5 1 1 5) (array 1 7 7 1) (array 1 6 6 1)
+   ;;      *               *              **              **
+   ;;      ***           ***               *              *
+   ;;        *           *                 **            **
+   (array 6 1 1 6)
+   ;;      * 
+   ;;     ***
+   ;;      * 
+   (array 1 6 1 1) (array 1 1 5 1) (array 1 5 1 1) (array 1 1 6 1)
+   ;;      **               ***            **             ***
+   ;;      ***              **            ***              **
+   (array 7 1 6 1) (array 1 6 1 6) (array 6 1 6 1) (array 1 6 1 7)
+   ;;      *               **              *               **
+   ;;      **              **             **               **
+   ;;      **              *              **                *
+   (array 1 4 1 1) (array 1 1 7 1) (array 1 7 1 1) (array 1 1 4 1)
+   ;;      **              ***            **               ***
+   ;;    ***                 **            ***            **
+   (array 7 1 7 7) (array 7 6 1 6) (array 6 1 6 7) (array 7 7 1 7)
+   ;;      *                *              *              *
+   ;;      **               *             **              *
+   ;;       *              **             *               **
+   ;;       *              *              *                *
+   (array 7 1 7 1) (array 1 5 1 6) (array 1 7 1 7) (array 6 1 5 1)
+   ;;      *                **              **              *
+   ;;      **              **                **            **
+   ;;       **             *                  *           **
+   ))
+
+(def pos (array int 13) (array 0 2 4 12 16 20 24 32 36 37 45 53 57))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; k: ���������腥冴����祉��
+;; j0:
+;; j1--j2: 荅���������若�鴻��腮�蕁�
+(def (search k j0 j1 j2 tsk) (wfn int int int int int (ptr (struct pentomino)))
+  (def s int 0)
+  (do-many for p from j1 to j2
+    (def ap int (aref (fref (mref tsk) a) p))
+    (def i int)
+    (for ((= i (aref pos ap)) (< i (aref pos (+ ap 1))) (inc i))     
+      ;;  examine the "i"-th (piece, direction)
+      ;;  at the first empty location "k"
+      (def pss (ptr int) (aref ps i))
+      (def kk int k)  (decl l int)
+      (for ((= l 0) (< l 4) (inc l))
+	(if (or (>= (+= kk (aref pss l)) 70)
+		(!= (aref (fref (mref tsk) b) kk) 0))
+	    (goto Ln)))
+      (dynamic-wind
+	(:before
+	  (= (aref (fref (mref tsk) b)
+		   (= kk k))
+	     (+ p #\A))
+	  (for ((= l 0) (< l 4) (inc l))
+	    (= (aref (fref (mref tsk) b)
+		     (+= kk (aref pss l)))
+	       (+ p #\A)))
+	  (= (aref (fref (mref tsk) a) p)
+	     (aref (fref (mref tsk) a) j0))
+	  (= (aref (fref (mref tsk) a) j0) ap))
+	(:body
+	  (for ((= kk k) (< kk 70) (inc kk))
+	    (if (== (aref (fref (mref tsk) b) kk) 0) (break)))
+	  (if (== kk 70)
+	      (+= s 1)
+	    (if (and (or (>= (+ kk 7) 70)
+			 (!= (aref (fref (mref tsk) b) (+ kk 7)) 0))
+		     (or (!= (aref (fref (mref tsk) b) (+ kk 1)) 0)
+			 (and (or (>= (+ kk 8) 70)
+				  (!= (aref (fref (mref tsk) b) (+ kk 8)) 0))
+			      (!= (aref (fref (mref tsk) b) (+ kk 2)) 0))))
+		()
+	      (+= s (search kk (+ j0 1) (+ j0 1) 12 tsk)))))
+	(:after
+	  (= ap (aref (fref (mref tsk) a) j0))
+	  (= (aref (fref (mref tsk) a) j0) (aref (fref (mref tsk) a) p))
+	  (= (aref (fref (mref tsk) a) p) ap)
+	  (= (aref (fref (mref tsk) b) (= kk k)) 0)
+	  (for ((= l 0) (< l 4) (inc l))
+	    (= (aref (fref (mref tsk) b) (+= kk (aref pss l))) 0)))
+	)
+      (label Ln (continue))
+      )
+    ;; put/get pentomino task/result
+    (handles pentomino
+      (:put from i1 to i2
+	(= this (mref tsk))
+	(= this.k k)
+	(= this.i0 j0)
+	(= this.i1 i1)
+	(= this.i2 i2))
+      (:get
+	(+= s this.r))))
+  (if (> s 100) (throw WORKER-ID))
+  (return s))
diff --git a/src/sample/tcell/pen.tcell b/src/sample/tcell/pen.tcell
index f6a768fd..da09449a 100644
--- a/src/sample/tcell/pen.tcell
+++ b/src/sample/tcell/pen.tcell
@@ -74,7 +74,7 @@
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
 
-;; 新しい問題を解く
+;; ��違�������馹����茹ｃ��
 (def (task-body start-pentomino)
   (decl tp (array (struct timeval) 2))
   (def pen (struct pentomino))
@@ -91,7 +91,7 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def ps (array int 57 5)
   (array
-   (array 1 1 1 1) (array 7 7 7 7)      ; ***** とその縦向き
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
    (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
                                         ; ****    *
                                         ;         *
@@ -156,9 +156,9 @@
 (def pos (array int 13) (array 0 2 4 12 16 20 24 32 36 37 45 53 57))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; k: 最初の空きセル
+;; k: ���������腥冴����祉��
 ;; j0:
-;; j1--j2: 試すビースの種類
+;; j1--j2: 荅���������若�鴻��腮�蕁�
 (def (search k j0 j1 j2 tsk) (wfn int int int int int (ptr (struct pentomino)))
   (def s int 0)
   (do-many for p from j1 to j2
diff --git a/src/sample/tcell/pen6x17-copy.tcell b/src/sample/tcell/pen6x17-copy.tcell
index ae095ce1..bbeb8c64 100644
--- a/src/sample/tcell/pen6x17-copy.tcell
+++ b/src/sample/tcell/pen6x17-copy.tcell
@@ -76,7 +76,7 @@
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
 
-;; 新しい問題を解く
+;; ��違�������馹����茹ｃ��
 (def (task-body start-pentomino)
   (decl tp (array (struct timeval) 2))
   (def pen (struct pentomino))
@@ -92,7 +92,7 @@
   (for ((= i 0) (< i BSIZE) (inc i)) (= (aref pen.b i) 0))
   (for ((= i 6) (< i BSIZE) (+= i 7))
     (= (aref pen.b i) #\Newline)) ; right side wall
-  ;; piece数*5 個目より先の穴は埋める
+  ;; piece���*5 ������������������腥眼�����������
   (= kk 0)
   (for ((= i 0) (< i (* maxp 5)) (inc i))
        (for ((inc kk) (< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
@@ -109,7 +109,7 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def ps (array int 73 5)
   (array
-   (array 1 1 1 1) (array 7 7 7 7)      ; ***** とその縦向き
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
    (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
                                         ; ****    *
                                         ;         *
@@ -185,9 +185,9 @@
                                59 61 63 65 67 69 71 73))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; k: 最初の空きセル
+;; k: ���������腥冴����祉��
 ;; j0:
-;; j1--j2: 試すビースの種類
+;; j1--j2: 荅���������若�鴻��腮�蕁�
 (def (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino)))
   (def s int 0)
   (def this-tsk (struct pentomino))
diff --git a/src/sample/tcell/pen6x17-guard.tcell b/src/sample/tcell/pen6x17-guard.tcell
index cca5e49c..2cc87326 100644
--- a/src/sample/tcell/pen6x17-guard.tcell
+++ b/src/sample/tcell/pen6x17-guard.tcell
@@ -77,7 +77,7 @@
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
 
-;; 新しい問題を解く
+;; ��違�������馹����茹ｃ��
 (def (task-body start-pentomino)
   (decl tp (array (struct timeval) 2))
   (def pen (struct pentomino))
@@ -93,7 +93,7 @@
   (for ((= i 0) (< i BSIZE) (inc i)) (= (aref (fref pen b) i) 0))
   (for ((= i 6) (< i BSIZE) (+= i 7))
     (= (aref (fref pen b) i) #\Newline)) ; right side wall
-  ;; piece数*5 個目より先の穴は埋める
+  ;; piece���*5 ������������������腥眼�����������
   (= kk 0)
   (for ((= i 0) (< i (* maxp 5)) (inc i))
        (for ((inc kk) (< kk BSIZE) (inc kk)) (if (== (aref (fref pen b) kk) 0)
@@ -110,7 +110,7 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def ps (array int 73 5)
   (array
-   (array 1 1 1 1) (array 7 7 7 7)      ; ***** とその縦向き
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
    (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
                                         ; ****    *
                                         ;         *
@@ -186,9 +186,9 @@
                                59 61 63 65 67 69 71 73))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; k: 最初の空きセル
+;; k: ���������腥冴����祉��
 ;; j0:
-;; j1--j2: 試すビースの種類
+;; j1--j2: 荅���������若�鴻��腮�蕁�
 (def (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino)))
   (def s int 0)
   (do-many for p from j1 to j2
diff --git a/src/sample/tcell/pen6x17-thr.tcell b/src/sample/tcell/pen6x17-thr.tcell
new file mode 100644
index 00000000..f86635d8
--- /dev/null
+++ b/src/sample/tcell/pen6x17-thr.tcell
@@ -0,0 +1,297 @@
+;;; Copyright (c) 2008-2017 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Find all the solutions of Pentomino puzzle
+;;; An example and benchmark of aborting tasks by a "throw" statement.
+;;; This is based on pen6x17.tcell but aborts when the intermediate sum exceeds 
+;;; <threshold>% * 1008576(The answer of Pen(15)).
+
+;; task 0 0 0 1
+;; <n>
+;; <threshold>
+
+(c-exp "#include<sys/time.h>")
+
+(%include "rule/tcell-setrule.sh")
+(%include "clib.sh")
+(%include "dprint.sh")
+(%cinclude "sendrecv.h" (:macro))
+
+(%defconstant ASIZE 20)
+(%defconstant BSIZE 119)
+
+(%defconstant USE-PROBABILITY 0)
+
+(def (pen-probability j maxp)
+     (fn double int int)
+    (if (>= j 3)
+        (return (/ (cast double (- maxp j)) (cast double (- maxp 2))))
+        (return 1.0)))
+    ; constant probability
+    ; (if (>= j 3)
+    ;     (return (/ 1.0 16.0))
+    ;     (return 1.0)))
+    ; threshold based probability
+    ; (if (>= j 3)
+    ;     (return 0.0)
+    ;     (return 1.0)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (task pentomino)
+  (def r int :out)
+  (def k int :in)
+  (def i0 int :in)
+  (def i1 int :in)
+  (def i2 int :in)
+  (def maxp int :in)  ; number of pieces
+  (def maxk int :in)  ; the last empty cell
+  (def a (array int ASIZE) :in)
+  (def b (array int BSIZE) :in))
+
+;; task/rslt-sender/receiver = default
+
+(decl (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino))))
+(def (task-body pentomino)
+  (decl i int)
+  (def k int this.k)
+  (def i0 int this.i0)
+  (def i1 int this.i1)
+  (def i2 int this.i2)
+  (def maxp int this.maxp)
+  (def maxk int this.maxk)
+  (DEBUG-PRINT 1 "start %d %d %d %d %d %d~%" k i0 i1 i2 maxp maxk)
+  (%if* USE-PROBABILITY
+    (= PROBABILITY (pen-probability i0 maxp)))
+  (= this.r (search k i0 i1 i2 maxp maxk (ptr this)))
+  (DEBUG-PRINT 1 "end %d~%" this.r))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def Threshold int)
+(def Tp (array (struct timeval) 2))
+(def (task start-pentomino)
+  (def maxp int :in) ; number of pieces
+  (def threshold int :in)
+  (def r int :out))
+
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+;; ��違�������馹����茹ｃ��
+(def (task-body start-pentomino)
+  (decl tp (array (struct timeval) 2))
+  (def pen (struct pentomino))
+  (def maxp int this.maxp)
+  (def i int)
+  (def kk int)
+  (if (or (< maxp 0) (> maxp 20))
+      (begin
+        (csym::fprintf stderr "maxp=%d: no more than 20 pieces~%" maxp)
+        (= maxp 12)))
+  (= Threshold (/ (* 1008576 this.threshold) 100))
+  (csym::fprintf stderr "Threshold: %ld %ld~%" this.threshold Threshold)
+  (for ((= i 0) (< i ASIZE) (inc i)) (= (aref pen.a i) 0))
+  (for ((= i 0) (< i maxp) (inc i)) (= (aref pen.a i) i))
+  (for ((= i 0) (< i BSIZE) (inc i)) (= (aref pen.b i) 0))
+  (for ((= i 6) (< i BSIZE) (+= i 7))
+    (= (aref pen.b i) #\Newline)) ; right side wall
+  ;; piece���*5 ������������������腥眼�����������
+  (= kk 0)
+  (for ((= i 0) (< i (* maxp 5)) (inc i))
+       (for ((inc kk) (< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
+                                                 (break))))
+  (= pen.maxk kk)
+  (for ((< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
+                                   (= (aref pen.b kk) #\*)))
+  (= pen.maxp maxp)
+  (%if* USE-PROBABILITY
+    (= PROBABILITY 1.0))
+  (csym::gettimeofday tp 0)
+  (= (aref Tp 0) (aref tp 0))
+  (catch 1
+    (= this.r 1)
+    (search 0 0 0 maxp maxp pen.maxk (ptr pen))
+    (= this.r 0))
+  (csym::gettimeofday (+ tp 1) 0)
+  (fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def ps (array int 73 5)
+  (array
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
+   (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
+                                        ; ****    *
+                                        ;         *
+                                        ;        **
+   (array 6 1 1 1) (array 5 1 1 1) (array 1 1 1 5) (array 1 1 1 6)
+   ;;     *                 *            ****          ****
+   ;;    ****             ****            *              * 
+   (array 7 1 6 7) (array 7 7 1 6) (array 7 6 1 7) (array 6 1 7 7)
+   ;;     *                 *              *                *
+   ;;     **                *              *               **
+   ;;     *                 **            **                *
+   ;;     *                 *              *                *
+   (array 7 7 1 1) (array 1 1 5 7) (array 1 1 7 7) (array 7 5 1 1)
+   ;;     *                 ***          ***               *
+   ;;     *                 *              *               *
+   ;;     ***               *              *             ***
+   (array 2 5 1 1) (array 1 1 5 2) (array 1 6 7 1) (array 1 7 6 1)
+   ;;     * *              ***            **              **
+   ;;     ***              * *            *                *
+   ;;                                     **              **
+   (array 7 1 1 5) (array 5 1 1 7) (array 7 6 1 1) (array 1 1 6 7)
+   ;;     *                 *              *              ***
+   ;;     ***             ***              *               *
+   ;;     *                 *             ***              *
+   (array 7 1 1 6) (array 5 1 1 6) (array 6 1 1 5) (array 6 1 1 7) 
+   ;;     *                 *              *              *
+   ;;     ***             ***             ***            ***
+   ;;      *               *              *                *
+   (array 1 7 1 6) (array 7 1 5 1) (array 1 5 1 7) (array 6 1 7 1) 
+   ;;     **               *              **              *
+   ;;      **              **            **              **
+   ;;      *              **              *               **
+   (array 7 1 1 7) (array 5 1 1 5) (array 1 7 7 1) (array 1 6 6 1)
+   ;;      *               *              **              **
+   ;;      ***           ***               *              *
+   ;;        *           *                 **            **
+   (array 6 1 1 6)
+   ;;      * 
+   ;;     ***
+   ;;      * 
+   (array 1 6 1 1) (array 1 1 5 1) (array 1 5 1 1) (array 1 1 6 1)
+   ;;      **               ***            **             ***
+   ;;      ***              **            ***              **
+   (array 7 1 6 1) (array 1 6 1 6) (array 6 1 6 1) (array 1 6 1 7)
+   ;;      *               **              *               **
+   ;;      **              **             **               **
+   ;;      **              *              **                *
+   (array 1 4 1 1) (array 1 1 7 1) (array 1 7 1 1) (array 1 1 4 1)
+   ;;      **              ***            **               ***
+   ;;    ***                 **            ***            **
+   (array 7 1 7 7) (array 7 6 1 6) (array 6 1 6 7) (array 7 7 1 7)
+   ;;      *                *              *              *
+   ;;      **               *             **              *
+   ;;       *              **             *               **
+   ;;       *              *              *                *
+   (array 7 1 7 1) (array 1 5 1 6) (array 1 7 1 7) (array 6 1 5 1)
+   ;;      *                **              **              *
+   ;;      **              **                **            **
+   ;;       **             *                  *           **
+   ;; ; extension
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   ))
+
+(def pos (array int 21) (array 0 2 4 12 16 20 24 32 36 37 45 53 57
+                               ;; extension
+                               59 61 63 65 67 69 71 73))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; k: ���������腥冴����祉��
+;; j0:
+;; j1--j2: 荅���������若�鴻��腮�蕁�
+(def (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino)))
+  (def s int 0)
+  (do-many for p from j1 to j2
+    (def ap int (aref (fref (mref tsk) a) p))
+    (def i int)
+    (for ((= i (aref pos ap)) (< i (aref pos (+ ap 1))) (inc i))     
+      ;;  examine the "i"-th (piece, direction)
+      ;;  at the first empty location "k"
+      (def pss (ptr int) (aref ps i))
+      (def kk int k)  (decl l int)
+      (for ((= l 0) (< l 4) (inc l))
+        (if (or (>= (+= kk (aref pss l)) maxk)
+                (!= (aref (fref (mref tsk) b) kk) 0))
+            (goto Ln)))
+      (dynamic-wind
+        (:before
+          (= (aref (fref (mref tsk) b)
+                   (= kk k))
+             (+ p #\A))
+          (for ((= l 0) (< l 4) (inc l))
+            (= (aref (fref (mref tsk) b)
+                     (+= kk (aref pss l)))
+               (+ p #\A)))
+          (= (aref (fref (mref tsk) a) p)
+             (aref (fref (mref tsk) a) j0))
+          (= (aref (fref (mref tsk) a) j0) ap)
+          (DEBUG-STMTS 2
+                       (if BACKTRACKING (csym::fprintf stderr "(worker %d) redoing~%" WORKER-ID)))
+          )
+        (:body
+          (for ((= kk k) (< kk maxk) (inc kk))
+            (if (== (aref (fref (mref tsk) b) kk) 0) (break)))
+          (if (== kk maxk)
+              (+= s 1)
+            (if (and (or (>= (+ kk 7) maxk)
+                         (!= (aref (fref (mref tsk) b) (+ kk 7)) 0))
+                     (or (!= (aref (fref (mref tsk) b) (+ kk 1)) 0)
+                         (and (or (>= (+ kk 8) maxk)
+                                  (!= (aref (fref (mref tsk) b) (+ kk 8)) 0))
+                              (!= (aref (fref (mref tsk) b) (+ kk 2)) 0))))
+                ()
+              (+= s (search kk (+ j0 1) (+ j0 1) maxp maxp maxk tsk)))))
+        (:after
+          (= ap (aref (fref (mref tsk) a) j0))
+          (= (aref (fref (mref tsk) a) j0) (aref (fref (mref tsk) a) p))
+          (= (aref (fref (mref tsk) a) p) ap)
+          (= (aref (fref (mref tsk) b) (= kk k)) 0)
+          (for ((= l 0) (< l 4) (inc l))
+            (= (aref (fref (mref tsk) b) (+= kk (aref pss l))) 0))
+          (DEBUG-STMTS 2
+                       (if BACKTRACKING (csym::fprintf stderr "(worker %d) temporary undoing~%" WORKER-ID)))
+          )
+        )
+      (label Ln (continue))
+      )
+    ;; put/get pentomino task/result
+    (handles pentomino
+      (:put from i1 to i2
+        (%if* USE-PROBABILITY
+          (= PROBABILITY (pen-probability j0 maxp)))
+        (= this (mref tsk))
+        (= this.k k)
+        (= this.i0 j0)
+        (= this.i1 i1)
+        (= this.i2 i2))
+      (:get
+        (+= s this.r))))
+  (if (> s Threshold)
+      (begin
+       (csym::gettimeofday (+ Tp 1) 0)
+       (csym::fprintf stderr "etime: %lf~%s=%ld~%"  (csym::elapsed-time Tp) s)
+       (throw 1)))
+  (return s))
diff --git a/src/sample/tcell/pen6x17-try.tcell b/src/sample/tcell/pen6x17-try.tcell
new file mode 100644
index 00000000..07017eb4
--- /dev/null
+++ b/src/sample/tcell/pen6x17-try.tcell
@@ -0,0 +1,281 @@
+;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; All rights reserved.
+
+;;; Redistribution and use in source and binary forms, with or without
+;;; modification, are permitted provided that the following conditions
+;;; are met:
+;;; 1. Redistributions of source code must retain the above copyright
+;;;    notice, this list of conditions and the following disclaimer.
+;;; 2. Redistributions in binary form must reproduce the above copyright
+;;;    notice, this list of conditions and the following disclaimer in the
+;;;    documentation and/or other materials provided with the distribution.
+
+;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+;;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+;;; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+;;; ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE
+;;; FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+;;; OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+;;; HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+;;; SUCH DAMAGE.
+
+;;; Find all the solutions of Pentomino puzzle
+
+;; task 0 0 0 1
+;; <n>
+
+(c-exp "#include<sys/time.h>")
+
+(%include "rule/tcell-setrule.sh")
+(%include "clib.sh")
+(%include "dprint.sh")
+(%cinclude "sendrecv.h" (:macro))
+
+(%defconstant ASIZE 20)
+(%defconstant BSIZE 119)
+
+(%defconstant USE-PROBABILITY 0)
+
+(def (pen-probability j maxp)
+     (fn double int int)
+    (if (>= j 3)
+        (return (/ (cast double (- maxp j)) (cast double (- maxp 2))))
+        (return 1.0)))
+    ; constant probability
+    ; (if (>= j 3)
+    ;     (return (/ 1.0 16.0))
+    ;     (return 1.0)))
+    ; threshold based probability
+    ; (if (>= j 3)
+    ;     (return 0.0)
+    ;     (return 1.0)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (task pentomino)
+  (def r int :out)
+  (def k int :in)
+  (def i0 int :in)
+  (def i1 int :in)
+  (def i2 int :in)
+  (def maxp int :in)  ; number of pieces
+  (def maxk int :in)  ; the last empty cell
+  (def a (array int ASIZE) :in)
+  (def b (array int BSIZE) :in))
+
+;; task/rslt-sender/receiver = default
+
+(decl (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino))))
+(def (task-body pentomino)
+  (decl i int)
+  (def k int this.k)
+  (def i0 int this.i0)
+  (def i1 int this.i1)
+  (def i2 int this.i2)
+  (def maxp int this.maxp)
+  (def maxk int this.maxk)
+  (DEBUG-PRINT 1 "start %d %d %d %d %d %d~%" k i0 i1 i2 maxp maxk)
+  (%if* USE-PROBABILITY
+    (= PROBABILITY (pen-probability i0 maxp)))
+  (= this.r (search k i0 i1 i2 maxp maxk (ptr this)))
+  (DEBUG-PRINT 1 "end %d~%" this.r))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def (task start-pentomino)
+  (def maxp int :in) ; number of pieces
+  (def r int :out))
+
+(def (csym::elapsed-time tp) 
+    (fn double (array (struct timeval) 2))
+  (return (+ (- (fref (aref tp 1) tv-sec)
+                (fref (aref tp 0) tv-sec))
+             (* 0.000001
+                (- (fref (aref tp 1) tv-usec)
+                   (fref (aref tp 0) tv-usec))))))
+
+;; ��違�������馹����茹ｃ��
+(def (task-body start-pentomino)
+  (decl tp (array (struct timeval) 2))
+  (def pen (struct pentomino))
+  (def maxp int this.maxp)
+  (def i int)
+  (def kk int)
+  (if (or (< maxp 0) (> maxp 20))
+      (begin
+        (csym::fprintf stderr "maxp=%d: no more than 20 pieces~%" maxp)
+        (= maxp 12)))
+  (for ((= i 0) (< i ASIZE) (inc i)) (= (aref pen.a i) 0))
+  (for ((= i 0) (< i maxp) (inc i)) (= (aref pen.a i) i))
+  (for ((= i 0) (< i BSIZE) (inc i)) (= (aref pen.b i) 0))
+  (for ((= i 6) (< i BSIZE) (+= i 7))
+    (= (aref pen.b i) #\Newline)) ; right side wall
+  ;; piece���*5 ������������������腥眼�����������
+  (= kk 0)
+  (for ((= i 0) (< i (* maxp 5)) (inc i))
+       (for ((inc kk) (< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
+                                                 (break))))
+  (= pen.maxk kk)
+  (for ((< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
+                                   (= (aref pen.b kk) #\*)))
+  (= pen.maxp maxp)
+  (%if* USE-PROBABILITY
+    (= PROBABILITY 1.0))
+  (csym::gettimeofday tp 0)
+  (= this.r (search 0 0 0 maxp maxp pen.maxk (ptr pen)))
+  (csym::gettimeofday (+ tp 1) 0)
+  (fprintf stderr "time: %lf~%"  (csym::elapsed-time tp)))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(def ps (array int 73 5)
+  (array
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
+   (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
+                                        ; ****    *
+                                        ;         *
+                                        ;        **
+   (array 6 1 1 1) (array 5 1 1 1) (array 1 1 1 5) (array 1 1 1 6)
+   ;;     *                 *            ****          ****
+   ;;    ****             ****            *              * 
+   (array 7 1 6 7) (array 7 7 1 6) (array 7 6 1 7) (array 6 1 7 7)
+   ;;     *                 *              *                *
+   ;;     **                *              *               **
+   ;;     *                 **            **                *
+   ;;     *                 *              *                *
+   (array 7 7 1 1) (array 1 1 5 7) (array 1 1 7 7) (array 7 5 1 1)
+   ;;     *                 ***          ***               *
+   ;;     *                 *              *               *
+   ;;     ***               *              *             ***
+   (array 2 5 1 1) (array 1 1 5 2) (array 1 6 7 1) (array 1 7 6 1)
+   ;;     * *              ***            **              **
+   ;;     ***              * *            *                *
+   ;;                                     **              **
+   (array 7 1 1 5) (array 5 1 1 7) (array 7 6 1 1) (array 1 1 6 7)
+   ;;     *                 *              *              ***
+   ;;     ***             ***              *               *
+   ;;     *                 *             ***              *
+   (array 7 1 1 6) (array 5 1 1 6) (array 6 1 1 5) (array 6 1 1 7) 
+   ;;     *                 *              *              *
+   ;;     ***             ***             ***            ***
+   ;;      *               *              *                *
+   (array 1 7 1 6) (array 7 1 5 1) (array 1 5 1 7) (array 6 1 7 1) 
+   ;;     **               *              **              *
+   ;;      **              **            **              **
+   ;;      *              **              *               **
+   (array 7 1 1 7) (array 5 1 1 5) (array 1 7 7 1) (array 1 6 6 1)
+   ;;      *               *              **              **
+   ;;      ***           ***               *              *
+   ;;        *           *                 **            **
+   (array 6 1 1 6)
+   ;;      * 
+   ;;     ***
+   ;;      * 
+   (array 1 6 1 1) (array 1 1 5 1) (array 1 5 1 1) (array 1 1 6 1)
+   ;;      **               ***            **             ***
+   ;;      ***              **            ***              **
+   (array 7 1 6 1) (array 1 6 1 6) (array 6 1 6 1) (array 1 6 1 7)
+   ;;      *               **              *               **
+   ;;      **              **             **               **
+   ;;      **              *              **                *
+   (array 1 4 1 1) (array 1 1 7 1) (array 1 7 1 1) (array 1 1 4 1)
+   ;;      **              ***            **               ***
+   ;;    ***                 **            ***            **
+   (array 7 1 7 7) (array 7 6 1 6) (array 6 1 6 7) (array 7 7 1 7)
+   ;;      *                *              *              *
+   ;;      **               *             **              *
+   ;;       *              **             *               **
+   ;;       *              *              *                *
+   (array 7 1 7 1) (array 1 5 1 6) (array 1 7 1 7) (array 6 1 5 1)
+   ;;      *                **              **              *
+   ;;      **              **                **            **
+   ;;       **             *                  *           **
+   ;; ; extension
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   (array 1 1 1 1) (array 7 7 7 7)
+   ))
+
+(def pos (array int 21) (array 0 2 4 12 16 20 24 32 36 37 45 53 57
+                               ;; extension
+                               59 61 63 65 67 69 71 73))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;; k: ���������腥冴����祉��
+;; j0:
+;; j1--j2: 荅���������若�鴻��腮�蕁�
+(def (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino)))
+  (def s int 0)
+  (catch 1 ; meaningless catch for performance evaluation
+   (do-many for p from j1 to j2
+    (def ap int (aref (fref (mref tsk) a) p))
+    (def i int)
+    (for ((= i (aref pos ap)) (< i (aref pos (+ ap 1))) (inc i))     
+      ;;  examine the "i"-th (piece, direction)
+      ;;  at the first empty location "k"
+      (def pss (ptr int) (aref ps i))
+      (def kk int k)  (decl l int)
+      (for ((= l 0) (< l 4) (inc l))
+        (if (or (>= (+= kk (aref pss l)) maxk)
+                (!= (aref (fref (mref tsk) b) kk) 0))
+            (goto Ln)))
+      (dynamic-wind
+        (:before
+          (= (aref (fref (mref tsk) b)
+                   (= kk k))
+             (+ p #\A))
+          (for ((= l 0) (< l 4) (inc l))
+            (= (aref (fref (mref tsk) b)
+                     (+= kk (aref pss l)))
+               (+ p #\A)))
+          (= (aref (fref (mref tsk) a) p)
+             (aref (fref (mref tsk) a) j0))
+          (= (aref (fref (mref tsk) a) j0) ap)
+          (DEBUG-STMTS 2
+                       (if BACKTRACKING (csym::fprintf stderr "(worker %d) redoing~%" WORKER-ID)))
+          )
+        (:body
+          (for ((= kk k) (< kk maxk) (inc kk))
+            (if (== (aref (fref (mref tsk) b) kk) 0) (break)))
+          (if (== kk maxk)
+              (+= s 1)
+            (if (and (or (>= (+ kk 7) maxk)
+                         (!= (aref (fref (mref tsk) b) (+ kk 7)) 0))
+                     (or (!= (aref (fref (mref tsk) b) (+ kk 1)) 0)
+                         (and (or (>= (+ kk 8) maxk)
+                                  (!= (aref (fref (mref tsk) b) (+ kk 8)) 0))
+                              (!= (aref (fref (mref tsk) b) (+ kk 2)) 0))))
+                ()
+              (+= s (search kk (+ j0 1) (+ j0 1) maxp maxp maxk tsk)))))
+        (:after
+          (= ap (aref (fref (mref tsk) a) j0))
+          (= (aref (fref (mref tsk) a) j0) (aref (fref (mref tsk) a) p))
+          (= (aref (fref (mref tsk) a) p) ap)
+          (= (aref (fref (mref tsk) b) (= kk k)) 0)
+          (for ((= l 0) (< l 4) (inc l))
+            (= (aref (fref (mref tsk) b) (+= kk (aref pss l))) 0))
+          (DEBUG-STMTS 2
+                       (if BACKTRACKING (csym::fprintf stderr "(worker %d) temporary undoing~%" WORKER-ID)))
+          )
+        )
+      (label Ln (continue))
+      )
+    ;; put/get pentomino task/result
+    (handles pentomino
+      (:put from i1 to i2
+        (%if* USE-PROBABILITY
+          (= PROBABILITY (pen-probability j0 maxp)))
+        (= this (mref tsk))
+        (= this.k k)
+        (= this.i0 j0)
+        (= this.i1 i1)
+        (= this.i2 i2))
+      (:get
+        (+= s this.r))))
+  )
+  (return s))
diff --git a/src/sample/tcell/pen6x17.tcell b/src/sample/tcell/pen6x17.tcell
index 7f3e444a..31639a1f 100644
--- a/src/sample/tcell/pen6x17.tcell
+++ b/src/sample/tcell/pen6x17.tcell
@@ -37,7 +37,7 @@
 (%defconstant ASIZE 20)
 (%defconstant BSIZE 119)
 
-(%defconstant USE-PROBABILITY 1)
+(%defconstant USE-PROBABILITY 0)
 
 (def (pen-probability j maxp)
      (fn double int int)
@@ -56,16 +56,24 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def (task pentomino)
   (def r int :out)
-  (def k int :in)
-  (def i0 int :in)
-  (def i1 int :in)
-  (def i2 int :in)
-  (def maxp int :in)  ; number of pieces
-  (def maxk int :in)  ; the last empty cell
-  (def a (array int ASIZE) :in)
-  (def b (array int BSIZE) :in))
+  (def k int )
+  (def i0 int )
+  (def i1 int )
+  (def i2 int )
+  (def maxp int )  ; number of pieces
+  (def maxk int )  ; the last empty cell
+  (def a (array int ASIZE))
+  (def b (array int BSIZE)))
 
-;; task/rslt-sender/receiver = default
+(def (task-sender pentomino)
+  (csym::send-bytes (cast (ptr void) (ptr this)) (sizeof this))
+  )
+
+(def (task-receiver pentomino)
+  (csym::recv-bytes (cast (ptr void) (ptr this)) (sizeof this))
+  )
+
+;; rslt-sender/receiver = default
 
 (decl (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino))))
 (def (task-body pentomino)
@@ -77,7 +85,7 @@
   (def maxp int this.maxp)
   (def maxk int this.maxk)
   (DEBUG-PRINT 1 "start %d %d %d %d %d %d~%" k i0 i1 i2 maxp maxk)
-  (%ifdef* USE-PROBABILITY
+  (%if* USE-PROBABILITY
     (= PROBABILITY (pen-probability i0 maxp)))
   (= this.r (search k i0 i1 i2 maxp maxk (ptr this)))
   (DEBUG-PRINT 1 "end %d~%" this.r))
@@ -95,7 +103,7 @@
                 (- (fref (aref tp 1) tv-usec)
                    (fref (aref tp 0) tv-usec))))))
 
-;; 新しい問題を解く
+;; ��違�������馹����茹ｃ��
 (def (task-body start-pentomino)
   (decl tp (array (struct timeval) 2))
   (def pen (struct pentomino))
@@ -111,7 +119,7 @@
   (for ((= i 0) (< i BSIZE) (inc i)) (= (aref pen.b i) 0))
   (for ((= i 6) (< i BSIZE) (+= i 7))
     (= (aref pen.b i) #\Newline)) ; right side wall
-  ;; piece数*5 個目より先の穴は埋める
+  ;; piece���*5 ������������������腥眼�����������
   (= kk 0)
   (for ((= i 0) (< i (* maxp 5)) (inc i))
        (for ((inc kk) (< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
@@ -120,7 +128,7 @@
   (for ((< kk BSIZE) (inc kk)) (if (== (aref pen.b kk) 0)
                                    (= (aref pen.b kk) #\*)))
   (= pen.maxp maxp)
-  (%ifdef* USE-PROBABILITY
+  (%if* USE-PROBABILITY
     (= PROBABILITY 1.0))
   (csym::gettimeofday tp 0)
   (= this.r (search 0 0 0 maxp maxp pen.maxk (ptr pen)))
@@ -130,7 +138,7 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 (def ps (array int 73 5)
   (array
-   (array 1 1 1 1) (array 7 7 7 7)      ; ***** とその縦向き
+   (array 1 1 1 1) (array 7 7 7 7)      ; ***** ���������膰�������
    (array 4 1 1 1) (array 7 7 6 1)      ;    *    *
                                         ; ****    *
                                         ;         *
@@ -206,9 +214,9 @@
                                59 61 63 65 67 69 71 73))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; k: 最初の空きセル
+;; k: ���������腥冴����祉��
 ;; j0:
-;; j1--j2: 試すビースの種類
+;; j1--j2: 荅���������若�鴻��腮�蕁�
 (def (search k j0 j1 j2 maxp maxk tsk) (wfn int int int int int int int (ptr (struct pentomino)))
   (def s int 0)
   (do-many for p from j1 to j2
@@ -267,7 +275,7 @@
     ;; put/get pentomino task/result
     (handles pentomino
       (:put from i1 to i2
-        (%ifdef* USE-PROBABILITY
+        (%if* USE-PROBABILITY
           (= PROBABILITY (pen-probability j0 maxp)))
         (= this (mref tsk))
         (= this.k k)
diff --git a/src/sample/tcell/queue.lsp b/src/sample/tcell/queue.lsp
index a3e81515..d08f0868 100644
--- a/src/sample/tcell/queue.lsp
+++ b/src/sample/tcell/queue.lsp
@@ -1,71 +1,71 @@
-(defpackage "QUEUE"
-  (:use "CL")
-  (:export "QUEUE" "SHARED-QUEUE" "ADD-QUEUE" "EMPTY-QUEUE-P"
-           "DELETE-QUEUE" "FIND-DELETE-QUEUE"
-           "QUEUE-BODY" "SQ-LOCK" "SQ-GATE")
-  ;; sc-misc.lsp のキュー関連の関数との衝突を防ぐ
-  (:shadow #:empty-queue-p #:delete-queue #:find-delete-queue))
-(in-package "QUEUE")
-
-;;;; queueクラスの定義
-(defclass queue ()
-  ((body :accessor queue-body :type list :initform (misc:make-queue))))
-
-(defclass shared-queue (queue)
-  ((lock :accessor sq-lock :type mp:process-lock :initform (mp:make-process-lock))
-   (gate :accessor sq-gate :initform (mp:make-gate nil)))) ; to notify addition
-
-
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-
-;; queueへの追加
-(defgeneric add-queue (elm q))
-(defmethod add-queue (elm (q queue))
-  (misc:insert-queue elm (queue-body q)))
-
-(defmethod add-queue :around (elm (sq shared-queue))
-  (declare (ignorable elm))
-  (mp:with-process-lock ((sq-lock sq))
-    (prog1 (call-next-method)
-      (mp:open-gate (sq-gate sq)))))
-
-;; 空queue
-(defgeneric empty-queue-p (q))
-(defmethod empty-queue-p ((q queue))
-  (misc:empty-queue-p (queue-body q)))
-
-;; queueから取り出し
-(defgeneric delete-queue (q))
-(defmethod delete-queue ((q queue))
-  (misc:delete-queue (queue-body q)))
-
-(defmethod delete-queue :around ((sq shared-queue))
-  (mp:with-process-lock ((sq-lock sq))
-    (prog1 (call-next-method)
-      (when (empty-queue-p sq)
-        (mp:close-gate (sq-gate sq))))))
-
-;; queueから検索して取り出し
-(defgeneric find-delete-queue (q test &key key))
-(defmethod find-delete-queue ((q queue) test &key (key #'identity))
-  (misc:find-delete-queue (queue-body q) test :key key))
-
-(defmethod find-delete-queue :around ((sq shared-queue) test
-                                       &key (key #'identity)
-                                            (wait nil))
-  (declare (ignore test key))
-  (block :end
-    (tagbody
-      :retry
-      (mp:with-process-lock ((sq-lock sq))
-        (let ((item (call-next-method)))
-          (when item
-            (when (empty-queue-p sq)
-              (mp:close-gate (sq-gate sq)))
-            (return-from :end item))
-          (unless wait
-            (return-from :end nil))
-          (mp:close-gate (sq-gate sq))))
-      (mp:process-wait "FIND-DELETE-QUEUE-WAIT"
-                       #'mp:gate-open-p (sq-gate sq))
-      (go :retry))))
+(defpackage "QUEUE"
+  (:use "CL")
+  (:export "QUEUE" "SHARED-QUEUE" "ADD-QUEUE" "EMPTY-QUEUE-P"
+           "DELETE-QUEUE" "FIND-DELETE-QUEUE"
+           "QUEUE-BODY" "SQ-LOCK" "SQ-GATE")
+  ;; sc-misc.lsp ��������ャ�守�∫�ｃ����∽�違�����茵�腦������蚊��
+  (:shadow #:empty-queue-p #:delete-queue #:find-delete-queue))
+(in-package "QUEUE")
+
+;;;; queue��������鴻��絎�臂�
+(defclass queue ()
+  ((body :accessor queue-body :type list :initform (misc:make-queue))))
+
+(defclass shared-queue (queue)
+  ((lock :accessor sq-lock :type mp:process-lock :initform (mp:make-process-lock))
+   (gate :accessor sq-gate :initform (mp:make-gate nil)))) ; to notify addition
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+;; queue��吾��菴遵��
+(defgeneric add-queue (elm q))
+(defmethod add-queue (elm (q queue))
+  (misc:insert-queue elm (queue-body q)))
+
+(defmethod add-queue :around (elm (sq shared-queue))
+  (declare (ignorable elm))
+  (mp:with-process-lock ((sq-lock sq))
+    (prog1 (call-next-method)
+      (mp:open-gate (sq-gate sq)))))
+
+;; 腥�queue
+(defgeneric empty-queue-p (q))
+(defmethod empty-queue-p ((q queue))
+  (misc:empty-queue-p (queue-body q)))
+
+;; queue��������������冴��
+(defgeneric delete-queue (q))
+(defmethod delete-queue ((q queue))
+  (misc:delete-queue (queue-body q)))
+
+(defmethod delete-queue :around ((sq shared-queue))
+  (mp:with-process-lock ((sq-lock sq))
+    (prog1 (call-next-method)
+      (when (empty-queue-p sq)
+        (mp:close-gate (sq-gate sq))))))
+
+;; queue������罎�膣≪�������������冴��
+(defgeneric find-delete-queue (q test &key key))
+(defmethod find-delete-queue ((q queue) test &key (key #'identity))
+  (misc:find-delete-queue (queue-body q) test :key key))
+
+(defmethod find-delete-queue :around ((sq shared-queue) test
+                                       &key (key #'identity)
+                                            (wait nil))
+  (declare (ignore test key))
+  (block :end
+    (tagbody
+      :retry
+      (mp:with-process-lock ((sq-lock sq))
+        (let ((item (call-next-method)))
+          (when item
+            (when (empty-queue-p sq)
+              (mp:close-gate (sq-gate sq)))
+            (return-from :end item))
+          (unless wait
+            (return-from :end nil))
+          (mp:close-gate (sq-gate sq))))
+      (mp:process-wait "FIND-DELETE-QUEUE-WAIT"
+                       #'mp:gate-open-p (sq-gate sq))
+      (go :retry))))
diff --git a/src/sample/tcell/sendrecv.c b/src/sample/tcell/sendrecv.c
index af12aa87..c62c09fd 100644
--- a/src/sample/tcell/sendrecv.c
+++ b/src/sample/tcell/sendrecv.c
@@ -26,6 +26,7 @@ SUCH DAMAGE.
 
 #include <stdio.h>
 #include <stdlib.h>
+#include <stdint.h>
 #include <string.h>
 #include "sock.h"
 #include "sendrecv.h"
@@ -37,15 +38,83 @@ extern int sv_socket;     /* defined in worker.sc */
 /**/
 void send_int(int n)
 {
-    char buf[16];
-    snprintf (buf, 16, "%d\n", n);
-    send_string (buf, sv_socket);
+    if(RANK < 0)
+        {
+            char buf[16];
+            snprintf (buf, 16, "%d\n", n);
+            send_string (buf, sv_socket);
+        }
+    else
+        {
+            send_int32s (&n, 1);
+        }
 }
+
+
 int recv_int(void)
 {
-    char buf[16];
-    receive_line (buf, 16, sv_socket);
-    return atoi(buf);
+    if(RANK < 0)
+        {
+            char buf[16];
+            receive_line (buf, 16, sv_socket);
+            return atoi(buf);
+        }
+    else
+        {
+            int dst[1];
+            recv_int32s (dst, 1);
+            return dst[0];
+        }
+}
+
+/**/
+void send_long(long n)
+{
+    if(RANK < 0)
+        {
+            char buf[16];
+            snprintf (buf, 16, "%ld\n", n);
+            send_string (buf, sv_socket);
+        }
+    else
+        {
+            send_longs (&n, 1);
+        }
+    // char buf[16];
+    // snprintf (buf, 16, "%ld\n", n);
+    // send_string (buf, sv_socket);
+}
+long recv_long(void)
+{
+    if(RANK < 0)
+        {
+            char buf[16];
+            receive_line (buf, 16, sv_socket);
+            return atol(buf);
+        }
+    else
+        {
+            long dst[1];
+            recv_longs (dst, 1);
+            return dst[0];
+        }
+    // char buf[16];
+    // receive_line (buf, 16, sv_socket);
+    // return atol(buf);
+}
+
+/**/
+void send_longlong(long long int n)
+{
+  char buf[24];
+  snprintf(buf, 24, "%lld\n", n);
+  send_string(buf, sv_socket);
+}
+long long int recv_longlong(void)
+{
+  char buf[24];
+  receive_line(buf, 24, sv_socket);
+  return atoll(buf);
 }
 
 /**/
@@ -95,26 +164,51 @@ void recv_binary_terminator (void)
 /**/
 void swap_int32s (INT32 *a, int n)
 {
-  /* !!! 未実装 !!! */
+  /* !!! ���絎�茖� !!! */
 }
 
 /**/
 int send_int32s (INT32 *a, int nelm)
 {
   int ret;
-  send_binary_header (sizeof(INT32), nelm);
   ret = send_binary (a, sizeof(INT32), nelm, sv_socket);
-  send_binary_terminator ();
   return ret;
 }
     
 int recv_int32s (INT32 *a, int nelm)
 {
-  int ret, swp;
-  swp = recv_binary_header (0, 0);
+  int ret;
   ret = receive_binary (a, sizeof(INT32), nelm, sv_socket);
-  if (swp) swap_int32s (a, nelm);
-  recv_binary_terminator ();
+  return ret;
+}
+
+/**/
+int send_longs (long *a, int nelm)
+{
+  int ret;
+  ret = send_binary (a, sizeof(long), nelm, sv_socket);
+  return ret;
+}
+    
+int recv_longs (long *a, int nelm)
+{
+  int ret;
+  ret = receive_binary (a, sizeof(long), nelm, sv_socket);
+  return ret;
+}
+
+/**/
+int send_bytes (void *a, int size)
+{
+  int ret;
+  ret = send_binary (a, size, 1, sv_socket);
+  return ret;
+}
+    
+int recv_bytes (void *a, int size)
+{
+  int ret;
+  ret = receive_binary (a, size, 1, sv_socket);
   return ret;
 }
 
@@ -127,8 +221,8 @@ void swap_doubles (double *a, int n)
     for( i = 0 ; i < n ; i++ )
         {
             unsigned long *xp = (unsigned long *)(a+i);
-            unsigned long x0 = xp[0];  /* 前32bit */
-            unsigned long x1 = xp[1];  /* 後32bit */
+            unsigned long x0 = xp[0];  /* ���32bit */
+            unsigned long x1 = xp[1];  /* 緇�32bit */
             unsigned long y0 = x0;
             unsigned long y1 = x1;
                                        /* y0 y1 y2 y3 */
@@ -180,19 +274,14 @@ int recv_double_seq (double *a, int nelm)
 int send_doubles (double *a, int nelm)
 {
   int ret;
-  send_binary_header (sizeof(double), nelm);
   ret = send_binary (a, sizeof(double), nelm, sv_socket);
-  send_binary_terminator ();
   return ret;
 }
 
 int recv_doubles (double *a, int nelm)
 {
-  int ret, swp;
-  swp = recv_binary_header (0, 0);
+  int ret;
   ret = receive_binary (a, sizeof(double), nelm, sv_socket);
-  if (swp) swap_doubles (a, nelm);
-  recv_binary_terminator ();
   return ret;
 }
 
diff --git a/src/sample/tcell/sendrecv.h b/src/sample/tcell/sendrecv.h
index b85bd8a9..5b47feaf 100644
--- a/src/sample/tcell/sendrecv.h
+++ b/src/sample/tcell/sendrecv.h
@@ -28,8 +28,18 @@ SUCH DAMAGE.
 #define INT32 int
 #endif
 
+/**/
 void send_int(int n);
 int recv_int(void);
+
+/**/
+void send_long(long n);
+long recv_long(void);
+
+/**/
+void send_longlong(long long int n);
+long long int recv_longlong(void);
+
 /**/
 int send_binary_header (int elmsize, /* size of an element */
                         int nelm )   /* number of elements */;
@@ -46,6 +56,14 @@ void swap_int32s (INT32 *a, int n);
 int send_int32s (INT32 *a, int nelm);
 int recv_int32s (INT32 *a, int nelm);
 
+/**/
+int send_longs (long *a, int nelm);
+int recv_longs (long *a, int nelm);
+
+/**/
+int send_bytes (void *a, int size);
+int recv_bytes (void *a, int size);
+
 /**/
 void swap_doubles (double *a, int n);
 
@@ -53,6 +71,6 @@ void swap_doubles (double *a, int n);
 int send_double_seq (double *a, int nelm);
 int recv_double_seq (double *a, int nelm);
 
-/* ヘッダの送受信も含む */
+/* ������������������篆＜�������� */
 int send_doubles (double *a, int nelm);
 int recv_doubles (double *a, int nelm);
diff --git a/src/sample/tcell/server.lsp b/src/sample/tcell/server.lsp
index 89c4a82c..71235b8b 100644
--- a/src/sample/tcell/server.lsp
+++ b/src/sample/tcell/server.lsp
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2009-2011 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2009-2016 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -23,9 +23,9 @@
 ;;; SUCH DAMAGE.
 
 ;;;; Tascell server
-;;; 起動は (make-and-start-server) 必要に応じてkeyword parameterを参照
-;;; 性能評価の際は，  (push :tcell-no-transfer-log *features*)
-;;; をして，ログ関係のコードを無視してコンパイルする．
+;;; 莎桁����� (make-and-start-server) 綽�荀����綽�������keyword parameter���������
+;;; ��ц�処��箴＜��������鐚�  (push :tcell-no-transfer-log *features*)
+;;; ���������鐚������育�≫�������潟�若�������∴����������潟�潟����ゃ��������鐚�
 
 (defpackage "TCELL-SERVER"
   (:nicknames "TSV")
@@ -49,45 +49,45 @@
 
 
 
-;;; 強制的に待ち受けポート再利用
+;;; 綣桁�句�����緇���≦����������若�����������
 (defparameter *reuse-address* t)
 
-;;; 親への接続アドレス:ポート
+;;; 荀���吾���･膓���≪��������:�����若��
 (defparameter *parent-host* nil)
 (defparameter *parent-port* 9865)
 
-;;; 子からの接続ホスト/ポート
+;;; 絖�����������･膓������鴻��/�����若��
 (defparameter *server-host* "localhost")
 (defparameter *children-port* 9865)
 
-;;; ソケットのフォーマット（バイナリが不要なら:textにすると速度向上）
+;;; ��純�宴����������������若��������鐚������ゃ��������筝�荀�������:text���������������綺����筝�鐚�
 (defparameter *socket-format* :bivalent)
 
-;;; anyでないtreqを常に転送
+;;; any��с�����treq���絽吾��荵∫��
 (defparameter *transfer-treq-always-if-notany* t)
 
-;;; log出力の有無，出力先
-(defparameter *transfer-log* t)         ; (featurep :tcell-no-transfer-log) の場合は常に無効
-(defparameter *transfer-log-output* *error-output*) ; (featurep :tcell-no-transfer-log) の場合は常に無効
+;;; log��阪����������￥����阪�����
+(defparameter *transfer-log* t)         ; (featurep :tcell-no-transfer-log) �����翫�����絽吾����≦��
+(defparameter *transfer-log-output* *error-output*) ; (featurep :tcell-no-transfer-log) �����翫�����絽吾����≦��
 (defparameter *transfer-log-format* :normal) ; :normal or :gnuplot
 (defparameter *connection-log* t)
 
-;;; send/recvのログを出力する長さ
+;;; send/recv��������違����阪����������激��
 (defparameter *transfer-log-length* 70)
 
-;;; read-lineで読み込める長さ（許されるコマンド行の長さ）の最大
+;;; read-line��ц����粋昭��������激��鐚�荐宴����������潟����潟��茵������激��鐚�������紊�
 (defconstant +max-line-length+ 128)
-;;; task, rslt, dataのバッファを転送するときのバッファのサイズ
-;;; 十分大きくしないとデッドロックの原因
+;;; task, rslt, data��������������＜��荵∫����������������������������＜����泣�ゃ��
+;;; ������紊с��������������������������������������������
 (defconstant +body-buffer-size+ 4096)
 
-;;; コマンドに続いてデータをともなうコマンド
+;;; ��潟����潟�����膓������������若�帥����������������潟����潟��
 ;;; These constants are referred to in compile time with #. reader macros.
 (eval-when (:execute :load-toplevel :compile-toplevel)
-  (defparameter *commands* '("treq" "task" "none" "rslt" "rack" "bcst" "bcak" "dreq" "data"
-                             "leav" "lack" "abrt" "cncl"
+  (defparameter *commands* '("treq" "task" "none" "rslt" "rack" "bcst" "bcak"
+                             "leav" "cncl"
                              "log"  "stat" "verb" "eval" "exit"))
-  (defparameter *commands-with-data* '("task" "rslt" "data"))
+  (defparameter *commands-with-data* '("task" "rslt"))
   (defparameter *commands-broadcast* '("bcst"))
   (defparameter *commands-without-data* (set-difference
                                          (set-difference *commands*
@@ -105,42 +105,42 @@
    (sender :accessor host-sender :type (or null sender) :initform nil)
    (receiver :accessor host-receiver :type (or null receiver) :initform nil)
    (last-none-time :accessor host-none-time :type fixnum :initform -1)
-                                        ; 最後にnoneを受け取った時刻（get-internal-real-timeで獲得）
-                                        ; taskを送った相手に対してはリセットする
+                                        ; ���緇����none��������������ｃ�������誌��get-internal-real-time��х�峨��鐚�
+                                        ; task��������ｃ����御�����絲障�������������祉�����������
    (unreplied-treqs :accessor host-unreplied-treqs :type fixnum :initform 0)
-					; <treqを送った回数>-<taskまたはnoneをもらった回数>
+					; <treq��������ｃ��������>-<task��障�����none�����������ｃ��������>
    ))
 
 (defclass parent (host)
   ((host :initform *parent-host*)
    (port :initform *parent-port*)
-   (n-treq-sent :accessor parent-n-treq-sent :type fixnum :initform 0) ; 未使用
+   (n-treq-sent :accessor parent-n-treq-sent :type fixnum :initform 0) ; ���篏睡��
    (diff-task-rslt :accessor parent-diff-task-rslt :type fixnum :initform 0)
-                                        ; <taskをもらった回数>-<rsltを送った回数> (childとは違うので注意)
+                                        ; <task�����������ｃ��������>-<rslt��������ｃ��������> (child�����������������ф絵���)
    ))
 
-;; terminal-parentのauto-rack, auto-resend-taskを実現するために
-;; 覚えておくtaskコマンドの情報
+;; terminal-parent���auto-rack, auto-resend-task���絎��憗��������������
+;; 荀�������������task��潟����潟�����������
 (defstruct task-home
-  task-cmd                              ; taskコマンドそのもの
-  rack-to                               ; rack送信先
-  rack-task-head                        ; rackのtask-head
-  start-time)                           ; 開始時刻 (get-internal-real-time)
+  task-cmd                              ; task��潟����潟��������������
+  rack-to                               ; rack���篆≦��
+  rack-task-head                        ; rack���task-head
+  start-time)                           ; ���紮������� (get-internal-real-time)
 
 (defclass terminal-parent (parent)
   ((host :initform "Terminal")
    (port :initform -1)
    (sock :initform (make-two-way-stream *standard-input* *standard-output*))
    (auto-rack :accessor parent-auto-rack :type boolean :initarg :auto-rack :initform nil)
-                                        ; 自動的にrackを返す
+                                        ; ������������rack���菴����
    (auto-resend-task :accessor parent-auto-resend-task :type fixnum :initarg :auto-resend-task :initform 0)
-                                        ; auto-rack後，自動的に同じtaskを再送信する回数
+                                        ; auto-rack緇�鐚�������������������task���������篆＜�����������
    (auto-exit :accessor parent-auto-exit :type boolean :initarg :auto-exit :initform nil)
-                                        ; auto-rack後，かつauto-resend-taskが尽きていたら自動でexitを送る
+                                        ; auto-rack緇�鐚�������auto-resend-task���絨純�����������������������exit���������
    (auto-treq-response-func :accessor parent-auto-treq-response-func :type (or null function) :initform nil)
-                                        ; treqを送ったら自動的に実行される関数
+                                        ; treq��������ｃ�����������������絎�茵������������∽��
    (task-home :accessor parent-task-home :type list :initform ())
-                                        ; ↑を実現するために親から送られたtaskを覚えておくリスト
+                                        ; ������絎��憗��������������荀�������������������task���荀������������������鴻��
    ))
 
 (defclass child (host)
@@ -148,10 +148,10 @@
    (valid :accessor child-valid :type boolean :initform t)
                                         ; invalidated when received "leav"
    (diff-task-rslt :accessor child-diff-task-rslt :type fixnum :initform 0)
-                                        ; <taskを送った回数>-<rsltが返ってきた回数>
+                                        ; <task��������ｃ��������>-<rslt���菴���ｃ��������������>
    (work-size :accessor child-wsize :type fixnum :initform 0)
-                                        ; 仕事の大きさの目安．
-                                        ; taskがきたら/送ったら(- <ndiv>)に更新
+                                        ; 篁�篋����紊с�����������絎�鐚�
+                                        ; task������������/�����ｃ�����(- <ndiv>)�����贋��
    ;; (in-treq :accessor child-in-treq :type boolean :initform nil)
    ))
 
@@ -185,18 +185,18 @@
    (read-cmd-process :accessor ts-read-cmd-process :type (or null mp:process) :initform nil)
    (parent :accessor ts-parent :type parent)
    (children-port :accessor ts-chport :type fixnum :initform *children-port* :initarg :children-port)
-   (children-sock0 :accessor ts-chsock0 :type tsv-stream) ; 待ち受け
+   (children-sock0 :accessor ts-chsock0 :type tsv-stream) ; 緇���≦�����
    (children :accessor ts-children :type list :initform '())
    (eldest-child :accessor ts-eldest-child :type (or null child) :initform nil)
    (n-children :accessor ts-n-children :type fixnum :initform 0)
    (n-wait-children :accessor ts-n-wait-children :type fixnum :initform 0 :initarg :n-wait-children)
-                                        ; この数のchildが接続するまでメッセージ処理を行わない
+                                        ; ��������違��child����･膓���������障�с�＜����祉�若�後��������茵����������
    (child-next-id :accessor ts-child-next-id :type fixnum :initform 0)
    (socket-format :accessor ts-socket-format :type symbol :initform *socket-format* :initarg :socket-format)
-   (bcst-receipants :accessor ts-bcst-receipants :type list :initform ())
-					; (<bcak返信先> . <bcstをforwardしたhostのリスト>)のリスト
+   (bcst-recipients :accessor ts-bcst-recipients :type list :initform ())
+					; (<bcak菴�篆≦��> . <bcst���forward������host��������鴻��>)��������鴻��
    (exit-gate :accessor ts-exit-gate :initform (mp:make-gate nil))
-   (treq-any-list :accessor ts-talist :type list :initform '()) ;; treq-anyを出せていないリスト
+   (treq-any-list :accessor ts-talist :type list :initform '()) ;; treq-any�����冴�������������������鴻��
    (accept-connection-process :accessor ts-accept-connection-process
                               :type (or null mp:process) :initform nil)
    (retry :accessor ts-retry :type fixnum :initform *retry* :initarg :retry)
@@ -306,29 +306,29 @@
 (defmethod start-server ((sv tcell-server) (prnt parent))
   (unwind-protect
       (progn
-        ;; 親へ接続
+        ;; 荀���御･膓�
         ;; sv.parent = connect_to (prnt):
         (setf (ts-parent sv) (connect-to prnt (ts-socket-format sv)))
-        ;; 子からの待ち受けポートを開く
+        ;; 絖����������緇���≦����������若�����������
         (setf (ts-chsock0 sv)
           (socket:make-socket :connect :passive
                               :format (ts-socket-format sv)
                               :reuse-address *reuse-address*
                               :local-host (ts-hostname sv)
                               :local-port (ts-chport sv)))
-        ;; 最初の子が接続してくるのを待つ
+        ;; ���������絖�����･膓�������������������緇����
         (format *error-output* "~&Waiting for connection to ~A:~D...~%"
           (ts-hostname sv) (ts-chport sv))
         (wait-and-add-child sv)
-        ;; 子からの接続受け付け用プロセス起動
+        ;; 絖�����������･膓�������篁���������������祉�壕儀���
         (activate-accept-connection-process sv)
-        ;; 必要数の子が接続してくるのを待つ（n-wait-childrenオプション）
+        ;; 綽�荀���違��絖�����･膓�������������������緇���わ��n-wait-children��������激�с�鰹��
         (wait-children-connections sv)
-        ;; メッセージ処理用プロセス起動
+        ;; ��＜����祉�若�後����������������祉�壕儀���
         (activate-proc-cmd-process sv)
-        ;; 親の入力ストリームからの入力待ちプロセス起動
+        ;; 荀������ュ����鴻�������若�������������ュ��緇���＜�������祉�壕儀���
         (activate-read-cmd-process sv prnt)
-        ;; exitコマンドによってexit-gateがopenになるまでここで停止
+        ;; exit��潟����潟����������ｃ��exit-gate���open�����������障�с�������у��罩�
         (with1 gate (ts-exit-gate sv)
           (mp:process-wait "Wait for exit command" #'mp:gate-open-p gate))
         )
@@ -353,11 +353,11 @@
                   ,@(mapcar #'(lambda (host)
                                 (list (hostid host) (host-unreplied-treqs host)))
                             (cons (ts-parent sv) (ts-children sv))))
-                `(:bcst-receipants
+                `(:bcst-recipients
                   ,@(mapcar #'(lambda (rcp-entry)
                                 (cons (car rcp-entry)
                                       (mapcar #'hostid (cdr rcp-entry))))
-                            (ts-bcst-receipants sv)))
+                            (ts-bcst-recipients sv)))
                 )
           *error-output*)
   (terpri *error-output*)
@@ -380,24 +380,24 @@
     (mp:process-run-function "ACCEPT-CHILD-CONNECTION"
       #'(lambda () (loop (wait-and-add-child sv))))))
 
-;;; サーバのメッセージ処理プロセスを起動
+;;; ��泣�若�������＜����祉�若�後�������������祉�鴻��莎桁��
 (defgeneric activate-proc-cmd-process (sv))
 (defmethod activate-proc-cmd-process ((sv tcell-server))
   (setf (ts-proc-cmd-process sv)
     (mp:process-run-function "PROC-CMD"
       #'(lambda (msg-q &aux (msg-gate (sq-gate msg-q)))
           (loop
-            ;; 親または子からの入力待ち
+            ;; 荀���障�����絖������������ュ��緇����
             (mp:process-wait "Waiting for a message to Tascell server."
                              #'mp:gate-open-p msg-gate)
-            ;; メッセージ処理
+            ;; ��＜����祉�若�後�����
             (while (mp:gate-open-p msg-gate)
               (destructuring-bind (host . message) (delete-queue msg-q)
                 (proc-cmd sv host message))
               (retry-treq sv))))
       (ts-queue sv))))
 
-;;; サーバのメッセージ読み込みプロセス起動
+;;; ��泣�若�������＜����祉�若�梧����粋昭��帥�������祉�壕儀���
 (defgeneric activate-read-cmd-process (sv prnt))
 (defmethod activate-read-cmd-process ((sv tcell-server) (prnt parent))
   (setf (ts-read-cmd-process sv)
@@ -480,8 +480,8 @@
   (initialize-sender hst)
   hst)
 
-;; make-instance -> initialize-connection -> initialize-sender/receiverなので
-;; initialize-instanceでできない
+;; make-instance -> initialize-connection -> initialize-sender/receiver���������
+;; initialize-instance��с�с��������
 (defgeneric initialize-sender (hst))
 (defmethod initialize-sender ((hst host) &aux (sock (host-socket hst)))
   (setf (host-sender hst)
@@ -493,7 +493,7 @@
   (setf (host-receiver hst)
     (make-instance 'receiver
       :src sock :reader (make-receiver-reader hst)
-      :queue (ts-queue (host-server hst)))) ; readしたものは共有のバッファに入れる
+      :queue (ts-queue (host-server hst)))) ; read�����������������掩����������������＜����ャ�����
   hst)
 
 ;;;
@@ -532,7 +532,7 @@
          (make-array +max-line-length+
                      :element-type 'standard-char :fill-pointer +max-line-length+))
         (body-buffer (make-array +body-buffer-size+ :element-type '(unsigned-byte 8) :adjustable t))
-        (gate (mp:make-gate t)))        ; body-buffer の使用許可
+        (gate (mp:make-gate t)))        ; body-buffer ���篏睡��荐怨��
     (declare (ignorable body-buffer gate))
     #'(lambda (stream)
         #+allegro (setf (fill-pointer line-buffer) +max-line-length+)
@@ -573,8 +573,8 @@
           (values (cons hst msg) eof-p))
         )))
 
-;;; "task", "rslt", "bcst", "data" のbody部を読み込み，リストにして返す
-;;; バイナリ部分はbufferに書き込み，読み出すための関数を用意する
+;;; "task", "rslt", "bcst" ���body������茯���粋昭��随�������鴻�����������菴����
+;;; �����ゃ��������������buffer�����吾��莨若�随��茯���水�冴�������������∽�違��������������
 (defun read-body-into-buffer (stream buffer)
   (let ((ret '())
         (buf-used 0))
@@ -582,13 +582,13 @@
     (loop
       (let* ((pre (read-line stream t))
              (len (length pre)))
-        ;; 空行で終了
+        ;; 腥肴����х��篋�
         (when (= len 0) (return))
         (pushs pre #\Newline ret)
         ;; (tcell-server-dprint "~A~%" pre)
-        ;; #\(でおわっていたら次の行はbyte-header，次いでbyte-data
+        ;; #\(��с�������ｃ�����������罨＜��茵����byte-header鐚�罨＜�����byte-data
         (when (char= #\( (aref pre (- len 1)))
-          ;; ヘッダ: <whole-size> <elm-size> <endian(0|1)>
+          ;; ���������: <whole-size> <elm-size> <endian(0|1)>
           (let* ((byte-header (read-line stream t))
                  (whole-size (parse-integer byte-header :junk-allowed t)))
             (declare (fixnum whole-size))
@@ -609,24 +609,24 @@
                         (write-sequence buffer ostream :start start :end end))
                     ret))
             (tcell-server-dprint "#<byte-data size=~D>~%" whole-size)
-            ;; この後，terminator ")\n" がくるが，
-            ;; 次のiterationで，単に他の文字列データと同様に処理
+            ;; ������緇�鐚�terminator ")\n" ������������鐚�
+            ;; 罨＜��iteration��э��������篁�������絖���������若�帥�����罕����������
             ))))
     (nreverse ret)))
 
-;;; "task", "rslt", "bcst" "data" のbody部を読み込み，リストにして返す
+;;; "task", "rslt", "bcst" ���body������茯���粋昭��随�������鴻�����������菴����
 (defun read-body (stream)
   (let ((ret '()))
     (loop
       (let* ((pre (read-line stream t))
              (len (length pre)))
-        ;; 空行で終了
+        ;; 腥肴����х��篋�
         (when (= len 0) (return))
         (pushs pre #\Newline ret)
         ;; (tcell-server-dprint "~A~%" pre)
-        ;; #\(でおわっていたら次の行はbyte-header，次いでbyte-data
+        ;; #\(��с�������ｃ�����������罨＜��茵����byte-header鐚�罨＜�����byte-data
         (when (char= #\( (aref pre (- len 1)))
-          ;; ヘッダ: <whole-size> <elm-size> <endian(0|1)>
+          ;; ���������: <whole-size> <elm-size> <endian(0|1)>
           (let* ((byte-header (read-line stream t))
                  (whole-size (parse-integer byte-header :junk-allowed t)))
             (pushs byte-header #\Newline ret)
@@ -640,7 +640,7 @@
     (nreverse ret)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;; バッファ監視->送信
+;; �����������∞�ｈ��->���篆�
 (defgeneric monitor-and-send-queue (sq dest &optional writer))
 (defmethod monitor-and-send-queue ((sq shared-queue) dest
                                    &optional (writer #'write-string))
@@ -652,7 +652,7 @@
         (funcall writer (delete-queue sq) dest))
       (force-output dest))))
 
-;; 受信->バッファに追加
+;; ���篆�->�����������＜��菴遵��
 (defgeneric receive-and-add-to-queue (sq src &optional reader))
 (defmethod receive-and-add-to-queue ((sq shared-queue) src
                                      &optional (reader #'read-line))
@@ -662,16 +662,16 @@
       (when eof-p (return)))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; 要素へのaccessor
+;;; 荀�膣���吾��accessor
 
-;;; 子の追加・削除
+;;; 絖����菴遵����糸�����
 (defgeneric add-child (sv chld))
 (defmethod add-child ((sv tcell-server) (chld child))
-  ;; 子の情報の初期化．senderとreceiverの起動．
+  ;; 絖���������宴�����������鐚�sender���receiver���莎桁��鐚�
   (setf (child-id chld)	(ts-child-next-id sv))
   (initialize-sender chld)
   (initialize-receiver chld)
-  ;; server状態の更新
+  ;; server��倶�������贋��
   (incf (ts-child-next-id sv))
   (incf (ts-n-children sv))
   (push chld (ts-children sv))
@@ -695,14 +695,14 @@
 (defmethod invalidate-child ((chld child))
   (setf (child-valid chld) nil))
 
-;;; (= id n) の子へのアクセス
+;;; (= id n) ���絖���吾����≪����祉��
 (defgeneric nth-child (sv n))
 (defmethod nth-child ((sv tcell-server) n)
   (find n (ts-children sv)
         :key #'(lambda (chld) (child-id chld))
         :test #'=))
 
-;;; 一番仕事が残ってそうな子
+;;; 筝����篁�篋����罧���ｃ�����������絖�
 (defgeneric most-divisible-child (sv from))
 (defmethod most-divisible-child ((sv tcell-server) (from host))
   (with* (cur-time (get-internal-real-time)
@@ -717,7 +717,7 @@
       (dolist (c (ts-children sv))
         (print `((from ,(hostid from)) (c ,(hostid c)) (diff-task-rslt ,(child-diff-task-rslt c))
                                        ,(>= (- cur-time (host-none-time c)) limit)))))
-    ;; Strategy1: （送ったtaskの数-受け取ったrsltの数）>0 かつ 最後に送ったtaskのndivが最小
+    ;; Strategy1: 鐚������ｃ��task������-�����������ｃ��rslt�����逸��>0 ������ ���緇���������ｃ��task���ndiv������絨�
     #+comment
     (let ((max nil) (maxchld nil))
       (loop for chld in candidates
@@ -730,7 +730,7 @@
         (tcell-server-dprint "~&Most-divisible-child selected ~S: (child-diff-task-rslt ~D), (child-wsize ~D)~%"
                              (hostinfo maxchld) (child-diff-task-rslt maxchld) (child-wsize maxchld)))
       maxchld)
-    ;; Strategy2: （送ったtaskの数-受け取ったrsltの数）>0 のものからランダム
+    ;; Strategy2: 鐚������ｃ��task������-�����������ｃ��rslt�����逸��>0 ��������������������潟�����
     #-swopp10
     (if candidates (list-random-select candidates) nil)
     ;; Strategy3: SWoPP10 random
@@ -738,8 +738,8 @@
     (when candidates
       (if (not (typep (ts-parent sv) 'terminal-parent))
           (list-random-select candidates)
-        ;; 3/4の確率で子サーバ，1/4の確率で子サーバ以外のみから選択
-        ;; （child ID 0,1,2 が子サーバの場合）
+        ;; 3/4���腆榊����у����泣�若��鐚�1/4���腆榊����у����泣�若��篁ュ�������帥�������御��
+        ;; 鐚�child ID 0,1,2 ���絖���泣�若�������翫��鐚�
         (let ((cand (if (< 0.75 (random 1.0))
                         (remove-if-not #'(lambda (c) (<= 2 (child-id c)))
                                        candidates)
@@ -750,13 +750,13 @@
             (list-random-select candidates)))))
     ))
 
-;;; 子のwork-size を更新
+;;; 絖����work-size �����贋��
 (defgeneric renew-work-size (chld wsize))
 (defmethod renew-work-size ((chld child) wsize)
   (setf (child-wsize chld) wsize))
 
-;;; treq-any-list への要素追加
-;;; p-task-head は，"<treqのfromのid>" ":" "<treqのtask-head>" 
+;;; treq-any-list ��吾��荀�膣�菴遵��
+;;; p-task-head ���鐚�"<treq���from���id>" ":" "<treq���task-head>" 
 (defgeneric push-treq-any0 (sv tae))
 (defmethod push-treq-any0 ((sv tcell-server) (tae ta-entry))
   (push tae (ts-talist sv)))
@@ -766,19 +766,19 @@
 (defgeneric push-treq-any (sv from p-task-head))
 (defmethod push-treq-any ((sv tcell-server) (from host) (p-task-head string))
   (let ((entry (make-instance 'ta-entry :from from :head p-task-head)))
-    (if (or (eq from (ts-eldest-child sv)) ; eldest-childからのtreqは優先的に先頭
-            (null (ts-talist sv)))      ;  ; （retry時に先頭がだめだったら以降をあきら
-        (push-treq-any0 sv entry)       ;  ;   めるようにしているが，その時に親も試す
-      (push-treq-any1 sv entry))))      ;  ;   ようにするため）
+    (if (or (eq from (ts-eldest-child sv)) ; eldest-child���������treq���������������������
+            (null (ts-talist sv)))      ;  ; 鐚�retry��������������������������ｃ�����篁ラ��������������
+        (push-treq-any0 sv entry)       ;  ;   ������������������������������鐚�������������荀����荅����
+      (push-treq-any1 sv entry))))      ;  ;   ���������������������鐚�
 
-;;; treq-any-list のpop
+;;; treq-any-list ���pop
 (defgeneric pop-treq-any (sv))
 (defmethod pop-treq-any ((sv tcell-server))
   (aand (pop (ts-talist sv))
         (list (tae-from it) (tae-head it))))
 
 
-;;; treq-any-list から指定要素削除
+;;; treq-any-list ���������絎�荀�膣�������
 (defgeneric delete-treq-any (sv from p-task-head))
 (defmethod delete-treq-any ((sv tcell-server) (from host) (p-task-head string))
   (setf (ts-talist sv)
@@ -786,14 +786,14 @@
             (ts-talist sv)
             :test #'ta-entry-match)))
 
-;;; treq-any-list のmemberか
+;;; treq-any-list ���member���
 (defgeneric member-treq-any (sv from p-task-head))
 (defmethod member-treq-any ((sv tcell-server) (from host) (p-task-head string))
   (member (make-instance 'ta-entry :from from :head p-task-head)
           (ts-talist sv)
           :test #'ta-entry-match))
 
-;;; ta-entry の同一性
+;;; ta-entry ������筝����
 (defgeneric ta-entry-match (x y))
 (defmethod ta-entry-match ((x ta-entry) (y ta-entry))
   (and (eq (tae-from x) (tae-from y))
@@ -801,14 +801,14 @@
            (string= "*" (tae-head y))
            (string= (tae-head x) (tae-head y)))))
 
-;; ta-entry の情報
+;; ta-entry ���������
 (defgeneric ta-entry-info (tae))
 (defmethod ta-entry-info ((tae ta-entry))
   `((from ,(hostinfo (tae-from tae)))
     (head ,(tae-head tae))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; 相対アドレス文字列の操作
+;;; ��後�障�≪�������号��絖����������篏�
 (defgeneric hostid (host))
 (defmethod hostid ((chld child))
   (format nil "~D" (child-id chld)))
@@ -824,8 +824,8 @@
    (t
     (nth-child sv (parse-integer hostid)))))
 
-;;; アドレスの先頭を切り取って，残りと切り取った先頭アドレス
-;;; に相当するホストを返す
+;;; ��≪�������鴻����������������������ｃ��鐚�罧������������������ｃ����������≪��������
+;;; �����後�������������鴻�����菴����
 (defgeneric head-shift (sv head-string))
 (defmethod head-shift ((sv tcell-server) head-string)
   (let* ((sp-head (split-string-1 head-string #\:))
@@ -834,16 +834,16 @@
       (warn "Connection from/to ~S does not exist." (first sp-head)))
     (list host (second sp-head))))
 
-;;; アドレスhead-stringの先頭にhstのidを追加したものを返す
+;;; ��≪��������head-string������������hst���id���菴遵�����������������菴����
 (defgeneric head-push (hst head-string))
 (defmethod head-push ((hst host) head-string)
   (let ((sp-head (split-string-1 head-string #\:)))
-    (if (string= "f" (first sp-head))   ; forward => 追加せず，f以降のアドレスを返す
+    (if (string= "f" (first sp-head))   ; forward => 菴遵��������鐚�f篁ラ�������≪�������鴻��菴����
         (second sp-head)
       (string+ (hostid hst) ":" head-string))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; メッセージ送信
+;;; ��＜����祉�若�檎��篆�
 (defgeneric send (to obj))
 (defmethod send ((to host) obj)
   (add-queue obj (send-queue (host-sender to))))
@@ -888,7 +888,7 @@
     (tcell-server-dprint (get-gnuplot-error-bar task-head to "treq")))
   (incf (host-unreplied-treqs to)))
   
-;; treqへの応答として，task，またはexitを自動再送信（バッチ実行用）
+;; treq��吾��綽�膈����������鐚�task鐚���障�����exit���������������篆￥�����������絎�茵����鐚�
 (defmethod send-treq :after ((to terminal-parent) task-head treq-head)
   (awhen (parent-auto-treq-response-func to)
     (funcall it to task-head treq-head)
@@ -903,15 +903,6 @@
                  task-no #\Newline
                  task-body #\Newline)))
 
-;; Reply in place of an invalid child.
-(defmethod send-task :around ((to child) 
-                              wsize-str rslt-head task-head task-no task-body)
-  (declare (ignore wsize-str task-head task-no task-body))
-  (if (child-valid to)
-      (call-next-method)
-    (proc-cmd (host-server to) to
-              (list "abrt" rslt-head))))
-
 ;;; counting messages between clusters (for SACSIS11)
 #+SACSIS11
 (progn
@@ -940,27 +931,23 @@
   (when (eq :gnuplot *transfer-log-format*)
     (tcell-server-dprint (get-gnuplot-error-bar rslt-head to "task"))))
 
-(defgeneric send-rslt (to rslt-head rslt-body))
-(defmethod send-rslt (to rslt-head rslt-body)
-  (send to (list "rslt " rslt-head #\Newline rslt-body #\Newline)))
+(defgeneric send-rslt (to rslt-head rslt-rsn rslt-excp rslt-body))
+(defmethod send-rslt (to rslt-head rslt-rsn rslt-excp rslt-body)
+  (send to (list "rslt "
+		 rslt-head #\Space
+		 rslt-rsn  #\Space
+		 rslt-excp #\Space
+		 #\Newline rslt-body #\Newline)))
 
-;; Reply in place of an invalid child.
-#+PENDING ; rsltだけではrackの返信先がわからない
-(defmethod send-rslt :around (to rslt-head rslt-body)
-  (if (child-valid to)
-      (call-next-method)
-    (proc-cmd (host-server to) to
-              (list "rack")))) 
-
-(defmethod send-rslt :after ((to parent) rslt-head rslt-body)
-  (declare (ignore rslt-head rslt-body))
+(defmethod send-rslt :after ((to parent) rslt-head rslt-rsn rslt-excp rslt-body)
+  (declare (ignore rslt-head rslt-rsn rslt-excp rslt-body))
   (decf (parent-diff-task-rslt to)))
 
-(defmethod send-rslt :after ((to terminal-parent) rslt-head rslt-body)
-  (declare (ignore rslt-body))
+(defmethod send-rslt :after ((to terminal-parent) rslt-head rslt-rsn rslt-excp rslt-body)
+  (declare (ignore rslt-rsn rslt-excp rslt-body))
   ;; log
   (tcell-server-dprint "~&# (~D) rslt sent to terminal parent." (get-internal-real-time))
-  ;; rack，task，exit自動送信の設定（task再送信は性能評価用）
+  ;; rack鐚�task鐚�exit���������篆＜��荐�絎�鐚�task������篆＜����ц�処��箴∞��鐚�
   (when (parent-auto-rack to)
     (let ((end-time (get-internal-real-time)))
       (aif (find rslt-head (parent-task-home to) :test #'string=
@@ -971,7 +958,7 @@
                  (rack-to (task-home-rack-to it))
                  (rack-task-head (task-home-rack-task-head it))
                  (start-time (task-home-start-time it)))
-            ;; rack返信
+            ;; rack菴�篆�
             (format *error-output*
                 "~&Time: ~S~%~
                 Auto-send \"rack ~A\" to ~S~%"
@@ -979,12 +966,12 @@
                  internal-time-units-per-second 1.0)
               rack-task-head (hostinfo rack-to))
             (send-rack rack-to rack-task-head)
-            ;; n-resendチェック→task自動再送信関数をセット
-            ;; rslt-no（rslt-headの最後の数字）が送った回数のカウントの役割
+            ;; n-resend�����с��������task������������篆♂�∽�違����祉�����
+            ;; rslt-no鐚�rslt-head������緇������医��鐚���������ｃ�������違����������潟�����綵劫��
             (if (< rslt-no (parent-auto-resend-task to))
                 (let ((new-rslt-head (format nil "~D" (1+ rslt-no))))
                   (setf (caddr cmd) new-rslt-head)
-                  ;; treqがきたら自動的にtaskを再送信するように関数をセット
+                  ;; treq������������������������task���������篆＜����������������∽�違����祉�����
                   (setf (parent-auto-treq-response-func to)
                     #'(lambda (&rest args)
                         (declare (ignore args))
@@ -993,13 +980,13 @@
                         (format *error-output* "~&auto-resend-task~%")
                         (setf (task-home-start-time it) (get-internal-real-time))
                         (incf (parent-diff-task-rslt to))
-                        (send-task rack-to ; rackの送り先と同じでよいことを仮定
+                        (send-task rack-to ; rack�����������������������с��������������篁�絎�
                                    (second cmd) (head-push to new-rslt-head)
                                    rack-task-head (fifth cmd) (nthcdr 5 cmd)))))
               (progn
-                ;; task-homeのエントリ削除
+                ;; task-home��������潟�����������
                 (delete it (parent-task-home to) :count 1)
-                ;; exitを自動送信するように関数をセット
+                ;; exit������������篆＜����������������∽�違����祉�����
                 (when (parent-auto-exit to)
                   (setf (parent-auto-treq-response-func to)
                     #'(lambda (&rest args)
@@ -1025,33 +1012,10 @@
 (defmethod send-bcak (to bcak-head)
   (send to (list "bcak " bcak-head #\Newline)))
 
-(defgeneric send-dreq (to data-head dreq-head range))
-(defmethod send-dreq (to data-head dreq-head range)
-  (send to (list "dreq " data-head #\Space dreq-head #\Space range #\Newline)))
-
-(defgeneric send-data (to data-head range data-body))
-(defmethod send-data (to data-head range data-body)
-  (send to (list "data " data-head #\Space range #\Newline data-body #\Newline)))
-
 (defgeneric send-leav (to))
 (defmethod send-leav (to)
   (send to (list "leav " #\Newline)))
 
-(defgeneric send-lack (to lack-head))
-(defmethod send-lack (to lack-head)
-  (send to (list "lack " lack-head #\Newline)))
-(defmethod send-lack :around ((to child) lack-head)
-  (declare (ignore lack-head))
-  (if (child-valid to)
-      (progn
-        (call-next-method)
-        (invalidate-child to))))
-
-
-(defgeneric send-abrt (to rslt-head))
-(defmethod send-abrt (to rslt-head)
-  (send to (list "abrt " rslt-head #\Newline)))
-
 (defgeneric send-cncl (to task-head cncl-head))
 (defmethod send-cncl (to task-head cncl-head)
   (send to (list "cncl " task-head #\Space cncl-head #\Newline)))
@@ -1080,11 +1044,7 @@
     ("rack" (proc-rack sv from cmd))
     ("bcst" (proc-bcst sv from cmd))
     ("bcak" (proc-bcak sv from cmd))
-    ("dreq" (proc-dreq sv from cmd))
-    ("data" (proc-data sv from cmd))
     ("leav" (proc-leav sv from cmd))
-    ("lack" (proc-lack sv from cmd))
-    ("abrt" (proc-abrt sv from cmd))
     ("cncl" (proc-cncl sv from cmd))
     ("log"  (proc-log sv from cmd))
     ("stat" (proc-stat sv from cmd))
@@ -1096,8 +1056,8 @@
 ;;; treq
 (defgeneric proc-treq (sv from cmd))
 (defmethod proc-treq ((sv tcell-server) (from host) cmd)
-  (let ((p-task-head (head-push from (second cmd))) ; タスク要求者
-        (treq-head (third cmd)))        ; 要求先
+  (let ((p-task-head (head-push from (second cmd))) ; ��帥�鴻��荀�羆����
+        (treq-head (third cmd)))        ; 荀�羆����
     (unless
         (if (string= "any" treq-head)
             (try-send-treq-any sv from p-task-head)
@@ -1106,22 +1066,22 @@
             (if *transfer-treq-always-if-notany*
                 (send-treq hst0 p-task-head s-treq-head)
               (try-send-treq sv hst0 p-task-head s-treq-head))))
-      ;; treqを送れなかった場合
+      ;; treq�����������������ｃ����翫��
       (refuse-treq sv from p-task-head))))
 
 (defgeneric try-send-treq-any (sv from p-task-head))
 (defmethod try-send-treq-any ((sv tcell-server) (from host) p-task-head)
   (or
-   ;; 時々優先して親にも聞きにいく（terminal-parentを除く）
+   ;; ������������������荀����������������������鐚�terminal-parent�����ゃ��鐚�
    (and (not (typep (ts-parent sv) 'terminal-parent))
         (not (eq (ts-parent sv) from))
-        #-swopp10 (= 0 (random (ts-n-children sv))) ; 親子平等
-        #+swopp10 (< 0.75 (random 1.0))             ; 3/4の確率
+        #-swopp10 (= 0 (random (ts-n-children sv))) ; 荀�絖�綛括��
+        #+swopp10 (< 0.75 (random 1.0))             ; 3/4���腆榊��
         (try-send-treq sv (ts-parent sv) p-task-head "any"))
-   ;; 子供に聞きにいく
+   ;; 絖�箴�������������������
    (awhen (most-divisible-child sv from)
      (try-send-treq sv it p-task-head "any"))
-   ;; 自分のところに仕事がなければ，eldestな子が代表して親に聞きにいく
+   ;; ���������������������篁�篋���������������逸��eldest���絖����篁ｈ；������荀�������������������
    (and (eq (ts-eldest-child sv) from)
         (try-send-treq sv (ts-parent sv)
                        p-task-head "any"))))
@@ -1131,8 +1091,8 @@
   (send-treq to p-task-head s-treq-head)
   t)
 
-;; terminal-parentについては，
-;; もらった仕事を消化している，かつ，一度に1つまでしかtreqしない
+;; terminal-parent�����ゃ��������鐚�
+;; ��������ｃ��篁�篋����羔����������������鐚������わ��筝�綺����1��ゃ�障�с�����treq���������
 (defmethod try-send-treq :around ((sv tcell-server) (to terminal-parent) p-task-head s-treq-head)
   (declare (ignore p-task-head s-treq-head))
   ;; (print `((host-unreplied-treqs to) ,(host-unreplied-treqs to)))
@@ -1141,7 +1101,7 @@
       (call-next-method)
     nil))
 
-;; childについては，渡したtaskと返ってきたrsltが同数ならtreqしない
+;; child�����ゃ��������鐚�羝＜�����task���菴���ｃ��������rslt��������違�����treq���������
 (defmethod try-send-treq :around ((sv tcell-server) (to child) p-task-head s-treq-head)
   (declare (ignore p-task-head s-treq-head))
   (if (> (child-diff-task-rslt to) 0)
@@ -1154,10 +1114,10 @@
       (send-none from (second (head-shift sv p-task-head)))
     (push-treq-any sv from p-task-head)))
 
-;; treq-any-listにある要素を tryしなおす
+;; treq-any-list���������荀�膣���� try������������
 (defgeneric retry-treq (sv))
 (defmethod retry-treq ((sv tcell-server))
-  #+obsoleted ; 最初のentryが失敗したからといって他のentryも失敗するとは限らない
+  #+obsoleted ; ���������entry���紊掩����������������������ｃ��篁����entry���紊掩��������������������������
   (loop
       for n-sent upfrom 0
       do (aif (pop-treq-any sv)
@@ -1181,10 +1141,10 @@
 (defgeneric proc-task (sv from cmd))
 (defmethod proc-task ((sv tcell-server) (from host) cmd)
   (destructuring-bind (to s-task-head)
-      (head-shift sv (fourth cmd))      ; タスク送信先
-    (let ((wsize-str (second cmd))      ; 仕事の大きさ
-          (p-rslt-head (head-push from (third cmd))) ; 結果返信先
-          (task-no (fifth cmd))         ; タスク番号 （fib, lu, ...）
+      (head-shift sv (fourth cmd))      ; ��帥�鴻�����篆≦��
+    (let ((wsize-str (second cmd))      ; 篁�篋����紊с�����
+          (p-rslt-head (head-push from (third cmd))) ; 腟����菴�篆≦��
+          (task-no (fifth cmd))         ; ��帥�鴻�������� 鐚�fib, lu, ...鐚�
           (task-body (nthcdr 5 cmd)))
       (send-task to wsize-str p-rslt-head s-task-head task-no
                  task-body)
@@ -1216,16 +1176,16 @@
   (incf (parent-diff-task-rslt from))
   )
 
-;; rack自動送信のために受け取ったtaskを覚えておく
+;; rack���������篆＜����������������������ｃ��task���荀�������������
 (defmethod proc-task :after ((sv tcell-server) (from terminal-parent) cmd)
   (when (parent-auto-rack from)
     (destructuring-bind (to s-task-head)
         (head-shift sv (fourth cmd))
       (let ((th-entry (make-task-home
                        :task-cmd cmd
-                       :rack-to   to    ; rack送信先
-                       :rack-task-head s-task-head ; rackのtask-head
-                       :start-time 0))) ; 開始時刻（あとで）
+                       :rack-to   to    ; rack���篆≦��
+                       :rack-task-head s-task-head ; rack���task-head
+                       :start-time 0))) ; ���紮������誌����������э��
         (push th-entry (parent-task-home from))
         (setf (task-home-start-time th-entry) (get-internal-real-time))))))
 
@@ -1233,7 +1193,7 @@
 (defgeneric proc-none (sv from cmd))
 (defmethod proc-none ((sv tcell-server) (from host) cmd)
   (destructuring-bind (to s-task-head)
-      (head-shift sv (second cmd))      ; none送信先
+      (head-shift sv (second cmd))      ; none���篆≦��
     (send-none to s-task-head)))
 
 (defmethod proc-none :before ((sv tcell-server) (from host) cmd)
@@ -1245,7 +1205,7 @@
 
 
 (defmethod proc-none :after ((sv tcell-server) (from host) cmd)
-  ;; noneを受け取った時刻を記憶
+  ;; none��������������ｃ�������祉��荐����
   (declare (ignorable sv cmd))
   (setf (host-none-time from) (get-internal-real-time)))
 
@@ -1253,9 +1213,11 @@
 (defgeneric proc-rslt (sv from cmd))
 (defmethod proc-rslt ((sv tcell-server) (from host) cmd)
   (destructuring-bind (to s-rslt-head)
-      (head-shift sv (second cmd))      ; rslt送信先
-    (let ((rslt-body (cddr cmd)))
-      (send-rslt to s-rslt-head rslt-body))))
+      (head-shift sv (second cmd))      ; rslt���篆≦��
+    (let ((rslt-rsn (third cmd))
+	  (rslt-excp (fourth cmd))
+	  (rslt-body (cddddr cmd)))
+      (send-rslt to s-rslt-head rslt-rsn rslt-excp rslt-body))))
 
 (defmethod proc-rslt :before ((sv tcell-server) (from child) cmd)
   (declare (ignore cmd))
@@ -1266,30 +1228,30 @@
 (defgeneric proc-rack (sv from cmd))
 (defmethod proc-rack ((sv tcell-server) (from host) cmd)
   (destructuring-bind (to s-task-head)
-      (head-shift sv (second cmd))      ; rack送信先
+      (head-shift sv (second cmd))      ; rack���篆≦��
     (send-rack to s-task-head)))
 
 ;; bcst
 (defgeneric proc-bcst (sv from cmd))
 (defmethod proc-bcst ((sv tcell-server) (from host) cmd)
-  (let ((p-bcak-head (head-push from (second cmd))) ; bcak返信先
-	(task-no (third cmd))		; タスク番号 （btsk_a, btsk_b, ...)
-	(bcst-body (nthcdr 3 cmd)))	; data部
+  (let ((p-bcak-head (head-push from (second cmd))) ; bcak菴�篆≦��
+	(task-no (third cmd))		; ��帥�鴻�������� 鐚�btsk_a, btsk_b, ...)
+	(bcst-body (nthcdr 3 cmd)))	; data���
     (let ((recipients ()))
-      ;; bcstの送り元とterminal-parent以外にforwardする
+      ;; bcst���������������terminal-parent篁ュ�����forward������
       (dolist (to (cons (ts-parent sv) (ts-children sv)))
 	(unless (or (eq from to)
 		    (typep to 'terminal-parent))
 	  (send-bcst to p-bcak-head task-no bcst-body)
 	  (push to recipients)))
-      ;; (<bcak返信先> . <forward先のリスト>)を記憶する
-      (when (member p-bcak-head (ts-bcst-receipants sv)
+      ;; (<bcak菴�篆≦��> . <forward�����������鴻��>)���荐���吟�����
+      (when (member p-bcak-head (ts-bcst-recipients sv)
 		    :key #'car :test #'string=)
 	(warn "Server received the same broadcast twice: ~S"
 	      p-bcak-head))
       (if recipients
-          (push (cons p-bcak-head recipients) (ts-bcst-receipants sv))
-        ;; broadcast先がいなければ即座にbcakを返す
+          (push (cons p-bcak-head recipients) (ts-bcst-recipients sv))
+        ;; broadcast��������������������医�喝婚���bcak���菴����
         (send-bcak from (second cmd)))
       )))
 
@@ -1297,96 +1259,59 @@
 (defgeneric proc-bcak (sv from cmd))
 (defmethod proc-bcak ((sv tcell-server) (from host) cmd)
   (let ((bcak-head (second cmd)))
-    (destructuring-bind (to s-bcak-head) ; bcak送信先
+    (destructuring-bind (to s-bcak-head) ; bcak���篆≦��
 	(head-shift sv bcak-head)
-      (let ((receipants-entry		
-	     (car (member bcak-head (ts-bcst-receipants sv)
+      (let ((recipients-entry		
+	     (car (member bcak-head (ts-bcst-recipients sv)
 			  :key #'car :test #'string=))))
-	(if (null receipants-entry)	; bcak-headからのbcstがあったかチェック
+	(if (null recipients-entry)	; bcak-head���������bcst��������ｃ����������с�����
 	    (warn "No bcst from ~S is remenbered." bcak-head)
-	  (if (not (member from (cdr receipants-entry) :test #'eq))
-					; fromがbcak待ちリストにあるかチェック
+	  (if (not (member from (cdr recipients-entry) :test #'eq))
+					; from���bcak緇���＜����鴻�������������������с�����
 	      (warn "No bcst from ~S to ~S is remembered."
 		    bcak-head (hostinfo from))
 	    (progn
-	      ;; bcak待ちからfromを削除
-	      (rplacd receipants-entry
-		      (delete from (cdr receipants-entry) :test #'eq))
-	      ;; 待ちリストが空になっていたらbcakを返す
-	      (when (null (cdr receipants-entry))
+	      ;; bcak緇���＜�����from���������
+	      (rplacd recipients-entry
+		      (delete from (cdr recipients-entry) :test #'eq))
+	      ;; 緇���＜����鴻�����腥冴�������ｃ�����������bcak���菴����
+	      (when (null (cdr recipients-entry))
 		(send-bcak to s-bcak-head)
-                (setf (ts-bcst-receipants sv)
-                  (delete receipants-entry (ts-bcst-receipants sv) :test #'eq)))
+                (setf (ts-bcst-recipients sv)
+                  (delete recipients-entry (ts-bcst-recipients sv) :test #'eq)))
 	      )))))))
 
-;;; dreq
-(defgeneric proc-dreq (sv from cmd))
-(defmethod proc-dreq ((sv tcell-server) (from host) cmd)
-  (let ((p-data-head (head-push from (second cmd))) ; データ要求者
-        (range (fourth cmd)))           ; データ要求範囲
-    (destructuring-bind (hst0 s-dreq-head) ; データ要求先
-        (head-shift sv (third cmd))
-      (send-dreq hst0 p-data-head s-dreq-head range))))
-
-;;; data
-(defgeneric proc-data (sv from cmd))
-(defmethod proc-data ((sv tcell-server) (from host) cmd)
-  (destructuring-bind (to s-data-head)  ; data送信先
-      (head-shift sv (second cmd))
-    (let ((range (third cmd))           ; データ要求範囲
-          (data-body (cdddr cmd)))      ; データ本体
-      (send-data to s-data-head range data-body))))
-
 ;;; leav: the computation node want to drop out
-;; 子から->lackを返す（invalidateはsend-lackにて）
-;; 親から->無視
+;; 絖�������->invalidate
+;; 荀�������->��∴��
 (defgeneric proc-leav (sv from cmd))
 (defmethod proc-leav ((sv tcell-server) (from child) cmd)
   (declare (ignore cmd))
-  (send-lack from "0")                  ; "0" is a dummy argument
+  (invalidate-child from)
   )
 
 (defmethod proc-leav ((sv tcell-server) (from parent) cmd)
   (declare (ignore cmd))
   (warn "Leav message from parent is unexpected."))
 
-;;; lack: tell that the computation node is marked as invalidated
-;; 子から->無視．親から->転送
-(defgeneric proc-lack (sv from cmd))
-(defmethod proc-lack ((sv tcell-server) (from child) cmd)
-  (declare (ignore cmd))
-  (warn "Lack message from child is unexpected."))
-(defmethod proc-lack ((sv tcell-server) (from parent) cmd)
-  (destructuring-bind (to s-lack-head)
-      (head-shift sv (second cmd))      ; lack送信先
-    (send-lack to s-lack-head)))
-
-;;; abrt: tell that the result to the task is no longer returned.
-;; The message is just forwarded.
-(defgeneric proc-abrt (sv from cmd))
-(defmethod proc-abrt ((sv tcell-server) (from host) cmd)
-  (destructuring-bind (to s-rslt-head)
-      (head-shift sv (second cmd))      ; abrt送信先
-    (send-abrt to s-rslt-head)))
-
-;;; cncl: tell that the result to the task is no longer accepted.
+;;; cncl: set a cancellation flag to the recipient task
 ;; The message is just forwarded.
 (defgeneric proc-cncl (sv from cmd))
 (defmethod proc-cncl ((sv tcell-server) (from host) cmd)
-  (let ((p-task-head (head-push from (second cmd))) ; 親タスクID
-        (cncl-head (third cmd)))        ; キャンセルするタスクのID
+  (let ((p-task-head (head-push from (second cmd))) ; 荀���帥�鴻��ID
+        (cncl-head (third cmd)))        ; �����ｃ�潟�祉����������帥�鴻�����ID
     (destructuring-bind (hst0 s-cncl-head)
         (head-shift sv cncl-head)
       (send-cncl hst0 p-task-head s-cncl-head))))
 
 ;; 
 
-;;; stat: サーバ／ワーカの状態を出力
+;;; stat: ��泣�若��鐚������若�������倶�������阪��
 (defgeneric proc-stat (sv from cmd))
 (defmethod proc-stat ((sv tcell-server) (from host) cmd)
   (if (cdr cmd)
       (cond
-       ;; anyを与えた場合は自分の状態を表示後，全ての子供にstat anyを転送
+       ;; any���筝���������翫����������������倶�����茵�腓阪��鐚����������絖�箴����stat any���荵∫��
        ((string= "any" (second cmd))
         (mp:process-run-function "Send Status Any"
           #'(lambda ()
@@ -1395,23 +1320,23 @@
                 (format *error-output* "~&Host: ~A~%" (hostid chld))
                 (send-stat chld "any")
                 (sleep 0.3)))))
-       ;; アドレスを与えた場合はそこにstatコマンドを転送
+       ;; ��≪�������鴻��筝���������翫��������������stat��潟����潟�����荵∫��
        (t
         (destructuring-bind (to s-task-head)
-            (head-shift sv (second cmd)) ; stat送信先
+            (head-shift sv (second cmd)) ; stat���篆≦��
           (send-stat to s-task-head))))
-    ;; 無引数の場合はサーバの状態を表示
+    ;; ��≦����違����翫�������泣�若�������倶�����茵�腓�
     (print-server-status sv)))
 
-;;; verb: ワーカのverbose-levelを変更
-;;; "verb <送信先>:<level>" で．
+;;; verb: �����若�����verbose-level���紊����
+;;; "verb <���篆≦��>:<level>" ��э��
 (defgeneric proc-verb (sv from cmd))
 (defmethod proc-verb ((sv tcell-server) (from host) cmd)
   (destructuring-bind (to s-task-head)
-      (head-shift sv (second cmd))      ; verb送信先
+      (head-shift sv (second cmd))      ; verb���篆≦��
     (send-verb to s-task-head)))
 
-;;; log: サーバのverbose-levelを設定
+;;; log: ��泣�若�����verbose-level���荐�絎�
 (defgeneric proc-log (sv from cmd))
 (defmethod proc-log ((sv tcell-server) (from host) cmd)
   (loop
@@ -1421,7 +1346,7 @@
       do (funcall setter mode))
   (show-log-mode))
 
-;;; exit: サーバを終了
+;;; exit: ��泣�若�����腟�篋�
 (defgeneric proc-exit (sv from cmd))
 (defmethod proc-exit ((sv tcell-server) (from host) cmd)
   (declare (ignore cmd))
@@ -1452,9 +1377,9 @@
                               (terminal-parent t)
                               (auto-rack t) ; for terminal parent
                               (auto-initial-task nil)
-                                        ; 最初に自動的に送信するtask
-                                        ; "<task-no> <param1> <param2> ..." の文字列で指定
-                                        ; （param間の改行や最後の改行および空行不要）
+                                        ; ������������������������篆＜�����task
+                                        ; "<task-no> <param1> <param2> ..." ������絖������ф��絎�
+                                        ; 鐚�param��������壕��������緇������壕����������括�肴��筝�荀�鐚�
                               (auto-resend-task 0) ; for terminal-parent
                               (auto-exit nil) ; for terminal parent
                               (parent-host *parent-host*)
@@ -1476,7 +1401,7 @@
                  (make-instance 'parent :server sv
                                 :host parent-host
                                 :port parent-port))))
-    ;; auto-initial-task のセット
+    ;; auto-initial-task �����祉�����
     (when (and terminal-parent auto-initial-task)
       (when (stringp auto-initial-task)
         (setq auto-initial-task (split-string auto-initial-task)))
@@ -1506,5 +1431,5 @@
                 (sleep 0.3))
               ))
         sv))
-    ;; サーバ起動
+    ;; ��泣�若��莎桁��
     (start-server sv prnt)))
diff --git a/src/sample/tcell/sock.c b/src/sample/tcell/sock.c
index b9c280ee..782db52f 100644
--- a/src/sample/tcell/sock.c
+++ b/src/sample/tcell/sock.c
@@ -34,12 +34,52 @@ SUCH DAMAGE.
 #include <netinet/in.h>
 #include <arpa/inet.h>
 #include <netdb.h>
+#ifdef USEMPI
+#include <mpi.h>
+#endif
 
 #include "sock.h"
 
+/* #define DEBUG */
+
 #define SEND_MAX 65536
 #define RECV_MAX 1024
+#define DATA_TYPE MPI_CHAR
+#define DATA_TAG  0
+
+static char *mpirecv_buf = NULL;
+static int mpirecv_buf_size = 0;
+static int mpirecv_buf_len = 0;
+static int mpirecv_buf_start = 0;
+int *mpisend_buf_len;           /* ptr to length of the current buffer */
+static int *mpisend_buf_size;   /* ptr to capacity of the current buffer */
+
+struct send_block
+{
+    char *buf; // 鐃緒申鐃�M鐃緒申鐃緒申f鐃�[鐃�^
+    int len;   // buf鐃宿�鐃緒申鐃緒申��鐃緒申鐃�f鐃�[鐃�^鐃縮����鐃緒申
+    int size;  // buf鐃宿�m鐃循�鐃緒申��緒申q鐃�[鐃�v鐃�T鐃�C鐃�Y
+    int rank;  // 鐃緒申鐃�M鐃緒申rank
+};
 
+__thread struct send_block *sq = NULL;
+__thread int RANK = 0;
+__thread int GID = 0;
+static pthread_mutex_t send_lock;
+
+struct recv_block
+{
+    char *buf; // 鐃緒申鐃�M鐃緒申鐃緒申f鐃�[鐃�^
+    int len;   // buf鐃宿�鐃緒申鐃緒申��鐃緒申鐃�f鐃�[鐃�^鐃縮����鐃緒申
+    int size;  // buf鐃宿�m鐃循�鐃緒申��緒申q鐃�[鐃�v鐃�T鐃�C鐃�Y
+    struct recv_block *next;
+};
+// recieve queue
+static struct recv_block *recv_queue_head = NULL;
+static struct recv_block *recv_queue_tail = NULL;
+static struct recv_block *recv_queue_temp = NULL;
+static pthread_mutex_t recv_lock = PTHREAD_MUTEX_INITIALIZER;
+pthread_cond_t recv_cond;
 /* SunOS does not support vasprintf() */
 #ifdef NO_VASPRINTF
 #define VSNPRINTF_LEN 1000
@@ -50,8 +90,6 @@ SUCH DAMAGE.
 char *receive_buf = 0;
 char *receive_buf_p = 0;
 
-/* #define DEBUG */
-
 #ifdef DEBUG
 int dbg_printf (char *fmt_string, ...)
 {
@@ -96,31 +134,65 @@ int dbg_printf (char *fmt_string, ...)
 
 #endif
 
+// Set the rank and gid for MPI.
+void set_rank_and_gid (int rank, int gid)
+{
+    RANK = rank;
+    GID = gid;
+}
+
+// Prepare for adding a message to the send queue.
+void send_block_start (void)
+{
+    sq = (struct send_block*)malloc(sizeof(struct send_block));
+    sq->buf = malloc(sizeof(char)*32768);
+    sq->len = 0;
+    sq->size = 32768;
+}
+
+// Finish adding the message to the send queue.
+void send_block_end(int dest)
+{
+    MPI_Send(sq->buf, sq->len, MPI_CHAR, dest, 0, MPI_COMM_WORLD);
+    free(sq->buf);
+    free(sq);
+}
+
+// Append contents in buf whose length is len to *mpisend_buf
+int
+append_to_mpisend_buf(const void *buf, int len)
+{
+    int ns = len + sq->len;
+    if (ns > sq->size)
+    {
+        sq->buf = realloc(sq->buf, ns+1);
+        if (sq->buf == NULL)
+        {
+            fprintf(stderr, "Error: Not enough memory.\n");
+            exit(1);
+        }
+        sq->size = ns+1;
+    }
+    memcpy(sq->buf+sq->len, buf, len);
+    sq->len = ns;
+}
+
 /* send */
 int send_char (char ch, int socket)
 {
-    if (socket<0)
-        return putc (ch, stdout);
-    else
-        {
 #ifdef DEBUG
-            dbg_printf ("send_char: '%s' (%d)", (char[]){ch,0}, ch);
+  dbg_printf ("send_char: '%s' (%d)", (char[]){ch,0}, ch);
 #endif
-        return send (socket, &ch, 1, 0);
-        }
+  append_to_mpisend_buf ((char[]){ch,0}, 1);
 }
 
 int send_string (char *str, int socket)
 {
-    if (socket<0)
-        return fputs (str, stdout);
-    else
-        {
 #ifdef DEBUG
-            dbg_printf ("send_string: %s", str);
-#endif
-            return send (socket, str, strlen(str), 0);
-        }
+  dbg_printf ("send_string: %s", str);
+#endif           // MPI
+  append_to_mpisend_buf (str, strlen(str));
+  return 0;
 }
 int send_fmt_string (int socket, char *fmt_string, ...)
 {
@@ -133,14 +205,14 @@ int send_fmt_string (int socket, char *fmt_string, ...)
     int len;
     int ret;
 
-    if (socket<0)
+    if (socket == 0) // stdout
         {
             va_start (args, fmt_string);
             len = vprintf (fmt_string, args);
             va_end (args);
             return len;
         }
-    else
+    else             // MPI or TCP/IP
         {
             va_start (args, fmt_string);
 #ifdef NO_VASPRINTF
@@ -153,7 +225,13 @@ int send_fmt_string (int socket, char *fmt_string, ...)
 #ifndef NO_VASPRINTF
             if (str == NULL) { perror ("allocation"); exit (1); }
 #endif
-            ret = send (socket, str, len, 0);
+	    if (socket<0) { // MPI
+	      append_to_mpisend_buf (str, len);
+	      ret = 0;
+	    }
+	    else {          // TCP/IP
+	      ret = send (socket, str, len, 0);
+	    }
 #ifdef DEBUG
             dbg_printf ("send_fmt_string: %s", str);
 #endif
@@ -167,39 +245,50 @@ int send_fmt_string (int socket, char *fmt_string, ...)
 int send_binary (void *src, unsigned long elm_size, unsigned long n_elm,
                  int socket)
 {
-    if (socket<0)
-        {
-            return fwrite (src, elm_size, n_elm, stdout);
-        }
-    else
+  MPI_Send(src, n_elm*elm_size, MPI_BYTE, RANK, GID, MPI_COMM_WORLD);
+  return 0;
+}
+
+/* Print contents of *mpisend_buf to stderr */
+void show_mpisend_buf (int socket) {
+  if (socket < 0) { // MPI
+    sq->buf[sq->len-1] = 0;
+    fprintf (stderr, "%s\n", sq->buf);
+  }
+  /* do nothing unless MPI mode */
+}
+
+/* receive */
+/* Get contents of the length len from mpirecv_buf */
+static ssize_t
+get_from_mpirecv_buf (void *buf, int len)
+{
+    int rest = len;
+    int cpylen;
+
+    for (;;)
+    {
+        cpylen = (mpirecv_buf_len < rest) ? mpirecv_buf_len : rest;
+        if (cpylen > 0)
         {
-            unsigned long rest=elm_size*n_elm;
-            unsigned long ret;
-            while (rest>0) {
-                ret = send (socket, src,
-                            (rest>SEND_MAX)?SEND_MAX:rest,
-                            0);
-                if (ret<0)
-                    { perror ("send_binary"); exit (1); }
-                rest -= ret;
-                src += ret;
-#ifdef DEBUG
-                dbg_printf ("send_binary: %ld bytes", ret);
-#endif
-            }
-            return n_elm;
+            memcpy(buf, mpirecv_buf + mpirecv_buf_start, cpylen);
+            buf += cpylen;
+            mpirecv_buf_start += cpylen;
+            mpirecv_buf_len -= cpylen;
+            rest -= cpylen;
         }
+        if (rest == 0) return len;
+    }
 }
 
-/* receive */
 /* Invoke recv() repeatedly to read len characters */
-ssize_t recv2 (int s, void *buf, size_t len, int flags)
+ssize_t recv2 (int socket, void *buf, size_t len, int flags)
 {
     size_t rest=len;
     ssize_t ret;
     while (rest>0)
         {
-            ret = recv (s, buf, (rest>RECV_MAX) ? RECV_MAX : rest, flags);
+            ret = recv (socket, buf, (rest>RECV_MAX) ? RECV_MAX : rest, flags);
             if (ret<0)
                 { perror ("recv2"); exit(1); }
             buf += ret;
@@ -210,30 +299,27 @@ ssize_t recv2 (int s, void *buf, size_t len, int flags)
 
 int receive_char (int socket)
 {
-    char buf;
-    int ret;
-
-    if (receive_buf) {
-      if ( *receive_buf_p )
-        return ( *(receive_buf_p++) );
-      else {
-        /* Finished reading receive_buf */
-        receive_buf = 0;
-      }
-    } 
-    if (socket<0)
-        {
-            return fgetc (stdin);
-        }
-    else
-        {
-            ret=recv2 (socket, &buf, 1, 0);
+  char buf;
+  int ret;
+   
+  if (socket<0)       // MPI
+    {
+      get_from_mpirecv_buf (&buf, sizeof(char));
+      return buf;
+    }
+  else if (socket==0) // stdin
+    {
+      return fgetc (stdin);
+    }
+  else                // TCP/IP
+    {
+      ret=recv2 (socket, &buf, 1, 0);
 #ifdef DEBUG
-            dbg_printf ("receive_char: '%s' (%d)", (char[]){buf,0}, buf);
+      dbg_printf ("receive_char: '%s' (%d)", (char[]){buf,0}, buf);
 #endif
-            if (ret <= 0) return EOF;
-            else return buf;
-        }
+      if (ret <= 0) return EOF;
+      else return buf;
+    }
 }
 
 char* receive_line (char *buf, int maxlen, int socket)
@@ -242,76 +328,79 @@ char* receive_line (char *buf, int maxlen, int socket)
     int ret;
     int i;
 
-    if (receive_buf) {
-      if ( *receive_buf_p ) {
-        for (i=0 ; i<maxlen-1 ; i++) {
-          if ( *receive_buf_p == '\n' ) {
-            receive_buf_p++;
-            break;
-          } else if ( *receive_buf_p == 0 ) {
-            break;
-          } else {
-            buf[i] = *receive_buf_p;
-            receive_buf_p++;
-          }
-        }
-        buf[i] = '\0';
-        return buf;
+    if (socket<0)  // MPI
+      {
+	for (i = 0; i < maxlen-1; i++)
+	  {
+	    ret = get_from_mpirecv_buf (&ch, sizeof(char));
+	    if (ret <= 0)
+	      {
+		perror("receive_line");
+		return NULL;
+	      }
+	    else
+	      {
+		buf[i]=ch;
+		if (ch == '\n') { i++; break; }
+	      }
+	  }
+	buf[i]='\0';
+	return buf;
       }
-      else {
-        /* Finished reading receive_buf */
-        receive_buf = 0;
+    if (socket==0) // stdin
+      {
+	return fgets (buf, maxlen, stdin);
       }
-    } 
-    if (socket<0)
-        {
-            return fgets (buf, maxlen, stdin);
-        }
-    else
-        {
-            for (i=0; i<maxlen-1 ; i++) {
-                ret=recv2 (socket, &ch, 1, 0);
-                if (ret <= 0)
-                    {
-                        perror ("receive_line");
-                        return NULL;
-                    }
-                else
-                    {
-                        buf[i]=ch;
-                        if (ch == '\n') { i++; break; }
-                    }
-            }
-            buf[i]='\0';
+    else           // TCP/IP
+      {
+	for (i=0; i<maxlen-1 ; i++) {
+	  ret=recv2 (socket, &ch, 1, 0);
+	  if (ret <= 0)
+	    {
+	      perror ("receive_line");
+	      return NULL;
+	    }
+	  else
+	    {
+	      buf[i]=ch;
+	      if (ch == '\n') { i++; break; }
+	    }
+	}
+	buf[i]='\0';
 #ifdef DEBUG
-            dbg_printf ("receive_line: %s", buf);
+	dbg_printf ("receive_line: %s", buf);
 #endif
-            return buf;
-        }
+	return buf;
+      }
 }
 
 int receive_binary (void *dst, unsigned long elm_size, unsigned long n_elm,
                     int socket)
 {
-    if (receive_buf) {
-      perror ("receive_binary to receive_buf");
-    }
-    if (socket<0)
-        {
-            return fread (dst, elm_size, n_elm, stdin);
-        }
-    else
-        {
-            int i;
-            for (i=0; i<elm_size ; i++)
-                {
-                    dst += recv2 (socket, dst, n_elm, 0);
+  // fprintf (stderr, "receive_binary,RANK:%d,GID:%d\n", RANK, GID);
+    MPI_Status recv_status;
+    if (socket<0)  // MPI
+      {
+	    MPI_Recv(dst, n_elm*elm_size, MPI_BYTE, RANK, GID, MPI_COMM_WORLD, &recv_status);
+      // fprintf (stderr, "receive_binary(end)\n");
+	return n_elm;
+      }
+    if (socket==0) // stdin
+      {
+	return fread (dst, elm_size, n_elm, stdin);
+      }
+    else           // TCP/IP
+      {
+	int i;
+	for (i=0; i<elm_size ; i++)
+	  {
+	    dst += recv2 (socket, dst, n_elm, 0);
 #ifdef DEBUG
-                    dbg_printf ("receive_binary: %ld bytes", n_elm);
+	    dbg_printf ("receive_binary: %ld bytes", n_elm);
 #endif
-                }
-            return n_elm;
-        }
+	  }
+	return n_elm;
+      }
 }
 
 
@@ -323,7 +412,7 @@ int connect_to (char *hostname, unsigned short port)
     int dstSocket;              /* socket */
     struct sockaddr_in dstAddr; /* sockaddr_in structure object */
 
-    /* 名前->IP address */
+    /* ������->IP address */
     servhost = gethostbyname(hostname);
     if (servhost == NULL) {
         perror ("gethostbyname");
@@ -349,7 +438,7 @@ int connect_to (char *hostname, unsigned short port)
         perror ("connection");
         exit (1);
     }
-    fprintf(stderr, "Ok\n", hostname, port);
+    fprintf(stderr, "Ok\n");
     /* test */
     /* send(dstSocket, "Test", strlen("Test")+1, 0); */
     /* close(dstSocket); */
@@ -362,6 +451,69 @@ void close_socket (int socket)
     close (socket);
 }
 
+// message processing thread func
+void msg_func()
+{
+    struct recv_block *rq = NULL;
+    for(;;)
+    {
+        pthread_mutex_lock(&recv_lock);
+        pthread_cond_wait(&recv_cond, &recv_lock);
+        do{
+            if (recv_queue_head != NULL)
+            {
+                rq = recv_queue_head;
+                recv_queue_head = rq->next;
+                if (rq->next == NULL) recv_queue_tail = NULL;
+                mpirecv_buf_len = rq->len;
+                mpirecv_buf = rq->buf;
+                mpirecv_buf_start = 0;
+                pthread_mutex_unlock(&recv_lock);
+                proc_msg();
+                free(rq->buf);
+                free(rq);
+                pthread_mutex_lock(&recv_lock);
+            } else{
+                pthread_mutex_unlock(&recv_lock);
+                break;
+            }
+        }while(1);
+    }
+}
+
+// Infinite loop for messaging thread in MPI mode
+void sendrecv()
+{
+    MPI_Status send_status, recv_status;
+    MPI_Request req;
+    int sflag, rflag;
+    int sent;
+    int readlen;
+    pthread_t msg_thread;
+    pthread_create(&msg_thread, NULL, (void *)msg_func, NULL);
+
+    for (sent = 0;;)
+    {
+        MPI_Probe(MPI_ANY_SOURCE, DATA_TAG, MPI_COMM_WORLD, &recv_status);
+        MPI_Get_count(&recv_status, DATA_TYPE, &readlen);
+        recv_queue_temp = (struct recv_block *) malloc(sizeof(struct recv_block));
+        recv_queue_temp->buf = (char *) malloc(sizeof(char) * readlen);
+        recv_queue_temp->len = readlen;
+        recv_queue_temp->next = NULL;
+        MPI_Recv(recv_queue_temp->buf, recv_queue_temp->len, DATA_TYPE, recv_status.MPI_SOURCE,
+                DATA_TAG, MPI_COMM_WORLD, &recv_status);
+        
+        // recv queue�����ャ�����
+        pthread_mutex_lock(&recv_lock);
+        {
+          if (recv_queue_head == NULL) recv_queue_head = recv_queue_temp;
+          if (recv_queue_tail != NULL) recv_queue_tail->next = recv_queue_temp;
+          recv_queue_tail = recv_queue_temp;
+        }
+        pthread_cond_signal(&recv_cond);
+        pthread_mutex_unlock(&recv_lock);
+    }
+}
 /* test */
 #ifdef TEST
 int main (int argc, char **argv)
@@ -380,3 +532,4 @@ int main (int argc, char **argv)
     close_socket (socket);
 }
 #endif
+
diff --git a/src/sample/tcell/sock.h b/src/sample/tcell/sock.h
index 78c950e5..8eeae196 100644
--- a/src/sample/tcell/sock.h
+++ b/src/sample/tcell/sock.h
@@ -32,11 +32,19 @@ int send_string (char *str, int socket);
 int send_fmt_string (int socket, char *fmt_string, ...);
 int send_binary (void *src, unsigned long elm_size, unsigned long n_elm,
                  int socket);
+void show_mpisend_buf (int socket);
 
 int receive_char (int socket);
 char* receive_line (char *buf, int maxlen, int socket);
 int receive_binary (void *dst, unsigned long elm_size, unsigned long n_elm,
                     int socket);
 
+void set_rank_and_gid (int rank, int gid);
+void send_block_start(void);
+void send_block_end(int rank);
+void sendrecv(void);
+
 extern char *receive_buf;
 extern char *receive_buf_p;
+extern __thread struct send_block *sq;
+extern __thread int RANK;
diff --git a/src/sample/tcell/socket/socket.lsp b/src/sample/tcell/socket/socket.lsp
index 7e95a843..3306825a 100644
--- a/src/sample/tcell/socket/socket.lsp
+++ b/src/sample/tcell/socket/socket.lsp
@@ -22,10 +22,10 @@
 ;;; OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 ;;; SUCH DAMAGE.
 
-;; 実行例
-;; (exec-with-remote-io "../fib-xcc")   ; 単体
-;; (start-procs 5 "../fib-xcc")         ; 複数同時起動
-;; (kill-procs)                         ; start-procsの後始末
+;; 絎�茵�箴�
+;; (exec-with-remote-io "../fib-xcc")   ; ���篏�
+;; (start-procs 5 "../fib-xcc")         ; 茲���医�����莎桁��
+;; (kill-procs)                         ; start-procs���緇�紮����
 
 (eval-when (:compile-toplevel :load-toplevel :execute)
   (unless (featurep :allegro)
diff --git a/src/sample/tcell/spanning.tcell b/src/sample/tcell/spanning.tcell
index 113cafb2..04e20f5f 100644
--- a/src/sample/tcell/spanning.tcell
+++ b/src/sample/tcell/spanning.tcell
@@ -28,7 +28,7 @@
 ;;; How to execute
 ;; task 0 0 0 4
 ;; <graph-type>   ; 1: random, 2: 2D-torus, 3: hyper-cube, 4:bintree
-;; <algorithm>    ; 1: sequential (search-s2), 2: sequential (search), 3: parallel (search-p), 4: parallel (search-p-array)
+;; <algorithm>    ; 1: sequential (search-s2), 2: sequential (search), 3: parallel (search-p), 4: parallel (search-p-array), 89: dump graph for COPINE
 ;; <show-graph-p> ; 0: no, 1: show by show-graph, 2: show by show-graph2
 ;; <show-tree-p>  ; 0: no, 1: show by show-graph, 2: show by show-graph2
 
@@ -36,16 +36,16 @@
 (c-exp "#include<stdlib.h>")
 (c-exp "#include\"xccmem.h\"")
 
-;;; ワーカごとに処理したタスクの数をカウントして表示
+;;; �����若�������������������������帥�鴻�������違����������潟��������茵�腓�
 ;; (%defconstant COUNT-NTASK)
-;;; 時々v-listの整合性をチェック
+;;; ������v-list�����翫����с�������с�����
 ;; (%defconstant CHECK)
-;;; search1-p での頂点再訪チェックにおけるメモリバリアの方法
+;;; search1-p ��с�������劫��荐������с�������������������＜�≪����������≪����号��
 (%ifndef* SEARCH-P-MEM-BARRIER-1
   (%ifndef* SEARCH-P-MEM-BARRIER-2
     (%ifndef* SEARCH-P-MEM-BARRIER-3
       (%defconstant SEARCH-P-MEM-BARRIER-3)))) ; 1 or 2 or 3 (default=3)
-;;; 統計情報をとる
+;;; 腟沿�������宴��������
 ;; (%defconstant STATISTICS)
 
 (%ifndef* NF-TYPE
@@ -80,42 +80,42 @@
   (%defconstant CALL-BOUND 30))
 
 ;;;;;;;;;;
-(def V-Length int)                      ; グラフの全頂点数
+(def V-Length int)                      ; ��違����������������号��
 
 (def (struct vertex)
-  (def degree int)                      ; 接続している枝の数
-  (def first-e int)                     ; 枝のうちの1つ（残りはnext-eで辿る）
-  (def parent int))                     ; spanning treeの親の頂点ID+1，未定の場合は0，rootは自分自身を指す
+  (def degree int)                      ; �･膓����������������������
+  (def first-e int)                     ; �����������＜��1��わ��罧�������next-e��ц梢���鐚�
+  (def parent int))                     ; spanning tree���荀����������ID+1鐚����絎������翫�����0鐚�root������������荳����������
 
 (def VV (array (struct vertex) MAX-V))
 
 ;;;;;;;;;;
-(def E-Length int)                      ; グラフの全枝数
+(def E-Length int)                      ; ��違�����������������
 
 (def (struct edge)
-  (def next-v int)                      ; 枝が指している頂点
-  (def next-e int))                     ; 次の枝
+  (def next-v int)                      ; ���������������������������
+  (def next-e int))                     ; 罨＜�����
 
 (def EE (array (struct edge) MAX-E))
 
 ;;;;;;;;;;
 ;;; list of arrays of vertices
-;;; （作業スタック）
+;;; 鐚�篏�罐���鴻�帥�����鐚�
 
 (def (struct v-list-body)
-  (def next (ptr (struct v-list-body)))   ; 次の要素
-  (def i int)                             ; スタックポインタ（(== i V-LIST-ALLOC-SIZE)が底）
-  (def v (array int V-LIST-ALLOC-SIZE)))  ; 頂点IDのリスト
+  (def next (ptr (struct v-list-body)))   ; 罨＜��荀�膣�
+  (def i int)                             ; ��鴻�帥����������ゃ�潟�随��(== i V-LIST-ALLOC-SIZE)���綺�鐚�
+  (def v (array int V-LIST-ALLOC-SIZE)))  ; ������ID��������鴻��
 
-(def V-List-Length int)                 ; v-list-bodyリストの長さ
-(def V-List (ptr (struct v-list-body))) ; v-list-bodyリストの先頭
+(def V-List-Length int)                 ; v-list-body�����鴻�������激��
+(def V-List (ptr (struct v-list-body))) ; v-list-body�����鴻�����������
 
 (def (struct v-list-head)
   (def first (ptr (struct v-list-body)))
   (def last (ptr (struct v-list-body)))
   (def length int))
 
-;;; 並列版ではワーカごとにスタックを持つ
+;;; 筝���������с�������若�������������鴻�帥��������������
 (def worker-data
     (%ifdef* COUNT-NTASK
       (def n-task int))
@@ -132,14 +132,14 @@
   (= WDATA.V-List.length 0)
   )
 
-;;; 統計情報
+;;; 腟沿��������
 (%ifdef* STATISTICS
   (%defconstant LOOP-MAX 1000)
-  (def N-Iter int 0)                          ; search[-p[-array]]での反復回数
-  (def V-List-Remain (array int LOOP-MAX))    ; 各反復開始時のリストの長さ
-  (def Visited-Vertices (array int LOOP-MAX)) ; 各反復開始時に訪問済みの頂点数
+  (def N-Iter int 0)                          ; search[-p[-array]]��с�����緇�������
+  (def V-List-Remain (array int LOOP-MAX))    ; ������緇����紮������������鴻�������激��
+  (def Visited-Vertices (array int LOOP-MAX)) ; ������緇����紮�������荐���闐���帥�������号��
   
-  ;; 走査済みの頂点数
+  ;; 莎井�紙����帥�������号��
   (def (csym::count-visited-vertices) (csym::fn int void)
     (def v int)
     (def n int 0)
@@ -158,8 +158,8 @@
   )
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;; v-list-bodyを1個push
-;;; lengthの値は別途処理する必要があるので注意
+;;; v-list-body���1���push
+;;; length�����ゃ����ラ��������������綽�荀���������������ф絵���
 (def (csym::alloc-v-list next) (csym::fn (ptr (struct v-list-body)) (ptr (struct v-list-body)))
   (def a (ptr (struct v-list-body)))
   (= a (cast (ptr (struct v-list-body))
@@ -168,15 +168,15 @@
   (= a->i V-LIST-ALLOC-SIZE)
   (return a))
 
-;;; v-list-bodyを1個pop
-;;; lengthの値は別途処理する必要があるので注意
+;;; v-list-body���1���pop
+;;; length�����ゃ����ラ��������������綽�荀���������������ф絵���
 (def (csym::dealloc-v-list a) (csym::fn (ptr (struct v-list-body)) (ptr (struct v-list-body)))
   (def next (ptr (struct v-list-body)))
   (= next a->next)
   (csym::free a)
   (return next))
 
-;;; （デバッグ用）v-list-lastがv-listの最後かチェック
+;;; 鐚������������亥��鐚�v-list-last���v-list������緇���������с�����
 (def (csym::check-last v-list v-list-last info)
     (csym::fn void (ptr (struct v-list-body)) (ptr (struct v-list-body)) (ptr char))
   (def cur (ptr (struct v-list-body)))
@@ -185,7 +185,7 @@
   (when (!= cur v-list-last)
     (csym::fprintf stderr "!! last is incorrect. %s ~%" info)))
 
-;;; （デバッグ用）v-listの長さがlen-expectであるかチェック
+;;; 鐚������������亥��鐚�v-list�����激�����len-expect��с�������������с�����
 (def (csym::check-length v-list len-expect info) (csym::fn void (ptr (struct v-list-body)) int (ptr char))
   (def cur (ptr (struct v-list-body)))
   (def len int 0)
@@ -194,15 +194,15 @@
   (when (!= len len-expect)
     (csym::fprintf stderr "!! Unexpected length len:%d expect:%d %s~%" len len-expect info)))
 
-;;; （デバッグ用）check-last and check-length
+;;; 鐚������������亥��鐚�check-last and check-length
 (def (csym::check-v-list v-list v-list-last len-expect info)
     (csym::fn void (ptr (struct v-list-body)) (ptr (struct v-list-body)) int (ptr char))
   (csym::check-length v-list len-expect info)
   (csym::check-last v-list v-list-last info))
 
-;;; v-list aの後ろにbを連結（破壊的）
-;;; a-lastがわかる場合は与えておくと前からたどらない
-;;; lengthの値は別途処理する必要があるので注意
+;;; v-list a���緇�������b�����ｇ��鐚���翫�����鐚�
+;;; a-last��������������翫�����筝����������������������������������������
+;;; length�����ゃ����ラ��������������綽�荀���������������ф絵���
 (def (csym::nconc-v-list a a-last b)
     (csym::fn (ptr (struct v-list-body)) (ptr (struct v-list-body)) (ptr (struct v-list-body)) (ptr (struct v-list-body)))
   (def cur (ptr (struct v-list-body)))
@@ -218,7 +218,7 @@
     (else
      (return b))))
 
-;;; v-listを配列化
+;;; v-list������������
 (def (csym::v-list-to-array buf v-list-first len)
     (csym::fn void (ptr (ptr (struct v-list-body))) (ptr (struct v-list-body)) int)
   (def i int)
@@ -234,15 +234,15 @@
 ;; (%defconstant USE-CAS-IN-SEARCH2 1)
 (def (csym::search-s2 fv) (csym::fn void int)
   (def my-v-list (ptr (struct v-list-body)))
-  (def my-v-list-length int)            ; 作業中のv-list-body
-  (def vi int)                          ; ローカルなスタックポインタ（(== vi V-LIST-ALLOC-SIZE)が底）
+  (def my-v-list-length int)            ; 篏�罐�筝����v-list-body
+  (def vi int)                          ; �����若����������鴻�帥����������ゃ�潟�随��(== vi V-LIST-ALLOC-SIZE)���綺�鐚�
   (= (fref (aref VV fv) parent) (+ fv 1))
   (= my-v-list (csym::alloc-v-list 0))
   (= my-v-list-length 1)
   (= vi my-v-list->i)
-  (= (aref my-v-list->v (-- vi)) fv)    ; スタックに最初の要素追加
+  (= (aref my-v-list->v (-- vi)) fv)    ; ��鴻�帥�����������������荀�膣�菴遵��
   (while (< vi V-LIST-ALLOC-SIZE)
-    (def v int (aref my-v-list->v (inc vi))) ; スタックから一要素取り出す
+    (def v int (aref my-v-list->v (inc vi))) ; ��鴻�帥�����������筝�荀�膣���������冴��
     (def i int)
     (def d int (fref (aref VV v) degree))
     (def e int (fref (aref VV v) first-e))
@@ -250,23 +250,23 @@
       (def nv int (fref (aref EE e) next-v))
       (when (== (fref (aref VV nv) parent) 0)
         (when (%ifdef* USE-CAS-IN-SEARCH2
-                (not (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1))) ; 枝の先の頂点の親を自分にセット．成功したら0
+                (not (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1))) ; �����������������鴻��荀���������������祉�����鐚����������������0
                 %else
                 1)
            (%ifndef* USE-CAS-IN-SEARCH2
              (= (fref (aref VV nv) parent) (+ v 1)))
-           (when (<= vi 0)              ; 配列が一杯になったらv-list-bodyをpush
-             (= my-v-list->i vi)        ; スタックポインタを構造体に反映
+           (when (<= vi 0)              ; ���������筝������������ｃ�����v-list-body���push
+             (= my-v-list->i vi)        ; ��鴻�帥����������ゃ�潟�帥��罕����篏����������
              (= my-v-list (csym::alloc-v-list my-v-list))
              (inc my-v-list-length)
              (= vi my-v-list->i))
-           (= (aref my-v-list->v (-- vi)) nv)))) ; 枝の先の頂点をスタックに追加
-    (while (and (== vi V-LIST-ALLOC-SIZE) ; スタックが空になったらv-list-bodyをpop
+           (= (aref my-v-list->v (-- vi)) nv)))) ; �����������������鴻����鴻�帥��������菴遵��
+    (while (and (== vi V-LIST-ALLOC-SIZE) ; ��鴻�帥��������腥冴�������ｃ�����v-list-body���pop
                 (> my-v-list-length 1))
       (= my-v-list (csym::dealloc-v-list my-v-list))
       (dec my-v-list-length)
       (= vi my-v-list->i)))
-  (= my-v-list->i vi))                  ; スタックポインタを構造体に反映（一応）
+  (= my-v-list->i vi))                  ; ��鴻�帥����������ゃ�潟�帥��罕����篏����������鐚�筝�綽�鐚�
 
 ;;;;;;;;;;;;;;;;;;;;
 
@@ -277,13 +277,13 @@
   (def d int (fref (aref VV v) degree))
   (def e int (fref (aref VV v) first-e))
   ;; (DEBUG-PRINT 1 "search1 v:%d b:%d d:%d~%" v b d)
-  ;; うまくdo-manyにできるか？
+  ;; �����障��do-many�����с��������鐚�
   (for ((= i 0) (< i d) (exps (inc i) (= e (fref (aref EE e) next-e))))
     (def nv int (fref (aref EE e) next-v))
     ;; (DEBUG-PRINT 1 "nv: %d~%" nv)
     (when (== (fref (aref VV nv) parent) 0)
       (when (%ifdef* USE-CAS-IN-SEARCH1
-              (not (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1))) ; 枝の先の頂点の親を自分にセット．cas-intの値は成功したら0
+              (not (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1))) ; �����������������鴻��荀���������������祉�����鐚�cas-int�����ゃ�����������������0
               %else
               1)
         (%ifndef* USE-CAS-IN-SEARCH1
@@ -309,7 +309,7 @@
   (DEBUG-PRINT 1 "V-List-Length: %d~%" V-List-Length)
   (do-while (or (> V-List-Length 1)
                 (< V-List->i V-LIST-ALLOC-SIZE))
-    ;; V-Listをmy-v-listに移す
+    ;; V-List���my-v-list���腱祉��
     (= my-v-list V-List) (= mlist my-v-list)
     (= my-v-list-length V-List-Length) (= mlist-length my-v-list-length)
     (= V-List (csym::alloc-v-list 0))
@@ -344,7 +344,7 @@
       (DEBUG-PRINT 1 "Worker %d starts %d-th task (t-search1)~%" WORKER-ID WDATA.n-task))
   (def stack-created-p int 0)
   (unless WDATA.V-List.first
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
@@ -376,7 +376,7 @@
 ;;
 (%ifdef* SEARCH-P-MEM-BARRIER-1
   (%defmacro DUP-CHECK (&body body)
-    `(unless (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1)) ; 成功したら0
+    `(unless (csym::cas-int (fref (aref VV nv) parent) 0 (+ v 1)) ; ���������������0
        (csym::start_access_after_lock)
        ,@body))
   %else
@@ -403,9 +403,9 @@
   (do-many for i from k0 to k1
     (= nv (fref (aref EE e) next-v))
     (DUP-CHECK
-     (if (> b 0)                        ; boundaryに達していなければ深さ優先
+     (if (> b 0)                        ; boundary��������������������������井訓���������
          (search1-p nv (- b 1) 0 (fref (aref VV nv) degree))
-       (begin                           ; boundaryに達していればスタックに積んで幅優先
+       (begin                           ; boundary��������������������違�鴻�帥��������腥������у��������
          (when (<= WDATA.V-List.first->i 0)
            (= WDATA.V-List.first (csym::alloc-v-list WDATA.V-List.first))
            (inc WDATA.V-List.length)
@@ -428,35 +428,35 @@
 
 ;;; parallel version of search
 (def (search-p v) (wfn void int)
-  (defs (struct v-list-head) my-v-list mlist) ; my-v-list：1反復で処理するリスト，mlist：m-v-list解放用
+  (defs (struct v-list-head) my-v-list mlist) ; my-v-list鐚�1���緇���у����������������鴻��鐚�mlist鐚�m-v-list茹ｆ�丞��
   (def i int)
   (DEBUG-PRINT 1 "[%2d] search-p v:%d~%" WORKER-ID v)
   (= (fref (aref VV v) parent) (+ v 1))
-  ;; WDATA.V-Listを初期化
+  ;; WDATA.V-List������������
   (= WDATA.V-List.first (csym::alloc-v-list 0))
   (= WDATA.V-List.length 1)
   (= WDATA.V-List.last WDATA.V-List.first)
-  ;; 始点から深さ制限つきDF search
+  ;; 紮���鴻�����羞宴����狗����ゃ��DF search
   (search1-p v CALL-BOUND 0 (fref (aref VV v) degree))
   (DEBUG-PRINT 1 "V-List-Length: %d~%" WDATA.V-List.length)
   (while (or (> WDATA.V-List.length 1)
              (< WDATA.V-List.first->i V-LIST-ALLOC-SIZE))
-    ;; 統計
+    ;; 腟沿��
     (%ifdef* STATISTICS
       (= (aref V-List-Remain N-Iter) WDATA.V-List.length)
       (= (aref Visited-Vertices N-Iter) (csym::count-visited-vertices))
       (inc N-Iter))
-    ;; WDATA.V-Listをmy-v-listに移す
+    ;; WDATA.V-List���my-v-list���腱祉��
     (= my-v-list WDATA.V-List) (= mlist my-v-list)
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
-    ;; my-v-listを処理
+    ;; my-v-list���������
     (DEBUG-PRINT 1 "my-v-list-length: %d~%" my-v-list.length)
     (%ifdef* CHECK (csym::check-length my-v-list.first my-v-list.length "in search-p"))
     (search-p-b my-v-list.first 0 my-v-list.length)
-    ;; 処理済みのmy-v-listを解放
+    ;; ������羝���帥��my-v-list���茹ｆ��
     (for ((= i 0) (< i mlist.length) (inc i))
       (= mlist.first (csym::dealloc-v-list mlist.first)))
     )
@@ -476,7 +476,7 @@
       (DEBUG-PRINT 1 "Worker %d starts %d-th task (t-search-b)~%" WORKER-ID WDATA.n-task))
   (def stack-created-p int 0)
   (unless WDATA.V-List.first
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
@@ -517,7 +517,7 @@
   (do-many for i from i0 to i1
     (search-p-c my-v-list-first my-v-list-first->i V-LIST-ALLOC-SIZE)
     (= my-v-list-first my-v-list-first->next)
-    (handles t-search-b                           ; my-v-list0の i0-2〜i1-2 の範囲を渡す
+    (handles t-search-b                           ; my-v-list0��� i0-2���i1-2 ���膀���蚊��羝＜��
      (:put from i0-2 to i1-2
            (= this.my-v-list-first my-v-list-first0)
            (= this.i0 i0-2) (= this.i1 i1-2))
@@ -531,42 +531,42 @@
     ))
 ;;; list2array version of search-p
 (def (search-p-array v) (wfn void int)
-  (def my-v-array (ptr (ptr (struct v-list-body)))) ; my-v-list：1反復で処理する頂点スタック配列
+  (def my-v-array (ptr (ptr (struct v-list-body)))) ; my-v-list鐚�1���緇���у����������������鴻�鴻�帥�����������
   (def my-v-array-length int)
   (def buf-size int)
   (def i int)
   (DEBUG-PRINT 1 "[%2d] search-p-array v:%d~%" WORKER-ID v)
   (= (fref (aref VV v) parent) (+ v 1))
-  ;; WDATA.V-Listを初期化
+  ;; WDATA.V-List������������
   (= WDATA.V-List.first (csym::alloc-v-list 0))
   (= WDATA.V-List.length 1)
   (= WDATA.V-List.last WDATA.V-List.first)
-  ;; 始点から深さ制限つきDF search
+  ;; 紮���鴻�����羞宴����狗����ゃ��DF search
   (search1-p v CALL-BOUND 0 (fref (aref VV v) degree))
   (DEBUG-PRINT 1 "V-List-Length: %d~%" WDATA.V-List.length)
   (= my-v-array 0) (= buf-size 0)
   (while (or (> WDATA.V-List.length 1)
                 (< WDATA.V-List.first->i V-LIST-ALLOC-SIZE))
-    ;; 統計
+    ;; 腟沿��
     (%ifdef* STATISTICS
       (= (aref V-List-Remain N-Iter) WDATA.V-List.length)
       (= (aref Visited-Vertices N-Iter) (csym::count-visited-vertices))
       (inc N-Iter)
       )
-    ;; WDATA.V-Listを配列化
+    ;; WDATA.V-List������������
     (= my-v-array-length WDATA.V-List.length)
     (when (> my-v-array-length buf-size)
       (= buf-size (* 2 my-v-array-length))
       (= my-v-array (cast (ptr (ptr (struct v-list-body)))
                       (csym::realloc my-v-array (* buf-size (sizeof (ptr (struct v-list-body))))))))
     (csym::v-list-to-array my-v-array WDATA.V-List.first WDATA.V-List.length)
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
-    ;; my-v-arrayを処理
+    ;; my-v-array���������
     (search-p-b-array my-v-array 0 my-v-array-length)
-    ;; 処理済みのmy-v-arrayを解放
+    ;; ������羝���帥��my-v-array���茹ｆ��
     (for ((= i 0) (< i my-v-array-length) (inc i))
       (csym::dealloc-v-list (aref my-v-array i)))
     )
@@ -587,7 +587,7 @@
       (DEBUG-PRINT 1 "Worker %d starts %d-th task (t-search-b-array)~%" WORKER-ID WDATA.n-task))
   (def stack-created-p int 0)
   (unless WDATA.V-List.first
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
@@ -623,7 +623,7 @@
   (DEBUG-PRINT 1 "[%2d] search-p-b-array %p %d %d~%" WORKER-ID my-v-array i0 i1)
   (do-many for i from i0 to i1
     (search-p-c (aref my-v-array i) (fref (aref my-v-array i) -> i) V-LIST-ALLOC-SIZE)
-    (handles t-search-b-array                   ; my-v-arrayの i0-2〜i1-2 の範囲を渡す
+    (handles t-search-b-array                   ; my-v-array��� i0-2���i1-2 ���膀���蚊��羝＜��
      (:put from i0-2 to i1-2
            (= this.my-v-array my-v-array)
            (= this.i0 i0-2) (= this.i1 i1-2))
@@ -651,7 +651,7 @@
       (DEBUG-PRINT 1 "Worker %d starts %d-th task (t-search-c)~%" WORKER-ID WDATA.n-task))
   (def stack-created-p int 0)
   (unless WDATA.V-List.first
-    ;; WDATA.V-Listを初期化
+    ;; WDATA.V-List������������
     (= WDATA.V-List.first (csym::alloc-v-list 0))
     (= WDATA.V-List.length 1)
     (= WDATA.V-List.last WDATA.V-List.first)
@@ -701,15 +701,15 @@
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
 ;;; for graph construction
-;;; v1->v2の枝を作ってeの位置に格納．返り値は次の枝の格納場所
+;;; v1->v2���������篏���ｃ��e���篏�臀������主��鐚�菴������ゃ��罨＜����������主����贋��
 (def (csym::make-edge1 v1 v2 e) (csym::fn int int int int)
   (= (fref (aref EE e) next-v) v2)
   (= (fref (aref EE e) next-e) (fref (aref VV v1) first-e))
-  (= (fref (aref VV v1) first-e) (inc e)) ; v1の枝リストにpush
+  (= (fref (aref VV v1) first-e) (inc e)) ; v1�����������鴻�����push
   (inc (fref (aref VV v1) degree))
   (return e))
 
-;;; v1->v2の枝があれば1，そうでなければ0を返す
+;;; v1->v2������������������1鐚���������с�����������0���菴����
 (def (csym::check-dup1 v1 v2) (csym::fn int int int)
   (def i int)
   (def d int (fref (aref VV v1) degree))
@@ -720,20 +720,20 @@
       (return 0)))
   (return 1))
 
-;;; v1->v2の枝がなければ作る．返り値は次の枝の格納場所
+;;; v1->v2��������������������遺�����鐚�菴������ゃ��罨＜����������主����贋��
 (def (csym::check-make-edge1 v1 v2 e) (csym::fn int int int int)
   (when (csym::check-dup1 v1 v2)
     (= e (csym::make-edge1 v1 v2 e)))
   (return e))
 
-;;; v1<->v2の両方向の枝を作る．返り値は次の枝の格納場所
+;;; v1<->v2���筝≧�劫�����������篏����鐚�菴������ゃ��罨＜����������主����贋��
 (def (csym::make-edge v1 v2 e) (csym::fn int int int int)
   (= e (csym::make-edge1 v1 v2 e))
   (= e (csym::make-edge1 v2 v1 e))
   (return e))
 
-;;; v1<->v2の両方向の枝を，既に枝がないかそれぞれ確認してから作る．
-;;; 返り値は次の枝の格納場所
+;;; v1<->v2���筝≧�劫�����������鐚���≪�����������������������������腆肴��������������篏����鐚�
+;;; 菴������ゃ��罨＜����������主����贋��
 (def (csym::check-make-edge v1 v2 e) (csym::fn int int int int)
   (= e (csym::check-make-edge1 v1 v2 e))
   (= e (csym::check-make-edge1 v2 v1 e))
@@ -774,7 +774,7 @@
           (= next (+ (* next 1103515245) 12345))
           (for ((= q n-e) (> q 0) (dec q))
             (= next (+ (* next 1103515245) 12345))
-            (= p (/ (* q (% (/ next 65536) 32768)) 32768)) ; q未満の乱数
+            (= p (/ (* q (% (/ next 65536) 32768)) 32768)) ; q���羣����箙掩��
             (= e (csym::check-make-edge1 i (aref v p) e))
             (= (aref v p) (aref v (- q 1)))))
       ;; without pseudo randomness, some unfair preference exists.
@@ -891,7 +891,7 @@
 ;;;;;;;;;;
 
 ;;; graph utils
-;;; "頂点番号[親の頂点番号] (接続されている頂点番号のリスト)" を出力
+;;; "�����合�����[荀���������合�����] (�･膓���������������������合���垩�������鴻��)" �����阪��
 (def (csym::show-graph) (csym::fn void)
   (defs int v e i)
   (for ((= v 0) (< v V-Length) (inc v))
@@ -906,7 +906,7 @@
           (csym::fprintf stderr ",%d" (fref (aref EE e) next-v)))))
     (csym::fprintf stderr ")~%")))
 
-;;; 単純に頂点と枝の情報のリストを出力
+;;; ���膣���������鴻�������������宴�������鴻�������阪��
 (def (csym::show-graph2) (csym::fn void)
   (defs int v e i)
   (for ((= v 0) (< v V-Length) (inc v))
@@ -914,11 +914,27 @@
   (for ((= e 0) (< e E-Length) (inc e))
     (csym::fprintf stderr "%9d => %d -> e: %d~%" e (fref (aref EE e) next-v) (fref (aref EE e) next-e))))
 
+(def (csym::dump-copine-graph name file) (csym::fn void (ptr char) (ptr char))
+  (defs int v e d)
+  (def fp (ptr FILE))
+  (= fp (csym::fopen file "w"))
+  (csym::fprintf fp "# %s~%" name)
+  (csym::fprintf fp "# |V|: %d~%" V-Length)
+  (csym::fprintf fp "# |E|: %d~%" E-Length)
+  (for ((= v 0) (< v V-Length) (inc v))
+    (= e (fref (aref VV v) first-e))
+    (for ((= d (fref (aref VV v) degree)) (> d 0) (dec d))
+      (csym::fprintf fp "%d~|11|0~|11|%d~%" v (fref (aref EE e) next-v))
+      (= e (fref (aref EE e) next-e))))
+  (csym::fclose fp)
+  (csym::fprintf stderr "Graph \"%s\" successfully dumped.~%" name)
+  (return))
+
 (def (csym::dump-graph name file) (csym::fn void (ptr char) (ptr char))
   (defs int v e)
   (def fp (ptr FILE))
   (= fp (csym::fopen file "w"))
-  ;; グラフ名
+  ;; ��違��������
   ;; "vertex"
   ;; # of vertex
   ;; degree first-e
@@ -980,7 +996,7 @@
   (return))
 
 
-;;; parentの値が想定外のものになっていないかチェック
+;;; parent�����ゃ����喝��紊������������������ｃ�������������������с�����
 (def (csym::check-graph) (csym::fn void)
   (def v int)
   (for ((= v 0) (< v V-Length) (inc v))
@@ -1027,6 +1043,7 @@
     (case 5) (csym::make-ncube 21)                 (= gname "HCube21.graph") (break)
     (case 6) (csym::make-2dt 4000)                 (= gname "2DTorus-4000.graph") (break)
     (case 11) (= gname "Random4000000.graph") (csym::read-graph gname) (break)
+    (case 21) (csym::make-random 1500 12) (= gname "Random_1500-12.graph") (break)
     (default)
     (cond
      ((and (> this.graph 20000) (< this.graph 30000))
@@ -1051,6 +1068,7 @@
     (case 2) (csym::search 0)    (= algstr "search")    (break)
     (case 3) (search-p 0)        (= algstr "search-p")  (break)
     (case 4) (search-p-array 0)  (= algstr "search-p-array") (break)
+    (case 89) (csym::dump-copine-graph gname gname) (csym::exit 0)
     (case 99) (csym::dump-graph gname gname) (csym::exit 0)
     (default) (csym::search-s2 0) (= algstr "search-s2") (break))
   (csym::gettimeofday (+ tp 1) 0)
diff --git a/src/sample/tcell/timechart.pl b/src/sample/tcell/timechart.pl
new file mode 100644
index 00000000..06efa037
--- /dev/null
+++ b/src/sample/tcell/timechart.pl
@@ -0,0 +1,277 @@
+#/bin/env perl
+use strict;
+use IO::Handle;
+use Getopt::Long qw(:config posix_default no_ignore_case gnu_compat);
+
+sub help {
+    print <<'EOS';
+    
+    timechart.pl: Read all <prefix>-<nnnn>.dat files generated by Tascell worker with the -T option where <nnnn> is a worker id (0000-9999) and generate a timechart graph as an eps file <prefix>.eps.
+        
+    Usage:
+        
+        perl timechart.pl <prefix> [options]
+        
+    Options:
+        
+        --keep: keep all plot files and a gnuplot script after execution.
+        --ignore [regexp]+: graphs for states / events whose names match this regexp are not printed.
+        (e.g., "--ignore EV" to ignore events and print only time chart)
+
+EOS
+    exit (1);
+}
+
+### Get Command-line options
+# Prefix of input/output files.
+my $prefix = shift (@ARGV);
+if ($prefix eq '') {
+    print "No <prefix> is specified.\n";
+    help();
+}
+
+# States / events whose names match this regexp are not printed.
+my @Ignore_regexp = ();
+# Keep plot files and gnuplot script? (-k option)
+my $keep_files = 0;
+# Help
+my $help = 0;
+
+GetOptions (
+    'ignore=s@' => \@Ignore_regexp,
+    'keep!' => \$keep_files,
+    'help|?' => \$help,
+    ) or help();
+help() if $help;
+
+if ( $keep_files ) {
+    print "Keep-file option is enabled.\n";
+}
+
+# States (equivalent to tcounter-strings in worker.sh)
+my @Tcounter=("TCOUNTER-INIT","TCOUNTER-EXEC","TCOUNTER-SPWN",
+	      "TCOUNTER-WAIT","TCOUNTER-EXCP","TCOUNTER-EXCP-WAIT",
+	      "TCOUNTER-ABRT","TCOUNTER-ABRT-WAIT",
+	      "TCOUNTER-TREQ-BK","TCOUNTER-TREQ-ANY");
+# Events (eqivalent to ev-strings in worker.sh)
+my @Evcounter = ("EV-SEND-TASK","EV-STRT-TASK","EV-RSLT-TASK","EV-EXCP-TASK","EV-ABRT-TASK");
+
+# Color for each state/event.
+my %Color = ();
+$Color{'TCOUNTER-INIT'} = '"black"';
+$Color{'TCOUNTER-EXEC'} = '"green"';
+$Color{'TCOUNTER-SPWN'} = '"magenta"';
+$Color{'TCOUNTER-WAIT'} = '"dark-green"';
+$Color{'TCOUNTER-EXCP'} = '"orange"';
+$Color{'TCOUNTER-EXCP-WAIT'} = '"dark-orange"';
+$Color{'TCOUNTER-ABRT'} = '"red"';
+$Color{'TCOUNTER-ABRT-WAIT'} = '"dark-red"';
+$Color{'TCOUNTER-TREQ-BK'} = '"dark-khaki"';
+$Color{'TCOUNTER-TREQ-ANY'} = '"khaki"';
+$Color{'EV-SEND-TASK'} = '"magenta"';
+$Color{'EV-STRT-TASK'} = '"green"';
+$Color{'EV-RSLT-TASK'} = '"green"';
+$Color{'EV-EXCP-TASK'} = '"orange"';
+$Color{'EV-ABRT-TASK'} = '"red"';
+
+# Point type for each event.
+my %Ptype = ();
+$Ptype{'EV-SEND-TASK'} = 6;
+$Ptype{'EV-STRT-TASK'} = 66;
+$Ptype{'EV-RSLT-TASK'} = 67;
+$Ptype{'EV-EXCP-TASK'} = 67;
+$Ptype{'EV-ABRT-TASK'} = 67;
+
+# Offset of location of points (y-axis) for each event.
+my %Offset = ();
+$Offset{'EV-SEND-TASK'} = 0;
+$Offset{'EV-STRT-TASK'} = 0.2;
+$Offset{'EV-RSLT-TASK'} = -0.2;
+$Offset{'EV-EXCP-TASK'} = -0.2;
+$Offset{'EV-ABRT-TASK'} = -0.2;
+
+# Title in legend for each state/event.
+my %Title = ();
+foreach my $stat (@Tcounter, @Evcounter) {
+    my $tit = $stat;
+    if ($stat =~ /TCOUNTER-(\S+)/) {
+	$tit = $1;
+    }
+    if ($stat =~ /EV-(\S+)/) {
+	$tit = $1;
+    }
+    $Title{$stat} = $tit;
+}
+
+# Plot file name for each state/event.
+my %Plot_file = ();
+# File handler for each state/event.
+my %Plot_file_fp = ();
+# Whether there is any plot data for each state/event?
+my %Valid = ();
+
+
+# Max of xrange (depends on max number of end time)
+my $x_max = 0;
+# Max of yrange (depends on the number of workers)
+my $y_max = 0;
+
+# Directory to save all generated files
+my $dirname = "$prefix-plot";
+
+# eps file to be created
+my $fname_eps = "$prefix.eps";
+
+# Scan log files generated by Tascell workers
+my @Files = ();
+foreach my $i (0 .. 9999) {
+    my $fname = sprintf ("$prefix-%04d.dat", $i);
+    if ( -e $fname ) {
+	print "$fname\n";
+	push (@Files, $fname);
+    } elsif ($i>0) {
+	print ($i." log files found.\n");
+	$y_max = $i;
+	last;
+    } else {
+	print "No log files named $prefix-<nnnn>.dat found.\n";
+	exit 99;
+    }
+}
+
+# Gnuplot script file
+my $fname_gp = "plot.gnuplot";
+
+
+### Main
+# Make directory
+mkdir $dirname or die "Failed to generate $dirname";
+
+# Open a plot file for each status/evnet to be written
+foreach my $stat (@Tcounter, @Evcounter) {
+    $Plot_file{$stat} = "$prefix-$stat.plt";
+    my $pltfile = "$dirname/$Plot_file{$stat}";
+    open ($Plot_file_fp{$stat}, "> $pltfile") or die "Failed to write a plot file $pltfile";
+}
+
+# Read log files and write to plot files.
+foreach my $stat (@Tcounter, @Evcounter) { $Valid{$stat} = 0; }
+my $id = -1;
+foreach my $file (@Files) {
+    $id++;
+    open (FP, "< $file") or die "Failed to open $file.";
+    while (my $line = <FP>) {
+        # status + time range?
+        if ($line =~ /^\s*(\S+)\s+(\S+)\s+(\S+)/) {
+            my ($l_stat, $start, $end) = ($1, $2, $3);
+            foreach my $stat (@Tcounter) {
+		if ($l_stat eq $stat) {
+		    $Valid{$stat} = 1;
+		    if ($end > $x_max) { $x_max = $end; }
+                    $Plot_file_fp{$stat}->print("$start $id\n");
+		    $Plot_file_fp{$stat}->print("$end $id\n");
+		    $Plot_file_fp{$stat}->print("\n");
+                    goto LINE_END;
+		}
+            }
+        }
+        # event + event time?
+        if ($line =~ /^\s*(\S+)\s+(\S+)/) {
+            my ($l_ev, $evtime) = ($1, $2);
+            foreach my $ev (@Evcounter) {
+		if ($l_ev eq $ev) {
+                    $Valid{$ev} = 1;
+                    if ($evtime > $x_max) { $x_max = $evtime; }
+                    my $py = $id + $Offset{$ev};
+                    $Plot_file_fp{$ev}->print("$evtime $py\n");
+                    goto LINE_END;
+                }
+            }
+        }
+      LINE_END: ;
+    }
+    close (FP);
+}
+
+# Close a plot files
+foreach my $stat (@Tcounter, @Evcounter) {
+    close ($Plot_file_fp{$stat});
+}
+
+# Handle --ignore option
+foreach my $stat (@Tcounter, @Evcounter) {
+    foreach my $reg (@Ignore_regexp) {
+        if ( $stat =~ $reg ) {
+            $Valid{$stat} = 0;
+            print "$stat is not printed due to --ignore $reg option\n";
+            last;
+        }
+    }
+}
+
+# Run gnuplot to generate an eps file and make a gnuplot script file
+# with which the same eps file can be generated again.
+open (GP, "| gnuplot" ) or die "Failed to exeute gnuplot";
+open (FP_GP, "> $dirname/$fname_gp") or die "Failed to open $dirname/$fname_gp to write";
+sub print_gp {
+    my $str = shift;
+    print GP $str;
+    print FP_GP $str;
+    print $str;
+}
+#print_gp "set key left top font 'Helvetica Neue,10' width 2"."\n";
+print_gp "set key left top"."\n";
+
+print_gp "set xrange [-0.25:$x_max]"."\n";
+print_gp "set xtics 0, 1, $x_max"."\n";
+print_gp 'set xlabel "time [s]"'."\n";
+
+print_gp "set yrange [-1:$y_max]"."\n";
+print_gp "set ytics 0, 1, ".($y_max-1)."\n";
+print_gp 'set ylabel "worker ID"'."\n";
+
+print_gp 'set terminal postscript eps enhanced color'."\n";
+print_gp "set output \"$fname_eps\""."\n";
+
+my $replot = 0;
+foreach my $stat (@Tcounter) {
+    if ($Valid{$stat}) {
+	print_gp (($replot==0)?'plot ':", \\\n");
+	print_gp "\"$dirname/$Plot_file{$stat}\" w l lc rgb $Color{$stat} lt 1 linewidth 5 title \"$Title{$stat}\"";
+	$replot = 1;
+    }
+}
+foreach my $ev (@Evcounter) {
+    if ($Valid{$ev}) {
+	print_gp (($replot==0)?'plot ':", \\\n");
+	print_gp "\"$dirname/$Plot_file{$ev}\" w p lc rgb $Color{$ev} pt $Ptype{$ev} ps 0.7 title \"$Title{$ev}\"";
+	$replot = 1;
+    }
+}
+print_gp "\n";
+
+# Close gnuplot process and script
+close (GP);
+close (FP_GP);
+
+unless ($keep_files) {
+# remove plot files
+    foreach my $stat (@Tcounter, @Evcounter) {
+	unlink "$dirname/$Plot_file{$stat}";
+    }
+# remove gnuplot script
+    unlink "$dirname/$fname_gp";
+# remove directory
+    rmdir $dirname;
+}
+
+# Show summary
+print "* * * Summary * * *\n";
+if ( -e $fname_eps ) {
+    print "An eps file $fname_eps generated.\n";
+}
+if ( -d $dirname ) {
+    print "Plot files and a gnuplot script file are stored in $dirname/.\n";
+    print "You can generate $fname_eps again by:\n";
+    print "\$ gnuplot $dirname/$fname_gp\n";
+}
diff --git a/src/sample/tcell/worker.sc b/src/sample/tcell/worker.sc
index cab3d627..91b83a0c 100644
--- a/src/sample/tcell/worker.sc
+++ b/src/sample/tcell/worker.sc
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2009-2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2009-2020 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -43,9 +43,10 @@
 (c-exp "#include<math.h>")
 (c-exp "#include<pthread.h>")
 (c-exp "#include<sys/time.h>")
-(c-exp "#include<getopt.h>")
+(c-exp "#include<unistd.h>")
+(c-exp "#include \"sock.h\"")
+;; (%cinclude "sock.h")
 (%ifdef* USEMPI (c-exp "#include <mpi.h>"))
-(%cinclude "sock.h")
 
 (%include "worker.sh")
 
@@ -53,13 +54,6 @@
   (c-exp "#define NDEBUG"))
 (c-exp "#include<assert.h>")
 
-;;; Variables for debug information
-(%ifdef* VERBOSE
-         (static n-dreq-handler int 0)  ; # running dreq-handler threads
-         (static n-sending-dreq int 0)  ; # dreq handlers executing send-dreq-for-required-range
-         (static n-sending-data int 0)  ; # dreq handlers sending data
-         (static n-waiting-data int 0)) ; # dreq handlers waiting data
-
 
 (%defmacro xread (tp exp)
   `(mref (cast (ptr (volatile ,tp)) (ptr ,exp))))
@@ -72,9 +66,21 @@
     ))
 
 
+;;;; Worker threads
+(def threads (array (struct thread-data) 128))
+(def num-thrs unsigned-int)
+
+(def my-rank int)    ; my MPI rank
+(def num-procs int)  ; # of MPI processes
+(def init-task (ptr char) NULL)  ; initial task
+
 ;;;; Random number generator
 (def random-seed1 double 0.2403703)
 (def random-seed2 double 3.638732)
+;;;; Start time of the first task execution
+(PROF-CODE
+ (def tp-strt (struct timeval)))
+
 ;; Random integer in [0, max-1]
 (def (csym::my-random max pseed1 pseed2) (fn int int (ptr double) (ptr double))
   (= (mref pseed1) (+ (* (mref pseed1) 3.0) (mref pseed2)))
@@ -122,19 +128,39 @@
   (csym::gettimeofday (ptr now) 0)
   (return (+ (* 1000 1000 now.tv-sec) now.tv-usec)))
 
+;;; Get diff time between two timevals (tp1-tp2) as a double value.
+(def (csym::diff-timevals tp1 tp2)
+    (fn double (ptr (struct timeval)) (ptr (struct timeval)))
+  (return (+ (- tp1->tv-sec tp2->tv-sec)
+	     (* 0.000001 (- tp1->tv-usec tp2->tv-usec)))))
+
 ;;; Output the error message (str) to stderr
 (def (csym::proto-error str pcmd) (csym::fn void (ptr (const char)) (ptr (struct cmd)))
   (def i int)
   (def buf (array char BUFSIZE))
   (csym::serialize-cmd buf pcmd)
-  (csym::fprintf stderr "(%d): %s> %s~%" (csym::get-universal-real-time) str buf))
+  (csym::fprintf stderr "RANK %d: (%d): %s> %s~%"
+		 my-rank (csym::get-universal-real-time) str buf)
+  )
 
 ;; The lock for the send channel to external nodes (Tascell server)
 (def send-mut pthread-mutex-t)
 
-;; The socket for communications with the Tascell server.
-;; sv-socket<0 indicates external communications are done via stdin/out
+;; Specifies how to communicate with external computing nodes.
+;; sv-socket>0: connects to Tascell server via TCP/IP connection
+;;              (the value of sv-socket is used as the port number)
+;; sv-socket=0: external messages are transferred to/from stdout/stdin
+;; sv-socket<0: communicates with external nodes directly using MPI
 (def sv-socket int)
+;; Generate a randonm rank ID excluding my ID.
+(def (csym::choose-rank) (csym::fn int void)
+  (def rank int)
+  (= rank (csym::my-random (- num-procs 1)
+    (ptr random-seed1) (ptr random-seed2)))
+  (if (>= rank my-rank)
+    (inc rank))
+  (return rank)
+)
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 ;; Auxiliary functions for external input/output
@@ -143,77 +169,111 @@
 (def (csym::read-to-eol) (csym::fn void void)
   (def c int)
   (while (!= EOF (= c (csym::receive-char sv-socket)))
-                                        ;(!= EOF (= c (csym::getc stdin)))
     (if (== c #\Newline) (break))))
 
-(def (csym::write-eol) (csym::fn void void)
-  (csym::send-char #\Newline sv-socket))
-
 (def (csym::flush-send) (csym::fn void void)
-  (if (< sv-socket 0) (csym::fflush stdout)))
+  (if (== sv-socket 0) (csym::fflush stdout)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
 ;;; Receive an external message and store it into buf.
 ;;; Then interpret (deserizlize) the string and set the result to cmd-buf.
-
-;; the receive buffers
-(def buf (array char BUFSIZE))
-(def cmd-buf (struct cmd))
-
-(def (csym::read-command) (csym::fn (ptr (struct cmd)))
-  (def b (ptr char) buf)
+(def buf (array char BUFSIZE))  ; buffer for stdin/TCP receive
+(def cmd-buf (struct cmd))      ; buffer for stdin/TCP receive
+(def (csym::read-command buf cmd-buf)
+    (csym::fn int (ptr char) (ptr (struct cmd)))
   (def cp (ptr char) NULL)
 
-  (= cp (csym::receive-line b BUFSIZE sv-socket))
+  (= cp (csym::receive-line buf BUFSIZE sv-socket))
   (if cp
     (begin
-      (= cmd-buf.node OUTSIDE)
-      (DEBUG-PRINT 1 "(%d): RECEIVED> %s" (csym::get-universal-real-time) b)
-      (csym::deserialize-cmd (ptr cmd-buf) b)
-      (return (ptr cmd-buf)))
+      (= cmd-buf->node OUTSIDE)
+      (DEBUG-PRINT 1 "RANK %d: (%d): RECEIVED> %s"
+		   my-rank (csym::get-universal-real-time) buf)
+      (csym::deserialize-cmd cmd-buf buf)
+      (return 1))
     (begin
-      (DEBUG-PRINT 1 "(%d): RECEIVED> (failed)" (csym::get-universal-real-time))
-      (return NULL))))
+      (DEBUG-PRINT 1 "RANK %d: (%d): RECEIVED> (failed)"
+		   my-rank (csym::get-universal-real-time))
+      (return 0))))
+
+;;;latency hiding
+(def (csym::set-progress thr n) (fn void (ptr (struct thread-data)) int)
+  (def tx (ptr (struct task)) thr->task-top)
+  (= tx->progress n))
+
+(def (csym::wait-progress thr k) (fn void (ptr (struct thread-data)) int)
+  (def tx (ptr (struct task)) thr->task-top)
+  (while (< tx->progress k)))
 
 ;;; Send cmd to an external node (Tascell server)
 ;;; The body of task/rslt/bcst is also sent using task-senders[task-no]
 ;;; (task-senders[] are user-defined functinos)
-(def send-buf (array char BUFSIZE))
+(def send-buf (array char BUFSIZE)) ; buffer for stdout/TCP send
 (def (csym::send-out-command pcmd body task-no)
     (csym::fn void (ptr (struct cmd)) (ptr void) int)
   (def ret int)
   (def w (enum command))
+  (def dest-rank int)     ; rank ID of destination MPI proc
   (= w pcmd->w)
-  ;; <--- sender-lock <---
-  (csym::pthread-mutex-lock (ptr send-mut))
-  ;; Send command string
-  (csym::serialize-cmd send-buf pcmd)
-  (csym::send-string send-buf sv-socket)
-  (csym::write-eol)
-  ;; Send the body of task/rslt/bcst
+  ;; Note: In the MPI mode, calls of send-string, task-senders, and etc.
+  ;; above just write the message into the mpisend buffer. Then below,
+  ;; extracts the destination rank ID and request the messaging thread
+  ;; to send the message stored in the buffer.
+	(switch w       ; extract destination rank ID
+	  (case TASK) 
+      (= dest-rank (aref pcmd->v 2 0))       
+      (csym::set-rank-and-gid dest-rank 
+                              (+ 1 (+ (* my-rank num-thrs) (aref pcmd->v 1 1))))
+      (break)
+	  (case RSLT) (= dest-rank (aref pcmd->v 0 0)) (break)
+	  (case TREQ) (= dest-rank (aref pcmd->v 1 0)) (break)
+	  (case NONE) (= dest-rank (aref pcmd->v 0 0)) (break)
+	  (case RACK) (= dest-rank (aref pcmd->v 0 0)) (break)
+	  (default)
+	  (csym::fprintf stderr "Error: Invalid destination rank.~%")
+	  (break))
+
+  (DEBUG-PRINT 1 "Send command string~%")
+	;; Exit if the destination rank of RSLT message is the pseudo rank (-1).
+	(if (and (== w RSLT) (== -1 dest-rank))
+	    (begin
+        ;; Send command string
+        (csym::send-block-start) ; allocate mpisend-buf for initialization
+        (csym::serialize-cmd sq->buf pcmd)
+        (= sq->len (csym::strlen sq->buf))
+        ((aref rslt-senders task-no) body)
+	      (csym::show-mpisend-buf sv-socket)
+	      (PROF-CODE
+	       (csym::finalize-tcounter)
+	       (csym::show-counters))
+	      (csym::MPI-Abort MPI-COMM-WORLD 0)
+	      (csym::exit 0)))
+    ;; Send command string
+  (csym::send-block-start) ; allocate mpisend-buf for initialization
+  (csym::serialize-cmd sq->buf pcmd)
+  (= sq->len (csym::strlen sq->buf))
+  (csym::send-char #\Newline sv-socket)
+        ;; End initialization of mpisend-buf and add it to the send buffer
+	(csym::send-block-end dest-rank)
+    ;; Send the body of task/rslt/bcst
+  (DEBUG-PRINT 1 "Send the body of task/rslt/bcst~%")
+  (DEBUG-PRINT 1 "task-no: %d~%" task-no)
   (cond
    (body
     (cond
      ((or (== w TASK) (== w BCST))
+      (DEBUG-PRINT 1 "w == TASK~%")
       ((aref task-senders task-no) body)
-      (csym::write-eol))
+      ;; (csym::send-char #\Newline sv-socket)
+      )
      ((== w RSLT)
       ((aref rslt-senders task-no) body)
-      (csym::write-eol)
+      ;; (csym::send-char #\Newline sv-socket)
       )))
-   ((== w DATA)
-    ;; data-mut has been already acquired
-    (csym::data-send (aref pcmd->v 1 0) (aref pcmd->v 1 1))
-    (csym::write-eol)))
-
-  (csym::flush-send)
-  (csym::pthread-mutex-unlock (ptr send-mut))
-  ;; ---> sender-lock --->
-  (if (and (== w RSLT) option.auto-exit)
-      (csym::exit 0))
+   )
   )
-
+			    
 ;;; Take cmd and call the function corresponding to its command name.
 ;;; For task/rslt command from a worker in the same node,
 ;;; the argument "body" is a pointer of task object.
@@ -221,18 +281,14 @@
 (def (csym::proc-cmd pcmd body) (csym::fn void (ptr (struct cmd)) (ptr void))
   (def w (enum command))
   (= w pcmd->w)
+  ;; (csym::fprintf stderr "proc-cmd()~%")
   (switch w
    (case TASK) (csym::recv-task pcmd body) (break)
    (case RSLT) (csym::recv-rslt pcmd body) (break)
    (case TREQ) (csym::recv-treq pcmd) (break)
    (case NONE) (csym::recv-none pcmd) (break)
    (case RACK) (csym::recv-rack pcmd) (break)
-   (case DREQ) (csym::recv-dreq pcmd) (break)
-   (case DATA) (csym::recv-data pcmd) (break)
    (case BCST) (csym::recv-bcst pcmd) (break)
-   (case LEAV) (csym::recv-leav pcmd) (break)
-   (case LACK) (csym::recv-lack pcmd) (break)
-   (case ABRT) (csym::recv-abrt pcmd) (break)
    (case CNCL) (csym::recv-cncl pcmd) (break)
    (case BCAK) (csym::recv-bcak pcmd) (break)
    (case STAT) (csym::print-status pcmd) (break)
@@ -256,9 +312,6 @@
       )
     ))
 
-(def threads (array (struct thread-data) 128))
-(def num-thrs unsigned-int)
-
 
 ;;; Flush the once accepted task request pointed by "(mref p-hx)"
 ;;; by sending back "none" and removing the treq entry from the thr's treq-top list.
@@ -387,19 +440,21 @@
   (def rcmd (struct cmd))
   (def delay long 1000)     ; Waiting time after receiving none
   (def tx (ptr (struct task)) thr->task-top)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
 
   ;; treq command
   (= rcmd.c 2)
   (= rcmd.node req-to) ; internal (INSIDE) or external (OUTSIDE)
   (= rcmd.w TREQ)
-  (= (aref rcmd.v 0 0) thr->id)
+  (if rank-p (= (aref rcmd.v 0 0) my-rank))
+  (= (aref rcmd.v 0 (+ rank-p 0)) thr->id)
   (if (and (!= req-to ANY) thr->sub)
       (begin
 	;; If the task request is a stealing back, add the id of
 	;; task that causes the waiting status.
-	(= (aref rcmd.v 0 1) thr->sub->id)
-	(= (aref rcmd.v 0 2) TERM))
-    (= (aref rcmd.v 0 1) TERM))
+	(= (aref rcmd.v 0 (+ rank-p 1)) thr->sub->id)
+	(= (aref rcmd.v 0 (+ rank-p 2)) TERM))
+    (= (aref rcmd.v 0 (+ rank-p 1)) TERM))
   (csym::copy-address (aref rcmd.v 1) treq-head) ; Address of receipant
 
   ;; Send a treq message repeatedly until get a new task (task message)
@@ -412,6 +467,12 @@
     (= tx->stat TASK-ALLOCATED)
     (begin
      (csym::pthread-mutex-unlock (ptr thr->mut))
+     ;; Change the destination rank of "ANY" task request for an external process
+     ;; (MPI mode)
+     (if (and rank-p
+	      (== rcmd.node OUTSIDE)
+	      (== (aref rcmd.v 1 1) ANY))
+	 (= (aref rcmd.v 1 0) (csym::choose-rank)))
      (csym::send-command (ptr rcmd) 0 0) ; Send treq
      (csym::pthread-mutex-lock (ptr thr->mut)))
     ;; Wait for *tx being initialized in recv-task invoked by a sender worker thread
@@ -421,8 +482,10 @@
       ;; stop getting a new task and resume the suspended task.
       (if (and (!= tx->stat TASK-INITIALIZED)
 	       thr->sub
-	       (== thr->sub->stat TASK-HOME-DONE))
-	  ;; The worker sent a treq and its response may not have arrived.
+	       (or (== thr->sub->stat TASK-HOME-DONE)
+                   (== thr->sub->stat TASK-HOME-EXCEPTION)
+                   (== thr->sub->stat TASK-HOME-ABORTED)))
+          ;; The worker sent a treq and its response may not have arrived.
 	  ;; However, we can guarantee that the response is "none" because
 	  ;; this treq is a stealing back and the result of the spawned task
 	  ;; that caused the stealing back has been sent (and received).
@@ -465,7 +528,9 @@
 	  ;; If the most recent spawned task has been completed,
 	  ;; stop getting a new task and resume the suspended task.
           (if (and thr->sub
-                   (== thr->sub->stat TASK-HOME-DONE))
+                   (or (== thr->sub->stat TASK-HOME-DONE)
+                       (== thr->sub->stat TASK-HOME-EXCEPTION)
+                       (== thr->sub->stat TASK-HOME-ABORTED)))
               (return 0))))
     )
   (return 1))
@@ -479,6 +544,8 @@
   (def tx (ptr (struct task)))
   (def old-ndiv int)
   (def old-probability double)
+  (def rsn (enum exiting-rsn))
+  (def reason int)
   (def rcmd (struct cmd))               ; for RSLT command
 
   ;; If there is a treq message that was sent by this worker
@@ -489,7 +556,9 @@
     ;; If the result for the most recent suspended task has arrived,
     ;; stop requesting a new task and resume the suspended task.
     (if (and thr->sub
-             (== thr->sub->stat TASK-HOME-DONE))
+             (or (== thr->sub->stat TASK-HOME-DONE)
+		 (== thr->sub->stat TASK-HOME-EXCEPTION)
+		 (== thr->sub->stat TASK-HOME-ABORTED)))
         (return)))
 
   ;; Allocate task to be initialized
@@ -498,23 +567,68 @@
   (if (csym::send-treq-to-initialize-task thr treq-head req-to)
       (begin
 	;; Execute the task
+	(PROF-CODE
+	 (csym::tcounter-change-state thr TCOUNTER-EXEC OBJ-NULL 0)
+         (csym::evcounter-count thr (if-exp (== tx->rslt-to INSIDE) EV-STRT-TASK-INSIDE EV-STRT-TASK-OUTSIDE)
+                                OBJ-PADDR tx->rslt-head)
+         )
 	(= tx->stat TASK-STARTED) ; TASK-INITIALIZED => TASK-STARTED
+	(= tx->cancellation 0)    ; initialize # of cancellation flags
 	(= old-ndiv thr->ndiv)
 	(= old-probability thr->probability)
 	(= thr->ndiv tx->ndiv)
 	(= thr->probability 1.0)
 	(csym::pthread-mutex-unlock (ptr thr->mut))
-	(DEBUG-PRINT 1 "(%d): (Thread %d) start %d<%p>.~%"
-		     (csym::get-universal-real-time) thr->id tx->task-no tx->body)
+	(DEBUG-PRINT 1 "(%d): (Thread %d) start %d<%p> (body=%p).~%"
+		     (csym::get-universal-real-time) thr->id tx->task-no tx tx->body)
 	((aref task-doers tx->task-no) thr tx->body) ; Invoke the task body method
-	(DEBUG-PRINT 1 "(%d): (Thread %d) end %d<%p>.~%"
-		     (csym::get-universal-real-time) thr->id tx->task-no tx->body)
+	(= rsn thr->exiting)
+	(= thr->exiting EXITING-NORMAL)
+	;; Set the reason for compliting the task
+	(switch rsn
+	  (case EXITING-NORMAL)
+	  (DEBUG-PRINT 1 "(%d): (Thread %d) end %d<%p> (body=%p).~%" 
+		       (csym::get-universal-real-time)
+		       thr->id tx->task-no tx tx->body)
+          (PROF-CODE
+           (csym::evcounter-count thr (if-exp (== tx->rslt-to INSIDE) EV-RSLT-TASK-INSIDE EV-RSLT-TASK-OUTSIDE)
+                                  OBJ-PADDR tx->rslt-head))
+	  (= reason 0)
+	  (break)
+	  (case EXITING-EXCEPTION)
+	  (DEBUG-PRINT 1 "(%d): (Thread %d) end %d<%p> (body=%p) with exception %d.~%" 
+		       (csym::get-universal-real-time)
+		       thr->id tx->task-no tx tx->body thr->exception-tag)
+          (PROF-CODE
+           (csym::evcounter-count thr (if-exp (== tx->rslt-to INSIDE) EV-EXCP-TASK-INSIDE EV-EXCP-TASK-OUTSIDE)
+                                  OBJ-PADDR tx->rslt-head))
+	  (= reason 1)
+	  (break)
+	  (case EXITING-CANCEL)
+	  (DEBUG-PRINT 1 "(%d): (Thread %d) aborted %d<%p> (body=%p).~%" 
+		       (csym::get-universal-real-time)
+		       thr->id tx->task-no tx tx->body)
+          (PROF-CODE
+           (csym::evcounter-count thr (if-exp (== tx->rslt-to INSIDE) EV-ABRT-TASK-INSIDE EV-ABRT-TASK-OUTSIDE)
+                                  OBJ-PADDR tx->rslt-head))
+	  (= reason 2)
+	  (break)
+	  (default)
+	  (csym::fprintf 
+	   stderr "(%d) Warn: Thread %d ended with unexpected reason.~%"
+	   (csym::get-universal-real-time) thr->id)
+	  (= reason 0))
 	;; Send the result to the task sender (== the recipient of the treq)
 	(= rcmd.w RSLT)
-	(= rcmd.c 1)
+	(= rcmd.c 3)
 	(= rcmd.node tx->rslt-to)        ; internal or external
-	(csym::copy-address (aref rcmd.v 0) tx->rslt-head)
+	(csym::copy-address (aref rcmd.v 0) tx->rslt-head)      ;[0]:recipient
+	(= (aref rcmd.v 1 0) reason) (= (aref rcmd.v 1 1) TERM) ;[1]:reason
+        (= (aref rcmd.v 2 0) thr->exception-tag) (= (aref rcmd.v 2 1) TERM)
+                             ; [2]:exception-tag (meaningful only when [1]==1)
+  (csym::set-rank-and-gid (aref rcmd.v 0 0) (+ 1 (+ (* my-rank num-thrs) thr->id)))                           
 	(csym::send-command (ptr rcmd) tx->body tx->task-no)
+	(csym::pthread-mutex-lock (ptr thr->rack-mut))
 	(inc thr->w-rack) ; Increase w-rack counter. This is decreased when the worker
 	                  ; receives a rack message as a reply to the rslt. While this
                           ; counter is larger than zero, the worker does not spawn a
@@ -575,18 +689,51 @@
   )
 
 ;;; The worker's main function
+(DEBUG-PRINT 1 "The worker's main function.~%")
 (def (worker arg) (fn (ptr void) (ptr void))
   (def thr (ptr (struct thread-data)) arg)
   (= thr->wdptr (csym::malloc (sizeof (struct thread-data))))
   (%ifdef* USE-AFFINITY
     (if option.affinity
-      (csym::worker-setaffinity thr->id)))
-  (csym::worker-init thr)
+	(switch option.thread-affinity
+	  (case SHAREDMEMORY)
+	  (csym::worker-setaffinity (+ (* my-rank num-thrs) thr->id))
+	  (break)
+	  (case COMPACT)
+	  (csym::worker-setaffinity thr->id)
+	  (break)
+	  (case SCATTER)
+	  (csym::worker-setaffinity
+	   (+ (* option.thread-per-cpu (% thr->id option.cpu-num)) (/ thr->id option.cpu-num)))
+	  (break))))
+  (csym::worker-init thr)  ; initialize app-defined worker local storage
   (csym::pthread-mutex-lock (ptr thr->mut))
   (loop
-    (recv-exec-send thr (init (array (enum addr) 2) (array ANY TERM)) INSIDE))
+    (PROF-CODE
+     (if (!= thr->tcnt-stat TCOUNTER-INIT)
+	 (csym::tcounter-change-state thr TCOUNTER-TREQ-ANY OBJ-NULL 0)))
+    (if (< sv-socket 0)
+	;; MPI mode
+	(recv-exec-send thr (init (array (enum addr) 3) (array my-rank ANY TERM)) INSIDE)
+      ;; Tascell Server mode
+      (recv-exec-send thr (init (array (enum addr) 2) (array ANY TERM)) INSIDE)))
   (csym::pthread-mutex-unlock (ptr thr->mut)))
 
+;; The messaging thread's main function
+(def (csym::mpi-loop) (csym::fn void)
+  (csym::sendrecv))
+
+;; Read and handle an external message
+(def (csym::proc-msg) (fn void)
+  (def cmd (struct cmd))
+  (def buf (array char BUFSIZE))
+  (DEBUG-PRINT 1 "RANK %d: Waiting for an external message.~%" my-rank)
+  (if (csym::read-command buf (ptr cmd))
+    (begin
+      (DEBUG-PRINT 1 "RANK %d: Processing a %s command.~%" my-rank (aref cmd-strings cmd.w))
+      (csym::proc-cmd (ptr cmd) 0))))
+
+
 
 
 ;;;; recv-xxxx(): handler of the xxxx command.
@@ -599,6 +746,8 @@
   (def id (enum addr))
   (def task-no int)
   (def len size-t)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
+  ;;; (csym::fprintf stderr "recv-task()~%")
   ;; Chceck # of arguments
   (if (< pcmd->c 4)
       (csym::proto-error "wrong-task" pcmd))
@@ -606,12 +755,15 @@
   ;; invoking the user-defined receiver method.
   ;; (For an internal task message, body is given as the argument)
   (= task-no (aref pcmd->v 3 0))
+  (csym::set-rank-and-gid (aref pcmd->v 1 0) (+ 1 (+ (* (aref pcmd->v 1 0) num-thrs) (aref pcmd->v 1 1))))
   (if (== pcmd->node OUTSIDE)
       (begin
-       (= body ((aref task-receivers task-no)))
-       (csym::read-to-eol)))
+       (= body ((aref task-allocators task-no)))
+       ((aref task-receivers task-no) body)
+      ;;  (csym::read-to-eol)
+       ))
   ;; Determine the task recipient worker from <recipient>
-  (= id (aref pcmd->v 2 0))
+  (= id (aref pcmd->v 2 (+ rank-p 0)))
   (if (not (< id num-thrs))
       (csym::proto-error "wrong task-head" pcmd))
   (= thr (+ threads id))                ; thr: worker to that the task is sent
@@ -619,6 +771,7 @@
   ;; Initialize the task.
   ;; The task entry has been allocated at the top of the task stack of the recipient
   ;; before it sends a treq message (see send-treq-to-initialize-task())
+  (DEBUG-PRINT 1 "Initialize the task~%")
   (csym::pthread-mutex-lock (ptr thr->mut))
   (= tx thr->task-top)                  ; tx: the top of the task stack
   (= tx->rslt-to pcmd->node)            ; set external/internal for the rslt message
@@ -631,10 +784,11 @@
   (= tx->task-no task-no)               ; the kind of the task
   (= tx->body body)                     ; task object
   (= tx->stat TASK-INITIALIZED)         ; TASK-ALLOCATED => TASK-INITIALIZED
-  (csym::pthread-mutex-unlock (ptr thr->mut))
+  (= tx->progress 0)                    ; initialize progress to 0
 
   ;; Awake the worker thread sleeping to waiting for the task
   (csym::pthread-cond-broadcast (ptr thr->cond))
+  (csym::pthread-mutex-unlock (ptr thr->mut))
   )
 
 
@@ -644,8 +798,9 @@
   (def thr (ptr (struct thread-data)))
   (def id (enum addr))
   (def len size-t)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   (if (< pcmd->c 1) (csym::proto-error "Wrong none" pcmd))
-  (= id (aref pcmd->v 0 0))
+  (= id (aref pcmd->v 0 (+ rank-p 0)))
   (if (not (< id num-thrs))
       (csym::proto-error "Wrong task-head" pcmd))
   (= thr (+ threads id))
@@ -653,10 +808,10 @@
   (if (> thr->w-none 0)                ; When w-none>0, the recipient has stopped waiting
       (dec thr->w-none)                ; the response to treq
     (= thr->task-top->stat TASK-NONE)) ; TASK-ALLOCATED => TASK-NONE
-  (csym::pthread-mutex-unlock (ptr thr->mut))
 
   ;; Awake the worker thread sleeping to waiting for the task
   (csym::pthread-cond-broadcast (ptr thr->cond))
+  (csym::pthread-mutex-unlock (ptr thr->mut))
   )
 
 
@@ -666,39 +821,72 @@
     (= hx hx->next))
   (return hx))
 
+
+;;; Set subtasks to be cancelled spawned by "owner" and newer than "eldest"
+;;; If eldest is 0, all the subtasks spawned by "owner" are set to be cancelled.
+;;; The mutex thr->mut must be acquired before calling this function.
+;;; When there is any subtask set to be cancelled, set a cancel request flag to "thr".
+;;; (This flag is detected by polling and cncl messages are sent for flagged subtasks)
+;;; Returns # of subtasks that are set to be cancelled.
+(def (csym::set-cancelled thr owner eldest)
+    (csym::fn int (ptr (struct thread-data)) (ptr (struct task)) (ptr (struct task-home)))
+  (def cur (ptr (struct task-home)))
+  (def count int 0)
+  (for ((= cur thr->sub) cur (= cur cur->next))
+    (if (and (== cur->owner owner)
+	     (== cur->stat TASK-HOME-INITIALIZED) ; currently running?
+	     (== cur->msg-cncl 0))
+	(begin
+	  (= cur->msg-cncl 1)
+	  (inc count)))
+    (if (and eldest (== eldest cur->eldest))
+	(break))
+    )
+  (if count (= thr->req-cncl 1))
+  (return count))
+
 
 ;;; rslt message: a reply to a task message to send the result of the task
-;;; rslt <recipient>
+;;; rslt <recipient> <reason(0:normal,1:exception,2:abort)> <excption-tag>
 (def (csym::recv-rslt pcmd body) (csym::fn void (ptr (struct cmd)) (ptr void))
   (def rcmd (struct cmd))               ; rack command
   (def thr (ptr (struct thread-data)))
   (def hx (ptr (struct task-home)))
   (def tid (enum addr))
   (def sid int)
+  (def reason int)
+  (def exception-tag int)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; Check # of arguments
-  (if (< pcmd->c 1)
+  (if (< pcmd->c 2)
       (csym::proto-error "Wrong rslt" pcmd))
   ;; Extract the recipient worker id and the task-home id from <recipient>
-  ;; <recipient> = <worker-id>:<task-home-id>
-  (= tid (aref pcmd->v 0 0))
+  ;; <recipient> = [<rank-id(MPI mode)>:]<worker-id>:<task-home-id> 
+  (= tid (aref pcmd->v 0 (+ rank-p 0)))
   (if (not (< tid num-thrs))
       (csym::proto-error "wrong rslt-head" pcmd))
-  (= sid (aref pcmd->v 0 1))
+  (= sid (aref pcmd->v 0 (+ rank-p 1)))
   (if (== TERM sid)
       (csym::proto-error "Wrong rslt-head (no task-home-id)" pcmd))
   (= thr (+ threads tid))
-  
+  ;; Get <reason>
+  (= reason (aref pcmd->v 1 0))
+  ;; Get <exception-tag> (ignored when <reason> is not 1)
+  (= exception-tag (aref pcmd->v 2 0))
+
   (csym::pthread-mutex-lock (ptr thr->mut))
   ;; Determine the task-home entry whose id is <task-home-id>
   (if (not (= hx (csym::search-task-home-by-id sid thr->sub)))
       (csym::proto-error "Wrong rslt-head (specified task not exists)" pcmd))
-  ;; For an external rslt message, receive the body of the result by
-  ;; invoking the user-defined receiver method.
+  ;; If the rslt message is from external node and the task is normally exited,
+  ;; receive the body of thea result by invoking the user-defined receiver method.
   ;; (for an internal rslt, the body is passed as the argument)
   (cond
    ((== pcmd->node OUTSIDE)
+    (csym::set-rank-and-gid (aref hx->task-head 0) (+ 1 (+ (* (aref hx->task-head 0) num-thrs) (aref hx->task-head 1))))   
     ((aref rslt-receivers hx->task-no) hx->body)
-    (csym::read-to-eol))
+    ;; (csym::read-to-eol)
+    )
    ((== pcmd->node INSIDE)
     (= hx->body body))
    (else
@@ -711,9 +899,19 @@
 					; Set the recipient address 
                                         ; (same to the recipient of the task message)
 
-  ;; Change the status of the task-home entry and notify that to the worker
-  ;; that is waiting for the result.
-  (= hx->stat TASK-HOME-DONE)
+  ;; Change the status of the task-home entry 
+  (cond
+   ((== reason 0)
+    (= hx->stat TASK-HOME-DONE))
+   ((== reason 1)
+    (= hx->stat TASK-HOME-EXCEPTION)
+    (= hx->exception-tag exception-tag)
+    (inc hx->owner->cancellation)
+    (csym::set-cancelled thr hx->owner hx->eldest)
+    )
+   ((== reason 2)
+    (= hx->stat TASK-HOME-ABORTED)))
+  ;; Notify the worker waiting for the result.
   (if (== hx thr->sub)
       (begin
        (csym::pthread-cond-broadcast (ptr thr->cond-r))
@@ -722,9 +920,11 @@
   (csym::pthread-mutex-unlock (ptr thr->mut))
   (csym::send-command (ptr rcmd) 0 0))  ; Send the rack command
 
-;; The Thread 'thr' has the task specified by [<addr>,...,<ID>]x(INSIDE|OUTSIDE) ?
+
+;; If the worker 'thr' has the task whose return address is [<addr>,...,<ID>]x(INSIDE|OUTSIDE),
+;; return the pointer to the task object. Return 0 otherwise.
 (def (csym::have-task thr task-spec task-from) 
-    (csym::fn int (ptr (struct thread-data)) (ptr (enum addr)) (enum node))
+    (csym::fn (ptr (struct task)) (ptr (struct thread-data)) (ptr (enum addr)) (enum node))
   (def tx (ptr (struct task)))
   (= tx thr->task-top)
   (while tx
@@ -733,12 +933,11 @@
                  (== tx->stat TASK-STARTED))
              (== tx->rslt-to task-from)
              (csym::address-equal tx->rslt-head task-spec))
-        (return 1))
+        (return tx))
     (= tx tx->next))
   (return 0))
 
 
-(decl task-stat-strings (array (ptr char)))
 ;;; Check if the id-th worker can accept the task request 'pcmd'
 ;;; If ok, the worker allocate a task-home.
 (def (csym::try-treq pcmd id)
@@ -749,7 +948,8 @@
   (def thr (ptr (struct thread-data)))
   (def fail-reason int 0)
   (def avail int 0)
-
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
+  
   (= thr (+ threads id))
 
   (csym::pthread-mutex-lock (ptr thr->mut))
@@ -761,7 +961,7 @@
     (= fail-reason 1))                  ; a task message and, if received, may break data structures)
    ((not thr->task-top)                 ; having no task
     (= fail-reason 2))
-   ((== (aref dest-addr 0) ANY)         ; * for 'any' request...
+   ((== (aref dest-addr (+ rank-p 0)) ANY)             ; * for 'any' request...
     (if (not (or (== thr->task-top->stat TASK-STARTED) ; the task is not prepared for being divided
                  (== thr->task-top->stat TASK-INITIALIZED)))
         (= fail-reason 3)))
@@ -769,10 +969,13 @@
     (if (not (csym::have-task thr from-addr pcmd->node))
                                         ; the task is already finished
         (= fail-reason 4))))
-  (if (and (not fail-reason) (== (aref dest-addr 0) ANY))
+  (if (and (not fail-reason) (== (aref dest-addr (+ rank-p 0)) ANY))
     (if (< thr->probability (csym::my-random-probability thr))
       (= fail-reason 5)))
   (= avail (not fail-reason))
+  (csym::pthread-mutex-unlock (ptr thr->rack-mut))
+
+  ;; (Debug) Show the reason for refusing the task request
   (DEBUG-STMTS 2
     (if (not avail)
         (let ((from-str (array char BUFSIZE))
@@ -796,7 +999,6 @@
           (csym::fprintf 
            stderr "(%d): Thread %d refused treq from %s because %s.~%"
            (csym::get-universal-real-time) id from-str rsn-str))))
-  (csym::pthread-mutex-unlock (ptr thr->rack-mut))
 
   ;; If succeeded, push a task-home entry to the requestee's request queue.
   (if avail
@@ -807,7 +1009,7 @@
 	(= thr->treq-free hx->next)      ; Allocate an entry
 	(= hx->next thr->treq-top)       ; Set the next of the new entry to the former top
 	(= hx->stat TASK-HOME-ALLOCATED) ; Set the status of the new entry
-	(if (== (aref dest-addr 0) ANY)
+	(if (== (aref dest-addr (+ rank-p 0)) ANY)
 	    (= (aref hx->waiting-head 0) TERM)
 	  (csym::copy-address hx->waiting-head from-addr))
 	(csym::copy-address hx->task-head (aref pcmd->v 0)) ; Set the address of the recipient of the result
@@ -846,26 +1048,31 @@
     (return 0))))
 
 ;;; treq: a message to request a new task
-;;; treq <sender> <recipient(or "ANY")> 
+;;; treq <sender> <recipient(or [<rank-id>:]"ANY")> 
 ;;; Check whether the recipient can spawn a new task
-;;; (If <recipient> is "ANY", find a worker that can spawn a task)
+;;; (If <recipient> includes "ANY", find a worker that can spawn a task)
 ;;; If a task can be spawned, add a task request entry to the worker's request queue.
 ;;; (The worker will detect the request by polling and send a task message)
 ;;; If a task cannot be spawned, send a none message, or for "ANY" message from
 ;;; the 0-th worker in this node, forward the treq message to external nodes.
 (def (csym::recv-treq pcmd) (csym::fn void (ptr (struct cmd)))
   (def rcmd (struct cmd))
+  (def thr (ptr (struct thread-data)))
   (def dst0 (enum addr))
+  (def sender (array char BUFSIZE))             ; <sender> string (only for printing debug info)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; Check # of arguments
   (if (< pcmd->c 2)
       (csym::proto-error "Wrong treq" pcmd))
+  ;; Serialize <sender>
+  (csym::serialize-arg sender (aref pcmd->v 0))
   ;; Extract <recipient> from the message
-  (= dst0 (aref pcmd->v 1 0))
+  (= dst0 (aref pcmd->v 1 (+ rank-p 0)))
   (cond
    ;; ANY
    ((== dst0 ANY)
     (let ((myid int) (start-id int) (d int) (id int))
-      (= myid (aref pcmd->v 0 0))           ; extract <sender>
+      (= myid (aref pcmd->v 0 (+ rank-p 0)))  ; extract worker ID or "PARENT" in <sender>
       (= start-id (csym::choose-treq myid)) ; choose the first candidate worker
       (for ((= d 0) (< d num-thrs) (inc d))
         (= id (% (+ d start-id) num-thrs))  ; the candidate worker id
@@ -874,13 +1081,13 @@
             (continue))                     ; skip the treq sender
         (if (csym::try-treq pcmd id)        ; try and handle request for the id-th worker
             (begin
-             (DEBUG-PRINT 2 "(%d): treq(any) %d->%d... accepted.~%"
-                          (csym::get-universal-real-time) myid id)
+             (DEBUG-PRINT 2 "(%d): treq(any) %s->%d... accepted.~%"
+                          (csym::get-universal-real-time) sender id)
              (break)))
-        (DEBUG-PRINT 4 "(%d): treq(any) %d->%d... refused.~%"
-                     (csym::get-universal-real-time) myid id)
+        (DEBUG-PRINT 4 "(%d): treq(any) %s->%d... refused.~%"
+                     (csym::get-universal-real-time) sender id)
         )
-      (if (< d num-thrs)                    ; Return if the treq is accepted
+      (if (< d num-thrs)                    ; Return if the treq is accepted (by d-th worker)
           (return))))
    ;; An arbitrary worker (= stealing back request)
    (else
@@ -888,27 +1095,34 @@
         (csym::proto-error "Wrong task-head" pcmd))
     (if (csym::try-treq pcmd dst0)          ; try and handle request for the dst0-th worker
         (begin
-         (DEBUG-STMTS 2
-                      (let ((buf1 (array char BUFSIZE)))
-                        (csym::fprintf stderr "(%d): treq %s->%d (stealing back)... accepted.~%"
-                                       (csym::get-universal-real-time)
-                                       (exps (csym::serialize-arg buf1 (aref pcmd->v 0)) buf1) dst0)))
-         (return)))                         ; Return if the treq is accepted
-    (DEBUG-STMTS 2
-                 (let ((buf1 (array char BUFSIZE)))
-                   (csym::fprintf stderr "(%d): treq %s->%d (stealing back)... refused.~%"
-                                  (csym::get-universal-real-time)
-                                  (exps (csym::serialize-arg buf1 (aref pcmd->v 0)) buf1) dst0))))
-   )
+	  (DEBUG-PRINT 2 "(%d): treq %s->%d (stealing back)... accepted.~%"
+		       (csym::get-universal-real-time) sender dst0)
+	  (return)))                         ; Return if the treq is accepted
+    (DEBUG-PRINT 2 "(%d): treq %s->%d (stealing back)... refused.~%"
+		 (csym::get-universal-real-time) sender dst0)
+    ))
   ;; The following is executed when no worker accepted the request
-  (if (and (== dst0 ANY)                 ; <recipient> is "ANY"
-           (== pcmd->node INSIDE)        ; internal treq
-           (== (aref pcmd->v 0 0) 0))    ; treq from 0-th worker
-      ;; Forward the treq to external nodes and return
-      (begin
-	(= pcmd->node OUTSIDE)
-	(csym::send-command pcmd 0 0)
-	(return)))
+  (if (and (== dst0 ANY)                         ; <recipient> is "ANY"
+           (== pcmd->node INSIDE)                ; internal treq
+           (== (aref pcmd->v 0 (+ rank-p 0)) 0)) ; treq from 0-th worker
+      ;; Submit initial task if exists
+      (if (and receive-buf
+	       (< sv-socket 0)
+	       (== my-rank 0))
+	  (begin
+	    (csym::send-block-start)
+	    (csym::send-string receive-buf sv-socket)
+	    (csym::send-block-end my-rank)
+	    (csym::free receive-buf)
+	    (= receive-buf 0)
+	    (return))
+	;; Forward the treq to external nodes and return
+	(begin
+	  (= pcmd->node OUTSIDE)
+	  (if (< sv-socket 0)     ; set rank ID (MPI mode)
+	      (= (aref pcmd->v 1 0) (csym::choose-rank)))
+	  (csym::send-command pcmd 0 0)
+	  (return))))
   ;; Reply with a none message
   (= rcmd.c 1)
   (= rcmd.node pcmd->node)              ; internal or external
@@ -923,11 +1137,12 @@
   (def tx (ptr (struct task)))
   (def thr (ptr (struct thread-data)))
   (def id (enum addr))
-  (def len size-t)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; Check # of arguments
   (if (< pcmd->c 1)
       (csym::proto-error "Wrong rack" pcmd))
-  (= id (aref pcmd->v 0 0))
+  ;; Extract recipient worker ID
+  (= id (aref pcmd->v 0 (+ rank-p 0)))
   (if (not (< id num-thrs))
       (csym::proto-error "Wrong task-head" pcmd))
   (= thr (+ threads id))
@@ -937,285 +1152,6 @@
   (dec thr->w-rack)
   (csym::pthread-mutex-unlock (ptr thr->rack-mut)))
 
-
-;;;; NOTE: currentry the implementation of data-dreq mechanism is incomplete.
-
-;; The pointer to thevarray of existence flags (initialozed in setup-data())
-(def data-flags (ptr (enum DATA-FLAG)) 0)
-;; The lock and condition variable for data-flags
-(def data-mutex pthread-mutex-t)
-(def data-cond  pthread-cond-t)
-
-;; A built-in function of Tascell: initialize data (n: size)
-(def (csym::-setup-data n) (csym::fn void int)
-  (def i int)
-  (def tmp (ptr (enum DATA-FLAG)))
-
-  (if data-flags (return))
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  ;; Initialize data-flags
-  (if (not data-flags)
-      (begin
-       (= tmp (cast (ptr (enum DATA-FLAG)) (csym::malloc (* n (sizeof (enum DATA-FLAG))))))
-       (for ((= i 0) (< i n) (inc i))
-            (= (aref tmp i) DATA-NONE))
-       (= data-flags tmp)))
-  ;; Allocate data by invoking a user-defined method
-  (csym::data-allocate n)
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  (return))
-
-;; For each on-demand data element in the range [start,end), send pcmd if it is NONE and
-;; pcmd-fwd if it is REQUESTING. Then, update the status of NONE elements to REQUESTING.
-;; pcmd and pcmd-fwd are pointers to dreq commands to which arguments except the third
-;; argument, which indicates the data range, are set.
-;; If pcmd or pcmd-fwd is NULL, sending the corresponding message is skipped.
-(def (csym::send-dreq-for-required-range start end pcmd pcmd-fwd)
-    (csym::fn void int int (ptr (struct cmd)) (ptr (struct cmd)))
-  (defs int i j)
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  (for ((= i start) (< i end) (inc i))
-    (cond
-     ((== (aref data-flags i) DATA-NONE)
-      (= (aref data-flags i) DATA-REQUESTING)
-      (for ((= j (+ i 1)) (and (< j end) (== (aref data-flags j) DATA-NONE)) (inc j))
-        (= (aref data-flags j) DATA-REQUESTING))
-      ;; Send a data request (pcmd) for [i,j)
-      (if pcmd
-          (begin
-            (= (aref pcmd->v 2 0) i)  (= (aref pcmd->v 2 1) j)
-            (= (aref pcmd->v 2 2) TERM)
-            (csym::send-command pcmd 0 0)))
-      (= i (- j 1)))     ; Continue from the next location of the requested range
-     ((== (aref data-flags i) DATA-REQUESTING)
-      (for ((= j (+ i 1)) (and (< j end) (== (aref data-flags j) DATA-REQUESTING)) (inc j))
-        )
-      ;; Send a data request (pcmd-fwd) for [i,j)
-      (if pcmd-fwd
-          (begin
-            (= (aref pcmd-fwd->v 2 0) i)  (= (aref pcmd-fwd->v 2 1) j)
-            (= (aref pcmd-fwd->v 2 2) TERM)
-            (csym::send-command pcmd-fwd 0 0)))
-      (= i (- j 1)))     ; Continue from the next location of the requested range
-     ))
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  )
-
-;; Find the task of the tid-th worker that generated the task-home entry whose id is sid.
-;; If the task is sent from external node, output its address to "head".
-;; Otherwise, find the task-home entry in another worker and repeat this search step.
-(def (csym::get-first-outside-ancestor-task-address head tid sid) (csym::fn int (ptr (enum addr)) int int)
-  (def thr (ptr (struct thread-data)))
-  (def hx (ptr (struct task-home)))
-  (def ok int)
-  (do-while 1
-    ;; thr: the tid-th worker thread
-    (= thr (+ threads tid))
-    (csym::pthread-mutex-lock (ptr thr->mut))
-    ;; hx: the task-home entry of the tid-th worker whose id is sid.
-    (if (not (= hx (csym::search-task-home-by-id sid thr->sub)))
-        (csym::fprintf stderr "Error in get-first-outside-ancestor-task-address (specified task not exists)~%"))
-    ;; hx->owner: the task that generated the hx entry
-    (cond
-     ((not hx->owner)                   ; Error occurs if there is no parent
-      (csym::fprintf stderr "error in get-first-outside-ancestor-task-address: no owner found.~%")
-      (csym::print-status 0)
-      (csym::exit 1))
-     ((== hx->owner->rslt-to OUTSIDE)   ; If hx->owner is sent from external node, output its address
-      (csym::copy-address head hx->owner->rslt-head)
-      (break)))
-    ;; If hx->owner is sent from a worker in the same node,
-    ;; get its worker id and task-home id, and repeat the search step
-    (= tid (aref hx->owner->rslt-head 0))
-    (= sid (aref hx->owner->rslt-head 1))
-    (csym::pthread-mutex-unlock (ptr thr->mut))
-    )
-  (return ok))
-
-;; Tascell user function: request data of the range [start,end) to the parent task
-(def (csym::-request-data thr start end) (csym::fn void (ptr (struct thread-data)) int int)
-  (def cmd (struct cmd))
-  (def tx (ptr (struct task)))
-  (DEBUG-PRINT 2 "request-data: %d--%d start~%" start end)
-  (csym::pthread-mutex-lock (ptr thr->mut))
-  (= tx thr->task-top)                  ; the task being executed by thr
-  (csym::pthread-mutex-unlock (ptr thr->mut))
-  ;; Generate a template for dreq commands
-  (= cmd.w DREQ)
-  (= cmd.c 3)
-  ;; Sender address
-  (= (aref cmd.v 0 0) 0)  (= (aref cmd.v 0 1) TERM)
-  ;; Rcipient address: search ancestor tasks for the first task in an external node
-  (if (== OUTSIDE tx->rslt-to)
-      (csym::copy-address (aref cmd.v 1) tx->rslt-head)
-    (csym::get-first-outside-ancestor-task-address
-     (aref cmd.v 1) (aref tx->rslt-head 0) (aref tx->rslt-head 1)))
-  (= cmd.node OUTSIDE)
-
-  (DEBUG-STMTS 2
-               (= (aref cmd.v 2 0) TERM)
-               (csym::proto-error "dreq template" (ptr cmd)))
-  
-  ;; Send dreq commands for necessary ranges
-  (csym::send-dreq-for-required-range start end (ptr cmd) 0)
-  (DEBUG-PRINT 2 "request-data: %d--%d end~%" start end)
-  (return)
-  )
-
-;; Tascell user function: wait until data of the range [stard,end) reach
-(def (csym::-wait-data start end) (csym::fn void int int)
-  (def i int)
-  (DEBUG-PRINT 2 "wait-data: %d--%d start~%" start end)
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  (for ((= i start) (< i end) (inc i))
-    (while (!= (aref data-flags i) DATA-EXIST)
-      (csym::pthread-cond-wait (ptr data-cond) (ptr data-mutex))))
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  (DEBUG-PRINT 2 "wait-data: %d--%d end~%" start end)
-  )
-
-;; Set the data-flag of the range [start,end) to DATA-EXIST
-(def (csym::-set-exist-flag start end) (csym::fn void int int)
-  (def i int)
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  (for ((= i start) (< i end) (inc i))
-    (= (aref data-flags i) DATA-EXIST))
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  )
-
-
-
-;; The main function of a data request handler thread
-(def (csym::dreq-handler parg0) (csym::fn (ptr void) (ptr void))
-  (def parg (ptr (struct dhandler-arg)) parg0)
-  (def start int parg->start)
-  (def end int parg->end)
-  (def pcmd (ptr (struct cmd)) (ptr parg->dreq-cmd))
-  (def pcmd-fwd (ptr (struct cmd)) (ptr parg->dreq-cmd-fwd))
-  (def data-cmd (struct cmd))
-  (defs int i j)
-
-  (%ifdef* VERBOSE (inc n-dreq-handler))
-   
-  #+comment
-  (DEBUG-STMTS 1 (= (aref pcmd->v 2 0) TERM)
-               (csym::fprintf stderr "dreq-handler: %d %d~%" start end)
-               (csym::proto-error "template" pcmd))
-  
-  ;; Send pcmd for subranges whose flags are "NONE" (not exist in this node)
-  ;; Send pcmd-fwd for for subranges whose flags are "REQUESTING" (not exist
-  ;; in this node but already requesting to another node)
-  (%ifdef* VERBOSE (inc n-sending-dreq))
-  (csym::send-dreq-for-required-range start end pcmd pcmd-fwd)
-  (%ifdef* VERBOSE (dec n-sending-dreq))
-  
-  ;; Ignore dreq command from a worker in the same node
-  (if (== parg->data-to INSIDE)
-      (begin
-       (%ifdef* VERBOSE (dec n-dreq-handler))
-       (return)))
-
-  ;; Generate a template for "data" commands
-  (= data-cmd.w DATA)
-  (= data-cmd.c 2)
-  (= data-cmd.node parg->data-to)       ; internal or external
-  (csym::copy-address (aref data-cmd.v 0) parg->head) ; recipient address
-  
-  ;; Wait for data by cond-wait and send as "data" messages
-  (%ifdef* VERBOSE (inc n-sending-data))
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  (for ((= i start) (< i end) (inc i))
-    (while (!= (aref data-flags i) DATA-EXIST)
-      (%ifdef* VERBOSE (inc n-waiting-data))
-      (csym::pthread-cond-wait (ptr data-cond) (ptr data-mutex))
-      (%ifdef* VERBOSE (dec n-waiting-data)) )
-    (for ((= j (+ i 1)) (and (< j end) (== (aref data-flags j) DATA-EXIST)) (inc j))
-      )
-    ;; Send a "data" message for [i,j) (the data body is sent in send-cmmand())
-    (csym::assert (< i j))
-    (= (aref data-cmd.v 1 0) i)  (= (aref data-cmd.v 1 1) j)
-    (= (aref data-cmd.v 1 2) TERM)
-    (csym::send-command (ptr data-cmd) 0 0)
-    (= i (- j 1)))
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  (%ifdef* VERBOSE (dec n-sending-data))
-  
-  (csym::free parg)
-  (%ifdef* VERBOSE (dec n-dreq-handler))
-  (return))
-
-;; dreq: request dreq handler of an external node to send data of the specified range
-;; dreq <sender> <recipient> <range("start:end" indicating [start,end))>
-(def (csym::recv-dreq pcmd) (csym::fn void (ptr (struct cmd)))
-  (def tx (ptr (struct task)))
-  (def tid (enum addr))
-  (def sid int)
-  (def parg (ptr (struct dhandler-arg)))
-  (def len size-t)
-  ;; Check # of arguments
-  (if (< pcmd->c 3) (csym::proto-error "Wrong dreq" pcmd))
-  
-  ;; Set arguments for dreq-handler
-  (= parg (cast (ptr (struct dhandler-arg)) (csym::malloc (sizeof (struct dhandler-arg)))))
-  (= parg->data-to pcmd->node)          ; internal or external
-  (csym::copy-address parg->head (aref pcmd->v 0)) ; the recipient address of "data"
-  ;; parg->dreq-cmd: a template for dreq messages when requested data are "DATA-NONE".
-  ;; <Range> is set later
-  (= parg->dreq-cmd.w DREQ)
-  (= parg->dreq-cmd.c 3)
-  (= (aref parg->dreq-cmd.v 0 0) 0)     ; <sender> (dummy)
-  (= (aref parg->dreq-cmd.v 0 1) TERM)  ; <sender> (dummy)
-  (begin                                ; set the <recipient>
-    (= tid (aref pcmd->v 1 0))
-    (if (not (< tid num-thrs)) (csym::proto-error "wrong dreq-head" pcmd))
-    (= sid (aref pcmd->v 1 1))
-    (if (== TERM sid) (csym::proto-error "Wrong dreq-head (no task-home-id)" pcmd))
-    ;; Search ancestors for the first external task and set the address of the task-home
-    ;; entry corresponding to the task
-    (csym::get-first-outside-ancestor-task-address (aref parg->dreq-cmd.v 1) tid sid)
-    )
-  (= parg->dreq-cmd.node OUTSIDE)
-  ;; parg->dreq-cmd-fwd: a template for dreq messages when requested data are "DATA-REQUESTING".
-  ;; <Range> is set later
-  (= parg->dreq-cmd-fwd.w DREQ)
-  (= parg->dreq-cmd-fwd.c 3)
-  (= (aref parg->dreq-cmd-fwd.v 0 0) FORWARD)       ; <sender>
-  (csym::copy-address (ptr (aref parg->dreq-cmd-fwd.v 0 1))
-                      (aref pcmd->v 0))
-  (csym::copy-address (aref parg->dreq-cmd-fwd.v 1) ; <recipient> (same as dreq-cmd)
-                      (aref parg->dreq-cmd.v 1))
-  (= parg->dreq-cmd-fwd.node OUTSIDE)
-  ;; Extract start and end from <range>
-  (= parg->start (aref pcmd->v 2 0))
-  (= parg->end   (aref pcmd->v 2 1))
-  
-  ;; Invoke dreq-handler asynchronously
-  (begin
-    (def tid pthread-t)
-    (csym::pthread-create (ptr tid) 0 csym::dreq-handler parg))
-  (return))
-
-
-;; data: reply to a dreq message with data
-;; data <recipient> <range("<start>:<end>" indicating [start,end))>
-(def (csym::recv-data pcmd) (csym::fn void (ptr (struct cmd)))
-  (def i int)
-  (def start int (aref pcmd->v 1 0))
-  (def end int (aref pcmd->v 1 1))
-  ;; Check # of arguments
-  (if (< pcmd->c 2) (csym::proto-error "Wrong data" pcmd))
-  ;; Ignore an internal "data" message
-  (if (== pcmd->node INSIDE) (return))
-  ;; Receive data by invoking a user-defined receiver method
-  (csym::pthread-mutex-lock (ptr data-mutex))
-  (csym::data-receive start end)
-  (csym::read-to-eol)
-  (for ((= i start) (< i end) (inc i))
-    (= (aref data-flags i) DATA-EXIST))
-  (csym::pthread-cond-broadcast (ptr data-cond))
-  (csym::pthread-mutex-unlock (ptr data-mutex))
-  (return))
-
 
 ;;; bcst: send data to all nodes
 ;;; bcst <sender> <data-kind>
@@ -1228,9 +1164,10 @@
       (csym::proto-error "wrong-task" pcmd))
   ;; Extract <data-kind>
   (= task-no (aref pcmd->v 1 0))
-  ;; (Allocate and) receive data body by invoking the user-defined 
-  ;; receiver method associated with the <data-kind> number
-  (= body ((aref task-receivers task-no)))
+  ;; Allocate and receive data body by invoking the allocator and
+  ;; (user-defined) receiver methods associated with the <data-kind> number
+  (= body ((aref task-allocators task-no)))
+  ((aref task-receivers task-no) body)
   (csym::read-to-eol)
   ;; NOTE: here the "body" object is deallocated immediately
   ;; after the receiver method finished. The data that need to be
@@ -1244,101 +1181,47 @@
   (csym::copy-address (aref rcmd.v 0) (aref pcmd->v 0))
   (csym::send-command (ptr rcmd) 0 task-no))
 
-;;; leav: a message from a computing node to indicate the node
-;;; will leave from the Tascell network.
-;;; Here, a message handler just outputs error message because
-;;; a leav message from a Tascell server should not be sent.
-(def (csym::recv-leav pcmd) (csym::fn void (ptr (struct cmd)))
-  (csym::fprintf stderr "Leav from server is unexpected.~%"))
-
 
-;;; Cancel all worker threads after acquiring all threads' locks
-(def (csym::cancel-workers) (csym::fn void void)
-  (def i int 0)
-  (def thr (ptr (struct thread-data)))
-  (for ((= i 0) (< i num-thrs) (inc i))
-    (= thr (ptr (aref threads i)))
-    (csym::pthread-mutex-lock (ptr thr->mut))
-    (csym::pthread-mutex-lock (ptr thr->rack-mut)))
-  (for ((= i 0) (< i num-thrs) (inc i))
-    (= thr (ptr (aref threads i)))
-   (csym::pthread-cancel thr->pthr-id)
-   (csym::fprintf stderr "Cancelled worker %d~%" i))
-  (return))
-
-;;; lack: a reply to a leav message
-(def (csym::recv-lack pcmd) (csym::fn void (ptr (struct cmd)))
-  (def cur (ptr (struct task)))
-  (def task-top (ptr (struct task))) 
-  (def thr (ptr (struct thread-data)))
-  (def i int)
-  (def rcmd (struct cmd))
-  ;; Prevent workers from sending out messages.
-  (csym::pthread-mutex-lock (ptr send-mut))
-  ;; Prevent workers from modifying their own information (task stacks etc.)
-  (csym::cancel-workers)
-  (for ((= i 0) (< i num-thrs) (inc i))
-    (= thr (ptr (aref threads i)))
-    (= task-top thr->task-top)
-    (for ((= cur task-top) cur (= cur cur->next))
-      (= rcmd.w ABRT)
-      (= rcmd.c 1)
-      (= rcmd.node cur->rslt-to)        ; external or internal
-      (csym::copy-address (aref rcmd.v 0) cur->rslt-head)
-      (csym::send-command (ptr rcmd) 0 0))
-    (csym::print-thread-status thr))
-  ;; all command check
-  (csym::exit 0))
-
-;;; abrt: reply to a task message without the result
-;;; abrt <recipient("<worker-id>:<task-home-id>")>
-(def (csym::recv-abrt pcmd) (csym::fn void (ptr (struct cmd)))
-  (def rcmd (struct cmd))               ; rack message
-  (def thr (ptr (struct thread-data)))
-  (def hx (ptr (struct task-home)))
-  (def tid (enum addr))
-  (def sid int)
+;;; cncl: set a cancellation flag to the recipient task
+;;; cncl <sender> <recipient>
+(def (csym::recv-cncl pcmd) (csym::fn void (ptr (struct cmd)))
+  (def from-addr (ptr (enum addr)))    ; return address of the task to be cancelled (search key)
+  (def dst0 (enum addr))               ; ID of recipient worker
+  (def thr (ptr (struct thread-data))) ; recipient worker thread
+  (def tx (ptr (struct task)))         ; task to be cancelled
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; Check # of arguments
-  (if (< pcmd->c 1)
-      (csym::proto-error "Wrong abrt" pcmd))
-  ;; Extract <worker-id> and <task-home-id> from <recipients>
-  (= tid (aref pcmd->v 0 0))
-  (if (not (< tid num-thrs))
-      (csym::proto-error "Wrong abrt-head" pcmd))
-  (= sid (aref pcmd->v 0 1))
-  (if (== TERM sid)
-      (csym::proto-error "Wrong abrt-head (no task-home-id)" pcmd))
-  (= thr (+ threads tid))
-  
+  (if (< pcmd->c 2)
+      (csym::proto-error "Wrong cncl" pcmd))
+  ;; Get <sender> from the message
+  (= from-addr (aref pcmd->v 0))
+  ;; Extract <recipient> from the message
+  (= dst0 (aref pcmd->v 1 (+ rank-p 0)))
+  (if (not (and (<= 0 dst0) (< dst0 num-thrs)))   ; Range check of <recipient>
+      (csym::proto-error "Wrong cncl-head" pcmd))
+  (= thr (+ threads dst0))
+
   (csym::pthread-mutex-lock (ptr thr->mut))
-  ;; Find the task-home entry corresponding to the abrt message.
-  ;; (the task-home entry whose .id is sid)
-  (if (not (= hx (csym::search-task-home-by-id sid thr->sub)))
-      (csym::proto-error "Wrong abrt-head (specified task not exists)" pcmd))
-  
-  (= hx->stat TASK-HOME-ABORTED)
-  (if (== hx thr->sub)
-      (begin
-	(csym::pthread-cond-broadcast (ptr thr->cond-r))
-	(csym::pthread-cond-broadcast (ptr thr->cond)))
-    )
+  (if (= tx (csym::have-task thr from-addr pcmd->node))  ; Check whether the recipient task exists
+      (begin 
+	(inc tx->cancellation)
+	(csym::set-cancelled thr tx 0)
+	(DEBUG-PRINT 1 "Task %p of worker %d is cancelled by cncl~%" tx dst0)))
   (csym::pthread-mutex-unlock (ptr thr->mut))
-  (csym::send-command (ptr rcmd) 0 0))  ; Send rack
-
-;;; cncl
-(def (csym::recv-cncl pcmd) (csym::fn void (ptr (struct cmd)))
-  (csym::exit 0))
+)
 
+
 ;;; bcak: ack message to bcst
 ;;; bcak <recipient>
 (def (csym::recv-bcak pcmd) (csym::fn void (ptr (struct cmd)))
   (def thr (ptr (struct thread-data)))
   (def id (enum addr))
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; Check # of arguments
   (if (< pcmd->c 1)
     (csym::proto-error "wrong-task" pcmd))
   ;; extract <recipient> (= worker ID) from the 1st argument
-  (= id (aref pcmd->v 0 0))
+  (= id (aref pcmd->v 0 (+ rank-p 0)))
   (= thr (+ threads id))
   ;; decrease bcak counter and notify
   (csym::pthread-mutex-lock (ptr thr->mut))
@@ -1348,8 +1231,6 @@
 
 
 ;;; Print information of a task entry in human-friendly style
-(def task-stat-strings (array (ptr char)) ; consistent with (enum task-stat) definition
-  (array "TASK-ALLOCATED" "TASK-INITIALIZED" "TASK-STARTED" "TASK-DONE" "TASK-NONE" "TASK-SUSPENDED"))
 (def (csym::node-to-string buf node) (csym::fn void (ptr char) (enum node))
   (switch node
     (case INSIDE)   (csym::strcpy buf "INSIDE")      (break)
@@ -1366,38 +1247,40 @@
   (defs (array char BUFSIZE) buf1 buf2)
   (csym::fprintf stderr "%s= {" name)
   (for ((= cur task-top) cur (= cur cur->next))
-    (csym::fprintf stderr "{stat=%s, task-no=%d, body=%p, ndiv=%d, rslt-to=%s, rslt-head=%s}, "
-                   (aref task-stat-strings cur->stat) cur->task-no cur->body cur->ndiv
+    (csym::fprintf stderr "{stat=%s, task-no=%d, body=%p, ndiv=%d, cancellation=%d, rslt-to=%s, rslt-head=%s}, "
+                   (aref task-stat-strings cur->stat) cur->task-no cur->body cur->ndiv cur->cancellation
                    (exps (csym::node-to-string buf1 cur->rslt-to) buf1)
                    (exps (csym::serialize-arg buf2 cur->rslt-head) buf2)))
   (csym::fprintf stderr "}, ")
   (return))
 
 ;;; Print information of a task-home entry in human-friendly style
-(def task-home-stat-strings (array (ptr char)) ; consistent with (enum task-home-stat) definition
-  (array "TASK-HOME-ALLOCATED" "TASK-HOME-INITIALIZED" "TASK-HOME-DONE"))
 (def (csym::print-task-home-list treq-top name) (csym::fn void (ptr (struct task-home)) (ptr char))
   (def cur (ptr (struct task-home)))
   (defs (array char BUFSIZE) buf0 buf1 buf2)
   (csym::fprintf stderr "%s= {" name)
   (for ((= cur treq-top) cur (= cur cur->next))
-    (csym::fprintf stderr "{stat=%s, id=%d, waiting=%s, owner=%p, task-no=%d, body=%p, req-from=%s, task-head=%s}, "
+    (csym::fprintf stderr "{stat=%s, id=%d, exception-tag=%d, msg-cncl=%d, waiting=%s, owner=%p, eldest=%p(%d), task-no=%d, body=%p, req-from=%s, task-head=%s}, "
                    (aref task-home-stat-strings cur->stat) cur->id
+		   cur->exception-tag cur->msg-cncl
                    (exps (csym::serialize-arg buf0 cur->waiting-head) buf0)
-                   cur->owner cur->task-no cur->body
+                   cur->owner
+                   cur->eldest (if-exp cur->eldest cur->eldest->id 0)
+		   cur->task-no cur->body
                    (exps (csym::node-to-string buf1 cur->req-from) buf1)
                    (exps (csym::serialize-arg buf2 cur->task-head) buf2)))
   (csym::fprintf stderr "}, ")
   (return))
 
 ;;; Print the status of a worker in human-friendly style
-(def choose-strings (array (ptr char)) (array "CHS-RANDOM" "CHS-ORDER")) ; consistent with (enum choose)
 (def (csym::print-thread-status thr) (csym::fn void (ptr (struct thread-data)))
-  (csym::fprintf stderr "<Thread %d>~%" thr->id)
+  (csym::fprintf stderr "*** Worker %d ***~%" thr->id)
   (csym::fprintf stderr "req=%p, " thr->req)
   (csym::fprintf stderr "w-rack=%d, " thr->w-rack)
   (csym::fprintf stderr "w-none=%d, " thr->w-none)
   (csym::fprintf stderr "ndiv=%d, " thr->ndiv)
+  (csym::fprintf stderr "exiting=%s, " (aref exiting-rsn-strings thr->exiting))
+  (csym::fprintf stderr "exception-tag=%d, " thr->exception-tag)
   (csym::fprintf stderr "probability=%lf, " thr->probability)
   (csym::fprintf stderr "last-treq=%d, " thr->last-treq)
   (csym::fprintf stderr "last-choose=%s, " (aref choose-strings thr->last-choose))
@@ -1421,10 +1304,6 @@
                  (if-exp option.node-name option.node-name "Unnamed"))
   (csym::fprintf stderr "num-thrs: %d~%" num-thrs)
   (csym::fprintf stderr "verbose-level: %d~%" option.verbose)
-  (%ifdef* VERBOSE
-    (csym::fprintf stderr
-                   "active dreq-handlers: %d (%d sending dreq, %d sending data (%d waiting data))~%"
-                   n-dreq-handler n-sending-dreq n-sending-data n-waiting-data))
 
   (for ((= i 0) (< i num-thrs) (inc i))
     (csym::print-thread-status (ptr (aref threads i))))
@@ -1452,30 +1331,116 @@
 
 
 ;; Start temporary backtracking to spawn tasks
+;; Called from handle-reqs after acquiring -thr->mut
 (def (handle-req -bk -thr)
     (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)))
-  (csym::pthread-mutex-lock (ptr -thr->mut))
-  (if -thr->req
+  (if (and -thr->req
+	   (not -thr->task-top->cancellation))
+      (begin
+	(= -thr->exiting EXITING-SPAWN)
+	(PROF-CODE
+	 (csym::tcounter-change-state -thr TCOUNTER-SPWN OBJ-NULL 0))
+	(-bk)
+	(PROF-CODE
+	 (csym::tcounter-change-state -thr TCOUNTER-EXEC OBJ-NULL 0))
+	(= -thr->exiting EXITING-NORMAL)
+	(= -thr->req -thr->treq-top) ))
+  )
+
+;; Send a cncl message for each flagged subtask spawned by "thr"
+;; The mutex thr->mut must be acquired before calling.
+;; Returns # of sent cncl messages.
+(def (csym::send-cncl-for-flagged-subtasks thr)
+    (csym::fn int (ptr (struct thread-data)))
+  (def rcmd (struct cmd))               ; for CNCL command
+  (def cur (ptr (struct task-home)))
+  (def count int 0)
+  (= rcmd.w CNCL)
+  (= rcmd.c 2)
+  (= (aref rcmd.v 0 0) thr->id)
+  (= (aref rcmd.v 0 2) TERM)
+  (for ((= cur thr->sub) cur (= cur cur->next))
+    (if (and (== cur->msg-cncl 1)
+	     (== cur->stat TASK-HOME-INITIALIZED))
+	(begin
+	  (= rcmd.node cur->req-from)
+	  (= (aref rcmd.v 0 1) cur->id)                       ; <sender>=<thread-id>:<task-home-id>
+	  (csym::copy-address (aref rcmd.v 1) cur->task-head) ; <recipient>
+	  (csym::send-command (ptr rcmd) 0 0)
+	  (= cur->msg-cncl 2)
+	  (PROF-CODE
+	   (csym::evcounter-count thr (if-exp (== rcmd.node INSIDE) EV-SEND-CNCL-INSIDE EV-SEND-CNCL-OUTSIDE)
+                                  OBJ-PADDR cur->task-head))
+	  (inc count) )))
+  (return count) )
+
+;; Check -thr's subtask queue and send a cncl message for each flagged subtask
+;; Called from handle-reqs after acquiring -thr->mut
+(def (handle-req-cncl -bk -thr)
+    (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)))
+  (if -thr->req-cncl
       (begin
-       (-bk)
-       (= -thr->req -thr->treq-top)))
-  (csym::pthread-mutex-unlock (ptr -thr->mut)))
+	(DEBUG-PRINT 1 "(%d): (Thread %d) detected cncl message request~%"
+		     (csym::get-universal-real-time) -thr->id)
+	(csym::send-cncl-for-flagged-subtasks -thr)
+	(= -thr->req-cncl 0) ))
+  )
 
-;; Start propagating an exception
+;; Start propagating an exception. Invoked by a Tascell throw statement.
 (def (handle-exception -bk -thr excep)
-    (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)) long)
-  (= -thr->exiting 1)
+    (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)) int)
+  (= -thr->exiting EXITING-EXCEPTION)
   (= -thr->exception-tag excep)
-  (-bk)) ; never returns
+  (PROF-CODE
+   (csym::tcounter-change-state -thr TCOUNTER-EXCP OBJ-INT (cast (ptr void) (cast long excep))))
+  (-bk) ; never returns
+  (csym::perror "Unexpectedly returned from backtracking for an exception.")
+  )
+
+;; Check (partial) cancellation lags and abort if needed.
+;; Called from handle-reqs after acquiring -thr->mut
+(def (handle-cancellation -bk -thr)
+    (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)))
+  (if -thr->task-top->cancellation
+      (begin
+	(DEBUG-PRINT 1 "(%d): (Thread %d) detected cancellation flag (%d)~%" 
+		     (csym::get-universal-real-time) -thr->id -thr->task-top->cancellation)
+	(= -thr->exiting EXITING-CANCEL)
+	(PROF-CODE
+	 (csym::tcounter-change-state -thr TCOUNTER-ABRT
+				      OBJ-INT (cast (ptr void) (cast long -thr->task-top->cancellation))))
+	(csym::pthread-mutex-unlock (ptr -thr->mut))
+	(-bk)  ; never returns
+	(csym::perror "Unexpectedly returned from backtracking for abortion.")
+	)))
+
+;; Called when at least one of the request flags:
+;; * -thr->req
+;; * -thr->req-cncl
+;; * -thr->task-top->cancellation
+;; are found to be raised by checking without acquiring -thr->mut.
+;; Calls these request handlers after aquiring this mutex lock.
+(def (handle-reqs -bk -thr)
+    (fn void (ptr (NESTFN int void)) (ptr (struct thread-data)))
+  (csym::pthread-mutex-lock (ptr -thr->mut))
+  (handle-req -bk -thr)            ; request for spawning tasks
+  (handle-req-cncl -bk -thr)       ; request for sending CNCL messages
+  (handle-cancellation -bk -thr)   ; request for aborting the task being executed
+  (csym::pthread-mutex-unlock (ptr -thr->mut))
+  )
+  
 
 ;; Make a task message and send it.
 ;; (The recipient is determined by the top of the task request stack)
 ;; Called by a worker thread ("thr") after initializing the task object
 ;; in :put section ("body"). The thr->mut should have been acquired.
-(def (csym::make-and-send-task thr task-no body)
-    (csym::fn void (ptr (struct thread-data)) int (ptr void))
+;; If "eldest-p" is non-zero, the task is the first one among tasks
+;; spawned in a parallel region.
+(def (csym::make-and-send-task thr task-no body eldest-p)
+    (csym::fn void (ptr (struct thread-data)) int (ptr void) int)
   (def tcmd (struct cmd))
   (def hx (ptr (struct task-home)) thr->treq-top)
+  (def rank-p int (if-exp (< sv-socket 0) 1 0)) ; 1 if MPI rank is contained in addresses
   ;; (csym::fprintf stderr "make-and-send-task(%d)~%" thr->id)
   ;; Pop a task-home entry from the worker's task request queue and push it to the worker's subtask stack
   (= thr->treq-top hx->next)            ; top of request queue <-- 2nd entry of the queue
@@ -1487,7 +1452,9 @@
   (= hx->id (if-exp hx->next            ; the subtask ID (= height_of_the_stack + 1)
                     (+  hx->next->id 1)
                     0))
-  (= hx->owner thr->task-top)           ; the parent task (= the top of the task stack)
+  (= hx->owner thr->task-top)           ; the parent task (= current top of the task stack)
+  (= hx->eldest (if-exp eldest-p hx hx->next->eldest))
+  (= hx->msg-cncl 0)                    ; initialize flag to be cancelled
   (= hx->stat TASK-HOME-INITIALIZED)    ; ALLOCATED => INITIALIZED
   ;; Make a task message
   (= tcmd.c 4)                          ; # of arguments
@@ -1495,12 +1462,18 @@
   (= tcmd.w TASK)                       ; message kind = TASK
   (= (aref tcmd.v 0 0) (++ thr->ndiv))  ; # of task division
   (= (aref tcmd.v 0 1) TERM)
-  (= (aref tcmd.v 1 0) thr->id)         ; sender: <worker-id>
-  (= (aref tcmd.v 1 1) hx->id)          ; sender: <subtask-id>
-  (= (aref tcmd.v 1 2) TERM)
+  (if rank-p
+      (= (aref tcmd.v 1 0) my-rank))    ; sender: <rank-id> (MPI mode)
+  (= (aref tcmd.v 1 (+ rank-p 0)) thr->id)         ; sender: <worker-id>
+  (= (aref tcmd.v 1 (+ rank-p 1)) hx->id)          ; sender: <subtask-id>
+  (= (aref tcmd.v 1 (+ rank-p 2)) TERM)
   (csym::copy-address (aref tcmd.v 2) hx->task-head) ; recipient: use the information in the task request
   (= (aref tcmd.v 3 0) task-no)         ; the kind of task
   (= (aref tcmd.v 3 1) TERM)
+  (PROF-CODE
+   (csym::evcounter-count thr 
+                          (if-exp (== tcmd.node INSIDE) EV-SEND-TASK-INSIDE EV-SEND-TASK-OUTSIDE)
+                          OBJ-PADDR hx->task-head))
   (csym::send-command (ptr tcmd) body task-no))
 
 ;;; Wait for the result of the subtask thr->sub, remove it from the worker's subtask list,
@@ -1509,35 +1482,75 @@
 (def (wait-rslt thr stback) (fn (ptr void) (ptr (struct thread-data)) int)
   (def body (ptr void))
   (def sub (ptr (struct task-home)))
+  (PROF-CODE
+   (def tcnt-stat (enum tcounter))
+   (def tcnt-stat-w (enum tcounter)))
   (csym::pthread-mutex-lock (ptr thr->mut))
+  (PROF-CODE
+   (= tcnt-stat thr->tcnt-stat))
   (= sub thr->sub)                           ; sub: the top of the worker's subtask stack
-  (while (and (!= sub->stat TASK-HOME-DONE)  ; Until the subtask is done or aborted
+  (while (and (!= sub->stat TASK-HOME-DONE)  ; Until the subtask is done/aborted
+	      (!= sub->stat TASK-HOME-EXCEPTION)
 	      (!= sub->stat TASK-HOME-ABORTED))
+    (PROF-CODE
+     (= tcnt-stat-w (if-exp (== tcnt-stat TCOUNTER-EXEC)
+			TCOUNTER-WAIT
+		      (if-exp (== tcnt-stat TCOUNTER-ABRT)
+			  TCOUNTER-ABRT-WAIT
+			TCOUNTER-EXCP-WAIT)))
+     (csym::tcounter-change-state thr tcnt-stat-w OBJ-NULL 0))
     (= thr->task-top->stat TASK-SUSPENDED)   ; STARTED => SUSPENDED (thr->task-top is the task being executed)
+    ;; When propagating exception, send cncl messages for subtasks
+    (if (== thr->exiting EXITING-EXCEPTION)
+	(begin
+	  (csym::set-cancelled thr thr->task-top sub->eldest)
+	  (csym::send-cncl-for-flagged-subtasks thr)))
+    ;; Wait for a moment if the victim is an external worker.
+    (if (== OUTSIDE sub->req-from)
+	(let ((now (struct timeval))
+	      (t-until (struct timespec)))
+	  (csym::gettimeofday (ptr now) 0)
+	  (csym::timeval-plus-nsec-to-timespec (ptr t-until) (ptr now) 1000)
+	  (csym::pthread-cond-timedwait (ptr thr->cond-r) (ptr thr->mut)
+					(ptr t-until))
+	  ))
+    ;; Quit if the subtask is finished or aborted.
+    (if (or (== sub->stat TASK-HOME-DONE)
+	    (== sub->stat TASK-HOME-EXCEPTION)
+	    (== sub->stat TASK-HOME-ABORTED)) 
+	(break))
     (if stback
-	;; If stealing back is enabled
+        ;; Steal and execute a task
 	(begin
-	  ;; Wait for a moment if the victim is an external worker.
-	  (if (== OUTSIDE sub->req-from)
-	      (let ((now (struct timeval))
-		    (t-until (struct timespec)))
-		(csym::gettimeofday (ptr now) 0)
-		(csym::timeval-plus-nsec-to-timespec (ptr t-until) (ptr now) 1000)
-		(csym::pthread-cond-timedwait (ptr thr->cond-r) (ptr thr->mut)
-					      (ptr t-until))
-		))
-	  ;; Quit if the subtask is finished or aborted.
-	  (if (or (== sub->stat TASK-HOME-DONE)
-		  (== sub->stat TASK-HOME-ABORTED)) 
-	      (break))  
-	  ;; Steal and execute a task
-	  (recv-exec-send thr sub->task-head sub->req-from))
-      ;; If stealing back is disabled, just wait for the result.
+	  (PROF-CODE
+	   (csym::tcounter-change-state thr TCOUNTER-TREQ-BK
+					OBJ-ADDR sub->task-head))
+	  (recv-exec-send thr sub->task-head sub->req-from)
+	  (PROF-CODE
+	   (csym::tcounter-change-state thr tcnt-stat-w
+					OBJ-NULL 0))
+	  )
+      ;; Just wait for the subtask finishing
       (csym::pthread-cond-wait (ptr thr->cond-r) (ptr thr->mut)))
     )
-  
-  (if (== sub->stat TASK-HOME-ABORTED) 
-      (= body 0)
+  ;; When the subtask has thrown an exception, propagate it
+  (if (== sub->stat TASK-HOME-EXCEPTION)
+      (begin
+	(= thr->exiting EXITING-EXCEPTION)
+	(= thr->exception-tag sub->exception-tag)
+	(dec sub->owner->cancellation)  ; take the partial cancellation flag
+	(PROF-CODE
+	 (= tcnt-stat TCOUNTER-EXCP))
+	))
+  (PROF-CODE
+   (csym::tcounter-change-state thr tcnt-stat OBJ-NULL 0))
+
+  ;; When the subtask is abnormally exited, a task object is not returned as the result
+  (if (or (== sub->stat TASK-HOME-EXCEPTION)
+	  (== sub->stat TASK-HOME-ABORTED))
+      (begin
+	(csym::free body)
+	(= body 0))
     (= body sub->body))
   ;; Pop the subtask stack
   (= thr->sub sub->next)                ; stack top <== 2nd entry
@@ -1552,6 +1565,7 @@
 ;;; Send bcst (broadcast) message to the connected Tascell server.
 ;;; Called by worker thread after initializing the task object ("body")
 ;;; in a :put section.
+;;; !!! MPI mode not spported yet
 (def tcell-bcst-wait-bcak int 1)
 (def (csym::broadcast-task thr task-no body)
    (csym::fn void (ptr (struct thread-data)) int (ptr void))
@@ -1584,43 +1598,54 @@
 ;;; Handling command-line options
 (def (csym::usage argc argv) (csym::fn void int (ptr (ptr char)))
   (csym::fprintf stderr
-                 "Usage: %s [-s hostname] [-p port-num] [-n n-threads] [-i initial-task-parms] [-a] [-v verbosity]~%"
+                 (%string
+                  "Usage: %s [-s hostname] [-p port-num"
+		  (%if* USEMPI "(-1 for MPI mode)" %else "")
+		  "] [-n n-threads] [-i initial-task-parms] [-a]"
+                  (%if* VERBOSE " [-v verbosity]" %else "")
+                  (%if* PROFILE " [-T timechart-prefix]" %else "")
+                  "~%")
                  (aref argv 0))
   (csym::exit 1))
 
 (def (set-option argc argv) (csym::fn void int (ptr (ptr char)))
   (def i int) (def ch int)
+  (decl fp (ptr FILE))
+  (decl buf (array char 256))
+  (decl command (ptr char))
   ;; Default values
-  (= (aref option.sv-hostname 0) #\NULL)
-  (= option.port 9865)
+  (= option.sv-hostname 0)
+  (= option.port (%ifdef* USEMPI -1 %else 9865))
   (= option.num-thrs 1)
   (= option.node-name 0)
   (= option.initial-task 0)
   (= option.auto-exit 0)
   (= option.affinity 0)
   (= option.always-flush-accepted-treq 0)
+  (= option.thread-affinity COMPACT)
+  (= option.cpu-num 0)
+  (= option.thread-per-cpu 0)
   (= option.verbose 0)
+  (PROF-CODE
+   (= option.timechart-file 0))
+
   ;; Parse and set options
-  (while (!= -1 (= ch (csym::getopt argc argv "n:s:p:N:i:xafP:v:h")))
+  (while (!= -1 (= ch (csym::getopt argc argv "n:s:p:N:i:xat:c:r:fP:v:T:h")))
     (switch ch
       (case #\n)                        ; number of threads
       (= option.num-thrs (csym::atoi optarg))
       (break)
 
       (case #\s)                        ; server name
-      (if (csym::strcmp "stdout" optarg)
-          (begin
-            (csym::strncpy option.sv-hostname optarg
-                           HOSTNAME-MAXSIZE)
-            (= (aref option.sv-hostname (- HOSTNAME-MAXSIZE 1)) 0))
-        (= (aref option.sv-hostname 0) #\NULL))
+      (= option.sv-hostname
+	 (if-exp (csym::strcmp "stdout" optarg) optarg 0))
       (break)
 
-      (case #\p)                        ; connection port number
+      (case #\p)                        ; connection port numer (-1 for MPI)
       (= option.port (csym::atoi optarg))
       (break)
 
-      (case #\N)
+      (case #\N)                        ; Node name
       (if option.node-name (csym::free option.node-name))
       (= option.node-name
          (cast (ptr char) (csym::malloc (* (+ 1 (csym::strlen optarg))
@@ -1651,12 +1676,50 @@
         (csym::fprintf stderr "-a is ignored (invalidated in compile time)~%"))
       (break)
 
+      (case #\t)                        ; thread affinity setting
+      (cond
+       ((== (csym::strcmp "compact" optarg) 0)
+         (= option.thread-affinity COMPACT))
+        ((== (csym::strcmp "scatter" optarg) 0)
+         (= option.thread-affinity SCATTER))
+        ((== (csym::strcmp "sharedmemory" optarg) 0)
+         (= option.thread-affinity SHAREDMEMORY)))
+      (break)
+      
+      (case #\c)                        ; # cores (used for affinity setting)
+      (= option.cpu-num (csym::atoi optarg))
+      (break)
+
+      (case #\r)                        ; # threads per core (used for affinity setting)
+      (= option.thread-per-cpu (csym::atoi optarg))
+      (break)
+
       (case #\f)                        ; flush also stealing-back treq
       (= option.always-flush-accepted-treq 1)
       (break)
       
       (case #\v)                        ; verbose level
-      (= option.verbose (csym::atoi optarg))
+      (%if* VERBOSE
+	(= option.verbose (csym::atoi optarg))
+	%else
+	(csym::fprintf stderr "Warning: -v option is invalidated at compile-time.~%"))
+      (break)
+
+      (case #\T)                        ; output time chart
+      (= command "hostname -s")
+      (if (== (= fp (csym::popen command "r")) NULL)
+        (begin
+          (csym::fprintf stderr "popen error!~%")
+          (exit EXIT-FAILURE)))
+      (csym::fgets buf 256 fp)
+      (csym::strtok buf "~%")
+      (cast void (csym::pclose fp))
+
+      (%if* PROFILE (begin
+	(= option.timechart-file optarg)
+        (csym::strcat option.timechart-file buf))
+	%else
+	(csym::fprintf stderr "Warning: -T option is invalidated at compile-time.~%"))
       (break)
 
       (case #\h)                        ; usage
@@ -1698,29 +1761,218 @@
       (= (fref (aref hlist (- len 1)) next) 0))
   (return))
 
+
+(PROF-CODE
+;;; Initialize (struct aux-data) object pointed by paux by given type and value
+(def (csym::set-aux-data paux aux-type aux-body)
+    (fn void (ptr (struct aux-data)) (enum obj-type) (ptr void))
+  (= paux->type aux-type)
+  (switch aux-type
+    (case OBJ-INT)
+    (= paux->body.aux-int (cast long aux-body))
+    (break)
+    (case OBJ-ADDR)                     ; copy address
+    (csym::copy-address paux->body.aux-addr
+                        (cast (ptr (enum addr)) aux-body))
+    (break)
+    (case OBJ-PADDR)                    ; copy pointer to address
+    (= paux->body.aux-paddr (cast (ptr (enum addr)) aux-body))
+    (break))
+  )
+
+;;; Output (struct aux-data) object pointed by paux to fp.
+(def (csym::print-aux-data fp paux)
+    (fn void (ptr FILE) (ptr (struct aux-data)))
+  (def buf (array char BUFSIZE))
+  (switch paux->type
+    (case OBJ-INT)
+    (csym::fprintf fp " %d" paux->body.aux-int)
+    (break)
+    (case OBJ-ADDR)
+    (csym::serialize-arg buf paux->body.aux-addr)
+    (csym::fputc #\Space fp)
+    (csym::fputs buf fp)
+    (break)
+    (case OBJ-PADDR)
+    (csym::serialize-arg buf paux->body.aux-paddr)
+    (csym::fputc #\Space fp)
+    (csym::fputs buf fp)
+    (break))
+  )
+
+;;; Initialize time counters
+(def (csym::initialize-tcounter thr) (fn void (ptr (struct thread-data)))
+  (def i int)
+  (def tp (struct timeval))
+  (= thr->tcnt-stat TCOUNTER-INIT)
+  (csym::gettimeofday (ptr tp) 0)
+  (for ((= i 0) (< i NKIND-TCOUNTER) (inc i))
+    (= (aref thr->tcnt i) 0)
+    (= (aref thr->tcnt-tp i) tp))
+  (= thr->tc-aux.type OBJ-NULL)
+  )
+
+;;; Set the start a time of tcnt-stat to the current time
+(def (csym::tcounter-start thr tcnt-stat)
+    (fn void (ptr (struct thread-data)) (enum tcounter))
+  (def tp (struct timeval))
+  (csym::gettimeofday (ptr tp) 0)
+  (= (aref thr->tcnt-tp tcnt-stat) tp))
+
+;;; Add time from the last start time of tcnt-stat to the corresponding counter
+;;; Set the start a time of tcnt-stat to the current time
+(def (csym::tcounter-end thr tcnt-stat)
+    (fn void (ptr (struct thread-data)) (enum tcounter))
+  (def tp (struct timeval))
+  (csym::gettimeofday (ptr tp) 0)
+  (+= (aref thr->tcnt tcnt-stat)
+      (csym::diff-timevals (ptr tp) (ptr (aref thr->tcnt-tp tcnt-stat))))
+  (= (aref thr->tcnt-tp tcnt-stat) tp))
+
+;;; (tcounter-end <current state>) and (tcounter-start tcnt-stat)
+;;; at the same time and change the <current state> to tcnt-stat.
+;;; Return the original state.
+;;; aux-type/aux-body is auxiliary data type/body for timechart:
+(def (csym::tcounter-change-state thr tcnt-stat aux-type aux-body)
+    (fn (enum tcounter) (ptr (struct thread-data)) (enum tcounter)
+	(enum obj-type) (ptr void))
+  (def tp (struct timeval))
+  (def tcnt-stat0 (enum tcounter))
+  (defs double tcnt0 tcnt)
+  (= tcnt-stat0 thr->tcnt-stat)               ; old state
+  (if (!= tcnt-stat0 tcnt-stat)
+      (begin
+	(= tcnt0 (aref thr->tcnt tcnt-stat0)) ; total time of old state
+	(csym::gettimeofday (ptr tp) 0)       ; end time of old state
+	(= tcnt (+ tcnt0                      ; increase total time of old state
+		   (csym::diff-timevals (ptr tp)
+					(ptr (aref thr->tcnt-tp tcnt-stat0)))))
+	(= (aref thr->tcnt tcnt-stat0) tcnt)  ; update total time of old state
+	(= (aref thr->tcnt-tp tcnt-stat) tp)  ; set start time of new state
+	(= thr->tcnt-stat tcnt-stat)          ; set the new state of the worker
+	(if thr->fp-tc
+	    ;; Write time chart
+	    (let ((tp0 (ptr (struct timeval))))
+	      (= tp0 (ptr (aref thr->tcnt-tp tcnt-stat0)))
+	      (if (and (== tcnt-stat0 TCOUNTER-INIT)
+		       (== thr->id 0))
+		  (= tp-strt tp))             ; start time of whole execution
+	      ;; Output the previous state name, and the time range of the state.
+	      (csym::fprintf thr->fp-tc "%s %lf %lf"
+			     (aref tcounter-strings tcnt-stat0)
+			     (csym::diff-timevals tp0 (ptr tp-strt))
+			     (csym::diff-timevals (ptr tp) (ptr tp-strt)))
+              ;; Output auxiliary data of the previous state.
+              (csym::fputc #\Space thr->fp-tc)
+              (csym::print-aux-data thr->fp-tc (ptr thr->tc-aux))
+	      (csym::fputc #\Newline thr->fp-tc)
+              ;; Save the given aux data for the next output
+              (csym::set-aux-data (ptr thr->tc-aux) aux-type aux-body)
+	      ))
+	))
+  (return tcnt-stat0))
+
+;;; Initialize event counters
+(def (csym::initialize-evcounter thr) (fn void (ptr (struct thread-data)))
+  (def i int)
+  (for ((= i 0) (< i NKIND-EV) (inc i))
+    (= (aref thr->ev-cnt i) 0))
+  )
+
+;;; Add event counter and output to log file
+(def (csym::evcounter-count thr ev aux-type aux-body)
+    (fn int (ptr (struct thread-data)) (enum event) (enum obj-type) (ptr void))
+  (def tp (struct timeval))
+  (def aux (struct aux-data))
+  (inc (aref thr->ev-cnt ev))
+  (if thr->fp-tc
+      (begin
+        (csym::gettimeofday (ptr tp) 0)
+        (csym::fprintf thr->fp-tc "%s %lf"
+                       (aref ev-strings ev)
+                       (csym::diff-timevals (ptr tp) (ptr tp-strt)))
+        ;; Output auxiliary data of the previous state.
+        (csym::fputc #\Space thr->fp-tc)
+        (csym::set-aux-data (ptr aux) aux-type aux-body)
+        (csym::print-aux-data thr->fp-tc (ptr aux))
+        (csym::fputc #\Newline thr->fp-tc)))
+  (return (aref thr->ev-cnt ev)))
+
+;;; Show time / event counters
+(def (csym::show-counters) (fn void)
+  (defs int i j)
+  (def thr (ptr (struct thread-data)))
+  (for ((= i 0) (< i num-thrs) (inc i))
+    (csym::fprintf stderr "*** Worker %d ***~%" i)
+    (= thr (+ threads i))
+    (for ((= j 0) (< j NKIND-TCOUNTER) (inc j))
+      (csym::fprintf stderr "%s: %lf~%"
+		     (aref tcounter-strings j) (aref thr->tcnt j)))
+    (for ((= j 0) (< j NKIND-EV) (inc j))
+         (csym::fprintf stderr "%s: %ld~%"
+                        (aref ev-strings j) (aref thr->ev-cnt j))))
+  (return))
+
+;;; Finalize tcounter
+(def (csym::finalize-tcounter) (fn void)
+  (let ((i int) (thr (ptr (struct thread-data))) (fp (ptr FILE)))
+    (for ((= i 0) (< i num-thrs) (inc i))
+      (= thr (+ threads i))
+      (csym::tcounter-change-state thr TCOUNTER-INIT OBJ-NULL 0)
+      (if thr->fp-tc
+	  (begin
+	    (= fp thr->fp-tc)
+	    (= thr->fp-tc 0)
+	    (csym::fclose fp))))))
+
+)                                       ; end PROF-CODE
+
+
 ;; main (entry point)
 ;; Initialize and run all workers and wait for external messages.
 (def (main argc argv) (fn int int (ptr (ptr char)))
-  (defs int i j)
-  (def pcmd (ptr (struct cmd)))         ; external command received
-
-  (%ifdef* USEMPI
-    (csym::MPI_Init (ptr argc) (ptr argv)))
+  (def i int)
+  (def mpi-provided int)                ; MPI support level
 
   ;; Show compile-time option
   (fprintf stderr (%string "compile-time options: "
                            "VERBOSE=" VERBOSE " "
+                           "PROFILE=" PROFILE " "
                            "NF-TYPE=" NF-TYPE " "
-                           "USE-AFFINITY=" USE-AFFINITY
+                           "USE-AFFINITY=" USE-AFFINITY " "
+			   "USEMPI=" (%ifdef* USEMPI "yes" %else "no")
                            "~%"))
+
+  (%ifdef* USEMPI
+    (csym::MPI-Init-thread (ptr argc) (ptr argv) MPI-THREAD-MULTIPLE (ptr mpi-provided))
+    (csym::MPI-Comm-rank MPI-COMM-WORLD (ptr my-rank))
+    (csym::MPI-Comm-size MPI-COMM-WORLD (ptr num-procs))
+    (if (== my-rank 0)
+	(begin
+	  (def provided-msg (ptr char))
+	  (switch mpi-provided
+	    (case MPI-THREAD-SINGLE)
+	    (= provided-msg "SINGLE")     (break)
+	    (case MPI-THREAD-FUNNELED)
+	    (= provided-msg "FUNNELED")   (break)
+	    (case MPI-THREAD-SERIALIZED)
+	    (= provided-msg "SERIALIZED") (break)
+	    (case MPI-THREAD-MULTIPLE)
+	    (= provided-msg "MULTIPLE")   (break))
+	  (csym::fprintf stderr "Available level of thread support %s~%" provided-msg)))
+    %else
+    (= my-rank 0)
+    (= num-procs 0))
   
   ;; Read command-line options to initialize the "option" global object.
   (csym::set-option argc argv)
 
-  ;; Connect to a Tascell server
-  (= sv-socket (if-exp (== #\NULL (aref option.sv-hostname 0))
-                       -1
-                       (csym::connect-to option.sv-hostname option.port)))
+  ;; Set sv-socket and connect to the Tascell server if specified
+  (if (< option.port 0)
+      (= sv-socket -1)                                                  ; MPI
+    (= sv-socket (if-exp option.sv-hostname
+		     (csym::connect-to option.sv-hostname option.port)  ; TCP/IP
+		   0)))                                                 ; stdin/stdout
 
   ;; Initialized mutex attribute
   (def m-attr pthread-mutexattr-t)
@@ -1730,18 +1982,16 @@
   
   ;; Initialize send-mut (lock for sending out external messages)
   (csym::pthread-mutex-init (ptr send-mut) (ptr m-attr))
-
-  ;; Initialize data-mut/data-cond (lock/condition variable for on-demand data)
-  (csym::pthread-mutex-init (ptr data-mutex) (ptr m-attr))
-  (csym::pthread-cond-init (ptr data-cond) 0)
   
   ;; Initialize thread-data objects (workers)
+  (DEBUG-PRINT 1 "Initialize thread-data objects (workers)~%")
   (= num-thrs option.num-thrs)
   (for ((= i 0) (< i num-thrs) (inc i))
     (let ((thr (ptr (struct thread-data)) (+ threads i))
           (tx (ptr (struct task)))
           (hx (ptr (struct task-home))))
       (= thr->req 0)
+      (= thr->req-cncl 0)
       (= thr->id i)
       (= thr->w-rack 0)
       (= thr->w-none 0)
@@ -1750,7 +2000,7 @@
       (= thr->probability 1.0)
       (= thr->last-treq i)
       (= thr->last-choose CHS-RANDOM)
-      (= thr->exiting 0)
+      (= thr->exiting EXITING-NORMAL)
       (= thr->exception-tag 0)
       (let ((r double) (q double))
         (= r (csym::sqrt (+ 0.5 i)))
@@ -1767,6 +2017,7 @@
       (csym::pthread-cond-init (ptr thr->cond-r) 0)
 
       ;; Initialize a task stack
+      (DEBUG-PRINT 1 "Initialize a task stack~%")
       (= tx (cast (ptr (struct task))
               (csym::malloc (* (sizeof (struct task)) TASK-LIST-LENGTH))))
       (csym::initialize-task-list tx TASK-LIST-LENGTH
@@ -1777,21 +2028,34 @@
               (csym::malloc (* (sizeof (struct task-home)) TASK-LIST-LENGTH))))
       (csym::initialize-task-home-list hx TASK-LIST-LENGTH
                                        (ptr thr->treq-top) (ptr thr->treq-free))
-      (= thr->sub 0)))
-
-  ;; Create and run worker threads
-  (for ((= i 0) (< i num-thrs) (inc i))
-    (let ((thr (ptr (struct thread-data)) (+ threads i)))
-      (systhr-create (ptr thr->pthr-id) worker thr)))
-
+      (= thr->sub 0)
+
+      ;; open timechart output file
+      (PROF-CODE
+       (if option.timechart-file
+	   (let ((fname (ptr char)) (len int))
+	     (= len (+ (csym::strlen option.timechart-file) 10))
+	     (= fname (csym::malloc (* (sizeof char) len)))
+	     (csym::snprintf fname len "%s-%04d.dat"
+			     option.timechart-file thr->id)
+	     (= thr->fp-tc (csym::fopen fname "w"))
+	     (if (not thr->fp-tc) (csym::perror "Failed to open timechart-file for writing"))
+	     (csym::free fname))
+	 (= thr->fp-tc 0)))
+      ))
+  
   ;; If option.initial-task is given, send a task to the 0-th worker
   ;; as if this node received a "task" message as the first message.
-  (if option.initial-task
+  ;; (only in the 0-th process in MPI mode)
+  (if (and option.initial-task
+	   (or (>= sv-socket 0) (== my-rank 0)))
       (begin
         (def p-src (ptr char))
         (def p-dst (ptr char))
         (def header (ptr char))
-        (= header "task 0 0 0 ")
+        (= header (if-exp (< sv-socket 0)
+		      "task 0 -1:0 0:0 " ; message from process with pseudo rank -1.
+		    "task 0 0 0 "))    ; as if the message is from parent
         (= receive-buf
            (cast (ptr char) (csym::malloc (* (+ 3
                                                 (csym::strlen option.initial-task)
@@ -1799,25 +2063,50 @@
                                              (sizeof char)))))
         (= receive-buf-p receive-buf)
         (csym::strcpy receive-buf header)
+        ;; Copy string argument of -i option to receive-buf, replacing #\Space by #\Newline
         (for ((exps (= p-src option.initial-task)
                     (= p-dst (+ receive-buf (csym::strlen header))))
               (mref p-src)
               (exps (inc p-src) (inc p-dst)))
           (= (mref p-dst) (if-exp (== #\Space (mref p-src)) #\Newline (mref p-src))))
+        ;; Add two newlines and a null character
         (= (mref (inc p-dst)) #\Newline)
         (= (mref (inc p-dst)) #\Newline)
         (= (mref p-dst) 0)
-        (csym::sleep 1)
+        ;; Debug output
         (if (>= option.verbose 1)
             (csym::fprintf stderr "%s" receive-buf))
         ))
+
+  ;; Create and run worker threads
+  (DEBUG-PRINT 1 "Create and run worker threads~%")
+  (for ((= i 0) (< i num-thrs) (inc i))
+    (let ((thr (ptr (struct thread-data)) (+ threads i)))
+      (PROF-CODE                       ; initialize time counter
+       (csym::initialize-evcounter thr)
+       (csym::initialize-tcounter thr))
+      (systhr-create (ptr thr->pthr-id) worker thr)))
+
+  ;; Wait for workers being ready
+  (DEBUG-PRINT 1 "Wait for workers being ready~%")
+  (csym::sleep 1)
+  (DEBUG-PRINT 1 "Wait for workers being ready(END)~%")
+
   ;; Loop for handling external messages
-  (while 1
-    (= pcmd (csym::read-command))
-    (if pcmd
-      (begin
-        (csym::proc-cmd pcmd 0))
+  (DEBUG-PRINT 1 "Loop for handling external messages~%")
+  (if (< sv-socket 0)
       (begin
-        (while 1
-          (csym::sleep 2147483647)))) )
-  (csym::exit 0))
+	(csym::mpi-loop) ; never returns
+	(%ifdef* USEMPI (csym::MPI-Finalize))
+	(csym::exit 0))
+    (begin
+     (def cmd (struct cmd))
+     (def buf (array char BUFSIZE))
+     (while 1
+       (if (csym::read-command buf (ptr cmd))
+           (csym::proc-cmd (ptr cmd) 0)
+         (break)))
+     (csym::sleep 2147483647)
+     (csym::exit 0)))
+  (return 0)
+  )
diff --git a/src/sample/tcell/worker.sh b/src/sample/tcell/worker.sh
index 2e6b320a..7599687b 100644
--- a/src/sample/tcell/worker.sh
+++ b/src/sample/tcell/worker.sh
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2009-2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
+;;; Copyright (c) 2009-2020 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -27,6 +27,9 @@
 (%defconstant VERBOSE 1)
 (%include "dprint.sh")
 
+;;; Support MPI?
+(%defconstant USEMPI 1)
+
 ;;; Implementation of nested functions
 (%ifndef* NF-TYPE
   (%defconstant NF-TYPE GCC))           ; one of GCC LW-SC CL-SC XCC XCCCL
@@ -35,6 +38,8 @@
 ;; (%defconstant USE-AFFINITY SCHED)    ; for Linux
 ;; (%defconstant USE-AFFINITY PBIND)    ; for SunOS
 
+(c-exp "#include<sys/time.h>")
+
 ;;; 
 
 ;;; Sizes
@@ -52,7 +57,8 @@
 ;; (%defconstant BUSYWAIT)
 
 ;; Declarations for external communication functionalities
-(%cinclude "sock.h" (:macro))
+;;(%cinclude "sock.h" (:macro))
+(c-exp "#include \"sock.h\"")
 
 ;;;; Declarations
 ;; Special elements for address.
@@ -62,15 +68,30 @@
 (def (enum node) INSIDE OUTSIDE)
 ;; Commands
 (def (enum command)
-    TASK RSLT TREQ NONE RACK DREQ DATA
-    BCST BCAK STAT VERB EXIT LEAV LACK ABRT CNCL WRNG)
-;; Strings corresponding to the commands above. Defined in cmd-serial.sc.
-(extern-decl cmd-strings (array (ptr char)))
+    TASK RSLT TREQ NONE RACK
+    BCST BCAK STAT VERB EXIT CNCL WRNG)
+;; Strings corresponding to the commands above.
+(static cmd-strings (array (ptr char))
+  (array "task" "rslt" "treq" "none" "rack"
+         "bcst" "bcak" "stat" "verb" "exit" "cncl" "wrng" 0))
 
 ;; How to determine the recipient of "treq any" (random or in-order)
 (def (enum choose) CHS-RANDOM CHS-ORDER)
+;; consistent with (enum choose)
+(static choose-strings (array (ptr char))
+  (array "CHS-RANDOM" "CHS-ORDER"))
 (%defconstant NKIND-CHOOSE 2)           ; # of kinds of (enum choose)
 
+;; Kind of affinity
+(def (enum Affinity) COMPACT SCATTER SHAREDMEMORY)
+
+;; A send msg struct
+(def (struct send-block)
+  (def buf (ptr char))
+  (def len int)
+  (def size int)
+  (def rank int))
+
 ;; A message transferred among workers.
 (def (struct cmd)
   (def w (enum command))                ; kind of command
@@ -95,37 +116,18 @@
 
 ;;; Arrays of task/result sender/receiver methods.
 ;;; Each method body is defined by a Tascell programmer or generated by Tascell compiler.
-(decl task-doers
+(extern-decl task-doers
       (array (ptr (fn void (ptr (struct thread-data)) (ptr void))) TASK-MAX))
-(decl task-senders
+(extern-decl task-senders
       (array (ptr (csym::fn void (ptr void))) TASK-MAX))
-(decl task-receivers
+(extern-decl task-allocators
       (array (ptr (csym::fn (ptr void))) TASK-MAX))
-(decl rslt-senders
+(extern-decl task-receivers
       (array (ptr (csym::fn void (ptr void))) TASK-MAX))
-(decl rslt-receivers
+(extern-decl rslt-senders
+      (array (ptr (csym::fn void (ptr void))) TASK-MAX))
+(extern-decl rslt-receivers
       (array (ptr (csym::fn void (ptr void))) TASK-MAX))
-
-;;;; NOTE: this functionality (on-demand data request) is incomplete now.
-;;;; Functions for on-demand data communications.
-;;; Allocate the array for on-demand data. Invoked during initialization.
-(decl (csym::data-allocate) (csym::fn void int))
-;;; Send data
-(decl (csym::data-send) (csym::fn void int int))
-;;; Receive data
-(decl (csym::data-receive) (csym::fn void int int))
-
-;;; Tascell user functions for the on-demand data requsest functionality.
-;;; "csym::-F" is provided as the built-in function named "F" for Tascell programmers
-;; Allocate and initialize data space and flags for om-demand data.
-(decl (csym::-setup-data) (csym::fn void int))
-;; Send dreq messages for a given range to the holder of a parent task.
-;; (The first argument (thread data) is added by Tascell compiler.)
-(decl (csym::-request-data) (csym::fn void (ptr (struct thread-data)) int int))
-;; Wait for data of a given range reaching this node.
-(decl (csym::-wait-data) (csym::fn void int int))
-;; Set data-flags of a given range to DATA-EXIST
-(decl (csym::-set-exist-flag) (csym::fn void int int))
 
 ;;;; Worker local storage
 ;;; Declaration of the struct for worker local storage objects.
@@ -143,6 +145,9 @@
   TASK-DONE        ; The task is completed
   TASK-NONE        ; Sent treq for ALLOCATED entry but received none
   TASK-SUSPENDED)  ; The task is suspended (due to waiting the result of a subtask)
+(static task-stat-strings (array (ptr char))
+  (array "TASK-ALLOCATED" "TASK-INITIALIZED" "TASK-STARTED"
+	 "TASK-DONE" "TASK-NONE" "TASK-SUSPENDED"))
 ;; -(send treq)-> ALLOCATED -(receive task)-> INITIALIZED --> STARTED --> DONE -->
 ;;                 ^  |receive none                           ^     |receive the result
 ;;      resend treq|  V                 wait result of subtask|     V
@@ -153,9 +158,95 @@
   TASK-HOME-ALLOCATED    ; Allocated to request queue, or then moved to subtask stack but uninitialized
   TASK-HOME-INITIALIZED  ; Initialized in subtask stack
   TASK-HOME-DONE         ; Completed (received and handled the result)
-  TASK-HOME-ABORTED      ; Aborted (received abrt)
+  TASK-HOME-EXCEPTION    ; Completed with an exception
+  TASK-HOME-ABORTED      ; Aborted by a cancellation message
 )
+(static task-home-stat-strings (array (ptr char))
+  (array "TASK-HOME-ALLOCATED" "TASK-HOME-INITIALIZED" "TASK-HOME-DONE"
+	 "TASK-HOME-EXCEPTION" "TASK-HOME-ABORTED"))
 
+;;;; The reason for the abnormal exit.
+(def (enum exiting-rsn)
+  EXITING-NORMAL         ; normal exit
+  EXITING-EXCEPTION      ; exiting due to an exception
+  EXITING-CANCEL         ; exiting due to a cancellation
+  EXITING-SPAWN          ; temporary exiting to spawning a task
+  )
+(static exiting-rsn-strings (array (ptr char))
+  (array "EXITING-NORMAL" "EXITING-EXCEPTION" "EXITING-CANCEL" "EXITING-SPAWN"))
+
+
+(PROF-CODE
+;;; Kinds of time counter (for profiling)
+(%defconstant NKIND-TCOUNTER 10)
+(def (enum tcounter)
+  TCOUNTER-INIT          ; before execution
+  TCOUNTER-EXEC          ; task execution time
+  TCOUNTER-SPWN          ; task spawning time
+  TCOUNTER-WAIT          ; waiting result (does not include time for stealing back)
+  TCOUNTER-EXCP          ; exiting due to propagating an exception
+  TCOUNTER-EXCP-WAIT     ; waiting result during propagating an exception
+  TCOUNTER-ABRT          ; exiting due to abortion
+  TCOUNTER-ABRT-WAIT     ; waiting result during abortion
+  TCOUNTER-TREQ-BK       ; time for task request for stealing back
+  TCOUNTER-TREQ-ANY      ; time for task request when having no task
+)
+(static tcounter-strings (array (ptr char))
+  (array "TCOUNTER-INIT" "TCOUNTER-EXEC" "TCOUNTER-SPWN"
+	 "TCOUNTER-WAIT" "TCOUNTER-EXCP" "TCOUNTER-EXCP-WAIT"
+	 "TCOUNTER-ABRT" "TCOUNTER-ABRT-WAIT"
+	 "TCOUNTER-TREQ-BK" "TCOUNTER-TREQ-ANY"))
+
+;;; Kinds of events (for profiling)
+(%defconstant NKIND-EV 12)
+(def (enum event)
+  EV-SEND-TASK-INSIDE                   ; task send to a worker in the same node (aux: recipient)
+  EV-SEND-TASK-OUTSIDE                  ; task send to a worker in an external node (aux: recipient)
+  EV-STRT-TASK-INSIDE                   ; start task from the same node (aux: task sender)
+  EV-STRT-TASK-OUTSIDE                  ; start task from an exernal node (aux: task sender)
+  EV-RSLT-TASK-INSIDE                   ; normally finish task from the same node (aux: task sender)
+  EV-RSLT-TASK-OUTSIDE                  ; normally finish task from an external node (aux: rslt recipient)
+  EV-EXCP-TASK-INSIDE                   ; finish task from the same node with an exception (aux: task sender)
+  EV-EXCP-TASK-OUTSIDE                  ; finish task from an external node with an exception (aux: task sender)
+  EV-ABRT-TASK-INSIDE                   ; aborted task from the same node (aux: rslt recipient)
+  EV-ABRT-TASK-OUTSIDE                  ; aborted task from an external node (aux: rslt recipient)
+  EV-SEND-CNCL-INSIDE                   ; send cncl to a worker in the same node (aux: recipient)
+  EV-SEND-CNCL-OUTSIDE                  ; send cncl to a worker in an external node (aux: recipient)
+  )
+(static ev-strings (array (ptr char))
+  (array "EV-SEND-TASK-INSIDE"
+         "EV-SEND-TASK-OUTSIDE"
+         "EV-STRT-TASK-INSIDE"
+         "EV-STRT-TASK-OUTSIDE"
+         "EV-RSLT-TASK-INSIDE"
+         "EV-RSLT-TASK-OUTSIDE"
+         "EV-EXCP-TASK-INSIDE"
+         "EV-EXCP-TASK-OUTSIDE"
+         "EV-ABRT-TASK-INSIDE"
+         "EV-ABRT-TASK-OUTSIDE"
+         "EV-SEND-CNCL-INSIDE"
+         "EV-SEND-CNCL-OUTSIDE"
+         ))
+
+;;; Obj types of auxiliary data
+(def (enum obj-type)
+  OBJ-NULL
+  OBJ-INT
+  OBJ-ADDR
+  OBJ-PADDR
+)
+(def (union aux-data-body)
+  (def aux-int long)
+  (def aux-addr (array (enum addr) ARG-SIZE-MAX))
+  (def aux-paddr (ptr (enum addr)))
+  )
+(def (struct aux-data)
+  (def type (enum obj-type))
+  (def body (union aux-data-body))
+  )
+)   ; end of PROF-CODE
+
+
 ;; Entry in the task stack of a worker
 (def (struct task)
   (def stat (enum task-stat))       ; task status
@@ -164,32 +255,41 @@
   (def task-no int)                 ; kind of the task
   (def body (ptr void))             ; task object
   (def ndiv int)                    ; # of task division
+  (def cancellation int)            ; # of partial cancellation flags
   (def rslt-to (enum node))         ; task sender (= result recipient) is INSIDE/OUTSIDE of this node
-  (def rslt-head (array (enum addr) ARG-SIZE-MAX)))
+  (def rslt-head (array (enum addr) ARG-SIZE-MAX))
 					; address of task sender (= result recipient)
 					; including the subtask ID in the sender worker
+  (def progress (volatile int)))			; latency hiding
 
 ;; Entry in the request queue or subtask stack of a worker
 (def (struct task-home)
   (def stat (enum task-home-stat))      ; status
   (def id int)                          ; ID (unique in each worker)
+  (def exception-tag int)               ; thrown exception value (when stat is TASK-HOME-EXCEPTION)
+  (def msg-cncl int)                    ; a request flag for a cncl message
+					; 1: a cncl message would be sent for this subtask
+					; 2: the cncl message is already sent
   (def waiting-head (array (enum addr) ARG-SIZE-MAX))
                                         ; for stealing-back treq, the task head of which
                                         ; the requester is waiting for the result
   (def owner (ptr (struct task)))       ; the task that spawned this subtask
+  (def eldest (ptr (struct task-home))) ; the task-home that is first spawned
+					; in a parallel region
   (def task-no int)                     ; task number (corresponds to a task function)
   (def req-from (enum node))            ; where to send this subtask (INSIDE or OUTSIDE)
   (def task-head (array (enum addr) ARG-SIZE-MAX))
                                         ; the address of the worker which this task is sent to
                                         ; (referred when sending stealing back "treq" or "rack")
-  (def next (ptr (struct task-home)))   ; link to the next task-home
+  (def next (ptr (struct task-home)))   ; link to the next (older) task-home
   (def body (ptr void))                 ; task object
   )
 
 (def (struct thread-data)
   (def id int)                          ; worker ID
   (def pthr-id pthread-t)               ; pthread assigned to the worker
-  (def req (ptr (struct task-home)))    ; flag to check whether there are any task requests
+  (def req (ptr (struct task-home)))    ; request to check task request queue and spawn tasks if needed
+  (def req-cncl int)                    ; request to check subtask stack and send cncl messages if needed
   (def w-rack int)                      ; # of rack messages to be received
   (def w-none int)                      ; # of none messages to be received
   (def ndiv int)                        ; # of division of the task being executed by this worker
@@ -211,8 +311,21 @@
   (def cond-r pthread-cond-t)           ; condition variable for notifying rslt messages
   (def wdptr (ptr void))                ; worker local storage object
   (def w-bcak int)                      ; # of bcak messages to be recieved
-  (def exiting int)                     ; non-zero when backtracking to propagate an exception by a throw statement
-  (def exception-tag long)              ; the exception tag to be catched
+  (def exiting (enum exiting-rsn))      ; the reason for abnormal exiting
+  (def exception-tag int)               ; the exception tag to be catched
+  (PROF-CODE
+   ;; time counter (for profiling)
+   (def tcnt-stat (enum tcounter))           ; the last state by tcounter-change-state
+   (def tcnt (array double NKIND-TCOUNTER))  ; total time of each state
+   (def tcnt-tp (array (struct timeval) NKIND-TCOUNTER))
+					; start time of each state
+   (def tc-aux (struct aux-data))       ; auxiliary data for time chart
+   ;; event (for profiling)
+   (def ev-cnt (array int NKIND-EV))    ; number of events
+   ;; time chart / event output
+   (def fp-tc (ptr FILE))               ; file pointer for time chart data output
+   )
+  ;; dummy
   (def dummy (array char DUMMY-SIZE))   ; padding for preventing false sharing
   )
 
@@ -232,8 +345,8 @@
   )
 
 ;;;; Declarations of functions in worker.sc
-(decl (csym::make-and-send-task thr task-no body)
-      (csym::fn void (ptr (struct thread-data)) int (ptr void)))
+(decl (csym::make-and-send-task thr task-no body eldest-p)
+      (csym::fn void (ptr (struct thread-data)) int (ptr void) int))
 (decl (wait-rslt thr stback) (fn (ptr void) (ptr (struct thread-data)) int))
 (decl (csym::broadcast-task thr task-no body)
       (csym::fn void (ptr (struct thread-data)) int (ptr void)))
@@ -249,8 +362,6 @@
 (decl (csym::recv-task) (csym::fn void (ptr (struct cmd)) (ptr void)))
 (decl (csym::recv-treq) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-rack) (csym::fn void (ptr (struct cmd))))
-(decl (csym::recv-dreq) (csym::fn void (ptr (struct cmd))))
-(decl (csym::recv-data) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-none) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-back) (csym::fn void (ptr (struct cmd))))
 (decl (csym::print-task-list task-top name) (csym::fn void (ptr (struct task)) (ptr char)))
@@ -261,11 +372,24 @@
 (decl (csym::recv-exit) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-bcst) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-bcak) (csym::fn void (ptr (struct cmd))))
-(decl (csym::recv-leav) (csym::fn void (ptr (struct cmd))))
-(decl (csym::recv-lack) (csym::fn void (ptr (struct cmd))))
-(decl (csym::recv-abrt) (csym::fn void (ptr (struct cmd))))
 (decl (csym::recv-cncl) (csym::fn void (ptr (struct cmd))))
 
+(PROF-CODE
+ (decl (csym::initialize-tcounter) (fn void (ptr (struct thread-data))))
+ (decl (csym::tcounter-start)
+     (fn void (ptr (struct thread-data)) (enum tcounter)))
+ (decl (csym::tcounter-end)
+     (fn void (ptr (struct thread-data)) (enum tcounter)))
+ (decl (csym::tcounter-change-state)
+     (fn (enum tcounter) (ptr (struct thread-data)) (enum tcounter)
+	 (enum obj-type) (ptr void)))
+ (decl (csym::initialize-evcounter) (fn void (ptr (struct thread-data))))
+ (decl (csym::evcounter-count)
+     (fn int (ptr (struct thread-data)) (enum event) (enum obj-type) (ptr void)))
+ (decl (csym::show-counters) (fn void))
+ (decl (csym::finalize-tcounter) (fn void))
+ )
+
 ;;;; Declarations of functions in cmd-serial.sc
 (decl (csym::serialize-cmdname buf w) (fn int (ptr char) (enum command)))
 (decl (csym::deserialize-cmdname buf str) (fn int (ptr (enum command)) (ptr char)))
@@ -278,18 +402,21 @@
 (decl (csym::address-equal adr1 adr2) (fn int (ptr (enum addr)) (ptr (enum addr))))
 
 ;;;; Command line options
-(%defconstant HOSTNAME-MAXSIZE 256)
 (def (struct runtime-option)
   (def num-thrs int)                    ; # of workers
-  (def sv-hostname (array char HOSTNAME-MAXSIZE))
-                                        ; hostname of connecting Tascell server
+  (def sv-hostname (ptr char))          ; hostname of connecting Tascell server
                                         ; If the string is "", external messages are output to stdout
-  (def port unsigned-short)             ; port # used to connect to Tascell server
+  (def port int)                        ; port # used to connect to Tascell server
   (def node-name (ptr char))            ; node name (used for debugging only)
   (def initial-task (ptr char))         ; string for arguments of initial task
   (def auto-exit int)                   ; When true, the process exits after sending external rslt message
   (def affinity int)                    ; use sched_setaffinity to assign a physical core/thread to each worker
   (def always-flush-accepted-treq int)  ; flush stealing back (accepted) treq message
+  (def thread-affinity (enum Affinity)) ; worker-thread affinity
+  (def cpu-num int)                     ; # cores / physical node
+  (def thread-per-cpu int)              ; # threads / core
   (def verbose int)                     ; verbose level
+  (PROF-CODE                            
+   (def timechart-file (ptr char)))     ; postfix of timechart output file names
   )
 (extern-decl option (struct runtime-option))
diff --git a/src/sc-cmdline.lsp b/src/sc-cmdline.lsp
index 4020e809..8cef33eb 100644
--- a/src/sc-cmdline.lsp
+++ b/src/sc-cmdline.lsp
@@ -60,7 +60,12 @@
                   (setq output-file parm))
                  ((#\s)                 ; sc2c-rule
                   (with1 elm (read-from-string (car rest))
-                    (setq sc2c-rule (if (symbolp elm) (eval (car rest)) elm))))
+                    (setq sc2c-rule elm)
+                    (unless (or (symbolp elm)
+                                (listp elm))
+                      (format *error-output* "~&Illegal parameter value for -s: ~S~%" (car rest))
+                      (bye exit-status))
+                    ))
                  ((#\m)                 ; intermediate
                   (with1 elm (read-from-string parm)
                     (setq intermediate (and elm (not (eql 0 elm))))))
@@ -69,6 +74,7 @@
                     (setq indent (if elm parm nil))))
                  ((#\D)                 ; predefinitions (constant only)
                   (destructuring-bind (symstr valstr) (split-string-1 parm '(#\=))
+                    (when (string= "" valstr) (setq valstr "1"))
                     (when (eq predefinitions default) (setq predefinitions nil))
                     (setq predefinitions
                       (append1 predefinitions
diff --git a/src/sc-decl.lsp b/src/sc-decl.lsp
index 1782c6d2..8db397b6 100644
--- a/src/sc-decl.lsp
+++ b/src/sc-decl.lsp
@@ -64,7 +64,7 @@
 (defvar *auto-compile* t)
 (defconstant *lisp-file-type* "lsp")
 (defconstant *fasl-file-type* (pathname-type (compile-file-pathname "dummy")))
-(defconstant *fasl-path-base*           ; コンパイル済Lispファイルの置き場所
+(defconstant *fasl-path-base*           ; ��潟�潟����ゃ��羝�Lisp�����＜�ゃ�����臀������贋��
     (merge-pathnames (format nil (concatenate 'string #-(and allegro mswindows)"." "sc-fasl"
                                               "/~A/~A/~A/")
                              (gethostname) *cl-implementation* *cl-version*)
@@ -81,7 +81,7 @@
                        *fasl-path-base*)
     (throw :sc-decl-exception nil)))
 
-;; dirがdir-baseのサブディレクトリか？
+;; dir���dir-base�����泣�������ｃ��������������鐚�
 (defun subdirectory-p (dir dir-base)
   (and (>= (length dir) (length dir-base))
        (loop
@@ -89,14 +89,14 @@
            as y in dir-base
            always (equal x y))))
 
-;; (or lsp fasl)の保存場所->faslの保存場所
+;; (or lsp fasl)���篆�絖���贋��->fasl���篆�絖���贋��
 (defun lspdir2fasldir (dir)
   (assert (eq :absolute (car dir)))
   (if (subdirectory-p dir *fasl-dir-base*)
       dir
     (append *fasl-dir-base* (cdr dir))))
    
-;; (or lsp fasl)の保存場所->lspの保存場所
+;; (or lsp fasl)���篆�絖���贋��->lsp���篆�絖���贋��
 (defun fasldir2lspdir (dir)
   (assert (eq :absolute (car dir)))
   (if (subdirectory-p dir *fasl-dir-base*)
@@ -104,9 +104,9 @@
     dir))
 
 ;;; require for SC system
-;;; module-name を string-downcase したものに .lsp 拡張子をつけたファイルを
-;;; path-list の先頭から順に捜して読みに行く．
-;;; compile-file 済みで，.lsp より新しい場合はコンパイル版を読みにいく
+;;; module-name ��� string-downcase ��������������� .lsp ��≦宍絖������ゃ����������＜�ゃ�����
+;;; path-list ������������������������������茯���帥��茵����鐚�
+;;; compile-file 羝���帥�э��.lsp ��������違�������翫�������潟�潟����ゃ��������茯���帥��������
 (defmacro require (&rest args)
   `(eval-when (:compile-toplevel :load-toplevel :execute)
      (do-require ,@args)))
@@ -205,7 +205,7 @@
 
 (defpackage "SC"
   (:use)
-  (:import-from "CL"  ; defmacroで使えないのは不便なので
+  (:import-from "CL"  ; defmacro��т戎���������������筝�箴帥��������
                 "&ALLOW-OTHER-KEYS" "&AUX" "&KEY" "&OPTIONAL"
                 "&REST" "&BODY" "NIL"))
 
@@ -228,9 +228,9 @@
            "*CODE-PACKAGE*" "*CODE-READTABLE*"))
 
 (in-package "SC-FILE")
-;;;; SCソースを読むときのpackage
+;;;; SC��純�若�鴻��茯�������������package
 (defconstant *code-package* (find-package "SC"))
-;;;; SCソースを読むときのreadtable
+;;;; SC��純�若�鴻��茯�������������readtable
 (defconstant *code-readtable*
   #+readtable-case
   (let ((temp (copy-readtable nil)))
@@ -309,7 +309,7 @@
    ;; c2sc-parser.lsp
    "C2SC" "PIECE-C2SC" "*CLANG-PACKAGE*" "PCSC"))
 
-;; Cから変換された identifierを internする package
+;; C������紊������������� identifier��� intern������ package
 (defpackage "CSYM" (:use))
 
 (in-package "C2SC")
diff --git a/src/sc-main.lsp b/src/sc-main.lsp
index e8cd441a..259a6112 100644
--- a/src/sc-main.lsp
+++ b/src/sc-main.lsp
@@ -70,13 +70,13 @@
           ~(%defconstant RULE ,rule-list)
           )))
 
-;;; 中間ファイル出力＋メッセージ
+;;; 筝���������＜�ゃ����阪��鐚���＜����祉�若��
 (defun write-intermediate-file (pathname x)
   (format *error-output*
       "~&Writing an intermeidate file ~S...~%" (namestring pathname))
   (sc-file:write-sc-file pathname x))
 
-;;; 出力ファイル名
+;;; ��阪�������＜�ゃ�����
 (defun make-output-filename (output-file input-file
                              &optional (default-type "c"))
   (if (not input-file) (make-pathname :directory '(:relative)
@@ -95,15 +95,15 @@
 
 (defun sc2c (x
              &key
-             ((:rule rule-list) *rule-list-default* rulelist-specified) ;rule-setのリスト
-                                        ; 指定すると %rule で変更不可
-             (output-file nil outputfile-specified) ; 指定なしだと自動生成
-                                        ; 指定すると %output-file で変更不可
-             (sc2c-rule :sc2c sc2c-specified) ; 必要に応じて変更．nilだとCを生成しない
-                                        ; 指定すると %sc2c で変更不可
-             (intermediate nil)         ; 中間ファイルを出力するか？
-             (predefinitions '())       ; プログラムの先頭に追加するコード
-             (indent *indent-command*)  ; Cコードのインデントを揃える外部コマンド
+             ((:rule rule-list) *rule-list-default* rulelist-specified) ;rule-set��������鴻��
+                                        ; ���絎���������� %rule ��у����岩�����
+             (output-file nil outputfile-specified) ; ���絎�������������������������
+                                        ; ���絎���������� %output-file ��у����岩�����
+             (sc2c-rule :sc2c sc2c-specified) ; 綽�荀����綽�������紊���器��nil������C������������������
+                                        ; ���絎���������� %sc2c ��у����岩�����
+             (intermediate nil)         ; 筝���������＜�ゃ�������阪�����������鐚�
+             (predefinitions '())       ; ��������違�����������������菴遵����������潟�若��
+             (indent *indent-command*)  ; C��潟�若�������ゃ�潟����潟��������������紊������潟����潟��
              &aux
              (input-file nil)
              (input-file-path "./"))
@@ -113,8 +113,8 @@
                  (indent *indent-command*) ...)
 Compiles SC-program specified by X into C-program.
 X is an S-expression or a filespec."
-  ;;;;; 入力S式 => x
-  ;; 入力ファイル中のシンボル中は、*code-package*に登録される。
+  ;;;;; ��ュ��S綣� => x
+  ;; ��ュ�������＜�ゃ��筝������激�潟�����筝�������*code-package*�����脂�蚊�����������
   (when (or (pathnamep x) (stringp x))
     (unless (setq input-file (or (and (probe-file x) x)
                                  (let ((sc-file (change-extension x "sc")))
@@ -123,7 +123,7 @@ X is an S-expression or a filespec."
     (setq input-file-path
       (make-pathname :directory (pathname-directory input-file)))
     (setq x (sc-file:read-sc-file input-file)))
-  ;; 出力ファイル名
+  ;; ��阪�������＜�ゃ�����
   (setq output-file (make-output-filename output-file input-file))
 
   ;; append user's predefinitions
@@ -131,18 +131,18 @@ X is an S-expression or a filespec."
                    :input-file input-file :rule-list rule-list)
                   predefinitions x))
 
-  ;; 変換実行
+  ;; 紊����絎�茵�
   (rule:with-setup-generate-id          ; prepare a table of used variables
       ;; sc2c
       (let* ((include-path (list input-file-path scr:*sc-system-path*))
-             (rule-modifier (if rulelist-specified ; コマンドラインで指定されていたら
-                                #'identity ; 変更を認めない
+             (rule-modifier (if rulelist-specified ; ��潟����潟�������ゃ�潟�ф��絎�������������������
+                                #'identity ; 紊���眼��茯����������
                               #'(lambda (rlist) (setq rule-list rlist))) )
-             (sc2c-modifier (if sc2c-specified ; コマンドラインで指定されていたら
-                                #'identity ; 変更を認めない
+             (sc2c-modifier (if sc2c-specified ; ��潟����潟�������ゃ�潟�ф��絎�������������������
+                                #'identity ; 紊���眼��茯����������
                               #'(lambda (new-sc2c) (setq sc2c-rule new-sc2c))))
-             (ofile-modifier (if outputfile-specified ; コマンドラインで指定されていたら
-                                 #'identity ; 変更を認めない
+             (ofile-modifier (if outputfile-specified ; ��潟����潟�������ゃ�潟�ф��絎�������������������
+                                 #'identity ; 紊���眼��茯����������
                                #'(lambda (newo)
                                    (setq output-file
                                      (make-output-filename newo input-file)))))
@@ -150,7 +150,7 @@ X is an S-expression or a filespec."
                                      :include-path include-path
                                      :sc2c-modifier sc2c-modifier
                                      :ofile-modifier ofile-modifier)))
-        ;; apply scpp (%rule の適用を許す)
+        ;; apply scpp (%rule ������������荐宴��)
         ;;(format *error-output* "~&>>> Applying SCPP...~%")
         ;;(force-output *error-output*)
         (setq x (apply #'scpp:scpp x :rule-modifier rule-modifier
@@ -180,7 +180,7 @@ X is an S-expression or a filespec."
               ;; apply scpp
               ;;(format *error-output* "~&>>> Applying SCPP...~%")
               ;;(force-output *error-output*)
-              (setq x (apply #'scpp:scpp x common-scpp-args))
+              (setq x (apply #'scpp:scpp (append predefinitions x) common-scpp-args))
               ;; write to intermediate file (preprocessed) if requried
               (when intermediate
                 (write-intermediate-file
diff --git a/src/sc-misc.lsp b/src/sc-misc.lsp
index 8078e343..bdd08edb 100644
--- a/src/sc-misc.lsp
+++ b/src/sc-misc.lsp
@@ -35,7 +35,7 @@
 
 #-sc-system
 (progn
-  ;; sc-declと同一（なんとかしたい）
+  ;; sc-decl������筝�鐚����������������������鐚�
   (defpackage "MISC"
     (:use "CL")
     (:export 
@@ -81,7 +81,7 @@
 
 ;;;;;
 
-;;; 新しい変数名を作る（マクロ記述用）
+;;; ��違�����紊���医�����篏����鐚����������荐�菴亥��鐚�
 (eval-when (:compile-toplevel :load-toplevel :execute)
   (defmacro with-fresh-variables (varlist &body body)
     `(let ,(mapcar
@@ -97,10 +97,10 @@
     `(multiple-value-bind ,syms ,init ,@body)))
 (defmacro with* (binds &body body)
   (if (endp binds)
-      `(let () ,@body)                  ; prognにすると先頭にdeclareとかが書けない
+      `(let () ,@body)                  ; progn���������������������declare�����������吾��������
     `(with1 ,(car binds) ,(cadr binds)
        (with* ,(cddr binds) ,@body))))
-;; multiple-value に対応させるため単純なletを使った実装としていない
+;; multiple-value ���絲上��������������������膣����let���篏帥�ｃ��絎�茖�������������������
 (defmacro with (binds &body body)
   (let ((kari-syms (loop for bind on binds by #'cddr 
                        if (atom (car bind))
@@ -161,7 +161,7 @@
                ,@(cdr cl1))
            (acond ,@(cdr clauses)))))))
 
-;;; コマンドラインの実行（実装依存部分を吸収）
+;;; ��潟����潟�������ゃ�潟��絎�茵�鐚�絎�茖�箴�絖������������後��鐚�
 #+(and allegro mswindows) (defparameter *sh-command* "\\cygwin\\bin\\sh.exe")
 #+(or allegro kcl ecl cmu clisp)
 (defun command-line (command &key args verbose other-options)
@@ -194,14 +194,14 @@
            other-options)
     ))
 
-;;;;; ファイル操作
+;;;;; �����＜�ゃ�����篏�
 
-;;; *readtable* を一時的に切替え
+;;; *readtable* ���筝���������������帥��
 (defmacro with-readtable (readtable &body forms)
   `(let ((*readtable* ,readtable))
      ,@forms))
 
-;;; *package* を一時的に切替え
+;;; *package* ���筝���������������帥��
 (defmacro with-package (package &body forms)
   (let ((package-var (gensym "package")))
     `(let ((,package-var (find-package ,package)))
@@ -210,12 +210,12 @@
        (let ((*package* ,package-var))
          ,@forms)) ))
 
-;;; pname のパッケージが見つからなければ新たに作って返す
+;;; pname �����������宴�若�吾��荀���ゃ����������������井�違�����篏���ｃ��菴����
 (defun find-package2 (pname &rest args)
   (or (find-package pname)
       (apply #'make-package pname args)))
 
-;;; ファイルをS式として読み込む
+;;; �����＜�ゃ�����S綣����������茯���粋昭���
 (defun read-file (file-name
                   &key
                   ((:package *package*) *package*)
@@ -228,13 +228,13 @@
         ((eq y 'eof) (nreverse ret))
       (push y ret))))
 
-;;; ファイルを文字列として読み込む
+;;; �����＜�ゃ��������絖�������������茯���粋昭���
 (defun read-file-as-string (file-name)
   (with-open-file (istream file-name :direction :input)
     (input-buffer-to-string istream)))
 
 #+allegro (defparameter *eol-convention* :unix)
-;;; ファイルにS式または文字列を書き込む
+;;; �����＜�ゃ�����S綣���障��������絖���������吾��莨若��
 (defun write-file (file-name list 
                    &key
                    (overwrite nil) (write-string nil)
@@ -255,7 +255,7 @@
         (format ostream "~S" elm)
         (terpri ostream)))))
 
-;; eofか?
+;; eof���?
 (defun eof-p (stream)
   (let ((ch (read-char-no-hang stream nil t)))
     (cond
@@ -267,13 +267,13 @@
      (t
       nil))))
 
-;; ファイルの1行ごとの処理
+;; �����＜�ゃ�����1茵����������������
 (defmacro do-text-line ((line istream &optional ret) &body body)
   `(do ((,line (read-line ,istream nil) (read-line ,istream nil)))
        ((null ,line) ,ret)
      ,@body))
 
-;; input-stream のバッファにたまっているものに対しての処理
+;; input-stream ��������������＜�������障�ｃ�����������������絲障��������������
 (defmacro do-input-stream-buffer ((var istream &optional ret) &body body)
   (with-fresh-variables (is-var)
     `(let ((,is-var ,istream))
@@ -282,7 +282,7 @@
            ((null ,var) ,ret)
          ,@body))))
 
-;; input-stream のバッファにたまっているものをoutput-streamに流す
+;; input-stream ��������������＜�������障�ｃ�����������������output-stream���羌����
 (defun input-buffer-to-output (istream &rest ostreams &aux (cnt 0))
   (do-input-stream-buffer (ch istream cnt)
     (incf cnt)
@@ -290,12 +290,12 @@
       (write-char ch ost))
     ))
 
-;; input-stream のバッファにたまっているものを文字列に変換
+;; input-stream ��������������＜�������障�ｃ��������������������絖�������紊����
 (defun input-buffer-to-string (istream)
   (with-output-to-string (os)
     (input-buffer-to-output istream os)))
 
-;; ディレクトリの合成
+;; �����ｃ��������������������
 (defun directory+ (&rest pathname-or-directories)
   (cond
    ((endp pathname-or-directories) '(:relative))
@@ -312,8 +312,8 @@
        ((eq :relative (car pd2)) (apply #'directory+ (append pd1 (cdr pd2)) rest-args))
        (t (error "Unexpected value of pd2: ~S" (second pathname-or-directories))))))))
 
-;;; path-list および現在のディレクトリ(current-directory=tの時)
-;;; からファイルを検索
+;;; path-list ��������括憜����������ｃ�����������(current-directory=t������)
+;;; �����������＜�ゃ�����罎�膣�
 (defun path-search (filespec path-list
                     &key
                     (current-directory t)
@@ -332,7 +332,7 @@
         (when (probe-file candidate)
           (return candidate))))))
 
-;;; （ディレクトリを換えずに）ファイル名を変換
+;;; 鐚������ｃ��������������������������鐚������＜�ゃ��������紊����
 (defun change-filename (pathname newfilename)
   (unless (pathnamep pathname)
     (setq pathname (pathname pathname)))
@@ -341,7 +341,7 @@
    :type (pathname-type newfilename)
    :directory (pathname-directory pathname)))
 
-;;; ファイル名の拡張子変換, なければ追加
+;;; �����＜�ゃ����������≦宍絖�紊����, �����������域申���
 (defun change-extension (pathname newext)
   (unless (pathnamep pathname)
     (setq pathname (pathname pathname)))
@@ -363,7 +363,7 @@
             )
   )
 
-;;; ファイル名の拡張子獲得
+;;; �����＜�ゃ����������≦宍絖���峨��
 (defun get-extension (pathname)
   (let* ((pathstring (namestring pathname))
          (i (when pathstring (position #\. pathstring :test #'char=))))
@@ -371,7 +371,7 @@
         (subseq pathstring (1+ i))
       "" )))
 
-;;; ファイルの新旧比較
+;;; �����＜�ゃ�������井�ф��莠�
 (defun file-newer (path1 path2)
   (let ((exists1-p (probe-file path1))
         (exists2-p (probe-file path2)))
@@ -384,13 +384,13 @@
       (> (file-write-date path1)
          (file-write-date path2))))))
 
-;;; CLTLにないnamestring系
+;;; CLTL���������namestring膤�
 (defun name-namestring (pathname)
   (namestring (make-pathname :name (pathname-name pathname))))
 
-;;;;;; 文字列操作
+;;;;;; ���絖�������篏�
 
-;;; 大文字／小文字の逆転
+;;; 紊ф��絖�鐚鎞����絖�������荵�
 (defun char-invertcase (char)
   (cond
    ((char<= #\a char #\z)
@@ -408,8 +408,8 @@
   (declare (string str))
   (map 'string #'char-invertcase str))
 
-;;; str2 が str1 で始まる文字列なら、
-;;; その残りの文字列 (need-remain=t)またはt(need-remain=nil)を返す
+;;; str2 ��� str1 ��у����障�����絖�������������
+;;; ������罧����������絖���� (need-remain=t)��障�����t(need-remain=nil)���菴����
 (defun string-begin-with (str1 str2 &optional (need-remain t)) 
   (declare (string str1 str2))
   (with (len1 (length str1)
@@ -419,44 +419,44 @@
              always (char= (aref str1 i) (aref str2 i)))
          (if need-remain (string-left-ntrim str2 len1) t))))
 
-;;; character or string or symbol のリストを文字列として結合
+;;; character or string or symbol ��������鴻��������絖�������������腟����
 (defun string+ (&rest strings)
   (declare (list strings))
   (apply #'concatenate 'string
          (mapcar #'string strings)))
 
-;;; tree内にある全ての文字列を結合
+;;; tree������������������������絖�������腟����
 (defun string+-rec (&rest trees)
   (declare (list trees))
   (with-output-to-string (s)
     (do-all-atoms #'(lambda (x) (when x (princ x s)))
       trees)))
 
-;;; リスト内の文字列を結合
+;;; �����鴻�����������絖�������腟����
 (defun strcat (string-list &optional (inter "") (prev "") (post ""))
   (declare (list string-list))
   (apply #'string+
          (separate-list string-list inter prev post)))
 
-;;; 文字列参照
+;;; ���絖����������
 (defun string-ref (str n)
   (declare (string str) (fixnum n))
   (if (>= n (length str))
       nil
     (aref str n)))
 
-;;; 文字列追加
+;;; ���絖����菴遵��
 (defmacro add-string (str &rest slist)
   (let ((newstr (nconc `(concatenate 'string ,str) slist)))
     `(setq ,str ,newstr)))
 
-;;; 文字列ををopenとcloseで囲む．
-;;; openを与えてcloseを与えなければclose:=open
+;;; ���絖����������open���close��у�蚊��鐚�
+;;; open���筝�������close���筝����������������close:=open
 (defun add-paren (str &optional (open #\( open-p)
                                 (close (if open-p open #\))))
   (string+ open str close))
 
-;;; 最初のn文字
+;;; ���������n���絖�
 (defun string-firstn (str n &optional (ellipsis "..."))
   (declare (string str ellipsis) (fixnum n))
   (with-output-to-string (s-out)
@@ -469,13 +469,13 @@
             (when (and ellipsis (read-char s-in nil nil))
               (write-string ellipsis s-out))))))
 
-;;; n文字削除
+;;; n���絖�������
 (defun string-left-ntrim (str &optional (n 1))
   (declare (string str) (fixnum n))
   (values (subseq str n)
           (subseq str 0 n)))
 
-;;; 左から条件に合う文字を削除
+;;; 綏���������＞散������������絖����������
 (defun string-left-trim-if (str func)
   (declare (string str) (function func))
   (if (or (string= "" str)
@@ -490,13 +490,13 @@
            (values (concatenate 'string curr)
                    (concatenate 'string str-list)))))))
 
-;;; 右から条件に合う文字を削除
+;;; �劻�������＞散������������絖����������
 (defun string-right-trim-if (str func)
   (declare (string str) (function func))
   (let ((str2 (copy-seq str)))
     (nreverse (string-left-trim-if (nreverse str2) func))))
 
-;;; 空白削除
+;;; 腥榊�遵�����
 (defun string-left-trim-space (str)
   (declare (string str))
   (string-left-trim-if
@@ -509,7 +509,7 @@
   (let ((str2 (copy-seq str)))
     (nreverse (string-left-trim-space (nreverse str2)))))
 
-;;; 空白でないものを削除
+;;; 腥榊�純�с��������������������
 (defun string-left-trim-notspace (str)
   (declare (string str))
   (string-left-trim-if
@@ -523,7 +523,7 @@
   (let ((str2 (copy-seq str)))
     (nreverse (string-left-trim-notspace (nreverse str2)))))
 
-;; chの部分をstrに置き換える
+;; ch������������str���臀�������������
 (defun substitute-string (newstr oldch str)
   (declare (string newstr str) (character oldch))
   (with-output-to-string (ost)
@@ -534,7 +534,7 @@
                    (write-char ch ost)))
          str)))
 
-;; 文字列strをcharsに含まれる文字で分割してリストにする
+;; ���絖����str���chars��������障��������絖���у����蚊����������鴻�����������
 (defun split-string (str &optional (chars '(#\Tab #\Newline #\Page #\Return #\Space))
                      &aux (ret (list)))
   (declare (string str))
@@ -555,7 +555,7 @@
                 (write-char ch s-out)))
             ret))))
 
-;; 文字列strを最初のcharsに含まれる文字で分割して2要素のリストで返す
+;; ���絖����str������������chars��������障��������絖���у����蚊�����2荀�膣���������鴻����ц�����
 (defun split-string-1 (str &optional (chars '(#\Tab #\Newline #\Page #\Return #\Space)))
   (declare (string str))
   (setq chars (mklist chars))
@@ -575,7 +575,7 @@
                 (write-char ch s-out)))))
       (list ret1 ret2))))
 
-;; caseの文字列版
+;; case������絖�������
 (defmacro string-case (exp &body case-clauses)
   (with-fresh-variables (exp-var)
     `(let ((,exp-var ,exp))
@@ -594,8 +594,8 @@
                            (mklist (car clause))))
                     ,@(cdr clause)))))))))
 
-;; string-caseの高速版：expが与えらえた文字列のどれかであることを仮定し，
-;; 先頭部分だけで判断することで高速に判定
+;; string-case���蕭�������鐚�exp���筝����������������絖������������������с��������������篁�絎����鐚�
+;; ��������������������у�ゆ����������������ч����������ゅ��
 (defmacro string-case-eager (exp &body case-clauses)
   (with-fresh-variables (x-var len-var bl-var otw-tag)
     (let* ((otw-action (list `(error "No string matched ~S." ,x-var)))
@@ -613,7 +613,7 @@
                           (error "syntax error in string-case-opt."))))))
       (labels ((iter (i str-tag-list)   ; list of ("..." . <goto-tag>)
                  ;; (print `(iter ,i ,str-tag-list))
-                 (if (with1 tag1 (cdar str-tag-list) ; 全てのタグが同じ
+                 (if (with1 tag1 (cdar str-tag-list) ; �����������帥�違��������
                        (every #'(lambda (x) (eq tag1 (cdr x)))
                               (cdr str-tag-list)))
                      `(go ,(cdar str-tag-list))
@@ -645,21 +645,21 @@
                ,otw-tag
                (return-from ,bl-var (progn ,@otw-action)))))))))
                  
-;;;;;; multiple-value 関連
+;;;;;; multiple-value ��∫��
 (defmacro nth-multiple-value (n form)
   `(nth ,n (multiple-value-list ,form)))
 
-;;;;;; シンボル操作
+;;;;;; ��激�潟��������篏�
 
-;;; 値の交換
+;;; ��ゃ��篋ゆ��
 (defmacro swap (place1 place2)
   (let ((temp (gensym)))
     `(let ((,temp ,place1))
        (setf ,place1 ,place2
              ,place2 ,temp))))
 
-;;; x 中の pkg2 に登録されているシンボル( inherited も含む )
-;;; を pkg1 に登録し直したものを返す
+;;; x 筝���� pkg2 �����脂�蚊����������������激�潟�����( inherited ��������� )
+;;; ��� pkg1 �����脂�蚊����眼��������������菴����
 (defun immigrate-package (x pkg1 &optional pkg2)
   (declare (package pkg1))
   (map-all-atoms 
@@ -689,7 +689,7 @@
         (intern symstr package)
       (make-symbol symstr))))
 
-;;; 登録されているpackgeに依らず，シンボル名が同じがどうかを判定
+;;; ��脂�蚊��������������packge���箴�������鐚���激�潟����������������������������������ゅ��
 (defun symbol= (sym1 sym2)
   (declare (symbol sym1 sym2))
   (and
@@ -703,9 +703,9 @@
   (and (symbolp x)
        (funcall test name (symbol-name x))))
 
-;;;;;; リスト操作
+;;;;;; �����鴻�����篏�
 
-;;; list を `(,@prev ,el1 ,@inter ,el2 ,@inter ... ,eln ,@post)
+;;; list ��� `(,@prev ,el1 ,@inter ,el2 ,@inter ... ,eln ,@post)
 (defun separate-list (elms separator
                       &optional (head nil head-p) (tail nil tail-p))
   (declare (list elms))
@@ -725,35 +725,35 @@
       ((endp cur)
        (if prev prev test-not))))
 
-;;; リストの末尾に要素追加
+;;; �����鴻��������絨障��荀�膣�菴遵��
 (defmacro add-element (place &rest elist)
   `(setf ,place (nconc ,place ,`(list ,@elist)))) 
 
-;;; 複数回のpushを一度に書く
+;;; 茲���医�����push���筝�綺������吾��
 (defmacro pushs (&rest args &aux (place (car (last args))))
   `(progn
      ,@(mapcar #'(lambda (x)
                    `(push ,x ,place))
                (butlast args))))
 
-;; listのn番目の直前に xs をappendしたものを返す（n=0でappendと同じ）
+;; list���n�����������翫����� xs ���append���������������菴����鐚�n=0���append���������鐚�
 (defun insert (xs list &optional (n 0))
   (declare (list xs list) (fixnum n))
   (multiple-value-bind (prev post)
       (list-until list (nthcdr n list))
     (nconc prev (append xs post))))
 
-;; listのn番目の直前に x をconsしたものを返す（n=0でconsと同じ）
+;; list���n�����������翫����� x ���cons���������������菴����鐚�n=0���cons���������鐚�
 (defun insert1 (x list &optional (n 0))
   (declare (list list) (fixnum n))
   (insert (list x) list n))
 
-;;; リストの先頭n要素の複製を返す
+;;; �����鴻�����������n荀�膣����茲�茖純��菴����
 (defun firstn (xs &optional (n 1))
   (declare (list xs) (fixnum n))
   (loop repeat n as x in xs collect x))
 
-;;; リストのn番目をnew に置き換えたのものを返す
+;;; �����鴻�����n���������new ���臀�������������������������菴����
 ;;; n-new-list == (n1 new1 n2 new2 ...)
 ;; > (substitute-n '(1 2 3 4) 1 nil 2 10)
 ;; (1 nil 10 4)
@@ -784,7 +784,7 @@
                    (rec (cdr focus) (cons 'cdr acc)))))))
     (rec list nil)))
 
-;;; リストの要素を :key の要素が :test の意味で等しいもの同士でまとめる
+;;; �����鴻�����荀�膣���� :key ���荀�膣���� :test ��������潟�х�����������������紕���с�障��������
 ;; > (assort '((1 2) (1 3) (3 4) (2 5) (9 3) (3 2)) :key #'car)
 ;; (((9 3)) ((2 5)) ((3 2) (3 4)) ((1 3) (1 2)))
 (defun assort (lst &key (test #'eql) (key #'identity))
@@ -796,8 +796,8 @@
             (push elm (cdar it))
           (push (cons keyval (list elm)) retval))))))
 
-;; リストの順番を保存するassort
-;; assortの実装に依存する実装なので注意
+;; �����鴻��������������篆�絖�������assort
+;; assort���絎�茖����箴�絖�������絎�茖���������ф絵���
 ;; > (stable-assort '((1 2) (1 3) (3 4) (2 5) (9 3) (3 2)) :key #'car)
 ;; (((1 2) (1 3)) ((3 4) (3 2)) ((2 5)) ((9 3)))
 (defun stable-assort (lst &key (test #'eql) (key #'identity))
@@ -805,8 +805,8 @@
   (nreverse (mapcar #'nreverse (assort lst :test test :key key))))
 
 
-;;; リストの各要素を :testで判定して (非nilになったもののリスト nilになったもののリスト）
-;;; を返す
+;;; �����鴻��������荀�膣���� :test��у�ゅ�������� (���nil��������ｃ����������������鴻�� nil��������ｃ����������������鴻��鐚�
+;;; ���菴����
 (defun assort-bool (lst &key (test #'identity) (key #'identity))
   (loop for x in lst
       as tf = (funcall test (funcall key x))
@@ -819,7 +819,7 @@
 (defun stable-assort-bool (&rest args)
   (apply #'assort-bool args))
  
-;; リストの中から与えられた基準での最高要素を見付ける
+;; �����鴻�����筝�������筝���������������堺����с�����蕭�荀�膣����荀�篁�������
 (defun find-max (lst &key (test #'>) (key #'identity))
   (declare (list lst) (function test key))
   (let* ((ret (car lst))
@@ -832,7 +832,7 @@
           (cdr lst))
     (values ret ret-key)))
 
-;; リストの中から最初に条件に合ったものを除いて，除いたものを返す
+;; �����鴻�����筝������������������＞散��������ｃ�������������ゃ�����鐚���ゃ��������������菴����
 (defmacro find-pop (place test &key (key #'identity))
   (with-fresh-variables (test-var key-var prev-var x-var)
     `(let ((,test-var ,test)
@@ -847,17 +847,17 @@
              do (rplacd ,prev-var (cddr ,prev-var))
                 (return ,x-var))))))
 
-;; 中間値
+;; 筝�������
 (defun median (lst &key (test #'>) (key #'identity))
   (declare (list lst) (function test key))
   (nth (truncate (/ (length lst) 2))
        (sort (copy-list lst) test :key key)))
 
-;;; listでない引数をリスト化
+;;; list��с�����綣���違�������鴻�����
 (defun mklist (obj)
   (if (listp obj) obj (list obj)))
 
-;;; リストの末尾にobjを追加
+;;; �����鴻��������絨障��obj���菴遵��
 (defun append1 (lst obj)
   (declare (list lst))
   (append lst (list obj)))
@@ -865,7 +865,7 @@
   (declare (list lst))
   (nconc lst (list obj)))
 
-;;; リストの長さと整数を比較
+;;; �����鴻�������激�������贋�違��罸�莠�
 (defun list-length>= (list n)
   (declare (list list) (fixnum n))
   (if (endp list) (<= n 0)
@@ -882,13 +882,13 @@
                      (return (endp (cdr rest)))))))
 
 
-;;; リストからランダムで一要素選択
+;;; �����鴻�������������潟�������т��荀�膣���御��
 (defun list-random-select (list &optional (len (length list)))
   (nth (random len) list))
 
-;;;;; 集合演算
+;;;;; ������羲�膊�
 
-;;; 巾集合
+;;; 綏冗�����
 (defun power-set (list)
   (declare (list list))
   (if (endp list)
@@ -898,9 +898,9 @@
               (mapcar (prefixed-func #'cons (car list))
                       remain-power-set)))))
 
-;;; list の p と同じ要素の直前までの部分のコピーと
-;;; その要素以後のリストを返す。
-;;; test = #'eq , key = #'identity のときは ldiff とほぼ同じ
+;;; list ��� p ���������荀�膣������翫����障�с�������������潟����若��
+;;; ������荀�膣�篁ュ����������鴻�����菴�������
+;;; test = #'eq , key = #'identity ������������ ldiff �����祉�弱�����
 (defun list-until (list p &key (test #'eq) (key #'identity))
   (declare (list list) (function test key))
   (labels ((l-u-tail (list acc)
@@ -911,8 +911,8 @@
                (l-u-tail (cdr list) (cons (car list) acc)))))
     (l-u-tail list nil)))
 
-;;; 先頭の共通部分数だけ，第一リストからコピーして返す
-;;; 第二返り値で各givenリストの共通部分の残りをリストにして返す
+;;; �����������演����������違�����鐚�膃�筝������鴻����������潟����若�����菴����
+;;; 膃�篋�菴������ゃ�у��given�����鴻�������演�����������罧������������鴻�����������菴����
 (defun head-intersection (test list &rest lists)
   (declare (function test) (list list))
   (if (not lists) (values (copy-list list) (list nil))
@@ -928,8 +928,8 @@
            (values (nreverse ret) (cons cur-list cur-lists)))
         (push (car cur-elms) ret)))))
 
-;;; list のcd..dr を順に調べ，testを満たす直前までのコピーと
-;;; その要素以後のリストを返す．
+;;; list ���cd..dr ���������茯帥�刻��test���羣���������翫����障�с����潟����若��
+;;; ������荀�膣�篁ュ����������鴻�����菴����鐚�
 (defun list-until-if (test list &key (key #'identity))
   (declare (function test key) (list list))
   (list-until list t 
@@ -1059,7 +1059,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
              (rplacd prev (cddr prev))
              (return x)))))
 
-;;;;;; ハッシュテーブル
+;;;;;; ��������激�ャ����若�����
 (defun list-to-hashtable (list &optional (default-value t)
                           &rest make-hash-table-args)
   (declare (list list))
@@ -1078,16 +1078,16 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
         do (setf (gethash key ret-hashtable) val))
     ret-hashtable))
 
-;;;;;; 高階関数ユーティリティ
+;;;;;; 蕭������∽�違����若����ｃ��������
 
-;;; 定数を返す関数
+;;; 絎���違��菴������∽��
 (defun const-f (&rest values)
   #'(lambda (&rest dummy)
       (declare (ignore dummy))
       (values-list values)))
 
-;;; 途中でnilがでたら中断してnilを返すmapcar
-;;; multiple-value 対応
+;;; ���筝����nil�����с�����筝����������nil���菴����mapcar
+;;; multiple-value 絲上��
 (defun check-mapcar (func list)
   (declare (function func) (list list))
   (catch 'suspend
@@ -1111,8 +1111,8 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
                (apply #'rmapcar fn args))
            args)))
 
-;;; treeの全てのatom要素にfnを適用する
-;;; 返り値はarg自身
+;;; tree������������atom荀�膣����fn���������������
+;;; 菴������ゃ��arg���荳�
 (defun do-all-atoms (fn tree)
   (declare (function fn) (list tree))
   (if (atom tree)
@@ -1121,7 +1121,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
       (map-all-atoms fn (car tree))
       (map-all-atoms fn (cdr tree)))))
 
-;;; treeの全てのatom要素を，fnを適用した結果に置き換えたtreeを生成して返す
+;;; tree������������atom荀�膣����鐚�fn���������������腟�������臀�������������tree���������������菴����
 (defun map-all-atoms (fn tree)
   (declare (function fn) (list tree))
   (if (atom tree)
@@ -1129,12 +1129,12 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
     (cons (map-all-atoms fn (car tree))
 	  (map-all-atoms fn (cdr tree)))))
 
-;;; 非破壊的なmapcan
+;;; �����翫��������mapcan
 (defun mappend (fn &rest lists)
   (declare (function fn))
   (mapcan #'copy-list (apply #'mapcar fn lists)))
 
-;;; quoteされている式か
+;;; quote���������������綣����
 (defun quoted-p (exp)
   (and (consp exp)
        (eq 'quote (car exp))))
@@ -1192,7 +1192,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
   #'(lambda (&rest args)
       (some #'every fns args)))
 
-;; fun: 関数生成オペレータ (from "On Lisp")
+;; fun: ��∽�亥����������������若�� (from "On Lisp")
 (defmacro fun (expr) `#',(rbuild expr))
 (defun rbuild (expr)
   (if (or (atom expr) (eq (car expr) 'lambda))
@@ -1304,12 +1304,12 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
          (apply #'suffixed-func func suffixes)
          prefixes))
 
-;;; メッセージを表示してユーザーの入力を求める
+;;; ��＜����祉�若�吾��茵�腓冴����������若�吟�若����ュ�����羆�������
 (defun query (message)
   (format *error-output* "~A? " message)
   (read))
 
-;;; リストの中の要素を1つ、ユーザからの入力によって選ぶ
+;;; �����鴻�����筝����荀�膣����1��ゃ�������若�吟����������ュ����������ｃ����吾��
 (defun query-select-list (list &key
                                (print-elm #'write-to-string) 
                                (message "Select number"))
@@ -1325,7 +1325,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
           (setq user-input (query message)))
     (nth (1- user-input) list)))
 
-;;;;;;; エラー表示
+;;;;;;; ��������取；腓�
 
 ;; CL-USER> (error-indent ("In function ~S:" 'f)
 ;; 	   (iwarn "123")
@@ -1364,9 +1364,9 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
       do
         (fresh-line *error-output*)
         (format *error-output* "~A~%" annot))
-  ;; 一度表示したannotation は表示しない．
+  ;; 筝�綺�茵�腓冴�����annotation ���茵�腓冴��������鐚�
   (mapl #'(lambda (sl) (rplaca sl nil)) *error-annotations*)
-  (setq *error-annotations* nil))       ; 次のloopの手間を省くため
+  (setq *error-annotations* nil))       ; 罨＜��loop������������������������
 
 (defun ierror (&rest args)
   (print-annotations)
@@ -1385,12 +1385,12 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
   (format *error-output* "~A~?"
     *error-indent-spaces* fstr args))
 
-;;;;;;; デバッグ用ツール
+;;;;;;; �����������亥�������若��
 
-;;; recexpandに登録されているシンボルが先頭のフォームについては
-;;; 再帰的にmacroexpandする．
-;;; 実際に評価されるフォームかの判定（データとの区別）はしない
-;;; once が非nilなら最低一度はexpandする
+;;; recexpand�����脂�蚊����������������激�潟�������������������������若�������ゃ��������
+;;; ���絽亥�����macroexpand������鐚�
+;;; 絎�������荅�箴＜����������������若����������ゅ��鐚������若�帥�������阪�ワ��������������
+;;; once ������nil���������篏�筝�綺����expand������
 (defvar *recexpand-symbols* (list))
 (defvar *abbrev-symbols* (list))
 (defun macroexpand-rec (form &optional (once t))
@@ -1408,7 +1408,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
         as cur = (car rest)
         collect (macroexpand-rec2 cur)))))
 
-;;; *recexpand-symbols*への登録，削除
+;;; *recexpand-symbols*��吾����脂�駕��������
 (defun recexpand (&rest symbols)
   (setq *recexpand-symbols*
     (delete-duplicates (nconc *recexpand-symbols* symbols))))
@@ -1419,7 +1419,7 @@ Returns a list whose Nth element is (cons (nth x) (nth y))"
 (defun recexpand-clean ()
   (setq *recexpand-symbols* nil))
 
-;;; *abbrev-symbols*への登録，削除
+;;; *abbrev-symbols*��吾����脂�駕��������
 (defun recexpand-abbrev (&rest symbols)
   (setq *abbrev-symbols*
     (delete-duplicates (nconc *abbrev-symbols* symbols))))
diff --git a/src/scpp.lsp b/src/scpp.lsp
index 63d1c410..5a2899ca 100644
--- a/src/scpp.lsp
+++ b/src/scpp.lsp
@@ -1,4 +1,4 @@
-;;; Copyright (c) 2008 Tasuku Hiraishi <hiraisi@kuis.kyoto-u.ac.jp>
+;;; Copyright (c) 2008-2014 Tasuku Hiraishi <tasuku@media.kyoto-u.ac.jp>
 ;;; All rights reserved.
 
 ;;; Redistribution and use in source and binary forms, with or without
@@ -58,17 +58,20 @@
 (defconstant *scpp-macro-package* (find-package "SCPP-MACRO"))
 (defconstant *scpp-package* (find-package "SCPP"))
 
-(defparameter *cinclude-h-file* "cinclude_tmp") ; Cのヘッダをincludeする一時ヘッダ
-(defparameter *delete-c2sc-intermediate* nil) ; cinclude_tmp.h, *.se, *.se? を削除するか
-(defparameter *input-file-path* "./")   ; 入力ファイルの場所
-                                        ; cinclude_tmp.h の生成場所であり，
-                                        ; #include "..." のファイルの探索場所に影響する
-(defparameter *include-path-list* '("./")) ; %includeのヘッダファイルを探す場所
+(defparameter *cinclude-h-file* "cinclude_tmp") ; C���������������include������筝�������������
+(defparameter *delete-c2sc-intermediate* nil) ; cinclude_tmp.h, *.se, *.se? ��������ゃ��������
+(defparameter *input-file-path* "./")   ; ��ュ�������＜�ゃ�������贋��
+                                        ; cinclude_tmp.h �����������贋����с�����鐚�
+                                        ; #include "..." ��������＜�ゃ������｢膣√�贋�����綵演�帥�����
+(defparameter *include-path-list* '("./")) ; %include�����������������＜�ゃ������｢�����贋��
 
 (defvar *macro-entries* (make-hash-table :test #'eq)) ; macro-entries
-(defvar *rule-modifier* #'identity)     ; sc-main から渡される関数．rule-listを変更する．
-(defvar *sc2c-modifier* #'identity)     ; sc-main から渡される関数．sc2cに使うルールを変更する．
-(defvar *ofile-modifier* #'identity)    ; sc-main から渡される関数．出力ファイル名を変更する．
+(defvar *rule-modifier* #'identity)     ; sc-main ������羝＜����������∽�逸��rule-list���紊���眼�����鐚�
+(defvar *sc2c-modifier* #'identity)     ; sc-main ������羝＜����������∽�逸��sc2c���篏帥�������若�����紊���眼�����鐚�
+(defvar *ofile-modifier* #'identity)    ; sc-main ������羝＜����������∽�逸����阪�������＜�ゃ��������紊���眼�����鐚�
+
+(defvar *extracting-macro* (list))      ; List of macro symbols currently being extracted.
+					; (Such macros are not extracted more than onece recursively)
 
 (defstruct (macro-entry
             (:constructor create-macro-entry (type value)))
@@ -100,11 +103,11 @@
     (setq x (sc-file:read-sc-file x)))
   (scpp-list x))
 
-;; * Cに変換したときに同じidentifierで，
-;; * 同じpackageに登録されている
-;; symbolどうしはeqであることを保証できるようにするため，
-;; それと，*used-identifier* に使用した識別子が登録するため，
-;; make-id で識別子を作りなおす．
+;; * C���紊�������������������������identifier��э��
+;; * ������package�����脂�蚊��������������
+;; symbol������������eq��с��������������篆�荐若�с��������������������������鐚�
+;; ���������鐚�*used-identifier* ���篏睡��������茘���ュ�������脂�蚊�����������鐚�
+;; make-id ��ц����ュ�����篏�������������鐚�
 (defun entry-and-normalize-id (sym)
   (aif (rule:identifier0? sym :sc2c)
       (rule:make-id it (symbol-package sym))
@@ -118,7 +121,7 @@
    ((and (consp x)
          (symbolp (car x))
          (with1 sname (symbol-name (car x))
-           (and (> (length sname) 1)         ; `%' 演算子はだめなので >=2
+           (and (> (length sname) 1)         ; `%' 羲�膊�絖������������������� >=2
                 (char= #\% (aref sname 0)))))
     (case (car x)
       ((sc::%splice)
@@ -220,12 +223,11 @@
          (string-begin-with "%%" (symbol-name x) nil))
     '())
    (t
-    (with1 expand-ret (scpp-macroexpand x)
-      (if (atom expand-ret)
-          (list expand-ret)
-        (list (scpp-list expand-ret)))))))
+    ;; Macro expansion and recursive application of scpp-exp1.
+    (scpp-macroexpand x))
+   ))
 
-;; *cinclude-h-file* を作成
+;; *cinclude-h-file* ���篏����
 (defun make-cinclude-h (header-list
                         &optional (output-filename *cinclude-h-file*))
   (let ((output-file (make-pathname :name output-filename
@@ -242,7 +244,7 @@
                 :overwrite t :write-string t)
     output-file))
 
-;;;; マクロ処理
+;;;; ���������������
 
 ;; symbol -> macrosymbol
 #+obsolete                              ; replaced by entry-and-normalize-id
@@ -251,7 +253,7 @@
     (when macname
       (intern macname *scpp-macro-package*))))
 
-;; フィールドアクセスをC風に書けるようにする
+;; �����ｃ�若�������≪����祉�鴻��C蘂������吾��������������������
 ;; ~sc::f->x ==> ~(fref f -> x)
 (defun invert-case-if-mixed (str)
   (if (case-mixed-p str)
@@ -281,11 +283,11 @@
         (values (cons ~fref (nreverse symbol-list)) t)
       (values sym nil))))
 
-;; 検索: symbol-> {'macro, 'constant, nil}
+;; 罎�膣�: symbol-> {'macro, 'constant, nil}
 (defun macro-find (macsymbol)
   (gethash macsymbol *macro-entries*))
 
-;; 登録
+;; ��脂��
 ;; dm: a %defmacro/%defconstant form
 (defun entry-macro (dm &key (redefine-warn t) &aux entry-type entry-value)
   (let ((macsymbol (entry-and-normalize-id (second dm))))
@@ -308,39 +310,47 @@
     (setf (gethash macsymbol *macro-entries*) 
       (create-macro-entry entry-type entry-value))))
 
-;; 削除
+;; ������
 (defun delete-macro (macsymbol)
   ;; (makunbound macsymbol)
   (fmakunbound macsymbol)
   (remhash macsymbol *macro-entries*))
 
-;; 適用
-;; fref-idの展開や，identifierのnormalizeもここで
+;; Macro expansion and recursive application of scpp-exp1.
+;; Simple annotation for field references (e.g., "obj.a->b") is
+;; also expanded here (to "(fref (mref (fref obj a)) b)").
+;; When there is any expansion applied, scpp-exp1/scpp-list is applied
+;; recursively.
 (defun scpp-macroexpand (x
-                         &key (extracting-macro '()) ; 展開を行わないマクロ
                          &aux macsymbol macentry)
   (cond
    ((symbolp x)                         ; constant macro
     (multiple-value-bind (fref-exp expanded-p) (expand-fref-symbol x)
       (cond
-       (expanded-p (scpp-macroexpand fref-exp))
+       ;; Simple annotation for field references
+       (expanded-p
+	(scpp-1exp fref-exp))
        (t
         (setq macsymbol (entry-and-normalize-id x))
-        (if (and (not (member macsymbol extracting-macro))
+        (if (and (not (member macsymbol *extracting-macro*))
                  (setq macentry (macro-find macsymbol))
                  (eq 'constant (macro-entry-type macentry)))
-            (scpp-macroexpand (macro-entry-value macentry)
-                              :extracting-macro (cons macsymbol extracting-macro))
-          macsymbol)))))
+	    ;; Symbol macro (by %defconstant)
+	    (let ((*extracting-macro* (cons macsymbol *extracting-macro*)))
+	      (scpp-1exp (macro-entry-value macentry)))
+	  ;; Other symbol
+          (list macsymbol))))))
    ((consp x)                           ; (<macroname> ... )
     (if (and (symbolp (car x))
              (setq macsymbol (entry-and-normalize-id (car x)))
-             (not (member macsymbol extracting-macro))
+             (not (member macsymbol *extracting-macro*))
              (setq macentry (macro-find macsymbol))
              (eq 'macro (macro-entry-type macentry)))
-        ;; マクロ
-        (scpp-macroexpand (macroexpand-1 (cons macsymbol (cdr x)))
-                          :extracting-macro (cons macsymbol extracting-macro))
-      x))
-   ;; symbol以外のatom（number, stringなど）
-   (t x)))
+        ;; Macro (by %defmacro)
+	(let ((*extracting-macro* (cons macsymbol *extracting-macro*)))
+	  (scpp-1exp (macroexpand-1 (cons macsymbol (cdr x)))))
+      ;; Cons to which no macro can be applied.
+      (let ((*extracting-macro* ()))
+	(list (scpp-list x)))))
+   ;; Atom other than symbol (e.g., number string)
+   (t (list x))))
diff --git a/src/sct-defrule.lsp b/src/sct-defrule.lsp
index 72cb89ee..22756cb2 100644
--- a/src/sct-defrule.lsp
+++ b/src/sct-defrule.lsp
@@ -39,10 +39,10 @@
   (defconstant *rule-class-package* (find-package "RULE"))
   (defconstant *base-ruleset-class-name* (intern "RULESET" *rule-class-package*)))
 
-;; .rule ファイルが置いてあるディレクトリ
+;; .rule �����＜�ゃ�����臀������������������ｃ�����������
 (defvar *rule-path* (make-pathname :directory (directory+ scr:*sc-system-path* "rule/")))
 
-;;; default-handler指定用関数
+;;; default-handler���絎������∽��
 (defun rule:return-no-match (x)
   (declare (ignore x))
   'rule::no-match)
@@ -56,17 +56,17 @@
     (apply rule-func args))
   )
 
-;; Ruleset のベースクラス
+;; Ruleset ��������若�鴻��������
 (defclass #.*base-ruleset-class-name* ()
-  ((rule:entry :initform 'error-no-entry :type symbol) ; 最初に呼び出す規則名
+  ((rule:entry :initform 'error-no-entry :type symbol) ; �����������若�喝�冴��荀�������
    (rule:default-handler :initform #'rule:return-no-match :type function)))
 
-;; 現在適用中のruleset-class のインスタンス
+;; �憜��������筝����ruleset-class �����ゃ�潟�鴻�帥�潟��
 (defvar *current-ruleset* (make-instance *base-ruleset-class-name*))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
-;;; rule ファイルの読み込み
+;;; rule �����＜�ゃ�����茯���粋昭���
 (defun get-ruleset-modulename (ruleset)
   (string-downcase (string ruleset)))
 (defmacro rule:require-ruleset (ruleset)
@@ -93,29 +93,29 @@
       (warn "Initargs ~S are ignored." initargs))
     ruleset-name-or-instance)))
 
-;; 適用中のrulesetを変更
+;; ������筝����ruleset���紊����
 (defmacro with-ruleset (ruleset-instance &body body)
   `(let ((*current-ruleset* ,ruleset-instance))
      ,@body))
 
-;; デフォルトのentry: entryが無い旨のエラーを出す
+;; ������������������entry: entry�����＜����������������若����冴��
 (defun error-no-entry (dummy)
   (declare (ignore dummy))
   (error "~S has no entry point specified." *current-ruleset*))
 
-;; default-handlerを呼び出す
+;; default-handler�����若�喝�冴��
 (defun do-otherwise (x &optional (ruleset *current-ruleset*))
   (funcall (slot-value (the #.*base-ruleset-class-name* (ensure-ruleset-instance ruleset))
                        'rule:default-handler)
            x))
 
-;; ruleset名 -> class名
+;; ruleset��� -> class���
 (defun ruleset-class-symbol (sym)
   (declare (symbol sym))
   (immigrate-package sym *rule-class-package*))
 
-;; (ruleset-class-symbol適用済)ruleset名 -> デフォルトのruleset object
-;; memoizeにより，動的ロードのチェックとmake-instanceの複数回実行を回避
+;; (ruleset-class-symbol������羝�)ruleset��� -> ������������������ruleset object
+;; memoize���������鐚������������若����������с��������make-instance���茲���医��絎�茵����������
 (defun ruleset-default-object (class-sym)
   (declare (symbol class-sym))
   (rule:require-ruleset class-sym)
@@ -123,29 +123,29 @@
 (setf (symbol-function 'ruleset-default-object) 
   (memoize #'ruleset-default-object :test #'eq :size 50 :rehash-size 2))
 
-;; rule名 -> method名
+;; rule��� -> method���
 (defun rule-method-symbol (sym)
   (intern (string+ "<" (symbol-name sym) ">")
 	  *rule-class-package*))
 
-;; rule名 -> defun名
+;; rule��� -> defun���
 (defun rule-function-symbol (sym) sym)
 (defun rule-probe-function-symbol (sym)
   (symbol+ sym :?))
 (defun rule-warning-function-symbol (sym)
   (symbol+ sym :!))
 
-;; methodの引数（defruleの本体からこの名前で参照）
+;; method���綣���逸��defrule������篏���������������������у����э��
 (defun x-var ()
   (intern "X" *package*))
 
-;;;; ruleset, rule の定義・拡張用マクロ
+;;;; ruleset, rule ���絎�臂���紙�≦宍������������
 
 ;; define-ruleset
 (defmacro rule:define-ruleset (name parents &body parameters)
   `(progn
      (eval-when (:compile-toplevel :load-toplevel :execute)
-       ,@(loop    ; 親ルールの定義ファイルをロード
+       ,@(loop    ; 荀������若�����絎�臂������＜�ゃ����������若��
              for rs in (mapcar #'ruleset-class-symbol parents)
              collect `(rule:require-ruleset ',rs)))
      (provide ,(get-ruleset-modulename name))
@@ -172,8 +172,8 @@
     `(progn
        (unless (fboundp ',(rule-function-symbol name))
          ;; <rule-name>
-         ;; ユーザは↓の関数を使って間接的にmethod を呼ぶ．
-         ;; method を直接だといちいち第二引数にクラスオブジェクトを指定しないといけない．
+         ;; �����若�吟����������∽�違��篏帥�ｃ������･������method �����若�駈��
+         ;; method �����贋･�����������＜����∞��篋�綣���違����������鴻�������吾�с�����������絎�������������������������鐚�
          (defun ,(rule-function-symbol name)
              (x &optional (ruleset-name-or-instance *current-ruleset* r) &rest initargs)
            (if r
@@ -188,14 +188,14 @@
                form
              (list ',(rule-method-symbol name) x '*current-ruleset*)))
          (export ',(rule-function-symbol name))
-         ;; <rule-name>? rule::no-match のかわりにnilを返す
+         ;; <rule-name>? rule::no-match ���������������nil���菴����
          (defun ,(rule-probe-function-symbol name) (&rest args)
            (let ((ret-list (multiple-value-list (apply #',(rule-function-symbol name) args))))
              (when (eq 'rule::no-match (car ret-list))
                (rplaca ret-list nil))
              (values-list ret-list)))
          (export ',(rule-probe-function-symbol name))
-         ;; <rule-name>! rule::no-match ならwarningを出す
+         ;; <rule-name>! rule::no-match ������warning�����冴��
          (defun ,(rule-warning-function-symbol name) (&rest args)
            (let ((ret-list (multiple-value-list (apply #',(rule-function-symbol name) args))))
              (when (eq 'rule::no-match (car ret-list))
@@ -203,7 +203,7 @@
              (values-list ret-list)))
          (export ',(rule-warning-function-symbol name))
          )
-       ;; method本体
+       ;; method���篏�
        (,(if memoize-p 'defmethod-memo 'defmethod) ,(rule-method-symbol name) ,(rulemethod-args ruleset)
          ,.(when memoize-p (list (x-var)))
          (block ,name
@@ -230,11 +230,11 @@
            (block ,name
              (rule:cond-match ,(x-var)
                               ,@pats-act-list
-                              (otherwise (call-next-method))))))) ; ここがdefruleと違う
+                              (otherwise (call-next-method))))))) ; ���������defrule���������
     ))
 
-;; 次のルールをユーザが意図的に呼び出すための局所関数
-;; のfletの第二要素を作成
+;; 罨＜�������若����������若�吟�������括�������若�喝�冴�����������絮������∽��
+;; ���flet���膃�篋�荀�膣����篏����
 (defun make-call-next-rule ()
   (let ((x-var (gensym "X"))
         (xp-var (gensym "XP")))
@@ -244,12 +244,12 @@
           (call-next-method))))
     ))
 
-;; 変形規則のパラメータへのアクセス
-;; （実際はクラスインスタンスのメンバへのアクセス）
+;; 紊�綵∵����������������＜�若�帥�吾����≪����祉��
+;; 鐚�絎���������������鴻�ゃ�潟�鴻�帥�潟�鴻����＜�潟����吾����≪����祉�刻��
 (defmacro rule:ruleset-param (slot-name)
   `(slot-value *current-ruleset* ,slot-name))
 
-;; entryを呼び出す
+;; entry�����若�喝�冴��
 (defun rule:apply-rule (sc-code-or-filename ruleset-name-or-instance &rest initargs)
   (with-ruleset (apply #'ensure-ruleset-instance
                        ruleset-name-or-instance initargs)
diff --git a/src/sct-file.lsp b/src/sct-file.lsp
index 7e89c52b..d720ff81 100644
--- a/src/sct-file.lsp
+++ b/src/sct-file.lsp
@@ -37,42 +37,42 @@
 (scr:require "SC-MISC")
 (scr:require "SC-FILE")
 
-;;; rule に対応する .rule.lsp （rule.o） のうち最新のものをload
-;;; .rule が最新の場合はコンパイルしてからload
-;;; force-load が t なら ruleファイルが最新でも読み直す．
-;;; compile が t なら, .rule.lsp をコンパイルする
+;;; rule ���絲上�������� .rule.lsp 鐚�rule.o鐚� ��������≧����違�����������load
+;;; .rule ��������違����翫�������潟�潟����ゃ��������������load
+;;; force-load ��� t ������ rule�����＜�ゃ����������違�с��茯���睡�眼��鐚�
+;;; compile ��� t ������, .rule.lsp �����潟�潟����ゃ��������
 (defvar *force-recompile* nil)
 (defvar *compile-rulelsp* t)
 
 ;;;;;
 (defconstant *default-sct-user-package* (find-package "SC-TRANSFORMER-USER"))
-(defconstant *init-function-name* "INITIATE") ; 規則の変換を開始する関数名
-(defconstant *arg-name* "X")       ; パターン全体を参照するための変数名
+(defconstant *init-function-name* "INITIATE") ; 荀�������紊����������紮���������∽�医��
+(defconstant *arg-name* "X")       ; �����帥�若�喝��篏���������с��������������紊���医��
 (defconstant *rulepackage-varname* "*RULE-PACKAGE*")
 (defconstant *parameters-varname* "*PARAMETERS*")
 (defconstant *block-label* 'pattern-matched)
-(defvar *initiator-alist* (list)) ; Rule-set で最初に呼び出す関数
+(defvar *initiator-alist* (list)) ; Rule-set ��ф����������若�喝�冴����∽��
 
-;;;;; Rule-set ごとの設定
+;;;;; Rule-set ���������荐�絎�
 (defstruct (rule-environment
              (:constructor create-rule-environment (rule-name)))
   rule-name
-  (source-package *default-sct-user-package*) ; 普通は in-package で指定
-  (initiator :default)    ; rule-set を起動する関数
-  (package-sensitive t)   ; symbol の比較を package sensitive に行う
+  (source-package *default-sct-user-package*) ; ��������� in-package ��ф��絎�
+  (initiator :default)    ; rule-set ���莎桁����������∽��
+  (package-sensitive t)   ; symbol ���罸�莠���� package sensitive ���茵����
   (otherwise-action '(error "No pattern matched.")))
-					; パターンにマッチしなかったときの動作
+					; �����帥�若�潟����������������������ｃ��������������篏�
 (defvar *rule-environment* (create-rule-environment "DEFAULT"))
 
 ;;;;;
 
 
-;; 与えられた規則名に対応するruleファイルをlispプログラムにコンパイル
-;; 返り値は出力ファイル名
+;; 筝�������������荀����������絲上��������rule�����＜�ゃ�����lisp��������違����������潟�潟����ゃ��
+;; 菴������ゃ����阪�������＜�ゃ�����
 (defun rule2lsp (rule-name
 		 &aux input-file output-file rule-list lisp-forms
 		 (*rule-environment* (create-rule-environment rule-name)))
-  ;; 入力/出力ファイル名
+  ;; ��ュ��/��阪�������＜�ゃ�����
   (unless (setq input-file (get-rule-rulefile rule-name))
     (error "Can't find rule-file for ~S" rule-name))
   (setq output-file 
@@ -80,13 +80,13 @@
          :name (pathname-name (get-rule-lspfile-name rule-name))
          :directory (pathname-directory (truename input-file))))
   
-  ;; 規則ファイル読み込み
+  ;; 荀���������＜�ゃ��茯���粋昭���
   (format *error-output* "Reading ~S...~%" input-file)
   (finish-output *error-output*)
   (multiple-value-setq (rule-list lisp-forms)
     (read-rule input-file))
   
-  ;; 出力生成 => ret
+  ;; ��阪�������� => ret
   (format *error-output* "Compiling ~S...~%" input-file)
   (finish-output *error-output*)
   (let*
@@ -140,8 +140,8 @@
   output-file
   )
 
-;;; 変形規則ごとの設定 *rule-environment* の設定
-;;; rule-set の記述者が使う．
+;;; 紊�綵∵��������������荐�絎� *rule-environment* ���荐�絎�
+;;; rule-set ���荐�菴域�����篏帥��鐚�
 (defmacro set-rule-environment (&rest options)
   (when *rule-environment*
     (let ((opt (gensym))
@@ -164,7 +164,7 @@
                    `(progn ,@(cdr ,opt))
                    (second ,opt)))))))))
 
-;;; *rule-package* の環境を実際のload時と同じにする
+;;; *rule-package* �����医�����絎�������load���������������������
 #+obsolete
 (defun renew-rule-package-environment ()
   (let ((*package* *rule-package*))
@@ -177,16 +177,16 @@
 
 
 
-;;; 外部からの呼び出し用の規則symbol
+;;; 紊���������������若�喝�冴��������荀����symbol
 ;;; rule -> @rule
 (defun make-ext-rule-id (rule-id)
   (intern (string+ "@" (symbol-name rule-id))
           (symbol-package rule-id)))
 
-;;;; 規則ファイル読み込み（コンパイル実行用）
-;;; 返り値は (values rule-list lisp-forms)
+;;;; 荀���������＜�ゃ��茯���粋昭��随����潟�潟����ゃ��絎�茵����鐚�
+;;; 菴������ゃ�� (values rule-list lisp-forms)
 ;;; rule-list := list of (<fsymbol> . list of (<patterns> . <action>))
-;;; lisp-forms := <(%lisp ...) で記述されたフォームのリスト
+;;; lisp-forms := <(%lisp ...) ��ц��菴違����������������若����������鴻��
 (defun read-rule (rule-file
 		  &aux 
 		  (rule-list '())  ; return value1
@@ -205,8 +205,8 @@
         (push form lisp-forms)
         (eval form))
 
-      ;; *package* が defaultのままだったら
-      ;; defpackage, in-package を自動的に作る
+      ;; *package* ��� default�����障�障����ｃ�����
+      ;; defpackage, in-package ���������������篏����
       (when (eq *package* *default-sct-user-package*)
 	(let* ((rule-name (rule-environment-rule-name *rule-environment*))
 	       (add-forms `((defpackage ,rule-name
@@ -218,7 +218,7 @@
       (setf (rule-environment-source-package *rule-environment*)
             *package*)
 
-      ;; 変形規則本体の読み込み
+      ;; 紊�綵∵��������篏����茯���粋昭���
       (do ((y (read-pattern istream nil 'eof) 
 	      (read-pattern istream nil 'eof))
 	   (patlist '()))
@@ -237,10 +237,10 @@
 	  ((and (symbolp y)
 		(string= "->" (symbol-name y)))
 	   (setq y (read istream))	; y <== <action>
-	   ;; -> より前のパターンを rule-list に追加
+	   ;; -> �����������������帥�若�潟�� rule-list ���菴遵��
 	   ;;(format t "~S~%" y)
 	   (let ((fsymbol (caar patlist)))
-	     (let ((pos	   ; (<patterns> . <action>) の挿入位置
+	     (let ((pos	   ; (<patterns> . <action>) �����水�ヤ��臀�
 		    (car 
 		     (or (member fsymbol rule-list :key #'car :test #'eq)
 			 (push (cons fsymbol nil) rule-list)))))
@@ -271,15 +271,15 @@
 
 ;; pat-act-list = list of <pat-act>
 ;; pat-act = ( ((pattern ,@rest-arg) ...) . action)
-;; 1つの rulenameに対応するdefun式のリストを生成する．
-;; 返り値：(values <defunのリスト> <最初のパターンマッチを起動するためのform>)
+;; 1��ゃ�� rulename���絲上��������defun綣���������鴻�����������������鐚�
+;; 菴������わ��(values <defun��������鴻��> <��������������帥�若�潟�����������莎桁�����������������form>)
 (defun patacts2defun (rulename pat-act-list
 		      &key
 		      (source-package
 		       (rule-environment-source-package *rule-environment*))
 		      (arg-var (intern *arg-name* source-package)))
   (let* ((patterns-list (mapcar #'(lambda (x) (mapcar #'car (car x))) pat-act-list))
-	 (rest-arg-list (mapcar #'cdaar pat-act-list)) ;先頭のrestargを使う
+	 (rest-arg-list (mapcar #'cdaar pat-act-list)) ;���������restarg���篏帥��
 	 (action-list (mapcar #'cdr pat-act-list))
 	 (defun-name-list (mapcar (prefixed-func #'patlist-defun-symbol rulename)
 				  patterns-list))
@@ -340,26 +340,26 @@
 		 #'>
 		 :key #'(lambda (file) (if file (file-write-date file) -1)))))
       (cond
-        ((or force-recompile  ; .rule が最新 or force-recompile
+        ((or force-recompile  ; .rule ��������� or force-recompile
 	     (eq rule-file (first file-prio-list)))
          (let ((lisp-filename (rule2lsp rulename)))
            (load (if compile
 		     (compile-rulelsp rulename) 
 		     lisp-filename))))
-        ((and compile         ; コンパイル要求 & .rule.lsp が最新
+        ((and compile         ; ��潟�潟����ゃ��荀�羆� & .rule.lsp ���������
               (eq lisp-file (first file-prio-list)))
 	 (load (compile-rulelsp rulename)))
-        (t                    ; 最新のものを（未読なら）load
+        (t                    ; �����違�����������鐚����茯�������鐚�load
          (let ((load-filename (first file-prio-list)))
 	   (require rulename load-filename)))))))
 
-;;;; 規則名に対応する各ファイル[名]
-;; 規則ファイル
+;;;; 荀����������絲上����������������＜�ゃ��[���]
+;; 荀���������＜�ゃ��
 (defun get-rule-rulefile-name (rulename)
   (change-extension (string-downcase (string rulename)) "rule"))
 (defun get-rule-rulefile (rulename)
   (path-search (get-rule-rulefile-name rulename) *rule-path*))
-;; lispコンパイル済規則ファイル
+;; lisp��潟�潟����ゃ��羝�荀���������＜�ゃ��
 (defun get-rule-lspfile-name (rulename)
   (change-extension
    (string+ *cl-implementation* "-"
@@ -370,7 +370,7 @@
   (probe-file
    (change-filename (get-rule-rulefile rulename)
 		    (get-rule-lspfile-name rulename))))
-;; faslコンパイル済規則ファイル
+;; fasl��潟�潟����ゃ��羝�荀���������＜�ゃ��
 (defun get-rule-ofile-name (rulename)
   (compile-file-pathname 
    (change-extension (get-rule-lspfile-name rulename) nil)))
@@ -378,7 +378,7 @@
   (probe-file
    (change-filename (get-rule-rulefile rulename)
 		    (get-rule-ofile-name rulename))))
-;; 規則呼出し用関数
+;; 荀������弱�冴�������∽��
 (defun get-initiator (rulename)
   (require-rule rulename)
   (cdr (assoc rulename *initiator-alist* :test #'eq)))
diff --git a/src/sct-lib.lsp b/src/sct-lib.lsp
index d5ea2a8f..bbfcba6f 100644
--- a/src/sct-lib.lsp
+++ b/src/sct-lib.lsp
@@ -62,12 +62,12 @@
 (defvar *float-type-list*
   ~(long-double double float))
 
-;;; C ソースコード中の識別子か？
+;;; C ��純�若�鴻�潟�若��筝����茘���ュ�����鐚�
 (defun cid-p (id)
   (and (symbolp id)
        (eq c2sc:*clang-package* (symbol-package id)) ))
 
-;;; Cの識別子を表す文字列->scの識別子のsymbol-name
+;;; C���茘���ュ�����茵�������絖����->sc���茘���ュ�����symbol-name
 #-readtable-case
 (defun cid-to-scidname (cid)
   (let ((symstr "") (mode *print-case*))
@@ -95,34 +95,34 @@
             cid)))
 
 
-;;;; 識別子生成
-;;; with-setup-generate-id は最初に sc2c (in "SC-MAIN") でやる．
-;;; 最初の既使用識別子登録はscppでやる．
+;;;; 茘���ュ��������
+;;; with-setup-generate-id ������������ sc2c (in "SC-MAIN") ��с�����鐚�
+;;; �����������≫戎���茘���ュ����脂�蚊��scpp��с�����鐚�
 
 (defvar *used-identifier* :undefined)
 
-;; generate-idで使ってはいけない名前を登録する．
+;; generate-id��т戎��ｃ����������������������������脂�蚊�����鐚�
 (defmacro with-setup-generate-id (&body body)
   `(let ((*used-identifier* (make-hash-table :test #'equal)))
      ,@body))
 
-;; 文字列（使用したCの識別子）を *used-identifier* に登録する．
+;; ���絖����鐚�篏睡��������C���茘���ュ��鐚���� *used-identifier* �����脂�蚊�����鐚�
 (defun entry-used-identifier (cid)
   (assert (stringp cid))
   (assert (hash-table-p *used-identifier*))
   (setf (gethash cid *used-identifier*) cid)
   *used-identifier*)
 
-;; 重複を気にせずscのidentifierを生成．登録はする．
+;; ���茲����羂����������sc���identifier���������鐚���脂�蚊��������鐚�
 (defun make-id (&optional (basename "SCID") (package sc-file:*code-package*))
   (when (hash-table-p *used-identifier*)
     (entry-used-identifier basename))
   (intern (cid-to-scidname basename) package))
 
-;; 重複しないscのidentifierを生成
+;; ���茲����������sc���identifier���������
 (defun generate-id (&optional (basename "SCID") (package sc-file:*code-package*))
   (if (hash-table-p *used-identifier*)
-      ;; *used-identifier* とかぶらないように
+      ;; *used-identifier* ��������吟�����������������
       (let ((gen-cid
              (if (gethash basename *used-identifier*)
                  (loop for i from 2
@@ -131,13 +131,13 @@
                      finally (return cand))
                basename)))
         (make-id gen-cid package))
-    ;; *used-identifier* 非使用 ＋ 警告
+    ;; *used-identifier* ���篏睡�� 鐚� 茘����
     (progn
       (warn "Generate-id should be used in with-setup-generate-id environment.")
       (gentemp (cid-to-scidname basename) package))))
 
-;;;; 型関連
-;;; !!!拡張性のためにはdefruleに書きかえるべき
+;;;; �����∫��
+;;; !!!��≦宍��с��������������defrule�����吾�������������鴻��
 
 ;;; remove type-qualifier from type-expression
 (defun remove-type-qualifier (x &optional (recursive t))
@@ -175,7 +175,7 @@
     'void)
    (t 'other)))
 
-;;; 一番外側の array を ptr に変換
+;;; 筝����紊���眼�� array ��� ptr ���紊����
 (defun array2ptr (texp)
   (if (and (consp texp)
            (eq ~array (car texp)))
@@ -183,54 +183,54 @@
     texp))
 
 ;;; implicit type conversion
-;;; lightweight入れ子関数に対応(2003/12/28)
+;;; lightweight��ャ��絖���∽�違��絲上��(2003/12/28)
 (defun type-conversion (texp1 texp2)
   (let* ((class1 (classify-type texp1))
          (class2 (classify-type texp2)))
     (cond
-     ;; 同じ型のとき
+     ;; ������������������
      ((equal texp1 texp2)
       texp1)
-     ;; どちらかが voidのとき
+     ;; �����＜�������� void���������
      ((eq 'void  class1) texp1)
      ((eq 'void  class2) texp2)
-     ;; どちらかが算術型でないとき
+     ;; �����＜��������膊�茵������с�����������
      ((eq 'other class1) (array2ptr texp1))
      ((eq 'other class2) (array2ptr texp2))
-     ;; どちらかが浮動小数点型のとき
+     ;; �����＜��������羌����絨���亥�劫�����������
      ((eq 'float class1) texp1)
      ((eq 'float class2) texp2)
-     ;; 両方整数型
+     ;; 筝≧�号�贋�医��
      (t
       ;; enum=>int
       (when (eq 'enum class1)
         (setq texp1 ~int class1 'signed))
       (when (eq 'enum class2)
         (setq texp2 ~int class2 'signed))
-      ;; (少なくとも一方がunsignedの場合、texp1がunsignedになるように入れ替え)
+      ;; (絨�������������筝���鴻��unsigned�����翫�����texp1���unsigned��������������������ャ����帥��)
       (unless (eq 'unsigned class1)
         (swap texp1 texp2)
         (swap texp1 texp2)
         (swap class1 class2))
       (cond
-       ;; どちらもsigned, どちらもunsigned
+       ;; �����＜�����signed, �����＜�����unsigned
        ((eq (eq 'unsigned class1) (eq 'unsigned class2))
         (if (> (cdr (assoc texp1 *type-rank-alist*))
                (cdr (assoc texp2 *type-rank-alist*)))
             texp1 texp2))
-       ;; unsigned側のランクが低くない場合
+       ;; unsigned��眼�������潟�����篏������������翫��
        ((>= (cdr (assoc texp1 *type-rank-alist*))
             (cdr (assoc texp2 *type-rank-alist*)))
         texp1)
-       ;; signed側の型がもう一方の型の値を全て表現できる場合
+       ;; signed��眼��������������筝���鴻����������ゃ��������茵��憗�с�������翫��
        ((> (cdr (assoc texp2 *type-size-alist*))
            (cdr (assoc texp1 *type-size-alist*)))
         texp2)
-       ;; それ以外(signed側の型のunsignedに変換)
+       ;; ������篁ュ��(signed��眼��������unsigned���紊����)
        (t
         (cdr (assoc texp2 *signed-to-unsigned-alist*)) ))))))
 
-;;;; 文字列関連
+;;;; ���絖������∫��
 
 ;;; (a b (rule::splice c d) e f) -> (a b c d e f)
 (defun splice (x)
diff --git a/src/sct-macch.lsp b/src/sct-macch.lsp
index eefe9cae..9cf4f671 100644
--- a/src/sct-macch.lsp
+++ b/src/sct-macch.lsp
@@ -38,16 +38,16 @@
 (defconstant comma-dot 'BQ-COMMA-DOT)
 (defconstant optional 'OPTIONAL)
 
-;; patternをreadするときのパッケージ，リードテーブル
-;; nil なら変更しない.
+;; pattern���read�����������������������宴�若�醐�������若�������若�����
+;; nil ������紊���眼��������.
 (defvar *pattern-package* sc-file:*code-package*)
-;; パターン変数を読むときのパッケージ
-;; patternの外のパッケージをread開始時に覚えておく
+;; �����帥�若�喝����違��茯���������������������宴�若��
+;; pattern���紊������������宴�若�吾��read���紮�������荀�������������
 (defvar *outside-pattern-package*)
 
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; read環境を変えるマクロ
+;;;; read��医�����紊����������������
 (defmacro with-pattern-package (&body body)
   (with-fresh-variables (package-var)
     `(let ((,package-var (aif *pattern-package* it *package*))
@@ -70,16 +70,16 @@
                              ,@body)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; 通常のreadtable環境の変更
+;;;; ���絽吾��readtable��医�����紊����
 
-;;; #?<pattern> で ,や@ 等を含むパターンを書ける
+;;; #?<pattern> ��� ,���@ 膈���������������帥�若�潟����吾�����
 (set-dispatch-macro-character
  #\# #\?
  #'(lambda (stream char1 char2)
      (declare (ignore char1 char2))
      (read-pattern stream t nil t)))
 
-;;; `~'：続くS式が SC-readtable で読まれるback-quote
+;;; `~'鐚�膓����S綣���� SC-readtable ��ц����障�����back-quote
 (set-macro-character
  #\~
  #'(lambda (stream char)
@@ -149,7 +149,7 @@
 
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; #\~ 読み込み用，自作のbackquoteマクロ展開関数
+;;;; #\~ 茯���粋昭��睡��鐚����篏����backquote���������絮������∽��
 (defun quasiquote-expand (exp)
   (assert (not (pat-commaat-p exp)))
   (assert (not (pat-commadot-p exp)))
@@ -214,7 +214,7 @@
 
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; パターンを扱う関数・マクロ
+;;;; �����帥�若�潟����宴����∽�違�祉��������
 
 (defstruct (:pattern (:print-function pattern-print))
   body
@@ -226,13 +226,13 @@
         (match-check-list x))
     (pattern-_matching-list x)))
 
-;; パターン判定述語
+;; �����帥�若�喝�ゅ��菴域��
 #+obsolete
 (defun pattern-p (x)
   (and (consp x)
        (eq 'pattern (car x))))
 
-;; パターンの種類
+;; �����帥�若�潟��腮�蕁�
 (defun pat-comma-p (pbody)
   (and (consp pbody)
        (eq comma (car pbody))))
@@ -246,8 +246,8 @@
   (and (consp pbody)
        (eq optional (car pbody))))
 
-;;; patternの内部表現を、, や ,@ を使った形の文字列で出力
-;;; string2patの逆
+;;; pattern���������茵��憗�����, ��� ,@ ���篏帥�ｃ��綵≪�����絖������у�阪��
+;;; string2pat������
 (defun pattern-print (pat ostream depth)
   (assert (pattern-p pat))
   (with-pattern-package
@@ -276,20 +276,20 @@
                   " "))))
     (format nil "~S" pbody)))
 
-;; パターンをLispで評価したとき
+;; �����帥�若�潟��Lisp��ц��箴＜�����������
 #+obsolete
 (defmacro pattern (&whole x y)
   (declare (ignore y))
   `',x)
 
 
-;; パターンを読む環境でread
+;; �����帥�若�潟��茯������医�����read
 (defun read-pattern (&rest read-args)
   (with-pattern-read-environment
       #+obsolete `(pattern ,(apply #'read read-args))
       (make-pattern :body (apply #'read read-args))))
 
-;; パターンを読む環境でread-from-string
+;; �����帥�若�潟��茯������医�����read-from-string
 (defun string2pat (str)
   (with-input-from-string (istr str)
     (read-pattern istr)))
diff --git a/src/sct-rule2lsp.lsp b/src/sct-rule2lsp.lsp
index a75ac9ac..fa687b16 100644
--- a/src/sct-rule2lsp.lsp
+++ b/src/sct-rule2lsp.lsp
@@ -38,8 +38,8 @@
 (scr:require "SC-MISC")
 
 
-;;; <-- 補助関数
-;; パタン内のパタン変数名のリストを得る
+;;; <-- 茖������∽��
+;; �����帥�喝����������帥�喝����医����������鴻�����緇����
 (defun get-pattern-variables (pat)
   (declare (type :pattern pat))
   (assert (pattern-p pat))
@@ -58,36 +58,36 @@
   (declare (type :pattern pat))
   (length (get-pattern-variables pat)))
 
-;; パターンから,@の場所を捜す
+;; �����帥�若�潟�����,@�����贋�����������
 (defun search-commaat (pbody)
   (member-if #'pat-commaat-p pbody))
 
-;; patternがnilにマッチするか
+;; pattern���nil���������������������
 (defun matches-to-nil-p (pbody)
   (and (consp pbody)
        (every #'pat-commaat-p pbody)))
 
-;; パターンを,@より前とそれ以降で分割
+;; �����帥�若�潟��,@������������������篁ラ����у�����
 (defun split-at-commaat (pattern)
   (list-until pattern (search-commaat pattern)))
 
-;; ,pv[]や,@pv[]における[]の中身==>マッチ成立を判定するフォーム
-;; マッチング成立ならsave-placeにget-retvalで獲得するための multiple-value-list
-;; をセットする（不成立ならsave-placeの値は保証しなくてよい）
-;; 返す値はマッチの成否を表してさえいれば特にretvalでなくてよい
+;; ,pv[]���,@pv[]������������[]���筝�荳�==>������������腴������ゅ����������������若��
+;; �����������潟�井��腴�������save-place���get-retval��х�峨����������������� multiple-value-list
+;; �����祉�����������鐚�筝����腴�������save-place�����ゃ��篆�荐若�����������������鐚�
+;; 菴������ゃ�����������������������茵���������������������亥�鴻��retval��с��������������
 (defun bracket-to-testform (in-bracket argform saveplace)
   (cond
    ((cdr in-bracket)
-    (case (car in-bracket)              ; :evalに続くフォームの値が非nilならマッチ
+    (case (car in-bracket)              ; :eval���膓������������若�������ゃ�����nil���������������
       ((:eval)
        `(car (setf ,saveplace
                (multiple-value-list (progn ,@(cdr in-bracket))))) )
-      ((:member)                        ; :memberに続く値（リスト）に含まれていればマッチ
+      ((:member)                        ; :member���膓������わ�������鴻��鐚���������障�������������違��������
        `(car (setf ,saveplace
                (list (member ,argform ,(second in-bracket) :test #'equal)))) )
       (otherwise
        (error "Unexpected form: [~{~S~^ ~}]" in-bracket))))
-   ((null in-bracket)                   ; ,var[] == ,var（常にマッチ）
+   ((null in-bracket)                   ; ,var[] == ,var鐚�絽吾�����������鐚�
     `(setf ,saveplace '(t)))
    ((symbolp (car in-bracket))          ; ,var[symbol] --> (funcall #'var symbol)
     (unless (eq (symbol-package (car in-bracket))
@@ -104,10 +104,10 @@
    ((eq 'function (caar in-bracket))    ; ,var[#'<form>] --> (funcall #'<form> symbol)
     `(car (setf ,saveplace              ; test if non-nil
             (multiple-value-list (funcall ,(car in-bracket) ,argform)))) )
-   (t                                   ; atomでも関数フォームでもない --> :member
+   (t                                   ; atom��с����∽�違�������若����с�������� --> :member
     (bracket-to-testform `(:member ,(car in-bracket)) argform saveplace))))
 
-;;; optional を含むパタンを展開
+;;; optional ��������������帥�潟��絮����
 (defun extract-optional (pat)
   (assert (pattern-p pat))
   (mapcar #'(lambda (xx) (make-pattern :body xx))
@@ -140,16 +140,16 @@
   (cond ((= n 0) form)
         ((= n 1) `(butlast ,form))
         (t `(butlast ,form ,n))))
-;;; 補助関数 -->
+;;; 茖������∽�� -->
 
 
-;; (<pattern> . <action>) のリストとform-varを受けとって
-;; form-varの値が<pattern>にマッチすれば
-;; <action>を実行するようなフォームを生成
-;; 先頭の共通する部分の処理を一回ですませるようにしている
-;; :action のところの gensym は全ての:actionが equalにならないようにして，
-;; 同じactionでも統合されないようにするためのダミー．
-;; （同一パターン・アクションでもnext-pattern マクロの動作を保証するため）
+;; (<pattern> . <action>) ��������鴻�����form-var��������������ｃ��
+;; form-var�����ゃ��<pattern>���������������������
+;; <action>���絎�茵������������������������若�����������
+;; �����������演��������������������������筝������с����障��������������������������
+;; :action ��������������� gensym ������������:action��� equal������������������������������鐚�
+;; ������action��с��腟怨����������������������������������������������種��
+;; 鐚����筝������帥�若�潟�祉�≪����激�с�潟�с��next-pattern ���������������篏����篆�荐若�����������鐚�
 (defun match-action-form (pats-act-list form-var &optional otherwise-action)
   (match-check-to-form
    (integrate-ml-actions
@@ -168,10 +168,10 @@
 
 ;;;;;;;;;;;;
 
-;; match-check-to-formの変換関数で利用する
-;; (<pattern-variable> . <return-value-varialble>) のリスト
+;; match-check-to-form���紊������∽�違�у�����������
+;; (<pattern-variable> . <return-value-varialble>) ��������鴻��
 (defvar *pv-list*)
-;; マッチング処理全体を包むブロック名．action終了後脱出するために使う
+;; �����������潟�医��������篏�������������������������鐚�action腟�篋�緇���怨�冴��������������篏帥��
 (defvar *match-block*)
 
 (defun get-pv-ret (pv &optional (pv-list *pv-list*))
@@ -205,8 +205,8 @@
     `(block ,*match-block*
        (tagbody
          ,@(flatten-block (match-check-list-to-form (list mc) focus-stk (list tag-otherwise) ()))
-         ;;どれかにマッチしたならここまでにreturn-fromしているので
-         ;;go以外ではここにはこない
+         ;;�����������������������������������������障�с��return-from������������������
+         ;;go篁ュ����с�����������������������
          ,tag-otherwise
          ,@(when otherwise-action
              (list `(return-from ,*match-block* ,otherwise-action)))))
@@ -413,6 +413,8 @@
         `(let ((,cur-var ,focus-var) ,head-var
                ,.(when in-bracket (list rtmp-var `(,maxvals-var 0))))
            ,.(when in-bracket (list `(declare (fixnum ,maxvals-var))))
+           (setq ,pv nil)
+           (setq ,pv-ret nil)
            (tagbody
              (go ,skip-tag)
              ,retry-tag
@@ -453,23 +455,23 @@
 ;;;;;;;;;;;;
 
 
-;; (,@<match-check-list> (:action ,<dummy> ,<action>)) のリストを受けとり
-;; <match-check-list> の 先頭共通部分を統合することで分岐構造にする．
+;; (,@<match-check-list> (:action ,<dummy> ,<action>)) ��������鴻�����������������
+;; <match-check-list> ��� ��������演�����������腟怨����������������у��絏�罕�������������鐚�
 ;; (:br <path1> <path2>)
-;; path<n>は :car, (:new-pv ..)，(:br ...)，(:action ..) などからなるリスト
-;; path1の途中で失敗したら最新の:brまで引き返してpath2に移る
+;; path<n>��� :car, (:new-pv ..)鐚�(:br ...)鐚�(:action ..) �����������������������鴻��
+;; path1������筝���уけ�����������������違��:br��障�у�����菴�������path2���腱祉��
 (defun integrate-ml-actions (ml-action-list)
   (cond
    ((endp ml-action-list) ())
    ((endp (car ml-action-list)) (integrate-ml-actions (cdr ml-action-list)))
    (t
-    ;; 先頭共通部分が1つでもある部分(succ)と，それ以降(rest)を分ける
+    ;; ��������演�����������1��ゃ�с��������������(succ)���鐚�������篁ラ��(rest)������������
     (multiple-value-bind (succ rest)
         (let ((ml0-head (caar ml-action-list)))
           (list-until-if #'(lambda (rem) (not (equal (caar rem) ml0-head)))
                          ml-action-list))
-      ;; succのmatching-listの最長の先頭共通部分headを抜き出して，
-      ;; 残った部分をrest2に
+      ;; succ���matching-list��������激����������演��������head�����������冴�����鐚�
+      ;; 罧���ｃ�����������rest2���
       (multiple-value-bind (head rest2)
           (apply #'head-intersection #'equal succ)
         `(:br (,.head ,@(flatten-branch (integrate-ml-actions rest2)))
@@ -485,13 +487,13 @@
      (second br))
     (t (list br))))
 
-;; patternにマッチするために必要な条件のリストを返す
+;; pattern���������������������������綽�荀������＞散��������鴻�����菴����
 (defun match-check-list (pat)
   (declare (type :pattern pat))
   (match-check-list-for-exp (pattern-body pat)))
 
 (defun match-check-list-for-exp (pbody) 
-  ;; リストの要素に対して
+  ;; �����鴻�����荀�膣����絲障�����
   (cond
    ((symbolp pbody) (list `(:type ,(type-of pbody)) `(:eq ,pbody)))
    ((atom pbody)    (list `(:type ,(type-of pbody)) `(:equal ,pbody)))
@@ -508,19 +510,19 @@
     (match-check-list-for-list pbody))))
 
 (defun match-check-list-for-list (pbody)
-  ;; リストに対して
-  (multiple-value-bind (until-commaat from-commaat) ; パターンを,@前後で分割
+  ;; �����鴻�����絲障�����
+  (multiple-value-bind (until-commaat from-commaat) ; �����帥�若�潟��,@���緇���у�����
       (split-at-commaat pbody)
     (declare (list until-commaat from-commaat))
     (list*
      :listp
      (nconc
-      ;; ,@以前の各要素をチェック
+      ;; ,@篁ュ��������荀�膣���������с�����
       (loop :for x :in until-commaat
         :nconc (nconc (list :non-nil :push-focus :car)
                       (match-check-list-for-exp x)
                       (list :pop-focus :cdr)))
-      ;; ,@以降をチェック
+      ;; ,@篁ラ����������с�����
       (if from-commaat
           (match-check-list-for-commaat from-commaat)
         (list :nil))))
@@ -528,20 +530,20 @@
 
 (defun match-check-list-for-commaat (pbody)
   (assert (pat-commaat-p (car pbody)))
-  ;; ,@から始まるリストに対して
+  ;; ,@������紮���障�������鴻�����絲障�����
   (cond
-   ((not (search-commaat (cdr pbody)))  ;,@がもうないときは高速化
-    (let ((rest-len (length (cdr pbody))) ; ,@を除いたパターンの長さ
+   ((not (search-commaat (cdr pbody)))  ;,@������������������������蕭�������
+    (let ((rest-len (length (cdr pbody))) ; ,@�����ゃ����������帥�若�潟����激��
           (pv (second (car pbody)))
           (in-bracket (cddr (car pbody))))
       (list*
-       ;; ,@部分をチェック（要素数確定）
+       ;; ,@��������������с�����鐚�荀�膣���亥∈絎�鐚�
        `(:new-pv ,pv)
        `(:pv-rest ,pv ,rest-len ,in-bracket)
-       ;; ,@より後のパターンをチェック
+       ;; ,@������緇���������帥�若�潟�������с�����
        (match-check-list-for-list (cdr pbody)) )
       ))
-   (t                                   ; ,@がまだある場合=>しらみつぶし
+   (t                                   ; ,@�����障����������翫��=>��������帥�ゃ�吟��
     (let ((pv (second (car pbody)))
           (in-bracket (cddr (car pbody))))
       (list
@@ -550,9 +552,9 @@
                ,(match-check-list-for-list (cdr pbody))))))))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; パターンマッチを利用するユーザ用マクロ
+;;;; �����帥�若�潟����������������������������若�句�����������
 
-;;; ユーザ用マクロ if-match
+;;; �����若�句����������� if-match
 (defmacro sct-user:if-match (pattern form then-form &optional else-form)
   (with-fresh-variables form-var
     `(let ((,form-var ,form))
@@ -561,15 +563,15 @@
          form-var
          else-form))))
 
-;;; ユーザ用マクロ when-match
+;;; �����若�句����������� when-match
 (defmacro sct-user:when-match (pattern form &body body)
   `(if-match ,pattern ,form (progn ,@body)))
 
-;;; ユーザ用マクロ unless-match
+;;; �����若�句����������� unless-match
 (defmacro sct-user:unless-match (pattern form &body body)
   `(if-match ,pattern ,form nil (progn ,@body)))
 
-;;; ユーザ用マクロ cond-match
+;;; �����若�句����������� cond-match
 (defun mklist-pattern (pattern-list-or-a-pattern)
   (if (pattern-p pattern-list-or-a-pattern)
       (list pattern-list-or-a-pattern)