flaw_detector 0.0.1 → 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: af3e76154f18c212c10a2a6a3d4d107f64618255
+  data.tar.gz: 42d43bb6c926ad0ee08e07a4fda53b841613eef3
+SHA512:
+  metadata.gz: 9bc4863341aeb50d5ee24209ae6997ab84ec155a9800d1adc5a150746e64f7cb12c5a0d962765526c3f833b808a940042377abbd835be22b3a78390392e0476e
+  data.tar.gz: 51a0e99b72ba5e61984856e288874431269ae84e32220f90bea7c843d44ab21d1a2c8ae74a487e276472ee2d5d0d7f93e470d93738101ba42425a3199ec7dd75

data/README.md

@@ -1,4 +1,64 @@
-flaw_detector
+FlawDetector [![Build Status](https://secure.travis-ci.org/ginriki/flaw_detector.png)][Continuous Integration]
 =============
+FlawDetector is a tool to detect ruby code's flaw with static analysis.
+In static analysis, it analyze RubyVM bytecode which is compiled from ruby code.
 
-The tool to detect code's flaw with static analysis
+FlawDetector is similer to FindBugs which is a tool to detect java code's flaw.
+For details of FindBugs, refer to references section in this text file.
+
+[Continuous Integration]: http://travis-ci.org/ginriki/flaw_detector
+
+Getting Started
+-------
+```shell
+$ gem install flaw_detector
+```
+
+Usage
+-------
+```shell
+  flaw_detector [-f outfille] [--help] rbfile ...
+```
+
+Example
+-------
+```shell
+$ flaw_detector -f result.csv sample/flaw_in_code.rb
+```
+
+Command Result
+-------
+Currently, FlawDetector supports only CSV format result.
+Result example is as follows:
+```file
+$ cat result.csv
+msgid,file,line,short_desc,long_desc,details
+RCN_REDUNDANT_FALSECHECK_OF_FALSE_VALUE,sample/flaw_in_code.rb,4,Redundant falsecheck of value known to be false,Redundant falsecheck of a which is known to be false in LINE:2,This method contains a redundant check of a known false value against the constant false.
+NP_ALWAYS_FALSE,sample/flaw_in_code.rb,7,False value missing method received,False value missing method received in a,"A false value, which is NilClass or FalseClass, is received missing method here. This will lead to a NoMethodError when the code is executed."
+```
+
+Each line represents a flaw.
+If you want to know how flaw can be shown in result, 
+refer to [message.rb](https://github.com/ginriki/flaw_detector/blob/master/lib/flaw_detector/message.rb)
+
+Fix and Recheck
+------
+According to the result, you should fix source code and recheck it by FlawDetector until "OK" is displaied
+```file
+$ emacs sample/flaw_in_code.rb
+$ cat sample/flaw_in_code.rb
+def no_flaw(a)
+  if a
+    rl = a + 1
+  else
+    rl = a.to_i + 1
+  end
+end
+$ flaw_detector sample/flaw_in_code.rb
+OK
+$
+```
+
+References
+------
+ * http://findbugs.sourceforge.net/findbugs2.html

data/ext/insns_ext/extconf.rb

@@ -1,2 +1,2 @@
 require 'mkmf'
-create_makefile("insns_ext")
+create_makefile("insns_ext", "insns/#{RUBY_VERSION[0..2]}")

data/ext/insns_ext/insn_ext.rb

@@ -3,5 +3,37 @@ module InsnExt
   def insn_num(insn_name)
     return RubyVM::INSTRUCTION_NAMES.index(insn_name.to_s)
   end
-  module_function :insn_num
+
+  # @todo refactoring from c-function to pure ruby function
+  alias :_insn_stack_increase :insn_stack_increase
+
+  if RUBY_VERSION =~ /^2.0/
+    VM_CALL_ARGS_BLOCKARG = (0x01 ** 2)
+
+    # Override for substitution of CALL_INFO cast 
+    # in c-function@insns_info.inc
+    def insn_stack_increase(opcode_index, ary)
+      call_info = [:send, :invokesuper, :opt_send_simple, :invokeblock]
+      name = RubyVM::INSTRUCTION_NAMES[opcode_index].to_sym
+      unless call_info.include?(name)
+        return _insn_stack_increase(opcode_index, ary)
+      else
+        case name
+        when :opt_send_simple
+          inc = -ary[0][:orig_argc]
+        when :invokeblock
+          inc = 1-ary[0][:orig_argc]
+        when :send, :invokesuper
+          inc = -ary[0][:orig_argc]
+          inc += -1 if (ary[0][:flag] & VM_CALL_ARGS_BLOCKARG) != 0
+        else
+          raise "unknown state"
+        end
+        return inc
+      end
+    end
+  else
+    #don't need to override insn_stack_increase
+  end
+  module_function :insn_num, :insn_stack_increase, :_insn_stack_increase
 end

data/ext/insns_ext/insns/1.9/BSDL

@@ -0,0 +1,22 @@
+Copyright (C) 1993-2010 Yukihiro Matsumoto. 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 AND CONTRIBUTORS ``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 OR CONTRIBUTORS 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.

data/ext/insns_ext/{insns_info.inc → insns/1.9/insns_info.inc}

@@ -9,18 +9,18 @@
   or insns2vm.rb
  */
 
+#define TS_ISEQ 'S'
+#define TS_GENTRY 'G'
 #define TS_OFFSET 'O'
-#define TS_NUM 'N'
-#define TS_LINDEX 'L'
 #define TS_DINDEX 'D'
-#define TS_VALUE 'V'
-#define TS_ID 'I'
-#define TS_GENTRY 'G'
-#define TS_IC 'C'
-#define TS_CDHASH 'H'
-#define TS_ISEQ 'S'
 #define TS_VARIABLE '.'
+#define TS_CDHASH 'H'
+#define TS_IC 'C'
+#define TS_ID 'I'
 #define TS_FUNCPTR 'F'
+#define TS_VALUE 'V'
+#define TS_LINDEX 'L'
+#define TS_NUM 'N'
 
 static const char *const insn_name_info[] = {
   "nop",
@@ -110,8 +110,8 @@ static const char *const insn_operand_info[] = {
   "", 
   "L", 
   "L", 
-  "VN", 
-  "V", 
+  "NN", 
+  "N", 
   "DN", 
   "DN", 
   "IC", 

data/ext/insns_ext/insns/2.0/BSDL

@@ -0,0 +1,22 @@
+Copyright (C) 1993-2013 Yukihiro Matsumoto. 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 AND CONTRIBUTORS ``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 OR CONTRIBUTORS 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.

data/ext/insns_ext/insns/2.0/insns.inc

@@ -0,0 +1,187 @@
+/** -*-c-*-
+  This file contains YARV instructions list.
+
+  ----
+  This file is auto generated by insns2vm.rb
+  DO NOT TOUCH!
+
+  If you want to fix something, you must edit 'template/insns.inc.tmpl'
+  or insns2vm.rb
+ */
+
+
+/* BIN : Basic Instruction Name */
+#define BIN(n) YARVINSN_##n
+
+enum ruby_vminsn_type {
+  BIN(nop)                       = 0,
+
+  BIN(getlocal)                  = 1,
+
+  BIN(setlocal)                  = 2,
+
+  BIN(getspecial)                = 3,
+
+  BIN(setspecial)                = 4,
+
+  BIN(getinstancevariable)       = 5,
+
+  BIN(setinstancevariable)       = 6,
+
+  BIN(getclassvariable)          = 7,
+
+  BIN(setclassvariable)          = 8,
+
+  BIN(getconstant)               = 9,
+
+  BIN(setconstant)               = 10,
+
+  BIN(getglobal)                 = 11,
+
+  BIN(setglobal)                 = 12,
+
+  BIN(putnil)                    = 13,
+
+  BIN(putself)                   = 14,
+
+  BIN(putobject)                 = 15,
+
+  BIN(putspecialobject)          = 16,
+
+  BIN(putiseq)                   = 17,
+
+  BIN(putstring)                 = 18,
+
+  BIN(concatstrings)             = 19,
+
+  BIN(tostring)                  = 20,
+
+  BIN(toregexp)                  = 21,
+
+  BIN(newarray)                  = 22,
+
+  BIN(duparray)                  = 23,
+
+  BIN(expandarray)               = 24,
+
+  BIN(concatarray)               = 25,
+
+  BIN(splatarray)                = 26,
+
+  BIN(newhash)                   = 27,
+
+  BIN(newrange)                  = 28,
+
+  BIN(pop)                       = 29,
+
+  BIN(dup)                       = 30,
+
+  BIN(dupn)                      = 31,
+
+  BIN(swap)                      = 32,
+
+  BIN(reput)                     = 33,
+
+  BIN(topn)                      = 34,
+
+  BIN(setn)                      = 35,
+
+  BIN(adjuststack)               = 36,
+
+  BIN(defined)                   = 37,
+
+  BIN(checkmatch)                = 38,
+
+  BIN(trace)                     = 39,
+
+  BIN(defineclass)               = 40,
+
+  BIN(send)                      = 41,
+
+  BIN(opt_send_simple)           = 42,
+
+  BIN(invokesuper)               = 43,
+
+  BIN(invokeblock)               = 44,
+
+  BIN(leave)                     = 45,
+
+  BIN(throw)                     = 46,
+
+  BIN(jump)                      = 47,
+
+  BIN(branchif)                  = 48,
+
+  BIN(branchunless)              = 49,
+
+  BIN(getinlinecache)            = 50,
+
+  BIN(onceinlinecache)           = 51,
+
+  BIN(setinlinecache)            = 52,
+
+  BIN(opt_case_dispatch)         = 53,
+
+  BIN(opt_plus)                  = 54,
+
+  BIN(opt_minus)                 = 55,
+
+  BIN(opt_mult)                  = 56,
+
+  BIN(opt_div)                   = 57,
+
+  BIN(opt_mod)                   = 58,
+
+  BIN(opt_eq)                    = 59,
+
+  BIN(opt_neq)                   = 60,
+
+  BIN(opt_lt)                    = 61,
+
+  BIN(opt_le)                    = 62,
+
+  BIN(opt_gt)                    = 63,
+
+  BIN(opt_ge)                    = 64,
+
+  BIN(opt_ltlt)                  = 65,
+
+  BIN(opt_aref)                  = 66,
+
+  BIN(opt_aset)                  = 67,
+
+  BIN(opt_length)                = 68,
+
+  BIN(opt_size)                  = 69,
+
+  BIN(opt_empty_p)               = 70,
+
+  BIN(opt_succ)                  = 71,
+
+  BIN(opt_not)                   = 72,
+
+  BIN(opt_regexpmatch1)          = 73,
+
+  BIN(opt_regexpmatch2)          = 74,
+
+  BIN(opt_call_c_function)       = 75,
+
+  BIN(bitblt)                    = 76,
+
+  BIN(answer)                    = 77,
+
+  BIN(getlocal_OP__WC__0)        = 78,
+
+  BIN(getlocal_OP__WC__1)        = 79,
+
+  BIN(setlocal_OP__WC__0)        = 80,
+
+  BIN(setlocal_OP__WC__1)        = 81,
+
+  BIN(putobject_OP_INT2FIX_O_0_C_) = 82,
+
+  BIN(putobject_OP_INT2FIX_O_1_C_) = 83,
+
+  VM_INSTRUCTION_SIZE            = 84
+};
+

data/ext/insns_ext/insns/2.0/insns_ext.c

@@ -0,0 +1,36 @@
+#define USE_INSN_STACK_INCREASE
+#define USE_INSN_RET_NUM
+#include "ruby.h"
+
+#include "vm_core_subset.h"
+#include "insns.inc"
+#include "insns_info.inc"
+
+VALUE wrap_insn_len(VALUE self, VALUE insn)
+{
+  int len = insn_len(FIX2INT(insn));
+  return INT2FIX(len);
+}
+
+VALUE wrap_insn_stack_increase(VALUE self, VALUE insn, VALUE ope_ary)
+{
+  int inc = insn_stack_increase(0, FIX2INT(insn), RARRAY_PTR(ope_ary));
+  return INT2FIX(inc);
+}
+
+VALUE wrap_insn_ret_num(VALUE self, VALUE insn)
+{
+  int ret_num = insn_ret_num(FIX2INT(insn));
+  return INT2FIX(ret_num);
+}
+
+void Init_insns_ext()
+{
+  VALUE module;
+  
+  module = rb_define_module("InsnExt");
+  rb_define_module_function(module, "insn_len", wrap_insn_len, 1);
+  rb_define_module_function(module, "insn_stack_increase", wrap_insn_stack_increase, 2);
+  rb_define_module_function(module, "insn_ret_num", wrap_insn_ret_num, 1);
+}
+

data/ext/insns_ext/insns/2.0/insns_info.inc

@@ -0,0 +1,724 @@
+/** -*-c-*-
+  This file contains instruction information for yarv instruction sequence.
+
+  ----
+  This file is auto generated by insns2vm.rb
+  DO NOT TOUCH!
+
+  If you want to fix something, you must edit 'template/insns_info.inc.tmpl'
+  or insns2vm.rb
+ */
+
+#define TS_ISEQ 'S'
+#define TS_GENTRY 'G'
+#define TS_OFFSET 'O'
+#define TS_CALLINFO 'C'
+#define TS_VARIABLE '.'
+#define TS_CDHASH 'H'
+#define TS_IC 'K'
+#define TS_ID 'I'
+#define TS_FUNCPTR 'F'
+#define TS_VALUE 'V'
+#define TS_LINDEX 'L'
+#define TS_NUM 'N'
+
+static const char *const insn_name_info[] = {
+  "nop",
+  "getlocal",
+  "setlocal",
+  "getspecial",
+  "setspecial",
+  "getinstancevariable",
+  "setinstancevariable",
+  "getclassvariable",
+  "setclassvariable",
+  "getconstant",
+  "setconstant",
+  "getglobal",
+  "setglobal",
+  "putnil",
+  "putself",
+  "putobject",
+  "putspecialobject",
+  "putiseq",
+  "putstring",
+  "concatstrings",
+  "tostring",
+  "toregexp",
+  "newarray",
+  "duparray",
+  "expandarray",
+  "concatarray",
+  "splatarray",
+  "newhash",
+  "newrange",
+  "pop",
+  "dup",
+  "dupn",
+  "swap",
+  "reput",
+  "topn",
+  "setn",
+  "adjuststack",
+  "defined",
+  "checkmatch",
+  "trace",
+  "defineclass",
+  "send",
+  "opt_send_simple",
+  "invokesuper",
+  "invokeblock",
+  "leave",
+  "throw",
+  "jump",
+  "branchif",
+  "branchunless",
+  "getinlinecache",
+  "onceinlinecache",
+  "setinlinecache",
+  "opt_case_dispatch",
+  "opt_plus",
+  "opt_minus",
+  "opt_mult",
+  "opt_div",
+  "opt_mod",
+  "opt_eq",
+  "opt_neq",
+  "opt_lt",
+  "opt_le",
+  "opt_gt",
+  "opt_ge",
+  "opt_ltlt",
+  "opt_aref",
+  "opt_aset",
+  "opt_length",
+  "opt_size",
+  "opt_empty_p",
+  "opt_succ",
+  "opt_not",
+  "opt_regexpmatch1",
+  "opt_regexpmatch2",
+  "opt_call_c_function",
+  "bitblt",
+  "answer",
+  "getlocal_OP__WC__0",
+  "getlocal_OP__WC__1",
+  "setlocal_OP__WC__0",
+  "setlocal_OP__WC__1",
+  "putobject_OP_INT2FIX_O_0_C_",
+  "putobject_OP_INT2FIX_O_1_C_",
+
+};
+
+static const char *const insn_operand_info[] = {
+  "", 
+  "LN", 
+  "LN", 
+  "NN", 
+  "N", 
+  "IK", 
+  "IK", 
+  "I", 
+  "I", 
+  "I", 
+  "I", 
+  "G", 
+  "G", 
+  "", 
+  "", 
+  "V", 
+  "N", 
+  "S", 
+  "V", 
+  "N", 
+  "", 
+  "NN", 
+  "N", 
+  "V", 
+  "NN", 
+  "", 
+  "V", 
+  "N", 
+  "N", 
+  "", 
+  "", 
+  "N", 
+  "", 
+  "", 
+  "N", 
+  "N", 
+  "N", 
+  "NVV", 
+  "N", 
+  "N", 
+  "ISN", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "", 
+  "N", 
+  "O", 
+  "O", 
+  "O", 
+  "OK", 
+  "OK", 
+  "K", 
+  "HO", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "CC", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "C", 
+  "V", 
+  "", 
+  "F", 
+  "", 
+  "", 
+  "L", 
+  "L", 
+  "L", 
+  "L", 
+  "", 
+  "", 
+
+};
+
+static const int insn_len_info[] = {
+  1,
+  3,
+  3,
+  3,
+  2,
+  3,
+  3,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  1,
+  1,
+  2,
+  2,
+  2,
+  2,
+  2,
+  1,
+  3,
+  2,
+  2,
+  3,
+  1,
+  2,
+  2,
+  2,
+  1,
+  1,
+  2,
+  1,
+  1,
+  2,
+  2,
+  2,
+  4,
+  2,
+  2,
+  4,
+  2,
+  2,
+  2,
+  2,
+  1,
+  2,
+  2,
+  2,
+  2,
+  3,
+  3,
+  2,
+  3,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  3,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  2,
+  1,
+  2,
+  1,
+  1,
+  2,
+  2,
+  2,
+  2,
+  1,
+  1,
+
+};
+
+#ifdef USE_INSN_RET_NUM
+static const int insn_stack_push_num_info[] = {
+  0,
+  1,
+  0,
+  1,
+  0,
+  1,
+  0,
+  1,
+  0,
+  1,
+  0,
+  1,
+  0,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  0,
+  2,
+  1,
+  2,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  0,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  0,
+  0,
+  0,
+  1,
+  1,
+  1,
+  0,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  0,
+  1,
+  1,
+  1,
+  1,
+  0,
+  0,
+  1,
+  1,
+
+};
+#endif
+
+#ifdef USE_INSN_STACK_INCREASE
+static int
+insn_stack_increase(int depth, int insn, VALUE *opes)
+{
+  switch(insn){
+        case BIN(nop):{
+          return depth + 0;
+        }
+        case BIN(getlocal):{
+          return depth + 1;
+        }
+        case BIN(setlocal):{
+          return depth + -1;
+        }
+        case BIN(getspecial):{
+          return depth + 1;
+        }
+        case BIN(setspecial):{
+          return depth + -1;
+        }
+        case BIN(getinstancevariable):{
+          return depth + 1;
+        }
+        case BIN(setinstancevariable):{
+          return depth + -1;
+        }
+        case BIN(getclassvariable):{
+          return depth + 1;
+        }
+        case BIN(setclassvariable):{
+          return depth + -1;
+        }
+        case BIN(getconstant):{
+          return depth + 0;
+        }
+        case BIN(setconstant):{
+          return depth + -2;
+        }
+        case BIN(getglobal):{
+          return depth + 1;
+        }
+        case BIN(setglobal):{
+          return depth + -1;
+        }
+        case BIN(putnil):{
+          return depth + 1;
+        }
+        case BIN(putself):{
+          return depth + 1;
+        }
+        case BIN(putobject):{
+          return depth + 1;
+        }
+        case BIN(putspecialobject):{
+          return depth + 1;
+        }
+        case BIN(putiseq):{
+          return depth + 1;
+        }
+        case BIN(putstring):{
+          return depth + 1;
+        }
+        case BIN(concatstrings):{
+          int inc = 0;
+        int num = FIX2INT(opes[0]);
+        inc += 1 - num;;
+        return depth + inc;
+        }
+        case BIN(tostring):{
+          return depth + 0;
+        }
+        case BIN(toregexp):{
+          int inc = 0;
+        int cnt = FIX2INT(opes[1]);
+        inc += 1 - cnt;;
+        return depth + inc;
+        }
+        case BIN(newarray):{
+          int inc = 0;
+        int num = FIX2INT(opes[0]);
+        inc += 1 - num;;
+        return depth + inc;
+        }
+        case BIN(duparray):{
+          return depth + 1;
+        }
+        case BIN(expandarray):{
+          int inc = 0;
+        int num = FIX2INT(opes[0]);
+        int flag = FIX2INT(opes[1]);
+        inc += num - 1 + (flag & 1 ? 1 : 0);;
+        return depth + inc;
+        }
+        case BIN(concatarray):{
+          return depth + -1;
+        }
+        case BIN(splatarray):{
+          return depth + 0;
+        }
+        case BIN(newhash):{
+          int inc = 0;
+        int num = FIX2INT(opes[0]);
+        inc += 1 - num;;
+        return depth + inc;
+        }
+        case BIN(newrange):{
+          return depth + -1;
+        }
+        case BIN(pop):{
+          return depth + -1;
+        }
+        case BIN(dup):{
+          return depth + 1;
+        }
+        case BIN(dupn):{
+          int inc = 0;
+        int n = FIX2INT(opes[0]);
+        inc += n;;
+        return depth + inc;
+        }
+        case BIN(swap):{
+          return depth + 0;
+        }
+        case BIN(reput):{
+          int inc = 0;
+        inc += 0;;
+        return depth + inc;
+        }
+        case BIN(topn):{
+          int inc = 0;
+        inc += 1;;
+        return depth + inc;
+        }
+        case BIN(setn):{
+          int inc = 0;
+        inc += 0;
+        return depth + inc;
+        }
+        case BIN(adjuststack):{
+          int inc = 0;
+        int n = FIX2INT(opes[0]);
+        inc -= n;
+        return depth + inc;
+        }
+        case BIN(defined):{
+          return depth + 0;
+        }
+        case BIN(checkmatch):{
+          return depth + -1;
+        }
+        case BIN(trace):{
+          return depth + 0;
+        }
+        case BIN(defineclass):{
+          return depth + -1;
+        }
+        case BIN(send):{
+          int inc = 0;
+        CALL_INFO ci = (CALL_INFO)(opes[0]);
+        inc += - (int)(ci->orig_argc + ((ci->flag & VM_CALL_ARGS_BLOCKARG) ? 1 : 0));;
+        return depth + inc;
+        }
+        case BIN(opt_send_simple):{
+          int inc = 0;
+        CALL_INFO ci = (CALL_INFO)(opes[0]);
+        inc += -ci->orig_argc;;
+        return depth + inc;
+        }
+        case BIN(invokesuper):{
+          int inc = 0;
+        CALL_INFO ci = (CALL_INFO)(opes[0]);
+        inc += - (int)(ci->orig_argc + ((ci->flag & VM_CALL_ARGS_BLOCKARG) ? 1 : 0));;
+        return depth + inc;
+        }
+        case BIN(invokeblock):{
+          int inc = 0;
+        CALL_INFO ci = (CALL_INFO)(opes[0]);
+        inc += 1 - ci->orig_argc;;
+        return depth + inc;
+        }
+        case BIN(leave):{
+          return depth + 0;
+        }
+        case BIN(throw):{
+          return depth + 0;
+        }
+        case BIN(jump):{
+          return depth + 0;
+        }
+        case BIN(branchif):{
+          return depth + -1;
+        }
+        case BIN(branchunless):{
+          return depth + -1;
+        }
+        case BIN(getinlinecache):{
+          return depth + 1;
+        }
+        case BIN(onceinlinecache):{
+          return depth + 1;
+        }
+        case BIN(setinlinecache):{
+          return depth + 0;
+        }
+        case BIN(opt_case_dispatch):{
+          int inc = 0;
+        inc += -1;;
+        return depth + inc;
+        }
+        case BIN(opt_plus):{
+          return depth + -1;
+        }
+        case BIN(opt_minus):{
+          return depth + -1;
+        }
+        case BIN(opt_mult):{
+          return depth + -1;
+        }
+        case BIN(opt_div):{
+          return depth + -1;
+        }
+        case BIN(opt_mod):{
+          return depth + -1;
+        }
+        case BIN(opt_eq):{
+          return depth + -1;
+        }
+        case BIN(opt_neq):{
+          return depth + -1;
+        }
+        case BIN(opt_lt):{
+          return depth + -1;
+        }
+        case BIN(opt_le):{
+          return depth + -1;
+        }
+        case BIN(opt_gt):{
+          return depth + -1;
+        }
+        case BIN(opt_ge):{
+          return depth + -1;
+        }
+        case BIN(opt_ltlt):{
+          return depth + -1;
+        }
+        case BIN(opt_aref):{
+          return depth + -1;
+        }
+        case BIN(opt_aset):{
+          return depth + -2;
+        }
+        case BIN(opt_length):{
+          return depth + 0;
+        }
+        case BIN(opt_size):{
+          return depth + 0;
+        }
+        case BIN(opt_empty_p):{
+          return depth + 0;
+        }
+        case BIN(opt_succ):{
+          return depth + 0;
+        }
+        case BIN(opt_not):{
+          return depth + 0;
+        }
+        case BIN(opt_regexpmatch1):{
+          return depth + 0;
+        }
+        case BIN(opt_regexpmatch2):{
+          return depth + -1;
+        }
+        case BIN(opt_call_c_function):{
+          return depth + 0;
+        }
+        case BIN(bitblt):{
+          return depth + 1;
+        }
+        case BIN(answer):{
+          return depth + 1;
+        }
+        case BIN(getlocal_OP__WC__0):{
+          return depth + 1;
+        }
+        case BIN(getlocal_OP__WC__1):{
+          return depth + 1;
+        }
+        case BIN(setlocal_OP__WC__0):{
+          return depth + -1;
+        }
+        case BIN(setlocal_OP__WC__1):{
+          return depth + -1;
+        }
+        case BIN(putobject_OP_INT2FIX_O_0_C_):{
+          return depth + 1;
+        }
+        case BIN(putobject_OP_INT2FIX_O_1_C_):{
+          return depth + 1;
+        }
+
+  default:
+    rb_bug("insn_sp_increase: unreachable");
+  }
+  return 0;
+}
+#endif
+
+/* some utilities */
+
+static int
+insn_len(VALUE insn)
+{
+  return insn_len_info[(int)insn];
+}
+
+static const char *
+insn_name(VALUE insn)
+{
+  return insn_name_info[(int)insn];
+}
+
+static const char *
+insn_op_types(VALUE insn)
+{
+  return insn_operand_info[(int)insn];
+}
+
+static int
+insn_op_type(VALUE insn, long pos)
+{
+  int len = insn_len(insn) - 1;
+  if(pos < len){
+    return insn_operand_info[(int)insn][pos];
+  }
+  else{
+    return 0;
+  }
+}
+
+#ifdef USE_INSN_RET_NUM
+static int
+insn_ret_num(VALUE insn)
+{
+  return insn_stack_push_num_info[(int)insn];
+}
+#endif