11822 files changed, 1739130 insertions, 655856 deletions

diff --git a/.appveyor.yml b/.appveyor.yml
new file mode 100644
index 0000000000..05ff204541
--- /dev/null
+++ b/.appveyor.yml
@@ -0,0 +1,134 @@
+---
+version: '{build}'
+init:
+  - git config --global user.name git
+  - git config --global user.email svn-admin@ruby-lang.org
+  - git config --global core.autocrlf false
+  - git config --global core.eol lf
+  - git config --global advice.detachedHead 0
+shallow_clone: true
+clone_depth: 10
+platform:
+  - x64
+skip_commits:
+  message: /\[DOC\]/
+  files:
+    - doc/*
+    - '**/*.md'
+    - '**/*.rdoc'
+    - '**/.document'
+    - '**/*.[1-8]'
+    - '**/*.ronn'
+environment:
+  ruby_version: "24-%Platform%"
+  matrix:
+    # Test only the oldest supported version because AppVeyor is unstable, its concurrency
+    # is limited, and compatibility issues that happen only in newer versions are rare.
+    # You may test some other stuff on GitHub Actions instead.
+    - build: vs
+      vs: 120 # Visual Studio 2013
+      ssl: OpenSSL-v111
+      # The worker image name. This is NOT the Visual Studio version we're using here.
+      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
+      GEMS_FOR_TEST: ""
+  RELINE_TEST_ENCODING: "UTF-8"
+cache:
+  - c:\Tools\vcpkg\installed\
+for:
+-
+  matrix:
+    only:
+      - build: vs
+  install:
+    - ver
+    - chcp
+    - SET BITS=%Platform:x86=32%
+    - SET BITS=%BITS:x=%
+    - SET OPENSSL_DIR=C:\%ssl%-Win%BITS%
+    - cd C:\Tools\vcpkg
+    - git pull -q
+    - .\bootstrap-vcpkg.bat
+    - ps: Start-FileDownload 'https://github.com/microsoft/vcpkg-tool/releases/download/2023-08-09/vcpkg.exe' -FileName 'C:\Tools\vcpkg\vcpkg.exe'
+    - cd %APPVEYOR_BUILD_FOLDER%
+    - vcpkg --triplet %Platform%-windows install --x-use-aria2 libffi libyaml readline zlib
+    - CALL SET vcvars=%%^VS%VS%COMNTOOLS^%%..\..\VC\vcvarsall.bat
+    - SET vcvars
+    - '"%vcvars%" %Platform:x64=amd64%'
+    - SET ruby_path=C:\Ruby%ruby_version:-x86=%
+    - SET PATH=\usr\local\bin;%ruby_path%\bin;%PATH%;C:\msys64\mingw64\bin;C:\msys64\usr\bin
+    - ruby --version
+    - 'cl'
+    - echo> Makefile srcdir=.
+    - echo>> Makefile MSC_VER=0
+    - echo>> Makefile RT=none
+    - echo>> Makefile RT_VER=0
+    - echo>> Makefile BUILTIN_ENCOBJS=nul
+    - type win32\Makefile.sub >> Makefile
+    - nmake %mflags% up VCSUP="echo Update OK"
+    - nmake %mflags% extract-extlibs
+    - del Makefile
+    - mkdir \usr\local\bin
+    - mkdir \usr\local\include
+    - mkdir \usr\local\lib
+    - for %%I in (%OPENSSL_DIR%\*.dll) do mklink /h \usr\local\bin\%%~nxI %%I
+    - for %%I in (c:\Tools\vcpkg\installed\%Platform%-windows\bin\*.dll) do (
+        if not %%~nI == readline mklink \usr\local\bin\%%~nxI %%I
+      )
+    - attrib +r /s /d
+    - mkdir %Platform%-mswin_%vs%
+  build_script:
+    - set HAVE_GIT=no
+    - cd %APPVEYOR_BUILD_FOLDER%
+    - cd %Platform%-mswin_%vs%
+    - >-
+      ..\win32\configure.bat
+      --with-opt-dir="/usr/local;c:/Tools/vcpkg/installed/%Platform%-windows"
+      --with-openssl-dir=%OPENSSL_DIR:\=/%
+    - nmake -l
+    - nmake install-nodoc
+    - \usr\bin\ruby -v -e "p :locale => Encoding.find('locale'), :filesystem => Encoding.find('filesystem')"
+    - if not "%GEMS_FOR_TEST%" == "" \usr\bin\gem install --no-document %GEMS_FOR_TEST%
+    - \usr\bin\ruby -ropenssl -e "puts 'Build    ' + OpenSSL::OPENSSL_VERSION, 'Runtime  ' + OpenSSL::OPENSSL_LIBRARY_VERSION"
+  test_script:
+    - set /a JOBS=%NUMBER_OF_PROCESSORS%
+    - nmake -l "TESTOPTS=-v -q" btest
+    - nmake -l "TESTOPTS=-v -q" test-basic
+    - >-
+      nmake -l "TESTOPTS=--timeout-scale=3.0
+      --excludes=../test/excludes/_appveyor -j%JOBS%
+      --exclude win32ole
+      --exclude test_bignum
+      --exclude test_syntax
+      --exclude test_open-uri
+      --exclude test_bundled_ca
+      " test-all
+    # separately execute tests without -j which may crash worker with -j.
+    - >-
+      nmake -l
+      "TESTOPTS=--timeout-scale=3.0 --excludes=../test/excludes/_appveyor"
+      TESTS="
+      ../test/win32ole
+      ../test/ruby/test_bignum.rb
+      ../test/ruby/test_syntax.rb
+      ../test/open-uri/test_open-uri.rb
+      ../test/rubygems/test_bundled_ca.rb
+      " test-all
+    - nmake -l test-spec MSPECOPT=-fs # not using `-j` because sometimes `mspec -j` silently dies on Windows
+notifications:
+  - provider: Webhook
+    method: POST
+    url:
+      secure: CcFlJNDJ/a6to7u3Z4Fnz6dScEPNx7hTha2GkSRlV+1U6dqmxY/7uBcLXYb9gR3jfQk6w+2o/HrjNAyXMNGU/JOka3s2WRI4VKitzM+lQ08owvJIh0R7LxrGH0J2e81U # ruby-lang slack: ruby/simpler-alerts-bot
+    body: >-
+      {{^isPullRequest}}
+        {
+          "ci": "AppVeyor CI",
+          "env": "Visual Studio 2013",
+          "url": "{{buildUrl}}",
+          "commit": "{{commitId}}",
+          "branch": "{{branch}}"
+        }
+      {{/isPullRequest}}
+    on_build_success: false
+    on_build_failure: true
+    on_build_status_changed: false
diff --git a/.dir-locals.el b/.dir-locals.el
new file mode 100644
index 0000000000..8f4b96445c
--- /dev/null
+++ b/.dir-locals.el
@@ -0,0 +1,39 @@
+;; Copyright (c) 2018 Urabe, Shyouhei.  All rights reserved.
+;;
+;; This file is a part of  the programming language Ruby.  Permission is hereby
+;; granted, to either  redistribute and/or modify this file,  provided that the
+;; conditions mentioned  in the  file COPYING  are met.   Consult the  file for
+;; details.
+
+((nil .
+     ((indent-tabs-mode . nil)
+      (require-final-newline . t)
+      (tab-width . 8)
+      (show-trailing-whitespace . t)
+      (whitespace-line-column . 80))) ;; See also [Misc #12277]
+
+ ;; (bat-mode . ((buffer-file-coding-system . utf-8-dos)))
+
+ (ruby-mode . ((ruby-indent-level . 2)))
+
+ (rdoc-mode . ((fill-column . 74)))
+
+ (yaml-mode . ((yaml-indent-offset . 2)))
+
+ (makefile-mode . ((indent-tabs-mode . t)))
+
+ (c-mode . ((c-file-style . "ruby")))
+
+ (c++-mode . ((c-file-style . "ruby")))
+
+ (change-log-mode .
+     ((buffer-file-coding-system . us-ascii)
+      (indent-tabs-mode . t)
+      (change-log-indent-text . 2)
+      (add-log-time-format . (lambda (&optional x y)
+        (let* ((time (or x (current-time)))
+	       (system-time-locale "C")
+	       (diff (+ (cadr time) 32400))
+	       (lo (% diff 65536))
+	       (hi (+ (car time) (/ diff 65536))))
+        (format-time-string "%a %b %e %H:%M:%S %Y" (list hi lo) t)))))))
diff --git a/.document b/.document
index 9a5067bc52..3a6b0c238c 100644
--- a/.document
+++ b/.document
@@ -5,9 +5,31 @@
 
 # Process all the C source files
 *.c
+*.y
 
 # prelude
 prelude.rb
+rbconfig.rb
+
+array.rb
+ast.rb
+dir.rb
+gc.rb
+io.rb
+kernel.rb
+marshal.rb
+mjit.rb
+numeric.rb
+nilclass.rb
+pack.rb
+ractor.rb
+string.rb
+symbol.rb
+timev.rb
+thread_sync.rb
+trace_point.rb
+warning.rb
+yjit.rb
 
 # the lib/ directory (which has its own .document file)
 lib
@@ -16,13 +38,17 @@ lib
 ext
 
 # rdoc files
-ChangeLog
+NEWS.md
 
-NEWS
+README.md
+README.ja.md
 
-README
-README.EXT
-README.EXT.ja
-README.ja
+COPYING
+COPYING.ja
+
+LEGAL
+
+# win32/README.win32 linked from README.md
+win32
 
 doc
diff --git a/.editorconfig b/.editorconfig
index 67abf4b978..4633a7acae 100644
--- a/.editorconfig
+++ b/.editorconfig
@@ -2,15 +2,29 @@ root = true
 
 [*]
 end_of_line = lf
+indent_size = 4
+indent_style = space
 insert_final_newline = true
-trim_trailing_whitespace = true
 tab_width = 8
-indent_style = tab
-indent_size = 4
+trim_trailing_whitespace = true
 
-[**.bat]
+[*.bat]
 end_of_line = crlf
 
-[**.rb]
-indent_style = space
+[*.gemspec]
+indent_size = 2
+
+[*.rb]
+indent_size = 2
+
+[*.yml]
+indent_size = 2
+
+[{*[Mm]akefile*,*.mak,*.mk,depend}]
+indent_style = tab
+
+[enc/*]
+indent_size = 2
+
+[reg*.[ch]]
 indent_size = 2
diff --git a/.gdbinit b/.gdbinit
index 88e475254c..34d044caf6 100644
--- a/.gdbinit
+++ b/.gdbinit
@@ -1,3 +1,5 @@
+set startup-with-shell off
+
 define hook-run
   set $color_type = 0
   set $color_highlite = 0
@@ -14,88 +16,21 @@ define ruby_gdb_init
   if !$color_end
     set $color_end = "\033[m"
   end
+  if ruby_dummy_gdb_enums.special_consts
+  end
 end
 
 # set prompt \033[36m(gdb)\033[m\040
 
 define rp
   ruby_gdb_init
-  if ruby_dummy_gdb_enums.special_consts
-  end
   if (VALUE)($arg0) & RUBY_FIXNUM_FLAG
     printf "FIXNUM: %ld\n", (long)($arg0) >> 1
   else
   if ((VALUE)($arg0) & ~(~(VALUE)0<<RUBY_SPECIAL_SHIFT)) == RUBY_SYMBOL_FLAG
     set $id = (($arg0) >> RUBY_SPECIAL_SHIFT)
-    if $id == '!' || $id == '+' || $id == '-' || $id == '*' || $id == '/' || $id == '%' || $id == '<' || $id == '>' || $id == '`'
-      printf "SYMBOL(:%c)\n", $id
-    else
-    if $id == idDot2
-      printf "%sSYMBOL%s(:..)\n", $color_type, $color_end
-    else
-    if $id == idDot3
-      printf "%sSYMBOL%s(:...)\n", $color_type, $color_end
-    else
-    if $id == idUPlus
-      printf "%sSYMBOL%s(:+@)\n", $color_type, $color_end
-    else
-    if $id == idUMinus
-      printf "%sSYMBOL%s(:-@)\n", $color_type, $color_end
-    else
-    if $id == idPow
-      printf "%sSYMBOL%s(:**)\n", $color_type, $color_end
-    else
-    if $id == idCmp
-      printf "%sSYMBOL%s(:<=>)\n", $color_type, $color_end
-    else
-    if $id == idLTLT
-      printf "%sSYMBOL%s(:<<)\n", $color_type, $color_end
-    else
-    if $id == idLE
-      printf "%sSYMBOL%s(:<=)\n", $color_type, $color_end
-    else
-    if $id == idGE
-      printf "%sSYMBOL%s(:>=)\n", $color_type, $color_end
-    else
-    if $id == idEq
-      printf "%sSYMBOL%s(:==)\n", $color_type, $color_end
-    else
-    if $id == idEqq
-      printf "%sSYMBOL%s(:===)\n", $color_type, $color_end
-    else
-    if $id == idNeq
-      printf "%sSYMBOL%s(:!=)\n", $color_type, $color_end
-    else
-    if $id == idEqTilde
-      printf "%sSYMBOL%s(:=~)\n", $color_type, $color_end
-    else
-    if $id == idNeqTilde
-      printf "%sSYMBOL%s(:!~)\n", $color_type, $color_end
-    else
-    if $id == idAREF
-      printf "%sSYMBOL%s(:[])\n", $color_type, $color_end
-    else
-    if $id == idASET
-      printf "%sSYMBOL%s(:[]=)\n", $color_type, $color_end
-    else
-      printf "%sSYMBOL%s(%ld)\n", $color_type, $color_end, $id
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
+    printf "%sSYMBOL%s: ", $color_type, $color_end
+    rp_id $id
   else
   if ($arg0) == RUBY_Qfalse
     echo false\n
@@ -117,6 +52,9 @@ define rp
     end
   else
   set $flags = ((struct RBasic*)($arg0))->flags
+  if ($flags & RUBY_FL_PROMOTED) == RUBY_FL_PROMOTED
+    printf "[PROMOTED] "
+  end
   if ($flags & RUBY_T_MASK) == RUBY_T_NONE
     printf "%sT_NONE%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
@@ -127,7 +65,15 @@ define rp
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_OBJECT
     printf "%sT_OBJECT%s: ", $color_type, $color_end
-    print (struct RObject *)($arg0)
+    print ((struct RObject *)($arg0))->basic
+    if ($flags & ROBJECT_EMBED)
+      print/x *((VALUE*)((struct RObject*)($arg0))->as.ary) @ (ROBJECT_EMBED_LEN_MAX+0)
+    else
+      print (((struct RObject *)($arg0))->as.heap)
+      if (((struct RObject*)($arg0))->as.heap.numiv) > 0
+        print/x *(((struct RObject*)($arg0))->as.heap.ivptr) @ (((struct RObject*)($arg0))->as.heap.numiv)
+      end
+    end
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_CLASS
     printf "%sT_CLASS%s%s: ", $color_type, ($flags & RUBY_FL_SINGLETON) ? "*" : "", $color_end
@@ -147,52 +93,21 @@ define rp
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_STRING
     printf "%sT_STRING%s: ", $color_type, $color_end
-    set print address off
-    output (char *)(($flags & RUBY_FL_USER1) ? \
-	    ((struct RString*)($arg0))->as.heap.ptr : \
-	    ((struct RString*)($arg0))->as.ary)
-    set print address on
-    printf " bytesize:%ld ", ($flags & RUBY_FL_USER1) ? \
-            ((struct RString*)($arg0))->as.heap.len : \
-            (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
-    if !($flags & RUBY_FL_USER1)
-      printf "(embed) "
-    else
-      if ($flags & RUBY_FL_USER2)
-        printf "(shared) "
-      end
-      if ($flags & RUBY_FL_USER3)
-        printf "(assoc) "
-      end
-    end
-    printf "encoding:%d ", ($flags & RUBY_ENCODING_MASK) >> RUBY_ENCODING_SHIFT
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == 0
-      printf "coderange:unknown "
-    else
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_7BIT
-      printf "coderange:7bit "
-    else
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_VALID
-      printf "coderange:valid "
-    else
-      printf "coderange:broken "
-    end
-    end
-    end
-    print (struct RString *)($arg0)
+    rp_string $arg0 $flags
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_REGEXP
     set $regsrc = ((struct RRegexp*)($arg0))->src
     set $rsflags = ((struct RBasic*)$regsrc)->flags
     printf "%sT_REGEXP%s: ", $color_type, $color_end
+    set $len = ($rsflags & RUBY_FL_USER1) ? \
+            ((struct RString*)$regsrc)->as.heap.len : \
+            (($rsflags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
     set print address off
-    output (char *)(($rsflags & RUBY_FL_USER1) ? \
+    output *(char *)(($rsflags & RUBY_FL_USER1) ? \
 	    ((struct RString*)$regsrc)->as.heap.ptr : \
-	    ((struct RString*)$regsrc)->as.ary)
+	    ((struct RString*)$regsrc)->as.ary) @ $len
     set print address on
-    printf " len:%ld ", ($rsflags & RUBY_FL_USER1) ? \
-            ((struct RString*)$regsrc)->as.heap.len : \
-            (($rsflags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+    printf " len:%ld ", $len
     if $flags & RUBY_FL_USER6
       printf "(none) "
     end
@@ -213,7 +128,7 @@ define rp
       if ($len == 0)
 	printf "{(empty)} "
       else
-	output/x *((VALUE*)((struct RArray*)($arg0))->as.ary) @ $len
+	print/x *((VALUE*)((struct RArray*)($arg0))->as.ary) @ $len
 	printf " "
       end
     else
@@ -221,7 +136,7 @@ define rp
       printf "%sT_ARRAY%s: len=%ld ", $color_type, $color_end, $len
       if ($flags & RUBY_FL_USER2)
 	printf "(shared) shared="
-	output/x ((struct RArray*)($arg0))->as.heap.aux.shared
+	output/x ((struct RArray*)($arg0))->as.heap.aux.shared_root
 	printf " "
       else
 	printf "(ownership) capa=%ld ", ((struct RArray*)($arg0))->as.heap.aux.capa
@@ -229,7 +144,7 @@ define rp
       if ($len == 0)
 	printf "{(empty)} "
       else
-	output/x *((VALUE*)((struct RArray*)($arg0))->as.heap.ptr) @ $len
+	print/x *((VALUE*)((struct RArray*)($arg0))->as.heap.ptr) @ $len
 	printf " "
       end
     end
@@ -241,34 +156,27 @@ define rp
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_HASH
     printf "%sT_HASH%s: ", $color_type, $color_end,
-    if ((struct RHash *)($arg0))->ntbl
-      printf "len=%ld ", ((struct RHash *)($arg0))->ntbl->num_entries
+    if (((struct RHash *)($arg0))->basic.flags & RHASH_ST_TABLE_FLAG)
+      printf "st len=%ld ", ((struct RHash *)($arg0))->as.st->num_entries
+    else
+      printf "li len=%ld bound=%ld ", \
+        ((((struct RHash *)($arg0))->basic.flags & RHASH_AR_TABLE_SIZE_MASK) >> RHASH_AR_TABLE_SIZE_SHIFT), \
+        ((((struct RHash *)($arg0))->basic.flags & RHASH_AR_TABLE_BOUND_MASK) >> RHASH_AR_TABLE_BOUND_SHIFT)
     end
     print (struct RHash *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_STRUCT
-    printf "%sT_STRUCT%s: len=%ld ", $color_type, $color_end, \
-      (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
+    set $len = (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
        ($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) >> (RUBY_FL_USHIFT+1) : \
        ((struct RStruct *)($arg0))->as.heap.len)
+    printf "%sT_STRUCT%s: len=%ld ", $color_type, $color_end, $len
     print (struct RStruct *)($arg0)
-    x/xw (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
-          ((struct RStruct *)($arg0))->as.ary : \
-          ((struct RStruct *)($arg0))->as.heap.ptr)
+    output/x *(($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
+              ((struct RStruct *)($arg0))->as.ary : \
+              ((struct RStruct *)($arg0))->as.heap.ptr) @ $len
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_BIGNUM
-    printf "%sT_BIGNUM%s: sign=%d len=%ld ", $color_type, $color_end, \
-      (($flags & RUBY_FL_USER1) != 0), \
-      (($flags & RUBY_FL_USER2) ? \
-       ($flags & (RUBY_FL_USER5|RUBY_FL_USER4|RUBY_FL_USER3)) >> (RUBY_FL_USHIFT+3) : \
-       ((struct RBignum*)($arg0))->as.heap.len)
-    if $flags & RUBY_FL_USER2
-      printf "(embed) "
-    end
-    print (struct RBignum *)($arg0)
-    x/xw (($flags & RUBY_FL_USER2) ? \
-          ((struct RBignum*)($arg0))->as.ary : \
-          ((struct RBignum*)($arg0))->as.heap.digits)
+    rp_bignum $arg0
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_RATIONAL
     printf "%sT_RATIONAL%s: ", $color_type, $color_end
@@ -307,12 +215,46 @@ define rp
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_SYMBOL
     printf "%sT_SYMBOL%s: ", $color_type, $color_end
-    print (struct RBasic *)($arg0)
+    print (struct RSymbol *)($arg0)
+    set $id_type = ((struct RSymbol *)($arg0))->id & RUBY_ID_SCOPE_MASK
+    if $id_type == RUBY_ID_LOCAL
+      printf "l"
+    else
+    if $id_type == RUBY_ID_INSTANCE
+      printf "i"
+    else
+    if $id_type == RUBY_ID_GLOBAL
+      printf "G"
+    else
+    if $id_type == RUBY_ID_ATTRSET
+      printf "a"
+    else
+    if $id_type == RUBY_ID_CONST
+      printf "C"
+    else
+    if $id_type == RUBY_ID_CLASS
+      printf "c"
+    else
+      printf "j"
+    end
+    end
+    end
+    end
+    end
+    end
+    set $id_fstr = ((struct RSymbol *)($arg0))->fstr
+    rp_string $id_fstr
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_UNDEF
     printf "%sT_UNDEF%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
+  if ($flags & RUBY_T_MASK) == RUBY_T_IMEMO
+    printf "%sT_IMEMO%s(", $color_type, $color_end
+    output (enum imemo_type)(($flags>>RUBY_FL_USHIFT)&RUBY_IMEMO_MASK)
+    printf "): "
+    rp_imemo $arg0
+  else
   if ($flags & RUBY_T_MASK) == RUBY_T_NODE
     printf "%sT_NODE%s(", $color_type, $color_end
     output (enum node_type)(($flags&RUBY_NODE_TYPEMASK)>>RUBY_NODE_TYPESHIFT)
@@ -323,6 +265,10 @@ define rp
     printf "%sT_ZOMBIE%s: ", $color_type, $color_end
     print (struct RData *)($arg0)
   else
+  if ($flags & RUBY_T_MASK) == RUBY_T_MOVED
+    printf "%sT_MOVED%s: ", $color_type, $color_end
+    print *(struct RMoved *)$arg0
+  else
     printf "%sunknown%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   end
@@ -357,24 +303,303 @@ define rp
   end
   end
   end
+  end
+  end
 end
 document rp
   Print a Ruby's VALUE.
 end
 
+define rp_id
+  set $id = (ID)$arg0
+  if $id == '!' || $id == '+' || $id == '-' || $id == '*' || $id == '/' || $id == '%' || $id == '<' || $id == '>' || $id == '`'
+    printf "(:%c)\n", $id
+  else
+  if $id == idDot2
+    printf "(:..)\n"
+  else
+  if $id == idDot3
+    printf "(:...)\n"
+  else
+  if $id == idUPlus
+    printf "(:+@)\n"
+  else
+  if $id == idUMinus
+    printf "(:-@)\n"
+  else
+  if $id == idPow
+    printf "(:**)\n"
+  else
+  if $id == idCmp
+    printf "(:<=>)\n"
+  else
+  if $id == idLTLT
+    printf "(:<<)\n"
+  else
+  if $id == idGTGT
+    printf "(:>>)\n"
+  else
+  if $id == idLE
+    printf "(:<=)\n"
+  else
+  if $id == idGE
+    printf "(:>=)\n"
+  else
+  if $id == idEq
+    printf "(:==)\n"
+  else
+  if $id == idEqq
+    printf "(:===)\n"
+  else
+  if $id == idNeq
+    printf "(:!=)\n"
+  else
+  if $id == idEqTilde
+    printf "(:=~)\n"
+  else
+  if $id == idNeqTilde
+    printf "(:!~)\n"
+  else
+  if $id == idAREF
+    printf "(:[])\n"
+  else
+  if $id == idASET
+    printf "(:[]=)\n"
+  else
+  if $id == idCOLON2
+    printf "(:'::')\n"
+  else
+  if $id == idANDOP
+    printf "(:&&)\n"
+  else
+  if $id == idOROP
+    printf "(:||)\n"
+  else
+  if $id == idANDDOT
+    printf "(:&.)\n"
+  else
+    if $id <= tLAST_OP_ID
+      printf "O"
+    else
+      set $id_type = $id & RUBY_ID_SCOPE_MASK
+      if $id_type == RUBY_ID_LOCAL
+        printf "l"
+      else
+      if $id_type == RUBY_ID_INSTANCE
+        printf "i"
+      else
+      if $id_type == RUBY_ID_GLOBAL
+        printf "G"
+      else
+      if $id_type == RUBY_ID_ATTRSET
+        printf "a"
+      else
+      if $id_type == RUBY_ID_CONST
+        printf "C"
+      else
+      if $id_type == RUBY_ID_CLASS
+        printf "c"
+      else
+        printf "j"
+      end
+      end
+      end
+      end
+      end
+      end
+    end
+    printf "(%ld): ", $id
+    print_id $id
+    echo \n
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+end
+document rp_id
+  Print an ID.
+end
+
+define output_string
+  set $flags = ((struct RBasic*)($arg0))->flags
+  set $len = ($flags & RUBY_FL_USER1) ? \
+          ((struct RString*)($arg0))->as.heap.len : \
+          (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+  if $len > 0
+    output *(char *)(($flags & RUBY_FL_USER1) ? \
+	    ((struct RString*)($arg0))->as.heap.ptr : \
+	    ((struct RString*)($arg0))->as.ary) @ $len
+  else
+    output ""
+  end
+end
+
+define print_string
+  set $flags = ((struct RBasic*)($arg0))->flags
+  set $len = ($flags & RUBY_FL_USER1) ? \
+          ((struct RString*)($arg0))->as.heap.len : \
+          (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+  if $len > 0
+    printf "%s", *(char *)(($flags & RUBY_FL_USER1) ? \
+	    ((struct RString*)($arg0))->as.heap.ptr : \
+	    ((struct RString*)($arg0))->as.ary) @ $len
+  end
+end
+
+define rp_string
+  output_string $arg0
+  printf " bytesize:%ld ", $len
+  if !($flags & RUBY_FL_USER1)
+    printf "(embed) "
+  else
+    if ($flags & RUBY_FL_USER2)
+      printf "(shared) "
+    end
+    if ($flags & RUBY_FL_USER3)
+      printf "(assoc) "
+    end
+  end
+  printf "encoding:%d ", ($flags & RUBY_ENCODING_MASK) >> RUBY_ENCODING_SHIFT
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == 0
+    printf "coderange:unknown "
+  else
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_7BIT
+    printf "coderange:7bit "
+  else
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_VALID
+    printf "coderange:valid "
+  else
+    printf "coderange:broken "
+  end
+  end
+  end
+  print (struct RString *)($arg0)
+end
+document rp_string
+  Print the content of a String.
+end
+
+define rp_bignum
+  set $flags = ((struct RBignum*)($arg0))->basic.flags
+  set $len = (($flags & RUBY_FL_USER2) ? \
+       ($flags & (RUBY_FL_USER5|RUBY_FL_USER4|RUBY_FL_USER3)) >> (RUBY_FL_USHIFT+3) : \
+       ((struct RBignum*)($arg0))->as.heap.len)
+  printf "%sT_BIGNUM%s: sign=%d len=%ld ", $color_type, $color_end, \
+         (($flags & RUBY_FL_USER1) != 0), $len
+  if $flags & RUBY_FL_USER2
+    printf "(embed) "
+  end
+  print (struct RBignum *)($arg0)
+  set $ptr = (($flags & RUBY_FL_USER2) ? \
+              ((struct RBignum*)($arg0))->as.ary : \
+              ((struct RBignum*)($arg0))->as.heap.digits)
+  set $len = $len-1
+  printf "0x%x", $ptr[$len]
+  while $len > 0
+    set $len = $len-1
+    set $val = $ptr[$len]
+    set $w = sizeof($ptr[0])
+    printf "_"
+    if $w > 8
+      printf "%.32x", $val
+    else
+    if $w > 4
+      printf "%.16x", $val
+    else
+    if $w > 2
+      printf "%.8x", $val
+    else
+    if $w > 1
+      printf "%.4x", $val
+    else
+      printf "%.2x", $val
+    end
+    end
+    end
+    end
+  end
+  printf "\n"
+end
+document rp_bignum
+  Print the content of a Bignum.
+end
+
 define rp_class
   printf "(struct RClass *) %p", (void*)$arg0
-  if ((struct RClass *)($arg0))->ptr.origin != $arg0
-    printf " -> %p", ((struct RClass *)($arg0))->ptr.origin
+  if RCLASS_ORIGIN((struct RClass *)($arg0)) != $arg0
+    printf " -> %p", RCLASS_ORIGIN((struct RClass *)($arg0))
   end
   printf "\n"
-  print *(struct RClass *)($arg0)
-  print *((struct RClass *)($arg0))->ptr
+  rb_classname $arg0
+  print/x *(struct RClass *)($arg0)
+  print *RCLASS_EXT((struct RClass *)($arg0))
 end
 document rp_class
   Print the content of a Class/Module.
 end
 
+define rp_imemo
+  set $flags = (enum imemo_type)((((struct RBasic *)($arg0))->flags >> RUBY_FL_USHIFT) & RUBY_IMEMO_MASK)
+  if $flags == imemo_cref
+    printf "(rb_cref_t *) %p\n", (void*)$arg0
+    print *(rb_cref_t *)$arg0
+  else
+  if $flags == imemo_svar
+    printf "(struct vm_svar *) %p\n", (void*)$arg0
+    print *(struct vm_svar *)$arg0
+  else
+  if $flags == imemo_throw_data
+    printf "(struct vm_throw_data *) %p\n", (void*)$arg0
+    print *(struct vm_throw_data *)$arg0
+  else
+  if $flags == imemo_ifunc
+    printf "(struct vm_ifunc *) %p\n", (void*)$arg0
+    print *(struct vm_ifunc *)$arg0
+  else
+  if $flags == imemo_memo
+    printf "(struct MEMO *) %p\n", (void*)$arg0
+    print *(struct MEMO *)$arg0
+  else
+  if $flags == imemo_ment
+    printf "(rb_method_entry_t *) %p\n", (void*)$arg0
+    print *(rb_method_entry_t *)$arg0
+  else
+  if $flags == imemo_iseq
+    printf "(rb_iseq_t *) %p\n", (void*)$arg0
+    print *(rb_iseq_t *)$arg0
+  else
+    printf "(struct RIMemo *) %p\n", (void*)$arg0
+    print *(struct RIMemo *)$arg0
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+end
+document rp_imemo
+  Print the content of a memo
+end
+
 define nd_type
   print (enum node_type)((((NODE*)($arg0))->flags&RUBY_NODE_TYPEMASK)>>RUBY_NODE_TYPESHIFT)
 end
@@ -484,12 +709,6 @@ define nd_cval
   rp ($arg0).u3.value
 end
 
-
-define nd_cnt
-  printf "%su3.cnt%s: ", $color_highlite, $color_end
-  p ($arg0).u3.cnt
-end
-
 define nd_tbl
   printf "%su1.tbl%s: ", $color_highlite, $color_end
   p ($arg0).u1.tbl
@@ -528,12 +747,6 @@ define nd_lit
   rp ($arg0).u1.value
 end
 
-
-define nd_frml
-  printf "%su1.node%s: ", $color_highlite, $color_end
-  rp ($arg0).u1.node
-end
-
 define nd_rest
   printf "%su2.argc%s: ", $color_highlite, $color_end
   p ($arg0).u2.argc
@@ -560,12 +773,6 @@ define nd_args
   rp ($arg0).u3.node
 end
 
-
-define nd_noex
-  printf "%su1.id%s: ", $color_highlite, $color_end
-  p ($arg0).u1.id
-end
-
 define nd_defn
   printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
@@ -583,17 +790,6 @@ define nd_new
 end
 
 
-define nd_cfnc
-  printf "%su1.cfunc%s: ", $color_highlite, $color_end
-  p ($arg0).u1.cfunc
-end
-
-define nd_argc
-  printf "%su2.argc%s: ", $color_highlite, $color_end
-  p ($arg0).u2.argc
-end
-
-
 define nd_cname
   printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
@@ -653,6 +849,12 @@ define nd_tval
   rp ($arg0).u2.value
 end
 
+define nd_tree
+  set $buf = (struct RString *)rb_str_buf_new(0)
+  call dump_node((VALUE)($buf), rb_str_tmp_new(0), 0, ($arg0))
+  printf "%s\n", $buf->as.heap.ptr
+end
+
 define rb_p
   call rb_p($arg0)
 end
@@ -674,7 +876,7 @@ define rb_numtable_entry
       end
     end
   else
-    set $rb_numtable_p = $rb_numtable_tbl->as.big.bins[$rb_numtable_id % $rb_numtable_tbl->num_bins]
+    set $rb_numtable_p = $rb_numtable_tbl->as.big.bins[st_numhash($rb_numtable_id) % $rb_numtable_tbl->num_bins]
     while $rb_numtable_p
       if $rb_numtable_p->key == $rb_numtable_id
 	set $rb_numtable_key = $rb_numtable_p->key
@@ -688,12 +890,9 @@ define rb_numtable_entry
 end
 
 define rb_id2name
-  rb_numtable_entry global_symbols.id_str (ID)$arg0
-  if $rb_numtable_rec
-    rp $rb_numtable_rec
-  else
-    echo undef\n
-  end
+  ruby_gdb_init
+  printf "%sID%s: ", $color_type, $color_end
+  rp_id $arg0
 end
 document rb_id2name
   Print the name of id
@@ -704,10 +903,10 @@ define rb_method_entry
   set $rb_method_entry_id = (ID)$arg1
   set $rb_method_entry_me = (rb_method_entry_t *)0
   while !$rb_method_entry_me && $rb_method_entry_klass
-    rb_numtable_entry $rb_method_entry_klass->m_tbl $rb_method_entry_id
+    rb_numtable_entry $rb_method_entry_klass->m_tbl_wrapper->tbl $rb_method_entry_id
     set $rb_method_entry_me = (rb_method_entry_t *)$rb_numtable_rec
     if !$rb_method_entry_me
-      set $rb_method_entry_klass = (struct RClass *)$rb_method_entry_klass->ptr->super
+      set $rb_method_entry_klass = (struct RClass *)RCLASS_SUPER($rb_method_entry_klass)
     end
   end
   if $rb_method_entry_me
@@ -722,16 +921,20 @@ document rb_method_entry
 end
 
 define rb_classname
-  call classname($arg0)
-  rb_p $
-  print *(struct RClass*)($arg0)
+  # up to 128bit int
+  set $rb_classname = rb_mod_name($arg0)
+  if $rb_classname != RUBY_Qnil
+    rp $rb_classname
+  else
+    echo anonymous class/module\n
+  end
 end
 
 define rb_ancestors
   set $rb_ancestors_module = $arg0
   while $rb_ancestors_module
-    rp $rb_ancestors_module
-    set $rb_ancestors_module = ((struct RClass *)($rb_ancestors_module))->ptr.super
+    rp_class $rb_ancestors_module
+    set $rb_ancestors_module = RCLASS_SUPER($rb_ancestors_module)
   end
 end
 document rb_ancestors
@@ -768,7 +971,7 @@ define iseq
 end
 
 define rb_ps
-  rb_ps_vm ruby_current_vm
+  rb_ps_vm ruby_current_vm_ptr
 end
 document rb_ps
 Dump all threads and their callstacks
@@ -776,36 +979,307 @@ end
 
 define rb_ps_vm
   print $ps_vm = (rb_vm_t*)$arg0
-  set $ps_threads = (st_table*)$ps_vm->living_threads
-  if $ps_threads->entries_packed
-    set $ps_threads_i = 0
-    while $ps_threads_i < $ps_threads->num_entries
-      set $ps_threads_key = (st_data_t)$ps_threads->as.packed.entries[$ps_threads_i].key
-      set $ps_threads_val = (st_data_t)$ps_threads->as.packed.entries[$ps_threads_i].val
-      rb_ps_thread $ps_threads_key $ps_threads_val
-      set $ps_threads_i = $ps_threads_i + 1
-    end
-  else
-    set $ps_threads_ptr = (st_table_entry*)$ps_threads->head
-    while $ps_threads_ptr
-      set $ps_threads_key = (st_data_t)$ps_threads_ptr->key
-      set $ps_threads_val = (st_data_t)$ps_threads_ptr->record
-      rb_ps_thread $ps_threads_key $ps_threads_val
-      set $ps_threads_ptr = (st_table_entry*)$ps_threads_ptr->fore
+  set $ps_thread_ln      = $ps_vm->ractor.main_ractor.threads.set.n.next
+  set $ps_thread_ln_last = $ps_vm->ractor.main_ractor.threads.set.n.prev
+  while 1
+    set $ps_thread_th = (rb_thread_t *)$ps_thread_ln
+    set $ps_thread = (VALUE)($ps_thread_th->self)
+    rb_ps_thread $ps_thread
+    if $ps_thread_ln == $ps_thread_ln_last
+      loop_break
     end
+    set $ps_thread_ln = $ps_thread_ln->next
   end
 end
 document rb_ps_vm
 Dump all threads in a (rb_vm_t*) and their callstacks
 end
 
+define print_lineno
+  set $cfp = $arg0
+  set $iseq = $cfp->iseq
+  set $pos = $cfp->pc - $iseq->body->iseq_encoded
+  if $pos != 0
+    set $pos = $pos - 1
+  end
+
+  set $index = 0
+  set $size = $iseq->body->insns_info.size
+  set $table = $iseq->body->insns_info.body
+  set $positions = $iseq->body->insns_info.positions
+  #printf "size: %d\n", $size
+  if $size == 0
+  else
+  if $size == 1
+    printf "%d", $table[0].line_no
+  else
+    if $positions
+      # get_insn_info_linear_search
+      set $index = 1
+      while $index < $size
+        #printf "table[%d]: position: %d, line: %d, pos: %d\n", $i, $positions[$i], $table[$i].line_no, $pos
+        if $positions[$index] > $pos
+          loop_break
+        end
+        set $index = $index + 1
+        if $positions[$index] == $pos
+          loop_break
+        end
+      end
+    else
+      # get_insn_info_succinct_bitvector
+      set $sd = $iseq->body->insns_info.succ_index_table
+      set $immediate_table_size = sizeof($sd->imm_part) / sizeof(uint64_t) * 9
+      if $pos < $immediate_table_size
+        set $i = $pos / 9
+        set $j = $pos % 9
+        set $index = ((int)($sd->imm_part[$i] >> ($j * 7))) & 0x7f
+      else
+        set $block_index = ($pos - $immediate_table_size) / 512
+        set $block = &$sd->succ_part[$block_index]
+        set $block_bit_index = ($pos - $immediate_table_size) % 512
+        set $small_block_index = $block_bit_index / 64
+        set $small_block_popcount = $small_block_index == 0 ? 0 : (((int)($block->small_block_ranks >> (($small_block_index - 1) * 9))) & 0x1ff)
+        set $x = $block->bits[$small_block_index] << (63 - $block_bit_index % 64)
+        set $x = ($x & 0x5555555555555555) + ($x >> 1 & 0x5555555555555555)
+        set $x = ($x & 0x3333333333333333) + ($x >> 2 & 0x3333333333333333)
+        set $x = ($x & 0x0707070707070707) + ($x >> 4 & 0x0707070707070707)
+        set $x = ($x & 0x001f001f001f001f) + ($x >> 8 & 0x001f001f001f001f)
+        set $x = ($x & 0x0000003f0000003f) + ($x >>16 & 0x0000003f0000003f)
+        set $popcnt = ($x & 0x7f) + ($x >>32 & 0x7f)
+        set $index = $block->rank + $small_block_popcount + $popcnt
+      end
+    end
+    printf "%d", $table[$index-1].line_no
+  end
+  end
+end
+
+define check_method_entry
+  set $imemo = (struct RBasic *)$arg0
+  if $imemo != RUBY_Qfalse
+    set $type = ($imemo->flags >> 12) & 0x07
+    if $type == imemo_ment
+      set $me = (rb_callable_method_entry_t *)$imemo
+    else
+    if $type == imemo_svar
+      set $imemo = ((struct vm_svar *)$imemo)->cref_or_me
+      check_method_entry $imemo
+    end
+    end
+  end
+end
+
+define print_id
+  set $id = $arg0
+  # rb_id_to_serial
+  if $id > tLAST_OP_ID
+    set $serial = (rb_id_serial_t)($id >> RUBY_ID_SCOPE_SHIFT)
+  else
+    set $serial = (rb_id_serial_t)$id
+  end
+  if $serial && $serial <= ruby_global_symbols.last_id
+    set $idx = $serial / ID_ENTRY_UNIT
+    set $ids = (struct RArray *)ruby_global_symbols.ids
+    set $flags = $ids->basic.flags
+    if ($flags & RUBY_FL_USER1)
+      set $idsptr = $ids->as.ary
+      set $idslen = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
+    else
+      set $idsptr = $ids->as.heap.ptr
+      set $idslen = $ids->as.heap.len
+    end
+    if $idx < $idslen
+      set $t = 0
+      set $ary = (struct RArray *)$idsptr[$idx]
+      if $ary != RUBY_Qnil
+        set $flags = $ary->basic.flags
+        if ($flags & RUBY_FL_USER1)
+          set $aryptr = $ary->as.ary
+          set $arylen = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
+        else
+          set $aryptr = $ary->as.heap.ptr
+          set $arylen = $ary->as.heap.len
+        end
+        set $result = $aryptr[($serial % ID_ENTRY_UNIT) * ID_ENTRY_SIZE + $t]
+        if $result != RUBY_Qnil
+          print_string $result
+        else
+          echo undef
+        end
+      end
+    end
+  end
+end
+
+define print_pathobj
+  set $flags = ((struct RBasic*)($arg0))->flags
+  if ($flags & RUBY_T_MASK) == RUBY_T_STRING
+    print_string $arg0
+  end
+  if ($flags & RUBY_T_MASK) == RUBY_T_ARRAY
+    if $flags & RUBY_FL_USER1
+      set $str = ((struct RArray*)($arg0))->as.ary[0]
+    else
+      set $str = ((struct RArray*)($arg0))->as.heap.ptr[0]
+    end
+    print_string $str
+  end
+end
+
 define rb_ps_thread
   set $ps_thread = (struct RTypedData*)$arg0
-  set $ps_thread_id = $arg1
-  print $ps_thread_th = (rb_thread_t*)$ps_thread->data
+  set $ps_thread_th = (rb_thread_t*)$ps_thread->data
+  printf "* #<Thread:%p rb_thread_t:%p native_thread:%p>\n", \
+    $ps_thread, $ps_thread_th, $ps_thread_th->thread_id
+  set $cfp = $ps_thread_th->ec->cfp
+  set $cfpend = (rb_control_frame_t *)($ps_thread_th->ec->vm_stack + $ps_thread_th->ec->vm_stack_size)-1
+  while $cfp < $cfpend
+    if $cfp->iseq
+      if !((VALUE)$cfp->iseq & RUBY_IMMEDIATE_MASK) && (((imemo_ifunc << RUBY_FL_USHIFT) | RUBY_T_IMEMO)==$cfp->iseq->flags & ((RUBY_IMEMO_MASK << RUBY_FL_USHIFT) | RUBY_T_MASK))
+        printf "%d:ifunc ", $cfpend-$cfp
+        set print symbol-filename on
+        output/a $cfp->iseq.body
+        set print symbol-filename off
+        printf "\n"
+      else
+      if $cfp->pc
+        set $location = $cfp->iseq->body->location
+        printf "%d:", $cfpend-$cfp
+        print_pathobj $location.pathobj
+        printf ":"
+        print_lineno $cfp
+        printf ":in `"
+        print_string $location.label
+        printf "'\n"
+      else
+        printf "%d: ???.rb:???:in `???'\n", $cfpend-$cfp
+      end
+      end
+    else
+      # if VM_FRAME_TYPE($cfp->flag) == VM_FRAME_MAGIC_CFUNC
+      set $ep = $cfp->ep
+      if ($ep[0] & 0xffff0001) == 0x55550001
+        #define VM_ENV_FLAG_LOCAL 0x02
+        #define VM_ENV_PREV_EP(ep)   GC_GUARDED_PTR_REF(ep[VM_ENV_DATA_INDEX_SPECVAL])
+        set $me = 0
+        set $env_specval = $ep[-1]
+        set $env_me_cref = $ep[-2]
+        while ($env_specval & 0x02) != 0
+          check_method_entry $env_me_cref
+          if $me != 0
+            loop_break
+          end
+          set $ep = $ep[0]
+          set $env_specval = $ep[-1]
+          set $env_me_cref = $ep[-2]
+        end
+        if $me == 0
+          check_method_entry $env_me_cref
+        end
+        printf "%d:", $cfpend-$cfp
+        set print symbol-filename on
+        output/a $me->def->body.cfunc.func
+        set print symbol-filename off
+        set $mid = $me->def->original_id
+        printf ":in `"
+        print_id $mid
+        printf "'\n"
+      else
+        printf "%d:unknown_frame:???:in `???'\n", $cfpend-$cfp
+      end
+    end
+    set $cfp = $cfp + 1
+  end
 end
 
-# Details: https://bugs.ruby-lang.org/projects/ruby-trunk/wiki/MachineInstructionsTraceWithGDB
+define rb_count_objects
+  set $objspace = ruby_current_vm_ptr->objspace
+  set $counts_00 = 0
+  set $counts_01 = 0
+  set $counts_02 = 0
+  set $counts_03 = 0
+  set $counts_04 = 0
+  set $counts_05 = 0
+  set $counts_06 = 0
+  set $counts_07 = 0
+  set $counts_08 = 0
+  set $counts_09 = 0
+  set $counts_0a = 0
+  set $counts_0b = 0
+  set $counts_0c = 0
+  set $counts_0d = 0
+  set $counts_0e = 0
+  set $counts_0f = 0
+  set $counts_10 = 0
+  set $counts_11 = 0
+  set $counts_12 = 0
+  set $counts_13 = 0
+  set $counts_14 = 0
+  set $counts_15 = 0
+  set $counts_16 = 0
+  set $counts_17 = 0
+  set $counts_18 = 0
+  set $counts_19 = 0
+  set $counts_1a = 0
+  set $counts_1b = 0
+  set $counts_1c = 0
+  set $counts_1d = 0
+  set $counts_1e = 0
+  set $counts_1f = 0
+  set $total = 0
+  set $i = 0
+  while $i < $objspace->heap_pages.allocated_pages
+    printf "\rcounting... %d/%d", $i, $objspace->heap_pages.allocated_pages
+    set $page = $objspace->heap_pages.sorted[$i]
+    set $p = $page->start
+    set $pend = $p + $page->total_slots
+    while $p < $pend
+      set $flags = $p->as.basic.flags & 0x1f
+      eval "set $counts_%02x = $counts_%02x + 1", $flags, $flags
+      set $p = $p + 1
+    end
+    set $total = $total + $page->total_slots
+    set $i = $i + 1
+  end
+  printf "\rTOTAL: %d, FREE: %d\n", $total, $counts_00
+  printf "T_OBJECT: %d\n", $counts_01
+  printf "T_CLASS: %d\n", $counts_02
+  printf "T_MODULE: %d\n", $counts_03
+  printf "T_FLOAT: %d\n", $counts_04
+  printf "T_STRING: %d\n", $counts_05
+  printf "T_REGEXP: %d\n", $counts_06
+  printf "T_ARRAY: %d\n", $counts_07
+  printf "T_HASH: %d\n", $counts_08
+  printf "T_STRUCT: %d\n", $counts_09
+  printf "T_BIGNUM: %d\n", $counts_0a
+  printf "T_FILE: %d\n", $counts_0b
+  printf "T_DATA: %d\n", $counts_0c
+  printf "T_MATCH: %d\n", $counts_0d
+  printf "T_COMPLEX: %d\n", $counts_0e
+  printf "T_RATIONAL: %d\n", $counts_0f
+  #printf "UNKNOWN_10: %d\n", $counts_10
+  printf "T_NIL: %d\n", $counts_11
+  printf "T_TRUE: %d\n", $counts_12
+  printf "T_FALSE: %d\n", $counts_13
+  printf "T_SYMBOL: %d\n", $counts_14
+  printf "T_FIXNUM: %d\n", $counts_15
+  printf "T_UNDEF: %d\n", $counts_16
+  #printf "UNKNOWN_17: %d\n", $counts_17
+  #printf "UNKNOWN_18: %d\n", $counts_18
+  #printf "UNKNOWN_19: %d\n", $counts_19
+  printf "T_IMEMO: %d\n", $counts_1a
+  printf "T_NODE: %d\n", $counts_1b
+  printf "T_ICLASS: %d\n", $counts_1c
+  printf "T_ZOMBIE: %d\n", $counts_1d
+  #printf "UNKNOWN_1E: %d\n", $counts_1e
+  printf "T_MASK: %d\n", $counts_1f
+end
+document rb_count_objects
+  Counts all objects grouped by type.
+end
+
+# Details: https://bugs.ruby-lang.org/projects/ruby-master/wiki/MachineInstructionsTraceWithGDB
 define trace_machine_instructions
   set logging on
   set height 0
@@ -821,3 +1295,56 @@ define SDR
   call rb_vmdebug_stack_dump_raw_current()
 end
 
+define rbi
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_LABEL
+    p *(LABEL*)$arg0
+  else
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_INSN
+    p *(INSN*)$arg0
+  else
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_ADJUST
+    p *(ADJUST*)$arg0
+  else
+    print *$arg0
+  end
+  end
+  end
+end
+
+define dump_node
+  set $str = rb_parser_dump_tree($arg0, 0)
+  set $flags = ((struct RBasic*)($str))->flags
+  printf "%s", (char *)(($flags & RUBY_FL_USER1) ? \
+                        ((struct RString*)$str)->as.heap.ptr : \
+                        ((struct RString*)$str)->as.ary)
+end
+
+define print_flags
+  printf "RUBY_FL_WB_PROTECTED: %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_WB_PROTECTED ? "1" : "0"
+  printf "RUBY_FL_PROMOTED0   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_PROMOTED0 ? "1" : "0"
+  printf "RUBY_FL_PROMOTED1   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_PROMOTED1 ? "1" : "0"
+  printf "RUBY_FL_FINALIZE    : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_FINALIZE ? "1" : "0"
+  printf "RUBY_FL_SHAREABLE   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_SHAREABLE ? "1" : "0"
+  printf "RUBY_FL_EXIVAR      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_EXIVAR ? "1" : "0"
+  printf "RUBY_FL_FREEZE      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_FREEZE ? "1" : "0"
+
+  printf "RUBY_FL_USER0       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER0 ? "1" : "0"
+  printf "RUBY_FL_USER1       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER1 ? "1" : "0"
+  printf "RUBY_FL_USER2       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER2 ? "1" : "0"
+  printf "RUBY_FL_USER3       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER3 ? "1" : "0"
+  printf "RUBY_FL_USER4       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER4 ? "1" : "0"
+  printf "RUBY_FL_USER5       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER5 ? "1" : "0"
+  printf "RUBY_FL_USER6       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER6 ? "1" : "0"
+  printf "RUBY_FL_USER7       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER7 ? "1" : "0"
+  printf "RUBY_FL_USER8       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER8 ? "1" : "0"
+  printf "RUBY_FL_USER9       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER9 ? "1" : "0"
+  printf "RUBY_FL_USER10      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER10 ? "1" : "0"
+  printf "RUBY_FL_USER11      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER11 ? "1" : "0"
+  printf "RUBY_FL_USER12      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER12 ? "1" : "0"
+  printf "RUBY_FL_USER13      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER13 ? "1" : "0"
+  printf "RUBY_FL_USER14      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER14 ? "1" : "0"
+  printf "RUBY_FL_USER15      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER15 ? "1" : "0"
+  printf "RUBY_FL_USER16      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER16 ? "1" : "0"
+  printf "RUBY_FL_USER17      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER17 ? "1" : "0"
+  printf "RUBY_FL_USER18      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER18 ? "1" : "0"
+end
diff --git a/.git-blame-ignore-revs b/.git-blame-ignore-revs
new file mode 100644
index 0000000000..6c5eac5a0f
--- /dev/null
+++ b/.git-blame-ignore-revs
@@ -0,0 +1,23 @@
+# This is a file used by GitHub to ignore the following commits on `git blame`.
+#
+# You can also do the same thing in your local repository with:
+# $ git config --local blame.ignoreRevsFile .git-blame-ignore-revs
+
+# Expand tabs
+5b21e94bebed90180d8ff63dad03b8b948361089
+
+# Enable Style/StringLiterals cop for RubyGems/Bundler
+d7ffd3fea402239b16833cc434404a7af82d44f3
+
+# [ruby/digest] Revert tab-expansion in external files
+48b09aae7ec5632209229dcc294dd0d75a93a17f
+8a65cf3b61c60e4cb886f59a73ff6db44364bfa9
+39dc9f9093901d40d2998653948d5da38b18ee2c
+
+# [ruby/io-nonblock] Revert tab expansion
+f28287d34c03f472ffe90ea262bdde9affd4b965
+0d842fecb4f75ab3b1d4097ebdb8e88f51558041
+4ba2c66761d6a293abdfba409241d31063cefd62
+
+# Make benchmark indentation consistent
+fc4acf8cae82e5196186d3278d831f2438479d91
diff --git a/.gitattributes b/.gitattributes
new file mode 100644
index 0000000000..d0c2d266b4
--- /dev/null
+++ b/.gitattributes
@@ -0,0 +1,8 @@
+*.gemspec diff=ruby
+*.rb diff=ruby
+bin svn-properties=svn:ignore=ruby
+bin/* diff=ruby
+tool/update-deps diff=ruby
+tool/make-snapshot diff=ruby
+tool/format-release diff=ruby
+tool/leaked-globals diff=ruby
diff --git a/.github/SECURITY.md b/.github/SECURITY.md
new file mode 100644
index 0000000000..56baa29942
--- /dev/null
+++ b/.github/SECURITY.md
@@ -0,0 +1,9 @@
+# Security Policy
+
+## Supported Versions
+
+See <https://www.ruby-lang.org/en/downloads/branches/>.
+
+## Reporting a Vulnerability
+
+See <https://www.ruby-lang.org/en/security/>.
diff --git a/.github/codeql/codeql-config.yml b/.github/codeql/codeql-config.yml
new file mode 100644
index 0000000000..91f82b842b
--- /dev/null
+++ b/.github/codeql/codeql-config.yml
@@ -0,0 +1,3 @@
+name: "CodeQL config for the Ruby language"
+
+languages: cpp
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000..bc63aca35b
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,6 @@
+version: 2
+updates:
+  - package-ecosystem: 'github-actions'
+    directory: '/'
+    schedule:
+      interval: 'monthly'
diff --git a/.github/workflows/baseruby.yml b/.github/workflows/baseruby.yml
new file mode 100644
index 0000000000..ebaafe3bf0
--- /dev/null
+++ b/.github/workflows/baseruby.yml
@@ -0,0 +1,80 @@
+name: BASERUBY Check
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  baseruby:
+    name: BASERUBY
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    strategy:
+      matrix:
+        ruby:
+          - ruby-2.2
+#         - ruby-2.3
+#         - ruby-2.4
+#         - ruby-2.5
+#         - ruby-2.6
+#         - ruby-2.7
+          - ruby-3.0
+          - ruby-3.1
+
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler: none
+      - run: echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: sudo apt-get install build-essential autoconf bison libyaml-dev
+      - run: ./autogen.sh
+      - run: ./configure --disable-install-doc
+      - run: make common-srcs
+      - run: make incs
+      - run: make all
+      - run: make test
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / BASERUBY @ ${{ matrix.ruby }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/bundled_gems.yml b/.github/workflows/bundled_gems.yml
new file mode 100644
index 0000000000..070c0fa1dd
--- /dev/null
+++ b/.github/workflows/bundled_gems.yml
@@ -0,0 +1,166 @@
+name: bundled_gems
+
+on:
+  push:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  pull_request:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  merge_group:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  schedule:
+    - cron: '45 6 * * *'
+  workflow_dispatch:
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  update:
+    permissions:
+      contents: write  # for Git to git push
+    if: ${{ github.event_name != 'schedule' || github.repository == 'ruby/ruby' }}
+    name: update ${{ github.workflow }}
+    runs-on: ubuntu-latest
+    steps:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+          echo "TODAY=$(date +%F)" >> $GITHUB_ENV
+
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache-${{ github.sha }}
+          restore-keys: |
+            downloaded-cache
+
+      - name: Download previous gems list
+        run: |
+          data=bundled_gems.json
+          mkdir -p .downloaded-cache
+          ln -s .downloaded-cache/$data .
+          curl -O -R -z ./$data https://stdgems.org/$data
+
+      - name: Update bundled gems list
+        run: |
+          ruby -i~ tool/update-bundled_gems.rb gems/bundled_gems
+
+      - name: Maintain updated gems list in NEWS
+        run: |
+          #!ruby
+          require 'json'
+          news = File.read("NEWS.md")
+          prev = news[/since the \*+(\d+\.\d+\.\d+)\*+/, 1]
+          prevs = [prev, prev.sub(/\.\d+\z/, '')]
+          %W[bundled].each do |type|
+            last = JSON.parse(File.read("#{type}_gems.json"))['gems'].filter_map do |g|
+              v = g['versions'].values_at(*prevs).compact.first
+              g = g['gem']
+              g = 'RubyGems' if g == 'rubygems'
+              [g, v] if v
+            end.to_h
+            changed = File.foreach("gems/#{type}_gems").filter_map do |l|
+              next if l.start_with?("#")
+              g, v = l.split(" ", 3)
+              [g, v] unless last[g] == v
+            end
+            changed, added = changed.partition {|g, _| last[g]}
+            news.sub!(/^\*( +)The following #{type} gems? are updated\.\n+\K(?: \1\*( +).*\n)*/) do
+              mark = "#{$1} *#{$2}"
+              changed.map {|g, v|"#{mark}#{g} #{v}\n"}.join("")
+            end or next
+            news.sub!(/^\*( +)The following default gems are now bundled gems\.\n+\K(?: \1\*( +).*\n)*/) do
+              mark = "#{$1} *#{$2}"
+              added.map {|g, v|"#{mark}#{g} #{v}\n"}.join("")
+            end or next unless added.empty?
+            File.write("NEWS.md", news)
+          end
+        shell: ruby {0}
+
+      - name: Check diffs
+        id: diff
+        run: |
+          git add -- NEWS.md
+          git diff --no-ext-diff --ignore-submodules --quiet -- gems/bundled_gems
+        continue-on-error: true
+
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Build
+        run: |
+          ./autogen.sh
+          ./configure -C --disable-install-doc
+          make
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Prepare bundled gems
+        run: |
+          make -s prepare-gems
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Test bundled gems
+        run: |
+          make -s test-bundled-gems
+          git add -- gems/bundled_gems
+        timeout-minutes: 30
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Show diffs
+        id: show
+        run: |
+          git diff --cached --color --no-ext-diff --ignore-submodules --exit-code --
+        continue-on-error: true
+
+      - name: Commit
+        run: |
+          git pull --ff-only origin ${GITHUB_REF#refs/heads/}
+          message="Update bundled gems list at "
+          if [ ${{ steps.diff.outcome }} = success ]; then
+            git commit --message="${message}${GITHUB_SHA:0:30} [ci skip]"
+          else
+            git commit --message="${message}${TODAY}"
+          fi
+          git push origin ${GITHUB_REF#refs/heads/}
+        env:
+          EMAIL: svn-admin@ruby-lang.org
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+        if: ${{ github.repository == 'ruby/ruby' && !startsWith(github.event_name, 'pull') && steps.show.outcome == 'failure' }}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / update",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/check_dependencies.yml b/.github/workflows/check_dependencies.yml
new file mode 100644
index 0000000000..79b2916feb
--- /dev/null
+++ b/.github/workflows/check_dependencies.yml
@@ -0,0 +1,78 @@
+name: Check Dependencies
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  update-deps:
+    strategy:
+      matrix:
+        os: [ubuntu-22.04]
+      fail-fast: true
+    runs-on: ${{ matrix.os }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+        if: ${{ contains(matrix.os, 'ubuntu') }}
+      - name: Install libraries
+        run: |
+          brew install gmp libffi openssl@1.1 zlib autoconf automake libtool readline
+        if: ${{ contains(matrix.os, 'macos') }}
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache
+      - run: ./autogen.sh
+      - name: Run configure
+        run: ./configure -C --disable-install-doc --disable-rubygems --with-gcc 'optflags=-O0' 'debugflags=-save-temps=obj -g'
+      - run: make all golf
+      - run: ruby tool/update-deps --fix
+      - run: git diff --no-ext-diff --ignore-submodules --exit-code
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / Dependencies need to update",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/codeql-analysis.yml b/.github/workflows/codeql-analysis.yml
new file mode 100644
index 0000000000..8dba76fbe2
--- /dev/null
+++ b/.github/workflows/codeql-analysis.yml
@@ -0,0 +1,75 @@
+name: "Code scanning - action"
+
+on:
+  # push:
+  #   paths-ignore:
+  #     - 'doc/**'
+  #     - '**/man'
+  #     - '**.md'
+  #     - '**.rdoc'
+  #     - '**/.document'
+  # pull_request:
+  #   paths-ignore:
+  #     - 'doc/**'
+  #     - '**/man'
+  #     - '**.md'
+  #     - '**.rdoc'
+  #     - '**/.document'
+  schedule:
+    - cron: '0 12 * * *'
+  workflow_dispatch:
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  CodeQL-Build:
+
+    # CodeQL runs on ubuntu-latest and windows-latest
+    permissions:
+      actions: read  # for github/codeql-action/init to get workflow details
+      contents: read  # for actions/checkout to fetch code
+      security-events: write  # for github/codeql-action/autobuild to send a status report
+    runs-on: ubuntu-latest
+    # CodeQL fails to run pull requests from dependabot due to missing write access to upload results.
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') && github.event.head_commit.pusher.name != 'dependabot[bot]' }}
+
+    env:
+      enable_install_doc: no
+
+    steps:
+    - name: Install libraries
+      run: |
+        set -x
+        sudo apt-get update -q || :
+        sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+
+    - name: Checkout repository
+      uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+    - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+      with:
+        path: .downloaded-cache
+        key: downloaded-cache
+
+    - name: Remove an obsolete rubygems vendored file
+      run: sudo rm /usr/lib/ruby/vendor_ruby/rubygems/defaults/operating_system.rb
+
+    - name: Initialize CodeQL
+      uses: github/codeql-action/init@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
+      with:
+        config-file: ./.github/codeql/codeql-config.yml
+        trap-caching: false
+
+    - name: Set ENV
+      run: echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+
+    - name: Autobuild
+      uses: github/codeql-action/autobuild@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
+
+    - name: Perform CodeQL Analysis
+      uses: github/codeql-action/analyze@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
diff --git a/.github/workflows/compilers.yml b/.github/workflows/compilers.yml
new file mode 100644
index 0000000000..caf12cc0f4
--- /dev/null
+++ b/.github/workflows/compilers.yml
@@ -0,0 +1,281 @@
+name: Compilations
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+# GitHub actions does not support YAML anchors.  This creative use of
+# environment variables (plus the "echo $GITHUB_ENV" hack) is to reroute that
+# restriction.
+env:
+  default_cc: clang-15
+  append_cc: ''
+
+  # -O1 is faster than -O3 in our tests... Majority of time are consumed trying
+  # to optimize binaries.  Also GitHub Actions run on relatively modern CPUs
+  # compared to, say, GCC 4 or Clang 3.  We don't specify `-march=native`
+  # because compilers tend not understand what the CPU is.
+  optflags: '-O1'
+
+  # -g0 disables backtraces when SEGV.  Do not set that.
+  debugflags: '-ggdb3'
+
+  default_configure: >-
+    --enable-debug-env
+    --disable-install-doc
+    --with-ext=-test-/cxxanyargs,+
+  append_configure: >-
+    --without-valgrind
+    --without-jemalloc
+    --without-gmp
+
+  UPDATE_UNICODE: >-
+    UNICODE_FILES=.
+    UNICODE_PROPERTY_FILES=.
+    UNICODE_AUXILIARY_FILES=.
+    UNICODE_EMOJI_FILES=.
+  CONFIGURE_TTY: never
+  GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+  RUBY_DEBUG: ci rgengc
+  RUBY_TESTOPTS: >-
+    -q
+    --color=always
+    --tty=no
+
+permissions:
+  contents: read
+
+jobs:
+  compile:
+    strategy:
+      fail-fast: false
+      matrix:
+        env:
+          - {}
+        entry:
+          - { name: gcc-12,    env: { default_cc: gcc-12 } }
+          - { name: gcc-11,    env: { default_cc: gcc-11 } }
+          - { name: gcc-10,    env: { default_cc: gcc-10 } }
+          - { name: gcc-9,     env: { default_cc: gcc-9 } }
+          - { name: gcc-8,     env: { default_cc: gcc-8 } }
+          - { name: gcc-7,     env: { default_cc: gcc-7 } }
+          - name: 'gcc-13 LTO'
+            container: gcc-13
+            env:
+              default_cc: 'gcc-13 -flto=auto -ffat-lto-objects -Werror=lto-type-mismatch'
+              optflags: '-O2'
+            shared: disable
+            # check: true
+          - { name: clang-16,  env: { default_cc: clang-16 } }
+          - { name: clang-15,  env: { default_cc: clang-15 } }
+          - { name: clang-14,  env: { default_cc: clang-14 } }
+          - { name: clang-13,  env: { default_cc: clang-13 } }
+          - { name: clang-12,  env: { default_cc: clang-12 } }
+          - { name: clang-11,  env: { default_cc: clang-11 } }
+          - { name: clang-10,  env: { default_cc: clang-10 } }
+          # llvm-objcopy<=9 doesn't have --wildcard. It compiles, but leaves Rust symbols in libyjit.o.
+          - { name: clang-9,   env: { default_cc: clang-9,   append_configure: '--disable-yjit' } }
+          - { name: clang-8,   env: { default_cc: clang-8,   append_configure: '--disable-yjit' } }
+          - { name: clang-7,   env: { default_cc: clang-7,   append_configure: '--disable-yjit' } }
+          - { name: clang-6.0, env: { default_cc: clang-6.0, append_configure: '--disable-yjit' } }
+          - name: 'clang-16 LTO'
+            container: clang-16
+            env:
+              default_cc: 'clang-16 -flto=auto'
+              optflags: '-O2'
+            shared: disable
+            # check: true
+
+#         - { name: aarch64-linux-gnu,     crosshost: aarch64-linux-gnu, container: crossbuild-essential-arm64 }
+#         - { name: arm-linux-gnueabi,     crosshost: arm-linux-gnueabi }
+#         - { name: arm-linux-gnueabihf,   crosshost: arm-linux-gnueabihf }
+#         - { name: i686-w64-mingw32,      crosshost: i686-w64-mingw32 }
+#         - { name: powerpc-linux-gnu,     crosshost: powerpc-linux-gnu }
+#         - { name: powerpc64le-linux-gnu, crosshost: powerpc64le-linux-gnu, container: crossbuild-essential-ppc64el }
+#         - { name: s390x-linux-gnu,       crosshost: s390x-linux-gnu, container: crossbuild-essential-s390x }
+#         - { name: x86_64-w64-mingw32,    crosshost: x86_64-w64-mingw32, container: mingw-w64 }
+
+          # -Wno-strict-prototypes is necessary with current clang-15 since
+          # older autoconf generate functions without prototype and -pedantic
+          # now implies strict-prototypes. Disabling the error but leaving the
+          # warning generates a lot of noise from use of ANYARGS in
+          # rb_define_method() and friends.
+          # See: https://github.com/llvm/llvm-project/commit/11da1b53d8cd3507959022cd790d5a7ad4573d94
+          - { name: c99,   env: { append_cc: '-std=c99   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+#         - { name: c11,   env: { append_cc: '-std=c11   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+#         - { name: c17,   env: { append_cc: '-std=c17   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+          - { name: c2x,   env: { append_cc: '-std=c2x   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+          - { name: c++98, env: { CXXFLAGS: '-std=c++98 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++11, env: { CXXFLAGS: '-std=c++11 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++14, env: { CXXFLAGS: '-std=c++14 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++17, env: { CXXFLAGS: '-std=c++17 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+          - { name: c++2a, env: { CXXFLAGS: '-std=c++2a -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+
+          - { name: '-O0', env: { optflags: '-O0 -march=x86-64 -mtune=generic' } }
+#         - { name: '-O3', env: { optflags: '-O3 -march=x86-64 -mtune=generic' }, check: true }
+
+          - { name: gmp,                  env: { append_configure: '--with-gmp' } }
+          - { name: jemalloc,             env: { append_configure: '--with-jemalloc' } }
+          - { name: valgrind,             env: { append_configure: '--with-valgrind' } }
+          - { name: 'coroutine=ucontext', env: { append_configure: '--with-coroutine=ucontext' } }
+          - { name: 'coroutine=pthread',  env: { append_configure: '--with-coroutine=pthread' } }
+          - { name: disable-jit-support,  env: { append_configure: '--disable-jit-support' } }
+          - { name: disable-dln,          env: { append_configure: '--disable-dln' } }
+          - { name: enable-mkmf-verbose,  env: { append_configure: '--enable-mkmf-verbose' } }
+          - { name: disable-rubygems,     env: { append_configure: '--disable-rubygems' } }
+          - { name: RUBY_DEVEL,           env: { append_configure: '--enable-devel' } }
+
+          - { name: OPT_THREADED_CODE=1,            env: { cppflags: '-DOPT_THREADED_CODE=1' } }
+          - { name: OPT_THREADED_CODE=2,            env: { cppflags: '-DOPT_THREADED_CODE=2' } }
+          - { name: OPT_THREADED_CODE=3,            env: { cppflags: '-DOPT_THREADED_CODE=3' } }
+
+          - { name: NDEBUG,                         env: { cppflags: '-DNDEBUG' } }
+          - { name: RUBY_DEBUG,                     env: { cppflags: '-DRUBY_DEBUG' } }
+#         - { name: ARRAY_DEBUG,                    env: { cppflags: '-DARRAY_DEBUG' } }
+#         - { name: BIGNUM_DEBUG,                   env: { cppflags: '-DBIGNUM_DEBUG' } }
+#         - { name: CCAN_LIST_DEBUG,                env: { cppflags: '-DCCAN_LIST_DEBUG' } }
+#         - { name: CPDEBUG=-1,                     env: { cppflags: '-DCPDEBUG=-1' } }
+#         - { name: ENC_DEBUG,                      env: { cppflags: '-DENC_DEBUG' } }
+#         - { name: GC_DEBUG,                       env: { cppflags: '-DGC_DEBUG' } }
+#         - { name: HASH_DEBUG,                     env: { cppflags: '-DHASH_DEBUG' } }
+#         - { name: ID_TABLE_DEBUG,                 env: { cppflags: '-DID_TABLE_DEBUG' } }
+#         - { name: RGENGC_DEBUG=-1,                env: { cppflags: '-DRGENGC_DEBUG=-1' } }
+#         - { name: SYMBOL_DEBUG,                   env: { cppflags: '-DSYMBOL_DEBUG' } }
+
+#         - { name: RGENGC_CHECK_MODE,              env: { cppflags: '-DRGENGC_CHECK_MODE' } }
+#         - { name: TRANSIENT_HEAP_CHECK_MODE,      env: { cppflags: '-DTRANSIENT_HEAP_CHECK_MODE' } }
+#         - { name: VM_CHECK_MODE,                  env: { cppflags: '-DVM_CHECK_MODE' } }
+
+          - { name: USE_EMBED_CI=0,                 env: { cppflags: '-DUSE_EMBED_CI=0' } }
+          - name: USE_FLONUM=0,
+            env:
+              cppflags: '-DUSE_FLONUM=0'
+              # yjit requires FLONUM for the pointer tagging scheme
+              append_configure: '--disable-yjit'
+#         - { name: USE_GC_MALLOC_OBJ_INFO_DETAILS, env: { cppflags: '-DUSE_GC_MALLOC_OBJ_INFO_DETAILS' } }
+          - { name: USE_LAZY_LOAD,                  env: { cppflags: '-DUSE_LAZY_LOAD' } }
+#         - { name: USE_RINCGC=0,                   env: { cppflags: '-DUSE_RINCGC=0' } }
+#         - { name: USE_SYMBOL_GC=0,                env: { cppflags: '-DUSE_SYMBOL_GC=0' } }
+#         - { name: USE_THREAD_CACHE=0,             env: { cppflags: '-DUSE_THREAD_CACHE=0' } }
+#         - { name: USE_TRANSIENT_HEAP=0,           env: { cppflags: '-DUSE_TRANSIENT_HEAP=0' } }
+#         - { name: USE_RUBY_DEBUG_LOG=1,           env: { cppflags: '-DUSE_RUBY_DEBUG_LOG=1' } }
+          - { name: USE_RVARGC=0,                   env: { cppflags: '-DUSE_RVARGC=0' } }
+#         - { name: USE_RVARGC=1,                   env: { cppflags: '-DUSE_RVARGC=1' } }
+#         - { name: USE_DEBUG_COUNTER,              env: { cppflags: '-DUSE_DEBUG_COUNTER=1', RUBY_DEBUG_COUNTER_DISABLE: '1' } }
+
+          - { name: DEBUG_FIND_TIME_NUMGUESS,       env: { cppflags: '-DDEBUG_FIND_TIME_NUMGUESS' } }
+          - { name: DEBUG_INTEGER_PACK,             env: { cppflags: '-DDEBUG_INTEGER_PACK' } }
+#         - { name: ENABLE_PATH_CHECK,              env: { cppflags: '-DENABLE_PATH_CHECK' } }
+
+          - { name: GC_DEBUG_STRESS_TO_CLASS,       env: { cppflags: '-DGC_DEBUG_STRESS_TO_CLASS' } }
+#         - { name: GC_ENABLE_LAZY_SWEEP=0,         env: { cppflags: '-DGC_ENABLE_LAZY_SWEEP=0' } }
+#         - { name: GC_PROFILE_DETAIL_MEMOTY,       env: { cppflags: '-DGC_PROFILE_DETAIL_MEMOTY' } }
+#         - { name: GC_PROFILE_MORE_DETAIL,         env: { cppflags: '-DGC_PROFILE_MORE_DETAIL' } }
+
+#         - { name: CALC_EXACT_MALLOC_SIZE,         env: { cppflags: '-DCALC_EXACT_MALLOC_SIZE' } }
+#         - { name: MALLOC_ALLOCATED_SIZE_CHECK,    env: { cppflags: '-DMALLOC_ALLOCATED_SIZE_CHECK' } }
+
+#         - { name: IBF_ISEQ_ENABLE_LOCAL_BUFFER,   env: { cppflags: '-DIBF_ISEQ_ENABLE_LOCAL_BUFFER' } }
+
+#         - { name: RGENGC_ESTIMATE_OLDMALLOC,      env: { cppflags: '-DRGENGC_ESTIMATE_OLDMALLOC' } }
+#         - { name: RGENGC_FORCE_MAJOR_GC,          env: { cppflags: '-DRGENGC_FORCE_MAJOR_GC' } }
+#         - { name: RGENGC_OBJ_INFO,                env: { cppflags: '-DRGENGC_OBJ_INFO' } }
+#         - { name: RGENGC_OLD_NEWOBJ_CHECK,        env: { cppflags: '-DRGENGC_OLD_NEWOBJ_CHECK' } }
+#         - { name: RGENGC_PROFILE,                 env: { cppflags: '-DRGENGC_PROFILE' } }
+
+#         - { name: VM_DEBUG_BP_CHECK,              env: { cppflags: '-DVM_DEBUG_BP_CHECK' } }
+#         - { name: VM_DEBUG_VERIFY_METHOD_CACHE,   env: { cppflags: '-DVM_DEBUG_VERIFY_METHOD_CACHE' } }
+
+          - { name: MJIT_FORCE_ENABLE,              env: { cppflags: '-DMJIT_FORCE_ENABLE' } }
+          - { name: YJIT_FORCE_ENABLE,              env: { cppflags: '-DYJIT_FORCE_ENABLE' } }
+
+    name: ${{ matrix.entry.name }}
+    runs-on: ubuntu-latest
+    container:
+      image: ghcr.io/ruby/ruby-ci-image:${{ matrix.entry.container || matrix.entry.env.default_cc || 'clang-15' }}
+      options: --user root
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    env: ${{ matrix.entry.env || matrix.env }}
+    steps:
+      - run: id
+        working-directory:
+      - run: mkdir build
+        working-directory:
+      - name: setenv
+        run: |
+          echo "GNUMAKEFLAGS=-sj$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: >
+          ../src/configure -C ${default_configure} ${append_configure}
+          --${{
+            matrix.entry.crosshost && 'host' || 'with-gcc'
+          }}=${{
+            matrix.entry.crosshost || '"${default_cc}${append_cc:+ $append_cc}"'
+          }}
+          --${{ matrix.entry.shared || 'enable' }}-shared
+      - run: make extract-extlibs
+      - run: make incs
+      - run: make showflags
+      - run: make
+      - run: make leaked-globals
+      - run: make test
+      - run: make install
+        if: ${{ matrix.entry.check }}
+      - run: make test-tool
+        if: ${{ matrix.entry.check }}
+      - run: make test-all TESTS='-- ruby -ext-'
+        if: ${{ matrix.entry.check }}
+      - run: make test-spec
+        env:
+          CHECK_LEAKS: true
+        if: ${{ matrix.entry.check }}
+      - run: make test-annocheck
+        if: ${{ matrix.entry.check && endsWith(matrix.entry.name, 'annocheck') }}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.entry.name }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/macos.yml b/.github/workflows/macos.yml
new file mode 100644
index 0000000000..d8dc58b119
--- /dev/null
+++ b/.github/workflows/macos.yml
@@ -0,0 +1,113 @@
+name: macOS
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        test_task: ["check"] # "test-bundler-parallel", "test-bundled-gems"
+        os:
+          - macos-13
+          - macos-14
+          - macos-15
+      fail-fast: false
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    runs-on: ${{ matrix.os }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Install libraries
+        run: |
+          brew install gmp libffi openssl@1.1 zlib autoconf automake libtool readline bison
+        working-directory: src
+      - name: Set ENV
+        run: |
+          echo "MAKEFLAGS=-j$((1 + $(sysctl -n hw.activecpu)))" >> $GITHUB_ENV
+          echo "PATH="/usr/local/opt/bison/bin:/opt/homebrew/opt/bison/bin:$PATH"" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --with-openssl-dir=$(brew --prefix openssl@1.1) --with-readline-dir=$(brew --prefix readline)
+      - run: make incs
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: make
+      - run: make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: make ${{ matrix.test_task }}
+        run: |
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS=`echo "$TESTS" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|'`}
+        timeout-minutes: 40
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TESTS: ${{ matrix.test_task == 'check' && matrix.skipped_tests || '' }}
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+      - name: make skipped tests
+        run: |
+          make -s test-all TESTS=`echo "$TESTS" | sed 's| |$$/ -n/|g;s|^|-n/|;s|$|$$/|'`
+        env:
+          GNUMAKEFLAGS: ""
+          RUBY_TESTOPTS: "-v --tty=no"
+          TESTS: ${{ matrix.skipped_tests }}
+          PRECHECK_BUNDLED_GEMS: "no"
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests != '' }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / ${{ matrix.test_task }}${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/mingw.yml b/.github/workflows/mingw.yml
new file mode 100644
index 0000000000..0df917d3d8
--- /dev/null
+++ b/.github/workflows/mingw.yml
@@ -0,0 +1,179 @@
+name: MinGW
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+# Notes:
+# Actions console encoding causes issues, see test-all & test-spec steps
+#
+jobs:
+  make:
+    runs-on: windows-2022
+    name: ${{ github.workflow }} (${{ matrix.msystem }})
+    env:
+      MSYSTEM: ${{ matrix.msystem }}
+      MSYS2_ARCH: x86_64
+      CHOST: "x86_64-w64-mingw32"
+      CFLAGS:   "-march=x86-64 -mtune=generic -O3 -pipe"
+      CXXFLAGS: "-march=x86-64 -mtune=generic -O3 -pipe"
+      CPPFLAGS: "-D_FORTIFY_SOURCE=2 -D__USE_MINGW_ANSI_STDIO=1 -DFD_SETSIZE=2048"
+      LDFLAGS:  "-pipe"
+      UPDATE_UNICODE: "UNICODE_FILES=. UNICODE_PROPERTY_FILES=. UNICODE_AUXILIARY_FILES=. UNICODE_EMOJI_FILES=."
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    strategy:
+      matrix:
+        include:
+          # To mitigate flakiness of MinGW CI, we test only one runtime that newer MSYS2 uses.
+          - msystem: "UCRT64"
+            base_ruby: head
+            test_task: "check"
+            test-all-opts: "--name=!/TestObjSpace#test_reachable_objects_during_iteration/"
+      fail-fast: false
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global core.autocrlf false
+          git config --global core.eol lf
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Set up Ruby & MSYS2
+        uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.base_ruby }}
+      - name: set env
+        run: |
+          echo "GNUMAKEFLAGS=-j$((2 * NUMBER_OF_PROCESSORS))" >> $GITHUB_ENV
+
+      - name: where check
+        run: |
+          # show where
+          mv /c/Windows/System32/libcrypto-1_1-x64.dll /c/Windows/System32/libcrypto-1_1-x64.dll_
+          mv /c/Windows/System32/libssl-1_1-x64.dll    /c/Windows/System32/libssl-1_1-x64.dll_
+          result=true
+          for e in gcc.exe ragel.exe make.exe bison.exe libcrypto-1_1-x64.dll libssl-1_1-x64.dll; do
+            echo '##['group']'$'\033[93m'$e$'\033[m'
+            where $e || result=false
+            echo '##['endgroup']'
+          done
+          $result
+
+      - name: version check
+        run: |
+          # show version
+          result=true
+          for e in gcc ragel make bison "openssl version"; do
+            case "$e" in *" "*) ;; *) e="$e --version";; esac
+            echo '##['group']'$'\033[93m'$e$'\033[m'
+            $e || result=false
+            echo '##['endgroup']'
+          done
+          $result
+
+      - name: autogen
+        run: |
+          ./autogen.sh
+        working-directory: src
+
+      - name: configure
+        run: >
+          ../src/configure --disable-install-doc --prefix=/.
+          --build=$CHOST --host=$CHOST --target=$CHOST
+
+      - name: update
+        run: |
+          make incs
+
+      - name: download gems
+        run: |
+          make update-gems
+
+      - name: make all
+        timeout-minutes: 30
+        run: |
+          make
+
+      - run: make leaked-globals
+
+      - name: make install
+        run: |
+          make DESTDIR=../install install-nodoc
+
+      - name: test
+        timeout-minutes: 5
+        run: |
+          make test
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test'}}
+
+      - name: test-all
+        timeout-minutes: 45
+        run: |
+          # Actions uses UTF8, causes test failures, similar to normal OS setup
+          chcp.com 437
+          make ${{ StartsWith(matrix.test_task, 'test/') && matrix.test_task || 'test-all' }}
+        env:
+          RUBY_TESTOPTS: >-
+            --retry --job-status=normal --show-skip --timeout-scale=1.5
+            ${{ matrix.test-all-opts }}
+          BUNDLER_VERSION:
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test-all' || StartsWith(matrix.test_task, 'test/')}}
+
+      - name: test-spec
+        timeout-minutes: 10
+        run: |
+          make ${{ StartsWith(matrix.test_task, 'spec/') && matrix.test_task || 'test-spec' }}
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test-spec' || StartsWith(matrix.test_task, 'spec/')}}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} ${{ matrix.msystem }} / ${{ matrix.test_task }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: sh
diff --git a/.github/workflows/mjit-bindgen.yml b/.github/workflows/mjit-bindgen.yml
new file mode 100644
index 0000000000..26f8a1b2aa
--- /dev/null
+++ b/.github/workflows/mjit-bindgen.yml
@@ -0,0 +1,104 @@
+name: MJIT bindgen
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        include:
+          - task: mjit-bindgen
+      fail-fast: false
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y \
+          build-essential \
+          libssl-dev libyaml-dev libreadline6-dev \
+          zlib1g-dev libncurses5-dev libffi-dev \
+          libclang1-14 \
+          bison autoconf
+          sudo apt-get install -q -y pkg-config || :
+      - name: Set up Ruby
+        uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: '3.1'
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix=$(pwd)/install --enable-yjit=dev_nodebug
+      - run: make incs
+      - run: make
+      - run: make install
+      - run: make ${{ matrix.task }}
+      - run: git diff --exit-code
+        working-directory: src
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / ${{ matrix.test_task }}${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/mjit.yml b/.github/workflows/mjit.yml
new file mode 100644
index 0000000000..6f7181489a
--- /dev/null
+++ b/.github/workflows/mjit.yml
@@ -0,0 +1,113 @@
+name: MJIT
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '**.[1-8]'
+      - '**.ronn'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '**.[1-8]'
+      - '**.ronn'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        test_task: [check] # to make job names consistent
+        mjit_opts: [--mjit-wait]
+      fail-fast: false
+    runs-on: ubuntu-latest
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    env:
+      TESTOPTS: '-q --tty=no'
+      RUN_OPTS: '--disable-gems ${{ matrix.mjit_opts }} --mjit-debug=-ggdb3'
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc cppflags=-DVM_CHECK_MODE
+      - run: make incs
+      - run: make
+      - run: sudo make -s install
+      - name: Run test
+        run: |
+          unset GNUMAKEFLAGS
+          make -s test RUN_OPTS="$RUN_OPTS"
+        timeout-minutes: 60
+      # - name: Run test-all
+      #   run: |
+      #     ulimit -c unlimited
+      #     make -s test-all RUN_OPTS="$RUN_OPTS"
+      #   timeout-minutes: 60
+      - name: Run test-spec
+        run: |
+          unset GNUMAKEFLAGS
+          make -s test-spec RUN_OPTS="$RUN_OPTS"
+        timeout-minutes: 60
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.mjit_opts }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml
new file mode 100644
index 0000000000..5d4474d978
--- /dev/null
+++ b/.github/workflows/publish.yml
@@ -0,0 +1,18 @@
+name: Start release workflow
+on:
+  push:
+    tags:
+      - '*'
+
+jobs:
+  notify:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Build release package
+        run: |
+          curl -L -X POST \
+            -H "Authorization: Bearer ${{ secrets.MATZBOT_GITHUB_WORKFLOW_TOKEN }}" \
+            -H "Accept: application/vnd.github+json" \
+            -H "X-GitHub-Api-Version: 2022-11-28" \
+            https://api.github.com/repos/ruby/actions/dispatches \
+            -d '{"event_type": "${{ github.ref }}"}'
diff --git a/.github/workflows/scorecards.yml b/.github/workflows/scorecards.yml
new file mode 100644
index 0000000000..c12a95362d
--- /dev/null
+++ b/.github/workflows/scorecards.yml
@@ -0,0 +1,72 @@
+# This workflow uses actions that are not certified by GitHub. They are provided
+# by a third-party and are governed by separate terms of service, privacy
+# policy, and support documentation.
+
+name: Scorecards supply-chain security
+on:
+  # For Branch-Protection check. Only the default branch is supported. See
+  # https://github.com/ossf/scorecard/blob/main/docs/checks.md#branch-protection
+  branch_protection_rule:
+  # To guarantee Maintained check is occasionally updated. See
+  # https://github.com/ossf/scorecard/blob/main/docs/checks.md#maintained
+  schedule:
+    - cron: '22 4 * * 2'
+  push:
+    branches: [ "master" ]
+
+# Declare default permissions as read only.
+permissions: read-all
+
+jobs:
+  analysis:
+    name: Scorecards analysis
+    runs-on: ubuntu-latest
+    permissions:
+      # Needed to upload the results to code-scanning dashboard.
+      security-events: write
+      # Needed to publish results and get a badge (see publish_results below).
+      id-token: write
+      # Uncomment the permissions below if installing in a private repository.
+      # contents: read
+      # actions: read
+
+    steps:
+      - name: "Checkout code"
+        uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          persist-credentials: false
+
+      - name: "Run analysis"
+        uses: ossf/scorecard-action@ea651e62978af7915d09fe2e282747c798bf2dab # v2.4.1
+        with:
+          results_file: results.sarif
+          results_format: sarif
+          # (Optional) Read-only PAT token. Uncomment the `repo_token` line below if:
+          # - you want to enable the Branch-Protection check on a *public* repository, or
+          # - you are installing Scorecards on a *private* repository
+          # To create the PAT, follow the steps in https://github.com/ossf/scorecard-action#authentication-with-pat.
+          repo_token: ${{ secrets.SCORECARD_READ_TOKEN }}
+
+          # Public repositories:
+          #   - Publish results to OpenSSF REST API for easy access by consumers
+          #   - Allows the repository to include the Scorecard badge.
+          #   - See https://github.com/ossf/scorecard-action#publishing-results.
+          # For private repositories:
+          #   - `publish_results` will always be set to `false`, regardless
+          #     of the value entered here.
+          publish_results: true
+
+      # Upload the results as artifacts (optional). Commenting out will disable uploads of run results in SARIF
+      # format to the repository Actions tab.
+      - name: "Upload artifact"
+        uses: actions/upload-artifact@ea165f8d65b6e75b540449e92b4886f43607fa02 # v4.6.2
+        with:
+          name: SARIF file
+          path: results.sarif
+          retention-days: 5
+
+      # Upload the results to GitHub's code scanning dashboard.
+      - name: "Upload to code-scanning"
+        uses: github/codeql-action/upload-sarif@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.27
+        with:
+          sarif_file: results.sarif
diff --git a/.github/workflows/spec_guards.yml b/.github/workflows/spec_guards.yml
new file mode 100644
index 0000000000..4521195a2b
--- /dev/null
+++ b/.github/workflows/spec_guards.yml
@@ -0,0 +1,71 @@
+name: Rubyspec Version Guards Check
+
+on:
+  push:
+    paths:
+      - 'spec/**'
+      - '!spec/*.md'
+  pull_request:
+    paths:
+      - 'spec/**'
+      - '!spec/*.md'
+  merge_group:
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  rubyspec:
+    name: Rubyspec
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.head_commit.message, 'Document')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.title, 'Document')
+      || contains(github.event.pull_request.labels.*.name, 'Document')
+      || (github.event_name == 'push' && github.actor == 'dependabot[bot]')
+      )}}
+
+    strategy:
+      matrix:
+        # Specs from ruby/spec should still run on all supported Ruby versions.
+        # This also ensures the needed ruby_version_is guards are there, see spec/README.md.
+        ruby:
+          - ruby-3.1
+          - ruby-3.2
+
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler: none
+
+      - run: gem install webrick
+
+      - run: ruby ../mspec/bin/mspec
+        working-directory: spec/ruby
+        env:
+          CHECK_LEAKS: true
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / rubyspec @ ${{ matrix.ruby }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/ubuntu.yml b/.github/workflows/ubuntu.yml
new file mode 100644
index 0000000000..4fbca1170e
--- /dev/null
+++ b/.github/workflows/ubuntu.yml
@@ -0,0 +1,146 @@
+name: Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        # main variables included in the job name
+        test_task: [check]
+        configure: [cppflags=-DRUBY_DEBUG] # default to use more assertions
+        arch: ['']
+        # specify all jobs with `include` to avoid testing duplicated things
+        include:
+          - test_task: check
+          - test_task: check
+            arch: i686
+            configure: '' # test without -DRUBY_DEBUG as well
+          - test_task: check
+            configure: "--enable-shared --enable-load-relative"
+          - test_task: test-all TESTS=--repeat-count=2
+          - test_task: test-bundler-parallel
+          - test_task: test-bundled-gems
+      fail-fast: false
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      RUBY_DEBUG: ci
+      SETARCH: ${{ matrix.arch && format('setarch {0}', matrix.arch) }}
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: Install libraries
+        env:
+          arch: ${{matrix.arch}}
+        run: |
+          set -x
+          arch=${arch:+:${arch/i[3-6]86/i386}}
+          ${arch:+sudo dpkg --add-architecture ${arch#:}}
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y \
+          ${arch:+cross}build-essential${arch/:/-} \
+          libssl-dev${arch} libyaml-dev${arch} libreadline6-dev${arch} \
+          zlib1g-dev${arch} libncurses5-dev${arch} libffi-dev${arch} \
+          bison autoconf ruby
+          sudo apt-get install -q -y pkg-config${arch} || :
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        env:
+          arch: ${{matrix.arch}}
+        run: >-
+          $SETARCH ../src/configure -C --disable-install-doc ${{ matrix.configure }}
+          ${arch:+--target=$arch-$OSTYPE --host=$arch-$OSTYPE}
+      - run: $SETARCH make incs
+      - run: $SETARCH make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: $SETARCH make
+      - run: $SETARCH make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Create dummy files in build dir
+        run: |
+          $SETARCH ./miniruby -e '(("a".."z").to_a+("A".."Z").to_a+("0".."9").to_a+%w[foo bar test zzz]).each{|basename|File.write("#{basename}.rb", "raise %(do not load #{basename}.rb)")}'
+        if: ${{ matrix.test_task == 'check' }}
+      - name: make ${{ matrix.test_task }}
+        run: |
+          $SETARCH make -s ${{ matrix.test_task }} ${TESTS:+TESTS=`echo "$TESTS" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|'`}
+        timeout-minutes: 40
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TESTS: ${{ matrix.test_task == 'check' && matrix.skipped_tests || '' }}
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+      - name: make skipped tests
+        run: |
+          $SETARCH make -s test-all TESTS=`echo "$TESTS" | sed 's| |$$/ -n/|g;s|^|-n/|;s|$|$$/|'`
+        env:
+          GNUMAKEFLAGS: ""
+          RUBY_TESTOPTS: "-v --tty=no"
+          TESTS: ${{ matrix.skipped_tests }}
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests != '' }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.configure }}${{ matrix.arch }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/wasm.yml b/.github/workflows/wasm.yml
new file mode 100644
index 0000000000..27920b5821
--- /dev/null
+++ b/.github/workflows/wasm.yml
@@ -0,0 +1,146 @@
+name: WebAssembly
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        entry:
+#         # wasmtime can't compile non-optimized Asyncified binary due to locals explosion
+#         - { name: O0-debuginfo, optflags: "-O0", debugflags: "-g", wasmoptflags: "-O1" }
+#         - { name: O1,           optflags: "-O1", debugflags: ""  , wasmoptflags: "-O1" }
+          - { name: O2,           optflags: "-O2", debugflags: ""  , wasmoptflags: "-O2" }
+#         - { name: O3,           optflags: "-O3", debugflags: ""  , wasmoptflags: "-O3" }
+#         # -O4 is equivalent to -O3 in clang, but it's different in wasm-opt
+#         - { name: O4,           optflags: "-O3", debugflags: ""  , wasmoptflags: "-O4" }
+#         - { name: Oz,           optflags: "-Oz", debugflags: ""  , wasmoptflags: "-Oz" }
+      fail-fast: false
+    env:
+      RUBY_TESTOPTS: '-q --tty=no'
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      WASI_SDK_VERSION_MAJOR: 14
+      WASI_SDK_VERSION_MINOR: 0
+      BINARYEN_VERSION: 109
+      WASMTIME_VERSION: v0.33.0
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - name: Install libraries
+        run: |
+          set -ex
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y ruby bison make autoconf git wget
+
+          wasi_sdk_deb="wasi-sdk_${WASI_SDK_VERSION_MAJOR}.${WASI_SDK_VERSION_MINOR}_amd64.deb"
+          wget "https://github.com/WebAssembly/wasi-sdk/releases/download/wasi-sdk-${WASI_SDK_VERSION_MAJOR}/${wasi_sdk_deb}"
+          sudo dpkg -i "$wasi_sdk_deb"
+          rm -f "$wasi_sdk_deb"
+
+          mkdir build-sdk
+          pushd build-sdk
+
+          wasmtime_url="https://github.com/bytecodealliance/wasmtime/releases/download/${WASMTIME_VERSION}/wasmtime-${WASMTIME_VERSION}-x86_64-linux.tar.xz"
+          wget -O - "$wasmtime_url" | tar xJf -
+          sudo ln -fs "$PWD/wasmtime-${WASMTIME_VERSION}-x86_64-linux/wasmtime" /usr/local/bin/wasmtime
+
+          binaryen_tarball="binaryen-version_${BINARYEN_VERSION}-x86_64-linux.tar.gz"
+          binaryen_url="https://github.com/WebAssembly/binaryen/releases/download/version_${BINARYEN_VERSION}/${binaryen_tarball}"
+          wget -O - "$binaryen_url" | tar xfz -
+          sudo ln -fs "$PWD/binaryen-version_${BINARYEN_VERSION}/bin/wasm-opt" /usr/local/bin/wasm-opt
+        working-directory: src
+      - name: Set ENV
+        run: |
+          echo "MAKEFLAGS=-j$((1 + $(sysctl -n hw.activecpu)))" >> $GITHUB_ENV
+          echo "WASI_SDK_PATH=/opt/wasi-sdk" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: '3.0'
+          bundler: none
+
+      - name: Download config.guess with wasi version
+        run: |
+          rm tool/config.guess tool/config.sub
+          ruby tool/downloader.rb -d tool -e gnu config.guess config.sub
+        working-directory: src
+
+      - name: Run configure
+        run: |
+          ../src/configure \
+            --host wasm32-unknown-wasi \
+            --with-static-linked-ext \
+            LDFLAGS=" \
+              -Xlinker --stack-first \
+              -Xlinker -z -Xlinker stack-size=16777216 \
+            " \
+            optflags="${{ matrix.entry.optflags }}" \
+            debugflags="${{ matrix.entry.debugflags }}" \
+            wasmoptflags="${{ matrix.entry.wasmoptflags }} ${{ matrix.entry.debugflags }}"
+
+      # miniruby may not be built when cross-compling
+      - run: make mini ruby
+      - name: Run basictest
+        run: wasmtime run ./../build/miniruby --mapdir /::./ -- basictest/test.rb
+        working-directory: src
+      - name: Run bootstraptest (no thread)
+        run: |
+          NO_THREAD_TESTS="$(grep -L Thread -R ./bootstraptest | awk -F/ '{ print $NF }' | uniq | sed -n 's/test_\(.*\).rb/\1/p' | paste -s -d, -)"
+          ruby ./bootstraptest/runner.rb --ruby="$(which wasmtime) run $PWD/../build/ruby --mapdir /::./ -- " --verbose "--sets=$NO_THREAD_TESTS"
+        working-directory: src
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.name }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/windows.yml b/.github/workflows/windows.yml
new file mode 100644
index 0000000000..c2bd4881c2
--- /dev/null
+++ b/.github/workflows/windows.yml
@@ -0,0 +1,149 @@
+name: Windows
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        include:
+          - vs: 2022
+            vcvers: -vcvars_ver=14.2
+      fail-fast: false
+    runs-on: windows-${{ matrix.vs }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    name: VisualStudio ${{ matrix.vs }}
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      PATCH: C:\msys64\usr\bin\patch.exe
+      OS_VER: windows-${{ matrix.vs }}
+    steps:
+      - run: md build
+        working-directory:
+      - uses: msys2/setup-msys2@61f9e5e925871ba6c9e3e8da24ede83ea27fa91f # v2.27.0
+        id: setup-msys2
+        with:
+          update: true
+          install: bison patch
+      - name: patch path
+        shell: msys2 {0}
+        run: echo PATCH=$(cygpath -wa $(command -v patch)) >> $GITHUB_ENV
+        if: ${{ steps.setup-msys2.outcome == 'success' }}
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: C:\vcpkg\installed
+          key: ${{ runner.os }}-vcpkg-installed-windows-${{ matrix.vs }}-${{ github.sha }}
+          restore-keys: |
+            ${{ runner.os }}-vcpkg-installed-windows-${{ matrix.vs }}-
+            ${{ runner.os }}-vcpkg-installed-windows-
+      - name: Install libraries with vcpkg
+        run: |
+          iex "& {$(irm get.scoop.sh)} -RunAsAdmin"
+          Join-Path (Resolve-Path ~).Path "scoop\shims" >> $Env:GITHUB_PATH
+          scoop install cmake@3.31.6
+          vcpkg --triplet x64-windows install libffi libyaml openssl readline zlib
+        shell:
+          pwsh
+      - name: git config
+        run: |
+          git config --global core.autocrlf false
+          git config --global core.eol lf
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: setup env
+        # %TEMP% is inconsistent with %TMP% and test-all expects they are consistent.
+        # https://github.com/actions/virtual-environments/issues/712#issuecomment-613004302
+        # msys2/setup-msys2 installs MSYS2 to D:/a/_temp/msys64/usr/bin
+        run: |
+          set Path=D:/a/_temp/msys64/usr/bin;%Path%
+          if not "%VCVARS%" == "" goto :vcset
+            set VCVARS="C:\Program Files (x86)\Microsoft Visual Studio\${{ matrix.vs }}\Enterprise\VC\Auxiliary\Build\vcvars64.bat"
+            if not exist %VCVARS% set VCVARS="C:\Program Files\Microsoft Visual Studio\${{ matrix.vs }}\Enterprise\VC\Auxiliary\Build\vcvars64.bat"
+          :vcset
+          set | C:\msys64\usr\bin\sort > old.env
+          call %VCVARS% ${{ matrix.vcvers || ''}}
+          set TMP=%USERPROFILE%\AppData\Local\Temp
+          set TEMP=%USERPROFILE%\AppData\Local\Temp
+          set /a TEST_JOBS=(15 * %NUMBER_OF_PROCESSORS% / 10) > nul
+          set | C:\msys64\usr\bin\sort > new.env
+          C:\msys64\usr\bin\comm -13 old.env new.env >> %GITHUB_ENV%
+          del *.env
+      - name: compiler version
+        run: cl
+      - name: link libraries
+        run: |
+          for %%I in (C:\vcpkg\installed\x64-windows\bin\*.dll) do (
+            if not %%~nI == readline mklink %%~nxI %%I
+          )
+          for %%I in (libcrypto-1_1-x64 libssl-1_1-x64) do (
+            ren c:\Windows\System32\%%I.dll %%I.dll_
+          )
+      - name: Configure
+        run: >-
+          ../src/win32/configure.bat --disable-install-doc
+          --with-opt-dir=C:/vcpkg/installed/x64-windows
+      - run: nmake incs
+      - run: nmake extract-extlibs
+      - run: nmake
+        env:
+          YACC: bison.exe
+      - run: nmake test
+        timeout-minutes: 5
+      - run: nmake test-spec
+        timeout-minutes: 10
+      - run: nmake test-all
+        env:
+          RUBY_TESTOPTS: -j${{env.TEST_JOBS}} --job-status=normal
+        timeout-minutes: 60
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "VS${{ matrix.vs }} / ${{ matrix.test_task || 'check' }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: cmd
diff --git a/.github/workflows/yjit-ubuntu.yml b/.github/workflows/yjit-ubuntu.yml
new file mode 100644
index 0000000000..0b7b9046e9
--- /dev/null
+++ b/.github/workflows/yjit-ubuntu.yml
@@ -0,0 +1,170 @@
+name: YJIT Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  cargo:
+    name: Rust cargo test
+    # GitHub Action's image seems to already contain a Rust 1.58.0.
+    runs-on: ubuntu-22.04
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      # For now we can't run cargo test --offline because it complains about the
+      # capstone dependency, even though the dependency is optional
+      #- run: cargo test --offline
+      - run: RUST_BACKTRACE=1 cargo test
+        working-directory: yjit
+      # Also compile and test with all features enabled
+      - run: RUST_BACKTRACE=1 cargo test --all-features
+        working-directory: yjit
+      # Check that we can build in release mode too
+      - run: cargo build --release
+        working-directory: yjit
+  make:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - test_task: 'yjit-bindgen'
+            hint: 'To fix: use patch in logs'
+            configure: '--with-gcc=clang-14 --enable-yjit=dev'
+            libclang_path: '/usr/lib/llvm-14/lib/libclang.so.1'
+
+          - test_task: "check"
+            # YJIT should be automatically built in release mode on x86-64 Linux with rustc present
+            #configure: "--enable-yjit RUSTC='rustc +1.58.0'"
+            configure: "RUSTC='rustc +1.58.0'"
+            rust_version: "1.58.0"
+
+          - test_task: "check"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "check"
+            configure: "--enable-yjit=dev"
+            yjit_opts: "--yjit-call-threshold=1 --yjit-verify-ctx"
+
+          - test_task: "test-all TESTS=--repeat-count=2"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "test-bundled-gems"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "yjit-bench"
+            configure: "--enable-yjit=dev"
+            yjit_bench_opts: "--yjit-stats"
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      RUN_OPTS: ${{ matrix.yjit_opts }}
+      YJIT_BENCH_OPTS: ${{ matrix.yjit_bench_opts }}
+      RUBY_DEBUG: ci
+      BUNDLE_JOBS: 8 # for yjit-bench
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+      - name: Install Rust
+        if: ${{ matrix.rust_version }}
+        run: rustup install ${{ matrix.rust_version }} --profile minimal
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix=$(pwd)/install ${{ matrix.configure }}
+      - run: make incs
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: make -j
+      - run: make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Create dummy files in build dir
+        run: |
+          ./miniruby -e '(("a".."z").to_a+("A".."Z").to_a+("0".."9").to_a+%w[foo bar test zzz]).each{|basename|File.write("#{basename}.rb", "raise %(do not load #{basename}.rb)")}'
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Enable YJIT through ENV
+        run: echo "RUBY_YJIT_ENABLE=1" >> $GITHUB_ENV
+      # Check that the binary was built with YJIT
+      - name: Check YJIT enabled
+        run: ./miniruby --yjit -v | grep "+YJIT"
+      - name: make ${{ matrix.test_task }}
+        run: make -s -j ${{ matrix.test_task }} RUN_OPTS="$RUN_OPTS" YJIT_BENCH_OPTS="$YJIT_BENCH_OPTS"
+        timeout-minutes: 60
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+          LIBCLANG_PATH: ${{ matrix.libclang_path }}
+        continue-on-error: ${{ matrix.test_task == 'yjit-bench' }}
+      - name: Show ${{ github.event.pull_request.base.ref }} GitHub URL for yjit-bench comparison
+        run: echo "https://github.com/${BASE_REPO}/commit/${BASE_SHA}"
+        env:
+          BASE_REPO: ${{ github.event.pull_request.base.repo.full_name }}
+          BASE_SHA: ${{ github.event.pull_request.base.sha }}
+        if: ${{ matrix.test_task == 'yjit-bench' && startsWith(github.event_name, 'pull') }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.gitignore b/.gitignore
index 4a4465094f..99d32a1825 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,39 +1,70 @@
 *-*-*.def
+*-*-*.exp
+*-*-*.lib
 *.a
 *.bak
+*.bc
+*.bundle
 *.dSYM
 *.dmyh
 *.dylib
 *.elc
+*.i
+*.ii
 *.inc
 *.log
 *.o
+*.o.tmp
+*.obj
+*.old
 *.orig
+*.pch
+*.pdb
+*.rbinc
 *.rej
+*.s
 *.sav
+*.sl
+*.so
+*.so.*
 *.swp
+*.yarb
 *~
-.*-*
 .*.list
 .*.time
 .DS_Store
+.bundle
 .ccmalloc
 .ext
 .pc
 .ppack
 .svn
+.time
+.ruby-version
 Makefile
+cygruby*.def
 extconf.h
 y.output
 y.tab.c
+*.gcda
+*.gcno
+*.gcov
+*.vscode
+lcov*.info
 
 # /
+/*-fake.rb
+/*.dll
+/*.exe
+/*.res
 /*.pc
+/*.rc
 /*_prelude.c
+/.downloaded-cache
+/.top-enc.mk
+/build*/
 /COPYING.LIB
-/ChangeLog-1.8.0
-/ChangeLog.pre-alpha
-/ChangeLog.pre1_1
+/ChangeLog
 /Doxyfile
 /GNUmakefile
 /README.atheos
@@ -43,7 +74,9 @@ y.tab.c
 /archive
 /autom4te*.cache
 /automake
+/benchmark/benchmark-driver
 /beos
+/bmlog-*
 /breakpoints.gdb
 /config.cache
 /config.h
@@ -51,6 +84,13 @@ y.tab.c
 /config.status
 /config.status.lineno
 /configure
+/coverage/simplecov
+/coverage/simplecov-html
+/coverage/doclie
+/coverage/.last_run.json
+/coverage/.resultset.json*
+/coverage/assets
+/coverage/index.html
 /doc/capi
 /enc.mk
 /encdb.h
@@ -58,6 +98,9 @@ y.tab.c
 /goruby
 /id.[ch]
 /largefile.h
+/lcov-c-out
+/lcov-rb-out
+/lcov-out
 /lex.c
 /libruby*.*
 /miniprelude.c
@@ -73,38 +116,94 @@ y.tab.c
 /ppack
 /prelude.c
 /preview
+/probes.dmyh
 /probes.h
 /rbconfig.rb
 /rename2.h
 /repack
 /revision.h
+/revision.tmp
 /riscos
 /rubicon
 /ruby
+/ruby-runner
+/ruby-runner.h
 /ruby-man.rd.gz
+/rubyspec_temp
+/run.gdb
+/sizes.c
+/static-ruby
 /test.rb
+/test-coverage.dat
 /tmp
 /transdb.h
 /uncommon.mk
 /verconf.h
+/verconf.mk
 /web
 /yasmdata.rb
 
+# /bin/
+
+/bin/*.exe
+/bin/*.dll
+/bin/goruby
+/bin/ruby
+
 # /benchmark/
+/benchmark/bm_require.data
 /benchmark/bmx_*.rb
+/benchmark/fasta.output.*
+/benchmark/wc.input
+
+/enc/*.def
+/enc/*.exp
+/enc/*.lib
+/enc/jis/props.h
+/enc/unicode/data
+
+# /coroutine/
+!/coroutine/**/*.s
 
 # /enc/trans/
 /enc/trans/*.c
+/enc/trans/*.def
+/enc/trans/*.exp
+/enc/trans/*.lib
+
+# /exe/
+/exe/goruby
+/exe/ruby
 
 # /ext/
 /ext/extinit.c
+/ext/configure-ext.mk
+/ext/*/exts.mk
+
+# /ext/-test-/cxxanyargs
+/ext/-test-/cxxanyargs/failure*.failed
+
+# /ext/-test-/win32/dln/
+/ext/-test-/win32/dln/dlntest.dll
+/ext/-test-/win32/dln/dlntest.exp
+/ext/-test-/win32/dln/dlntest.lib
+
+# /ext/-test-/gems
+/ext/-test-/gems
 
-# /ext/dl/callback/
-/ext/dl/callback/callback-*.c
-/ext/dl/callback/callback.c
+# /ext/etc/
+/ext/etc/constdefs.h
+
+# /ext/fiddle/
+/ext/fiddle/libffi-*
+
+# /ext/rbconfig/
+/ext/rbconfig/sizeof/sizes.c
+/ext/rbconfig/sizeof/limits.c
 
 # /ext/ripper/
 /ext/ripper/eventids1.c
+/ext/ripper/.eventids2-check
 /ext/ripper/eventids2table.c
 /ext/ripper/ripper.*
 /ext/ripper/ids1
@@ -115,12 +214,20 @@ y.tab.c
 /ext/socket/constdefs.h
 /ext/socket/constdefs.c
 
-# /ext/tk/
-/ext/tk/config_list
+# /gems
+/gems/*.gem
+/gems/src
+/gems/*-*
+
+# /lib/
+/lib/ruby/[1-9]*.*
+/lib/ruby/vendor_ruby
+
+# /misc/
+/misc/**/__pycache__
 
-# /spec/
-/spec/mspec
-/spec/rubyspec
+# /spec/bundler
+/.rspec_status
 
 # /tool/
 /tool/config.guess
@@ -128,4 +235,16 @@ y.tab.c
 
 # /win32/
 /win32/*.ico
-/win32/.time
+
+# MJIT
+/include/ruby-*/*/rb_mjit_min_header-*.h
+/lib/ruby_vm/mjit/instruction.rb
+/mjit_config.h
+/rb_mjit_header.h
+
+# YJIT
+/yjit-bench
+/yjit_exit_locations.dump
+
+# /wasm/
+/wasm/tests/*.wasm
diff --git a/.indent.pro b/.indent.pro
index 6a207a0554..1d61cbcad1 100644
--- a/.indent.pro
+++ b/.indent.pro
@@ -2,12 +2,15 @@
 -nbbb
 -nbc
 -br
+-brs
 -nbs
 -ncdb
--ce
--cli0.5
+-nce
+-cdw
+-cli2
+-cbi2
 -ndj
--ei
+-ncs
 -nfc1
 -i4
 -l120
@@ -16,6 +19,14 @@
 -psl
 -sc
 -sob
+-sbi4
+-nut
+-par
 
 -TID
 -TVALUE
+-Tst_data_t
+-Tst_index_t
+-Tst_table
+-Trb_data_type_t
+-TFILE
diff --git a/.rdoc_options b/.rdoc_options
new file mode 100644
index 0000000000..760507c7a2
--- /dev/null
+++ b/.rdoc_options
@@ -0,0 +1,4 @@
+---
+page_dir: doc
+main_page: README.md
+title: Documentation for Ruby development version
diff --git a/.rspec_parallel b/.rspec_parallel
new file mode 100644
index 0000000000..aaff198a32
--- /dev/null
+++ b/.rspec_parallel
@@ -0,0 +1,2 @@
+--format progress
+--format ParallelTests::RSpec::RuntimeLogger --out tmp/parallel_runtime_rspec.log
diff --git a/.travis.yml b/.travis.yml
deleted file mode 100644
index 51987ab91d..0000000000
--- a/.travis.yml
+++ /dev/null
@@ -1,74 +0,0 @@
-# Copyright (C) 2011 Urabe, Shyouhei.  All rights reserved.
-#
-# This file is  a part of the programming language  Ruby.  Permission is hereby
-# granted,  to either  redistribute  or  modify this  file,  provided that  the
-# conditions  mentioned in  the file  COPYING are  met.  Consult  the  file for
-# details.
-
-# This is  a Travis-CI  build configuration file.   The list  of configurations
-# available is located in
-#
-#     http://about.travis-ci.org/docs/user/build-configuration/
-#
-# and as Ruby itself is a project written in C language,
-#
-#     http://about.travis-ci.org/docs/user/languages/c/
-#
-# is also a good place to look at.
-
-# Language specification.
-language: c
-
-# Compilers.  Several  compilers are  provided in Travis,  so we try  them all.
-# The value set here is visible via $CC environment variable.
-compiler:
-  - gcc
-  - clang
-
-# Dependencies.  Some  header files are missing  in a Travis' worker  VM, so we
-# have  to install  them.  The  "1.9.1" here  is OK.   It is  the  most adopted
-# version string  for Debian/Ubuntu, and  no dependencies have been  changed so
-# far since the 1.9.1 release.
-before_install:
-  - "sudo apt-get -qq update"
-  - "sudo apt-get -qq install $CC" # upgrade if any
-install: "sudo apt-get -qq build-dep ruby1.9.1 2>/dev/null"
-
-# Script is where the test runs.  Note  we just do "make test", not other tests
-# like  test-all, test-rubyspec.   This is  because  they take  too much  time,
-# enough for Travis to shut down the VM as being stalled.
-before_script:
-  - "make -f common.mk BASERUBY=ruby srcdir=. update-config_files"
-  - "autoconf"
-  - "./configure --with-gcc=$CC"
-  - "make -sj encs"
-  - "make -sj exts"
-script:
-  - "make test OPTS=-v"
-#  - "make test-all TESTS='-v'"
-
-# Branch matrix.  Not all branches are Travis-ready so we limit branches here.
-branches:
-  only:
-    - trunk
-    - ruby_1_9_3
-
-# We want to be notified when something happens.
-notifications:
-  irc:
-    channels:
-      - "irc.freenode.org#ruby-core"
-      - "irc.freenode.org#ruby-ja"
-    on_success: change # [always|never|change] # default: always
-    on_failure: change # [always|never|change] # default: always
-    template:
-      - "%{message} by @%{author}: See %{build_url}"
-
-# Local Variables:
-# mode: YAML
-# coding: utf-8-unix
-# indent-tabs-mode: nil
-# tab-width: 4
-# fill-column: 79
-# default-justification: full
-# End:
diff --git a/BSDL b/BSDL
index a009caefea..66d93598aa 100644
--- a/BSDL
+++ b/BSDL
@@ -4,10 +4,10 @@ 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.
+   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.
+   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
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
new file mode 100644
index 0000000000..13df6087ca
--- /dev/null
+++ b/CONTRIBUTING.md
@@ -0,0 +1 @@
+See ["Contributing to Ruby"](https://docs.ruby-lang.org/en/master/contributing_md.html), which includes setup and build instructions.
diff --git a/COPYING b/COPYING
index a1f19ff99d..48e5a96de7 100644
--- a/COPYING
+++ b/COPYING
@@ -2,55 +2,55 @@ Ruby is copyrighted free software by Yukihiro Matsumoto <matz@netlab.jp>.
 You can redistribute it and/or modify it under either the terms of the
 2-clause BSDL (see the file BSDL), or the conditions below:
 
-  1. You may make and give away verbatim copies of the source form of the
-     software without restriction, provided that you duplicate all of the
-     original copyright notices and associated disclaimers.
+1. You may make and give away verbatim copies of the source form of the
+   software without restriction, provided that you duplicate all of the
+   original copyright notices and associated disclaimers.
 
-  2. You may modify your copy of the software in any way, provided that
-     you do at least ONE of the following:
+2. You may modify your copy of the software in any way, provided that
+   you do at least ONE of the following:
 
-       a) place your modifications in the Public Domain or otherwise
-          make them Freely Available, such as by posting said
-	  modifications to Usenet or an equivalent medium, or by allowing
-	  the author to include your modifications in the software.
+   a. place your modifications in the Public Domain or otherwise
+      make them Freely Available, such as by posting said
+      modifications to Usenet or an equivalent medium, or by allowing
+      the author to include your modifications in the software.
 
-       b) use the modified software only within your corporation or
-          organization.
+   b. use the modified software only within your corporation or
+      organization.
 
-       c) give non-standard binaries non-standard names, with
-          instructions on where to get the original software distribution.
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-       d) make other distribution arrangements with the author.
+   d. make other distribution arrangements with the author.
 
-  3. You may distribute the software in object code or binary form,
-     provided that you do at least ONE of the following:
+3. You may distribute the software in object code or binary form,
+   provided that you do at least ONE of the following:
 
-       a) distribute the binaries and library files of the software,
-	  together with instructions (in the manual page or equivalent)
-	  on where to get the original distribution.
+   a. distribute the binaries and library files of the software,
+      together with instructions (in the manual page or equivalent)
+      on where to get the original distribution.
 
-       b) accompany the distribution with the machine-readable source of
-	  the software.
+   b. accompany the distribution with the machine-readable source of
+      the software.
 
-       c) give non-standard binaries non-standard names, with
-          instructions on where to get the original software distribution.
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-       d) make other distribution arrangements with the author.
+   d. make other distribution arrangements with the author.
 
-  4. You may modify and include the part of the software into any other
-     software (possibly commercial).  But some files in the distribution
-     are not written by the author, so that they are not under these terms.
+4. You may modify and include the part of the software into any other
+   software (possibly commercial).  But some files in the distribution
+   are not written by the author, so that they are not under these terms.
 
-     For the list of those files and their copying conditions, see the
-     file LEGAL.
+   For the list of those files and their copying conditions, see the
+   file LEGAL.
 
-  5. The scripts and library files supplied as input to or produced as 
-     output from the software do not automatically fall under the
-     copyright of the software, but belong to whomever generated them, 
-     and may be sold commercially, and may be aggregated with this
-     software.
+5. The scripts and library files supplied as input to or produced as
+   output from the software do not automatically fall under the
+   copyright of the software, but belong to whomever generated them,
+   and may be sold commercially, and may be aggregated with this
+   software.
 
-  6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
-     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-     PURPOSE.
+6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+   IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+   WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+   PURPOSE.
diff --git a/COPYING.ja b/COPYING.ja
index e50d01c8d1..230376bc60 100644
--- a/COPYING.ja
+++ b/COPYING.ja
@@ -2,50 +2,50 @@
 または以下に示す条件で本プログラムを再配布できます
 2-clause BSDLについてはBSDLファイルを参照して下さい．
 
-  1. 複製は制限なく自由です．
+1. 複製は制限なく自由です．
 
-  2. 以下の条件のいずれかを満たす時に本プログラムのソースを
-     自由に変更できます．
+2. 以下の条件のいずれかを満たす時に本プログラムのソースを
+   自由に変更できます．
 
-     (a) ネットニューズにポストしたり，作者に変更を送付する
-         などの方法で，変更を公開する．
+   a.  ネットニューズにポストしたり，作者に変更を送付する
+       などの方法で，変更を公開する．
 
-     (b) 変更した本プログラムを自分の所属する組織内部だけで
-         使う．
+   b.  変更した本プログラムを自分の所属する組織内部だけで
+       使う．
 
-     (c) 変更点を明示したうえ，ソフトウェアの名前を変更する．
-         そのソフトウェアを配布する時には変更前の本プログラ
-         ムも同時に配布する．または変更前の本プログラムのソー
-         スの入手法を明示する．
+   c.  変更点を明示したうえ，ソフトウェアの名前を変更する．
+       そのソフトウェアを配布する時には変更前の本プログラ
+       ムも同時に配布する．または変更前の本プログラムのソー
+       スの入手法を明示する．
 
-     (d) その他の変更条件を作者と合意する．
+   d.  その他の変更条件を作者と合意する．
 
-  3. 以下の条件のいずれかを満たす時に本プログラムをコンパイ
-     ルしたオブジェクトコードや実行形式でも配布できます．
+3. 以下の条件のいずれかを満たす時に本プログラムをコンパイ
+   ルしたオブジェクトコードや実行形式でも配布できます．
 
-     (a) バイナリを受け取った人がソースを入手できるように，
-         ソースの入手法を明示する．
+   a.  バイナリを受け取った人がソースを入手できるように，
+       ソースの入手法を明示する．
 
-     (b) 機械可読なソースコードを添付する．
+   b.  機械可読なソースコードを添付する．
 
-     (c) 変更を行ったバイナリは名前を変更したうえ，オリジナ
-         ルのソースコードの入手法を明示する．
+   c.  変更を行ったバイナリは名前を変更したうえ，オリジナ
+       ルのソースコードの入手法を明示する．
 
-     (d) その他の配布条件を作者と合意する．
+   d.  その他の配布条件を作者と合意する．
 
-  4. 他のプログラムへの引用はいかなる目的であれ自由です．た
-     だし，本プログラムに含まれる他の作者によるコードは，そ
-     れぞれの作者の意向による制限が加えられる場合があります．
+4. 他のプログラムへの引用はいかなる目的であれ自由です．た
+   だし，本プログラムに含まれる他の作者によるコードは，そ
+   れぞれの作者の意向による制限が加えられる場合があります．
 
-     それらファイルの一覧とそれぞれの配布条件などに付いては
-     LEGALファイルを参照してください．
+   それらファイルの一覧とそれぞれの配布条件などに付いては
+   LEGALファイルを参照してください．
 
-  5. 本プログラムへの入力となるスクリプトおよび，本プログラ
-     ムからの出力の権利は本プログラムの作者ではなく，それぞ
-     れの入出力を生成した人に属します．また，本プログラムに
-     組み込まれるための拡張ライブラリについても同様です．
+5. 本プログラムへの入力となるスクリプトおよび，本プログラ
+   ムからの出力の権利は本プログラムの作者ではなく，それぞ
+   れの入出力を生成した人に属します．また，本プログラムに
+   組み込まれるための拡張ライブラリについても同様です．
 
-  6. 本プログラムは無保証です．作者は本プログラムをサポート
-     する意志はありますが，プログラム自身のバグあるいは本プ
-     ログラムの実行などから発生するいかなる損害に対しても責
-     任を持ちません．
+6. 本プログラムは無保証です．作者は本プログラムをサポート
+   する意志はありますが，プログラム自身のバグあるいは本プ
+   ログラムの実行などから発生するいかなる損害に対しても責
+   任を持ちません．
diff --git a/ChangeLog b/ChangeLog
deleted file mode 100644
index fc0a391c08..0000000000
--- a/ChangeLog
+++ /dev/null
@@ -1,10863 +0,0 @@
-Sun Aug  4 00:57:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_karatsuba): Don't allocate new temporary buffer
-	  if the buffer is enough for current invocation.
-
-Sun Aug  4 00:22:34 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary2bdigitdbl): New function.
-	  (bdigitdbl2bary): Ditto.
-	  (bary_mul_single): Use bdigitdbl2bary.
-	  (power_cache_get_power): Ditto.
-	  (bary_divmod): Use bary2bdigitdbl.
-	  (big2str_orig): Ditto.
-	  (bigdivrem): Ditto.
-
-Sat Aug  3 22:47:11 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: The branch condition of selecting multiplication
-	  algorighms should check smaller argument because Karatsuba and Toom3
-	  is effective only if both arguments are big.
-	  (bary_mul_toom3_branch): Compare the smaller argument to
-	  TOOM3_MUL_DIGITS.
-	  (bary_mul): Compare the smaller argument to KARATSUBA_MUL_DIGITS.
-
-Sat Aug  3 22:23:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_orig): Receive the number to stringize as
-	  BDIGIT array and size.
-	  (big2str_karatsuba): Receive the number to stringize as BDIGIT array
-	  and size.  Use an temporary array of BDIGIT.
-	  (rb_big2str1): Follow the above change.
-
-Sat Aug  3 13:30:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (MAX_BASE36_POWER_TABLE_ENTRIES): Renamed from
-	  MAX_BIG2STR_TABLE_ENTRIES.
-	  (base36_power_cache): Renamed from big2str_power_cache.
-	  (base36_numdigits_cache): Renamed from big2str_numdigits_cache.
-
-Sat Aug  3 10:33:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_set_integer_literal): use rb_rational_raw1() for
-	  integral rational because no reduction is needed with 1.
-
-Sat Aug  3 09:46:07 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/etc/etc.c (setup_passwd, setup_group): set proper encodings to
-	  string members.
-
-Sat Aug  3 09:30:57 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* struct.c (rb_struct_define_under): new function to define Struct
-	  under the given namespace, not under Struct.  [Feature #8264]
-
-	* ext/etc/etc.c: use rb_struct_define_under.
-
-Sat Aug  3 06:55:29 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* parse.y (value_expr_gen): now NODE_DEFN and NODE_DEFS are not void
-	  value expressions.  get rid of wrong warning with -w, and make to
-	  pass tests with chkbuild.  ref. [Feature #3753]
-
-Sat Aug  3 04:23:48 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/syntax/refinements.rdoc:  Remove mention of instance_eval and
-	  module_eval from scope section per:
-	  http://twitter.com/shugomaeda/status/363219951336693761
-
-Sat Aug  3 02:22:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_orig): Refactored.
-
-Sat Aug  3 01:20:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigadd_core): Removed.
-	  (bigadd): Use bary_add instead of bigadd_core.
-
-Sat Aug  3 00:52:43 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big2str1): Simplify power_level calculation.
-
-Sat Aug  3 00:34:20 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_zip): use rb_ary_new2() to create buffer
-	  if rb_block_arity() > 1.
-
-Sat Aug  3 00:12:00 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* NEWS: Add the description that IO#seek supports SEEK_DATA
-	  and SEEK_HOLE.
-
-Fri Aug  2 23:57:57 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* vm.c (m_core_define_method, m_core_define_singleton_method): now
-	  the value of def-expr is the Symbol of the name of the method, not
-	  nil.
-	  ref. [ruby-dev:42151] [Feature #3753]
-
-	* test/ruby/test_syntax.rb (TestSyntax#test_value_of_def): test for
-	  above changes.
-
-Fri Aug  2 23:54:11 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_zip): performance improvement by avoiding
-	  array creation if rb_block_arity() > 1.
-
-Fri Aug  2 23:50:53 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (power_cache_get_power): Apply bigtrunc to the result of
-	  bigsq.
-	  (big2str_karatsuba): Fix number of leading zero characters.
-
-Fri Aug  2 23:48:36 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_yylex): calculate denominator directly as powers of
-	  ten, not parsing string.
-
-	* parse.y (parser_number_literal_suffix): return bit set of found
-	  suffixes.
-
-	* parse.y (parser_set_number_literal, parser_set_integer_literal):
-	  split from parser_number_literal_suffix to set yyvlal.
-
-	* parse.y (parser_yylex): parse rational number literal with decimal
-	  point precisely.
-
-	* parse.y (simple_numeric): integrate numeric literals and simplify
-	  numeric rules.
-
-	* ext/ripper/eventids2.c (ripper_init_eventids2): ripper support for
-	  new literals, tRATIONAL and tIMAGINARY.
-
-Fri Aug  2 18:33:28 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_karatsuba): Reduce power_level more than one at
-	  recursion, if possible.
-	  (rb_big2str1): Follow the above change.
-
-Fri Aug  2 12:25:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): Swap x and y for bary_mul1 if x is longer than y.
-	  [ruby-dev:47565] [Bug #8719] Reported by Narihiro Nakamura.
-
-Fri Aug  2 10:39:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* parse.y (negate_lit): add T_RATIONAL and T_COMPLEX to the switch
-	  statement, and call rb_bug() if an unknown type is passed to
-	  negate_lit(). [ruby-core:56316] [Bug #8717]
-
-	* bootstraptest/test_literal_suffix.rb (assert_equal): add test
-
-Fri Aug  2 09:14:47 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/syntax/refinements.rdoc:  Improve description of where you may
-	  activate refinements.
-
-Fri Aug  2 07:45:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_orig): Remove len argument.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str1): Follow above change.
-
-Thu Aug  2 02:32:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* NEWS: Add the description of number literal suffixes.
-
-Thu Aug  2 00:02:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* bootstraptest/test_literal_suffix.rb: add two test cases to
-	  examine that "1if true" and "1rescue nil" are recognized as 1.
-
-Thu Aug  1 23:45:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* rational.c (rb_flt_rationalize_with_prec): new public C function
-	  to rationalize a Float instance with a precision.
-
-	* rational.c (rb_flt_rationalize): new public C function to
-	 rationalize a Float instance.  A precision is calculated from
-	 the given float number.
-
-	* include/ruby/intern.h: Add rb_flt_rationalize_with_prec and
-	  rb_flt_rationalize.
-
-	* parse.y: implement number literal suffixes, 'r' and 'i'.
-	  [ruby-core:55096] [Feature #8430]
-
-	* bootstraptest/test_literal_suffix.rb: add tests for parser to scan
-	  number literals with the above tsuffixes.
-
-Thu Aug  1 23:55:08 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big2str1): Remove a local variable.
-
-Thu Aug  1 23:33:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Use power_cache_get_power.
-
-Thu Aug  1 21:02:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big2str1): Raise an error for too big number.
-
-Thu Aug  1 20:46:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (power_cache_get_power): Hide cached Bignum objects.
-
-Thu Aug  1 19:15:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big2str1): Remove non-trim mode.
-	  (rb_big2str0): Non-trim mode implemented here.
-	  (big2str_find_n1): Change the result type to long again.
-	  (big2str_base_powerof2): Don't take arguments: len and trim.
-	  (rb_big2str): Follow above change.
-
-Thu Aug  1 12:37:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_alloc): New function to allocate the result string.
-	  It is called after actual length is calculated.
-	  (big2str_struct): Add fields: negative, result and ptr.
-	  (big2str_orig): Write out the result via b2s->ptr.
-	  (big2str_orig): Ditto.
-	  (rb_big2str1): Don't allocate the result string at beginning.
-
-Thu Aug  1 07:36:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_orig): Use temporary buffer when trim mode.
-
-Thu Aug  1 06:28:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_orig): Simplified because RBIGNUM_LEN(x) <= 2 now.
-	  (big2str_struct): Two fields added: hbase2, hbase2_numdigits.
-	  (rb_big2str1): Initialize above fields.
-
-Thu Aug  1 04:06:17 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rdoc/options.rb (RDoc#finish): include root path in include
-	  paths, to work in another directory than the source directory.
-	  [ruby-core:56282] [Bug #8712]
-
-	* test/test_rdoc_markup_pre_process.rb (TestRDocMarkupPreProcess#setup):
-	  fix input_file_name, as the test script is not pre-processed.
-
-Thu Aug  1 01:45:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_karatsuba): Fix a condition of power_level.
-
-Thu Aug  1 01:09:02 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (LOG2_KARATSUBA_BIG2STR_DIGITS): Removed.
-	  (KARATSUBA_BIG2STR_DIGITS): Removed.
-	  (big2str_numdigits_cache): New variable.
-	  (power_cache_get_power): Merged with power_cache_get_power0.
-	  This function returns maxpow_in_bdigit_dbl(base)**(2**power_level).
-	  (rb_big2str1): use power_cache_get_power.
-
-Wed Jul 31 23:59:28 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_find_n1): Change the return type to size_t.
-	  (big2str_orig): Ditto.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str1): Follow the above changes.
-
-Wed Jul 31 23:19:06 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (power_cache_get_power): Change numdigits_ret to size_t *.
-	  (big2str_orig): Change len argument to size_t.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str1): Follow the above changes.
-
-Wed Jul 31 22:59:47 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/parse/test_notation_declaration.rb: Change class
-	  name to follow file name change.
-
-Wed Jul 31 22:57:50 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Rename to ...
-	* test/rexml/parse/test_notation_declaration.rb: ... this.
-
-Wed Jul 31 22:54:39 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_mixin.rb: Remove duplicated tests.
-
-Wed Jul 31 22:52:55 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Fix typos in expected
-	  value.
-	  pubilc ->
-	  public
-	     ^^
-
-Wed Jul 31 22:50:51 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Add tests that focus
-	  system literal in external ID system notation declaration.
-
-Wed Jul 31 22:36:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_cmp): Extracted from rb_big_cmp.
-	  (power_cache_get_power): Change n1 argument (number of digits) to
-	  power_level which is just passed to power_cache_get_power0.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str1): Calculate the initial power_level.
-
-Wed Jul 31 22:04:36 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Fix a typo.
-	  Extern  ID ->
-	  ExternalID
-	        ^^
-
-Wed Jul 31 22:01:36 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Add tests that focus
-	  public ID in external ID notation declaration.
-
-Wed Jul 31 22:01:24 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* parse.y: fix build error with bison-3.0.
-
-Wed Jul 31 21:58:53 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Split test patterns.
-
-Wed Jul 31 21:42:33 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Group tests.
-
-Wed Jul 31 21:37:51 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_mixin.rb (TestNotationDecl#test_name):
-	  Move to ...
-	* test/rexml/test_notationdecl_parsetest.rb
-	  (TestNotationDecl#test_name): ... here.
-
-Wed Jul 31 21:37:47 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-Wed Jul 31 21:31:49 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: Remove setup because it
-	  doesn't share anything with other tests.
-
-Wed Jul 31 21:24:55 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_attributes_mixin.rb: Remove a needless shebang.
-	* test/rexml/test_notationdecl_mixin.rb: ditto.
-	* test/rexml/test_doctype.rb: ditto.
-	* test/rexml/test_xml_declaration.rb: ditto.
-	* test/rexml/test_changing_encoding.rb: ditto.
-
-Wed Jul 31 21:20:08 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_notationdecl_parsetest.rb: remove a needless shebang.
-
-Wed Jul 31 20:11:01 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_rindex): fix bug introduced in r42269.
-	  "".rindex("") should return 0.
-	  (str_rindex): ditto.
-
-Wed Jul 31 19:55:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (MAX_BIG2STR_TABLE_ENTRIES): Use SIZEOF_SIZE_T.
-	  (power_cache_get_power0): Add rb_bug call for too bit i argument.
-	  (power_cache_get_power): Simplified.
-
-Wed Jul 31 18:32:25 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/uri/common.rb (URI.decode_www_form_component): Use String#b.
-
-Wed Jul 31 18:24:02 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* eval.c (rb_mod_refine, mod_using, top_using): don't show
-	  warnings because Refinements are no longer experimental.
-	  [ruby-core:55993] [Feature #8632]
-
-	* test/ruby/test_refinement.rb: related test.
-
-	* NEWS: fixes for the above change.
-
-Wed Jul 31 17:55:55 2013  Shota Fukumori  <her@sorah.jp>
-
-	* lib/uri/common.rb (URI.decode_www_form_component):
-	  Don't raise error when str includes multibyte characters.
-
-Wed Jul 31 17:45:39 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_rindex): performance improvement by using
-	  memrchr(3).
-
-Wed Jul 31 16:43:30 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_rindex): refactoring and avoid to call str_nth() if
-	  pos == 0.
-
-Wed Jul 31 14:41:36 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb: [DOC] Add a couple of notes on Hash as storage.
-	  ref. [Feature #6589]
-
-Wed Jul 31 14:38:52 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb: [DOC] Fix example result.  Hash is now ordered.
-
-Wed Jul 31 14:38:10 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb: [DOC] Use the term "sorted" instead of "ordered"
-	  when mentioning SortSet.
-
-Wed Jul 31 12:18:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_struct): New structure.
-	  (big2str_orig): Use big2str_struct.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str1): Ditto.
-
-Wed Jul 31 12:02:16 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rubygems.rb: [DOC] typo in url patch by @Red54 [Fixes #369]
-	  https://github.com/ruby/ruby/pull/369
-
-Wed Jul 31 07:09:07 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems from master as of commit 523551c
-	* test/rubygems:  ditto.
-
-Tue Jul 30 22:21:54 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* test/ruby/test_hash.rb: add a test for enumeration order of Hash.
-
-Tue Jul 30 18:52:27 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#intersect?, Set#disjoint?): Add new methods for
-	  testing if two sets have any element in common.
-	  [ruby-core:45641] [Feature #6588] Based on the code by marcandre.
-
-Tue Jul 30 17:16:15 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* sprintf.c (ruby__sfvextra): add QUOTE flag to escape unprintable
-	  characters.
-
-Tue Jul 30 11:00:52 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/curses/extconf.rb: [DOC] nodoc to reduce Object pollution
-
-Tue Jul 30 08:19:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* sizes.c (Init_sizes): Define sizes only if the type actually exists.
-
-Mon Jul 29 22:55:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* sizes.c (Init_sizes): define RbConfig::SIZEOF.  [Feature #8568]
-
-Mon Jul 29 22:25:20 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/curses/curses.c: [DOC] Update location of samples
-	* samples/curses/*: Move Curses samples and refactor from mixin
-	  The samples are included in rdoc for module and use of mixin is
-	  confusing
-
-Mon Jul 29 22:16:11 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (LOG2_KARATSUBA_BIG2STR_DIGITS): Renamed from
-	  LOG2_KARATSUBA_DIGITS.
-	  (KARATSUBA_BIG2STR_DIGITS): Renamed from KARATSUBA_DIGITS.
-
-Mon Jul 29 22:04:45 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_compare_by_id): add function prototype.
-
-Mon Jul 29 21:53:41 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_compare_by_id): don't call rb_hash_rehash()
-	  if self.compare_by_identity? == true.
-
-Mon Jul 29 21:29:48 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_assoc): performance improvement by replacing
-	  compare function in RHASH(hash)->ntbl->type temporarily like r42224.
-	  it falls back to rb_hash_foreach() if st_lookup() doesn't find the key.
-
-	* test/ruby/test_hash.rb: add a test for above.
-
-Mon Jul 29 21:15:30 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/ruby/test_lazy_enumerator.rb
-	  (TestLazyEnumerator#test_initialize): Make sure
-	  Enumerator::Lazy#initialize raises error if the object is
-	  frozen.  The check was performed by rb_ivar_set() before
-	  rb_check_frozen() was added to enumerator_init().
-
-Mon Jul 29 21:06:42 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* enumerator.c (enumerator_init): Add a frozenness check to
-	  prevent a frozen Enumerator object from being reinitialized with
-	  a different enumerable object.  This is the least we should do,
-	  and more fixes will follow. [Fixes GH-368] Patch by Kenichi
-	  Kamiya.
-
-	* enumerator.c (generator_init): Ditto.
-
-Mon Jul 29 20:14:24 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_assoc): revert r42224. table->type->compare is
-	  called only if hashes are matched.
-
-	* test/ruby/test_hash.rb: add a test to check using #== to compare.
-
-Mon Jul 29 17:00:31 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (yycompile): store file name as String to keep the encoding.
-
-	* parse.y (rb_parser_compile_string_path, rb_parser_compile_file_path):
-	  new functions to pass file name as a String.
-
-	* parse.y (gettable_gen): return a copy of the original file name, not
-	  a copy in filesystem encoding.
-
-	* vm_eval.c (eval_string_with_cref): use Qundef instead of "(eval)".
-
-Mon Jul 29 16:53:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (rb_hash_initialize_copy): copy st_table type even if empty.
-	  [ruby-core:56256] [Bug #8703]
-
-Mon Jul 29 16:34:29 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (rb_hash_initialize_copy): clear old table before copy new
-	  table.
-
-Mon Jul 29 16:34:09 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (rb_hash_assoc): aggregate object can be initialized only
-	  with link time constants.
-
-Mon Jul 29 14:54:44 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_assoc): performance improvement by replacing
-	  compare function in RHASH(hash)->ntbl->type temporarily.
-
-Mon Jul 29 14:52:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (xsystem): expand environment variable in all macros not
-	  expanded with RbConfig.  [Bug #8702]
-
-	* test/mkmf/test_framework.rb (create_framework): replace all $@ not
-	  only once.
-
-Mon Jul 29 06:54:30 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_pipe): use enum for compile time constants,
-	  instead of const int for debugging.
-
-Mon Jul 29 00:11:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Specialized implementation added for
-	  nx == 2 && ny == 2
-
-Sun Jul 28 20:28:41 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* io.c (io_getpartial): use rb_str_locktmp_ensure().
-	  [ruby-core:56121] [Bug #8669]
-
-	* io.c (rb_io_sysread): ditto.
-
-	* test/ruby/test_io.rb: add tests for above.
-
-Sun Jul 28 20:10:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/extmk.rb (extmake): should make static libraries for extensions
-	  to be statically linked.  [Bug #7948]
-
-Sun Jul 28 17:38:32 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c: add internal API rb_str_locktmp_ensure().
-
-	* io.c (io_fread): use rb_str_locktmp_ensure().
-	  [ruby-core:56121] [Bug #8669]
-
-	* test/ruby/test_io.rb: add a test for above.
-
-Sun Jul 28 13:04:39 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* io.c (interpret_seek_whence): support SEEK_DATA and SEEK_HOLE.
-	  These are whences for lseek(2) supported by Linux since version 3.1.
-	  [ruby-core:56123] [Feature #8671]
-
-	* test/ruby/test_io.rb: Add tests for above.
-
-Sun Jul 28 12:41:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_generic): The char_bit variable changed
-	  to static constant.
-
-Sun Jul 28 12:03:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Constify bary_* functions.
-
-Sun Jul 28 11:12:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_absint_size): Declaration moved from
-	  internal.h to calculate required buffer size to pack integers.
-	  (rb_absint_numwords): Ditto.
-	  (rb_absint_singlebit_p): Ditto.
-	  [ruby-core:42813] [Feature #6065]
-
-Sun Jul 28 10:54:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_pipe): fix pipe name formatting.  as "%x" may
-	  not contain '0' at all, fill at fixed position instead.
-
-Sun Jul 28 00:35:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_size): Return the bignum "bytewise" size.
-	  [ruby-core:55578] [Feature #8553]
-	  This is accepted by matz on DevelopersMeeting20130727Japan.
-
-Sun Jul 28 00:07:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_integer_pack): Declaration moved from
-	  internal.h.
-	  (rb_integer_unpack): Ditto.
-	  [ruby-core:42813] [Feature #6065]
-
-Fri Jul 26 23:18:13 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* NEWS: Add a new feature that REXML::Parsers::StreamParser
-	  supports "entity" event.
-
-Fri Jul 26 23:14:31 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/parsers/streamparser.rb
-	  (REXML::Parsers::StreamParser#parse): Add "entity" event support to
-	  listener. [Bug #8689] [ruby-dev:47542]
-	  Reported by Ippei Obayashi.
-	* test/rexml/test_stream.rb (StreamTester#entity): Add a test for
-	  the above case.
-
-Fri Jul 26 23:05:27 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_yylex): separate numeric literal from succeeding
-	  token, and treat 'e' as floating point number only if followed by
-	  exponent part.
-
-Fri Jul 26 22:14:10 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_exec.h (CHECK_VM_STACK_OVERFLOW_FOR_INSN): surround with
-	  do/while (0), and remove unnecessary casts.
-
-Fri Jul 26 20:12:07 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* ext/syslog/lib/syslog/logger.rb (Syslog::Logger): Add facility
-	  to Syslog::Logger. [Fixes GH-305] patch by Max Shytikov
-	  https://github.com/ruby/ruby/pull/305
-
-Fri Jul 26 19:25:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_exec.h, tool/instruction.rb: not an error, but a BUG if stack
-	  overflow checking failed just before/after the beginning of an
-	  instruction. It should be treated as a BUG.
-	  Please tell us if your code cause BUG with this problem.
-	  This check will removed soon (for performance).
-
-Fri Jul 26 18:30:14 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_memcpy): cast to int to suppress a warning.
-
-Fri Jul 26 18:21:58 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_memcpy): try to enable optimization.
-	  At least on my environments, I don't see any errors
-	  with many trials. Please tell us if you find any GC bugs.
-
-Fri Jul 26 17:49:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/file.c (fix_string_encoding): fix target encoding.  the
-	  parameter `encoding' is not the target encoding but the original
-	  encoding.
-
-Fri Jul 26 14:05:19 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/fiddle/*: [DOC] More doc on dlopen and RTLD_DEFAULT from r42184
-
-Fri Jul 26 13:08:53 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/fiddle/lib/fiddle.rb: [DOC] Document Fiddle.dlopen(nil)
-	* ext/fiddle/handle.c: [DOC] Document Fiddle::Handle.new(nil)
-
-Fri Jul 26 13:04:15 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (rb_load_internal): use rb_load_file_str() to keep path
-	  encoding.
-
-	* load.c (rb_require_safe): search in OS path encoding for Windows.
-
-	* ruby.c (rb_load_file_str): load file with keeping path encoding.
-
-	* win32/file.c (rb_file_load_ok): use WCHAR type API assuming incoming
-	  path is encoded in UTF-8.  [ruby-core:56136] [Bug #8676]
-
-	* file.c (rb_str_encode_ospath): simplify using rb_str_conv_enc().
-
-	* win32/file.c (fix_string_encoding): simplify with rb_str_conv_enc().
-
-	* win32/file.c (convert_mb_to_wchar): use bare pointer instead of
-	  VALUE, and remove useless argument.
-
-Fri Jul 26 11:42:07 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* rational.c (f_round_common): Rational is expected to be returned by
-	  Rational#*, but mathn.rb breaks that assumption.  [ruby-core:56177]
-	  [Bug #8687]
-
-Fri Jul 26 01:37:45 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* include/ruby/ruby.h: check defined(USE_RGENGC_LOGGING_WB_UNPROTECT)
-
-Fri Jul 26 01:21:41 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (rb_file_expand_path_internal): fix r42160; skip '~'.
-
-Thu Jul 25 17:53:18 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP#connect): disable Nagle's algorithm on
-	  HTTP connection. [ruby-core:56158] [Feature #8681]
-
-Thu Jul 25 17:49:42 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* re.c (rb_reg_to_s): convert closing parenthesis to the target encoding
-	  if it is ASCII incompatible encoding. [ruby-core:56063] [Bug #8650]
-
-Thu Jul 25 17:21:21 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (is_obj_encoding): new macro to check if obj is an
-	  Encoding.  obj can be any type while is_data_encoding expects T_DATA
-	  only.
-
-Thu Jul 25 17:17:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (rb_file_expand_path_internal): should clear coderange after
-	  copying user name as binary data.
-
-Thu Jul 25 16:17:55 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* encoding.c (check_encoding): Check T_DATA or not.
-	  is_data_encoding(obj) assumes that `obj' is T_DATA.
-
-Thu Jul 25 13:06:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (dir_s_home): use rb_home_dir_of and rb_default_home_dir.
-
-	* file.c (rb_home_dir_of): split from rb_home_dir() for the home
-	  directry of the given user, and the user name is a VALUE, not a bare
-	  pointer.  should raise if the user does not exist.
-
-	* file.c (rb_default_home_dir): split from rb_home_dir() for the home
-	  directry of the current user.
-
-Thu Jul 25 12:32:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/openssl/ossl.c: support additional three thread synchronization
-	  functions. [ruby-trunk - Bug #8386]
-
-Thu Jul 25 07:15:58 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems from master as of commit 4ff70cc
-	* test/rubygems:  ditto.
-
-Wed Jul 24 20:57:44 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* compile.c (iseq_set_arguments): use RARRAY_RAWPTR() instead of
-	  RARRAY_PTR() because there is no new reference.
-
-	* compile.c (iseq_set_exception_table): ditto.
-
-Wed Jul 24 19:49:54 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/generic.rb (find_proxy): raise BadURIError if the URI is
-	  a relative URI. [Bug #8645]
-
-Wed Jul 24 18:56:06 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_insnhelper.c (vm_expandarray): use RARRAY_RAWPTR() instead of
-	  RARRAY_PTR() because there is no new reference.
-
-	* vm_insnhelper.c (vm_caller_setup_args): ditto.
-
-	* vm_insnhelper.c (vm_yield_setup_block_args): ditto.
-
-Wed Jul 24 18:40:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c, gc.c: move ary_unprotect_logging() into
-	  rb_gc_unprotect_logging() which is general version
-
-	* include/ruby/ruby.h: add USE_RGENGC_LOGGING_WB_UNPROTECT
-	  to enable.
-
-Wed Jul 24 17:37:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (rb_file_expand_path_internal): preserve the file name
-	  encoding in an exception message.
-
-Wed Jul 24 08:04:49 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* test/-ext-/tracepoint/test_tracepoint.rb: add GC on/off to count
-	  GC events strictly.
-
-Tue Jul 23 23:19:24 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/openssl/extconf.rb (CRYPTO_THREADID): check exist or not.
-
-	* ext/openssl/ossl.c (ossl_thread_id): use rb_nativethread_self()
-	  implemented at r42137 to allow threads which doesn't associated with
-	  Ruby thread to use openssl functions.
-
-	* ext/openssl/ossl.c (Init_ossl_locks): If CRYPTO_THREADID is defined
-	  (OpenSSL 1.0.0 or later has it) use CRYPTO_THREADID_set_callback()
-	  instead of CRYPTO_set_id_callback() because its argument is
-	  unsigned long; it may cause id collision on mswin64
-	  whose sizeof(unsigned long) < sizeof(void*).
-	  http://www.openssl.org/docs/crypto/threads.html
-
-	* ext/openssl/ossl.c (ossl_threadid_func): defined for above.
-
-Tue Jul 23 20:47:36 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Move functions.
-
-Tue Jul 23 20:14:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_divmod): Add special cases for x < y easily detected
-	  and nx == 2 && ny == 2.
-
-Tue Jul 23 19:48:38 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* thread_(pthread|win32).h: rename rb_thread_cond_t to
-	  rb_nativethread_cond_t.
-
-	* thread.c, thread_pthread.c, thread_win32.c, vm_core.h: catch up
-	  renaming.
-
-Tue Jul 23 19:44:32 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* thread_native.h: add rb_nativethread_self() which returns
-	  current running native thread identifier.
-
-	* thread_[pthread|win32].c: implement rb_nativethread_self().
-
-Tue Jul 23 19:34:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* thread_pthread.h, thread_win32.h: rename rb_thread_id_t to
-	  rb_nativethread_id_t.
-
-	* thread_pthread.c, vm_core.h: use rb_nativethread_id_t.
-
-Tue Jul 23 18:56:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/openssl/ossl.c: use system native (system provided)
-	  thread locking APIs added by last commit.
-	  This patch fixes [Bug #8386].
-	  "rb_mutex_*" APIs control only "Ruby" threads.
-	  Not for native threads.
-
-Tue Jul 23 18:44:15 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* thread_native.h: added.
-	  Move native thread related lines from vm_core.h.
-	  And declare several functions "rb_nativethread_lock_*",
-	  manipulate locking.
-
-	* common.mk: add thread_native.h.
-
-	* thread.c: add functions "rb_nativethread_lock_*".
-
-	* thread.c, thread_[pthread,win32].[ch]: rename rb_thread_lock_t
-	  to rb_nativethread_lock_t to make it clear that this lock is for
-	  native threads, not for ruby threads.
-
-Tue Jul 23 16:14:57 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_before_sweep): fix spacing.
-
-Tue Jul 23 15:57:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (heap_get_freeobj): clear slot->freelist here.
-	  This means that this slot doesn't have any free objects.
-	  And store this slot with objspace->heap.using_slot.
-
-	* gc.c (gc_before_sweep): restore objspace->freelist
-	  into objspace->heap.using_slot->freelist.
-	  This means that using_slot has free objects which are
-	  pointed from objspace->freelist.
-
-	* gc.c (gc_slot_sweep): do not need to clear slot->freelist.
-
-Tue Jul 23 09:34:49 2013  Zachary Scott  <e@zzak.io>
-
-	* sample/drb/README*.rdoc: [DOC] migrate DRb sample READMEs to rdoc
-
-Tue Jul 23 09:28:05 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/drb/invokemethod.rb: [DOC] nodoc InvokeMethod18Mixin
-
-Tue Jul 23 08:44:37 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl_asn1.c (asn1time_to_time):  Implement YYMMDDhhmmZ
-	  format for ASN.1 UTCTime.  [ruby-trunk - Bug #8664]
-	* test/openssl/test_asn1.rb:  Test for the above.
-
-Tue Jul 23 08:11:32 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rexml/streamlistener.rb: [DOC] Fix examples in
-	  REXML::StreamListener#entitydecl patch by Ippei Obayashi [Bug #8665]
-
-Tue Jul 23 07:44:59 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems from master as of commit b165260
-	* test/rubygems:  ditto.
-
-Tue Jul 23 07:14:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mulsub_1xN): New function.
-	  (bary_mul_toom3): Use bary_mulsub_1xN.
-
-Tue Jul 23 03:32:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (KARATSUBA_BALANCED): New macro.
-	  (TOOM3_BALANCED): Ditto.
-	  (bary_mul_balance_with_mulfunc): Use KARATSUBA_BALANCED and
-	  TOOM3_BALANCED.
-	  (rb_big_mul_balance): Relax a condition.
-	  (rb_big_mul_karatsuba): Use KARATSUBA_BALANCED.
-	  (rb_big_mul_toom3): Use TOOM3_BALANCED.
-	  (bary_mul_karatsuba_branch): Use KARATSUBA_BALANCED.
-	  (bary_mul_toom3_branch): Use TOOM3_BALANCED.
-
-Tue Jul 23 01:34:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem_mulsub): Extracted from bigdivrem1.
-	  (bigdivrem1): Use bary_add.
-
-Mon Jul 22 18:39:52 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_enumerate_chars): specify array capa
-	  with str_strlen().
-
-	* string.c (rb_str_enumerate_codepoints): ditto.
-
-Mon Jul 22 18:01:33 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_enumerate_chars): specify array capa.
-
-Mon Jul 22 17:24:14 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_each_char_size): performance improvement by
-	  using rb_str_length().
-
-Mon Jul 22 16:32:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (eval_string_with_cref): check by Check_TypedStruct
-	  instead of rb_obj_is_kind_of.
-
-Mon Jul 22 13:19:22 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_resize_capa): use RARRAY_RAWPTR() because
-	  this code creates no new references.
-
-Mon Jul 22 12:58:18 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_memfill): added.
-
-	* array.c (rb_ary_initialize): use ary_memfill().
-
-	* array.c (rb_ary_fill): ditto.
-
-	* array.c (rb_ary_slice_bang): use RARRAY_RAWPTR() because
-	  this code creates no new references.
-
-Mon Jul 22 10:09:46 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_slot_sweep): need to add empty RVALUE as freeobj.
-
-Mon Jul 22 09:48:31 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (eval_string_with_cref): use the given file name unless
-	  eval even if scope is given.  additional fix for [Bug #8436].
-	  based on the patch by srawlins at [ruby-core:56099] [Bug #8662].
-
-Mon Jul 22 09:24:19 2013  Kouji Takao  <kouji@takao7.net>
-
-	* ext/readline/readline.c (Init_readline): added
-	  Readline.delete_text. [ruby-dev:45789] [Feature #6626]
-	* ext/readline/extconf.rb: check for rl_delete_text() in Readline library.
-
-	  Thanks, Nobuyoshi Nakada, for the patch.
-
-Mon Jul 22 03:15:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/date/date_parse.c (rfc2822_cb): check if wday is given, since it
-	  can be omitted.
-
-Mon Jul 22 00:15:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_sq_fast): Refine expressions.
-
-Sun Jul 21 21:08:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): Use simple multiplication if yl is small.
-	  (rb_cstr_to_inum): Invoke bigsq instead of bigmul0.
-	  (bigsq): Re-implemented.
-	  (bigmul0): Invoke bigsq if two arguments are identical.
-
-Sun Jul 21 09:58:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_toom3): New function based on bigmul1_toom3.
-	  (bary_mul_toom3_branch): Call bary_mul_toom3.
-	  (rb_big_mul_toom3): Ditto.
-	  (bigmul1_toom3): Removed.
-	  (big_real_len): Ditto.
-	  (big_split): Ditto.
-	  (big_split3): Ditto.
-
-Sun Jul 21 08:12:16 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* proc.c (proc_to_s): use PRIsVALUE to preserve the result encoding.
-
-Sun Jul 21 03:36:18 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* hash.c (rb_hash_flatten): use NUM2INT to raise TypeError on 32bit
-	  platform. it's introduced by r42039
-
-Sun Jul 21 01:07:45 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* common.mk (help): Fix environment variable name and argument.
-	  Actually it can also be a directory or any argument for
-	  test/unit runner. [Fixes GH-363]
-
-Sat Jul 20 22:44:50 2013  Zachary Scott  <e@zzak.io>
-
-	* common.mk: Document running a single test [Fixes GH-363]
-	  Patch by Avdi Grimm https://github.com/ruby/ruby/pull/363
-
-Sat Jul 20 22:39:56 2013  Zachary Scott  <e@zzak.io>
-
-	* sample/*: whitespace patch by Sergio Campama [Fixes GH-364]
-	  https://github.com/ruby/ruby/pull/364
-
-Sat Jul 20 22:33:13 2013  Zachary Scott  <e@zzak.io>
-
-	* doc/regexp.rdoc: [DOC] Fix typo in example [Fixes GH-365]
-	  Patch by Juanito Fatas https://github.com/ruby/ruby/pull/365
-
-Sat Jul 20 17:46:03 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (rb_str_succ): add missing case NEIGHBOR_WRAPPED.
-	  r42078 caused buggy behavior like "\xFF".b -> "\x01\xFF".b
-
-Sat Jul 20 15:22:38 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (rb_ary_resize): use simple memcpy because there are no new
-	  references.
-
-Sat Jul 20 15:02:51 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* safe.c (ruby_safe_level_4_warning): define for old extension
-	  libraries.  [Bug #8652]
-
-Sat Jul 20 14:38:00 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_make_shared): make shared array shady.
-	  Making non-shady shared array causes SEGV (see rubyci).
-	  It seems a bug around shared array.
-
-Sat Jul 20 12:14:07 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (enc_succ_char, enc_pred_char): consider wchar case.
-	  [ruby-core:56071] [Bug #8653]
-
-	* string.c (rb_str_succ): do not replace with invalid char.
-
-	* encoding.c (rb_enc_code_to_mbclen): add new function which returns
-	  mbclen from codepoint like as rb_enc_codelen() but 0 for invalid
-	  char.
-
-	* include/ruby/encoding.h (rb_enc_code_to_mbclen): declaration and
-	  shortcut macro.
-
-Fri Jul 19 21:59:12 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: declare type_name() at the beginning of file.
-
-Fri Jul 19 21:35:09 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c: reduce shady operations.
-
-	* array.c (rb_ary_modify, ary_make_partial, rb_ary_splice,
-	  rb_ary_replace, rb_ary_eql, rb_ary_compact_bang):
-	  use RARRAY_RAWPTR() instead of RARRAY_PTR().
-
-	* array.c (rb_ary_shift): use RARRAY_PTR_USE() without WB because
-	  there are not new relations.
-
-	* array.c (ary_ensure_room_for_unshift): ditto.
-
-	* array.c (rb_ary_sort_bang): ditto.
-
-	* array.c (rb_ary_delete_at): ditto.
-
-	* array.c (rb_ary_reverse_m): use RARRAY_RAWPTR() because
-	  there are not new relations.
-
-Fri Jul 19 20:58:20 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c: reduce shade operations.
-
-	* array.c (rb_ary_modify): use RARRAY_RAWPTR().
-
-	* array.c (ary_make_substitution, rb_ary_s_create, ary_make_partial,
-	  rb_ary_splice, rb_ary_resize, rb_ary_rotate_m, rb_ary_times):
-	  use ary_memcpy().
-
-Fri Jul 19 19:55:28 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_mem_clear): added. This operation doesn't need WB
-	  because this operation creates a reference to Qnil.
-
-	* array.c (ary_make_shared, rb_ary_store, rb_ary_shift_m,
-	  rb_ary_splice, rb_ary_resize, rb_ary_fill): use ary_mem_clear()
-	  instead of rb_mem_clear().
-
-	* array.c (ary_make_shared): use RARRAY_RAWPTR() instead of RARRAY_PTR().
-
-Fri Jul 19 19:18:51 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c: fix commit miss.
-	  RGENGC_UNPROTECT_LOGGING should be 0.
-
-Fri Jul 19 19:15:30 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (rb_ary_resurrect): use RARRAY_RAWPTR() because there is no
-	  writing.
-
-	* array.c (rb_ary_new_from_values): use ary_memcpy().
-
-Fri Jul 19 19:07:31 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_memcpy): add a function to copy VALUEs into ary
-	  with write barrier. If ary is promoted, use write barrier correctly.
-
-	* array.c (rb_ary_cat, rb_ary_unshift_m, rb_ary_dup,
-	  rb_ary_sort_bang, rb_ary_replace, rb_ary_plus): use ary_memcpy().
-
-Fri Jul 19 15:32:57 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (rb_ary_store): use RARRAY_PTR_USE() instead of RARRAY_PTR().
-	  Clearing memory space doesn't need WBs.
-
-Fri Jul 19 15:19:37 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_ensure_room_for_push): use RARRAY_RAWPTR() instead of
-	  RARRAY_PTR. In this code, there are no "write" operation.
-
-	* array.c (rb_ary_equal): ditto.
-
-	* array.c (recursive_equal): ditto.
-
-Fri Jul 19 15:09:22 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c, internal.h (rb_gc_writebarrier_remember_promoted): add a new
-	  function to remember an specified object. This api is only
-	  experimental (strongly depend on WB/rgengc strategy).
-
-Fri Jul 19 14:56:00 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_unprotect_logging): use (void *) for first parameter
-	  because VALUE is not defined before including ruby/ruby.h.
-
-Fri Jul 19 14:19:48 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/pathname/pathname.c (path_inspect): use PRIsVALUE to preserve
-	  the result encoding.
-
-Fri Jul 19 12:35:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/socket/test_tcp.rb (test_initialize_failure): Use EADDRNOTAVAIL
-	  to test an error message generated by bind() failure.
-
-Fri Jul 19 11:27:38 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/racc/parser.rb: [DOC] Capitalize "Ruby" in documentation
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-
-Fri Jul 19 11:26:28 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/psych/lib/psych*: [DOC] Capitalize "Ruby" in documentation
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-
-Fri Jul 19 11:25:12 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rdoc/*: [DOC] Capitalize "Ruby" in documentation
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-
-Fri Jul 19 11:23:55 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rubygems*: [DOC] Capitalize "Ruby" in documentation
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-
-Fri Jul 19 11:16:54 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#to_set): Define Set#to_set so that aSet.to_set
-	  returns self. [Fixes GH-359]
-
-Fri Jul 19 11:10:23 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rake/*: [DOC] Capitalize "Ruby" in documentation
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-
-Fri Jul 19 01:04:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/-test-/bignum/intpack.c: Renamed from ext/-test-/bignum/pack.c.
-	  (Init_intpack): Renamed from Init_pack.
-	  Reported by Naohisa Goto.  [ruby-dev:47526] [Bug #8655]
-
-Fri Jul 19 00:54:27 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* test/ruby/test_array.rb (test_count): add a test case for #count
-	  with an argument. See Bug #8654.
-
-Thu Jul 18 23:45:06 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_eql): compare RARRAY_PTR() for performance
-	  improvement in case of that self and other are shared.
-
-Thu Jul 18 22:46:42 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/cgi.rb: [DOC] Capitalize "Ruby" in documentation [Fixes GH-341]
-	  Patch by Dave Worth https://github.com/ruby/ruby/pull/341
-	* lib/webrick.rb: ditto
-	* lib/scanf.rb: ditto
-	* lib/xmlrpc/config.rb: ditto
-	* lib/resolv.rb: ditto
-	* lib/e2mmap.rb: ditto
-	* lib/fileutils.rb: ditto
-	* lib/mkmf.rb: ditto
-	* lib/cgi/session.rb: ditto
-	* lib/yaml.rb: ditto
-	* lib/erb.rb: ditto
-	* lib/irb.rb: ditto
-	* lib/tracer.rb: ditto
-	* lib/net/http.rb: ditto
-	* ext/syslog/lib/syslog/logger.rb: ditto
-	* sample/pty/expect_sample.rb: ditto
-
-Thu Jul 18 21:30:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_sq_fast): Specialize the last iteration of the
-	  outer loop.
-	  (bigfixize): A condition simplified.
-
-Thu Jul 18 21:15:41 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_equal): compare RARRAY_PTR() for performance
-	  improvement in case of that self and other are shared.
-
-Thu Jul 18 20:44:51 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_fill): use memfill().
-
-Thu Jul 18 20:35:14 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* array.c (rb_ary_count): check length to avoid SEGV
-	  while iterating. Remove other pointer loop when arg is given.
-
-	* test/ruby/test_array.rb (test_count): add test for bug.
-	  [ruby-core:56072] [Bug #8654]
-
-Thu Jul 18 18:14:36 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* array.c (rb_ary_count): iterate items appropriately.
-	  [Bug #8654]
-
-Thu Jul 18 17:35:41 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_flatten): performance improvement by not using
-	  rb_hash_to_a() to avoid array creation with rb_assoc_new().
-
-Thu Jul 18 16:16:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c: add logging feature for RGenGC's write barrier unprotect
-	  event.
-
-Thu Jul 18 15:45:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (RUBY_SAFE_LEVEL_CHECK): make only
-	  rb_set_safe_level(4) an error always but make rb_secure(4) an error
-	  only in the core.  [ruby-dev:47517] [Bug #8652]
-
-Thu Jul 18 15:42:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: fix spell miss.
-
-Thu Jul 18 15:11:11 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (ruby_safe_level_4): get rid of special
-	  character.  [ruby-dev:47512] [misc #8646]
-
-Thu Jul 18 14:51:39 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (ary_alloc): slim setup process.
-
-Thu Jul 18 14:37:57 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* string.c (str_alloc): no need to clear RString (already cleared).
-
-Thu Jul 18 12:57:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BDIGITS_ZERO): Defined.
-	  (bary_pack): Use BDIGITS_ZERO.
-	  (bary_unpack): Ditto.
-	  (bary_mul_single): Ditto.
-	  (bary_mul_normal): Ditto.
-	  (bary_sq_fast): Ditto.
-	  (bary_mul_balance_with_mulfunc): Ditto.
-	  (bary_mul_precheck): Ditto.
-	  (bary_mul_toom3_branch): Ditto.
-	  (rb_cstr_to_inum): Ditto.
-	  (big_shift3): Ditto.
-	  (bigmul1_toom3): Ditto.
-	  (bary_divmod): Ditto.
-
-Thu Jul 18 06:30:02 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: rename gc related functions with prefix "gc_".
-	  * before_gc_sweep() -> gc_before_sweep().
-	  * after_gc_sweep()  -> gc_after_sweep().
-	  * lazy_sweep()      -> gc_lazy_sweep().
-	  * rest_sweep()      -> gc_rest_sweep().
-	  * slot_sweep()      -> gc_slot_sweep().
-
-	* gc.c: rename a heap management function with prefix "heap_".
-	  * get_freeobj() -> heap_get_freeobj().
-
-	* gc.c: rename markable_object_p() to is_markable_object().
-
-Wed Jul 17 22:57:40 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (delete_if_i): use ST_DELETE.
-
-Wed Jul 17 22:34:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: An static assertion for relation of SIZEOF_LONG and
-	  SIZEOF_BDIGITS is added.
-	  (bary_mul_precheck): Reduce comparisons.
-	  (bary_mul): Invoke bary_sq_fast or bary_mul1 if the bignum size is
-	  small.
-	  (bigfixize): Resize the argument bignum here.
-	  (bignorm): Don't call bigtrunc after bigfixize.
-
-Wed Jul 17 22:13:26 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_replace): performance improvement by using
-	  st_copy().
-
-Wed Jul 17 17:19:54 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: rename heap management functions with prefix "heap_".
-	  * allocate_sorted_array() -> heap_allocate_sorted_array().
-	  * slot_add_freeobj()      -> heap_slot_add_freeobj().
-	  * assign_heap_slot()      -> heap_assign_slot().
-	  * add_heap_slots()        -> heap_add_slots().
-	  * init_heap()             -> heap_init().
-	  * set_heap_increment()    -> heap_set_increment().
-
-	* gc.c (initial_expand_heap): inlined in rb_gc_set_params().
-
-Wed Jul 17 17:12:23 2013  Matthew M. Boedicker  <matthewm@boedicker.org>
-
-	* hash.c (env_fetch): Add key name to message on ENV.fetch KeyError,
-	  as well as Hash#fetch.  [ruby-core:56062] [Feature #8649]
-
-Wed Jul 17 15:59:33 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: catch up last changes for debugging/checking mode.
-
-Wed Jul 17 15:50:10 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_objspace_free): free slot itself.
-
-	* gc.c (objspace_each_objects): fix condition.
-	  Use slot->body instead of slot.
-
-	* gc.c (count_objects): use "slot" variable.
-
-Wed Jul 17 15:21:10 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (unlink_heap_slot): fix memory leak.
-	  free slot itself at free_heap_slot().
-
-	  Reproduce-able code is here:
-	    N1 = 100_000; N2 = 1_000_000
-	    N1.times{ary = []; N2.times{ary << ''}}
-	  Maybe this problem is remaining in Ruby 2.0.0.
-
-	* gc.c (unlink_heap_slot): remove not working code.
-
-Wed Jul 17 14:31:13 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: re-design the heap structure.
-
-	  (1) The heap is consists of a set of slots.
-	  (2) Each "slot" has a "slot_body".
-	      slot::start and slot::limit specify RVALUE beginning address
-	      and number of RVALUE in a "slot_body".
-	  (3) "slot_body" contains a pointer to slot (slot_body::header::slot)
-	      and an array of RVALUE.
-	  (4) heap::sorted is an array of "slots", sorted by an address of
-	      slot::body.
-
-	  See https://bugs.ruby-lang.org/projects/ruby-trunk/wiki/GC_design
-	  for more details (figure).
-
-	* gc.c: Avoid "heaps" terminology. It is ambiguous.
-
-Wed Jul 17 13:29:16 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: fix heaps_header and heaps_slot to reduce memory consumption.
-	  (1) move heaps_header::start and limit to  heaps_slot.
-	  (2) remove heaps_header::end which can be calculated by start+limit.
-
-	* gc.c: catch up above change.
-
-Wed Jul 17 12:30:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/st.h (st_strcasecmp): Macro defined for compatibility.
-	  (st_strncasecmp): Ditto.
-
-Wed Jul 17 11:57:45 2013  Takeyuki FUJIOKA  <xibbar@ruby-lang.org>
-
-	* lib/cgi/util.rb (CGI::Util#escape, unescape): Avoid use of regexp
-	  special global variable. [Feature #8648] Thanks to fotos.
-
-Wed Jul 17 11:57:10 2013  Takeyuki FUJIOKA  <xibbar@ruby-lang.org>
-
-	* lib/erb.rb (ERB::Util#url_encode): Avoid use of regexp special global
-	  variable. [Feature #8648] Thanks to fotos.
-
-Wed Jul 17 08:12:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* st.c (st_locale_insensitive_strcasecmp): Renamed from st_strcasecmp.
-	  (st_locale_insensitive_strncasecmp): Renamed from st_strncasecmp.
-
-	* include/ruby/st.h: Follow above changes.
-
-	* include/ruby/ruby.h: Ditto.
-
-Wed Jul 17 00:14:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigmul1_toom3): Use bigdivrem_single instead of bigdivrem.
-	  (big_three): Removed.
-	  (Init_Bignum): Don't initialize big_three.
-
-Tue Jul 16 21:46:03 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* configure.in: revert r42008. strcasecmp() uses the current locale.
-
-	* include/ruby/ruby.h: ditto.
-
-	* st.c (st_strcasecmp): ditto.
-
-Tue Jul 16 21:07:04 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* configure.in: check strcasecmp().
-
-	* include/ruby/ruby.h: use strcasecmp() as st_strcasecmp() if it
-	  exists.
-
-	* st.c (st_strcasecmp): define the function only if strcasecmp()
-	  doesn't exist.
-
-Tue Jul 16 20:21:28 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigsq): Renamed from bigsqr.
-
-Tue Jul 16 19:42:08 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (USHORT): Unused macro removed.
-
-Tue Jul 16 19:18:51 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: slim a path of newobj_of().
-
-	* gc.c (objspace): add a new field objspace::freelist, which contains
-	  available RVALUEs.
-
-	* gc.c (newobj_of): simply call new function `get_freeobj()'.
-	  get_freeobj() returns objspace::freelist. If  objspace::freelist
-	  is not available, refill objspace::freelist with a slot pointed by
-	  objspace::heap::free_slots.
-
-	* gc.c (before_gc_sweep): clear objspace::freelist.
-
-	* gc.c (slot_sweep): clear slot::freelist.
-
-	* gc.c (heaps_prepare_freeslot): renamed to heaps_prepare_freeslot.
-
-	* gc.c (unlink_free_heap_slot): remove unused function.
-
-	* gc.c (rb_free_const_table): remove unused function.
-
-Tue Jul 16 19:05:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big_shift3): Big shift width is not a problem for right
-	  shift.
-
-Tue Jul 16 18:50:08 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_count): [DOC] fix typo.  Array#count uses ==, not
-	  ===.  a question at asakusa.rb ML.
-
-Tue Jul 16 18:35:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_karatsuba): Avoid duplicate calculation when
-	  squaring.
-	  (bary_mul_toom3_branch): Ditto.
-
-Tue Jul 16 17:43:22 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (link_free_heap_slot): removed.
-
-	* gc.c (slot_sweep): use `heaps_add_freeslot' instead of
-	  `link_free_heap_slot'.
-
-	* gc.c (assign_heap_slot): use local variable `slot' instead of
-	  `heaps'.
-
-Tue Jul 16 17:21:39 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (assign_heap_slot): refactoring variable names.
-
-	* gc.c (slot_add_freeobj): added.
-
-	* gc.c (heaps_add_freeslot): added.
-
-	* gc.c (finalize_list, rb_gc_force_recycle, slot_sweep): use
-	  `slot_add_freeobj' instead of modifying linked list directly.
-
-Tue Jul 16 16:30:58 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (lazy_sweep): refactoring.
-
-Tue Jul 16 13:32:06 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (enc_set_index): since r41967, old terminator is dealt
-	  with in str_fill_term().  should not consider it here because this
-	  function is called before any encoding is set.
-
-Tue Jul 16 11:12:03 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* proc.c (rb_block_arity): raise ArgumentError if no block given.
-
-Tue Jul 16 08:15:22 2013  Zachary Scott  <e@zzak.io>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb: [DOC] document top-level
-	  classes from BigDecimal utils native extensions
-
-Tue Jul 16 03:23:03 2013  Zachary Scott  <e@zzak.io>
-
-	* numeric.c: [DOC] improve rdoc formatting for parameters and links
-
-Mon Jul 15 14:40:00 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_big2str0): Deprecated.
-
-	* bignum.c (rb_big2str1): Renamed from rb_big2str0.
-	  (rb_big2str0): Deprecated wrapper for rb_big2str1.
-	  (rb_big2str): Invoke rb_big2str1 instead of rb_big2str0.
-
-Mon Jul 15 14:13:02 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* struct.c (rb_struct_each_pair): use rb_yield_values(2, key, value)
-	  instead of rb_yield(rb_assoc_new(key, value)) if rb_block_arity()
-	  is greater than 1.
-
-Mon Jul 15 13:46:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Add static assertions.
-
-Mon Jul 15 13:36:02 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_each_pair): performance improvement by using
-	  rb_block_arity().
-
-Mon Jul 15 13:15:37 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* proc.c (rb_block_arity): create internal API rb_block_arity().
-	  it returns arity of given block.
-
-Mon Jul 15 13:07:27 2013  Yuki Yugui Sonoda  <yugui@yugui.jp>
-
-	* lib/prime.rb (Prime::EratosthenesGenerator,
-	  Prime::EratosthenesSieve): New implementation by
-	  robertjlooby <robertjlooby AT gmail.com>.
-
-	* test/test_prime.rb: updated with new method name
-
-Mon Jul 15 11:32:46 2013  Zachary Scott  <e@zzak.io>
-
-	* numeric.c (rb_cNumeric): [DOC] Added comment for Numeric to fix doc
-
-Mon Jul 15 11:24:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (maxpow_in_bdigit_dbl): Useless #if removed.
-
-Mon Jul 15 11:10:46 2013  Zachary Scott  <e@zzak.io>
-
-	* bignum.c (rb_big_coerce): [DOC] Add docs for Bignum#coerce
-	  Based on patch by Juanito Fatas [Fixes GH-360]
-	  https://github.com/ruby/ruby/pull/360
-
-Mon Jul 15 10:56:01 2013  Zachary Scott  <e@zzak.io>
-
-	* thread.c (mutex_sleep): [DOC] Awake thread will reacquire lock
-	  By Tim Abdulla [Fixes GH-342] https://github.com/ruby/ruby/pull/342
-
-Mon Jul 15 10:45:09 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (nlz16): Use __builtin_clz if possible.
-	  (nlz32): Use __builtin_clz or __builtin_clzl if possible.
-	  (nlz64): Use __builtin_clzl or __builtin_clzll if possible.
-	  (nlz128): Use __builtin_clzll if possible.
-
-	* configure.in: Check __builtin_clz, __builtin_clzl and
-	  __builtin_clzll.
-
-Mon Jul 15 09:39:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (power_cache_get_power): Use bitsize instead of ceil_log2.
-	  (ones): Removed.
-	  (next_pow2): Removed.
-	  (floor_log2): Removed.
-	  (ceil_log2): Removed.
-
-	* configure.in (__builtin_popcountl): Don't check.
-
-Mon Jul 15 02:47:09 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* localeinit.c (rb_locale_charmap, Init_enc_set_filesystem_encoding):
-	  move from encoding.c.
-
-	* miniinit.c (rb_locale_charmap, Init_enc_set_filesystem_encoding):
-	  define miniruby specific functions only.
-
-Mon Jul 15 02:32:58 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (rb_enc_init): no longer needs NO_PRESERVED_ENCODING.
-
-	* encoding.c (enc_inspect): defer loading autoloaded encoding.
-
-	* encoding.c (enc_check_encoding): use is_data_encoding() to check
-	  type consistently.
-
-	* encoding.c (must_encoding): return rb_encoding* instead of encoding
-	  index.
-
-	* encoding.c (enc_check_encoding): use is_data_encoding() to check
-	  type consistently.
-
-	* encoding.c (must_encoding): return rb_encoding* instead of encoding
-	  index.
-
-Mon Jul 15 02:21:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (str_fill_term): consider old terminator length, and should
-	  not use rb_enc_ascget since it depends on the current encoding which
-	  may not be compatible with the new terminator.  [Bug #8634]
-
-	* encoding.c (enc_inspect): use PRIsVALUE to preserve the result
-	  encoding.
-
-Sun Jul 14 23:21:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Check __builtin_popcountl, __builtin_bswap32 and
-	  __builtin_bswap64.
-
-	* internal.h (swap32): Use the configure result for the condition to
-	  use __builtin_bswap32.
-	  (swap64): Use the configure result for the condition to use
-	  __builtin_bswap64.
-
-	* bignum.c (ones): Use the configure result for the condition to use
-	  __builtin_popcountl.
-	  (bary_unpack_internal): Use appropriate types for swap argument.
-
-Sun Jul 14 22:21:11 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_subb): Support xn < yn.
-	  (bigsub_core): Removed.
-	  (bigsub): Don't compare before subtraction.  Just subtract and
-	  get the two's complement if the subtraction causes a borrow.
-
-Sun Jul 14 00:36:03 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (DIGSPERLONG): Unused macro removed.
-	  (DIGSPERLL): Ditto.
-
-Sun Jul 14 00:32:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_aref): Less scan when the number is negative.
-
-Sun Jul 14 00:17:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big_shift): Avoid signed integer overflow.
-
-Sun Jul 14 00:14:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_precheck): Use bary_small_lshift or
-	  bary_mul_normal if xl is 1.
-
-Sat Jul 13 22:58:16 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big_shift3): New function.
-	  big_lshift and big_rshift are merged.
-	  (big_shift2): New function.
-	  (big_lshift): Use big_shift3.
-	  (big_rshift): Ditto.
-	  (check_shiftdown): Removed.
-	  (rb_big_lshift): Use big_shift2 and big_shift3.
-	  (rb_big_rshift): Ditto.
-	  (big_lshift): Removed.
-	  (big_rshift): Ditto.
-
-Sat Jul 13 15:51:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_small_lshift): Use size_t instead of long.
-	  (bary_small_rshift): Ditto.
-
-Sat Jul 13 15:33:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_small_lshift): Functions moved to remove
-	  declaration.
-	  (bary_small_rshift): Ditto.
-
-Sat Jul 13 12:27:34 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (rb_enc_associate_index): fill new terminator length, not
-	  old one.
-
-Sat Jul 13 12:24:24 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/win32: move from ext/dl and ext/fiddle.  since ext/extmk.rb
-	  builds extensions in alphabetical order, compiled?('fiddle') under
-	  ext/dl makes no sense.
-
-Sat Jul 13 09:26:09 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (biglsh_bang): Removed.
-	  (bigrsh_bang): Ditto.
-	  (bigmul1_toom3): Use bary_small_lshift and bary_small_rshift.
-
-Sat Jul 13 01:04:43 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/rubygems/psych_additions.rb: Ignore Psych docs here
-
-Fri Jul 12 18:10:46 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/fiddle/win32/lib/win32/registry.rb
-	  (Win32::Registry::API#make_wstr): same as r41922.
-
-Fri Jul 12 16:28:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (rb_enc_associate_index): refill the terminator if it
-	  becomes longer than before.  [ruby-dev:47500] [Bug #8624]
-
-	* string.c (str_null_char, str_fill_term): get rid of out of bound
-	  access.
-
-	* string.c (rb_str_fill_terminator): add a parameter for the length of
-	  new terminator.
-
-Fri Jul 12 11:26:25 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_reject_bang): do not call rb_hash_foreach() if RHash
-	  has ntbl and it is empty.
-
-Fri Jul 12 11:17:41 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (recursive_hash): use RHASH_SIZE() to check hash size.
-
-Fri Jul 12 00:20:00 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_size): use RHASH_SIZE().
-
-Fri Jul 12 00:08:24 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_values): set array capa to RHASH_SIZE().
-
-Thu Jul 11 23:54:45 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* hash.c (rb_hash_keys): set array capa to RHASH_SIZE().
-
-Thu Jul 11 21:30:17 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_pow): undef pow to get rid of infinite
-	  recursive call.  re-fix [Bug #8495].  [ruby-core:55923] [Bug #8621]
-
-Thu Jul 11 20:18:13 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/win32/lib/win32/registry.rb (Win32::Registry::API#make_wstr):
-	  remove workaround to append WCHAR terminator.
-
-	* transcode.c (str_encode_associate): fill terminator after conversion.
-
-	* string.c (rb_enc_str_new, rb_str_set_len, rb_str_resize): fill
-	  minimum length of the encoding as the terminator.
-
-	* string.c (str_buf_cat, rb_str_buf_append, rb_str_splice_0): ditto.
-
-	* string.c (str_make_independent_expand, rb_str_modify_expand): make
-	  the capacity enough for multi-byte terminator.
-
-	* string.c (rb_string_value_cstr): fill minimum length of the encoding
-	  as the terminator.
-
-	* string.c (rb_string_value_cstr): check null char in char, not in
-	  byte.
-
-Thu Jul 11 14:48:35 2013  Zachary Scott  <e@zzak.io>
-
-	* array.c: Replace confusing example for #reverse_each in overview
-	  Patch by Earl St Sauver [Fixes documenting-ruby/ruby-12]
-	  https://github.com/documenting-ruby/ruby/pull/12
-
-Thu Jul 11 14:22:37 2013  Zachary Scott  <e@zzak.io>
-
-	* test/drb/ut_eq.rb: Use localhost for drb tests [Bug #7311]
-	  Patch by Vit Ondruch [ruby-core:49101]
-	* test/drb/ut_array.rb: ditto
-	* test/drb/ut_array_drbssl.rb: ditto
-
-Thu Jul 11 13:48:03 2013  Zachary Scott  <e@zzak.io>
-
-	* sprintf.c: Fix typo patch by @hynkle [Fixes GH-357]
-	  https://github.com/ruby/ruby/pull/357
-
-Thu Jul 11 13:00:34 2013  Zachary Scott  <e@zzak.io>
-
-	* lib/securerandom.rb: Refactor conditions by Rafal Chmiel
-	  [Fixes GH-326] https://github.com/ruby/ruby/pull/326
-
-Thu Jul 11 12:04:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Don't use toom3 after once karatsuba is chosen.
-	  (mulfunc_t): New type.
-	  (bary_mul_toom3_start): Renamed from bary_mul.
-	  (bary_mul_karatsuba_start): Renamed from bary_mul.
-	  (bary_mul_balance_with_mulfunc): Renamed from bary_mul_balance and
-	  new argument, mulfunc, is added.
-	  (rb_big_mul_balance): Invoke bary_mul_balance_with_mulfunc with
-	  bary_mul_toom3_start.
-	  (bary_mul_karatsuba): Invoke bary_mul_karatsuba_start instead of
-	  bary_mul.
-	  (bary_mul_precheck): Extracted from bary_mul.
-	  (bary_mul_karatsuba_branch): Extracted from bary_mul.
-	  (bary_mul_karatsuba_start): New function to call bary_mul_precheck
-	  and bary_mul_karatsuba_branch.
-	  (bary_mul_toom3_branch): Extracted from bary_mul.
-	  (bary_mul_toom3_start): New function to call bary_mul_precheck and
-	  bary_mul_toom3_branch.
-	  (bary_mul): Just call bary_mul_toom3_start.
-	  Arguments for work memory are removed.
-	  (rb_cstr_to_inum): Follow the bary_mul change.
-	  (bigmul0): Ditto.
-
-Thu Jul 11 10:46:38 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/probes_to_wiki.rb: fix usage comment.  use Enumerable#grep
-	  which yields each elements to reduce unnecessary array.
-
-Thu Jul 11 10:09:18 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* process.c (rb_daemon): daemon(3) is implemented with fork(2).
-	  Therefore it needs rb_thread_atfork(). (and revert r41903)
-
-Thu Jul 11 03:22:10 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* tool/probes_to_wiki.rb: adding a script to convert probes.d to wiki
-	  format for easy wiki updates.
-
-Thu Jul 11 00:54:07 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* man/ri.1: Incorrect use of .Dd macro [Bug #8620] by Tristan Hill
-
-Thu Jul 11 00:48:29 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/delegate.rb: Add example for __setobj__ and __getobj__
-	  [Bug #8615] Patch by Caleb Thompson
-
-Wed Jul 10 23:29:22 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/logger.rb: Use :call-seq: for method signature rdoc
-
-Wed Jul 10 23:23:18 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/logger.rb (#add): Remove incorrect rdoc for return value
-	  [Bug #8567] Reported by Tim Pease.
-
-Wed Jul 10 23:12:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_subpos): make public function.
-
-Wed Jul 10 22:44:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Add a static assertion for RBIGNUM_EMBED_LEN_MAX.
-
-Wed Jul 10 22:31:25 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* string.c (rb_str_index): cache single byte flag and some
-	  cosmetic changes.
-
-Wed Jul 10 22:03:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_2comp): Don't use bary_plus_one.
-	  (bary_add_one): Replaced by the implementation of bary_plus_one.
-
-Wed Jul 10 20:48:22 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (sizeof_bdigit_dbl): check sizeof(BDIGIT_DBL).
-
-	* internal.h (STATIC_ASSERT): move from enum.c.
-
-Wed Jul 10 20:08:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (SIZEOF_BDIGIT_DBL): Add a ifdef guard for test.
-
-Wed Jul 10 14:18:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (fork_daemon): kill the other threads all and abandon the
-	  kept mutexes.
-
-Wed Jul 10 11:35:36 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/net/http/test_http.rb (TestNetHTTP_v1_2#test_get,
-	  TestNetHTTP_v1_2_chunked#test_get): shouldn't check
-	  HttpResponse#decode_content if Zlib is not available.
-	  ko1 complained via IRC.
-
-Wed Jul 10 10:20:07 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/rbinstall.rb: always require rubygems to stabilize rubygems
-	  related status like whether Gem::Specification is defined or not.
-
-	* tool/rbinstall.rb (Gem::Specification.unresolved_deps): define stub.
-
-Wed Jul 10 08:21:15 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems 2.1
-	* test/rubygems:  Ditto.
-
-Wed Jul 10 07:34:34 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/ext/ext_conf_builder.rb:  Remove siteconf file after
-	  building the gem.
-	* test/rubygems/test_gem_ext_ext_conf_builder.rb:  Test for the above.
-
-	* lib/rubygems/psych_tree.rb (module Gem):  Add backward compatibility
-	  for r41148
-
-	* test/rubygems/test_gem_package.rb:  Add backward compatibility for
-	  double-slash elimination.
-
-Wed Jul 10 06:22:27 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_parse.c (date_zone_to_diff): [ruby-core:55831].
-
-Wed Jul 10 00:41:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): x*1 is x.
-
-Tue Jul  9 22:24:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul1): No need to invoke MEMZERO at last.
-	  (bary_mul_single): Invoke MEMZERO here.
-
-Tue Jul  9 21:40:01 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/rexml/test_text.rb: Add missing tests for Text#<<.
-	  Reported by nagachika. Thanks!!!
-
-Tue Jul  9 18:02:38 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/fileutils.rb (FileUtils#chown_R): Do not skip traversal even
-	  if user and group are both nil, to be consistent with #chown and
-	  other commands.
-
-Tue Jul  9 17:58:26 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/fileutils/test_fileutils.rb
-	  (TestFileUtils#assert_output_lines): New utility assertion
-	  method for testing verbose output.
-
-Tue Jul  9 17:43:57 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* test/test_tracer.rb: catch up recent rubygems changes.
-
-Tue Jul  9 16:58:30 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb: hope that the final
-	  resolution to fix the failure of test-all.  and includes Win64
-	  support (fixed a potential bug).
-
-Tue Jul  9 15:57:20 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* object.c: Fix rdoc for Kernel#<=>. [Fixes GH-352]
-
-Tue Jul  9 15:53:51 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/fileutils.rb (FileUtils#mode_to_s): Define mode_to_s() also
-	  as singleton method, or FileUtils.chmod fails in verbose mode.
-
-Tue Jul  9 15:16:02 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/fileutils/fileasserts.rb
-	  (Test::Unit::FileAssertions#assert_not_symlink): Add a missing
-	  optional argument "message".
-
-Tue Jul  9 15:03:24 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/fileutils.rb (FileUtils#chown, FileUtils#chown_R): If user
-	  and group are both nil, print ":".
-
-Tue Jul  9 12:47:08 2013  Masaki Matsushita  <glass.saga@gmail.com>
-
-	* io.c (appendline): use READ_CHAR_PENDING_XXX macros and
-	  RSTRING_END().
-
-	* io.c (rb_io_getline_1): rewrite nested if statement into one
-	  statement.
-
-Tue Jul  9 11:04:35 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb (Win32::Registry#check):
-	  should report the position of the error.
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb
-	  (Win32::Registry#QueryValue): workaround for test-all crash.
-
-Tue Jul  9 10:27:56 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb
-	  (Win32::Registry.expand_environ): use suitable encoding for the
-	  string.
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb (Win32::Registry#read):
-	  should return REG_SZ, REG_EXPAND_SZ and REG_MULTI_SZ values with
-	  the expected encoding -- assumed as the same encoding of name.
-
-Tue Jul  9 10:02:45 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/{dl,fiddle}/win32/lib/win32/registry.rb
-	  (Win32::Registry::Error#initialize): use suitable encoding for the
-	  string.
-
-Tue Jul  9 09:46:53 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/dl/win32/lib/win32/registry.rb (Win32::Registry.expand_environ):
-	  use suitable encoding for the string.  fixed a test-all error of
-	  r41838.
-
-	* ext/fiddle/win32/lib/win32/registry.rb: same changes of r41838 and
-	  this revision of dl's win32/registry.rb.
-
-Tue Jul  9 07:39:45 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 2.0.4.  See
-	  https://github.com/rubygems/rubygems/blob/2.0/History.txt for changes
-
-Tue Jul  9 01:47:16 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (biglsh_bang): Don't shift a BDIGIT with BITSPERDIG bits.
-	  (bigrsh_bang): Ditto.
-
-Tue Jul  9 01:17:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigrsh_bang): Fix bignum digits overrun.
-
-Tue Jul  9 00:46:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (biglsh_bang): Fix bignum digits under-run.
-
-Mon Jul  8 23:36:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/win32/lib/win32/registry.rb (Error, API): use WCHAR
-	  interfaces.  c.f. [Bug #8508]
-
-Mon Jul  8 23:13:11 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_pow): move from win32.h and disable strict
-	  ANSI mode macro to let _controlfp() stuff defined.
-	  [ruby-core:55312] [Bug #8495]
-
-	* numeric.c (finite): add declaration for strict ANSI.
-	  [ruby-core:55312] [Bug #8495]
-
-	* thread_win32.c (w32_thread_start_func, thread_start_func_1),
-	  (timer_thread_func): use __stdcall instead of _stdcall which is
-	  unavailable in strict ANSI mode.  [ruby-core:55312] [Bug #8495]
-
-	* win32/win32.c (gettimeofday): use __cdecl instead of _cdecl.
-
-Mon Jul  8 22:41:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): Arguments for work memory added.
-	  (bary_mul_balance): Ditto.
-	  (bary_mul_karatsuba): Ditto.
-
-Mon Jul  8 22:03:30 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_sq_fast): New function for testing.
-	  (rb_big_mul_toom3): Ditto.
-
-	* internal.h (rb_big_sq_fast): Declared.
-	  (rb_big_mul_toom3): Ditto.
-
-Mon Jul  8 21:59:34 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_balance): Initialize a local variable to suppress
-	  a warning.
-
-Mon Jul  8 20:55:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_balance): Reduce work memory.
-
-Mon Jul  8 08:26:15 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* test/openssl/test_pkey_ec.rb: Skip tests for "Oakley" curves as
-	  they are not suitable for ECDSA.
-	  [ruby-core:54881] [Bug #8384]
-
-Mon Jul  8 08:03:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): Add a RB_GC_GUARD.
-
-Sun Jul  7 23:56:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_karatsuba): Unreachable code removed.  Remove
-	  several branches.
-
-Sun Jul  7 22:59:06 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (rb_big_mul_normal): Declared.
-	  (rb_big_mul_balance): Ditto.
-	  (rb_big_mul_karatsuba): Ditto.
-
-	* bignum.c (rb_big_mul_normal): New function for tests.
-	  (rb_big_mul_balance): Ditto.
-	  (rb_big_mul_karatsuba): Ditto.
-
-Sun Jul  7 19:21:30 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Reorder functions to decrease forward reference.
-
-Sun Jul  7 14:41:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: (bigsub_core): Use bary_sub.
-	  (bary_sub): Returns a borrow flag.  Use bary_subb.
-	  (bary_subb): New function for actually calculating subtraction with
-	  borrow.
-	  (bary_sub_one): New function.
-	  (bigadd_core): Use bary_add.
-	  (bary_add): Returns a carry flag.  Use bary_addc.
-	  (bary_addc): New function for actually calculating addition with
-	  carry.
-	  (bary_add_one): New function.
-	  (bary_muladd_1xN): Extracted from bary_mul_normal.
-	  (bigmul1_normal): Removed.
-	  (bary_mul_karatsuba): New function.
-	  (bary_mul1): Invoke rb_thread_check_ints after bary_mul_normal.
-	  (bary_mul): Remove most and least significant zeros before actual
-	  multiplication.  Use bary_sq_fast, bary_mul_balance,
-	  bary_mul_karatsuba and bigmul1_toom3 as bigmul0.
-	  (bigmul1_balance): Removed.
-	  (bigmul1_karatsuba): Removed.
-	  (bigsqr_fast): Removed.
-	  (bary_sparse_p): Extracted from big_sparse_p.
-	  (big_sparse_p): Removed.
-	  (bigmul0): Use bary_mul.
-
-Sun Jul  7 11:54:33 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* NEWS: Add REXML::Text#<< related updates.
-
-Sun Jul  7 11:49:19 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/text.rb (REXML::Text#<<): Support appending in not
-	  "raw" mode. [Bug #8602] [ruby-dev:47482]
-	  Reported by Ippei Obayashi. Thanks!!!
-
-Sun Jul  7 11:43:13 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/text.rb (REXML::Text#<<): Support method chain use by "<<"
-	  like other objects.
-
-Sun Jul  7 11:34:18 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/text.rb (REXML::Text#clear_cache): Extract common
-	  cache clear code.
-
-Sun Jul  7 11:01:03 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_DTRACE_POSTPROCESS): dtrace version SUN D 1.11
-	  introduces a check in the dtrace compiler to ensure that probes
-	  actually exist. If there are no probes, then the -G step will
-	  fail. As this test is only being used to determine whether -G is
-	  necessary (for instance, on OSX it is not), adding a real probe to
-	  the conftest allows it to succeed on newer versions of dtrace.
-	  Patch by Eric Saxby <sax AT livinginthepast.org> at
-	  [ruby-core:55826].  [Fixes GH-351], [Bug #8606].
-
-Sun Jul  7 10:07:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_sq_fast): Extracted from bigsqr_fast and
-	  ensure not to access zds[2*xn].
-	  (bigsqr_fast): Allocate the result bignum with 2*xn words.
-
-Sat Jul  6 07:37:43 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* ext/openssl/ossl_pkey_ec.c: Ensure compatibility to builds of
-	  OpenSSL with OPENSSL_NO_EC2M defined, but OPENSSL_NO_EC not
-	  defined.
-	* test/openssl/test_pkey_ec.rb: Iterate over built-in curves
-	  (and assert their non-emptiness!) instead of hard-coding them, as
-	  this may cause problems with respect to the different availability
-	  of individual curves in individual OpenSSL builds.
-	  [ruby-core:54881] [Bug #8384]
-
-	  Thanks to Vit Ondruch for providing the patch!
-
-Sat Jul  6 07:12:39 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* test/openssl/test_x509crl.rb: Remove unused variable.
-	  [ruby-core:53501] [Bug #8114]
-
-	  Thanks, Vipul Amler, for pointing this out!
-
-Sat Jul  6 06:37:10 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* ext/openssl/ossl.c: Provide CRYPTO_set_locking_callback() and
-	  CRYPTO_set_id_callback() callback functions ossl_thread_id and
-	  ossl_lock_callback to ensure the OpenSSL extension is usable in
-	  multi-threaded environments.
-	  [ruby-core:54900] [Bug #8386]
-
-	  Thanks, Dirkjan Bussink, for the patch!
-
-Sat Jul  6 06:06:16 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* lib/openssl/ssl.rb: Fix SSL client connection crash for SAN marked
-	  critical.
-	  The patch for CVE-2013-4073 caused SSL crash when a SSL server returns
-	  the certificate that has critical SAN value.  X509 extension could
-	  include 2 or 3 elements in it:
-
-	  [id, criticality, octet_string] if critical,
-	  [id, octet_string] if not.
-
-	  Making sure to pick the last element of X509 extension and use it as
-	  SAN value.
-	  [ruby-core:55685] [Bug #8575]
-
-	  Thank you @nahi for providing the patch!
-
-Sat Jul  6 04:49:38 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: register time objects so
-	  they are referenced as ids during output.
-	* test/psych/test_date_time.rb: corresponding test.
-
-Fri Jul  5 20:46:39 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_unicode_escape.rb (TestUnicodeEscape#test_basic): this
-	  assertion doesn't seems to be checking the unicode string on command
-	  line, but seems to be checking how to treat the unicode string from
-	  stdin.  so, should escape '\' before 'u'.  this fixes a test failure
-	  on Windows.
-
-Fri Jul  5 19:05:40 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/fileutils.rb (FileUtils#chown, FileUtils#chown_R): Fix the
-	  wrong output message when user is nil, which should be "chown
-	  :group file" instead of "chown group file".
-
-Fri Jul  5 16:21:56 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/ruby/test_regexp.rb
-	  (TestRegexp#test_options_in_look_behind)
-	  (TestRegexp#assert_match_at): Add tests for another problem
-	  fixed in Onigmo 5.13.5.  Previously Onigmo did not allow option
-	  enclosures in look-behind, which makes it impossible to
-	  interpolate a regexp into another in the middle of a look-behind
-	  pattern.  cf. https://github.com/k-takata/Onigmo/pull/17
-
-	* test/ruby/test_regexp.rb
-	  (TestRegexp#test_options_in_look_behind)
-	  (TestRegexp#assert_match_at): Parse regexps in run time rather
-	  than in compile time.
-
-Fri Jul  5 12:14:40 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_rubyoptions.rb (TestRubyOptions#test_notfound): after
-	  r41710, the path of command uses backslash as the separator on
-	  Windows.
-
-Fri Jul  5 11:29:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit/assertions.rb (assert_raise_with_message): move from
-	  test/fileutils/test_fileutils.rb.  this is still experimental and
-	  the interface may be changed.
-
-Fri Jul  5 11:08:00 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (w32_spawn): r41710 made that if the command starts with
-	  a quote and includes slash, removed the top quote and NOT removed the
-	  last quote.
-	  this fixes test failures on test/ruby/test_process.rb and
-	  test/webrick.
-
-Fri Jul  5 09:53:15 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-	* lib/mkmf.rb (CONFIG['CPPOUTFILE']): fix r41769; CONFIG['CPPOUTFILE']
-	  may be nil.
-
-Fri Jul  5 05:39:53 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BARY_MUL1): Renamed from BARY_MUL.
-	  (bary_mul1): Renamed from bary_mul.
-	  (bary_mul): Renamed from bary_mul2.
-
-Fri Jul  5 04:58:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul_balance): Extracted from bigmul1_balance and
-	  use bary_mul2 and bary_add to decrease allocations.
-
-Fri Jul  5 02:14:00 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/fileutils.rb (FileUtils#symbolic_modes_to_i): Fix the wrong
-	  character class [+-=], which happened to match all desired
-	  characters but also match undesired characters.
-
-	* lib/fileutils.rb (FileUtils.chmod{,_R}): Enhance the symbolic
-	  mode parser to support the permission symbols u/g/o and multiple
-	  actions as defined in SUS, so that chmod("g=o+w", file) works as
-	  expected.  Invalid symbolic modes are now rejected with
-	  ArgumentError.
-
-Fri Jul  5 00:25:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (have_framework): allow header file to check.
-	  [ruby-core:55745] [Bug #8593]
-
-Thu Jul  4 22:31:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* object.c (rb_obj_equal): Fixed an rb_obj_equal documentation typo
-	  where "a" was used instead of "obj".
-	  Fixes GH-349. Patch by @adnandoric
-
-Thu Jul  4 20:39:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* tool/make-snapshot: Exit with EXIT_FAILURE when it fails.
-
-Thu Jul  4 20:20:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (maxpow_in_bdigit_dbl): Use tables if available.
-	  (maxpow_in_bdigit): Ditto.
-	  (U16): New macro.
-	  (U32): Ditto.
-	  (U64): Ditto.
-	  (U128): Ditto.
-	  (maxpow16_exp): New table.
-	  (maxpow16_num): New table.
-	  (maxpow32_exp): New table.
-	  (maxpow32_num): New table.
-	  (maxpow64_exp): New table.
-	  (maxpow64_num): New table.
-	  (maxpow128_exp): New table.
-	  (maxpow128_num): New table.
-
-Thu Jul  4 18:25:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Avoid temporary buffer allocation except
-	  very big base non-power-of-2 numbers.
-
-Thu Jul  4 15:51:56 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (rb_str_succ): use ONIGENC_MBCLEN_CHARFOUND_P correctly.
-
-	* string.c (rb_str_dump): ditto.
-
-Thu Jul  4 10:04:11 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regcomp.c (): Merge Onigmo 5.13.5 23b523076d6f1161.
-
-	  * [bug]  (thanks Akinori MUSHA and Ippei Obayashi)
-	           Fix a renumbering bug in condition regexp with a named
-	           capture. [Bug #8583]
-	  * [spec] (thanks Akinori MUSHA)
-	    Allow ENCLOSE_OPTION in look-behind.
-
-Thu Jul  4 00:36:03 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* internal.h (SIGNED_INTEGER_MAX): suppress warning C4146 on VC6.
-	  seems a logical ORed expression becomes unsigned.
-
-Thu Jul  4 00:13:01 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ruby_atomic.h (rb_w32_atomic_cas): call InterlockedCompareExchange
-	  directly.
-
-	* ruby_atomic.h (ATOMIC_CAS): fix missing function call.
-
-Wed Jul  3 23:47:35 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ruby_atomic.h (ATOMIC_CAS): suppress C4022 and C4047 warnings in
-	  VC6.  only InterlockedCompareExchange is declared using PVOID.
-
-Wed Jul  3 22:29:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (ruby_digit36_to_number_table): Declared.
-
-	* util.c (ruby_digit36_to_number_table): Moved from scan_digits.
-
-	* bignum.c (conv_digit): Use ruby_digit36_to_number_table.
-
-	* pack.c (hex2num): Ditto.
-
-Wed Jul  3 18:12:56 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (install_dirs): revert DESTDIR prefix by r39841, since
-	  it is fixed by r41648.  [ruby-core:55760] [Bug #8115]
-
-Wed Jul  3 14:15:25 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (do_stat): use rb_w32_ustati64() in win32.c to get rid of
-	  mysterious behavior of FindFirstFile() Windows API which treat "<"
-	  and ">" like as wildcard characters.  [ruby-core:55764] [Bug #8597]
-
-Wed Jul  3 12:06:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (maxpow_in_bdigit): Renamed from calc_hbase and return
-	  maxpow.
-
-Tue Jul  2 23:47:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (roomof): Cast to long.
-	  (rb_ull2big): Fix bignew arguments.
-
-Tue Jul  2 21:17:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Merge two temporary buffers.
-
-Tue Jul  2 20:25:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Use BDIGIT_DBL to collect adjacent digits.
-	  (BDIGIT_DBL_MAX): New macro.
-	  (maxpow_in_bdigit_dbl): New function.
-
-Tue Jul  2 17:23:33 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* doc/syntax/refinements.rdoc: add description of Module#using and
-	  refinement inheritance by module inclusion.
-
-Tue Jul  2 17:22:44 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* internal.h: add EUC-JP and Windows-31J.
-
-	* re.c (rb_char_to_option_kcode): use built-in encoding indexes in
-	  internal.h.
-
-	* internal.h: add UTF8-MAC.
-
-	* dir.c (rb_utf8mac_encoding): use built-in encoding indexes in
-	  internal.h.
-
-	* internal.h: add UTF-{16,32} dummy encodings.
-
-	* string.c (rb_str_inspect, str_scrub0): use built-in encoding indexes
-	  in internal.h.
-
-	* internal.h: add UTF-{16,32}{BE,LE}.
-
-	* io.c (io_strip_bom): use built-in encoding indexes in internal.h.
-
-	* internal.h (rb_{ascii8bit,utf8,usascii}_encindex): use built-in
-	  encoding indexes for optimization.
-
-	* encoding.c (enc_inspect, rb_locale_encindex),
-	  (enc_set_filesystem_encoding, rb_filesystem_encindex): use built-in
-	  encoding indexes directly.
-
-	* encoding.c (rb_enc_set_index, rb_enc_associate_index): validate
-	  argument encoding index.
-
-	* include/ruby/encoding.h (ENCODING_SET): use rb_enc_set_index()
-	  instead of setting inlined bits directly.
-
-	* encoding.c (rb_enc_init): register preserved indexes.
-
-	* internal.h (ruby_preserved_encindex): move from encoding.c.
-
-Tue Jul  2 11:14:36 2013  Shota Fukumori  <sorah@cookpad.com>
-
-	* lib/mkmf.rb (try_config): Fix to not replace $LDFLAGS with $libs
-	  (1.9.3 behavior) [ruby-core:55752] [Bug #8595]
-
-Tue Jul  2 00:39:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ipsocket.c (init_inetsock_internal): Don't try mismatched
-	  address family if already failed.
-
-Mon Jul  1 23:07:38 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* template/encdb.h.tmpl: define encoding index macros to use the index
-	  statically from C source.
-
-Mon Jul  1 22:57:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul2): New function.
-	  (rb_cstr_to_inum): Use a better algorithm to compose the result
-	  if input length is very long.
-
-Mon Jul  1 20:22:00 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* ext/bigdecimal/bigdecimal.h (RB_UNUSED_VAR, UNREACHABLE):
-	  import macros from ruby.h for 1.9.3.
-	  [Bug #8588] [ruby-core:55730]
-
-	* ext/bigdecimal/bigdecimal.gemspec: Bump version to 1.2.1.
-
-Mon Jul  1 20:03:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ipsocket.c (init_inetsock_internal): Use an address
-	  family for local address which is different to the remote
-	  address if no other choice.
-
-Mon Jul  1 15:05:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/csv.rb (CSV#<<): use StringIO#set_encoding instead of creating
-	  new StringIO instance with String#force_encoding, forcing encoding
-	  discards the cached coderange bits and can make further operations
-	  very slow.  [ruby-core:55714] [Bug #8585]
-
-	* ext/stringio/stringio.c (strio_write): keep coderange of
-	  ptr->string.
-
-	* string.c (rb_enc_cr_str_buf_cat, rb_str_append): consider an empty
-	  string 7bit-clean and should not discard cached coderange of string
-	  to be appended.
-
-Mon Jul  1 12:56:41 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* eval.c (rb_using_module): activate refinements in the ancestors of
-	  the argument module to support refinement inheritance by
-	  Module#include.  [ruby-core:55671] [Feature #8571]
-
-	* test/ruby/test_refinement.rb: related test.
-
-Mon Jul  1 12:02:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Skip leading zeros.
-
-Mon Jul  1 00:59:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (nlz16): New function.
-	  (nlz32): Ditto.
-	  (nlz64): Ditto.
-	  (nlz128): Ditto.
-	  (nlz): Redefined using an above function.
-	  (bitsize): New macro.
-	  (rb_cstr_to_inum): Use bitsize instead of nlz.
-
-Sun Jun 30 22:40:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* lib/prime.rb: Corrected a few comments. Patch by @Nullset14.
-	  Fixes GH-346.
-
-Sun Jun 30 21:53:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_cstr_to_inum): Use rb_integer_unpack if base is a power
-	  of 2.
-
-Sun Jun 30 10:59:23 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (join_argv): use backslash instead of slash in program
-	  path, otherwise cannot invoke "./c\u{1ee7}a.exe" for some reason.
-	  [ruby-core:24309] [Bug #1771]
-
-	* io.c (spawnv, spawn): use UTF-8 spawn family.  [Bug #1771]
-
-	* process.c (proc_exec_sh, proc_spawn_cmd, proc_spawn_sh): ditto.
-
-	* win32/win32.c (translate_char, join_argv, has_redirection): make
-	  codepage aware.
-
-	* win32/win32.c (rb_w32_udln_find_exe_r, rb_w32_udln_find_file_r):
-	  codepage independent versions.
-
-	* win32/win32.c (w32_spawn): extract codepage aware code from
-	  rb_w32_spawn().
-
-	* win32/win32.c (rb_w32_uspawn): add UTF-8 version function.
-
-	* win32/win32.c (w32_aspawn_flags): extract codepage aware code from
-	  rb_w32_aspawn_flags().
-
-	* win32/win32.c (rb_w32_uaspawn_flags, rb_w32_uaspawn_flags): add
-	  UTF-8 version functions.
-
-	* win32/win32.c (w32_getenv): extract codepage aware code from
-	  rb_w32_ugetenv() and rb_w32_getenv().
-
-	* win32/win32.c (w32_stati64): extract codepage aware code from
-	  rb_w32_ustati64() and rb_w32_stati64().
-
-	* dln.h (DLN_FIND_EXTRA_ARG, DLN_FIND_EXTRA_ARG_DECL): allow extra
-	  arguments to dln_find_{exe,file}_r().
-
-	* dln_find.c (dln_find_exe_r, dln_find_file_r): add extract arguments.
-
-	* process.c (EXPORT_STR, EXPORT_DUP): convert to default process
-	  encoding if defined.
-
-	* process.c (check_exec_env_i): convert environment variables too.
-
-	* process.c (rb_exec_fillarg): convert program path and arguments too.
-
-Sun Jun 30 01:57:08 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big_rshift): Use abs2twocomp and twocomp2abs_bang.
-
-Sun Jun 30 00:14:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (RBIGNUM_SET_NEGATIVE_SIGN): New macro.
-	  (RBIGNUM_SET_POSITIVE_SIGN): Ditto.
-	  (rb_big_neg): Inline get2comp to avoid double negation.
-
-Sat Jun 29 23:26:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_neg): Extracted from bary_2comp.
-	  (bary_plus_one): Extracted from bary_2comp.
-	  (bary_2comp): Use bary_neg and bary_plus_one.
-	  (big_extend_carry): Extracted from get2comp.
-	  (get2comp): Use big_extend_carry.
-	  (rb_integer_unpack): Use big_extend_carry.
-	  (rb_big_neg): Use bary_neg.
-
-Sat Jun 29 22:31:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_2comp): Simplified.
-
-Sat Jun 29 09:33:53 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigor_int): Return -1 if y == -1.
-
-Sat Jun 29 09:07:16 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigor_int): Use RB_GC_GUARD.
-	  (bigxor_int): Take xn and hibitsx arguments.  Use twocomp2abs_bang.
-	  (rb_big_xor): Use abs2twocomp and twocomp2abs_bang.
-
-Sat Jun 29 08:19:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigand_int): Don't apply bitwise and for BDIGIT and long.
-	  (bigor_int): Take xn and hibitsx arguments.  Use twocomp2abs_bang.
-	  (rb_big_or): Use abs2twocomp and twocomp2abs_bang.
-
-Fri Jun 29 01:08:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* numeric.c (fix_mul): remove FIT_SQRT_LONG test as it was causing
-	  fix_mul to return an incorrect result for -2147483648*-2147483648
-	  on 64 bit platforms
-
-	* test/ruby/test_integer_comb.rb (class TestIntegerComb): add test case
-
-Fri Jun 28 12:26:53 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_and): Allocate new bignum with same size to shorter
-	  argument if it's high bits are zero.
-
-Fri Jun 28 12:14:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ipsocket.c (init_inetsock_internal): Don't use local
-	  addresses which address family is different to remote address.
-
-Fri Jun 28 08:06:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigand_int): Add arguments, xn and hibitsx.
-	  Use twocomp2abs_bang.
-
-Thu Jun 27 23:58:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (abs2twocomp_bang): Removed.
-	  (abs2twocomp): Take n_ret argument to return actual length.
-	  (rb_big_and): Follow above change.
-
-Thu Jun 27 22:52:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (get2comp): Use bary_2comp.
-	  (abs2twocomp_bang): New function.
-	  (abs2twocomp): New function.
-	  (twocomp2abs_bang): New function.
-	  (rb_big_and): Use abs2twocomp and twocomp2abs_bang.
-
-Thu Jun 27 20:03:13 2013  CHIKANAGA Tomoyuki  <nagachika@ruby-lang.org>
-
-	* ext/openssl/lib/openssl/ssl.rb (verify_certificate_identity): fix
-	  hostname verification. Patched by nahi.
-
-	* test/openssl/test_ssl.rb (test_verify_certificate_identity): test for
-	  above.
-
-
-Thu Jun 27 00:23:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_pow): Retry if y is a Bignum and it is
-	  representable as a Fixnum.
-	  Use rb_absint_numwords.
-
-Wed Jun 26 23:53:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_save_rounding_mode): fix typo.
-	  Fixes GH-343. Patch by @jgarber.
-
-Wed Jun 26 23:22:21 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (rb_enumeratorize_with_size): use strict definition
-	  rb_enumerator_size_func.
-
-Wed Jun 26 23:11:14 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* gc.c (is_before_sweep): Add a missing space before a parenthesis.
-	* gc.c (rb_gc_force_recycle): Add a missing space around a parenthesis.
-
-Wed Jun 26 22:44:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/intern.h (rb_enumeratorize_with_size): cast for
-	  backward compatibility.
-
-	* include/ruby/intern.h (rb_enumerator_size_func): define strict
-	  function declaration for rb_enumeratorize_with_size().
-
-Wed Jun 26 21:01:22 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/ruby/test_io.rb (TestIO#test_write_32bit_boundary): skip if
-	  writing a file is slow.
-	  [ruby-core:55541] [Bug #8519]
-
-Wed Jun 26 16:42:11 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb: should use expanded values for header directories
-	  unless extmk.  patch by vo.x (Vit Ondruch) at [ruby-core:55653]
-	  [Bug #8115], rhbz#921650.
-
-Wed Jun 26 12:48:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigxor_int): Fix a buffer over read.
-
-Wed Jun 26 12:13:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigand_int): Consider negative values.
-	  (bigor_int): The allocated bignum should have enough size
-	  to store long.
-	  This fixes (bignum fits in a BDIGIT) | (fixnum bigger than BDIGIT)
-	  on platforms which SIZEOF_BDIGITS < SIZEOF_LONG,
-	  such as LP64 with 32bit BDIGIT (no int128).
-
-Wed Jun 26 12:08:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/socket/test_udp.rb: Close sockets explicitly.
-	  Don't use fixed port number.
-
-Wed Jun 26 07:27:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigand_int): Fix a buffer over read.
-
-Wed Jun 26 06:48:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigadd_int): Fix a buffer over read.
-
-Wed Jun 26 01:18:13 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (is_before_sweep): Add new helper function that check the object
-	  is before sweep?
-	* gc.c (rb_gc_force_recycle): Have to clear mark bit if object's slot
-	  already ready to minor sweep.
-
-Wed Jun 26 01:17:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigsub_int): Fix a buffer over read.
-
-Tue Jun 25 22:45:43 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_singlebit_p): Use POW2_P.
-	  (bary_pack): Ditto.
-	  (rb_big2str0): Ditto.
-	  (POW2_P): Moved to top.
-
-Tue Jun 25 22:28:07 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/rubygems/ext/builder.rb (Gem::Ext::Builder.make): Pass
-	  DESTDIR via command line to override what's in MAKEFLAGS.  This
-	  fixes an installation problem under a package building
-	  environment where DESTDIR is specified in the (parent) command
-	  line. [Fixes GH-327]
-
-Tue Jun 25 21:43:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2dbl): Use (BDIGIT)1 instead of 1UL.
-	  (bary_mul_normal): Remove a useless cast.
-
-Tue Jun 25 21:26:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (BigMath_s_exp): Fix for the cases when
-	  the argument x is not a BigDecimal.
-	  This change is based on the patch made by Heesob Park and Garth Snyder.
-	  [Bug #6862] [ruby-core:47145]
-	  [Fixes GH-332] https://github.com/ruby/ruby/pull/332
-
-Tue Jun 25 20:36:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2ulong): "check" argument removed.
-	  (rb_big2ulong): Follow above change.
-	  (rb_big2long): Ditto.
-	  (rb_big_rshift): Ditto.
-	  (rb_big_aref): Ditto.
-
-Tue Jun 25 20:08:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big2ulong_pack): Use rb_integer_pack.
-	  (rb_big_aref): Call big2ulong with TRUE for "check" argument.
-	  It should be non-effective.
-
-Tue Jun 25 19:07:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (LSHIFTX): Revert r41611.
-	  The redundant expression suppresses a warning, C4293, by Visual
-	  Studio.
-	  http://ruby-mswin.cloudapp.net/vc10-x64/ruby-trunk/log/20130625T072854Z.log.html.gz#miniruby
-
-Tue Jun 25 19:03:00 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2ulong): Add a cast.
-	  (big2ull): Add a specialized code for SIZEOF_LONG_LONG <=
-	  SIZEOF_BDIGITS.
-
-Tue Jun 25 12:42:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_single_bdigit): Use "1 + ~u" instead of
-	  "-u" to suppress warning (C4146) by Visual Studio.
-	  Reported by ko1 via IRC.
-
-Tue Jun 25 12:28:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2ulong): Add code specialized for SIZEOF_LONG <=
-	  SIZEOF_BDIGITS.
-	  This prevents shift width warning from "num <<= BITSPERDIG".
-
-Tue Jun 25 12:23:30 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: fix oldgen/remembered_shady counting algorithm.
-
-	* gc.c (rgengc_check_shady): increment
-	  `objspace->rgengc.remembered_shady_object_count' here.
-
-	* gc.c (rgengc_remember): return FALSE if obj is already remembered.
-
-	* gc.c (rgengc_rememberset_mark): make it void.
-
-	* gc.c (gc_mark_children): fix to double counting oldgen_object_count
-	  at minor GC.
-
-Tue Jun 25 12:07:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (MSB): Removed.
-	  (BDIGIT_MSB): Defined using BIGRAD_HALF.
-	  (bary_2comp): Apply BIGLO after possible over flow of BDIGIT.
-	  (get2comp): Ditto.
-	  (bary_unpack_internal): Use BDIGIT_MSB.
-	  Apply BIGLO after possible over flow of BDIGIT.
-	  (rb_integer_unpack): Use BDIGIT_MSB.
-	  (calc_hbase): Use BDIGMAX.
-	  (big2dbl): Use BDIGMAX.
-	  Apply BIGLO after possible over flow of BDIGIT.
-	  (rb_big_neg): Apply BIGLO after possible over flow of BDIGIT.
-	  (biglsh_bang): Ditto.
-	  (bigrsh_bang): Ditto.
-	  (bary_divmod): Use BDIGIT_MSB.
-	  (bigdivrem): Ditto.
-	  (bigxor_int): Apply BIGLO after possible over flow of BDIGIT.
-
-	* marshal.c (shortlen): Use SIZEOF_BDIGITS instead of sizeof(BDIGIT).
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): Use SIZEOF_BDIGITS
-	  instead of sizeof(BDIGIT).
-
-Tue Jun 25 11:40:08 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (big2ulong): suppress shorten-64-to-32 warning.  BDIGIT can
-	  be bigger than long now.
-
-	* bignum.c (LSHIFTX): remove redundant never-true expression.
-
-Tue Jun 25 00:55:54 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (typedef struct rb_objspace): Change members for monitor objects.
-	* gc.c (gc_marks_test): Check all WriteBarrier Errors and track them in obj-tree.
-	* gc.c (rgengc_check_shady): Ditto.
-	* gc.c (gc_marks): Move 2 function calls to gc_marks_test for test initialize.
-
-Mon Jun 24 23:30:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_single_bdigit): Refine code to filling
-	  higher bits and use BIGLO.
-
-Mon Jun 24 22:26:31 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/rinda/test_rinda.rb (RingIPv6#prepare_ipv6):
-	  ifindex() function may not be implemented on Windows. We use another
-	  check for the case.
-
-Mon Jun 24 22:11:37 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/gdbm/test_gdbm.rb (TestGDBM#test_s_open_nolock):
-	  skip a failing test on Windows because flock() implementation is
-	  different from Unix.
-
-Mon Jun 24 22:06:14 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/rubygems/test_gem_installer.rb (test_install_extension_flat):
-	  use ruby in build directory in case ruby is not installed.
-	  [ruby-core:53265] [Bug #8058]
-
-Mon Jun 24 22:04:02 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* ext/dl/cfunc.c (rb_dlcfunc_call): fix conversion from Bignum to
-	  pointer. sizeof(DLSTACK_TYPE) is larger than sizeof(long) on
-	  Windows x64 and higher bits over sizeof(long) of DLSTACK_TYPE was
-	  zero even if a pointer value was over 32 bits which causes SEGV on
-	  DL::TestCPtr#test_to_ptr_io. Adding a cast solves the bug.
-
-Mon Jun 24 22:04:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* eval_error.c (warn_printf): use rb_vsprintf instead so ruby specific
-	  extensions like PRIsVALUE can be used in format strings
-	* eval_error.c (error_print): use warn_print_str (alias for
-	  rb_write_error_str) to print a string value instead of using
-	  RSTRING_PTR and RSTRING_LEN manually
-	* eval.c (setup_exception): use PRIsVALUE instead of %s and RSTRING_PTR
-
-Mon Jun 24 20:31:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* compile.c (make_name_for_block): use PRIsVALUE in format string
-	  instead of %s and RSTRING_PTR to protect objects from being garbage
-	  collected too soon
-	* encoding.c (str_to_encindex): ditto
-	* hash.c (rb_hash_fetch_m): ditto
-	* io.c (rb_io_reopen): ditto
-	* parse.y (reg_fragment_check_gen): ditto
-	* parse.y (reg_compile_gen): ditto
-	* parse.y (ripper_assert_Qundef): ditto
-	* re.c (rb_reg_raise): ditto
-	* ruby.c (set_option_encoding_once): ditto
-	* vm_eval.c (rb_throw_obj): ditto
-
-Mon Jun 24 07:57:18 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (after_gc_sweep): Have to record malloc info before reset.
-	* gc.c (gc_prof_timer_start): Pick out part of new record creation as gc_prof_setup_new_record.
-	* gc.c (gc_prof_set_malloc_info): Move point of recording allocation size to front of mark.
-
-Mon Jun 24 02:53:09 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: Return value in Array overview example found by @PragTob
-	  [Fixes GH-336] https://github.com/ruby/ruby/pull/336
-
-Mon Jun 24 02:45:51 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c (rb_ary_zip): typo by @PragTob [Fixes GH-337]
-	  https://github.com/ruby/ruby/pull/337
-
-Mon Jun 24 02:42:01 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* win32/README.win32: grammar typo by @blankenshipz [Fixes GH-334]
-	  https://github.com/ruby/ruby/pull/334
-
-Mon Jun 24 00:59:35 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BIGUP): Use LSHIFTX and avoid cast to consider the type
-	  of x is bigger than BDIGIT_DBL.
-	  (big2ulong): Use unsigned long to store the result.
-	  (big2ull): Use unsigned LONG_LONG to store the result.
-	  (bigand_int): Use long for num to avoid data loss.
-	  (bigor_int): Ditto.
-	  (bigxor_int): Ditto.
-
-Sun Jun 23 23:05:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/defines.h (BDIGIT): Define it only if it is not defined
-	  yet.  This eases tests and debug.
-	  (SIZEOF_BDIGITS): Ditto.
-	  (BDIGIT_DBL): Ditto.
-	  (BDIGIT_DBL_SIGNED): Ditto.
-	  (PRI_BDIGIT_PREFIX): Ditto.
-	  (PRI_BDIGIT_DBL_PREFIX): Ditto.
-	  (PRIdBDIGIT): Define it only if PRI_BDIGIT_PREFIX is defined.
-	  (PRIiBDIGIT): Ditto.
-	  (PRIoBDIGIT): Ditto.
-	  (PRIuBDIGIT): Ditto.
-	  (PRIxBDIGIT): Ditto.
-	  (PRIXBDIGIT): Ditto.
-	  (PRIdBDIGIT_DBL): Ditto.
-	  (PRIiBDIGIT_DBL): Ditto.
-	  (PRIoBDIGIT_DBL): Ditto.
-	  (PRIuBDIGIT_DBL): Ditto.
-	  (PRIxBDIGIT_DBL): Ditto.
-	  (PRIXBDIGIT_DBL): Ditto.
-
-	* include/ruby/ruby.h (RBIGNUM_EMBED_LEN_MAX): Define it only if it is
-	  not defined yet.
-
-Sun Jun 23 17:29:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_single_bdigit): Use a cast.
-
-Sun Jun 23 15:38:07 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* bootstraptest/test_thread.rb: rescue resource limitation errors.
-
-Sun Jun 23 08:19:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_single_bdigit): Extracted from
-	  bary_unpack_internal.
-
-Sun Jun 23 07:41:52 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_unpack_internal): Suppress warnings (C4146) on Visual Studio.
-	  Reported by ko1 via IRC.
-
-Sun Jun 23 06:49:28 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h, gc.c: rename macros and functions:
-	  OBJ_WB_GIVEUP() -> OBJ_WB_UNPROTECT(),
-	  rb_obj_wb_giveup() -> rb_obj_wb_unprotect(),
-	  rb_gc_giveup_promoted_writebarrier() ->
-	  rb_gc_writebarrier_unprotect_promoted(),
-
-	* class.c, eval.c, hash.c: use OBJ_WB_UNPROTECT().
-
-Sun Jun 23 05:41:32 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* class.c (rb_include_class_new), eval.c (rb_using_refinement):
-	  make classes/modules (who share method table) shady.
-	  If module `a' and `b' shares method table m_tbl and new method
-	  with iseq is added, then write barrier is applied only `a' or `b'.
-	  To avoid this issue, shade such classes/modules.
-
-	* vm_method.c (rb_method_entry_make): add write barriers.
-
-Sun Jun 23 01:27:54 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bytes_zero_p): Removed.
-	  (bary_pack): Don't call bytes_zero_p.
-
-Sun Jun 23 00:51:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bytes_zero_p): Extracted from bary_pack.
-	  (bary_pack): Use bytes_zero_p.
-
-Sun Jun 23 00:16:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (MSB): New macro.
-	  (bary_unpack_internal): Use MSB.
-	  (bary_divmod): Ditto.
-	  (bigdivrem): Ditto.
-
-Sat Jun 22 23:45:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_swap): New function.
-	  (bary_pack): Use bary_swap.
-	  (bary_unpack_internal): Ditto.
-
-Sat Jun 22 23:18:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bytes_2comp): Renamed from quad_buf_complement.
-	  (bary_pack): Use bytes_2comp.
-	  (rb_quad_pack): Use rb_integer_pack.
-	  (rb_quad_unpack): Use rb_integer_unpack.
-
-Sat Jun 22 21:46:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_unpack): Don't allocate a Bignum if possible.
-
-Sat Jun 22 21:03:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c (pack_unpack): Remove specialized unpackers for integers.
-
-Sat Jun 22 20:36:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_unpack_internal): Specialized unpacker implemented.
-	  (bary_unpack): Support INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION.
-	  (rb_integer_unpack): Support INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION.
-
-Sat Jun 22 18:53:10 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_pack): Support
-	  INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION flag.
-	  Fix byte order and word order handling in code specialized for
-	  wordsize % SIZEOF_BDIGITS == 0.
-
-	* internal.h (INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION): Defined.
-
-Sat Jun 22 15:41:25 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_check_shady): add new WB miss checking
-	  on RGENGC_CHECK_MODE >= 2.
-
-	    (1) Save bitmaps before marking
-	    (2) Run full marking
-	    (3) On each traceable object,
-	      (a) object        was not oldgen (== newly or shady object) &&
-	      (b) parent object was     oldgen &&
-	      (c) parent object was not remembered &&
-	      (d) object        was not remembered
-	      then, it should be WB miss.
-
-	  This idea of this checker is by Masaya Tarui <tarui@ruby-lang.org>.
-
-Sat Jun 22 15:25:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/etc/etc.c (setup_passwd): revert r41560, unnecessary
-
-Sat Jun 22 14:39:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/etc/etc.c (Init_etc): omit 'passwd' from definition of Etc::Passwd
-	  if HAVE_STRUCT_PASSWD_PW_PASSWD is not defined to prevent mismatch of
-	  fields and values in setup_passwd
-
-Sat Jun 22 14:35:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dl/cfunc.c (rb_dlcfunc_call): Use rb_big_pack instead of
-	  rb_big2ulong_pack and rb_big2ull.
-
-	* include/ruby/intern.h (rb_big2ulong_pack): Deprecated.
-
-Sat Jun 22 14:31:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/etc/etc.c (setup_passwd): pass 0 as VALUE to rb_struct_new to
-	  prevent segfault if the compiler passes it as a 32 bit integer on
-	  a 64 bit ruby
-
-Sat Jun 22 13:47:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_pack): MEMZERO can be used even if nails is not zero.
-
-Sat Jun 22 13:43:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/etc/etc.c (etc_getpwnam): use PRIsVALUE in format string instead
-	  of %s and RSTRING_PTR
-
-	* ext/etc/etc.c (etc_getgrnam): ditto
-
-Sat Jun 22 13:07:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (CLEAR_LOWBITS): Rewritten without RSHIFTX.
-	  (RSHIFTX): Removed.
-
-Sat Jun 22 10:38:03 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c (num2i32): Removed.
-	  (pack_pack): Don't use num2i32.
-
-Sat Jun 22 09:55:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (LSHIFTX): Defined to suppress a warning.
-	  (RSHIFTX): Ditto.
-	  (CLEAR_LOWBITS): Use LSHIFTX and RSHIFTX.
-	  (FILL_LOWBITS): Use LSHIFTX.
-	  Reported by ko1 via IRC.
-
-Sat Jun 22 09:11:33 2013  Ryan Davis  <ryand-ruby@zenspider.com>
-
-	* lib/minitest/*: Imported minitest 4.7.5 (r8724)
-	* test/minitest/*: ditto
-
-Sat Jun 22 07:20:30 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_prof_set_heap_info, after_gc_sweep): call
-	  gc_prof_set_heap_info() just after sweeping to calculate
-	  live object number correctly.
-	  (live object number = total generated number (before marking) -
-	                        total freed number (after sweeping))
-
-	* gc.c (gc_marks): record `oldgen_object_count' into current profile`
-	  record directly.
-
-	* gc.c (rgengc_rememberset_mark): same for remembered_normal_objects
-	  and remembered_shady_objects.
-
-Sat Jun 22 06:46:04 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_objspace::profile): rename rb_objspace::profile::record to
-	  records (because it points a set of records) and add a field
-	  rb_objspace::profile::current_record to point a current profiling
-	  record.
-
-	* gc.c: use above fields.
-
-Sat Jun 22 06:05:36 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_gc_giveup_promoted_writebarrier): remove `rest_sweep()'
-	  because all of remembered objects are called for gc_mark_children().
-
-Sat Jun 22 05:08:03 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_rememberset_mark): call gc_mark_children() for
-	  remembered objects directly instead of pushing on the mark stack.
-
-Sat Jun 22 04:48:53 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h (OBJ_WRITE): cast to (VALUE *) for second
-	  parameter `slot'. You don't need to write a cast (VALUE *) any more.
-
-	* class.c, compile.c, hash.c, iseq.c, proc.c, re.c, variable.c,
-	  vm.c, vm_method.c: remove cast expressions for OBJ_WRITE().
-
-Sat Jun 22 04:37:08 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (slot_sweep_body): rename to slot_sweep().
-	  No need to separate major/minor GC.
-
-	* gc.c (gc_setup_mark_bits): remove gc_clear_mark_bits() and unify to
-	  this function.
-
-Sat Jun 22 04:20:21 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (check_bitmap_consistency): add to check flag and bitmap consistency.
-	  Use this function in several places.
-
-Sat Jun 22 02:18:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_pack): Specialized packers implemented.
-	  (HOST_BIGENDIAN_P): New macro.
-	  (ALIGNOF): New macro.
-	  (CLEAR_LOWBITS): New macro.
-	  (FILL_LOWBITS): New macro.
-	  (swap_bdigit): New macro.
-	  (bary_2comp): Returns an int.
-
-	* internal.h (swap16): Moved from pack.c
-	  (swap32): Ditto.
-	  (swap64): Ditto.
-
-Fri Jun 21 21:29:49 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (typedef enum): Introduce flags of major gc reason.
-	* gc.c (garbage_collect_body): Ditto.
-	* gc.c (gc_profile_flags): Ditto.
-	* gc.c (gc_profile_dump_on): Ditto.
-
-Fri Jun 21 21:11:53 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (allocate_sorted_heaps): remove unused variable `add'.
-
-Fri Jun 21 20:50:32 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: constify RArray::as::ary and RArray::heap::ptr.
-	  Use RARRAY_ASET() or RARRAY_PTR_USE() to modify Array objects.
-
-	* array.c, gc.c: catch up above changes.
-
-Fri Jun 21 20:32:13 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_eval.c (eval_string_with_cref): fix WB miss.
-
-Fri Jun 21 20:15:49 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: support write barrier protection for T_STRUCT.
-	  Introduce the following C APIs:
-	    * RSTRUCT_RAWPTR(st) returns pointer (do WB on your risk).
-	      The type of returned pointer is (const VALUE *).
-	    * RSTRUCT_GET(st, idx) returns idx-th value of struct.
-	    * RSTRUCT_SET(st, idx, v) set idx-th value by v with WB.
-	  And
-	    * RSTRUCT_PTR(st) returns pointer with shady operation.
-	      The type of returned pointer is (VALUE *).
-
-	* struct.c, re.c, gc.c, marshal.c: rewrite with above APIs.
-
-Fri Jun 21 19:38:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BDIGMAX): Use BIGRAD.
-	  (BIGLO): Use BDIGMAX.
-	  (bigdivrem1): Ditto.
-	  (bigor_int): Ditto.
-	  (rb_big_or): Ditto.
-
-Fri Jun 21 19:18:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c (pack_pack): Move the implementation for 'c' directive after
-	  pack_integer label.
-
-Fri Jun 21 19:11:56 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h, re.c: support write barrier for T_REGEXP.
-
-	   Note: T_MATCH object is also easy to support write barriers.
-	         However, most of T_MATCH objects are short-lived objects.
-	         So I skipped to support non-shady T_MATCH.
-
-Fri Jun 21 18:56:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigsub_int): Use bdigit_roomof.
-	  (bigadd_int): Ditto.
-	  (bigand_int): Ditto.
-	  (bigor_int): Ditto.
-	  (bigxor_int): Ditto.
-
-Fri Jun 21 17:56:25 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/gcbench.rb: fix summary of benchmark result notation.
-
-Fri Jun 21 16:38:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* ext/openssl/ossl_x509attr.c: change OSSL_X509ATTR_IS_SINGLE and
-	  OSSL_X509ATTR_SET_SINGLE macros to use ->value.set rather than
-	  ->set to fix compile failure
-
-Fri Jun 21 15:26:45 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_sweep): profile sweep time correctly when LAZY_SWEEP is
-	  disabled.
-
-	* gc.c (gc_marks_test): store oldgen count and shady count
-	  before test marking and restore them after marking.
-
-Fri Jun 21 15:07:42 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: enable lazy sweep (commit miss).
-
-Fri Jun 21 14:31:29 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (ruby_setenv): refine error message so include the variable
-	  name.
-
-Fri Jun 21 14:15:08 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: fix to use total_allocated_object_num and heaps_used
-	  at the GC time for profiler.
-
-Fri Jun 21 12:35:35 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: RGENGC_CHECK_MODE should be 0.
-
-Fri Jun 21 11:18:25 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_marks_body): fix to get `th' in this function.
-
-Fri Jun 21 10:21:44 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (heaps_header/heaps_slot): embed bitmaps into heaps_slot.
-	  no need to maintain allocation/free bitmaps.
-
-Fri Jun 21 09:22:16 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (slot_sweep_body): add counters at a time.
-
-	* gc.c (gc_profile_dump_on): fix line break position.
-
-Fri Jun 21 08:14:00 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c: refactoring bitmaps. introduce bits_t type and some Consts.
-
-Fri Jun 21 08:04:32 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: fix to support USE_RGENGC == 0 (disable RGenGC).
-	  If USE_RGENGC==0, it caused compilation error.
-
-Fri Jun 21 08:08:11 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (lazy_sweep): Use is_lazy_sweeping()
-	* gc.c (rest_sweep): Ditto.
-	* gc.c (gc_prepare_free_objects): Ditto.
-
-Fri Jun 21 07:34:47 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_profile_record::oldgen_objects): added.
-
-	* gc.c (gc_profile_dump_on): print the following information:
-	  * Living object counts
-	  * Free object counts
-	  If RGENGC_PROFILE > 0 then
-	  * Oldgen object counts
-	  * Remembered normal object counts
-	  * Remembered shady object counts
-
-Fri Jun 21 06:43:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_ull2big): Refactored.
-	  (rb_uint2big): Useless code removed.
-
-Fri Jun 21 05:37:39 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_prof_sweep_timer_stop): accumulate sweep time only when
-	  record->gc_time > 0.
-
-Fri Jun 21 00:37:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/bigdecimal: Workaround fix for bigdecimal test failures caused
-	  by [ruby-dev:47413] [Feature #8509]
-
-	* ext/bigdecimal/bigdecimal.h (BDIGIT): Make it independent from the
-	  definition for bignum.c.
-	  (SIZEOF_BDIGITS): Ditto.
-	  (BDIGIT_DBL): Ditto.
-	  (BDIGIT_DBL_SIGNED): Ditto.
-	  (PRI_BDIGIT_PREFIX): Undefine the definition.
-	  (PRI_BDIGIT_DBL_PREFIX): Ditto.
-
-	* ext/bigdecimal/bigdecimal.c (RBIGNUM_ZERO_P): Use rb_bigzero_p.
-	  (bigzero_p): Removed.
-	  (is_even): Use rb_big_pack.
-
-Thu Jun 20 22:52:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigmul1_toom3): Don't call bignorm twice.
-
-Thu Jun 20 22:49:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bignorm): Don't call bigtrunc if the result is a fixnum.
-
-Thu Jun 20 22:29:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_uint2big): Refactored.
-
-Thu Jun 20 22:24:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (dump_bignum): Use SIZEOF_BDIGITS.
-
-Thu Jun 20 22:22:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2ulong): Change the return type to unsigned long.
-	  (rb_big2ulong_pack): Follow the above change.
-	  (rb_big2long): Ditto.
-	  (rb_big_lshift): Ditto.
-	  (rb_big_rshift): Ditto.
-	  (rb_big_aref): Ditto.
-
-Thu Jun 20 22:02:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_unpack_internal): Return -2 when negative overflow.
-	  (bary_unpack): Set the overflowed bit if an extra BDIGIT exists.
-	  (rb_integer_unpack): Set the overflowed bit.
-
-Thu Jun 20 21:17:19 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_rememberset_mark): record
-	  (1) normal objects count in remember set
-	  (2) shady objects count in remember set
-	  each GC timing.
-
-	* gc.c (gc_profile_record_get): enable to access above information
-	  and REMOVING_OBJECTS, EMPTY_OBJECTS.
-
-Thu Jun 20 18:29:26 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/gcbench.rb: Do not use GC::Profiler::disable because
-	  GC::Profiler::disable prohibit to access profiling data. It should
-	  be spec bug.
-
-	  Skip GC::Profiler::report if RUBY_VERSION < '2.0.0'
-
-Thu Jun 20 17:59:08 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/gcbench.rb: stop GC::Profiler before output results.
-	  Generating GC::Profiler result under profiling causes infinite loop.
-
-Thu Jun 20 17:24:24 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/gcbench.rb: don't use __dir__ to make compatible
-	  with ruby 1.9.3.
-
-Thu Jun 20 16:57:19 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/bm_app_aobench.rb: use attr_accessor/reader instead of
-	  defining methods.
-
-Thu Jun 20 16:46:46 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/bm_app_aobench.rb: added.
-
-	* benchmark/gc/aobench.rb: added.
-
-Thu Jun 20 16:28:33 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/bm_so_binary_trees.rb: disable `puts' method
-	  and change iteration parameter to increase execution time.
-
-	* benchmark/gc/binarytree.rb: added.
-
-Thu Jun 20 16:06:37 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/pentomino.rb: added.
-	  Simply load pentomino puzzle in the benchmark/ directory.
-
-Thu Jun 20 15:32:56 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc/redblack.rb: import red black tree benchmark from
-	  https://github.com/jruby/rubybench/blob/master/time/bench_red_black.rb
-
-	* benchmark/gc/ring.rb: add a benchmark. This benchmark create many
-	  old objects.
-
-Thu Jun 20 15:14:00 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* benchmark/gc: create a directory to store GC related benchmark.
-
-	* benchmark/gc/gcbench.rb: moved from tool/gcbench.rb.
-
-	* benchmark/gc/hash(1|2).rb: ditto.
-
-	* benchmark/gc/rdoc.rb: ditto.
-
-	* benchmark/gc/null.rb: added.
-
-	* common.mk: fix rule.
-
-Thu Jun 20 14:09:54 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* tool/hashbench1.rb: fix parameter too. Increase temporary objects.
-
-Thu Jun 20 14:01:35 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* tool/hashbench1.rb: fix parameters.
-
-Thu Jun 20 14:00:34 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* common.mk: remove dependency from ruby.
-
-Thu Jun 20 13:14:06 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_check_backtrace): evaluate RARRAY_AREF only once.
-	  the first argument of RB_TYPE_P is expanded twice for non-immediate
-	  types.
-
-Thu Jun 20 08:09:29 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* tool/gcbench.rb: Summary in one line.
-
-	* common.mk: separate gcbench-hash to gcbench-hash1 and gcbench-hash2.
-
-Thu Jun 20 08:07:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BIGSIZE): New macro.
-	  (bigfixize): Use BIGSIZE.
-	  (big2ulong): Ditto.
-	  (check_shiftdown): Ditto.
-	  (rb_big_aref): Ditto.
-
-Thu Jun 20 07:46:48 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (rb_gc_writebarrier): give up rescan A and register B directly
-	  if A has huge number of children.
-
-Thu Jun 20 07:30:35 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* common.mk: add new rules `gcbench-rdoc', `gcbench-hash'.
-
-	* tool/gcbench.rb: separate GC bench framework and process.
-
-	* tool/hashbench1.rb, tool/hashbench2.rb: add two types GC bench.
-	  hashbench1: many temporal objects (GC by newobj)
-	  hashbench2: hash size becomes bigger and bigger (GC by malloc)
-	  Two benches are executed by `gcbench-hash' rule.
-
-	* tool/rdocbench.rb: separated.
-
-Thu Jun 20 06:25:39 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* tool/rdocbench.rb: add summary.
-
-Thu Jun 20 06:18:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_profile_total_time): check objspace->profile.next_index > 0.
-
-Thu Jun 20 05:47:41 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_prof_sweep_timer_start): fix merge miss.
-
-	* gc.c (GC_PROFILE_MORE_DETAIL): set it 0.
-
-Thu Jun 20 05:38:56 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: Accumulate sweep time to GC time.
-	  Now [GC time] is [mark time] + [sweep time] + [misc].
-	  ([GC time] >= [mark time] + [sweep time])
-
-	* gc.c (gc_prof_sweep_slot_timer_start/stop): rename to
-	  gc_prof_sweep_timer_start/stop and locate at lazy_sweep().
-
-	* gc.c (elapsed_time_from): add a utility function.
-
-Thu Jun 20 05:08:53 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_marks): fix wrong option. FALSE means major/full GC.
-	  It should be TRUE (minor marking).
-
-Thu Jun 20 02:44:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (waitpid): should not return 0 but wait until exit
-	  unless WNOHANG is given.  waiting huge process may return while
-	  active, for some reason.
-
-Thu Jun 20 01:34:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bdigit_roomof): Use SIZEOF_BDIGITS.
-	  (bigfixize): Refine an ifdef condition.
-	  (rb_absint_size): Use bdigit_roomof.
-	  (rb_absint_singlebit_p): Ditto.
-	  (rb_integer_pack): Ditto.
-	  (integer_pack_fill_dd): Use BITSPERDIG.
-	  (integer_unpack_push_bits): Use BITSPERDIG, BIGLO and BIGDN.
-
-Thu Jun 20 01:07:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (MARKED_IN_BITMAP, FL_TEST2): return boolean value since always
-	  used as boolean value.
-
-	* gc.c (MARK_IN_BITMAP, CLEAR_IN_BITMAP): evaluate bits once.
-
-Thu Jun 20 00:05:07 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (RVALUE_PROMOTED): fix type.
-
-Wed Jun 19 23:39:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_marks_test): rewrite checking code.
-	  When RGENGC_CHECK_MODE >= 2, all minor marking, run normal minor
-	  marking *and* major/full marking. After that, compare the results
-	  and shows BUG if a object living with major/full marking but dead
-	  with minor marking.
-	  After detecting bugs, print references information.
-	  (RGENGC_CHECK_MODE == 2, show references to dead object)
-	  (RGENGC_CHECK_MODE == 3, show all references)
-
-Wed Jun 19 23:51:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigfixize): Use rb_absint_size.
-	  (check_shiftdown): Ditto.
-	  (big2ulong): Use bdigit_roomof.
-
-Wed Jun 19 23:32:23 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (RVALUE_PROMOTED): check consistency between oldgen flag and
-	  oldgen bitmap if RGENGC_CHECK_MODE > 0.
-
-Wed Jun 19 23:29:29 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_gc_force_recycle): clear oldgen bitmap, too.
-
-Wed Jun 19 21:02:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_uint2big): Consider environments BDIGIT is bigger than
-	  long.
-	  (big2ulong): Ditto.
-	  (rb_big_aref): Ditto.
-	  (rb_big_pack): Just call rb_integer_pack.
-	  (rb_big_unpack): Just call rb_integer_unpack.
-
-Wed Jun 19 20:51:21 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* gc.c (gc_stress_get): GC.stress can be Fixnum.
-
-Wed Jun 19 19:31:30 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (DIGSPERLONG): Don't define if BDIGIT is bigger than long.
-	  (DIGSPERLL): Don't define if BDIGIT is bigger than LONG_LONG
-	  (rb_absint_size): Consider environments BDIGIT is bigger than long.
-	  Use BIGLO and BIGDN.
-	  (rb_absint_singlebit_p): Ditto.
-	  (rb_integer_pack): Ditto.
-	  (bigsub_int): Consider environments BDIGIT is bigger than long.
-	  Use SIZEOF_BDIGITS instead of sizeof(BDIGIT).
-	  (bigadd_int): Ditto.
-	  (bigand_int): Ditto.
-	  (bigor_int): Ditto.
-	  (bigxor_int): Ditto.
-
-Wed Jun 19 15:14:30 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h (struct rb_data_type_struct), gc.c: add
-	  rb_data_type_struct::flags. Now, this flags is passed
-	  at T_DATA object creation. You can specify FL_WB_PROTECTED
-	  on this flag.
-
-	* iseq.c: making non-shady iseq objects.
-
-	* class.c, compile.c, proc.c, vm.c: add WB for iseq objects.
-
-	* vm_core.h, iseq.h: constify fields to detect WB insertion.
-
-Wed Jun 19 15:11:13 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (gc_mark_children): show more info for broken object.
-
-Wed Jun 19 14:04:41 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/ruby/envutil.rb (EnvUtil#rubybin): remove unnecessary
-	  unless expression.
-
-Wed Jun 19 07:47:48 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (garbage_collect_body): use FIX2INT for ruby_gc_stress.
-
-Wed Jun 19 07:44:31 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_objspace::gc_stress): int -> VALUE to store Fixnum object.
-
-Wed Jun 19 07:25:35 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (make_deferred): clear flags to T_ZOMBIE.
-
-	* gc.c (slot_sweep_body): fix indent.
-
-Wed Jun 19 07:18:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_aref): Apply BIGLO to ~xds[i] for environment which
-	  BDIGIT is 16bit.
-
-Wed Jun 19 07:09:26 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_remember): fix output level.
-
-	* gc.c (rgengc_rememberset_mark): fix to output clear count.
-	  (shady_object_count + clear_count = count of remembered objects)
-
-Wed Jun 19 07:06:21 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_remember): check T_NONE and T_ZOMBIE
-	  if RGENGC_CHECK_MODE > 0.
-
-Wed Jun 19 07:02:19 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (RGENGC_CHECK_MODE): add new check mode `3'.
-	  In this mode, show all references if there is
-	  a miss-corrected object.
-
-Wed Jun 19 06:31:08 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_stress_set): add special option of GC.stress.
-	  `GC.stress=(flag)' accepts integer to control behavior of GC.
-	  See code for details. Of course, this feature is only for MRI.
-
-	  You can debug RGenGC (WB) using `GC.stress = 1'.
-	  Using this option, do minor marking at all possible places.
-
-	  GC::STRESS_MINOR_MARK = 1 and GC::STRESS_LAZY_SWEEP = 2
-	  seem good to add.
-
-Wed Jun 19 06:29:31 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm.c (kwmerge_i): add WB.
-
-Wed Jun 19 06:26:49 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* hash.c: `st_update()' also has same issue of last fix.
-	  write barriers at callback function are too early.
-	  All write barriers are executed after `st_update()'
-
-Wed Jun 19 04:33:22 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* variable.c (rb_const_set): fix WB miss.
-
-	  WBs had located before creating reference between a klass
-	  and constant value. It causes GC bug.
-
-	    # pseudo code:
-	    WB(klass, value); # WB and remember klass
-	    st_insert(klass->const_table, const_id, value);
-
-	  `st_insert()' can cause GC before inserting `value' and
-	  forget `klass' from the remember set. After that, relationship
-	  between `klass' and `value' are created with constant table.
-	  Now, `value' can be young (shady) object and `klass' can be old
-	  object, without remembering `klass' object.
-	  At the next GC, old `klass' object will be skipped and
-	  young (shady) `value' will be miss-collected. -> GC bug
-
-	  Lesson: The place of a WB is important.
-
-Tue Jun 18 22:01:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_call_method): ensure methods of type
-	  VM_METHOD_TYPE_ATTR_SET are called with 1 argument
-
-	* test/ruby/test_module.rb
-	  (TestModule#test_attr_writer_with_no_arguments): add test
-	  [ruby-core:55543] [Bug #8540]
-
-Tue Jun 18 22:36:23 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (gc_profile_record_flag): fix typo.
-
-Tue Jun 18 22:08:53 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/objspace/object_tracing.c: Return for ::allocation_generation
-
-Tue Jun 18 22:04:35 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/objspace/object_tracing.c: Document object_tracing methods.
-
-Tue Jun 18 21:58:17 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* gc.c: Rename rb_mObSpace -> rb_mObjSpace
-
-Tue Jun 18 20:55:05 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/objspace/objspace.c: Document ObjectSpace::InternalObjectWrapper.
-
-Tue Jun 18 20:39:04 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/objspace/object_tracing.c: Teach rdoc object_tracing.c [Bug #8537]
-
-Tue Jun 18 20:29:47 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/.document: add object_tracing.c to document file
-
-Tue Jun 18 20:20:27 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/objspace/objspace.c: rdoc on require to overview from r41355
-
-Tue Jun 18 18:39:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Check __int128.
-
-	* include/ruby/defines.h (BDIGIT_DBL): Use uint128_t if it is available.
-	  (BDIGIT): Use uint64_t if uint128_t is available.
-	  (SIZEOF_BDIGITS): Defined for above case.
-	  (BDIGIT_DBL_SIGNED): Ditto.
-	  (PRI_BDIGIT_PREFIX): Ditto.
-
-	* include/ruby/ruby.h (PRI_64_PREFIX): Defined.
-
-	* bignum.c (rb_big_pow): Don't use BITSPERDIG for the condition which
-	  rb_big_pow returns Float or Bignum.
-
-	[ruby-dev:47413] [Feature #8509]
-
-Tue Jun 18 16:43:44 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_heredoc_restore): clear lex_strterm always to get
-	  rid of marking recycled node.  this bug is revealed by r41372 with
-	  GC.stress=true.
-
-Tue Jun 18 12:53:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (nlz): Cast the result explicitly.
-	  (big2dbl): Don't assign BDIGIT values to int variable.
-
-Tue Jun 18 12:25:16 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_xor): Non-effective code removed.
-
-Tue Jun 18 11:26:05 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_stat): add `generated_normal_object_count_types' for
-	  RGENGC_PROFILE >= 2.
-
-Tue Jun 18 11:02:18 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_mark_maybe): check to skip T_NONE.
-
-	* gc.c (markable_object_p): do not need to check (flags == 0) here.
-
-Tue Jun 18 10:17:37 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* variable.c (rb_autoload): fix WB miss.
-
-Tue Jun 18 04:20:18 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_mark_children): don't need to care about T_ZOMBIE here.
-
-Mon Jun 17 22:16:02 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/ruby/test_proc.rb (TestProc#test_block_given_method_to_proc):
-	  run test for r41359.
-
-Mon Jun 17 21:42:18 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* include/ruby/ruby.h, vm_eval.c (rb_funcall_with_block):
-	  new function to invoke a method with a block passed
-	  as an argument.
-
-	* string.c (sym_call): use the above function to avoid
-	  a block sharing. [ruby-dev:47438] [Bug #8531]
-
-	* vm_insnhelper.c (vm_yield_with_cfunc): don't set block
-	  in the frame.
-
-	* test/ruby/test_symbol.rb (TestSymbol#test_block_given_to_proc):
-	  run related tests.
-
-Mon Jun 17 21:33:27 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* include/ruby/intern.h, proc.c (rb_method_call_with_block):
-	  new function to invoke a Method object with a block passed
-	  as an argument.
-
-	* proc.c (bmcall): use the above function to avoid a block sharing.
-	  [ruby-core:54626] [Bug #8341]
-
-	* test/ruby/test_proc.rb (TestProc#test_block_persist_between_calls):
-	  run related tests.
-
-Mon Jun 17 20:53:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* loadpath.c (RUBY_REVISION): Defined to suppress revision.h
-	  inclusion actually.  r41352 removes the dependency.
-
-Mon Jun 17 18:15:57 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* ext/objspace/objspace.c: let rdoc know about objspace methods.
-	  Specify 'objspace' should be required. See #8537.
-
-Mon Jun 17 17:44:31 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* gc.c (ObjectSpace): is a module not a class.
-
-	* ext/objspace/objspace.c: try to include overview in rdoc,
-	  see #8537.
-
-Mon Jun 17 17:38:24 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* gc.c: fix example of ObjectSpace.define_finalizer in overview
-
-Mon Jun 17 16:59:53 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/tk/tkutil/tkutil.c: use rb_sprintf(), rb_id2str(), and
-	  rb_intern_str() instead of rb_intern() and RSTRING_PTR() with
-	  RB_GC_GUARD(), to prevent temporary objects from GC.
-	  [ruby-core:39000] [Bug #5199]
-
-Mon Jun 17 14:27:54 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm_backtrace.c: Update rdoc for Backtrace#label with @_ko1
-
-Mon Jun 17 13:04:01 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* tool/ifchange (until): Fix the condition, although harmless in
-	  this case.
-
-Mon Jun 17 11:50:29 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_mark_maybe): added. check `is_pointer_to_heap()' and
-	  type is not T_ZOMBIE.
-
-	* gc.c: use `gc_mark_maybe()'. T_ZOMBIE objects should not be pushed
-	  to the mark stack.
-
-Mon Jun 17 07:56:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_small_lshift): Renamed from bdigs_small_lshift.
-	  (bary_small_rshift): Renamed from bdigs_small_rshift.
-
-Mon Jun 17 07:38:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_bytes): Removed.
-	  (rb_absint_numwords): Don't call absint_numwords_bytes.
-
-Sun Jun 16 23:14:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (BARY_ADD): New macro.
-	  (BARY_SUB): Ditto.
-	  (BARY_MUL): Ditto.
-	  (BARY_DIVMOD): Ditto.
-	  (BARY_ZERO_P): Ditto.
-	  (absint_numwords_generic): Use these macros.
-
-Sun Jun 16 21:41:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_2comp): Extracted from get2comp.
-	  (integer_unpack_num_bdigits): Extracted from
-	  rb_integer_unpack_internal.
-	  (bary_unpack_internal): Renamed from bary_unpack and support
-	  INTEGER_PACK_2COMP.
-	  (bary_unpack): New function to validate arguments and invoke
-	  bary_unpack_internal.
-	  (rb_integer_unpack_internal): Removed.
-	  (rb_integer_unpack): Invoke bary_unpack_internal.
-	  (rb_integer_unpack_2comp): Removed.
-
-	* internal.h (rb_integer_unpack_2comp): Removed.
-
-	* pack.c: Follow the above change.
-
-Sun Jun 16 18:41:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (INTEGER_PACK_2COMP): Defined.
-	  (rb_integer_pack_2comp): Removed.
-
-	* bignum.c (bary_pack): Support INTEGER_PACK_2COMP.
-	  (rb_integer_pack): Invoke bary_pack directly.
-	  (rb_integer_pack_2comp): Removed.
-	  (rb_integer_pack_internal): Ditto.
-	  (absint_numwords_generic): Follow the above change.
-
-	* pack.c (pack_pack): Ditto.
-
-	* sprintf.c (rb_str_format): Ditto.
-
-Sun Jun 16 17:48:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_generic): rb_funcall invocations removed.
-
-Sun Jun 16 16:04:38 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/config_files.rb: use URI.read to allow it runs with Ruby 1.8.5.
-
-Sun Jun 16 14:32:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_pack) Extracted from rb_integer_pack_internal.
-	  (absint_numwords_generic): Use bary_pack.
-
-Sun Jun 16 11:01:57 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* NEWS (XMLRPC::Client#http): Add.
-	  [ruby-core:55197] [Feature #8461]
-
-Sun Jun 16 10:38:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_add): New function.
-	  (bary_zero_p): Extracted from bigzero_p.
-	  (absint_numwords_generic): Use bary_zero_p and bary_add.
-	  (bary_mul): Fix an argument for bary_mul_single.
-	  (bary_divmod): Use size_t for arguments.
-
-Sun Jun 16 08:55:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Use a BDIGIT variable to store the return
-	  value of bigdivrem_single.
-
-Sun Jun 16 08:43:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_divmod): New function.
-	  (absint_numwords_generic): Use bary_divmod.
-	  (bigdivrem_num_extra_words): Extracted from bigdivrem.
-	  (bigdivrem_single): Ditto.
-	  (bigdivrem_normal): Ditto.
-	  (BIGDIVREM_EXTRA_WORDS): Defined.
-
-Sun Jun 16 05:51:51 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c: Fixup around GC by MALLOC.
-	  Add allocate size to malloc_increase before GC
-	  for updating limit in after_gc_sweep.
-	  Reset malloc_increase into garbage_collect()
-	  for preventing GC again soon.
-
-Sun Jun 16 05:15:36 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c: Add some columns to more detail profile.
-	  new columns: Allocated size, Prepare Time, Removing Objects, Empty Objects
-
-Sun Jun 16 02:04:40 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (gc_prof_timer_stop): Merge function codes of GC_PROFILE_MORE_DETAIL and !GC_PROFILE_MORE_DETAIL.
-	* gc.c (gc_prof_mark_timer_start): Ditto.
-	* gc.c (gc_prof_mark_timer_stop): Ditto.
-	* gc.c (gc_prof_sweep_slot_timer_start): Ditto.
-	* gc.c (gc_prof_sweep_slot_timer_stop): Ditto.
-	* gc.c (gc_prof_set_malloc_info): Ditto.
-	* gc.c (gc_prof_set_heap_info): Ditto.
-
-Sat Jun 15 23:50:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_sub): New function.
-	  (absint_numwords_generic): Use bary_sub.
-	  (bigsub_core): Skip unnecessary copy.
-
-Sat Jun 15 22:05:30 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_mul): New function.
-	  (absint_numwords_generic): Use bary_mul.
-	  (bary_mul_single): Extracted from bigmul1_single.
-	  (bary_mul_normal): Extracted from bigmul1_normal.
-
-Sat Jun 15 20:13:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bary_unpack): Extracted from rb_integer_unpack_internal.
-	  (absint_numwords_generic): Use bary_unpack.
-	  (roomof): Defined.
-	  (bdigit_roomof): Defined.
-	  (BARY_ARGS): Defined.
-	  (bary_unpack): Declared.
-
-Sat Jun 15 19:35:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_bytes): Make it static.
-	  (absint_numwords_small): Ditto.
-	  (absint_numwords_generic): Ditto.
-
-Sat Jun 15 17:14:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigmul1_normal): Shrink the result Bignum length.
-
-Sat Jun 15 10:19:42 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/bigdecimal/bigdecimal.c: Update overview formatting of headers
-
-Sat Jun 15 10:19:06 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/bigdecimal/bigdecimal.gemspec: Update authors
-
-Sat Jun 15 10:02:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bdigs_small_rshift): Extracted from big_rshift.
-	  (bigdivrem): Use bdigs_small_rshift.
-
-Sat Jun 15 08:37:28 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (eval_string_with_cref): propagate absolute path from the
-	  binding if it is given explicitly.  patch by Gat (Dawid Janczak) at
-	  [ruby-core:55123]. [Bug #8436]
-
-Sat Jun 15 02:40:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bdigs_small_lshift): Extracted from big_lshift.
-	  (bigdivrem): Use bdigs_small_lshift.
-
-Fri Jun 14 20:47:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Reduce number of digits before bignew() for div.
-
-Fri Jun 14 20:12:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Use bignew when ny == 1.
-
-Fri Jun 14 18:52:51 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* compile.c (rb_iseq_compile_node): fix location of a `trace'
-	  instruction (b_return event).
-	  [ruby-core:55305] [ruby-trunk - Bug #8489]
-	  (need a backport to 2.0.0?)
-
-	* test/ruby/test_settracefunc.rb: add a test.
-
-Fri Jun 14 18:18:07 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* class.c, include/ruby/ruby.h: add write barriers for T_CLASS,
-	  T_MODULE, T_ICLASS.
-
-	* constant.h: constify rb_const_entry_t::value and file to detect
-	  assignment.
-
-	* variable.c, internal.h (rb_st_insert_id_and_value, rb_st_copy):
-	  added. update table with write barrier.
-
-	* method.h: constify some variables to detect assignment.
-
-	* object.c (init_copy): add WBs.
-
-	* variable.c: ditto.
-
-	* vm_method.c (rb_add_method): ditto.
-
-Fri Jun 14 14:33:47 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* NEWS: add a note for Module#using.
-
-Fri Jun 14 13:40:27 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* .travis.yml (before_script): update config files.
-
-	* common.mk ($(srcdir)/tool/config.{guess,sub}): use get-config_files.
-
-	* tool/config_files.rb: split get-config_files.
-
-	* common.mk (update-config_files): rule to download config files.
-
-	* tool/config.guess, tool/config.sub: remove and download from the
-	  upstream.
-
-	* tool/config_files.rb: download config files from GNU.
-
-Fri Jun 14 12:21:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (RUBY_SAFE_LEVEL_CHECK): suppress warnings
-	  "left-hand operand of comma expression has no effect", on gcc 4.4.
-
-Fri Jun 14 09:48:48 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* NEWS: add notes for $SAFE.
-
-	* doc/security.rdoc: remove the description of $SAFE=4.
-
-Fri Jun 14 00:14:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Zero test condition simplified.
-
-Thu Jun 13 23:43:11 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/bigdecimal/*: improve documentation, nodoc samples with @mrkn
-
-Thu Jun 13 23:02:14 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/xmlrpc/client.rb (XMLRPC::Client#http): Add reader for raw
-	  Net::HTTP. [ruby-core:55197] [Feature #8461]
-	  Reported by Herwin Weststrate. Thanks!!!
-
-Thu Jun 13 22:44:52 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/xmlrpc/client.rb (XMLRPC::Client#parse_set_cookies): Support
-	  multiple names in a response. [ruby-core:41711] [Bug #5774]
-	  Reported by Roman Riha. Thanks!!!
-	* test/xmlrpc/test_client.rb (XMLRPC::ClientTest#test_cookie_override):
-	  Add a test of the above case.
-
-Thu Jun 13 22:35:50 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/xmlrpc/client.rb (XMLRPC::Client#parse_set_cookies): Use
-	  guard style.
-
-Thu Jun 13 22:12:32 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/fileutils.rb (FileUtils#rmdir): fix traversal loop, not trying
-	  remove same directory only.
-
-Thu Jun 13 21:30:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (opt-dir), tool/ifchange: get rid of "alternate value"
-	  expansion for legacy sh.  [ruby-dev:47420] [Bug #8524]
-
-Thu Jun 13 21:24:09 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Refactored to use ALLOCV_N for temporary
-	  buffers.
-
-Thu Jun 13 18:54:11 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* bignum.c (integer_unpack_num_bdigits_generic): reorder terms (but not
-	  changed the intention of the expression) because VC++ reports a
-	  warning for it.  reported by ko1 via IRC.
-
-Thu Jun 13 18:53:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_thread.rb (test_thread_local_security): Don't create
-	  an unused thread.
-
-Thu Jun 13 18:34:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bigdivrem): Use nlz.
-
-Thu Jun 13 14:51:06 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (RUBY_SAFE_LEVEL_CHECK): check constant safe
-	  level at compile time.
-
-Thu Jun 13 14:39:08 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* test/-ext-/test_printf.rb, test/rss/test_parser.rb,
-	  test/ruby/test_array.rb, test/ruby/test_hash.rb,
-	  test/ruby/test_m17n.rb, test/ruby/test_marshal.rb,
-	  test/ruby/test_object.rb, test/ruby/test_string.rb: don't use
-	  untrusted?, untrust, and trust to avoid warnings in case $VERBOSE is
-	  true.
-
-Thu Jun 13 10:47:16 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* bootstraptest/test_autoload.rb, bootstraptest/test_method.rb:
-	  remove tests for $SAFE=4.
-
-	* lib/pp.rb: use taint instead of untrust to avoid warnings when
-	  $VERBOSE is set to true.
-
-Thu Jun 13 06:12:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_num_bdigits_small): Fix a compile error on
-	  clang -Werror,-Wshorten-64-to-32
-	  Reported by Eric Hodel.  [ruby-core:55467] [Bug #8522]
-
-Thu Jun 13 05:32:13 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/socket/extconf.rb:  Enable RFC 3542 IPV6 socket options for OS X
-	  10.7+.  [ruby-trunk - Bug #8517]
-
-Thu Jun 13 00:17:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_unpack_2comp): New function.
-	  (rb_integer_unpack_internal): Extracted from rb_integer_unpack and
-	  nlp_bits_ret argument added.
-	  (integer_unpack_num_bdigits_small): nlp_bits_ret argument added to
-	  return number of leading padding bits.
-	  (integer_unpack_num_bdigits_generic): Ditto.
-
-	* internal.h (rb_integer_unpack_2comp): Declared.
-
-	* pack.c (pack_unpack): Use rb_integer_unpack_2comp and
-	  rb_integer_unpack.
-
-Wed Jun 12 23:27:03 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* eval.c (mod_using): new method Module#using, which activates
-	  refinements of the specified module only in the current class or
-	  module definition.  [ruby-core:55273] [Feature #8481]
-
-	* test/ruby/test_refinement.rb: related test.
-
-Wed Jun 12 22:58:48 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* safe.c (rb_set_safe_level, safe_setter): raise an ArgumentError
-	  when $SAFE is set to 4.  $SAFE=4 is now obsolete.
-	  [ruby-core:55222] [Feature #8468]
-
-	* object.c (rb_obj_untrusted, rb_obj_untrust, rb_obj_trust):
-	  Kernel#untrusted?, untrust, and trust are now deprecated.
-	  Their behavior is same as tainted?, taint, and untaint,
-	  respectively.
-
-	* include/ruby/ruby.h (OBJ_UNTRUSTED, OBJ_UNTRUST): OBJ_UNTRUSTED()
-	  and OBJ_UNTRUST() are aliases of OBJ_TAINTED() and OBJ_TAINT(),
-	  respectively.
-
-	* array.c, class.c, debug.c, dir.c, encoding.c, error.c, eval.c,
-	  ext/curses/curses.c, ext/dbm/dbm.c, ext/dl/cfunc.c,
-	  ext/dl/cptr.c, ext/dl/dl.c, ext/etc/etc.c, ext/fiddle/fiddle.c,
-	  ext/fiddle/pointer.c, ext/gdbm/gdbm.c, ext/readline/readline.c,
-	  ext/sdbm/init.c, ext/socket/ancdata.c, ext/socket/basicsocket.c,
-	  ext/socket/socket.c, ext/socket/udpsocket.c,
-	  ext/stringio/stringio.c, ext/syslog/syslog.c, ext/tk/tcltklib.c,
-	  ext/win32ole/win32ole.c, file.c, gc.c, hash.c, io.c, iseq.c,
-	  load.c, marshal.c, object.c, proc.c, process.c, random.c, re.c,
-	  safe.c, string.c, thread.c, transcode.c, variable.c,
-	  vm_insnhelper.c, vm_method.c, vm_trace.c: remove code for
-	  $SAFE=4.
-
-	* test/dl/test_dl2.rb, test/erb/test_erb.rb,
-	  test/readline/test_readline.rb,
-	  test/readline/test_readline_history.rb, test/ruby/test_alias.rb,
-	  test/ruby/test_array.rb, test/ruby/test_dir.rb,
-	  test/ruby/test_encoding.rb, test/ruby/test_env.rb,
-	  test/ruby/test_eval.rb, test/ruby/test_exception.rb,
-	  test/ruby/test_file_exhaustive.rb, test/ruby/test_hash.rb,
-	  test/ruby/test_io.rb, test/ruby/test_method.rb,
-	  test/ruby/test_module.rb, test/ruby/test_object.rb,
-	  test/ruby/test_pack.rb, test/ruby/test_rand.rb,
-	  test/ruby/test_regexp.rb, test/ruby/test_settracefunc.rb,
-	  test/ruby/test_struct.rb, test/ruby/test_thread.rb,
-	  test/ruby/test_time.rb: remove tests for $SAFE=4.
-
-Wed Jun 12 22:18:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_num_bdigits_generic): Rewritten without
-	  rb_funcall.
-	  (integer_unpack_num_bdigits_bytes): Removed.
-	  (rb_integer_unpack): integer_unpack_num_bdigits_bytes invocation
-	  removed.
-
-Wed Jun 12 20:18:03 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/xmlrpc/client.rb (XMLRPC::Client#parse_set_cookies): Extract.
-
-Wed Jun 12 18:19:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_pack_format): supported_flags argument
-	  added and validate given flags.
-	  (rb_integer_pack_internal): Specify supported_flags.
-	  (rb_integer_unpack): Ditto.
-
-Wed Jun 12 16:41:38 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_sort_bang): remove duplicated assertions.
-	  ARY_HEAP_PTR() implies ary not to be embedded.  [ruby-dev:47419]
-	  [Bug #8518]
-
-Wed Jun 12 12:44:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (io_getc): fix 7bit coderange condition, check if ascii read
-	  data instead of read length. [ruby-core:55444] [Bug #8516]
-
-Wed Jun 12 12:35:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c (pack_pack): Use rb_integer_pack_2comp.
-
-Wed Jun 12 12:07:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* sprintf.c (rb_str_format): Fix a dynamic format string.
-
-Wed Jun 12 12:04:09 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_uniq_bang): must not be modified once frozen even in
-	  a callback method.
-
-Wed Jun 12 12:03:43 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_sort_bang): must not be modified once frozen even in
-	  a callback method.
-
-Wed Jun 12 12:00:15 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (FL_SET_EMBED): shared object is frozen even when get
-	  unshared.
-
-	* array.c (rb_ary_modify): ARY_SET_CAPA needs unshared array.
-
-Wed Jun 12 07:32:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (rand_int): Use rb_big_uminus.
-
-Wed Jun 12 07:12:54 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* struct.c:  Improve documentation: replace "instance variable" with
-	  "member", recommend the use of a block to customize structs, note
-	  that member accessors are created, general cleanup.
-
-Wed Jun 12 06:35:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (INTEGER_PACK_NEGATIVE): Defined.
-	  (rb_integer_unpack): sign argument removed.
-
-	* bignum.c (rb_integer_unpack): sign argument removed.
-	  Non-negative integers generated by default.
-	  INTEGER_PACK_NEGATIVE flag is used to generate non-positive integers.
-
-	* pack.c (pack_unpack): Follow the above change.
-
-	* random.c (int_pair_to_real_inclusive): Ditto.
-	  (make_seed_value): Ditto.
-	  (mt_state): Ditto.
-	  (limited_big_rand): Ditto.
-
-	* marshal.c (r_object0): Ditto.
-
-Wed Jun 12 00:07:46 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/xmlrpc/test_client.rb (XMLRPC::ClientTest#test_cookie_simple):
-	  Add a test for the extracted method.
-
-Tue Jun 11 23:56:24 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/xmlrpc/test_client.rb (XMLRPC::ClientTest::Fake::HTTP#started):
-	  Add a missing empty line.
-
-Tue Jun 11 23:37:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_pack_format): Don't require a word order
-	  flag if numwords is 1 or less.
-	  (absint_numwords_generic): Don't specify a word order for
-	  rb_integer_pack.
-
-	* hash.c (rb_hash): Ditto.
-
-	* time.c (v2w_bignum): Ditto.
-
-Tue Jun 11 23:01:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_pack_format): Refine error messages.
-
-Tue Jun 11 22:25:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_pack_format): numwords argument added.
-	  Move a varidation from rb_integer_pack_internal and rb_integer_unpack.
-	  (rb_integer_pack_internal): Follow above change.
-	  (rb_integer_unpack): Ditto.
-
-Tue Jun 11 20:52:43 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_pack_internal): Renamed from rb_integer_pack
-	  and overflow_2comp argument added.
-	  (rb_integer_pack): Just call rb_integer_pack_internal.
-	  (rb_integer_pack_2comp): New function.
-
-	* internal.h (rb_integer_pack_2comp): Declared.
-
-	* sprintf.c (rb_str_format): Use rb_integer_pack and
-	  rb_integer_pack_2comp to format binary/octal/hexadecimal integers.
-	  (ruby_digitmap): Declared.
-	  (remove_sign_bits): Removed.
-	  (BITSPERDIG): Ditto.
-	  (EXTENDSIGN): Ditto.
-
-Tue Jun 11 16:15:03 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (ary_shrink_capa): shrink the capacity so it fits just with
-	  the length.
-
-	* array.c (ary_make_shared): release never used elements from frozen
-	  array to be shared.  [ruby-dev:47416] [Bug #8510]
-
-Tue Jun 11 12:49:01 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* doc/re.rdoc: Rename to doc/regexp.rdoc
-	* re.c: Update rdoc include for rename of file
-
-Tue Jun 11 07:13:13 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* eval_error.c (error_print): keep that errat is non-shady object.
-	  and guard errat from GC.
-
-Tue Jun 11 05:04:25 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* ext/racc/cparse/cparse.c: use rb_ary_entry() and
-	  rb_ary_subseq() instead of RARRAY_PTR.
-	  Based on a patch by Dirkjan Bussink. See Bug #8399.
-
-Mon Jun 10 23:51:51 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* array.c (rb_ary_new_from_values): fix a typo. pointed out by
-	  nagachika.
-	  http://d.hatena.ne.jp/nagachika/20130610/ruby_trunk_changes_41199_41220
-
-Mon Jun 10 21:51:03 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* ext/socket/raddrinfo.c (nogvl_getaddrinfo): Fix indent.
-
-Mon Jun 10 21:49:43 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* ext/socket/raddrinfo.c (nogvl_getaddrinfo): Add missing return
-	  value assignment.
-
-Mon Jun 10 20:58:11 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/raddrinfo.c (nogvl_getaddrinfo): work around for Ubuntu
-	  13.04's getaddrinfo issue with mdns4. [ruby-list:49420]
-
-Mon Jun 10 19:34:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_pack): Returns sign instead of words.
-	  (absint_numwords_generic): Follow the above change.
-	  (big2str_base_powerof2): Follow the above change.
-
-	* internal.h: Ditto.
-
-	* hash.c (rb_hash): Ditto.
-
-	* pack.c (pack_pack): Ditto.
-
-	* random.c (int_pair_to_real_inclusive): Ditto.
-	  (rand_init): Ditto.
-	  (random_load): Ditto.
-	  (limited_big_rand): Ditto.
-
-	* time.c (v2w_bignum): Ditto.
-
-Mon Jun 10 17:20:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rgengc_remember): permit promoted object.
-	  (rb_gc_writebarrier -> remember)
-
-Mon Jun 10 17:14:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (RVALUE_PROMOTE): fix parameter name (`x' to `obj')
-	  and make it inline function (like RVALUE_PROMOTE).
-
-Mon Jun 10 16:22:50 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* array.c (rb_ary_new_from_values): add assertion
-	  (ary should be young object).
-
-Mon Jun 10 16:05:59 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (wmap_mark): check allocation of `w->obj2wmap'.
-	  (no-allocation `w->obj2wmap' will be NULL pointer reference)
-
-Mon Jun 10 15:36:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* eval_error.c (error_print): use checking functions instead of
-	  catching exceptions.
-
-	* eval_error.c (error_print): restore errinfo for the case new
-	  exception raised while printing the message.  [ruby-core:55365]
-	  [Bug #8501]
-
-	* eval_error.c (error_print): reduce calling setjmp.
-
-Mon Jun 10 12:10:06 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_unpack_num_bdigits_small: Extracted from
-	  rb_integer_unpack.
-	  (integer_unpack_num_bdigits_generic): Ditto.
-	  (integer_unpack_num_bdigits_bytes): New function.
-	  (rb_integer_unpack): Use above functions.
-	  Return a Bignum for INTEGER_PACK_FORCE_BIGNUM even when the result
-	  is zero.
-
-Mon Jun 10 05:38:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_small): New function.
-	  (absint_numwords_generic): Use absint_numwords_small if possible.
-
-Mon Jun 10 01:07:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (absint_numwords_bytes): New function.
-	  (absint_numwords_generic): Extracted from rb_absint_numwords.
-	  (rb_absint_numwords): Use absint_numwords_bytes if possible.
-
-Sun Jun  9 21:33:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_numwords): Return (size_t)-1 when overflow.
-	  Refine variable names.
-	  (rb_absint_size): Refine variable names.
-
-	* internal.h (rb_absint_size): Refine an argument name.
-	  (rb_absint_numwords): Ditto.
-
-Sun Jun  9 16:51:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_numwords): Renamed from rb_absint_size_in_word.
-
-	* internal.h (rb_absint_numwords): Follow the above change.
-
-	* pack.c (pack_pack): Ditto.
-
-	* random.c (rand_init): Ditto.
-	  (limited_big_rand): Ditto.
-
-Sun Jun  9 14:41:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_pack): numwords_allocated argument removed.
-
-	* internal.h (rb_integer_pack): Follow the above change.
-
-	* hash.c (rb_hash): Ditto.
-
-	* time.c (v2w_bignum): Ditto.
-
-	* pack.c (pack_pack): Ditto.
-
-	* random.c (int_pair_to_real_inclusive): Ditto.
-	  (rand_init): Ditto.
-	  (random_load): Ditto.
-	  (limited_big_rand): Ditto.
-
-Sun Jun  9 09:34:44 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big2str_base_powerof2): New function.
-	  (rb_big2str0): Use big2str_base_powerof2 if base is 2, 4, 8, 16 or 32.
-
-Sun Jun  9 00:59:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* hash.c (rb_hash): Use rb_integer_pack to obtain least significant
-	  long integer.
-
-Sat Jun  8 23:56:00 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (rb_num_to_uint): Use rb_absint_size instead of
-	  RBIGNUM_LEN.
-
-Sat Jun  8 22:53:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* marshal.c (r_object0): Use rb_integer_unpack.
-
-Sat Jun  8 22:18:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (v2w): Use rb_absint_size instead of RBIGNUM_LEN.
-
-Sat Jun  8 21:47:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (v2w_bignum): Simplified using rb_integer_pack.
-	  (rb_big_abs_find_maxbit): Removed.
-
-Sat Jun  8 21:03:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_singlebit_p): New function.
-
-	* internal.h (rb_absint_singlebit_p): Declared.
-
-	* time.c (v2w_bignum): Use rb_absint_singlebit_p instead of
-	  rb_big_abs_find_minbit.
-	  (rb_big_abs_find_minbit): Removed.
-
-Sat Jun  8 20:24:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (rb_big_abs_find_maxbit): Use rb_absint_size.
-	  (bdigit_find_maxbit): Removed.
-
-Sat Jun  8 19:47:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* class.c (include_modules_at): invalidate method cache if included
-	  module contains constants
-
-	* test/ruby/test_module.rb: add test
-
-Sat Jun  8 19:31:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* random.c (limited_big_rand): declare rnd, lim and mask as uint32_t
-	  to avoid 64 bit to 32 bit shorten warnings.
-
-Sat Jun  8 19:23:53 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* win32/Makefile.sub: r41163 changed win32/win32.c and configure.in
-	  but it didn't treat about mswin32/mswin64, so fix it.
-	  NOTE: this needs a review by usa whether additional condition is
-	  required or not.
-
-Sat Jun  8 19:06:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c: Unused RBignum internal accessing macros removed.
-
-Sat Jun  8 19:04:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (limited_big_rand): The argument, limit, is changed to
-	  VALUE.  Use rb_integer_pack and rb_integer_unpack.
-
-Sat Jun  8 17:15:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (make_seed_value): Fix the length given for
-	  rb_integer_unpack.
-
-Sat Jun  8 16:38:02 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_unpack): Don't use rb_funcall if possible.
-
-	* random.c: Use uint32_t for elements of seed.
-	  (make_seed_value): Use rb_integer_unpack.
-
-Sat Jun  8 15:58:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (rand_init): Add a cast to fix clang compile error:
-	  random.c:410:32: error: implicit conversion loses integer precision:
-	  'size_t' (aka 'unsigned long') to 'int' [-Werror,-Wshorten-64-to-32]
-	  This cast doesn't cause a problem because len is not bigger than
-	  MT_MAX_STATE.
-
-Sat Jun  8 15:30:03 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (rand_init): Use rb_integer_pack.
-	  (roomof): Removed.
-
-Sat Jun  8 14:58:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (INTEGER_PACK_FORCE_BIGNUM): New flag constant.
-
-	* bignum.c (rb_integer_unpack): Support INTEGER_PACK_FORCE_BIGNUM.
-
-	* random.c (int_pair_to_real_inclusive): Use
-	  INTEGER_PACK_FORCE_BIGNUM to use rb_big_mul instead of rb_funcall.
-
-Sat Jun  8 14:17:01 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: check for NET_LUID.  header macro varies across
-	  compiler versions.
-
-	* win32/win32.c: use configured macro.
-
-Sat Jun  8 11:59:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (int_pair_to_real_inclusive): Use rb_funcall instead of
-	  rb_big_mul because rb_integer_unpack can return a Fixnum.
-
-Sat Jun  8 11:17:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (int_pair_to_real_inclusive): Use rb_integer_pack.
-
-Sat Jun  8 09:49:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (int_pair_to_real_inclusive): Use rb_integer_unpack.
-
-Sat Jun  8 08:12:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (random_load): Use rb_integer_pack.
-
-Sat Jun  8 06:15:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (numberof): Removed.
-
-Sat Jun  8 06:00:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c: include internal.h.
-	  (mt_state): Use rb_integer_unpack.
-
-Sat Jun  8 00:55:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_pack_loop_setup): word_num_nailbytes_ret argument
-	  removed.
-	  (rb_integer_pack): Follow the above change.
-	  (rb_integer_unpack): Follow the above change.
-
-Sat Jun  8 00:37:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_pack_format): Renamed from
-	  validate_integer_format.
-	  (integer_pack_loop_setup): Renamed from integer_format_loop_setup.
-	  (integer_pack_fill_dd): Renamed from int_export_fill_dd.
-	  (integer_pack_take_lowbits): Renamed from int_export_take_lowbits.
-	  (integer_unpack_push_bits): Renamed from int_import_push_bits.
-
-Fri Jun  7 23:58:06 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_pack): Arguments changed.  Use flags to
-	  specify word order and byte order.
-	  (rb_integer_unpack): Ditto.
-	  (validate_integer_format): Follow the above change.
-	  (integer_format_loop_setup): Ditto.
-
-	* pack.c: Ditto.
-
-	* internal.h: Ditto.
-	  (INTEGER_PACK_MSWORD_FIRST): Defined.
-	  (INTEGER_PACK_LSWORD_FIRST): Ditto.
-	  (INTEGER_PACK_MSBYTE_FIRST): Ditto.
-	  (INTEGER_PACK_LSBYTE_FIRST): Ditto.
-	  (INTEGER_PACK_NATIVE_BYTE_ORDER): Ditto.
-	  (INTEGER_PACK_LITTLE_ENDIAN): Ditto.
-	  (INTEGER_PACK_BIG_ENDIAN): Ditto.
-
-Fri Jun  7 22:10:50 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/rubygems/specification.rb (Gem::Specification#to_yaml):
-	  use Gem::NoAliasYAMLTree.create instead of Gem::NoAliasYAMLTree.new
-	  to suppress deprecated warnings.
-
-Fri Jun  7 21:39:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_integer_pack): Renamed from rb_int_export.
-	  (rb_integer_unpack): Renamed from rb_int_import.
-
-	* internal.h, pack.c: Follow the above change.
-
-Fri Jun  7 21:05:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (integer_format_loop_setup): Extracted from rb_int_export
-	  and rb_int_import.
-
-Fri Jun  7 19:48:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (validate_integer_format): Extracted from rb_int_export and
-	  rb_int_import.
-
-Fri Jun  7 19:23:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_size): Use numberof.
-	  (rb_int_export): Ditto.
-
-Fri Jun  7 18:58:56 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (numberof): Gathered from various files.
-
-	* array.c, math.c, thread_pthread.c, iseq.c, enum.c, string.c, io.c,
-	  load.c, compile.c, struct.c, eval.c, gc.c, parse.y, process.c,
-	  error.c, ruby.c: Remove the definitions of numberof.
-
-Fri Jun  7 18:24:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_absint_size): Declare a variable, i, just before used
-	  to suppress a warning.
-	  (rb_int_export): Ditto.
-
-Fri Jun  7 17:41:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* bignum.c (rb_absint_size): explicit cast to BDIGIT to avoid implicit
-	  64 bit to 32 bit shortening warning
-	* bignum.c (rb_int_export): ditto
-	* bignum.c (int_import_push_bits): ditto
-
-Fri Jun  7 17:31:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* internal.h (RCLASS_SUPER): use descriptive variable name
-	* internal.h (RCLASS_SET_SUPER): ditto
-
-Fri Jun  7 13:25:27 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json/fbuffer/fbuffer.h (fbuffer_append_str): change the place of
-	  RB_GC_GUARD. it should be after the object is used.
-
-Fri Jun  7 13:22:43 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (before_gc_sweep): noinline can also avoid the segv instead of
-	  -O0 of r41084. this way is expected less slow.
-
-Fri Jun  7 11:45:42 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* rational.c (numeric_quo): move num_quo in numeric.c to numeric_quo
-	  in rational.c to refer canonicalization state for mathn support.
-	  [ruby-core:41575] [Bug #5736]
-
-	* numeric.c (num_quo): ditto.
-
-	* test/test_mathn.rb: add a test for the change at r41109.
-
-Fri Jun  7 11:41:42 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: revert r41106.  size_t may not be unsigned
-
-	* bignum.c (rb_absint_size_in_word, rb_int_export, rb_int_import): use
-	  NUM2SIZET() and SIZET2NUM() already defined in ruby/ruby.h.
-
-Fri Jun  7 11:28:37 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c: use oldgen bitmap as initial mark bitmap when major gc.
-	  so can skip oldgen bitmap check around mark & sweep.
-	* gc.c (slot_sweep_body): change scan algorithm for performance:
-	  from object's pointer base to bitmap one.
-
-Fri Jun  7 11:25:56 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c: introduce oldgen bitmap for preparing performance tuning.
-
-Fri Jun  7 11:20:57 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (MARKED_IN_BITMAP, MARK_IN_BITMAP, CLEAR_IN_BITMAP): bring
-	  bitmap macros in one place, and introduce BITMAP_BIT.
-
-Fri Jun  7 11:18:35 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* array.c (ary_new): change order of allocation in order
-	  to remove FL_OLDGEN operation.
-
-Fri Jun  7 11:16:28 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* tool/rdocbench.rb: add gc total time information.
-
-Fri Jun  7 10:12:01 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: remove "Sunny" terminology.
-	  "Sunny" doesn't mean antonym of "Shady" (questionable, doubtful, etc).
-	  Instead of "Sunny", use "non-shady" or "normal".
-
-Fri Jun  7 09:29:33 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* bignum.c (rb_int_import): explicitly casting BDIGIT_DBL to BDIGIT
-	  to prevent warning.
-
-Fri Jun  7 07:29:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (rb_int_export): countp argument is split into
-	  wordcount_allocated and wordcount.
-
-	* bignum.c (rb_int_export): Follow the above change.
-
-	* pack.c (pack_pack): Ditto.
-
-Fri Jun  7 07:17:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* NEWS: describe a compatibility issue of Numeric#quo
-	  introduced at r41109.
-
-Fri Jun  7 07:15:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* NEWS: fix style.
-
-Fri Jun  7 06:48:17 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* numeric.c: remove unused ID id_to_r introduced in r41109.
-
-Fri Jun  7 06:15:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_int_import): New function.
-	  (int_import_push_bits): Ditto.
-
-	* internal.h (rb_int_import): Declared.
-
-	* pack.c (pack_unpack): Use rb_int_import for BER compressed integer.
-
-Thu Jun  6 22:24:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* numeric.c (num_quo): Use to_r method to convert the receiver to
-	  rational.  [ruby-core:41575] [Bug #5736]
-
-	* test/ruby/test_numeric.rb: add a test for the above change.
-
-Thu Jun  6 20:40:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Invoke RUBY_REPLACE_TYPE for size_t.
-	  Don't invoke RUBY_CHECK_PRINTF_PREFIX for size_t to avoid conflict
-	  with RUBY_REPLACE_TYPE.
-
-	* internal.h (rb_absint_size): Declared.
-	  (rb_absint_size_in_word): Ditto.
-	  (rb_int_export): Ditto.
-
-	* bignum.c (rb_absint_size): New function.
-	  (rb_absint_size_in_word): Ditto.
-	  (int_export_fill_dd): Ditto.
-	  (int_export_take_lowbits): Ditto.
-	  (rb_int_export): Ditto.
-
-	* pack.c (pack_pack): Use rb_int_export for BER compressed integer.
-
-Thu Jun  6 19:31:33 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: fixed coding error [ruby-core:55337].
-	  reported by Riley Lynch.
-
-Thu Jun  6 14:16:37 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* ext/objspace/object_tracing.c: rename allocation_info to
-	  lookup_allocation_info. At times I confused "struct
-	  allocation_info" with "function allocation_info".
-
-Thu Jun  6 13:57:06 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* ext/objspace/object_tracing.c: allocation_info function isn't
-	  called by any other file.
-
-Thu Jun  6 09:41:00 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* numeric.c (num_quo): should return a Float for a Float argument.
-	  [ruby-dev:44710] [Bug #5515]
-
-	* test/ruby/test_fixnum.rb: Add an assertion for the above change.
-
-	* test/ruby/test_bignum.rb: ditto.
-
-Thu Jun  6 00:59:44 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (gc_mark): get rid of pushing useless objects.
-	* gc.c (rgengc_rememberset_mark): bypass gc_mark() in order to push
-	  sunny old object at minor gc.
-	* gc.c (gc_mark_children): move sunny old check to gc_mark().
-	* gc.c (rgengc_check_shady): remove DEMOTE that already unnecessary.
-	* gc.c (rb_gc_writebarrier): ditto.
-
-	  change sunny old check point in order to save mark stack and
-	  remove unnatural rest_sweep & demote.
-
-Thu Jun  6 00:52:42 2013  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* gc.c (rgengc_rememberset_mark): change scan algorithm for performance:
-	  from object's pointer base to bitmap one.
-
-Thu Jun  6 00:30:04 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* win32/win32.c (NET_LUID): define it on MinGW32.
-	  mingw-w64 has NET_LUID but mingw32 (mingw.org) still doesn't have
-	  NET_LUID. reported by taco on IRC
-
-Thu Jun  6 00:05:08 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* string.c (String#b): Allow code range scan to happen later so
-	  ascii_only? on a result string returns the correct value.
-	  [ruby-core:55315] [Bug #8496]
-
-Wed Jun  5 22:40:42 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (capability_response): should ignore trailing
-	  spaces.  Thanks, Peter Kovacs.  [ruby-core:55024] [Bug #8415]
-
-	* test/net/imap/test_imap_response_parser.rb: related test.
-
-Wed Jun  5 21:17:08 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (big_fdiv): Use nlz() instead of bdigbitsize().
-	  (bdigbitsize): Removed.
-
-Wed Jun  5 20:32:00 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* include/ruby/ruby.h: fix alignment in comment.
-
-Wed Jun  5 20:05:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* random.c (int_pair_to_real_inclusive): Add a cast to BDIGIT.
-	  (random_load): Fix shift width for fixnums.
-	  Re-implement bignum extraction without ifdefs.
-
-Wed Jun  5 15:26:10 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (before_gc_sweep): don't optimize it to avoid segv on Ubuntu
-	  10.04 gcc 4.4.
-	  http://u32.rubyci.org/~chkbuild/ruby-trunk/log/20130527T190301Z.diff.html.gz
-
-Wed Jun  5 09:46:46 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/fileutils/test_fileutils.rb (TestFileUtils#test_mkdir): add
-	  EACCES for Windows.
-
-Wed Jun  5 08:13:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_big_pow): Don't need to multiply SIZEOF_BDIGITS.
-	  Use nlz instead of bitlength_bdigit.
-	  (bitlength_bdigit): Removed.
-
-Wed Jun  5 07:14:18 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c (d_lite_cmp, d_lite_equal): simplified.
-
-Wed Jun  5 07:07:01 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: fixed a bug [ruby-core:55295].  reported
-	  by Riley Lynch.
-
-Wed Jun  5 06:44:08 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 2.0.3
-
-	* test/rubygems:  Tests for the above.
-
-	* NEWS:  Added RubyGems 2.0.3 note.
-
-Wed Jun  5 06:35:15 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/marshal.rdoc:  Add description of Marshal format.
-
-Wed Jun  5 01:16:09 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* array.c (Array#+): fix documentation example.
-	  Patch by Logan Serman. [Fixes GH-324]
-
-Wed Jun  5 00:21:54 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/irb/lc/ja/help-message: update help messages.
-	  following r41028. [ruby-dev:46707] [Feature #7510]
-
-Wed Jun  5 00:09:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* marshal.c (r_object0): Generalize a round up expression.
-	  Use BDIGIT instead of int.
-
-Tue Jun  4 23:44:02 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* object.c (rb_Hash): fix docs. patched by Stefan Sch"ussler.
-	  [ruby-core:55299] [Bug #8487]
-
-Tue Jun  4 23:16:49 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* lib/irb/completion.rb: Use %w literal construction for long lists.
-	  Patch by Dave Goodchild. [Fixes GH-299]
-
-Tue Jun  4 23:08:42 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* ext/objspace/objspace.c: improve wording and remove duplicated comment.
-	  Based on a patch by Dave Goodchild. [Fixes GH-299]
-
-Tue Jun  4 18:41:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bitlength_bdigit): Fix an off-by-one error.
-
-Tue Jun  4 15:30:00 2013  Kenta Murata  <mrkn@cookpad.com>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb (Float#to_d): fix the number
-	  of figures.  Patch by Vipul A M <vipulnsward@gmail.com>.
-	  https://github.com/ruby/ruby/pull/323  fix GH-323
-
-	* test/bigdecimal/test_bigdecimal_util.rb: fix for the above change.
-
-Tue Jun  4 00:44:27 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/fileutils/test_fileutils.rb (TestFileUtils#test_mkdir): add
-	  EEXIST for Linux. (suggested by nurse)
-
-Mon Jun  3 23:58:19 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/fileutils.rb (FileUtils.rmdir): use remove_tailing_slash.
-	* test/fileutils/test_fileutils.rb: test for above.
-
-Mon Jun  3 23:47:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (bitlength_bdigit): New function.
-	  (rb_big_pow): Use bitlength_bdigit instead of ffs.
-
-Mon Jun  3 23:11:19 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/fileutils.rb: fix behavior when mkdir/mkdir_p accepted "/".
-	* test/fileutils/test_fileutils.rb: add test for above change.
-	  Patched by Mitsunori Komatsu. [GH-319]
-
-Mon Jun  3 19:02:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (is_hfs): use the file descriptor instead of a path.
-
-Mon Jun  3 07:15:17 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: removes AC_CHECK_FUNCS(readdir_r). readdir_r()
-	  is only used from dir.c and it doesn't need readdir_r().
-	* configure.in (SIZEOF_STRUCT_DIRENT_TOO_SMALL): removed. It is
-	  only used for readdir_r.
-	* dir.c: removes NAME_MAX_FOR_STRUCT_DIRENT. It is not right way
-	  to detect maximum length of path len. POSIX require to use
-	  fpathconf(). IOW, it might have lead to make a vulnerability
-	  using stack smashing. Moreover, readdir() works enough for our
-	  usage.
-	* dir.c (READDIR): removes an implementation which uses
-	  readdir_r() and parenthesize in a macro body correctly.
-	* dir.c (dir_read): removes IF_HAVE_READDIR_R(DEFINE_STRUCT_DIRENT
-	  entry), it is used only for readdir_r().
-	* dir.c (dir_each): ditto.
-	* dir.c (glob_helper): ditto.
-
-	* dir.c (READDIR): removes entry and dp argument.
-	* dir.c (dir_read): adjust for the above change.
-	* dir.c (dir_each): ditto.
-	* dir.c (glob_helper): ditto.
-
-Mon Jun  3 03:40:29 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_yield_setup_block_args): partially revert r41019.
-	  The code is not useless.
-
-Mon Jun  3 01:25:25 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/socket/test_sockopt.rb: change test name. follow r41037.
-
-Mon Jun  3 01:08:43 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/rinda/test_rinda.rb: rename functions introduced in r41009.
-
-Sun Jun  2 23:33:42 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* enc/trans/japanese_euc.trans, test/ruby/test_transcode.rb,
-	  tool/transcode-tblgen.rb: change EUC-JP-2004 to EUC-JIS-2004.
-	  This is follow up to changes in r41024.
-
-Sun Jun  2 22:44:42 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/option.c: rename functions introduced in r41009
-	  s/ip/ipv4/g because they are ipv4 functions.
-	  (there's a policy that the name "ip" is for methods which supports
-	   both ipv4 and ipv6)
-
-Sun Jun  2 16:15:29 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dln_find.c (dln_find_exe, dln_find_file): remove deprecated
-	  non-reentrant functions.
-
-Sun Jun  2 15:04:35 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/cgi/util.rb, lib/erb.rb: Use String#b [Feature #8394] by znz
-
-Sun Jun  2 14:10:21 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/irb/lc/help-message: Apply english updates for irb --help #7510
-
-Sun Jun  2 12:03:58 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* range.c: Fix rdoc on Range#bsearch [Bug #8242] [ruby-core:54143]
-
-Sun Jun  2 02:08:37 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enc/euc_jp.c: fix typo: the name of EUC-JIS-2004.
-
-Sat Jun  1 23:17:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* vm_eval.c (rb_mod_module_eval): mention in docs that arguments passed
-	  to the method are passed to the block
-
-Sat Jun  1 17:58:13 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#freeze, taint, untaint): Save a "self" by
-	  utilizing super returning self, and add tests while at it.
-
-Sat Jun  1 17:24:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_set_arguments): not a simple single argument if any
-	  keyword arguments exist.  [ruby-core:55203] [Bug #8463]
-
-	* vm_insnhelper.c (vm_yield_setup_block_args): split single parameter
-	  if any keyword arguments exist, and then extract keyword arguments.
-	  [ruby-core:55203] [Bug #8463]
-
-Sat Jun  1 11:16:22 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_exc_new_cstr): rename from rb_exc_new2.
-
-	* error.c (rb_exc_new_str): rename from rb_exc_new3.
-
-Sat Jun  1 10:13:17 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_new[2-5], rb_{tainted,usascii}_str_new2),
-	  (rb_str_buf_new2): remove old interfaces.
-
-Sat Jun  1 08:00:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/zlib/zlib.c (gzfile_read, gzfile_read_all, gzfile_getc),
-	  (gzreader_gets): check EOF.  [ruby-core:55220] [Bug #8467]
-
-Sat Jun  1 07:32:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Use BDIGIT type for hbase.
-
-Sat Jun  1 02:37:35 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/option.c (sockopt_s_byte): constructor of the sockopt
-	  whose value's is byte.
-
-	* ext/socket/option.c (sockopt_byte): getter for above.
-
-	* ext/socket/option.c (inspect_byte): inspect for above.
-
-	* ext/socket/option.c (sockopt_s_ip_multicast_loop): constructor of
-	  the sockopt whose optname is IP_MULTICAST_LOOP.
-
-	* ext/socket/option.c (sockopt_ip_multicast_loop): getter for above.
-
-	* ext/socket/option.c (sockopt_s_ip_multicast_ttl): constructor of
-	  the sockopt whose optname is IP_MULTICAST_TTL.
-
-	* ext/socket/option.c (sockopt_ip_multicast_ttl): getter for above.
-
-	* ext/socket/option.c (sockopt_inspect): use above.
-
-Sat Jun 01 01:50:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_power): use rb_dbl2big
-	  to convert a double value to a Bignum.
-
-Sat Jun  1 00:19:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (calc_hbase): Make hbase the maximum power of base
-	  representable in BDIGIT.
-
-Fri May 31 23:56:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (calc_hbase): Extracted from rb_big2str0.
-
-Fri May 31 23:22:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c: Don't hard code SIZEOF_BDIGITS for log_base(hbase).
-	  (big2str_orig): hbase_numdigits argument added.
-	  (big2str_karatsuba): Ditto.
-	  (rb_big2str0): Calculate hbase_numdigits.
-
-Fri May 31 17:57:21 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* process.c: Improve Process::exec documentation
-
-Fri May 31 17:26:42 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (rb_funcallv): add better names of rb_funcall2.
-
-	* vm_eval.c (rb_funcallv_public): ditto for rb_funcall3.
-
-Fri May 31 17:04:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_new_capa): add better names of rb_ary_new2.
-
-	* array.c (rb_ary_new_from_args): ditto for rb_ary_new3.
-
-	* array.c (rb_ary_new_from_values): ditto for rb_ary_new4.
-
-Fri May 31 16:35:44 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (HAVE_ATTRIBUTE_FUNCTION_ALIAS): define to tell if
-	  alias attribute is available.
-
-Fri May 31 16:03:23 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c, proc.c: s/call_seq/call-seq in rdoc. [Fixes GH-322]
-
-Fri May 31 15:56:36 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/openssl/ossl_ssl.c: Add missing paren in rdoc [Fixes GH-321]
-
-Fri May 31 11:58:24 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (set_visibility): extract from rb_mod_public(),
-	  rb_mod_protected() and rb_mod_private().
-
-Thu May 30 19:47:42 2013  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* vm_insnhelper.c (vm_callee_setup_keyword_arg,
-	  vm_callee_setup_arg_complex): consider a hash argument for keyword
-	  only when the number of arguments is more than the expected
-	  mandatory parameters.  [ruby-core:53199] [ruby-trunk - Bug #8040]
-
-	* test/ruby/test_keyword.rb: update a test for above.
-
-Thu May 30 17:55:04 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* process.c: RDoc on Process.spawn
-
-Thu May 30 00:08:14 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_profile_enable): rest_sweep() to finish last GC.
-	  Profiling record is allocated at first of marking phase.
-	  Enable at lazy sweeping may cause an error (SEGV).
-
-Wed May 29 10:33:27 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* hash.c: fix WB bug.
-	  (1) Hash's key also needs WB.
-	  (2) callback parameter *key and *value of st_update() is not a
-	      storage of st_table itself (only local variable). So that
-	      OBJ_WRITE() is not suitable, especially for `!existing'.
-	      OBJ_WRITTEN() is used instead of OBJ_WRITE().
-
-Tue May 28 12:31:21 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/objspace/object_tracing.c: fix a bug reported at
-	  "[ruby-core:55182] [ruby-trunk - Bug #8456][Open] Sugfault in Ruby Head"
-	  Care about the case TracePoint#path #=> `nil'.
-
-	* ext/objspace/object_tracing.c: add two new methods:
-	  * ObjectSpace.allocation_class_path(o)
-	  * ObjectSpace.allocation_method_id(o)
-	  They are not useful for Object.new because they are always
-	  "Class" and :new.
-	  To trace more useful information, we need to maintain call-tree
-	  using call/return hooks, which is implemented by
-	  ll-prof <http://sunagae.net/wiki/doku.php?id=software:llprof>
-
-	* test/objspace/test_objspace.rb: add a test.
-
-Tue May 28 11:30:02 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/extmk.rb (extmake): leave makefiles untouched if the content is
-	  not changed, to get rid of unnecessary re-linking.
-
-Tue May 28 03:11:02 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/objspace/gc_hook.c, ext/objspace/objspace.c: add new methods to
-	  hook GC invocation.
-	  * ObjectSpace.after_gc_start_hook=(proc)
-	  * ObjectSpace.after_gc_end_hook=(proc)
-
-	  Note that hooks are not kicked immediately. Procs are kicked
-	  at postponed_job.
-
-	  This feature is a sample of new internal event and
-	  rb_postponed_job API.
-
-Tue May 28 02:56:15 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_stat): remove wrong rest_sweep().
-
-Tue May 28 02:44:23 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (garbage_collect_body): fix GC_ENABLE_LAZY_SWEEP condition.
-
-	* gc.c (GC_NOTIFY): move debug print location and use stderr instead
-	  of stdout.
-
-Tue May 28 02:07:21 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_trace.c (rb_postponed_job_register_one): fix iteration bug.
-
-	* ext/-test-/postponed_job/postponed_job.c,
-	  test/-ext-/postponed_job/test_postponed_job.rb: add a test.
-
-Tue May 28 00:34:23 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h, gc.c: add new internal event
-	  RUBY_INTERNAL_EVENT_GC_END. This event invokes at the end of
-	  after_sweep().
-	  Time chart with lazy sweep is:
-	    (1) Kick RUBY_INTERNAL_EVENT_GC_START
-	    (2) [gc_marks()]
-	    (3) [lazy_sweep()]
-	    (4) [... run Ruby program (mutator) with lazy_sweep() ...]
-	    (5) [after_sweep()]
-	    (6) Kick RUBY_INTERNAL_EVENT_GC_END
-	    (7) [... run Ruby program (mutator), and go to (1) ...]
-	  Time chart without lazy sweep (GC.start, etc) is:
-	    (1) Kick RUBY_INTERNAL_EVENT_GC_START
-	    (2) [gc_marks()]
-	    (3) [gc_sweep()]
-	    (4) [after_sweep()]
-	    (5) Kick RUBY_INTERNAL_EVENT_GC_END
-	    (6) [... run Ruby program (mutator), and go to (1) ...]
-
-	* ext/-test-/tracepoint/tracepoint.c,
-	  test/-ext-/tracepoint/test_tracepoint.rb: modify a test.
-
-Tue May 28 00:18:57 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_trace.c (rb_postponed_job_flush): remove a wrong comment.
-
-Mon May 27 22:09:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/ruby.h (RHASH_SIZE): Add a cast to suppress a
-	  warning, comparison between signed and unsigned integer
-	  expressions [-Wsign-compare], on ILP32.
-
-Mon May 27 19:25:47 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: rename RUBY_INTERNAL_EVENT_FREE to
-	  RUBY_INTERNAL_EVENT_FREEOBJ.
-
-	* ext/-test-/tracepoint/tracepoint.c,
-	  ext/objspace/object_tracing.c,
-	  gc.c, vm_trace.c: catch up this change.
-
-Mon May 27 18:57:28 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/objspace/objspace.c: support ObjectSpace.trace_object_allocations.
-	  Read the following test to know HOWTO.
-	  This feature is a sample of RUBY_INTERNAL_EVENT.
-
-	* test/objspace/test_objspace.rb: add a test.
-
-	* ext/objspace/object_tracing.c: ditto.
-
-	* gc.c (rb_gc_count): add. This function returns GC count.
-
-	* internal.h: add decl. of rb_gc_count(). Same as `GC.count'.
-
-Mon May 27 17:33:28 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/rbinstall.rb (install_recursive): add maxdepth option.
-
-	* tool/rbinstall.rb (bin-comm): limit depth of bindir and reject empty
-	  files.  [ruby-core:55101] [Bug #8432]
-
-Mon May 27 16:16:18 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_trace.c (rb_postponed_job_flush, rb_postponed_job_register): use
-	  ruby_xmalloc/xfree. It is safe during GC.
-
-Mon May 27 09:24:03 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* test/-ext-/postponed_job/test_postponed_job.rb: fix typo and class name.
-
-Mon May 27 09:05:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h, gc.c, vm_trace.c: add internal events.
-	  * RUBY_INTERNAL_EVENT_NEWOBJ: object created.
-	  * RUBY_INTERNAL_EVENT_FREE: object freed.
-	  * RUBY_INTERNAL_EVENT_GC_START: GC started.
-	  And rename `RUBY_EVENT_SWITCH' to `RUBY_INTERNAL_EVENT_SWITCH'.
-
-	  Internal events can not invoke any Ruby program because the tracing
-	  timing may be critical (under huge restriction).
-	  These events can be hooked only by C-extensions.
-	  We recommend to use rb_postponed_job_register() API to call Ruby
-	  program safely.
-
-	  This change is mostly written by Aman Gupta (tmm1).
-	  https://bugs.ruby-lang.org/issues/8107#note-12
-	  [Feature #8107]
-
-	* include/ruby/debug.h, vm_trace.c: added two new APIs.
-	  * rb_tracearg_event_flag() returns rb_event_flag_t of this event.
-	  * rb_tracearg_object() returns created/freed object.
-
-	* ext/-test-/tracepoint/extconf.rb,
-	  ext/-test-/tracepoint/tracepoint.c,
-	  test/-ext-/tracepoint/test_tracepoint.rb: add a test.
-
-Mon May 27 08:38:21 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* ext/-test-/postponed_job/postponed_job.c: fix `init' function name.
-
-Mon May 27 06:22:41 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/debug.h, vm_trace.c: add rb_postponed_job API.
-	  Postponed jobs are registered with this API. Registered jobs
-	  are invoked at `ruby-running-safe-point' as soon as possible.
-	  This timing is completely same as finalizer timing.
-
-	  There are two APIs:
-	  * rb_postponed_job_register(flags, func, data): register a
-	    postponed job with data. flags are reserved.
-	  * rb_postponed_job_register_one(flags, func, data): same as
-	    `rb_postponed_job_register', but only one `func' job is
-	    registered (skip if `func' is already registered).
-
-	  This change is mostly written by Aman Gupta (tmm1).
-	  https://bugs.ruby-lang.org/issues/8107#note-15
-	  [Feature #8107]
-
-	* gc.c: use postponed job API for finalizer.
-
-	* common.mk: add dependency from vm_trace.c to debug.h.
-
-	* ext/-test-/postponed_job/extconf.rb, postponed_job.c,
-	  test/-ext-/postponed_job/test_postponed_job.rb: add a test.
-
-	* thread.c: implement postponed API.
-
-	* vm_core.h: ditto.
-
-Mon May 27 02:26:02 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_stat): collect promote_operation_count and
-	  types (RGENGC_PROFILE >= 2).
-
-Mon May 27 01:40:58 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_stat): collect shade_operation_count,
-	  remembered_sunny_object_count and remembered_shady_object_count
-	  for each types when RGENGC_PROFILE >= 2.
-	  They are informative for optimization.
-
-Mon May 27 01:15:22 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* hash.c (rb_hash_tbl_raw), internal.h: added.
-	  Returns st_table without shading hash.
-
-	* array.c: use rb_hash_tbl_raw() for read-only purpose.
-
-	* compile.c (iseq_compile_each): ditto.
-
-	* gc.c (count_objects): ditto.
-
-	* insns.def: ditto.
-
-	* process.c: ditto.
-
-	* thread.c (clear_coverage): ditto.
-
-	* vm_insnhelper.c: ditto.
-
-Mon May 27 00:31:09 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/make-snapshot: use ENV["AUTOCONF"] instead of directly using
-	  literal "autoconf".
-
-Sun May 26 21:31:46 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* hash.c, include/ruby/ruby.h: support WB protected hash.
-	  * constify RHash::ifnone and make new macro RHASH_SET_IFNONE().
-	  * insert write barrier for st_update().
-
-	* include/ruby/intern.h: declare rb_hash_set_ifnone(hash, ifnone).
-
-	* marshal.c (r_object0): use RHASH_SET_IFNONE().
-
-	* ext/openssl/ossl_x509name.c (Init_ossl_x509name): ditto.
-
-Sat May 25 23:22:38 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/fiddle/test_c_struct_entry.rb,
-	  test/fiddle/test_c_union_entity.rb,
-	  test/fiddle/test_cparser.rb, test/fiddle/test_func.rb,
-	  test/fiddle/test_handle.rb, test/fiddle/test_import.rb,
-	  test/fiddle/test_pointer.rb: don't run test if the system
-	  don't support fiddle.
-
-Sat May 25 21:29:34 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/pty/pty.c (get_device_once): FreeBSD 10-current and 9-stable
-	  added O_CLOEXEC support to posix_openpt, so assume FreeBSD 9.2 or
-	  later supports it.
-	  http://www.freebsd.org/cgi/query-pr.cgi?pr=162374
-
-Sat May 25 18:46:23 2013  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* proc.c (rb_method_entry_min_max_arity): fix missing break in switch.
-	  This was introduced in r38236, which is not intentional apparently.
-	  This has caused no actual harm because VM_METHOD_TYPE_OPTIMIZED is
-	  not used except for OPTIMIZED_METHOD_TYPE_SEND, but may do in
-	  future.  Coverity Scan found this inadequacy.
-
-Sat May 25 18:08:06 2013  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* dir.c (bracket): fix copy-paste error.  When the first and last
-	  characters of fnmatch range have different length, fnmatch may
-	  have wrongly matched a path that does not really match.
-	  Coverity Scan found this bug.
-
-Sat May 25 17:06:25 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (after_gc_sweep): reduce full GC timing.
-
-Sat May 25 11:28:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* variable.c (set_const_visibility): return without clearing method
-	  cache if no arguments.
-
-	* vm_method.c (set_method_visibility): ditto.
-
-Sat May 25 11:27:32 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (set_method_visibility): quote unprintable method name.
-
-Sat May 25 11:24:24 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* eval.c (rb_frame_callee): returns the called name of the current
-	  frame, not the previous frame.
-
-	* eval.c (prev_frame_callee, prev_frame_func): rename and make static,
-	  as these are used by rb_f_method_name() and rb_f_callee_name() only.
-
-	* variable.c (set_const_visibility): use the called name.
-
-Sat May 25 08:58:23 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_quote_unprintable): check if argument is a string.
-
-Fri May 24 19:32:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* variable.c (set_const_visibility): use rb_frame_this_func() instead
-	  of rb_frame_callee() for getting the name of the called method
-
-	* test/ruby/test_module.rb: add test for private_constant with no args
-
-Fri May 24 18:53:10 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: do major/full GC when:
-	  * number of oldgen object is bigger than twice of
-	    number of oldgen object at last full GC.
-	  * number of remembered shady object is bigger than twice of
-	    number of remembered shady object at last full GC.
-	  * number of oldgen object and remembered shady object is bigger
-	    than half of total object space.
-	  (please fix my English!)
-
-Fri May 24 17:07:00 2013  Charlie Somerville  <charliesome@ruby-lang.org>
-
-	* intern.h: remove dangling rb_class_init_copy declaration
-	  [ruby-core:55120] [Bug #8434]
-
-Fri May 24 16:31:23 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/strscan/strscan.c (strscan_aref): raise error if given
-	  name reference is not found.
-
-Fri May 24 15:48:18 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (after_gc_sweep, garbage_collect_body): do major GC (full GC)
-	  before extending heaps.
-	  TODO: do major GC when there are many old (promoted) objects.
-
-	* gc.c (after_gc_sweep): remove TODO comments.
-
-Fri May 24 11:04:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (LIBRUBY_RPATHFLAGS): do not append -L option with
-	  runtime library directory if cross compiling, but only -R option.
-	  runtime path makes no sense on the host system.  [ruby-dev:47363]
-	  [Bug #8443]
-
-Fri May 24 02:57:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* object.c (rb_obj_clone): should not propagate OLDGEN status.
-	  This propagation had caused WB miss for class.
-
-Thu May 23 17:35:30 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (loaded_feature_path): fix invalid read by index underflow.
-	  the beginning of name is also a boundary as well as just after '/'.
-
-Thu May 23 17:21:22 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (gc_profile_dump_on): revert r40898.  ok to show the record
-	  accumulating while lazy_sweep().
-
-Wed May 22 16:50:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (gc_profile_dump_on): use size_t to get rid of overflow and
-	  show the header when next_index > 0, instead of next_index != 1.
-
-Wed May 22 15:18:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (setup_overlapped): check the error code in addition
-	  to the result of SetFilePointer() to determine if an error occurred,
-	  because INVALID_SET_FILE_POINTER is a valid value.
-	  [ruby-core:55098] [Bug #8431]
-
-	* win32/win32.c (setup_overlapped, finish_overlapped): extract from
-	  rb_w32_read() and rb_w32_write().
-
-Wed May 22 14:19:56 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_prepare_free_objects, rest_sweep, lazy_sweep): fix position
-	  of `during_gc' setting.
-
-Wed May 22 07:36:08 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (garbage_collect): all GC is start from garbage_collect()
-	  (or garbage_collect_body()). `garbage_collect()' accept additional
-	  two parameters `full_mark' and `immediate_sweep'.
-	  If `full_mark' is TRUE, then force it full gc (major gc), otherwise,
-	  it depends on status of object space. Now, it will be minor gc.
-	  If `immediate_sweep' is TRUE, then disable lazy sweep.
-	  To allocate free memory, `full_mark' and `immediate_sweep' should be
-	  TRUE. Otherwise, they should be FALSE.
-
-	* gc.c (gc_prepare_free_objects): use `garbage_collect_body()'.
-
-	* gc.c (slot_sweep, before_gc_sweep, after_gc_sweep): add logging code.
-
-Tue May 21 22:47:06 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/strscan/strscan.c (strscan_aref): support named captures.
-	  patched by Konstantin Haase [ruby-core:54664] [Feature #8343]
-
-Tue May 21 21:48:44 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* test/ruby/test_dir_m17n.rb (TestDir_M17N#test_entries_compose):
-	  Use #each instead of #map just for iteration.
-
-Tue May 21 19:57:22 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* ext/digest/lib/digest.rb (Digest::Class.file): Take optional
-	  arguments that are passed to the constructor of the digest
-	  class.
-
-Tue May 21 17:21:12 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: remove gc_profile_record::is_marked. always true.
-
-Tue May 21 17:13:40 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: fix to collect additional information for GC::Profiler.
-	  * major/minor GC
-	  * trigger reason of GC
-
-	* gc.c (gc_profile_dump_on): change reporting format with
-	  added information.
-
-	* gc.c (gc_profile_record_get): return added information by
-	  :GC_FLAGS => array.
-
-Tue May 21 16:45:31 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: GC::Profiler's sweeping time is accumulated all slot
-	  sweeping time. At lazy GC, GC::Profiler makes new record entry
-	  for each lazy_sweep(). In this change, accumulating all
-	  slot_sweep() time.
-	  And change indentation.
-
-Tue May 21 16:29:09 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* common.mk (rdoc-bench): add a benchmark rule
-	  using RDoc. Generate all rdoc related files
-	  (same as `make rdoc') in temporary directory
-	  and remove them. Execution time, GC::Profiler
-	  and results of GC.stat are printed.
-
-	* tool/rdocbench.rb: added for `rdoc-bench'.
-
-Tue May 21 16:25:05 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (gc_profile_dump_on): `count' should be (int) because it
-	  can be negative number.
-	  And use pointer for `record' (don't copy).
-
-Tue May 21 03:11:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (dir_each): compose HFS file names from
-	  UTF8-MAC. [ruby-core:48745] [Bug #7267]
-
-Tue May 21 03:08:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/envutil.rb (assert_separately): require envutil in the
-	  child process too.
-
-Tue May 21 03:07:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_conv_enc_opts): should infect.
-
-Mon May 20 22:24:45 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#delete_if, Set#keep_if): Avoid blockless call of
-	  proc, which is not portable to JRuby.  Replace &method() with
-	  faster and simpler literal blocks while at it.
-
-Mon May 20 22:00:31 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/e2mmap.rb: Format of E2MM documentation
-
-Mon May 20 21:41:15 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/extmk.rb: nodoc this file
-
-Mon May 20 20:43:32 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/cmath.rb: Remove duplicate RDoc heading from overview
-
-Mon May 20 20:36:19 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/securerandom.rb: Update position of overview for RDoc
-
-Mon May 20 19:33:55 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* math.c: improve and fix documentation of sin, tan and log
-
-Mon May 20 19:31:49 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* lib/logger.rb (Logger::Application): show namespace in documentation
-
-Mon May 20 11:50:12 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/pp.rb: Revert part of r40834 and nodoc PP::ObjectMixin
-	  [ruby-core:55068]
-
-Mon May 20 10:40:21 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/webrick/htmlutils.rb (WEBrick::HTMLUtils#escape): replace HTML
-	  meta chars even in non-ascii string.  [Bug #8425] [ruby-core:55052]
-
-	* lib/webrick/httputils.rb (WEBrick::HTTPUtils#{_escape,_unescape}):
-	  fix %-escape encodings.  [Bug #8425] [ruby-core:55052]
-
-	* lib/webrick/httpservlet/filehandler.rb (set_dir_list): revert r20152
-	  partially and fix misuse of bytesize and regexp repetition operator.
-
-Mon May 20 08:03:51 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/profiler.rb: Document Profiler__ methods
-
-Mon May 20 08:02:13 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/tempfile.rb: nodoc Tempfile#inspect
-
-Mon May 20 07:48:24 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/stringio/stringio.c: Correct position of method rdoc
-
-Mon May 20 07:27:41 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* math.c: RDoc formatting of Math core docs with domains and codomains
-	  Patch by @eLobato [Fixes GH-309]
-
-Mon May 20 05:58:12 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/bigdecimal/bigdecimal.c: Formatting for BigMath [Fixes GH-306]
-	  Based on a patch by @eLobato.
-	* ext/bigdecimal/lib/bigdecimal/math.rb: ditto
-
-Mon May 20 04:56:59 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/forwardable.rb: Forwardable examples in overview were broken
-	  Based on patch by @joem [Fixes GH-303] [Bug #8392]
-
-Mon May 20 03:35:26 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/optparse.rb: nodoc OptionParser::Version and SPLAT_PROC
-
-Mon May 20 03:16:52 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/pp.rb: Document PP::ObjectMixin [Fixes GH-312]
-
-Sun May 19 23:52:22 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/webrick/test_htmlutils.rb: add test for WEBrick::HTMLUtils.
-
-Sun May 19 23:12:07 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* encoding.c: document fix, change default script encoding.
-	  patched by @windwiny [Fixes GH-310]
-
-Sun May 19 17:29:07 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#delete_if, Set#keep_if): Add comments.
-
-Sun May 19 11:37:36 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/fiddle/extconf.rb: ignore rc version of libffi to fix build failure.
-
-Sun May 19 10:38:50 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-delete-backward-char): Use
-	  delete-char instead of delete-backward-char, which is an
-	  interactive function.
-
-Sun May 19 03:59:29 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (str_scrub0): added for refactoring.
-
-Sun May 19 03:48:26 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/common.rb (URI.decode_www_form): scrub string if decoded
-	  bytes are invalid for the encoding.
-
-Sun May 19 02:46:32 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/set.rb (Set#delete_if, Set#keep_if): Make Set#delete_if and
-	  Set#keep_if more space and time efficient by avoiding to_a.
-
-Sun May 19 02:33:09 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-setup-keymap): Make
-	  backquotes electric as well.  It was listed in
-	  ruby-electric-expand-delimiters-list but not activated.
-
-	* misc/ruby-electric.el (ruby-electric-delete-backward-char):
-	  Introduce electric DEL that deletes what the previous electric
-	  command has input.
-
-	* misc/ruby-electric.el (ruby-electric-matching-char): Make
-	  electric quotes work again at the end of buffer.
-
-Sun May 19 01:39:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (setjmp-type): check if setjmpex() is really available.
-	  workaround for i686-w64-mingw32 which declares it but lacks its
-	  definition.
-
-	* include/ruby/defines.h: include setjmpex.h only if also setjmpex()
-	  is available.
-
-Sat May 18 23:57:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (setjmp-type): use setjmpex() on w64-mingw32 to get rid
-	  of -Wclobbered warnings.
-
-	* include/ruby/defines.h: include setjmpex.h here becase setjmp.h is
-	  included from win32.h via intrin.h, winnt.h, and so on.
-
-Sat May 18 20:28:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb (INTEGER2NUM): Make less comparisons.
-
-Sat May 18 20:15:28 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (str_scrub_bang): add String#scrub!. [Feature #8414]
-
-Sat May 18 16:59:52 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb (INTEGER2NUM): Renamed from INTEGER2VALUE.
-
-Sat May 18 16:57:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb (INTEGER2VALUE): Suppress a warning:
-	  comparison between signed and unsigned integer expressions
-
-Sat May 18 16:38:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_compile_each): forward anonymous and first keyword
-	  rest argument one.  [ruby-core:55033] [Bug #8416].
-
-Sat May 18 15:49:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_core.h (rb_vm_tag): move jmpbuf between tag and prev so ensure to
-	  be accessible.
-
-Sat May 18 11:05:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (inspect_enumerator): use VALUE instead of mere char*
-	  by using rb_sprintf() and rb_id2str().
-
-	* enumerator.c (append_method): extract from inspect_enumerator().
-
-Sat May 18 09:00:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb (INTEGER2VALUE): Use LONG2FIX if possible.
-
-Sat May 18 00:38:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb: Convert integer constants bigger than int
-	  correctly.
-
-Fri May 17 22:02:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ifaddr.c: Use unsigned LONG_LONG to represent flags
-	  because SunOS 5.11 (OpenIndiana) defines ifa_flags as uint64_t.
-
-Fri May 17 21:47:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* cont.c: Typo in constant MAX_MACHINE_STACK_CACHE from '..MAHINE..'
-	  patch by @schmurfy [Fixes GH-307]
-
-Fri May 17 19:18:24 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-matching-char): Do not put
-	  a closing quote when the quote typed does not start a string, as
-	  in $', ?\' or ?\".
-
-Fri May 17 18:06:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Consider error messages to find out version option of
-	  C compiler.
-	  The C compiler of Sun Studio C emits "Warning: Option -qversion
-	  passed to ld, if ld is invoked, ignored otherwise" and exit
-	  successfully.
-
-Fri May 17 17:34:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (rb_gc_guarded_ptr): unoptimize on other compilers than gcc and
-	  msvc.
-
-Fri May 17 11:06:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* eval_intern.h (TH_PUSH_TAG): ensure jmpbuf to be accessible before
-	  pushing tag to get rid of unaccessible tag by stack overflow.
-
-Thu May 16 17:15:32 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_eval.c (rb_catch_obj): add volatile to tag to prevent crash
-	  experimentally.
-	  http://www.rubyist.net/~akr/chkbuild/debian/ruby-trunk/log/20130515T133500Z.log.html.gz
-
-Thu May 16 16:19:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/Makefile.sub (verconf.in): no longer used.
-
-	* win32/Makefile.sub (config.status): fix typo.
-
-	* configure.in, template/verconf.h.in (RUBY_EXEC_PREFIX): fix for
-	  default prefix.
-
-Thu May 16 13:12:27 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* template/verconf.h.in: generate verconf.h from the template and
-	  rbconfig.rb.
-
-Thu May 16 05:47:18 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: fix syntax error.
-	  Thanks @spastorino! [ruby-core:55011]
-
-Thu May 16 03:05:45 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_node_newnode): use newobj_of() instead of rb_newobj().
-
-Thu May 16 02:03:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/depend: Add a dependency for ifaddr.o.
-
-Thu May 16 01:44:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* common.mk (verconf.h): $< cannot be used in explicit rules with
-	  nmake.
-
-	* win32/Makefile.sub (CONFIG_H): create verconf.in instead of
-	  verconf.h.
-
-Thu May 16 01:25:07 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: only emit warnings when
-	  -w is enabled.
-
-Wed May 15 18:58:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (newobj): rename to `newobj_of' and accept additional
-	  three parameters v1, v2, v3. newobj_of() do OBJSETUP() and
-	  fill values with v1, v2, v3.
-
-	* gc.c (rb_data_object_alloc, rb_data_typed_object_alloc):
-	  use newobj_of().
-
-Wed May 15 17:55:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_PLATFORM): move to config.h as needed by
-	  version.c.
-
-Wed May 15 17:04:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: add an additional RGENGC_PROFILE mode (2).
-	  Profiling result can be check by GC.stat.
-
-	* gc.c (type_name): separate from obj_type_name().
-
-Wed May 15 16:58:24 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: save configured load path values into verconf.in.
-
-	* common.mk (verconf.h): create from verconf.in with shvar_to_cpp.rb.
-
-	* tool/shvar_to_cpp.rb: turn shell variables into C macros.
-	  [Bug #7959]
-
-	* loadpath.c: split load path staffs from version.c.
-
-	* dmyloadpath.c: miniruby has no builtin load paths, so verconf.h is
-	  not needed.
-
-Wed May 15 03:56:09 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: adding backwards
-	  compatible YAMLTree.new method
-
-Wed May 15 02:22:16 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: Adding Psych.safe_load for loading a user
-	  defined, restricted subset of Ruby object types.
-	* ext/psych/lib/psych/class_loader.rb: A class loader for
-	  encapsulating the logic for which objects are allowed to be
-	  deserialized.
-	* ext/psych/lib/psych/deprecated.rb: Changes to use the class loader
-	* ext/psych/lib/psych/exception.rb: ditto
-	* ext/psych/lib/psych/json/stream.rb: ditto
-	* ext/psych/lib/psych/nodes/node.rb: ditto
-	* ext/psych/lib/psych/scalar_scanner.rb: ditto
-	* ext/psych/lib/psych/stream.rb: ditto
-	* ext/psych/lib/psych/streaming.rb: ditto
-	* ext/psych/lib/psych/visitors/json_tree.rb: ditto
-	* ext/psych/lib/psych/visitors/to_ruby.rb: ditto
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: ditto
-	* ext/psych/psych_to_ruby.c: ditto
-	* test/psych/helper.rb: ditto
-	* test/psych/test_safe_load.rb: tests for restricted subset.
-	* test/psych/test_scalar_scanner.rb: ditto
-	* test/psych/visitors/test_to_ruby.rb: ditto
-	* test/psych/visitors/test_yaml_tree.rb: ditto
-
-Wed May 15 02:06:35 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* test/psych/helper.rb: envutil is not available outside Ruby, so
-	  port the functions from envutil to the test helper.
-
-	* test/psych/test_deprecated.rb: ditto
-
-	* test/psych/test_encoding.rb: ditto
-
-Wed May 15 00:42:54 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* signal.c: need to include unistd.h for write(2).
-	  unistd.h is now included via ruby/defines.h, but should explicitly
-	  include here.  (suggested by kosaki)
-
-Tue May 14 23:43:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/.document: Add ifaddr.c.
-
-Tue May 14 23:24:31 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/socket/extconf.rb: check for if_nametoindex() for
-	  i686-w64-mingw32, and check for declarations of if_indextoname() and
-	  if_nametoindex().
-
-	* ext/socket/ifaddr.c (ifaddr_ifindex): not-implement unless
-	  if_nametoindex() is available.
-
-	* ext/socket/rubysocket.h: declare if_indextoname() and
-	  if_nametoindex() if available but not declared.
-
-Tue May 14 19:58:17 2013  CHIKANAGA Tomoyuki  <nagachika@ruby-lang.org>
-
-	* ext/dl/lib/dl/func.rb (DL::Function#call): check tainted when
-	  $SAFE > 0.
-	* ext/fiddle/function.c (function_call): check tainted when $SAFE > 0.
-	* test/fiddle/test_func.rb (module Fiddle): add test for above.
-
-
-Tue May 14 14:51:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/win32.h (INTPTR_MAX, INTPTR_MIN, UINTPTR_MAX): split
-	  from intptr_t and uintptr_t, since VC9 defines the latter only in
-	  crtdefs.h.
-
-Tue May 14 12:21:28 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (NET_LUID): mingw may have NET_LUID and not defined
-	  _IFDEF_.
-
-Tue May 14 03:33:17 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* string.c (rb_str_new_frozen): remove debug print.
-
-Tue May 14 03:22:51 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: enable to generate write barrier protected
-	  arrays (T_ARRAY).
-
-Tue May 14 03:21:42 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: enable to generate write barrier protected
-	  strings (T_STRING).
-
-Tue May 14 03:19:59 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: enable to generate write barrier protected
-	  objects (T_OBJECT).
-
-Tue May 14 03:17:15 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: enable to generate write barrier protected
-	  objects for numeric types (Float, Complex, Rational, Bignum).
-
-Tue May 14 03:10:59 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: enable RGENGC (USE_RGENGC)
-	  but no type creates write protected (sunny) objects
-	  (RGENGC_WB_PROTECTED_* == 0).
-
-Tue May 14 02:47:30 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: support RGENGC. [ruby-trunk - Feature #8339]
-	  See this ticket about RGENGC.
-
-	* gc.c: Add several flags:
-	  * RGENGC_DEBUG: if >0, then prints debug information.
-	  * RGENGC_CHECK_MODE: if >0, add assertions.
-	  * RGENGC_PROFILE: if >0, add profiling features.
-	    check GC.stat and GC::Profiler.
-
-	* include/ruby/ruby.h: disable RGENGC by default (USE_RGENGC == 0).
-
-	* array.c: add write barriers for T_ARRAY and generate sunny objects.
-
-	* include/ruby/ruby.h (RARRAY_PTR_USE): added. Use this macro if
-	  you want to access raw pointers. If you modify the contents which
-	  pointer pointed, then you need to care write barrier.
-
-	* bignum.c, marshal.c, random.c: generate T_BIGNUM sunny objects.
-
-	* complex.c, include/ruby/ruby.h: add write barriers for T_COMPLEX
-	  and generate sunny objects.
-
-	* rational.c (nurat_s_new_internal), include/ruby/ruby.h: add write
-	  barriers for T_RATIONAL and generate sunny objects.
-
-	* internal.h: add write barriers for RBasic::klass.
-
-	* numeric.c (rb_float_new_in_heap): generate sunny T_FLOAT objects.
-
-	* object.c (rb_class_allocate_instance), range.c:
-	  generate sunny T_OBJECT objects.
-
-	* string.c: add write barriers for T_STRING and generate sunny objects.
-
-	* variable.c: add write barriers for ivars.
-
-	* vm_insnhelper.c (vm_setivar): ditto.
-
-	* include/ruby/ruby.h, debug.c: use two flags
-	  FL_WB_PROTECTED and FL_OLDGEN.
-
-	* node.h (NODE_FL_CREF_PUSHED_BY_EVAL, NODE_FL_CREF_OMOD_SHARED):
-	  move flag bits.
-
-Tue May 14 01:54:48 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: remove rb_objspace_t::marked_num.
-	  We can use `objspace_live_num()' instead of removed `marked_num'
-	  if it is after `after_gc_sweep()' function call.
-
-	* gc.c (after_gc_sweep): use objspace_live_num() instead of removed
-	  rb_objspace_t::marked_num.
-
-	* gc.c (gc_mark_ptr, gc_marks): remove rb_objspace_t::marked_num code.
-
-	* gc.c (gc_prepare_free_objects): do not call set_heaps_increment()
-	  with checking objspace->heap.marked_num. At this point, we only
-	  need to check availability of free-cell.
-
-	* gc.c (lazy_sweep): call after_gc_sweep() if there are no sweep_able entry.
-
-	* gc.c (rest_sweep, gc_prepare_free_objects): remove after_gc_sweep() call.
-
-Tue May 14 01:50:41 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: disable GC_PROFILE_MORE_DETAIL (fix last commit).
-
-	* gc.c (gc_prof_set_malloc_info): fix "objspace->heap.live_num" to
-	  "objspace_live_num(objspace)". There is no such member variable.
-
-Tue May 14 01:25:55 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c: refactoring GC::Profiler.
-
-	* gc.c (gc_prof_sweep_timer_start/stop): removed because
-	  they doesn't support lazy sweep.
-
-	* gc.c (gc_prof_sweep_slot_timer_start/stop): added.
-	  redefine `sweeping time' to accumulated time of all of
-	  slot_sweep().
-
-	* gc.c (rb_objspace_t::profile::count): renamed to
-	  rb_objspace_t::profile::next_index. `counter' seems ambiguous.
-	  increment it when next record is acquired.
-
-Tue May 14 00:48:55 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: constify RRational::(num,den) and
-	  RComplex::(real,imag).
-	  Add macro to set these values:
-	    * RRATIONAL_SET_NUM()
-	    * RRATIONAL_SET_DEN()
-	    * RCOMPLEX_SET_REAL()
-	    * RCOMPLEX_SET_IMAG()
-	  This change is a part of RGENGC branch [ruby-trunk - Feature #8339].
-
-	  TODO: API design. RRATIONAL_SET(rat,num,den) is enough?
-	  TODO: Setting constify variable with cast has same issue of r40691.
-
-	* complex.c, rational.c: use above macros.
-
-Mon May 13 21:49:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Check socketpair again.
-	  It is required on Unix.
-
-Mon May 13 21:20:32 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (getipaddrs): use alternative interface name if
-	  available, because if_nametoindex() requires them.
-
-Mon May 13 20:23:24 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c, include/ruby/win32.h (getipaddrs): [experimental]
-	  emulate getipaddrs(3) on Unix.
-
-	* win32/Makefile.sub, configure.in (LIBS): need iphlpapi.lib for above
-	  function.
-
-	* include/ruby/win32.h (socketpair): rb_w32_socketpair() doesn't
-	  substitute for any function, so use non-prefixed name.
-
-	* ext/socket/extconf.rb (socketpair); follow above change.
-
-Mon May 13 20:11:06 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* iseq.c (prepare_iseq_build): remove additional line break.
-
-Mon May 13 19:29:54 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: constify RBasic::klass and add
-	  RBASIC_CLASS(obj) macro which returns a class of `obj'.
-	  This change is a part of RGENGC branch [ruby-trunk - Feature #8339].
-
-	* object.c: add new function rb_obj_reveal().
-	  This function reveal internal (hidden) object by rb_obj_hide().
-	  Note that do not change class before and after hiding.
-	  Only permitted example is:
-	    klass = RBASIC_CLASS(obj);
-	    rb_obj_hide(obj);
-	    ....
-	    rb_obj_reveal(obj, klass);
-
-	  TODO: API design. rb_obj_reveal() should be replaced with others.
-
-	  TODO: modify constified variables using cast may be harmful for
-	        compiler's analysis and optimization.
-	        Any idea to prohibit inserting RBasic::klass directly?
-	        If rename RBasic::klass and force to use RBASIC_CLASS(obj),
-	        then all codes such as `RBASIC(obj)->klass' will be
-	        compilation error. Is it acceptable? (We have similar
-	        experience at Ruby 1.9,
-	        for example "RARRAY(ary)->ptr" to "RARRAY_PTR(ary)".
-
-	* internal.h: add some macros.
-	  * RBASIC_CLEAR_CLASS(obj) clear RBasic::klass to make it internal
-	    object.
-	  * RBASIC_SET_CLASS(obj, cls) set RBasic::klass.
-	  * RBASIC_SET_CLASS_RAW(obj, cls) same as RBASIC_SET_CLASS
-	    without write barrier (planned).
-	  * RCLASS_SET_SUPER(a, b) set super class of a.
-
-	* array.c, class.c, compile.c, encoding.c, enum.c, error.c, eval.c,
-	  file.c, gc.c, hash.c, io.c, iseq.c, marshal.c, object.c,
-	  parse.y, proc.c, process.c, random.c, ruby.c, sprintf.c,
-	  string.c, thread.c, transcode.c, vm.c, vm_eval.c, win32/file.c:
-	  Use above macros and functions to access RBasic::klass.
-
-	* ext/coverage/coverage.c, ext/readline/readline.c,
-	  ext/socket/ancdata.c, ext/socket/init.c,
-	* ext/zlib/zlib.c: ditto.
-
-Mon May 13 18:44:14 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* *.c, parse.y, insns.def: use RARRAY_AREF/ASET macro
-	  instead of using RARRAY_PTR().
-
-Mon May 13 16:53:53 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* include/ruby/ruby.h: add new utility macros to access
-	  Array's element.
-	  * RARRAY_AREF(a, i) returns i-th element of an array `a'
-	  * RARRAY_ASET(a, i, v) set i-th element of `a' to `v'
-	  This change is a part of RGENGC branch [ruby-trunk - Feature #8339].
-
-Mon May 13 15:31:10 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* object.c (rb_obj_setup): added.
-
-	* include/ruby/ruby.h (OBJSETUP): use rb_obj_setup() instead of
-	  a macro.
-
-Mon May 13 15:24:16 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_data_object_alloc): check klass only if klass is not 0.
-	  klass==0 means internal object.
-
-Mon May 13 14:57:28 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (rb_data_object_alloc, rb_data_typed_object_alloc):
-	  use NEWOBJ_OF() instead of NEWOBJ().
-
-Mon May 13 14:51:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (rb_obj_singleton_method): new method Kernel#singleton_method
-	  which returns a Method object of the singleton method.
-	  non-singleton method causes NameError, but not aliased or zsuper
-	  method, right now.
-	  [ruby-core:54914] [Feature #8391]
-
-	* vm_method.c (rb_method_entry_at): return the method entry for id at
-	  klass, without ancestors.
-
-	* class.c (rb_singleton_class_get): get the singleton class if exists,
-	  or nil.
-
-Mon May 13 10:20:59 2013  Yuki Yugui Sonoda  <yugui@google.com>
-
-	* ext/openssl/ossl_ssl.c: Disabled OpenSSL::SSL::SSLSocket if
-	  defined(OPENSSL_NO_SOCK).
-
-	  This fixes a linkage error on platforms which do not have socket.
-	  OpenSSL itself is still useful as a set of cryptographic functions
-	  even on such platforms.
-
-Mon May 13 10:30:04 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* hash.c: Hash[] and {} are not equivalent by @eam [Fixes GH-301]
-
-Mon May 13 10:04:22 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* random.c: Document Random::DEFAULT by @eLobato [Fixes GH-304]
-
-Sun May 12 21:12:42 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (OFFT2NUM): RUBY_REPLACE_TYPE also defines macro
-	  to convert int type to VALUE if found.
-
-Wed May  8 13:46:52 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/intern.h (rb_iv_set, rb_iv_get): removed. Because
-	  ruby.h has a declaration for that.
-
-Wed May  8 13:49:06 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/intern.h (rb_uint2big, rb_int2big, rb_uint2inum)
-	(rb_int2inum, rb_ll2inum, rb_ull2inum): removed because ruby.h
-	  has a declaration for these.
-
-Sun May 12 17:52:23 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: removes 'ac_cv_func_fseeko=yes' form MinGW
-	  specific definitions.
-
-Sun May 12 17:25:46 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* file.c (rb_file_s_truncate): use correct type. chsize takes
-	  a long.
-
-Sun May 12 17:18:46 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* process.c: move '#define HAVE_SPAWNV 1' to win32/Makefile.sub.
-	* win32/Makefile.sub: see above.
-
-Sun May 12 17:13:32 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: removes AC_CHECK_FUNCS(setitimer) because it's
-	  unused.
-
-Sun May 12 17:08:16 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: removes AC_CHECK_FUNCS(pause) because it's unused.
-
-Sun May 12 17:05:18 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (rb_f_kill): fixes typo. s/HAS_KILLPG/HAVE_KILLPG/.
-
-Sun May 12 17:03:27 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: abort if gettimeofday doesn't exist.
-
-Sun May 12 16:31:27 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: adds RUBY_REPLACE_TYPE(off_t) for creating
-	  NUM2OFFT.
-	* file.c (rb_file_truncate): use correct type. chsize() take
-	  a long.
-	* include/ruby/ruby.h (NUM2OFFT): use a definition created by
-	  a configure script by default.
-
-Sun May 12 16:03:41 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: removes AC_CHECK_FUNC(fseeko, fseeko64, ftello,
-	  ftello64). They are not used from anywhere.
-
-	* win32/win32.c (fseeko): removes.
-	* win32/win32.c (rb_w32_ftello): removes.
-	* include/ruby/win32.h: removes declarations of rb_w32_ftello and
-	  rb_w32_fseeko.
-	* win32/Makefile.sub: removes '#define HAVE_FTELLO 1'.
-
-Sun May 12 15:51:47 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: remove AC_CHECK_FUNC(close). It is not used from
-	  anywhere.
-
-Sun May 12 15:50:45 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: adds comments for setjmp check.
-
-Sun May 12 15:38:09 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: move clock_gettime() check into regular place.
-
-Wed May  8 13:45:53 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add getenv() declaration check.
-	* dln_find.c: add HAVE_DECL_GETENV test.
-
-Sun May 12 15:33:18 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: sorts AC_CHECK_FUNCS()s as alphabetical order.
-
-Wed May  8 13:41:57 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* bignum.c: remove redundant decl for big_lshift() big_rshift().
-
-Sun May 12 16:06:43 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/rubysocket.h (rsock_inspect_sockaddr): as r40646
-	  check HAVE_TYPE_STRUCT_SOCKADDR_DL.
-
-Sat May 11 23:01:58 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/rubysocket.h (HAVE_TYPE_STRUCT_SOCKADDR_DL):
-	  MSVC has struct sockaddr_dl, but its content is broken.
-	  http://ruby-mswin.cloudapp.net/vc10-x64/ruby-trunk/log/20130511T103938Z.log.html.gz
-
-Sat May 11 22:07:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/rinda/test_rinda.rb: Socket.getifaddrs may returns an interface
-	  which #addr method returns nil for venet0 in OpenVZ.
-
-Sat May 11 21:56:34 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/raddrinfo.c (rsock_inspect_sockaddr): Add casts to
-	  suppress warnings.
-
-Sat May 11 17:28:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket: New method, Socket.getifaddrs, implemented.
-	  [ruby-core:54777] [Feature #8368]
-
-Sat May 11 00:47:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* gc.h (SET_MACHINE_STACK_END): Add !defined(_ILP32) to a defining
-	  condition to avoid compilation error on x32.
-	  https://sites.google.com/site/x32abi/
-
-Fri May 10 23:56:34 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_peek_variable_name): treat invalid global, class,
-	  and instance variable names as mere strings rather than errors.
-	  [ruby-core:54885] [Bug #8375]
-
-Fri May 10 20:22:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Move library checks into "Checks for libraries." part.
-
-Fri May 10 19:32:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Reformat arguments of AC_CHECK_HEADERS and
-	  AC_CHECK_FUNCS to track modifications easily.
-
-Fri May 10 12:01:36 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Don't link librt if clock_gettime is available in
-	  the main C library.
-	  glibc 2.17 moves clock_* from librt to the main C library.
-	  http://sourceware.org/ml/libc-announce/2012/msg00001.html
-
-Thu May  9 22:00:35 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (bsock_sendmsg_internal): controls_num should
-	  not be negative.
-
-Thu May  9 21:09:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* file.c, ext/etc/etc.c, ext/socket/unixsocket.c,
-	  ext/openssl/ossl.h, ext/openssl/openssl_missing.c: Use
-	  HAVE_AGGREGATE_MEMBER instead of HAVE_ST_MEMBER.
-
-Thu May  9 20:43:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (bsock_sendmsg_internal): Always set
-	  controls_num to raise NotImplementedError appropriately.
-	  (bsock_recvmsg_internal): Raise NotImplementedError if
-	  :scm_rights=>true is given on platforms which don't have
-	  4.4BSD style control message.
-
-Thu May  9 12:06:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h, ext/socket/unixsocket.c,
-	  ext/socket/ancdata.c: Use HAVE_STRUCT_MSGHDR_MSG_CONTROL instead
-	  of HAVE_ST_MSG_CONTROL.
-
-Thu May  9 11:30:02 2013  Zachary Scott	 <zachary@zacharyscott.net>
-
-	* string.c: Add call-seq alias for String#=== [Bug #8381]
-
-Thu May  9 11:14:18 2013  Zachary Scott	 <zachary@zacharyscott.net>
-
-	* doc/contributing.rdoc: Add guide for contributing to CRuby
-
-Thu May  9 04:55:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Check socket library again.  shutdown() is used in
-	  io.c.
-
-Thu May  9 01:52:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Don't check socketpair.  socketpair is not used in
-	  ruby command itself.
-
-Thu May  9 01:05:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (rb_mod_included_modules): should not include non-modules.
-	  [ruby-core:53158] [Bug #8025]
-
-Wed May  8 22:46:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (rb_mod_included_modules): should not include the original
-	  module itself.  [ruby-core:53158] [Bug #8025]
-
-Wed May  8 17:43:55 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_io_ext_int_to_encs): ignore internal encoding if external
-	  encoding is ASCII-8BIT. [Bug #8342]
-
-Wed May  8 13:49:38 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json/generator/generator.c (isArrayOrObject): cast char to
-	  unsigned char. [Bug #8378]
-
-Wed May  8 13:46:10 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json/generator/depend: fix dependencies [Bug #8379]
-
-	* ext/json/parser/depend: ditto.
-
-Wed May  8 13:07:17 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_yylex): fail if $, @, @@ are not followed by a valid
-	  name character.  [ruby-core:54846] [Bug #8375].
-
-Wed May  8 13:06:31 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (ISGRAPH): add missing macro.
-
-Wed May  8 06:42:56 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/socket/socket.c (socket_s_ip_address_list): fix wrongly filled
-	  sin6_scope_id on KAME introduced by r40593 for OpenIndiana.
-	  KAME uses fe80:<scope_id>::<interface id> for link-local address
-	  internally.
-	  Setting sin6_scope_id causes it leaked.
-	  see also comments of sockaddr_obj().
-
-Tue May  7 22:12:34 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/readline/readline.c (insert_ignore_escape): Add a cast to
-	  unsigned char * before dereference.
-	  This suppress a warning on Cygwin.
-
-Tue May  7 12:15:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (bsock_recvmsg_internal): Add a cast to
-	  suppress warning.
-	  Bionic defines socklen_t as int.
-	  Bionic defines msg_controllen as unsigned int (__kernel_size_t)
-	  instead of socklen_t as POSIX.
-
-Tue May  7 12:12:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (ancillary_inspect): Don't call
-	  anc_inspect_ipv6_pktinfo if !HAVE_TYPE_STRUCT_IN6_PKTINFO.
-	  anc_inspect_ipv6_pktinfo is not defined in the case.
-
-Tue May  7 12:10:52 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (socket_s_ip_address_list): Cast EXTRA_SPACE as
-	  int.  This suppress a warning.
-
-Tue May  7 12:09:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Set close_fds false for Cygwin.
-	  Cygwin doesn't support fd passing.
-	  This enables socket extension library cross-compilable by default.
-
-Tue May  7 12:07:35 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c (swap32): Don't redefine it if it is already defined.
-	  Bionic defines it.
-	  (swap64): Ditto.
-
-Mon May  6 20:50:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (socket_s_ip_address_list): Fill sin6_scope_id
-	  if getifaddrs() returns an IPv6 link local address which
-	  sin6_scope_id is zero, such as on OpenIndiana SunOS 5.11.
-
-Sun May  5 18:56:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* insns.def (defined): use vm_search_superclass() like as normal super
-	  call.  based on a patch <https://gist.github.com/wanabe/5520026> by
-	  wanabe.
-
-	* vm_insnhelper.c (vm_search_superclass): return error but not raise
-	  exceptions.
-
-	* vm_insnhelper.c (vm_search_super_method): check the result of
-	  vm_search_superclass and raise exceptions on error.
-
-Sun May  5 16:29:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* insns.def (defined): get method entry from the method top level
-	  frame, not block frame.  [ruby-core:54769] [Bug #8367]
-
-Sun May  5 13:28:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* template/ruby.pc.in (Cflags): use rubyarchhdrdir for multiarch.
-	  [Bug #7874]
-
-Sat May  4 07:20:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* doc/security.rdoc: Add note about reporting security vulns
-
-Sat May  4 04:13:27 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/defines.h (RUBY_ATTR_ALLOC_SIZE): New for
-	  attribute((alloc_size(params))).
-
-	* include/ruby/defines.h (xmalloc, xmalloc2, xcalloc)
-	(xrealloc, xrealloc2): Annotated by RUBY_ATTR_ALLOC_SIZE.
-	* include/ruby/ruby.h (rb_alloc_tmp_buffer): ditto.
-
-Fri May  3 19:32:13 2013  Takeyuki FUJIOKA  <xibbar@ruby-lang.org>
-
-	* lib/cgi/util.rb: All class methods modulized.
-	  We can use these methods like a function when "include CGI::Util".
-	  [Feature #8354]
-
-Fri May  3 14:09:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Make default_ipv6 true for Cygwin.
-	  Cygwin supports IPv6 since Cygwin 1.7.1 (2009-12).
-	  http://cygwin.com/ml/cygwin-announce/2009-12/msg00027.html
-
-Fri May  3 13:35:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/socket/{getaddrinfo,getnameinfo}.c: define socklen_t if not
-	  defined, e.g., older VC.
-
-Fri May  3 13:29:11 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/win32.h (INTPTR_MAX, INTPTR_MIN, UINTPTR_MAX): also
-	  should be defined when defining intptr_t and uintptr_t.
-	  bigdecimal.c requires the former two now.
-
-Fri May  3 13:22:12 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (poll_child_status): fix build error on older mingw.
-
-Fri May  3 00:15:58 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* common.mk: remove timestamps in distclean-ext realclean-ext.
-
-Thu May  2 23:23:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (rb_obj_is_kind_of): skip prepending modules.
-	  [ruby-core:54742] [Bug #8357]
-
-	* object.c (rb_class_inherited_p): ditto.
-	  [ruby-core:54736] [Bug #8357]
-
-Thu May  2 22:11:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bin/irb: remove dead code from sample/irb.rb.
-
-Thu May  2 17:32:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (copy_ivar_i): get rid of overwriting already copied
-	  instance variables.  c.f. [Bug #8276]
-
-Thu May  2 16:55:43 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (id_locals): use cached ID.
-
-	* vm.c (ruby_thread_init): ditto.
-
-	* defs/id.def: add more predefined IDs used in core.
-
-Thu May  2 13:42:42 2013  Ryan Davis  <ryand-ruby@zenspider.com>
-
-	* lib/minitest/*: Imported minitest 4.7.4 (r8483)
-	* test/minitest/*: ditto
-
-Thu May  2 11:32:22 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (poll_child_status): [experimental] set the cause of
-	  a child's death to status if its exitcode seems to be an error.
-
-	* test/ruby/test_process.rb (TestProcess#test_no_curdir): maybe now
-	  we can test it.
-
-	* test/ruby/test_thread.rb (TestThread#test_thread_timer_and_interrupt):
-	  ditto.
-
-Thu May  2 11:24:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/yaml.rb: nodoc EngineManager, add History doc #8344
-
-Wed May  1 21:11:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (localtime_with_gmtoff_zone): musl libc may return NULL for
-	  tm_zone.
-
-Wed May  1 18:59:36 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* enum.c (Enumerable#chunk): fix grammar of error message
-	  for symbols beginning with an underscore [Bug #8351]
-
-Wed May  1 16:47:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/curses/extconf.rb (curses_version): try once for each tests, a
-	  function or a variable.  fallback to variable for old SVR4.
-
-Wed May  1 16:17:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/extmk.rb (extmake): extensions not to be installed should not
-	  make static libraries, but make dynamic libraries always.
-
-Wed May  1 12:20:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/rake/version.rb: Fix RDoc warning with  :include: [Bug #8347]
-
-Wed May  1 11:40:25 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* defs/id.def (predefined): add "idProc".
-
-	* eval.c (frame_func_id): use predefined IDs.
-
-	* proc.c (mnew, mproc, mlambda): use predefined IDs.
-
-	* vm.c (rb_vm_control_frame_id_and_class): ditto.
-
-	* vm.c (Init_VM): ditto.
-
-Tue Apr 30 23:18:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/benchmark.rb: Update Benchmark results on newer CPU
-
-Tue Apr 30 12:31:40 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (mproc, mlambda): use frozen core methods instead of plain
-	  global methods, so that methods cannot be overridden.
-	  [ruby-core:54687] [Bug #8345]
-
-	* vm.c (Init_VM): define proc and lambda on the frozen core object.
-
-	* include/ruby/intern.h (rb_block_lambda): add declaration instead of
-	  deprecated rb_f_lambda.
-
-Mon Apr 29 17:02:30 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/nkf/nkf-utf8/nkf.h: Bionic libc doesn't have locale.
-	  [Feature #8338]
-
-
-Mon Apr 29 06:58:30 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): no need of alloca for
-	  small fixed size array.
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): check overflow first,
-	  and use alloca for small size input.
-
-Mon Apr 29 00:40:13 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* lib/yaml.rb: Clarify documentation about YAML being always Psych.
-	  Give a tip about using Syck. See #8344.
-
-Sun Apr 28 23:34:01 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* lib/yaml.rb: Use another trick to define the YAML module.
-	  https://twitter.com/n0kada/status/328342207511801856
-
-Sun Apr 28 23:19:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/pp.rb: Update PP module overview by @geopet
-
-Sun Apr 28 22:04:37 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): fix buffer overflow on
-	  x64 Windows and memory leak when initializing with integer.
-	  [ruby-core:54615] [Bug #8337]
-
-Sun Apr 28 12:38:04 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* README.EXT: correct method name to be used.  [Bug #7982]
-
-	* README.EXT.ja: add notes too.
-
-Sun Apr 28 10:35:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c: With feedback from Steve Klabnik, reverted a change to
-	  #untrusted? and #tainted?. Also adjusted grammar for $SAFE levels
-
-Sun Apr 28 10:10:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/yaml.rb: Disable setting YAML const twice [ruby-core:54642]
-
-Sun Apr 28 09:50:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c: Documentation for taint and trust [Bug #8162]
-
-Sun Apr 28 09:40:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* README.EXT: Copy note from r40505 for rb_sprintf() [Bug #7982]
-
-Sun Apr 28 08:28:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/curses/curses.c: Update Curses::Window example for nicer output
-	  Patch by Michal Suchanek [Bug #8121] [ruby-core:53520]
-
-Sun Apr 28 08:10:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* README.EXT: Update note from r40504, by Jeremy Evans [Bug #7982]
-
-Sun Apr 28 08:02:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* README.EXT: Add note to warn use of %i in Exceptions [Bug #7982]
-
-Sun Apr 28 02:41:05 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Fix a typo.  Should check endgrent() instead of
-	  endgrnam().
-
-Sun Apr 28 00:35:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* process.c (obj2gid): Don't call endgrent() if not exist.
-	  Bionic (Android's libc) don't have endgrent().
-
-	* configure.in: Check endgrnam function.
-
-Sat Apr 27 23:53:00 2013  Charlie Somerville  <charlie@charliesomerville.com>
-
-	* lib/yaml.rb: add security warning to YAML documentation
-
-Sat Apr 27 23:25:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/yaml.rb: Documentation for YAML module [Bug #8213]
-
-Sat Apr 27 20:19:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* thread_pthread.c (ruby_init_stack): Add STACK_GROW_DIR_DETECTION.
-	  This fixes a compilation failure while cross-compiling for Tensilica
-	  Xtensa Processor.
-
-Sat Apr 27 19:32:44 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* thread.c: fix typos and documentation
-
-Sat Apr 27 19:04:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* sparc.c: Use __asm__ instead of asm for gcc.
-	  gcc doesn't provide asm keyword if -ansi option is given.
-	  http://gcc.gnu.org/onlinedocs/gcc/Alternate-Keywords.html
-
-Sat Apr 27 17:22:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Redundant test removed.
-
-Sat Apr 27 16:00:10 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb (test_recvmsg_with_msg_peek_creates_fds):
-	  Extracted.
-
-Sat Apr 27 15:50:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (SIGNED_INTEGER_TYPE_P): New macro.
-	  (SIGNED_INTEGER_MAX): Ditto.
-	  (SIGNED_INTEGER_MIN): Ditto.
-	  (UNSIGNED_INTEGER_MAX): Ditto.
-	  (TIMET_MAX): Use SIGNED_INTEGER_MAX and UNSIGNED_INTEGER_MAX.
-	  (TIMET_MIN): Use SIGNED_INTEGER_MIN.
-
-	* thread.c (TIMEVAL_SEC_MAX): Use SIGNED_INTEGER_MAX.
-	  (TIMEVAL_SEC_MIN): Use SIGNED_INTEGER_MIN.
-
-Sat Apr 27 10:52:52 2013  Tanaka Akira  <akr@fsij.org>
-
-	* thread.c (TIMEVAL_SEC_MAX, TIMEVAL_SEC_MIN): Consider environments,
-	  sizeof(time_t) is smaller than sizeof(tv_sec), such as
-	  OpenBSD 5.2 (amd64).
-
-Fri Apr 26 23:34:59 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/text.rb (REXML::Text.normalize): Fix a bug that all
-	  entity filters are ignored. [ruby-dev:47278] [Bug #8302]
-	  Patch by Ippei Obayashi. Thanks!!!
-	* test/rexml/test_entity.rb (EntityTester#test_entity_filter): Add
-	  a test of the above change.
-
-Fri Apr 26 22:53:55 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/element.rb (REXML::Attributes#to_a): Support
-	  namespaced attributes. [ruby-dev:47277] [Bug #8301]
-	  Patch by Ippei Obayashi. Thanks!!!
-	* test/rexml/test_attributes.rb
-	  (AttributesTester#test_to_a_with_namespaces): Add a test of the
-	  above change.
-
-Fri Apr 26 21:48:29 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rss/atom.rb (RSS::Atom::Entry): Fix indent of document comment.
-
-Fri Apr 26 21:21:17 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rss/maker.rb (RSS::Maker): Fix indent of document comment.
-
-Fri Apr 26 18:41:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Use a block of enable_config() for
-	  --{enable,disable}-close-fds-by-recvmsg-with-peek configure option
-
-Fri Apr 26 18:08:08 2013  Tanaka Akira  <akr@fsij.org>
-
-	* dir.c (dir_set_pos): Fix a compilation error when seekdir() is not
-	  exist.
-
-Fri Apr 26 17:41:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* thread_pthread.c (ruby_init_stack): Add STACK_GROW_DIR_DETECTION.
-	  This fixes a compilation failure while cross-compiling for ARM.
-
-Fri Apr 26 14:35:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/rss/atom.rb: Documentation for RSS::Atom based on a patch by
-	  Michael Denomy
-	* lib/rss/maker.rb: Documentation for RSS::Maker also by @mdenomy
-
-Fri Apr 26 12:41:22 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: Test linkability of curses_version at first.
-
-	* ext/socket/extconf.rb: Test the behavior of fd passing with MSG_PEEK
-	  only if recvmsg(), msg_control member, AF_UNIX and SCM_RIGHTS are
-	  available.
-
-Fri Apr 26 00:07:52 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* lib/rinda/ring.rb (Rinda::RingServer#initialize): accept array
-	  arguments of address to specify multicast interface.
-
-	* lib/rinda/ring.rb (Rinda::RingServer#make_socket): add optional
-	  arguments for multicast interface.
-
-	* test/rinda/test_rinda.rb
-	  (TestRingFinger#test_ring_server_ipv4_multicast,
-	   TestRingFinger#test_ring_server_ipv6_multicast): add tests for
-	  above change.
-
-	* test/rinda/test_rinda.rb
-	  (TestRingServer#test_make_socket_ipv4_multicast,
-	   TestRingServer#test_make_socket_ipv6_multicast): change bound
-	  interface address because multicast address is not allowed on Linux
-	  or Windows.
-	  [ruby-core:53692] [Bug #8159]
-
-Thu Apr 25 23:45:02 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* lib/rinda/ring.rb (Rinda::RingServer#initialize): add a socket
-	  to @sockets in make_socket() to close sockets on shutdown even if
-	  make_socket() is called after initialize.
-
-	* lib/rinda/ring.rb (Rinda::RingServer#make_socket): ditto.
-
-Thu Apr 25 23:39:42 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/rinda/test_rinda.rb (TupleSpaceProxyTest#test_take_bug_8215):
-	  use KILL on Windows since TERM doen't work and ruby process remains
-	  after test-all on Windows.
-
-Thu Apr 25 23:16:28 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: Implement
-	  --with-curses-version={function,variable} configure option for
-	  cross-compiling.
-
-Thu Apr 25 18:15:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Don't use WIDE getaddrinfo by default.
-
-Thu Apr 25 17:56:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Remove obsolete options: ---with-ipv6-lib and
-	  --with-ipv6-libdir.
-
-Thu Apr 25 17:43:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Implement
-	  --{enable,disable}-close-fds-by-recvmsg-with-peek configure option
-	  for cross-compiling.
-	  Make --{enable,disable}-wide-getaddrinfo configure option
-	  cross-compiling friendly.
-
-Thu Apr 25 16:11:06 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_io_ext_int_to_encs, parse_mode_enc): bom-prefixed name is
-	  not a real encoding name, just a fallback.  so the proper conversion
-	  should take place even if if the internal encoding is equal to the
-	  bom-prefixed name, unless actual encoding is equal to the internal
-	  encoding.  [ruby-core:54563] [Bug #8323]
-
-	* io.c (io_set_encoding_by_bom): reset extenal encoding if no BOM
-	  found.  [ruby-core:54569]
-
-Thu Apr 25 14:35:01 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): allow Fixnum and Bignum.
-	  [ruby-core:53986] [Feature #8217]
-
-Thu Apr 25 14:26:32 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/common.rb (URI.decode_www_form): follow current URL Standard.
-	  It gets encoding argument to specify the character encoding.
-	  It now allows loose percent encoded strings, but denies ;-separator.
-	  [ruby-core:53475] [Bug #8103]
-
-	* lib/uri/common.rb (URI.decode_www_form): follow current URL Standard.
-	  It gets encoding argument to convert before percent encode.
-	  Now UTF-16 strings aren't converted to UTF-8 before percent encode
-	  by default.
-
-Wed Apr 25 14:26:00 2013  Charlie Somerville  <charlie@charliesomerville.com>
-
-	* benchmark/bm_hash_shift.rb: add benchmark for Hash#shift
-
-	* hash.c (rb_hash_shift): use st_shift if hash is not being iterated to
-	  delete element without iterating the whole hash.
-
-	* hash.c (shift_i): remove function
-
-	* include/ruby/st.h (st_shift): add st_shift function
-
-	* st.c (st_shift): ditto
-
-	[Bug #8312] [ruby-core:54524] Patch by funny-falcon
-
-Thu Apr 25 12:03:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Extract C programs as toplevel constants.
-
-Thu Apr 25 02:23:28 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_RM_RECURSIVE): this hack is needed by only
-	  autoconf 2.69 or earlier on darwin.
-
-Thu Apr 25 01:22:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/tracer.rb (get_line): simply read by File.readlines.
-
-	* lib/debug.rb (script_lines): get source lines from SCRIPT_LINES__ or
-	  read from the file.
-
-	* lib/debug.rb (display_list): use script_lines instead of recursion.
-	  [Bug #8318]
-
-	* lib/debug.rb (line_at): use script_lines same as display_list.
-
-	* lib/debug.rb (display_list): Fix debug listing when called from the
-	  same file it has been required.  patch by Dario Bertini <berdario AT
-	  gmail.com> [Bug #8318] [fix GH-280]
-
-Wed Apr 24 21:51:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: Check mblen().
-	  mblen() is optional in uClibc.
-
-	* eval_intern.h (CharNext): Don't use mblen() is not available.
-
-Wed Apr 24 15:55:06 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (rb_fd_fix_cloexec): use rb_update_max_fd().
-
-Wed Apr 24 14:08:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* numeric.c: Fix wiki link on Float imprecision in overview, patched
-	  by Makoto Kishimoto [Bug #8304] [ruby-dev:47280]
-
-Wed Apr 24 14:03:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_yylex): disallow $- without following identifier
-	  character.  [ruby-talk:406969]
-
-	* parse.y (is_special_global_name): mere $- is not a valid global
-	  variable name.
-
-Wed Apr 24 13:54:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* string.c: Document String#setbyte return value by @gjmurakami-10gen
-	  [Fixes GH-294]
-
-Wed Apr 24 13:45:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* class.c: Example of Object#methods by @windwiny [Fixes GH-293]
-	* ruby.c: Document return values of Kernel #sub, #gsub, and #chop
-
-Wed Apr 24 12:54:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/socket/lib/socket.rb: Doc typos by @vipulnsward [Fixes GH-292]
-
-
-Wed Apr 24 12:54:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/socket/lib/socket.rb: Doc typos by @vipulnsward [Fixes GH-292]
-
-Wed Apr 24 12:27:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: Fix documentation for Array#index and #replace aliases
-	  Based on a patch by @phiggins [Fixes GH-282]
-
-Tue Apr 23 21:14:38 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (rb_str_inspect): refix r40413, on Ruby 1.9 usual character
-	  escape uses hex/Unicode escapes, so fix to use Unicode escape on
-	  Unicode strings and hex on others. [ruby-core:54458] [Bug #8290]
-
-Tue Apr 23 20:10:02 2013  Tanaka Akira  <akr@fsij.org>
-
-	* missing/isnan.c (isnan): Don't define if isnan() macro is defined.
-	  This fixes a compilation failure on uClibc based Gentoo system.
-
-Tue Apr 23 17:40:40 2013  Martin Duerst <duerst@it.aoyama.ac.jp>
-
-	* lib/rexml/document.rb, lib/rexml/element.rb,
-	  lib/rexml/formatters/pretty.rb: remove opinionated
-	  language in documentation. [Bug #8309],
-	  reported by Charles Beckmann
-
-Tue Apr 23 14:04:44 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (getacl_response): parse the mailbox of an ACL
-	  response correctly.  [ruby-core:54365] [Bug #8281]
-
-Tue Apr 23 11:58:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_scrub): fix for UTF-32.  strlen() on strings
-	  contain NUL returns wrong result, use sizeof operator instead.
-	  [ruby-dev:45975] [Feature #6752]
-
-Tue Apr 23 10:26:50 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/ruby/test_module.rb
-	  (TestModule#test_const_get_invalid_name)
-	  (test_const_defined_invalid_name): Fix expected values.
-
-Tue Apr 23 09:51:26 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* string.c (rb_str_inspect): NUL should not be represented as "\0"
-	  when octal digits may follow.  [ruby-core:54458] [Bug #8290]
-
-Mon Apr 22 22:54:00 2013  Charlie Somerville  <charlie@charliesomerville.com>
-
-	* insns.def (opt_mod): Use % operator if both operands are positive for
-	  a significant performance improvement. Thanks to @samsaffron.
-
-Mon Apr 22 17:09:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (r_object0): copy all instance variables not only generic
-	  ivars, before calling post proc.  [ruby-core:51163] [Bug #7627]
-
-Mon Apr 22 10:25:21 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* util.c (ruby_hdtoa): revert r29729.
-	  If you want ruby to behave as before on x86, specify to use SSE like
-	  -msse2 -mfpmath=sse for gcc.
-
-Sun Apr 21 23:19:00 2013  Charlie Somerville  <charlie@charliesomerville.com>
-
-	* configure.in: Revert using sigsetjmp by default due to performance
-	  problems on some systems (eg. older Linux)
-
-Sun Apr 21 21:35:00 2013  Charlie Somerville  <charlie@charliesomerville.com>
-
-	* configure.in: Use sigsetjmp by default so jumping out of signal
-	  handlers properly restores the signal mask and SS_ONSTACK flag.
-	  [ruby-core:54175] [Bug #8254]
-
-	* configure.in: Manually check for presence of sigsetjmp. It is not a
-	  function on some systems, so AC_CHECK_FUNCS cannot be used.
-
-Sun Apr 21 08:00:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/csv/test_features.rb, test/logger/test_logger.rb
-	  test/mkmf/test_have_macro.rb, test/net/http/test_http.rb,
-	  test/openssl/test_config.rb, test/psych/test_encoding.rb,
-	  test/psych/test_exception.rb, test/psych/test_psych.rb,
-	  test/psych/test_tainted.rb, test/readline/test_readline.rb,
-	  test/rexml/test_contrib.rb, test/ruby/test_autoload.rb,
-	  test/ruby/test_beginendblock.rb, test/ruby/test_exception.rb,
-	  test/ruby/test_file.rb, test/ruby/test_io.rb,
-	  test/ruby/test_marshal.rb, test/ruby/test_process.rb,
-	  test/ruby/test_require.rb, test/ruby/test_rubyoptions.rb,
-	  test/syslog/test_syslog_logger.rb, test/webrick/test_httpauth.rb,
-	  test/zlib/test_zlib.rb: Use Tempfile.create.
-
-Sun Apr 21 00:15:36 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tempfile.rb (Tempfile.create): Close when the block exits.
-
-Sat Apr 20 23:38:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/webrick/httpauth/htpasswd.rb: Use Tempfile.create to avoid
-	  unintentional unlink() by the finalizer.
-	  lib/webrick/httpauth/htdigest.rb: Ditto.
-
-Sat Apr 20 22:47:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tempfile.rb (Tempfile.create): New method.
-	  The method name is proposed by Shugo Maeda.  [ruby-dev:47220]
-	  [ruby-core:41478] [Feature #5707]
-
-Sat Apr 20 14:22:10 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (w_object): dump no ivars to the original by marshal_dump.
-	  [ruby-core:54334] [Bug #8276]
-
-	* marshal.c (r_object0): copy all ivars of marshal_dump data to the
-	  result object instead.  [ruby-core:51163] [Bug #7627]
-
-Sat Apr 20 02:33:27 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (str_scrub): add ruby method String#scrub which verify and
-	  fix invalid byte sequence. [ruby-dev:45975] [Feature #6752]
-
-	* string.c (str_compat_and_valid): check given string is compatible
-	  and valid with given encoding.
-
-	* transcode.c (str_transcode0): If invalid: :replace is specified for
-	  String#encode, replace invalid byte sequence even if the destination
-	  encoding equals to the source encoding.
-
-Fri Apr 19 21:55:40 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* README.EXT.ja (Data_Wrap_Struct): Remove a description about
-	  orphan argument. Oh, I renamed the argument name without
-	  changing description at r36180... Sorry....
-	  Patch by Makoto Kishimoto. Thanks!!! [ruby-dev:47269] [Bug #8292]
-	* README.EXT.ja (Data_Make_Struct): Add a sample code that describes
-	  how it works.
-	  Patch by Makoto Kishimoto. Thanks!!! [ruby-dev:47269] [Bug #8292]
-
-Fri Apr 19 17:54:57 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (body_type_msg): should accept
-	  message/delivery-status with extra data.
-	  [ruby-core:53741] [Bug #8167]
-
-	* test/net/imap/test_imap_response_parser.rb: related test.
-
-Fri Apr 19 13:03:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (w_object): do not dump encoding which is dumped with
-	  marshal_dump data.  [ruby-core:54334] [Bug #8276]
-
-Fri Apr 19 11:36:53 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (stack_protector): control use of -fstack-protector.
-
-	* configure.in (debugflags): let -fstack-protector precede and disable
-	  debugflags, because they can't work together on SmartOS.  [Bug #8268]
-
-Fri Apr 19 07:43:52 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/openssl/test_cipher.rb: Correct a typo
-	  by jgls <joerg@joergleis.com>
-	  https://github.com/ruby/ruby/pull/291 fix GH-291
-
-Thu Apr 18 16:58:51 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (rb_mod_public_method): fix visibility on anonymous
-	  module. set visibility of singleton method, not method in base
-	  class.  [ruby-core:54404] [Bug #8284]
-
-Thu Apr 18 16:20:51 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (glob_helper): should skip dot directories only for recursion,
-	  but should not if matching to the given pattern.  [ruby-core:54387]
-	  [Bug #8283]
-
-Thu Apr 18 16:20:21 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* pack.c (pack_unpack): increase buffer size to fix buffer overflow,
-	  and fix garbage just after unpacking without missing paddings.
-	  [Bug #8286]
-
-Thu Apr 18 13:35:54 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* pack.c (pack_unpack): output characters even if the input doesn't
-	  have paddings. [Bug #8286]
-
-Thu Apr 18 08:20:48 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* common.mk (clean-ext): remove timestamps.
-
-Wed Apr 17 22:07:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (SOCKLEN_MAX): Expression simplified.
-
-Wed Apr 17 20:09:19 2013  Aman Gupta  <ruby@tmm1.net>
-
-	* compile.c (iseq_add_mark_object): Use new rb_iseq_add_mark_object().
-
-	* insns.def (setinlinecache): Ditto.
-
-	* iseq.c (rb_iseq_add_mark_object): New function to allocate
-	  iseq->mark_ary on demand. [Bug #8142]
-
-	* iseq.h (rb_iseq_add_mark_object): Ditto.
-
-	* iseq.c (prepare_iseq_build): Avoid allocating mark_ary until needed.
-
-	* iseq.c (rb_iseq_build_for_ruby2cext): Ditto.
-
-Wed Apr 17 20:00:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (SOCKLEN_MAX): Defined.
-
-	* ext/socket/raddrinfo.c (ext/socket/raddrinfo.c): Reject too long
-	  Linux abstract socket name.
-
-Wed Apr 17 19:45:27 2013  Aman Gupta  <tmm1@ruby-lang.org>
-
-	* iseq.c (iseq_location_setup): re-use existing string when iseq has
-	  the same path and absolute_path. [Bug #8149]
-
-Wed Apr 17 11:38:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit/assertions.rb (Test::Unit::Assertions#assert):
-	  UNASSIGNED is not a valid message.
-
-Wed Apr 17 10:58:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (sleep_timeval): get rid of overflow on Windows where
-	  timeval.tv_sec is not time_t but mere long.
-
-Tue Apr 16 23:07:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/unixsocket.c (unix_send_io): Suppress a warning by clang.
-	  (unix_recv_io): Ditto.
-
-Tue Apr 16 12:27:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/sdbm/init.c: Fix comment indentation, by windwiny [Fixes GH-277]
-
-Tue Apr 16 12:25:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/socket/option.c: Document synonymous methods, by windwiny [GH-277]
-	* ext/stringio/stringio.c: ditto
-	* ext/io/wait/wait.c: ditto
-	* ext/gdbm/gdbm.c: ditto
-	* ext/dl/cfunc.c: ditto
-	* ext/zlib/zlib.c: ditto
-	* ext/win32ole/win32ole.c: ditto
-	* ext/dbm/dbm.c: ditto
-	* ext/json/generator/generator.c: ditto
-	* ext/date/date_core.c: ditto
-
-Tue Apr 16 11:23:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/openssl/*: Document synonymous methods, by windwiny [GH-277]
-
-Mon Apr 15 22:21:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/fiddle/depend: New file.
-
-Mon Apr 15 22:01:02 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-insert): Check
-	  ruby-electric-is-last-command-char-expandable-punct-p here.
-
-	* misc/ruby-electric.el (ruby-electric-closing-char): New
-	  interactive function bound to closing characters.  Typing one of
-	  those closing characters right after the matching counterpart
-	  cancels the effect of automatic closing.  For example, typing
-	  "{" followed by "}" simply makes "{}" instead of "{ } }".
-
-Mon Apr 15 12:54:42 2013  Martin Bosslet  <Martin.Bosslet@gmail.com>
-
-	* ext/openssl/ossl_ssl.c: Correct shutdown behavior w.r.t GC.
-
-	* test/openssl/test_ssl.rb: Add tests to verify correct behavior.
-
-	[Bug #8240] Patch provided by Shugo Maeda. Thanks!
-
-Mon Apr 15 10:23:39 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/coverage/depend: fix id.h place as r40283.
-
-	* ext/coverage/extconf.rb: add topdir and topsrcdir to VPATH.
-
-Sun Apr 14 19:46:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/-test-/debug/depend: New file.
-
-	* ext/-test-/exception/depend: Ditto.
-
-	* ext/-test-/printf/depend: Ditto.
-
-	* ext/-test-/string/depend: Ditto.
-
-	* ext/coverage/depend: Ditto.
-
-	* ext/io/console/depend: Ditto.
-
-	* ext/io/nonblock/depend: Ditto.
-
-	* ext/io/wait/depend: Ditto.
-
-	* ext/openssl/depend: Ditto.
-
-	* ext/pathname/depend: Ditto.
-
-	* ext/psych/depend: Ditto.
-
-	* ext/zlib/depend: Ditto.
-
-Sun Apr 14 02:46:50 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#create_makefile): remove {$(VPATH)} other
-	  than nmake.
-
-	* ext/ripper/depend: use VPATH expecting removed by above.
-
-Sat Apr 13 23:06:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (timestamp_file): gather timestamp files in one
-	  directory from each extension directories.
-
-Sat Apr 13 21:09:02 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#create_makefile): output new macro
-	  disthdrdir to specify the path of id.h, parse.h and etc.
-
-	* ext/ripper/depend: use above macro.
-
-Sat Apr 13 20:28:08 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* Merge Onigmo 5.13.4 f22cf2e566712cace60d17f84d63119d7c5764ee.
-	  [bug] fix problem with optimization of \z (Issue #16) [Bug #8210]
-
-Sat Apr 13 18:56:15 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/ripper/depend: parse.h and id.h may be created on topdir.
-
-Sat Apr 13 12:08:16 2013  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/matrix.rb: Add Vector#cross_product, patch by Luis Ezcurdia
-	  [fix GH-276] [rubyspec:81eec89a124]
-
-Sat Apr 13 10:20:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* struct.c (rb_struct_define_without_accessor, rb_struct_define),
-	  (rb_struct_s_def): hide member names array.
-
-	* struct.c (anonymous_struct, new_struct, setup_struct): split
-	  make_struct() for each purpose.
-
-Sat Apr 13 09:34:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/mkmf.rb: Add ruby/ruby.h, ruby/missing.h, ruby/intern.h,
-	  ruby/st.h and ruby/subst.h for ruby_headers in generated Makefile.
-
-	* ext/-test-/old_thread_select/depend: Update dependencies.
-
-	* ext/-test-/wait_for_single_fd/depend: Ditto.
-
-	* ext/bigdecimal/depend: Ditto.
-
-	* ext/curses/depend: Ditto.
-
-	* ext/digest/bubblebabble/depend: Ditto.
-
-	* ext/digest/depend: Ditto.
-
-	* ext/digest/md5/depend: Ditto.
-
-	* ext/digest/rmd160/depend: Ditto.
-
-	* ext/digest/sha1/depend: Ditto.
-
-	* ext/digest/sha2/depend: Ditto.
-
-	* ext/dl/callback/depend: Ditto.
-
-	* ext/dl/depend: Ditto.
-
-	* ext/etc/depend: Ditto.
-
-	* ext/nkf/depend: Ditto.
-
-	* ext/objspace/depend: Ditto.
-
-	* ext/pty/depend: Ditto.
-
-	* ext/readline/depend: Ditto.
-
-	* ext/ripper/depend: Ditto.
-
-	* ext/sdbm/depend: Ditto.
-
-	* ext/socket/depend: Ditto.
-
-	* ext/stringio/depend: Ditto.
-
-	* ext/strscan/depend: Ditto.
-
-	* ext/syslog/depend: Ditto.
-
-	* ext/-test-/num2int/depend: Removed.
-
-	* ext/dbm/depend: Ditto.
-
-	* ext/fcntl/depend: Ditto.
-
-	* ext/gdbm/depend: Ditto.
-
-	* ext/racc/cparse/depend: Ditto.
-
-Sat Apr 13 00:15:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/etc/etc.c (Init_etc): move Passwd and Group under Etc namespace
-	  as primary names.
-
-Fri Apr 12 21:06:55 2013  Tanaka Akira  <akr@fsij.org>
-
-	* common.mk: pack.o depends on internal.h.
-
-Fri Apr 12 20:59:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (ones): Use __builtin_popcountl if available.
-
-	* internal.h (GCC_VERSION_SINCE): Macro moved from pack.c.
-
-	* pack.c: Include internal.h for GCC_VERSION_SINCE.
-
-Fri Apr 12 18:29:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* common.mk: version.o depends on $(srcdir)/include/ruby/version.h
-	  instead of {$(VPATH)}version.h to avoid confusion by VPATH between
-	  top level version.h and include/ruby/version.h for build in-place.
-	  [ruby-dev:47249] [Bug #8256]
-
-Fri Apr 12 15:21:24 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_callee_setup_keyword_arg): non-symbol key is not
-	  a keyword argument, keep it as a positional argument.
-
-Fri Apr 12 11:58:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: Document synonymous methods, by windwiny [GH-277]
-	* bignum.c: ditto
-	* complex.c: ditto
-	* dir.c: ditto
-	* encoding.c: ditto
-	* enumerator.c: ditto
-	* numeric.c: ditto
-	* proc.c: ditto
-	* re.c: ditto
-	* string.c: ditto
-
-Thu Apr 11 23:41:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* common.mk: Add dependencies for include/ruby.h
-
-	* tool/update-deps: Use "make -p all miniruby ruby golf" to extract
-	  dependencies in makefiles.
-
-Thu Apr 11 23:21:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* tool/update-deps: Use "make -p all golf" to extract dependencies in
-	  makefiles.
-
-Thu Apr 11 21:02:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* common.mk: Dependency updated.
-
-	* tool/update-deps: Rewritten.
-
-Thu Apr 11 19:59:48 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* common.mk: partially revert r40183, which breaks building on
-	  other than source directory. (its commit log also says the same
-	  thing, but such failure is not reproducible on my environment
-	  and the commit breaks build on my environment)
-
-Thu Apr 11 16:10:01 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/fiddle/closure.c (USE_FFI_CLOSURE_ALLOC): define 0 on
-	  Mac OS X and Linux [Bug #3371]
-
-Thu Apr 11 13:19:22 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/drb/drbtest.rb (Drb{Core,Ary}#teardown): retry Process.kill
-	  if it fails with Errno::EPERM on Windows (workaround).
-	  [ruby-dev:47245] [Bug #8251]
-
-Thu Apr 11 11:11:38 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* dir.c: Fix a typo.
-
-Thu Apr 11 10:39:34 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/fiddle/closure.c (USE_FFI_CLOSURE_ALLOC): add missing case:
-	  RUBY_LIBFFI_MODVERSION is not defined (usually on Windows).
-
-Thu Apr 11 09:27:04 2013  Konstantin Haase  <me@rkh.im>
-
-	* dir.c (file_s_fnmatch): Document File::FNM_EXTGLOB flag.
-
-Thu Apr 11 09:17:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* README: Fix typo by Benjamin Winkler [Fixes GH-281]
-
-Thu Apr 11 06:15:51 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regint.h: fix typo: _M_AMD86 -> _M_AMD64.
-
-	* siphash.c: ditto.
-
-	* st.c: ditto.
-
-Thu Apr 11 06:09:57 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/fiddle/extconf.rb: define RUBY_LIBFFI_MODVERSION macro.
-
-	* ext/fiddle/closure.c (USE_FFI_CLOSURE_ALLOC): define 0 or 1
-	  with platform and libffi's version. [Bug #3371]
-
-Thu Apr 11 05:30:43 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/mkmf.rb (pkg_config): Add optional argument "option".
-	  If it is given, it returns the result of
-	  `pkg-config --<option> <pkgname>`.
-
-Thu Apr 11 03:33:05 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/fiddle/closure.c (initialize): check mprotect's return value.
-	  If mprotect is failed because of PaX or something, its function call
-	  will cause SEGV.
-	  http://c5664.rubyci.org/~chkbuild/ruby-trunk/log/20130401T210301Z.diff.html.gz
-
-Wed Apr 10 17:39:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/bigdecimal/bigdecimal.c (VpCtoV): Initialize a local variable
-	  even when overflow.
-
-Wed Apr 10 12:32:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* bignum.c (rb_ll2big): Don't overflow on signed integer negation.
-
-	* ext/bigdecimal/bigdecimal.c (MUL_OVERFLOW_SIGNED_VALUE_P): New
-	  macro.
-	  (AddExponent): Don't overflow on signed integer multiplication.
-	  (VpCtoV): Don't overflow on signed integer arithmetic.
-	  (VpCtoV): Don't overflow on signed integer arithmetic.
-
-Wed Apr 10 06:32:12 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (MUL_OVERFLOW_INT_P): New macro.
-
-	* sprintf.c (GETNUM): Don't overflow on signed integer multiplication.
-
-Tue Apr  9 20:38:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (MUL_OVERFLOW_SIGNED_INTEGER_P): New macro.
-	  (MUL_OVERFLOW_FIXNUM_P): Ditto.
-	  (MUL_OVERFLOW_LONG_P): Ditto.
-
-	* array.c (rb_ary_product): Don't overflow on signed integer
-	  multiplication.
-
-	* numeric.c (fix_mul): Ditto.
-	  (int_pow): Ditto.
-
-	* rational.c (f_imul): Ditto.
-
-	* insns.def (opt_mult): Ditto.
-
-	* thread.c (sleep_timeval): Don't overflow on signed integer addition.
-
-	* bignum.c (rb_int2big): Don't overflow on signed integer negation.
-	  (rb_big2ulong): Ditto.
-	  (rb_big2long): Ditto.
-	  (rb_big2ull): Ditto.
-	  (rb_big2ll): Ditto.
-
-Tue Apr  9 19:45:44 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/open-uri.rb: Support multiple fields with same field
-	  name (like Set-Cookie).
-	  (OpenURI::Meta#metas): New accessor to obtain fields as a Hash from
-	  field name (string) to field values (array of strings).
-	  [ruby-core:37734] [Bug #4964] reported by ren li.
-
-Tue Apr  9 15:26:12 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_compile_each): append keyword hash to argument array
-	  to splat if needed.  [ruby-core:54094] [Bug #8236]
-
-Tue Apr  9 10:02:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (timestamp_file): gather timestamp files in one
-	  directory from each extension directories, with considering
-	  target_prefix.
-
-Tue Apr  9 04:57:59 JST 2013  Charles Oliver Nutter  <headius@headius.com>
-
-	* error.c: Capture EAGAIN, EWOULDBLOCK, EINPROGRESS exceptions and
-	  export them for use in WaitReadable/Writable exceptions.
-	* io.c: Create versions of EAGAIN, EWOULDBLOCK, EINPROGRESS that
-	  include WaitReadable and WaitWritable. Add rb_readwrite_sys_fail
-	  for nonblocking failures using those exceptions. Use that
-	  function in io_getpartial and io_write_nonblock instead of
-	  rb_mod_sys_fail
-	* ext/openssl/ossl_ssl.c: Add new SSLError subclasses that include
-	  WaitReadable and WaitWritable. Use those classes for
-	  write_would_block and read_would_block instead of rb_mod_sys_fail.
-	* ext/socket/ancdata.c: Use rb_readwrite_sys_fail instead of
-	  rb_mod_sys_fail in bsock_sendmsg_internal and
-	  bsock_recvmsg_internal.
-	* ext/socket/init.c: Use rb_readwrite_sys_fail instead of
-	  rb_mod_sys_fail in rsock_s_recvfrom_nonblock and
-	  rsock_s_connect_nonblock.
-	* ext/socket/socket.c: Use rb_readwrite_sys_fail instead of
-	  rb_mod_sys_fail in sock_connect_nonblock.
-	* include/ruby/ruby.h: Export rb_readwrite_sys_fail for use instead
-	  of rb_mod_sys_fail. Introduce new constants RB_IO_WAIT_READABLE and
-	  RB_IO_WAIT_WRITABLE for first arg to rb_readwrite_sys_fail.
-
-Tue Apr  9 02:44:32 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/socket/extconf.rb: $defs needs -D or -U.  nothing is added
-	  otherwize.
-
-	* ext/socket/extconf.rb: check struct in_addr6, which is defined in
-	  VC6 instead of in6_addr.
-
-	* ext/socket/option.c (optname_to_sym): fix macro name.
-
-	* ext/socket/constants.c (rsock_cmsg_type_arg): fix macro name.
-
-Mon Apr  8 23:57:21 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (id_for_setter): extract common code from const, class
-	  variable, instance variable setters.
-
-Mon Apr  8 23:55:53 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/depend (ENCOBJS, TRANSOBJS): use explicit path to ruby.h for
-	  nmake.
-
-	* ext/depend (ENCOBJS, TRANSOBJS): fix header dependency, VPATH has
-	  $(srcdir)/include/ruby but not $(srcdir)/include, so cannot find out
-	  ruby/ruby.h.  use ruby.h instead and ../ruby for include/ruby.h.
-
-Mon Apr  8 20:30:37 2013  Yuki Yugui Sonoda  <yugui@google.com>
-
-	* ext/depend (ENCOBJS, TRANSOBJS): Add missing dependencies.
-
-Mon Apr  8 17:19:28 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/win32ole/win32ole.c (fole_missing): should check actual argument
-	  count before accessing.
-
-Mon Apr  8 16:03:55 2013  Yuki Yugui Sonoda  <yugui@google.com>
-
-	Fixes a build failure of ext/ripper/ripper.c on building out of place.
-	* common.mk (id.h, id.c): Always generated in $(srcdir).
-	(ext/ripper/ripper.c): Passes $(PATH_SEPARATOR) too to the sub make.
-
-Mon Apr  8 12:05:02 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* object.c (rb_obj_ivar_set): call to_str for string only once.
-	  to_str was called from rb_is_const_name and rb_to_id before.
-
-	* object.c (rb_mod_const_set): ditto.
-
-	* object.c (rb_mod_cvar_set): ditto.
-
-Sun Apr  7 13:56:16 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/ruby/test_require.rb (TestRequire#test_require_nonascii_path):
-	  RUBY_PLATFORM should escape as Regexp,
-	  because RUBY_PLATFORM may contain '.'.
-
-Sun Apr  7 10:44:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/defines.h: Simplify the logic to include sys/select.h.
-	  This fixes a compilation error on Haiku (gcc2 and gcc4).
-
-	* configure.in: Use shared linker as $(CC) for Haiku.
-	  This fixes a build error on Haiku (gcc2).
-
-Sun Apr  7 10:41:30 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb (MDNSOneShot#sender): Delete an unused variable.
-
-Sun Apr  7 03:24:36 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* addr2line.c: use more generic type:
-	  * u_char -> unsigned char
-	  * u_short -> unsigned short
-	  * u_int -> unsigned int
-	  * u_long -> unsigned long
-	  * quad_t -> int64_t
-	  * u_quad_t -> uint64_t
-
-	* addr2line.c (imax): inline is defined by configure.
-
-Sun Apr  7 01:40:39 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-hash): New electric
-	  function that expands a hash sign inside a string or regexp to
-	  "#{}".
-
-	* misc/ruby-electric.el (ruby-electric-curlies): Do not insert
-	  spaces inside when the curly brace is a delimiter of %r, %w,
-	  etc.
-
-	* misc/ruby-electric.el (ruby-electric-curlies): Insert another
-	  space before a closing curly brace when
-	  ruby-electric-newline-before-closing-bracket is nil.
-
-Sun Apr  7 01:01:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* strftime.c (rb_strftime_with_timespec): Test yday range.
-	  [ruby-core:44088] [Bug #6247] reported by Ruby Submit.
-
-Sat Apr  6 23:46:54 2013  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* configure.in (AC_CHECK_HEADERS): atomic.h for Solaris atomic_ops.
-
-	* ruby_atomic.h: Skip using Solaris10 atomic_ops on Solaris 9 or
-	  earlier if atomic.h is not available. [ruby-dev:47229] [Bug #8228]
-
-Sat Apr  6 23:40:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb: Support LOC resources.
-	  [ruby-core:23361] [Feature #1436] by JB Smith.
-
-Sat Apr  6 23:38:09 2013  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* addr2line.c: quad_t and u_quad_t is not available on Solaris.
-	  __inline is not available with old compilers on Solaris.
-	  [ruby-dev:47229] [Bug #8227]
-
-Sat Apr  6 23:31:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb: Add one-shot multicast DNS support.
-	  [ruby-core:53387] [Feature #8089] by Eric Hodel.
-
-Sat Apr  6 22:12:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb (Resolv::DNS.fetch_resource): New method to obtain
-	  full result.
-	  [ruby-dev:43587] [Feature #4788] proposed by Makoto Kishimoto.
-
-Sat Apr  6 20:17:51 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_sys_fail_raddrinfo): Renamed from
-	  rsock_sys_fail_addrinfo.
-	  (rsock_sys_fail_raddrinfo_or_sockaddr): Renamed from
-	  rsock_sys_fail_addrinfo_or_sockaddr.
-
-	* ext/socket/rubysocket.h: Follow the above change.
-
-Sat Apr  6 19:24:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_sys_fail_sockaddr): Takes struct sockaddr
-	  and socklen_t instead of String object.
-	  (rsock_sys_fail_addrinfo_or_sockaddr): Follow the above change.
-
-	* ext/socket/rubysocket.h (rsock_sys_fail_sockaddr): Follow the above
-	  change.
-
-Sat Apr  6 14:28:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (SockAddrStringValueWithAddrinfo): New macro.
-	  (rsock_sockaddr_string_value_with_addrinfo): New declaration.
-	  (rsock_addrinfo_inspect_sockaddr): Ditto.
-	  (rsock_sys_fail_addrinfo): Ditto.
-	  (rsock_sys_fail_sockaddr_or_addrinfo): Ditto.
-
-	* ext/socket/raddrinfo.c (rsock_addrinfo_inspect_sockaddr): Renamed
-	  from addrinfo_inspect_sockaddr and exported.
-	  (rsock_sockaddr_string_value_with_addrinfo): New function to obtain
-	  string and possibly addrinfo object.
-
-	* ext/socket/socket.c (rsock_sys_fail_sockaddr): Don't use
-	  rsock_sys_fail_host_port which is IP dependent.  Invoke
-	  rsock_sys_fail_addrinfo.
-	  (rsock_sys_fail_addrinfo): New function using
-	  rsock_addrinfo_inspect_sockaddr.
-	  (rsock_sys_fail_addrinfo_or_sockaddr): New function.
-	  (sock_connect): Use SockAddrStringValueWithAddrinfo and
-	  rsock_sys_fail_addrinfo_or_sockaddr.
-	  (sock_connect_nonblock): Ditto.
-	  (sock_bind): Ditto.
-
-Sat Apr  6 13:34:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_sys_fail_sockaddr): Delete 2nd argument.
-
-	* ext/socket/rubysocket.h (rsock_sys_fail_sockaddr): Follow above
-	  change.
-
-Sat Apr  6 13:13:39 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_sys_fail_path): Use rb_str_inspect only
-	  for String to avoid SEGV.
-
-Sat Apr  6 12:40:16 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (rsock_sys_fail_host_port): Wrap by NORETURN.
-	  (rsock_sys_fail_path): Ditto.
-	  (rsock_sys_fail_sockaddr): Ditto.
-
-Sat Apr  6 11:49:35 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_sys_fail_path): Use rb_str_inspect if the
-	  path contains a NUL.
-
-Sat Apr  6 11:39:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket: Improve socket exception message to show socket address.
-	  [ruby-core:45617] [Feature #6583] proposed Eric Hodel.
-
-	* ext/socket/rubysocket.h (rsock_sys_fail_host_port): Declared.
-	  (rsock_sys_fail_path): Ditto.
-	  (rsock_sys_fail_sockaddr): Ditto.
-
-	* ext/socket/udpsocket.c (udp_connect): Use rsock_sys_fail_host_port.
-	  (udp_bind): Ditto.
-	  (udp_send): Ditto.
-
-	* ext/socket/init.c (rsock_init_sock): Specify a string for rb_sys_fail
-	  argument.
-	  (make_fd_nonblock): Ditto.
-	  (rsock_s_accept): Ditto.
-
-	* ext/socket/ipsocket.c (init_inetsock_internal): Use
-	  rsock_sys_fail_host_port.
-
-	* ext/socket/socket.c (rsock_sys_fail_host_port): Defined.
-	  (rsock_sys_fail_path): Ditto.
-	  (rsock_sys_fail_sockaddr): Ditto.
-	  (setup_domain_and_type): Use rsock_sys_fail_sockaddr.
-	  (sock_connect_nonblock): Ditto.
-	  (sock_bind): Ditto.
-	  (sock_gethostname): Specify a string for rb_sys_fail argument.
-	  (socket_s_ip_address_list): Ditto.
-
-	* ext/socket/basicsocket.c (bsock_shutdown): Specify a string for
-	  rb_sys_fail argument.
-	  (bsock_setsockopt): Use rsock_sys_fail_path.
-	  (bsock_getsockopt): Ditto.
-	  (bsock_getpeereid): Refine the argument for rb_sys_fail.
-
-	* ext/socket/unixsocket.c (rsock_init_unixsock): Use
-	  rsock_sys_fail_path.
-	  (unix_path): Ditto.
-	  (unix_send_io): Ditto.
-	  (unix_recv_io): Ditto.
-	  (unix_addr): Ditto.
-	  (unix_peeraddr): Ditto.
-
-Sat Apr  6 11:23:18 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/ruby/test_require.rb (TestRequire#test_require_nonascii_path):
-	  fix load path for encoding to run the test as stand-alone.
-
-Sat Apr  6 09:54:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* pack.c (NATINT_LEN): fix definition order, must be after
-	  NATINT_PACK.
-
-Sat Apr  6 03:11:07 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: fix symbol keys in coder
-	  emission.  Thanks @tjwallace
-	* test/psych/test_coder.rb: test for change
-
-Sat Apr  6 02:54:08 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/exception.rb: there should be only one exception
-	  base class. Fixes tenderlove/psych #125
-	* ext/psych/lib/psych.rb: require the correct exception class
-	* ext/psych/lib/psych/syntax_error.rb: ditto
-	* ext/psych/lib/psych/visitors/to_ruby.rb: ditto
-
-Sat Apr  6 02:30:28 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (new_defined): remove all extra parentheses, and return
-	  "nil" for defined? with empty expression.
-	  [ruby-core:54024] [Bug #8224]
-
-Sat Apr  6 02:06:04 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: correctly register
-	  self-referential strings. Fixes tenderlove/psych #135
-
-	* test/psych/test_string.rb: appropriate test.
-
-Sat Apr  6 01:21:56 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/init.c (cloexec_accept): Fix a compile error on
-	  Debian GNU/kFreeBSD.  Consider HAVE_ACCEPT4 is defined
-	  but SOCK_CLOEXEC is not defined.
-
-Sat Apr  6 00:19:30 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* load.c (features_index_add): use rb_str_subseq() to specify C string
-	  position properly to fix require non ascii path.
-	  [ruby-core:53733] [Bug #8165]
-
-	* test/ruby/test_require.rb (TestRequire#test_require_nonascii_path):
-	  a test for the above.
-
-Fri Apr  5 20:41:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/defines.h (HAVE_TRUE_LONG_LONG): Defined to distinguish
-	  availability of long long and availability of 64bit integer type.
-
-	* pack.c: Use HAVE_TRUE_LONG_LONG to distinguish q! and Q! support.
-
-Fri Apr  5 20:19:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* addr2line.c: Include ruby/missing.h to fix compile error on Debian.
-
-Fri Apr  5 19:39:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_compile_each): fix of defined? with empty
-	  expression.  [ruby-core:53999] [Bug #8220]
-
-Fri Apr  5 13:22:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/curses/curses.c (Init_curses): fix implementation function,
-	  crmode should be same as cbreak.  [ruby-core:54013] [Bug #8222]
-
-Fri Apr  5 12:06:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/curses/hello.rb: Typo in Curses example by Drew Blas
-	  [Fixes GH-273]
-
-Thu Apr  4 23:45:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb (bind_random_port): Rescue EACCES for SunOS.
-	  bind() on SunOS for port 2049 (nfs) and 4045 (lockd) causes
-	  EACCES with unprivileged process.  cf. PRIV_SYS_NFS in privileges(5)
-	  [ruby-core:48064] [Bug #7183] reported by Frank Meier.
-
-Thu Apr  4 23:24:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Remove condition for bcc.
-
-Thu Apr  4 22:53:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/ruby.h (FIX2LONG): Parenthesize the macro body.
-
-Thu Apr  4 22:32:32 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (time_strftime): Describe %L and %N truncates digits under
-	  the specified length.
-	  [ruby-core:52130] [Bug #7829]
-
-Thu Apr  4 22:08:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* object.c (rb_mod_cvar_set): Reverted "avoid inadvertent
-	  symbol creation" to avoid SEGV by
-	  Class.new.class_variable_set(1, 2).
-
-Thu Apr  4 20:07:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/pathname/pathname.c (path_write): New method.
-	  (path_binwrite): Ditto.
-	  [ruby-core:49468] [Feature #7378]
-
-Thu Apr  4 16:51:29 2013  Yuki Yugui Sonoda  <yugui@google.com>
-
-	* thread_pthread.c: Fixes wrong scopes of #if USE_SLEEPY_TIMER_THREAD
-	  .. #endif sections.  This fixes a build error on NativeClient.
-
-Wed Apr  3 17:25:31 2013  Yuki Yugui Sonoda  <yugui@google.com>
-
-	* thread_pthread.c (ruby_init_stack): Avoid using uninitialized value.
-	  stackaddr and size are not set if get_stack() fails.
-
-Thu Apr  4 16:55:08 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* struct.c (make_struct): avoid inadvertent symbol creation.
-	  (rb_struct_aref): ditto.
-	  (rb_struct_aset): ditto.
-
-Thu Apr  4 16:54:40 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (rb_mod_const_set): avoid inadvertent symbol creation.
-	  (rb_obj_ivar_set): ditto.
-	  (rb_mod_cvar_set): ditto.
-
-Thu Apr  4 15:46:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enum.c (enum_inject): avoid inadvertent symbol creation.
-
-Thu Apr  4 14:37:07 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (rb_thread_aref): avoid inadvertent symbol creation.
-	  (rb_thread_variable_get): ditto.
-	  (rb_thread_key_p): ditto.
-	  (rb_thread_variable_p): ditto.
-
-Thu Apr  4 11:33:57 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/openssl/ossl_bn.c (ossl_bn_to_i): Use bn2hex to speed up.
-	  In general, binary to/from decimal needs extra cost.
-
-Thu Apr  4 07:24:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Specify arguments to test functions.
-
-Thu Apr  4 03:25:09 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/openssl/ossl_bn.c (ossl_bn_initialize): fix can't create from bn.
-
-Wed Apr  3 22:09:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: Test functions and libraries after headers.
-
-Wed Apr  3 21:23:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	 * io.c (rb_io_seek_m): Accept :CUR, :END, :SET as "whence" argument.
-	   (interpret_seek_whence): New function.
-	   [ruby-dev:45818] [Feature #6643]
-
-Wed Apr  3 20:52:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* process.c: Describe the behavior which Ruby invokes a commandline
-	  directly without shell if the commandline is simple enough.
-	  [ruby-core:50459] [Bug #7489]
-
-Wed Apr  3 20:27:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/extmk.rb (extmake): Invoke Logging::log_close in a ensure
-	  clause.
-
-Wed Apr  3 18:53:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/extmk.rb (extmake): Use Logging.open to switch stdout and
-	  stderr.  Delay Logging::log_close until the failure message is
-	  written.  Write the failure message only if log file is opened.
-
-	* lib/mkmf.rb (Logging.log_opened?): New method.
-
-	  [ruby-dev:47215] [Bug #8209]
-
-Wed Apr  3 17:11:15 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (constat_apply): pass through unknown sequence which
-	  starts with ESC but is not followed by a bracket.  [ruby-core:53879]
-	  [Bug #8201]
-
-Wed Apr  3 16:35:32 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (rb_big_eq): hide intermediate Bignums not just freeing
-	  memory.  [ruby-core:53893] [Bug #8204]
-
-	* object.c (rb_obj_hide): hide an object by clearing klass.
-
-	* bignum.c (rb_big_eq): test as Fixnum if possible and get rid of zero
-	  length Bignum.  [ruby-core:53893] [Bug #8204]
-
-Tue Apr  2 23:56:03 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/securerandom.rb (SecureRandom.random_bytes): Use
-	  OpenSSL::Random.random_add instead of OpenSSL::Random.seed and
-	  specify 0.0 as the entropy.
-	  [ruby-core:47308] [Bug #6928]
-
-Tue Apr  2 20:24:52 2013  Tanaka Akira  <akr@fsij.org>
-
-	* pack.c: Support Q! and q! for long long.
-	  (natstr): Moved to toplevel.  Add q and Q if there is long long type.
-	  (endstr): Moved to toplevel.
-	  (NATINT_PACK): Consider long long.
-	  (NATINT_LEN_Q): New macro.
-	  (pack_pack): Support Q! and q!.
-	  (pack_unpack): Ditto.
-	  [ruby-dev:43970] [Feature #3946]
-
-Tue Apr  2 19:24:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/-test-/num2int/num2int.c: Define utility methods
-	  as module methods of Num2int.
-
-	* test/-ext-/num2int/test_num2int.rb: Follow the above change.
-
-Tue Apr  2 18:49:01 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/securerandom.rb: Don't use Array#to_s.
-	   [ruby-core:52058] [Bug #7811] fixed by zzak (Zachary Scott).
-
-Tue Apr  2 17:38:20 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* re.c (rb_reg_to_s): suppress duplicated charclass warning.
-	  Regexp#to_s suppress extra its whole regexp options by calling
-	  onig_new with its source, but it doesn't call rb_reg_preprocess.
-	  Therefore its Unicode escapes (\u{XXXX}) are given as is,
-	  and it may cause duplicated charclass warning for example
-	  "[\u{33}]" (3 is duplicated) or "[\u{a}\u{b}]" (u is duplicated).
-	  [ruby-core:53649] [Bug #8151]
-
-Tue Apr  2 16:00:06 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_dump.c (rb_print_backtrace): separate to ease showing C backtrace.
-
-	* internal.h (rb_print_backtrace): ditto.
-
-Tue Apr  2 15:22:09 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/ruby/envutil.rb (assert_separately): stop_auto_run of
-	  Test::Unit::Runner to prevent auto runner use ARGV.
-
-	* test/ruby/envutil.rb (assert_separately): add $: to separate process.
-
-	* test/ruby/envutil.rb (assert_separately): fail if stderr is not
-	  empty and ignore_stderr is false.
-
-Tue Apr  2 06:46:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/-test-/num2int/num2int.c: Rename utility methods
-	  to global functions to ease manual experiments.
-
-	* test/-ext-/num2int/test_num2int.rb: Follow the above change.
-
-Mon Apr  1 22:26:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/zlib/zlib.c (rb_gzfile_set_mtime): Use NUM2UINT.
-	  The old logic doesn't work well on LP64 platforms as:
-	  .. -2**63-1 => error,
-	  -2**63 .. -2**62-1 => success,
-	  -2**62 .. -2**31-1 => error,
-	  -2**31 .. 2**31-1 => success,
-	  2**31 .. 2**62-1 => error,
-	  2**62 .. 2**64-1 => success,
-	  2**64 ..  => error.
-
-Mon Apr  1 22:08:02 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* ext/zlib/zlib.c (Zlib::Inflate.new):
-	  Fix documentation syntax and naming errors.
-	  Based on patch by Robin Dupret. Fix GH-271.
-
-Mon Apr  1 21:22:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/-ext-/num2int/test_num2int.rb: Test small bignums.
-
-Mon Apr  1 21:10:56 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (rb_num2ulong_internal): Don't cast a negative double value
-	  into unsigned long, which is undefined behavior.
-	  (rb_num2ull): Don't cast a value bigger than LLONG_MAX into
-	  long long, which is undefined behavior.
-
-Mon Apr  1 20:57:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/-test-/num2int/num2int.c: Return string for result, instead of
-	  printing.
-
-	* test/-ext-/num2int/test_num2int.rb: updated to follow above change.
-
-Mon Apr  1 20:08:07 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (rb_num2long): Don't use SIGNED_VALUE uselessly.
-	  (check_int): Ditto.
-	  (check_short): Ditto.
-	  (rb_num2fix): Ditto.
-	  (rb_num2ulong_internal): Add a cast.
-
-Mon Apr  1 18:41:35 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: skip autoconf 2.64 and 2.66, 2.67 seems short-lived
-	  but stick on it for Debian Squeeze.
-
-Mon Apr  1 14:22:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: check clang version by predefined macro values.
-	  [Bug #8192]
-
-Mon Apr  1 12:05:15 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (check_uint): Take the 1st argument as unsigned long,
-	  instead of VALUE.  Refine the validity test conditions.
-	  (check_ushort): Ditto.
-
-Mon Apr  1 07:15:03 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* configure.in: use quadrigraph to put '[' or ']'. [Bug #8192]
-
-Mon Apr  1 04:16:41 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in: kick old clang. [ruby-dev:47204] [Bug #8192]
-
-Mon Apr  1 01:12:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/ruby.h (FIX2ULONG): Make it consistent with NUM2ULONG.
-
-	* ext/-test-/num2int/num2int.c: Add utility methods for FIX2XXX tests.
-
-	* test/-ext-/num2int/test_num2int.rb: Add tests for FIX2XXX.
-
-Sun Mar 31 17:17:56 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (rb_mod_define_method): consider visibility in define_method.
-	  patch by mashiro <mail AT mashiro.org>.  fix GH-268.
-
-Sun Mar 31 15:40:30 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/configure.bat: try to fix option arguments split by commas and
-	  equals here.  this batch file no longer run with old command.com.
-
-	* tool/mkconfig.rb: no hacks for cmd.exe.
-
-Sun Mar 31 13:47:04 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (rb_num2ulong_internal): New function similar to
-	  rb_num2ulong but integer wrap around flag is also returned.
-	  (rb_num2ulong): Use rb_num2ulong_internal.
-	  (rb_num2uint): Use rb_num2ulong_internal and the wrap around flag is
-	  used instead of negative_int_p(val).
-	  (rb_num2ushort): ditto.
-
-Sun Mar 31 06:27:17 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (HAVE_METACLASS_P): should check FL_SINGLETON flag before get
-	  instance variable to get rid of wrong warning about __attached__.
-	  [ruby-core:53839] [Bug #8188]
-
-Sat Mar 30 14:11:28 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* bcc32: removed. agreed at
-	  http://bugs.ruby-lang.org/projects/ruby/wiki/DevelopersMeeting20130223Japan
-
-Sat Mar 30 03:58:00 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/file.c (code_page): use cp1252 instead of cp20127 as US-ASCII.
-	  fix [ruby-core:53079] [Bug #7996]
-	  reported and patched by mmeltner (Michael Meltner).
-
-Sat Mar 30 03:49:21 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (wrename): use MoveFileExW instead of MoveFileW,
-	  because the latter fails on cross device file move of some
-	  environments.
-	  fix [ruby-core:53492] [Bug #8109]
-	  reported by mitchellh (Mitchell Hashimoto).
-
-Fri Mar 29 22:09:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (rb_mutex_synchronize_m): yield no block params.  patch by
-	  splattael (Peter Suschlik) in [ruby-core:53773] [Bug #8097].
-	  fix GH-266.
-
-Fri Mar 29 16:51:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (argf_next_argv): set init flag if succeeded to forward, after
-	  skipping.
-
-	* io.c (argf_block_call_i, argf_block_call): no more forwarding if
-	  forwarded after skipping.  [ruby-list:49185]
-
-	* io.c (argf_close): deal with init flag.
-
-	* io.c (argf_block_call_i, argf_block_call): forward next file if
-	  skipped while iteration, to get rid of IOError.  [ruby-list:49185]
-
-Fri Mar 29 11:09:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (configuration): not include all CFLAGS in CXXFLAGS, to
-	  use different set than C for C++.  [ruby-core:45273] [Bug #6504]
-
-Fri Mar 29 10:24:10 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/io.h: undef POSIX compliant names on AIX, which are no
-	  longer needed.  patch suggested by edelsohn (David Edelsohn) in
-	  [ruby-core:53815].  [Bug #8174]
-
-Fri Mar 29 06:39:42 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (rb_num2ull): Cast double to unsigned LONG_LONG via
-	  LONG_LONG instead of double to unsigned LONG_LONG directly.
-	  This is a challenge to fix a test_num2ull(TestNum2int)
-	  failure (NUM2ULL(-1.0) should be "18446744073709551615" but was "0")
-	  on Mac OS X with 32bit clang.
-	  http://a.mrkn.jp/~mrkn/chkbuild/mountain_lion/ruby-trunk-m32-o0/log/20130328T191100Z.diff.html.gz
-
-Fri Mar 29 00:54:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MAIN_DOES_NOTHING): ensure symbols for tests to be
-	  preserved.  [ruby-core:53745] [Bug #8169]
-
-Thu Mar 28 23:11:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb: Test Windows platform by detecting LoadError when
-	  require 'win32/resolv' suggested by Nobuyoshi Nakada [ruby-core:53389].
-	  [ruby-core:53388] [Feature #8090] Reported by Charles Nutter.
-
-Thu Mar 28 23:10:10 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/io.h: rename SVR3,4 member names as POSIX compliant,
-	  to get rid of conflict on AIX.  [ruby-core:53765] [Bug #8174]
-
-Thu Mar 28 18:22:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/-ext-/num2int/test_num2int.rb: extract
-	  assert_num2i_success_internal and assert_num2i_error_internal and
-	  provide assertion messages as "NUM2XXX(NNN)".
-
-Thu Mar 28 07:05:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h: Delete redundant inclusions caused by
-	  AC_INCLUDES_DEFAULT in defines.h.
-
-	* include/ruby/defines.h: Ditto.
-
-	* include/ruby/ruby.h: Ditto.
-
-	* include/ruby/st.h: Ditto.
-
-Thu Mar 28 06:51:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/defines.h: Fix a compilation error on NetBSD,
-	  "type of formal parameter 1 is incomplete" for the rb_thread_wait_for
-	  invocation in rb_file_flock, by including header files as
-	  AC_INCLUDES_DEFAULT of autoconf.
-
-Wed Mar 27 22:09:14 2013  Tanaka Akira  <akr@fsij.org>
-
-	* numeric.c (LONG_MIN_MINUS_ONE_IS_LESS_THAN): New macro.
-	  (LLONG_MIN_MINUS_ONE_IS_LESS_THAN): Ditto.
-	  (rb_num2long): Use LONG_MIN_MINUS_ONE_IS_LESS_THAN.
-	  (rb_num2ulong): Ditto.
-	  (rb_num2ll): Use LLONG_MIN_MINUS_ONE_IS_LESS_THAN.
-	  (rb_num2ull): Ditto.
-
-	* test/-ext-/num2int/test_num2int.rb (assert_num2i_success): Test the
-	  value converted into a Float if Float can represent the value
-	  exactly.
-	  (assert_num2i_error): Ditto.
-
-Wed Mar 27 20:59:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/-ext-/num2int/test_num2int.rb (assert_num2i_success): New
-	  utility method.
-	  (assert_num2i_error): Ditto.
-
-Wed Mar 27 20:37:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (num_exact): Use to_r method only if to_int method is
-	  available.
-	  [ruby-core:53764] [Bug #8173] Reported by Hiro Asari.
-
-Wed Mar 27 12:07:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/-ext-/num2int/test_num2int.rb (test_num2ll): test LLONG_MIN,
-	  not LONG_MIN.
-
-Wed Mar 27 12:02:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (TIMET_MAX_PLUS_ONE): definition simplified.
-
-Wed Mar 27 06:39:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MAIN_DOES_NOTHING): force to refer symbols for tests
-	  to be preserved.  [ruby-core:53745] [Bug #8169]
-
-Wed Mar 27 05:15:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_REPLACE_TYPE): define SIGNEDNESS_OF_type same as
-	  check_signedness of mkmf.rb.
-
-	* internal.h (TIMET_MAX, TIMET_MIN, TIMET_MAX_PLUS_ONE): use
-	  SIGNEDNESS_OF_TIME_T.
-
-Wed Mar 27 00:28:45 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (TIMET_MAX_PLUS_ONE): Defined.
-
-	* thread.c (double2timeval): Saturate out-of-range values.
-
-Tue Mar 26 23:41:18 2013  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h: Define TIMET_MAX and TIMET_MIN here.
-
-	* time.c: Remove TIMET_MAX and TIMET_MIN definitions.
-
-	* thread.c: Ditto.
-
-	* thread_pthread.c: Remove TIMET_MAX definition.
-
-	* thread_win32.c: Ditto.
-
-Tue Mar 26 22:31:10 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (sockaddr_len): return the shortest length for
-	  unknown socket address.
-
-Tue Mar 26 22:14:46 2013  Tanaka Akira  <akr@fsij.org>
-
-	* thread.c (double2timeval): convert the infinity to TIME_MAX to avoid
-	  SEGV by Thread.new {}.join(Float::INFINITY) on
-	  Debian GNU/Linux (amd64).
-
-Mon Mar 25 07:09:20 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rinda/tuplespace.rb:  Only return tuple entry once on move,
-	  either through port or regular return, not both.  This results in a
-	  120% speedup when combined with #8125.  Patch by Joel VanderWerf.
-	  [ruby-trunk - Feature #8119]
-
-Mon Mar 25 06:59:01 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rinda/test_rinda.rb:  Skip IPv6 tests if no IPv6 addresses
-	  exist.  Skip fork-dependent test if fork is not available.
-	  [ruby-trunk - Bug #8159]
-
-Sun Mar 24 10:38:24 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* addr2line.c (putce): suppress unused return value warning.
-
-Mon Mar 25 02:01:03 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* proc.c (bm_free): need to clean up the mark flag of a free and
-	  unlinked method entry. [Bug #8100] [ruby-core:53439]
-
-Sun Mar 24 22:13:51 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (rb_str_rpartition): revert r39903, and convert byte offset
-	  to char offset; the return value of rb_reg_search is byte offset,
-	  but other than it of rb_str_rpartition expects char offset.
-	  [Bug #8138] [ruby-dev:47183]
-
-Sun Mar 24 18:29:46 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* string.c (rb_str_rpartition): Fix String#rpartition(/re/)
-	  against a multibyte string. [Bug #8138] [ruby-dev:47183]
-
-Sun Mar 24 13:42:24 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (GC_ENABLE_LAZY_SWEEP): new macro to switch lazy sweeping
-	  for debugging. [Feature #8024] [ruby-dev:47135]
-
-Sun Mar 24 12:55:47 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: We have no chance to expand the heap when lazy sweeping is
-	  restricted. So collecting is often invoked if there is not
-	  enough free space in the heap. Try to expand heap when this is
-	  the case.
-
-Sun Mar 24 11:03:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_require.rb: Remove temporally files in the tests.
-
-	* test/ruby/test_rubyoptions.rb: Ditto.
-
-	* test/logger/test_logger.rb: Ditto.
-
-	* test/psych/test_psych.rb: Ditto.
-
-	* test/readline/test_readline.rb: Ditto.
-
-	* test/syslog/test_syslog_logger.rb: Ditto.
-
-	* test/webrick/test_httpauth.rb: Ditto.
-
-	* test/zlib/test_zlib.rb: Ditto.
-
-Sun Mar 24 05:36:29 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rinda/ring.rb:  Added documentation for multicast support.
-
-	* NEWS:  Point to above documentation.
-
-Sun Mar 24 05:32:39 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rinda/test_rinda.rb:  Restore tests commented out while fixing
-	  test slowdown bug before r39895.
-
-Sun Mar 24 05:03:36 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rinda/ring.rb:  Add multicast support to Rinda::RingFinger and
-	  Rinda::RingServer.  [ruby-trunk - Bug #8073]
-	* test/rinda/test_rinda.rb:  Test for the above.
-
-	* NEWS: Update with Rinda multicast support
-
-Sun Mar 24 04:13:27 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rinda/test_rinda.rb:  Fixed test failures in r39890 and r39891
-	  due to stopping DRb service.
-
-Sun Mar 24 03:34:02 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rinda/rinda.rb:  Fixed loss of tuple when remote is alive but the
-	  call stack was unwound.  Patch by Joel VanderWerf.
-	  [ruby-trunk - Bug #8125]
-	* test/rinda/test_rinda.rb:  Test for the above.
-
-Sun Mar 24 02:14:53 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/mkmf/test_have_macro.rb: remove temporally files in the tests.
-
-Sat Mar 23 23:50:04 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* addr2line.c (kprintf): added from FreeBSD libstand's printf.
-	  this is consided as async signal safe function.
-
-	* addr2line.c (rb_dump_backtrace_with_lines): use kfprintf.
-	  [Bug #8144] [ruby-core:53632]
-
-Sat Mar 23 23:28:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_divide): Use Qnil and NIL_P
-	  instead of (VALUE)0 as a return value.
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_div): ditto.
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_divremain): ditto.
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_remainder): ditto.
-
-Sat Mar 23 17:39:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (check_funcall_respond_to): preserve passed_block, which
-	  is modified in vm_call0_body() via vm_call0(), and caused a bug of
-	  rb_check_funcall() by false negative result of rb_block_given_p().
-	  re-fix [ruby-core:53650] [Bug #8153].
-	  [ruby-core:53653] [Bug #8154]
-
-Fri Mar 22 17:48:34 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/forwardable.rb (Forwardable::FILE_REGEXP): create regexp object
-	  outside sources for eval, to reduce allocations in def_delegators
-	  wrappers.  //o option does not make each regexps shared.  patch by
-	  tmm1 (Aman Gupta) in [ruby-core:53620] [Bug #8143].
-
-Fri Mar 22 17:38:42 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (rb_feature_p), vm_core.h (rb_vm_struct): turn
-	  loaded_features_index into st_table.  patches by tmm1 (Aman Gupta)
-	  in [ruby-core:53251] and [ruby-core:53274] [Bug #8048]
-
-Fri Mar 22 10:29:00 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c: Fix style.
-
-Fri Mar 22 05:30:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (ambiguous_operator): refine warning message, since this
-	  warning is shown after literal too.
-
-Fri Mar 22 04:51:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_callee_setup_keyword_arg): should check required
-	  keyword arguments even if rest hash is defined.  [ruby-core:53608]
-	  [Bug #8139]
-
-Fri Mar 22 01:00:17 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* process.c (rb_execarg_addopt, run_exec_pgroup): use rb_pid_t
-	  instead of pid_t.
-
-	* ext/pty/pty.c (raise_from_check, pty_check): ditto.
-
-Fri Mar 22 00:04:15 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* addr2line.c (rb_dump_backtrace_with_lines): output line at once.
-
-Thu Mar 21 23:17:08 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (ruby_kill): get rid of deadlock on signal 0.
-	  [ruby-dev:47182] [Bug #8137]
-
-Thu Mar 21 22:39:46 2013  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* marshal.c (marshal_dump, marshal_load): workaround for segv on
-	  Intel Solaris compiled with Oracle SolarisStudio 12.3.
-	  Partly revert r38174. [ruby-core:52042] [Bug #7805]
-
-Thu Mar 21 16:48:06 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (simple_re_meta): escape all closing characters, not only
-	  round parenthesis.  [ruby-core:53578] [Bug #8133]
-
-Thu Mar 21 13:50:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_core.h (UNINITIALIZED_VAR): suppress warnings by clang 4.2.
-	  [ruby-core:51742] [Bug #7756]
-
-Thu Mar 21 07:34:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/date/date_core.c: Typo in Date::MONTHNAMES by Matt Gauger
-	  [GH fixes #261]
-
-Wed Mar 20 22:53:14 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (find_library): fix to format message.
-	  [ruby-core:53568] [Bug #8130]
-
-Wed Mar 20 22:52:52 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (install_dirs, with_destdir): prefix with DESTDIR
-	  directories to install only unless bundled extension libraries.
-	  [ruby-core:53502] [Bug #8115]
-
-Wed Mar 20 17:47:53 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/win32ole/test_err_in_callback.rb (TestErrInCallBack#setup):
-	  allow using different root for source and build directories.
-	  this may fixes a minor problem of r39834.
-
-Wed Mar 20 16:40:48 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/ruby/test_signal.rb (test_hup_me): skip if HUP isn't supported.
-	  On Windows this test causes ArgumentError.
-
-Wed Mar 20 16:24:12 2013  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/rubygems/test_gem_installer.rb (test_install_extension_flat):
-	  use ruby in build directory in case ruby is not installed.
-	  [ruby-core:53265] [Bug #8058]
-
-Wed Mar 20 15:22:07 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/win32ole/test_err_in_callback.rb (TestErrInCallBack#setup): use
-	  relative path to get rid of "too long commandline" error.
-
-Wed Mar 20 04:27:42 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/rinda/test_rinda.rb: remove unused variables.
-	  patched by Vipul A M <vipulnsward@gmail.com>
-
-Wed Mar 20 04:15:32 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/bigdecimal/bigdecimal.c: fixed typo.
-	  patched by Vipul A M <vipulnsward@gmail.com>
-
-Sat Mar 16 03:40:49 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_signal.rb (test_hup_me): added a few comments.
-
-Sat Mar 16 03:39:38 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (ruby_kill): added a few comments.
-
-Sat Mar 16 03:36:56 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (ruby_kill): release GVL while waiting signal delivered.
-
-Tue Mar 19 19:50:48 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ruby_kill (internal.h, thread.c): use rb_pid_t instead of pid_t.
-	  this fixes the build failure of mswin introduced at r39819.
-
-Tue Mar 19 17:09:30 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_conv_enc_opts): convert with one converter, instead
-	  of re-creating converters for each buffer expansion.
-
-Tue Mar 19 17:06:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (glob_helper): compose HFS file names from UTF8-MAC.
-	  [ruby-core:48745] [Bug #7267]
-
-Sat Mar 16 01:44:29 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* internal.h: added a declaration of ruby_kill().
-	* thread.c (ruby_kill): helper function of kill().
-
-	* signal.c (rb_f_kill): use ruby_kill() instead of kill().
-	* signal.c (rb_f_kill): call rb_thread_execute_interrupts()
-	  to ensure that make SignalException if sent a signal
-	  to myself. [Bug #7951] [ruby-core:52864]
-
-	* vm_core.h (typedef struct rb_thread_struct): added
-	  th->interrupt_cond.
-	* thread.c (rb_threadptr_interrupt_common): added to
-	  initialization of th->interrupt_cond.
-	* thread.c (thread_create_core): ditto.
-
-	* test/ruby/test_signal.rb (TestSignal#test_hup_me): test for
-	  the above.
-
-Sat Mar 16 00:42:39 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (linux_iocparm_len): enable only exist _IOC_SIZE().
-	  Because musl libc doesn't have it. [Bug #8051] [ruby-core:53229]
-
-Tue Mar 19 10:05:04 2013  Shota Fukumori  <her@sorah.jp>
-
-	* ext/objspace/objspace.c: Fix typo in doc. Patch by Sho Hashimoto.
-	  [Bug #8116] [ruby-dev:47177]
-
-Tue Mar 19 02:13:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* configure.in: set ac_cv_prog_cxx if CXX is supplied.
-
-Tue Mar 19 01:18:00 2013  Kenta Murata  <mrkn@mrkn.jp>
-
-	* configure.in: Fix c++ compiler auto-selection not only for
-	  Darwin 11.x, but also the other versions of Darwin.
-
-Tue Mar 19 00:26:22 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: Improve accuracy of objspace_live_num() and
-	  allocated/freed counters. patched by tmm1(Aman Gupta).
-	  [Bug #8092] [ruby-core:53392]
-
-Mon Mar 18 21:42:48 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: Avoid unnecessary heap growth. patched by tmm1(Aman Gupta).
-	  [Bug #8093] [ruby-core:53393]
-
-Mon Mar 18 17:58:36 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: Fix unlimited memory growth with large values of
-	  RUBY_FREE_MIN. patched by tmm1(Aman Gupta).
-	  [Bug #8095] [ruby-core:53405]
-
-Mon Mar 18 14:46:19 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/win32ole/test_err_in_callback.rb
-	  (TestErrInCallBack#test_err_in_callback): shouldn't create a file in
-	  the top of build directory.
-
-Mon Mar 18 13:29:52 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_dump.c (backtrace): on darwin use custom backtrace() to trace
-	  beyond _sigtramp. darwin's backtrace can't trace beyond signal
-	  trampoline with sigaltstack.
-
-	* configure.in: check execinfo.h on darwin.
-
-Mon Mar 18 11:03:23 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_exec.h (END_INSN): revert r39517 because the segv seems fixed by
-	  r39806.
-
-Mon Mar 18 10:41:06 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_exec.c: Correct predefined macro name. This typo is introduced by
-	  r36534 and should be backported to ruby_2_0_0.
-
-Mon Mar 18 03:18:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: Typo in Array#delete by Timo Sand [GH fixes #258]
-
-Mon Mar 18 01:14:56 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (io_fillbuf): show fd number on failure to debug.
-	  http://c5632.rubyci.org/~chkbuild/ruby-trunk/log/20130316T050302Z.diff.html.gz
-
-Sun Mar 17 02:38:21 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* ext/date/date_core.c: include sys/time.h for avoiding implicit
-	  declaration of gettimeofday().
-
-Sun Mar 17 00:55:31 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/missing.h: removed __linux__. it's unnecessary.
-
-Fri Mar 15 14:57:16 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c: disabled _FORTIFY_SOURCE for avoid to hit glibc bug.
-	  [Bug #8080] [ruby-core:53349]
-	* test/ruby/test_io.rb (TestIO#test_io_select_with_many_files):
-	  test for the above.
-
-Wed Mar 13 15:16:35 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/missing.h (__syscall): moved to...
-	* io.c: here. because __syscall() is only used from io.c.
-
-	* include/ruby/missing.h: move "#include <sys/type.h>" to ....
-	* include/ruby/intern.h: here. because it was introduced for
-	  fixing NFDBITS issue. [ruby-core:05179].
-
-Wed Mar 13 14:38:53 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/missing.h (struct timespec): include <sys/time.h>
-
-Wed Mar 13 13:54:45 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: check struct timeval exist or not.
-	* include/ruby/missing.h (struct timeval): check HAVE_STRUCT_TIMEVAL
-	  properly. and don't include sys/time.h if struct timeval exist.
-
-	* file.c: include sys/time.h explicitly.
-	* random.c: ditto.
-	* thread_pthread.c: ditto.
-	* time.c: ditto.
-	* ext/date/date_strftime.c: ditto.
-
-Fri Mar 15 14:45:02 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in (_FORTIFY_SOURCE): added a few comments.
-
-Fri Mar 15 14:17:55 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (numberof): renamed from ARRAY_SIZE() because
-	  other all files use numberof().
-
-Say Mar 15 01:33:00 2013  Charles Oliver Nutter <headius@headius.com>
-
-	* test/ruby/test_lazy_enumerator.rb (TestLazyEnumerator#test_drop_while):
-	  Modify while condition to show dropping remains off after first false
-	  value. This change was made in 39711.
-
-Fri Mar 15 23:06:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* time.c (GetTimeval): check if already initialized instance.
-
-	* time.c (GetNewTimeval): check if newly created instance.
-
-	* time.c (time_init_0, time_init_1, time_init_copy, time_mload): must
-	  be newly created instance.  [ruby-core:53436] [Bug #8099]
-
-Fri Mar 15 14:51:33 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (rb_sys_fail_path_with_func): share same function, and path
-	  may be nil.
-
-Fri Mar 15 08:24:51 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_sys_fail_path): define & use rb_sys_fail_path0 like r39752
-
-Fri Mar 15 04:08:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* proc.c: Typo in Proc.arity found by Jack Nagel [Bug #8094]
-
-Thu Mar 14 16:59:09 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (rb_cv_function_name_string): macro for function name
-	  string predefined identifier, __func__ in C99, or __FUNCTION__ in
-	  gcc.
-
-	* file.c (rb_sys_fail_path): use RUBY_FUNCTION_NAME_STRING.
-
-Thu Mar 14 14:12:34 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (rb_sys_fail_path): use rb_sys_fail_path0 only on GCC.
-	  __func__ is C99 feature.
-
-Thu Mar 14 12:59:59 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (rb_sys_fail_path0): add to append the name of called function
-	  to ease debugging for example blow umask_spec failure.
-	  http://fbsd.rubyci.org/~chkbuild/ruby-trunk/log/20130309T010202Z.diff.html.gz
-
-	* file.c (rb_sys_fail_path): use rb_sys_fail_path0.
-
-Thu Mar 14 12:53:15 2013  Luis Lavena  <luislavena@gmail.com>
-
-	* win32/file.c (get_user_from_path):  add internal function that retrieves
-	  username from supplied path (refactored).
-	* win32/file.c (rb_file_expand_path_internal):  refactor expansion of user
-	  home to use get_user_from_path and cover dir_string corner cases.
-	  [ruby-core:53168] [Bug #8034]
-
-Thu Mar 14 11:53:01 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* NEWS: describe RUBY_HEAP_SLOTS_GROWTH_FACTOR.
-
-Thu Mar 14 10:01:12 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/globals.rdoc:  $? is thread-local
-
-Wed Mar 13 23:25:59 2013  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: allow to tune growth of heap by environment variable
-	  RUBY_HEAP_SLOTS_GROWTH_FACTOR. patched by tmm1(Aman Gupta).
-	  [Feature #8015] [ruby-core:53131]
-
-Wed Mar 13 19:43:46 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* doc/irb/irb.rd.ja: fix typo
-
-	* ext/tk/MANUAL_tcltklib.eng: fix typos
-
-	* ext/tk/sample/tktextframe.rb (Tk#component_delegates): fix typo
-
-Wed Mar 13 15:13:04 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (rb_obj_singleton_methods): collect methods from the origin
-	  class.  [ruby-core:53207] [Bug #8044]
-
-Wed Mar 13 14:51:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (rb_export_method): directly override the flag of method
-	  defined in prepending class too, not adding zsuper entry.
-	  [ruby-core:53106] [Bug #8005]
-
-Wed Mar 13 13:06:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (rm, shvar_to_cpp, unexpand_shvar): local is not
-	  available on old shells.
-
-	* configure.in (shvar_to_cpp): escape quotes for old shells.
-	  [Bug #7959] [Bug #8071]
-
-Wed Mar 13 11:11:07 2013  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* object.c (Init_Object): remove Module#used, which has been
-	  introduced in Ruby 2.0 by mistake.  [Bug #7916] [ruby-core:52719]
-
-Wed Mar 13 05:49:29 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/irb.rb:  Fix typo
-
-Tue Mar 12 22:20:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_set_arguments, iseq_compile_each): support required
-	  keyword arguments.   [ruby-core:51454] [Feature #7701]
-
-	* iseq.c (rb_iseq_parameters): ditto.
-
-	* parse.y (f_kw, f_block_kw): ditto.  this syntax is still
-	  experimental, the notation may change.
-
-	* vm_core.h (rb_iseq_struct): ditto.
-
-	* vm_insnhelper.c (vm_callee_setup_keyword_arg): ditto.
-
-Tue Mar 12 17:02:53 2013  TAKANO Mitsuhiro <tak@no32.tk>
-
-	* date_core.c: clearly specify operator precedence.
-
-Tue Mar 12 17:00:45 2013  TAKANO Mitsuhiro <tak@no32.tk>
-
-	* insns.def: fix condition.
-
-Tue Mar 12 16:48:19 2013  TAKANO Mitsuhiro <tak@no32.tk>
-
-	* rational.c: fix dangling if, else-if and else.
-
-Tue Mar 12 06:27:59 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/commands/setup_command.rb:  Don't delete non-rubygems
-	  files when installing RubyGems.
-	* test/rubygems/test_gem_commands_setup_command.rb:  Test for the
-	  above.
-
-	* lib/rubygems/ext/ext_conf_builder.rb:  Use full path to siteconf.rb
-	  in case the extconf.rb changes directories (like memcached does).
-
-	* lib/rubygems/package.rb:  Remove double slash from path.
-	* test/rubygems/test_gem_package.rb:  Test for the above.
-	* test/rubygems/test_gem_package_old.rb:  ditto.
-
-	* lib/rubygems/source.rb:  Revert automatic HTTPS upgrade
-	* lib/rubygems/spec_fetcher.rb:  ditto.
-	* test/rubygems/test_gem_remote_fetcher.rb:  ditto.
-	* test/rubygems/test_gem_source.rb:  ditto.
-	* test/rubygems/test_gem_spec_fetcher.rb:  ditto.
-
-Tue Mar 12 02:25:19 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/smtp.rb:  Added Net::SMTP#rset method to implement the SMTP
-	  RSET command.  [ruby-trunk - Feature #5373]
-	* NEWS:  ditto.
-	* test/net/smtp/test_smtp.rb:  Test for the above.
-
-Mon Mar 11 22:44:57 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv-replace.rb (TCPSocket#initialize): resolve the 3rd
-	  argument only if non-nil value is given.
-	  [ruby-dev:47150] [ruby-trunk - Bug #8054] reported and analyzed by
-	  mrkn.
-
-Mon Mar 11 19:22:54 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/mkmf/base.rb: class name conflict.
-
-Mon Mar 11 18:45:09 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enumerator.c (enumerator_with_index): try to convert given offset to
-	  integer. fix bug introduced in r39594.
-
-Mon Mar 11 17:27:57 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/ruby/envutil.rb (EnvUtil.with_default_external): add for
-	  changing Encoding.default_external without warnings.
-
-	* test/ruby/envutil.rb (EnvUtil.with_default_internal): ditto.
-
-	* test/ruby/test_io_m17n.rb: use above with_default_external.
-
-Mon Mar 11 16:57:00 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (extract_binmode): raise error even if binmode and textmode
-	  don't conflict. [Bug #5918] [ruby-core:42199]
-
-Mon Mar 11 12:25:12 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* Merge Onigmo d4bad41e16e3eccd97ccce6f1f96712e557c4518.
-	  fix lookbehind assertion fails with /m mode enabled. [Bug #8023]
-	  fix \Z matches where it shouldn't. [Bug #8001]
-
-Mon Mar 11 11:53:35 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#dir_config, MakeMakefile#_libdir_basename):
-	  defer use of instance variable until needed.  [Bug #8074]
-
-Thu Mar  7 10:42:28 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* lib/thread.rb (Queue#clear): return self.
-	  Patch by Cubing Cube. Thank you! [Bug #7947] [ruby-dev:47098]
-	* lib/thread.rb (Queue#push): ditto.
-	* lib/thread.rb (SizedQueue#push): ditto.
-	* test/thread/test_queue.rb: add tests for the above.
-
-Thu Mar  7 10:40:49 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* tool/change_maker.rb (#diff2index): check Encoding::BINARY.
-	  BASERUBY may still be 1.8.x.
-
-Thu Mar  7 08:47:42 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* NEWS (Mutex#owned?): no longer experimental.
-
-Sun Mar 10 23:38:15 2013  Luis Lavena  <luislavena@gmail.com>
-
-	* win32/file.c (rb_file_expand_path_internal):  Expand home directory when
-	  used as second parameter (dir_string).  [ruby-core:53168] [Bug #8034]
-	* test/ruby/test_file_exhaustive.rb: add test to verify.
-
-Sun Mar 10 23:27:05 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rubygems/ext/ext_conf_builder.rb (Gem::Ext::ExtConfBuilder.build):
-	  it is impossible to predict which file will be installed to where,
-	  by the arguments, so use intermediate destination directory always.
-	  [Bug #7698]
-
-Sun Mar 10 17:00:22 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* complex.c: edited rdoc.
-	* rational.c: ditto.
-
-Sun Mar 10 15:02:39 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* process.c (setup_communication_pipe): remove unused function.
-	  it was unintentionally added r39683.
-
-Wed Mar  6 00:30:40 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* tool/gen_ruby_tapset.rb: add tapset generator.
-
-Wed Mar  6 03:27:43 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* probes.d (symbol-create): change argument name `string' to
-	  `str'. `string' is a keyword for systemtap.
-
-Tue Mar  5 22:23:01 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* probes.d: added argument name
-
-Thu Mar  7 01:17:00 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/thread/test_queue.rb (TestQueue#test_thr_kill): reduce
-	  iterations from 2000 to 250. When running on uniprocessor
-	  systems, every th.kill needs TIME_QUANTUM_USEC time (i.e.
-	  100msec on posix systems). Because, "r.read 1" is 3 steps
-	  operations that 1) release GVL 2) read 3) acquire gvl and
-	  (1) invoke context switch to main thread. and then, main
-	  thread's th.kill resume (1), but not (2). Thus read interrupt
-	  need TIME_QUANTUM_USEC. Then maximum iteration is 30sec/100msec
-	  = 300.
-
-Thu Mar  7 00:14:51 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (rb_update_max_fd): use ATOMIC_CAS because this function
-	  is used from timer thread too.
-
-Wed Mar  6 23:30:21 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (ARRAY_SIZE): new.
-	* thread_pthread.c (gvl_acquire_common): use low priority
-	  notification for avoiding timer thread interval confusion.
-	  If we use timer_thread_pipe[1], every gvl_yield() request
-	  one more gvl_yield(). It lead to thread starvation.
-	  [Bug #7999] [ruby-core:53095]
-	* thread_pthread.c (rb_reserved_fd_p): adds timer_thread_pipe_low
-	  to reserved fds.
-
-Wed Mar  6 22:36:19 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (rb_thread_wakeup_timer_thread_fd): add fd
-	  argument and remove hardcoded dependency of timer_thread_pipe[1].
-	* thread_pthread.c (consume_communication_pipe): add fd argument.
-	* thread_pthread.c (close_communication_pipe): ditto.
-
-	* thread_pthread.c (timer_thread_sleep): adjust the above changes.
-
-	* thread_pthread.c (setup_communication_pipe_internal): factor
-	  out pipe initialize logic.
-
-Wed Mar  6 22:56:14 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (ubf_select): add to small comments why we
-	  need to call rb_thread_wakeup_timer_thread().
-
-Wed Mar  6 21:42:24 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (rb_thread_create_timer_thread): factor out
-	  creating communication pipe logic into separate function.
-	* thread_pthread.c (setup_communication_pipe): new helper function.
-	* thread_pthread.c (set_nonblock): moves a definition before
-	  setup_communication_pipe.
-
-Sun Mar  3 02:42:29 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (consume_communication_pipe): retry when
-	  read returned CCP_READ_BUFF_SIZE.
-
-Wed Mar  6 21:31:35 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (timer_thread_sleep): use poll() instead of
-	  select(). select doesn't work if timer_thread_pipe[0] is
-	  greater than FD_SETSIZE.
-	* thread_pthread.c (USE_SLEEPY_TIMER_THREAD): add a dependency
-	  against poll.
-
-Wed Mar  6 21:00:23 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (USE_SLEEPY_TIMER_THREAD): use more accurate
-	  ifdef conditions.
-
-Sun Mar  3 02:30:36 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (set_nonblock): new helper function for set
-	  O_NONBLOCK.
-	* thread_pthread.c (rb_thread_create_timer_thread): set O_NONBLOCK
-	  to timer_thread_pipe[0] too.
-
-Sun Mar 10 09:12:51 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* complex.c: described syntax of string form.
-	* rational.c: ditto.
-
-Sat Mar  9 11:58:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (w_extended): check for prepended object.
-	  [ruby-core:53206] [Bug #8043]
-
-Sat Mar  9 08:36:58 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (features_index_add_single, rb_feature_p): store single index
-	  as Fixnum to reduce the number of arrays for the indexes.  based on
-	  the patch by tmm1 (Aman Gupta) in [ruby-core:53216] [Bug #8048].
-
-Sat Mar  9 00:25:57 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (r_object0): load prepended objects.  treat the class of
-	  extended object in the included modules as prepended singleton
-	  class. [ruby-core:53202] [Bug #8041]
-
-Fri Mar  8 19:44:00 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* man/rake.1, man/ruby.1: Use the Pa macro to make URLs stand out.
-
-Fri Mar  8 13:20:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/pathname/pathname.c (path_f_pathname): rdoc for Pathname()
-
-Fri Mar  8 12:00:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* man/rake.1: Document ENVIRONMENT variables on RAKE(1) manpage
-
-Fri Mar  8 10:44:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/webrick/httpproxy.rb: Fix typos in HTTPProxyServer [Bug #8013]
-	  Patch by Nobuhiro IMAI [ruby-core:53127]
-
-Fri Mar  8 03:16:15 2013  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* class.c (rb_mod_ancestors): Include singleton_class in ancestors
-	  list [Feature #8035]
-
-	* test/ruby/test_module.rb (class): test for above
-
-	* test/ruby/marshaltestlib.rb (module): adapt test
-
-	* NEWS: list change
-
-Thu Mar  7 14:21:37 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_compile_each): pass keyword arguments to zsuper,
-	  with current values.  [ruby-core:53114] [Bug #8008]
-
-Thu Mar  7 12:53:47 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/commands/setup_command.rb:  Install .pem files.
-	* test/rubygems/test_gem_commands_setup_command.rb:  Test for the
-	  above.
-
-	* lib/rubygems/spec_fetcher.rb:  Test HTTPS upgrade with URI::HTTPS,
-	  not URI::HTTP.  Fixes bug in automatic HTTPS upgrade.
-	* test/rubygems/test_gem_spec_fetcher.rb:  Test for the above.
-
-	* lib/rubygems.rb:  Version 2.0.2
-
-	* lib/rubygems/test_utilities.rb:  Ensure scheme and uri class match.
-
-Thu Mar  7 10:39:04 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/rbinstall.rb (gem): Gem.ensure_gem_subdirectories now has mode
-	  option since r39607.  refix of r38870.
-
-Wed Mar  6 13:14:28 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rubygems/test_gem_spec_fetcher.rb:  Removed unused variable.
-
-Wed Mar  6 08:10:15 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rubygems/test_require.rb:  Fix tests when 'a.rb' exists.
-	  [ruby-trunk - Bug #7749]
-
-Wed Mar  6 08:00:59 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems.rb:  Allow specification of directory permissions.
-	  [ruby-trunk - Bug #7713]
-	* test/rubygems/test_gem.rb:  Test for the above.
-
-Wed Mar  6 07:40:21 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/commands/query_command.rb:  Only fetch remote specs when
-	  showing details.  [ruby-trunk - Bug #8019]  RubyGems bug #487
-	* lib/rubygems/remote_fetcher.rb:  ditto.
-	* lib/rubygems/security/policy.rb:  ditto.
-	* test/rubygems/test_gem_commands_query_command.rb:  Test for the
-	  above.
-
-	* lib/rubygems/security.rb:  Make OpenSSL optional for RubyGems.
-	* lib/rubygems/commands/cert_command.rb:  ditto.
-
-	* lib/rubygems/config_file.rb:  Display file with YAML error, not
-	  ~/.gemrc
-
-	* lib/rubygems/remote_fetcher.rb:  Only create gem subdirectories when
-	  installing gems.
-	* lib/rubygems/dependency_resolver.rb:  ditto.
-	* lib/rubygems/test_utilities.rb:  ditto.
-	* test/rubygems/test_gem_commands_fetch_command.rb:  Test for the
-	  above.
-
-	* lib/rubygems/spec_fetcher.rb:  Only try to upgrade
-	  http://rubygems.org to HTTPS
-	* test/rubygems/test_gem_spec_fetcher.rb:  Test for the above.
-
-	* lib/rubygems.rb:  Update win_platform? check for JRuby compatibility.
-
-	* test/rubygems/test_gem_installer.rb:  Update for Ruby 1.9.2
-	  compatibility
-
-Wed Mar  6 01:19:28 2013  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* enumerator.c (enumerator_with_index, lazy_take): use INT2FIX(0)
-	  instead of INT2NUM(0).
-
-	* ext/bigdecimal/bigdecimal.c (BigMath_s_exp): ditto.
-
-	* ext/fiddle/function.c (function_call): ditto.
-
-	* ext/openssl/ossl_x509store.c (ossl_x509store_initialize): ditto.
-
-	* process.c (proc_getsid): ditto.
-
-	* transcode.c (econv_finish): ditto.
-
-Tue Mar  5 21:36:43 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (rb_prepend_module): check redefinition of built-in optimized
-	  methods.  [ruby-dev:47124] [Bug #7983]
-
-	* vm.c (rb_vm_check_redefinition_by_prepend): ditto.
-
-Tue Mar  5 20:29:25 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (mnew): revert r39224.  [ruby-core:53038] [Bug #7988]
-
-Tue Mar  5 20:23:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/intern.h (rb_check_arity): make a static inline
-	  function so it can be used as an expression and argc would be
-	  evaluated only once.
-
-Tue Mar  5 12:30:55 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems.rb:  Bump version to 2.0.1 for upcoming bugfix release
-
-	* lib/rubygems/ext/ext_conf_builder.rb:  Restore ruby 1.8 compatibility
-	  for [Bug #7698]
-	* test/rubygems/test_gem_installer.rb:  Ditto.
-
-	* lib/rubygems/package.rb:  Restore ruby 1.8 compatibility.
-
-	* test/rubygems/test_gem_dependency_installer.rb:  Fix warnings
-
-Tue Mar  5 12:24:23 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* enumerator.c (enumerator_with_index):  Restore handling of a nil memo
-	  from r39594.
-
-Tue Mar  5 10:40:22 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/objspace/objspace.c (count_nodes): count also newly added nodes,
-	  and fix key for unknown node.  patch by tmm1 (Aman Gupta) in
-	  [ruby-core:53130] [Bug #8014]
-
-Tue Mar  5 10:20:16 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (enumerator_with_index_i): allow Bignum as offset, to
-	  get rid of conversion exception and integer overflow.
-	  [ruby-dev:47131] [Bug #8010]
-
-	* numeric.c (rb_int_succ, rb_int_pred): shortcut optimization for
-	  Bignum.
-
-Tue Mar  5 10:02:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rubygems/ext/ext_conf_builder.rb (Gem::Ext::ExtConfBuilder.build):
-	  clear DESTDIR so RUBYARCHDIR and RUBYLIBDIR are not be overridden.
-	  [Bug #7698]
-
-Mon Mar  4 15:33:40 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rubygems/ext/ext_conf_builder.rb (Gem::Ext::ExtConfBuilder.build):
-	  fix for unusual cases again.  install to a temporary directory once
-	  and move installed files to the destination directory, if it is same
-	  as the current directory.  [Bug #7698]
-
-Mon Mar  4 14:13:36 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* Makefile.in (miniruby, ruby): move MAINLIBC because linker arguments
-	  must appear after object files with newer versions of gcc.  patch by
-	  tmm1 (Aman Gupta) in [ruby-core:53121] [Bug #8009]
-
-Mon Mar  4 10:23:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* encoding.c: Typo in Encoding overview by Tom Wardrop [GH fixes #255]
-
-Sun Mar  3 12:35:08 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#libpath_env): set runtime library path for
-	  the case rpath is disabled.
-
-Sun Mar  3 12:17:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rubygems/ext/ext_conf_builder.rb
-	  (Gem::Ext::ExtConfBuilder.hack_for_obsolete_style_gems): remove
-	  circular dependencies in install-so too.  [ruby-core:52882]
-	  [Bug #7698]
-
-Sun Mar  3 07:33:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/socket/tcpserver.c: Grammar for TCPServer.new from r39554
-
-Sun Mar  3 01:17:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/rubygems/ext/ext_conf_builder.rb
-	  (Gem::Ext::ExtConfBuilder.hack_for_obsolete_style_gems): remove
-	  circular dependencies for old style gems which locate extconf.rb on
-	  the toplevel.  [ruby-core:53059] [ruby-trunk - Bug #7698]
-
-	* lib/rubygems/ext/ext_conf_builder.rb (Gem::Ext::ExtConfBuilder.build):
-	  use RUBYOPT instead of -r option, and revert some tests.  [Bug #7698]
-
-	* lib/rubygems/ext/ext_conf_builder.rb (Gem::Ext::ExtConfBuilder.build):
-	  revert use of temporary directory for build, to work some buggy
-	  extconf.rb which cannot build outside the source directory.
-	  [ruby-core:53056] [Bug #7698]
-
-Sun Mar  3 00:04:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enc/depend (CPPFLAGS), lib/mkmf.rb (MakeMakefile#create_makefile):
-	  define RUBY_EXPORT for static-linked-ext mswin.  [Bug #7960]
-
-Sat Mar  2 22:49:47 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/Makefile.sub (ENCOBJS, EXTOBJS, config.h): definitions for
-	  static-linked-ext.  [Bug #7960]
-
-Sat Mar  2 17:34:19 2013  Tanaka Akira  <akr@fsij.org>
-
-	* lib/webrick/utils.rb: use Socket.tcp_server_sockets to create server
-	  sockets.
-	  fix [Bug #7100] https://bugs.ruby-lang.org/issues/7100
-	  reported by sho-h (Sho Hashimoto).
-
-Sat Mar  2 02:45:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: typo in comment patch by Nami-Doc [Github fixes #253]
-
-Sat Mar  2 01:33:17 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* Merge Onigmo 0fe387da2fee089254f6b04990541c731a26757f
-	  v5.13.3 [Bug#7972] [Bug#7974]
-
-Fri Mar  1 11:09:06 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/fileutils.rb:  Revert r34669 which altered the way
-	  metaprogramming in FileUtils occurred.  [ruby-trunk - Bug #7958]
-
-	* test/fileutils/visibility_tests.rb:  Refactored tests of FileUtils
-	  options modules to expose bug found in #7958
-	* test/fileutils/test_dryrun.rb:  ditto.
-	* test/fileutils/test_nowrite.rb:  ditto.
-	* test/fileutils/test_verbose.rb:  ditto.
-
-Fri Mar  1 09:18:00 2013  Zachary Scott <zachary@zacharyscott.net>
-
-	* lib/psych.rb: specify in rdoc what object is returned in parser
-	  By Adam Stankiewicz [Github tenderlove/psych#133]
-
-Fri Mar  1 07:21:41 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/ext/builder.rb:  Fix incompatibilities when installing
-	  extensions.  Patch by Nobu.
-	  [ruby-trunk - Bug #7698] [ruby-trunk - Bug #7971]
-	* lib/rubygems/ext/ext_conf_builder.rb:  ditto.
-	* lib/rubygems/installer.rb:  ditto.
-	* test/rubygems/test_gem_ext_ext_conf_builder.rb:  Test for the above.
-	* test/rubygems/test_gem_installer.rb:  ditto.
-
-	* lib/rubygems/commands/sources_command.rb:  Prefer HTTPS over HTTP.
-	* lib/rubygems/defaults.rb:  ditto
-	* lib/rubygems/dependency_resolver.rb:  Ditto.
-	* lib/rubygems/source.rb:  ditto.
-	* lib/rubygems/spec_fetcher.rb:  ditto.
-	* lib/rubygems/specification.rb:  ditto.
-	* lib/rubygems/test_utilities.rb:  ditto.
-	* test/rubygems/test_gem.rb:  Test for the above.
-	* test/rubygems/test_gem_commands_sources_command.rb:  ditto.
-	* test/rubygems/test_gem_dependency_resolver_api_set.rb:  ditto.
-	* test/rubygems/test_gem_remote_fetcher.rb:  ditto.
-	* test/rubygems/test_gem_source.rb:  ditto.
-	* test/rubygems/test_gem_spec_fetcher.rb:  ditto.
-
-Fri Mar 1 03:25:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/psych/lib/psych.rb: rdoc for Psych overview by Adam Stankiewicz
-	  [Github tenderlove/psych#134]
-
-Thu Feb 28 22:57:48 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* compile.c (iseq_compile_each): remove redundant trace(line)
-	  instruction. for example, at the following script
-	    def m()
-	      p:xyzzy
-	      1
-	      2
-	    end
-	  compiler ignores `1' because there is no effect. However,
-	  `trace(line)' instruction remains in bytecode.
-	  This modification removes such redundant trace(line) instruction.
-
-	* test/ruby/test_iseq.rb: add a test.
-
-Thu Feb 28 22:23:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/raddrinfo.c (inspect_sockaddr): don't show that Unix
-	  domain socket filename is bigger than sizeof(sun_path).
-	  This limit is not rigid on some platforms such as Darwin and SunOS.
-
-Thu Feb 28 21:33:01 2013  WATANABE Hirofumi  <eban@ruby-lang.org>
-
-	* configure.in(AC_DISABLE_OPTION_CHECKING): avoid warning "WARNING:
-	  Unrecognized options: --with-PACKAGE".
-
-Thu Feb 28 20:22:04 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* iseq.c (iseq_data_to_ary): fix condition.
-	  r34303 introduces a bug to avoid all line information from
-	  a result of ISeq#to_a. This is a regression problem from 2.0.0p0.
-
-	* test/ruby/test_iseq.rb: add a test of lines after ISeq#to_a.
-
-Thu Feb 28 08:20:33 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/available_set.rb:  Undent for style
-
-	* lib/rubygems/dependency_installer.rb:  Pick latest prerelease gem to
-	  install.  Fixes RubyGems bug #468.
-	* test/rubygems/test_gem_dependency_installer.rb:  Test for the above.
-
-	* lib/rubygems/dependency_installer.rb:  Don't display "Done installing
-	  documentation" if documentation will not be installed.
-	* lib/rubygems/rdoc.rb:  ditto
-
-	* lib/rubygems/dependency_list.rb:  Use Array#concat for Ruby 1.x
-	  performance.
-
-	* lib/rubygems/installer.rb:  Use formatted program name when comparing
-	  executables.  RubyGems pull request #471
-	* test/rubygems/test_gem_installer.rb:  Test for the above.
-
-	* lib/rubygems/package.rb:  Use more explicit feature check to work
-	  around JRuby bug #552
-
-	* lib/rubygems/ssl_certs/GeoTrust_Global_CA.pem:  Added GeoTrust root
-	  certificate.
-
-	* test/rubygems/test_gem_source_list.rb:  Use "example" instead of real
-	  hostname
-
-Thu Feb 28 05:57:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: rdoc formatting for Thread, ThreadGroup, and ThreadError
-
-Thu Feb 28 02:42:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm.c: Typo in overview for example of Thread#status returning false
-	  Reported by Lee Jarvis
-
-Wed Feb 27 22:54:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (union_sockaddr): make it longer for SunOS
-	  and Darwin.
-
-Wed Feb 27 21:14:34 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/security.rb (REXML::Security): create.
-	* lib/rexml/rexml.rb: move entity_expansion_limit and
-	  entity_expansion_text_limit accessors to ...
-	* lib/rexml/security.rb: ... here.
-	* lib/rexml/document.rb: use REXML::Security.
-	* lib/rexml/text.rb: use REXML::Security.
-	* test/rexml/test_document.rb: use REXML::Security.
-
-Wed Feb 27 19:53:32 2013  Benoit Daloze  <eregontp@gmail.com>
-
-	* vm.c (Thread): fix typos in overview
-
-Wed Feb 27 13:21:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm.c (Thread): Typo in overview, swap setting and getting
-
-Wed Feb 27 13:02:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm.c (Thread): Documentation overview of Thread class
-
-Wed Feb 27 12:57:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c (rb_thread_wakeup): rdoc formatting
-
-Wed Feb 27 12:53:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c (rb_thread_group): rdoc formatting
-
-Wed Feb 27 12:33:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/ostruct.rb: Typo in OpenStruct overview [Github Fixes #251]
-	  Patch by Chun-wei Kuo
-
-Wed Feb 27 12:13:32 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_exec.h (END_INSN): llvm-gcc may optimize out reg_cfp and cause
-	  Stack/cfp consistency error when the instruction doesn't use reg_cfp.
-	  Usually instructions use PUSH() but for example trace doesn't.
-	  This hack cause speed down but you shouldn't use llvm-gcc, use clang.
-	  [Bug #7938]
-
-Wed Feb 27 10:23:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c (thread_raise_m): rdoc formatting
-
-Tue Feb 26 23:32:44 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/document.rb: move entity_expansion_limit accessor to ...
-	* lib/rexml/rexml.rb: ... here for consistency.
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_limit):
-	  deprecated.
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_limit=):
-	  deprecated.
-
-Tue Feb 26 23:26:13 2013  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/document.rb: move entity_expansion_text_limit accessor to ...
-	* lib/rexml/rexml.rb: ... here to make rexml/text independent from
-	  REXML::Document. It causes circular require.
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_text_limit):
-	  deprecated.
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_text_limit=):
-	  deprecated.
-	* lib/rexml/text.rb: add missing require "rexml/rexml" for
-	  REXML.entity_expansion_text_limit.
-	  Reported by Robert Ulejczyk. Thanks!!! [ruby-core:52895] [Bug #7961]
-
-Tue Feb 26 15:12:11 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/mkconfig.rb: reconstruct comma separated list values.  a
-	  command line to Windows batch file is split not only by spaces
-	  and equal signs but also by commas and semicolons.
-
-Tue Feb 26 15:04:19 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (unexpand_shvar): get rid of non-portable shell
-	  behavior on OpenBSD, so no extra quotes.  [Bug #7959]
-
-Tue Feb 26 10:24:49 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (IS_LABEL_POSSIBLE): allow labels for keyword arguments just
-	  after method definition without a parenthesis.  [ruby-core:52820]
-	  [Bug #7942]
-
-Tue Feb 26 04:50:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* error.c: clarify reason for sleep in SignalException example
-
-Tue Feb 26 03:47:00 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* error.c: clarify a document of SignalException. Process.kill()
-	  doesn't have any guarantee when signal will be delivered.
-	  [Bug #7951] [ruby-core:52864]
-
-Mon Feb 25 23:51:04 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/version.h: bump RUBY_API_VERSION same as RUBY_VERSION.
-
-Mon Feb 25 21:03:34 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (str_byte_substr): don't set coderange if it's not known.
-	  [Bug #7954] [ruby-dev:47108]
-
-Mon Feb 25 16:47:02 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* common.mk (realclean-local): miniprelude.c is made by srcs, so it
-	  should not removed by distclean but by realclean.  [Bug #6807]
-
-Mon Feb 25 16:30:30 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/config_file.rb:  Lazily load .gem/credentials to only
-	  check permissions when necessary.  RubyGems bug #465
-	* test/rubygems/test_gem_config_file.rb:  Test for the above.
-
-	* test/rubygems/test_gem_commands_push_command.rb:  Remove duplicated
-	  test.
-
-Mon Feb 25 15:47:18 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enc/depend (ARFLAGS): VisualC++ linker does not allow spaces between
-	  output option and the output file name.  [Bug #7950]
-
-	* enc/depend (RANLIB): set default command to do nothing, or make the
-	  entire line a label on Windows.
-
-Mon Feb 25 14:41:07 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#init_mkmf): default libdirname to libdir.
-
-	* tool/rbinstall.rb: ditto.
-
-Mon Feb 25 13:12:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (setup): find Setup file from target_os 1. by
-	  suffix (e.g. Setup.nacl, Setup.atheos), 2. by "platform"
-	  option (e.g. Setup.nt, Setup.emx), and 3. default Setup.  And
-	  Setup.dj had been removed.
-
-Mon Feb 25 12:48:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: Document Thread::new, clean up ::fork and mention calling
-	  super if subclassing Thread
-
-Mon Feb 25 12:38:50 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: don't test ss_family and ss_len member of
-	  struct sockaddr_storage.  They are not used now except SunOS
-	  specific code.
-
-Mon Feb 25 11:03:38 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* configure.in (unexpand_shvar): Use the numeric comparison
-	  operator instead of '==' which is a ksh extension. [Bug #7941]
-
-Mon Feb 25 02:37:56 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket: define and use union_sockaddr instead of struct
-	  sockaddr_storage for less casts.
-
-	* ext/socket/rubysocket.h (union_sockaddr): defined.
-
-	* ext/socket/socket.c (sock_accept): use union_sockaddr.
-	  (sock_accept_nonblock): ditto.
-	  (sock_sysaccept): ditto.
-	  (sock_s_getnameinfo): ditto.
-
-	* ext/socket/basicsocket.c (bsock_getsockname): ditto.
-	  (bsock_getpeername): ditto.
-	  (bsock_local_address): ditto.
-	  (bsock_remote_address): ditto.
-
-	* ext/socket/ancdata.c (bsock_recvmsg_internal): ditto.
-
-	* ext/socket/init.c (recvfrom_arg): ditto.
-	  (recvfrom_blocking): ditto.
-	  (rsock_s_recvfrom): ditto.
-	  (rsock_s_recvfrom_nonblock): ditto.
-	  (rsock_getfamily): ditto.
-
-	* ext/socket/raddrinfo.c (rb_addrinfo_t): ditto.
-	  (ai_get_afamily): ditto.
-	  (inspect_sockaddr): ditto.
-	  (addrinfo_mdump): ditto.
-	  (addrinfo_mload): ditto.
-	  (addrinfo_getnameinfo): ditto.
-	  (addrinfo_ip_port): ditto.
-	  (extract_in_addr): ditto.
-	  (addrinfo_ipv6_to_ipv4): ditto.
-	  (addrinfo_unix_path): ditto.
-
-	* ext/socket/tcpserver.c (tcp_accept): ditto.
-	  (tcp_accept_nonblock): ditto.
-	  (tcp_sysaccept): ditto.
-
-	* ext/socket/ipsocket.c (ip_addr): ditto.
-	  (ip_peeraddr): ditto.
-	  (ip_s_getaddress): ditto.
-
-Sun Feb 24 21:15:05 2013  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: [ruby-core:52303]
-
-Sun Feb 24 15:33:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* random.c (rb_random_ulong_limited): limit is inclusive, but generic
-	  rand method should return a number less than it, so increase for the
-	  difference.  [ruby-core:52779] [Bug #7935]
-
-Sun Feb 24 15:32:36 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* random.c (rb_random_ulong_limited): limit is inclusive, but generic
-	  rand method should return a number less than it, so increase for the
-	  difference.  [ruby-core:52779] [Bug #7935]
-
-Sun Feb 24 15:14:43 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb:  Removed duplicate Accept-Encoding in Net::HTTP#get.
-	  [ruby-trunk - Bug #7924]
-	* test/net/http/test_http.rb:  Test for the above.
-
-Wed Feb 20 14:28:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: Document ThreadGroup::Default
-
-Wed Feb 20 14:23:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: Grammar for #backtrace_locations and ::handle_interrupt
-
-Sun Feb 24 13:35:57 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_call_method): block level control frame does not
-	  have method entry, so obtain the method entry from method top-level
-	  control frame to be compared with refined method entry.
-	  [ruby-core:52750] [Bug #7925]
-
-Wed Feb 20 13:23:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c: Document methods receiving string and convert to symbol
-	  Patch by Stefan Rusterholz
-	* vm_eval.c: ditto
-	* vm_method.c: ditto
-
-Wed Feb 20 07:20:56 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (sigsegv): suppress unused result warning. Because
-	  write(2) is marked __warn_unused_result__ on Linux glibc.
-
-Sun Feb 24 07:50:53 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_set_arguments): no keyword check if any keyword rest
-	  argument exists, even unnamed.  [ruby-core:52744] [Bug #7922]
-
-Sat Feb 23 16:51:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: Documentation for Thread#backtrace_locations
-
-Sat Feb 23 16:05:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm.c: Typo in ObjectSpace::WeakMap overview
-
-Sat Feb 23 16:00:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* thread.c: Improved rdoc for ::handle_interrupt, ::pending_interrupt?
-	  and #pending_interrupt?
-
-Sat Feb 23 12:26:43 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/ruby-electric.el (ruby-electric-curlies)
-	  (ruby-electric-matching-char, ruby-electric-bar): Avoid electric
-	  insertion when there is a prefix argument.
-
-	* misc/ruby-electric.el (ruby-electric-insert)
-	  (ruby-electric-cua-replace-region-p)
-	  (ruby-electric-cua-replace-region): Avoid electric insertion and
-	  fall back when cua-mode is enabled and a region is active.
-
-Sat Feb 23 12:35:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c: Document #<=> return values and formatting
-	* bignum.c: ditto
-	* file.c: ditto
-	* object.c: ditto
-	* numeric.c: ditto
-	* rational.c: ditto
-	* string.c: ditto
-	* time.c: ditto
-
-Sat Feb 23 10:50:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* array.c (rb_ary_diff, rb_ary_and, rb_ary_or): Document return order
-	  [RubySpec #7803]
-
-Sat Feb 23 10:17:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c (rb_obj_comp): Documenting Object#<=> return values
-	  Patch by Stefan Rusterholz
-
-Sat Feb 23 09:48:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (file_s_fnmatch, fnmatch_brace): encoding-incompatible pattern
-	  and string do not match, instead of exception.  [ruby-dev:47069]
-	  [Bug #7911]
-
-Sat Feb 23 08:57:46 2013  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* doc/NEWS-*: Update NEWS from their respective branches
-
-Sat Feb 23 08:14:43 2013  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* NEWS: many additions for Ruby 2.0.0
-
-	* object.c: Add doc for Module.prepended
-
-Sat Feb 23 07:52:53 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* template/ruby.pc.in: reorder library flags which may refer library
-	  names.  [Bug #7913]
-
-Fri Feb 22 23:46:20 2013  CHIKANAGA Tomoyuki  <nagachika@ruby-lang.org>
-
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_text_limit):
-	  fix a typo in comment in r39384.
-
-Fri Feb 22 18:31:46 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/rexml/document.rb (REXML::Document.entity_expansion_text_limit):
-	  new attribute to read/write entity expansion text limit.  the default
-	  limit is 10Kb.
-
-	* lib/rexml/text.rb (REXML::Text.unnormalize): check above attribute.
-
-Fri Feb 22 17:36:23 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/test_rbconfig.rb (TestRbConfig): fix r39372.
-	  It must see RbConfig::CONFIG instead of CONFIG.
-
-Fri Feb 22 14:55:41 2013  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* signal.c (ruby_abort): fix typo in r39354 [Bug #5014]
-
-Fri Feb 22 12:46:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* random.c (rb_random_ulong_limited): fix error message for negative
-	  value.  [ruby-dev:47061] [Bug #7903]
-
-Fri Feb 22 11:36:45 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/test_rbconfig.rb (TestRbConfig): skip user defined values by
-	  configuration options.  [Bug #7902]
-
-Fri Feb 22 11:33:42 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#init_mkmf): adjust default library path
-	  for multiarch.  [Bug #7874]
-
-Fri Feb 22 11:10:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* enum.c (Enumerable#chunk: Improved examples, grammar, and formatting
-	  Patch by Dan Bernier and Rich Bruchal of newhaven.rb
-	  [Github documenting-ruby/ruby#8]
-
-Fri Feb 22 11:00:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* numeric.c: Examples and formatting for Numeric and Float
-	  Based on a patch by Zach Morek and Oren K of newhaven.rb
-	  [Github documenting-ruby/ruby#5]
-
-Fri Feb 22 07:04:41 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/installer.rb (build_extensions):  Create extension
-	  install destination before building extension.  Patch by Kenta Murata.
-	  [ruby-trunk - Bug #7897]
-	* test/rubygems/test_gem_installer.rb:  Test for the above.
-
-Fri Feb 22 06:30:57 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/globals.rdoc:  Document what setting $DEBUG does.
-
-	* doc/globals.rdoc:  Added pointer to $-d for full documentation.
-
-Fri Feb 22 06:27:07 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/globals.rdoc:  Document what setting $VERBOSE does.  [Bug #7899]
-
-	* doc/globals.rdoc:  Added pointer to $-w and $-v for full
-	  documentation.
-
-Fri Feb 22 02:33:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/abbrev.rb: Add words parameter to Abbrev::abbrev
-	  Patch by Devin Weaver [Github documenting-ruby/ruby#7]
-
-Thu Feb 21 17:28:14 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/merger.rb: add interaction when only ChangeLog is modified.
-
-Thu Feb 21 16:34:46 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* signal.c (check_stack_overflow): extract duplicated code and get rid
-	  of declaration-after-statement.  [Bug #5014]
-
-Thu Feb 21 14:14:13 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (sigsegv): avoid to use async signal unsafe functions
-	  when nested sigsegv is happen.
-	  [Bug #5014] [ruby-dev:44082]
-
-Thu Feb 21 13:47:59 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* file.c (rb_group_member): added an error check. SUS says,
-	  getgroups(small_value) may return EINVAL.
-
-Thu Feb 21 13:37:07 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* process.c (RB_MAX_GROUPS): moved to
-	* internal.h (RB_MAX_GROUPS): here.
-
-	* file.c (rb_group_member): use RB_MAX_GROUPS instead of
-	  RUBY_GROUP_MAX. They are the same.
-
-Thu Feb 21 13:15:40 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* file.c (access_internal): removed.
-	* file.c (rb_file_readable_real): use access() instead of
-	  access_internal().
-	* file.c (rb_file_writable_real): ditto.
-	* file.c (rb_file_executable_real): ditto.
-
-Thu Feb 21 13:04:59 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* file.c (eaccess): use access() when not using setuid nor setgid.
-	  This is minor optimization.
-
-Thu Feb 21 12:56:19 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* file.c (rb_group_member): get rid of NGROUPS dependency.
-	  [Bug #7886] [ruby-core:52537]
-
-Thu Feb 21 12:45:03 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ruby.c (ruby_init_loadpath_safe): try two levels upper for stripping
-	  libdir name.  [Bug #7874]
-
-	* configure.in (libdir_basename): expand with multiarch in configure,
-	  not to defer the expansion till ruby.pc.in and mkmf.rb.  [Bug #7874]
-
-	* configure.in (libdir_basename): also -rpath and -install_name flags
-	  are affected when libruby directory changes.  [Bug #7874]
-
-Wed Feb 20 19:27:02 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (HAVE_RB_SCAN_ARGS_OPTIONAL_HASH): for
-	  rb_scan_args() optional hash feature.  [Bug #7861]
-
-Wed Feb 20 18:02:26 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (target_os): do not strip -gnu suffix on Linux if
-	  --target is given explicitly.  [Bug #7874]
-
-	* configure.in (libdirname): adjust library path name which libruby
-	  files will be installed.  [Bug #7874]
-
-	* tool/rbinstall.rb (libdir): ditto.
-
-Wed Feb 20 13:37:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/pty/pty.c: Documentation for the PTY module
-
-Wed Feb 20 12:18:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c: Document Data class [Bug #7890] [ruby-core:52549]
-	  Patch by Matthew Mongeau
-
-Wed Feb 20 11:50:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/mutex_m.rb: Add rdoc for Mutex_m module
-
-Wed Feb 20 09:34:43 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/commands/update_command.rb:  Create the installer after
-	  options are processed.  [ruby-trunk - Bug #7779]
-	* test/rubygems/test_gem_commands_update_command.rb:  Test for the
-	  above.
-
-Wed Feb 20 07:51:19 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/installer.rb:  Use gsub instead of gsub! to avoid
-	  altering @bin_dir.  Fixes tests on windows.  [ruby-trunk - Bug #7885]
-
-Tue Feb 19 20:50:00 2013  Kenta MURATA  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.gemspec: bump to 1.2.0.
-	  [ruby-core:51777] [Bug #7761]
-
-Tue Feb 19 13:07:25 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* ext/syslog/syslog.c (Init_syslog): Define inspect as a singleton
-	  method and remove it as an instance method. [Bug #6502]
-
-Tue Feb 19 12:30:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* object.c: rdoc formatting for Kernel#Array()
-	* array.c: Add rdoc for Array() method to Creating Arrays section
-
-Tue Feb 19 10:35:52 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl.c (class OpenSSL):  Use only inner parenthesis in
-	  create_extension examples.
-
-Tue Feb 19 10:27:12 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl.c (class OpenSSL):  Fixed ExtensionFactory example.
-	  Patch by Richard Bradley.  [ruby-trunk - Bug #7551]
-
-Tue Feb 19 08:32:11 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_eval.c (vm_call0_body): check interrupts after method dispatch
-	  from C methods. [Bug #7878]
-
-Tue Feb 19 08:14:40 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/installer.rb:  Fixed placement of executables with
-	  --user-install.  [ruby-trunk - Bug #7779]
-	* test/rubygems/test_gem_installer.rb:  Test for above.
-
-Tue Feb 19 06:04:06 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_dump: FreeBSD ports' libexecinfo's backtrace(3) can't trace
-	  beyond signal trampoline, and as described in r38342 it can't
-	  trace on -O because it see stack frame pointers.
-	  libunwind unw_backtrace see dwarf information in the binary
-	  and it works with -O (without frame pointers).
-
-	* configure.in: remove r38342's hack and check libunwind.
-
-Tue Feb 19 04:26:29 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in: check whether backtrace(3) works well or not.
-
-	* vm_dump.c: set HAVE_BACKTRACE 0 if BROKEN_BACKTRACE.
-
-Mon Feb 18 16:30:18 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/ipaddr.rb (IPAddr#in6_addr): Fix a typo with the closing
-	  parenthesis.
-
-Mon Feb 18 12:32:24 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/ipaddr.rb (IPAddr#in6_addr): Fix the parser so that it can
-	  recognize IPv6 addresses with only one edge 16-bit piece
-	  compressed, like [::2:3:4:5:6:7:8] or [1:2:3:4:5:6:7::].
-	  [Bug #7477]
-
-Mon Feb 18 10:09:54 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (unexpand_shvar): regularize a shell variable by
-	  unexpanding shell variables in it.
-
-Sun Feb 17 20:55:44 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compar.c (rb_invcmp): compare by inversed comparison, with preventing
-	  from infinite recursion.  [ruby-core:52305] [Bug #7870]
-
-	* string.c (rb_str_cmp_m), time.c (time_cmp): get rid of infinite
-	  recursion.
-
-Sun Feb 17 17:23:22 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb: remove extra topdir in VPATH, which was in
-	  win32/Makefile.sub for some reason and moved from there.
-	  [ruby-dev:46998] [Bug #7864]
-
-Sun Feb 17 01:19:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* ext/psych/lib/psych/y.rb: Document Kernel#y by Adam Stankiewicz
-	  [Github tenderlove/psych#127]
-
-Sun Feb 17 00:52:14 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/mkconfig.rb: remove prefix from rubyarchdir.
-	  r39267 expands variables, it changes expansion timing,
-	  breaks RbConfig::CONFIG["includedir"] and building
-	  extension libraries with installed ruby.
-
-Sat Feb 16 20:51:17 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (ENV_IN_HEAP_P): fix off-by-one error.
-
-Sat Feb 16 20:47:16 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* configure.in (LIBRUBY_DLDFLAGS): Fix a bug where --with-opt-dir
-	  options given were not reflected to LIBRUBY_DLDFLAGS on many
-	  platforms including Linux and other GNU-based systems, NetBSD,
-	  AIX and BeOS.
-
-Sat Feb 16 20:43:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (rsock_recvmsg): ignore truncated part of
-	  socket address returned from recvmsg().
-
-	* ext/socket/init.c (recvfrom_blocking): ignore truncated part of
-	  socket address returned from recvfrom().
-	  (rsock_s_recvfrom_nonblock): ditto.
-
-Sat Feb 16 20:05:26 2013  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/ruby/test_thread.rb: fixed typo
-	  patched by Hiroki Matsue via https://github.com/ruby/ruby/pull/248
-
-Sat Feb 16 16:08:35 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* vm.c (rb_thread_mark): mark a working Proc of bmethod
-	  (a method defined by define_method) even if the method was removed.
-	  We could not trace working Proc object which represents the body
-	  of bmethod if the method was removed (alias/undef/overridden).
-	  Simply, it was mark miss.
-	  This patch by Kazuki Tsujimoto. [Bug #7825]
-
-	  NOTE: We can brush up this marking because we do not need to mark
-	  `me' on each living control frame. We need to mark `me's
-	  only if `me' was free'ed. This is future work after Ruby 2.0.0.
-
-	* test/ruby/test_method.rb: add a test.
-
-Sat Feb 16 15:45:56 2013  Koichi Sasada  <ko1@atdot.net>
-
-	* proc.c (rb_binding_new_with_cfp): create binding object even if
-	  the frame is IFUNC. But return a ruby-level binding to keep
-	  compatibility.
-	  This patch fix degradation introduced from r39067.
-	  [Bug #7774] [ruby-dev:46960]
-
-	* test/ruby/test_settracefunc.rb: add a test.
-
-Sat Feb 16 13:40:13 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (shvar_to_cpp): do not substitute exec_prefix itself
-	  with RUBY_EXEC_PREFIX, which cause recursive definition.
-	  [ruby-core:52296] [Bug #7860]
-
-Sat Feb 16 13:13:04 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/io/console/io-console.gemspec: bump to 0.4.2.  now explicitly
-	  requires ruby 1.9.3 or later.  [Bug #7847]
-
-	* ext/io/console/console.c (console_dev): compatibility with ruby 1.8.
-
-	* ext/io/console/console.c (rawmode_opt, console_dev): compatibility
-	  with ruby 1.9.  [ruby-core:52220] [Bug #7847]
-
-Sat Feb 16 12:45:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: unexpand arch sitearch and exec_prefix values, so
-	  directly specified bindir, libdir, rubyprefix, etc can be properly
-	  substituted.  [ruby-core:52296] [Bug #7860]
-
-Sat Feb 16 12:15:20 2013  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* parse.y: add dtrace probe for symbol create.
-
-	* probes.d: ditto
-
-Sat Feb 16 09:27:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: don't test sys/feature_tests.h which is not
-	  used now.
-	  It was included in r7901 as "bug of gcc 3.0 on Solaris 8 ?".
-
-Sat Feb 16 09:24:37 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: reorder header tests to consider inclusion
-	  order in rubysocket.h.
-
-Sat Feb 16 08:42:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in, ext/socket/extconf.rb: test netinet/in_systm.h in
-	  ext/socket/extconf.rb instead of configure.in.
-
-	  Originally, netinet/in_systm.h is included for NextStep, OpenStep,
-	  and Rhapsody.  [ruby-core:1596]
-
-Sat Feb 16 07:55:40 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: don't test xti.h here.
-
-	* ext/socket/extconf.rb: test xti.h here.
-
-	  Originally, xti.h is included for IRIX [ruby-core:14447].
-
-Sat Feb 16 07:16:49 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test struct sockaddr_un and its member,
-	  sun_len.
-
-	* ext/socket/sockport.h (INIT_SOCKADDR_UN): new macro defined.
-
-	* ext/socket/socket.c (sock_s_pack_sockaddr_un): use INIT_SOCKADDR_UN.
-
-	* ext/socket/unixsocket.c (rsock_init_unixsock): ditto.
-
-	* ext/socket/raddrinfo.c (init_unix_addrinfo): ditto.
-	  (addrinfo_mload): ditto.
-
-Sat Feb 16 07:05:59 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/sockport.h (INIT_SOCKADDR_IN): don't need family
-	  argument.  it is always AF_INET.
-
-	* ext/socket/raddrinfo.c (make_inetaddr): follow INIT_SOCKADDR_IN
-	  change.
-	  (addrinfo_ipv6_to_ipv4): ditto.
-
-Sat Feb 16 04:21:07 2013  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/socket/extconf.rb: workaround for mswin/mingw build problem.
-	  sendmsg emulation in win32/win32.c is not enough.
-
-Sat Feb 16 00:19:20 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: use all all tested available headers for
-	  have_func.
-
-Fri Feb 15 22:21:37 2013  Akinori MUSHA  <knu@iDaemons.org>
-
-	* configure.in: Fix a bug introduced in r38342 that the cflagspat
-	  substitution is messed up by the way CFLAGS and optflags are
-	  modified, which affected FreeBSD and NetBSD/amd64 when
-	  configured to use libexecinfo.  This bug resulted in CFLAGS and
-	  CXXFLAGS in RbConfig::CONFIG having warnflags expanded in them,
-	  forcing third-party C/C++ extensions to follow what warnflags
-	  demands, like ANSI/ISO-C90 conformance.  ref [Bug #7101]
-
-Fri Feb 15 20:29:11 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/sockport.h (SET_SIN_LEN): defined for strict-aliasing
-	  rule.
-	  (INIT_SOCKADDR_IN): ditto.
-
-	* ext/socket/raddrinfo.c (make_inetaddr): use INIT_SOCKADDR_IN.
-	  (addrinfo_ipv6_to_ipv4): ditto.
-
-Fri Feb 15 18:24:48 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#try_run): bail out explicitly if cross
-	  compiling, because it cannot work of course.
-
-Fri Feb 15 12:34:58 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test struct sockaddr_storage directly.
-
-	* ext/socket/rubysocket.h: use HAVE_TYPE_STRUCT_SOCKADDR_STORAGE.
-
-Fri Feb 15 12:26:13 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/getaddrinfo.c (GET_AI): don't cast 1st argument for
-	  INIT_SOCKADDR.
-
-Fri Feb 15 08:12:11 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/sockport.h (SET_SS_LEN): removed.
-	  (SET_SIN_LEN): removed.
-	  (INIT_SOCKADDR): new macro.
-
-	* ext/socket/ancdata.c (extract_ipv6_pktinfo): use INIT_SOCKADDR.
-
-	* ext/socket/raddrinfo.c (make_inetaddr): use INIT_SOCKADDR.
-	  (addrinfo_ipv6_to_ipv4): ditto.
-
-	* ext/socket/getaddrinfo.c (GET_AI): use INIT_SOCKADDR.
-
-Fri Feb 15 07:49:27 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc.rb:  Update to release version of 4.0.0
-
-	* lib/rubygems.rb:  Update to release version of 2.0.0
-
-Fri Feb 15 07:07:27 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/sockport.h (SA_LEN): removed because unused now.
-	  (SS_LEN): ditto.
-	  (SIN_LEN): ditto.
-
-Thu Feb 14 10:45:31 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_process.rb (test_setsid): Added a workaround for
-	  MacOS X. Patch by nagachika. [Bug #7826] [ruby-core:52126]
-
-Fri Feb 15 00:15:31 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/sockport.h (VALIDATE_SOCKLEN): new macro to validate
-	  sa_len member of 4.4BSD socket address.
-
-	* ext/socket/getnameinfo.c (getnameinfo): use VALIDATE_SOCKLEN,
-	  instead of SA_LEN.
-
-	* ext/socket/socket.c (sock_s_getnameinfo): use VALIDATE_SOCKLEN
-	  instead of SS_LEN.
-
-Thu Feb 14 22:25:54 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (sockaddr_len): extracted from sockaddr_obj.
-	  (sockaddr_obj): add an argument to length of socket address.
-	  (socket_s_ip_address_list): call sockaddr_obj with actual socket
-	  address length if given, use sockaddr_len otherwise.
-
-Thu Feb 14 20:11:23 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket: always operate length of socket address companion with
-	  socket address.
-
-	* ext/socket/rubysocket.h (rsock_make_ipaddr): add an argument for
-	  socket address length.
-	  (rsock_ipaddr): ditto.
-
-	* ext/socket/ipsocket.c (ip_addr): pass length to rsock_ipaddr.
-	  (ip_peeraddr): ditto.
-	  (ip_s_getaddress): pass length to rsock_make_ipaddr.
-
-	* ext/socket/socket.c (make_addrinfo): pass length to rsock_ipaddr.
-	  (sock_s_getnameinfo): pass actual address length to rb_getnameinfo.
-	  (sock_s_unpack_sockaddr_in): pass length to rsock_make_ipaddr.
-
-	* ext/socket/init.c (rsock_s_recvfrom): pass length to rsock_ipaddr.
-	  (rsock_s_recvfrom_nonblock): ditto.
-
-	* ext/socket/tcpsocket.c (tcp_sockaddr): pass length to
-	  rsock_make_ipaddr.
-
-	* ext/socket/raddrinfo.c (make_ipaddr0): add an argument for socket
-	  address length.  pass the length to rb_getnameinfo.
-	  (rsock_ipaddr): ditto.
-	  (rsock_make_ipaddr): add an argument for socket address length.
-	  pass the length to make_ipaddr0.
-	  (make_inetaddr): pass length to make_ipaddr0.
-	  a local variable renamed.
-	  (host_str): a local variable renamed.
-	  (port_str): ditto.
-
-Thu Feb 14 14:31:43 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb:  Removed OpenSSL dependency from Net::HTTP.
-
-	* test/net/http/test_http.rb:  Remove Zlib dependency from tests.
-	* test/net/http/test_http_request.rb:  ditto.
-
-Thu Feb 14 11:08:15 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (include_modules_at): detect cyclic prepend with original
-	  method table.  [ruby-core:52205] [Bug #7841]
-
-Thu Feb 14 10:30:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c: call method_removed hook on called class, not on
-	  prepending iclass.  [ruby-core:52207] [Bug #7843]
-
-Thu Feb 14 10:05:57 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http:  Do not handle Content-Encoding when the user sets
-	  Accept-Encoding.  This allows users to handle Content-Encoding for
-	  themselves.  This restores backwards-compatibility with Ruby 1.x.
-	  [ruby-trunk - Bug #7831]
-	* lib/net/http/generic_request.rb:  ditto.
-	* lib/net/http/response.rb:  ditto
-	* test/net/http/test_http.rb:  Test for the above.
-	* test/net/http/test_http_request.rb:  ditto.
-	* test/net/http/test_httpresponse.rb:  ditto.
-
-Thu Feb 14 08:18:47 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: don't define HAVE_SA_LEN and HAVE_SA_LEN.
-	  use HAVE_STRUCT_SOCKADDR_SA_LEN and HAVE_STRUCT_SOCKADDR_IN_SIN_LEN
-	  instead.
-
-Wed Feb 13 20:59:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: don't define socklen_t here, just test.
-
-	* ext/socket/rubysocket.h: define socklen_t if not available.
-
-Wed Feb 13 18:37:50 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (mnew): skip prepending modules and return the method bound
-	  on the given class.  [ruby-core:52160] [Bug #7836]
-
-Wed Feb 13 18:11:59 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (method_original_name): new methods Method#original_name and
-	  UnboundMethod#original_name.  [ruby-core:52048] [Bug #7806]
-	  [EXPERIMENTAL]
-
-	* proc.c (method_inspect): show the given name primarily, and
-	  original_id if aliased.  [ruby-core:52048] [Bug #7806]
-
-Wed Feb 13 17:56:39 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (warnflags): disable -Werror by default unless
-	  development.  [ruby-core:52131] [Bug #7830]
-
-Wed Feb 13 06:05:52 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems.rb:  Return BINARY strings from Gem.gzip and Gem.gunzip.
-	  Fixes intermittent test failures.  RubyGems issue #450 by Jeremey
-	  Kemper.
-	* test/rubygems/test_gem.rb:  Test for the above.
-
-Wed Feb 13 05:49:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test functions just after struct members.
-
-Tue Feb 12 12:02:35 2013  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json: merge JSON 1.7.7.
-	  This includes security fix. [CVE-2013-0269]
-	  https://github.com/flori/json/commit/d0a62f3ced7560daba2ad546d83f0479a5ae2cf2
-	  https://groups.google.com/d/topic/rubyonrails-security/4_YvCpLzL58/discussion
-
-Mon Feb 11 23:08:48 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: enable rb_cv_page_size_log test for MirOS BSD.
-
-Mon Feb 11 20:06:38 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: use -pthread on mirbsd*.
-
-Mon Feb 11 16:07:09 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: add SOLIBS and LIBRUBY_SO definition for mirbsd*.
-
-Mon Feb 11 13:17:20 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (rubysitearchprefix): sitearchdir and vendorarchdir
-	  should use sitearch, not arch.  [ruby-dev:46964] [Bug #7823]
-
-	* win32/Makefile.sub (config.status): site and vendor directories
-	  should use sitearch, not arch.  [ruby-dev:46964] [Bug #7823]
-
-Mon Feb 11 12:31:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: move OS specific header/function knowledge before
-	  automatic header tests.
-
-Mon Feb 11 11:04:29 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: move the test for -march=i486 just after
-	  RUBY_UNIVERSAL_ARCH/RUBY_DEFAULT_ARCH.
-
-Sun Feb 10 23:42:26 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test structure members just after types test.
-
-Sun Feb 10 20:58:17 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test types just after headers test.
-
-Sun Feb  10 16:00:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/rake/doc/MIT-LICENSE: Add license file from upstream
-	* lib/rake/doc/README.rdoc: Link to license file from Rake README
-	* lib/rake/version.rb: Include README rdoc for Rake module overview
-
-Sun Feb  10 15:26:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/rake/doc/*: Sync Rake rdoc files from upstream
-
-Sun Feb 10 15:50:02 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* vm_exec.h (DISPATCH_ARCH_DEPEND_WAY): use __asm__ __volatile__
-	  instead of asm volatile.
-
-Sun Feb 10 15:50:02 2013  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* gc.h (SET_MACHINE_STACK_END): use __volatile__ instead of volatile.
-
-Sun Feb 10 14:25:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* doc/rake/, lib/rake/doc/: Move Rake rdoc files to lib/rake
-
-Sun Feb 10 12:10:25 2013  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test headers at first.
-
-Sun Feb  10 12:00:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* doc/rake/*: Removed stale Rake static files
-
-Sun Feb  10 09:10:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* lib/pp.rb, lib/prettyprint.rb: Documentation for PP and PrettyPrint
-	  Based on a patch by Vincent Batts [ruby-core:51253] [Bug #7656]
-
-Sat Feb  9 21:11:21 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: move header files check to the beginning of
-	  "header and library section".
-	  test rlim_t with sys/types.h and sys/time.h for MirOS BSD.
-	  sys/types.h and sys/time.h is guarded by #ifdef and the above
-	  move is required for this change.
-
-Sat Feb  9 17:45:58 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in, version.c: prevent duplicated load paths by empty
-	  version string, it does not work right now.
-
-Sat Feb  9 17:38:41 2013  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: fix arch parameters in help message.  [Bug #7804]
-
-Sat Feb  9 13:13:00 2013  Zachary Scott  <zachary@zacharyscott.net>
-
-	* vm_trace.c: Note about TracePoint events set, and comment on
-	  Kernel#set_trace_func to prefer new TracePoint API
-
-Sat Feb  9 10:07:47 2013  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* BSDL: update copyright notice for 2013.
-
-Sat Feb  9 09:24:38 2013  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/package/old.rb:  Fix behavior only on ruby 1.8.
-
-	* lib/rubygems/package.rb:  Include checksums.yaml.gz signatures for
-	  verification.
-	* test/rubygems/test_gem_package.rb:  Test for the above.
-
-Sat Feb  9 01:23:24 2013  Tanaka Akira  <akr@fsij.org>
-
-	* test/fiddle/helper.rb: specify libc and libm locations for MirOS BSD.
-
-	* test/dl/test_base.rb: ditto.
-
-Fri Feb  8 23:25:33 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: change CFLAGS temporally to test
-	  ARCH_FLAG="-march=i486".
-
-Fri Feb  8 21:19:41 2013  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: don't define ARCH_FLAG="-march=i486" if it causes
-	  compilation problem.
-
-For the changes before 2.0.0, see doc/ChangeLog-2.0.0
-For the changes before 1.9.3, see doc/ChangeLog-1.9.3
-For the changes before 1.8.0, see doc/ChangeLog-1.8.0
-
-Local variables:
-coding: us-ascii
-add-log-time-format: (lambda ()
-  (let* ((time (current-time))
-	 (system-time-locale "C")
-	 (diff (+ (cadr time) 32400))
-	 (lo (% diff 65536))
-	 (hi (+ (car time) (/ diff 65536))))
-  (format-time-string "%a %b %e %H:%M:%S %Y" (list hi lo) t)))
-indent-tabs-mode: t
-tab-width: 8
-change-log-indent-text: 2
-end:
-vim: tabstop=8 shiftwidth=2
diff --git a/KNOWNBUGS.rb b/KNOWNBUGS.rb
index b97a08d928..35a8e75876 100644
--- a/KNOWNBUGS.rb
+++ b/KNOWNBUGS.rb
@@ -1,5 +1,7 @@
 #
-# This test file concludes tests which point out known bugs.
+# IMPORTANT: Always keep the first 7 lines (comments),
+# even if this file is otherwise empty.
+#
+# This test file includes tests which point out known bugs.
 # So all tests will cause failure.
 #
-
diff --git a/LEGAL b/LEGAL
index 65706459cd..0423d57ac9 100644
--- a/LEGAL
+++ b/LEGAL
@@ -1,85 +1,331 @@
-LEGAL NOTICE INFORMATION
-------------------------
+# -*- rdoc -*-
+
+= LEGAL NOTICE INFORMATION
+--------------------------
 
 All the files in this distribution are covered under either the Ruby's
 license (see the file COPYING) or public-domain except some files
 mentioned below.
 
-include/ruby/oniguruma.h:
-regcomp.c:
-regenc.[ch]:
-regerror.c:
-regexec.c:
-regint.h:
-regparse.[ch]:
-enc/ascii.c
-enc/big5.c
-enc/cp949.c
-enc/emacs_mule.c
-enc/encdb.c
-enc/euc_jp.c
-enc/euc_kr.c
-enc/euc_tw.c
-enc/gb18030.c
-enc/gb2312.c
-enc/gbk.c
-enc/iso_8859_1.c
-enc/iso_8859_10.c
-enc/iso_8859_11.c
-enc/iso_8859_13.c
-enc/iso_8859_14.c
-enc/iso_8859_15.c
-enc/iso_8859_16.c
-enc/iso_8859_2.c
-enc/iso_8859_3.c
-enc/iso_8859_4.c
-enc/iso_8859_5.c
-enc/iso_8859_6.c
-enc/iso_8859_7.c
-enc/iso_8859_8.c
-enc/iso_8859_9.c
-enc/koi8_r.c
-enc/koi8_u.c
-enc/shift_jis.c
-enc/unicode.c
-enc/us_ascii.c
-enc/utf_16be.c
-enc/utf_16le.c
-enc/utf_32be.c
-enc/utf_32le.c
-enc/utf_8.c
-enc/windows_1251.c
-
-Oniguruma  ----   (C) K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
-
-http://www.geocities.jp/kosako3/oniguruma/
-http://www.ruby-lang.org/cgi-bin/cvsweb.cgi/oniguruma/
-http://www.freebsd.org/cgi/cvsweb.cgi/ports/devel/oniguruma/
-
-   When this software is partly used or it is distributed with Ruby, 
-   this of Ruby follows the license of Ruby.
-
-configure:
+[addr2line.c]
+
+  A part of this file is from FreeBSD.
+
+  >>>
+    Copyright (c) 1986, 1988, 1991, 1993::
+    The Regents of the University of California.  All rights reserved.
+
+    (c) UNIX System Laboratories, Inc.
+
+    All or some portions of this file are derived from material licensed
+    to the University of California by American Telephone and Telegraph
+    Co. or Unix System Laboratories, Inc. and are reproduced herein with
+    the permission of UNIX System Laboratories, Inc.
+
+    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.
+    4. Neither the name of the University nor the names of its contributors
+       may be used to endorse or promote products derived from this software
+       without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
+
+	@(#)subr_prf.c	8.3 (Berkeley) 1/21/94
+
+
+[ccan/build_assert/build_assert.h]
+[ccan/check_type/check_type.h]
+[ccan/container_of/container_of.h]
+[ccan/str/str.h]
+
+  These files are licensed under the {CC0}[https://creativecommons.org/choose/zero/].
+
+[ccan/list/list.h]
+
+  This file is licensed under the {MIT License}[rdoc-label:label-MIT+License].
+
+[coroutine]
+
+  Unless otherwise specified, these files are licensed under the
+  {MIT License}[rdoc-label:label-MIT+License].
+
+[include/ruby/onigmo.h]
+[include/ruby/oniguruma.h]
+[regcomp.c]
+[regenc.c]
+[regenc.h]
+[regerror.c]
+[regexec.c]
+[regint.h]
+[regparse.c]
+[regparse.h]
+[enc/ascii.c]
+[enc/big5.c]
+[enc/cp949.c]
+[enc/emacs_mule.c]
+[enc/encdb.c]
+[enc/euc_jp.c]
+[enc/euc_kr.c]
+[enc/euc_tw.c]
+[enc/gb18030.c]
+[enc/gb2312.c]
+[enc/gbk.c]
+[enc/iso_8859_1.c]
+[enc/iso_8859_10.c]
+[enc/iso_8859_11.c]
+[enc/iso_8859_13.c]
+[enc/iso_8859_14.c]
+[enc/iso_8859_15.c]
+[enc/iso_8859_16.c]
+[enc/iso_8859_2.c]
+[enc/iso_8859_3.c]
+[enc/iso_8859_4.c]
+[enc/iso_8859_5.c]
+[enc/iso_8859_6.c]
+[enc/iso_8859_7.c]
+[enc/iso_8859_8.c]
+[enc/iso_8859_9.c]
+[enc/koi8_r.c]
+[enc/koi8_u.c]
+[enc/shift_jis.c]
+[enc/unicode.c]
+[enc/us_ascii.c]
+[enc/utf_16be.c]
+[enc/utf_16le.c]
+[enc/utf_32be.c]
+[enc/utf_32le.c]
+[enc/utf_8.c]
+[enc/windows_1251.c]
+[enc/windows_31j.c]
+
+  Onigmo (Oniguruma-mod) LICENSE
+
+  >>>
+    Copyright (c) 2002-2009::  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+    Copyright (c) 2011-2014::  K.Takata  <kentkt AT csc DOT 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 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.
+
+  Oniguruma LICENSE
+
+  >>>
+    Copyright (c) 2002-2009::  K.Kosako  <sndgk393 AT ybb DOT ne DOT 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 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.
+
+  * https://github.com/k-takata/Onigmo/
+  * https://github.com/kkos/oniguruma
+  * https://svnweb.freebsd.org/ports/head/devel/oniguruma/
+
+    When this software is partly used or it is distributed with Ruby,
+    this of Ruby follows the license of Ruby.
+
+[enc/windows_1250.c]
+[enc/windows_1252.c]
+
+  >>>
+    Copyright (c) 2006-2007::  Byte      <byte AT mail DOT kna DOT ru>
+                               K.Kosako  <sndgk393 AT ybb DOT ne DOT 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 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.
+
+[enc/cesu_8.c]
+[enc/windows_1253.c]
+[enc/windows_1254.c]
+[enc/windows_1257.c]
+
+  >>>
+    Copyright (c) 2002-2007::  K.Kosako  <sndgk393 AT ybb DOT ne DOT 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 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.
+
+[enc/trans/GB/GB12345%UCS.src]
+[enc/trans/GB/UCS%GB12345.src]
+[enc/trans/GB/GB2312%UCS.src]
+[enc/trans/GB/UCS%GB2312.src]
+
+  These files have this explanatory texts.
+
+  >>>
+    This mapping data was created from files provided by Unicode, Inc.
+    (The Unicode Consortium). The files were used to create a product supporting
+    Unicode, as explicitly permitted in the files' copyright notices.
+    Please note that Unicode, Inc. never made any claims as to fitness of these
+    files for any particular purpose, and has ceased to publish the files many
+    years ago.
+
+[enc/trans/JIS/JISX0201-KANA%UCS.src]
+[enc/trans/JIS/JISX0208\@1990%UCS.src]
+[enc/trans/JIS/JISX0212%UCS.src]
+[enc/trans/JIS/UCS%JISX0201-KANA.src]
+[enc/trans/JIS/UCS%JISX0208@1990.src]
+[enc/trans/JIS/UCS%JISX0212.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    © 2015 Unicode®, Inc.
+
+    For terms of use, see http://www.unicode.org/terms_of_use.html
+
+[enc/trans/JIS/JISX0213-1%UCS@BMP.src]
+[enc/trans/JIS/JISX0213-1%UCS@SIP.src]
+[enc/trans/JIS/JISX0213-2%UCS@BMP.src]
+[enc/trans/JIS/JISX0213-2%UCS@SIP.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    Copyright (C) 2001:: earthian@tama.or.jp, All Rights Reserved.
+    Copyright (C) 2001:: I'O, All Rights Reserved.
+    Copyright (C) 2006:: Project X0213, All Rights Reserved.
+    You can use, modify, distribute this table freely.
+
+[enc/trans/JIS/UCS@BMP%JISX0213-1.src]
+[enc/trans/JIS/UCS@BMP%JISX0213-2.src]
+[enc/trans/JIS/UCS@SIP%JISX0213-1.src]
+[enc/trans/JIS/UCS@SIP%JISX0213-2.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    Copyright (C) 2001:: earthian@tama.or.jp, All Rights Reserved.
+    Copyright (C) 2001:: I'O, All Rights Reserved.
+    You can use, modify, distribute this table freely.
+
+[enc/trans/ucm/glibc-BIG5-2.3.3.ucm]
+[enc/trans/ucm/glibc-BIG5HKSCS-2.3.3.ucm]
+
+  >>>
+    Copyright (C) 2001-2005:: International Business Machines
+                              Corporation and others.  All Rights Reserved.
+
+[enc/trans/ucm/windows-950-2000.ucm]
+[enc/trans/ucm/windows-950_hkscs-2001.ucm]
+
+  >>>
+    Copyright (C) 2001-2002:: International Business Machines
+                              Corporation and others.  All Rights Reserved.
+
+
+[configure]
 
   This file is free software.
 
-    Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, Inc.
+  >>>
+    Copyright (C) 1992-1996, 1998-2012:: Free Software Foundation, Inc.
 
     This configure script is free software; the Free Software Foundation
     gives unlimited permission to copy, distribute and modify it.
 
-tool/config.guess:
-tool/config.sub:
+[tool/config.guess]
+[tool/config.sub]
 
   As long as you distribute these files with the file configure, they
   are covered under the Ruby's license.
 
-      Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999
-      Free Software Foundation, Inc.
+  >>>
+    Copyright 1992-2018:: Free Software Foundation, Inc.
 
     This file is free software; you can redistribute it and/or modify it
     under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
+    the Free Software Foundation; either version 3 of the License, or
     (at your option) any later version.
 
     This program is distributed in the hope that it will be useful, but
@@ -88,54 +334,85 @@ tool/config.sub:
     General Public License for more details.
 
     You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+    along with this program; if not, see <https://www.gnu.org/licenses/>.
 
     As a special exception to the GNU General Public License, if you
     distribute this file as part of a program that contains a
     configuration script generated by Autoconf, you may include it under
-    the same distribution terms that you use for the rest of that program.
-
-parse.c:
-
-  This file is licensed under the GPL, but is incorporated into Ruby and 
+    the same distribution terms that you use for the rest of that
+    program.  This Exception is an additional permission under section 7
+    of the GNU General Public License, version 3 ("GPLv3").
+
+[tool/lib/test/*]
+[tool/lib/core_assertions.rb]
+
+  Some of methods on these files are based on MiniTest 4. MiniTest 4 is
+  distributed under the MIT License.
+
+  >>>
+    Copyright (c) Ryan Davis, seattle.rb
+
+    Permission is hereby granted, free of charge, to any person obtaining
+    a copy of this software and associated documentation files (the
+    'Software'), to deal in the Software without restriction, including
+    without limitation the rights to use, copy, modify, merge, publish,
+    distribute, sublicense, and/or sell copies of the Software, and to
+    permit persons to whom the Software is furnished to do so, subject to
+    the following conditions:
+
+    The above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+    IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+    CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+    TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+[parse.c]
+[parse.h]
+
+  These files are licensed under the GPL, but are incorporated into Ruby and
   redistributed under the terms of the Ruby license, as permitted by the
   exception to the GPL below.
 
-     Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
-     Free Software Foundation, Inc.
+  >>>
+    Copyright (C) 1984, 1989-1990, 2000-2015, 2018:: Free Software Foundation, Inc.
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
 
-     This program is free software; you can redistribute it and/or modify
-     it under the terms of the GNU General Public License as published by
-     the Free Software Foundation; either version 2, or (at your option)
-     any later version.
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
 
-     This program is distributed in the hope that it will be useful,
-     but WITHOUT ANY WARRANTY; without even the implied warranty of
-     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-     GNU General Public License for more details.
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
-     You should have received a copy of the GNU General Public License
-     along with this program; if not, write to the Free Software
-     Foundation, Inc., 51 Franklin Street, Fifth Floor,
-     Boston, MA 02110-1301, USA.  */
+    As a special exception, you may create a larger work that contains
+    part or all of the Bison parser skeleton and distribute that work
+    under terms of your choice, so long as that work isn't itself a
+    parser generator using the skeleton or a modified version thereof
+    as a parser skeleton.  Alternatively, if you modify or redistribute
+    the parser skeleton itself, you may (at your option) remove this
+    special exception, which will cause the skeleton and the resulting
+    Bison output files to be licensed under the GNU General Public
+    License without this special exception.
 
-  /* As a special exception, you may create a larger work that contains
-     part or all of the Bison parser skeleton and distribute that work
-     under terms of your choice, so long as that work isn't itself a
-     parser generator using the skeleton or a modified version thereof
-     as a parser skeleton.  Alternatively, if you modify or redistribute
-     the parser skeleton itself, you may (at your option) remove this
-     special exception, which will cause the skeleton and the resulting
-     Bison output files to be licensed under the GNU General Public
-     License without this special exception.
+    This special exception was added by the Free Software Foundation in
+    version 2.2 of Bison.
 
-     This special exception was added by the Free Software Foundation in
-     version 2.2 of Bison.  */
+[missing/dtoa.c]
 
-util.c (partly):
+  This file is under these licenses.
 
-    Copyright (c) 1991, 2000, 2001 by Lucent Technologies.
+  >>>
+    Copyright (c) 1991, 2000, 2001:: by Lucent Technologies.
 
     Permission to use, copy, modify, and distribute this software for any
     purpose without fee is hereby granted, provided that this entire notice
@@ -148,71 +425,74 @@ util.c (partly):
     REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
     OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
 
-win32/win32.[ch]:
+  >>>
+    Copyright (c) 2004-2008:: David Schultz <das@FreeBSD.ORG>
+                              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.
+
+[win32/win32.c]
+[include/ruby/win32.h]
 
   You can apply the Artistic License to these files. (or GPL,
   alternatively)
 
-    Copyright (c) 1993, Intergraph Corporation
+  >>>
+    Copyright (c) 1993:: Intergraph Corporation
 
     You may distribute under the terms of either the GNU General Public
     License or the Artistic License, as specified in the perl README file.
 
-util.c (partly):
-
-   Copyright (c) 2004-2008 David Schultz <das@FreeBSD.ORG>
-   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.
-
-random.c
+[missing/mt19937.c]
 
   This file is under the new-style BSD license.
 
-    A C-program for MT19937, with initialization improved 2002/2/10.
+  >>>
+    A C-program for MT19937, with initialization improved 2002/2/10.::
     Coded by Takuji Nishimura and Makoto Matsumoto.
+
     This is a faster version by taking Shawn Cokus's optimization,
     Matthe Bellew's simplification, Isaku Wada's real version.
 
-    Before using, initialize the state by using init_genrand(seed) 
+    Before using, initialize the state by using init_genrand(seed)
     or init_by_array(init_key, key_length).
 
-    Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-    All rights reserved.                          
+    Copyright (C) 1997 - 2002:: Makoto Matsumoto and Takuji Nishimura,
+                                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.
+    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.
+    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.
 
-      3. The names of its contributors may not be used to endorse or promote 
-	 products derived from this software without specific prior written 
-	 permission.
+    3. The names of its contributors may not be used to endorse or promote
+       products derived from this software without specific prior written
+       permission.
 
     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
@@ -231,16 +511,15 @@ random.c
     http://www.math.keio.ac.jp/matumoto/emt.html
     email: matumoto@math.keio.ac.jp
 
-vsnprintf.c:
+  The Wayback Machine url: http://web.archive.org/web/19990429082237/http://www.math.keio.ac.jp/matumoto/emt.html
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+[missing/procstat_vm.c]
 
-    Copyright (c) 1990, 1993
-         The Regents of the University of California.  All rights reserved.
+  This file is under the new-style BSD license.
 
-    This code is derived from software contributed to Berkeley by
-    Chris Torek.
+  >>>
+    Copyright (c) 2007:: Robert N. M. Watson
+                         All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions
@@ -250,14 +529,11 @@ vsnprintf.c:
     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.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
 
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+    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 REGENTS OR CONTRIBUTORS BE LIABLE
+    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)
@@ -266,146 +542,100 @@ vsnprintf.c:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-    IMPORTANT NOTE:
-    --------------
-    From ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
-    paragraph 3 above is now null and void.
-
-st.[ch]:
-missing/alloca.c:
-missing/dup2.c:
-missing/erf.c:
-missing/finite.c:
-missing/hypot.c:
-missing/isinf.c:
-missing/isnan.c:
-missing/lgamma_r.c:
-missing/memcmp.c:
-missing/memmove.c:
-missing/strchr.c:
-missing/strstr.c:
-missing/strtol.c:
-missing/tgamma.c:
-ext/digest/sha1/sha1.[ch]:
+    $FreeBSD: head/usr.bin/procstat/procstat_vm.c 261780 2014-02-11 21:57:37Z jhb $
+
+[vsnprintf.c]
+
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
+
+  >>>
+    Copyright (c) 1990, 1993::
+    The Regents of the University of California.  All rights reserved.
+
+    This code is derived from software contributed to Berkeley by
+    Chris Torek.
+
+[st.c]
+[strftime.c]
+[include/ruby/st.h]
+[missing/acosh.c]
+[missing/alloca.c]
+[missing/erf.c]
+[missing/hypot.c]
+[missing/lgamma_r.c]
+[missing/memcmp.c]
+[missing/memmove.c]
+[missing/strchr.c]
+[missing/strerror.c]
+[missing/strstr.c]
+[missing/tgamma.c]
+[ext/date/date_strftime.c]
+[ext/digest/sha1/sha1.c]
+[ext/digest/sha1/sha1.h]
 
   These files are all under public domain.
 
-missing/crypt.c:
+[missing/crypt.c]
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
 
-    Copyright (c) 1989, 1993
-    	The Regents of the University of California.  All rights reserved.
+  >>>
+    Copyright (c) 1989, 1993::
+    The Regents of the University of California.  All rights reserved.
 
     This code is derived from software contributed to Berkeley by
     Tom Truscott.
 
-    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.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
-
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
+[missing/setproctitle.c]
 
-missing/setproctitle.c
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+  >>>
+    Copyright 2003:: Damien Miller
+    Copyright (c) 1983, 1995-1997:: Eric P. Allman
+    Copyright (c) 1988, 1993::
+    The Regents of the University of California.  All rights reserved.
 
-    Copyright 2003 Damien Miller
-    Copyright (c) 1983, 1995-1997 Eric P. Allman
-    Copyright (c) 1988, 1993
-    	The Regents of the University of California.  All rights reserved.
+[missing/strlcat.c]
+[missing/strlcpy.c]
 
-    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.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
+  These files are under an ISC-style license.
 
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
+  >>>
+    Copyright (c) 1998, 2015:: Todd C. Miller <Todd.Miller@courtesan.com>
 
-missing/strlcat.c
-missing/strlcpy.c
+    Permission to use, copy, modify, and distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
 
-  These files are under the new-style BSD license.
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 
-   Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
-   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.
-   3. The name of the author may not be used to endorse or promote products
-      derived from this software without specific prior written permission.
-
-   THIS SOFTWARE IS PROVIDED ``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.
-
-missing/langinfo.c
+[missing/langinfo.c]
 
   This file is from http://www.cl.cam.ac.uk/~mgk25/ucs/langinfo.c.
   Ruby uses a modified version. The file contains the following
   author/copyright notice:
 
-  Markus.Kuhn@cl.cam.ac.uk -- 2002-03-11
-  Permission to use, copy, modify, and distribute this software
-  for any purpose and without fee is hereby granted. The author
-  disclaims all warranties with regard to this software.
+  >>>
+    Markus.Kuhn@cl.cam.ac.uk -- 2002-03-11::
+    Permission to use, copy, modify, and distribute this software
+    for any purpose and without fee is hereby granted. The author
+    disclaims all warranties with regard to this software.
 
-ext/digest/md5/md5.[ch]:
+[ext/digest/md5/md5.c]
+[ext/digest/md5/md5.h]
 
   These files are under the following license.  Ruby uses modified
   versions of them.
 
-    Copyright (C) 1999, 2000 Aladdin Enterprises.  All rights reserved.
+  >>>
+    Copyright (C) 1999, 2000:: Aladdin Enterprises.  All rights reserved.
 
     This software is provided 'as-is', without any express or implied
     warranty.  In no event will the authors be held liable for any damages
@@ -426,23 +656,27 @@ ext/digest/md5/md5.[ch]:
     L. Peter Deutsch
     ghost@aladdin.com
 
-ext/digest/rmd160/rmd160.[ch]:
+[ext/digest/rmd160/rmd160.c]
+[ext/digest/rmd160/rmd160.h]
 
   These files have the following copyright information, and by the
   author we are allowed to use it under the new-style BSD license.
 
-    AUTHOR:   Antoon Bosselaers, ESAT-COSIC
+  >>>
+    AUTHOR::  Antoon Bosselaers, ESAT-COSIC
               (Arranged for libc by Todd C. Miller)
-    DATE:     1 March 1996
+    DATE::    1 March 1996
 
-    Copyright (c) Katholieke Universiteit Leuven
+    Copyright (c):: Katholieke Universiteit Leuven
     1996, All Rights Reserved
 
-ext/digest/sha2/sha2.[ch]:
+[ext/digest/sha2/sha2.c]
+[ext/digest/sha2/sha2.h]
 
   These files are under the new-style BSD license.
 
-    Copyright 2000 Aaron D. Gifford.  All rights reserved.
+  >>>
+    Copyright 2000:: Aaron D. Gifford.  All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions
@@ -468,29 +702,123 @@ ext/digest/sha2/sha2.[ch]:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-ext/nkf/nkf-utf8/config.h:
-ext/nkf/nkf-utf8/nkf.c:
-ext/nkf/nkf-utf8/utf8tbl.c:
+[ext/json/generator/generator.c]
+
+  The file contains the following copyright notice.
+
+  >>>
+    Copyright 2001-2004:: Unicode, Inc.
+
+    Disclaimer::
+
+      This source code is provided as is by Unicode, Inc. No claims are
+      made as to fitness for any particular purpose. No warranties of any
+      kind are expressed or implied. The recipient agrees to determine
+      applicability of information provided. If this file has been
+      purchased on magnetic or optical media from Unicode, Inc., the
+      sole remedy for any claim will be exchange of defective media
+      within 90 days of receipt.
+
+    Limitations on Rights to Redistribute This Code::
+
+      Unicode, Inc. hereby grants the right to freely use the information
+      supplied in this file in the creation of products supporting the
+      Unicode Standard, and to make copies of this file in any form
+      for internal or external distribution as long as this notice
+      remains attached.
+
+[ext/nkf/nkf-utf8/config.h]
+[ext/nkf/nkf-utf8/nkf.c]
+[ext/nkf/nkf-utf8/utf8tbl.c]
 
   These files are under the following license.  So to speak, it is
   copyrighted semi-public-domain software.
 
-    Copyright (C) 1987, Fujitsu LTD. (Itaru ICHIKAWA)
-       Everyone is permitted to do anything on this program 
-       including copying, modifying, improving,
-       as long as you don't try to pretend that you wrote it.
-       i.e., the above copyright notice has to appear in all copies.
-       Binary distribution requires original version messages.
-       You don't have to ask before copying, redistribution or publishing.
-       THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
+  >>>
+    Copyright (C) 1987:: Fujitsu LTD. (Itaru ICHIKAWA)
+
+    Everyone is permitted to do anything on this program
+    including copying, modifying, improving,
+    as long as you don't try to pretend that you wrote it.
+    i.e., the above copyright notice has to appear in all copies.
+    Binary distribution requires original version messages.
+    You don't have to ask before copying, redistribution or publishing.
+    THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
+
+[ext/psych]
+[test/psych]
+
+  The files under these directories are under the following license, except for
+  ext/psych/yaml.
+
+  >>>
+    Copyright 2009:: Aaron Patterson, et al.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of
+    this software and associated documentation files (the 'Software'), to deal in
+    the Software without restriction, including without limitation the rights to
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+    of the Software, and to permit persons to whom the Software is furnished to do
+    so, subject to the following conditions:
 
-ext/socket/addrinfo.h:
-ext/socket/getaddrinfo.c:
-ext/socket/getnameinfo.c:
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+
+[ext/psych/yaml]
+
+  The files under this directory are under the following license.
+
+  >>>
+    Copyright (c) 2006:: Kirill Simonov
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of
+    this software and associated documentation files (the "Software"), to deal in
+    the Software without restriction, including without limitation the rights to
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+    of the Software, and to permit persons to whom the Software is furnished to do
+    so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+
+[ext/pty/pty.c]
+
+  >>>
+    C) Copyright 1998:: by Akinori Ito.
+
+    This software may be redistributed freely for this purpose, in full
+    or in part, provided that this entire copyright notice is included
+    on any copies of this software and applications and derivations thereof.
+
+    This software is provided on an "as is" basis, without warranty of any
+    kind, either expressed or implied, as to any matter including, but not
+    limited to warranty of fitness of purpose, or merchantability, or
+    results obtained from use of this software.
+
+[ext/socket/addrinfo.h]
+[ext/socket/getaddrinfo.c]
+[ext/socket/getnameinfo.c]
 
   These files are under the new-style BSD license.
 
-    Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
+  >>>
+    Copyright (C) 1995, 1996, 1997, 1998, and 1999:: WIDE Project.
     All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
@@ -517,17 +845,275 @@ ext/socket/getnameinfo.c:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-ext/win32ole/win32ole.c:
+[ext/win32ole/win32ole.c]
 
   You can apply the Artistic License to this file. (or GPL,
   alternatively)
 
-    (c) 1995 Microsoft Corporation. All rights reserved.
+  >>>
+    (c) 1995:: Microsoft Corporation. All rights reserved.
     Developed by ActiveWare Internet Corp., http://www.ActiveWare.com
 
-    Other modifications Copyright (c) 1997, 1998 by Gurusamy Sarathy
+    Other modifications Copyright (c) 1997, 1998:: by Gurusamy Sarathy
     <gsar@umich.edu> and Jan Dubois <jan.dubois@ibm.net>
- 
+
     You may distribute under the terms of either the GNU General Public
     License or the Artistic License, as specified in the README file
     of the Perl distribution.
+
+  The Wayback Machine url: http://web.archive.org/web/19970607104352/http://www.activeware.com:80/
+
+[lib/rdoc/generator/template/darkfish/css/fonts.css]
+
+  This file is licensed under the {SIL Open Font License}[http://scripts.sil.org/OFL].
+
+[spec/mspec]
+[spec/ruby]
+
+  The files under these directories are under the following license.
+
+  >>>
+    Copyright (c) 2008:: Engine Yard, Inc. All rights reserved.
+
+    Permission is hereby granted, free of charge, to any person
+    obtaining a copy of this software and associated documentation
+    files (the "Software"), to deal in the Software without
+    restriction, including without limitation the rights to use,
+    copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the
+    Software is furnished to do so, subject to the following
+    conditions:
+
+    The above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+    OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+    NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+    WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+    OTHER DEALINGS IN THE SOFTWARE.
+
+[lib/rubygems.rb]
+[lib/rubygems]
+[test/rubygems]
+
+  RubyGems is under the following license.
+
+  >>>
+    RubyGems is copyrighted free software by Chad Fowler, Rich Kilmer, Jim
+    Weirich and others.  You can redistribute it and/or modify it under
+    either the terms of the {MIT license}[rdoc-label:label-MIT+License], or the conditions
+    below:
+
+    1. You may make and give away verbatim copies of the source form of the
+       software without restriction, provided that you duplicate all of the
+       original copyright notices and associated disclaimers.
+
+    2. You may modify your copy of the software in any way, provided that
+       you do at least ONE of the following:
+
+       a. place your modifications in the Public Domain or otherwise
+          make them Freely Available, such as by posting said
+          modifications to Usenet or an equivalent medium, or by allowing
+          the author to include your modifications in the software.
+
+       b. use the modified software only within your corporation or
+          organization.
+
+       c. give non-standard executables non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d. make other distribution arrangements with the author.
+
+    3. You may distribute the software in object code or executable
+       form, provided that you do at least ONE of the following:
+
+       a. distribute the executables and library files of the software,
+          together with instructions (in the manual page or equivalent)
+          on where to get the original distribution.
+
+       b. accompany the distribution with the machine-readable source of
+          the software.
+
+       c. give non-standard executables non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d. make other distribution arrangements with the author.
+
+    4. You may modify and include the part of the software into any other
+       software (possibly commercial).
+
+    5. The scripts and library files supplied as input to or produced as
+       output from the software do not automatically fall under the
+       copyright of the software, but belong to whomever generated them,
+       and may be sold commercially, and may be aggregated with this
+       software.
+
+    6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+       IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+       WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+       PURPOSE.
+
+[lib/bundler]
+[lib/bundler.rb]
+[spec/bundler]
+
+  Bundler is under the following license.
+
+  >>>
+    Portions copyright (c) 2010:: Andre Arko
+    Portions copyright (c) 2009:: Engine Yard
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/thor]
+
+  Thor is under the following license.
+
+  >>>
+    Copyright (c) 2008 Yehuda Katz, Eric Hodel, et al.
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/rubygems/resolver/molinillo]
+
+  molinillo is under the following license.
+
+  >>>
+    Copyright (c) 2014 Samuel E. Giddins segiddins@segiddins.me
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/pub_grub]
+
+  pub_grub is under the following license.
+
+  >>>
+    Copyright (c) 2018 John Hawthorn
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/connection_pool]
+
+  connection_pool is under the following license.
+
+  >>>
+    Copyright (c) 2011 Mike Perham
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/net-http-persistent]
+
+  net-http-persistent is under the following license.
+
+  >>>
+    Copyright (c) Eric Hodel, Aaron Patterson
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/did_you_mean]
+[lib/did_you_mean.rb]
+[test/did_you_mean]
+
+  did_you_mean is under the following license.
+
+  >>>
+    Copyright (c) 2014-2016 Yuki Nishijima
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/error_highlight]
+[lib/error_highlight.rb]
+[test/error_highlight]
+
+  error_highlight is under the following license.
+
+  >>>
+    Copyright (c) 2021 Yusuke Endoh
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[benchmark/so_ackermann.rb]
+[benchmark/so_array.rb]
+[benchmark/so_binary_trees.rb]
+[benchmark/so_concatenate.rb]
+[benchmark/so_count_words.yml]
+[benchmark/so_exception.rb]
+[benchmark/so_fannkuch.rb]
+[benchmark/so_fasta.rb]
+[benchmark/so_k_nucleotide.yml]
+[benchmark/so_lists.rb]
+[benchmark/so_mandelbrot.rb]
+[benchmark/so_matrix.rb]
+[benchmark/so_meteor_contest.rb]
+[benchmark/so_nbody.rb]
+[benchmark/so_nested_loop.rb]
+[benchmark/so_nsieve.rb]
+[benchmark/so_nsieve_bits.rb]
+[benchmark/so_object.rb]
+[benchmark/so_partial_sums.rb]
+[benchmark/so_pidigits.rb]
+[benchmark/so_random.rb]
+[benchmark/so_reverse_complement.yml]
+[benchmark/so_sieve.rb]
+[benchmark/so_spectralnorm.rb]
+
+  These files are very old copy of then-called "The Great Computer Language
+  Shootout".  LEGAL SITUATION OF THESE FILES ARE UNCLEAR because the original
+  site has been lost.  Upstream diverged to delete several benchmarks listed
+  above.
+
+== MIT License
+>>>
+      Permission is hereby granted, free of charge, to any person obtaining
+      a copy of this software and associated documentation files (the
+      "Software"), to deal in the Software without restriction, including
+      without limitation the rights to use, copy, modify, merge, publish,
+      distribute, sublicense, and/or sell copies of the Software, and to
+      permit persons to whom the Software is furnished to do so, subject to
+      the following conditions:
+
+      The above copyright notice and this permission notice shall be
+      included in all copies or substantial portions of the Software.
+
+      THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+      EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+      MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+      NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+      LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+      OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+      WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+== Old-style BSD license
+>>>
+      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.
+      3. Neither the name of the University nor the names of its contributors
+         may be used to endorse or promote products derived from this software
+         without specific prior written permission.
+
+      THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
+
+      IMPORTANT NOTE::
+
+      From ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
+      paragraph 3 above is now null and void.
diff --git a/Makefile.in b/Makefile.in
deleted file mode 100644
index 3c42ebd3e6..0000000000
--- a/Makefile.in
+++ /dev/null
@@ -1,476 +0,0 @@
-SHELL = /bin/sh
-NULLCMD = @NULLCMD@
-n=$(NULLCMD)
-ECHO1 = $(V:1=@$n)
-RUNCMD = $(SHELL)
-CDPATH = .
-CHDIR = @CHDIR@
-exec = exec
-NULL = /dev/null
-PATH_SEPARATOR = @PATH_SEPARATOR@
-
-#### Start of system configuration section. ####
-
-srcdir = @srcdir@
-top_srcdir = $(srcdir)
-hdrdir = $(srcdir)/include
-PLATFORM_DIR = @PLATFORM_DIR@
-
-CC = @CC@
-CPP = @CPP@
-LD = @LD@
-YACC = bison
-PURIFY =
-AUTOCONF = autoconf
-@SET_MAKE@
-MKFILES = @MAKEFILES@
-BASERUBY = @BASERUBY@
-TEST_RUNNABLE = @TEST_RUNNABLE@
-CROSS_COMPILING = @CROSS_COMPILING@
-DOXYGEN = @DOXYGEN@
-
-prefix = @prefix@
-exec_prefix = @exec_prefix@
-bindir = @bindir@
-sbindir = @sbindir@
-libdir = @libdir@
-libexecdir = @libexecdir@
-datarootdir = @datarootdir@
-datadir = @datadir@
-arch = @arch@
-sitearch = @sitearch@
-sitedir = @sitedir@
-archlibdir = @archlibdir@
-ruby_version = @ruby_version@
-
-TESTUI = console
-TESTS =
-INSTALLDOC = @INSTALLDOC@
-DOCTARGETS = @RDOCTARGET@ @CAPITARGET@
-
-EXTOUT = @EXTOUT@
-arch_hdrdir = $(EXTOUT)/include/$(arch)
-VPATH = $(arch_hdrdir)/ruby:$(hdrdir)/ruby:$(srcdir):$(srcdir)/enc:$(srcdir)/missing
-
-empty =
-CC_VERSION = @CC_VERSION@
-OUTFLAG = @OUTFLAG@$(empty)
-COUTFLAG = @COUTFLAG@$(empty)
-ARCH_FLAG = @ARCH_FLAG@
-CFLAGS = @CFLAGS@ $(ARCH_FLAG)
-cflags = @cflags@
-optflags = @optflags@
-debugflags = @debugflags@
-warnflags = @warnflags@ @strict_warnflags@
-INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir) -I$(srcdir)
-XCFLAGS = @XCFLAGS@
-CPPFLAGS = @CPPFLAGS@ $(INCFLAGS)
-LDFLAGS = @STATIC@ $(CFLAGS) @LDFLAGS@
-EXTLDFLAGS = @EXTLDFLAGS@
-XLDFLAGS = @XLDFLAGS@ $(EXTLDFLAGS)
-EXTLIBS =
-LIBS = @LIBS@ $(EXTLIBS)
-MISSING = @LIBOBJS@ @ALLOCA@
-LDSHARED = @LIBRUBY_LDSHARED@
-DLDFLAGS = @LIBRUBY_DLDFLAGS@ $(XLDFLAGS) $(ARCH_FLAG)
-SOLIBS = @SOLIBS@
-MAINLIBS = @MAINLIBS@
-ARCHMINIOBJS = @MINIOBJS@
-DLNOBJ = @DLNOBJ@
-ENCOBJS = @ENCOBJS@
-EXTOBJS = @EXTOBJS@
-BUILTIN_ENCOBJS = @BUILTIN_ENCOBJS@
-BUILTIN_TRANSSRCS = @BUILTIN_TRANSSRCS@
-BUILTIN_TRANSOBJS = @BUILTIN_TRANSOBJS@
-POSTLINK = @POSTLINK@
-
-RUBY_BASE_NAME=@RUBY_BASE_NAME@
-RUBY_PROGRAM_VERSION=@RUBY_PROGRAM_VERSION@
-RUBY_INSTALL_NAME=@RUBY_INSTALL_NAME@
-RUBY_SO_NAME=@RUBY_SO_NAME@
-RUBY_RELEASE_DATE=@RUBY_RELEASE_DATE@
-EXEEXT = @EXEEXT@
-LIBEXT = @LIBEXT@
-PROGRAM=$(RUBY_INSTALL_NAME)$(EXEEXT)
-RUBY = $(RUBY_INSTALL_NAME)
-MINIRUBY = @MINIRUBY@\
-	$(MINIRUBYOPT)
-RUNRUBY_COMMAND = @RUNRUBY@ $(RUNRUBYOPT)
-RUNRUBY = $(RUNRUBY_COMMAND) -- $(RUN_OPTS)
-RUNRUBY_DEBUGGER = --debugger='gdb -x run.gdb --quiet --args'
-XRUBY = @XRUBY@
-BTESTRUBY = @BTESTRUBY@\
-	$(MINIRUBYOPT)
-INSTALL = @INSTALL@
-INSTALL_DATA = @INSTALL_DATA@
-INSTALL_SCRIPT = @INSTALL_SCRIPT@
-INSTALL_PROGRAM = @INSTALL_PROGRAM@
-XRUBY_LIBDIR = @XRUBY_LIBDIR@
-XRUBY_RUBYLIBDIR = @XRUBY_RUBYLIBDIR@
-XRUBY_RUBYHDRDIR = @XRUBY_RUBYHDRDIR@
-
-DEFAULT_PRELUDES = $(@USE_RUBYGEMS@_GEM_PRELUDE)
-
-#### End of system configuration section. ####
-
-MAJOR=	@MAJOR@
-MINOR=	@MINOR@
-TEENY=	@TEENY@
-
-LIBRUBY_A     = @LIBRUBY_A@
-LIBRUBY_SO    = @LIBRUBY_SO@
-LIBRUBY_ALIASES= @LIBRUBY_ALIASES@
-LIBRUBY	      = @LIBRUBY@
-LIBRUBYARG    = @LIBRUBYARG@
-LIBRUBYARG_STATIC = @LIBRUBYARG_STATIC@
-LIBRUBYARG_SHARED = @LIBRUBYARG_SHARED@
-LIBRUBY_RELATIVE = @LIBRUBY_RELATIVE@
-LIBRUBY_A_OBJS = @LIBRUBY_A_OBJS@
-
-THREAD_MODEL  = @THREAD_MODEL@
-
-PREP          = @PREP@
-ARCHFILE      = @ARCHFILE@
-SETUP         =
-EXTSTATIC     = @EXTSTATIC@
-SET_LC_MESSAGES = env LC_MESSAGES=C
-
-MAKEDIRS      = @MKDIR_P@
-CP            = cp
-MV            = mv
-RM            = rm -f
-RMDIR         = @RMDIR@
-RMDIRS        = @RMDIRS@
-RMALL         = @RMALL@
-NM            = @NM@
-AR            = @AR@
-ARFLAGS       = rcu
-RANLIB        = @RANLIB@
-AS            = @AS@
-ASFLAGS       = @ASFLAGS@ $(INCFLAGS)
-IFCHANGE      = $(srcdir)/tool/ifchange
-SET_LC_MESSAGES = env LC_MESSAGES=C
-OBJDUMP       = @OBJDUMP@
-OBJCOPY       = @OBJCOPY@
-VCS           = @VCS@
-VCSUP         = @VCSUP@
-DTRACE        = @DTRACE@
-DTRACE_EXT    = @DTRACE_EXT@
-DTRACE_OBJ   = @DTRACE_OBJ@
-DTRACE_GLOMMED_OBJ = @DTRACE_GLOMMED_OBJ@
-
-OBJEXT        = @OBJEXT@
-ASMEXT        = S
-DLEXT         = @DLEXT@
-MANTYPE	      = @MANTYPE@
-SYMBOL_PREFIX = @SYMBOL_PREFIX@
-
-INSTALLED_LIST= .installed.list
-
-MKMAIN_CMD    = mkmain.sh
-
-NEWLINE_C     = newline.c
-MINIPRELUDE_C = miniprelude.c
-RBCONFIG      = .rbconfig.time
-
-SRC_FILE      = $<
-OS_SRC_FILE   = $<
-DEST_FILE     = $@
-OS_DEST_FILE  = $@
-
-MESSAGE_BEGIN = @for line in
-MESSAGE_END = ; do echo "$$line"; done
-ECHO_BEGIN = @sep=''; for word in
-ECHO_END = ; do echo @ECHO_N@ "$$sep'$$word'@ECHO_C@"; sep=' '; done; echo
-
-configure_args = @configure_args@
-#### End of variables
-
-.SUFFIXES: .inc .h .c .y .i .$(DTRACE_EXT)
-
-all:
-
-.DEFAULT: all
-
-# Prevent GNU make v3 from overflowing arg limit on SysV.
-.NOEXPORT:
-
-miniruby$(EXEEXT):
-		@-if test -f $@; then $(MV) -f $@ $@.old; $(RM) $@.old; fi
-		$(ECHO) linking $@
-		$(Q) $(PURIFY) $(CC) $(LDFLAGS) $(XLDFLAGS) $(NORMALMAINOBJ) $(MINIOBJS) $(COMMONOBJS) $(DMYEXT) $(DTRACE_OBJ) $(MAINLIBS) $(LIBS) $(OUTFLAG)$@
-
-$(PROGRAM):
-		@$(RM) $@
-		$(ECHO) linking $@
-		$(Q) $(PURIFY) $(CC) $(LDFLAGS) $(XLDFLAGS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBYARG) $(MAINLIBS) $(LIBS) $(EXTLIBS) $(OUTFLAG)$@
-		$(Q) $(POSTLINK)
-
-# We must `rm' the library each time this rule is invoked because "updating" a
-# MAB library on Apple/NeXT (see --enable-fat-binary in configure) is not
-# supported.
-$(LIBRUBY_A):
-		@$(RM) $@
-		$(ECHO) linking static-library $@
-		$(Q) $(AR) $(ARFLAGS) $@ $(LIBRUBY_A_OBJS) $(DMYEXT)
-		@-$(RANLIB) $@ 2> /dev/null || true
-		$(ECHO) verifying static-library $@
-		@$(PURIFY) $(CC) $(XLDFLAGS) $(MAINOBJ) $(LIBRUBY_A) $(MAINLIBS) $(EXTLIBS) $(LIBS) $(OUTFLAG)conftest$(EXEEXT) $(LDFLAGS)
-		@$(RM) conftest$(EXEEXT) conftest.c
-
-$(LIBRUBY_SO):
-		@-$(PRE_LIBRUBY_UPDATE)
-		$(ECHO) linking shared-library $@
-		$(Q) $(LDSHARED) $(DLDFLAGS) $(OBJS) $(DLDOBJS) $(DTRACE_OBJ) $(SOLIBS) $(EXTSOLIBS) $(OUTFLAG)$@
-		-$(Q) $(OBJCOPY) -w -L '$(SYMBOL_PREFIX)Init_*' -L '$(SYMBOL_PREFIX)*_threadptr_*' $@
-		$(Q) $(POSTLINK)
-		@-$(MINIRUBY) -e 'ARGV.each{|link| File.delete link rescue nil; \
-						  File.symlink "$(LIBRUBY_SO)", link}' \
-				$(LIBRUBY_ALIASES) || true
-$(arch)-fake.rb: config.status $(srcdir)/template/fake.rb.in
-		@./config.status --file=$@:$(srcdir)/template/fake.rb.in
-		@chmod +x $@
-
-ruby_pc = @ruby_pc@
-$(ruby_pc):
-		@./config.status --file=$@:$(srcdir)/template/ruby.pc.in
-
-install-cross: $(arch)-fake.rb $(RBCONFIG) rbconfig.rb $(arch_hdrdir)/ruby/config.h \
-	$(LIBRUBY_A) $(LIBRUBY_SO) $(ARCHFILE)
-	$(ECHO) installing cross-compiling stuff
-	$(Q) $(MAKEDIRS) $(XRUBY_RUBYLIBDIR)/$(arch) $(XRUBY_RUBYHDRDIR)/$(arch)/ruby
-	$(Q) sed '/^\$$:\.unshift/q' $(arch)-fake.rb > fake.rb
-	$(Q) $(BASERUBY) -p \
-	-e '~/^\s*CONFIG\["LDFLAGS"\]/ and' \
-	-e '$$_[/(?=\s*"$$)/] = %q[ #{(CONFIG["LIBPATHFLAG"]%File.dirname(__FILE__)).strip}]' \
-	rbconfig.rb > fake-rbconfig.rb
-	$(INSTALL_SCRIPT) fake.rb $(XRUBY_RUBYLIBDIR)/$(arch)/fake.rb
-	$(INSTALL_SCRIPT) fake-rbconfig.rb $(XRUBY_RUBYLIBDIR)/$(arch)/rbconfig.rb
-	@$(RM) fake.rb fake-rbconfig.rb
-	$(INSTALL_DATA) $(arch_hdrdir)/ruby/config.h $(XRUBY_RUBYHDRDIR)/$(arch)/ruby
-	$(INSTALL_DATA) $(top_srcdir)/include/ruby/win32.h $(XRUBY_RUBYHDRDIR)/ruby
-	$(INSTALL_DATA) $(LIBRUBY) $(LIBRUBY_A) $(XRUBY_RUBYLIBDIR)/$(arch)
-	$(INSTALL_PROGRAM) $(LIBRUBY_SO) $(XRUBY_RUBYLIBDIR)/$(arch)
-
-Makefile:	$(srcdir)/Makefile.in $(srcdir)/enc/Makefile.in
-
-$(MKFILES): config.status
-		@[ -f Makefile ] && mv Makefile Makefile.old
-		MAKE=$(MAKE) $(SHELL) ./config.status
-		@cmp Makefile Makefile.old > /dev/null 2>&1 && echo Makefile unchanged && exit 0; \
-		{ \
-		    echo "all:; -@rm -f conftest.mk"; \
-		    echo "conftest.mk: .force; @echo AUTO_REMAKE"; \
-		    echo ".force:"; \
-		} > conftest.mk || exit 1; \
-		$(MAKE) -f conftest.mk | grep '^AUTO_REMAKE$$' >/dev/null 2>&1 || \
-		{ echo "Makefile updated, restart."; exit 1; }
-
-uncommon.mk: $(srcdir)/common.mk
-		sed 's/{\$$([^(){}]*)[^{}]*}//g' $< > $@
-
-.PHONY: reconfig
-reconfig-args = $(srcdir)/configure $(configure_args)
-config.status-args = ./config.status --recheck
-reconfig-exec-0 = exec 3>&1; exit `exec 4>&1; { "$$@" 3>&- 4>&-; echo $$? 1>&4; } | fgrep -v '(cached)' 1>&3`
-reconfig-exec-1 = set -x; "$$@"
-
-reconfig config.status:	$(srcdir)/configure $(srcdir)/enc/Makefile.in \
-			$(srcdir)/include/ruby/version.h
-	@PWD= MINIRUBY="$(MINIRUBY)"; export MINIRUBY; \
-	set $(SHELL) $($@-args); $(reconfig-exec-$(V))
-
-$(srcdir)/configure: $(srcdir)/configure.in
-	$(CHDIR) $(srcdir) && exec $(AUTOCONF)
-
-incs: id.h
-all-incs: probes.h
-
-# Things which should be considered:
-# * with gperf v.s. without gperf
-# * committers may have various versions of gperf
-# * ./configure v.s. ../ruby/configure
-# * GNU make v.s. HP-UX make	# HP-UX make invokes the action if lex.c and keywords has same mtime.
-# * svn checkout generate a file with mtime as current time
-# * ext4 and XFS has a mtime with fractional part
-lex.c: defs/keywords
-	@\
-	if cmp -s $(srcdir)/defs/lex.c.src $?; then \
-	  [ $(Q) ] && echo copying $@ || set -x; \
-	  $(CP) $(srcdir)/lex.c.blt $@; \
-	else \
-	  [ $(Q) ] && echo generating $@ || set -x; \
-	  gperf -C -p -j1 -i 1 -g -o -t -N rb_reserved_word -k1,3,$$ $? > $@.tmp && \
-	  $(MV) $@.tmp $@ && \
-	  $(CP) $? $(srcdir)/defs/lex.c.src && \
-	  $(CP) $@ $(srcdir)/lex.c.blt; \
-	fi
-
-NAME2CTYPE_OPTIONS = -7 -c -j1 -i1 -t -C -P -T -H uniname2ctype_hash -Q uniname2ctype_pool -N uniname2ctype_p
-
-enc/unicode/name2ctype.h: enc/unicode/name2ctype.kwd
-	$(MAKEDIRS) $(@D)
-	@set +e; \
-	if cmp -s $(?:.kwd=.src) $?; then \
-	  set -x; \
-	  $(CP) $(?:.kwd=.h.blt) $@; \
-	else \
-	  trap '$(RM) $@-1.h $@-2.h' 0 && \
-	  set -x; \
-	  sed '/^#ifdef USE_UNICODE_PROPERTIES/,/^#endif/d' $? | gperf $(NAME2CTYPE_OPTIONS) > $@-1.h && \
-	  sed '/^#ifdef USE_UNICODE_PROPERTIES/d;/^#endif/d' $? | gperf $(NAME2CTYPE_OPTIONS) > $@-2.h && \
-	  diff -DUSE_UNICODE_PROPERTIES $@-1.h $@-2.h > $@.tmp || :; \
-	  $(MV) $@.tmp $@ && \
-	  $(CP) $? $(?:.kwd=.src) && \
-	  $(CP) $@ $(?:.kwd=.h.blt); \
-	fi
-
-.c.@OBJEXT@:
-	@$(ECHO) compiling $<
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -c $<
-
-.s.@OBJEXT@:
-	@$(ECHO) assembling $<
-	$(Q) $(AS) $(ASFLAGS) -o $@ $<
-
-.c.S:
-	@$(ECHO) translating $<
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -S $<
-
-.c.i:
-	@$(ECHO) preprocessing $<
-	$(Q) $(CPP) $(warnflags) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -E $< > $@
-
-.d.h:
-	@$(ECHO) translating probes $<
-	$(Q) $(DTRACE) -o $@.tmp -h -C $(INCFLAGS) -s $<
-	$(Q) sed -e 's/RUBY_/RUBY_DTRACE_/g' -e 's/PROBES_H_TMP/PROBES_H/g' -e 's/(char \*/(const char */g' -e 's/, char \*/, const char */g' $@.tmp > $@
-	$(Q) $(RM) $@.tmp
-
-.dmyh.h:
-	@$(ECHO) copying dummy $(DEST_FILE)
-	$(Q) $(CP) $(OS_SRC_FILE) $(OS_DEST_FILE)
-
-probes.@OBJEXT@: $(srcdir)/probes.d
-	@$(ECHO) processing probes in object files
-	$(Q) stamp="$*.stamp"; \
-	  if test -f "$$stamp" -o -f "$@"; then \
-	  $(RM) $(DTRACE_DEPENDENT_OBJS) "$$stamp"; \
-	  for o in $(DTRACE_DEPENDENT_OBJS); do \
-	    echo "rebuilding $$o which was modified by \"dtrace -G\""; \
-	    $(MAKE) "$$o"; \
-	  done; \
-	fi; \
-	touch "$$stamp"
-	$(RM) $@
-	$(Q) $(DTRACE) -G -C $(INCFLAGS) -s $(srcdir)/probes.d -o $@ $(DTRACE_DEPENDENT_OBJS)
-
-# DTrace static library hacks described here:
-# http://mail.opensolaris.org/pipermail/dtrace-discuss/2005-August/000207.html
-ruby-glommed.$(OBJEXT):
-	@$(ECHO) generating a glommed object with DTrace probes for static library
-	$(Q) $(LD) -r -o $@ $(OBJS) $(DTRACE_OBJ)
-
-clean-local::
-	$(Q)$(RM) ext/extinit.c ext/extinit.$(OBJEXT) ext/ripper/y.output \
-		enc/encinit.c enc/encinit.$(OBJEXT)
-	-$(Q)$(RM) $(pkgconfig_DATA)
-
-distclean-local::
-	$(Q)$(RM) ext/config.cache $(RBCONFIG) Doxyfile
-	-$(Q)$(RM) run.gdb
-	-$(Q)$(RM) $(INSTALLED_LIST) $(arch_hdrdir)/ruby/config.h verconf.h
-	-$(Q)$(RMDIRS) $(arch_hdrdir)/ruby 2> /dev/null || true
-
-clean-ext distclean-ext realclean-ext::
-	@cd ext 2>/dev/null || exit 0; set dummy `echo "${EXTS}" | tr , ' '`; shift; \
-	test "$$#" = 0 && set .; \
-	set dummy `\
-	    find "$$@" -name Makefile -print | sed 's:^\./::;s:/Makefile$$:~:' | sort | sed 's:~$$::'; \
-	`; shift; \
-	cd ..; \
-	for dir do \
-	    echo $(@:-ext=)ing "$$dir"; \
-	    (cd "ext/$$dir" && exec $(MAKE) $(MFLAGS) $(@:-ext=)) && \
-	    case "$@" in \
-	    *distclean-ext*|*realclean-ext*) \
-		$(RMDIRS) "ext/$$dir" 2> /dev/null || true;; \
-	    esac; \
-	done
-	-$(Q)$(RM) ext/extinit.$(OBJEXT)
-
-distclean-ext realclean-ext::
-	-$(Q)$(RM) ext/extinit.c
-	-$(Q)$(RMDIR) ext 2> /dev/null || true
-
-clean-extout:
-	-$(Q)$(RMDIRS) $(EXTOUT) 2> /dev/null || true
-
-clean-enc distclean-enc realclean-enc:
-	@test -f "$(ENC_MK)" || exit 0; \
-	echo $(@:-enc=ing) encodings; \
-	exec $(MAKE) -f $(ENC_MK) $(MFLAGS) $(@:-enc=)
-
-clean-rdoc distclean-rdoc realclean-rdoc:
-	@echo $(@:-rdoc=ing) rdoc
-	$(Q)$(RMALL) $(RDOCOUT)
-clean-capi distclean-capi realclean-capi:
-	@echo $(@:-capi=ing) capi
-	$(Q)$(RMALL) $(CAPIOUT)
-
-clean-platform:
-	@$(RM) $(PLATFORM_D)
-	-$(Q) $(RMDIR) $(PLATFORM_DIR) 2> /dev/null || true
-
-ext/extinit.$(OBJEXT): ext/extinit.c $(SETUP)
-	$(ECHO) compiling $@
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -c ext/extinit.c
-
-enc/encinit.$(OBJEXT): enc/encinit.c $(SETUP)
-
-up::
-	@$(CHDIR) "$(srcdir)" && LC_TIME=C exec $(VCSUP)
-
-up::
-	-$(Q)$(MAKE) $(MFLAGS) after-update
-
-after-update:: update-config_files
-
-update-mspec:
-	@$(CHDIR) $(srcdir); \
-	if [ -d spec/mspec ]; then \
-	  cd spec/mspec; \
-	  echo updating mspec ...; \
-	  exec git pull; \
-	else \
-	  echo retrieving mspec ...; \
-	  exec git clone $(MSPEC_GIT_URL) spec/mspec; \
-	fi
-
-update-rubyspec: update-mspec
-	@$(CHDIR) $(srcdir); \
-	if [ -d spec/rubyspec ]; then \
-	  cd spec/rubyspec; \
-	  echo updating rubyspec ...; \
-	  exec git pull; \
-	else \
-	  echo retrieving rubyspec ...; \
-	  exec git clone $(RUBYSPEC_GIT_URL) spec/rubyspec; \
-	fi
-
-test-rubyspec-precheck:
-	@if [ ! -d $(srcdir)/spec/rubyspec ]; then echo No rubyspec here.  make update-rubyspec first.; exit 1; fi
-
-INSNS	= opt_sc.inc optinsn.inc optunifs.inc insns.inc insns_info.inc \
-	  vmtc.inc vm.inc
-
-$(INSNS): $(srcdir)/insns.def vm_opts.h \
-	  $(srcdir)/defs/opt_operand.def $(srcdir)/defs/opt_insn_unif.def \
-	  $(srcdir)/tool/instruction.rb $(srcdir)/tool/insns2vm.rb
-	$(ECHO) generating $@
-	$(Q) $(BASERUBY) -Ku $(srcdir)/tool/insns2vm.rb $(INSNS2VMOPT) $@
-
-loadpath: verconf.h
-	@$(CPP) $(XCFLAGS) $(CPPFLAGS) $(srcdir)/loadpath.c | \
-	sed -e '1,/^const char ruby_initial_load_paths/d;/;/,$$d' \
-	    -e '/^ /!d;s/ *"\\0"$$//;s/" *"//g'
diff --git a/NEWS b/NEWS
deleted file mode 100644
index d27ad0be0b..0000000000
--- a/NEWS
+++ /dev/null
@@ -1,184 +0,0 @@
-# -*- rdoc -*-
-
-= NEWS for Ruby 2.1.0
-
-This document is a list of user visible feature changes made between
-releases except for bug fixes.
-
-Note that each entry is kept so brief that no reason behind or
-reference information is supplied with.  For a full list of changes
-with all sufficient information, see the ChangeLog file.
-
-== Changes since the 2.0.0 release
-
-=== Language changes
-
-* Added integer and float literals: 'r', 'i', and 'ri'.
-  * "42r" and "3.14r" are evaluated as Rational(42, 1) and 3.14.rationalize,
-    respectively.  But exponential form with 'r' suffix like "6.022e+23r" is
-    not accepted because it is misleading.
-  * "42i" and "3.14i" are evaluated as Complex(0, 42) and Complex(0, 3.14),
-    respectively.
-  * "42ri" and "3.14ri" are evaluated as Complex(0, 42r) and Complex(0, 3.14r),
-    respectively.
-
-=== Core classes updates (outstanding ones only)
-
-* GC
-  * added environment variable:
-    * RUBY_HEAP_SLOTS_GROWTH_FACTOR: growth rate of the heap.
-
-* IO
-  * extended methods:
-    * IO#seek supports SEEK_DATA and SEEK_HOLE as whence.
-    * IO#seek accepts symbols (:CUR, :END, :SET, :DATA, :HOLE) for 2nd argument.
-
-* Kernel
-  * New methods:
-    * Kernel#singleton_method
-
-* Module
-  * New methods:
-    * Module#using, which activates refinements of the specified module only
-      in the current class or module definition.
-  * extended methods:
-    * Module#refine is no longer experimental.
-
-* Mutex
-  * misc
-    * Mutex#owned? is no longer experimental.
-
-* String
-  * New methods:
-    * String#scrub and String#scrub! verify and fix invalid byte sequence.
-  * extended methods:
-    * If invalid: :replace is specified for String#encode, replace
-      invalid byte sequence even if the destination encoding equals to
-      the source encoding.
-
-* pack/unpack (Array/String)
-  * Q! and q! directives for long long type if platform has the type.
-
-* toplevel
-  * extended methods:
-    * main.using is no longer experimental. The method activates refinements
-      in the ancestors of the argument module to support refinement
-      inheritance by Module#include.
-
-=== Core classes compatibility issues (excluding feature bug fixes)
-
-* IO
-  * incompatible changes:
-    * open ignore internal encoding if external encoding is ASCII-8BIT.
-
-* Kernel#untrusted?, untrust, and trust
-  * These methods are deprecated and their behavior is same as tainted?,
-    taint, and untaint, respectively.  If $VERBOSE is true, they show warnings.
-
-* Module#ancestors
-  * The ancestors of a singleton class now include singleton classes,
-    in particular itself.
-
-* Numeric#quo
-  * Raises TypeError instead of ArgumentError if the receiver doesn't have
-    to_r method.
-
-=== Stdlib updates (outstanding ones only)
-
-* Digest
-  * extended methods:
-    * Digest::Class.file takes optional arguments for its constructor
-
-* Matrix
-  * Added Vector#cross_product.
-
-* Net::SMTP
-  * Added Net::SMTP#rset to implement the RSET command
-
-* Pathname
-  * New methods:
-    * Pathname#write
-    * Pathname#binwrite
-
-* OpenSSL::BN
-  * extended methods:
-    * OpenSSL::BN.new allows Fixnum/Bignum argument.
-
-* open-uri
-  * Support multiple fields with same field name (like Set-Cookie).
-
-* Resolv
-  * New methods:
-    * Resolv::DNS.fetch_resource
-  * One-shot multicast DNS support
-  * Support LOC resources
-
-* Rinda::RingServer, Rinda::RingFinger
-  * Rinda now supports multicast sockets.  See Rinda::RingServer and
-    Rinda::RingFinger for details.
-
-* RubyGems
-  * Updated to 2.0.3.  See
-    http://rubygems.rubyforge.org/rubygems-update/History_txt.html#label-2.0.3+%2F+2012-03-1
-    for release notes.
-
-* Socket
-  * New methods:
-    * Socket.getifaddrs
-
-* StringScanner
-  * extended methods:
-    * StringScanner#[] supports named captures.
-
-* Syslog::Logger
-  * Added facility.
-
-* Tempfile
-  * New methods:
-    * Tempfile.create
-
-* CGI::Util
-  * All class methods modulized.
-
-* XMLRPC::Client
-  * New methods:
-    * XMLRPC::Client#http. It returns Net::HTTP for the client. Normally,
-      it is not needed. It is useful when you want to change minor HTTP client
-      options. You can change major HTTP client options by XMLRPC::Client
-      methods. You should use XMLRPC::Client methods for changing major
-      HTTP client options instead of XMLRPC::Client#http.
-
-* REXML::Parsers::StreamParser
-  * Supports "entity" event.
-
-* REXML::Text
-  * REXML::Text#<< supports method chain like 'text << "XXX" << "YYY"'.
-  * REXML::Text#<< supports not "raw" mode.
-
-* Set
-  * New methods:
-    * Set#intersect?
-    * Set#disjoint?
-
-=== Stdlib compatibility issues (excluding feature bug fixes)
-
-* Set
-  * incompatible changes:
-    * Set#to_set now returns self instead of generating a copy.
-
-* URI
-  * incompatible changes:
-    * URI.decode_www_form follows current WHATWG URL Standard.
-      It gets encoding argument to specify the character encoding.
-      It now allows loose percent encoded strings, but denies ;-separator.
-    * URI.encode_www_form follows current WHATWG URL Standard.
-      It gets encoding argument to convert before percent encode.
-      UTF-16 strings aren't converted to UTF-8 before percent encode by default.
-
-=== Built-in global variables compatibility issues
-
-* $SAFE
-  * $SAFE=4 is obsolete.  If $SAFE is set to 4 or larger, an ArgumentError
-    is raised.
-
-=== C API updates
diff --git a/NEWS.md b/NEWS.md
new file mode 100644
index 0000000000..f6c3c6fc97
--- /dev/null
+++ b/NEWS.md
@@ -0,0 +1,820 @@
+# NEWS for Ruby 3.2.0
+
+This document is a list of user-visible feature changes
+since the **3.1.0** release, except for bug fixes.
+
+Note that each entry is kept to a minimum, see links for details.
+
+## Language changes
+
+* Anonymous rest and keyword rest arguments can now be passed as
+  arguments, instead of just used in method parameters.
+  [[Feature #18351]]
+
+    ```ruby
+    def foo(*)
+      bar(*)
+    end
+    def baz(**)
+      quux(**)
+    end
+    ```
+
+* A proc that accepts a single positional argument and keywords will
+  no longer autosplat. [[Bug #18633]]
+
+    ```ruby
+    proc{|a, **k| a}.call([1, 2])
+    # Ruby 3.1 and before
+    # => 1
+    # Ruby 3.2 and after
+    # => [1, 2]
+    ```
+
+* Constant assignment evaluation order for constants set on explicit
+  objects has been made consistent with single attribute assignment
+  evaluation order. With this code:
+
+    ```ruby
+    foo::BAR = baz
+    ```
+
+    `foo` is now called before `baz`. Similarly, for multiple assignments
+    to constants,  left-to-right evaluation order is used. With this
+    code:
+
+    ```ruby
+    foo1::BAR1, foo2::BAR2 = baz1, baz2
+    ```
+
+    The following evaluation order is now used:
+
+    1. `foo1`
+    2. `foo2`
+    3. `baz1`
+    4. `baz2`
+
+    [[Bug #15928]]
+
+* "Find pattern" is no longer experimental.
+  [[Feature #18585]]
+
+* Methods taking a rest parameter (like `*args`) and wishing to delegate keyword
+  arguments through `foo(*args)` must now be marked with `ruby2_keywords`
+  (if not already the case). In other words, all methods wishing to delegate
+  keyword arguments through `*args` must now be marked with `ruby2_keywords`,
+  with no exception. This will make it easier to transition to other ways of
+  delegation once a library can require Ruby 3+. Previously, the `ruby2_keywords`
+  flag was kept if the receiving method took `*args`, but this was a bug and an
+  inconsistency. A good technique to find the potentially-missing `ruby2_keywords`
+  is to run the test suite, for where it fails find the last method which must
+  receive keyword arguments, use `puts nil, caller, nil` there, and check each
+  method/block on the call chain which must delegate keywords is correctly marked
+  as `ruby2_keywords`. [[Bug #18625]] [[Bug #16466]]
+
+    ```ruby
+    def target(**kw)
+    end
+
+    # Accidentally worked without ruby2_keywords in Ruby 2.7-3.1, ruby2_keywords
+    # needed in 3.2+. Just like (*args, **kwargs) or (...) would be needed on
+    # both #foo and #bar when migrating away from ruby2_keywords.
+    ruby2_keywords def bar(*args)
+      target(*args)
+    end
+
+    ruby2_keywords def foo(*args)
+      bar(*args)
+    end
+
+    foo(k: 1)
+    ```
+
+## Core classes updates
+
+Note: We're only listing outstanding class updates.
+
+* Fiber
+
+    * Introduce Fiber.[] and Fiber.[]= for inheritable fiber storage.
+      Introduce Fiber#storage and Fiber#storage= (experimental) for
+      getting and resetting the current storage.  Introduce
+      `Fiber.new(storage:)` for setting the storage when creating a
+      fiber. [[Feature #19078]]
+
+        Existing Thread and Fiber local variables can be tricky to use.
+        Thread-local variables are shared between all fibers, making it
+        hard to isolate, while Fiber-local variables can be hard to
+        share.  It is often desirable to define unit of execution
+        ("execution context") such that some state is shared between all
+        fibers and threads created in that context.  This is what Fiber
+        storage provides.
+
+        ```ruby
+        def log(message)
+          puts "#{Fiber[:request_id]}: #{message}"
+        end
+
+        def handle_requests
+          while request = read_request
+            Fiber.schedule do
+              Fiber[:request_id] = SecureRandom.uuid
+
+              request.messages.each do |message|
+                Fiber.schedule do
+                  log("Handling #{message}") # Log includes inherited request_id.
+                end
+              end
+            end
+          end
+        end
+        ```
+
+        You should generally consider Fiber storage for any state which
+        you want to be shared implicitly between all fibers and threads
+        created in a given context, e.g. a connection pool, a request
+        id, a logger level, environment variables, configuration, etc.
+
+* Fiber::Scheduler
+
+    * Introduce `Fiber::Scheduler#io_select` for non-blocking IO.select.
+      [[Feature #19060]]
+
+* IO
+
+    * Introduce IO#timeout= and IO#timeout which can cause
+      IO::TimeoutError to be raised if a blocking operation exceeds the
+      specified timeout. [[Feature #18630]]
+
+        ```ruby
+        STDIN.timeout = 1
+        STDIN.read # => Blocking operation timed out! (IO::TimeoutError)
+        ```
+
+    * Introduce `IO.new(..., path:)` and promote `File#path` to `IO#path`.
+      [[Feature #19036]]
+
+* Class
+
+    * Class#attached_object, which returns the object for which
+      the receiver is the singleton class. Raises TypeError if the
+      receiver is not a singleton class.
+      [[Feature #12084]]
+
+        ```ruby
+        class Foo; end
+
+        Foo.singleton_class.attached_object        #=> Foo
+        Foo.new.singleton_class.attached_object    #=> #<Foo:0x000000010491a370>
+        Foo.attached_object                        #=> TypeError: `Foo' is not a singleton class
+        nil.singleton_class.attached_object        #=> TypeError: `NilClass' is not a singleton class
+        ```
+
+* Data
+
+    * New core class to represent simple immutable value object. The class is
+      similar to Struct and partially shares an implementation, but has more
+      lean and strict API. [[Feature #16122]]
+
+        ```ruby
+        Measure = Data.define(:amount, :unit)
+        distance = Measure.new(100, 'km')            #=> #<data Measure amount=100, unit="km">
+        weight = Measure.new(amount: 50, unit: 'kg') #=> #<data Measure amount=50, unit="kg">
+        weight.with(amount: 40)                      #=> #<data Measure amount=40, unit="kg">
+        weight.amount                                #=> 50
+        weight.amount = 40                           #=> NoMethodError: undefined method `amount='
+        ```
+
+* Encoding
+
+    * Encoding#replicate has been deprecated and will be removed in 3.3. [[Feature #18949]]
+    * The dummy `Encoding::UTF_16` and `Encoding::UTF_32` encodings no longer
+      try to dynamically guess the endian based on a byte order mark.
+      Use `Encoding::UTF_16BE`/`UTF_16LE` and `Encoding::UTF_32BE`/`UTF_32LE` instead.
+      This change speeds up getting the encoding of a String. [[Feature #18949]]
+    * Limit maximum encoding set size by 256.
+      If exceeding maximum size, `EncodingError` will be raised. [[Feature #18949]]
+
+* Enumerator
+
+    * Enumerator.product has been added.  Enumerator::Product is the implementation. [[Feature #18685]]
+
+* Exception
+
+    * Exception#detailed_message has been added.
+      The default error printer calls this method on the Exception object
+      instead of #message. [[Feature #18564]]
+
+* Hash
+
+    * Hash#shift now always returns nil if the hash is
+      empty, instead of returning the default value or
+      calling the default proc. [[Bug #16908]]
+
+* Integer
+
+    * Integer#ceildiv has been added. [[Feature #18809]]
+
+* Kernel
+
+    * Kernel#binding raises RuntimeError if called from a non-Ruby frame
+      (such as a method defined in C). [[Bug #18487]]
+
+* MatchData
+
+    * MatchData#byteoffset has been added. [[Feature #13110]]
+    * MatchData#deconstruct has been added. [[Feature #18821]]
+    * MatchData#deconstruct_keys has been added. [[Feature #18821]]
+
+* Module
+
+    * Module.used_refinements has been added. [[Feature #14332]]
+    * Module#refinements has been added. [[Feature #12737]]
+    * Module#const_added has been added. [[Feature #17881]]
+    * Module#undefined_instance_methods has been added. [[Feature #12655]]
+
+* Proc
+
+    * Proc#dup returns an instance of subclass. [[Bug #17545]]
+    * Proc#parameters now accepts lambda keyword. [[Feature #15357]]
+
+* Process
+    * Added `RLIMIT_NPTS` constant to FreeBSD platform
+
+* Regexp
+
+    * The cache-based optimization is introduced.
+      Many (but not all) Regexp matching is now in linear time, which
+      will prevent regular expression denial of service (ReDoS)
+      vulnerability. [[Feature #19104]]
+
+    * Regexp.linear_time? is introduced. [[Feature #19194]]
+
+    * Regexp.new now supports passing the regexp flags not only as an Integer,
+      but also as a String.  Unknown flags raise ArgumentError.
+      Otherwise, anything other than `true`, `false`, `nil` or Integer will be warned.
+      [[Feature #18788]]
+
+    * Regexp.timeout= has been added. Also, Regexp.new new supports timeout keyword.
+      See [[Feature #17837]]
+
+* Refinement
+
+    * Refinement#refined_class has been added. [[Feature #12737]]
+
+* RubyVM::AbstractSyntaxTree
+
+    * Add `error_tolerant` option for `parse`, `parse_file` and `of`. [[Feature #19013]]
+      With this option
+
+        1. SyntaxError is suppressed
+        2. AST is returned for invalid input
+        3. `end` is complemented when a parser reaches to the end of input but `end` is insufficient
+        4. `end` is treated as keyword based on indent
+
+        ```ruby
+        # Without error_tolerant option
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY)
+        def m
+          a = 10
+          if
+        end
+        RUBY
+        # => <internal:ast>:33:in `parse': syntax error, unexpected `end' (SyntaxError)
+
+        # With error_tolerant option
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY, error_tolerant: true)
+        def m
+          a = 10
+          if
+        end
+        RUBY
+        p root # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-4:3>
+
+        # `end` is treated as keyword based on indent
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY, error_tolerant: true)
+        module Z
+          class Foo
+            foo.
+          end
+
+          def bar
+          end
+        end
+        RUBY
+        p root.children[-1].children[-1].children[-1].children[-2..-1]
+        # => [#<RubyVM::AbstractSyntaxTree::Node:CLASS@2:2-4:5>, #<RubyVM::AbstractSyntaxTree::Node:DEFN@6:2-7:5>]
+        ```
+
+    * Add `keep_tokens` option for `parse`, `parse_file` and `of`. Add `#tokens` and `#all_tokens`
+      for RubyVM::AbstractSyntaxTree::Node [[Feature #19070]]
+
+        ```ruby
+        root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+        root.tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+        root.tokens.map{_1[2]}.join # => "x = 1 + 2"
+        ```
+
+* Set
+
+    * Set is now available as a built-in class without the need for `require "set"`. [[Feature #16989]]
+      It is currently autoloaded via the Set constant or a call to Enumerable#to_set.
+
+* String
+
+    * String#byteindex and String#byterindex have been added. [[Feature #13110]]
+    * Update Unicode to Version 15.0.0 and Emoji Version 15.0. [[Feature #18639]]
+      (also applies to Regexp)
+    * String#bytesplice has been added.  [[Feature #18598]]
+    * String#dedup has been added as an alias to String#-@.  [[Feature #18595]]
+
+* Struct
+
+    * A Struct class can also be initialized with keyword arguments
+      without `keyword_init: true` on Struct.new [[Feature #16806]]
+
+        ```ruby
+        Post = Struct.new(:id, :name)
+        Post.new(1, "hello") #=> #<struct Post id=1, name="hello">
+        # From Ruby 3.2, the following code also works without keyword_init: true.
+        Post.new(id: 1, name: "hello") #=> #<struct Post id=1, name="hello">
+        ```
+
+* Thread
+
+    * Thread.each_caller_location is added. [[Feature #16663]]
+
+* Thread::Queue
+
+    * Thread::Queue#pop(timeout: sec) is added. [[Feature #18774]]
+
+* Thread::SizedQueue
+
+    * Thread::SizedQueue#pop(timeout: sec) is added. [[Feature #18774]]
+    * Thread::SizedQueue#push(timeout: sec) is added. [[Feature #18944]]
+
+* Time
+
+    * Time#deconstruct_keys is added, allowing to use Time instances
+      in pattern-matching expressions [[Feature #19071]]
+
+    * Time.new now can parse a string like generated by Time#inspect
+      and return a Time instance based on the given argument.
+      [[Feature #18033]]
+
+* SyntaxError
+    * SyntaxError#path has been added.  [[Feature #19138]]
+
+* TracePoint
+
+    * TracePoint#binding now returns `nil` for `c_call`/`c_return` TracePoints.
+      [[Bug #18487]]
+    * TracePoint#enable `target_thread` keyword argument now defaults to the
+      current thread if a block is given and `target` and `target_line` keyword
+      arguments are not passed. [[Bug #16889]]
+
+* UnboundMethod
+
+    * `UnboundMethod#==` returns `true` if the actual method is same. For example,
+      `String.instance_method(:object_id) == Array.instance_method(:object_id)`
+      returns `true`. [[Feature #18798]]
+
+    * `UnboundMethod#inspect` does not show the receiver of `instance_method`.
+      For example `String.instance_method(:object_id).inspect` returns
+      `"#<UnboundMethod: Kernel#object_id()>"`
+      (was `"#<UnboundMethod: String(Kernel)#object_id()>"`).
+
+* GC
+
+    * Expose `need_major_gc` via `GC.latest_gc_info`. [GH-6791]
+
+* ObjectSpace
+
+    * `ObjectSpace.dump_all` dump shapes as well. [GH-6868]
+
+## Stdlib updates
+
+* Bundler
+
+    * Bundler now uses [PubGrub] resolver instead of [Molinillo] for performance improvement.
+    * Add --ext=rust support to bundle gem for creating simple gems with Rust extensions.
+      [[GH-rubygems-6149]]
+    * Make cloning git repos faster [[GH-rubygems-4475]]
+
+* RubyGems
+
+    * Add mswin support for cargo builder. [[GH-rubygems-6167]]
+
+* CGI
+
+    * `CGI.escapeURIComponent` and `CGI.unescapeURIComponent` are added.
+      [[Feature #18822]]
+
+* Coverage
+
+    * `Coverage.setup` now accepts `eval: true`. By this, `eval` and related methods are
+      able to generate code coverage. [[Feature #19008]]
+
+    * `Coverage.supported?(mode)` enables detection of what coverage modes are
+      supported. [[Feature #19026]]
+
+* Date
+
+    * Added `Date#deconstruct_keys` and `DateTime#deconstruct_keys` same as [[Feature #19071]]
+
+* ERB
+
+    * `ERB::Util.html_escape` is made faster than `CGI.escapeHTML`.
+        * It no longer allocates a String object when no character needs to be escaped.
+        * It skips calling `#to_s` method when an argument is already a String.
+        * `ERB::Escape.html_escape` is added as an alias to `ERB::Util.html_escape`,
+          which has not been monkey-patched by Rails.
+    * `ERB::Util.url_encode` is made faster using `CGI.escapeURIComponent`.
+    * `-S` option is removed from `erb` command.
+
+* FileUtils
+
+    * Add FileUtils.ln_sr method and `relative:` option to FileUtils.ln_s.
+      [[Feature #18925]]
+
+* IRB
+
+    * debug.gem integration commands have been added: `debug`, `break`, `catch`,
+      `next`, `delete`, `step`, `continue`, `finish`, `backtrace`, `info`
+        * They work even if you don't have `gem "debug"` in your Gemfile.
+        * See also: [What's new in Ruby 3.2's IRB?](https://st0012.dev/whats-new-in-ruby-3-2-irb)
+    * More Pry-like commands and features have been added.
+        * `edit` and `show_cmds` (like Pry's `help`) are added.
+        * `ls` takes `-g` or `-G` option to filter out outputs.
+        * `show_source` is aliased from `$` and accepts unquoted inputs.
+        * `whereami` is aliased from `@`.
+
+* Net::Protocol
+
+    * Improve `Net::BufferedIO` performance. [[GH-net-protocol-14]]
+
+* Pathname
+
+    * Added `Pathname#lutime`. [[GH-pathname-20]]
+
+* Socket
+
+    * Added the following constants for supported platforms.
+        * `SO_INCOMING_CPU`
+        * `SO_INCOMING_NAPI_ID`
+        * `SO_RTABLE`
+        * `SO_SETFIB`
+        * `SO_USER_COOKIE`
+        * `TCP_KEEPALIVE`
+        * `TCP_CONNECTION_INFO`
+
+* SyntaxSuggest
+
+    * The feature of `syntax_suggest` formerly `dead_end` is integrated in Ruby.
+      [[Feature #18159]]
+
+* UNIXSocket
+
+    * Add support for UNIXSocket on Windows. Emulate anonymous sockets. Add
+      support for File.socket? and File::Stat#socket? where possible.
+      [[Feature #19135]]
+
+*   The following default gems are updated.
+
+    * RubyGems 3.4.1
+    * abbrev 0.1.1
+    * benchmark 0.2.1
+    * bigdecimal 3.1.3
+    * bundler 2.4.1
+    * cgi 0.3.6
+    * csv 3.2.6
+    * date 3.3.3
+    * delegate 0.3.0
+    * did_you_mean 1.6.3
+    * digest 3.1.1
+    * drb 2.1.1
+    * english 0.7.2
+    * erb 4.0.2
+    * error_highlight 0.5.1
+    * etc 1.4.2
+    * fcntl 1.0.2
+    * fiddle 1.1.1
+    * fileutils 1.7.0
+    * forwardable 1.3.3
+    * getoptlong 0.2.0
+    * io-console 0.6.0
+    * io-nonblock 0.2.0
+    * io-wait 0.3.0
+    * ipaddr 1.2.5
+    * irb 1.6.2
+    * json 2.6.3
+    * logger 1.5.3
+    * mutex_m 0.1.2
+    * net-http 0.4.0
+    * net-protocol 0.2.1
+    * nkf 0.1.2
+    * open-uri 0.3.0
+    * open3 0.1.2
+    * openssl 3.1.0
+    * optparse 0.3.1
+    * ostruct 0.5.5
+    * pathname 0.2.1
+    * pp 0.4.0
+    * pstore 0.1.2
+    * psych 5.0.1
+    * racc 1.6.2
+    * rdoc 6.5.0
+    * readline-ext 0.1.5
+    * reline 0.3.2
+    * resolv 0.2.2
+    * resolv-replace 0.1.1
+    * securerandom 0.2.2
+    * set 1.0.3
+    * stringio 3.0.4
+    * strscan 3.0.5
+    * syntax_suggest 1.0.2
+    * syslog 0.1.1
+    * tempfile 0.1.3
+    * time 0.2.1
+    * timeout 0.3.1
+    * tmpdir 0.1.3
+    * tsort 0.1.1
+    * un 0.2.1
+    * uri 0.12.0
+    * weakref 0.1.2
+    * win32ole 1.8.9
+    * yaml 0.2.1
+    * zlib 3.0.0
+
+*   The following bundled gems are updated.
+
+    * minitest 5.16.3
+    * power_assert 2.0.3
+    * test-unit 3.5.7
+    * net-ftp 0.2.0
+    * net-imap 0.3.4
+    * net-pop 0.1.2
+    * net-smtp 0.3.3
+    * rbs 2.8.2
+    * typeprof 0.21.3
+    * debug 1.7.1
+
+See GitHub releases like [GitHub Releases of Logger](https://github.com/ruby/logger/releases) or changelog for details of the default gems or bundled gems.
+
+## Supported platforms
+
+* WebAssembly/WASI is added. See [wasm/README.md] and [ruby.wasm] for more details. [[Feature #18462]]
+
+## Compatibility issues
+
+* `String#to_c` currently treat a sequence of underscores as an end of Complex
+  string. [[Bug #19087]]
+
+* Now `ENV.clone` raises `TypeError` as well as `ENV.dup` [[Bug #17767]]
+
+### Removed constants
+
+The following deprecated constants are removed.
+
+* `Fixnum` and `Bignum` [[Feature #12005]]
+* `Random::DEFAULT` [[Feature #17351]]
+* `Struct::Group`
+* `Struct::Passwd`
+
+### Removed methods
+
+The following deprecated methods are removed.
+
+* `Dir.exists?` [[Feature #17391]]
+* `File.exists?` [[Feature #17391]]
+* `Kernel#=~` [[Feature #15231]]
+* `Kernel#taint`, `Kernel#untaint`, `Kernel#tainted?`
+  [[Feature #16131]]
+* `Kernel#trust`, `Kernel#untrust`, `Kernel#untrusted?`
+  [[Feature #16131]]
+* `Method#public?`, `Method#private?`, `Method#protected?`,
+  `UnboundMethod#public?`, `UnboundMethod#private?`, `UnboundMethod#protected?`
+  [[Bug #18729]] [[Bug #18751]] [[Bug #18435]]
+
+### Source code incompatibility of extension libraries
+
+* Extension libraries provide PRNG, subclasses of Random, need updates.
+  See [PRNG update] below for more information. [[Bug #19100]]
+
+### Error printer
+
+* Ruby no longer escapes control characters and backslashes in an
+  error message. [[Feature #18367]]
+
+### Constant lookup when defining a class/module
+
+* When defining a class/module directly under the Object class by class/module
+  statement, if there is already a class/module defined by `Module#include`
+  with the same name, the statement was handled as "open class" in Ruby 3.1 or before.
+  Since Ruby 3.2, a new class is defined instead. [[Feature #18832]]
+
+## Stdlib compatibility issues
+
+* Psych no longer bundles libyaml sources.
+  And also Fiddle no longer bundles libffi sources.
+  Users need to install the libyaml/libffi library themselves via the package
+  manager like apt, yum, brew, etc.
+
+    Psych and fiddle supported the static build with specific version of libyaml
+    and libffi sources. You can build psych with libyaml-0.2.5 like this.
+
+    ```bash
+    $ ./configure --with-libyaml-source-dir=/path/to/libyaml-0.2.5
+    ```
+
+    And you can build fiddle with libffi-3.4.4 like this.
+
+    ```bash
+    $ ./configure --with-libffi-source-dir=/path/to/libffi-3.4.4
+    ```
+
+    [[Feature #18571]]
+
+* Check cookie name/path/domain characters in `CGI::Cookie`. [[CVE-2021-33621]]
+
+* `URI.parse` return empty string in host instead of nil. [[sec-156615]]
+
+## C API updates
+
+### Updated C APIs
+
+The following APIs are updated.
+
+* PRNG update
+
+    `rb_random_interface_t` in ruby/random.h updated and versioned.
+    Extension libraries which use this interface and built for older
+    versions need to rebuild with adding `init_int32` function.
+
+### Added C APIs
+
+* `VALUE rb_hash_new_capa(long capa)` was added to created hashes with the desired capacity.
+* `rb_internal_thread_add_event_hook` and `rb_internal_thread_add_event_hook` were added to instrument threads scheduling.
+  The following events are available:
+    * `RUBY_INTERNAL_THREAD_EVENT_STARTED`
+    * `RUBY_INTERNAL_THREAD_EVENT_READY`
+    * `RUBY_INTERNAL_THREAD_EVENT_RESUMED`
+    * `RUBY_INTERNAL_THREAD_EVENT_SUSPENDED`
+    * `RUBY_INTERNAL_THREAD_EVENT_EXITED`
+* `rb_debug_inspector_current_depth` and `rb_debug_inspector_frame_depth` are added for debuggers.
+
+### Removed C APIs
+
+The following deprecated APIs are removed.
+
+* `rb_cData` variable.
+* "taintedness" and "trustedness" functions. [[Feature #16131]]
+
+## Implementation improvements
+
+* Fixed several race conditions in Kernel#autoload. [[Bug #18782]]
+* Cache invalidation for expressions referencing constants is now
+  more fine-grained. `RubyVM.stat(:global_constant_state)` was
+  removed because it was closely tied to the previous caching scheme
+  where setting any constant invalidates all caches in the system.
+  New keys, `:constant_cache_invalidations` and `:constant_cache_misses`,
+  were introduced to help with use cases for `:global_constant_state`.
+  [[Feature #18589]]
+* The cache-based optimization for Regexp matching is introduced.
+  [[Feature #19104]]
+* [Variable Width Allocation](https://shopify.engineering/ruby-variable-width-allocation)
+  is now enabled by default. [[Feature #18239]]
+* Added a new instance variable caching mechanism, called object shapes, which
+  improves inline cache hits for most objects and allows us to generate very
+  efficient JIT code. Objects whose instance variables are defined in a
+  consistent order will see the most performance benefits.
+  [[Feature #18776]]
+* Speed up marking instruction sequences by using a bitmap to find "markable"
+  objects.  This change results in faster major collections.
+  [[Feature #18875]]
+
+## JIT
+
+### YJIT
+
+* YJIT is no longer experimental
+    * Has been tested on production workloads for over a year and proven to be quite stable.
+* YJIT now supports both x86-64 and arm64/aarch64 CPUs on Linux, MacOS, BSD and other UNIX platforms.
+    * This release brings support for Mac M1/M2, AWS Graviton and Raspberry Pi 4.
+* Building YJIT now requires Rust 1.58.0+. [[Feature #18481]]
+    * In order to ensure that CRuby is built with YJIT, please install `rustc` >= 1.58.0
+      before running `./configure`
+    * Please reach out to the YJIT team should you run into any issues.
+* Physical memory for JIT code is lazily allocated. Unlike Ruby 3.1,
+  the RSS of a Ruby process is minimized because virtual memory pages
+  allocated by `--yjit-exec-mem-size` will not be mapped to physical
+  memory pages until actually utilized by JIT code.
+* Introduce Code GC that frees all code pages when the memory consumption
+  by JIT code reaches `--yjit-exec-mem-size`.
+    * `RubyVM::YJIT.runtime_stats` returns Code GC metrics in addition to
+      existing `inline_code_size` and `outlined_code_size` keys:
+      `code_gc_count`, `live_page_count`, `freed_page_count`, and `freed_code_size`.
+* Most of the statistics produced by `RubyVM::YJIT.runtime_stats` are now available in release builds.
+    * Simply run ruby with `--yjit-stats` to compute and dump stats (incurs some run-time overhead).
+* YJIT is now optimized to take advantage of object shapes. [[Feature #18776]]
+* Take advantage of finer-grained constant invalidation to invalidate less code when defining new constants. [[Feature #18589]]
+* The default `--yjit-exec-mem-size` is changed to 64 (MiB).
+* The default `--yjit-call-threshold` is changed to 30.
+
+### MJIT
+
+* The MJIT compiler is re-implemented in Ruby as `ruby_vm/mjit/compiler`.
+* MJIT compiler is executed under a forked Ruby process instead of
+  doing it in a native thread called MJIT worker. [[Feature #18968]]
+    * As a result, Microsoft Visual Studio (MSWIN) is no longer supported.
+* MinGW is no longer supported. [[Feature #18824]]
+* Rename `--mjit-min-calls` to `--mjit-call-threshold`.
+* Change default `--mjit-max-cache` back from 10000 to 100.
+
+[Feature #12005]:     https://bugs.ruby-lang.org/issues/12005
+[Feature #12084]:     https://bugs.ruby-lang.org/issues/12084
+[Feature #12655]:     https://bugs.ruby-lang.org/issues/12655
+[Feature #12737]:     https://bugs.ruby-lang.org/issues/12737
+[Feature #13110]:     https://bugs.ruby-lang.org/issues/13110
+[Feature #14332]:     https://bugs.ruby-lang.org/issues/14332
+[Feature #15231]:     https://bugs.ruby-lang.org/issues/15231
+[Feature #15357]:     https://bugs.ruby-lang.org/issues/15357
+[Bug #15928]:         https://bugs.ruby-lang.org/issues/15928
+[Feature #16122]:     https://bugs.ruby-lang.org/issues/16122
+[Feature #16131]:     https://bugs.ruby-lang.org/issues/16131
+[Bug #16466]:         https://bugs.ruby-lang.org/issues/16466
+[Feature #16663]:     https://bugs.ruby-lang.org/issues/16663
+[Feature #16806]:     https://bugs.ruby-lang.org/issues/16806
+[Bug #16889]:         https://bugs.ruby-lang.org/issues/16889
+[Bug #16908]:         https://bugs.ruby-lang.org/issues/16908
+[Feature #16989]:     https://bugs.ruby-lang.org/issues/16989
+[Feature #17351]:     https://bugs.ruby-lang.org/issues/17351
+[Feature #17391]:     https://bugs.ruby-lang.org/issues/17391
+[Bug #17545]:         https://bugs.ruby-lang.org/issues/17545
+[Bug #17767]:         https://bugs.ruby-lang.org/issues/17767
+[Feature #17837]:     https://bugs.ruby-lang.org/issues/17837
+[Feature #17881]:     https://bugs.ruby-lang.org/issues/17881
+[Feature #18033]:     https://bugs.ruby-lang.org/issues/18033
+[Feature #18159]:     https://bugs.ruby-lang.org/issues/18159
+[Feature #18239]:     https://bugs.ruby-lang.org/issues/18239#note-17
+[Feature #18351]:     https://bugs.ruby-lang.org/issues/18351
+[Feature #18367]:     https://bugs.ruby-lang.org/issues/18367
+[Bug #18435]:         https://bugs.ruby-lang.org/issues/18435
+[Feature #18462]:     https://bugs.ruby-lang.org/issues/18462
+[Feature #18481]:     https://bugs.ruby-lang.org/issues/18481
+[Bug #18487]:         https://bugs.ruby-lang.org/issues/18487
+[Feature #18564]:     https://bugs.ruby-lang.org/issues/18564
+[Feature #18571]:     https://bugs.ruby-lang.org/issues/18571
+[Feature #18585]:     https://bugs.ruby-lang.org/issues/18585
+[Feature #18589]:     https://bugs.ruby-lang.org/issues/18589
+[Feature #18595]:     https://bugs.ruby-lang.org/issues/18595
+[Feature #18598]:     https://bugs.ruby-lang.org/issues/18598
+[Bug #18625]:         https://bugs.ruby-lang.org/issues/18625
+[Feature #18630]:     https://bugs.ruby-lang.org/issues/18630
+[Bug #18633]:         https://bugs.ruby-lang.org/issues/18633
+[Feature #18639]:     https://bugs.ruby-lang.org/issues/18639
+[Feature #18685]:     https://bugs.ruby-lang.org/issues/18685
+[Bug #18729]:         https://bugs.ruby-lang.org/issues/18729
+[Bug #18751]:         https://bugs.ruby-lang.org/issues/18751
+[Feature #18774]:     https://bugs.ruby-lang.org/issues/18774
+[Feature #18776]:     https://bugs.ruby-lang.org/issues/18776
+[Bug #18782]:         https://bugs.ruby-lang.org/issues/18782
+[Feature #18788]:     https://bugs.ruby-lang.org/issues/18788
+[Feature #18798]:     https://bugs.ruby-lang.org/issues/18798
+[Feature #18809]:     https://bugs.ruby-lang.org/issues/18809
+[Feature #18821]:     https://bugs.ruby-lang.org/issues/18821
+[Feature #18822]:     https://bugs.ruby-lang.org/issues/18822
+[Feature #18824]:     https://bugs.ruby-lang.org/issues/18824
+[Feature #18832]:     https://bugs.ruby-lang.org/issues/18832
+[Feature #18875]:     https://bugs.ruby-lang.org/issues/18875
+[Feature #18925]:     https://bugs.ruby-lang.org/issues/18925
+[Feature #18944]:     https://bugs.ruby-lang.org/issues/18944
+[Feature #18949]:     https://bugs.ruby-lang.org/issues/18949
+[Feature #18968]:     https://bugs.ruby-lang.org/issues/18968
+[Feature #19008]:     https://bugs.ruby-lang.org/issues/19008
+[Feature #19013]:     https://bugs.ruby-lang.org/issues/19013
+[Feature #19026]:     https://bugs.ruby-lang.org/issues/19026
+[Feature #19036]:     https://bugs.ruby-lang.org/issues/19036
+[Feature #19060]:     https://bugs.ruby-lang.org/issues/19060
+[Feature #19070]:     https://bugs.ruby-lang.org/issues/19070
+[Feature #19071]:     https://bugs.ruby-lang.org/issues/19071
+[Feature #19078]:     https://bugs.ruby-lang.org/issues/19078
+[Bug #19087]:         https://bugs.ruby-lang.org/issues/19087
+[Bug #19100]:         https://bugs.ruby-lang.org/issues/19100
+[Feature #19104]:     https://bugs.ruby-lang.org/issues/19104
+[Feature #19135]:     https://bugs.ruby-lang.org/issues/19135
+[Feature #19138]:     https://bugs.ruby-lang.org/issues/19138
+[Feature #19194]:     https://bugs.ruby-lang.org/issues/19194
+[Molinillo]:          https://github.com/CocoaPods/Molinillo
+[PubGrub]:            https://github.com/jhawthorn/pub_grub
+[GH-net-protocol-14]: https://github.com/ruby/net-protocol/pull/14
+[GH-pathname-20]:     https://github.com/ruby/pathname/pull/20
+[GH-6791]:            https://github.com/ruby/ruby/pull/6791
+[GH-6868]:            https://github.com/ruby/ruby/pull/6868
+[GH-rubygems-4475]:   https://github.com/rubygems/rubygems/pull/4475
+[GH-rubygems-6149]:   https://github.com/rubygems/rubygems/pull/6149
+[GH-rubygems-6167]:   https://github.com/rubygems/rubygems/pull/6167
+[sec-156615]:         https://hackerone.com/reports/156615
+[CVE-2021-33621]:     https://www.ruby-lang.org/en/news/2022/11/22/http-response-splitting-in-cgi-cve-2021-33621/
+[wasm/README.md]:     https://github.com/ruby/ruby/blob/master/wasm/README.md
+[ruby.wasm]:          https://github.com/ruby/ruby.wasm
diff --git a/README b/README
deleted file mode 100644
index 3ffe3553a8..0000000000
--- a/README
+++ /dev/null
@@ -1,166 +0,0 @@
-= What's Ruby
-
-Ruby is the interpreted scripting language for quick and
-easy object-oriented programming.  It has many features to
-process text files and to do system management tasks (as in
-Perl).  It is simple, straight-forward, and extensible.
-
-
-== Features of Ruby
-
-*   Simple Syntax
-*   *Normal* Object-Oriented features(ex. class, method calls)
-*   *Advanced* Object-Oriented features(ex. Mix-in, Singleton-method)
-*   Operator Overloading
-*   Exception Handling
-*   Iterators and Closures
-*   Garbage Collection
-*   Dynamic Loading of Object files(on some architecture)
-*   Highly Portable (works on many Unix-like/POSIX compatible platforms
-    as well as Windows, Mac OS X, BeOS etc.)
-    cf. http://bugs.ruby-lang.org/projects/ruby-trunk/wiki/SupportedPlatforms
-
-
-== How to get Ruby
-
-For a complete list of ways to install Ruby, including using third party
-tools like rvm, see:
-
-http://www.ruby-lang.org/en/downloads/
-
-The Ruby distribution files can be found in the following FTP site:
-
-ftp://ftp.ruby-lang.org/pub/ruby/
-
-The trunk of the Ruby source tree can be checked out with the
-following command:
-
-  $ svn co http://svn.ruby-lang.org/repos/ruby/trunk/ ruby
-
-Or if you are using git then use the following command:
-
-  $ git clone git://github.com/ruby/ruby.git
-
-There are some other branches under development.  Try the following
-command and see the list of branches:
-
-  $ svn ls http://svn.ruby-lang.org/repos/ruby/branches/
-
-Or if you are using git then use the following command:
-
-  $ git ls-remote git://github.com/ruby/ruby.git
-
-== Ruby home-page
-
-The URL of the Ruby home-page is:
-
-http://www.ruby-lang.org/
-
-
-== Mailing list
-
-There is a mailing list to talk about Ruby.
-To subscribe this list, please send the following phrase
-
-        subscribe YourFirstName YourFamilyName
-e.g.
-        subscribe Joseph Smith
-
-in the mail body (not subject) to the address <mailto:ruby-talk-ctl@ruby-lang.org>.
-
-
-== How to compile and install
-
-This is what you need to do to compile and install Ruby:
-
-0.   If you want to use Microsoft Visual C++ to compile ruby,
-     read win32/README.win32 instead of this document.
-
-1.   If +./configure+ does not exist or is older than configure.in,
-     run autoconf to (re)generate configure.
-
-2.   Run +./configure+, which will generate config.h and Makefile.
-
-     Some C compiler flags may be added by default depending on your
-     environment.  Specify <tt>optflags=..</tt> and <tt>warnflags=..</tt> as
-     necessary to override them.
-
-3.   Edit +defines.h+ if you need. Usually this step will not be needed.
-
-4.   Remove comment mark(<tt>#</tt>) before the module names from +ext/Setup+
-     (or add module names if not present), if you want to link modules
-     statically.
-
-     If you don't want to compile non static extension modules
-     (probably on architectures which does not allow dynamic loading),
-     remove comment mark from the line "<tt>#option nodynamic</tt>" in
-     +ext/Setup+.
-
-     Usually this step will not be needed.
-
-5.   Run +make+.
-
-6.   Optionally, run '<tt>make check</tt>' to check whether the compiled Ruby
-     interpreter works well. If you see the message "<tt>check succeeded</tt>",
-     your ruby works as it should (hopefully).
-
-7.   Run '<tt>make install</tt>'
-
-     This command will create following directories and install files
-     onto them.
-
-     * <tt>${DESTDIR}${prefix}/bin</tt>
-     * <tt>${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/share/man/man1</tt>
-     * <tt>${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system</tt>
-
-     If Ruby's API version is '_x.y.z_', the <tt>${MAJOR}</tt> is '_x_', the
-     <tt>${MINOR}</tt> is '_y_', and the <tt>${TEENY}</tt> is '_z_'.
-
-     *NOTE*: teeny of the API version may be different from one of
-     Ruby's program version
-
-     You may have to be a super user to install ruby.
-
-If you fail to compile ruby, please send the detailed error report with
-the error log and machine/OS type, to help others.
-
-Some extension libraries may not get compiled because of lack of
-necessary external libraries and/or headers, then you will need to run
-'<tt>make distclean-ext</tt>' to remove old configuration after
-installing them in such case.
-
-== Copying
-
-See the file +COPYING+.
-
-== Feedback
-
-Questions about the Ruby language can be asked on the Ruby-Talk mailing list
-(http://www.ruby-lang.org/en/community/mailing-lists) or on websites like
-(http://stackoverflow.com).
-
-Bug reports should be filed at http://bugs.ruby-lang.org
-
-== The Author
-
-Ruby was originally designed and developed by Yukihiro Matsumoto (Matz) in 1995.
-
-<mailto:matz@ruby-lang.org>
-
---
-Local variables:
-mode: rdoc
-end:
diff --git a/README.EXT b/README.EXT
index 6f40185047..48b8d964c4 100644
--- a/README.EXT
+++ b/README.EXT
@@ -1,1487 +1 @@
-# README.EXT -  -*- RDoc -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-This document explains how to make extension libraries for Ruby.
-
-= Basic Knowledge
-
-In C, variables have types and data do not have types.  In contrast,
-Ruby variables do not have a static type, and data themselves have
-types, so data will need to be converted between the languages.
-
-Data in Ruby are represented by the C type `VALUE'.  Each VALUE data
-has its data-type.
-
-To retrieve C data from a VALUE, you need to:
-
-1. Identify the VALUE's data type
-2. Convert the VALUE into C data
-
-Converting to the wrong data type may cause serious problems.
-
-== Data-Types
-
-The Ruby interpreter has the following data types:
-
-T_NIL       :: nil
-T_OBJECT    :: ordinary object
-T_CLASS     :: class
-T_MODULE    :: module
-T_FLOAT     :: floating point number
-T_STRING    :: string
-T_REGEXP    :: regular expression
-T_ARRAY     :: array
-T_HASH      :: associative array
-T_STRUCT    :: (Ruby) structure
-T_BIGNUM    :: multi precision integer
-T_FIXNUM    :: Fixnum(31bit or 63bit integer)
-T_COMPLEX   :: complex number
-T_RATIONAL  :: rational number
-T_FILE      :: IO
-T_TRUE      :: true
-T_FALSE     :: false
-T_DATA      :: data
-T_SYMBOL    :: symbol
-
-In addition, there are several other types used internally:
-
-T_ICLASS    :: included module
-T_MATCH     :: MatchData object
-T_UNDEF     :: undefined
-T_NODE      :: syntax tree node
-T_ZOMBIE    :: object awaiting finalization
-
-Most of the types are represented by C structures.
-
-== Check Data Type of the VALUE
-
-The macro TYPE() defined in ruby.h shows the data type of the VALUE.
-TYPE() returns the constant number T_XXXX described above.  To handle
-data types, your code will look something like this:
-
-  switch (TYPE(obj)) {
-    case T_FIXNUM:
-      /* process Fixnum */
-      break;
-    case T_STRING:
-      /* process String */
-      break;
-    case T_ARRAY:
-      /* process Array */
-      break;
-    default:
-      /* raise exception */
-      rb_raise(rb_eTypeError, "not valid value");
-      break;
-  }
-
-There is the data-type check function
-
-  void Check_Type(VALUE value, int type)
-
-which raises an exception if the VALUE does not have the type
-specified.
-
-There are also faster check macros for fixnums and nil.
-
-  FIXNUM_P(obj)
-  NIL_P(obj)
-
-== Convert VALUE into C Data
-
-The data for type T_NIL, T_FALSE, T_TRUE are nil, false, true
-respectively.  They are singletons for the data type.
-The equivalent C constants are: Qnil, Qfalse, Qtrue.
-Note that Qfalse is false in C also (i.e. 0), but not Qnil.
-
-The T_FIXNUM data is a 31bit or 63bit length fixed integer.
-This size is depend on the size of long: if long is 32bit then
-T_FIXNUM is 31bit, if long is 64bit then T_FIXNUM is 63bit.
-T_FIXNUM can be converted to a C integer by using the
-FIX2INT() macro or FIX2LONG().  Though you have to check that the
-data is really FIXNUM before using them, they are faster.  FIX2LONG()
-never raises exceptions, but FIX2INT() raises RangeError if the
-result is bigger or smaller than the size of int.
-There are also NUM2INT() and NUM2LONG() which converts any Ruby
-numbers into C integers.  These macros includes a type check,
-so an exception will be raised if the conversion failed.  NUM2DBL()
-can be used to retrieve the double float value in the same way.
-
-You can use the macros
-StringValue() and StringValuePtr() to get a char* from a VALUE.
-StringValue(var) replaces var's value with the result of "var.to_str()".
-StringValuePtr(var) does same replacement and returns char*
-representation of var.  These macros will skip the replacement if var
-is a String.  Notice that the macros take only the lvalue as their
-argument, to change the value of var in place.
-
-You can also use the macro named StringValueCStr(). This is just
-like StringValuePtr(), but always add nul character at the end of
-the result. If the result contains nul character, this macro causes
-the ArgumentError exception.
-StringValuePtr() doesn't guarantee the existence of a nul at the end
-of the result, and the result may contain nul.
-
-Other data types have corresponding C structures, e.g. struct RArray
-for T_ARRAY etc. The VALUE of the type which has the corresponding
-structure can be cast to retrieve the pointer to the struct.  The
-casting macro will be of the form RXXXX for each data type; for
-instance, RARRAY(obj).  See "ruby.h".
-
-There are some accessing macros for structure members, for example
-`RSTRING_LEN(str)' to get the size of the Ruby String object.  The
-allocated region can be accessed by `RSTRING_PTR(str)'.  For arrays,
-use `RARRAY_LEN(ary)' and `RARRAY_PTR(ary)' respectively.
-
-Notice: Do not change the value of the structure directly, unless you
-are responsible for the result.  This ends up being the cause of
-interesting bugs.
-
-== Convert C Data into VALUE
-
-To convert C data to Ruby values:
-
-FIXNUM ::
-
-  left shift 1 bit, and turn on LSB.
-
-Other pointer values::
-
-  cast to VALUE.
-
-You can determine whether a VALUE is pointer or not by checking its LSB.
-
-Notice Ruby does not allow arbitrary pointer values to be a VALUE.  They
-should be pointers to the structures which Ruby knows about.  The known
-structures are defined in <ruby.h>.
-
-To convert C numbers to Ruby values, use these macros.
-
-INT2FIX() :: for integers within 31bits.
-INT2NUM() :: for arbitrary sized integer.
-
-INT2NUM() converts an integer into a Bignum if it is out of the FIXNUM
-range, but is a bit slower.
-
-== Manipulating Ruby Data
-
-As I already mentioned, it is not recommended to modify an object's
-internal structure.  To manipulate objects, use the functions supplied
-by the Ruby interpreter. Some (not all) of the useful functions are
-listed below:
-
-=== String Functions
-
-rb_str_new(const char *ptr, long len) ::
-
-  Creates a new Ruby string.
-
-rb_str_new2(const char *ptr) ::
-rb_str_new_cstr(const char *ptr) ::
-
-  Creates a new Ruby string from a C string.  This is equivalent to
-  rb_str_new(ptr, strlen(ptr)).
-
-rb_tainted_str_new(const char *ptr, long len) ::
-
-  Creates a new tainted Ruby string.  Strings from external data
-  sources should be tainted.
-
-rb_tainted_str_new2(const char *ptr) ::
-rb_tainted_str_new_cstr(const char *ptr) ::
-
-  Creates a new tainted Ruby string from a C string.
-
-rb_sprintf(const char *format, ...) ::
-rb_vsprintf(const char *format, va_list ap) ::
-
-  Creates a new Ruby string with printf(3) format.
-
-  Note: In the format string, %i is used for Object#to_s (or Object#inspect if
-  '+' flag is set) output (and related argument must be a VALUE).  For integers
-  in format strings, use %d.
-
-rb_str_cat(VALUE str, const char *ptr, long len) ::
-
-  Appends len bytes of data from ptr to the Ruby string.
-
-rb_str_cat2(VALUE str, const char* ptr) ::
-
-  Appends C string ptr to Ruby string str.  This function is
-  equivalent to rb_str_cat(str, ptr, strlen(ptr)).
-
-rb_str_catf(VALUE str, const char* format, ...) ::
-rb_str_vcatf(VALUE str, const char* format, va_list ap) ::
-
-  Appends C string format and successive arguments to Ruby string
-  str according to a printf-like format.  These functions are
-  equivalent to rb_str_cat2(str, rb_sprintf(format, ...)) and
-  rb_str_cat2(str, rb_vsprintf(format, ap)), respectively.
-
-rb_enc_str_new(const char *ptr, long len, rb_encoding *enc) ::
-
-  Creates a new Ruby string with the specified encoding.
-
-rb_usascii_str_new(const char *ptr, long len) ::
-rb_usascii_str_new_cstr(const char *ptr) ::
-
-  Creates a new Ruby string with encoding US-ASCII.
-
-rb_str_resize(VALUE str, long len) ::
-
-  Resizes Ruby string to len bytes.  If str is not modifiable, this
-  function raises an exception.  The length of str must be set in
-  advance.  If len is less than the old length the content beyond
-  len bytes is discarded, else if len is greater than the old length
-  the content beyond the old length bytes will not be preserved but
-  will be garbage.  Note that RSTRING_PTR(str) may change by calling
-  this function.
-
-rb_str_set_len(VALUE str, long len) ::
-
-  Sets the length of Ruby string.  If str is not modifiable, this
-  function raises an exception.  This function preserves the content
-  upto len bytes, regardless RSTRING_LEN(str).  len must not exceed
-  the capacity of str.
-
-=== Array Functions
-
-rb_ary_new() ::
-
-  Creates an array with no elements.
-
-rb_ary_new2(long len) ::
-rb_ary_new_capa(long len) ::
-
-  Creates an array with no elements, allocating internal buffer
-  for len elements.
-
-rb_ary_new3(long n, ...) ::
-rb_ary_new_from_args(long n, ...) ::
-
-  Creates an n-element array from the arguments.
-
-rb_ary_new4(long n, VALUE *elts) ::
-rb_ary_new_from_values(long n, VALUE *elts) ::
-
-  Creates an n-element array from a C array.
-
-rb_ary_to_ary(VALUE obj) ::
-
-  Converts the object into an array.
-  Equivalent to Object#to_ary.
-
-There are many functions to operate an array.  They may dump core if other
-types are given.
-
-rb_ary_aref(argc, VALUE *argv, VALUE ary) ::
-
-  Equivalent to Array#[].
-
-rb_ary_entry(VALUE ary, long offset) ::
-
-  ary[offset]
-
-rb_ary_subseq(VALUE ary, long beg, long len) ::
-
-  ary[beg, len]
-
-rb_ary_push(VALUE ary, VALUE val) ::
-rb_ary_pop(VALUE ary) ::
-rb_ary_shift(VALUE ary) ::
-rb_ary_unshift(VALUE ary, VALUE val) ::
-
-rb_ary_cat(VALUE ary, const VALUE *ptr, long len) ::
-
-  Appends len elements of objects from ptr to the array.
-
-= Extending Ruby with C
-
-== Adding New Features to Ruby
-
-You can add new features (classes, methods, etc.) to the Ruby
-interpreter.  Ruby provides APIs for defining the following things:
-
-* Classes, Modules
-* Methods, Singleton Methods
-* Constants
-
-=== Class and Module Definition
-
-To define a class or module, use the functions below:
-
-  VALUE rb_define_class(const char *name, VALUE super)
-  VALUE rb_define_module(const char *name)
-
-These functions return the newly created class or module.  You may
-want to save this reference into a variable to use later.
-
-To define nested classes or modules, use the functions below:
-
-  VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, const char *name)
-
-=== Method and Singleton Method Definition
-
-To define methods or singleton methods, use these functions:
-
-  void rb_define_method(VALUE klass, const char *name,
-		        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, const char *name,
-			          VALUE (*func)(), int argc)
-
-The `argc' represents the number of the arguments to the C function,
-which must be less than 17.  But I doubt you'll need that many.
-
-If `argc' is negative, it specifies the calling sequence, not number of
-the arguments.
-
-If argc is -1, the function will be called as:
-
-  VALUE func(int argc, VALUE *argv, VALUE obj)
-
-where argc is the actual number of arguments, argv is the C array of
-the arguments, and obj is the receiver.
-
-If argc is -2, the arguments are passed in a Ruby array. The function
-will be called like:
-
-  VALUE func(VALUE obj, VALUE args)
-
-where obj is the receiver, and args is the Ruby array containing
-actual arguments.
-
-There are some more functions to define methods. One takes an ID
-as the name of method to be defined. See also ID or Symbol below.
-
-  void rb_define_method_id(VALUE klass, ID name,
-                           VALUE (*func)(ANYARGS), int argc)
-
-There are two functions to define private/protected methods:
-
-  void rb_define_private_method(VALUE klass, const char *name,
-			        VALUE (*func)(), int argc)
-  void rb_define_protected_method(VALUE klass, const char *name,
-			          VALUE (*func)(), int argc)
-
-At last, rb_define_module_function defines a module functions,
-which are private AND singleton methods of the module.
-For example, sqrt is the module function defined in Math module.
-It can be called in the following way:
-
-  Math.sqrt(4)
-
-or
-
-  include Math
-  sqrt(4)
-
-To define module functions, use:
-
-  void rb_define_module_function(VALUE module, const char *name,
-				 VALUE (*func)(), int argc)
-
-In addition, function-like methods, which are private methods defined
-in the Kernel module, can be defined using:
-
-  void rb_define_global_function(const char *name, VALUE (*func)(), int argc)
-
-To define an alias for the method,
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-To define a reader/writer for an attribute,
-
-  void rb_define_attr(VALUE klass, const char *name, int read, int write)
-
-To define and undefine the `allocate' class method,
-
-  void rb_define_alloc_func(VALUE klass, VALUE (*func)(VALUE klass));
-  void rb_undef_alloc_func(VALUE klass);
-
-func has to take the klass as the argument and return a newly
-allocated instance.  This instance should be as empty as possible,
-without any expensive (including external) resources.
-
-=== Constant Definition
-
-We have 2 functions to define constants:
-
-  void rb_define_const(VALUE klass, const char *name, VALUE val)
-  void rb_define_global_const(const char *name, VALUE val)
-
-The former is to define a constant under specified class/module.  The
-latter is to define a global constant.
-
-== Use Ruby Features from C
-
-There are several ways to invoke Ruby's features from C code.
-
-=== Evaluate Ruby Programs in a String
-
-The easiest way to use Ruby's functionality from a C program is to
-evaluate the string as Ruby program.  This function will do the job:
-
-  VALUE rb_eval_string(const char *str)
-
-Evaluation is done under the current context, thus current local variables
-of the innermost method (which is defined by Ruby) can be accessed.
-
-Note that the evaluation can raise an exception. There is a safer
-function:
-
-  VALUE rb_eval_string_protect(const char *str, int *state)
-
-It returns nil when an error occur. Moreover, *state is zero if str was
-successfully evaluated, or nonzero otherwise.
-
-=== ID or Symbol
-
-You can invoke methods directly, without parsing the string.  First I
-need to explain about ID.  ID is the integer number to represent
-Ruby's identifiers such as variable names.  The Ruby data type
-corresponding to ID is Symbol.  It can be accessed from Ruby in the
-form:
-
-  :Identifier
-
-or
-
-  :"any kind of string"
-
-You can get the ID value from a string within C code by using
-
-  rb_intern(const char *name)
-  rb_intern_str(VALUE name)
-
-You can retrieve ID from Ruby object (Symbol or String) given as an
-argument by using
-
-  rb_to_id(VALUE symbol)
-  rb_check_id(volatile VALUE *name)
-  rb_check_id_cstr(const char *name, long len, rb_encoding *enc)
-
-These functions try to convert the argument to a String if it was not
-a Symbol nor a String.  The second function stores the converted
-result into *name, and returns 0 if the string is not a known symbol.
-After this function returned a non-zero value, *name is always a
-Symbol or a String, otherwise it is a String if the result is 0.
-The third function takes NUL-terminated C string, not Ruby VALUE.
-
-You can convert C ID to Ruby Symbol by using
-
-  VALUE ID2SYM(ID id)
-
-and to convert Ruby Symbol object to ID, use
-
-  ID SYM2ID(VALUE symbol)
-
-=== Invoke Ruby Method from C
-
-To invoke methods directly, you can use the function below
-
-  VALUE rb_funcall(VALUE recv, ID mid, int argc, ...)
-
-This function invokes a method on the recv, with the method name
-specified by the symbol mid.
-
-=== Accessing the Variables and Constants
-
-You can access class variables and instance variables using access
-functions.  Also, global variables can be shared between both
-environments.  There's no way to access Ruby's local variables.
-
-The functions to access/modify instance variables are below:
-
-  VALUE rb_ivar_get(VALUE obj, ID id)
-  VALUE rb_ivar_set(VALUE obj, ID id, VALUE val)
-
-id must be the symbol, which can be retrieved by rb_intern().
-
-To access the constants of the class/module:
-
-  VALUE rb_const_get(VALUE obj, ID id)
-
-See also Constant Definition above.
-
-= Information Sharing Between Ruby and C
-
-=== Ruby Constants That C Can Be Accessed From C
-
-As stated in section 1.3,
-the following Ruby constants can be referred from C.
-
-  Qtrue
-  Qfalse
-
-Boolean values.  Qfalse is false in C also (i.e. 0).
-
-  Qnil
-
-Ruby nil in C scope.
-
-== Global Variables Shared Between C and Ruby
-
-Information can be shared between the two environments using shared global
-variables.  To define them, you can use functions listed below:
-
-  void rb_define_variable(const char *name, VALUE *var)
-
-This function defines the variable which is shared by both environments.
-The value of the global variable pointed to by `var' can be accessed
-through Ruby's global variable named `name'.
-
-You can define read-only (from Ruby, of course) variables using the
-function below.
-
-  void rb_define_readonly_variable(const char *name, VALUE *var)
-
-You can defined hooked variables.  The accessor functions (getter and
-setter) are called on access to the hooked variables.
-
-  void rb_define_hooked_variable(const char *name, VALUE *var,
-				 VALUE (*getter)(), void (*setter)())
-
-If you need to supply either setter or getter, just supply 0 for the
-hook you don't need.  If both hooks are 0, rb_define_hooked_variable()
-works just like rb_define_variable().
-
-The prototypes of the getter and setter functions are as follows:
-
-  VALUE (*getter)(ID id, VALUE *var);
-  void (*setter)(VALUE val, ID id, VALUE *var);
-
-
-Also you can define a Ruby global variable without a corresponding C
-variable.  The value of the variable will be set/get only by hooks.
-
-  void rb_define_virtual_variable(const char *name,
-				  VALUE (*getter)(), void (*setter)())
-
-The prototypes of the getter and setter functions are as follows:
-
-  VALUE (*getter)(ID id);
-  void (*setter)(VALUE val, ID id);
-
-
-== Encapsulate C Data into a Ruby Object
-
-To wrap and objectify a C pointer as a Ruby object (so called
-DATA), use Data_Wrap_Struct().
-
-  Data_Wrap_Struct(klass, mark, free, sval)
-
-Data_Wrap_Struct() returns a created DATA object.  The klass argument
-is the class for the DATA object.  The mark argument is the function
-to mark Ruby objects pointed by this data.  The free argument is the
-function to free the pointer allocation.  If this is -1, the pointer
-will be just freed.  The functions mark and free will be called from
-garbage collector.
-
-These mark / free functions are invoked during GC execution.  No
-object allocations are allowed during it, so do not allocate ruby
-objects inside them.
-
-You can allocate and wrap the structure in one step.
-
-  Data_Make_Struct(klass, type, mark, free, sval)
-
-This macro returns an allocated Data object, wrapping the pointer to
-the structure, which is also allocated.  This macro works like:
-
-  (sval = ALLOC(type), Data_Wrap_Struct(klass, mark, free, sval))
-
-Arguments klass, mark, and free work like their counterparts in
-Data_Wrap_Struct().  A pointer to the allocated structure will be
-assigned to sval, which should be a pointer of the type specified.
-
-To retrieve the C pointer from the Data object, use the macro
-Data_Get_Struct().
-
-  Data_Get_Struct(obj, type, sval)
-
-A pointer to the structure will be assigned to the variable sval.
-
-See the example below for details.
-
-= Example - Creating dbm Extension
-
-OK, here's the example of making an extension library.  This is the
-extension to access DBMs.  The full source is included in the ext/
-directory in the Ruby's source tree.
-
-== Make the Directory
-
-  % mkdir ext/dbm
-
-Make a directory for the extension library under ext directory.
-
-== Design the Library
-
-You need to design the library features, before making it.
-
-== Write the C Code
-
-You need to write C code for your extension library.  If your library
-has only one source file, choosing ``LIBRARY.c'' as a file name is
-preferred.  On the other hand, in case your library has multiple source
-files, avoid choosing ``LIBRARY.c'' for a file name.  It may conflict
-with an intermediate file ``LIBRARY.o'' on some platforms.
-Note that some functions in mkmf library described below generate
-a file ``conftest.c'' for checking with compilation.  You shouldn't
-choose ``conftest.c'' as a name of a source file.
-
-Ruby will execute the initializing function named ``Init_LIBRARY'' in
-the library.  For example, ``Init_dbm()'' will be executed when loading
-the library.
-
-Here's the example of an initializing function.
-
-  void
-  Init_dbm(void)
-  {
-      /* define DBM class */
-      cDBM = rb_define_class("DBM", rb_cObject);
-      /* DBM includes Enumerate module */
-      rb_include_module(cDBM, rb_mEnumerable);
-
-      /* DBM has class method open(): arguments are received as C array */
-      rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1);
-
-      /* DBM instance method close(): no args */
-      rb_define_method(cDBM, "close", fdbm_close, 0);
-      /* DBM instance method []: 1 argument */
-      rb_define_method(cDBM, "[]", fdbm_fetch, 1);
-
-      /* ... */
-
-      /* ID for a instance variable to store DBM data */
-      id_dbm = rb_intern("dbm");
-  }
-
-The dbm extension wraps the dbm struct in the C environment using
-Data_Make_Struct.
-
-  struct dbmdata {
-      int  di_size;
-      DBM *di_dbm;
-  };
-
-  obj = Data_Make_Struct(klass, struct dbmdata, 0, free_dbm, dbmp);
-
-This code wraps the dbmdata structure into a Ruby object.  We avoid
-wrapping DBM* directly, because we want to cache size information.
-
-To retrieve the dbmdata structure from a Ruby object, we define the
-following macro:
-
-  #define GetDBM(obj, dbmp) {\
-      Data_Get_Struct(obj, struct dbmdata, dbmp);\
-      if (dbmp->di_dbm == 0) closed_dbm();\
-  }
-
-This sort of complicated macro does the retrieving and close checking for
-the DBM.
-
-There are three kinds of way to receive method arguments.  First,
-methods with a fixed number of arguments receive arguments like this:
-
-  static VALUE
-  fdbm_delete(VALUE obj, VALUE keystr)
-  {
-        /* ... */
-  }
-
-The first argument of the C function is the self, the rest are the
-arguments to the method.
-
-Second, methods with an arbitrary number of arguments receive
-arguments like this:
-
-  static VALUE
-  fdbm_s_open(int argc, VALUE *argv, VALUE klass)
-  {
-      /* ... */
-      if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) {
-          mode = 0666;		/* default value */
-      }
-      /* ... */
-  }
-
-The first argument is the number of method arguments, the second
-argument is the C array of the method arguments, and the third
-argument is the receiver of the method.
-
-You can use the function rb_scan_args() to check and retrieve the
-arguments.  The third argument is a string that specifies how to
-capture method arguments and assign them to the following VALUE
-references.
-
-
-The following is an example of a method that takes arguments by Ruby's
-array:
-
-  static VALUE
-  thread_initialize(VALUE thread, VALUE args)
-  {
-      /* ... */
-  }
-
-The first argument is the receiver, the second one is the Ruby array
-which contains the arguments to the method.
-
-*Notice*: GC should know about global variables which refer to Ruby's objects,
-but are not exported to the Ruby world.  You need to protect them by
-
-  void rb_global_variable(VALUE *var)
-
-== Prepare extconf.rb
-
-If the file named extconf.rb exists, it will be executed to generate
-Makefile.
-
-extconf.rb is the file for checking compilation conditions etc.  You
-need to put
-
-  require 'mkmf'
-
-at the top of the file.  You can use the functions below to check
-various conditions.
-
-  have_macro(macro[, headers[, opt]]): check whether macro is defined
-  have_library(lib[, func[, headers[, opt]]]): check whether library containing function exists
-  find_library(lib[, func, *paths]): find library from paths
-  have_func(func[, headers[, opt]): check whether function exists
-  have_var(var[, headers[, opt]]): check whether variable exists
-  have_header(header[, preheaders[, opt]]): check whether header file exists
-  find_header(header, *paths): find header from paths
-  have_framework(fw): check whether framework exists (for MacOS X)
-  have_struct_member(type, member[, headers[, opt]]): check whether struct has member
-  have_type(type[, headers[, opt]]): check whether type exists
-  find_type(type, opt, *headers): check whether type exists in headers
-  have_const(const[, headers[, opt]]): check whether constant is defined
-  check_sizeof(type[, headers[, opts]]): check size of type
-  check_signedness(type[, headers[, opts]]): check signedness of type
-  convertible_int(type[, headers[, opts]]): find convertible integer type
-  find_executable(bin[, path]): find executable file path
-  create_header(header): generate configured header
-  create_makefile(target[, target_prefix]): generate Makefile
-
-See MakeMakefile for full documentation of these functions.
-
-The value of the variables below will affect the Makefile.
-
-  $CFLAGS: included in CFLAGS make variable (such as -O)
-  $CPPFLAGS: included in CPPFLAGS make variable (such as -I, -D)
-  $LDFLAGS: included in LDFLAGS make variable (such as -L)
-  $objs: list of object file names
-
-Normally, the object files list is automatically generated by searching
-source files, but you must define them explicitly if any sources will
-be generated while building.
-
-If a compilation condition is not fulfilled, you should not call
-``create_makefile''.  The Makefile will not be generated, compilation will
-not be done.
-
-== Prepare Depend (Optional)
-
-If the file named depend exists, Makefile will include that file to
-check dependencies.  You can make this file by invoking
-
-  % gcc -MM *.c > depend
-
-It's harmless.  Prepare it.
-
-== Generate Makefile
-
-Try generating the Makefile by:
-
-  ruby extconf.rb
-
-If the library should be installed under vendor_ruby directory
-instead of site_ruby directory, use --vendor option as follows.
-
-  ruby extconf.rb --vendor
-
-You don't need this step if you put the extension library under the ext
-directory of the ruby source tree.  In that case, compilation of the
-interpreter will do this step for you.
-
-== Run make
-
-Type
-
-  make
-
-to compile your extension.  You don't need this step either if you have
-put the extension library under the ext directory of the ruby source tree.
-
-== Debug
-
-You may need to rb_debug the extension.  Extensions can be linked
-statically by adding the directory name in the ext/Setup file so that
-you can inspect the extension with the debugger.
-
-== Done! Now You Have the Extension Library
-
-You can do anything you want with your library.  The author of Ruby
-will not claim any restrictions on your code depending on the Ruby API.
-Feel free to use, modify, distribute or sell your program.
-
-= Appendix A. Ruby Source Files Overview
-
-== Ruby Language Core
-
-class.c    :: classes and modules
-error.c    :: exception classes and exception mechanism
-gc.c       :: memory management
-load.c     :: library loading
-object.c   :: objects
-variable.c :: variables and constants
-
-== Ruby Syntax Parser
-
-parse.y  :: grammar definition
-parse.c  :: automatically generated from parse.y
-keywords :: reserved keywords
-lex.c    :: automatically generated from keywords
-
-== Ruby Evaluator (a.k.a. YARV)
-
-  compile.c
-  eval.c
-  eval_error.c
-  eval_jump.c
-  eval_safe.c
-  insns.def           : definition of VM instructions
-  iseq.c              : implementation of VM::ISeq
-  thread.c            : thread management and context switching
-  thread_win32.c      : thread implementation
-  thread_pthread.c    : ditto
-  vm.c
-  vm_dump.c
-  vm_eval.c
-  vm_exec.c
-  vm_insnhelper.c
-  vm_method.c
-
-  opt_insns_unif.def  : instruction unification
-  opt_operand.def     : definitions for optimization
-
-    -> insn*.inc      : automatically generated
-    -> opt*.inc       : automatically generated
-    -> vm.inc         : automatically generated
-
-== Regular Expression Engine (Oniguruma)
-
-  regex.c
-  regcomp.c
-  regenc.c
-  regerror.c
-  regexec.c
-  regparse.c
-  regsyntax.c
-
-== Utility Functions
-
-debug.c    :: debug symbols for C debugger
-dln.c      :: dynamic loading
-st.c       :: general purpose hash table
-strftime.c :: formatting times
-util.c     :: misc utilities
-
-== Ruby Interpreter Implementation
-
-  dmyext.c
-  dmydln.c
-  dmyencoding.c
-  id.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-  gem_prelude.rb
-  prelude.rb
-
-== Class Library
-
-array.c      :: Array
-bignum.c     :: Bignum
-compar.c     :: Comparable
-complex.c    :: Complex
-cont.c       :: Fiber, Continuation
-dir.c        :: Dir
-enum.c       :: Enumerable
-enumerator.c :: Enumerator
-file.c       :: File
-hash.c       :: Hash
-io.c         :: IO
-marshal.c    :: Marshal
-math.c       :: Math
-numeric.c    :: Numeric, Integer, Fixnum, Float
-pack.c       :: Array#pack, String#unpack
-proc.c       :: Binding, Proc
-process.c    :: Process
-random.c     :: random number
-range.c      :: Range
-rational.c   :: Rational
-re.c         :: Regexp, MatchData
-signal.c     :: Signal
-sprintf.c    :: String#sprintf
-string.c     :: String
-struct.c     :: Struct
-time.c       :: Time
-
-defs/known_errors.def :: Errno::* exception classes
--> known_errors.inc   :: automatically generated
-
-== Multilingualization
-
-encoding.c  :: Encoding
-transcode.c :: Encoding::Converter
-enc/*.c     :: encoding classes
-enc/trans/* :: codepoint mapping tables
-
-== goruby Interpreter Implementation
-
-  goruby.c
-  golf_prelude.rb     : goruby specific libraries.
-    -> golf_prelude.c : automatically generated
-
-
-= Appendix B. Ruby Extension API Reference
-
-== Types
-
-VALUE ::
-
-  The type for the Ruby object.  Actual structures are defined in ruby.h,
-  such as struct RString, etc.  To refer the values in structures, use
-  casting macros like RSTRING(obj).
-
-== Variables and Constants
-
-Qnil::
-  nil object
-
-Qtrue::
-  true object (default true value)
-
-Qfalse::
-  false object
-
-== C Pointer Wrapping
-
-Data_Wrap_Struct(VALUE klass, void (*mark)(), void (*free)(), void *sval) ::
-
-  Wrap a C pointer into a Ruby object.  If object has references to other
-  Ruby objects, they should be marked by using the mark function during
-  the GC process.  Otherwise, mark should be 0.  When this object is no
-  longer referred by anywhere, the pointer will be discarded by free
-  function.
-
-Data_Make_Struct(klass, type, mark, free, sval) ::
-
-  This macro allocates memory using malloc(), assigns it to the variable
-  sval, and returns the DATA encapsulating the pointer to memory region.
-
-Data_Get_Struct(data, type, sval) ::
-
-  This macro retrieves the pointer value from DATA, and assigns it to
-  the variable sval.
-
-== Checking Data Types
-
-TYPE(value) ::
-
-  Internal type (T_NIL, T_FIXNUM, etc.)
-
-FIXNUM_P(value) ::
-
-  Is +value+ a Fixnum?
-
-NIL_P(value) ::
-
-  Is +value+ nil?
-
-void Check_Type(VALUE value, int type) ::
-
-  Ensures +value+ is of the given internal +type+ or raises a TypeError
-
-SaveStringValue(value) ::
-
-  Checks that +value+ is a String and is not tainted
-
-== Data Type Conversion
-
-FIX2INT(value), INT2FIX(i) ::
-
-  Fixnum <-> integer
-
-FIX2LONG(value), LONG2FIX(l) ::
-
-  Fixnum <-> long
-
-NUM2INT(value), INT2NUM(i) ::
-
-  Numeric <-> integer
-
-NUM2UINT(value), UINT2NUM(ui) ::
-
-  Numeric <-> unsigned integer
-
-NUM2LONG(value), LONG2NUM(l) ::
-
-  Numeric <-> long
-
-NUM2ULONG(value), ULONG2NUM(ul) ::
-
-  Numeric <-> unsigned long
-
-NUM2LL(value), LL2NUM(ll) ::
-
-  Numeric <-> long long
-
-NUM2ULL(value), ULL2NUM(ull) ::
-
-  Numeric <-> unsigned long long
-
-NUM2OFFT(value), OFFT2NUM(off) ::
-
-  Numeric <-> off_t
-
-NUM2SIZET(value), SIZET2NUM(size) ::
-
-  Numeric <-> size_t
-
-NUM2SSIZET(value), SSIZET2NUM(ssize) ::
-
-  Numeric <-> ssize_t
-
-NUM2DBL(value) ::
-
-  Numeric -> double
-
-rb_float_new(f) ::
-
-  double -> Float
-
-StringValue(value) ::
-
-  Object with #to_str -> String
-
-StringValuePtr(value) ::
-
-  Object with #to_str -> pointer to String data
-
-StringValueCStr(value) ::
-
-  Object with #to_str -> pointer to String data without NULL bytes
-
-rb_str_new2(s) ::
-
-  char * -> String
-
-== Defining Class and Module
-
-VALUE rb_define_class(const char *name, VALUE super) ::
-
-  Defines a new Ruby class as a subclass of super.
-
-VALUE rb_define_class_under(VALUE module, const char *name, VALUE super) ::
-
-  Creates a new Ruby class as a subclass of super, under the module's
-  namespace.
-
-VALUE rb_define_module(const char *name) ::
-
-  Defines a new Ruby module.
-
-VALUE rb_define_module_under(VALUE module, const char *name) ::
-
-  Defines a new Ruby module under the module's namespace.
-
-void rb_include_module(VALUE klass, VALUE module) ::
-
-  Includes module into class.  If class already includes it, just ignored.
-
-void rb_extend_object(VALUE object, VALUE module) ::
-
-  Extend the object with the module's attributes.
-
-== Defining Global Variables
-
-void rb_define_variable(const char *name, VALUE *var) ::
-
-  Defines a global variable which is shared between C and Ruby.  If name
-  contains a character which is not allowed to be part of the symbol,
-  it can't be seen from Ruby programs.
-
-void rb_define_readonly_variable(const char *name, VALUE *var) ::
-
-  Defines a read-only global variable.  Works just like
-  rb_define_variable(), except the defined variable is read-only.
-
-void rb_define_virtual_variable(const char *name, VALUE (*getter)(), VALUE (*setter)()) ::
-
-  Defines a virtual variable, whose behavior is defined by a pair of C
-  functions.  The getter function is called when the variable is
-  referenced.  The setter function is called when the variable is set to a
-  value.  The prototype for getter/setter functions are:
-
-    VALUE getter(ID id)
-    void setter(VALUE val, ID id)
-
-  The getter function must return the value for the access.
-
-void rb_define_hooked_variable(const char *name, VALUE *var, VALUE (*getter)(), VALUE (*setter)()) ::
-
-  Defines hooked variable.  It's a virtual variable with a C variable.
-  The getter is called as
-
-    VALUE getter(ID id, VALUE *var)
-
-  returning a new value.  The setter is called as
-
-    void setter(VALUE val, ID id, VALUE *var)
-
-  GC requires C global variables which hold Ruby values to be marked.
-
-void rb_global_variable(VALUE *var)
-
-  Tells GC to protect these variables.
-
-== Constant Definition
-
-void rb_define_const(VALUE klass, const char *name, VALUE val) ::
-
-  Defines a new constant under the class/module.
-
-void rb_define_global_const(const char *name, VALUE val) ::
-
-  Defines a global constant.  This is just the same as
-
-    rb_define_const(cKernal, name, val)
-
-== Method Definition
-
-rb_define_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  Defines a method for the class.  func is the function pointer.  argc
-  is the number of arguments.  if argc is -1, the function will receive
-  3 arguments: argc, argv, and self.  if argc is -2, the function will
-  receive 2 arguments, self and args, where args is a Ruby array of
-  the method arguments.
-
-rb_define_private_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  Defines a private method for the class.  Arguments are same as
-  rb_define_method().
-
-rb_define_singleton_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  Defines a singleton method.  Arguments are same as rb_define_method().
-
-rb_scan_args(int argc, VALUE *argv, const char *fmt, ...) ::
-
-  Retrieve argument from argc and argv to given VALUE references
-  according to the format string.  The format can be described in ABNF
-  as follows:
-
-    scan-arg-spec  := param-arg-spec [option-hash-arg-spec] [block-arg-spec]
-
-    param-arg-spec := pre-arg-spec [post-arg-spec] / post-arg-spec /
-                      pre-opt-post-arg-spec
-    pre-arg-spec   := num-of-leading-mandatory-args [num-of-optional-args]
-    post-arg-spec  := sym-for-variable-length-args
-                      [num-of-trailing-mandatory-args]
-    pre-opt-post-arg-spec := num-of-leading-mandatory-args num-of-optional-args
-                             num-of-trailing-mandatory-args
-    option-hash-arg-spec := sym-for-option-hash-arg
-    block-arg-spec := sym-for-block-arg
-
-    num-of-leading-mandatory-args  := DIGIT ; The number of leading
-                                            ; mandatory arguments
-    num-of-optional-args           := DIGIT ; The number of optional
-                                            ; arguments
-    sym-for-variable-length-args   := "*"   ; Indicates that variable
-                                            ; length arguments are
-                                            ; captured as a ruby array
-    num-of-trailing-mandatory-args := DIGIT ; The number of trailing
-                                            ; mandatory arguments
-    sym-for-option-hash-arg        := ":"   ; Indicates that an option
-                                            ; hash is captured if the last
-                                            ; argument is a hash or can be
-                                            ; converted to a hash with
-                                            ; #to_hash.  When the last
-                                            ; argument is nil, it is
-                                            ; captured if it is not
-                                            ; ambiguous to take it as
-                                            ; empty option hash; i.e. '*'
-                                            ; is not specified and
-                                            ; arguments are given more
-                                            ; than sufficient.
-    sym-for-block-arg              := "&"   ; Indicates that an iterator
-                                            ; block should be captured if
-                                            ; given
-
-  For example, "12" means that the method requires at least one
-  argument, and at most receives three (1+2) arguments.  So, the format
-  string must be followed by three variable references, which are to be
-  assigned to captured arguments.  For omitted arguments, variables are
-  set to Qnil.  NULL can be put in place of a variable reference, which
-  means the corresponding captured argument(s) should be just dropped.
-
-  The number of given arguments, excluding an option hash or iterator
-  block, is returned.
-
-== Invoking Ruby method
-
-VALUE rb_funcall(VALUE recv, ID mid, int narg, ...) ::
-
-  Invokes a method.  To retrieve mid from a method name, use rb_intern().
-  Able to call even private/protected methods.
-
-VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv) ::
-VALUE rb_funcallv(VALUE recv, ID mid, int argc, VALUE *argv) ::
-
-  Invokes a method, passing arguments as an array of values.
-  Able to call even private/protected methods.
-
-VALUE rb_funcallv_public(VALUE recv, ID mid, int argc, VALUE *argv) ::
-
-  Invokes a method, passing arguments as an array of values.
-  Able to call only public methods.
-
-VALUE rb_eval_string(const char *str) ::
-
-  Compiles and executes the string as a Ruby program.
-
-ID rb_intern(const char *name) ::
-
-  Returns ID corresponding to the name.
-
-char *rb_id2name(ID id) ::
-
-  Returns the name corresponding ID.
-
-char *rb_class2name(VALUE klass) ::
-
-  Returns the name of the class.
-
-int rb_respond_to(VALUE object, ID id) ::
-
-  Returns true if the object responds to the message specified by id.
-
-== Instance Variables
-
-VALUE rb_iv_get(VALUE obj, const char *name) ::
-
-  Retrieve the value of the instance variable.  If the name is not
-  prefixed by `@', that variable shall be inaccessible from Ruby.
-
-VALUE rb_iv_set(VALUE obj, const char *name, VALUE val) ::
-
-  Sets the value of the instance variable.
-
-== Control Structure
-
-VALUE rb_block_call(VALUE recv, ID mid, int argc, VALUE * argv, VALUE (*func) (ANYARGS), VALUE data2) ::
-
-  Calls a method on the recv, with the method name specified by the
-  symbol mid, with argc arguments in argv, supplying func as the
-  block. When func is called as the block, it will receive the value
-  from yield as the first argument, and data2 as the second argument.
-  When yielded with multiple values (in C, rb_yield_values(),
-  rb_yield_values2() and rb_yield_splat()), data2 is packed as an Array,
-  whereas yielded values can be gotten via argc/argv of the third/fourth
-  arguments.
-
-[OBSOLETE] VALUE rb_iterate(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2) ::
-
-  Calls the function func1, supplying func2 as the block.  func1 will be
-  called with the argument arg1.  func2 receives the value from yield as
-  the first argument, arg2 as the second argument.
-
-  When rb_iterate is used in 1.9, func1 has to call some Ruby-level method.
-  This function is obsolete since 1.9; use rb_block_call instead.
-
-VALUE rb_yield(VALUE val) ::
-
-  Evaluates the block with value val.
-
-VALUE rb_rescue(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2) ::
-
-  Calls the function func1, with arg1 as the argument.  If an exception
-  occurs during func1, it calls func2 with arg2 as the argument.  The
-  return value of rb_rescue() is the return value from func1 if no
-  exception occurs, from func2 otherwise.
-
-VALUE rb_ensure(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2) ::
-
-  Calls the function func1 with arg1 as the argument, then calls func2
-  with arg2 if execution terminated.  The return value from
-  rb_ensure() is that of func1 when no exception occurred.
-
-VALUE rb_protect(VALUE (*func) (VALUE), VALUE arg, int *state) ::
-
-  Calls the function func with arg as the argument.  If no exception
-  occurred during func, it returns the result of func and *state is zero.
-  Otherwise, it returns Qnil and sets *state to nonzero.  If state is
-  NULL, it is not set in both cases.
-  You have to clear the error info with rb_set_errinfo(Qnil) when
-  ignoring the caught exception.
-
-void rb_jump_tag(int state) ::
-
-  Continues the exception caught by rb_protect() and rb_eval_string_protect().
-  state must be the returned value from those functions.  This function
-  never return to the caller.
-
-void rb_iter_break() ::
-
-  Exits from the current innermost block.  This function never return to
-  the caller.
-
-void rb_iter_break_value(VALUE value) ::
-
-  Exits from the current innermost block with the value.  The block will
-  return the given argument value.  This function never return to the
-  caller.
-
-== Exceptions and Errors
-
-void rb_warn(const char *fmt, ...) ::
-
-  Prints a warning message according to a printf-like format.
-
-void rb_warning(const char *fmt, ...) ::
-
-  Prints a warning message according to a printf-like format, if
-  $VERBOSE is true.
-
-void rb_raise(rb_eRuntimeError, const char *fmt, ...) ::
-
-  Raises RuntimeError.  The fmt is a format string just like printf().
-
-void rb_raise(VALUE exception, const char *fmt, ...) ::
-
-  Raises a class exception.  The fmt is a format string just like printf().
-
-void rb_fatal(const char *fmt, ...) ::
-
-  Raises a fatal error, terminates the interpreter.  No exception handling
-  will be done for fatal errors, but ensure blocks will be executed.
-
-void rb_bug(const char *fmt, ...) ::
-
-  Terminates the interpreter immediately.  This function should be
-  called under the situation caused by the bug in the interpreter.  No
-  exception handling nor ensure execution will be done.
-
-Note: In the format string, %i is used for Object#to_s (or Object#inspect if
-'+' flag is set) output (and related argument must be a VALUE).  For integers
-in format strings, use %d.
-
-== Initialize and Start the Interpreter
-
-The embedding API functions are below (not needed for extension libraries):
-
-void ruby_init() ::
-
-  Initializes the interpreter.
-
-void ruby_options(int argc, char **argv) ::
-
-  Process command line arguments for the interpreter.
-
-void ruby_run() ::
-
-  Starts execution of the interpreter.
-
-void ruby_script(char *name) ::
-
-  Specifies the name of the script ($0).
-
-== Hooks for the Interpreter Events
-
-  void rb_add_event_hook(rb_event_hook_func_t func, rb_event_flag_t events,
-                         VALUE data)
-
-Adds a hook function for the specified interpreter events.
-events should be OR'ed value of:
-
-  RUBY_EVENT_LINE
-  RUBY_EVENT_CLASS
-  RUBY_EVENT_END
-  RUBY_EVENT_CALL
-  RUBY_EVENT_RETURN
-  RUBY_EVENT_C_CALL
-  RUBY_EVENT_C_RETURN
-  RUBY_EVENT_RAISE
-  RUBY_EVENT_ALL
-
-The definition of rb_event_hook_func_t is below:
-
-  typedef void (*rb_event_hook_func_t)(rb_event_t event, VALUE data,
-                                       VALUE self, ID id, VALUE klass)
-
-The third argument `data' to rb_add_event_hook() is passed to the hook
-function as the second argument, which was the pointer to the current
-NODE in 1.8.  See RB_EVENT_HOOKS_HAVE_CALLBACK_DATA below.
-
-  int rb_remove_event_hook(rb_event_hook_func_t func)
-
-Removes the specified hook function.
-
-== Macros for Compatibility
-
-Some macros to check API compatibilities are available by default.
-
-NORETURN_STYLE_NEW ::
-
-  Means that NORETURN macro is functional style instead of prefix.
-
-HAVE_RB_DEFINE_ALLOC_FUNC ::
-
-  Means that function rb_define_alloc_func() is provided, that means the
-  allocation framework is used.  This is same as the result of
-  have_func("rb_define_alloc_func", "ruby.h").
-
-HAVE_RB_REG_NEW_STR ::
-
-  Means that function rb_reg_new_str() is provided, that creates Regexp
-  object from String object.  This is same as the result of
-  have_func("rb_reg_new_str", "ruby.h").
-
-HAVE_RB_IO_T ::
-
-  Means that type rb_io_t is provided.
-
-USE_SYMBOL_AS_METHOD_NAME ::
-
-  Means that Symbols will be returned as method names, e.g.,
-  Module#methods, #singleton_methods and so on.
-
-HAVE_RUBY_*_H ::
-
-  Defined in ruby.h and means corresponding header is available.  For
-  instance, when HAVE_RUBY_ST_H is defined you should use ruby/st.h not
-  mere st.h.
-
-RB_EVENT_HOOKS_HAVE_CALLBACK_DATA ::
-
-  Means that rb_add_event_hook() takes the third argument `data', to be
-  passed to the given event hook function.
-
-= Appendix C. Functions available for use in extconf.rb
-
-See documentation for {mkmf}[rdoc-ref:MakeMakefile].
-
-/*
- * Local variables:
- * fill-column: 70
- * end:
- */
+Moved to doc/extension.rdoc
diff --git a/README.EXT.ja b/README.EXT.ja
index 14c35f3707..f884ecbb0e 100644
--- a/README.EXT.ja
+++ b/README.EXT.ja
@@ -1,1626 +1 @@
-# README.EXT.ja -  -*- RDoc -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-Rubyの拡張ライブラリの作り方を説明します．
-
-= 基礎知識
-
-Cの変数には型があり，データには型がありません．ですから，た
-とえばポインタをintの変数に代入すると，その値は整数として取
-り扱われます．逆にRubyの変数には型がなく，データに型がありま
-す．この違いのため，CとRubyは相互に変換しなければ，お互いの
-データをアクセスできません．
-
-RubyのデータはVALUEというCの型で表現されます．VALUE型のデー
-タはそのデータタイプを自分で知っています．このデータタイプと
-いうのはデータ(オブジェクト)の実際の構造を意味していて，Ruby
-のクラスとはまた違ったものです．
-
-VALUEからCにとって意味のあるデータを取り出すためには
-
-1. VALUEのデータタイプを知る
-2. VALUEをCのデータに変換する
-
-の両方が必要です．(1)を忘れると間違ったデータの変換が行われ
-て，最悪プログラムがcore dumpします．
-
-== データタイプ
-
-Rubyにはユーザが使う可能性のある以下のタイプがあります．
-
-T_NIL      :: nil
-T_OBJECT   :: 通常のオブジェクト
-T_CLASS    :: クラス
-T_MODULE   :: モジュール
-T_FLOAT    :: 浮動小数点数
-T_STRING   :: 文字列
-T_REGEXP   :: 正規表現
-T_ARRAY    :: 配列
-T_HASH     :: 連想配列
-T_STRUCT   :: (Rubyの)構造体
-T_BIGNUM   :: 多倍長整数
-T_FIXNUM   :: Fixnum(31bitまたは63bit長整数)
-T_COMPLEX  :: 複素数
-T_RATIONAL :: 有理数
-T_FILE     :: 入出力
-T_TRUE     :: 真
-T_FALSE    :: 偽
-T_DATA     :: データ
-T_SYMBOL   :: シンボル
-
-その他に内部で利用されている以下のタイプがあります．
-
-  T_ICLASS
-  T_MATCH
-  T_UNDEF
-  T_NODE
-  T_ZOMBIE
-
-ほとんどのタイプはCの構造体で実装されています．
-
-== VALUEのデータタイプをチェックする
-
-ruby.hではTYPE()というマクロが定義されていて，VALUEのデータ
-タイプを知ることが出来ます．TYPE()マクロは上で紹介したT_XXXX
-の形式の定数を返します．VALUEのデータタイプに応じて処理する
-場合には，TYPE()の値で分岐することになります．
-
-  switch (TYPE(obj)) {
-    case T_FIXNUM:
-      /* FIXNUMの処理 */
-      break;
-    case T_STRING:
-      /* 文字列の処理 */
-      break;
-    case T_ARRAY:
-      /* 配列の処理 */
-      break;
-    default:
-      /* 例外を発生させる */
-      rb_raise(rb_eTypeError, "not valid value");
-      break;
-  }
-
-それとデータタイプをチェックして，正しくなければ例外を発生す
-る関数が用意されています．
-
-  void Check_Type(VALUE value, int type)
-
-この関数はvalueがtypeで無ければ，例外を発生させます．引数と
-して与えられたVALUEのデータタイプが正しいかどうかチェックす
-るためには，この関数を使います．
-
-FIXNUMとNILに関してはより高速な判別マクロが用意されています．
-
-  FIXNUM_P(obj)
-  NIL_P(obj)
-
-== VALUEをCのデータに変換する
-
-データタイプがT_NIL，T_FALSE，T_TRUEである時，データはそれぞ
-れnil，false，trueです．このデータタイプのオブジェクトはひと
-つずつしか存在しません．
-
-データタイプがT_FIXNUMの時，これは31bitまたは63bitのサイズを
-持つ整数です．longのサイズが32bitのプラットフォームであれば
-31bitに，longのサイズが64bitのプラットフォームであれば63bit
-になります. FIXNUM を C の整数に変換するためにはマクロ
-「FIX2INT()」または「FIX2LONG()」を使います．これらのマクロ
-を使用する際には事前にデータタイプがFIXNUMであることを確認す
-る必要がありますが，比較的高速に変換を行うことができます．ま
-た，「FIX2LONG()」は例外を発生しませんが，「FIX2INT()」は変
-換結果がintのサイズに収まらない場合には例外を発生します．
-それから，FIXNUMに限らずRubyのデータを整数に変換する
-「NUM2INT()」および「NUM2LONG()」というマクロがあります．こ
-れらのマクロはマクロはデータタイプのチェック無しで使えます
-(整数に変換できない場合には例外が発生する)．同様にチェック無
-で使える変換マクロはdoubleを取り出す「NUM2DBL()」があります．
-
-char* を取り出す場合， StringValue() と StringValuePtr()
-を使います．
-StringValue(var) は var が String
-であれば何もせず，そうでなければ var を var.to_str() の結果
-に置き換えるマクロ，StringValuePtr(var) は同様に var を
-String に置き換えてから var のバイト列表現に対する char* を
-返すマクロです．var の内容を直接置き換える処理が入るので，
-var は lvalue である必要があります．
-また，StringValuePtr() に類似した StringValueCStr() というマ
-クロもあります．StringValueCStr(var) は var を String に置き
-換えてから var の文字列表現に対する char* を返します．返され
-る文字列の末尾には nul 文字が付加されます．なお，途中に nul
-文字が含まれる場合は ArgumentError が発生します．
-一方，StringValuePtr() では，末尾に nul 文字がある保証はなく，
-途中に nul 文字が含まれている可能性もあります．
-
-それ以外のデータタイプは対応するCの構造体があります．対応す
-る構造体のあるVALUEはそのままキャスト(型変換)すれば構造体の
-ポインタに変換できます．
-
-構造体は「struct RXxxxx」という名前でruby.hで定義されていま
-す．例えば文字列は「struct RString」です．実際に使う可能性が
-あるのは文字列と配列くらいだと思います．
-
-ruby.hでは構造体へキャストするマクロも「RXXXXX()」(全部大文
-字にしたもの)という名前で提供されています(例: RSTRING())．
-
-構造体からデータを取り出すマクロが提供されています．文字列
-strの長さを得るためには「RSTRING_LEN(str)」とし，文字列strを
-char*として得るためには「RSTRING_PTR(str)」とします．配列の
-場合には，それぞれ「RARRAY_LEN(ary)」，「RARRAY_PTR(ary)」と
-なります．
-
-Rubyの構造体を直接アクセスする時に気をつけなければならないこ
-とは，配列や文字列の構造体の中身は参照するだけで，直接変更し
-ないことです．直接変更した場合，オブジェクトの内容の整合性が
-とれなくなって，思わぬバグの原因になります．
-
-== CのデータをVALUEに変換する
-
-VALUEの実際の構造は
-
-FIXNUMの場合 ::
-
-  1bit左シフトして，LSBを立てる．
-
-その他のポインタの場合 ::
-
-  そのままVALUEにキャストする．
-
-となっています．よって，LSBをチェックすればVALUEがFIXNUMかど
-うかわかるわけです(ポインタのLSBが立っていないことを仮定して
-いる)．
-
-ですから，FIXNUM以外のRubyのオブジェクトの構造体は単にVALUE
-にキャストするだけでVALUEに変換出来ます．ただし，任意の構造
-体がVALUEにキャスト出来るわけではありません．キャストするの
-はRubyの知っている構造体(ruby.hで定義されているstruct RXxxx
-のもの)だけです．
-
-FIXNUMに関しては変換マクロを経由する必要があります．Cの整数
-からVALUEに変換するマクロは以下のものがあります．必要に応じ
-て使い分けてください．
-
-INT2FIX() :: もとの整数が31bitまたは63bit以内に収まる自信
-      	     がある時
-INT2NUM() :: 任意の整数からVALUEへ
-
-INT2NUM()は整数がFIXNUMの範囲に収まらない場合，Bignumに変換
-してくれます(が，少し遅い)．
-
-== Rubyのデータを操作する
-
-先程も述べた通り，Rubyの構造体をアクセスする時に内容の更新を
-行うことは勧められません．で，Rubyのデータを操作する時には
-Rubyが用意している関数を用いてください．
-
-ここではもっとも使われるであろう文字列と配列の生成/操作を行
-う関数をあげます(全部ではないです)．
-
-=== 文字列に対する関数
-
-rb_str_new(const char *ptr, long len) ::
-
-  新しいRubyの文字列を生成する．
-
-rb_str_new2(const char *ptr)
-rb_str_new_cstr(const char *ptr)
-
-  Cの文字列からRubyの文字列を生成する．この関数の機能は
-  rb_str_new(ptr, strlen(ptr))と同等である．
-
-rb_tainted_str_new(const char *ptr, long len)
-
-  汚染マークが付加された新しいRubyの文字列を生成する．外部
-  からのデータに基づく文字列には汚染マークが付加されるべき
-  である．
-
-rb_tainted_str_new2(const char *ptr)
-rb_tainted_str_new_cstr(const char *ptr)
-
-  Cの文字列から汚染マークが付加されたRubyの文字列を生成する．
-
-rb_sprintf(const char *format, ...)
-rb_vsprintf(const char *format, va_list ap)
-
-  Cの文字列formatと続く引数をprintf(3)のフォーマットにしたがって
-  整形し，Rubyの文字列を生成する．
-
-  注意: %iはObject#to_s('+'フラグが指定されているときはObject#inspect)を
-  使ったVALUEの出力に使用されているため，整数には%dを使用すること．
-
-rb_str_cat(VALUE str, const char *ptr, long len)
-
-  Rubyの文字列strにlenバイトの文字列ptrを追加する．
-
-rb_str_cat2(VALUE str, const char* ptr)
-
-  Rubyの文字列strにCの文字列ptrを追加する．この関数の機能は
-  rb_str_cat(str, ptr, strlen(ptr))と同等である．
-
-rb_str_catf(VALUE str, const char* format, ...)
-rb_str_vcatf(VALUE str, const char* format, va_list ap)
-
-  Cの文字列formatと続く引数をprintf(3)のフォーマットにしたがって
-  整形し，Rubyの文字列strに追加する．この関数の機能は，それぞれ
-  rb_str_cat2(str, rb_sprintf(format, ...)) や
-  rb_str_cat2(str, rb_vsprintf(format, ap)) と同等である．
-
-rb_enc_str_new(const char *ptr, long len, rb_encoding *enc)
-
-  指定されたエンコーディングでRubyの文字列を生成する.
-
-rb_usascii_str_new(const char *ptr, long len)
-rb_usascii_str_new_cstr(const char *ptr)
-
-  エンコーディングがUS-ASCIIのRubyの文字列を生成する.
-
-rb_str_resize(VALUE str, long len)
-
-  Rubyの文字列のサイズをlenバイトに変更する．strの長さは前
-  以てセットされていなければならない．lenが元の長さよりも短
-  い時は，lenバイトを越えた部分の内容は捨てられる．lenが元
-  の長さよりも長い時は，元の長さを越えた部分の内容は保存さ
-  れないでゴミになるだろう．この関数の呼び出しによって
-  RSTRING_PTR(str)が変更されるかもしれないことに注意．
-
-rb_str_set_len(VALUE str, long len)
-
-  Rubyの文字列のサイズをlenバイトにセットする．strが変更可
-  能でなければ例外が発生する．RSTRING_LEN(str)とは無関係に，
-  lenバイトまでの内容は保存される．lenはstrの容量を越えてい
-  てはならない．
-
-
-== 配列に対する関数
-
-rb_ary_new()
-
-  要素が0の配列を生成する．
-
-rb_ary_new2(long len)
-rb_ary_new_capa(long len)
-
-  要素が0の配列を生成する．len要素分の領域をあらかじめ割り
-  当てておく．
-
-rb_ary_new3(long n, ...)
-rb_ary_new_from_args(long n, ...)
-
-  引数で指定したn要素を含む配列を生成する．
-
-rb_ary_new4(long n, VALUE *elts)
-rb_ary_new_from_values(long n, VALUE *elts)
-
-  配列で与えたn要素の配列を生成する．
-
-rb_ary_to_ary(VALUE obj)
-
-  オブジェクトを配列に変換する.
-  Object#to_aryと同等である.
-
-他にも配列を操作する関数が多数ある. これらは
-引数aryに配列を渡さなければならない. さもないと
-コアを吐く.
-
-rb_ary_aref(argc, VALUE *argv, VALUE ary)
-
-  Array#[]と同等.
-
-rb_ary_entry(VALUE ary, long offset)
-
-  ary[offset]
-
-rb_ary_subseq(VALUE ary, long beg, long len)
-
-  ary[beg, len]
-
-rb_ary_push(VALUE ary, VALUE val)
-rb_ary_pop(VALUE ary)
-rb_ary_shift(VALUE ary)
-rb_ary_unshift(VALUE ary, VALUE val)
-
-rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
-
-  配列aryにptrからlen個のオブジェクトを追加する．
-
-= Rubyの機能を使う
-
-原理的にRubyで書けることはCでも書けます．RubyそのものがCで記
-述されているんですから，当然といえば当然なんですけど．ここで
-はRubyの拡張に使うことが多いだろうと予測される機能を中心に紹
-介します．
-
-== Rubyに機能を追加する
-
-Rubyで提供されている関数を使えばRubyインタプリタに新しい機能
-を追加することができます．Rubyでは以下の機能を追加する関数が
-提供されています．
-
-* クラス，モジュール
-* メソッド，特異メソッドなど
-* 定数
-
-では順に紹介します．
-
-=== クラス/モジュール定義
-
-クラスやモジュールを定義するためには，以下の関数を使います．
-
-  VALUE rb_define_class(const char *name, VALUE super)
-  VALUE rb_define_module(const char *name)
-
-これらの関数は新しく定義されたクラスやモジュールを返します．
-メソッドや定数の定義にこれらの値が必要なので，ほとんどの場合
-は戻り値を変数に格納しておく必要があるでしょう．
-
-クラスやモジュールを他のクラスの内部にネストして定義する時に
-は以下の関数を使います．
-
-  VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, const char *name)
-
-=== メソッド/特異メソッド定義
-
-メソッドや特異メソッドを定義するには以下の関数を使います．
-
-  void rb_define_method(VALUE klass, const char *name,
-                        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, const char *name,
-                                  VALUE (*func)(), int argc)
-
-
-念のため説明すると「特異メソッド」とは，その特定のオブジェク
-トに対してだけ有効なメソッドです．RubyではよくSmalltalkにお
-けるクラスメソッドとして，クラスに対する特異メソッドが使われ
-ます．
-
-これらの関数の argcという引数はCの関数へ渡される引数の数(と
-形式)を決めます．argcが0以上の時は関数に引き渡す引数の数を意
-味します．16個以上の引数は使えません(が，要りませんよね，そ
-んなに)．実際の関数には先頭の引数としてselfが与えられますの
-で，指定した数より1多い引数を持つことになります．
-
-argcが負の時は引数の数ではなく，形式を指定したことになります．
-argcが-1の時は引数を配列に入れて渡されます．argcが-2の時は引
-数はRubyの配列として渡されます．
-
-メソッドを定義する関数はまだいくつかあります. ひとつはメソッド
-名としてIDを取ります. IDについては2.2.2を参照.
-
-  void rb_define_method_id(VALUE klass, ID name,
-                           VALUE (*func)(ANYARGS), int argc)
-
-private/protectedなメソッドを定義するふたつの関数があります.
-
-  void rb_define_private_method(VALUE klass, const char *name,
-				VALUE (*func)(), int argc)
-  void rb_define_protected_method(VALUE klass, const char *name,
-			          VALUE (*func)(), int argc)
-
-privateメソッドとは関数形式でしか呼び出すことの出来ないメソッ
-ドです．
-
-最後に， rb_define_module関数はモジュール関数を定義します．
-モジュール関数とはモジュールの特異メソッドであり，同時に
-privateメソッドでもあるものです．例をあげるとMathモジュール
-のsqrt()などがあげられます．このメソッドは
-
-  Math.sqrt(4)
-
-という形式でも
-
-  include Math
-  sqrt(4)
-
-という形式でも使えます．モジュール関数を定義する関数は以下の
-通りです．
-
-  void rb_define_module_function(VALUE module, const char *name,
-		                 VALUE (*func)(), int argc)
-
-関数的メソッド(Kernelモジュールのprivate method)を定義するた
-めの関数は以下の通りです．
-
-  void rb_define_global_function(const char *name, VALUE (*func)(), int argc)
-
-
-メソッドの別名を定義するための関数は以下の通りです．
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-属性の取得・設定メソッドを定義するには
-
-  void rb_define_attr(VALUE klass, const char *name, int read, int write)
-
-クラスメソッドallocateを定義したり削除したりするための関数は
-以下の通りです．
-
-  void rb_define_alloc_func(VALUE klass, VALUE (*func)(VALUE klass));
-  void rb_undef_alloc_func(VALUE klass);
-
-funcはクラスを引数として受け取って，新しく割り当てられたイン
-スタンスを返さなくてはなりません．このインスタンスは，外部リ
-ソースなどを含まない，できるだけ「空」のままにしておいたほう
-がよいでしょう．
-
-=== 定数定義
-
-拡張ライブラリが必要な定数はあらかじめ定義しておいた方が良い
-でしょう．定数を定義する関数は二つあります．
-
-  void rb_define_const(VALUE klass, const char *name, VALUE val)
-  void rb_define_global_const(const char *name, VALUE val)
-
-前者は特定のクラス/モジュールに属する定数を定義するもの，後
-者はグローバルな定数を定義するものです．
-
-== Rubyの機能をCから呼び出す
-
-既に『1.5 Rubyのデータを操作する』で一部紹介したような関数を
-使えば，Rubyの機能を実現している関数を直接呼び出すことが出来
-ます．
-
-# このような関数の一覧表はいまのところありません．ソースを見
-# るしかないですね．
-
-それ以外にもRubyの機能を呼び出す方法はいくつかあります．
-
-=== Rubyのプログラムをevalする
-
-CからRubyの機能を呼び出すもっとも簡単な方法として，文字列で
-与えられたRubyのプログラムを評価する以下の関数があります．
-
-  VALUE rb_eval_string(const char *str)
-
-この評価は現在の環境で行われます．つまり，現在のローカル変数
-などを受け継ぎます．
-
-評価は例外を発生するかもしれないことに注意しましょう. より安全
-な関数もあります.
-
-  VALUE rb_eval_string_protect(const char *str, int *state)
-
-この関数はエラーが発生するとnilを返します．そして，成功時には
-*stateはゼロに，さもなくば非ゼロになります．
-
-=== IDまたはシンボル
-
-Cから文字列を経由せずにRubyのメソッドを呼び出すこともできま
-す．その前に，Rubyインタプリタ内でメソッドや変数名を指定する
-時に使われているIDについて説明しておきましょう．
-
-IDとは変数名，メソッド名を表す整数です．Rubyの中では
-
- :識別子
-
-または
-
- :"任意の文字列"
-
-でアクセスできます．Cからこの整数を得るためには関数
-
-  rb_intern(const char *name)
-  rb_intern_str(VALUE name)
-
-を使います．Rubyから引数として与えられたシンボル(または文字
-列)をIDに変換するには以下の関数を使います．
-
-  rb_to_id(VALUE symbol)
-  rb_check_id(volatile VALUE *name)
-  rb_check_id_cstr(const char *name, long len, rb_encoding *enc)
-
-もし引数がシンボルでも文字列でもなければ、to_strメソッドで文
-字列に変換しようとします．第二の関数はその変換結果を*nameに保
-存し,その名前が既知のシンボルでない場合は0を返します．この関
-数が0以外を返した場合は*nameは常にシンボルか文字列であり、0を
-返した場合は常に文字列です．第三の関数はRubyの文字列ではなく
-NUL終端されたCの文字列を使います．
-
-=== CからRubyのメソッドを呼び出す
-
-Cから文字列を経由せずにRubyのメソッドを呼び出すためには以下
-の関数を使います．
-
-  VALUE rb_funcall(VALUE recv, ID mid, int argc, ...)
-
-この関数はオブジェクトrecvのmidで指定されるメソッドを呼び出
-します．その他に引数の指定の仕方が違う以下の関数もあります．
-
-  VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-  VALUE rb_funcallv(VALUE recv, ID mid, int argc, VALUE *argv)
-  VALUE rb_apply(VALUE recv, ID mid, VALUE args)
-
-applyには引数としてRubyの配列を与えます．
-
-=== 変数/定数を参照/更新する
-
-Cから関数を使って参照・更新できるのは，定数，インスタンス変
-数です．大域変数は一部のものはCの大域変数としてアクセスでき
-ます．ローカル変数を参照する方法は公開していません．
-
-オブジェクトのインスタンス変数を参照・更新する関数は以下の通
-りです．
-
-  VALUE rb_ivar_get(VALUE obj, ID id)
-  VALUE rb_ivar_set(VALUE obj, ID id, VALUE val)
-
-idはrb_intern()で得られるものを使ってください．
-
-定数を参照するには以下の関数を使ってください．
-
-  VALUE rb_const_get(VALUE obj, ID id)
-
-定数を新しく定義するためには『2.1.3 定数定義』で紹介さ
-れている関数を使ってください．
-
-= RubyとCとの情報共有
-
-C言語とRubyの間で情報を共有する方法について解説します．
-
-== Cから参照できるRubyの定数
-
-以下のRubyの定数はCのレベルから参照できます．
-
-  Qtrue
-  Qfalse
-
-真偽値．QfalseはC言語でも偽とみなされます(つまり0)．
-
-  Qnil
-
-C言語から見た「nil」．
-
-== CとRubyで共有される大域変数
-
-CとRubyで大域変数を使って情報を共有できます．共有できる大域
-変数にはいくつかの種類があります．そのなかでもっとも良く使わ
-れると思われるのはrb_define_variable()です．
-
-  void rb_define_variable(const char *name, VALUE *var)
-
-この関数はRubyとCとで共有する大域変数を定義します．変数名が
-`$'で始まらない時には自動的に追加されます．この変数の値を変
-更すると自動的にRubyの対応する変数の値も変わります．
-
-またRuby側からは更新できない変数もあります．このread onlyの
-変数は以下の関数で定義します．
-
-  void rb_define_readonly_variable(const char *name, VALUE *var)
-
-これら変数の他にhookをつけた大域変数を定義できます．hook付き
-の大域変数は以下の関数を用いて定義します．hook付き大域変数の
-値の参照や設定はhookで行う必要があります．
-
-  void rb_define_hooked_variable(const char *name, VALUE *var,
-				 VALUE (*getter)(), void (*setter)())
-
-この関数はCの関数によってhookのつけられた大域変数を定義しま
-す．変数が参照された時には関数getterが，変数に値がセットされ
-た時には関数setterが呼ばれる．hookを指定しない場合はgetterや
-setterに0を指定します．
-# getterもsetterも0ならばrb_define_variable()と同じになる．
-
-getterとsetterの仕様は次の通りです．
-
-  VALUE (*getter)(ID id, VALUE *var);
-  void (*setter)(VALUE val, ID id, VALUE *var);
-
-
-それから，対応するCの変数を持たないRubyの大域変数を定義する
-こともできます. その変数の値はフック関数のみによって取得・設定
-されます.
-
-  void rb_define_virtual_variable(const char *name,
-				  VALUE (*getter)(), void (*setter)())
-
-この関数によって定義されたRubyの大域変数が参照された時には
-getterが，変数に値がセットされた時にはsetterが呼ばれます．
-
-getterとsetterの仕様は以下の通りです．
-
-  (*getter)(ID id);
-  (*setter)(VALUE val, ID id);
-
-== CのデータをRubyオブジェクトにする
-
-Cの世界で定義されたデータ(構造体)をRubyのオブジェクトとして
-取り扱いたい場合がありえます．このような場合には，Dataという
-RubyオブジェクトにCの構造体(へのポインタ)をくるむことでRuby
-オブジェクトとして取り扱えるようになります．
-
-Dataオブジェクトを生成して構造体をRubyオブジェクトにカプセル
-化するためには，以下のマクロを使います．
-
-  Data_Wrap_Struct(klass, mark, free, sval)
-
-このマクロの戻り値は生成されたDataオブジェクトです．
-
-klassはこのDataオブジェクトのクラスです．markはこの構造体が
-Rubyのオブジェクトへの参照がある時に使う関数です．そのような
-参照を含まない時には0を指定します．
-
-# そのような参照は勧められません．
-
-freeはこの構造体がもう不要になった時に呼ばれる関数です．この
-関数がガーベージコレクタから呼ばれます．これが-1の場合は，単
-純に開放されます．
-
-markおよびfree関数はGC実行中に呼び出されます.
-なお, GC実行中はRubyオブジェクトのアロケーションは禁止されま
-す. よって, markおよびfree関数でRubyオブジェクトのアロケーシ
-ョンは行わないでください.
-
-Cの構造体の割当とDataオブジェクトの生成を同時に行うマクロと
-して以下のものが提供されています．
-
-  Data_Make_Struct(klass, type, mark, free, sval)
-
-このマクロの戻り値は生成されたDataオブジェクトです．このマク
-ロは以下の式のように働きます:
-
-  (sval = ALLOC(type), Data_Wrap_Struct(klass, mark, free, sval))
-
-klass, mark, freeはData_Wrap_Structと同じ働きをします．type
-は割り当てるC構造体の型です．割り当てられた構造体は変数sval
-に代入されます．この変数の型は (type*) である必要があります．
-
-Dataオブジェクトからポインタを取り出すのは以下のマクロを用い
-ます．
-
-  Data_Get_Struct(obj, type, sval)
-
-Cの構造体へのポインタは変数svalに代入されます．
-
-これらのDataの使い方はちょっと分かりにくいので，後で説明する
-例題を参照してください．
-
-= 例題 - dbmパッケージを作る
-
-ここまでの説明でとりあえず拡張ライブラリは作れるはずです．
-Rubyのextディレクトリにすでに含まれているdbmライブラリを例に
-して段階的に説明します．
-
-== ディレクトリを作る
-
-  % mkdir ext/dbm
-
-Ruby 1.1からは任意のディレクトリでダイナミックライブラリを作
-ることができるようになりました．Rubyに静的にリンクする場合に
-はRubyを展開したディレクトリの下，extディレクトリの中に拡張
-ライブラリ用のディレクトリを作る必要があります．名前は適当に
-選んで構いません．
-
-== 設計する
-
-まあ，当然なんですけど，どういう機能を実現するかどうかまず設
-計する必要があります．どんなクラスをつくるか，そのクラスには
-どんなメソッドがあるか，クラスが提供する定数などについて設計
-します．
-
-== Cコードを書く
-
-拡張ライブラリ本体となるC言語のソースを書きます．C言語のソー
-スがひとつの時には「ライブラリ名.c」を選ぶと良いでしょう．C
-言語のソースが複数の場合には逆に「ライブラリ名.c」というファ
-イル名は避ける必要があります．オブジェクトファイルとモジュー
-ル生成時に中間的に生成される「ライブラリ名.o」というファイル
-とが衝突するからです．また，後述する mkmf ライブラリのいくつ
-かの関数がコンパイルを要するテストのために「conftest.c」とい
-うファイル名を使用することに注意してください．ソースファイル
-名として「conftest.c」を使用してはなりません．
-
-Rubyは拡張ライブラリをロードする時に「Init_ライブラリ名」と
-いう関数を自動的に実行します．dbmライブラリの場合「Init_dbm」
-です．この関数の中でクラス，モジュール，メソッド，定数などの
-定義を行います．dbm.cから一部引用します．
-
-  void
-  Init_dbm(void)
-  {
-      /* DBMクラスを定義する */
-      cDBM = rb_define_class("DBM", rb_cObject);
-      /* DBMはEnumerateモジュールをインクルードする */
-      rb_include_module(cDBM, rb_mEnumerable);
-
-      /* DBMクラスのクラスメソッドopen(): 引数はCの配列で受ける */
-      rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1);
-
-      /* DBMクラスのメソッドclose(): 引数はなし */
-      rb_define_method(cDBM, "close", fdbm_close, 0);
-      /* DBMクラスのメソッド[]: 引数は1個 */
-      rb_define_method(cDBM, "[]", fdbm_fetch, 1);
-
-      /* ... */
-
-      /* DBMデータを格納するインスタンス変数名のためのID */
-      id_dbm = rb_intern("dbm");
-  }
-
-DBMライブラリはdbmのデータと対応するオブジェクトになるはずで
-すから，Cの世界のdbmをRubyの世界に取り込む必要があります．
-
-dbm.cではData_Make_Structを以下のように使っています．
-
-  struct dbmdata {
-      int  di_size;
-      DBM *di_dbm;
-  };
-
-
-  obj = Data_Make_Struct(klass, struct dbmdata, 0, free_dbm, dbmp);
-
-ここではdbmstruct構造体へのポインタをDataにカプセル化してい
-ます．DBM*を直接カプセル化しないのはclose()した時の処理を考
-えてのことです．
-
-Dataオブジェクトからdbmstruct構造体のポインタを取り出すため
-に以下のマクロを使っています．
-
-  #define GetDBM(obj, dbmp) {\
-      Data_Get_Struct(obj, struct dbmdata, dbmp);\
-      if (dbmp->di_dbm == 0) closed_dbm();\
-  }
-
-ちょっと複雑なマクロですが，要するにdbmdata構造体のポインタ
-の取り出しと，closeされているかどうかのチェックをまとめてい
-るだけです．
-
-DBMクラスにはたくさんメソッドがありますが，分類すると3種類の
-引数の受け方があります．ひとつは引数の数が固定のもので，例と
-してはdeleteメソッドがあります．deleteメソッドを実装している
-fdbm_delete()はこのようになっています．
-
-  static VALUE
-  fdbm_delete(VALUE obj, VALUE keystr)
-  {
-      /* ... */
-  }
-
-引数の数が固定のタイプは第1引数がself，第2引数以降がメソッド
-の引数となります．
-
-引数の数が不定のものはCの配列で受けるものとRubyの配列で受け
-るものとがあります．dbmライブラリの中で，Cの配列で受けるもの
-はDBMのクラスメソッドであるopen()です．これを実装している関
-数fdbm_s_open()はこうなっています．
-
-  static VALUE
-  fdbm_s_open(int argc, VALUE *argv, VALUE klass)
-  {
-      /* ... */
-
-      if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) {
-  	mode = 0666;		/* default value */
-      }
-
-      /* ... */
-  }
-
-このタイプの関数は第1引数が与えられた引数の数，第2引数が与え
-られた引数の入っている配列になります．selfは第3引数として与
-えられます．
-
-この配列で与えられた引数を解析するための関数がopen()でも使わ
-れているrb_scan_args()です．第3引数に指定したフォーマットに従
-い，第4変数以降に指定したVALUEへの参照に値を代入してくれま
-す．
-
-
-引数をRubyの配列として受け取るメソッドの例には
-Thread#initializeがあります．実装はこうです．
-
-  static VALUE
-  thread_initialize(VALUE thread, VALUE args)
-  {
-      /* ... */
-  }
-
-第1引数はself，第2引数はRubyの配列です．
-
-*注意事項*
-
-Rubyと共有はしないがRubyのオブジェクトを格納する可能性のある
-Cの大域変数は以下の関数を使ってRubyインタプリタに変数の存在
-を教えてあげてください．でないとGCでトラブルを起こします．
-
-  void rb_global_variable(VALUE *var)
-
-== extconf.rbを用意する
-
-Makefileを作る場合の雛型になるextconf.rbというファイルを作り
-ます．extconf.rbはライブラリのコンパイルに必要な条件のチェッ
-クなどを行うことが目的です．まず，
-
-  require 'mkmf'
-
-をextconf.rbの先頭に置きます．extconf.rbの中では以下のRuby関
-数を使うことが出来ます．
-
-  have_library(lib, func): ライブラリの存在チェック
-  have_func(func, header): 関数の存在チェック
-  have_header(header): ヘッダファイルの存在チェック
-  create_makefile(target[, target_prefix]): Makefileの生成
-
-以下の変数を使うことができます．
-
-  $CFLAGS: コンパイル時に追加的に指定するフラグ(-Oなど)
-  $CPPFLAGS: プリプロセッサに追加的に指定するフラグ(-Iや-Dなど)
-  $LDFLAGS: リンク時に追加的に指定するフラグ(-Lなど)
-  $objs: リンクされるオブジェクトファイル名のリスト
-
-オブジェクトファイルのリストは，通常はソースファイルを検索し
-て自動的に生成されますが，makeの途中でソースを生成するような
-場合は明示的に指定する必要があります．
-
-ライブラリをコンパイルする条件が揃わず，そのライブラリをコン
-パイルしない時にはcreate_makefileを呼ばなければMakefileは生
-成されず，コンパイルも行われません．
-
-== dependを用意する
-
-もし，ディレクトリにdependというファイルが存在すれば，
-Makefileが依存関係をチェックしてくれます．
-
-  % gcc -MM *.c > depend
-
-などで作ることが出来ます．あって損は無いでしょう．
-
-== Makefileを生成する
-
-Makefileを実際に生成するためには
-
-  ruby extconf.rb
-
-とします．extconf.rbに require 'mkmf' の行がない場合にはエラー
-になりますので，引数を追加して
-
-  ruby -r mkmf extconf.rb
-
-としてください．
-
-site_ruby ディレクトリでなく，
-vendor_ruby ディレクトリにインストールする場合には
-以下のように --vendor オプションを加えてください．
-
-  ruby extconf.rb --vendor
-
-ディレクトリをext以下に用意した場合にはRuby全体のmakeの時に
-自動的にMakefileが生成されますので，このステップは不要です．
-
-== makeする
-
-動的リンクライブラリを生成する場合にはその場でmakeしてくださ
-い．必要であれば make install でインストールされます．
-
-ext以下にディレクトリを用意した場合は，Rubyのディレクトリで
-makeを実行するとMakefileを生成からmake，必要によってはそのモ
-ジュールのRubyへのリンクまで自動的に実行してくれます．
-extconf.rbを書き換えるなどしてMakefileの再生成が必要な時はま
-たRubyディレクトリでmakeしてください．
-
-拡張ライブラリはmake installでRubyライブラリのディレクトリの
-下にコピーされます．もし拡張ライブラリと協調して使うRubyで記
-述されたプログラムがあり，Rubyライブラリに置きたい場合には，
-拡張ライブラリ用のディレクトリの下に lib というディレクトリ
-を作り，そこに 拡張子 .rb のファイルを置いておけば同時にイン
-ストールされます．
-
-== デバッグ
-
-まあ，デバッグしないと動かないでしょうね．ext/Setupにディレ
-クトリ名を書くと静的にリンクするのでデバッガが使えるようにな
-ります．その分コンパイルが遅くなりますけど．
-
-== できあがり
-
-後はこっそり使うなり，広く公開するなり，売るなり，ご自由にお
-使いください．Rubyの作者は拡張ライブラリに関して一切の権利を
-主張しません．
-
-= Appendix A. Rubyのソースコードの分類
-
-Rubyのソースはいくつかに分類することが出来ます．このうちクラ
-スライブラリの部分は基本的に拡張ライブラリと同じ作り方になっ
-ています．これらのソースは今までの説明でほとんど理解できると
-思います．
-
-== Ruby言語のコア
-
-class.c    :: クラスとモジュール
-error.c    :: 例外クラスと例外機構
-gc.c       :: 記憶領域管理
-load.c     :: ライブラリのロード
-object.c   :: オブジェクト
-variable.c :: 変数と定数
-
-== Rubyの構文解析器
-
-  parse.y      : 字句解析器と構文定義
-    -> parse.c : 自動生成
-  keywords     : 予約語
-    -> lex.c   : 自動生成
-
-== Rubyの評価器 (通称YARV)
-  compile.c
-  eval.c
-  eval_error.c
-  eval_jump.c
-  eval_safe.c
-  insns.def           : 仮想機械語の定義
-  iseq.c              : VM::ISeqの実装
-  thread.c            : スレッド管理とコンテキスト切り替え
-  thread_win32.c      : スレッド実装
-  thread_pthread.c    : 同上
-  vm.c
-  vm_dump.c
-  vm_eval.c
-  vm_exec.c
-  vm_insnhelper.c
-  vm_method.c
-
-  opt_insns_unif.def  : 命令融合
-  opt_operand.def     : 最適化のための定義
-
-    -> insn*.inc      : 自動生成
-    -> opt*.inc       : 自動生成
-    -> vm.inc         : 自動生成
-
-== 正規表現エンジン (鬼車)
-
-  regex.c
-  regcomp.c
-  regenc.c
-  regerror.c
-  regexec.c
-  regparse.c
-  regsyntax.c
-
-== ユーティリティ関数
-
-debug.c    :: Cデバッガ用のデバッグシンボル
-dln.c      :: 動的ローディング
-st.c       :: 汎用ハッシュ表
-strftime.c :: 時刻整形
-util.c     :: その他のユーティリティ
-
-== Rubyコマンドの実装
-
-  dmyext.c
-  dmydln.c
-  dmyencoding.c
-  id.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-  gem_prelude.rb
-  prelude.rb
-
-== クラスライブラリ
-
-array.c      :: Array
-bignum.c     :: Bignum
-compar.c     :: Comparable
-complex.c    :: Complex
-cont.c       :: Fiber, Continuation
-dir.c        :: Dir
-enum.c       :: Enumerable
-enumerator.c :: Enumerator
-file.c       :: File
-hash.c       :: Hash
-io.c         :: IO
-marshal.c    :: Marshal
-math.c       :: Math
-numeric.c    :: Numeric, Integer, Fixnum, Float
-pack.c       :: Array#pack, String#unpack
-proc.c       :: Binding, Proc
-process.c    :: Process
-random.c     :: 乱数
-range.c      :: Range
-rational.c   :: Rational
-re.c         :: Regexp, MatchData
-signal.c     :: Signal
-sprintf.c    :: String#sprintf
-string.c     :: String
-struct.c     :: Struct
-time.c       :: Time
-defs/known_errors.def :: 例外クラス Errno::*
--> known_errors.inc   :: 自動生成
-
-== 多言語化
-
-encoding.c  :: Encoding
-transcode.c :: Encoding::Converter
-enc/*.c     :: エンコーディングクラス群
-enc/trans/* :: コードポイント対応表
-
-== gorubyコマンドの実装
-
-  goruby.c
-  golf_prelude.rb      : goruby固有のライブラリ
-    -> golf_prelude.c  : 自動生成
-
-= Appendix B. 拡張用関数リファレンス
-
-C言語からRubyの機能を利用するAPIは以下の通りである．
-
-== 型
-
-VALUE ::
-
-  Rubyオブジェクトを表現する型．必要に応じてキャストして用いる．
-  組み込み型を表現するCの型はruby.hに記述してあるRで始まる構造
-  体である．VALUE型をこれらにキャストするためにRで始まる構造体
-  名を全て大文字にした名前のマクロが用意されている．
-
-== 変数・定数
-
-Qnil ::
-
-  定数: nilオブジェクト
-
-Qtrue ::
-
-  定数: trueオブジェクト(真のデフォルト値)
-
-Qfalse ::
-
-  定数: falseオブジェクト
-
-== Cデータのカプセル化
-
-Data_Wrap_Struct(VALUE klass, void (*mark)(), void (*free)(), void *sval) ::
-
-  Cの任意のポインタをカプセル化したRubyオブジェクトを返す．こ
-  のポインタがRubyからアクセスされなくなった時，freeで指定した
-  関数が呼ばれる．また，このポインタの指すデータが他のRubyオブ
-  ジェクトを指している場合，markに指定する関数でマークする必要
-  がある．
-
-Data_Make_Struct(klass, type, mark, free, sval) ::
-
-  type型のメモリをmallocし，変数svalに代入した後，それをカプセ
-  ル化したデータを返すマクロ．
-
-Data_Get_Struct(data, type, sval) ::
-
-  dataからtype型のポインタを取り出し変数svalに代入するマクロ．
-
-== 型チェック
-
-  TYPE(value)
-  FIXNUM_P(value)
-  NIL_P(value)
-  void Check_Type(VALUE value, int type)
-  SafeStringValue(value)
-
-== 型変換
-
-  FIX2INT(value), INT2FIX(i)
-  FIX2LONG(value), LONG2FIX(l)
-  NUM2INT(value), INT2NUM(i)
-  NUM2UINT(value), UINT2NUM(ui)
-  NUM2LONG(value), LONG2NUM(l)
-  NUM2ULONG(value), ULONG2NUM(ul)
-  NUM2LL(value), LL2NUM(ll)
-  NUM2ULL(value), ULL2NUM(ull)
-  NUM2OFFT(value), OFFT2NUM(off)
-  NUM2SIZET(value), SIZET2NUM(size)
-  NUM2SSIZET(value), SSIZET2NUM(ssize)
-  NUM2DBL(value)
-  rb_float_new(f)
-  StringValue(value)
-  StringValuePtr(value)
-  StringValueCStr(value)
-  rb_str_new2(s)
-
-== クラス/モジュール定義
-
-VALUE rb_define_class(const char *name, VALUE super) ::
-
-  superのサブクラスとして新しいRubyクラスを定義する．
-
-VALUE rb_define_class_under(VALUE module, const char *name, VALUE super) ::
-
-  superのサブクラスとして新しいRubyクラスを定義し，moduleの
-  定数として定義する．
-
-VALUE rb_define_module(const char *name) ::
-
-  新しいRubyモジュールを定義する．
-
-VALUE rb_define_module_under(VALUE module, const char *name) ::
-
-  新しいRubyモジュールを定義し，moduleの定数として定義する．
-
-void rb_include_module(VALUE klass, VALUE module) ::
-
-  モジュールをインクルードする．classがすでにmoduleをインク
-  ルードしている時には何もしない(多重インクルードの禁止)．
-
-void rb_extend_object(VALUE object, VALUE module) ::
-
-  オブジェクトをモジュール(で定義されているメソッド)で拡張する．
-
-== 大域変数定義
-
-void rb_define_variable(const char *name, VALUE *var) ::
-
-  RubyとCとで共有するグローバル変数を定義する．変数名が`$'で
-  始まらない時には自動的に追加される．nameとしてRubyの識別子
-  として許されない文字(例えば` ')を含む場合にはRubyプログラ
-  ムからは見えなくなる．
-
-void rb_define_readonly_variable(const char *name, VALUE *var) ::
-
-  RubyとCとで共有するread onlyのグローバル変数を定義する．
-  read onlyであること以外はrb_define_variable()と同じ．
-
-void rb_define_virtual_variable(const char *name, VALUE (*getter)(), void (*setter)()) ::
-
-  関数によって実現されるRuby変数を定義する．変数が参照された
-  時にはgetterが，変数に値がセットされた時にはsetterが呼ばれ
-  る．
-
-void rb_define_hooked_variable(const char *name, VALUE *var, VALUE (*getter)(), void (*setter)()) ::
-
-  関数によってhookのつけられたグローバル変数を定義する．変数
-  が参照された時にはgetterが，関数に値がセットされた時には
-  setterが呼ばれる．getterやsetterに0を指定した時にはhookを
-  指定しないのと同じ事になる．
-
-void rb_global_variable(VALUE *var)
-
-  GCのため，Rubyプログラムからはアクセスされないが, Rubyオブ
-  ジェクトを含む大域変数をマークする．
-
-== 定数
-
-void rb_define_const(VALUE klass, const char *name, VALUE val) ::
-
-  定数を定義する．
-
-void rb_define_global_const(const char *name, VALUE val) ::
-
-  大域定数を定義する．
-
-    rb_define_const(rb_cObject, name, val)
-
-  と同じ意味．
-
-== メソッド定義
-
-rb_define_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  メソッドを定義する．argcはselfを除く引数の数．argcが-1の時,
-  関数には引数の数(selfを含まない)を第1引数, 引数の配列を第2
-  引数とする形式で与えられる(第3引数はself)．argcが-2の時,
-  第1引数がself, 第2引数がargs(argsは引数を含むRubyの配列)と
-  いう形式で与えられる．
-
-rb_define_private_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  privateメソッドを定義する．引数はrb_define_method()と同じ．
-
-rb_define_singleton_method(VALUE klass, const char *name, VALUE (*func)(), int argc) ::
-
-  特異メソッドを定義する．引数はrb_define_method()と同じ．
-
-rb_scan_args(int argc, VALUE *argv, const char *fmt, ...) ::
-
-  argc, argv形式で与えられた指定されたフォーマットに従って引
-  数を分解し，続くVALUEへの参照にセットします．このフォーマッ
-  トは，ABNFで記述すると以下の通りです．
-
-    scan-arg-spec  := param-arg-spec [option-hash-arg-spec] [block-arg-spec]
-
-    param-arg-spec := pre-arg-spec [post-arg-spec] / post-arg-spec /
-                      pre-opt-post-arg-spec
-    pre-arg-spec   := num-of-leading-mandatory-args [num-of-optional-args]
-    post-arg-spec  := sym-for-variable-length-args
-                      [num-of-trailing-mandatory-args]
-    pre-opt-post-arg-spec := num-of-leading-mandatory-args num-of-optional-args
-                             num-of-trailing-mandatory-args
-    option-hash-arg-spec := sym-for-option-hash-arg
-    block-arg-spec := sym-for-block-arg
-
-    num-of-leading-mandatory-args  := DIGIT ; 先頭に置かれる省略不能な引数の数
-    num-of-optional-args           := DIGIT ; 続いて置かれる省略可能な引数の数
-    sym-for-variable-length-args   := "*"   ; 続いて置かれる可変長引数を
-                                            ; Rubyの配列で取得するための指定
-    num-of-trailing-mandatory-args := DIGIT ; 終端に置かれる省略不能な引数の数
-    sym-for-option-hash-arg        := ":"   ; オプションハッシュを取得する
-                                            ; ための指定; 省略不能な引数の
-                                            ; 数よりも多くの引数が指定され，
-                                            ; 最後の引数がハッシュ（または
-                                            ; #to_hashで変換可能）の場合に
-                                            ; 取得される．最後の引数がnilの
-                                            ; 場合，可変長引数指定がなく，
-                                            ; 省略不能引数の数よりも多くの
-                                            ; 引数が指定された場合に取得される
-    sym-for-block-arg              := "&"   ; イテレータブロックを取得するための
-                                            ; 指定
-
-  フォーマットが"12"の場合，引数は最低1つで，3つ(1+2)まで許さ
-  れるという意味になります．従って，フォーマット文字列に続い
-  て3つのVALUEへの参照を置く必要があります．それらには取得した
-  変数がセットされます．変数への参照の代わりにNULLを指定する
-  こともでき，その場合は取得した引数の値は捨てられます．なお，
-  省略可能引数が省略された時の変数の値はnil(C言語のレベルでは
-  Qnil)になります．
-
-  返り値は与えられた引数の数です．オプションハッシュおよびイ
-  テレータブロックは数えません．
-
-== Rubyメソッド呼び出し
-
-VALUE rb_funcall(VALUE recv, ID mid, int narg, ...) ::
-
-  メソッド呼び出し．文字列からmidを得るためにはrb_intern()を
-  使う．
-  private/protectedなメソッドでも呼び出せる．
-
-VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv) ::
-VALUE rb_funcallv(VALUE recv, ID mid, int argc, VALUE *argv) ::
-
-  メソッド呼び出し．引数をargc, argv形式で渡す．
-  private/protectedなメソッドでも呼び出せる．
-
-VALUE rb_funcallv_public(VALUE recv, ID mid, int argc, VALUE *argv) ::
-
-  メソッド呼び出し．
-  publicなメソッドしか呼べない．
-
-VALUE rb_eval_string(const char *str)
-
-  文字列をRubyスクリプトとしてコンパイル・実行する．
-
-ID rb_intern(const char *name) ::
-
-  文字列に対応するIDを返す．
-
-char *rb_id2name(ID id) ::
-
-  IDに対応する文字列を返す(デバッグ用)．
-
-char *rb_class2name(VALUE klass) ::
-
-  クラスの名前を返す(デバッグ用)．クラスが名前を持たない時に
-  は, 祖先を遡って名前を持つクラスの名前を返す．
-
-int rb_respond_to(VALUE obj, ID id) ::
-
-  objがidで示されるメソッドを持つかどうかを返す．
-
-== インスタンス変数
-
-VALUE rb_iv_get(VALUE obj, const char *name) ::
-
-  objのインスタンス変数の値を得る．`@'で始まらないインスタン
-  ス変数は Rubyプログラムからアクセスできない「隠れた」イン
-  スタンス変数になる．定数は大文字の名前を持つクラス(または
-  モジュール)のインスタンス変数として実装されている．
-
-VALUE rb_iv_set(VALUE obj, const char *name, VALUE val) ::
-
-  objのインスタンス変数をvalにセットする．
-
-== 制御構造
-
-VALUE rb_block_call(VALUE obj, ID mid, int argc, VALUE * argv, VALUE (*func) (ANYARGS), VALUE data2) ::
-
-  funcをブロックとして設定し，objをレシーバ，argcとargvを引数
-  としてmidメソッドを呼び出す．funcは第一引数にyieldされた値，
-  第二引数にdata2を受け取る．複数の値がyieldされた場合(Cでは
-  rb_yield_values()とrb_yield_values2(), rb_yield_splat())，
-  data2はArrayとしてパックされている．第三, 第四引数のargcと
-  argvによってyieldされた値を取り出すことができる．
-
-[OBSOLETE] VALUE rb_iterate(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2) ::
-
-  func2をブロックとして設定し, func1をイテレータとして呼ぶ．
-  func1には arg1が引数として渡され, func2には第1引数にイテレー
-  タから与えられた値, 第2引数にarg2が渡される．
-
-  1.9でrb_iterateを使う場合は, func1の中でRubyレベルのメソッド
-  を呼び出さなければならない.
-  1.9でobsoleteとなった. 代わりにrb_block_callが用意された.
-
-VALUE rb_yield(VALUE val) ::
-
-  valを値としてイテレータブロックを呼び出す．
-
-VALUE rb_rescue(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2) ::
-
-  関数func1をarg1を引数に呼び出す．func1の実行中に例外が発生
-  した時には func2をarg2を引数として呼ぶ．戻り値は例外が発生
-  しなかった時はfunc1の戻り値, 例外が発生した時にはfunc2の戻
-  り値である．
-
-VALUE rb_ensure(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2) ::
-
-  関数func1をarg1を引数として実行し, 実行終了後(たとえ例外が
-  発生しても) func2をarg2を引数として実行する．戻り値はfunc1
-  の戻り値である(例外が発生した時は戻らない)．
-
-VALUE rb_protect(VALUE (*func) (VALUE), VALUE arg, int *state) ::
-
-  関数funcをargを引数として実行し, 例外が発生しなければその戻
-  り値を返す．例外が発生した場合は, *stateに非0をセットして
-  Qnilを返す．
-  rb_jump_tag()を呼ばずに捕捉した例外を無視する場合には，
-  rb_set_errinfo(Qnil)でエラー情報をクリアしなければならない．
-
-void rb_jump_tag(int state) ::
-
-  rb_protect()やrb_eval_string_protect()で捕捉された例外を再
-  送する．stateはそれらの関数から返された値でなければならない．
-  この関数は直接の呼び出し元に戻らない．
-
-void rb_iter_break() ::
-
-  現在の最も内側のブロックを終了する．この関数は直接の呼び出
-  し元に戻らない．
-
-void rb_iter_break_value(VALUE value) ::
-
-  現在の最も内側のブロックをvalueで終了する．ブロックは引数で
-  与えられたvalueを返す．この関数は直接の呼び出し元に戻らない．
-
-== 例外・エラー
-
-void rb_warning(const char *fmt, ...) ::
-
-  rb_verbose時に標準エラー出力に警告情報を表示する．引数は
-  printf()と同じ．
-
-void rb_raise(rb_eRuntimeError, const char *fmt, ...) ::
-
-  RuntimeError例外を発生させる．引数はprintf()と同じ．
-
-void rb_raise(VALUE exception, const char *fmt, ...) ::
-
-  exceptionで指定した例外を発生させる．fmt以下の引数は
-  printf()と同じ．
-
-void rb_fatal(const char *fmt, ...) ::
-
-  致命的例外を発生させる．通常の例外処理は行なわれず, インター
-  プリタが終了する(ただしensureで指定されたコードは終了前に
-  実行される)．
-
-void rb_bug(const char *fmt, ...) ::
-
-  インタープリタなどプログラムのバグでしか発生するはずのない
-  状況の時呼ぶ．インタープリタはコアダンプし直ちに終了する．
-  例外処理は一切行なわれない．
-
-注意: %iはObject#to_s('+'フラグが指定されているときはObject#inspect)を
-使ったVALUEの出力に使用されているため，整数には%dを使用すること．
-
-== Rubyの初期化・実行
-
-Rubyをアプリケーションに埋め込む場合には以下のインタフェース
-を使う．通常の拡張ライブラリには必要ない．
-
-void ruby_init() ::
-
-  Rubyインタプリタの初期化を行なう．
-
-void ruby_options(int argc, char **argv) ::
-
-  Rubyインタプリタのコマンドライン引数の処理を行なう．
-
-void ruby_run() ::
-
-  Rubyインタプリタを実行する．
-
-void ruby_script(char *name) ::
-
-  Rubyのスクリプト名($0)を設定する．
-
-== インタプリタのイベントのフック
-
-  void rb_add_event_hook(rb_event_hook_func_t func, rb_event_flag_t events,
-                         VALUE data)
-
-指定されたインタプリタのイベントに対するフック関数を追加します．
-eventsは以下の値のorでなければなりません:
-
-  RUBY_EVENT_LINE
-  RUBY_EVENT_CLASS
-  RUBY_EVENT_END
-  RUBY_EVENT_CALL
-  RUBY_EVENT_RETURN
-  RUBY_EVENT_C_CALL
-  RUBY_EVENT_C_RETURN
-  RUBY_EVENT_RAISE
-  RUBY_EVENT_ALL
-
-rb_event_hook_func_tの定義は以下の通りです:
-
-  typedef void (*rb_event_hook_func_t)(rb_event_t event, VALUE data,
-                                       VALUE self, ID id, VALUE klass)
-
-rb_add_event_hook() の第3引数 data は，フック関数の第2引数と
-して渡されます．これは1.8では現在のNODEへのポインタでした．以
-下の RB_EVENT_HOOKS_HAVE_CALLBACK_DATA も参照してください．
-
-  int rb_remove_event_hook(rb_event_hook_func_t func)
-
-指定されたフック関数を削除します．
-
-== 互換性のためのマクロ
-
-APIの互換性をチェックするために以下のマクロがデフォルトで定義されています．
-
-NORETURN_STYLE_NEW ::
-
-  NORETURN マクロが関数型マクロとして定義されていることを意味する．
-
-HAVE_RB_DEFINE_ALLOC_FUNC ::
-
-  rb_define_alloc_func() 関数が提供されていること，つまり
-  allocation framework が使われることを意味する．
-  have_func("rb_define_alloc_func", "ruby.h")
-  の結果と同じ．
-
-HAVE_RB_REG_NEW_STR ::
-
-  StringオブジェクトからRegexpオブジェクトを作る
-  rb_reg_new_str() 関数が提供されていることを意味する．
-  have_func("rb_reg_new_str", "ruby.h").
-  の結果と同じ．
-
-HAVE_RB_IO_T ::
-
-  rb_io_t 型が提供されていることを意味する．
-
-USE_SYMBOL_AS_METHOD_NAME ::
-
-  メソッド名を返すメソッド，Module#methods, #singleton_methods
-  などがSymbolを返すことを意味する．
-
-HAVE_RUBY_*_H ::
-
-  ruby.h で定義されている．対応するヘッダが提供されていること
-  を意味する．たとえば，HAVE_RUBY_ST_H が定義されている場合は
-  単なる st.h ではなく ruby/st.h を使用する．
-
-RB_EVENT_HOOKS_HAVE_CALLBACK_DATA ::
-
-  rb_add_event_hook() がフック関数に渡す data を第3引数として
-  受け取ることを意味する．
-
-= Appendix C. extconf.rbで使える関数たち
-
-extconf.rbの中では利用可能なコンパイル条件チェックの関数は以
-下の通りである．
-
-have_macro(macro, headers) ::
-
-  ヘッダファイルheaderをインクルードしてマクロmacroが定義さ
-  れているかどうかチェックする．マクロが定義されている時true
-  を返す．
-
-have_library(lib, func) ::
-
-  関数funcを定義しているライブラリlibの存在をチェックする．
-  チェックに成功すると，-llibを$libsに追加し，trueを返す．
-
-find_library(lib, func, path...) ::
-
-  関数funcを定義しているライブラリlibの存在を -Lpath を追加
-  しながらチェックする．チェックに成功すると，-llibを$libsに
-  追加し，trueを返す．
-
-have_func(func, header) ::
-
-  ヘッダファイルheaderをインクルードして関数funcの存在をチェ
-  ックする．funcが標準ではリンクされないライブラリ内のもので
-  ある時には先にhave_libraryでそのライブラリをチェックしてお
-  く事．チェックに成功すると，プリプロセッサマクロ
-  `HAVE_{FUNC}` を定義し，trueを返す．
-
-have_var(var, header) ::
-
-  ヘッダファイルheaderをインクルードして変数varの存在をチェッ
-  クする．varが標準ではリンクされないライブラリ内のものであ
-  る時には先にhave_libraryでそのライブラリをチェックしておく
-  事．チェックに成功すると，プリプロセッサマクロ
-  `HAVE_{VAR}` を定義し，trueを返す．
-
-have_header(header) ::
-
-  ヘッダファイルの存在をチェックする．チェックに成功すると，
-  プリプロセッサマクロ `HAVE_{HEADER_H}` を定義し，trueを返す．
-  (スラッシュやドットはアンダースコアに置換される)
-
-find_header(header, path...) ::
-
-  ヘッダファイルheaderの存在を -Ipath を追加しながらチェック
-  する．チェックに成功すると，プリプロセッサマクロ
-  `HAVE_{HEADER_H}` を定義し，trueを返す．
-  (スラッシュやドットはアンダースコアに置換される)
-
-have_struct_member(type, member[, header[, opt]]) ::
-
-  ヘッダファイルheaderをインクルードして型typeが定義され，
-  なおかつメンバmemberが存在するかをチェックする．チェックに
-  成功すると，プリプロセッサマクロ `HAVE_{TYPE}_{MEMBER}` を
-  定義し，trueを返す．
-
-have_type(type, header, opt) ::
-
-  ヘッダファイルheaderをインクルードして型typeが存在するかを
-  チェックする．チェックに成功すると，プリプロセッサマクロ
-  `HAVE_TYPE_{TYPE}` を定義し，trueを返す．
-
-check_sizeof(type, header) ::
-
-  ヘッダファイルheaderをインクルードして型typeのchar単位サイ
-  ズを調べる．チェックに成功すると，プリプロセッサマクロ
-  `SIZEOF_{TYPE}` を定義し，そのサイズを返す．定義されていな
-  いときはnilを返す．
-
-create_makefile(target[, target_prefix]) ::
-
-  拡張ライブラリ用のMakefileを生成する．この関数を呼ばなけれ
-  ばそのライブラリはコンパイルされない．targetはモジュール名
-  を表す．
-
-find_executable(command, path) ::
-
-  コマンドcommandをFile::PATH_SEPARATORで区切られたパス名の
-  リストpathから探す．pathがnilまたは省略された場合は，環境
-  変数PATHの値を使用する．実行可能なコマンドが見つかった場合
-  はパスを含むファイル名，見つからなかった場合はnilを返す．
-
-with_config(withval[, default=nil]) ::
-
-  コマンドライン上の--with-<withval>で指定されたオプション値
-  を得る．
-
-enable_config(config, *defaults) ::
-disable_config(config, *defaults) ::
-
-  コマンドライン上の--enable-<config>または
-  --disable-<config>で指定された真偽値を得る．
-  --enable-<config>が指定されていた場合はtrue，
-  --disable-<config>が指定されていた場合はfalseを返す．
-  どちらも指定されていない場合は，ブロックつきで呼び出されて
-  いる場合は*defaultsをyieldした結果，ブロックなしなら
-  *defaultsを返す．
-
-dir_config(target[, default_dir]) ::
-dir_config(target[, default_include, default_lib]) ::
-
-  コマンドライン上の--with-<target>-dir, --with-<target>-include,
-  --with-<target>-libのいずれかで指定されるディレクトリを
-  $CFLAGS や $LDFLAGS に追加する．--with-<target>-dir=/pathは
-  --with-<target>-include=/path/include --with-<target>-lib=/path/lib
-  と等価である．追加された include ディレクトリと lib ディレ
-  クトリの配列を返す． ([include_dir, lib_dir])
-
-pkg_config(pkg, option=nil) ::
-
-  pkg-configコマンドからパッケージpkgの情報を [cflags, ldflags, libs]
-  の配列として得る．$CFLAGS, $LDFLAGS, $libs にはそれぞれの値が
-  追加される．
-
-  pkg-configの実際のコマンドは，以下の順で試される．
-
-  1. コマンドラインで--with-{pkg}-config={command}オプションが
-     指定された場合: {command} {option}
-  2. {pkg}-config {option}
-  3. pkg-config {option} {pkg}
-
-  optionが指定された場合は、上記の配列の代わりにそのオプションを
-  指定して得られた出力をstripしたものを返す．
-
-/*
- * Local variables:
- * fill-column: 60
- * end:
- */
+doc/extension.ja.rdocに移動しました
diff --git a/README.ja b/README.ja
deleted file mode 100644
index 9ab2f3ca0e..0000000000
--- a/README.ja
+++ /dev/null
@@ -1,192 +0,0 @@
-= Rubyとは
-
-Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です．
-Rubyは最初から純粋なオブジェクト指向言語として設計されていま
-すから，オブジェクト指向プログラミングを手軽に行う事が出来ま
-す．もちろん通常の手続き型のプログラミングも可能です．
-
-Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力
-です．さらにシンプルな文法と，例外処理やイテレータなどの機構
-によって，より分かりやすいプログラミングが出来ます．
-
-
-== Rubyの特長
-
-*   シンプルな文法
-*   普通のオブジェクト指向機能(クラス，メソッドコールなど)
-*   特殊なオブジェクト指向機能(Mixin, 特異メソッドなど)
-*   演算子オーバーロード
-*   例外処理機能
-*   イテレータとクロージャ
-*   ガーベージコレクタ
-*   ダイナミックローディング (アーキテクチャによる)
-*   移植性が高い．多くのUnix-like/POSIX互換プラットフォーム上で
-    動くだけでなく，Windows， Mac OS X，BeOSなどの上でも動く
-    cf. http://bugs.ruby-lang.org/projects/ruby-trunk/wiki/SupportedPlatformsJa
-
-== 入手法
-
-=== FTPで
-
-以下の場所においてあります．
-
-ftp://ftp.ruby-lang.org/pub/ruby/
-
-=== Subversionで
-
-開発先端のソースコードは次のコマンドで取得できます．
-
-  $ svn co http://svn.ruby-lang.org/repos/ruby/trunk/ ruby
-
-他に開発中のブランチの一覧は次のコマンドで見られます．
-
-  $ svn ls http://svn.ruby-lang.org/repos/ruby/branches/
-
-=== Gitで
-
-SubversionのミラーをGitHubに公開しています．
-以下のコマンドでリポジトリを取得できます．
-
-  $ git clone git://github.com/ruby/ruby.git
-
-== ホームページ
-
-RubyのホームページのURLは
-
-http://www.ruby-lang.org/
-
-です．
-
-
-== メーリングリスト
-
-Rubyのメーリングリストがあります。参加希望の方は
-
-mailto:ruby-list-ctl@ruby-lang.org
-
-まで本文に
-
-   subscribe YourFirstName YourFamilyName
-
-と書いて送って下さい。
-
-Ruby開発者向けメーリングリストもあります。こちらではrubyのバ
-グ、将来の仕様拡張など実装上の問題について議論されています。
-参加希望の方は
-
-mailto:ruby-dev-ctl@ruby-lang.org
-
-までruby-listと同様の方法でメールしてください。
-
-Ruby拡張モジュールについて話し合うruby-extメーリングリストと
-数学関係の話題について話し合うruby-mathメーリングリストと
-英語で話し合うruby-talkメーリングリストもあります。参加方法
-はどれも同じです。
-
-
-== コンパイル・インストール
-
-以下の手順で行ってください．
-
-1.   もし +configure+ ファイルが見つからない、もしくは
-     +configure.in+ より古いようなら、 +autoconf+ を実行して
-     新しく +configure+ を生成する
-
-2.   +configure+ を実行して +Makefile+ などを生成する
-
-     環境によってはデフォルトのCコンパイラ用オプションが付き
-     ます． +configure+ オプションで <tt>optflags=..</tt> <tt>warnflags=..</tt> 等
-     で上書きできます．
-
-3.   (必要ならば)+defines.h+ を編集する
-
-     多分，必要無いと思います．
-
-4.   (必要ならば)+ext/Setup+ に静的にリンクする拡張モジュールを
-     指定する
-
-     +ext/Setup+ に記述したモジュールは静的にリンクされます．
-
-     ダイナミックローディングをサポートしていないアーキテク
-     チャでは +Setup+ の1行目の「<tt>option nodynamic</tt>」という行のコ
-     メントを外す必要があります．また，このアーキテクチャで
-     拡張モジュールを利用するためには，あらかじめ静的にリン
-     クしておく必要があります．
-
-5.   +make+ を実行してコンパイルする
-
-6.   <tt>make check</tt>でテストを行う．
-
-     「<tt>check succeeded</tt>」と表示されれば成功です．ただしテスト
-     に成功しても完璧だと保証されている訳ではありません．
-
-7.   <tt>make install</tt>
-
-     以下のディレクトリを作って，そこにファイルをインストー
-     ルします．
-
-     * <tt>${DESTDIR}${prefix}/bin</tt>
-     * <tt>${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}</tt>
-     * <tt>${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}</tt>
-     * <tt>${DESTDIR}${prefix}/share/man/man1</tt>
-     * <tt>${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system</tt>
-
-     RubyのAPIバージョンが'_x.y.z_'であれば，<tt>${MAJOR}</tt>は
-     '_x_'で，<tt>${MINOR}</tt>は'_y_'，<tt>${TEENY}</tt>は'_z_'です．
-
-     <b>注意</b>: APIバージョンの +teeny+ は，Rubyプログラムのバージョ
-     ンとは異なることがあります．
-
-     +root+ で作業する必要があるかもしれません．
-
-もし，コンパイル時にエラーが発生した場合にはエラーのログとマ
-シン，OSの種類を含むできるだけ詳しいレポートを作者に送ってく
-ださると他の方のためにもなります．
-
-
-== 移植
-
-UNIXであれば +configure+ がほとんどの差異を吸収してくれるはずで
-すが，思わぬ見落としがあった場合(あるに違いない)，作者にその
-ことをレポートすれば，解決できるかも知れません．
-
-アーキテクチャにもっとも依存するのはGC部です．RubyのGCは対象
-のアーキテクチャが<tt>setjmp()</tt>または<tt>getcontext()</tt>によって全てのレ
-ジスタを +jmp_buf+ や +ucontext_t+ に格納することと， +jmp_buf+ や
-+ucontext_t+ とスタックが32bitアラインメントされていることを仮定
-しています．特に前者が成立しない場合の対応は非常に困難でしょう．
-後者の解決は比較的簡単で， +gc.c+ でスタックをマークしている
-部分にアラインメントのバイト数だけずらしてマークするコードを
-追加するだけで済みます．<tt>defined(\_\_mc68000\_\_)</tt>で括られてい
-る部分を参考にしてください．
-
-レジスタウィンドウを持つCPUでは，レジスタウィンドウをスタッ
-クにフラッシュするアセンブラコードを追加する必要があるかも知
-れません．
-
-
-== 配布条件
-
-+COPYING.ja+ ファイルを参照してください。
-
-
-== 著者
-
-コメント，バグレポートその他は mailto:matz@ruby-lang.org まで．
--------------------------------------------------------
-created at: Thu Aug  3 11:57:36 JST 1995
---
-Local variables:
-mode: rdoc
-end:
diff --git a/README.ja.md b/README.ja.md
new file mode 100644
index 0000000000..93c0131690
--- /dev/null
+++ b/README.ja.md
@@ -0,0 +1,182 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![Actions Status: MJIT](https://github.com/ruby/ruby/workflows/MJIT/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MJIT")
+[![Actions Status: Ubuntu](https://github.com/ruby/ruby/workflows/Ubuntu/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Ubuntu")
+[![Actions Status: Windows](https://github.com/ruby/ruby/workflows/Windows/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Windows")
+[![AppVeyor status](https://ci.appveyor.com/api/projects/status/0sy8rrxut4o0k960/branch/master?svg=true)](https://ci.appveyor.com/project/ruby/ruby/branch/master)
+[![Travis Status](https://app.travis-ci.com/ruby/ruby.svg?branch=master)](https://app.travis-ci.com/ruby/ruby)
+
+# Rubyとは
+
+Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です． Rubyは純粋なオブジェクト指向言語として設計されているので，
+オブジェクト指向プログラミングを手軽に行う事が出来ます．もちろん普通の手続き型のプログラミングも可能です．
+
+Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力です．さらにシンプルな文法と，
+例外処理やイテレータなどの機構によって，より分かりやすいプログラミングが出来ます．
+
+## Rubyの特長
+
+*   シンプルな文法
+*   普通のオブジェクト指向機能(クラス，メソッドコールなど)
+*   特殊なオブジェクト指向機能(Mixin，特異メソッドなど)
+*   演算子オーバーロード
+*   例外処理機能
+*   イテレータとクロージャ
+*   ガーベージコレクタ
+*   ダイナミックローディング (アーキテクチャによる)
+*   移植性が高い．多くのUnix-like/POSIX互換プラットフォーム上で動くだけでなく，Windows， macOS，
+    Haikuなどの上でも動く cf.
+    https://github.com/ruby/ruby/blob/master/doc/contributing.rdoc#platform-maintainers
+
+
+## 入手法
+
+サードパーティーツールを使った方法を含むRubyのインストール方法の一覧は
+
+https://www.ruby-lang.org/ja/downloads/
+
+を参照してください．
+
+### Git
+
+ミラーをGitHubに公開しています． 以下のコマンドでリポジトリを取得できます．
+
+    $ git clone https://github.com/ruby/ruby.git
+
+他のブランチの一覧は次のコマンドで見られます．
+
+    $ git ls-remote https://github.com/ruby/ruby.git
+
+Rubyリポジトリの本来のmasterは https://git.ruby-lang.org/ruby.git にあります．
+コミッタはこちらを使います．
+
+### Subversion
+
+古いRubyのバージョンのソースコードは次のコマンドでも取得できます．
+
+    $ svn co https://svn.ruby-lang.org/repos/ruby/branches/ruby_2_6/ ruby
+
+他のブランチの一覧は次のコマンドで見られます．
+
+    $ svn ls https://svn.ruby-lang.org/repos/ruby/branches/
+
+
+## ホームページ
+
+RubyのホームページのURLは
+
+https://www.ruby-lang.org/
+
+です．
+
+## メーリングリスト
+
+Rubyのメーリングリストがあります．参加希望の方は [ruby-list-request@ruby-lang.org] まで本文に
+
+    subscribe
+
+と書いて送って下さい．
+
+Ruby開発者向けメーリングリストもあります．こちらではrubyのバグ，将来の仕様拡張など実装上の問題について議論されています．
+参加希望の方は [ruby-dev-request@ruby-lang.org] までruby-listと同様の方法でメールしてください．
+
+Ruby拡張モジュールについて話し合うruby-extメーリングリストと数学関係の話題について話し合うruby-mathメーリングリストと
+英語でrubyについて話し合うruby-talkメーリングリストもあります．参加方法はどれも同じです．
+
+[ruby-list-request@ruby-lang.org]: mailto:ruby-list-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+[ruby-dev-request@ruby-lang.org]: mailto:ruby-dev-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+
+## コンパイル・インストール
+
+以下の手順で行ってください．
+
+1.  (Gitリポジトリから取得したソースをビルドする場合) `./autogen.sh` を実行して新しく `configure` を生成する
+
+2.  `configure` を実行して `Makefile` などを生成する
+
+    環境によってはデフォルトのCコンパイラ用オプションが付きます． `configure` オプションで `optflags=..`
+    `warnflags=..` 等で上書きできます．
+
+3.  (必要ならば)`include/ruby/defines.h` を編集する
+
+    多分，必要無いと思います．
+
+4.  (必要ならば)`ext/Setup` に静的にリンクする拡張モジュールを指定する
+
+    `ext/Setup` に記述したモジュールは静的にリンクされます．
+
+    ダイナミックローディングをサポートしていないアーキテクチャでは `Setup` の1行目の「`option nodynamic`」という行のコ
+    メントを外す必要があります．
+    また，このアーキテクチャで拡張モジュールを利用するためには，あらかじめ静的にリンクをしておく必要があります．
+
+5.  `make` を実行してコンパイルする
+
+6.  `make check`でテストを行う．
+
+    「`check succeeded`」と表示されれば成功です．ただしテストに成功しても完璧だと保証されている訳ではありません．
+
+7.  `make install`
+
+    以下のディレクトリを作って，そこにファイルをインストー ルします．
+
+    *   `${DESTDIR}${prefix}/bin`
+    *   `${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib`
+    *   `${DESTDIR}${prefix}/lib/ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/share/man/man1`
+    *   `${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system`
+
+
+    RubyのAPIバージョンが'*x.y.z*'であれば，`${MAJOR}`は
+    '*x*'で，`${MINOR}`は'*y*'，`${TEENY}`は'*z*'です．
+
+    **注意**: APIバージョンの `teeny` は，Rubyプログラムのバージョンとは異なることがあります．
+
+    `root` で作業する必要があるかもしれません．
+
+
+もし，コンパイル時にエラーが発生した場合にはエラーのログとマシン，OSの種類を含むできるだけ詳しいレポートを作者に送って下さると他の方のためにもなります．
+
+## 移植
+
+UNIXであれば `configure` がほとんどの差異を吸収してくれるはずですが，思わぬ見落としがあった場合(ある事が多い)，作者にその
+ことを報告すれば，解決できる可能性があります．
+
+アーキテクチャにもっとも依存するのはGC部です．RubyのGCは対象
+のアーキテクチャが`setjmp()`または`getcontext()`によって全てのレジスタを `jmp_buf` や `ucontext_t`
+に格納することと， `jmp_buf` や `ucontext_t` とスタックが32bitアラインメントされていることを仮定
+しています．特に前者が成立しない場合の対応は非常に困難でしょう． 後者の解決は比較的簡単で， `gc.c` でスタックをマークしている
+部分にアラインメントのバイト数だけずらしてマークするコードを追加するだけで済みます．`defined(__mc68000__)`で括られてい
+る部分を参考にしてください．
+
+レジスタウィンドウを持つCPUでは，レジスタウィンドウをスタックにフラッシュするアセンブラコードを追加する必要があるかもしれません．
+
+## 配布条件
+
+[COPYING.ja](COPYING.ja) ファイルを参照してください．
+
+## フィードバック
+
+Rubyに関する質問は [Ruby-Talk]（英語）や [Ruby-List]（日本語）や，
+[stackoverflow] などのWebサイトに投稿してください．
+
+バグ報告は https://bugs.ruby-lang.org で受け付けています．
+
+[Ruby-Talk]: https://www.ruby-lang.org/en/community/mailing-lists
+[Ruby-List]: https://www.ruby-lang.org/ja/community/mailing-lists
+[stackoverflow]: https://ja.stackoverflow.com/
+
+## 著者
+
+Rubyのオリジナル版は，1995年にまつもとゆきひろ氏によって設計・開発されました．
+
+<mailto:matz@ruby-lang.org>
diff --git a/README.md b/README.md
new file mode 100644
index 0000000000..c445448c71
--- /dev/null
+++ b/README.md
@@ -0,0 +1,91 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![Actions Status: MJIT](https://github.com/ruby/ruby/workflows/MJIT/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MJIT")
+[![Actions Status: Ubuntu](https://github.com/ruby/ruby/workflows/Ubuntu/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Ubuntu")
+[![Actions Status: Windows](https://github.com/ruby/ruby/workflows/Windows/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Windows")
+[![AppVeyor status](https://ci.appveyor.com/api/projects/status/0sy8rrxut4o0k960/branch/master?svg=true)](https://ci.appveyor.com/project/ruby/ruby/branch/master)
+[![Travis Status](https://app.travis-ci.com/ruby/ruby.svg?branch=master)](https://app.travis-ci.com/ruby/ruby)
+
+# What is Ruby?
+
+Ruby is an interpreted object-oriented programming language often
+used for web development. It also offers many scripting features
+to process plain text and serialized files, or manage system tasks.
+It is simple, straightforward, and extensible.
+
+## Features of Ruby
+
+* Simple Syntax
+* **Normal** Object-oriented Features (e.g. class, method calls)
+* **Advanced** Object-oriented Features (e.g. mix-in, singleton-method)
+* Operator Overloading
+* Exception Handling
+* Iterators and Closures
+* Garbage Collection
+* Dynamic Loading of Object Files (on some architectures)
+* Highly Portable (works on many Unix-like/POSIX compatible platforms as
+  well as Windows, macOS, etc.) cf.
+  https://github.com/ruby/ruby/blob/master/doc/maintainers.rdoc#label-Platform+Maintainers
+
+## How to get Ruby with Git
+
+For a complete list of ways to install Ruby, including using third-party tools
+like rvm, see:
+
+https://www.ruby-lang.org/en/downloads/
+
+The mirror of the Ruby source tree can be checked out with the following command:
+
+    $ git clone https://github.com/ruby/ruby.git
+
+There are some other branches under development. Try the following command
+to see the list of branches:
+
+    $ git ls-remote https://github.com/ruby/ruby.git
+
+You may also want to use https://git.ruby-lang.org/ruby.git (actual master of Ruby source)
+if you are a committer.
+
+## How to build
+
+see [Building Ruby](doc/contributing/building_ruby.md)
+
+## Ruby home page
+
+https://www.ruby-lang.org/
+
+## Documentation
+
+- [English](https://docs.ruby-lang.org/en/master/index.html)
+- [Japanese](https://docs.ruby-lang.org/ja/master/index.html)
+
+## Mailing list
+
+There is a mailing list to discuss Ruby. To subscribe to this list, please
+send the following phrase:
+
+    subscribe
+
+in the mail body (not subject) to the address [ruby-talk-request@ruby-lang.org].
+
+[ruby-talk-request@ruby-lang.org]: mailto:ruby-talk-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+
+## Copying
+
+See the file [COPYING](rdoc-ref:COPYING).
+
+## Feedback
+
+Questions about the Ruby language can be asked on the [Ruby-Talk](https://www.ruby-lang.org/en/community/mailing-lists) mailing list
+or on websites like https://stackoverflow.com.
+
+Bugs should be reported at https://bugs.ruby-lang.org. Read ["Reporting Issues"](https://docs.ruby-lang.org/en/master/contributing/reporting_issues_md.html) for more information.
+
+## Contributing
+
+See ["Contributing to Ruby"](https://docs.ruby-lang.org/en/master/contributing_md.html), which includes setup and build instructions.
+
+## The Author
+
+Ruby was originally designed and developed by Yukihiro Matsumoto (Matz) in 1995.
+
+<matz@ruby-lang.org>
diff --git a/aclocal.m4 b/aclocal.m4
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/aclocal.m4
diff --git a/addr2line.c b/addr2line.c
index f89a9d24fe..e5f25293e2 100644
--- a/addr2line.c
+++ b/addr2line.c
@@ -8,20 +8,27 @@
 
 **********************************************************************/
 
-#include "ruby/config.h"
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wgnu-empty-initializer"
+#pragma clang diagnostic ignored "-Wgcc-compat"
+#endif
+
+#include "ruby/internal/config.h"
+#include "ruby/defines.h"
 #include "ruby/missing.h"
 #include "addr2line.h"
 
 #include <stdio.h>
 #include <errno.h>
 
-#ifdef USE_ELF
-
-#ifdef __OpenBSD__
-#include <elf_abi.h>
-#else
-#include <elf.h>
+#ifdef HAVE_LIBPROC_H
+#include <libproc.h>
 #endif
+
+#include "ruby/internal/stdbool.h"
+
+#if defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H)
+
 #include <fcntl.h>
 #include <limits.h>
 #include <stdio.h>
@@ -35,11 +42,9 @@
 
 /* Make alloca work the best possible way.  */
 #ifdef __GNUC__
-# ifndef atarist
-#  ifndef alloca
-#   define alloca __builtin_alloca
-#  endif
-# endif	/* atarist */
+# ifndef alloca
+#  define alloca __builtin_alloca
+# endif
 #else
 # ifdef HAVE_ALLOCA_H
 #  include <alloca.h>
@@ -54,11 +59,53 @@ void *alloca();
 # endif	/* HAVE_ALLOCA_H */
 #endif /* __GNUC__ */
 
-#ifdef HAVE_DL_ITERATE_PHDR
-# ifndef _GNU_SOURCE
-#  define _GNU_SOURCE
+#ifdef HAVE_DLADDR
+# include <dlfcn.h>
+#endif
+
+#ifdef HAVE_MACH_O_LOADER_H
+# include <crt_externs.h>
+# include <mach-o/fat.h>
+# include <mach-o/loader.h>
+# include <mach-o/nlist.h>
+# include <mach-o/stab.h>
+#endif
+
+#ifdef USE_ELF
+# ifdef __OpenBSD__
+#  include <elf_abi.h>
+# else
+#  include <elf.h>
+# endif
+
+#ifndef ElfW
+# if SIZEOF_VOIDP == 8
+#  define ElfW(x) Elf64##_##x
+# else
+#  define ElfW(x) Elf32##_##x
+# endif
+#endif
+#ifndef ELF_ST_TYPE
+# if SIZEOF_VOIDP == 8
+#  define ELF_ST_TYPE ELF64_ST_TYPE
+# else
+#  define ELF_ST_TYPE ELF32_ST_TYPE
+# endif
+#endif
+#endif
+
+#ifdef SHF_COMPRESSED
+# if defined(ELFCOMPRESS_ZLIB) && defined(HAVE_LIBZ)
+   /* FreeBSD 11.0 lacks ELFCOMPRESS_ZLIB */
+#  include <zlib.h>
+#  define SUPPORT_COMPRESSED_DEBUG_LINE
 # endif
-# include <link.h>
+#else /* compatibility with glibc < 2.22 */
+# define SHF_COMPRESSED 0
+#endif
+
+#ifndef PATH_MAX
+#define PATH_MAX 4096
 #endif
 
 #define DW_LNS_copy                     0x01
@@ -80,40 +127,83 @@ void *alloca();
 #define DW_LNE_define_file              0x03
 #define DW_LNE_set_discriminator        0x04  /* DWARF4 */
 
-#ifndef ElfW
-# if SIZEOF_VOIDP == 8
-#  define ElfW(x) Elf64##_##x
-# else
-#  define ElfW(x) Elf32##_##x
-# endif
-#endif
-#ifndef PATH_MAX
-#define PATH_MAX 4096
-#endif
-
-int kprintf(const char *fmt, ...);
+PRINTF_ARGS(static int kprintf(const char *fmt, ...), 1, 2);
 
-typedef struct {
+typedef struct line_info {
     const char *dirname;
     const char *filename;
+    const char *path; /* object path */
     int line;
 
-    int fd;
-    void *mapped;
-    size_t mapped_size;
-    unsigned long base_addr;
+    uintptr_t base_addr;
+    uintptr_t saddr;
+    const char *sname; /* function name */
+
+    struct line_info *next;
 } line_info_t;
 
+struct dwarf_section {
+    char *ptr;
+    size_t size;
+    uint64_t flags;
+};
+
+typedef struct obj_info {
+    const char *path; /* object path */
+    char *mapped;
+    size_t mapped_size;
+    void *uncompressed;
+    uintptr_t base_addr;
+    uintptr_t vmaddr;
+    struct dwarf_section debug_abbrev;
+    struct dwarf_section debug_info;
+    struct dwarf_section debug_line;
+    struct dwarf_section debug_ranges;
+    struct dwarf_section debug_str_offsets;
+    struct dwarf_section debug_addr;
+    struct dwarf_section debug_rnglists;
+    struct dwarf_section debug_str;
+    struct dwarf_section debug_line_str;
+    struct obj_info *next;
+} obj_info_t;
+
+#define DWARF_SECTION_COUNT 9
+
+static struct dwarf_section *
+obj_dwarf_section_at(obj_info_t *obj, int n)
+{
+    struct dwarf_section *ary[] = {
+        &obj->debug_abbrev,
+        &obj->debug_info,
+        &obj->debug_line,
+        &obj->debug_ranges,
+        &obj->debug_str_offsets,
+        &obj->debug_addr,
+        &obj->debug_rnglists,
+        &obj->debug_str,
+        &obj->debug_line_str
+    };
+    if (n < 0 || DWARF_SECTION_COUNT <= n) {
+        abort();
+    }
+    return ary[n];
+}
+
+struct debug_section_definition {
+    const char *name;
+    struct dwarf_section *dwarf;
+};
+
 /* Avoid consuming stack as this module may be used from signal handler */
-static char binary_filename[PATH_MAX];
+static char binary_filename[PATH_MAX + 1];
 
 static unsigned long
-uleb128(char **p)
+uleb128(const char **p)
 {
     unsigned long r = 0;
     int s = 0;
     for (;;) {
-	unsigned char b = *(unsigned char *)(*p)++;
+	unsigned char b = (unsigned char)*(*p)++;
 	if (b < 0x80) {
 	    r += (unsigned long)b << s;
 	    break;
@@ -125,12 +215,12 @@ uleb128(char **p)
 }
 
 static long
-sleb128(char **p)
+sleb128(const char **p)
 {
     long r = 0;
     int s = 0;
     for (;;) {
-	unsigned char b = *(unsigned char *)(*p)++;
+	unsigned char b = (unsigned char)*(*p)++;
 	if (b < 0x80) {
 	    if (b & 0x40) {
 		r -= (0x80 - b) << s;
@@ -147,7 +237,7 @@ sleb128(char **p)
 }
 
 static const char *
-get_nth_dirname(unsigned long dir, char *p)
+get_nth_dirname(unsigned long dir, const char *p)
 {
     if (!dir--) {
 	return "";
@@ -164,155 +254,191 @@ get_nth_dirname(unsigned long dir, char *p)
     return p;
 }
 
+static const char *parse_ver5_debug_line_header(const char *p, int idx, uint8_t format, obj_info_t *obj, const char **out_path, uint64_t *out_directory_index);
+
 static void
-fill_filename(int file, char *include_directories, char *filenames,
-	      line_info_t *line)
+fill_filename(int file, uint8_t format, uint16_t version, const char *include_directories, const char *filenames, line_info_t *line, obj_info_t *obj)
 {
     int i;
-    char *p = filenames;
-    char *filename;
+    const char *p = filenames;
+    const char *filename;
     unsigned long dir;
-    for (i = 1; i <= file; i++) {
-	filename = p;
-	if (!*p) {
-	    /* Need to output binary file name? */
-	    kprintf("Unexpected file number %d in %s\n",
-		    file, binary_filename);
-	    return;
-	}
-	while (*p) p++;
-	p++;
-	dir = uleb128(&p);
-	/* last modified. */
-	uleb128(&p);
-	/* size of the file. */
-	uleb128(&p);
-
-	if (i == file) {
-	    line->filename = filename;
-	    line->dirname = get_nth_dirname(dir, include_directories);
-	}
-    }
-}
-
-static int
-get_path_from_symbol(const char *symbol, const char **p, size_t *len)
-{
-    if (symbol[0] == '0') {
-	/* libexecinfo */
-	*p   = strchr(symbol, '/');
-	if (*p == NULL) return 0;
-	*len = strlen(*p);
+    if (version >= 5) {
+        const char *path;
+        uint64_t directory_index = -1;
+        parse_ver5_debug_line_header(filenames, file, format, obj, &path, &directory_index);
+        line->filename = path;
+        parse_ver5_debug_line_header(include_directories, (int)directory_index, format, obj, &path, NULL);
+        line->dirname = path;
     }
     else {
-	/* glibc */
-	const char *q;
-	*p   = symbol;
-	q   = strchr(symbol, '(');
-	if (q == NULL) return 0;
-	*len = q - symbol;
+        for (i = 1; i <= file; i++) {
+            filename = p;
+            if (!*p) {
+                /* Need to output binary file name? */
+                kprintf("Unexpected file number %d in %s at %tx\n",
+                        file, binary_filename, filenames - obj->mapped);
+                return;
+            }
+            while (*p) p++;
+            p++;
+            dir = uleb128(&p);
+            /* last modified. */
+            uleb128(&p);
+            /* size of the file. */
+            uleb128(&p);
+
+            if (i == file) {
+                line->filename = filename;
+                line->dirname = get_nth_dirname(dir, include_directories);
+            }
+        }
     }
-    return 1;
 }
 
 static void
-fill_line(int num_traces, void **traces,
-	  unsigned long addr, int file, int line,
-	  char *include_directories, char *filenames, line_info_t *lines)
+fill_line(int num_traces, void **traces, uintptr_t addr, int file, int line,
+	  uint8_t format, uint16_t version, const char *include_directories, const char *filenames,
+	  obj_info_t *obj, line_info_t *lines, int offset)
 {
     int i;
-    for (i = 0; i < num_traces; i++) {
-	unsigned long a = (unsigned long)traces[i] - lines[i].base_addr;
+    addr += obj->base_addr - obj->vmaddr;
+    for (i = offset; i < num_traces; i++) {
+	uintptr_t a = (uintptr_t)traces[i];
 	/* We assume one line code doesn't result >100 bytes of native code.
        We may want more reliable way eventually... */
 	if (addr < a && a < addr + 100) {
-	    fill_filename(file, include_directories, filenames, &lines[i]);
+	    fill_filename(file, format, version, include_directories, filenames, &lines[i], obj);
 	    lines[i].line = line;
 	}
     }
 }
 
-static void
-parse_debug_line_cu(int num_traces, void **traces,
-		    char **debug_line, line_info_t *lines)
+struct LineNumberProgramHeader {
+    uint64_t unit_length;
+    uint16_t version;
+    uint8_t format; /* 4 or 8 */
+    uint64_t header_length;
+    uint8_t minimum_instruction_length;
+    uint8_t maximum_operations_per_instruction;
+    uint8_t default_is_stmt;
+    int8_t line_base;
+    uint8_t line_range;
+    uint8_t opcode_base;
+    /* uint8_t standard_opcode_lengths[opcode_base-1]; */
+    const char *include_directories;
+    const char *filenames;
+    const char *cu_start;
+    const char *cu_end;
+};
+
+static int
+parse_debug_line_header(obj_info_t *obj, const char **pp, struct LineNumberProgramHeader *header)
 {
-    char *p, *cu_end, *cu_start, *include_directories, *filenames;
-    unsigned long unit_length;
-    int default_is_stmt, line_base;
-    unsigned int header_length, minimum_instruction_length, line_range,
-		 opcode_base;
-    /* unsigned char *standard_opcode_lengths; */
+    const char *p = *pp;
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+	header->unit_length = *(uint64_t *)p;
+	p += sizeof(uint64_t);
+        header->format = 8;
+    }
 
-    /* The registers. */
-    unsigned long addr = 0;
-    unsigned int file = 1;
-    unsigned int line = 1;
-    /* unsigned int column = 0; */
-    int is_stmt;
-    /* int basic_block = 0; */
-    /* int end_sequence = 0; */
-    /* int prologue_end = 0; */
-    /* int epilogue_begin = 0; */
-    /* unsigned int isa = 0; */
+    header->cu_end = p + header->unit_length;
 
-    p = *debug_line;
+    header->version = *(uint16_t *)p;
+    p += sizeof(uint16_t);
+    if (header->version > 5) return -1;
 
-    unit_length = *(unsigned int *)p;
-    p += sizeof(unsigned int);
-    if (unit_length == 0xffffffff) {
-	unit_length = *(unsigned long *)p;
-	p += sizeof(unsigned long);
+    if (header->version >= 5) {
+        /* address_size = *(uint8_t *)p++; */
+        /* segment_selector_size = *(uint8_t *)p++; */
+        p += 2;
     }
 
-    cu_end = p + unit_length;
-
-    /*dwarf_version = *(unsigned short *)p;*/
-    p += 2;
-
-    header_length = *(unsigned int *)p;
-    p += sizeof(unsigned int);
+    header->header_length = header->format == 4 ? *(uint32_t *)p : *(uint64_t *)p;
+    p += header->format;
+    header->cu_start = p + header->header_length;
 
-    cu_start = p + header_length;
+    header->minimum_instruction_length = *(uint8_t *)p++;
 
-    minimum_instruction_length = *(unsigned char *)p;
-    p++;
+    if (header->version >= 4) {
+        /* maximum_operations_per_instruction = *(uint8_t *)p; */
+        if (*p != 1) return -1; /* For non-VLIW architectures, this field is 1 */
+        p++;
+    }
 
-    is_stmt = default_is_stmt = *(unsigned char *)p;
-    p++;
+    header->default_is_stmt = *(uint8_t *)p++;
+    header->line_base = *(int8_t *)p++;
+    header->line_range = *(uint8_t *)p++;
+    header->opcode_base = *(uint8_t *)p++;
+    /* header->standard_opcode_lengths = (uint8_t *)p - 1; */
+    p += header->opcode_base - 1;
+
+    if (header->version >= 5) {
+        header->include_directories = p;
+        p = parse_ver5_debug_line_header(p, -1, header->format, obj, NULL, NULL);
+        header->filenames = p;
+    }
+    else {
+        header->include_directories = p;
 
-    line_base = *(char *)p;
-    p++;
+        /* temporary measure for compress-debug-sections */
+        if (p >= header->cu_end) return -1;
 
-    line_range = *(unsigned char *)p;
-    p++;
+        /* skip include directories */
+        while (*p) {
+            p = memchr(p, '\0', header->cu_end - p);
+            if (!p) return -1;
+            p++;
+        }
+        p++;
 
-    opcode_base = *(unsigned char *)p;
-    p++;
+        header->filenames = p;
+    }
 
-    /* standard_opcode_lengths = (unsigned char *)p - 1; */
-    p += opcode_base - 1;
+    *pp = header->cu_start;
 
-    include_directories = p;
+    return 0;
+}
 
-    /* skip include directories */
-    while (*p) {
-	while (*p) p++;
-	p++;
-    }
-    p++;
+static int
+parse_debug_line_cu(int num_traces, void **traces, const char **debug_line,
+		obj_info_t *obj, line_info_t *lines, int offset)
+{
+    const char *p = (const char *)*debug_line;
+    struct LineNumberProgramHeader header;
 
-    filenames = p;
+    /* The registers. */
+    unsigned long addr = 0;
+    unsigned int file = 1;
+    unsigned int line = 1;
+    /* unsigned int column = 0; */
+    int is_stmt;
+    /* int basic_block = 0; */
+    /* int end_sequence = 0; */
+    /* int prologue_end = 0; */
+    /* int epilogue_begin = 0; */
+    /* unsigned int isa = 0; */
 
-    p = cu_start;
+    if (parse_debug_line_header(obj, &p, &header))
+        return -1;
+    is_stmt = header.default_is_stmt;
 
 #define FILL_LINE()						    \
     do {							    \
 	fill_line(num_traces, traces, addr, file, line,		    \
-		  include_directories, filenames, lines);	    \
+                  header.format,                                    \
+                  header.version,                                   \
+                  header.include_directories,                       \
+                  header.filenames,                                 \
+		  obj, lines, offset);				    \
 	/*basic_block = prologue_end = epilogue_begin = 0;*/	    \
     } while (0)
 
-    while (p < cu_end) {
+    while (p < header.cu_end) {
 	unsigned long a;
 	unsigned char op = *p++;
 	switch (op) {
@@ -320,7 +446,7 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    FILL_LINE();
 	    break;
 	case DW_LNS_advance_pc:
-	    a = uleb128(&p);
+	    a = uleb128(&p) * header.minimum_instruction_length;
 	    addr += a;
 	    break;
 	case DW_LNS_advance_line: {
@@ -341,12 +467,13 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    /*basic_block = 1; */
 	    break;
 	case DW_LNS_const_add_pc:
-	    a = ((255 - opcode_base) / line_range) *
-		minimum_instruction_length;
+	    a = ((255UL - header.opcode_base) / header.line_range) *
+		header.minimum_instruction_length;
 	    addr += a;
 	    break;
 	case DW_LNS_fixed_advance_pc:
-	    a = *(unsigned char *)p++;
+	    a = *(uint16_t *)p;
+	    p += sizeof(uint16_t);
 	    addr += a;
 	    break;
 	case DW_LNS_set_prologue_end:
@@ -359,7 +486,7 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    /* isa = (unsigned int)*/(void)uleb128(&p);
 	    break;
 	case 0:
-	    a = *(unsigned char *)p++;
+	    a = uleb128(&p);
 	    op = *p++;
 	    switch (op) {
 	    case DW_LNE_end_sequence:
@@ -369,7 +496,7 @@ parse_debug_line_cu(int num_traces, void **traces,
 		file = 1;
 		line = 1;
 		/* column = 0; */
-		is_stmt = default_is_stmt;
+		is_stmt = header.default_is_stmt;
 		/* end_sequence = 0; */
 		/* isa = 0; */
 		break;
@@ -391,48 +518,74 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    }
 	    break;
 	default: {
-	    unsigned long addr_incr;
-	    unsigned long line_incr;
-	    a = op - opcode_base;
-	    addr_incr = (a / line_range) * minimum_instruction_length;
-	    line_incr = line_base + (a % line_range);
-	    addr += (unsigned int)addr_incr;
-	    line += (unsigned int)line_incr;
+            uint8_t adjusted_opcode = op - header.opcode_base;
+            uint8_t operation_advance = adjusted_opcode / header.line_range;
+            /* NOTE: this code doesn't support VLIW */
+            addr += operation_advance * header.minimum_instruction_length;
+            line += header.line_base + (adjusted_opcode % header.line_range);
 	    FILL_LINE();
 	}
 	}
     }
-    *debug_line = p;
+    *debug_line = (char *)p;
+    return 0;
 }
 
-static void
+static int
 parse_debug_line(int num_traces, void **traces,
-		 char *debug_line, unsigned long size, line_info_t *lines)
+		 const char *debug_line, unsigned long size,
+		 obj_info_t *obj, line_info_t *lines, int offset)
 {
-    char *debug_line_end = debug_line + size;
+    const char *debug_line_end = debug_line + size;
     while (debug_line < debug_line_end) {
-	parse_debug_line_cu(num_traces, traces, &debug_line, lines);
+	if (parse_debug_line_cu(num_traces, traces, &debug_line, obj, lines, offset))
+	    return -1;
     }
     if (debug_line != debug_line_end) {
 	kprintf("Unexpected size of .debug_line in %s\n",
 		binary_filename);
     }
+    return 0;
 }
 
 /* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+	   obj_info_t **objp, line_info_t *lines, int offset);
+
 static void
-fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
-	   line_info_t *current_line, line_info_t *lines);
+append_obj(obj_info_t **objp)
+{
+    obj_info_t *newobj = calloc(1, sizeof(obj_info_t));
+    if (*objp) (*objp)->next = newobj;
+    *objp = newobj;
+}
 
+#ifdef USE_ELF
+/* Ideally we should check 4 paths to follow gnu_debuglink:
+ *
+ *   - /usr/lib/debug/.build-id/ab/cdef1234.debug
+ *   - /usr/bin/ruby.debug
+ *   - /usr/bin/.debug/ruby.debug
+ *   - /usr/lib/debug/usr/bin/ruby.debug.
+ *
+ * but we handle only two cases for now as the two formats are
+ * used by some linux distributions.
+ *
+ * See GDB's info for detail.
+ * https://sourceware.org/gdb/onlinedocs/gdb/Separate-Debug-Files.html
+ */
+
+// check the path pattern of "/usr/lib/debug/usr/bin/ruby.debug"
 static void
-follow_debuglink(char *debuglink, int num_traces, void **traces, char **syms,
-		 line_info_t *current_line, line_info_t *lines)
+follow_debuglink(const char *debuglink, int num_traces, void **traces,
+		 obj_info_t **objp, line_info_t *lines, int offset)
 {
-    /* Ideally we should check 4 paths to follow gnu_debuglink,
-       but we handle only one case for now as this format is used
-       by some linux distributions. See GDB's info for detail. */
     static const char global_debug_dir[] = "/usr/lib/debug";
-    char *p, *subdir;
+    const size_t global_debug_dir_len = sizeof(global_debug_dir) - 1;
+    char *p;
+    obj_info_t *o1 = *objp, *o2;
+    size_t len;
 
     p = strrchr(binary_filename, '/');
     if (!p) {
@@ -440,50 +593,1448 @@ follow_debuglink(char *debuglink, int num_traces, void **traces, char **syms,
     }
     p[1] = '\0';
 
-    subdir = (char *)alloca(strlen(binary_filename) + 1);
-    strcpy(subdir, binary_filename);
-    strcpy(binary_filename, global_debug_dir);
-    strncat(binary_filename, subdir,
-	    PATH_MAX - strlen(binary_filename) - 1);
-    strncat(binary_filename, debuglink,
-	    PATH_MAX - strlen(binary_filename) - 1);
+    len = strlen(binary_filename);
+    if (len >= PATH_MAX - global_debug_dir_len)
+	len = PATH_MAX - global_debug_dir_len - 1;
+    memmove(binary_filename + global_debug_dir_len, binary_filename, len);
+    memcpy(binary_filename, global_debug_dir, global_debug_dir_len);
+    len += global_debug_dir_len;
+    strlcpy(binary_filename + len, debuglink, PATH_MAX - len);
+
+    append_obj(objp);
+    o2 = *objp;
+    o2->base_addr = o1->base_addr;
+    o2->path = o1->path;
+    fill_lines(num_traces, traces, 0, objp, lines, offset);
+}
 
-    munmap(current_line->mapped, current_line->mapped_size);
-    close(current_line->fd);
-    fill_lines(num_traces, traces, syms, 0, current_line, lines);
+// check the path pattern of "/usr/lib/debug/.build-id/ab/cdef1234.debug"
+static void
+follow_debuglink_build_id(const char *build_id, size_t build_id_size, int num_traces, void **traces,
+                          obj_info_t **objp, line_info_t *lines, int offset)
+{
+    static const char global_debug_dir[] = "/usr/lib/debug/.build-id/";
+    const size_t global_debug_dir_len = sizeof(global_debug_dir) - 1;
+    char *p;
+    obj_info_t *o1 = *objp, *o2;
+    size_t i;
+
+    if (PATH_MAX < global_debug_dir_len + 1 + build_id_size * 2 + 6) return;
+
+    memcpy(binary_filename, global_debug_dir, global_debug_dir_len);
+    p = binary_filename + global_debug_dir_len;
+    for (i = 0; i < build_id_size; i++) {
+        static const char tbl[] = "0123456789abcdef";
+        unsigned char n = build_id[i];
+        *p++ = tbl[n / 16];
+        *p++ = tbl[n % 16];
+        if (i == 0) *p++ = '/';
+    }
+    strcpy(p, ".debug");
+
+    append_obj(objp);
+    o2 = *objp;
+    o2->base_addr = o1->base_addr;
+    o2->path = o1->path;
+    fill_lines(num_traces, traces, 0, objp, lines, offset);
+}
+#endif
+
+enum
+{
+    DW_TAG_compile_unit = 0x11,
+    DW_TAG_inlined_subroutine = 0x1d,
+    DW_TAG_subprogram = 0x2e,
+};
+
+/* Attributes encodings */
+enum
+{
+    DW_AT_sibling = 0x01,
+    DW_AT_location = 0x02,
+    DW_AT_name = 0x03,
+    /* Reserved 0x04 */
+    /* Reserved 0x05 */
+    /* Reserved 0x06 */
+    /* Reserved 0x07 */
+    /* Reserved 0x08 */
+    DW_AT_ordering = 0x09,
+    /* Reserved 0x0a */
+    DW_AT_byte_size = 0x0b,
+    /* Reserved 0x0c */
+    DW_AT_bit_size = 0x0d,
+    /* Reserved 0x0e */
+    /* Reserved 0x0f */
+    DW_AT_stmt_list = 0x10,
+    DW_AT_low_pc = 0x11,
+    DW_AT_high_pc = 0x12,
+    DW_AT_language = 0x13,
+    /* Reserved 0x14 */
+    DW_AT_discr = 0x15,
+    DW_AT_discr_value = 0x16,
+    DW_AT_visibility = 0x17,
+    DW_AT_import = 0x18,
+    DW_AT_string_length = 0x19,
+    DW_AT_common_reference = 0x1a,
+    DW_AT_comp_dir = 0x1b,
+    DW_AT_const_value = 0x1c,
+    DW_AT_containing_type = 0x1d,
+    DW_AT_default_value = 0x1e,
+    /* Reserved 0x1f */
+    DW_AT_inline = 0x20,
+    DW_AT_is_optional = 0x21,
+    DW_AT_lower_bound = 0x22,
+    /* Reserved 0x23 */
+    /* Reserved 0x24 */
+    DW_AT_producer = 0x25,
+    /* Reserved 0x26 */
+    DW_AT_prototyped = 0x27,
+    /* Reserved 0x28 */
+    /* Reserved 0x29 */
+    DW_AT_return_addr = 0x2a,
+    /* Reserved 0x2b */
+    DW_AT_start_scope = 0x2c,
+    /* Reserved 0x2d */
+    DW_AT_bit_stride = 0x2e,
+    DW_AT_upper_bound = 0x2f,
+    /* Reserved 0x30 */
+    DW_AT_abstract_origin = 0x31,
+    DW_AT_accessibility = 0x32,
+    DW_AT_address_class = 0x33,
+    DW_AT_artificial = 0x34,
+    DW_AT_base_types = 0x35,
+    DW_AT_calling_convention = 0x36,
+    DW_AT_count = 0x37,
+    DW_AT_data_member_location = 0x38,
+    DW_AT_decl_column = 0x39,
+    DW_AT_decl_file = 0x3a,
+    DW_AT_decl_line = 0x3b,
+    DW_AT_declaration = 0x3c,
+    DW_AT_discr_list = 0x3d,
+    DW_AT_encoding = 0x3e,
+    DW_AT_external = 0x3f,
+    DW_AT_frame_base = 0x40,
+    DW_AT_friend = 0x41,
+    DW_AT_identifier_case = 0x42,
+    /* Reserved 0x43 */
+    DW_AT_namelist_item = 0x44,
+    DW_AT_priority = 0x45,
+    DW_AT_segment = 0x46,
+    DW_AT_specification = 0x47,
+    DW_AT_static_link = 0x48,
+    DW_AT_type = 0x49,
+    DW_AT_use_location = 0x4a,
+    DW_AT_variable_parameter = 0x4b,
+    DW_AT_virtuality = 0x4c,
+    DW_AT_vtable_elem_location = 0x4d,
+    DW_AT_allocated = 0x4e,
+    DW_AT_associated = 0x4f,
+    DW_AT_data_location = 0x50,
+    DW_AT_byte_stride = 0x51,
+    DW_AT_entry_pc = 0x52,
+    DW_AT_use_UTF8 = 0x53,
+    DW_AT_extension = 0x54,
+    DW_AT_ranges = 0x55,
+    DW_AT_trampoline = 0x56,
+    DW_AT_call_column = 0x57,
+    DW_AT_call_file = 0x58,
+    DW_AT_call_line = 0x59,
+    DW_AT_description = 0x5a,
+    DW_AT_binary_scale = 0x5b,
+    DW_AT_decimal_scale = 0x5c,
+    DW_AT_small = 0x5d,
+    DW_AT_decimal_sign = 0x5e,
+    DW_AT_digit_count = 0x5f,
+    DW_AT_picture_string = 0x60,
+    DW_AT_mutable = 0x61,
+    DW_AT_threads_scaled = 0x62,
+    DW_AT_explicit = 0x63,
+    DW_AT_object_pointer = 0x64,
+    DW_AT_endianity = 0x65,
+    DW_AT_elemental = 0x66,
+    DW_AT_pure = 0x67,
+    DW_AT_recursive = 0x68,
+    DW_AT_signature = 0x69,
+    DW_AT_main_subprogram = 0x6a,
+    DW_AT_data_bit_offset = 0x6b,
+    DW_AT_const_expr = 0x6c,
+    DW_AT_enum_class = 0x6d,
+    DW_AT_linkage_name = 0x6e,
+    DW_AT_string_length_bit_size = 0x6f,
+    DW_AT_string_length_byte_size = 0x70,
+    DW_AT_rank = 0x71,
+    DW_AT_str_offsets_base = 0x72,
+    DW_AT_addr_base = 0x73,
+    DW_AT_rnglists_base = 0x74,
+    /* Reserved 0x75 */
+    DW_AT_dwo_name = 0x76,
+    DW_AT_reference = 0x77,
+    DW_AT_rvalue_reference = 0x78,
+    DW_AT_macros = 0x79,
+    DW_AT_call_all_calls = 0x7a,
+    DW_AT_call_all_source_calls = 0x7b,
+    DW_AT_call_all_tail_calls = 0x7c,
+    DW_AT_call_return_pc = 0x7d,
+    DW_AT_call_value = 0x7e,
+    DW_AT_call_origin = 0x7f,
+    DW_AT_call_parameter = 0x80,
+    DW_AT_call_pc = 0x81,
+    DW_AT_call_tail_call = 0x82,
+    DW_AT_call_target = 0x83,
+    DW_AT_call_target_clobbered = 0x84,
+    DW_AT_call_data_location = 0x85,
+    DW_AT_call_data_value = 0x86,
+    DW_AT_noreturn = 0x87,
+    DW_AT_alignment = 0x88,
+    DW_AT_export_symbols = 0x89,
+    DW_AT_deleted = 0x8a,
+    DW_AT_defaulted = 0x8b,
+    DW_AT_loclists_base = 0x8c,
+    DW_AT_lo_user = 0x2000,
+    DW_AT_hi_user = 0x3fff
+};
+
+/* Attribute form encodings */
+enum
+{
+    DW_FORM_addr = 0x01,
+    /* Reserved 0x02 */
+    DW_FORM_block2 = 0x03,
+    DW_FORM_block4 = 0x04,
+    DW_FORM_data2 = 0x05,
+    DW_FORM_data4 = 0x06,
+    DW_FORM_data8 = 0x07,
+    DW_FORM_string = 0x08,
+    DW_FORM_block = 0x09,
+    DW_FORM_block1 = 0x0a,
+    DW_FORM_data1 = 0x0b,
+    DW_FORM_flag = 0x0c,
+    DW_FORM_sdata = 0x0d,
+    DW_FORM_strp = 0x0e,
+    DW_FORM_udata = 0x0f,
+    DW_FORM_ref_addr = 0x10,
+    DW_FORM_ref1 = 0x11,
+    DW_FORM_ref2 = 0x12,
+    DW_FORM_ref4 = 0x13,
+    DW_FORM_ref8 = 0x14,
+    DW_FORM_ref_udata = 0x15,
+    DW_FORM_indirect = 0x16,
+    DW_FORM_sec_offset = 0x17,
+    DW_FORM_exprloc = 0x18,
+    DW_FORM_flag_present = 0x19,
+    DW_FORM_strx = 0x1a,
+    DW_FORM_addrx = 0x1b,
+    DW_FORM_ref_sup4 = 0x1c,
+    DW_FORM_strp_sup = 0x1d,
+    DW_FORM_data16 = 0x1e,
+    DW_FORM_line_strp = 0x1f,
+    DW_FORM_ref_sig8 = 0x20,
+    DW_FORM_implicit_const = 0x21,
+    DW_FORM_loclistx = 0x22,
+    DW_FORM_rnglistx = 0x23,
+    DW_FORM_ref_sup8 = 0x24,
+    DW_FORM_strx1 = 0x25,
+    DW_FORM_strx2 = 0x26,
+    DW_FORM_strx3 = 0x27,
+    DW_FORM_strx4 = 0x28,
+    DW_FORM_addrx1 = 0x29,
+    DW_FORM_addrx2 = 0x2a,
+    DW_FORM_addrx3 = 0x2b,
+    DW_FORM_addrx4 = 0x2c
+};
+
+/* Range list entry encodings */
+enum {
+    DW_RLE_end_of_list = 0x00,
+    DW_RLE_base_addressx = 0x01,
+    DW_RLE_startx_endx = 0x02,
+    DW_RLE_startx_length = 0x03,
+    DW_RLE_offset_pair = 0x04,
+    DW_RLE_base_address = 0x05,
+    DW_RLE_start_end = 0x06,
+    DW_RLE_start_length = 0x07
+};
+
+enum {
+    VAL_none = 0,
+    VAL_cstr = 1,
+    VAL_data = 2,
+    VAL_uint = 3,
+    VAL_int = 4,
+    VAL_addr = 5
+};
+
+# define ABBREV_TABLE_SIZE 256
+typedef struct {
+    obj_info_t *obj;
+    const char *file;
+    uint8_t current_version;
+    const char *current_cu;
+    uint64_t current_low_pc;
+    uint64_t current_str_offsets_base;
+    uint64_t current_addr_base;
+    uint64_t current_rnglists_base;
+    const char *debug_line_cu_end;
+    uint8_t debug_line_format;
+    uint16_t debug_line_version;
+    const char *debug_line_files;
+    const char *debug_line_directories;
+    const char *p;
+    const char *cu_end;
+    const char *pend;
+    const char *q0;
+    const char *q;
+    int format; // 4 or 8
+    uint8_t address_size;
+    int level;
+    const char *abbrev_table[ABBREV_TABLE_SIZE];
+} DebugInfoReader;
+
+typedef struct {
+    ptrdiff_t pos;
+    int tag;
+    int has_children;
+} DIE;
+
+typedef struct {
+    union {
+        const char *ptr;
+        uint64_t uint64;
+        int64_t int64;
+        uint64_t addr_idx;
+    } as;
+    uint64_t off;
+    uint64_t at;
+    uint64_t form;
+    size_t size;
+    int type;
+} DebugInfoValue;
+
+#if defined(WORDS_BIGENDIAN)
+#define MERGE_2INTS(a,b,sz) (((uint64_t)(a)<<sz)|(b))
+#else
+#define MERGE_2INTS(a,b,sz) (((uint64_t)(b)<<sz)|(a))
+#endif
+
+static uint16_t
+get_uint16(const uint8_t *p)
+{
+    return (uint16_t)MERGE_2INTS(p[0],p[1],8);
+}
+
+static uint32_t
+get_uint32(const uint8_t *p)
+{
+    return (uint32_t)MERGE_2INTS(get_uint16(p),get_uint16(p+2),16);
+}
+
+static uint64_t
+get_uint64(const uint8_t *p)
+{
+    return MERGE_2INTS(get_uint32(p),get_uint32(p+4),32);
+}
+
+static uint8_t
+read_uint8(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 1);
+    return (uint8_t)*p;
+}
+
+static uint16_t
+read_uint16(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 2);
+    return get_uint16((const uint8_t *)p);
+}
+
+static uint32_t
+read_uint24(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 3);
+    return ((uint8_t)*p << 16) | get_uint16((const uint8_t *)p+1);
+}
+
+static uint32_t
+read_uint32(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 4);
+    return get_uint32((const uint8_t *)p);
+}
+
+static uint64_t
+read_uint64(const char **ptr)
+{
+    const unsigned char *p = (const unsigned char *)*ptr;
+    *ptr = (char *)(p + 8);
+    return get_uint64(p);
+}
+
+static uintptr_t
+read_uintptr(const char **ptr)
+{
+    const unsigned char *p = (const unsigned char *)*ptr;
+    *ptr = (char *)(p + SIZEOF_VOIDP);
+#if SIZEOF_VOIDP == 8
+    return get_uint64(p);
+#else
+    return get_uint32(p);
+#endif
+}
+
+static uint64_t
+read_uint(DebugInfoReader *reader)
+{
+    if (reader->format == 4) {
+        return read_uint32(&reader->p);
+    } else { /* 64 bit */
+        return read_uint64(&reader->p);
+    }
+}
+
+static uint64_t
+read_uleb128(DebugInfoReader *reader)
+{
+    return uleb128(&reader->p);
+}
+
+static int64_t
+read_sleb128(DebugInfoReader *reader)
+{
+    return sleb128(&reader->p);
 }
 
-/* read file and fill lines */
 static void
-fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
-	   line_info_t *current_line, line_info_t *lines)
+debug_info_reader_init(DebugInfoReader *reader, obj_info_t *obj)
 {
-    int i;
+    reader->file = obj->mapped;
+    reader->obj = obj;
+    reader->p = obj->debug_info.ptr;
+    reader->pend = obj->debug_info.ptr + obj->debug_info.size;
+    reader->debug_line_cu_end = obj->debug_line.ptr;
+    reader->current_low_pc = 0;
+    reader->current_str_offsets_base = 0;
+    reader->current_addr_base = 0;
+    reader->current_rnglists_base = 0;
+}
+
+static void
+di_skip_die_attributes(const char **p)
+{
+    for (;;) {
+        uint64_t at = uleb128(p);
+        uint64_t form = uleb128(p);
+        if (!at && !form) break;
+        switch (form) {
+          default:
+            break;
+          case DW_FORM_implicit_const:
+            sleb128(p);
+            break;
+        }
+    }
+}
+
+static void
+di_read_debug_abbrev_cu(DebugInfoReader *reader)
+{
+    uint64_t prev = 0;
+    const char *p = reader->q0;
+    for (;;) {
+        uint64_t abbrev_number = uleb128(&p);
+        if (abbrev_number <= prev) break;
+        if (abbrev_number < ABBREV_TABLE_SIZE) {
+            reader->abbrev_table[abbrev_number] = p;
+        }
+        prev = abbrev_number;
+        uleb128(&p); /* tag */
+        p++; /* has_children */
+        di_skip_die_attributes(&p);
+    }
+}
+
+static int
+di_read_debug_line_cu(DebugInfoReader *reader)
+{
+    const char *p;
+    struct LineNumberProgramHeader header;
+
+    p = (const char *)reader->debug_line_cu_end;
+    if (parse_debug_line_header(reader->obj, &p, &header))
+        return -1;
+
+    reader->debug_line_cu_end = (char *)header.cu_end;
+    reader->debug_line_format = header.format;
+    reader->debug_line_version = header.version;
+    reader->debug_line_directories = (char *)header.include_directories;
+    reader->debug_line_files = (char *)header.filenames;
+
+    return 0;
+}
+
+static void
+set_addr_idx_value(DebugInfoValue *v, uint64_t n)
+{
+    v->as.addr_idx = n;
+    v->type = VAL_addr;
+}
+
+static void
+set_uint_value(DebugInfoValue *v, uint64_t n)
+{
+    v->as.uint64 = n;
+    v->type = VAL_uint;
+}
+
+static void
+set_int_value(DebugInfoValue *v, int64_t n)
+{
+    v->as.int64 = n;
+    v->type = VAL_int;
+}
+
+static void
+set_cstr_value(DebugInfoValue *v, const char *s)
+{
+    v->as.ptr = s;
+    v->off = 0;
+    v->type = VAL_cstr;
+}
+
+static void
+set_cstrp_value(DebugInfoValue *v, const char *s, uint64_t off)
+{
+    v->as.ptr = s;
+    v->off = off;
+    v->type = VAL_cstr;
+}
+
+static void
+set_data_value(DebugInfoValue *v, const char *s)
+{
+    v->as.ptr = s;
+    v->type = VAL_data;
+}
+
+static const char *
+get_cstr_value(DebugInfoValue *v)
+{
+    if (v->as.ptr) {
+        return v->as.ptr + v->off;
+    } else {
+        return NULL;
+    }
+}
+
+static const char *
+resolve_strx(DebugInfoReader *reader, uint64_t idx)
+{
+    const char *p = reader->obj->debug_str_offsets.ptr + reader->current_str_offsets_base;
+    uint64_t off;
+    if (reader->format == 4) {
+        off = ((uint32_t *)p)[idx];
+    }
+    else {
+        off = ((uint64_t *)p)[idx];
+    }
+    return reader->obj->debug_str.ptr + off;
+}
+
+static void
+debug_info_reader_read_addr_value(DebugInfoReader *reader, DebugInfoValue *v)
+{
+    if (reader->address_size == 4) {
+        set_uint_value(v, read_uint32(&reader->p));
+    } else if (reader->address_size == 8) {
+        set_uint_value(v, read_uint64(&reader->p));
+    } else {
+        fprintf(stderr,"unknown address_size:%d", reader->address_size);
+        abort();
+    }
+}
+
+static void
+debug_info_reader_read_value(DebugInfoReader *reader, uint64_t form, DebugInfoValue *v)
+{
+    switch (form) {
+      case DW_FORM_addr:
+        debug_info_reader_read_addr_value(reader, v);
+        break;
+      case DW_FORM_block2:
+        v->size = read_uint16(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_block4:
+        v->size = read_uint32(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_data2:
+        set_uint_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_data4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_data8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_string:
+        v->size = strlen(reader->p);
+        set_cstr_value(v, reader->p);
+        reader->p += v->size + 1;
+        break;
+      case DW_FORM_block:
+        v->size = uleb128(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_block1:
+        v->size = read_uint8(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_data1:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_flag:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_sdata:
+        set_int_value(v, read_sleb128(reader));
+        break;
+      case DW_FORM_strp:
+        set_cstrp_value(v, reader->obj->debug_str.ptr, read_uint(reader));
+        break;
+      case DW_FORM_udata:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_ref_addr:
+        if (reader->current_version <= 2) {
+            // DWARF Version 2 specifies that references have
+            // the same size as an address on the target system
+            debug_info_reader_read_addr_value(reader, v);
+        } else {
+            if (reader->format == 4) {
+                set_uint_value(v, read_uint32(&reader->p));
+            } else if (reader->format == 8) {
+                set_uint_value(v, read_uint64(&reader->p));
+            } else {
+                fprintf(stderr,"unknown format:%d", reader->format);
+                abort();
+            }
+        }
+        break;
+      case DW_FORM_ref1:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_ref2:
+        set_uint_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_ref4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_ref8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_ref_udata:
+        set_uint_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_indirect:
+        /* TODO: read the referred value */
+        set_uint_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_sec_offset:
+        set_uint_value(v, read_uint(reader)); /* offset */
+        /* addrptr: debug_addr */
+        /* lineptr: debug_line */
+        /* loclist: debug_loclists */
+        /* loclistptr: debug_loclists */
+        /* macptr: debug_macro */
+        /* rnglist: debug_rnglists */
+        /* rnglistptr: debug_rnglists */
+        /* stroffsetsptr: debug_str_offsets */
+        break;
+      case DW_FORM_exprloc:
+        v->size = (size_t)read_uleb128(reader);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_flag_present:
+        set_uint_value(v, 1);
+        break;
+      case DW_FORM_strx:
+        set_cstr_value(v, resolve_strx(reader, uleb128(&reader->p)));
+        break;
+      case DW_FORM_addrx:
+        set_addr_idx_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_ref_sup4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_strp_sup:
+        set_uint_value(v, read_uint(reader));
+        /* *p = reader->sup_file + reader->sup_str->sh_offset + ret; */
+        break;
+      case DW_FORM_data16:
+        v->size = 16;
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_line_strp:
+        set_cstrp_value(v, reader->obj->debug_line_str.ptr, read_uint(reader));
+        break;
+      case DW_FORM_ref_sig8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_implicit_const:
+        set_int_value(v, sleb128(&reader->q));
+        break;
+      case DW_FORM_loclistx:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_rnglistx:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_ref_sup8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_strx1:
+        set_cstr_value(v, resolve_strx(reader, read_uint8(&reader->p)));
+        break;
+      case DW_FORM_strx2:
+        set_cstr_value(v, resolve_strx(reader, read_uint16(&reader->p)));
+        break;
+      case DW_FORM_strx3:
+        set_cstr_value(v, resolve_strx(reader, read_uint24(&reader->p)));
+        break;
+      case DW_FORM_strx4:
+        set_cstr_value(v, resolve_strx(reader, read_uint32(&reader->p)));
+        break;
+      case DW_FORM_addrx1:
+        set_addr_idx_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_addrx2:
+        set_addr_idx_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_addrx3:
+        set_addr_idx_value(v, read_uint24(&reader->p));
+        break;
+      case DW_FORM_addrx4:
+        set_addr_idx_value(v, read_uint32(&reader->p));
+        break;
+      case 0:
+        goto fail;
+        break;
+    }
+    return;
+
+  fail:
+    fprintf(stderr, "%d: unsupported form: %#"PRIx64"\n", __LINE__, form);
+    exit(1);
+}
+
+/* find abbrev in current compilation unit */
+static const char *
+di_find_abbrev(DebugInfoReader *reader, uint64_t abbrev_number)
+{
+    const char *p;
+    if (abbrev_number < ABBREV_TABLE_SIZE) {
+        return reader->abbrev_table[abbrev_number];
+    }
+    p = reader->abbrev_table[ABBREV_TABLE_SIZE-1];
+    /* skip 255th record */
+    uleb128(&p); /* tag */
+    p++; /* has_children */
+    di_skip_die_attributes(&p);
+    for (uint64_t n = uleb128(&p); abbrev_number != n; n = uleb128(&p)) {
+        if (n == 0) {
+            fprintf(stderr,"%d: Abbrev Number %"PRId64" not found\n",__LINE__, abbrev_number);
+            exit(1);
+        }
+        uleb128(&p); /* tag */
+        p++; /* has_children */
+        di_skip_die_attributes(&p);
+    }
+    return p;
+}
+
+#if 0
+static void
+hexdump0(const unsigned char *p, size_t n)
+{
+    size_t i;
+    fprintf(stderr, "     0  1  2  3  4  5  6  7  8  9  A  B  C  D  E  F\n");
+    for (i=0; i < n; i++){
+        switch (i & 15) {
+          case 0:
+            fprintf(stderr, "%02" PRIdSIZE ": %02X ", i/16, p[i]);
+            break;
+          case 15:
+            fprintf(stderr, "%02X\n", p[i]);
+            break;
+          default:
+            fprintf(stderr, "%02X ", p[i]);
+            break;
+        }
+    }
+    if ((i & 15) != 15) {
+        fprintf(stderr, "\n");
+    }
+}
+#define hexdump(p,n) hexdump0((const unsigned char *)p, n)
+
+static void
+div_inspect(DebugInfoValue *v)
+{
+    switch (v->type) {
+      case VAL_uint:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:%"PRIx64"\n",__LINE__,v->type,v->size,v->as.uint64);
+        break;
+      case VAL_int:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:%"PRId64"\n",__LINE__,v->type,v->size,(int64_t)v->as.uint64);
+        break;
+      case VAL_cstr:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:'%s'\n",__LINE__,v->type,v->size,v->as.ptr);
+        break;
+      case VAL_data:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:\n",__LINE__,v->type,v->size);
+        hexdump(v->as.ptr, 16);
+        break;
+    }
+}
+#endif
+
+static DIE *
+di_read_die(DebugInfoReader *reader, DIE *die)
+{
+    uint64_t abbrev_number = uleb128(&reader->p);
+    if (abbrev_number == 0) {
+        reader->level--;
+        return NULL;
+    }
+
+    reader->q = di_find_abbrev(reader, abbrev_number);
+
+    die->pos = reader->p - reader->obj->debug_info.ptr - 1;
+    die->tag = (int)uleb128(&reader->q); /* tag */
+    die->has_children = *reader->q++; /* has_children */
+    if (die->has_children) {
+        reader->level++;
+    }
+    return die;
+}
+
+static DebugInfoValue *
+di_read_record(DebugInfoReader *reader, DebugInfoValue *vp)
+{
+    uint64_t at = uleb128(&reader->q);
+    uint64_t form = uleb128(&reader->q);
+    if (!at || !form) return NULL;
+    vp->at = at;
+    vp->form = form;
+    debug_info_reader_read_value(reader, form, vp);
+    return vp;
+}
+
+static void
+di_skip_records(DebugInfoReader *reader)
+{
+    for (;;) {
+        DebugInfoValue v = {{}};
+        uint64_t at = uleb128(&reader->q);
+        uint64_t form = uleb128(&reader->q);
+        if (!at || !form) return;
+        debug_info_reader_read_value(reader, form, &v);
+    }
+}
+
+typedef struct addr_header {
+    const char *ptr;
+    uint64_t unit_length;
+    uint8_t format;
+    uint8_t address_size;
+    /* uint8_t segment_selector_size; */
+} addr_header_t;
+
+static void
+addr_header_init(obj_info_t *obj, addr_header_t *header) {
+    const char *p = obj->debug_addr.ptr;
+
+    header->ptr = p;
+
+    if (!p) return;
+
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+        header->unit_length = *(uint64_t *)p;
+        p += sizeof(uint64_t);
+        header->format = 8;
+    }
+
+    p += 2; /* version */
+    header->address_size = *p++;
+    p++; /* segment_selector_size */
+}
+
+static uint64_t
+read_addr(addr_header_t *header, uint64_t addr_base, uint64_t idx) {
+    if (header->address_size == 4) {
+        return ((uint32_t*)(header->ptr + addr_base))[idx];
+    }
+    else {
+        return ((uint64_t*)(header->ptr + addr_base))[idx];
+    }
+}
+
+typedef struct rnglists_header {
+    uint64_t unit_length;
+    uint8_t format;
+    uint8_t address_size;
+    uint32_t offset_entry_count;
+} rnglists_header_t;
+
+static void
+rnglists_header_init(obj_info_t *obj, rnglists_header_t *header) {
+    const char *p = obj->debug_rnglists.ptr;
+
+    if (!p) return;
+
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+        header->unit_length = *(uint64_t *)p;
+        p += sizeof(uint64_t);
+        header->format = 8;
+    }
+
+    p += 2; /* version */
+    header->address_size = *p++;
+    p++; /* segment_selector_size */
+    header->offset_entry_count = *(uint32_t *)p;
+}
+
+typedef struct {
+    uint64_t low_pc;
+    uint64_t high_pc;
+    uint64_t ranges;
+    bool low_pc_set;
+    bool high_pc_set;
+    bool ranges_set;
+} ranges_t;
+
+static void
+ranges_set(ranges_t *ptr, DebugInfoValue *v, addr_header_t *addr_header, uint64_t addr_base)
+{
+    uint64_t n = 0;
+    if (v->type == VAL_uint) {
+        n = v->as.uint64;
+    }
+    else if (v->type == VAL_addr) {
+        n = read_addr(addr_header, addr_base, v->as.addr_idx);
+    }
+    switch (v->at) {
+      case DW_AT_low_pc:
+        ptr->low_pc = n;
+        ptr->low_pc_set = true;
+        break;
+      case DW_AT_high_pc:
+        if (v->form == DW_FORM_addr) {
+            ptr->high_pc = n;
+        }
+        else {
+            ptr->high_pc = ptr->low_pc + n;
+        }
+        ptr->high_pc_set = true;
+        break;
+      case DW_AT_ranges:
+        ptr->ranges = n;
+        ptr->ranges_set = true;
+        break;
+    }
+}
+
+static uint64_t
+read_dw_form_addr(DebugInfoReader *reader, const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = p + reader->address_size;
+    if (reader->address_size == 4) {
+        return read_uint32(&p);
+    } else if (reader->address_size == 8) {
+        return read_uint64(&p);
+    } else {
+        fprintf(stderr,"unknown address_size:%d", reader->address_size);
+        abort();
+    }
+}
+
+static uintptr_t
+ranges_include(DebugInfoReader *reader, ranges_t *ptr, uint64_t addr, rnglists_header_t *rnglists_header)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            exit(1);
+        }
+        if (ptr->low_pc <= addr && addr <= ptr->high_pc) {
+            return (uintptr_t)ptr->low_pc;
+        }
+    }
+    else if (ptr->ranges_set) {
+        /* TODO: support base address selection entry */
+        const char *p;
+        uint64_t base = ptr->low_pc_set ? ptr->low_pc : reader->current_low_pc;
+        bool base_valid = true;
+        if (reader->current_version >= 5) {
+            if (rnglists_header->offset_entry_count == 0) {
+                // DW_FORM_sec_offset
+                p = reader->obj->debug_rnglists.ptr + ptr->ranges + reader->current_rnglists_base;
+            }
+            else {
+                // DW_FORM_rnglistx
+                const char *offset_array = reader->obj->debug_rnglists.ptr + reader->current_rnglists_base;
+                if (rnglists_header->format == 4) {
+                    p = offset_array + ((uint32_t *)offset_array)[ptr->ranges];
+                }
+                else {
+                    p = offset_array + ((uint64_t *)offset_array)[ptr->ranges];
+                }
+            }
+            for (;;) {
+                uint8_t rle = read_uint8(&p);
+                uintptr_t from = 0, to = 0;
+                if (rle == DW_RLE_end_of_list) break;
+                switch (rle) {
+                  case DW_RLE_base_addressx:
+                    uleb128(&p);
+                    base_valid = false; /* not supported yet */
+                    break;
+                  case DW_RLE_startx_endx:
+                    uleb128(&p);
+                    uleb128(&p);
+                    break;
+                  case DW_RLE_startx_length:
+                    uleb128(&p);
+                    uleb128(&p);
+                    break;
+                  case DW_RLE_offset_pair:
+                    if (!base_valid) break;
+                    from = (uintptr_t)base + uleb128(&p);
+                    to = (uintptr_t)base + uleb128(&p);
+                    break;
+                  case DW_RLE_base_address:
+                    base = read_dw_form_addr(reader, &p);
+                    base_valid = true;
+                    break;
+                  case DW_RLE_start_end:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p);
+                    to = (uintptr_t)read_dw_form_addr(reader, &p);
+                    break;
+                  case DW_RLE_start_length:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p);
+                    to = from + uleb128(&p);
+                    break;
+                }
+                if (from <= addr && addr < to) {
+                    return from;
+                }
+            }
+            return false;
+        }
+        p = reader->obj->debug_ranges.ptr + ptr->ranges;
+        for (;;) {
+            uintptr_t from = read_uintptr(&p);
+            uintptr_t to = read_uintptr(&p);
+            if (!from && !to) break;
+            if (from == UINTPTR_MAX) {
+                /* base address selection entry */
+                base = to;
+            }
+            else if (base + from <= addr && addr < base + to) {
+                return (uintptr_t)base + from;
+            }
+        }
+    }
+    else if (ptr->low_pc_set) {
+        if (ptr->low_pc == addr) {
+            return (uintptr_t)ptr->low_pc;
+        }
+    }
+    return false;
+}
+
+#if 0
+static void
+ranges_inspect(DebugInfoReader *reader, ranges_t *ptr)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            fprintf(stderr,"low_pc_set:%d high_pc_set:%d ranges_set:%d\n",ptr->low_pc_set,ptr->high_pc_set,ptr->ranges_set);
+            exit(1);
+        }
+        fprintf(stderr,"low_pc:%"PRIx64" high_pc:%"PRIx64"\n",ptr->low_pc,ptr->high_pc);
+    }
+    else if (ptr->ranges_set) {
+        char *p = reader->obj->debug_ranges.ptr + ptr->ranges;
+        fprintf(stderr,"low_pc:%"PRIx64" ranges:%"PRIx64" %lx ",ptr->low_pc,ptr->ranges, p-reader->obj->mapped);
+        for (;;) {
+            uintptr_t from = read_uintptr(&p);
+            uintptr_t to = read_uintptr(&p);
+            if (!from && !to) break;
+            fprintf(stderr,"%"PRIx64"-%"PRIx64" ",ptr->low_pc+from,ptr->low_pc+to);
+        }
+        fprintf(stderr,"\n");
+    }
+    else if (ptr->low_pc_set) {
+        fprintf(stderr,"low_pc:%"PRIx64"\n",ptr->low_pc);
+    }
+    else {
+        fprintf(stderr,"empty\n");
+    }
+}
+#endif
+
+static int
+di_read_cu(DebugInfoReader *reader)
+{
+    uint64_t unit_length;
+    uint16_t version;
+    uint64_t debug_abbrev_offset;
+    reader->format = 4;
+    reader->current_cu = reader->p;
+    unit_length = read_uint32(&reader->p);
+    if (unit_length == 0xffffffff) {
+        unit_length = read_uint64(&reader->p);
+        reader->format = 8;
+    }
+    reader->cu_end = reader->p + unit_length;
+    version = read_uint16(&reader->p);
+    reader->current_version = version;
+    if (version > 5) {
+        return -1;
+    }
+    else if (version == 5) {
+        /* unit_type = */ read_uint8(&reader->p);
+        reader->address_size = read_uint8(&reader->p);
+        debug_abbrev_offset = read_uint(reader);
+    }
+    else {
+        debug_abbrev_offset = read_uint(reader);
+        reader->address_size = read_uint8(&reader->p);
+    }
+    reader->q0 = reader->obj->debug_abbrev.ptr + debug_abbrev_offset;
+
+    reader->level = 0;
+    di_read_debug_abbrev_cu(reader);
+    if (di_read_debug_line_cu(reader)) return -1;
+
+#if defined(__GNUC__) && !defined(__clang__) && !defined(__INTEL_COMPILER_BUILD_DATE)
+    /* Though DWARF specifies "the applicable base address defaults to the base
+       address of the compilation unit", but GCC seems to use zero as default */
+#else
+    do {
+        DIE die;
+
+        if (!di_read_die(reader, &die)) continue;
+
+        if (die.tag != DW_TAG_compile_unit) {
+            di_skip_records(reader);
+            break;
+        }
+
+        reader->current_str_offsets_base = 0;
+        reader->current_addr_base = 0;
+        reader->current_rnglists_base = 0;
+
+        DebugInfoValue low_pc = {{}};
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{}};
+            if (!di_read_record(reader, &v)) break;
+            switch (v.at) {
+              case DW_AT_low_pc:
+                // clang may output DW_AT_addr_base after DW_AT_low_pc.
+                // We need to resolve the DW_FORM_addr* after DW_AT_addr_base is parsed.
+                low_pc = v;
+                break;
+              case DW_AT_str_offsets_base:
+                reader->current_str_offsets_base = v.as.uint64;
+                break;
+              case DW_AT_addr_base:
+                reader->current_addr_base = v.as.uint64;
+                break;
+              case DW_AT_rnglists_base:
+                reader->current_rnglists_base = v.as.uint64;
+                break;
+            }
+        }
+        // Resolve the DW_FORM_addr of DW_AT_low_pc
+        switch (low_pc.type) {
+            case VAL_uint:
+                reader->current_low_pc = low_pc.as.uint64;
+                break;
+            case VAL_addr:
+                {
+                    addr_header_t header;
+                    addr_header_init(reader->obj, &header);
+                    reader->current_low_pc = read_addr(&header, reader->current_addr_base, low_pc.as.addr_idx);
+                }
+                break;
+        }
+    } while (0);
+#endif
+    return 0;
+}
+
+static void
+read_abstract_origin(DebugInfoReader *reader, uint64_t form, uint64_t abstract_origin, line_info_t *line)
+{
+    const char *p = reader->p;
+    const char *q = reader->q;
+    int level = reader->level;
+    DIE die;
+
+    switch (form) {
+      case DW_FORM_ref1:
+      case DW_FORM_ref2:
+      case DW_FORM_ref4:
+      case DW_FORM_ref8:
+      case DW_FORM_ref_udata:
+        reader->p = reader->current_cu + abstract_origin;
+        break;
+      case DW_FORM_ref_addr:
+        goto finish; /* not supported yet */
+      case DW_FORM_ref_sig8:
+        goto finish; /* not supported yet */
+      case DW_FORM_ref_sup4:
+      case DW_FORM_ref_sup8:
+        goto finish; /* not supported yet */
+      default:
+        goto finish;
+    }
+    if (!di_read_die(reader, &die)) goto finish;
+
+    /* enumerate abbrev */
+    for (;;) {
+        DebugInfoValue v = {{}};
+        if (!di_read_record(reader, &v)) break;
+        switch (v.at) {
+          case DW_AT_name:
+            line->sname = get_cstr_value(&v);
+            break;
+        }
+    }
+
+  finish:
+    reader->p = p;
+    reader->q = q;
+    reader->level = level;
+}
+
+static void
+debug_info_read(DebugInfoReader *reader, int num_traces, void **traces,
+         line_info_t *lines, int offset) {
+
+    addr_header_t addr_header = {};
+    addr_header_init(reader->obj, &addr_header);
+
+    rnglists_header_t rnglists_header = {};
+    rnglists_header_init(reader->obj, &rnglists_header);
+
+    while (reader->p < reader->cu_end) {
+        DIE die;
+        ranges_t ranges = {};
+        line_info_t line = {};
+
+        if (!di_read_die(reader, &die)) continue;
+        /* fprintf(stderr,"%d:%tx: <%d>\n",__LINE__,die.pos,reader->level,die.tag); */
+
+        if (die.tag != DW_TAG_subprogram && die.tag != DW_TAG_inlined_subroutine) {
+          skip_die:
+            di_skip_records(reader);
+            continue;
+        }
+
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{}};
+            /* ptrdiff_t pos = reader->p - reader->p0; */
+            if (!di_read_record(reader, &v)) break;
+            /* fprintf(stderr,"\n%d:%tx: AT:%lx FORM:%lx\n",__LINE__,pos,v.at,v.form); */
+            /* div_inspect(&v); */
+            switch (v.at) {
+              case DW_AT_name:
+                line.sname = get_cstr_value(&v);
+                break;
+              case DW_AT_call_file:
+                fill_filename((int)v.as.uint64, reader->debug_line_format, reader->debug_line_version, reader->debug_line_directories, reader->debug_line_files, &line, reader->obj);
+                break;
+              case DW_AT_call_line:
+                line.line = (int)v.as.uint64;
+                break;
+              case DW_AT_low_pc:
+              case DW_AT_high_pc:
+              case DW_AT_ranges:
+                ranges_set(&ranges, &v, &addr_header, reader->current_addr_base);
+                break;
+              case DW_AT_declaration:
+                goto skip_die;
+              case DW_AT_inline:
+                /* 1 or 3 */
+                break; /* goto skip_die; */
+              case DW_AT_abstract_origin:
+                read_abstract_origin(reader, v.form, v.as.uint64, &line);
+                break; /* goto skip_die; */
+            }
+        }
+        /* ranges_inspect(reader, &ranges); */
+        /* fprintf(stderr,"%d:%tx: %x ",__LINE__,diepos,die.tag); */
+        for (int i=offset; i < num_traces; i++) {
+            uintptr_t addr = (uintptr_t)traces[i];
+            uintptr_t offset = addr - reader->obj->base_addr + reader->obj->vmaddr;
+            uintptr_t saddr = ranges_include(reader, &ranges, offset, &rnglists_header);
+            if (saddr) {
+                /* fprintf(stdout, "%d:%tx: %d %lx->%lx %x %s: %s/%s %d %s %s %s\n",__LINE__,die.pos, i,addr,offset, die.tag,line.sname,line.dirname,line.filename,line.line,reader->obj->path,line.sname,lines[i].sname); */
+                if (lines[i].sname) {
+                    line_info_t *lp = malloc(sizeof(line_info_t));
+                    memcpy(lp, &lines[i], sizeof(line_info_t));
+                    lines[i].next = lp;
+                    lp->dirname = line.dirname;
+                    lp->filename = line.filename;
+                    lp->line = line.line;
+                    lp->saddr = 0;
+                }
+                lines[i].path = reader->obj->path;
+                lines[i].base_addr = line.base_addr;
+                lines[i].sname = line.sname;
+                lines[i].saddr = saddr + reader->obj->base_addr - reader->obj->vmaddr;
+            }
+        }
+    }
+}
+
+// This function parses the following attributes of Line Number Program Header in DWARF 5:
+//
+// * directory_entry_format_count
+// * directory_entry_format
+// * directories_count
+// * directories
+//
+// or
+//
+// * file_name_entry_format_count
+// * file_name_entry_format
+// * file_names_count
+// * file_names
+//
+// It records DW_LNCT_path and DW_LNCT_directory_index at the index "idx".
+static const char *
+parse_ver5_debug_line_header(const char *p, int idx, uint8_t format, obj_info_t *obj, const char **out_path, uint64_t *out_directory_index) {
+    int i, j;
+    int entry_format_count = *(uint8_t *)p++;
+    const char *entry_format = p;
+
+    /* skip the part of entry_format */
+    for (i = 0; i < entry_format_count * 2; i++) uleb128(&p);
+
+    int entry_count = (int)uleb128(&p);
+
+    DebugInfoReader reader;
+    debug_info_reader_init(&reader, obj);
+    reader.format = format;
+    reader.p = p;
+    for (j = 0; j < entry_count; j++) {
+        const char *format = entry_format;
+        for (i = 0; i < entry_format_count; i++) {
+            DebugInfoValue v = {{}};
+            unsigned long dw_lnct = uleb128(&format);
+            unsigned long dw_form = uleb128(&format);
+            debug_info_reader_read_value(&reader, dw_form, &v);
+            if (dw_lnct == 1 /* DW_LNCT_path */ && v.type == VAL_cstr && out_path)
+                *out_path = v.as.ptr + v.off;
+            if (dw_lnct == 2 /* DW_LNCT_directory_index */ && v.type == VAL_uint && out_directory_index)
+                *out_directory_index = v.as.uint64;
+        }
+        if (j == idx) return 0;
+    }
+
+    return reader.p;
+}
+
+#ifdef USE_ELF
+static unsigned long
+uncompress_debug_section(ElfW(Shdr) *shdr, char *file, char **ptr)
+{
+    *ptr = NULL;
+#ifdef SUPPORT_COMPRESSED_DEBUG_LINE
+    ElfW(Chdr) *chdr = (ElfW(Chdr) *)(file + shdr->sh_offset);
+    unsigned long destsize = chdr->ch_size;
+    int ret = 0;
+
+    if (chdr->ch_type != ELFCOMPRESS_ZLIB) {
+	/* unsupported compression type */
+	return 0;
+    }
+
+    *ptr = malloc(destsize);
+    if (!*ptr) return 0;
+    ret = uncompress((Bytef *)*ptr, &destsize,
+	    (const Bytef*)chdr + sizeof(ElfW(Chdr)),
+            shdr->sh_size - sizeof(ElfW(Chdr)));
+    if (ret != Z_OK) goto fail;
+    return destsize;
+
+fail:
+    free(*ptr);
+    *ptr = NULL;
+#endif
+    return 0;
+}
+
+/* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+	   obj_info_t **objp, line_info_t *lines, int offset)
+{
+    int i, j;
     char *shstr;
-    char *section_name;
     ElfW(Ehdr) *ehdr;
     ElfW(Shdr) *shdr, *shstr_shdr;
-    ElfW(Shdr) *debug_line_shdr = NULL, *gnu_debuglink_shdr = NULL;
+    ElfW(Shdr) *gnu_debuglink_shdr = NULL;
+    ElfW(Shdr) *note_gnu_build_id = NULL;
     int fd;
     off_t filesize;
     char *file;
+    ElfW(Shdr) *symtab_shdr = NULL, *strtab_shdr = NULL;
+    ElfW(Shdr) *dynsym_shdr = NULL, *dynstr_shdr = NULL;
+    obj_info_t *obj = *objp;
+    uintptr_t dladdr_fbase = 0;
 
     fd = open(binary_filename, O_RDONLY);
     if (fd < 0) {
-	return;
+	goto fail;
     }
     filesize = lseek(fd, 0, SEEK_END);
     if (filesize < 0) {
 	int e = errno;
 	close(fd);
 	kprintf("lseek: %s\n", strerror(e));
-	return;
+	goto fail;
     }
 #if SIZEOF_OFF_T > SIZEOF_SIZE_T
     if (filesize > (off_t)SIZE_MAX) {
 	close(fd);
 	kprintf("Too large file %s\n", binary_filename);
-	return;
+	goto fail;
     }
 #endif
     lseek(fd, 0, SEEK_SET);
@@ -493,8 +2044,9 @@ fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
 	int e = errno;
 	close(fd);
 	kprintf("mmap: %s\n", strerror(e));
-	return;
+	goto fail;
     }
+    close(fd);
 
     ehdr = (ElfW(Ehdr) *)file;
     if (memcmp(ehdr->e_ident, "\177ELF", 4) != 0) {
@@ -502,22 +2054,10 @@ fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
 	 * Huh? Maybe filename was overridden by setproctitle() and
 	 * it match non-elf file.
 	 */
-	close(fd);
-	return;
-    }
-
-    current_line->fd = fd;
-    current_line->mapped = file;
-    current_line->mapped_size = (size_t)filesize;
-
-    for (i = 0; i < num_traces; i++) {
-	const char *path;
-	size_t len;
-	if (get_path_from_symbol(syms[i], &path, &len) &&
-		!strncmp(path, binary_filename, len)) {
-	    lines[i].line = -1;
-	}
+	goto fail;
     }
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
 
     shdr = (ElfW(Shdr) *)(file + ehdr->e_shoff);
 
@@ -525,125 +2065,590 @@ fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
     shstr = file + shstr_shdr->sh_offset;
 
     for (i = 0; i < ehdr->e_shnum; i++) {
-	section_name = shstr + shdr[i].sh_name;
-	if (!strcmp(section_name, ".debug_line")) {
-	    debug_line_shdr = shdr + i;
+        char *section_name = shstr + shdr[i].sh_name;
+	switch (shdr[i].sh_type) {
+	  case SHT_STRTAB:
+	    if (!strcmp(section_name, ".strtab")) {
+		strtab_shdr = shdr + i;
+	    }
+	    else if (!strcmp(section_name, ".dynstr")) {
+		dynstr_shdr = shdr + i;
+	    }
+	    break;
+	  case SHT_SYMTAB:
+	    /* if (!strcmp(section_name, ".symtab")) */
+	    symtab_shdr = shdr + i;
 	    break;
-	} else if (!strcmp(section_name, ".gnu_debuglink")) {
-	    gnu_debuglink_shdr = shdr + i;
+	  case SHT_DYNSYM:
+	    /* if (!strcmp(section_name, ".dynsym")) */
+	    dynsym_shdr = shdr + i;
+	    break;
+          case SHT_NOTE:
+            if (!strcmp(section_name, ".note.gnu.build-id")) {
+                note_gnu_build_id = shdr + i;
+            }
+            break;
+	  case SHT_PROGBITS:
+	    if (!strcmp(section_name, ".gnu_debuglink")) {
+		gnu_debuglink_shdr = shdr + i;
+	    }
+            else {
+                const char *debug_section_names[] = {
+                    ".debug_abbrev",
+                    ".debug_info",
+                    ".debug_line",
+                    ".debug_ranges",
+                    ".debug_str_offsets",
+                    ".debug_addr",
+                    ".debug_rnglists",
+                    ".debug_str",
+                    ".debug_line_str"
+                };
+
+                for (j=0; j < DWARF_SECTION_COUNT; j++) {
+                    struct dwarf_section *s = obj_dwarf_section_at(obj, j);
+
+                    if (strcmp(section_name, debug_section_names[j]) != 0)
+                        continue;
+
+                    s->ptr = file + shdr[i].sh_offset;
+                    s->size = shdr[i].sh_size;
+                    s->flags = shdr[i].sh_flags;
+                    if (s->flags & SHF_COMPRESSED) {
+                        s->size = uncompress_debug_section(&shdr[i], file, &s->ptr);
+                        if (!s->size) goto fail;
+                    }
+                    break;
+                }
+            }
+	    break;
+	}
+    }
+
+    if (offset == -1) {
+	/* main executable */
+	offset = 0;
+	if (dynsym_shdr && dynstr_shdr) {
+	    char *strtab = file + dynstr_shdr->sh_offset;
+	    ElfW(Sym) *symtab = (ElfW(Sym) *)(file + dynsym_shdr->sh_offset);
+	    int symtab_count = (int)(dynsym_shdr->sh_size / sizeof(ElfW(Sym)));
+            void *handle = dlopen(NULL, RTLD_NOW|RTLD_LOCAL);
+            if (handle) {
+                for (j = 0; j < symtab_count; j++) {
+                    ElfW(Sym) *sym = &symtab[j];
+                    Dl_info info;
+                    void *s;
+                    if (ELF_ST_TYPE(sym->st_info) != STT_FUNC || sym->st_size == 0) continue;
+                    s = dlsym(handle, strtab + sym->st_name);
+                    if (s && dladdr(s, &info)) {
+                        obj->base_addr = dladdr_fbase;
+                        dladdr_fbase = (uintptr_t)info.dli_fbase;
+                        break;
+                    }
+                }
+                dlclose(handle);
+            }
+	    if (ehdr->e_type == ET_EXEC) {
+		obj->base_addr = 0;
+	    }
+	    else {
+		/* PIE (position-independent executable) */
+		obj->base_addr = dladdr_fbase;
+	    }
 	}
     }
 
-    if (!debug_line_shdr) {
+    if (obj->debug_info.ptr && obj->debug_abbrev.ptr) {
+        DebugInfoReader reader;
+        debug_info_reader_init(&reader, obj);
+        i = 0;
+        while (reader.p < reader.pend) {
+            /* fprintf(stderr, "%d:%tx: CU[%d]\n", __LINE__, reader.p - reader.obj->debug_info.ptr, i++); */
+            if (di_read_cu(&reader)) goto use_symtab;
+            debug_info_read(&reader, num_traces, traces, lines, offset);
+        }
+    }
+    else {
+        /* This file doesn't have dwarf, use symtab or dynsym */
+use_symtab:
+        if (!symtab_shdr) {
+            /* This file doesn't have symtab, use dynsym instead */
+            symtab_shdr = dynsym_shdr;
+            strtab_shdr = dynstr_shdr;
+        }
+
+        if (symtab_shdr && strtab_shdr) {
+            char *strtab = file + strtab_shdr->sh_offset;
+            ElfW(Sym) *symtab = (ElfW(Sym) *)(file + symtab_shdr->sh_offset);
+            int symtab_count = (int)(symtab_shdr->sh_size / sizeof(ElfW(Sym)));
+            for (j = 0; j < symtab_count; j++) {
+                ElfW(Sym) *sym = &symtab[j];
+                uintptr_t saddr = (uintptr_t)sym->st_value + obj->base_addr;
+                if (ELF_ST_TYPE(sym->st_info) != STT_FUNC) continue;
+                for (i = offset; i < num_traces; i++) {
+                    uintptr_t d = (uintptr_t)traces[i] - saddr;
+                    if (lines[i].line > 0 || d > (uintptr_t)sym->st_size)
+                        continue;
+                    /* fill symbol name and addr from .symtab */
+                    if (!lines[i].sname) lines[i].sname = strtab + sym->st_name;
+                    lines[i].saddr = saddr;
+                    lines[i].path  = obj->path;
+                    lines[i].base_addr = obj->base_addr;
+                }
+            }
+        }
+    }
+
+    if (!obj->debug_line.ptr) {
 	/* This file doesn't have .debug_line section,
 	   let's check .gnu_debuglink section instead. */
 	if (gnu_debuglink_shdr && check_debuglink) {
 	    follow_debuglink(file + gnu_debuglink_shdr->sh_offset,
-			     num_traces, traces, syms,
-			     current_line, lines);
+			     num_traces, traces,
+			     objp, lines, offset);
 	}
-	return;
+        if (note_gnu_build_id && check_debuglink) {
+            ElfW(Nhdr) *nhdr = (ElfW(Nhdr)*) (file + note_gnu_build_id->sh_offset);
+            const char *build_id = (char *)(nhdr + 1) + nhdr->n_namesz;
+            follow_debuglink_build_id(build_id, nhdr->n_descsz,
+			       num_traces, traces,
+			       objp, lines, offset);
+        }
+	goto finish;
     }
 
-    parse_debug_line(num_traces, traces,
-		     file + debug_line_shdr->sh_offset,
-		     debug_line_shdr->sh_size,
-		     lines);
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset) == -1)
+        goto fail;
+
+finish:
+    return dladdr_fbase;
+fail:
+    return (uintptr_t)-1;
 }
+#else /* Mach-O */
+/* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+        obj_info_t **objp, line_info_t *lines, int offset)
+{
+# ifdef __LP64__
+#  define LP(x) x##_64
+# else
+#  define LP(x) x
+# endif
+    int fd;
+    off_t filesize;
+    char *file, *p = NULL;
+    obj_info_t *obj = *objp;
+    struct LP(mach_header) *header;
+    uintptr_t dladdr_fbase = 0;
+
+    {
+        char *s = binary_filename;
+        char *base = strrchr(binary_filename, '/')+1;
+        size_t max = PATH_MAX;
+        size_t size = strlen(binary_filename);
+        size_t basesize = size - (base - binary_filename);
+        s += size;
+        max -= size;
+        p = s;
+        size = strlcpy(s, ".dSYM/Contents/Resources/DWARF/", max);
+        if (size == 0) goto fail;
+        s += size;
+        max -= size;
+        if (max <= basesize) goto fail;
+        memcpy(s, base, basesize);
+        s[basesize] = 0;
+
+        fd = open(binary_filename, O_RDONLY);
+        if (fd < 0) {
+            *p = 0; /* binary_filename becomes original file name */
+            fd = open(binary_filename, O_RDONLY);
+            if (fd < 0) {
+                goto fail;
+            }
+        }
+    }
 
-#ifdef HAVE_DL_ITERATE_PHDR
+    filesize = lseek(fd, 0, SEEK_END);
+    if (filesize < 0) {
+        int e = errno;
+        close(fd);
+        kprintf("lseek: %s\n", strerror(e));
+        goto fail;
+    }
+#if SIZEOF_OFF_T > SIZEOF_SIZE_T
+    if (filesize > (off_t)SIZE_MAX) {
+        close(fd);
+        kprintf("Too large file %s\n", binary_filename);
+        goto fail;
+    }
+#endif
+    lseek(fd, 0, SEEK_SET);
+    /* async-signal unsafe */
+    file = (char *)mmap(NULL, (size_t)filesize, PROT_READ, MAP_SHARED, fd, 0);
+    if (file == MAP_FAILED) {
+        int e = errno;
+        close(fd);
+        kprintf("mmap: %s\n", strerror(e));
+        goto fail;
+    }
+    close(fd);
 
-typedef struct {
-    int num_traces;
-    char **syms;
-    line_info_t *lines;
-} fill_base_addr_state_t;
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
 
-static int
-fill_base_addr(struct dl_phdr_info *info, size_t size, void *data)
+    header = (struct LP(mach_header) *)file;
+    if (header->magic == LP(MH_MAGIC)) {
+        /* non universal binary */
+        p = file;
+    }
+    else if (header->magic == FAT_CIGAM) {
+        struct LP(mach_header) *mhp = _NSGetMachExecuteHeader();
+        struct fat_header *fat = (struct fat_header *)file;
+        char *q = file + sizeof(*fat);
+        uint32_t nfat_arch = __builtin_bswap32(fat->nfat_arch);
+        /* fprintf(stderr,"%d: fat:%s %d\n",__LINE__, binary_filename,nfat_arch); */
+        for (uint32_t i = 0; i < nfat_arch; i++) {
+            struct fat_arch *arch = (struct fat_arch *)q;
+            cpu_type_t cputype = __builtin_bswap32(arch->cputype);
+            cpu_subtype_t cpusubtype = __builtin_bswap32(arch->cpusubtype);
+            uint32_t offset = __builtin_bswap32(arch->offset);
+            /* fprintf(stderr,"%d: fat %d %x/%x %x/%x\n",__LINE__, i, mhp->cputype,mhp->cpusubtype, cputype,cpusubtype); */
+            if (mhp->cputype == cputype &&
+                    (cpu_subtype_t)(mhp->cpusubtype & ~CPU_SUBTYPE_MASK) == cpusubtype) {
+                p = file + offset;
+                file = p;
+                header = (struct LP(mach_header) *)p;
+                if (header->magic == LP(MH_MAGIC)) {
+                    goto found_mach_header;
+                }
+                break;
+            }
+            q += sizeof(*arch);
+        }
+        kprintf("'%s' is not a Mach-O universal binary file!\n",binary_filename);
+        close(fd);
+        goto fail;
+    }
+    else {
+        kprintf("'%s' is not a "
+# ifdef __LP64__
+                "64"
+# else
+                "32"
+# endif
+                "-bit Mach-O file!\n",binary_filename);
+        close(fd);
+        goto fail;
+    }
+found_mach_header:
+    p += sizeof(*header);
+
+    for (uint32_t i = 0; i < (uint32_t)header->ncmds; i++) {
+        struct load_command *lcmd = (struct load_command *)p;
+        switch (lcmd->cmd) {
+          case LP(LC_SEGMENT):
+            {
+                static const char *debug_section_names[] = {
+                    "__debug_abbrev",
+                    "__debug_info",
+                    "__debug_line",
+                    "__debug_ranges",
+                    "__debug_str_offsets",
+                    "__debug_addr",
+                    "__debug_rnglists",
+                    "__debug_str",
+                    "__debug_line_str",
+                };
+                struct LP(segment_command) *scmd = (struct LP(segment_command) *)lcmd;
+                if (strcmp(scmd->segname, "__TEXT") == 0) {
+                    obj->vmaddr = scmd->vmaddr;
+                }
+                else if (strcmp(scmd->segname, "__DWARF") == 0) {
+                    p += sizeof(struct LP(segment_command));
+                    for (uint64_t i = 0; i < scmd->nsects; i++) {
+                        struct LP(section) *sect = (struct LP(section) *)p;
+                        p += sizeof(struct LP(section));
+                        for (int j=0; j < DWARF_SECTION_COUNT; j++) {
+                            struct dwarf_section *s = obj_dwarf_section_at(obj, j);
+
+                            if (strcmp(sect->sectname, debug_section_names[j]) != 0)
+                                continue;
+
+                            s->ptr = file + sect->offset;
+                            s->size = sect->size;
+                            s->flags = sect->flags;
+                            if (s->flags & SHF_COMPRESSED) {
+                                goto fail;
+                            }
+                            break;
+                        }
+                    }
+                }
+            }
+            break;
+
+          case LC_SYMTAB:
+            {
+                struct symtab_command *cmd = (struct symtab_command *)lcmd;
+                struct LP(nlist) *nl = (struct LP(nlist) *)(file + cmd->symoff);
+                char *strtab = file + cmd->stroff, *sname = 0;
+                uint32_t j;
+                uintptr_t saddr = 0;
+                /* kprintf("[%2d]: %x/symtab %p\n", i, cmd->cmd, (void *)p); */
+                for (j = 0; j < cmd->nsyms; j++) {
+                    uintptr_t symsize, d;
+                    struct LP(nlist) *e = &nl[j];
+                        /* kprintf("[%2d][%4d]: %02x/%x/%x: %s %llx\n", i, j, e->n_type,e->n_sect,e->n_desc,strtab+e->n_un.n_strx,e->n_value); */
+                    if (e->n_type != N_FUN) continue;
+                    if (e->n_sect) {
+                        saddr = (uintptr_t)e->n_value + obj->base_addr - obj->vmaddr;
+                        sname = strtab + e->n_un.n_strx;
+                        /* kprintf("[%2d][%4d]: %02x/%x/%x: %s %llx\n", i, j, e->n_type,e->n_sect,e->n_desc,strtab+e->n_un.n_strx,e->n_value); */
+                        continue;
+                    }
+                    for (int k = offset; k < num_traces; k++) {
+                        d = (uintptr_t)traces[k] - saddr;
+                        symsize = e->n_value;
+                        /* kprintf("%lx %lx %lx\n",saddr,symsize,traces[k]); */
+                        if (lines[k].line > 0 || d > (uintptr_t)symsize)
+                            continue;
+                        /* fill symbol name and addr from .symtab */
+                        if (!lines[k].sname) lines[k].sname = sname;
+                        lines[k].saddr = saddr;
+                        lines[k].path  = obj->path;
+                        lines[k].base_addr = obj->base_addr;
+                    }
+                }
+            }
+        }
+        p += lcmd->cmdsize;
+    }
+
+    if (obj->debug_info.ptr && obj->debug_abbrev.ptr) {
+        DebugInfoReader reader;
+        debug_info_reader_init(&reader, obj);
+        while (reader.p < reader.pend) {
+            if (di_read_cu(&reader)) goto fail;
+            debug_info_read(&reader, num_traces, traces, lines, offset);
+        }
+    }
+
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset) == -1)
+        goto fail;
+
+    return dladdr_fbase;
+fail:
+    return (uintptr_t)-1;
+}
+#endif
+
+#define HAVE_MAIN_EXE_PATH
+#if defined(__FreeBSD__) || defined(__DragonFly__)
+# include <sys/sysctl.h>
+#endif
+/* ssize_t main_exe_path(void)
+ *
+ * store the path of the main executable to `binary_filename`,
+ * and returns strlen(binary_filename).
+ * it is NUL terminated.
+ */
+#if defined(__linux__) || defined(__NetBSD__)
+static ssize_t
+main_exe_path(void)
 {
-    int i;
-    fill_base_addr_state_t *st = (fill_base_addr_state_t *)data;
-    for (i = 0; i < st->num_traces; i++) {
-	const char *path;
-	size_t len;
-	size_t name_len = strlen(info->dlpi_name);
-
-	if (get_path_from_symbol(st->syms[i], &path, &len) &&
-		(len == name_len || (len > name_len && path[len-name_len-1] == '/')) &&
-		!strncmp(path+len-name_len, info->dlpi_name, name_len)) {
-	    st->lines[i].base_addr = info->dlpi_addr;
-	}
+# if defined(__linux__)
+#  define PROC_SELF_EXE "/proc/self/exe"
+# elif defined(__NetBSD__)
+#  define PROC_SELF_EXE "/proc/curproc/exe"
+# endif
+    ssize_t len = readlink(PROC_SELF_EXE, binary_filename, PATH_MAX);
+    if (len < 0) return 0;
+    binary_filename[len] = 0;
+    return len;
+}
+#elif defined(__FreeBSD__) || defined(__DragonFly__)
+static ssize_t
+main_exe_path(void)
+{
+    int mib[4] = {CTL_KERN, KERN_PROC, KERN_PROC_PATHNAME, -1};
+    size_t len = PATH_MAX;
+    int err = sysctl(mib, 4, binary_filename, &len, NULL, 0);
+    if (err) {
+	kprintf("Can't get the path of ruby");
+	return -1;
+    }
+    len--; /* sysctl sets strlen+1 */
+    return len;
+}
+#elif defined(HAVE_LIBPROC_H)
+static ssize_t
+main_exe_path(void)
+{
+    int len = proc_pidpath(getpid(), binary_filename, PATH_MAX);
+    if (len == 0) return 0;
+    binary_filename[len] = 0;
+    return len;
+}
+#else
+#undef HAVE_MAIN_EXE_PATH
+#endif
+
+static void
+print_line0(line_info_t *line, void *address)
+{
+    uintptr_t addr = (uintptr_t)address;
+    uintptr_t d = addr - line->saddr;
+    if (!address) {
+        /* inlined */
+        if (line->dirname && line->dirname[0]) {
+            kprintf("%s(%s) %s/%s:%d\n", line->path, line->sname, line->dirname, line->filename, line->line);
+        }
+        else {
+            kprintf("%s(%s) %s:%d\n", line->path, line->sname, line->filename, line->line);
+        }
+    }
+    else if (!line->path) {
+        kprintf("[0x%"PRIxPTR"]\n", addr);
+    }
+    else if (!line->sname) {
+        kprintf("%s(0x%"PRIxPTR") [0x%"PRIxPTR"]\n", line->path, addr-line->base_addr, addr);
+    }
+    else if (!line->saddr) {
+        kprintf("%s(%s) [0x%"PRIxPTR"]\n", line->path, line->sname, addr);
+    }
+    else if (line->line <= 0) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"]\n", line->path, line->sname,
+                d, addr);
+    }
+    else if (!line->filename) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] ???:%d\n", line->path, line->sname,
+                d, addr, line->line);
+    }
+    else if (line->dirname && line->dirname[0]) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] %s/%s:%d\n", line->path, line->sname,
+                d, addr, line->dirname, line->filename, line->line);
+    }
+    else {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] %s:%d\n", line->path, line->sname,
+                d, addr, line->filename, line->line);
     }
-    return 0;
 }
 
-#endif /* HAVE_DL_ITERATE_PHDR */
+static void
+print_line(line_info_t *line, void *address)
+{
+    print_line0(line, address);
+    if (line->next) {
+        print_line(line->next, NULL);
+    }
+}
 
 void
-rb_dump_backtrace_with_lines(int num_traces, void **trace, char **syms)
+rb_dump_backtrace_with_lines(int num_traces, void **traces)
 {
     int i;
     /* async-signal unsafe */
-    line_info_t *lines = (line_info_t *)calloc(num_traces,
-					       sizeof(line_info_t));
-
-    /* Note that line info of shared objects might not be shown
-       if we don't have dl_iterate_phdr */
-#ifdef HAVE_DL_ITERATE_PHDR
-    fill_base_addr_state_t fill_base_addr_state;
-
-    fill_base_addr_state.num_traces = num_traces;
-    fill_base_addr_state.syms = syms;
-    fill_base_addr_state.lines = lines;
-    /* maybe async-signal unsafe */
-    dl_iterate_phdr(fill_base_addr, &fill_base_addr_state);
-#endif /* HAVE_DL_ITERATE_PHDR */
-
-    for (i = 0; i < num_traces; i++) {
-	const char *path;
-	size_t len;
-	if (lines[i].line) {
-	    continue;
-	}
-
-	if (!get_path_from_symbol(syms[i], &path, &len)) {
-	    continue;
+    line_info_t *lines = (line_info_t *)calloc(num_traces, sizeof(line_info_t));
+    obj_info_t *obj = NULL;
+    /* 2 is NULL + main executable */
+    void **dladdr_fbases = (void **)calloc(num_traces+2, sizeof(void *));
+
+#ifdef HAVE_MAIN_EXE_PATH
+    char *main_path = NULL; /* used on printing backtrace */
+    ssize_t len;
+    if ((len = main_exe_path()) > 0) {
+	main_path = (char *)alloca(len + 1);
+	if (main_path) {
+	    uintptr_t addr;
+	    memcpy(main_path, binary_filename, len+1);
+	    append_obj(&obj);
+	    obj->path = main_path;
+	    addr = fill_lines(num_traces, traces, 1, &obj, lines, -1);
+	    if (addr != (uintptr_t)-1) {
+		dladdr_fbases[0] = (void *)addr;
+	    }
 	}
-
-	strncpy(binary_filename, path, len);
-	binary_filename[len] = '\0';
-
-	fill_lines(num_traces, trace, syms, 1, &lines[i], lines);
     }
+#endif
 
+    /* fill source lines by reading dwarf */
     for (i = 0; i < num_traces; i++) {
-	line_info_t *line = &lines[i];
-
-	if (line->line > 0) {
-	    if (line->filename) {
-		if (line->dirname && line->dirname[0]) {
-		    kprintf("%s %s/%s:%d\n", syms[i], line->dirname, line->filename, line->line);
+	Dl_info info;
+	if (lines[i].line) continue;
+	if (dladdr(traces[i], &info)) {
+	    const char *path;
+	    void **p;
+
+	    /* skip symbols which is in already checked objects */
+	    /* if the binary is strip-ed, this may effect */
+	    for (p=dladdr_fbases; *p; p++) {
+		if (*p == info.dli_fbase) {
+		    if (info.dli_fname) lines[i].path = info.dli_fname;
+		    if (info.dli_sname) lines[i].sname = info.dli_sname;
+		    goto next_line;
 		}
-		else {
-		    kprintf("%s %s:%d\n", syms[i], line->filename, line->line);
-		}
-	    } else {
-		kprintf("%s ???:%d\n", syms[i], line->line);
 	    }
-	} else {
-	    kprintf("%s\n", syms[i]);
+	    *p = info.dli_fbase;
+
+	    append_obj(&obj);
+	    obj->base_addr = (uintptr_t)info.dli_fbase;
+	    path = info.dli_fname;
+	    obj->path = path;
+	    if (path) lines[i].path = path;
+            if (info.dli_sname) {
+                lines[i].sname = info.dli_sname;
+                lines[i].saddr = (uintptr_t)info.dli_saddr;
+            }
+	    strlcpy(binary_filename, path, PATH_MAX);
+	    if (fill_lines(num_traces, traces, 1, &obj, lines, i) == (uintptr_t)-1)
+		break;
 	}
+next_line:
+	continue;
     }
 
+    /* output */
     for (i = 0; i < num_traces; i++) {
-	line_info_t *line = &lines[i];
-	if (line->fd) {
-	    munmap(line->mapped, line->mapped_size);
-	    close(line->fd);
+        print_line(&lines[i], traces[i]);
+
+	/* FreeBSD's backtrace may show _start and so on */
+	if (lines[i].sname && strcmp("main", lines[i].sname) == 0)
+	    break;
+    }
+
+    /* free */
+    while (obj) {
+	obj_info_t *o = obj;
+        for (i=0; i < DWARF_SECTION_COUNT; i++) {
+            struct dwarf_section *s = obj_dwarf_section_at(obj, i);
+            if (s->flags & SHF_COMPRESSED) {
+                free(s->ptr);
+            }
+        }
+	if (obj->mapped_size) {
+	    munmap(obj->mapped, obj->mapped_size);
 	}
+	obj = o->next;
+	free(o);
+    }
+    for (i = 0; i < num_traces; i++) {
+        line_info_t *line = lines[i].next;
+        while (line) {
+            line_info_t *l = line;
+            line = line->next;
+            free(l);
+        }
     }
     free(lines);
+    free(dladdr_fbases);
 }
 
 /* From FreeBSD's lib/libstand/printf.c */
@@ -685,10 +2690,9 @@ rb_dump_backtrace_with_lines(int num_traces, void **trace, char **syms)
 
 #include <stdarg.h>
 #define MAXNBUF (sizeof(intmax_t) * CHAR_BIT + 1)
-extern int rb_toupper(int c);
-#define    toupper(c)  rb_toupper(c)
+static inline int toupper(int c) { return ('A' <= c && c <= 'Z') ? (c&0x5f) : c; }
 #define    hex2ascii(hex)  (hex2ascii_data[hex])
-char const hex2ascii_data[] = "0123456789abcdefghijklmnopqrstuvwxyz";
+static const char hex2ascii_data[] = "0123456789abcdefghijklmnopqrstuvwxyz";
 static inline int imax(int a, int b) { return (a > b ? a : b); }
 static int kvprintf(char const *fmt, void (*func)(int), void *arg, int radix, va_list ap);
 
@@ -702,7 +2706,7 @@ static void putce(int c)
     (void)ret;
 }
 
-int
+static int
 kprintf(const char *fmt, ...)
 {
 	va_list ap;
diff --git a/addr2line.h b/addr2line.h
index 3782d89e07..f09b665800 100644
--- a/addr2line.h
+++ b/addr2line.h
@@ -1,3 +1,5 @@
+#ifndef RUBY_ADDR2LINE_H
+#define RUBY_ADDR2LINE_H
 /**********************************************************************
 
   addr2line.h -
@@ -8,13 +10,10 @@
 
 **********************************************************************/
 
-#ifndef RUBY_ADDR2LINE_H
-#define RUBY_ADDR2LINE_H
-
-#ifdef USE_ELF
+#if (defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H))
 
 void
-rb_dump_backtrace_with_lines(int num_traces, void **traces, char **syms);
+rb_dump_backtrace_with_lines(int num_traces, void **traces);
 
 #endif /* USE_ELF */
 
diff --git a/array.c b/array.c
index 56a5310c98..b76e9a64a3 100644
--- a/array.c
+++ b/array.c
@@ -11,116 +11,107 @@
 
 **********************************************************************/
 
-#include "ruby/ruby.h"
-#include "ruby/util.h"
-#include "ruby/st.h"
-#include "ruby/encoding.h"
+#include "debug_counter.h"
+#include "id.h"
 #include "internal.h"
+#include "internal/array.h"
+#include "internal/compar.h"
+#include "internal/enum.h"
+#include "internal/gc.h"
+#include "internal/hash.h"
+#include "internal/numeric.h"
+#include "internal/object.h"
+#include "internal/proc.h"
+#include "internal/rational.h"
+#include "internal/vm.h"
 #include "probes.h"
-#include "id.h"
+#include "ruby/encoding.h"
+#include "ruby/st.h"
+#include "ruby/util.h"
+#include "transient_heap.h"
+#include "builtin.h"
 
-#ifndef ARRAY_DEBUG
+#if !ARRAY_DEBUG
+# undef NDEBUG
 # define NDEBUG
 #endif
-#include <assert.h>
+#include "ruby_assert.h"
 
 VALUE rb_cArray;
 
-static ID id_cmp, id_div, id_power;
+/* Flags of RArray
+ *
+ * 1:   RARRAY_EMBED_FLAG
+ *          The array is embedded (its contents follow the header, rather than
+ *          being on a separately allocated buffer).
+ * 2:   RARRAY_SHARED_FLAG (equal to ELTS_SHARED)
+ *          The array is shared. The buffer this array points to is owned by
+ *          another array (the shared root).
+ * if USE_RVARGC
+ * 3-9: RARRAY_EMBED_LEN
+ *          The length of the array when RARRAY_EMBED_FLAG is set.
+ * else
+ * 3-4: RARRAY_EMBED_LEN
+ *          The length of the array when RARRAY_EMBED_FLAG is set.
+ * endif
+ * 12:  RARRAY_SHARED_ROOT_FLAG
+ *          The array is a shared root that does reference counting. The buffer
+ *          this array points to is owned by this array but may be pointed to
+ *          by other arrays.
+ *          Note: Frozen arrays may be a shared root without this flag being
+ *                set. Frozen arrays do not have reference counting because
+ *                they cannot be modified. Not updating the reference count
+ *                improves copy-on-write performance. Their reference count is
+ *                assumed to be infinity.
+ * 13:  RARRAY_TRANSIENT_FLAG
+ *          The buffer of the array is allocated on the transient heap.
+ * 14:  RARRAY_PTR_IN_USE_FLAG
+ *          The buffer of the array is in use. This is only used during
+ *          debugging.
+ */
+
+/* for OPTIMIZED_CMP: */
+#define id_cmp idCmp
 
 #define ARY_DEFAULT_SIZE 16
 #define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE))
+#define SMALL_ARRAY_LEN 16
 
-void
-rb_mem_clear(register VALUE *mem, register long size)
-{
-    while (size--) {
-	*mem++ = Qnil;
-    }
-}
-
-static void
-ary_mem_clear(VALUE ary, long beg, long size)
-{
-    RARRAY_PTR_USE(ary, ptr, {
-	rb_mem_clear(ptr + beg, size);
-    });
-}
-
-static inline void
-memfill(register VALUE *mem, register long size, register VALUE val)
-{
-    while (size--) {
-	*mem++ = val;
-    }
-}
-
-static void
-ary_memfill(VALUE ary, long beg, long size, VALUE val)
-{
-    RARRAY_PTR_USE(ary, ptr, {
-	memfill(ptr + beg, size, val);
-	OBJ_WRITTEN(ary, Qundef, val);
-    });
-}
-
-static void
-ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
+RBIMPL_ATTR_MAYBE_UNUSED()
+static int
+should_be_T_ARRAY(VALUE ary)
 {
-#if 1
-    if (OBJ_PROMOTED(ary)) {
-	if (argc > (int)(128/sizeof(VALUE)) /* is magic number (cache line size) */) {
-	    rb_gc_writebarrier_remember_promoted(ary);
-	    RARRAY_PTR_USE(ary, ptr, {
-		MEMCPY(ptr+beg, argv, VALUE, argc);
-	    });
-	}
-	else {
-	    int i;
-	    RARRAY_PTR_USE(ary, ptr, {
-		for (i=0; i<argc; i++) {
-		    OBJ_WRITE(ary, &ptr[i+beg], argv[i]);
-		}
-	    });
-	}
-    }
-    else {
-	RARRAY_PTR_USE(ary, ptr, {
-	    MEMCPY(ptr+beg, argv, VALUE, argc);
-	});
-    }
-#else
-    /* use shady (traditional way) */
-    MEMCPY(RARRAY_PTR(ary)+beg, argv, VALUE, argc);
-#endif
+    return RB_TYPE_P(ary, T_ARRAY);
 }
 
-# define ARY_SHARED_P(ary) \
-    (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
-     FL_TEST((ary),ELTS_SHARED)!=0)
-# define ARY_EMBED_P(ary) \
-    (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
-     FL_TEST((ary), RARRAY_EMBED_FLAG)!=0)
-
 #define ARY_HEAP_PTR(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
 #define ARY_HEAP_LEN(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
+#define ARY_HEAP_CAPA(a) (assert(!ARY_EMBED_P(a)), assert(!ARY_SHARED_ROOT_P(a)), \
+                          RARRAY(a)->as.heap.aux.capa)
+
 #define ARY_EMBED_PTR(a) (assert(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
 #define ARY_EMBED_LEN(a) \
     (assert(ARY_EMBED_P(a)), \
      (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
-	 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
+         (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
+#define ARY_HEAP_SIZE(a) (assert(!ARY_EMBED_P(a)), assert(ARY_OWNS_HEAP_P(a)), ARY_CAPA(a) * sizeof(VALUE))
+
+#define ARY_OWNS_HEAP_P(a) (assert(should_be_T_ARRAY((VALUE)(a))), \
+                            !FL_TEST_RAW((a), RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG))
 
-#define ARY_OWNS_HEAP_P(a) (!FL_TEST((a), ELTS_SHARED|RARRAY_EMBED_FLAG))
 #define FL_SET_EMBED(a) do { \
     assert(!ARY_SHARED_P(a)); \
     FL_SET((a), RARRAY_EMBED_FLAG); \
+    RARY_TRANSIENT_UNSET(a); \
+    ary_verify(a); \
 } while (0)
+
 #define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK)
 #define FL_SET_SHARED(ary) do { \
     assert(!ARY_EMBED_P(ary)); \
-    FL_SET((ary), ELTS_SHARED); \
+    FL_SET((ary), RARRAY_SHARED_FLAG); \
 } while (0)
-#define FL_UNSET_SHARED(ary) FL_UNSET((ary), ELTS_SHARED)
+#define FL_UNSET_SHARED(ary) FL_UNSET((ary), RARRAY_SHARED_FLAG)
 
 #define ARY_SET_PTR(ary, p) do { \
     assert(!ARY_EMBED_P(ary)); \
@@ -130,7 +121,6 @@ ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
 #define ARY_SET_EMBED_LEN(ary, n) do { \
     long tmp_n = (n); \
     assert(ARY_EMBED_P(ary)); \
-    assert(!OBJ_FROZEN(ary)); \
     RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
     RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
 } while (0)
@@ -162,8 +152,8 @@ ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
     } \
 } while (0)
 
-#define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? RARRAY_EMBED_LEN_MAX : \
-		       ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : RARRAY(ary)->as.heap.aux.capa)
+#define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? ary_embed_capa(ary) : \
+                       ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : ARY_HEAP_CAPA(ary))
 #define ARY_SET_CAPA(ary, n) do { \
     assert(!ARY_EMBED_P(ary)); \
     assert(!ARY_SHARED_P(ary)); \
@@ -171,70 +161,424 @@ ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
     RARRAY(ary)->as.heap.aux.capa = (n); \
 } while (0)
 
-#define ARY_SHARED(ary) (assert(ARY_SHARED_P(ary)), RARRAY(ary)->as.heap.aux.shared)
 #define ARY_SET_SHARED(ary, value) do { \
     const VALUE _ary_ = (ary); \
     const VALUE _value_ = (value); \
     assert(!ARY_EMBED_P(_ary_)); \
     assert(ARY_SHARED_P(_ary_)); \
-    assert(ARY_SHARED_ROOT_P(_value_)); \
-    OBJ_WRITE(_ary_, &RARRAY(_ary_)->as.heap.aux.shared, _value_); \
+    assert(!OBJ_FROZEN(_ary_)); \
+    assert(ARY_SHARED_ROOT_P(_value_) || OBJ_FROZEN(_value_)); \
+    RB_OBJ_WRITE(_ary_, &RARRAY(_ary_)->as.heap.aux.shared_root, _value_); \
 } while (0)
-#define RARRAY_SHARED_ROOT_FLAG FL_USER5
-#define ARY_SHARED_ROOT_P(ary) (FL_TEST((ary), RARRAY_SHARED_ROOT_FLAG))
-#define ARY_SHARED_NUM(ary) \
-    (assert(ARY_SHARED_ROOT_P(ary)), RARRAY(ary)->as.heap.aux.capa)
-#define ARY_SET_SHARED_NUM(ary, value) do { \
+
+#define ARY_SHARED_ROOT_OCCUPIED(ary) (!OBJ_FROZEN(ary) && ARY_SHARED_ROOT_REFCNT(ary) == 1)
+#define ARY_SET_SHARED_ROOT_REFCNT(ary, value) do { \
     assert(ARY_SHARED_ROOT_P(ary)); \
+    assert(!OBJ_FROZEN(ary)); \
+    assert((value) >= 0); \
     RARRAY(ary)->as.heap.aux.capa = (value); \
 } while (0)
 #define FL_SET_SHARED_ROOT(ary) do { \
+    assert(!OBJ_FROZEN(ary)); \
     assert(!ARY_EMBED_P(ary)); \
+    assert(!RARRAY_TRANSIENT_P(ary)); \
     FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
 } while (0)
 
+static inline void
+ARY_SET(VALUE a, long i, VALUE v)
+{
+    assert(!ARY_SHARED_P(a));
+    assert(!OBJ_FROZEN(a));
+
+    RARRAY_ASET(a, i, v);
+}
+#undef RARRAY_ASET
+
+static long
+ary_embed_capa(VALUE ary)
+{
+#if USE_RVARGC
+    size_t size = rb_gc_obj_slot_size(ary) - offsetof(struct RArray, as.ary);
+    assert(size % sizeof(VALUE) == 0);
+    return size / sizeof(VALUE);
+#else
+    return RARRAY_EMBED_LEN_MAX;
+#endif
+}
+
+static size_t
+ary_embed_size(long capa)
+{
+    return offsetof(struct RArray, as.ary) + (sizeof(VALUE) * capa);
+}
+
+static bool
+ary_embeddable_p(long capa)
+{
+#if USE_RVARGC
+    return rb_gc_size_allocatable_p(ary_embed_size(capa));
+#else
+    return capa <= RARRAY_EMBED_LEN_MAX;
+#endif
+}
+
+bool
+rb_ary_embeddable_p(VALUE ary)
+{
+    /* An array cannot be turned embeddable when the array is:
+     *  - Shared root: other objects may point to the buffer of this array
+     *    so we cannot make it embedded.
+     *  - Frozen: this array may also be a shared root without the shared root
+     *    flag.
+     *  - Shared: we don't want to re-embed an array that points to a shared
+     *    root (to save memory).
+     */
+    return !(ARY_SHARED_ROOT_P(ary) || OBJ_FROZEN(ary) || ARY_SHARED_P(ary));
+}
+
+size_t
+rb_ary_size_as_embedded(VALUE ary)
+{
+    size_t real_size;
+
+    if (ARY_EMBED_P(ary)) {
+        real_size = ary_embed_size(ARY_EMBED_LEN(ary));
+    }
+    else if (rb_ary_embeddable_p(ary)) {
+        real_size = ary_embed_size(ARY_HEAP_CAPA(ary));
+    }
+    else {
+        real_size = sizeof(struct RArray);
+    }
+    return real_size;
+}
+
+
+#if ARRAY_DEBUG
+#define ary_verify(ary) ary_verify_(ary, __FILE__, __LINE__)
+
+static VALUE
+ary_verify_(VALUE ary, const char *file, int line)
+{
+    assert(RB_TYPE_P(ary, T_ARRAY));
+
+    if (ARY_SHARED_P(ary)) {
+        VALUE root = ARY_SHARED_ROOT(ary);
+        const VALUE *ptr = ARY_HEAP_PTR(ary);
+        const VALUE *root_ptr = RARRAY_CONST_PTR_TRANSIENT(root);
+        long len = ARY_HEAP_LEN(ary), root_len = RARRAY_LEN(root);
+        assert(ARY_SHARED_ROOT_P(root) || OBJ_FROZEN(root));
+        assert(root_ptr <= ptr && ptr + len <= root_ptr + root_len);
+        ary_verify(root);
+    }
+    else if (ARY_EMBED_P(ary)) {
+        assert(!RARRAY_TRANSIENT_P(ary));
+        assert(!ARY_SHARED_P(ary));
+        assert(RARRAY_LEN(ary) <= ary_embed_capa(ary));
+    }
+    else {
+#if 1
+        const VALUE *ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        long i, len = RARRAY_LEN(ary);
+        volatile VALUE v;
+        if (len > 1) len = 1; /* check only HEAD */
+        for (i=0; i<len; i++) {
+            v = ptr[i]; /* access check */
+        }
+        v = v;
+#endif
+    }
+
+#if USE_TRANSIENT_HEAP
+    if (RARRAY_TRANSIENT_P(ary)) {
+        assert(rb_transient_heap_managed_ptr_p(RARRAY_CONST_PTR_TRANSIENT(ary)));
+    }
+#endif
+
+    rb_transient_heap_verify();
+
+    return ary;
+}
+
+void
+rb_ary_verify(VALUE ary)
+{
+    ary_verify(ary);
+}
+#else
+#define ary_verify(ary) ((void)0)
+#endif
+
+VALUE *
+rb_ary_ptr_use_start(VALUE ary)
+{
+#if ARRAY_DEBUG
+    FL_SET_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
+#endif
+    return (VALUE *)RARRAY_CONST_PTR_TRANSIENT(ary);
+}
+
+void
+rb_ary_ptr_use_end(VALUE ary)
+{
+#if ARRAY_DEBUG
+    FL_UNSET_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
+#endif
+}
+
+void
+rb_mem_clear(VALUE *mem, long size)
+{
+    while (size--) {
+        *mem++ = Qnil;
+    }
+}
+
+static void
+ary_mem_clear(VALUE ary, long beg, long size)
+{
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        rb_mem_clear(ptr + beg, size);
+    });
+}
+
+static inline void
+memfill(register VALUE *mem, register long size, register VALUE val)
+{
+    while (size--) {
+        *mem++ = val;
+    }
+}
+
+static void
+ary_memfill(VALUE ary, long beg, long size, VALUE val)
+{
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        memfill(ptr + beg, size, val);
+        RB_OBJ_WRITTEN(ary, Qundef, val);
+    });
+}
+
+static void
+ary_memcpy0(VALUE ary, long beg, long argc, const VALUE *argv, VALUE buff_owner_ary)
+{
+    assert(!ARY_SHARED_P(buff_owner_ary));
+
+    if (argc > (int)(128/sizeof(VALUE)) /* is magic number (cache line size) */) {
+        rb_gc_writebarrier_remember(buff_owner_ary);
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            MEMCPY(ptr+beg, argv, VALUE, argc);
+        });
+    }
+    else {
+        int i;
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            for (i=0; i<argc; i++) {
+                RB_OBJ_WRITE(buff_owner_ary, &ptr[i+beg], argv[i]);
+            }
+        });
+    }
+}
+
+static void
+ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
+{
+    ary_memcpy0(ary, beg, argc, argv, ary);
+}
+
+static VALUE *
+ary_heap_alloc(VALUE ary, size_t capa)
+{
+    VALUE *ptr = rb_transient_heap_alloc(ary, sizeof(VALUE) * capa);
+
+    if (ptr != NULL) {
+        RARY_TRANSIENT_SET(ary);
+    }
+    else {
+        RARY_TRANSIENT_UNSET(ary);
+        ptr = ALLOC_N(VALUE, capa);
+    }
+
+    return ptr;
+}
+
+static void
+ary_heap_free_ptr(VALUE ary, const VALUE *ptr, long size)
+{
+    if (RARRAY_TRANSIENT_P(ary)) {
+        /* ignore it */
+    }
+    else {
+        ruby_sized_xfree((void *)ptr, size);
+    }
+}
+
+static void
+ary_heap_free(VALUE ary)
+{
+    if (RARRAY_TRANSIENT_P(ary)) {
+        RARY_TRANSIENT_UNSET(ary);
+    }
+    else {
+        ary_heap_free_ptr(ary, ARY_HEAP_PTR(ary), ARY_HEAP_SIZE(ary));
+    }
+}
+
+static size_t
+ary_heap_realloc(VALUE ary, size_t new_capa)
+{
+    size_t alloc_capa = new_capa;
+    size_t old_capa = ARY_HEAP_CAPA(ary);
+
+    if (RARRAY_TRANSIENT_P(ary)) {
+        if (new_capa <= old_capa) {
+            /* do nothing */
+            alloc_capa = old_capa;
+        }
+        else {
+            VALUE *new_ptr = rb_transient_heap_alloc(ary, sizeof(VALUE) * new_capa);
+
+            if (new_ptr == NULL) {
+                new_ptr = ALLOC_N(VALUE, new_capa);
+                RARY_TRANSIENT_UNSET(ary);
+            }
+
+            MEMCPY(new_ptr, ARY_HEAP_PTR(ary), VALUE, old_capa);
+            ARY_SET_PTR(ary, new_ptr);
+        }
+    }
+    else {
+        SIZED_REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, new_capa, old_capa);
+    }
+    ary_verify(ary);
+
+    return alloc_capa;
+}
+
+#if USE_TRANSIENT_HEAP
+static inline void
+rb_ary_transient_heap_evacuate_(VALUE ary, int transient, int promote)
+{
+    if (transient) {
+        assert(!ARY_SHARED_ROOT_P(ary));
+
+        VALUE *new_ptr;
+        const VALUE *old_ptr = ARY_HEAP_PTR(ary);
+        long capa = ARY_HEAP_CAPA(ary);
+
+        assert(ARY_OWNS_HEAP_P(ary));
+        assert(RARRAY_TRANSIENT_P(ary));
+        assert(!ARY_PTR_USING_P(ary));
+
+        if (promote) {
+            new_ptr = ALLOC_N(VALUE, capa);
+            RARY_TRANSIENT_UNSET(ary);
+        }
+        else {
+            new_ptr = ary_heap_alloc(ary, capa);
+        }
+
+        MEMCPY(new_ptr, old_ptr, VALUE, capa);
+        /* do not use ARY_SET_PTR() because they assert !frozen */
+        RARRAY(ary)->as.heap.ptr = new_ptr;
+    }
+
+    ary_verify(ary);
+}
+
+void
+rb_ary_transient_heap_evacuate(VALUE ary, int promote)
+{
+    rb_ary_transient_heap_evacuate_(ary, RARRAY_TRANSIENT_P(ary), promote);
+}
+
+void
+rb_ary_detransient(VALUE ary)
+{
+    assert(RARRAY_TRANSIENT_P(ary));
+    rb_ary_transient_heap_evacuate_(ary, TRUE, TRUE);
+}
+#else
+void
+rb_ary_detransient(VALUE ary)
+{
+    /* do nothing */
+}
+#endif
+
+void
+rb_ary_make_embedded(VALUE ary)
+{
+    assert(rb_ary_embeddable_p(ary));
+    if (!ARY_EMBED_P(ary)) {
+        const VALUE *buf = ARY_HEAP_PTR(ary);
+        long len = ARY_HEAP_LEN(ary);
+        bool was_transient = RARRAY_TRANSIENT_P(ary);
+
+        // FL_SET_EMBED also unsets the transient flag
+        FL_SET_EMBED(ary);
+        ARY_SET_EMBED_LEN(ary, len);
+
+        MEMCPY((void *)ARY_EMBED_PTR(ary), (void *)buf, VALUE, len);
+
+        if (!was_transient) {
+            ary_heap_free_ptr(ary, buf, len * sizeof(VALUE));
+        }
+    }
+}
+
 static void
 ary_resize_capa(VALUE ary, long capacity)
 {
     assert(RARRAY_LEN(ary) <= capacity);
     assert(!OBJ_FROZEN(ary));
     assert(!ARY_SHARED_P(ary));
-    if (capacity > RARRAY_EMBED_LEN_MAX) {
+
+    if (capacity > ary_embed_capa(ary)) {
+        size_t new_capa = capacity;
         if (ARY_EMBED_P(ary)) {
             long len = ARY_EMBED_LEN(ary);
-            VALUE *ptr = ALLOC_N(VALUE, (capacity));
+            VALUE *ptr = ary_heap_alloc(ary, capacity);
+
             MEMCPY(ptr, ARY_EMBED_PTR(ary), VALUE, len);
             FL_UNSET_EMBED(ary);
             ARY_SET_PTR(ary, ptr);
             ARY_SET_HEAP_LEN(ary, len);
         }
         else {
-            REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, (capacity));
+            new_capa = ary_heap_realloc(ary, capacity);
         }
-        ARY_SET_CAPA(ary, (capacity));
+        ARY_SET_CAPA(ary, new_capa);
     }
     else {
         if (!ARY_EMBED_P(ary)) {
-            long len = RARRAY_LEN(ary);
-	    const VALUE *ptr = RARRAY_RAWPTR(ary);
+            long len = ARY_HEAP_LEN(ary);
+            long old_capa = ARY_HEAP_CAPA(ary);
+            const VALUE *ptr = ARY_HEAP_PTR(ary);
+
             if (len > capacity) len = capacity;
             MEMCPY((VALUE *)RARRAY(ary)->as.ary, ptr, VALUE, len);
+            ary_heap_free_ptr(ary, ptr, old_capa);
+
             FL_SET_EMBED(ary);
             ARY_SET_LEN(ary, len);
-            xfree((VALUE *)ptr);
         }
     }
+
+    ary_verify(ary);
 }
 
 static inline void
 ary_shrink_capa(VALUE ary)
 {
     long capacity = ARY_HEAP_LEN(ary);
-    long old_capa = RARRAY(ary)->as.heap.aux.capa;
+    long old_capa = ARY_HEAP_CAPA(ary);
     assert(!ARY_SHARED_P(ary));
     assert(old_capa >= capacity);
-    if (old_capa > capacity)
-	REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, capacity);
+    if (old_capa > capacity) ary_heap_realloc(ary, capacity);
+
+    ary_verify(ary);
 }
 
 static void
@@ -243,144 +587,183 @@ ary_double_capa(VALUE ary, long min)
     long new_capa = ARY_CAPA(ary) / 2;
 
     if (new_capa < ARY_DEFAULT_SIZE) {
-	new_capa = ARY_DEFAULT_SIZE;
+        new_capa = ARY_DEFAULT_SIZE;
     }
     if (new_capa >= ARY_MAX_SIZE - min) {
-	new_capa = (ARY_MAX_SIZE - min) / 2;
+        new_capa = (ARY_MAX_SIZE - min) / 2;
     }
     new_capa += min;
     ary_resize_capa(ary, new_capa);
+
+    ary_verify(ary);
 }
 
 static void
-rb_ary_decrement_share(VALUE shared)
+rb_ary_decrement_share(VALUE shared_root)
 {
-    if (shared) {
-	long num = ARY_SHARED_NUM(shared) - 1;
-	if (num == 0) {
-	    rb_ary_free(shared);
-	    rb_gc_force_recycle(shared);
-	}
-	else if (num > 0) {
-	    ARY_SET_SHARED_NUM(shared, num);
-	}
+    if (!OBJ_FROZEN(shared_root)) {
+        long num = ARY_SHARED_ROOT_REFCNT(shared_root);
+        ARY_SET_SHARED_ROOT_REFCNT(shared_root, num - 1);
     }
 }
 
 static void
 rb_ary_unshare(VALUE ary)
 {
-    VALUE shared = RARRAY(ary)->as.heap.aux.shared;
-    rb_ary_decrement_share(shared);
+    VALUE shared_root = ARY_SHARED_ROOT(ary);
+    rb_ary_decrement_share(shared_root);
     FL_UNSET_SHARED(ary);
 }
 
-static inline void
-rb_ary_unshare_safe(VALUE ary)
+static void
+rb_ary_reset(VALUE ary)
 {
-    if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
-	rb_ary_unshare(ary);
+    if (ARY_OWNS_HEAP_P(ary)) {
+        ary_heap_free(ary);
     }
+    else if (ARY_SHARED_P(ary)) {
+        rb_ary_unshare(ary);
+    }
+
+    FL_SET_EMBED(ary);
+    ARY_SET_EMBED_LEN(ary, 0);
 }
 
 static VALUE
-rb_ary_increment_share(VALUE shared)
+rb_ary_increment_share(VALUE shared_root)
 {
-    long num = ARY_SHARED_NUM(shared);
-    if (num >= 0) {
-	ARY_SET_SHARED_NUM(shared, num + 1);
+    if (!OBJ_FROZEN(shared_root)) {
+        long num = ARY_SHARED_ROOT_REFCNT(shared_root);
+        assert(num >= 0);
+        ARY_SET_SHARED_ROOT_REFCNT(shared_root, num + 1);
     }
-    return shared;
+    return shared_root;
 }
 
 static void
-rb_ary_set_shared(VALUE ary, VALUE shared)
+rb_ary_set_shared(VALUE ary, VALUE shared_root)
 {
-    rb_ary_increment_share(shared);
+    rb_ary_increment_share(shared_root);
     FL_SET_SHARED(ary);
-    ARY_SET_SHARED(ary, shared);
+    RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
+    ARY_SET_SHARED(ary, shared_root);
 }
 
 static inline void
 rb_ary_modify_check(VALUE ary)
 {
     rb_check_frozen(ary);
+    ary_verify(ary);
 }
 
 void
-rb_ary_modify(VALUE ary)
+rb_ary_cancel_sharing(VALUE ary)
 {
-    rb_ary_modify_check(ary);
     if (ARY_SHARED_P(ary)) {
-        long len = RARRAY_LEN(ary);
-	VALUE shared = ARY_SHARED(ary);
-        if (len <= RARRAY_EMBED_LEN_MAX) {
-	    const VALUE *ptr = ARY_HEAP_PTR(ary);
+        long shared_len, len = RARRAY_LEN(ary);
+        VALUE shared_root = ARY_SHARED_ROOT(ary);
+
+        ary_verify(shared_root);
+
+        if (len <= ary_embed_capa(ary)) {
+            const VALUE *ptr = ARY_HEAP_PTR(ary);
             FL_UNSET_SHARED(ary);
             FL_SET_EMBED(ary);
-	    MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len);
-            rb_ary_decrement_share(shared);
+            MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len);
+            rb_ary_decrement_share(shared_root);
             ARY_SET_EMBED_LEN(ary, len);
         }
-	else if (ARY_SHARED_NUM(shared) == 1 && len > (RARRAY_LEN(shared)>>1)) {
-	    long shift = RARRAY_RAWPTR(ary) - RARRAY_RAWPTR(shared);
-	    FL_UNSET_SHARED(ary);
-	    ARY_SET_PTR(ary, RARRAY_RAWPTR(shared));
-	    ARY_SET_CAPA(ary, RARRAY_LEN(shared));
-	    MEMMOVE(RARRAY_PTR(ary), RARRAY_PTR(ary)+shift, VALUE, len);
-	    FL_SET_EMBED(shared);
-	    rb_ary_decrement_share(shared);
-	}
+        else if (ARY_SHARED_ROOT_OCCUPIED(shared_root) && len > ((shared_len = RARRAY_LEN(shared_root))>>1)) {
+            long shift = RARRAY_CONST_PTR_TRANSIENT(ary) - RARRAY_CONST_PTR_TRANSIENT(shared_root);
+            FL_UNSET_SHARED(ary);
+            ARY_SET_PTR(ary, RARRAY_CONST_PTR_TRANSIENT(shared_root));
+            ARY_SET_CAPA(ary, shared_len);
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                MEMMOVE(ptr, ptr+shift, VALUE, len);
+            });
+            FL_SET_EMBED(shared_root);
+            rb_ary_decrement_share(shared_root);
+        }
         else {
-            VALUE *ptr = ALLOC_N(VALUE, len);
-            MEMCPY(ptr, RARRAY_RAWPTR(ary), VALUE, len);
+            VALUE *ptr = ary_heap_alloc(ary, len);
+            MEMCPY(ptr, ARY_HEAP_PTR(ary), VALUE, len);
             rb_ary_unshare(ary);
             ARY_SET_CAPA(ary, len);
             ARY_SET_PTR(ary, ptr);
         }
+
+        rb_gc_writebarrier_remember(ary);
     }
+    ary_verify(ary);
 }
 
-static void
+void
+rb_ary_modify(VALUE ary)
+{
+    rb_ary_modify_check(ary);
+    rb_ary_cancel_sharing(ary);
+}
+
+static VALUE
 ary_ensure_room_for_push(VALUE ary, long add_len)
 {
-    long new_len = RARRAY_LEN(ary) + add_len;
+    long old_len = RARRAY_LEN(ary);
+    long new_len = old_len + add_len;
     long capa;
 
+    if (old_len > ARY_MAX_SIZE - add_len) {
+        rb_raise(rb_eIndexError, "index %ld too big", new_len);
+    }
     if (ARY_SHARED_P(ary)) {
-	if (new_len > RARRAY_EMBED_LEN_MAX) {
-	    VALUE shared = ARY_SHARED(ary);
-	    if (ARY_SHARED_NUM(shared) == 1) {
-		if (RARRAY_RAWPTR(ary) - RARRAY_RAWPTR(shared) + new_len <= RARRAY_LEN(shared)) {
-		    rb_ary_modify_check(ary);
-		}
-		else {
-		    /* if array is shared, then it is likely it participate in push/shift pattern */
-		    rb_ary_modify(ary);
-		    capa = ARY_CAPA(ary);
-		    if (new_len > capa - (capa >> 6)) {
-			ary_double_capa(ary, new_len);
-		    }
-		}
-		return;
-	    }
-	}
+        if (new_len > ary_embed_capa(ary)) {
+            VALUE shared_root = ARY_SHARED_ROOT(ary);
+            if (ARY_SHARED_ROOT_OCCUPIED(shared_root)) {
+                if (ARY_HEAP_PTR(ary) - RARRAY_CONST_PTR_TRANSIENT(shared_root) + new_len <= RARRAY_LEN(shared_root)) {
+                    rb_ary_modify_check(ary);
+
+                    ary_verify(ary);
+                    ary_verify(shared_root);
+                    return shared_root;
+                }
+                else {
+                    /* if array is shared, then it is likely it participate in push/shift pattern */
+                    rb_ary_modify(ary);
+                    capa = ARY_CAPA(ary);
+                    if (new_len > capa - (capa >> 6)) {
+                        ary_double_capa(ary, new_len);
+                    }
+                    ary_verify(ary);
+                    return ary;
+                }
+            }
+        }
+        ary_verify(ary);
+        rb_ary_modify(ary);
+    }
+    else {
+        rb_ary_modify_check(ary);
     }
-    rb_ary_modify(ary);
     capa = ARY_CAPA(ary);
     if (new_len > capa) {
-	ary_double_capa(ary, new_len);
+        ary_double_capa(ary, new_len);
     }
+
+    ary_verify(ary);
+    return ary;
 }
 
 /*
  *  call-seq:
- *      ary.freeze -> ary
+ *    array.freeze -> self
  *
- *  Calls Object#freeze on +ary+ to prevent any further
- *  modification. A RuntimeError will be raised if a modification
- *  attempt is made.
+ *  Freezes +self+; returns +self+:
  *
+ *    a = []
+ *    a.frozen? # => false
+ *    a.freeze
+ *    a.frozen? # => true
+ *
+ *  An attempt to modify a frozen \Array raises FrozenError.
  */
 
 VALUE
@@ -389,21 +772,6 @@ rb_ary_freeze(VALUE ary)
     return rb_obj_freeze(ary);
 }
 
-/*
- *  call-seq:
- *     ary.frozen?  -> true or false
- *
- *  Return +true+ if this array is frozen (or temporarily frozen
- *  while being sorted). See also Object#frozen?
- */
-
-static VALUE
-rb_ary_frozen_p(VALUE ary)
-{
-    if (OBJ_FROZEN(ary)) return Qtrue;
-    return Qfalse;
-}
-
 /* This can be used to take a snapshot of an array (with
    e.g. rb_ary_replace) and check later whether the array has been
    modified from the snapshot.  The snapshot is cheap, though if
@@ -415,18 +783,25 @@ VALUE
 rb_ary_shared_with_p(VALUE ary1, VALUE ary2)
 {
     if (!ARY_EMBED_P(ary1) && ARY_SHARED_P(ary1) &&
-	!ARY_EMBED_P(ary2) && ARY_SHARED_P(ary2) &&
-	RARRAY(ary1)->as.heap.aux.shared == RARRAY(ary2)->as.heap.aux.shared &&
-	RARRAY(ary1)->as.heap.len == RARRAY(ary2)->as.heap.len) {
-	return Qtrue;
+            !ARY_EMBED_P(ary2) && ARY_SHARED_P(ary2) &&
+            ARY_SHARED_ROOT(ary1) == ARY_SHARED_ROOT(ary2) &&
+            ARY_HEAP_LEN(ary1) == ARY_HEAP_LEN(ary2)) {
+        return Qtrue;
     }
     return Qfalse;
 }
 
 static VALUE
-ary_alloc(VALUE klass)
+ary_alloc_embed(VALUE klass, long capa)
 {
-    NEWOBJ_OF(ary, struct RArray, klass, T_ARRAY | RARRAY_EMBED_FLAG | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0));
+    size_t size = ary_embed_size(capa);
+    assert(rb_gc_size_allocatable_p(size));
+#if !USE_RVARGC
+    assert(size <= sizeof(struct RArray));
+#endif
+    RVARGC_NEWOBJ_OF(ary, struct RArray, klass,
+                     T_ARRAY | RARRAY_EMBED_FLAG | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                     size);
     /* Created array is:
      *   FL_SET_EMBED((VALUE)ary);
      *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
@@ -435,13 +810,19 @@ ary_alloc(VALUE klass)
 }
 
 static VALUE
-empty_ary_alloc(VALUE klass)
+ary_alloc_heap(VALUE klass)
 {
-    if (RUBY_DTRACE_ARRAY_CREATE_ENABLED()) {
-	RUBY_DTRACE_ARRAY_CREATE(0, rb_sourcefile(), rb_sourceline());
-    }
+    RVARGC_NEWOBJ_OF(ary, struct RArray, klass,
+                     T_ARRAY | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                     sizeof(struct RArray));
+    return (VALUE)ary;
+}
 
-    return ary_alloc(klass);
+static VALUE
+empty_ary_alloc(VALUE klass)
+{
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, 0);
+    return ary_alloc_embed(klass, 0);
 }
 
 static VALUE
@@ -450,27 +831,26 @@ ary_new(VALUE klass, long capa)
     VALUE ary,*ptr;
 
     if (capa < 0) {
-	rb_raise(rb_eArgError, "negative array size (or size too big)");
+        rb_raise(rb_eArgError, "negative array size (or size too big)");
     }
     if (capa > ARY_MAX_SIZE) {
-	rb_raise(rb_eArgError, "array size too big");
+        rb_raise(rb_eArgError, "array size too big");
     }
 
-    if (RUBY_DTRACE_ARRAY_CREATE_ENABLED()) {
-	RUBY_DTRACE_ARRAY_CREATE(capa, rb_sourcefile(), rb_sourceline());
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, capa);
+
+    if (ary_embeddable_p(capa)) {
+        ary = ary_alloc_embed(klass, capa);
     }
+    else {
+        ary = ary_alloc_heap(klass);
+        ARY_SET_CAPA(ary, capa);
+        assert(!ARY_EMBED_P(ary));
 
-    if (capa > RARRAY_EMBED_LEN_MAX) {
-	ptr = ALLOC_N(VALUE, capa);
-	ary = ary_alloc(klass);
-        FL_UNSET_EMBED(ary);
+        ptr = ary_heap_alloc(ary, capa);
         ARY_SET_PTR(ary, ptr);
-        ARY_SET_CAPA(ary, capa);
         ARY_SET_HEAP_LEN(ary, 0);
     }
-    else {
-	ary = ary_alloc(klass);
-    }
 
     return ary;
 }
@@ -484,11 +864,11 @@ rb_ary_new_capa(long capa)
 VALUE
 rb_ary_new(void)
 {
-    return rb_ary_new2(RARRAY_EMBED_LEN_MAX);
+    return rb_ary_new_capa(0);
 }
 
 VALUE
-rb_ary_new_from_args(long n, ...)
+(rb_ary_new_from_args)(long n, ...)
 {
     va_list ar;
     VALUE ary;
@@ -498,7 +878,7 @@ rb_ary_new_from_args(long n, ...)
 
     va_start(ar, n);
     for (i=0; i<n; i++) {
-	RARRAY_ASET(ary, i, va_arg(ar, VALUE));
+        ARY_SET(ary, i, va_arg(ar, VALUE));
     }
     va_end(ar);
 
@@ -506,31 +886,141 @@ rb_ary_new_from_args(long n, ...)
     return ary;
 }
 
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_tmp_new_from_values(VALUE klass, long n, const VALUE *elts)
+{
+    VALUE ary;
+
+    ary = ary_new(klass, n);
+    if (n > 0 && elts) {
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
+    }
+
+    return ary;
+}
+
 VALUE
 rb_ary_new_from_values(long n, const VALUE *elts)
 {
+    return rb_ary_tmp_new_from_values(rb_cArray, n, elts);
+}
+
+static VALUE
+ec_ary_alloc_embed(rb_execution_context_t *ec, VALUE klass, long capa)
+{
+    size_t size = ary_embed_size(capa);
+    assert(rb_gc_size_allocatable_p(size));
+#if !USE_RVARGC
+    assert(size <= sizeof(struct RArray));
+#endif
+    RB_RVARGC_EC_NEWOBJ_OF(ec, ary, struct RArray, klass,
+                           T_ARRAY | RARRAY_EMBED_FLAG | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                           size);
+    /* Created array is:
+     *   FL_SET_EMBED((VALUE)ary);
+     *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
+     */
+    return (VALUE)ary;
+}
+
+static VALUE
+ec_ary_alloc_heap(rb_execution_context_t *ec, VALUE klass)
+{
+    RB_RVARGC_EC_NEWOBJ_OF(ec, ary, struct RArray, klass,
+                           T_ARRAY | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                           sizeof(struct RArray));
+    return (VALUE)ary;
+}
+
+static VALUE
+ec_ary_new(rb_execution_context_t *ec, VALUE klass, long capa)
+{
+    VALUE ary,*ptr;
+
+    if (capa < 0) {
+        rb_raise(rb_eArgError, "negative array size (or size too big)");
+    }
+    if (capa > ARY_MAX_SIZE) {
+        rb_raise(rb_eArgError, "array size too big");
+    }
+
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, capa);
+
+    if (ary_embeddable_p(capa)) {
+        ary = ec_ary_alloc_embed(ec, klass, capa);
+    }
+    else {
+        ary = ec_ary_alloc_heap(ec, klass);
+        ARY_SET_CAPA(ary, capa);
+        assert(!ARY_EMBED_P(ary));
+
+        ptr = ary_heap_alloc(ary, capa);
+        ARY_SET_PTR(ary, ptr);
+        ARY_SET_HEAP_LEN(ary, 0);
+    }
+
+    return ary;
+}
+
+VALUE
+rb_ec_ary_new_from_values(rb_execution_context_t *ec, long n, const VALUE *elts)
+{
     VALUE ary;
 
-    ary = rb_ary_new2(n);
+    ary = ec_ary_new(ec, rb_cArray, n);
     if (n > 0 && elts) {
-	ary_memcpy(ary, 0, n, elts);
-	ARY_SET_LEN(ary, n);
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
     }
 
     return ary;
 }
 
 VALUE
-rb_ary_tmp_new(long capa)
+rb_ary_hidden_new(long capa)
 {
-    return ary_new(0, capa);
+    VALUE ary = ary_new(0, capa);
+    rb_ary_transient_heap_evacuate(ary, TRUE);
+    return ary;
+}
+
+VALUE
+rb_ary_hidden_new_fill(long capa)
+{
+    VALUE ary = rb_ary_hidden_new(capa);
+    ary_memfill(ary, 0, capa, Qnil);
+    ARY_SET_LEN(ary, capa);
+    return ary;
 }
 
 void
 rb_ary_free(VALUE ary)
 {
     if (ARY_OWNS_HEAP_P(ary)) {
-	xfree((void *)ARY_HEAP_PTR(ary));
+        if (USE_DEBUG_COUNTER &&
+            !ARY_SHARED_ROOT_P(ary) &&
+            ARY_HEAP_CAPA(ary) > RARRAY_LEN(ary)) {
+            RB_DEBUG_COUNTER_INC(obj_ary_extracapa);
+        }
+
+        if (RARRAY_TRANSIENT_P(ary)) {
+            RB_DEBUG_COUNTER_INC(obj_ary_transient);
+        }
+        else {
+            RB_DEBUG_COUNTER_INC(obj_ary_ptr);
+            ary_heap_free(ary);
+        }
+    }
+    else {
+        RB_DEBUG_COUNTER_INC(obj_ary_embed);
+    }
+
+    if (ARY_SHARED_P(ary)) {
+        RB_DEBUG_COUNTER_INC(obj_ary_shared);
+    }
+    if (ARY_SHARED_ROOT_P(ary) && ARY_SHARED_ROOT_OCCUPIED(ary)) {
+        RB_DEBUG_COUNTER_INC(obj_ary_shared_root_occupied);
     }
 }
 
@@ -538,50 +1028,69 @@ RUBY_FUNC_EXPORTED size_t
 rb_ary_memsize(VALUE ary)
 {
     if (ARY_OWNS_HEAP_P(ary)) {
-	return RARRAY(ary)->as.heap.aux.capa * sizeof(VALUE);
+        return ARY_CAPA(ary) * sizeof(VALUE);
     }
     else {
-	return 0;
+        return 0;
     }
 }
 
-static inline void
-ary_discard(VALUE ary)
-{
-    rb_ary_free(ary);
-    RBASIC(ary)->flags |= RARRAY_EMBED_FLAG;
-    RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK;
-}
-
 static VALUE
 ary_make_shared(VALUE ary)
 {
-    assert(!ARY_EMBED_P(ary));
+    assert(USE_RVARGC || !ARY_EMBED_P(ary));
+    ary_verify(ary);
+
     if (ARY_SHARED_P(ary)) {
-	return ARY_SHARED(ary);
+        return ARY_SHARED_ROOT(ary);
     }
     else if (ARY_SHARED_ROOT_P(ary)) {
-	return ary;
+        return ary;
     }
     else if (OBJ_FROZEN(ary)) {
-	ary_shrink_capa(ary);
-	FL_SET_SHARED_ROOT(ary);
-	ARY_SET_SHARED_NUM(ary, 1);
-	return ary;
+        if (!ARY_EMBED_P(ary)) {
+            rb_ary_transient_heap_evacuate(ary, TRUE);
+            ary_shrink_capa(ary);
+        }
+        return ary;
     }
     else {
-	NEWOBJ_OF(shared, struct RArray, 0, T_ARRAY | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0));
-        FL_UNSET_EMBED(shared);
+        rb_ary_transient_heap_evacuate(ary, TRUE);
+
+        long capa = ARY_CAPA(ary);
+        long len = RARRAY_LEN(ary);
+
+        /* Shared roots cannot be embedded because the reference count
+         * (refcnt) is stored in as.heap.aux.capa. */
+        VALUE shared = ary_alloc_heap(0);
+        FL_SET_SHARED_ROOT(shared);
 
-        ARY_SET_LEN((VALUE)shared, ARY_CAPA(ary));
-	ARY_SET_PTR((VALUE)shared, RARRAY_PTR(ary));
-	rb_mem_clear(RARRAY_PTR(shared) + RARRAY_LEN(ary), ARY_CAPA(ary) - RARRAY_LEN(ary));
-	FL_SET_SHARED_ROOT(shared);
-	ARY_SET_SHARED_NUM((VALUE)shared, 1);
-	FL_SET_SHARED(ary);
-	ARY_SET_SHARED(ary, (VALUE)shared);
-	OBJ_FREEZE(shared);
-	return (VALUE)shared;
+        if (ARY_EMBED_P(ary)) {
+            /* Cannot use ary_heap_alloc because we don't want to allocate
+             * on the transient heap. */
+            VALUE *ptr = ALLOC_N(VALUE, capa);
+            ARY_SET_PTR(shared, ptr);
+            ary_memcpy(shared, 0, len, RARRAY_PTR(ary));
+
+            FL_UNSET_EMBED(ary);
+            ARY_SET_HEAP_LEN(ary, len);
+            ARY_SET_PTR(ary, ptr);
+        }
+        else {
+            ARY_SET_PTR(shared, RARRAY_PTR(ary));
+        }
+
+        ARY_SET_LEN(shared, capa);
+        ary_mem_clear(shared, len, capa - len);
+        ARY_SET_SHARED_ROOT_REFCNT(shared, 1);
+        FL_SET_SHARED(ary);
+        RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
+        ARY_SET_SHARED(ary, shared);
+
+        ary_verify(shared);
+        ary_verify(ary);
+
+        return shared;
     }
 }
 
@@ -590,9 +1099,11 @@ ary_make_substitution(VALUE ary)
 {
     long len = RARRAY_LEN(ary);
 
-    if (len <= RARRAY_EMBED_LEN_MAX) {
-	VALUE subst = rb_ary_new2(len);
-	ary_memcpy(subst, 0, len, RARRAY_RAWPTR(ary));
+    if (ary_embeddable_p(len)) {
+        VALUE subst = rb_ary_new_capa(len);
+        assert(ARY_EMBED_P(subst));
+
+        ary_memcpy(subst, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary));
         ARY_SET_EMBED_LEN(subst, len);
         return subst;
     }
@@ -607,35 +1118,43 @@ rb_assoc_new(VALUE car, VALUE cdr)
     return rb_ary_new3(2, car, cdr);
 }
 
-static VALUE
-to_ary(VALUE ary)
+VALUE
+rb_to_array_type(VALUE ary)
 {
-    return rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
+    return rb_convert_type_with_id(ary, T_ARRAY, "Array", idTo_ary);
 }
+#define to_ary rb_to_array_type
 
 VALUE
 rb_check_array_type(VALUE ary)
 {
-    return rb_check_convert_type(ary, T_ARRAY, "Array", "to_ary");
+    return rb_check_convert_type_with_id(ary, T_ARRAY, "Array", idTo_ary);
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_check_to_array(VALUE ary)
+{
+    return rb_check_convert_type_with_id(ary, T_ARRAY, "Array", idTo_a);
+}
+
+VALUE
+rb_to_array(VALUE ary)
+{
+    return rb_convert_type_with_id(ary, T_ARRAY, "Array", idTo_a);
 }
 
 /*
  *  call-seq:
- *     Array.try_convert(obj) -> array or nil
+ *    Array.try_convert(object) -> object, new_array, or nil
  *
- *  Tries to convert +obj+ into an array, using +to_ary+ method.  Returns the
- *  converted array or +nil+ if +obj+ cannot be converted for any reason.
- *  This method can be used to check if an argument is an array.
+ *  If +object+ is an \Array object, returns +object+.
  *
- *     Array.try_convert([1])   #=> [1]
- *     Array.try_convert("1")   #=> nil
+ *  Otherwise if +object+ responds to <tt>:to_ary</tt>,
+ *  calls <tt>object.to_ary</tt> and returns the result.
  *
- *     if tmp = Array.try_convert(arg)
- *       # the argument is an array
- *     elsif tmp = String.try_convert(arg)
- *       # the argument is a string
- *     end
+ *  Returns +nil+ if +object+ does not respond to <tt>:to_ary</tt>
  *
+ *  Raises an exception unless <tt>object.to_ary</tt> returns an \Array object.
  */
 
 static VALUE
@@ -644,60 +1163,76 @@ rb_ary_s_try_convert(VALUE dummy, VALUE ary)
     return rb_check_array_type(ary);
 }
 
+/* :nodoc: */
+static VALUE
+rb_ary_s_new(int argc, VALUE *argv, VALUE klass)
+{
+    VALUE ary;
+
+    if (klass == rb_cArray) {
+        long size = 0;
+        if (argc > 0 && FIXNUM_P(argv[0])) {
+            size = FIX2LONG(argv[0]);
+            if (size < 0) size = 0;
+        }
+
+        ary = ary_new(klass, size);
+
+        rb_obj_call_init_kw(ary, argc, argv, RB_PASS_CALLED_KEYWORDS);
+    }
+    else {
+        ary = rb_class_new_instance_pass_kw(argc, argv, klass);
+    }
+
+    return ary;
+}
+
 /*
  *  call-seq:
- *     Array.new(size=0, obj=nil)
- *     Array.new(array)
- *     Array.new(size) {|index| block }
+ *    Array.new -> new_empty_array
+ *    Array.new(array) -> new_array
+ *    Array.new(size) -> new_array
+ *    Array.new(size, default_value) -> new_array
+ *    Array.new(size) {|index| ... } -> new_array
  *
- *  Returns a new array.
+ *  Returns a new \Array.
  *
- *  In the first form, if no arguments are sent, the new array will be empty.
- *  When a +size+ and an optional +obj+ are sent, an array is created with
- *  +size+ copies of +obj+.  Take notice that all elements will reference the
- *  same object +obj+.
+ *  With no block and no arguments, returns a new empty \Array object.
  *
- *  The second form creates a copy of the array passed as a parameter (the
- *  array is generated by calling to_ary on the parameter).
+ *  With no block and a single \Array argument +array+,
+ *  returns a new \Array formed from +array+:
  *
- *    first_array = ["Matz", "Guido"]
+ *    a = Array.new([:foo, 'bar', 2])
+ *    a.class # => Array
+ *    a # => [:foo, "bar", 2]
  *
- *    second_array = Array.new(first_array) #=> ["Matz", "Guido"]
+ *  With no block and a single \Integer argument +size+,
+ *  returns a new \Array of the given size
+ *  whose elements are all +nil+:
  *
- *    first_array.equal? second_array       #=> false
+ *    a = Array.new(3)
+ *    a # => [nil, nil, nil]
  *
- *  In the last form, an array of the given size is created.  Each element in
- *  this array is created by passing the element's index to the given block
- *  and storing the return value.
+ *  With no block and arguments +size+ and +default_value+,
+ *  returns an \Array of the given size;
+ *  each element is that same +default_value+:
  *
- *    Array.new(3){ |index| index ** 2 }
- *    # => [0, 1, 4]
+ *    a = Array.new(3, 'x')
+ *    a # => ['x', 'x', 'x']
  *
- *  == Common gotchas
+ *  With a block and argument +size+,
+ *  returns an \Array of the given size;
+ *  the block is called with each successive integer +index+;
+ *  the element for that +index+ is the return value from the block:
  *
- *  When sending the second parameter, the same object will be used as the
- *  value for all the array elements:
+ *    a = Array.new(3) {|index| "Element #{index}" }
+ *    a # => ["Element 0", "Element 1", "Element 2"]
  *
- *     a = Array.new(2, Hash.new)
- *     # => [{}, {}]
- *
- *     a[0]['cat'] = 'feline'
- *     a # => [{"cat"=>"feline"}, {"cat"=>"feline"}]
- *
- *     a[1]['cat'] = 'Felix'
- *     a # => [{"cat"=>"Felix"}, {"cat"=>"Felix"}]
- *
- *  Since all the Array elements store the same hash, changes to one of them
- *  will affect them all.
- *
- *  If multiple copies are what you want, you should use the block
- *  version which uses the result of that block each time an element
- *  of the array needs to be initialized:
- *
- *     a = Array.new(2) { Hash.new }
- *     a[0]['cat'] = 'feline'
- *     a # => [{"cat"=>"feline"}, {}]
+ *  Raises ArgumentError if +size+ is negative.
  *
+ *  With a block and no argument,
+ *  or a single argument +0+,
+ *  ignores the block and returns a new empty \Array.
  */
 
 static VALUE
@@ -708,49 +1243,48 @@ rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
 
     rb_ary_modify(ary);
     if (argc == 0) {
-	if (ARY_OWNS_HEAP_P(ary) && RARRAY_RAWPTR(ary) != 0) {
-	    xfree((void *)RARRAY_RAWPTR(ary));
-	}
-        rb_ary_unshare_safe(ary);
-        FL_SET_EMBED(ary);
-	ARY_SET_EMBED_LEN(ary, 0);
-	if (rb_block_given_p()) {
-	    rb_warning("given block not used");
-	}
-	return ary;
+        rb_ary_reset(ary);
+        assert(ARY_EMBED_P(ary));
+        assert(ARY_EMBED_LEN(ary) == 0);
+        if (rb_block_given_p()) {
+            rb_warning("given block not used");
+        }
+        return ary;
     }
     rb_scan_args(argc, argv, "02", &size, &val);
     if (argc == 1 && !FIXNUM_P(size)) {
-	val = rb_check_array_type(size);
-	if (!NIL_P(val)) {
-	    rb_ary_replace(ary, val);
-	    return ary;
-	}
+        val = rb_check_array_type(size);
+        if (!NIL_P(val)) {
+            rb_ary_replace(ary, val);
+            return ary;
+        }
     }
 
     len = NUM2LONG(size);
+    /* NUM2LONG() may call size.to_int, ary can be frozen, modified, etc */
     if (len < 0) {
-	rb_raise(rb_eArgError, "negative array size");
+        rb_raise(rb_eArgError, "negative array size");
     }
     if (len > ARY_MAX_SIZE) {
-	rb_raise(rb_eArgError, "array size too big");
+        rb_raise(rb_eArgError, "array size too big");
     }
+    /* recheck after argument conversion */
     rb_ary_modify(ary);
     ary_resize_capa(ary, len);
     if (rb_block_given_p()) {
-	long i;
+        long i;
 
-	if (argc == 2) {
-	    rb_warn("block supersedes default value argument");
-	}
-	for (i=0; i<len; i++) {
-	    rb_ary_store(ary, i, rb_yield(LONG2NUM(i)));
-	    ARY_SET_LEN(ary, i + 1);
-	}
+        if (argc == 2) {
+            rb_warn("block supersedes default value argument");
+        }
+        for (i=0; i<len; i++) {
+            rb_ary_store(ary, i, rb_yield(LONG2NUM(i)));
+            ARY_SET_LEN(ary, i + 1);
+        }
     }
     else {
-	ary_memfill(ary, 0, len, val);
-	ARY_SET_LEN(ary, len);
+        ary_memfill(ary, 0, len, val);
+        ARY_SET_LEN(ary, len);
     }
     return ary;
 }
@@ -758,7 +1292,7 @@ rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
 /*
  * Returns a new array populated with the given objects.
  *
- *   Array.[]( 1, 'a', /^A/ ) # => [1, "a", /^A/]
+ *   Array.[]( 1, 'a', /^A/)  # => [1, "a", /^A/]
  *   Array[ 1, 'a', /^A/ ]    # => [1, "a", /^A/]
  *   [ 1, 'a', /^A/ ]         # => [1, "a", /^A/]
  */
@@ -781,28 +1315,28 @@ rb_ary_store(VALUE ary, long idx, VALUE val)
     long len = RARRAY_LEN(ary);
 
     if (idx < 0) {
-	idx += len;
-	if (idx < 0) {
-	    rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
-		     idx - len, -len);
-	}
+        idx += len;
+        if (idx < 0) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     idx - len, -len);
+        }
     }
     else if (idx >= ARY_MAX_SIZE) {
-	rb_raise(rb_eIndexError, "index %ld too big", idx);
+        rb_raise(rb_eIndexError, "index %ld too big", idx);
     }
 
     rb_ary_modify(ary);
     if (idx >= ARY_CAPA(ary)) {
-	ary_double_capa(ary, idx);
+        ary_double_capa(ary, idx);
     }
     if (idx > len) {
-	ary_mem_clear(ary, len, idx - len + 1);
+        ary_mem_clear(ary, len, idx - len + 1);
     }
 
     if (idx >= len) {
-	ARY_SET_LEN(ary, idx + 1);
+        ARY_SET_LEN(ary, idx + 1);
     }
-    RARRAY_ASET(ary, idx, val);
+    ARY_SET(ary, idx, val);
 }
 
 static VALUE
@@ -812,31 +1346,87 @@ ary_make_partial(VALUE ary, VALUE klass, long offset, long len)
     assert(len >= 0);
     assert(offset+len <= RARRAY_LEN(ary));
 
-    if (len <= RARRAY_EMBED_LEN_MAX) {
-        VALUE result = ary_alloc(klass);
-	ary_memcpy(result, 0, len, RARRAY_RAWPTR(ary) + offset);
+    const size_t rarray_embed_capa_max = (sizeof(struct RArray) - offsetof(struct RArray, as.ary)) / sizeof(VALUE);
+
+    if ((size_t)len <= rarray_embed_capa_max && ary_embeddable_p(len)) {
+        VALUE result = ary_alloc_embed(klass, len);
+        ary_memcpy(result, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary) + offset);
         ARY_SET_EMBED_LEN(result, len);
         return result;
     }
     else {
-        VALUE shared, result = ary_alloc(klass);
-        FL_UNSET_EMBED(result);
+        VALUE shared = ary_make_shared(ary);
+
+        VALUE result = ary_alloc_heap(klass);
+        assert(!ARY_EMBED_P(result));
 
-        shared = ary_make_shared(ary);
-        ARY_SET_PTR(result, RARRAY_RAWPTR(ary));
+        ARY_SET_PTR(result, RARRAY_CONST_PTR_TRANSIENT(ary));
         ARY_SET_LEN(result, RARRAY_LEN(ary));
         rb_ary_set_shared(result, shared);
 
         ARY_INCREASE_PTR(result, offset);
         ARY_SET_LEN(result, len);
+
+        ary_verify(shared);
+        ary_verify(result);
         return result;
     }
 }
 
 static VALUE
+ary_make_partial_step(VALUE ary, VALUE klass, long offset, long len, long step)
+{
+    assert(offset >= 0);
+    assert(len >= 0);
+    assert(offset+len <= RARRAY_LEN(ary));
+    assert(step != 0);
+
+    const VALUE *values = RARRAY_CONST_PTR_TRANSIENT(ary);
+    const long orig_len = len;
+
+    if (step > 0 && step >= len) {
+        VALUE result = ary_new(klass, 1);
+        VALUE *ptr = (VALUE *)ARY_EMBED_PTR(result);
+        RB_OBJ_WRITE(result, ptr, values[offset]);
+        ARY_SET_EMBED_LEN(result, 1);
+        return result;
+    }
+    else if (step < 0 && step < -len) {
+        step = -len;
+    }
+
+    long ustep = (step < 0) ? -step : step;
+    len = roomof(len, ustep);
+
+    long i;
+    long j = offset + ((step > 0) ? 0 : (orig_len - 1));
+
+    VALUE result = ary_new(klass, len);
+    if (ARY_EMBED_P(result)) {
+        VALUE *ptr = (VALUE *)ARY_EMBED_PTR(result);
+        for (i = 0; i < len; ++i) {
+            RB_OBJ_WRITE(result, ptr+i, values[j]);
+            j += step;
+        }
+        ARY_SET_EMBED_LEN(result, len);
+    }
+    else {
+        RARRAY_PTR_USE_TRANSIENT(result, ptr, {
+            for (i = 0; i < len; ++i) {
+                RB_OBJ_WRITE(result, ptr+i, values[j]);
+                j += step;
+            }
+        });
+        ARY_SET_LEN(result, len);
+    }
+
+    return result;
+}
+
+static VALUE
 ary_make_shared_copy(VALUE ary)
 {
-    return ary_make_partial(ary, rb_obj_class(ary), 0, RARRAY_LEN(ary));
+    return ary_make_partial(ary, rb_cArray, 0, RARRAY_LEN(ary));
 }
 
 enum ary_take_pos_flags
@@ -846,88 +1436,92 @@ enum ary_take_pos_flags
 };
 
 static VALUE
-ary_take_first_or_last(int argc, VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
+ary_take_first_or_last(int argc, const VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
 {
-    VALUE nv;
     long n;
+    long len;
     long offset = 0;
 
-    rb_scan_args(argc, argv, "1", &nv);
-    n = NUM2LONG(nv);
-    if (n > RARRAY_LEN(ary)) {
-	n = RARRAY_LEN(ary);
+    argc = rb_check_arity(argc, 0, 1);
+    /* the case optional argument is omitted should be handled in
+     * callers of this function.  if another arity case is added,
+     * this arity check needs to rewrite. */
+    RUBY_ASSERT_ALWAYS(argc == 1);
+
+    n = NUM2LONG(argv[0]);
+    len = RARRAY_LEN(ary);
+    if (n > len) {
+        n = len;
     }
     else if (n < 0) {
-	rb_raise(rb_eArgError, "negative array size");
+        rb_raise(rb_eArgError, "negative array size");
     }
     if (last) {
-	offset = RARRAY_LEN(ary) - n;
+        offset = len - n;
     }
     return ary_make_partial(ary, rb_cArray, offset, n);
 }
 
 /*
  *  call-seq:
- *     ary << obj            -> ary
+ *    array << object -> self
  *
- *  Append---Pushes the given object on to the end of this array. This
- *  expression returns the array itself, so several appends
- *  may be chained together.
+ *  Appends +object+ to +self+; returns +self+:
  *
- *     [ 1, 2 ] << "c" << "d" << [ 3, 4 ]
- *             #=>  [ 1, 2, "c", "d", [ 3, 4 ] ]
+ *    a = [:foo, 'bar', 2]
+ *    a << :baz # => [:foo, "bar", 2, :baz]
+ *
+ *  Appends +object+ as one element, even if it is another \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a << [3, 4]
+ *    a1 # => [:foo, "bar", 2, [3, 4]]
  *
  */
 
 VALUE
 rb_ary_push(VALUE ary, VALUE item)
 {
-    long idx = RARRAY_LEN(ary);
-
-    ary_ensure_room_for_push(ary, 1);
-    RARRAY_ASET(ary, idx, item);
-    ARY_SET_LEN(ary, idx + 1);
-    return ary;
-}
-
-static VALUE
-rb_ary_push_1(VALUE ary, VALUE item)
-{
-    long idx = RARRAY_LEN(ary);
-
-    if (idx >= ARY_CAPA(ary)) {
-	ary_double_capa(ary, idx);
-    }
-    RARRAY_ASET(ary, idx, item);
+    long idx = RARRAY_LEN((ary_verify(ary), ary));
+    VALUE target_ary = ary_ensure_room_for_push(ary, 1);
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        RB_OBJ_WRITE(target_ary, &ptr[idx], item);
+    });
     ARY_SET_LEN(ary, idx + 1);
+    ary_verify(ary);
     return ary;
 }
 
 VALUE
-rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
+rb_ary_cat(VALUE ary, const VALUE *argv, long len)
 {
     long oldlen = RARRAY_LEN(ary);
-
-    ary_ensure_room_for_push(ary, len);
-    ary_memcpy(ary, oldlen, len, ptr);
+    VALUE target_ary = ary_ensure_room_for_push(ary, len);
+    ary_memcpy0(ary, oldlen, len, argv, target_ary);
     ARY_SET_LEN(ary, oldlen + len);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.push(obj, ... )   -> ary
- *
- *  Append --- Pushes the given object(s) on to the end of this array. This
- *  expression returns the array itself, so several appends
- *  may be chained together. See also Array#pop for the opposite
- *  effect.
- *
- *     a = [ "a", "b", "c" ]
- *     a.push("d", "e", "f")
- *             #=> ["a", "b", "c", "d", "e", "f"]
- *     [1, 2, 3,].push(4).push(5)
- *             #=> [1, 2, 3, 4, 5]
+ *    array.push(*objects) -> self
+ *
+ *  Appends trailing elements.
+ *
+ *  Appends each argument in +objects+ to +self+;  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.push(:baz, :bat) # => [:foo, "bar", 2, :baz, :bat]
+ *
+ *  Appends each argument as one element, even if it is another \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.push([:baz, :bat], [:bam, :bad])
+ *    a1 # => [:foo, "bar", 2, [:baz, :bat], [:bam, :bad]]
+ *
+ *  Array#append is an alias for Array#push.
+ *
+ *  Related: #pop, #shift, #unshift.
  */
 
 static VALUE
@@ -941,34 +1535,49 @@ rb_ary_pop(VALUE ary)
 {
     long n;
     rb_ary_modify_check(ary);
-    if (RARRAY_LEN(ary) == 0) return Qnil;
+    n = RARRAY_LEN(ary);
+    if (n == 0) return Qnil;
     if (ARY_OWNS_HEAP_P(ary) &&
-	RARRAY_LEN(ary) * 3 < ARY_CAPA(ary) &&
-	ARY_CAPA(ary) > ARY_DEFAULT_SIZE)
+        n * 3 < ARY_CAPA(ary) &&
+        ARY_CAPA(ary) > ARY_DEFAULT_SIZE)
     {
-	ary_resize_capa(ary, RARRAY_LEN(ary) * 2);
+        ary_resize_capa(ary, n * 2);
     }
-    n = RARRAY_LEN(ary)-1;
+    --n;
     ARY_SET_LEN(ary, n);
+    ary_verify(ary);
     return RARRAY_AREF(ary, n);
 }
 
 /*
  *  call-seq:
- *     ary.pop    -> obj or nil
- *     ary.pop(n) -> new_ary
+ *    array.pop -> object or nil
+ *    array.pop(n) -> new_array
+ *
+ *  Removes and returns trailing elements.
+ *
+ *  When no argument is given and +self+ is not empty,
+ *  removes and returns the last element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop # => 2
+ *    a # => [:foo, "bar"]
  *
- *  Removes the last element from +self+ and returns it, or
- *  +nil+ if the array is empty.
+ *  Returns +nil+ if the array is empty.
  *
- *  If a number +n+ is given, returns an array of the last +n+ elements
- *  (or less) just like <code>array.slice!(-n, n)</code> does. See also
- *  Array#push for the opposite effect.
+ *  When a non-negative \Integer argument +n+ is given and is in range,
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.pop     #=> "d"
- *     a.pop(2)  #=> ["b", "c"]
- *     a         #=> ["a"]
+ *  removes and returns the last +n+ elements in a new \Array:
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(2) # => ["bar", 2]
+ *
+ *  If +n+ is positive and out of range,
+ *  removes and returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(50) # => [:foo, "bar", 2]
+ *
+ *  Related: #push, #shift, #unshift.
  */
 
 static VALUE
@@ -977,12 +1586,13 @@ rb_ary_pop_m(int argc, VALUE *argv, VALUE ary)
     VALUE result;
 
     if (argc == 0) {
-	return rb_ary_pop(ary);
+        return rb_ary_pop(ary);
     }
 
     rb_ary_modify_check(ary);
     result = ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
     ARY_INCREASE_LEN(ary, -RARRAY_LEN(result));
+    ary_verify(ary);
     return result;
 }
 
@@ -990,53 +1600,51 @@ VALUE
 rb_ary_shift(VALUE ary)
 {
     VALUE top;
+    long len = RARRAY_LEN(ary);
+
+    if (len == 0) {
+        rb_ary_modify_check(ary);
+        return Qnil;
+    }
 
-    rb_ary_modify_check(ary);
-    if (RARRAY_LEN(ary) == 0) return Qnil;
     top = RARRAY_AREF(ary, 0);
-    if (!ARY_SHARED_P(ary)) {
-	if (RARRAY_LEN(ary) < ARY_DEFAULT_SIZE) {
-	    RARRAY_PTR_USE(ary, ptr, {
-		MEMMOVE(ptr, ptr+1, VALUE, RARRAY_LEN(ary)-1);
-	    }); /* WB: no new reference */
-            ARY_INCREASE_LEN(ary, -1);
-	    return top;
-	}
-        assert(!ARY_EMBED_P(ary)); /* ARY_EMBED_LEN_MAX < ARY_DEFAULT_SIZE */
-
-	RARRAY_ASET(ary, 0, Qnil);
-	ary_make_shared(ary);
-    }
-    else if (ARY_SHARED_NUM(ARY_SHARED(ary)) == 1) {
-	RARRAY_ASET(ary, 0, Qnil);
-    }
-    ARY_INCREASE_PTR(ary, 1);		/* shift ptr */
-    ARY_INCREASE_LEN(ary, -1);
+
+    rb_ary_behead(ary, 1);
 
     return top;
 }
 
 /*
  *  call-seq:
- *     ary.shift    -> obj or nil
- *     ary.shift(n) -> new_ary
+ *     array.shift -> object or nil
+ *     array.shift(n) -> new_array
  *
- *  Removes the first element of +self+ and returns it (shifting all
- *  other elements down by one). Returns +nil+ if the array
- *  is empty.
+ *  Removes and returns leading elements.
  *
- *  If a number +n+ is given, returns an array of the first +n+ elements
- *  (or less) just like <code>array.slice!(0, n)</code> does. With +ary+
- *  containing only the remainder elements, not including what was shifted to
- *  +new_ary+. See also Array#unshift for the opposite effect.
+ *  When no argument is given, removes and returns the first element:
  *
- *     args = [ "-m", "-q", "filename" ]
- *     args.shift     #=> "-m"
- *     args           #=> ["-q", "filename"]
+ *    a = [:foo, 'bar', 2]
+ *    a.shift # => :foo
+ *    a # => ['bar', 2]
  *
- *     args = [ "-m", "-q", "filename" ]
- *     args.shift(2)  #=> ["-m", "-q"]
- *     args           #=> ["filename"]
+ *  Returns +nil+ if +self+ is empty.
+ *
+ *  When positive \Integer argument +n+ is given, removes the first +n+ elements;
+ *  returns those elements in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.shift(2) # => [:foo, 'bar']
+ *    a # => [2]
+ *
+ *  If +n+ is as large as or larger than <tt>self.length</tt>,
+ *  removes all elements; returns those elements in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.shift(3) # => [:foo, 'bar', 2]
+ *
+ *  If +n+ is zero, returns a new empty \Array; +self+ is unmodified.
+ *
+ *  Related: #push, #pop, #unshift.
  */
 
 static VALUE
@@ -1046,101 +1654,162 @@ rb_ary_shift_m(int argc, VALUE *argv, VALUE ary)
     long n;
 
     if (argc == 0) {
-	return rb_ary_shift(ary);
+        return rb_ary_shift(ary);
     }
 
     rb_ary_modify_check(ary);
     result = ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
     n = RARRAY_LEN(result);
-    if (ARY_SHARED_P(ary)) {
-	if (ARY_SHARED_NUM(ARY_SHARED(ary)) == 1) {
-	    ary_mem_clear(ary, 0, n);
-	}
-        ARY_INCREASE_PTR(ary, n);
+    rb_ary_behead(ary,n);
+
+    return result;
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_behead(VALUE ary, long n)
+{
+    if (n <= 0) {
+        return ary;
     }
-    else {
-	MEMMOVE(RARRAY_PTR(ary), RARRAY_PTR(ary)+n, VALUE, RARRAY_LEN(ary)-n);
+
+    rb_ary_modify_check(ary);
+
+    if (!ARY_SHARED_P(ary)) {
+        if (ARY_EMBED_P(ary) || RARRAY_LEN(ary) < ARY_DEFAULT_SIZE) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                MEMMOVE(ptr, ptr + n, VALUE, RARRAY_LEN(ary) - n);
+            }); /* WB: no new reference */
+            ARY_INCREASE_LEN(ary, -n);
+            ary_verify(ary);
+            return ary;
+        }
+
+        ary_mem_clear(ary, 0, n);
+        ary_make_shared(ary);
+    }
+    else if (ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(ary))) {
+        ary_mem_clear(ary, 0, n);
     }
+
+    ARY_INCREASE_PTR(ary, n);
     ARY_INCREASE_LEN(ary, -n);
+    ary_verify(ary);
 
-    return result;
+    return ary;
 }
 
-static void
-ary_ensure_room_for_unshift(VALUE ary, int argc)
+static VALUE
+make_room_for_unshift(VALUE ary, const VALUE *head, VALUE *sharedp, int argc, long capa, long len)
+{
+    if (head - sharedp < argc) {
+        long room = capa - len - argc;
+
+        room -= room >> 4;
+        MEMMOVE((VALUE *)sharedp + argc + room, head, VALUE, len);
+        head = sharedp + argc + room;
+    }
+    ARY_SET_PTR(ary, head - argc);
+    assert(ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(ary)));
+
+    ary_verify(ary);
+    return ARY_SHARED_ROOT(ary);
+}
+
+static VALUE
+ary_modify_for_unshift(VALUE ary, int argc)
 {
     long len = RARRAY_LEN(ary);
     long new_len = len + argc;
     long capa;
-    VALUE *head, *sharedp;
-
-    if (ARY_SHARED_P(ary)) {
-	VALUE shared = ARY_SHARED(ary);
-	capa = RARRAY_LEN(shared);
-	if (ARY_SHARED_NUM(shared) == 1 && capa > new_len) {
-	    head = RARRAY_PTR(ary);
-	    sharedp = RARRAY_PTR(shared);
-	    goto makeroom_if_need;
-	}
-    }
+    const VALUE *head, *sharedp;
 
     rb_ary_modify(ary);
     capa = ARY_CAPA(ary);
     if (capa - (capa >> 6) <= new_len) {
-	ary_double_capa(ary, new_len);
+        ary_double_capa(ary, new_len);
     }
 
     /* use shared array for big "queues" */
-    if (new_len > ARY_DEFAULT_SIZE * 4) {
-	/* make a room for unshifted items */
-	capa = ARY_CAPA(ary);
-	ary_make_shared(ary);
-
-	head = sharedp = RARRAY_PTR(ary);
-	goto makeroom;
-      makeroom_if_need:
-	if (head - sharedp < argc) {
-	    long room;
-	  makeroom:
-	    room = capa - new_len;
-	    room -= room >> 4;
-	    MEMMOVE(sharedp + argc + room, head, VALUE, len);
-	    head = sharedp + argc + room;
-	}
-	ARY_SET_PTR(ary, head - argc);
+    if (new_len > ARY_DEFAULT_SIZE * 4 && !ARY_EMBED_P(ary)) {
+        ary_verify(ary);
+
+        /* make a room for unshifted items */
+        capa = ARY_CAPA(ary);
+        ary_make_shared(ary);
+
+        head = sharedp = RARRAY_CONST_PTR_TRANSIENT(ary);
+        return make_room_for_unshift(ary, head, (void *)sharedp, argc, capa, len);
+    }
+    else {
+        /* sliding items */
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            MEMMOVE(ptr + argc, ptr, VALUE, len);
+        });
+
+        ary_verify(ary);
+        return ary;
+    }
+}
+
+static VALUE
+ary_ensure_room_for_unshift(VALUE ary, int argc)
+{
+    long len = RARRAY_LEN(ary);
+    long new_len = len + argc;
+
+    if (len > ARY_MAX_SIZE - argc) {
+        rb_raise(rb_eIndexError, "index %ld too big", new_len);
+    }
+    else if (! ARY_SHARED_P(ary)) {
+        return ary_modify_for_unshift(ary, argc);
     }
     else {
-	/* sliding items */
-	RARRAY_PTR_USE(ary, ptr, {
-	    MEMMOVE(ptr + argc, ptr, VALUE, len);
-	});
+        VALUE shared_root = ARY_SHARED_ROOT(ary);
+        long capa = RARRAY_LEN(shared_root);
+
+        if (! ARY_SHARED_ROOT_OCCUPIED(shared_root)) {
+            return ary_modify_for_unshift(ary, argc);
+        }
+        else if (new_len > capa) {
+            return ary_modify_for_unshift(ary, argc);
+        }
+        else {
+            const VALUE * head = RARRAY_CONST_PTR_TRANSIENT(ary);
+            void *sharedp = (void *)RARRAY_CONST_PTR_TRANSIENT(shared_root);
+
+            rb_ary_modify_check(ary);
+            return make_room_for_unshift(ary, head, sharedp, argc, capa, len);
+        }
     }
 }
 
 /*
  *  call-seq:
- *     ary.unshift(obj, ...)  -> ary
+ *    array.unshift(*objects) -> self
  *
- *  Prepends objects to the front of +self+, moving other elements upwards.
- *  See also Array#shift for the opposite effect.
+ *  Prepends the given +objects+ to +self+:
  *
- *     a = [ "b", "c", "d" ]
- *     a.unshift("a")   #=> ["a", "b", "c", "d"]
- *     a.unshift(1, 2)  #=> [ 1, 2, "a", "b", "c", "d"]
+ *    a = [:foo, 'bar', 2]
+ *    a.unshift(:bam, :bat) # => [:bam, :bat, :foo, "bar", 2]
+ *
+ *  Array#prepend is an alias for Array#unshift.
+ *
+ *  Related: #push, #pop, #shift.
  */
 
 static VALUE
 rb_ary_unshift_m(int argc, VALUE *argv, VALUE ary)
 {
     long len = RARRAY_LEN(ary);
+    VALUE target_ary;
 
     if (argc == 0) {
-	rb_ary_modify_check(ary);
-	return ary;
+        rb_ary_modify_check(ary);
+        return ary;
     }
 
-    ary_ensure_room_for_unshift(ary, argc);
-    ary_memcpy(ary, 0, argc, argv);
+    target_ary = ary_ensure_room_for_unshift(ary, argc);
+    ary_memcpy0(ary, 0, argc, argv, target_ary);
     ARY_SET_LEN(ary, len + argc);
     return ary;
 }
@@ -1155,9 +1824,10 @@ rb_ary_unshift(VALUE ary, VALUE item)
 static inline VALUE
 rb_ary_elt(VALUE ary, long offset)
 {
-    if (RARRAY_LEN(ary) == 0) return Qnil;
-    if (offset < 0 || RARRAY_LEN(ary) <= offset) {
-	return Qnil;
+    long len = RARRAY_LEN(ary);
+    if (len == 0) return Qnil;
+    if (offset < 0 || len <= offset) {
+        return Qnil;
     }
     return RARRAY_AREF(ary, offset);
 }
@@ -1165,113 +1835,199 @@ rb_ary_elt(VALUE ary, long offset)
 VALUE
 rb_ary_entry(VALUE ary, long offset)
 {
-    if (offset < 0) {
-	offset += RARRAY_LEN(ary);
-    }
-    return rb_ary_elt(ary, offset);
+    return rb_ary_entry_internal(ary, offset);
 }
 
 VALUE
-rb_ary_subseq(VALUE ary, long beg, long len)
+rb_ary_subseq_step(VALUE ary, long beg, long len, long step)
 {
     VALUE klass;
+    long alen = RARRAY_LEN(ary);
 
-    if (beg > RARRAY_LEN(ary)) return Qnil;
+    if (beg > alen) return Qnil;
     if (beg < 0 || len < 0) return Qnil;
 
-    if (RARRAY_LEN(ary) < len || RARRAY_LEN(ary) < beg + len) {
-	len = RARRAY_LEN(ary) - beg;
+    if (alen < len || alen < beg + len) {
+        len = alen - beg;
     }
-    klass = rb_obj_class(ary);
+    klass = rb_cArray;
     if (len == 0) return ary_new(klass, 0);
+    if (step == 0)
+        rb_raise(rb_eArgError, "slice step cannot be zero");
+    if (step == 1)
+        return ary_make_partial(ary, klass, beg, len);
+    else
+        return ary_make_partial_step(ary, klass, beg, len, step);
+}
 
-    return ary_make_partial(ary, klass, beg, len);
+VALUE
+rb_ary_subseq(VALUE ary, long beg, long len)
+{
+    return rb_ary_subseq_step(ary, beg, len, 1);
 }
 
+static VALUE rb_ary_aref2(VALUE ary, VALUE b, VALUE e);
+
 /*
  *  call-seq:
- *     ary[index]                -> obj     or nil
- *     ary[start, length]        -> new_ary or nil
- *     ary[range]                -> new_ary or nil
- *     ary.slice(index)          -> obj     or nil
- *     ary.slice(start, length)  -> new_ary or nil
- *     ary.slice(range)          -> new_ary or nil
- *
- *  Element Reference --- Returns the element at +index+, or returns a
- *  subarray starting at the +start+ index and continuing for +length+
- *  elements, or returns a subarray specified by +range+ of indices.
- *
- *  Negative indices count backward from the end of the array (-1 is the last
- *  element).  For +start+ and +range+ cases the starting index is just before
- *  an element.  Additionally, an empty array is returned when the starting
- *  index for an element range is at the end of the array.
- *
- *  Returns +nil+ if the index (or starting index) are out of range.
- *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a[2] +  a[0] + a[1]    #=> "cab"
- *     a[6]                   #=> nil
- *     a[1, 2]                #=> [ "b", "c" ]
- *     a[1..3]                #=> [ "b", "c", "d" ]
- *     a[4..7]                #=> [ "e" ]
- *     a[6..10]               #=> nil
- *     a[-3, 3]               #=> [ "c", "d", "e" ]
- *     # special cases
- *     a[5]                   #=> nil
- *     a[6, 1]                #=> nil
- *     a[5, 1]                #=> []
- *     a[5..10]               #=> []
+ *    array[index] -> object or nil
+ *    array[start, length] -> object or nil
+ *    array[range] -> object or nil
+ *    array[aseq] -> object or nil
+ *    array.slice(index) -> object or nil
+ *    array.slice(start, length) -> object or nil
+ *    array.slice(range) -> object or nil
+ *    array.slice(aseq) -> object or nil
+ *
+ *  Returns elements from +self+; does not modify +self+.
+ *
+ *  When a single \Integer argument +index+ is given, returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0] # => :foo
+ *    a[2] # => 2
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +index+ is negative, counts relative to the end of +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1] # => 2
+ *    a[-2] # => "bar"
+ *
+ *  If +index+ is out of range, returns +nil+.
+ *
+ *  When two \Integer arguments +start+ and +length+ are given,
+ *  returns a new \Array of size +length+ containing successive elements beginning at offset +start+:
  *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 2] # => [:foo, "bar"]
+ *    a[1, 2] # => ["bar", 2]
+ *
+ *  If <tt>start + length</tt> is greater than <tt>self.length</tt>,
+ *  returns all elements from offset +start+ to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 4] # => [:foo, "bar", 2]
+ *    a[1, 3] # => ["bar", 2]
+ *    a[2, 2] # => [2]
+ *
+ *  If <tt>start == self.size</tt> and <tt>length >= 0</tt>,
+ *  returns a new empty \Array.
+ *
+ *  If +length+ is negative, returns +nil+.
+ *
+ *  When a single \Range argument +range+ is given,
+ *  treats <tt>range.min</tt> as +start+ above
+ *  and <tt>range.size</tt> as +length+ above:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..1] # => [:foo, "bar"]
+ *    a[1..2] # => ["bar", 2]
+ *
+ *  Special case: If <tt>range.start == a.size</tt>, returns a new empty \Array.
+ *
+ *  If <tt>range.end</tt> is negative, calculates the end index from the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..-1] # => [:foo, "bar", 2]
+ *    a[0..-2] # => [:foo, "bar"]
+ *    a[0..-3] # => [:foo]
+ *
+ *  If <tt>range.start</tt> is negative, calculates the start index from the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1..2] # => [2]
+ *    a[-2..2] # => ["bar", 2]
+ *    a[-3..2] # => [:foo, "bar", 2]
+ *
+ *  If <tt>range.start</tt> is larger than the array size, returns +nil+.
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[4..1] # => nil
+ *    a[4..0] # => nil
+ *    a[4..-1] # => nil
+ *
+ *  When a single Enumerator::ArithmeticSequence argument +aseq+ is given,
+ *  returns an \Array of elements corresponding to the indexes produced by
+ *  the sequence.
+ *
+ *    a = ['--', 'data1', '--', 'data2', '--', 'data3']
+ *    a[(1..).step(2)] # => ["data1", "data2", "data3"]
+ *
+ *  Unlike slicing with range, if the start or the end of the arithmetic sequence
+ *  is larger than array size, throws RangeError.
+ *
+ *    a = ['--', 'data1', '--', 'data2', '--', 'data3']
+ *    a[(1..11).step(2)]
+ *    # RangeError (((1..11).step(2)) out of range)
+ *    a[(7..).step(2)]
+ *    # RangeError (((7..).step(2)) out of range)
+ *
+ *  If given a single argument, and its type is not one of the listed, tries to
+ *  convert it to Integer, and raises if it is impossible:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    # Raises TypeError (no implicit conversion of Symbol into Integer):
+ *    a[:foo]
+ *
+ *  Array#slice is an alias for Array#[].
  */
 
 VALUE
-rb_ary_aref(int argc, VALUE *argv, VALUE ary)
+rb_ary_aref(int argc, const VALUE *argv, VALUE ary)
 {
-    VALUE arg;
-    long beg, len;
-
+    rb_check_arity(argc, 1, 2);
     if (argc == 2) {
-	beg = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-	if (beg < 0) {
-	    beg += RARRAY_LEN(ary);
-	}
-	return rb_ary_subseq(ary, beg, len);
+        return rb_ary_aref2(ary, argv[0], argv[1]);
     }
-    if (argc != 1) {
-	rb_scan_args(argc, argv, "11", NULL, NULL);
+    return rb_ary_aref1(ary, argv[0]);
+}
+
+static VALUE
+rb_ary_aref2(VALUE ary, VALUE b, VALUE e)
+{
+    long beg = NUM2LONG(b);
+    long len = NUM2LONG(e);
+    if (beg < 0) {
+        beg += RARRAY_LEN(ary);
     }
-    arg = argv[0];
+    return rb_ary_subseq(ary, beg, len);
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_aref1(VALUE ary, VALUE arg)
+{
+    long beg, len, step;
+
     /* special case - speeding up */
     if (FIXNUM_P(arg)) {
-	return rb_ary_entry(ary, FIX2LONG(arg));
+        return rb_ary_entry(ary, FIX2LONG(arg));
     }
-    /* check if idx is Range */
-    switch (rb_range_beg_len(arg, &beg, &len, RARRAY_LEN(ary), 0)) {
+    /* check if idx is Range or ArithmeticSequence */
+    switch (rb_arithmetic_sequence_beg_len_step(arg, &beg, &len, &step, RARRAY_LEN(ary), 0)) {
       case Qfalse:
-	break;
+        break;
       case Qnil:
-	return Qnil;
+        return Qnil;
       default:
-	return rb_ary_subseq(ary, beg, len);
+        return rb_ary_subseq_step(ary, beg, len, step);
     }
+
     return rb_ary_entry(ary, NUM2LONG(arg));
 }
 
 /*
  *  call-seq:
- *     ary.at(index)   ->   obj  or nil
+ *    array.at(index) -> object
  *
- *  Returns the element at +index+. A negative index counts from the end of
- *  +self+. Returns +nil+ if the index is out of range. See also
- *  Array#[].
+ *  Returns the element at \Integer offset +index+; does not modify +self+.
+ *    a = [:foo, 'bar', 2]
+ *    a.at(0) # => :foo
+ *    a.at(2) # => 2
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.at(0)     #=> "a"
- *     a.at(-1)    #=> "e"
  */
 
-static VALUE
+VALUE
 rb_ary_at(VALUE ary, VALUE pos)
 {
     return rb_ary_entry(ary, NUM2LONG(pos));
@@ -1279,79 +2035,131 @@ rb_ary_at(VALUE ary, VALUE pos)
 
 /*
  *  call-seq:
- *     ary.first     ->   obj or nil
- *     ary.first(n)  ->   new_ary
+ *    array.first -> object or nil
+ *    array.first(n) -> new_array
+ *
+ *  Returns elements from +self+; does not modify +self+.
+ *
+ *  When no argument is given, returns the first element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first # => :foo
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +self+ is empty, returns +nil+.
  *
- *  Returns the first element, or the first +n+ elements, of the array.
- *  If the array is empty, the first form returns +nil+, and the
- *  second form returns an empty array. See also Array#last for
- *  the opposite effect.
+ *  When non-negative \Integer argument +n+ is given,
+ *  returns the first +n+ elements in a new \Array:
  *
- *     a = [ "q", "r", "s", "t" ]
- *     a.first     #=> "q"
- *     a.first(2)  #=> ["q", "r"]
+ *    a = [:foo, 'bar', 2]
+ *    a.first(2) # => [:foo, "bar"]
+ *
+ *  If <tt>n >= array.size</tt>, returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first(50) # => [:foo, "bar", 2]
+ *
+ *  If <tt>n == 0</tt> returns an new empty \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first(0) # []
+ *
+ *  Related: #last.
  */
-
 static VALUE
 rb_ary_first(int argc, VALUE *argv, VALUE ary)
 {
     if (argc == 0) {
-	if (RARRAY_LEN(ary) == 0) return Qnil;
-	return RARRAY_AREF(ary, 0);
+        if (RARRAY_LEN(ary) == 0) return Qnil;
+        return RARRAY_AREF(ary, 0);
     }
     else {
-	return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
     }
 }
 
 /*
  *  call-seq:
- *     ary.last     ->  obj or nil
- *     ary.last(n)  ->  new_ary
+ *    array.last  -> object or nil
+ *    array.last(n) -> new_array
+ *
+ *  Returns elements from +self+; +self+ is not modified.
+ *
+ *  When no argument is given, returns the last element:
  *
- *  Returns the last element(s) of +self+. If the array is empty,
- *  the first form returns +nil+.
+ *    a = [:foo, 'bar', 2]
+ *    a.last # => 2
+ *    a # => [:foo, "bar", 2]
  *
- *  See also Array#first for the opposite effect.
+ *  If +self+ is empty, returns +nil+.
  *
- *     a = [ "w", "x", "y", "z" ]
- *     a.last     #=> "z"
- *     a.last(2)  #=> ["y", "z"]
+ *  When non-negative \Integer argument +n+ is given,
+ *  returns the last +n+ elements in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last(2) # => ["bar", 2]
+ *
+ *  If <tt>n >= array.size</tt>, returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last(50) # => [:foo, "bar", 2]
+ *
+ *  If <tt>n == 0</tt>, returns an new empty \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last(0) # []
+ *
+ *  Related: #first.
  */
 
 VALUE
-rb_ary_last(int argc, VALUE *argv, VALUE ary)
+rb_ary_last(int argc, const VALUE *argv, VALUE ary)
 {
     if (argc == 0) {
-	if (RARRAY_LEN(ary) == 0) return Qnil;
-	return RARRAY_AREF(ary, RARRAY_LEN(ary)-1);
+        long len = RARRAY_LEN(ary);
+        if (len == 0) return Qnil;
+        return RARRAY_AREF(ary, len-1);
     }
     else {
-	return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
     }
 }
 
 /*
  *  call-seq:
- *     ary.fetch(index)                    -> obj
- *     ary.fetch(index, default)           -> obj
- *     ary.fetch(index) { |index| block }  -> obj
- *
- *  Tries to return the element at position +index+, but throws an IndexError
- *  exception if the referenced +index+ lies outside of the array bounds.  This
- *  error can be prevented by supplying a second argument, which will act as a
- *  +default+ value.
- *
- *  Alternatively, if a block is given it will only be executed when an
- *  invalid +index+ is referenced.  Negative values of +index+ count from the
- *  end of the array.
- *
- *     a = [ 11, 22, 33, 44 ]
- *     a.fetch(1)               #=> 22
- *     a.fetch(-1)              #=> 44
- *     a.fetch(4, 'cat')        #=> "cat"
- *     a.fetch(100) { |i| puts "#{i} is out of bounds" }
- *                              #=> "100 is out of bounds"
+ *    array.fetch(index) -> element
+ *    array.fetch(index, default_value) -> element
+ *    array.fetch(index) {|index| ... } -> element
+ *
+ *  Returns the element at offset  +index+.
+ *
+ *  With the single \Integer argument +index+,
+ *  returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1) # => "bar"
+ *
+ *  If +index+ is negative, counts from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(-1) # => 2
+ *    a.fetch(-2) # => "bar"
+ *
+ *  With arguments +index+ and +default_value+,
+ *  returns the element at offset +index+ if index is in range,
+ *  otherwise returns +default_value+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1, nil) # => "bar"
+ *
+ *  With argument +index+ and a block,
+ *  returns the element at offset +index+ if index is in range
+ *  (and the block is not called); otherwise calls the block with index and returns its return value:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1) {|index| raise 'Cannot happen' } # => "bar"
+ *    a.fetch(50) {|index| "Value for #{index}" } # => "Value for 50"
+ *
  */
 
 static VALUE
@@ -1364,48 +2172,60 @@ rb_ary_fetch(int argc, VALUE *argv, VALUE ary)
     rb_scan_args(argc, argv, "11", &pos, &ifnone);
     block_given = rb_block_given_p();
     if (block_given && argc == 2) {
-	rb_warn("block supersedes default value argument");
+        rb_warn("block supersedes default value argument");
     }
     idx = NUM2LONG(pos);
 
     if (idx < 0) {
-	idx +=  RARRAY_LEN(ary);
+        idx +=  RARRAY_LEN(ary);
     }
     if (idx < 0 || RARRAY_LEN(ary) <= idx) {
-	if (block_given) return rb_yield(pos);
-	if (argc == 1) {
-	    rb_raise(rb_eIndexError, "index %ld outside of array bounds: %ld...%ld",
-			idx - (idx < 0 ? RARRAY_LEN(ary) : 0), -RARRAY_LEN(ary), RARRAY_LEN(ary));
-	}
-	return ifnone;
+        if (block_given) return rb_yield(pos);
+        if (argc == 1) {
+            rb_raise(rb_eIndexError, "index %ld outside of array bounds: %ld...%ld",
+                        idx - (idx < 0 ? RARRAY_LEN(ary) : 0), -RARRAY_LEN(ary), RARRAY_LEN(ary));
+        }
+        return ifnone;
     }
     return RARRAY_AREF(ary, idx);
 }
 
 /*
  *  call-seq:
- *     ary.find_index(obj)             ->  int or nil
- *     ary.find_index { |item| block } ->  int or nil
- *     ary.find_index                  ->  Enumerator
- *     ary.index(obj)             ->  int or nil
- *     ary.index { |item| block } ->  int or nil
- *     ary.index                  ->  Enumerator
+ *    array.index(object) -> integer or nil
+ *    array.index {|element| ... } -> integer or nil
+ *    array.index -> new_enumerator
+ *
+ *  Returns the index of a specified element.
+ *
+ *  When argument +object+ is given but no block,
+ *  returns the index of the first element +element+
+ *  for which <tt>object == element</tt>:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.index('bar') # => 1
+ *
+ *  Returns +nil+ if no such element found.
+ *
+ *  When both argument +object+ and a block are given,
+ *  calls the block with each successive element;
+ *  returns the index of the first element for which the block returns a truthy value:
  *
- *  Returns the _index_ of the first object in +ary+ such that the object is
- *  <code>==</code> to +obj+.
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.index {|element| element == 'bar' } # => 1
  *
- *  If a block is given instead of an argument, returns the _index_ of the
- *  first object for which the block returns +true+.  Returns +nil+ if no
- *  match is found.
+ *  Returns +nil+ if the block never returns a truthy value.
  *
- *  See also Array#rindex.
+ *  When neither an argument nor a block is given, returns a new Enumerator:
  *
- *  An Enumerator is returned if neither a block nor argument is given.
+ *    a = [:foo, 'bar', 2]
+ *    e = a.index
+ *    e # => #<Enumerator: [:foo, "bar", 2]:index>
+ *    e.each {|element| element == 'bar' } # => 1
  *
- *     a = [ "a", "b", "c" ]
- *     a.index("b")              #=> 1
- *     a.index("z")              #=> nil
- *     a.index { |x| x == "b" }  #=> 1
+ *  Array#find_index is an alias for Array#index.
+ *
+ *  Related: #rindex.
  */
 
 static VALUE
@@ -1415,74 +2235,89 @@ rb_ary_index(int argc, VALUE *argv, VALUE ary)
     long i;
 
     if (argc == 0) {
-	RETURN_ENUMERATOR(ary, 0, 0);
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
-		return LONG2NUM(i);
-	    }
-	}
-	return Qnil;
-    }
-    rb_scan_args(argc, argv, "1", &val);
+        RETURN_ENUMERATOR(ary, 0, 0);
+        for (i=0; i<RARRAY_LEN(ary); i++) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+                return LONG2NUM(i);
+            }
+        }
+        return Qnil;
+    }
+    rb_check_arity(argc, 0, 1);
+    val = argv[0];
     if (rb_block_given_p())
-	rb_warn("given block not used");
+        rb_warn("given block not used");
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	if (rb_equal(RARRAY_AREF(ary, i), val))
-	    return LONG2NUM(i);
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
     }
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rindex(obj)             ->  int or nil
- *     ary.rindex { |item| block } ->  int or nil
- *     ary.rindex                  ->  Enumerator
+ *    array.rindex(object) -> integer or nil
+ *    array.rindex {|element| ... } -> integer or nil
+ *    array.rindex -> new_enumerator
+ *
+ *  Returns the index of the last element for which <tt>object == element</tt>.
  *
- *  Returns the _index_ of the last object in +self+ <code>==</code> to +obj+.
+ *  When argument +object+ is given but no block, returns the index of the last such element found:
  *
- *  If a block is given instead of an argument, returns the _index_ of the
- *  first object for which the block returns +true+, starting from the last
- *  object.
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex('bar') # => 3
  *
- *  Returns +nil+ if no match is found.
+ *  Returns +nil+ if no such object found.
  *
- *  See also Array#index.
+ *  When a block is given but no argument, calls the block with each successive element;
+ *  returns the index of the last element for which the block returns a truthy value:
  *
- *  If neither block nor argument is given, an Enumerator is returned instead.
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex {|element| element == 'bar' } # => 3
  *
- *     a = [ "a", "b", "b", "b", "c" ]
- *     a.rindex("b")             #=> 3
- *     a.rindex("z")             #=> nil
- *     a.rindex { |x| x == "b" } #=> 3
+ *  Returns +nil+ if the block never returns a truthy value.
+ *
+ *  When neither an argument nor a block is given, returns a new \Enumerator:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    e = a.rindex
+ *    e # => #<Enumerator: [:foo, "bar", 2, "bar"]:rindex>
+ *    e.each {|element| element == 'bar' } # => 3
+ *
+ *  Related: #index.
  */
 
 static VALUE
 rb_ary_rindex(int argc, VALUE *argv, VALUE ary)
 {
     VALUE val;
-    long i = RARRAY_LEN(ary);
+    long i = RARRAY_LEN(ary), len;
 
     if (argc == 0) {
-	RETURN_ENUMERATOR(ary, 0, 0);
-	while (i--) {
-	    if (RTEST(rb_yield(RARRAY_AREF(ary, i))))
-		return LONG2NUM(i);
-	    if (i > RARRAY_LEN(ary)) {
-		i = RARRAY_LEN(ary);
-	    }
-	}
-	return Qnil;
-    }
-    rb_scan_args(argc, argv, "1", &val);
+        RETURN_ENUMERATOR(ary, 0, 0);
+        while (i--) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i))))
+                return LONG2NUM(i);
+            if (i > (len = RARRAY_LEN(ary))) {
+                i = len;
+            }
+        }
+        return Qnil;
+    }
+    rb_check_arity(argc, 0, 1);
+    val = argv[0];
     if (rb_block_given_p())
-	rb_warn("given block not used");
+        rb_warn("given block not used");
     while (i--) {
-	if (rb_equal(RARRAY_AREF(ary, i), val))
-	    return LONG2NUM(i);
-	if (i > RARRAY_LEN(ary)) {
-	    i = RARRAY_LEN(ary);
-	}
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
+        if (i > RARRAY_LEN(ary)) {
+            break;
+        }
     }
     return Qnil;
 }
@@ -1497,58 +2332,72 @@ rb_ary_to_ary(VALUE obj)
 }
 
 static void
-rb_ary_splice(VALUE ary, long beg, long len, VALUE rpl)
+rb_ary_splice(VALUE ary, long beg, long len, const VALUE *rptr, long rlen)
 {
-    long rlen;
+    long olen;
+    long rofs;
 
     if (len < 0) rb_raise(rb_eIndexError, "negative length (%ld)", len);
+    olen = RARRAY_LEN(ary);
     if (beg < 0) {
-	beg += RARRAY_LEN(ary);
-	if (beg < 0) {
-	    rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
-		     beg - RARRAY_LEN(ary), -RARRAY_LEN(ary));
-	}
+        beg += olen;
+        if (beg < 0) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     beg - olen, -olen);
+        }
     }
-    if (RARRAY_LEN(ary) < len || RARRAY_LEN(ary) < beg + len) {
-	len = RARRAY_LEN(ary) - beg;
+    if (olen < len || olen < beg + len) {
+        len = olen - beg;
     }
 
-    if (rpl == Qundef) {
-	rlen = 0;
+    {
+        const VALUE *optr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        rofs = (rptr >= optr && rptr < optr + olen) ? rptr - optr : -1;
     }
-    else {
-	rpl = rb_ary_to_ary(rpl);
-	rlen = RARRAY_LEN(rpl);
-    }
-    if (beg >= RARRAY_LEN(ary)) {
-	if (beg > ARY_MAX_SIZE - rlen) {
-	    rb_raise(rb_eIndexError, "index %ld too big", beg);
-	}
-	ary_ensure_room_for_push(ary, rlen-len); /* len is 0 or negative */
-	len = beg + rlen;
-	ary_mem_clear(ary, RARRAY_LEN(ary), beg - RARRAY_LEN(ary));
-	if (rlen > 0) {
-	    ary_memcpy(ary, beg, rlen, RARRAY_RAWPTR(rpl));
-	}
-	ARY_SET_LEN(ary, len);
+
+    if (beg >= olen) {
+        VALUE target_ary;
+        if (beg > ARY_MAX_SIZE - rlen) {
+            rb_raise(rb_eIndexError, "index %ld too big", beg);
+        }
+        target_ary = ary_ensure_room_for_push(ary, rlen-len); /* len is 0 or negative */
+        len = beg + rlen;
+        ary_mem_clear(ary, olen, beg - olen);
+        if (rlen > 0) {
+            if (rofs != -1) rptr = RARRAY_CONST_PTR_TRANSIENT(ary) + rofs;
+            ary_memcpy0(ary, beg, rlen, rptr, target_ary);
+        }
+        ARY_SET_LEN(ary, len);
     }
     else {
-	long alen;
+        long alen;
 
-	rb_ary_modify(ary);
-	alen = RARRAY_LEN(ary) + rlen - len;
-	if (alen >= ARY_CAPA(ary)) {
-	    ary_double_capa(ary, alen);
-	}
+        if (olen - len > ARY_MAX_SIZE - rlen) {
+            rb_raise(rb_eIndexError, "index %ld too big", olen + rlen - len);
+        }
+        rb_ary_modify(ary);
+        alen = olen + rlen - len;
+        if (alen >= ARY_CAPA(ary)) {
+            ary_double_capa(ary, alen);
+        }
 
-	if (len != rlen) {
-	    MEMMOVE(RARRAY_PTR(ary) + beg + rlen, RARRAY_PTR(ary) + beg + len,
-		    VALUE, RARRAY_LEN(ary) - (beg + len));
-	    ARY_SET_LEN(ary, alen);
-	}
-	if (rlen > 0) {
-	    MEMMOVE(RARRAY_PTR(ary) + beg, RARRAY_RAWPTR(rpl), VALUE, rlen);
-	}
+        if (len != rlen) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr,
+                                     MEMMOVE(ptr + beg + rlen, ptr + beg + len,
+                                             VALUE, olen - (beg + len)));
+            ARY_SET_LEN(ary, alen);
+        }
+        if (rlen > 0) {
+            if (rofs != -1) rptr = RARRAY_CONST_PTR_TRANSIENT(ary) + rofs;
+            /* give up wb-protected ary */
+            RB_OBJ_WB_UNPROTECT_FOR(ARRAY, ary);
+
+            /* do not use RARRAY_PTR() because it can causes GC.
+             * ary can contain T_NONE object because it is not cleared.
+             */
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr,
+                                     MEMMOVE(ptr + beg, rptr, VALUE, rlen));
+        }
     }
 }
 
@@ -1559,22 +2408,14 @@ rb_ary_set_len(VALUE ary, long len)
 
     rb_ary_modify_check(ary);
     if (ARY_SHARED_P(ary)) {
-	rb_raise(rb_eRuntimeError, "can't set length of shared ");
+        rb_raise(rb_eRuntimeError, "can't set length of shared ");
     }
     if (len > (capa = (long)ARY_CAPA(ary))) {
-	rb_bug("probable buffer overflow: %ld for %ld", len, capa);
+        rb_bug("probable buffer overflow: %ld for %ld", len, capa);
     }
     ARY_SET_LEN(ary, len);
 }
 
-/*!
- * expands or shrinks \a ary to \a len elements.
- * expanded region will be filled with Qnil.
- * \param ary  an array
- * \param len  new size
- * \return     \a ary
- * \post       the size of \a ary is \a len.
- */
 VALUE
 rb_ary_resize(VALUE ary, long len)
 {
@@ -1584,68 +2425,170 @@ rb_ary_resize(VALUE ary, long len)
     olen = RARRAY_LEN(ary);
     if (len == olen) return ary;
     if (len > ARY_MAX_SIZE) {
-	rb_raise(rb_eIndexError, "index %ld too big", len);
+        rb_raise(rb_eIndexError, "index %ld too big", len);
     }
     if (len > olen) {
-	if (len >= ARY_CAPA(ary)) {
-	    ary_double_capa(ary, len);
-	}
-	ary_mem_clear(ary, olen, len - olen);
-	ARY_SET_LEN(ary, len);
+        if (len >= ARY_CAPA(ary)) {
+            ary_double_capa(ary, len);
+        }
+        ary_mem_clear(ary, olen, len - olen);
+        ARY_SET_LEN(ary, len);
     }
     else if (ARY_EMBED_P(ary)) {
         ARY_SET_EMBED_LEN(ary, len);
     }
-    else if (len <= RARRAY_EMBED_LEN_MAX) {
-	VALUE tmp[RARRAY_EMBED_LEN_MAX];
-	MEMCPY(tmp, ARY_HEAP_PTR(ary), VALUE, len);
-	ary_discard(ary);
-	MEMCPY((VALUE *)ARY_EMBED_PTR(ary), tmp, VALUE, len); /* WB: no new reference */
+    else if (len <= ary_embed_capa(ary)) {
+        const VALUE *ptr = ARY_HEAP_PTR(ary);
+        long ptr_capa = ARY_HEAP_SIZE(ary);
+        bool is_malloc_ptr = !ARY_SHARED_P(ary) && !RARRAY_TRANSIENT_P(ary);
+
+        FL_UNSET(ary, RARRAY_TRANSIENT_FLAG);
+        FL_SET_EMBED(ary);
+
+        MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len); /* WB: no new reference */
         ARY_SET_EMBED_LEN(ary, len);
+
+        if (is_malloc_ptr) ruby_sized_xfree((void *)ptr, ptr_capa);
     }
     else {
-	if (olen > len + ARY_DEFAULT_SIZE) {
-	    REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, len);
-	    ARY_SET_CAPA(ary, len);
-	}
-	ARY_SET_HEAP_LEN(ary, len);
+        if (olen > len + ARY_DEFAULT_SIZE) {
+            size_t new_capa = ary_heap_realloc(ary, len);
+            ARY_SET_CAPA(ary, new_capa);
+        }
+        ARY_SET_HEAP_LEN(ary, len);
     }
+    ary_verify(ary);
     return ary;
 }
 
+static VALUE
+ary_aset_by_rb_ary_store(VALUE ary, long key, VALUE val)
+{
+    rb_ary_store(ary, key, val);
+    return val;
+}
+
+static VALUE
+ary_aset_by_rb_ary_splice(VALUE ary, long beg, long len, VALUE val)
+{
+    VALUE rpl = rb_ary_to_ary(val);
+    rb_ary_splice(ary, beg, len, RARRAY_CONST_PTR_TRANSIENT(rpl), RARRAY_LEN(rpl));
+    RB_GC_GUARD(rpl);
+    return val;
+}
+
 /*
  *  call-seq:
- *     ary[index]         = obj                      ->  obj
- *     ary[start, length] = obj or other_ary or nil  ->  obj or other_ary or nil
- *     ary[range]         = obj or other_ary or nil  ->  obj or other_ary or nil
- *
- *  Element Assignment --- Sets the element at +index+, or replaces a subarray
- *  from the +start+ index for +length+ elements, or replaces a subarray
- *  specified by the +range+ of indices.
- *
- *  If indices are greater than the current capacity of the array, the array
- *  grows automatically.  Elements are inserted into the array at +start+ if
- *  +length+ is zero.
- *
- *  Negative indices will count backward from the end of the array.  For
- *  +start+ and +range+ cases the starting index is just before an element.
- *
- *  An IndexError is raised if a negative index points past the beginning of
- *  the array.
- *
- *  See also Array#push, and Array#unshift.
- *
- *     a = Array.new
- *     a[4] = "4";                 #=> [nil, nil, nil, nil, "4"]
- *     a[0, 3] = [ 'a', 'b', 'c' ] #=> ["a", "b", "c", nil, "4"]
- *     a[1..2] = [ 1, 2 ]          #=> ["a", 1, 2, nil, "4"]
- *     a[0, 2] = "?"               #=> ["?", 2, nil, "4"]
- *     a[0..2] = "A"               #=> ["A", "4"]
- *     a[-1]   = "Z"               #=> ["A", "Z"]
- *     a[1..-1] = nil              #=> ["A", nil]
- *     a[1..-1] = []               #=> ["A"]
- *     a[0, 0] = [ 1, 2 ]          #=> [1, 2, "A"]
- *     a[3, 0] = "B"               #=> [1, 2, "A", "B"]
+ *    array[index] = object -> object
+ *    array[start, length] = object -> object
+ *    array[range] = object -> object
+ *
+ *  Assigns elements in +self+; returns the given +object+.
+ *
+ *  When \Integer argument +index+ is given, assigns +object+ to an element in +self+.
+ *
+ *  If +index+ is non-negative, assigns +object+ the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0] = 'foo' # => "foo"
+ *    a # => ["foo", "bar", 2]
+ *
+ *  If +index+ is greater than <tt>self.length</tt>, extends the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[7] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, nil, "foo"]
+ *
+ *  If +index+ is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1] = 'two' # => "two"
+ *    a # => [:foo, "bar", "two"]
+ *
+ *  When \Integer arguments +start+ and +length+ are given and +object+ is not an \Array,
+ *  removes <tt>length - 1</tt> elements beginning at offset +start+,
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 2] = 'foo' # => "foo"
+ *    a # => ["foo", 2]
+ *
+ *  If +start+ is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-2, 2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  If +start+ is non-negative and outside the array (<tt> >= self.size</tt>),
+ *  extends the array with +nil+, assigns +object+ at offset +start+,
+ *  and ignores +length+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[6, 50] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *  If +length+ is zero, shifts elements at and following offset +start+
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1, 0] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *
+ *  If +length+ is too large for the existing array, does not extend the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1, 5] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  When \Range argument +range+ is given and +object+ is an \Array,
+ *  removes <tt>length - 1</tt> elements beginning at offset +start+,
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..1] = 'foo' # => "foo"
+ *    a # => ["foo", 2]
+ *
+ *  if <tt>range.begin</tt> is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-2..2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  If the array length is less than <tt>range.begin</tt>,
+ *  assigns +object+ at offset <tt>range.begin</tt>, and ignores +length+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[6..50] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *  If <tt>range.end</tt> is zero, shifts elements at and following offset +start+
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..0] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *
+ *  If <tt>range.end</tt> is negative, assigns +object+ at offset +start+,
+ *  retains <tt>range.end.abs -1</tt> elements past that, and removes those beyond:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-1] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", 2]
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-3] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *    a = [:foo, 'bar', 2]
+ *
+ *  If <tt>range.end</tt> is too large for the existing array,
+ *  replaces array elements, but does not extend the array with +nil+ values:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..5] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
  */
 
 static VALUE
@@ -1653,43 +2596,60 @@ rb_ary_aset(int argc, VALUE *argv, VALUE ary)
 {
     long offset, beg, len;
 
+    rb_check_arity(argc, 2, 3);
+    rb_ary_modify_check(ary);
     if (argc == 3) {
-	rb_ary_modify_check(ary);
-	beg = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-	rb_ary_splice(ary, beg, len, argv[2]);
-	return argv[2];
+        beg = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_aset_by_rb_ary_splice(ary, beg, len, argv[2]);
     }
-    rb_check_arity(argc, 2, 2);
-    rb_ary_modify_check(ary);
     if (FIXNUM_P(argv[0])) {
-	offset = FIX2LONG(argv[0]);
-	goto fixnum;
+        offset = FIX2LONG(argv[0]);
+        return ary_aset_by_rb_ary_store(ary, offset, argv[1]);
     }
     if (rb_range_beg_len(argv[0], &beg, &len, RARRAY_LEN(ary), 1)) {
-	/* check if idx is Range */
-	rb_ary_splice(ary, beg, len, argv[1]);
-	return argv[1];
+        /* check if idx is Range */
+        return ary_aset_by_rb_ary_splice(ary, beg, len, argv[1]);
     }
 
     offset = NUM2LONG(argv[0]);
-fixnum:
-    rb_ary_store(ary, offset, argv[1]);
-    return argv[1];
+    return ary_aset_by_rb_ary_store(ary, offset, argv[1]);
 }
 
 /*
  *  call-seq:
- *     ary.insert(index, obj...)  -> ary
+ *    array.insert(index, *objects) -> self
+ *
+ *  Inserts given +objects+ before or after the element at \Integer index +offset+;
+ *  returns +self+.
  *
- *  Inserts the given values before the element with the given +index+.
+ *  When +index+ is non-negative, inserts all given +objects+
+ *  before the element at offset +index+:
  *
- *  Negative indices count backwards from the end of the array, where +-1+ is
- *  the last element.
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(1, :bat, :bam) # => [:foo, :bat, :bam, "bar", 2]
+ *
+ *  Extends the array if +index+ is beyond the array (<tt>index >= self.size</tt>):
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(5, :bat, :bam)
+ *    a # => [:foo, "bar", 2, nil, nil, :bat, :bam]
+ *
+ *  Does nothing if no objects given:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(1)
+ *    a.insert(50)
+ *    a.insert(-50)
+ *    a # => [:foo, "bar", 2]
+ *
+ *  When +index+ is negative, inserts all given +objects+
+ *  _after_ the element at offset <tt>index+self.size</tt>:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(-2, :bat, :bam)
+ *    a # => [:foo, "bar", :bat, :bam, 2]
  *
- *     a = %w{ a b c d }
- *     a.insert(2, 99)         #=> ["a", "b", 99, "c", "d"]
- *     a.insert(-2, 1, 2, 3)   #=> ["a", "b", 99, "c", 1, 2, 3, "d"]
  */
 
 static VALUE
@@ -1699,15 +2659,20 @@ rb_ary_insert(int argc, VALUE *argv, VALUE ary)
 
     rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
     rb_ary_modify_check(ary);
-    if (argc == 1) return ary;
     pos = NUM2LONG(argv[0]);
+    if (argc == 1) return ary;
     if (pos == -1) {
-	pos = RARRAY_LEN(ary);
+        pos = RARRAY_LEN(ary);
     }
-    if (pos < 0) {
-	pos++;
+    else if (pos < 0) {
+        long minpos = -RARRAY_LEN(ary) - 1;
+        if (pos < minpos) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     pos, minpos);
+        }
+        pos++;
     }
-    rb_ary_splice(ary, pos, 0, rb_ary_new4(argc - 1, argv + 1));
+    rb_ary_splice(ary, pos, 0, argv + 1, argc - 1);
     return ary;
 }
 
@@ -1722,51 +2687,104 @@ ary_enum_length(VALUE ary, VALUE args, VALUE eobj)
 
 /*
  *  call-seq:
- *     ary.each { |item| block }  -> ary
- *     ary.each                   -> Enumerator
+ *    array.each {|element| ... } -> self
+ *    array.each -> Enumerator
+ *
+ *  Iterates over array elements.
+ *
+ *  When a block given, passes each successive array element to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Symbol foo
+ *    String bar
+ *    Integer 2
+ *
+ *  Allows the array to be modified during iteration:
  *
- *  Calls the given block once for each element in +self+, passing that element
- *  as a parameter.
+ *    a = [:foo, 'bar', 2]
+ *    a.each {|element| puts element; a.clear if element.to_s.start_with?('b') }
  *
- *  An Enumerator is returned if no block is given.
+ *  Output:
  *
- *     a = [ "a", "b", "c" ]
- *     a.each {|x| print x, " -- " }
+ *    foo
+ *    bar
  *
- *  produces:
+ *  When no block given, returns a new \Enumerator:
+ *    a = [:foo, 'bar', 2]
  *
- *     a -- b -- c --
+ *    e = a.each
+ *    e # => #<Enumerator: [:foo, "bar", 2]:each>
+ *    a1 = e.each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Symbol foo
+ *    String bar
+ *    Integer 2
+ *
+ *  Related: #each_index, #reverse_each.
  */
 
 VALUE
-rb_ary_each(VALUE array)
+rb_ary_each(VALUE ary)
 {
     long i;
-    volatile VALUE ary = array;
-
+    ary_verify(ary);
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_yield(RARRAY_AREF(ary, i));
+        rb_yield(RARRAY_AREF(ary, i));
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.each_index { |index| block }  -> ary
- *     ary.each_index                    -> Enumerator
+ *    array.each_index {|index| ... } -> self
+ *    array.each_index -> Enumerator
+ *
+ *  Iterates over array indexes.
+ *
+ *  When a block given, passes each successive array index to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index|  puts "#{index} #{a[index]}" }
+ *
+ *  Output:
  *
- *  Same as Array#each, but passes the +index+ of the element instead of the
- *  element itself.
+ *    0 foo
+ *    1 bar
+ *    2 2
  *
- *  An Enumerator is returned if no block is given.
+ *  Allows the array to be modified during iteration:
  *
- *     a = [ "a", "b", "c" ]
- *     a.each_index {|x| print x, " -- " }
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index| puts index; a.clear if index > 0 }
  *
- *  produces:
+ *  Output:
  *
- *     0 -- 1 -- 2 --
+ *    0
+ *    1
+ *
+ *  When no block given, returns a new \Enumerator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    e = a.each_index
+ *    e # => #<Enumerator: [:foo, "bar", 2]:each_index>
+ *    a1 = e.each {|index|  puts "#{index} #{a[index]}"}
+ *
+ *  Output:
+ *
+ *    0 foo
+ *    1 bar
+ *    2 2
+ *
+ *  Related: #each, #reverse_each.
  */
 
 static VALUE
@@ -1776,24 +2794,54 @@ rb_ary_each_index(VALUE ary)
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_yield(LONG2NUM(i));
+        rb_yield(LONG2NUM(i));
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.reverse_each { |item| block }  -> ary
- *     ary.reverse_each                   -> Enumerator
+ *    array.reverse_each {|element| ... } -> self
+ *    array.reverse_each -> Enumerator
+ *
+ *  Iterates backwards over array elements.
+ *
+ *  When a block given, passes, in reverse order, each element to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.reverse_each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Integer 2
+ *    String bar
+ *    Symbol foo
+ *
+ *  Allows the array to be modified during iteration:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.reverse_each {|element| puts element; a.clear if element.to_s.start_with?('b') }
+ *
+ *  Output:
+ *
+ *    2
+ *    bar
+ *
+ *  When no block given, returns a new \Enumerator:
  *
- *  Same as Array#each, but traverses +self+ in reverse order.
+ *    a = [:foo, 'bar', 2]
+ *    e = a.reverse_each
+ *    e # => #<Enumerator: [:foo, "bar", 2]:reverse_each>
+ *    a1 = e.each {|element|  puts "#{element.class} #{element}" }
  *
- *     a = [ "a", "b", "c" ]
- *     a.reverse_each {|x| print x, " " }
+ *  Output:
  *
- *  produces:
+ *    Integer 2
+ *    String bar
+ *    Symbol foo
  *
- *     c b a
+ *  Related: #each, #each_index.
  */
 
 static VALUE
@@ -1804,22 +2852,21 @@ rb_ary_reverse_each(VALUE ary)
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     len = RARRAY_LEN(ary);
     while (len--) {
-	rb_yield(RARRAY_AREF(ary, len));
-	if (RARRAY_LEN(ary) < len) {
-	    len = RARRAY_LEN(ary);
-	}
+        long nlen;
+        rb_yield(RARRAY_AREF(ary, len));
+        nlen = RARRAY_LEN(ary);
+        if (nlen < len) {
+            len = nlen;
+        }
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.length -> int
- *
- *  Returns the number of elements in +self+. May be zero.
+ *    array.length -> an_integer
  *
- *     [ 1, 2, 3, 4, 5 ].length   #=> 5
- *     [].length                  #=> 0
+ *  Returns the count of elements in +self+.
  */
 
 static VALUE
@@ -1831,19 +2878,16 @@ rb_ary_length(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.empty?   -> true or false
+ *    array.empty?  -> true or false
  *
- *  Returns +true+ if +self+ contains no elements.
- *
- *     [].empty?   #=> true
+ *  Returns +true+ if the count of elements in +self+ is zero,
+ *  +false+ otherwise.
  */
 
 static VALUE
 rb_ary_empty_p(VALUE ary)
 {
-    if (RARRAY_LEN(ary) == 0)
-	return Qtrue;
-    return Qfalse;
+    return RBOOL(RARRAY_LEN(ary) == 0);
 }
 
 VALUE
@@ -1851,15 +2895,18 @@ rb_ary_dup(VALUE ary)
 {
     long len = RARRAY_LEN(ary);
     VALUE dup = rb_ary_new2(len);
-    ary_memcpy(dup, 0, len, RARRAY_RAWPTR(ary));
+    ary_memcpy(dup, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary));
     ARY_SET_LEN(dup, len);
+
+    ary_verify(ary);
+    ary_verify(dup);
     return dup;
 }
 
 VALUE
 rb_ary_resurrect(VALUE ary)
 {
-    return rb_ary_new4(RARRAY_LEN(ary), RARRAY_RAWPTR(ary));
+    return ary_make_partial(ary, rb_cArray, 0, RARRAY_LEN(ary));
 }
 
 extern VALUE rb_output_fs;
@@ -1876,15 +2923,15 @@ recursive_join(VALUE obj, VALUE argp, int recur)
     int *first = (int *)arg[3];
 
     if (recur) {
-	rb_raise(rb_eArgError, "recursive array join");
+        rb_raise(rb_eArgError, "recursive array join");
     }
     else {
-	ary_join_1(obj, ary, sep, 0, result, first);
+        ary_join_1(obj, ary, sep, 0, result, first);
     }
     return Qnil;
 }
 
-static void
+static long
 ary_join_0(VALUE ary, VALUE sep, long max, VALUE result)
 {
     long i;
@@ -1892,11 +2939,40 @@ ary_join_0(VALUE ary, VALUE sep, long max, VALUE result)
 
     if (max > 0) rb_enc_copy(result, RARRAY_AREF(ary, 0));
     for (i=0; i<max; i++) {
-	val = RARRAY_AREF(ary, i);
-	if (i > 0 && !NIL_P(sep))
-	    rb_str_buf_append(result, sep);
-	rb_str_buf_append(result, val);
-	if (OBJ_TAINTED(val)) OBJ_TAINT(result);
+        val = RARRAY_AREF(ary, i);
+        if (!RB_TYPE_P(val, T_STRING)) break;
+        if (i > 0 && !NIL_P(sep))
+            rb_str_buf_append(result, sep);
+        rb_str_buf_append(result, val);
+    }
+    return i;
+}
+
+static void
+ary_join_1_str(VALUE dst, VALUE src, int *first)
+{
+    rb_str_buf_append(dst, src);
+    if (*first) {
+        rb_enc_copy(dst, src);
+        *first = FALSE;
+    }
+}
+
+static void
+ary_join_1_ary(VALUE obj, VALUE ary, VALUE sep, VALUE result, VALUE val, int *first)
+{
+    if (val == ary) {
+        rb_raise(rb_eArgError, "recursive array join");
+    }
+    else {
+        VALUE args[4];
+
+        *first = FALSE;
+        args[0] = val;
+        args[1] = sep;
+        args[2] = result;
+        args[3] = (VALUE)first;
+        rb_exec_recursive(recursive_join, obj, (VALUE)args);
     }
 }
 
@@ -1906,50 +2982,25 @@ ary_join_1(VALUE obj, VALUE ary, VALUE sep, long i, VALUE result, int *first)
     VALUE val, tmp;
 
     for (; i<RARRAY_LEN(ary); i++) {
-	if (i > 0 && !NIL_P(sep))
-	    rb_str_buf_append(result, sep);
-
-	val = RARRAY_AREF(ary, i);
-	if (RB_TYPE_P(val, T_STRING)) {
-	  str_join:
-	    rb_str_buf_append(result, val);
-	    *first = FALSE;
-	}
-	else if (RB_TYPE_P(val, T_ARRAY)) {
-	    obj = val;
-	  ary_join:
-	    if (val == ary) {
-		rb_raise(rb_eArgError, "recursive array join");
-	    }
-	    else {
-		VALUE args[4];
-
-		args[0] = val;
-		args[1] = sep;
-		args[2] = result;
-		args[3] = (VALUE)first;
-		rb_exec_recursive(recursive_join, obj, (VALUE)args);
-	    }
-	}
-	else {
-	    tmp = rb_check_string_type(val);
-	    if (!NIL_P(tmp)) {
-		val = tmp;
-		goto str_join;
-	    }
-	    tmp = rb_check_convert_type(val, T_ARRAY, "Array", "to_ary");
-	    if (!NIL_P(tmp)) {
-		obj = val;
-		val = tmp;
-		goto ary_join;
-	    }
-	    val = rb_obj_as_string(val);
-	    if (*first) {
-		rb_enc_copy(result, val);
-		*first = FALSE;
-	    }
-	    goto str_join;
-	}
+        if (i > 0 && !NIL_P(sep))
+            rb_str_buf_append(result, sep);
+
+        val = RARRAY_AREF(ary, i);
+        if (RB_TYPE_P(val, T_STRING)) {
+            ary_join_1_str(result, val, first);
+        }
+        else if (RB_TYPE_P(val, T_ARRAY)) {
+            ary_join_1_ary(val, ary, sep, result, val, first);
+        }
+        else if (!NIL_P(tmp = rb_check_string_type(val))) {
+            ary_join_1_str(result, tmp, first);
+        }
+        else if (!NIL_P(tmp = rb_check_array_type(val))) {
+            ary_join_1_ary(val, ary, sep, result, tmp, first);
+        }
+        else {
+            ary_join_1_str(result, rb_obj_as_string(val), first);
+        }
     }
 }
 
@@ -1957,36 +3008,36 @@ VALUE
 rb_ary_join(VALUE ary, VALUE sep)
 {
     long len = 1, i;
-    int taint = FALSE;
     VALUE val, tmp, result;
 
     if (RARRAY_LEN(ary) == 0) return rb_usascii_str_new(0, 0);
-    if (OBJ_TAINTED(ary)) taint = TRUE;
 
     if (!NIL_P(sep)) {
-	StringValue(sep);
-	len += RSTRING_LEN(sep) * (RARRAY_LEN(ary) - 1);
+        StringValue(sep);
+        len += RSTRING_LEN(sep) * (RARRAY_LEN(ary) - 1);
     }
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	val = RARRAY_AREF(ary, i);
-	tmp = rb_check_string_type(val);
-
-	if (NIL_P(tmp) || tmp != val) {
-	    int first;
-	    result = rb_str_buf_new(len + (RARRAY_LEN(ary)-i)*10);
-	    rb_enc_associate(result, rb_usascii_encoding());
-	    if (taint) OBJ_TAINT(result);
-	    ary_join_0(ary, sep, i, result);
-	    first = i == 0;
-	    ary_join_1(ary, ary, sep, i, result, &first);
-	    return result;
-	}
+        val = RARRAY_AREF(ary, i);
+        tmp = rb_check_string_type(val);
+
+        if (NIL_P(tmp) || tmp != val) {
+            int first;
+            long n = RARRAY_LEN(ary);
+            if (i > n) i = n;
+            result = rb_str_buf_new(len + (n-i)*10);
+            rb_enc_associate(result, rb_usascii_encoding());
+            i = ary_join_0(ary, sep, i, result);
+            first = i == 0;
+            ary_join_1(ary, ary, sep, i, result, &first);
+            return result;
+        }
 
-	len += RSTRING_LEN(tmp);
+        len += RSTRING_LEN(tmp);
     }
 
-    result = rb_str_buf_new(len);
-    if (taint) OBJ_TAINT(result);
+    result = rb_str_new(0, len);
+    rb_str_set_len(result, 0);
+
     ary_join_0(ary, sep, RARRAY_LEN(ary), result);
 
     return result;
@@ -1994,24 +3045,43 @@ rb_ary_join(VALUE ary, VALUE sep)
 
 /*
  *  call-seq:
- *     ary.join(separator=$,)    -> str
+ *    array.join ->new_string
+ *    array.join(separator = $,) -> new_string
+ *
+ *  Returns the new \String formed by joining the array elements after conversion.
+ *  For each element +element+:
+ *
+ *  - Uses <tt>element.to_s</tt> if +element+ is not a <tt>kind_of?(Array)</tt>.
+ *  - Uses recursive <tt>element.join(separator)</tt> if +element+ is a <tt>kind_of?(Array)</tt>.
  *
- *  Returns a string created by converting each element of the array to
- *  a string, separated by the given +separator+.
- *  If the +separator+ is +nil+, it uses current $,.
- *  If both the +separator+ and $, are nil, it uses empty string.
+ *  With no argument, joins using the output field separator, <tt>$,</tt>:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    $, # => nil
+ *    a.join # => "foobar2"
+ *
+ *  With \string argument +separator+, joins using that separator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.join("\n") # => "foo\nbar\n2"
+ *
+ *  Joins recursively for nested Arrays:
+ *
+ *   a = [:foo, [:bar, [:baz, :bat]]]
+ *   a.join # => "foobarbazbat"
  *
- *     [ "a", "b", "c" ].join        #=> "abc"
- *     [ "a", "b", "c" ].join("-")   #=> "a-b-c"
  */
-
 static VALUE
 rb_ary_join_m(int argc, VALUE *argv, VALUE ary)
 {
     VALUE sep;
 
-    rb_scan_args(argc, argv, "01", &sep);
-    if (NIL_P(sep)) sep = rb_output_fs;
+    if (rb_check_arity(argc, 0, 1) == 0 || NIL_P(sep = argv[0])) {
+        sep = rb_output_fs;
+        if (!NIL_P(sep)) {
+            rb_category_warn(RB_WARN_CATEGORY_DEPRECATED, "$, is set to non-nil value");
+        }
+    }
 
     return rb_ary_join(ary, sep);
 }
@@ -2019,32 +3089,32 @@ rb_ary_join_m(int argc, VALUE *argv, VALUE ary)
 static VALUE
 inspect_ary(VALUE ary, VALUE dummy, int recur)
 {
-    int tainted = OBJ_TAINTED(ary);
     long i;
     VALUE s, str;
 
     if (recur) return rb_usascii_str_new_cstr("[...]");
     str = rb_str_buf_new2("[");
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	s = rb_inspect(RARRAY_AREF(ary, i));
-	if (OBJ_TAINTED(s)) tainted = TRUE;
-	if (i > 0) rb_str_buf_cat2(str, ", ");
-	else rb_enc_copy(str, s);
-	rb_str_buf_append(str, s);
+        s = rb_inspect(RARRAY_AREF(ary, i));
+        if (i > 0) rb_str_buf_cat2(str, ", ");
+        else rb_enc_copy(str, s);
+        rb_str_buf_append(str, s);
     }
     rb_str_buf_cat2(str, "]");
-    if (tainted) OBJ_TAINT(str);
     return str;
 }
 
 /*
  *  call-seq:
- *     ary.inspect  -> string
- *     ary.to_s     -> string
+ *    array.inspect -> new_string
  *
- *  Creates a string representation of +self+.
+ *  Returns the new \String formed by calling method <tt>#inspect</tt>
+ *  on each array element:
  *
- *     [ "a", "b", "c" ].to_s     #=> "[\"a\", \"b\", \"c\"]"
+ *    a = [:foo, 'bar', 2]
+ *    a.inspect # => "[:foo, \"bar\", 2]"
+ *
+ *  Array#to_s is an alias for Array#inspect.
  */
 
 static VALUE
@@ -2062,27 +3132,88 @@ rb_ary_to_s(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.to_a     -> ary
+ *    to_a -> self or new_array
  *
- *  Returns +self+.
+ *  When +self+ is an instance of \Array, returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.to_a # => [:foo, "bar", 2]
+ *
+ *  Otherwise, returns a new \Array containing the elements of +self+:
+ *
+ *    class MyArray < Array; end
+ *    a = MyArray.new(['foo', 'bar', 'two'])
+ *    a.instance_of?(Array) # => false
+ *    a.kind_of?(Array) # => true
+ *    a1 = a.to_a
+ *    a1 # => ["foo", "bar", "two"]
+ *    a1.class # => Array # Not MyArray
  *
- *  If called on a subclass of Array, converts the receiver to an Array object.
  */
 
 static VALUE
 rb_ary_to_a(VALUE ary)
 {
     if (rb_obj_class(ary) != rb_cArray) {
-	VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
-	rb_ary_replace(dup, ary);
-	return dup;
+        VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
+        rb_ary_replace(dup, ary);
+        return dup;
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.to_ary -> ary
+ *    array.to_h -> new_hash
+ *    array.to_h {|item| ... } -> new_hash
+ *
+ *  Returns a new \Hash formed from +self+.
+ *
+ *  When a block is given, calls the block with each array element;
+ *  the block must return a 2-element \Array whose two elements
+ *  form a key-value pair in the returned \Hash:
+ *
+ *    a = ['foo', :bar, 1, [2, 3], {baz: 4}]
+ *    h = a.to_h {|item| [item, item] }
+ *    h # => {"foo"=>"foo", :bar=>:bar, 1=>1, [2, 3]=>[2, 3], {:baz=>4}=>{:baz=>4}}
+ *
+ *  When no block is given, +self+ must be an \Array of 2-element sub-arrays,
+ *  each sub-array is formed into a key-value pair in the new \Hash:
+ *
+ *    [].to_h # => {}
+ *    a = [['foo', 'zero'], ['bar', 'one'], ['baz', 'two']]
+ *    h = a.to_h
+ *    h # => {"foo"=>"zero", "bar"=>"one", "baz"=>"two"}
+ *
+ */
+
+static VALUE
+rb_ary_to_h(VALUE ary)
+{
+    long i;
+    VALUE hash = rb_hash_new_with_size(RARRAY_LEN(ary));
+    int block_given = rb_block_given_p();
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        const VALUE e = rb_ary_elt(ary, i);
+        const VALUE elt = block_given ? rb_yield_force_blockarg(e) : e;
+        const VALUE key_value_pair = rb_check_array_type(elt);
+        if (NIL_P(key_value_pair)) {
+            rb_raise(rb_eTypeError, "wrong element type %"PRIsVALUE" at %ld (expected array)",
+                     rb_obj_class(elt), i);
+        }
+        if (RARRAY_LEN(key_value_pair) != 2) {
+            rb_raise(rb_eArgError, "wrong array length at %ld (expected 2, was %ld)",
+                i, RARRAY_LEN(key_value_pair));
+        }
+        rb_hash_aset(hash, RARRAY_AREF(key_value_pair, 0), RARRAY_AREF(key_value_pair, 1));
+    }
+    return hash;
+}
+
+/*
+ *  call-seq:
+ *    array.to_ary -> self
  *
  *  Returns +self+.
  */
@@ -2097,35 +3228,37 @@ static void
 ary_reverse(VALUE *p1, VALUE *p2)
 {
     while (p1 < p2) {
-	VALUE tmp = *p1;
-	*p1++ = *p2;
-	*p2-- = tmp;
+        VALUE tmp = *p1;
+        *p1++ = *p2;
+        *p2-- = tmp;
     }
 }
 
 VALUE
 rb_ary_reverse(VALUE ary)
 {
-    VALUE *p1, *p2;
+    VALUE *p2;
+    long len = RARRAY_LEN(ary);
 
     rb_ary_modify(ary);
-    if (RARRAY_LEN(ary) > 1) {
-	p1 = RARRAY_PTR(ary);
-	p2 = p1 + RARRAY_LEN(ary) - 1;	/* points last item */
-	ary_reverse(p1, p2);
+    if (len > 1) {
+        RARRAY_PTR_USE_TRANSIENT(ary, p1, {
+            p2 = p1 + len - 1;	/* points last item */
+            ary_reverse(p1, p2);
+        }); /* WB: no new reference */
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.reverse!   -> ary
+ *    array.reverse! -> self
+ *
+ *  Reverses +self+ in place:
  *
- *  Reverses +self+ in place.
+ *    a = ['foo', 'bar', 'two']
+ *    a.reverse! # => ["two", "bar", "foo"]
  *
- *     a = [ "a", "b", "c" ]
- *     a.reverse!       #=> ["c", "b", "a"]
- *     a                #=> ["c", "b", "a"]
  */
 
 static VALUE
@@ -2136,12 +3269,14 @@ rb_ary_reverse_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.reverse    -> new_ary
+ *    array.reverse -> new_array
  *
- *  Returns a new array containing +self+'s elements in reverse order.
+ *  Returns a new \Array with the elements of +self+ in reverse order:
+ *
+ *    a = ['foo', 'bar', 'two']
+ *    a1 = a.reverse
+ *    a1 # => ["two", "bar", "foo"]
  *
- *     [ "a", "b", "c" ].reverse   #=> ["c", "b", "a"]
- *     [ 1 ].reverse               #=> [1]
  */
 
 static VALUE
@@ -2151,9 +3286,9 @@ rb_ary_reverse_m(VALUE ary)
     VALUE dup = rb_ary_new2(len);
 
     if (len > 0) {
-	const VALUE *p1 = RARRAY_RAWPTR(ary);
-	VALUE *p2 = (VALUE *)RARRAY_RAWPTR(dup) + len - 1;
-	do *p2-- = *p1++; while (--len > 0);
+        const VALUE *p1 = RARRAY_CONST_PTR_TRANSIENT(ary);
+        VALUE *p2 = (VALUE *)RARRAY_CONST_PTR_TRANSIENT(dup) + len - 1;
+        do *p2-- = *p1++; while (--len > 0);
     }
     ARY_SET_LEN(dup, RARRAY_LEN(ary));
     return dup;
@@ -2165,73 +3300,143 @@ rotate_count(long cnt, long len)
     return (cnt < 0) ? (len - (~cnt % len) - 1) : (cnt % len);
 }
 
+static void
+ary_rotate_ptr(VALUE *ptr, long len, long cnt)
+{
+    if (cnt == 1) {
+        VALUE tmp = *ptr;
+        memmove(ptr, ptr + 1, sizeof(VALUE)*(len - 1));
+        *(ptr + len - 1) = tmp;
+    }
+    else if (cnt == len - 1) {
+        VALUE tmp = *(ptr + len - 1);
+        memmove(ptr + 1, ptr, sizeof(VALUE)*(len - 1));
+        *ptr = tmp;
+    }
+    else {
+        --len;
+        if (cnt < len) ary_reverse(ptr + cnt, ptr + len);
+        if (--cnt > 0) ary_reverse(ptr, ptr + cnt);
+        if (len > 0) ary_reverse(ptr, ptr + len);
+    }
+}
+
 VALUE
 rb_ary_rotate(VALUE ary, long cnt)
 {
     rb_ary_modify(ary);
 
     if (cnt != 0) {
-	VALUE *ptr = RARRAY_PTR(ary);
-	long len = RARRAY_LEN(ary);
-
-	if (len > 0 && (cnt = rotate_count(cnt, len)) > 0) {
-	    --len;
-	    if (cnt < len) ary_reverse(ptr + cnt, ptr + len);
-	    if (--cnt > 0) ary_reverse(ptr, ptr + cnt);
-	    if (len > 0) ary_reverse(ptr, ptr + len);
-	    return ary;
-	}
+        long len = RARRAY_LEN(ary);
+        if (len > 1 && (cnt = rotate_count(cnt, len)) > 0) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, ary_rotate_ptr(ptr, len, cnt));
+            return ary;
+        }
     }
-
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rotate!(count=1)   -> ary
+ *    array.rotate! -> self
+ *    array.rotate!(count) -> self
  *
- *  Rotates +self+ in place so that the element at +count+ comes first, and
- *  returns +self+.
+ *  Rotates +self+ in place by moving elements from one end to the other; returns +self+.
+ *
+ *  When no argument given, rotates the first element to the last position:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rotate! # => ["bar", 2, "bar", :foo]
+ *
+ *  When given a non-negative \Integer +count+,
+ *  rotates +count+ elements from the beginning to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(2)
+ *    a # => [2, :foo, "bar"]
  *
- *  If +count+ is negative then it rotates in the opposite direction, starting
- *  from the end of the array where +-1+ is the last element.
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(20)
+ *    a # => [2, :foo, "bar"]
+ *
+ *  If +count+ is zero, returns +self+ unmodified:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(0)
+ *    a # => [:foo, "bar", 2]
+ *
+ *  When given a negative Integer +count+, rotates in the opposite direction,
+ *  from end to beginning:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(-2)
+ *    a # => ["bar", 2, :foo]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(-5)
+ *    a # => ["bar", 2, :foo]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.rotate!        #=> ["b", "c", "d", "a"]
- *     a                #=> ["b", "c", "d", "a"]
- *     a.rotate!(2)     #=> ["d", "a", "b", "c"]
- *     a.rotate!(-3)    #=> ["a", "b", "c", "d"]
  */
 
 static VALUE
 rb_ary_rotate_bang(int argc, VALUE *argv, VALUE ary)
 {
-    long n = 1;
-
-    switch (argc) {
-      case 1: n = NUM2LONG(argv[0]);
-      case 0: break;
-      default: rb_scan_args(argc, argv, "01", NULL);
-    }
+    long n = (rb_check_arity(argc, 0, 1) ? NUM2LONG(argv[0]) : 1);
     rb_ary_rotate(ary, n);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.rotate(count=1)    -> new_ary
+ *    array.rotate -> new_array
+ *    array.rotate(count) -> new_array
+ *
+ *  Returns a new \Array formed from +self+ with elements
+ *  rotated from one end to the other.
+ *
+ *  When no argument given, returns a new \Array that is like +self+,
+ *  except that the first element has been rotated to the last position:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a1 = a.rotate
+ *    a1 # => ["bar", 2, "bar", :foo]
+ *
+ *  When given a non-negative \Integer +count+,
+ *  returns a new \Array with +count+ elements rotated from the beginning to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(2)
+ *    a1 # => [2, :foo, "bar"]
+ *
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
  *
- *  Returns a new array by rotating +self+ so that the element at +count+ is
- *  the first element of the new array.
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(20)
+ *    a1 # => [2, :foo, "bar"]
  *
- *  If +count+ is negative then it rotates in the opposite direction, starting
- *  from the end of +self+ where +-1+ is the last element.
+ *  If +count+ is zero, returns a copy of +self+, unmodified:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(0)
+ *    a1 # => [:foo, "bar", 2]
+ *
+ *  When given a negative \Integer +count+, rotates in the opposite direction,
+ *  from end to beginning:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(-2)
+ *    a1 # => ["bar", 2, :foo]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(-5)
+ *    a1 # => ["bar", 2, :foo]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.rotate         #=> ["b", "c", "d", "a"]
- *     a                #=> ["a", "b", "c", "d"]
- *     a.rotate(2)      #=> ["c", "d", "a", "b"]
- *     a.rotate(-3)     #=> ["b", "c", "d", "a"]
  */
 
 static VALUE
@@ -2239,22 +3444,17 @@ rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
 {
     VALUE rotated;
     const VALUE *ptr;
-    long len, cnt = 1;
-
-    switch (argc) {
-      case 1: cnt = NUM2LONG(argv[0]);
-      case 0: break;
-      default: rb_scan_args(argc, argv, "01", NULL);
-    }
+    long len;
+    long cnt = (rb_check_arity(argc, 0, 1) ? NUM2LONG(argv[0]) : 1);
 
     len = RARRAY_LEN(ary);
     rotated = rb_ary_new2(len);
     if (len > 0) {
-	cnt = rotate_count(cnt, len);
-	ptr = RARRAY_RAWPTR(ary);
-	len -= cnt;
-	ary_memcpy(rotated, 0, len, ptr + cnt);
-	ary_memcpy(rotated, len, cnt, ptr);
+        cnt = rotate_count(cnt, len);
+        ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        len -= cnt;
+        ary_memcpy(rotated, 0, len, ptr + cnt);
+        ary_memcpy(rotated, len, cnt, ptr);
     }
     ARY_SET_LEN(rotated, RARRAY_LEN(ary));
     return rotated;
@@ -2262,46 +3462,41 @@ rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
 
 struct ary_sort_data {
     VALUE ary;
-    int opt_methods;
-    int opt_inited;
-};
-
-enum {
-    sort_opt_Fixnum,
-    sort_opt_String,
-    sort_optimizable_count
+    VALUE receiver;
 };
 
-#define STRING_P(s) (RB_TYPE_P((s), T_STRING) && CLASS_OF(s) == rb_cString)
-
-#define SORT_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(sort_opt_,type))
-#define SORT_OPTIMIZABLE(data, type) \
-    (((data)->opt_inited & SORT_OPTIMIZABLE_BIT(type)) ? \
-     ((data)->opt_methods & SORT_OPTIMIZABLE_BIT(type)) : \
-     (((data)->opt_inited |= SORT_OPTIMIZABLE_BIT(type)), \
-      rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \
-      ((data)->opt_methods |= SORT_OPTIMIZABLE_BIT(type))))
-
 static VALUE
 sort_reentered(VALUE ary)
 {
     if (RBASIC(ary)->klass) {
-	rb_raise(rb_eRuntimeError, "sort reentered");
+        rb_raise(rb_eRuntimeError, "sort reentered");
     }
     return Qnil;
 }
 
+static void
+sort_returned(struct ary_sort_data *data)
+{
+    if (rb_obj_frozen_p(data->receiver)) {
+        rb_raise(rb_eFrozenError, "array frozen during sort");
+    }
+    sort_reentered(data->ary);
+}
+
 static int
 sort_1(const void *ap, const void *bp, void *dummy)
 {
     struct ary_sort_data *data = dummy;
     VALUE retval = sort_reentered(data->ary);
     VALUE a = *(const VALUE *)ap, b = *(const VALUE *)bp;
+    VALUE args[2];
     int n;
 
-    retval = rb_yield_values(2, a, b);
+    args[0] = a;
+    args[1] = b;
+    retval = rb_yield_values2(2, args);
     n = rb_cmpint(retval, a, b);
-    sort_reentered(data->ary);
+    sort_returned(data);
     return n;
 }
 
@@ -2313,41 +3508,64 @@ sort_2(const void *ap, const void *bp, void *dummy)
     VALUE a = *(const VALUE *)ap, b = *(const VALUE *)bp;
     int n;
 
-    if (FIXNUM_P(a) && FIXNUM_P(b) && SORT_OPTIMIZABLE(data, Fixnum)) {
-	if ((long)a > (long)b) return 1;
-	if ((long)a < (long)b) return -1;
-	return 0;
+    if (FIXNUM_P(a) && FIXNUM_P(b) && CMP_OPTIMIZABLE(INTEGER)) {
+        if ((long)a > (long)b) return 1;
+        if ((long)a < (long)b) return -1;
+        return 0;
+    }
+    if (STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(STRING)) {
+        return rb_str_cmp(a, b);
     }
-    if (STRING_P(a) && STRING_P(b) && SORT_OPTIMIZABLE(data, String)) {
-	return rb_str_cmp(a, b);
+    if (RB_FLOAT_TYPE_P(a) && CMP_OPTIMIZABLE(FLOAT)) {
+        return rb_float_cmp(a, b);
     }
 
-    retval = rb_funcall(a, id_cmp, 1, b);
+    retval = rb_funcallv(a, id_cmp, 1, &b);
     n = rb_cmpint(retval, a, b);
-    sort_reentered(data->ary);
+    sort_returned(data);
 
     return n;
 }
 
 /*
  *  call-seq:
- *     ary.sort!                   -> ary
- *     ary.sort! { |a, b| block }  -> ary
+ *    array.sort! -> self
+ *    array.sort! {|a, b| ... } -> self
  *
- *  Sorts +self+ in place.
+ *  Returns +self+ with its elements sorted in place.
  *
- *  Comparisons for the sort will be done using the <code><=></code> operator
- *  or using an optional code block.
+ *  With no block, compares elements using operator <tt><=></tt>
+ *  (see Comparable):
  *
- *  The block must implement a comparison between +a+ and +b+, and return
- *  +-1+, when +a+ follows +b+, +0+ when +a+ and +b+ are equivalent, or ++1+
- *  if +b+ follows +a+.
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort!
+ *    a # => ["a", "b", "c", "d", "e"]
  *
- *  See also Enumerable#sort_by.
+ *  With a block, calls the block with each element pair;
+ *  for each element pair +a+ and +b+, the block should return an integer:
+ *
+ *  - Negative when +b+ is to follow +a+.
+ *  - Zero when +a+ and +b+ are equivalent.
+ *  - Positive when +a+ is to follow +b+.
+ *
+ *  Example:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort! {|a, b| a <=> b }
+ *    a # => ["a", "b", "c", "d", "e"]
+ *    a.sort! {|a, b| b <=> a }
+ *    a # => ["e", "d", "c", "b", "a"]
+ *
+ *  When the block returns zero, the order for +a+ and +b+ is indeterminate,
+ *  and may be unstable:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort! {|a, b| 0 }
+ *    a # => ["d", "e", "c", "a", "b"]
  *
- *     a = [ "d", "a", "e", "c", "b" ]
- *     a.sort!                    #=> ["a", "b", "c", "d", "e"]
- *     a.sort! { |x,y| y <=> x }  #=> ["e", "d", "c", "b", "a"]
  */
 
 VALUE
@@ -2356,25 +3574,23 @@ rb_ary_sort_bang(VALUE ary)
     rb_ary_modify(ary);
     assert(!ARY_SHARED_P(ary));
     if (RARRAY_LEN(ary) > 1) {
-	VALUE tmp = ary_make_substitution(ary); /* only ary refers tmp */
-	struct ary_sort_data data;
-	long len = RARRAY_LEN(ary);
-
-	RBASIC_CLEAR_CLASS(tmp);
-	data.ary = tmp;
-	data.opt_methods = 0;
-	data.opt_inited = 0;
-	RARRAY_PTR_USE(tmp, ptr, {
-	    ruby_qsort(ptr, len, sizeof(VALUE),
-		       rb_block_given_p()?sort_1:sort_2, &data);
-	}); /* WB: no new reference */
-	rb_ary_modify(ary);
+        VALUE tmp = ary_make_substitution(ary); /* only ary refers tmp */
+        struct ary_sort_data data;
+        long len = RARRAY_LEN(ary);
+        RBASIC_CLEAR_CLASS(tmp);
+        data.ary = tmp;
+        data.receiver = ary;
+        RARRAY_PTR_USE(tmp, ptr, {
+            ruby_qsort(ptr, len, sizeof(VALUE),
+                       rb_block_given_p()?sort_1:sort_2, &data);
+        }); /* WB: no new reference */
+        rb_ary_modify(ary);
         if (ARY_EMBED_P(tmp)) {
             if (ARY_SHARED_P(ary)) { /* ary might be destructively operated in the given block */
                 rb_ary_unshare(ary);
+                FL_SET_EMBED(ary);
             }
-            FL_SET_EMBED(ary);
-	    ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
+            ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
             ARY_SET_LEN(ary, ARY_EMBED_LEN(tmp));
         }
         else {
@@ -2392,44 +3608,65 @@ rb_ary_sort_bang(VALUE ary)
                     rb_ary_unshare(ary);
                 }
                 else {
-		    xfree((void *)ARY_HEAP_PTR(ary));
+                    ary_heap_free(ary);
                 }
-                ARY_SET_PTR(ary, RARRAY_RAWPTR(tmp));
+                ARY_SET_PTR(ary, ARY_HEAP_PTR(tmp));
                 ARY_SET_HEAP_LEN(ary, len);
-                ARY_SET_CAPA(ary, RARRAY_LEN(tmp));
+                ARY_SET_CAPA(ary, ARY_HEAP_LEN(tmp));
             }
             /* tmp was lost ownership for the ptr */
             FL_UNSET(tmp, FL_FREEZE);
             FL_SET_EMBED(tmp);
             ARY_SET_EMBED_LEN(tmp, 0);
             FL_SET(tmp, FL_FREEZE);
-	}
+        }
         /* tmp will be GC'ed. */
         RBASIC_SET_CLASS_RAW(tmp, rb_cArray); /* rb_cArray must be marked */
     }
+    ary_verify(ary);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.sort                   -> new_ary
- *     ary.sort { |a, b| block }  -> new_ary
+ *    array.sort -> new_array
+ *    array.sort {|a, b| ... } -> new_array
+ *
+ *  Returns a new \Array whose elements are those from +self+, sorted.
+ *
+ *  With no block, compares elements using operator <tt><=></tt>
+ *  (see Comparable):
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort
+ *    a1 # => ["a", "b", "c", "d", "e"]
  *
- *  Returns a new array created by sorting +self+.
+ *  With a block, calls the block with each element pair;
+ *  for each element pair +a+ and +b+, the block should return an integer:
  *
- *  Comparisons for the sort will be done using the <code><=></code> operator
- *  or using an optional code block.
+ *  - Negative when +b+ is to follow +a+.
+ *  - Zero when +a+ and +b+ are equivalent.
+ *  - Positive when +a+ is to follow +b+.
  *
- *  The block must implement a comparison between +a+ and +b+, and return
- *  +-1+, when +a+ follows +b+, +0+ when +a+ and +b+ are equivalent, or ++1+
- *  if +b+ follows +a+.
+ *  Example:
  *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort {|a, b| a <=> b }
+ *    a1 # => ["a", "b", "c", "d", "e"]
+ *    a2 = a.sort {|a, b| b <=> a }
+ *    a2 # => ["e", "d", "c", "b", "a"]
  *
- *  See also Enumerable#sort_by.
+ *  When the block returns zero, the order for +a+ and +b+ is indeterminate,
+ *  and may be unstable:
  *
- *     a = [ "d", "a", "e", "c", "b" ]
- *     a.sort                    #=> ["a", "b", "c", "d", "e"]
- *     a.sort { |x,y| y <=> x }  #=> ["e", "d", "c", "b", "a"]
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort {|a, b| 0 }
+ *    a1 # =>  ["c", "e", "b", "d", "a"]
+ *
+ *  Related: Enumerable#sort_by.
  */
 
 VALUE
@@ -2440,122 +3677,115 @@ rb_ary_sort(VALUE ary)
     return ary;
 }
 
+static VALUE rb_ary_bsearch_index(VALUE ary);
+
 /*
  *  call-seq:
- *     ary.bsearch {|x| block }  -> elem
- *
- *  By using binary search, finds a value from this array which meets
- *  the given condition in O(log n) where n is the size of the array.
- *
- *  You can use this method in two use cases: a find-minimum mode and
- *  a find-any mode.  In either case, the elements of the array must be
- *  monotone (or sorted) with respect to the block.
- *
- *  In find-minimum mode (this is a good choice for typical use case),
- *  the block must return true or false, and there must be an index i
- *  (0 <= i <= ary.size) so that:
- *
- *  - the block returns false for any element whose index is less than
- *    i, and
- *  - the block returns true for any element whose index is greater
- *    than or equal to i.
- *
- *  This method returns the i-th element.  If i is equal to ary.size,
- *  it returns nil.
- *
- *     ary = [0, 4, 7, 10, 12]
- *     ary.bsearch {|x| x >=   4 } #=> 4
- *     ary.bsearch {|x| x >=   6 } #=> 7
- *     ary.bsearch {|x| x >=  -1 } #=> 0
- *     ary.bsearch {|x| x >= 100 } #=> nil
- *
- *  In find-any mode (this behaves like libc's bsearch(3)), the block
- *  must return a number, and there must be two indices i and j
- *  (0 <= i <= j <= ary.size) so that:
- *
- *  - the block returns a positive number for ary[k] if 0 <= k < i,
- *  - the block returns zero for ary[k] if i <= k < j, and
- *  - the block returns a negative number for ary[k] if
- *    j <= k < ary.size.
- *
- *  Under this condition, this method returns any element whose index
- *  is within i...j.  If i is equal to j (i.e., there is no element
- *  that satisfies the block), this method returns nil.
- *
- *     ary = [0, 4, 7, 10, 12]
- *     # try to find v such that 4 <= v < 8
- *     ary.bsearch {|x| 1 - x / 4 } #=> 4 or 7
- *     # try to find v such that 8 <= v < 10
- *     ary.bsearch {|x| 4 - x / 2 } #=> nil
- *
- *  You must not mix the two modes at a time; the block must always
- *  return either true/false, or always return a number.  It is
- *  undefined which value is actually picked up at each iteration.
+ *    array.bsearch {|element| ... } -> object
+ *    array.bsearch -> new_enumerator
+ *
+ *  Returns an element from +self+ selected by a binary search.
+ *
+ *  See {Binary Searching}[rdoc-ref:bsearch.rdoc].
  */
 
 static VALUE
 rb_ary_bsearch(VALUE ary)
 {
+    VALUE index_result = rb_ary_bsearch_index(ary);
+
+    if (FIXNUM_P(index_result)) {
+        return rb_ary_entry(ary, FIX2LONG(index_result));
+    }
+    return index_result;
+}
+
+/*
+ *  call-seq:
+ *    array.bsearch_index {|element| ... } -> integer or nil
+ *    array.bsearch_index -> new_enumerator
+ *
+ *  Searches +self+ as described at method #bsearch,
+ *  but returns the _index_ of the found element instead of the element itself.
+ */
+
+static VALUE
+rb_ary_bsearch_index(VALUE ary)
+{
     long low = 0, high = RARRAY_LEN(ary), mid;
     int smaller = 0, satisfied = 0;
     VALUE v, val;
 
     RETURN_ENUMERATOR(ary, 0, 0);
     while (low < high) {
-	mid = low + ((high - low) / 2);
-	val = rb_ary_entry(ary, mid);
-	v = rb_yield(val);
-	if (FIXNUM_P(v)) {
-	    if (FIX2INT(v) == 0) return val;
-	    smaller = FIX2INT(v) < 0;
-	}
-	else if (v == Qtrue) {
-	    satisfied = 1;
-	    smaller = 1;
-	}
-	else if (v == Qfalse || v == Qnil) {
-	    smaller = 0;
-	}
-	else if (rb_obj_is_kind_of(v, rb_cNumeric)) {
-	    switch (rb_cmpint(rb_funcall(v, id_cmp, 1, INT2FIX(0)), v, INT2FIX(0))) {
-		case 0: return val;
-		case 1: smaller = 1; break;
-		case -1: smaller = 0;
-	    }
-	}
-	else {
-	    rb_raise(rb_eTypeError, "wrong argument type %s"
-		" (must be numeric, true, false or nil)",
-		rb_obj_classname(v));
-	}
-	if (smaller) {
-	    high = mid;
-	}
-	else {
-	    low = mid + 1;
-	}
-    }
-    if (low == RARRAY_LEN(ary)) return Qnil;
+        mid = low + ((high - low) / 2);
+        val = rb_ary_entry(ary, mid);
+        v = rb_yield(val);
+        if (FIXNUM_P(v)) {
+            if (v == INT2FIX(0)) return INT2FIX(mid);
+            smaller = (SIGNED_VALUE)v < 0; /* Fixnum preserves its sign-bit */
+        }
+        else if (v == Qtrue) {
+            satisfied = 1;
+            smaller = 1;
+        }
+        else if (!RTEST(v)) {
+            smaller = 0;
+        }
+        else if (rb_obj_is_kind_of(v, rb_cNumeric)) {
+            const VALUE zero = INT2FIX(0);
+            switch (rb_cmpint(rb_funcallv(v, id_cmp, 1, &zero), v, zero)) {
+              case 0: return INT2FIX(mid);
+              case 1: smaller = 0; break;
+              case -1: smaller = 1;
+            }
+        }
+        else {
+            rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE
+                     " (must be numeric, true, false or nil)",
+                     rb_obj_class(v));
+        }
+        if (smaller) {
+            high = mid;
+        }
+        else {
+            low = mid + 1;
+        }
+    }
     if (!satisfied) return Qnil;
-    return rb_ary_entry(ary, low);
+    return INT2FIX(low);
 }
 
 
 static VALUE
-sort_by_i(VALUE i)
+sort_by_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, dummy))
 {
     return rb_yield(i);
 }
 
 /*
  *  call-seq:
- *     ary.sort_by! { |obj| block }    -> ary
- *     ary.sort_by!                    -> Enumerator
+ *    array.sort_by! {|element| ... } -> self
+ *    array.sort_by! -> new_enumerator
+ *
+ *  Sorts the elements of +self+ in place,
+ *  using an ordering determined by the block; returns self.
+ *
+ *  Calls the block with each successive element;
+ *  sorts elements based on the values returned from the block.
  *
- *  Sorts +self+ in place using a set of keys generated by mapping the
- *  values in +self+ through the given block.
+ *  For duplicates returned by the block, the ordering is indeterminate, and may be unstable.
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  This example sorts strings based on their sizes:
+ *
+ *    a = ['aaaa', 'bbb', 'cc', 'd']
+ *    a.sort_by! {|element| element.size }
+ *    a # => ["d", "cc", "bbb", "aaaa"]
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = ['aaaa', 'bbb', 'cc', 'd']
+ *    a.sort_by! # => #<Enumerator: ["aaaa", "bbb", "cc", "d"]:sort_by!>
  *
  */
 
@@ -2574,22 +3804,22 @@ rb_ary_sort_by_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.collect { |item| block }  -> new_ary
- *     ary.map     { |item| block }  -> new_ary
- *     ary.collect                   -> Enumerator
- *     ary.map                       -> Enumerator
- *
- *  Invokes the given block once for each element of +self+.
+ *    array.map {|element| ... } -> new_array
+ *    array.map -> new_enumerator
  *
- *  Creates a new array containing the values returned by the block.
+ *  Calls the block, if given, with each element of +self+;
+ *  returns a new \Array whose elements are the return values from the block:
  *
- *  See also Enumerable#collect.
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map {|element| element.class }
+ *    a1 # => [Symbol, String, Integer]
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map
+ *    a1 # => #<Enumerator: [:foo, "bar", 2]:map>
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.map { |x| x + "!" }   #=> ["a!", "b!", "c!", "d!"]
- *     a                       #=> ["a", "b", "c", "d"]
+ *  Array#collect is an alias for Array#map.
  */
 
 static VALUE
@@ -2601,7 +3831,7 @@ rb_ary_collect(VALUE ary)
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     collect = rb_ary_new2(RARRAY_LEN(ary));
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	rb_ary_push(collect, rb_yield(RARRAY_AREF(ary, i)));
+        rb_ary_push(collect, rb_yield(RARRAY_AREF(ary, i)));
     }
     return collect;
 }
@@ -2609,21 +3839,22 @@ rb_ary_collect(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.collect! {|item| block }   -> ary
- *     ary.map!     {|item| block }   -> ary
- *     ary.collect!                   -> Enumerator
- *     ary.map!                       -> Enumerator
+ *    array.map! {|element| ... } -> self
+ *    array.map! -> new_enumerator
  *
- *  Invokes the given block once for each element of +self+, replacing the
- *  element with the value returned by the block.
+ *  Calls the block, if given, with each element;
+ *  replaces the element with the block's return value:
  *
- *  See also Enumerable#collect.
+ *    a = [:foo, 'bar', 2]
+ *    a.map! { |element| element.class } # => [Symbol, String, Integer]
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.map! {|x| x + "!" }
- *     a #=>  [ "a!", "b!", "c!", "d!" ]
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map!
+ *    a1 # => #<Enumerator: [:foo, "bar", 2]:map!>
+ *
+ *  Array#collect! is an alias for Array#map!.
  */
 
 static VALUE
@@ -2634,78 +3865,140 @@ rb_ary_collect_bang(VALUE ary)
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	rb_ary_store(ary, i, rb_yield(RARRAY_AREF(ary, i)));
+        rb_ary_store(ary, i, rb_yield(RARRAY_AREF(ary, i)));
     }
     return ary;
 }
 
 VALUE
-rb_get_values_at(VALUE obj, long olen, int argc, VALUE *argv, VALUE (*func) (VALUE, long))
+rb_get_values_at(VALUE obj, long olen, int argc, const VALUE *argv, VALUE (*func) (VALUE, long))
 {
     VALUE result = rb_ary_new2(argc);
     long beg, len, i, j;
 
     for (i=0; i<argc; i++) {
-	if (FIXNUM_P(argv[i])) {
-	    rb_ary_push(result, (*func)(obj, FIX2LONG(argv[i])));
-	    continue;
-	}
-	/* check if idx is Range */
-	if (rb_range_beg_len(argv[i], &beg, &len, olen, 1)) {
-	    long end = olen < beg+len ? olen : beg+len;
-	    for (j = beg; j < end; j++) {
-		rb_ary_push(result, (*func)(obj, j));
-	    }
-	    if (beg + len > j)
-		rb_ary_resize(result, RARRAY_LEN(result) + (beg + len) - j);
-	    continue;
-	}
-	rb_ary_push(result, (*func)(obj, NUM2LONG(argv[i])));
+        if (FIXNUM_P(argv[i])) {
+            rb_ary_push(result, (*func)(obj, FIX2LONG(argv[i])));
+            continue;
+        }
+        /* check if idx is Range */
+        if (rb_range_beg_len(argv[i], &beg, &len, olen, 1)) {
+            long end = olen < beg+len ? olen : beg+len;
+            for (j = beg; j < end; j++) {
+                rb_ary_push(result, (*func)(obj, j));
+            }
+            if (beg + len > j)
+                rb_ary_resize(result, RARRAY_LEN(result) + (beg + len) - j);
+            continue;
+        }
+        rb_ary_push(result, (*func)(obj, NUM2LONG(argv[i])));
     }
     return result;
 }
 
+static VALUE
+append_values_at_single(VALUE result, VALUE ary, long olen, VALUE idx)
+{
+    long beg, len;
+    if (FIXNUM_P(idx)) {
+        beg = FIX2LONG(idx);
+    }
+    /* check if idx is Range */
+    else if (rb_range_beg_len(idx, &beg, &len, olen, 1)) {
+        if (len > 0) {
+            const VALUE *const src = RARRAY_CONST_PTR_TRANSIENT(ary);
+            const long end = beg + len;
+            const long prevlen = RARRAY_LEN(result);
+            if (beg < olen) {
+                rb_ary_cat(result, src + beg, end > olen ? olen-beg : len);
+            }
+            if (end > olen) {
+                rb_ary_store(result, prevlen + len - 1, Qnil);
+            }
+        }
+        return result;
+    }
+    else {
+        beg = NUM2LONG(idx);
+    }
+    return rb_ary_push(result, rb_ary_entry(ary, beg));
+}
+
 /*
  *  call-seq:
- *     ary.values_at(selector, ...)  -> new_ary
+ *    array.values_at(*indexes) -> new_array
+ *
+ *  Returns a new \Array whose elements are the elements
+ *  of +self+ at the given \Integer or \Range +indexes+.
  *
- *  Returns an array containing the elements in +self+ corresponding to the
- *  given +selector+(s).
+ *  For each positive +index+, returns the element at offset +index+:
  *
- *  The selectors may be either integer indices or ranges.
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, 2) # => [:foo, 2]
+ *    a.values_at(0..1) # => [:foo, "bar"]
  *
- *  See also Array#select.
+ *  The given +indexes+ may be in any order, and may repeat:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(2, 0, 1, 0, 2) # => [2, :foo, "bar", :foo, 2]
+ *    a.values_at(1, 0..2) # => ["bar", :foo, "bar", 2]
+ *
+ *  Assigns +nil+ for an +index+ that is too large:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, 3, 1, 3) # => [:foo, nil, "bar", nil]
+ *
+ *  Returns a new empty \Array if no arguments given.
+ *
+ *  For each negative +index+, counts backward from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(-1, -3) # => [2, :foo]
+ *
+ *  Assigns +nil+ for an +index+ that is too small:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, -5, 1, -6, 2) # => [:foo, nil, "bar", nil, 2]
+ *
+ *  The given +indexes+ may have a mixture of signs:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, -2, 1, -1) # => [:foo, "bar", "bar", 2]
  *
- *     a = %w{ a b c d e f }
- *     a.values_at(1, 3, 5)          # => ["b", "d", "f"]
- *     a.values_at(1, 3, 5, 7)       # => ["b", "d", "f", nil]
- *     a.values_at(-1, -2, -2, -7)   # => ["f", "e", "e", nil]
- *     a.values_at(4..6, 3...6)      # => ["e", "f", nil, "d", "e", "f"]
  */
 
 static VALUE
 rb_ary_values_at(int argc, VALUE *argv, VALUE ary)
 {
-    return rb_get_values_at(ary, RARRAY_LEN(ary), argc, argv, rb_ary_entry);
+    long i, olen = RARRAY_LEN(ary);
+    VALUE result = rb_ary_new_capa(argc);
+    for (i = 0; i < argc; ++i) {
+        append_values_at_single(result, ary, olen, argv[i]);
+    }
+    RB_GC_GUARD(ary);
+    return result;
 }
 
 
 /*
  *  call-seq:
- *     ary.select { |item| block } -> new_ary
- *     ary.select                  -> Enumerator
+ *    array.select {|element| ... } -> new_array
+ *    array.select -> new_enumerator
  *
- *  Returns a new array containing all elements of +ary+
- *  for which the given +block+ returns a true value.
+ *  Calls the block, if given, with each element of +self+;
+ *  returns a new \Array containing those elements of +self+
+ *  for which the block returns a truthy value:
  *
- *  If no block is given, an Enumerator is returned instead.
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a1 = a.select {|element| element.to_s.start_with?('b') }
+ *    a1 # => ["bar", :bam]
  *
- *     [1,2,3,4,5].select { |num|  num.even?  }   #=> [2, 4]
+ *  Returns a new \Enumerator if no block given:
  *
- *     a = %w{ a b c d e f }
- *     a.select { |v| v =~ /[aeiou]/ }  #=> ["a", "e"]
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select # => #<Enumerator: [:foo, "bar", 2, :bam]:select>
  *
- *  See also Enumerable#select.
+ *  Array#filter is an alias for Array#select.
  */
 
 static VALUE
@@ -2717,65 +4010,110 @@ rb_ary_select(VALUE ary)
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     result = rb_ary_new2(RARRAY_LEN(ary));
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
-	    rb_ary_push(result, rb_ary_elt(ary, i));
-	}
+        if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+            rb_ary_push(result, rb_ary_elt(ary, i));
+        }
     }
     return result;
 }
 
+struct select_bang_arg {
+    VALUE ary;
+    long len[2];
+};
+
+static VALUE
+select_bang_i(VALUE a)
+{
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long i1, i2;
+
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); arg->len[0] = ++i1) {
+        VALUE v = RARRAY_AREF(ary, i1);
+        if (!RTEST(rb_yield(v))) continue;
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, v);
+        }
+        arg->len[1] = ++i2;
+    }
+    return (i1 == i2) ? Qnil : ary;
+}
+
+static VALUE
+select_bang_ensure(VALUE a)
+{
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long len = RARRAY_LEN(ary);
+    long i1 = arg->len[0], i2 = arg->len[1];
+
+    if (i2 < len && i2 < i1) {
+        long tail = 0;
+        rb_ary_modify(ary);
+        if (i1 < len) {
+            tail = len - i1;
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                    MEMMOVE(ptr + i2, ptr + i1, VALUE, tail);
+                });
+        }
+        ARY_SET_LEN(ary, i2 + tail);
+    }
+    return ary;
+}
+
 /*
  *  call-seq:
- *     ary.select!  {|item| block } -> ary or nil
- *     ary.select!                  -> Enumerator
+ *    array.select! {|element| ... } -> self or nil
+ *    array.select! -> new_enumerator
  *
- *  Invokes the given block passing in successive elements from +self+,
- *  deleting elements for which the block returns a +false+ value.
+ *  Calls the block, if given  with each element of +self+;
+ *  removes from +self+ those elements for which the block returns +false+ or +nil+.
  *
- *  If changes were made, it will return +self+, otherwise it returns +nil+.
+ *  Returns +self+ if any elements were removed:
  *
- *  See also Array#keep_if
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select! {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  Returns +nil+ if no elements were removed.
  *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select! # => #<Enumerator: [:foo, "bar", 2, :bam]:select!>
+ *
+ *  Array#filter! is an alias for Array#select!.
  */
 
 static VALUE
 rb_ary_select_bang(VALUE ary)
 {
-    long i1, i2;
+    struct select_bang_arg args;
 
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
-    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
-	VALUE v = RARRAY_AREF(ary, i1);
-	if (!RTEST(rb_yield(v))) continue;
-	if (i1 != i2) {
-	    rb_ary_store(ary, i2, v);
-	}
-	i2++;
-    }
 
-    if (RARRAY_LEN(ary) == i2) return Qnil;
-    if (i2 < RARRAY_LEN(ary))
-	ARY_SET_LEN(ary, i2);
-    return ary;
+    args.ary = ary;
+    args.len[0] = args.len[1] = 0;
+    return rb_ensure(select_bang_i, (VALUE)&args, select_bang_ensure, (VALUE)&args);
 }
 
 /*
  *  call-seq:
- *     ary.keep_if { |item| block } -> ary
- *     ary.keep_if                  -> Enumerator
+ *    array.keep_if {|element| ... } -> self
+ *    array.keep_if -> new_enumeration
  *
- *  Deletes every element of +self+ for which the given block evaluates to
- *  +false+.
+ *  Retains those elements for which the block returns a truthy value;
+ *  deletes all other elements; returns +self+:
  *
- *  See also Array#select!
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.keep_if {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.keep_if # => #<Enumerator: [:foo, "bar", 2, :bam]:keep_if>
  *
- *     a = %w{ a b c d e f }
- *     a.keep_if { |v| v =~ /[aeiou]/ }  #=> ["a", "e"]
  */
 
 static VALUE
@@ -2791,32 +4129,48 @@ ary_resize_smaller(VALUE ary, long len)
 {
     rb_ary_modify(ary);
     if (RARRAY_LEN(ary) > len) {
-	ARY_SET_LEN(ary, len);
-	if (len * 2 < ARY_CAPA(ary) &&
-	    ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
-	    ary_resize_capa(ary, len * 2);
-	}
+        ARY_SET_LEN(ary, len);
+        if (len * 2 < ARY_CAPA(ary) &&
+            ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
+            ary_resize_capa(ary, len * 2);
+        }
     }
 }
 
 /*
  *  call-seq:
- *     ary.delete(obj)            -> item or nil
- *     ary.delete(obj) { block }  -> item or result of block
+ *    array.delete(obj) -> deleted_object
+ *    array.delete(obj) {|nosuch| ... } -> deleted_object or block_return
  *
- *  Deletes all items from +self+ that are equal to +obj+.
+ *  Removes zero or more elements from +self+.
  *
- *  Returns the last deleted item, or +nil+ if no matching item is found.
+ *  When no block is given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == obj</tt>;
+ *  returns the last deleted element:
  *
- *  If the optional code block is given, the result of the block is returned if
- *  the item is not found.  (To remove +nil+ elements and get an informative
- *  return value, use Array#compact!)
+ *    s1 = 'bar'; s2 = 'bar'
+ *    a = [:foo, s1, 2, s2]
+ *    a.delete('bar') # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  Returns +nil+ if no elements removed.
+ *
+ *  When a block is given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == obj</tt>.
+ *
+ *  If any such elements are found, ignores the block
+ *  and returns the last deleted element:
+ *
+ *    s1 = 'bar'; s2 = 'bar'
+ *    a = [:foo, s1, 2, s2]
+ *    deleted_obj = a.delete('bar') {|obj| fail 'Cannot happen' }
+ *    a # => [:foo, 2]
+ *
+ *  If no such elements are found, returns the block's return value:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete(:nosuch) {|obj| "#{obj} not found" } # => "nosuch not found"
  *
- *     a = [ "a", "b", "b", "b", "c" ]
- *     a.delete("b")                   #=> "b"
- *     a                               #=> ["a", "c"]
- *     a.delete("z")                   #=> nil
- *     a.delete("z") { "not found" }   #=> "not found"
  */
 
 VALUE
@@ -2826,26 +4180,27 @@ rb_ary_delete(VALUE ary, VALUE item)
     long i1, i2;
 
     for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
-	VALUE e = RARRAY_AREF(ary, i1);
+        VALUE e = RARRAY_AREF(ary, i1);
 
-	if (rb_equal(e, item)) {
-	    v = e;
-	    continue;
-	}
-	if (i1 != i2) {
-	    rb_ary_store(ary, i2, e);
-	}
-	i2++;
+        if (rb_equal(e, item)) {
+            v = e;
+            continue;
+        }
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, e);
+        }
+        i2++;
     }
     if (RARRAY_LEN(ary) == i2) {
-	if (rb_block_given_p()) {
-	    return rb_yield(item);
-	}
-	return Qnil;
+        if (rb_block_given_p()) {
+            return rb_yield(item);
+        }
+        return Qnil;
     }
 
     ary_resize_smaller(ary, i2);
 
+    ary_verify(ary);
     return v;
 }
 
@@ -2855,18 +4210,18 @@ rb_ary_delete_same(VALUE ary, VALUE item)
     long i1, i2;
 
     for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
-	VALUE e = RARRAY_AREF(ary, i1);
+        VALUE e = RARRAY_AREF(ary, i1);
 
-	if (e == item) {
-	    continue;
-	}
-	if (i1 != i2) {
-	    rb_ary_store(ary, i2, e);
-	}
-	i2++;
+        if (e == item) {
+            continue;
+        }
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, e);
+        }
+        i2++;
     }
     if (RARRAY_LEN(ary) == i2) {
-	return;
+        return;
     }
 
     ary_resize_smaller(ary, i2);
@@ -2880,33 +4235,41 @@ rb_ary_delete_at(VALUE ary, long pos)
 
     if (pos >= len) return Qnil;
     if (pos < 0) {
-	pos += len;
-	if (pos < 0) return Qnil;
+        pos += len;
+        if (pos < 0) return Qnil;
     }
 
     rb_ary_modify(ary);
     del = RARRAY_AREF(ary, pos);
-    RARRAY_PTR_USE(ary, ptr, {
-	MEMMOVE(ptr+pos, ptr+pos+1, VALUE, RARRAY_LEN(ary)-pos-1);
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        MEMMOVE(ptr+pos, ptr+pos+1, VALUE, len-pos-1);
     });
     ARY_INCREASE_LEN(ary, -1);
-
+    ary_verify(ary);
     return del;
 }
 
 /*
  *  call-seq:
- *     ary.delete_at(index)  -> obj or nil
+ *    array.delete_at(index) -> deleted_object or nil
+ *
+ *  Deletes an element from +self+, per the given \Integer +index+.
+ *
+ *  When +index+ is non-negative, deletes the element at offset +index+:
  *
- *  Deletes the element at the specified +index+, returning that element, or
- *  +nil+ if the +index+ is out of range.
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(1) # => "bar"
+ *    a # => [:foo, 2]
  *
- *  See also Array#slice!
+ *  If index is too large, returns +nil+.
  *
- *     a = ["ant", "bat", "cat", "dog"]
- *     a.delete_at(2)    #=> "cat"
- *     a                 #=> ["ant", "bat", "dog"]
- *     a.delete_at(99)   #=> nil
+ *  When +index+ is negative, counts backward from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(-2) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  If +index+ is too small (far from zero), returns nil.
  */
 
 static VALUE
@@ -2915,73 +4278,133 @@ rb_ary_delete_at_m(VALUE ary, VALUE pos)
     return rb_ary_delete_at(ary, NUM2LONG(pos));
 }
 
+static VALUE
+ary_slice_bang_by_rb_ary_splice(VALUE ary, long pos, long len)
+{
+    const long orig_len = RARRAY_LEN(ary);
+
+    if (len < 0) {
+        return Qnil;
+    }
+    else if (pos < -orig_len) {
+        return Qnil;
+    }
+    else if (pos < 0) {
+        pos += orig_len;
+    }
+    else if (orig_len < pos) {
+        return Qnil;
+    }
+    if (orig_len < pos + len) {
+        len = orig_len - pos;
+    }
+    if (len == 0) {
+        return rb_ary_new2(0);
+    }
+    else {
+        VALUE arg2 = rb_ary_new4(len, RARRAY_CONST_PTR_TRANSIENT(ary)+pos);
+        rb_ary_splice(ary, pos, len, 0, 0);
+        return arg2;
+    }
+}
+
 /*
  *  call-seq:
- *     ary.slice!(index)         -> obj or nil
- *     ary.slice!(start, length) -> new_ary or nil
- *     ary.slice!(range)         -> new_ary or nil
- *
- *  Deletes the element(s) given by an +index+ (optionally up to +length+
- *  elements) or by a +range+.
- *
- *  Returns the deleted object (or objects), or +nil+ if the +index+ is out of
- *  range.
- *
- *     a = [ "a", "b", "c" ]
- *     a.slice!(1)     #=> "b"
- *     a               #=> ["a", "c"]
- *     a.slice!(-1)    #=> "c"
- *     a               #=> ["a"]
- *     a.slice!(100)   #=> nil
- *     a               #=> ["a"]
+ *    array.slice!(n) -> object or nil
+ *    array.slice!(start, length) -> new_array or nil
+ *    array.slice!(range) -> new_array or nil
+ *
+ *  Removes and returns elements from +self+.
+ *
+ *  When the only argument is an \Integer +n+,
+ *  removes and returns the _nth_ element in +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  If +n+ is negative, counts backwards from the end of +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(-1) # => 2
+ *    a # => [:foo, "bar"]
+ *
+ *  If +n+ is out of range, returns +nil+.
+ *
+ *  When the only arguments are Integers +start+ and +length+,
+ *  removes +length+ elements from +self+ beginning at offset  +start+;
+ *  returns the deleted objects in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(0, 2) # => [:foo, "bar"]
+ *    a # => [2]
+ *
+ *  If <tt>start + length</tt> exceeds the array size,
+ *  removes and returns all elements from offset +start+ to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1, 50) # => ["bar", 2]
+ *    a # => [:foo]
+ *
+ *  If <tt>start == a.size</tt> and +length+ is non-negative,
+ *  returns a new empty \Array.
+ *
+ *  If +length+ is negative, returns +nil+.
+ *
+ *  When the only argument is a \Range object +range+,
+ *  treats <tt>range.min</tt> as +start+ above and <tt>range.size</tt> as +length+ above:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1..2) # => ["bar", 2]
+ *    a # => [:foo]
+ *
+ *  If <tt>range.start == a.size</tt>, returns a new empty \Array.
+ *
+ *  If <tt>range.start</tt> is larger than the array size, returns +nil+.
+ *
+ *  If <tt>range.end</tt> is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(0..-2) # => [:foo, "bar"]
+ *    a # => [2]
+ *
+ *  If <tt>range.start</tt> is negative,
+ *  calculates the start index backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(-2..2) # => ["bar", 2]
+ *    a # => [:foo]
+ *
  */
 
 static VALUE
 rb_ary_slice_bang(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE arg1, arg2;
-    long pos, len, orig_len;
+    VALUE arg1;
+    long pos, len;
 
     rb_ary_modify_check(ary);
+    rb_check_arity(argc, 1, 2);
+    arg1 = argv[0];
+
     if (argc == 2) {
-	pos = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-      delete_pos_len:
-	if (len < 0) return Qnil;
-	orig_len = RARRAY_LEN(ary);
-	if (pos < 0) {
-	    pos += orig_len;
-	    if (pos < 0) return Qnil;
-	}
-	else if (orig_len < pos) return Qnil;
-	if (orig_len < pos + len) {
-	    len = orig_len - pos;
-	}
-	if (len == 0) return rb_ary_new2(0);
-	arg2 = rb_ary_new4(len, RARRAY_RAWPTR(ary)+pos);
-	RBASIC_SET_CLASS(arg2, rb_obj_class(ary));
-	rb_ary_splice(ary, pos, len, Qundef);
-	return arg2;
-    }
-
-    if (argc != 1) {
-	/* error report */
-	rb_scan_args(argc, argv, "11", NULL, NULL);
+        pos = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_slice_bang_by_rb_ary_splice(ary, pos, len);
     }
-    arg1 = argv[0];
 
     if (!FIXNUM_P(arg1)) {
-	switch (rb_range_beg_len(arg1, &pos, &len, RARRAY_LEN(ary), 0)) {
-	  case Qtrue:
-	    /* valid range */
-	    goto delete_pos_len;
-	  case Qnil:
-	    /* invalid range */
-	    return Qnil;
-	  default:
-	    /* not a range */
-	    break;
-	}
+        switch (rb_range_beg_len(arg1, &pos, &len, RARRAY_LEN(ary), 0)) {
+          case Qtrue:
+            /* valid range */
+            return ary_slice_bang_by_rb_ary_splice(ary, pos, len);
+          case Qnil:
+            /* invalid range */
+            return Qnil;
+          default:
+            /* not a range */
+            break;
+        }
     }
 
     return rb_ary_delete_at(ary, NUM2LONG(arg1));
@@ -2993,68 +4416,89 @@ ary_reject(VALUE orig, VALUE result)
     long i;
 
     for (i = 0; i < RARRAY_LEN(orig); i++) {
-	VALUE v = RARRAY_AREF(orig, i);
-	if (!RTEST(rb_yield(v))) {
-	    rb_ary_push_1(result, v);
-	}
+        VALUE v = RARRAY_AREF(orig, i);
+
+        if (!RTEST(rb_yield(v))) {
+            rb_ary_push(result, v);
+        }
     }
     return result;
 }
 
 static VALUE
-ary_reject_bang(VALUE ary)
+reject_bang_i(VALUE a)
 {
-    long i;
-    VALUE result = Qnil;
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long i1, i2;
 
-    rb_ary_modify_check(ary);
-    for (i = 0; i < RARRAY_LEN(ary); ) {
-	VALUE v = RARRAY_AREF(ary, i);
-	if (RTEST(rb_yield(v))) {
-	    rb_ary_delete_at(ary, i);
-	    result = ary;
-	}
-	else {
-	    i++;
-	}
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); arg->len[0] = ++i1) {
+        VALUE v = RARRAY_AREF(ary, i1);
+        if (RTEST(rb_yield(v))) continue;
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, v);
+        }
+        arg->len[1] = ++i2;
     }
-    return result;
+    return (i1 == i2) ? Qnil : ary;
+}
+
+static VALUE
+ary_reject_bang(VALUE ary)
+{
+    struct select_bang_arg args;
+    rb_ary_modify_check(ary);
+    args.ary = ary;
+    args.len[0] = args.len[1] = 0;
+    return rb_ensure(reject_bang_i, (VALUE)&args, select_bang_ensure, (VALUE)&args);
 }
 
 /*
  *  call-seq:
- *     ary.reject! { |item| block }  -> ary or nil
- *     ary.reject!                   -> Enumerator
+ *    array.reject! {|element| ... } -> self or nil
+ *    array.reject! -> new_enumerator
+ *
+ *  Removes each element for which the block returns a truthy value.
+ *
+ *  Returns +self+ if any elements removed:
+ *
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a.reject! {|element| element.to_s.start_with?('b') } # => [:foo, 2]
  *
- *  Equivalent to Array#delete_if, deleting elements from +self+ for which the
- *  block evaluates to +true+, but returns +nil+ if no changes were made.
+ *  Returns +nil+ if no elements removed.
  *
- *  The array is changed instantly every time the block is called, not after
- *  the iteration is over.
+ *  Returns a new \Enumerator if no block given:
  *
- *  See also Enumerable#reject and Array#delete_if.
+ *    a = [:foo, 'bar', 2]
+ *    a.reject! # => #<Enumerator: [:foo, "bar", 2]:reject!>
  *
- *  If no block is given, an Enumerator is returned instead.
  */
 
 static VALUE
 rb_ary_reject_bang(VALUE ary)
 {
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rb_ary_modify(ary);
     return ary_reject_bang(ary);
 }
 
 /*
  *  call-seq:
- *     ary.reject  {|item| block }  -> new_ary
- *     ary.reject                   -> Enumerator
+ *    array.reject {|element| ... } -> new_array
+ *    array.reject -> new_enumerator
+ *
+ *  Returns a new \Array whose elements are all those from +self+
+ *  for which the block returns +false+ or +nil+:
  *
- *  Returns a new array containing the items in +self+ for which the given
- *  block is not +true+.
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a1 = a.reject {|element| element.to_s.start_with?('b') }
+ *    a1 # => [:foo, 2]
  *
- *  See also Array#delete_if
+ *  Returns a new \Enumerator if no block given:
+ *
+ *     a = [:foo, 'bar', 2]
+ *     a.reject # => #<Enumerator: [:foo, "bar", 2]:reject>
  *
- *  If no block is given, an Enumerator is returned instead.
  */
 
 static VALUE
@@ -3070,36 +4514,38 @@ rb_ary_reject(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.delete_if { |item| block }  -> ary
- *     ary.delete_if                   -> Enumerator
+ *    array.delete_if {|element| ... } -> self
+ *    array.delete_if -> Enumerator
  *
- *  Deletes every element of +self+ for which block evaluates to +true+.
+ *  Removes each element in +self+ for which the block returns a truthy value;
+ *  returns +self+:
  *
- *  The array is changed instantly every time the block is called, not after
- *  the iteration is over.
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a.delete_if {|element| element.to_s.start_with?('b') } # => [:foo, 2]
  *
- *  See also Array#reject!
+ *  Returns a new \Enumerator if no block given:
  *
- *  If no block is given, an Enumerator is returned instead.
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_if # => #<Enumerator: [:foo, "bar", 2]:delete_if>
  *
- *     scores = [ 97, 42, 75 ]
- *     scores.delete_if {|score| score < 80 }   #=> [97]
- */
+3 */
 
 static VALUE
 rb_ary_delete_if(VALUE ary)
 {
+    ary_verify(ary);
     RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     ary_reject_bang(ary);
     return ary;
 }
 
 static VALUE
-take_i(VALUE val, VALUE *args, int argc, VALUE *argv)
+take_i(RB_BLOCK_CALL_FUNC_ARGLIST(val, cbarg))
 {
-    if (args[1]-- == 0) rb_iter_break();
+    VALUE *args = (VALUE *)cbarg;
     if (argc > 1) val = rb_ary_new4(argc, argv);
     rb_ary_push(args[0], val);
+    if (--args[1] == 0) rb_iter_break();
     return Qnil;
 }
 
@@ -3109,82 +4555,126 @@ take_items(VALUE obj, long n)
     VALUE result = rb_check_array_type(obj);
     VALUE args[2];
 
+    if (n == 0) return result;
     if (!NIL_P(result)) return rb_ary_subseq(result, 0, n);
     result = rb_ary_new2(n);
     args[0] = result; args[1] = (VALUE)n;
-    if (rb_check_block_call(obj, idEach, 0, 0, take_i, (VALUE)args) == Qundef)
-	rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE" (must respond to :each)",
-		 rb_obj_class(obj));
+    if (UNDEF_P(rb_check_block_call(obj, idEach, 0, 0, take_i, (VALUE)args)))
+        rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE" (must respond to :each)",
+                 rb_obj_class(obj));
     return result;
 }
 
 
 /*
  *  call-seq:
- *     ary.zip(arg, ...)                  -> new_ary
- *     ary.zip(arg, ...) { |arr| block }  -> nil
+ *    array.zip(*other_arrays) -> new_array
+ *    array.zip(*other_arrays) {|other_array| ... } -> nil
+ *
+ *  When no block given, returns a new \Array +new_array+ of size <tt>self.size</tt>
+ *  whose elements are Arrays.
+ *
+ *  Each nested array <tt>new_array[n]</tt> is of size <tt>other_arrays.size+1</tt>,
+ *  and contains:
+ *
+ *  - The _nth_ element of +self+.
+ *  - The _nth_ element of each of the +other_arrays+.
+ *
+ *  If all +other_arrays+ and +self+ are the same size:
  *
- *  Converts any arguments to arrays, then merges elements of +self+ with
- *  corresponding elements from each argument.
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, :c2], [:a3, :b3, :c3]]
  *
- *  This generates a sequence of <code>ary.size</code> _n_-element arrays,
- *  where _n_ is one more than the count of arguments.
+ *  If any array in +other_arrays+ is smaller than +self+,
+ *  fills to <tt>self.size</tt> with +nil+:
  *
- *  If the size of any argument is less than the size of the initial array,
- *  +nil+ values are supplied.
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2]
+ *    c = [:c0, :c1]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, nil], [:a3, nil, nil]]
  *
- *  If a block is given, it is invoked for each output +array+, otherwise an
- *  array of arrays is returned.
+ *  If any array in +other_arrays+ is larger than +self+,
+ *  its trailing elements are ignored:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3, :b4]
+ *    c = [:c0, :c1, :c2, :c3, :c4, :c5]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, :c2], [:a3, :b3, :c3]]
+ *
+ *  When a block is given, calls the block with each of the sub-arrays (formed as above); returns +nil+:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    a.zip(b, c) {|sub_array| p sub_array} # => nil
+ *
+ *  Output:
+ *
+ *    [:a0, :b0, :c0]
+ *    [:a1, :b1, :c1]
+ *    [:a2, :b2, :c2]
+ *    [:a3, :b3, :c3]
  *
- *     a = [ 4, 5, 6 ]
- *     b = [ 7, 8, 9 ]
- *     [1, 2, 3].zip(a, b)   #=> [[1, 4, 7], [2, 5, 8], [3, 6, 9]]
- *     [1, 2].zip(a, b)      #=> [[1, 4, 7], [2, 5, 8]]
- *     a.zip([1, 2], [8])    #=> [[4, 1, 8], [5, 2, nil], [6, nil, nil]]
  */
 
 static VALUE
 rb_ary_zip(int argc, VALUE *argv, VALUE ary)
 {
-    int i, j, block_given, arity = 0;
-    long len;
+    int i, j;
+    long len = RARRAY_LEN(ary);
     VALUE result = Qnil;
 
-    len = RARRAY_LEN(ary);
     for (i=0; i<argc; i++) {
-	argv[i] = take_items(argv[i], len);
+        argv[i] = take_items(argv[i], len);
     }
 
-    block_given = rb_block_given_p();
-    if (block_given)
-	arity = rb_block_arity();
-    else
-	result = rb_ary_new2(len);
+    if (rb_block_given_p()) {
+        int arity = rb_block_arity();
+
+        if (arity > 1) {
+            VALUE work, *tmp;
+
+            tmp = ALLOCV_N(VALUE, work, argc+1);
+
+            for (i=0; i<RARRAY_LEN(ary); i++) {
+                tmp[0] = RARRAY_AREF(ary, i);
+                for (j=0; j<argc; j++) {
+                    tmp[j+1] = rb_ary_elt(argv[j], i);
+                }
+                rb_yield_values2(argc+1, tmp);
+            }
 
-    if (block_given && arity > 1) {
-	VALUE tmp = rb_ary_new2(argc+1);
+            if (work) ALLOCV_END(work);
+        }
+        else {
+            for (i=0; i<RARRAY_LEN(ary); i++) {
+                VALUE tmp = rb_ary_new2(argc+1);
 
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    rb_ary_store(tmp, 0, RARRAY_AREF(ary, i));
-	    for (j=0; j<argc; j++) {
-		rb_ary_store(tmp, j+1, rb_ary_elt(argv[j], i));
-	    }
-	    rb_yield_values2(argc+1, RARRAY_RAWPTR(tmp));
-	}
+                rb_ary_push(tmp, RARRAY_AREF(ary, i));
+                for (j=0; j<argc; j++) {
+                    rb_ary_push(tmp, rb_ary_elt(argv[j], i));
+                }
+                rb_yield(tmp);
+            }
+        }
     }
     else {
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    VALUE tmp = rb_ary_new2(argc+1);
+        result = rb_ary_new_capa(len);
+
+        for (i=0; i<len; i++) {
+            VALUE tmp = rb_ary_new_capa(argc+1);
 
-	    rb_ary_push(tmp, RARRAY_AREF(ary, i));
-	    for (j=0; j<argc; j++) {
-		rb_ary_push(tmp, rb_ary_elt(argv[j], i));
-	    }
-	    if (block_given)
-		rb_yield(tmp);
-	    else
-		rb_ary_push(result, tmp);
-	}
+            rb_ary_push(tmp, RARRAY_AREF(ary, i));
+            for (j=0; j<argc; j++) {
+                rb_ary_push(tmp, rb_ary_elt(argv[j], i));
+            }
+            rb_ary_push(result, tmp);
+        }
     }
 
     return result;
@@ -3192,15 +4682,14 @@ rb_ary_zip(int argc, VALUE *argv, VALUE ary)
 
 /*
  *  call-seq:
- *     ary.transpose -> new_ary
+ *    array.transpose -> new_array
  *
- *  Assumes that +self+ is an array of arrays and transposes the rows and
- *  columns.
+ *  Transposes the rows and columns in an \Array of Arrays;
+ *  the nested Arrays must all be the same size:
  *
- *     a = [[1,2], [3,4], [5,6]]
- *     a.transpose   #=> [[1, 3, 5], [2, 4, 6]]
+ *    a = [[:a0, :a1], [:b0, :b1], [:c0, :c1]]
+ *    a.transpose # => [[:a0, :b0, :c0], [:a1, :b1, :c1]]
  *
- *  If the length of the subarrays don't match, an IndexError is raised.
  */
 
 static VALUE
@@ -3212,36 +4701,34 @@ rb_ary_transpose(VALUE ary)
     alen = RARRAY_LEN(ary);
     if (alen == 0) return rb_ary_dup(ary);
     for (i=0; i<alen; i++) {
-	tmp = to_ary(rb_ary_elt(ary, i));
-	if (elen < 0) {		/* first element */
-	    elen = RARRAY_LEN(tmp);
-	    result = rb_ary_new2(elen);
-	    for (j=0; j<elen; j++) {
-		rb_ary_store(result, j, rb_ary_new2(alen));
-	    }
-	}
-	else if (elen != RARRAY_LEN(tmp)) {
-	    rb_raise(rb_eIndexError, "element size differs (%ld should be %ld)",
-		     RARRAY_LEN(tmp), elen);
-	}
-	for (j=0; j<elen; j++) {
-	    rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
-	}
+        tmp = to_ary(rb_ary_elt(ary, i));
+        if (elen < 0) {		/* first element */
+            elen = RARRAY_LEN(tmp);
+            result = rb_ary_new2(elen);
+            for (j=0; j<elen; j++) {
+                rb_ary_store(result, j, rb_ary_new2(alen));
+            }
+        }
+        else if (elen != RARRAY_LEN(tmp)) {
+            rb_raise(rb_eIndexError, "element size differs (%ld should be %ld)",
+                     RARRAY_LEN(tmp), elen);
+        }
+        for (j=0; j<elen; j++) {
+            rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
+        }
     }
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.replace(other_ary)  -> ary
- *     ary.initialize_copy(other_ary)	-> ary
+ *    array.replace(other_array) -> self
  *
- *  Replaces the contents of +self+ with the contents of +other_ary+,
- *  truncating or expanding if necessary.
+ *  Replaces the content of +self+ with the content of +other_array+; returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.replace(['foo', :bar, 3]) # => ["foo", :bar, 3]
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.replace([ "x", "y", "z" ])   #=> ["x", "y", "z"]
- *     a                              #=> ["x", "y", "z"]
  */
 
 VALUE
@@ -3251,176 +4738,347 @@ rb_ary_replace(VALUE copy, VALUE orig)
     orig = to_ary(orig);
     if (copy == orig) return copy;
 
-    if (RARRAY_LEN(orig) <= RARRAY_EMBED_LEN_MAX) {
-        VALUE shared = 0;
+    rb_ary_reset(copy);
 
-        if (ARY_OWNS_HEAP_P(copy)) {
-	    RARRAY_PTR_USE(copy, ptr, xfree(ptr));
-	}
-        else if (ARY_SHARED_P(copy)) {
-            shared = ARY_SHARED(copy);
-            FL_UNSET_SHARED(copy);
-        }
-        FL_SET_EMBED(copy);
-	ary_memcpy(copy, 0, RARRAY_LEN(orig), RARRAY_RAWPTR(orig));
-        if (shared) {
-            rb_ary_decrement_share(shared);
-        }
-        ARY_SET_LEN(copy, RARRAY_LEN(orig));
+    /* orig has enough space to embed the contents of orig. */
+    if (RARRAY_LEN(orig) <= ary_embed_capa(copy)) {
+        assert(ARY_EMBED_P(copy));
+        ary_memcpy(copy, 0, RARRAY_LEN(orig), RARRAY_CONST_PTR_TRANSIENT(orig));
+        ARY_SET_EMBED_LEN(copy, RARRAY_LEN(orig));
     }
+#if USE_RVARGC
+    /* orig is embedded but copy does not have enough space to embed the
+     * contents of orig. */
+    else if (ARY_EMBED_P(orig)) {
+        long len = ARY_EMBED_LEN(orig);
+        VALUE *ptr = ary_heap_alloc(copy, len);
+
+        FL_UNSET_EMBED(copy);
+        ARY_SET_PTR(copy, ptr);
+        ARY_SET_LEN(copy, len);
+        ARY_SET_CAPA(copy, len);
+
+        // No allocation and exception expected that could leave `copy` in a
+        // bad state from the edits above.
+        ary_memcpy(copy, 0, len, RARRAY_CONST_PTR_TRANSIENT(orig));
+    }
+#endif
+    /* Otherwise, orig is on heap and copy does not have enough space to embed
+     * the contents of orig. */
     else {
-        VALUE shared = ary_make_shared(orig);
-        if (ARY_OWNS_HEAP_P(copy)) {
-	    RARRAY_PTR_USE(copy, ptr, xfree(ptr));
-        }
-        else {
-            rb_ary_unshare_safe(copy);
-        }
+        VALUE shared_root = ary_make_shared(orig);
         FL_UNSET_EMBED(copy);
-        ARY_SET_PTR(copy, RARRAY_RAWPTR(orig));
-        ARY_SET_LEN(copy, RARRAY_LEN(orig));
-        rb_ary_set_shared(copy, shared);
+        ARY_SET_PTR(copy, ARY_HEAP_PTR(orig));
+        ARY_SET_LEN(copy, ARY_HEAP_LEN(orig));
+        rb_ary_set_shared(copy, shared_root);
     }
+    ary_verify(copy);
     return copy;
 }
 
 /*
  *  call-seq:
- *     ary.clear    -> ary
+ *     array.clear -> self
+ *
+ *  Removes all elements from +self+:
  *
- *  Removes all elements from +self+.
+ *    a = [:foo, 'bar', 2]
+ *    a.clear # => []
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.clear    #=> [ ]
  */
 
 VALUE
 rb_ary_clear(VALUE ary)
 {
     rb_ary_modify_check(ary);
-    ARY_SET_LEN(ary, 0);
     if (ARY_SHARED_P(ary)) {
-	if (!ARY_EMBED_P(ary)) {
-	    rb_ary_unshare(ary);
-	    FL_SET_EMBED(ary);
-	}
+        if (!ARY_EMBED_P(ary)) {
+            rb_ary_unshare(ary);
+            FL_SET_EMBED(ary);
+            ARY_SET_EMBED_LEN(ary, 0);
+        }
     }
-    else if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
-	ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
+    else {
+        ARY_SET_LEN(ary, 0);
+        if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
+            ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
+        }
     }
+    ary_verify(ary);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.fill(obj)                                 -> ary
- *     ary.fill(obj, start [, length])               -> ary
- *     ary.fill(obj, range )                         -> ary
- *     ary.fill { |index| block }                    -> ary
- *     ary.fill(start [, length] ) { |index| block } -> ary
- *     ary.fill(range) { |index| block }             -> ary
+ *    array.fill(obj) -> self
+ *    array.fill(obj, start) -> self
+ *    array.fill(obj, start, length) -> self
+ *    array.fill(obj, range) -> self
+ *    array.fill {|index| ... } -> self
+ *    array.fill(start) {|index| ... } -> self
+ *    array.fill(start, length) {|index| ... } -> self
+ *    array.fill(range) {|index| ... } -> self
+ *
+ *  Replaces specified elements in +self+ with specified objects; returns +self+.
+ *
+ *  With argument +obj+ and no block given, replaces all elements with that one object:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a # => ["a", "b", "c", "d"]
+ *    a.fill(:X) # => [:X, :X, :X, :X]
+ *
+ *  With arguments +obj+ and \Integer +start+, and no block given,
+ *  replaces elements based on the given start.
+ *
+ *  If +start+ is in range (<tt>0 <= start < array.size</tt>),
+ *  replaces all elements from offset +start+ through the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 2) # => ["a", "b", :X, :X]
+ *
+ *  If +start+ is too large (<tt>start >= array.size</tt>), does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 4) # => ["a", "b", "c", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5) # => ["a", "b", "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end (starting index is <tt>start + array.size</tt>):
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -2) # => ["a", "b", :X, :X]
+ *
+ *  If +start+ is too small (less than and far from zero), replaces all elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -6) # => [:X, :X, :X, :X]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -50) # => [:X, :X, :X, :X]
+ *
+ *  With arguments +obj+, \Integer +start+, and \Integer +length+, and no block given,
+ *  replaces elements based on the given +start+ and +length+.
+ *
+ *  If +start+ is in range, replaces +length+ elements beginning at offset +start+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 1, 1) # => ["a", :X, "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end:
  *
- *  The first three forms set the selected elements of +self+ (which
- *  may be the entire array) to +obj+.
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -2, 1) # => ["a", "b", :X, "d"]
  *
- *  A +start+ of +nil+ is equivalent to zero.
+ *  If +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:
  *
- *  A +length+ of +nil+ is equivalent to the length of the array.
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5, 0) # => ["a", "b", "c", "d", nil]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5, 2) # => ["a", "b", "c", "d", nil, :X, :X]
  *
- *  The last three forms fill the array with the value of the given block,
- *  which is passed the absolute index of each element to be filled.
+ *  If +length+ is zero or negative, replaces no elements:
  *
- *  Negative values of +start+ count from the end of the array, where +-1+ is
- *  the last element.
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 1, 0) # => ["a", "b", "c", "d"]
+ *    a.fill(:X, 1, -1) # => ["a", "b", "c", "d"]
+ *
+ *  With arguments +obj+ and \Range +range+, and no block given,
+ *  replaces elements based on the given range.
+ *
+ *  If the range is positive and ascending (<tt>0 < range.begin <= range.end</tt>),
+ *  replaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (1..1)) # => ["a", :X, "c", "d"]
+ *
+ *  If <tt>range.first</tt> is negative, replaces no elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-1..1)) # => ["a", "b", "c", "d"]
+ *
+ *  If <tt>range.last</tt> is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (0..-2)) # => [:X, :X, :X, "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (1..-2)) # => ["a", :X, :X, "d"]
+ *
+ *  If <tt>range.last</tt> and <tt>range.last</tt> are both negative,
+ *  both count from the end of the array:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-1..-1)) # => ["a", "b", "c", :X]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-2..-2)) # => ["a", "b", :X, "d"]
+ *
+ *  With no arguments and a block given, calls the block with each index;
+ *  replaces the corresponding element with the block's return value:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *
+ *  With argument +start+ and a block given, calls the block with each index
+ *  from offset +start+ to the end; replaces the corresponding element
+ *  with the block's return value.
+ *
+ *  If start is in range (<tt>0 <= start < array.size</tt>),
+ *  replaces from offset +start+ to the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "new_3"]
+ *
+ *  If +start+ is too large(<tt>start >= array.size</tt>), does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "new_3"]
+ *
+ *  If start is too small (<tt>start <= -array.size</tt>, replaces all elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-6) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-50) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *
+ *  With arguments +start+ and +length+, and a block given,
+ *  calls the block for each index specified by start length;
+ *  replaces the corresponding element with the block's return value.
+ *
+ *  If +start+ is in range, replaces +length+ elements beginning at offset +start+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1, 1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
+ *
+ *  If start is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2, 1) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"]
+ *
+ *  If +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(5, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(5, 2) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil, "new_5", "new_6"]
+ *
+ *  If +length+ is zero or less, replaces no elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
+ *    a.fill(1, -1) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
+ *
+ *  With arguments +obj+ and +range+, and a block given,
+ *  calls the block with each index in the given range;
+ *  replaces the corresponding element with the block's return value.
+ *
+ *  If the range is positive and ascending (<tt>range 0 < range.begin <= range.end</tt>,
+ *  replaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1..1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
+ *
+ *  If +range.first+ is negative, does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-1..1) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  If <tt>range.last</tt> is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(0..-2) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1..-2) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "d"]
+ *
+ *  If <tt>range.first</tt> and <tt>range.last</tt> are both negative,
+ *  both count from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-1..-1) { |index| "new_#{index}" } # => ["a", "b", "c", "new_3"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2..-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.fill("x")              #=> ["x", "x", "x", "x"]
- *     a.fill("z", 2, 2)        #=> ["x", "x", "z", "z"]
- *     a.fill("y", 0..1)        #=> ["y", "y", "z", "z"]
- *     a.fill { |i| i*i }       #=> [0, 1, 4, 9]
- *     a.fill(-2) { |i| i*i*i } #=> [0, 1, 8, 27]
  */
 
 static VALUE
 rb_ary_fill(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE item, arg1, arg2;
+    VALUE item = Qundef, arg1, arg2;
     long beg = 0, end = 0, len = 0;
-    int block_p = FALSE;
 
     if (rb_block_given_p()) {
-	block_p = TRUE;
-	rb_scan_args(argc, argv, "02", &arg1, &arg2);
-	argc += 1;		/* hackish */
+        rb_scan_args(argc, argv, "02", &arg1, &arg2);
+        argc += 1;		/* hackish */
     }
     else {
-	rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
+        rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
     }
     switch (argc) {
       case 1:
-	beg = 0;
-	len = RARRAY_LEN(ary);
-	break;
+        beg = 0;
+        len = RARRAY_LEN(ary);
+        break;
       case 2:
-	if (rb_range_beg_len(arg1, &beg, &len, RARRAY_LEN(ary), 1)) {
-	    break;
-	}
-	/* fall through */
+        if (rb_range_beg_len(arg1, &beg, &len, RARRAY_LEN(ary), 1)) {
+            break;
+        }
+        /* fall through */
       case 3:
-	beg = NIL_P(arg1) ? 0 : NUM2LONG(arg1);
-	if (beg < 0) {
-	    beg = RARRAY_LEN(ary) + beg;
-	    if (beg < 0) beg = 0;
-	}
-	len = NIL_P(arg2) ? RARRAY_LEN(ary) - beg : NUM2LONG(arg2);
-	break;
+        beg = NIL_P(arg1) ? 0 : NUM2LONG(arg1);
+        if (beg < 0) {
+            beg = RARRAY_LEN(ary) + beg;
+            if (beg < 0) beg = 0;
+        }
+        len = NIL_P(arg2) ? RARRAY_LEN(ary) - beg : NUM2LONG(arg2);
+        break;
     }
     rb_ary_modify(ary);
     if (len < 0) {
         return ary;
     }
     if (beg >= ARY_MAX_SIZE || len > ARY_MAX_SIZE - beg) {
-	rb_raise(rb_eArgError, "argument too big");
+        rb_raise(rb_eArgError, "argument too big");
     }
     end = beg + len;
     if (RARRAY_LEN(ary) < end) {
-	if (end >= ARY_CAPA(ary)) {
-	    ary_resize_capa(ary, end);
-	}
-	ary_mem_clear(ary, RARRAY_LEN(ary), end - RARRAY_LEN(ary));
-	ARY_SET_LEN(ary, end);
+        if (end >= ARY_CAPA(ary)) {
+            ary_resize_capa(ary, end);
+        }
+        ary_mem_clear(ary, RARRAY_LEN(ary), end - RARRAY_LEN(ary));
+        ARY_SET_LEN(ary, end);
     }
 
-    if (block_p) {
-	VALUE v;
-	long i;
+    if (UNDEF_P(item)) {
+        VALUE v;
+        long i;
 
-	for (i=beg; i<end; i++) {
-	    v = rb_yield(LONG2NUM(i));
-	    if (i>=RARRAY_LEN(ary)) break;
-	    RARRAY_ASET(ary, i, v);
-	}
+        for (i=beg; i<end; i++) {
+            v = rb_yield(LONG2NUM(i));
+            if (i>=RARRAY_LEN(ary)) break;
+            ARY_SET(ary, i, v);
+        }
     }
     else {
-	ary_memfill(ary, beg, len, item);
+        ary_memfill(ary, beg, len, item);
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary + other_ary   -> new_ary
+ *    array + other_array -> new_array
  *
- *  Concatenation --- Returns a new array built by concatenating the
- *  two arrays together to produce a third array.
+ *  Returns a new \Array containing all elements of +array+
+ *  followed by all elements of +other_array+:
  *
- *     [ 1, 2, 3 ] + [ 4, 5 ]    #=> [ 1, 2, 3, 4, 5 ]
- *     a = [ "a", "b", "c" ]
- *     c = a + [ "d", "e", "f" ]
- *     c                         #=> [ "a", "b", "c", "d", "e", "f" ]
- *     a                         #=> [ "a", "b", "c" ]
+ *    a = [0, 1] + [2, 3]
+ *    a # => [0, 1, 2, 3]
  *
- *  See also Array#concat.
+ *  Related: #concat.
  */
 
 VALUE
@@ -3435,52 +5093,75 @@ rb_ary_plus(VALUE x, VALUE y)
     len = xlen + ylen;
     z = rb_ary_new2(len);
 
-    ary_memcpy(z, 0, xlen, RARRAY_RAWPTR(x));
-    ary_memcpy(z, xlen, ylen, RARRAY_RAWPTR(y));
+    ary_memcpy(z, 0, xlen, RARRAY_CONST_PTR_TRANSIENT(x));
+    ary_memcpy(z, xlen, ylen, RARRAY_CONST_PTR_TRANSIENT(y));
     ARY_SET_LEN(z, len);
     return z;
 }
 
+static VALUE
+ary_append(VALUE x, VALUE y)
+{
+    long n = RARRAY_LEN(y);
+    if (n > 0) {
+        rb_ary_splice(x, RARRAY_LEN(x), 0, RARRAY_CONST_PTR_TRANSIENT(y), n);
+    }
+    RB_GC_GUARD(y);
+    return x;
+}
+
 /*
  *  call-seq:
- *     ary.concat(other_ary)   -> ary
+ *    array.concat(*other_arrays) -> self
  *
- *  Appends the elements of +other_ary+ to +self+.
+ *  Adds to +array+ all elements from each \Array in +other_arrays+; returns +self+:
  *
- *     [ "a", "b" ].concat( ["c", "d"] ) #=> [ "a", "b", "c", "d" ]
- *     a = [ 1, 2, 3 ]
- *     a.concat( [ 4, 5 ] )
- *     a                                 #=> [ 1, 2, 3, 4, 5 ]
- *
- *  See also Array#+.
+ *    a = [0, 1]
+ *    a.concat([2, 3], [4, 5]) # => [0, 1, 2, 3, 4, 5]
  */
 
-VALUE
-rb_ary_concat(VALUE x, VALUE y)
+static VALUE
+rb_ary_concat_multi(int argc, VALUE *argv, VALUE ary)
 {
-    rb_ary_modify_check(x);
-    y = to_ary(y);
-    if (RARRAY_LEN(y) > 0) {
-	rb_ary_splice(x, RARRAY_LEN(x), 0, y);
+    rb_ary_modify_check(ary);
+
+    if (argc == 1) {
+        rb_ary_concat(ary, argv[0]);
     }
-    return x;
+    else if (argc > 1) {
+        int i;
+        VALUE args = rb_ary_hidden_new(argc);
+        for (i = 0; i < argc; i++) {
+            rb_ary_concat(args, argv[i]);
+        }
+        ary_append(ary, args);
+    }
+
+    ary_verify(ary);
+    return ary;
 }
 
+VALUE
+rb_ary_concat(VALUE x, VALUE y)
+{
+    return ary_append(x, to_ary(y));
+}
 
 /*
  *  call-seq:
- *     ary * int     -> new_ary
- *     ary * str     -> new_string
+ *    array * n -> new_array
+ *    array * string_separator -> new_string
  *
- *  Repetition --- With a String argument, equivalent to
- *  <code>ary.join(str)</code>.
+ *  When non-negative argument \Integer +n+ is given,
+ *  returns a new \Array built by concatenating the +n+ copies of +self+:
  *
- *  Otherwise, returns a new array built by concatenating the +int+ copies of
- *  +self+.
+ *    a = ['x', 'y']
+ *    a * 3 # => ["x", "y", "x", "y", "x", "y"]
  *
+ *  When \String argument +string_separator+ is given,
+ *  equivalent to <tt>array.join(string_separator)</tt>:
  *
- *     [ 1, 2, 3 ] * 3    #=> [ 1, 2, 3, 1, 2, 3, 1, 2, 3 ]
- *     [ 1, 2, 3 ] * ","  #=> "1,2,3"
+ *    [0, [0, 1], {foo: 0}] * ', ' # => "0, 0, 1, {:foo=>0}"
  *
  */
 
@@ -3493,61 +5174,54 @@ rb_ary_times(VALUE ary, VALUE times)
 
     tmp = rb_check_string_type(times);
     if (!NIL_P(tmp)) {
-	return rb_ary_join(ary, tmp);
+        return rb_ary_join(ary, tmp);
     }
 
     len = NUM2LONG(times);
     if (len == 0) {
-	ary2 = ary_new(rb_obj_class(ary), 0);
-	goto out;
+        ary2 = ary_new(rb_cArray, 0);
+        goto out;
     }
     if (len < 0) {
-	rb_raise(rb_eArgError, "negative argument");
+        rb_raise(rb_eArgError, "negative argument");
     }
     if (ARY_MAX_SIZE/len < RARRAY_LEN(ary)) {
-	rb_raise(rb_eArgError, "argument too big");
+        rb_raise(rb_eArgError, "argument too big");
     }
     len *= RARRAY_LEN(ary);
 
-    ary2 = ary_new(rb_obj_class(ary), len);
+    ary2 = ary_new(rb_cArray, len);
     ARY_SET_LEN(ary2, len);
 
-    ptr = RARRAY_RAWPTR(ary);
+    ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
     t = RARRAY_LEN(ary);
     if (0 < t) {
-	ary_memcpy(ary2, 0, t, ptr);
-	while (t <= len/2) {
-	    ary_memcpy(ary2, t, t, RARRAY_RAWPTR(ary2));
+        ary_memcpy(ary2, 0, t, ptr);
+        while (t <= len/2) {
+            ary_memcpy(ary2, t, t, RARRAY_CONST_PTR_TRANSIENT(ary2));
             t *= 2;
         }
         if (t < len) {
-	    ary_memcpy(ary2, t, len-t, RARRAY_RAWPTR(ary2));
+            ary_memcpy(ary2, t, len-t, RARRAY_CONST_PTR_TRANSIENT(ary2));
         }
     }
   out:
-    OBJ_INFECT(ary2, ary);
-
     return ary2;
 }
 
 /*
  *  call-seq:
- *     ary.assoc(obj)   -> new_ary  or  nil
+ *    array.assoc(obj) -> found_array or nil
  *
- *  Searches through an array whose elements are also arrays comparing +obj+
- *  with the first element of each contained array using <code>obj.==</code>.
+ *  Returns the first element in +self+ that is an \Array
+ *  whose first element <tt>==</tt> +obj+:
  *
- *  Returns the first contained array that matches (that is, the first
- *  associated array), or +nil+ if no match is found.
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.assoc(4) # => [4, 5, 6]
  *
- *  See also Array#rassoc
+ *  Returns +nil+ if no such element is found.
  *
- *     s1 = [ "colors", "red", "blue", "green" ]
- *     s2 = [ "letters", "a", "b", "c" ]
- *     s3 = "foo"
- *     a  = [ s1, s2, s3 ]
- *     a.assoc("letters")  #=> [ "letters", "a", "b", "c" ]
- *     a.assoc("foo")      #=> nil
+ *  Related: #rassoc.
  */
 
 VALUE
@@ -3557,30 +5231,27 @@ rb_ary_assoc(VALUE ary, VALUE key)
     VALUE v;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	v = rb_check_array_type(RARRAY_AREF(ary, i));
-	if (!NIL_P(v) && RARRAY_LEN(v) > 0 &&
-	    rb_equal(RARRAY_AREF(v, 0), key))
-	    return v;
+        v = rb_check_array_type(RARRAY_AREF(ary, i));
+        if (!NIL_P(v) && RARRAY_LEN(v) > 0 &&
+            rb_equal(RARRAY_AREF(v, 0), key))
+            return v;
     }
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rassoc(obj) -> new_ary or nil
- *
- *  Searches through the array whose elements are also arrays.
+ *    array.rassoc(obj) -> found_array or nil
  *
- *  Compares +obj+ with the second element of each contained array using
- *  <code>obj.==</code>.
+ *  Returns the first element in +self+ that is an \Array
+ *  whose second element <tt>==</tt> +obj+:
  *
- *  Returns the first contained array that matches +obj+.
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.rassoc(4) # => [2, 4]
  *
- *  See also Array#assoc.
+ *  Returns +nil+ if no such element is found.
  *
- *     a = [ [ 1, "one"], [2, "two"], [3, "three"], ["ii", "two"] ]
- *     a.rassoc("two")    #=> [2, "two"]
- *     a.rassoc("four")   #=> nil
+ *  Related: #assoc.
  */
 
 VALUE
@@ -3590,11 +5261,11 @@ rb_ary_rassoc(VALUE ary, VALUE value)
     VALUE v;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	v = RARRAY_AREF(ary, i);
-	if (RB_TYPE_P(v, T_ARRAY) &&
-	    RARRAY_LEN(v) > 1 &&
-	    rb_equal(RARRAY_AREF(v, 1), value))
-	    return v;
+        v = RARRAY_AREF(ary, i);
+        if (RB_TYPE_P(v, T_ARRAY) &&
+            RARRAY_LEN(v) > 1 &&
+            rb_equal(RARRAY_AREF(v, 1), value))
+            return v;
     }
     return Qnil;
 }
@@ -3607,43 +5278,48 @@ recursive_equal(VALUE ary1, VALUE ary2, int recur)
 
     if (recur) return Qtrue; /* Subtle! */
 
-    p1 = RARRAY_RAWPTR(ary1);
-    p2 = RARRAY_RAWPTR(ary2);
+    /* rb_equal() can evacuate ptrs */
+    p1 = RARRAY_CONST_PTR(ary1);
+    p2 = RARRAY_CONST_PTR(ary2);
     len1 = RARRAY_LEN(ary1);
 
     for (i = 0; i < len1; i++) {
-	if (*p1 != *p2) {
-	    if (rb_equal(*p1, *p2)) {
-		len1 = RARRAY_LEN(ary1);
-		if (len1 != RARRAY_LEN(ary2))
-		    return Qfalse;
-		if (len1 < i)
-		    return Qtrue;
-		p1 = RARRAY_RAWPTR(ary1) + i;
-		p2 = RARRAY_RAWPTR(ary2) + i;
-	    }
-	    else {
-		return Qfalse;
-	    }
-	}
-	p1++;
-	p2++;
+        if (*p1 != *p2) {
+            if (rb_equal(*p1, *p2)) {
+                len1 = RARRAY_LEN(ary1);
+                if (len1 != RARRAY_LEN(ary2))
+                    return Qfalse;
+                if (len1 < i)
+                    return Qtrue;
+                p1 = RARRAY_CONST_PTR(ary1) + i;
+                p2 = RARRAY_CONST_PTR(ary2) + i;
+            }
+            else {
+                return Qfalse;
+            }
+        }
+        p1++;
+        p2++;
     }
     return Qtrue;
 }
 
 /*
  *  call-seq:
- *     ary == other_ary   ->   bool
+ *    array == other_array -> true or false
  *
- *  Equality --- Two arrays are equal if they contain the same number of
- *  elements and if each element is equal to (according to Object#==) the
- *  corresponding element in +other_ary+.
+ *  Returns +true+ if both <tt>array.size == other_array.size</tt>
+ *  and for each index +i+ in +array+, <tt>array[i] == other_array[i]</tt>:
  *
- *     [ "a", "c" ]    == [ "a", "c", 7 ]     #=> false
- *     [ "a", "c", 7 ] == [ "a", "c", 7 ]     #=> true
- *     [ "a", "c", 7 ] == [ "a", "d", "f" ]   #=> false
+ *    a0 = [:foo, 'bar', 2]
+ *    a1 = [:foo, 'bar', 2.0]
+ *    a1 == a0 # => true
+ *    [] == [] # => true
  *
+ *  Otherwise, returns +false+.
+ *
+ *  This method is different from method Array#eql?,
+ *  which compares elements using <tt>Object#eql?</tt>.
  */
 
 static VALUE
@@ -3651,13 +5327,13 @@ rb_ary_equal(VALUE ary1, VALUE ary2)
 {
     if (ary1 == ary2) return Qtrue;
     if (!RB_TYPE_P(ary2, T_ARRAY)) {
-	if (!rb_respond_to(ary2, rb_intern("to_ary"))) {
-	    return Qfalse;
-	}
-	return rb_equal(ary2, ary1);
+        if (!rb_respond_to(ary2, idTo_ary)) {
+            return Qfalse;
+        }
+        return rb_equal(ary2, ary1);
     }
     if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse;
-    if (RARRAY_RAWPTR(ary1) == RARRAY_RAWPTR(ary2)) return Qtrue;
+    if (RARRAY_CONST_PTR_TRANSIENT(ary1) == RARRAY_CONST_PTR_TRANSIENT(ary2)) return Qtrue;
     return rb_exec_recursive_paired(recursive_equal, ary1, ary2, ary2);
 }
 
@@ -3668,18 +5344,27 @@ recursive_eql(VALUE ary1, VALUE ary2, int recur)
 
     if (recur) return Qtrue; /* Subtle! */
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	if (!rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
-	    return Qfalse;
+        if (!rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
+            return Qfalse;
     }
     return Qtrue;
 }
 
 /*
  *  call-seq:
- *     ary.eql?(other)  -> true or false
+ *    array.eql? other_array -> true or false
+ *
+ *  Returns +true+ if +self+ and +other_array+ are the same size,
+ *  and if, for each index +i+ in +self+, <tt>self[i].eql? other_array[i]</tt>:
+ *
+ *    a0 = [:foo, 'bar', 2]
+ *    a1 = [:foo, 'bar', 2]
+ *    a1.eql?(a0) # => true
  *
- *  Returns +true+ if +self+ and +other+ are the same object,
- *  or are both arrays with the same content (according to Object#eql?).
+ *  Otherwise, returns +false+.
+ *
+ *  This method is different from method Array#==,
+ *  which compares using method <tt>Object#==</tt>.
  */
 
 static VALUE
@@ -3688,72 +5373,80 @@ rb_ary_eql(VALUE ary1, VALUE ary2)
     if (ary1 == ary2) return Qtrue;
     if (!RB_TYPE_P(ary2, T_ARRAY)) return Qfalse;
     if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse;
-    if (RARRAY_RAWPTR(ary1) == RARRAY_RAWPTR(ary2)) return Qtrue;
+    if (RARRAY_CONST_PTR_TRANSIENT(ary1) == RARRAY_CONST_PTR_TRANSIENT(ary2)) return Qtrue;
     return rb_exec_recursive_paired(recursive_eql, ary1, ary2, ary2);
 }
 
-static VALUE
-recursive_hash(VALUE ary, VALUE dummy, int recur)
-{
-    long i;
-    st_index_t h;
-    VALUE n;
-
-    h = rb_hash_start(RARRAY_LEN(ary));
-    if (recur) {
-	h = rb_hash_uint(h, NUM2LONG(rb_hash(rb_cArray)));
-    }
-    else {
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    n = rb_hash(RARRAY_AREF(ary, i));
-	    h = rb_hash_uint(h, NUM2LONG(n));
-	}
-    }
-    h = rb_hash_end(h);
-    return LONG2FIX(h);
-}
-
 /*
  *  call-seq:
- *     ary.hash   -> fixnum
+ *    array.hash -> integer
+ *
+ *  Returns the integer hash value for +self+.
  *
- *  Compute a hash-code for this array.
+ *  Two arrays with the same content will have the same hash code (and will compare using eql?):
+ *
+ *    [0, 1, 2].hash == [0, 1, 2].hash # => true
+ *    [0, 1, 2].hash == [0, 1, 3].hash # => false
  *
- *  Two arrays with the same content will have the same hash code (and will
- *  compare using #eql?).
  */
 
 static VALUE
 rb_ary_hash(VALUE ary)
 {
-    return rb_exec_recursive_outer(recursive_hash, ary, 0);
+    long i;
+    st_index_t h;
+    VALUE n;
+
+    h = rb_hash_start(RARRAY_LEN(ary));
+    h = rb_hash_uint(h, (st_index_t)rb_ary_hash);
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        n = rb_hash(RARRAY_AREF(ary, i));
+        h = rb_hash_uint(h, NUM2LONG(n));
+    }
+    h = rb_hash_end(h);
+    return ST2FIX(h);
 }
 
 /*
  *  call-seq:
- *     ary.include?(object)   -> true or false
+ *    array.include?(obj) -> true or false
  *
- *  Returns +true+ if the given +object+ is present in +self+ (that is, if any
- *  element <code>==</code> +object+), otherwise returns +false+.
+ *  Returns +true+ if for some index +i+ in +self+, <tt>obj == self[i]</tt>;
+ *  otherwise +false+:
  *
- *     a = [ "a", "b", "c" ]
- *     a.include?("b")   #=> true
- *     a.include?("z")   #=> false
+ *    [0, 1, 2].include?(2) # => true
+ *    [0, 1, 2].include?(3) # => false
  */
 
 VALUE
 rb_ary_includes(VALUE ary, VALUE item)
 {
     long i;
+    VALUE e;
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	if (rb_equal(RARRAY_AREF(ary, i), item)) {
-	    return Qtrue;
-	}
+        e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, item)) {
+            return Qtrue;
+        }
     }
     return Qfalse;
 }
 
+static VALUE
+rb_ary_includes_by_eql(VALUE ary, VALUE item)
+{
+    long i;
+    VALUE e;
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (rb_eql(item, e)) {
+            return Qtrue;
+        }
+    }
+    return Qfalse;
+}
 
 static VALUE
 recursive_cmp(VALUE ary1, VALUE ary2, int recur)
@@ -3763,39 +5456,46 @@ recursive_cmp(VALUE ary1, VALUE ary2, int recur)
     if (recur) return Qundef;	/* Subtle! */
     len = RARRAY_LEN(ary1);
     if (len > RARRAY_LEN(ary2)) {
-	len = RARRAY_LEN(ary2);
+        len = RARRAY_LEN(ary2);
     }
     for (i=0; i<len; i++) {
-	VALUE v = rb_funcall(rb_ary_elt(ary1, i), id_cmp, 1, rb_ary_elt(ary2, i));
-	if (v != INT2FIX(0)) {
-	    return v;
-	}
+        VALUE e1 = rb_ary_elt(ary1, i), e2 = rb_ary_elt(ary2, i);
+        VALUE v = rb_funcallv(e1, id_cmp, 1, &e2);
+        if (v != INT2FIX(0)) {
+            return v;
+        }
     }
     return Qundef;
 }
 
 /*
  *  call-seq:
- *     ary <=> other_ary   ->  -1, 0, +1 or nil
+ *    array <=> other_array -> -1, 0, or 1
  *
- *  Comparison --- Returns an integer (+-1+, +0+, or <code>+1</code>) if this
- *  array is less than, equal to, or greater than +other_ary+.
+ *  Returns -1, 0, or 1 as +self+ is less than, equal to, or greater than +other_array+.
+ *  For each index +i+ in +self+, evaluates <tt>result = self[i] <=> other_array[i]</tt>.
  *
- *  +nil+ is returned if the two values are incomparable.
+ *  Returns -1 if any result is -1:
  *
- *  Each object in each array is compared (using the <=> operator).
+ *    [0, 1, 2] <=> [0, 1, 3] # => -1
  *
- *  Arrays are compared in an "element-wise" manner; the first two elements
- *  that are not equal will determine the return value for the whole
- *  comparison.
+ *  Returns 1 if any result is 1:
  *
- *  If all the values are equal, then the return is based on a comparison of
- *  the array lengths. Thus, two arrays are "equal" according to Array#<=> if,
- *  and only if, they have the same length and the value of each element is
- *  equal to the value of the corresponding element in the other array.
+ *    [0, 1, 2] <=> [0, 1, 1] # => 1
  *
- *     [ "a", "a", "c" ]    <=> [ "a", "b", "c" ]   #=> -1
- *     [ 1, 2, 3, 4, 5, 6 ] <=> [ 1, 2 ]            #=> +1
+ *  When all results are zero:
+ *
+ *  - Returns -1 if +array+ is smaller than +other_array+:
+ *
+ *      [0, 1, 2] <=> [0, 1, 2, 3] # => -1
+ *
+ *  - Returns 1 if +array+ is larger than +other_array+:
+ *
+ *      [0, 1, 2] <=> [0, 1] # => 1
+ *
+ *  - Returns 0 if +array+ and +other_array+ are the same size:
+ *
+ *      [0, 1, 2] <=> [0, 1, 2] # => 0
  *
  */
 
@@ -3809,7 +5509,7 @@ rb_ary_cmp(VALUE ary1, VALUE ary2)
     if (NIL_P(ary2)) return Qnil;
     if (ary1 == ary2) return INT2FIX(0);
     v = rb_exec_recursive_paired(recursive_cmp, ary1, ary2, ary2);
-    if (v != Qundef) return v;
+    if (!UNDEF_P(v)) return v;
     len = RARRAY_LEN(ary1) - RARRAY_LEN(ary2);
     if (len == 0) return INT2FIX(0);
     if (len > 0) return INT2FIX(1);
@@ -3822,15 +5522,17 @@ ary_add_hash(VALUE hash, VALUE ary)
     long i;
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_hash_aset(hash, RARRAY_AREF(ary, i), Qtrue);
+        VALUE elt = RARRAY_AREF(ary, i);
+        rb_hash_add_new_element(hash, elt, elt);
     }
     return hash;
 }
 
 static inline VALUE
-ary_tmp_hash_new(void)
+ary_tmp_hash_new(VALUE ary)
 {
-    VALUE hash = rb_hash_new();
+    long size = RARRAY_LEN(ary);
+    VALUE hash = rb_hash_new_with_size(size);
 
     RBASIC_CLEAR_CLASS(hash);
     return hash;
@@ -3839,7 +5541,7 @@ ary_tmp_hash_new(void)
 static VALUE
 ary_make_hash(VALUE ary)
 {
-    VALUE hash = ary_tmp_hash_new();
+    VALUE hash = ary_tmp_hash_new(ary);
     return ary_add_hash(hash, ary);
 }
 
@@ -3849,10 +5551,8 @@ ary_add_hash_by(VALUE hash, VALUE ary)
     long i;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	VALUE v = rb_ary_elt(ary, i), k = rb_yield(v);
-	if (rb_hash_lookup2(hash, k, Qundef) == Qundef) {
-	    rb_hash_aset(hash, k, v);
-	}
+        VALUE v = rb_ary_elt(ary, i), k = rb_yield(v);
+        rb_hash_add_new_element(hash, k, v);
     }
     return hash;
 }
@@ -3860,50 +5560,61 @@ ary_add_hash_by(VALUE hash, VALUE ary)
 static VALUE
 ary_make_hash_by(VALUE ary)
 {
-    VALUE hash = ary_tmp_hash_new();
+    VALUE hash = ary_tmp_hash_new(ary);
     return ary_add_hash_by(hash, ary);
 }
 
 static inline void
 ary_recycle_hash(VALUE hash)
 {
-    if (RHASH(hash)->ntbl) {
-	st_table *tbl = RHASH(hash)->ntbl;
-	RHASH(hash)->ntbl = 0;
-	st_free_table(tbl);
+    assert(RBASIC_CLASS(hash) == 0);
+    if (RHASH_ST_TABLE_P(hash)) {
+        st_table *tbl = RHASH_ST_TABLE(hash);
+        st_free_table(tbl);
+        RHASH_ST_CLEAR(hash);
     }
 }
 
 /*
  *  call-seq:
- *     ary - other_ary    -> new_ary
- *
- *  Array Difference
- *
- *  Returns a new array that is a copy of the original array, removing any
- *  items that also appear in +other_ary+. The order is preserved from the
- *  original array.
+ *    array - other_array -> new_array
  *
- *  It compares elements using their #hash and #eql? methods for efficiency.
+ *  Returns a new \Array containing only those elements from +array+
+ *  that are not found in \Array +other_array+;
+ *  items are compared using <tt>eql?</tt>;
+ *  the order from +array+ is preserved:
  *
- *     [ 1, 1, 2, 2, 3, 3, 4, 5 ] - [ 1, 2, 4 ]  #=>  [ 3, 3, 5 ]
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1] - [1] # => [0, 2, 3]
+ *    [0, 1, 2, 3] - [3, 0] # => [1, 2]
+ *    [0, 1, 2] - [4] # => [0, 1, 2]
  *
- *  If you need set-like behavior, see the library class Set.
+ *  Related: Array#difference.
  */
 
-static VALUE
+VALUE
 rb_ary_diff(VALUE ary1, VALUE ary2)
 {
     VALUE ary3;
-    volatile VALUE hash;
+    VALUE hash;
     long i;
 
-    hash = ary_make_hash(to_ary(ary2));
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary2) == 0) { return ary_make_shared_copy(ary1); }
     ary3 = rb_ary_new();
 
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN || RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            VALUE elt = rb_ary_elt(ary1, i);
+            if (rb_ary_includes_by_eql(ary2, elt)) continue;
+            rb_ary_push(ary3, elt);
+        }
+        return ary3;
+    }
+
+    hash = ary_make_hash(ary2);
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	if (st_lookup(rb_hash_tbl_raw(hash), RARRAY_AREF(ary1, i), 0)) continue;
-	rb_ary_push(ary3, rb_ary_elt(ary1, i));
+        if (rb_hash_stlike_lookup(hash, RARRAY_AREF(ary1, i), NULL)) continue;
+        rb_ary_push(ary3, rb_ary_elt(ary1, i));
     }
     ary_recycle_hash(hash);
     return ary3;
@@ -3911,18 +5622,73 @@ rb_ary_diff(VALUE ary1, VALUE ary2)
 
 /*
  *  call-seq:
- *     ary & other_ary      -> new_ary
+ *    array.difference(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array containing only those elements from +self+
+ *  that are not found in any of the Arrays +other_arrays+;
+ *  items are compared using <tt>eql?</tt>;  order from +self+ is preserved:
+ *
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1].difference([1]) # => [0, 2, 3]
+ *    [0, 1, 2, 3].difference([3, 0], [1, 3]) # => [2]
+ *    [0, 1, 2].difference([4]) # => [0, 1, 2]
+ *
+ *  Returns a copy of +self+ if no arguments given.
+ *
+ *  Related: Array#-.
+ */
+
+static VALUE
+rb_ary_difference_multi(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE ary_diff;
+    long i, length;
+    volatile VALUE t0;
+    bool *is_hash = ALLOCV_N(bool, t0, argc);
+    ary_diff = rb_ary_new();
+    length = RARRAY_LEN(ary);
+
+    for (i = 0; i < argc; i++) {
+        argv[i] = to_ary(argv[i]);
+        is_hash[i] = (length > SMALL_ARRAY_LEN && RARRAY_LEN(argv[i]) > SMALL_ARRAY_LEN);
+        if (is_hash[i]) argv[i] = ary_make_hash(argv[i]);
+    }
+
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        int j;
+        VALUE elt = rb_ary_elt(ary, i);
+        for (j = 0; j < argc; j++) {
+            if (is_hash[j]) {
+                if (rb_hash_stlike_lookup(argv[j], RARRAY_AREF(ary, i), NULL))
+                    break;
+            }
+            else {
+                if (rb_ary_includes_by_eql(argv[j], elt)) break;
+            }
+        }
+        if (j == argc) rb_ary_push(ary_diff, elt);
+    }
+
+    ALLOCV_END(t0);
+
+    return ary_diff;
+}
+
+
+/*
+ *  call-seq:
+ *    array & other_array -> new_array
+ *
+ *  Returns a new \Array containing each element found in both +array+ and \Array +other_array+;
+ *  duplicates are omitted; items are compared using <tt>eql?</tt>:
  *
- *  Set Intersection --- Returns a new array containing elements common to the
- *  two arrays, excluding any duplicates. The order is preserved from the
- *  original array.
+ *    [0, 1, 2, 3] & [1, 2] # => [1, 2]
+ *    [0, 1, 0, 1] & [0, 1] # => [0, 1]
  *
- *  It compares elements using their #hash and #eql? methods for efficiency.
+ *  Preserves order from +array+:
  *
- *     [ 1, 1, 3, 5 ] & [ 1, 2, 3 ]                 #=> [ 1, 3 ]
- *     [ 'a', 'b', 'b', 'z' ] & [ 'a', 'b', 'c' ]   #=> [ 'a', 'b' ]
+ *    [0, 1, 2] & [3, 2, 1, 0] # => [0, 1, 2]
  *
- *  See also Array#uniq.
+ *  Related: Array#intersection.
  */
 
 
@@ -3934,18 +5700,27 @@ rb_ary_and(VALUE ary1, VALUE ary2)
     long i;
 
     ary2 = to_ary(ary2);
-    ary3 = rb_ary_new2(RARRAY_LEN(ary1) < RARRAY_LEN(ary2) ?
-	    RARRAY_LEN(ary1) : RARRAY_LEN(ary2));
-    hash = ary_make_hash(ary2);
-
-    if (RHASH_EMPTY_P(hash))
+    ary3 = rb_ary_new();
+    if (RARRAY_LEN(ary1) == 0 || RARRAY_LEN(ary2) == 0) return ary3;
+
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN && RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            v = RARRAY_AREF(ary1, i);
+            if (!rb_ary_includes_by_eql(ary2, v)) continue;
+            if (rb_ary_includes_by_eql(ary3, v)) continue;
+            rb_ary_push(ary3, v);
+        }
         return ary3;
+    }
+
+    hash = ary_make_hash(ary2);
 
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary1, i));
-	if (st_delete(rb_hash_tbl_raw(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+        v = RARRAY_AREF(ary1, i);
+        vv = (st_data_t)v;
+        if (rb_hash_stlike_delete(hash, &vv, 0)) {
+            rb_ary_push(ary3, v);
+        }
     }
     ary_recycle_hash(hash);
 
@@ -3954,43 +5729,572 @@ rb_ary_and(VALUE ary1, VALUE ary2)
 
 /*
  *  call-seq:
- *     ary | other_ary     -> new_ary
+ *    array.intersection(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array containing each element found both in +self+
+ *  and in all of the given Arrays +other_arrays+;
+ *  duplicates are omitted; items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
+ *    [0, 0, 1, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
  *
- *  Set Union --- Returns a new array by joining +ary+ with +other_ary+,
- *  excluding any duplicates and preserving the order from the original array.
+ *  Preserves order from +self+:
  *
- *  It compares elements using their #hash and #eql? methods for efficiency.
+ *    [0, 1, 2].intersection([2, 1, 0]) # => [0, 1, 2]
  *
- *     [ "a", "b", "c" ] | [ "c", "d", "a" ]    #=> [ "a", "b", "c", "d" ]
+ *  Returns a copy of +self+ if no arguments given.
  *
- *  See also Array#uniq.
+ *  Related: Array#&.
+ */
+
+static VALUE
+rb_ary_intersection_multi(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = rb_ary_dup(ary);
+    int i;
+
+    for (i = 0; i < argc; i++) {
+        result = rb_ary_and(result, argv[i]);
+    }
+
+    return result;
+}
+
+static int
+ary_hash_orset(st_data_t *key, st_data_t *value, st_data_t arg, int existing)
+{
+    if (existing) return ST_STOP;
+    *key = *value = (VALUE)arg;
+    return ST_CONTINUE;
+}
+
+static void
+rb_ary_union(VALUE ary_union, VALUE ary)
+{
+    long i;
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        VALUE elt = rb_ary_elt(ary, i);
+        if (rb_ary_includes_by_eql(ary_union, elt)) continue;
+        rb_ary_push(ary_union, elt);
+    }
+}
+
+static void
+rb_ary_union_hash(VALUE hash, VALUE ary2)
+{
+    long i;
+    for (i = 0; i < RARRAY_LEN(ary2); i++) {
+        VALUE elt = RARRAY_AREF(ary2, i);
+        if (!rb_hash_stlike_update(hash, (st_data_t)elt, ary_hash_orset, (st_data_t)elt)) {
+            RB_OBJ_WRITTEN(hash, Qundef, elt);
+        }
+    }
+}
+
+/*
+ *  call-seq:
+ *    array | other_array -> new_array
+ *
+ *  Returns the union of +array+ and \Array +other_array+;
+ *  duplicates are removed; order is preserved;
+ *  items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1] | [2, 3] # => [0, 1, 2, 3]
+ *    [0, 1, 1] | [2, 2, 3] # => [0, 1, 2, 3]
+ *    [0, 1, 2] | [3, 2, 1, 0] # => [0, 1, 2, 3]
+ *
+ *  Related: Array#union.
  */
 
 static VALUE
 rb_ary_or(VALUE ary1, VALUE ary2)
 {
-    VALUE hash, ary3, v;
+    VALUE hash, ary3;
+
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary1) + RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        ary3 = rb_ary_new();
+        rb_ary_union(ary3, ary1);
+        rb_ary_union(ary3, ary2);
+        return ary3;
+    }
+
+    hash = ary_make_hash(ary1);
+    rb_ary_union_hash(hash, ary2);
+
+    ary3 = rb_hash_values(hash);
+    ary_recycle_hash(hash);
+    return ary3;
+}
+
+/*
+ *  call-seq:
+ *    array.union(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array that is the union of +self+ and all given Arrays +other_arrays+;
+ *  duplicates are removed;  order is preserved;  items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1, 2, 3].union([4, 5], [6, 7]) # => [0, 1, 2, 3, 4, 5, 6, 7]
+ *    [0, 1, 1].union([2, 1], [3, 1]) # => [0, 1, 2, 3]
+ *    [0, 1, 2, 3].union([3, 2], [1, 0]) # => [0, 1, 2, 3]
+ *
+ *  Returns a copy of +self+ if no arguments given.
+ *
+ *  Related: Array#|.
+ */
+
+static VALUE
+rb_ary_union_multi(int argc, VALUE *argv, VALUE ary)
+{
+    int i;
+    long sum;
+    VALUE hash, ary_union;
+
+    sum = RARRAY_LEN(ary);
+    for (i = 0; i < argc; i++) {
+        argv[i] = to_ary(argv[i]);
+        sum += RARRAY_LEN(argv[i]);
+    }
+
+    if (sum <= SMALL_ARRAY_LEN) {
+        ary_union = rb_ary_new();
+
+        rb_ary_union(ary_union, ary);
+        for (i = 0; i < argc; i++) rb_ary_union(ary_union, argv[i]);
+
+        return ary_union;
+    }
+
+    hash = ary_make_hash(ary);
+    for (i = 0; i < argc; i++) rb_ary_union_hash(hash, argv[i]);
+
+    ary_union = rb_hash_values(hash);
+    ary_recycle_hash(hash);
+    return ary_union;
+}
+
+/*
+ *  call-seq:
+ *     ary.intersect?(other_ary)   -> true or false
+ *
+ *  Returns +true+ if the array and +other_ary+ have at least one element in
+ *  common, otherwise returns +false+:
+ *
+ *     a = [ 1, 2, 3 ]
+ *     b = [ 3, 4, 5 ]
+ *     c = [ 5, 6, 7 ]
+ *     a.intersect?(b)   #=> true
+ *     a.intersect?(c)   #=> false
+ *
+ */
+
+static VALUE
+rb_ary_intersect_p(VALUE ary1, VALUE ary2)
+{
+    VALUE hash, v, result, shorter, longer;
     st_data_t vv;
     long i;
 
     ary2 = to_ary(ary2);
-    ary3 = rb_ary_new2(RARRAY_LEN(ary1)+RARRAY_LEN(ary2));
-    hash = ary_add_hash(ary_make_hash(ary1), ary2);
+    if (RARRAY_LEN(ary1) == 0 || RARRAY_LEN(ary2) == 0) return Qfalse;
 
-    for (i=0; i<RARRAY_LEN(ary1); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary1, i));
-	if (st_delete(rb_hash_tbl_raw(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN && RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            v = RARRAY_AREF(ary1, i);
+            if (rb_ary_includes_by_eql(ary2, v)) return Qtrue;
+        }
+        return Qfalse;
+    }
+
+    shorter = ary1;
+    longer = ary2;
+    if (RARRAY_LEN(ary1) > RARRAY_LEN(ary2)) {
+        longer = ary1;
+        shorter = ary2;
     }
-    for (i=0; i<RARRAY_LEN(ary2); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary2, i));
-	if (st_delete(rb_hash_tbl_raw(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+
+    hash = ary_make_hash(shorter);
+    result = Qfalse;
+
+    for (i=0; i<RARRAY_LEN(longer); i++) {
+        v = RARRAY_AREF(longer, i);
+        vv = (st_data_t)v;
+        if (rb_hash_stlike_lookup(hash, vv, 0)) {
+            result = Qtrue;
+            break;
+        }
     }
     ary_recycle_hash(hash);
-    return ary3;
+
+    return result;
+}
+
+static VALUE
+ary_max_generic(VALUE ary, long i, VALUE vmax)
+{
+    RUBY_ASSERT(i > 0 && i < RARRAY_LEN(ary));
+
+    VALUE v;
+    for (; i < RARRAY_LEN(ary); ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (rb_cmpint(rb_funcallv(vmax, id_cmp, 1, &v), vmax, v) < 0) {
+            vmax = v;
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_fixnum(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(FIXNUM_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (FIXNUM_P(v)) {
+            if ((long)vmax < (long)v) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_float(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(RB_FLOAT_TYPE_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (RB_FLOAT_TYPE_P(v)) {
+            if (rb_float_cmp(vmax, v) < 0) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_string(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(STRING_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (STRING_P(v)) {
+            if (rb_str_cmp(vmax, v) < 0) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+/*
+ *  call-seq:
+ *    array.max -> element
+ *    array.max {|a, b| ... } -> element
+ *    array.max(n) -> new_array
+ *    array.max(n) {|a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The maximum-valued element from +self+.
+ *  - A new \Array of maximum-valued elements selected from +self+.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the maximum value per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].max # => 2
+ *
+ *  With an argument \Integer +n+ and no block, returns a new \Array with at most +n+ elements,
+ *  in descending order per method <tt><=></tt>:
+ *
+ *    [0, 1, 2, 3].max(3) # => [3, 2, 1]
+ *    [0, 1, 2, 3].max(6) # => [3, 2, 1, 0]
+ *
+ *  When a block is given, the block must return an \Integer.
+ *
+ *  With a block and no argument, calls the block <tt>self.size-1</tt> times to compare elements;
+ *  returns the element having the maximum value per the block:
+ *
+ *    ['0', '00', '000'].max {|a, b| a.size <=> b.size } # => "000"
+ *
+ *  With an argument +n+ and a block, returns a new \Array with at most +n+ elements,
+ *  in descending order per the block:
+ *
+ *    ['0', '00', '000'].max(2) {|a, b| a.size <=> b.size } # => ["000", "00"]
+ *
+ */
+static VALUE
+rb_ary_max(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = Qundef, v;
+    VALUE num;
+    long i;
+
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(num = argv[0]))
+       return rb_nmin_run(ary, num, 0, 1, 1);
+
+    const long n = RARRAY_LEN(ary);
+    if (rb_block_given_p()) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+           v = RARRAY_AREF(ary, i);
+           if (UNDEF_P(result) || rb_cmpint(rb_yield_values(2, v, result), v, result) > 0) {
+               result = v;
+           }
+        }
+    }
+    else if (n > 0) {
+        result = RARRAY_AREF(ary, 0);
+        if (n > 1) {
+            if (FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
+                return ary_max_opt_fixnum(ary, 1, result);
+            }
+            else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
+                return ary_max_opt_string(ary, 1, result);
+            }
+            else if (RB_FLOAT_TYPE_P(result) && CMP_OPTIMIZABLE(FLOAT)) {
+                return ary_max_opt_float(ary, 1, result);
+            }
+            else {
+                return ary_max_generic(ary, 1, result);
+            }
+        }
+    }
+    if (UNDEF_P(result)) return Qnil;
+    return result;
+}
+
+static VALUE
+ary_min_generic(VALUE ary, long i, VALUE vmin)
+{
+    RUBY_ASSERT(i > 0 && i < RARRAY_LEN(ary));
+
+    VALUE v;
+    for (; i < RARRAY_LEN(ary); ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (rb_cmpint(rb_funcallv(vmin, id_cmp, 1, &v), vmin, v) > 0) {
+            vmin = v;
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_fixnum(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(FIXNUM_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (FIXNUM_P(a)) {
+            if ((long)vmin > (long)a) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_float(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(RB_FLOAT_TYPE_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (RB_FLOAT_TYPE_P(a)) {
+            if (rb_float_cmp(vmin, a) > 0) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_string(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(STRING_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (STRING_P(a)) {
+            if (rb_str_cmp(vmin, a) > 0) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+/*
+ *  call-seq:
+ *    array.min -> element
+ *    array.min { |a, b| ... } -> element
+ *    array.min(n) -> new_array
+ *    array.min(n) { |a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The minimum-valued element from +self+.
+ *  - A new \Array of minimum-valued elements selected from +self+.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the minimum value per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].min # => 0
+ *
+ *  With \Integer argument +n+ and no block, returns a new \Array with at most +n+ elements,
+ *  in ascending order per method <tt><=></tt>:
+ *
+ *    [0, 1, 2, 3].min(3) # => [0, 1, 2]
+ *    [0, 1, 2, 3].min(6) # => [0, 1, 2, 3]
+ *
+ *  When a block is given, the block must return an Integer.
+ *
+ *  With a block and no argument, calls the block <tt>self.size-1</tt> times to compare elements;
+ *  returns the element having the minimum value per the block:
+ *
+ *    ['0', '00', '000'].min { |a, b| a.size <=> b.size } # => "0"
+ *
+ *  With an argument +n+ and a block, returns a new \Array with at most +n+ elements,
+ *  in ascending order per the block:
+ *
+ *    ['0', '00', '000'].min(2) {|a, b| a.size <=> b.size } # => ["0", "00"]
+ *
+ */
+static VALUE
+rb_ary_min(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = Qundef, v;
+    VALUE num;
+    long i;
+
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(num = argv[0]))
+       return rb_nmin_run(ary, num, 0, 0, 1);
+
+    const long n = RARRAY_LEN(ary);
+    if (rb_block_given_p()) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+           v = RARRAY_AREF(ary, i);
+           if (UNDEF_P(result) || rb_cmpint(rb_yield_values(2, v, result), v, result) < 0) {
+               result = v;
+           }
+        }
+    }
+    else if (n > 0) {
+        result = RARRAY_AREF(ary, 0);
+        if (n > 1) {
+            if (FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
+                return ary_min_opt_fixnum(ary, 1, result);
+            }
+            else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
+                return ary_min_opt_string(ary, 1, result);
+            }
+            else if (RB_FLOAT_TYPE_P(result) && CMP_OPTIMIZABLE(FLOAT)) {
+                return ary_min_opt_float(ary, 1, result);
+            }
+            else {
+                return ary_min_generic(ary, 1, result);
+            }
+        }
+    }
+    if (UNDEF_P(result)) return Qnil;
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    array.minmax -> [min_val, max_val]
+ *    array.minmax {|a, b| ... } -> [min_val, max_val]
+ *
+ *  Returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, either per method <tt><=></tt> or per a given block:.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer;
+ *  returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].minmax # => [0, 2]
+ *
+ *  When a block is given, the block must return an \Integer;
+ *  the block is called <tt>self.size-1</tt> times to compare elements;
+ *  returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, per the block:
+ *
+ *    ['0', '00', '000'].minmax {|a, b| a.size <=> b.size } # => ["0", "000"]
+ *
+ */
+static VALUE
+rb_ary_minmax(VALUE ary)
+{
+    if (rb_block_given_p()) {
+        return rb_call_super(0, NULL);
+    }
+    return rb_assoc_new(rb_ary_min(0, 0, ary), rb_ary_max(0, 0, ary));
 }
 
 static int
@@ -4002,65 +6306,59 @@ push_value(st_data_t key, st_data_t val, st_data_t ary)
 
 /*
  *  call-seq:
- *     ary.uniq!                -> ary or nil
- *     ary.uniq! { |item| ... } -> ary or nil
+ *    array.uniq! -> self or nil
+ *    array.uniq! {|element| ... } -> self or nil
+ *
+ *  Removes duplicate elements from +self+, the first occurrence always being retained;
+ *  returns +self+ if any elements removed, +nil+ otherwise.
  *
- *  Removes duplicate elements from +self+.
+ *  With no block given, identifies and removes elements using method <tt>eql?</tt>
+ *  to compare.
  *
- *  If a block is given, it will use the return value of the block for
- *  comparison.
+ *  Returns +self+ if any elements removed:
  *
- *  It compares values using their #hash and #eql? methods for efficiency.
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq! # => [0, 1, 2]
  *
- *  Returns +nil+ if no changes are made (that is, no duplicates are found).
+ *  Returns +nil+ if no elements removed.
  *
- *     a = [ "a", "a", "b", "b", "c" ]
- *     a.uniq!   # => ["a", "b", "c"]
+ *  With a block given, calls the block for each element;
+ *  identifies (using method <tt>eql?</tt>) and removes
+ *  elements for which the block returns duplicate values.
  *
- *     b = [ "a", "b", "c" ]
- *     b.uniq!   # => nil
+ *  Returns +self+ if any elements removed:
  *
- *     c = [["student","sam"], ["student","george"], ["teacher","matz"]]
- *     c.uniq! { |s| s.first } # => [["student", "sam"], ["teacher", "matz"]]
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq! {|element| element.size } # => ['a', 'aa', 'aaa']
  *
+ *  Returns +nil+ if no elements removed.
  */
-
 static VALUE
 rb_ary_uniq_bang(VALUE ary)
 {
-    VALUE hash, v;
-    long i, j;
+    VALUE hash;
+    long hash_size;
 
     rb_ary_modify_check(ary);
     if (RARRAY_LEN(ary) <= 1)
         return Qnil;
-    if (rb_block_given_p()) {
-	hash = ary_make_hash_by(ary);
-	if (RARRAY_LEN(ary) == (i = RHASH_SIZE(hash))) {
-	    return Qnil;
-	}
-	rb_ary_modify(ary);
-	ARY_SET_LEN(ary, 0);
-	if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
-	    rb_ary_unshare(ary);
-	    FL_SET_EMBED(ary);
-	}
-	ary_resize_capa(ary, i);
-	st_foreach(rb_hash_tbl_raw(hash), push_value, ary);
+    if (rb_block_given_p())
+        hash = ary_make_hash_by(ary);
+    else
+        hash = ary_make_hash(ary);
+
+    hash_size = RHASH_SIZE(hash);
+    if (RARRAY_LEN(ary) == hash_size) {
+        return Qnil;
     }
-    else {
-	hash = ary_make_hash(ary);
-	if (RARRAY_LEN(ary) == (long)RHASH_SIZE(hash)) {
-	    return Qnil;
-	}
-	for (i=j=0; i<RARRAY_LEN(ary); i++) {
-	    st_data_t vv = (st_data_t)(v = rb_ary_elt(ary, i));
-	    if (st_delete(rb_hash_tbl_raw(hash), &vv, 0)) {
-		rb_ary_store(ary, j++, v);
-	    }
-	}
-	ARY_SET_LEN(ary, j);
+    rb_ary_modify_check(ary);
+    ARY_SET_LEN(ary, 0);
+    if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
+        rb_ary_unshare(ary);
+        FL_SET_EMBED(ary);
     }
+    ary_resize_capa(ary, hash_size);
+    rb_hash_foreach(hash, push_value, ary);
     ary_recycle_hash(hash);
 
     return ary;
@@ -4068,61 +6366,58 @@ rb_ary_uniq_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.uniq                -> new_ary
- *     ary.uniq { |item| ... } -> new_ary
+ *    array.uniq -> new_array
+ *    array.uniq {|element| ... } -> new_array
  *
- *  Returns a new array by removing duplicate values in +self+.
+ *  Returns a new \Array containing those elements from +self+ that are not duplicates,
+ *  the first occurrence always being retained.
  *
- *  If a block is given, it will use the return value of the block for comparison.
+ *  With no block given, identifies and omits duplicates using method <tt>eql?</tt>
+ *  to compare:
  *
- *  It compares values using their #hash and #eql? methods for efficiency.
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq # => [0, 1, 2]
  *
- *     a = [ "a", "a", "b", "b", "c" ]
- *     a.uniq   # => ["a", "b", "c"]
+ *  With a block given, calls the block for each element;
+ *  identifies (using method <tt>eql?</tt>) and omits duplicate values,
+ *  that is, those elements for which the block returns the same value:
  *
- *     b = [["student","sam"], ["student","george"], ["teacher","matz"]]
- *     b.uniq { |s| s.first } # => [["student", "sam"], ["teacher", "matz"]]
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq {|element| element.size } # => ["a", "aa", "aaa"]
  *
  */
 
 static VALUE
 rb_ary_uniq(VALUE ary)
 {
-    VALUE hash, uniq, v;
-    long i;
+    VALUE hash, uniq;
 
-    if (RARRAY_LEN(ary) <= 1)
-        return rb_ary_dup(ary);
-    if (rb_block_given_p()) {
-	hash = ary_make_hash_by(ary);
-	uniq = ary_new(rb_obj_class(ary), RHASH_SIZE(hash));
-	st_foreach(rb_hash_tbl_raw(hash), push_value, uniq);
+    if (RARRAY_LEN(ary) <= 1) {
+        hash = 0;
+        uniq = rb_ary_dup(ary);
+    }
+    else if (rb_block_given_p()) {
+        hash = ary_make_hash_by(ary);
+        uniq = rb_hash_values(hash);
     }
     else {
-	hash = ary_make_hash(ary);
-	uniq = ary_new(rb_obj_class(ary), RHASH_SIZE(hash));
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    st_data_t vv = (st_data_t)(v = rb_ary_elt(ary, i));
-	    if (st_delete(rb_hash_tbl_raw(hash), &vv, 0)) {
-		rb_ary_push(uniq, v);
-	    }
-	}
+        hash = ary_make_hash(ary);
+        uniq = rb_hash_values(hash);
+    }
+    if (hash) {
+        ary_recycle_hash(hash);
     }
-    ary_recycle_hash(hash);
 
     return uniq;
 }
 
 /*
  *  call-seq:
- *     ary.compact!    -> ary  or  nil
- *
- *  Removes +nil+ elements from the array.
+ *    array.compact! -> self or nil
  *
- *  Returns +nil+ if no changes were made, otherwise returns the array.
+ *  Removes all +nil+ elements from +self+.
  *
- *     [ "a", nil, "b", nil, "c" ].compact! #=> [ "a", "b", "c" ]
- *     [ "a", "b", "c" ].compact!           #=> nil
+ *  Returns +self+ if any elements removed, otherwise +nil+.
  */
 
 static VALUE
@@ -4132,33 +6427,30 @@ rb_ary_compact_bang(VALUE ary)
     long n;
 
     rb_ary_modify(ary);
-    p = t = (VALUE *)RARRAY_RAWPTR(ary); /* WB: no new reference */
+    p = t = (VALUE *)RARRAY_CONST_PTR_TRANSIENT(ary); /* WB: no new reference */
     end = p + RARRAY_LEN(ary);
 
     while (t < end) {
-	if (NIL_P(*t)) t++;
-	else *p++ = *t++;
+        if (NIL_P(*t)) t++;
+        else *p++ = *t++;
     }
-    n = p - RARRAY_RAWPTR(ary);
+    n = p - RARRAY_CONST_PTR_TRANSIENT(ary);
     if (RARRAY_LEN(ary) == n) {
-	return Qnil;
-    }
-    ARY_SET_LEN(ary, n);
-    if (n * 2 < ARY_CAPA(ary) && ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
-	ary_resize_capa(ary, n * 2);
+        return Qnil;
     }
+    ary_resize_smaller(ary, n);
 
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.compact     -> new_ary
+ *    array.compact -> new_array
  *
- *  Returns a copy of +self+ with all +nil+ elements removed.
+ *  Returns a new \Array containing all non-+nil+ elements from +self+:
  *
- *     [ "a", nil, "b", nil, "c", nil ].compact
- *                       #=> [ "a", "b", "c" ]
+ *    a = [nil, 0, nil, 1, nil, 2, nil]
+ *    a.compact # => [0, 1, 2]
  */
 
 static VALUE
@@ -4171,23 +6463,29 @@ rb_ary_compact(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.count                   -> int
- *     ary.count(obj)              -> int
- *     ary.count { |item| block }  -> int
+ *    array.count -> an_integer
+ *    array.count(obj) -> an_integer
+ *    array.count {|element| ... } -> an_integer
+ *
+ *  Returns a count of specified elements.
  *
- *  Returns the number of elements.
+ *  With no argument and no block, returns the count of all elements:
  *
- *  If an argument is given, counts the number of elements which equal +obj+
- *  using <code>==</code>.
+ *    [0, 1, 2].count # => 3
+ *    [].count # => 0
  *
- *  If a block is given, counts the number of elements for which the block
- *  returns a true value.
+ *  With argument +obj+, returns the count of elements <tt>==</tt> to +obj+:
  *
- *     ary = [1, 2, 4, 2]
- *     ary.count                  #=> 4
- *     ary.count(2)               #=> 2
- *     ary.count { |x| x%2 == 0 } #=> 3
+ *    [0, 1, 2, 0.0].count(0) # => 2
+ *    [0, 1, 2].count(3) # => 0
  *
+ *  With no argument and a block given, calls the block with each element;
+ *  returns the count of elements for which the block returns a truthy value:
+ *
+ *    [0, 1, 2, 3].count {|element| element > 1} # => 2
+ *
+ *  With argument +obj+ and a block given, issues a warning, ignores the block,
+ *  and returns the count of elements <tt>==</tt> to +obj+.
  */
 
 static VALUE
@@ -4195,104 +6493,152 @@ rb_ary_count(int argc, VALUE *argv, VALUE ary)
 {
     long i, n = 0;
 
-    if (argc == 0) {
-	VALUE v;
+    if (rb_check_arity(argc, 0, 1) == 0) {
+        VALUE v;
 
-	if (!rb_block_given_p())
-	    return LONG2NUM(RARRAY_LEN(ary));
+        if (!rb_block_given_p())
+            return LONG2NUM(RARRAY_LEN(ary));
 
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    v = RARRAY_AREF(ary, i);
-	    if (RTEST(rb_yield(v))) n++;
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            v = RARRAY_AREF(ary, i);
+            if (RTEST(rb_yield(v))) n++;
+        }
     }
     else {
-	VALUE obj;
+        VALUE obj = argv[0];
 
-	rb_scan_args(argc, argv, "1", &obj);
-	if (rb_block_given_p()) {
-	    rb_warn("given block not used");
-	}
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    if (rb_equal(RARRAY_AREF(ary, i), obj)) n++;
-	}
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            if (rb_equal(RARRAY_AREF(ary, i), obj)) n++;
+        }
     }
 
     return LONG2NUM(n);
 }
 
 static VALUE
-flatten(VALUE ary, int level, int *modified)
+flatten(VALUE ary, int level)
 {
-    long i = 0;
-    VALUE stack, result, tmp, elt;
-    st_table *memo;
+    long i;
+    VALUE stack, result, tmp = 0, elt, vmemo;
+    st_table *memo = 0;
     st_data_t id;
 
-    stack = ary_new(0, ARY_DEFAULT_SIZE);
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        elt = RARRAY_AREF(ary, i);
+        tmp = rb_check_array_type(elt);
+        if (!NIL_P(tmp)) {
+            break;
+        }
+    }
+    if (i == RARRAY_LEN(ary)) {
+        return ary;
+    }
+
     result = ary_new(0, RARRAY_LEN(ary));
-    memo = st_init_numtable();
-    st_insert(memo, (st_data_t)ary, (st_data_t)Qtrue);
-    *modified = 0;
+    ary_memcpy(result, 0, i, RARRAY_CONST_PTR_TRANSIENT(ary));
+    ARY_SET_LEN(result, i);
+
+    stack = ary_new(0, ARY_DEFAULT_SIZE);
+    rb_ary_push(stack, ary);
+    rb_ary_push(stack, LONG2NUM(i + 1));
+
+    if (level < 0) {
+        vmemo = rb_hash_new();
+        RBASIC_CLEAR_CLASS(vmemo);
+        memo = st_init_numtable();
+        rb_hash_st_table_set(vmemo, memo);
+        st_insert(memo, (st_data_t)ary, (st_data_t)Qtrue);
+        st_insert(memo, (st_data_t)tmp, (st_data_t)Qtrue);
+    }
+
+    ary = tmp;
+    i = 0;
 
     while (1) {
-	while (i < RARRAY_LEN(ary)) {
-	    elt = RARRAY_AREF(ary, i++);
-	    tmp = rb_check_array_type(elt);
-	    if (RBASIC(result)->klass) {
-		rb_raise(rb_eRuntimeError, "flatten reentered");
-	    }
-	    if (NIL_P(tmp) || (level >= 0 && RARRAY_LEN(stack) / 2 >= level)) {
-		rb_ary_push(result, elt);
-	    }
-	    else {
-		*modified = 1;
-		id = (st_data_t)tmp;
-		if (st_lookup(memo, id, 0)) {
-		    st_free_table(memo);
-		    rb_raise(rb_eArgError, "tried to flatten recursive array");
-		}
-		st_insert(memo, id, (st_data_t)Qtrue);
-		rb_ary_push(stack, ary);
-		rb_ary_push(stack, LONG2NUM(i));
-		ary = tmp;
-		i = 0;
-	    }
-	}
-	if (RARRAY_LEN(stack) == 0) {
-	    break;
-	}
-	id = (st_data_t)ary;
-	st_delete(memo, &id, 0);
-	tmp = rb_ary_pop(stack);
-	i = NUM2LONG(tmp);
-	ary = rb_ary_pop(stack);
-    }
-
-    st_free_table(memo);
-
-    RBASIC_SET_CLASS(result, rb_class_of(ary));
+        while (i < RARRAY_LEN(ary)) {
+            elt = RARRAY_AREF(ary, i++);
+            if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) {
+                rb_ary_push(result, elt);
+                continue;
+            }
+            tmp = rb_check_array_type(elt);
+            if (RBASIC(result)->klass) {
+                if (memo) {
+                    RB_GC_GUARD(vmemo);
+                    st_clear(memo);
+                }
+                rb_raise(rb_eRuntimeError, "flatten reentered");
+            }
+            if (NIL_P(tmp)) {
+                rb_ary_push(result, elt);
+            }
+            else {
+                if (memo) {
+                    id = (st_data_t)tmp;
+                    if (st_is_member(memo, id)) {
+                        st_clear(memo);
+                        rb_raise(rb_eArgError, "tried to flatten recursive array");
+                    }
+                    st_insert(memo, id, (st_data_t)Qtrue);
+                }
+                rb_ary_push(stack, ary);
+                rb_ary_push(stack, LONG2NUM(i));
+                ary = tmp;
+                i = 0;
+            }
+        }
+        if (RARRAY_LEN(stack) == 0) {
+            break;
+        }
+        if (memo) {
+            id = (st_data_t)ary;
+            st_delete(memo, &id, 0);
+        }
+        tmp = rb_ary_pop(stack);
+        i = NUM2LONG(tmp);
+        ary = rb_ary_pop(stack);
+    }
+
+    if (memo) {
+        st_clear(memo);
+    }
+
+    RBASIC_SET_CLASS(result, rb_cArray);
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.flatten!        -> ary or nil
- *     ary.flatten!(level) -> ary or nil
+ *    array.flatten! -> self or nil
+ *    array.flatten!(level) -> self or nil
+ *
+ *  Replaces each nested \Array in +self+ with the elements from that \Array;
+ *  returns +self+ if any changes, +nil+ otherwise.
  *
- *  Flattens +self+ in place.
+ *  With non-negative \Integer argument +level+, flattens recursively through +level+ levels:
  *
- *  Returns +nil+ if no modifications were made (i.e., the array contains no
- *  subarrays.)
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(1) # => [0, 1, [2, 3], 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(2) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(3) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten!(1) # => nil
  *
- *  The optional +level+ argument determines the level of recursion to flatten.
+ *  With no argument, a +nil+ argument, or with negative argument +level+, flattens all levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten! # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten! # => nil
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(-1) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(-2) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten!(-1) # => nil
  *
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten!   #=> [1, 2, 3, 4, 5]
- *     a.flatten!   #=> nil
- *     a            #=> [1, 2, 3, 4, 5]
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten!(1) #=> [1, 2, 3, [4, 5]]
  */
 
 static VALUE
@@ -4301,15 +6647,14 @@ rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
     int mod = 0, level = -1;
     VALUE result, lv;
 
-    rb_scan_args(argc, argv, "01", &lv);
+    lv = (rb_check_arity(argc, 0, 1) ? argv[0] : Qnil);
     rb_ary_modify_check(ary);
     if (!NIL_P(lv)) level = NUM2INT(lv);
     if (level == 0) return Qnil;
 
-    result = flatten(ary, level, &mod);
-    if (mod == 0) {
-	ary_discard(result);
-	return Qnil;
+    result = flatten(ary, level);
+    if (result == ary) {
+        return Qnil;
     }
     if (!(mod = ARY_EMBED_P(result))) rb_obj_freeze(result);
     rb_ary_replace(ary, result);
@@ -4320,236 +6665,212 @@ rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
 
 /*
  *  call-seq:
- *     ary.flatten -> new_ary
- *     ary.flatten(level) -> new_ary
+ *    array.flatten -> new_array
+ *    array.flatten(level) -> new_array
+ *
+ *  Returns a new \Array that is a recursive flattening of +self+:
+ *  - Each non-Array element is unchanged.
+ *  - Each \Array is replaced by its individual elements.
+ *
+ *  With non-negative \Integer argument +level+, flattens recursively through +level+ levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(0) # => [0, [1, [2, 3], 4], 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(1) # => [0, 1, [2, 3], 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(2) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(3) # => [0, 1, 2, 3, 4, 5]
+ *
+ *  With no argument, a +nil+ argument, or with negative argument +level+, flattens all levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten # => [0, 1, 2]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(-1) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(-2) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten(-1) # => [0, 1, 2]
  *
- *  Returns a new array that is a one-dimensional flattening of +self+
- *  (recursively).
- *
- *  That is, for every element that is an array, extract its elements into
- *  the new array.
- *
- *  The optional +level+ argument determines the level of recursion to
- *  flatten.
- *
- *     s = [ 1, 2, 3 ]           #=> [1, 2, 3]
- *     t = [ 4, 5, 6, [7, 8] ]   #=> [4, 5, 6, [7, 8]]
- *     a = [ s, t, 9, 10 ]       #=> [[1, 2, 3], [4, 5, 6, [7, 8]], 9, 10]
- *     a.flatten                 #=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten(1)              #=> [1, 2, 3, [4, 5]]
  */
 
 static VALUE
 rb_ary_flatten(int argc, VALUE *argv, VALUE ary)
 {
-    int mod = 0, level = -1;
-    VALUE result, lv;
+    int level = -1;
+    VALUE result;
 
-    rb_scan_args(argc, argv, "01", &lv);
-    if (!NIL_P(lv)) level = NUM2INT(lv);
-    if (level == 0) return ary_make_shared_copy(ary);
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(argv[0])) {
+        level = NUM2INT(argv[0]);
+        if (level == 0) return ary_make_shared_copy(ary);
+    }
 
-    result = flatten(ary, level, &mod);
-    OBJ_INFECT(result, ary);
+    result = flatten(ary, level);
+    if (result == ary) {
+        result = ary_make_shared_copy(ary);
+    }
 
     return result;
 }
 
-#define OPTHASH_GIVEN_P(opts) \
-    (argc > 0 && !NIL_P((opts) = rb_check_hash_type(argv[argc-1])) && (--argc, 1))
-static VALUE sym_random;
-
 #define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
 
-/*
- *  call-seq:
- *     ary.shuffle!              -> ary
- *     ary.shuffle!(random: rng) -> ary
- *
- *  Shuffles elements in +self+ in place.
- *
- *  The optional +rng+ argument will be used as the random number generator.
- */
-
 static VALUE
-rb_ary_shuffle_bang(int argc, VALUE *argv, VALUE ary)
+rb_ary_shuffle_bang(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
 {
-    VALUE *ptr, opts, *snap_ptr, randgen = rb_cRandom;
-    long i, snap_len;
+    long i, len;
 
-    if (OPTHASH_GIVEN_P(opts)) {
-	randgen = rb_hash_lookup2(opts, sym_random, randgen);
-    }
-    rb_check_arity(argc, 0, 0);
     rb_ary_modify(ary);
-    i = RARRAY_LEN(ary);
-    ptr = RARRAY_PTR(ary);
-    snap_len = i;
-    snap_ptr = ptr;
-    while (i) {
-	long j = RAND_UPTO(i);
-	VALUE tmp;
-	if (snap_len != RARRAY_LEN(ary) || snap_ptr != RARRAY_PTR(ary)) {
-	    rb_raise(rb_eRuntimeError, "modified during shuffle");
-	}
-	tmp = ptr[--i];
-	ptr[i] = ptr[j];
-	ptr[j] = tmp;
-    }
+    i = len = RARRAY_LEN(ary);
+    RARRAY_PTR_USE(ary, ptr, {
+        while (i) {
+            long j = RAND_UPTO(i);
+            VALUE tmp;
+            if (len != RARRAY_LEN(ary) || ptr != RARRAY_CONST_PTR_TRANSIENT(ary)) {
+                rb_raise(rb_eRuntimeError, "modified during shuffle");
+            }
+            tmp = ptr[--i];
+            ptr[i] = ptr[j];
+            ptr[j] = tmp;
+        }
+    }); /* WB: no new reference */
     return ary;
 }
 
-
-/*
- *  call-seq:
- *     ary.shuffle              -> new_ary
- *     ary.shuffle(random: rng) -> new_ary
- *
- *  Returns a new array with elements of +self+ shuffled.
- *
- *     a = [ 1, 2, 3 ]           #=> [1, 2, 3]
- *     a.shuffle                 #=> [2, 3, 1]
- *
- *  The optional +rng+ argument will be used as the random number generator.
- *
- *     a.shuffle(random: Random.new(1))  #=> [1, 3, 2]
- */
-
 static VALUE
-rb_ary_shuffle(int argc, VALUE *argv, VALUE ary)
+rb_ary_shuffle(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
 {
     ary = rb_ary_dup(ary);
-    rb_ary_shuffle_bang(argc, argv, ary);
+    rb_ary_shuffle_bang(ec, ary, randgen);
     return ary;
 }
 
-
-/*
- *  call-seq:
- *     ary.sample                  -> obj
- *     ary.sample(random: rng)     -> obj
- *     ary.sample(n)               -> new_ary
- *     ary.sample(n, random: rng)  -> new_ary
- *
- *  Choose a random element or +n+ random elements from the array.
- *
- *  The elements are chosen by using random and unique indices into the array
- *  in order to ensure that an element doesn't repeat itself unless the array
- *  already contained duplicate elements.
- *
- *  If the array is empty the first form returns +nil+ and the second form
- *  returns an empty array.
- *
- *  The optional +rng+ argument will be used as the random number generator.
- *
- *     a = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]
- *     a.sample         #=> 7
- *     a.sample(4)      #=> [6, 4, 2, 5]
- */
-
-
 static VALUE
-rb_ary_sample(int argc, VALUE *argv, VALUE ary)
+ary_sample(rb_execution_context_t *ec, VALUE ary, VALUE randgen, VALUE nv, VALUE to_array)
 {
-    VALUE nv, result, *ptr;
-    VALUE opts, randgen = rb_cRandom;
+    VALUE result;
     long n, len, i, j, k, idx[10];
     long rnds[numberof(idx)];
+    long memo_threshold;
 
-    if (OPTHASH_GIVEN_P(opts)) {
-	randgen = rb_hash_lookup2(opts, sym_random, randgen);
-    }
-    ptr = RARRAY_PTR(ary);
     len = RARRAY_LEN(ary);
-    if (argc == 0) {
-	if (len == 0) return Qnil;
-	if (len == 1) {
-	    i = 0;
-	}
-	else {
-	    i = RAND_UPTO(len);
-	    if ((len = RARRAY_LEN(ary)) <= i) return Qnil;
-	    ptr = RARRAY_PTR(ary);
-	}
-	return ptr[i];
-    }
-    rb_scan_args(argc, argv, "1", &nv);
+    if (!to_array) {
+        if (len < 2)
+            i = 0;
+        else
+            i = RAND_UPTO(len);
+
+        return rb_ary_elt(ary, i);
+    }
     n = NUM2LONG(nv);
     if (n < 0) rb_raise(rb_eArgError, "negative sample number");
     if (n > len) n = len;
     if (n <= numberof(idx)) {
-	for (i = 0; i < n; ++i) {
-	    rnds[i] = RAND_UPTO(len - i);
-	}
+        for (i = 0; i < n; ++i) {
+            rnds[i] = RAND_UPTO(len - i);
+        }
     }
     k = len;
     len = RARRAY_LEN(ary);
-    ptr = RARRAY_PTR(ary);
-    if (len < k) {
-	if (n <= numberof(idx)) {
-	    for (i = 0; i < n; ++i) {
-		if (rnds[i] >= len) {
-		    return rb_ary_new2(0);
-		}
-	    }
-	}
+    if (len < k && n <= numberof(idx)) {
+        for (i = 0; i < n; ++i) {
+            if (rnds[i] >= len) return rb_ary_new_capa(0);
+        }
     }
     if (n > len) n = len;
     switch (n) {
       case 0:
-	return rb_ary_new2(0);
+        return rb_ary_new_capa(0);
       case 1:
-	i = rnds[0];
-	return rb_ary_new4(1, &ptr[i]);
+        i = rnds[0];
+        return rb_ary_new_from_args(1, RARRAY_AREF(ary, i));
       case 2:
-	i = rnds[0];
-	j = rnds[1];
-	if (j >= i) j++;
-	return rb_ary_new3(2, ptr[i], ptr[j]);
+        i = rnds[0];
+        j = rnds[1];
+        if (j >= i) j++;
+        return rb_ary_new_from_args(2, RARRAY_AREF(ary, i), RARRAY_AREF(ary, j));
       case 3:
-	i = rnds[0];
-	j = rnds[1];
-	k = rnds[2];
-	{
-	    long l = j, g = i;
-	    if (j >= i) l = i, g = ++j;
-	    if (k >= l && (++k >= g)) ++k;
-	}
-	return rb_ary_new3(3, ptr[i], ptr[j], ptr[k]);
+        i = rnds[0];
+        j = rnds[1];
+        k = rnds[2];
+        {
+            long l = j, g = i;
+            if (j >= i) l = i, g = ++j;
+            if (k >= l && (++k >= g)) ++k;
+        }
+        return rb_ary_new_from_args(3, RARRAY_AREF(ary, i), RARRAY_AREF(ary, j), RARRAY_AREF(ary, k));
     }
+    memo_threshold =
+        len < 2560 ? len / 128 :
+        len < 5120 ? len / 64 :
+        len < 10240 ? len / 32 :
+        len / 16;
     if (n <= numberof(idx)) {
-	VALUE *ptr_result;
-	long sorted[numberof(idx)];
-	sorted[0] = idx[0] = rnds[0];
-	for (i=1; i<n; i++) {
-	    k = rnds[i];
-	    for (j = 0; j < i; ++j) {
-		if (k < sorted[j]) break;
-		++k;
-	    }
-	    memmove(&sorted[j+1], &sorted[j], sizeof(sorted[0])*(i-j));
-	    sorted[j] = idx[i] = k;
-	}
-	result = rb_ary_new2(n);
-	ptr_result = RARRAY_PTR(result);
-	for (i=0; i<n; i++) {
-	    ptr_result[i] = ptr[idx[i]];
-	}
+        long sorted[numberof(idx)];
+        sorted[0] = idx[0] = rnds[0];
+        for (i=1; i<n; i++) {
+            k = rnds[i];
+            for (j = 0; j < i; ++j) {
+                if (k < sorted[j]) break;
+                ++k;
+            }
+            memmove(&sorted[j+1], &sorted[j], sizeof(sorted[0])*(i-j));
+            sorted[j] = idx[i] = k;
+        }
+        result = rb_ary_new_capa(n);
+        RARRAY_PTR_USE_TRANSIENT(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                ptr_result[i] = RARRAY_AREF(ary, idx[i]);
+            }
+        });
+    }
+    else if (n <= memo_threshold / 2) {
+        long max_idx = 0;
+#undef RUBY_UNTYPED_DATA_WARNING
+#define RUBY_UNTYPED_DATA_WARNING 0
+        VALUE vmemo = Data_Wrap_Struct(0, 0, st_free_table, 0);
+        st_table *memo = st_init_numtable_with_size(n);
+        DATA_PTR(vmemo) = memo;
+        result = rb_ary_new_capa(n);
+        RARRAY_PTR_USE(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                long r = RAND_UPTO(len-i) + i;
+                ptr_result[i] = r;
+                if (r > max_idx) max_idx = r;
+            }
+            len = RARRAY_LEN(ary);
+            if (len <= max_idx) n = 0;
+            else if (n > len) n = len;
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr_ary, {
+                for (i=0; i<n; i++) {
+                    long j2 = j = ptr_result[i];
+                    long i2 = i;
+                    st_data_t value;
+                    if (st_lookup(memo, (st_data_t)i, &value)) i2 = (long)value;
+                    if (st_lookup(memo, (st_data_t)j, &value)) j2 = (long)value;
+                    st_insert(memo, (st_data_t)j, (st_data_t)i2);
+                    ptr_result[i] = ptr_ary[j2];
+                }
+            });
+        });
+        DATA_PTR(vmemo) = 0;
+        st_free_table(memo);
     }
     else {
-	VALUE *ptr_result;
-	result = rb_ary_new4(len, ptr);
-	RBASIC_CLEAR_CLASS(result);
-	ptr_result = RARRAY_PTR(result);
-	RB_GC_GUARD(ary);
-	for (i=0; i<n; i++) {
-	    j = RAND_UPTO(len-i) + i;
-	    nv = ptr_result[j];
-	    ptr_result[j] = ptr_result[i];
-	    ptr_result[i] = nv;
-	}
-	RBASIC_SET_CLASS_RAW(result, rb_cArray);
+        result = rb_ary_dup(ary);
+        RBASIC_CLEAR_CLASS(result);
+        RB_GC_GUARD(ary);
+        RARRAY_PTR_USE(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                j = RAND_UPTO(len-i) + i;
+                nv = ptr_result[j];
+                ptr_result[j] = ptr_result[i];
+                ptr_result[i] = nv;
+            }
+        });
+        RBASIC_SET_CLASS_RAW(result, rb_cArray);
     }
     ARY_SET_LEN(result, n);
 
@@ -4557,54 +6878,73 @@ rb_ary_sample(int argc, VALUE *argv, VALUE ary)
 }
 
 static VALUE
+ary_sample0(rb_execution_context_t *ec, VALUE ary)
+{
+    return ary_sample(ec, ary, rb_cRandom, Qfalse, Qfalse);
+}
+
+static VALUE
 rb_ary_cycle_size(VALUE self, VALUE args, VALUE eobj)
 {
     long mul;
     VALUE n = Qnil;
     if (args && (RARRAY_LEN(args) > 0)) {
-	n = RARRAY_AREF(args, 0);
+        n = RARRAY_AREF(args, 0);
     }
     if (RARRAY_LEN(self) == 0) return INT2FIX(0);
-    if (n == Qnil) return DBL2NUM(INFINITY);
+    if (NIL_P(n)) return DBL2NUM(HUGE_VAL);
     mul = NUM2LONG(n);
     if (mul <= 0) return INT2FIX(0);
-    return rb_funcall(rb_ary_length(self), '*', 1, LONG2FIX(mul));
+    n = LONG2FIX(mul);
+    return rb_fix_mul_fix(rb_ary_length(self), n);
 }
 
 /*
  *  call-seq:
- *     ary.cycle(n=nil) { |obj| block }  -> nil
- *     ary.cycle(n=nil)                  -> Enumerator
+ *    array.cycle {|element| ... } -> nil
+ *    array.cycle(count) {|element| ... } -> nil
+ *    array.cycle -> new_enumerator
+ *    array.cycle(count) -> new_enumerator
+ *
+ *  When called with positive \Integer argument +count+ and a block,
+ *  calls the block with each element, then does so again,
+ *  until it has done so +count+ times; returns +nil+:
+ *
+ *    output = []
+ *    [0, 1].cycle(2) {|element| output.push(element) } # => nil
+ *    output # => [0, 1, 0, 1]
+ *
+ *  If +count+ is zero or negative, does not call the block:
  *
- *  Calls the given block for each element +n+ times or forever if +nil+ is
- *  given.
+ *    [0, 1].cycle(0) {|element| fail 'Cannot happen' } # => nil
+ *    [0, 1].cycle(-1) {|element| fail 'Cannot happen' } # => nil
  *
- *  Does nothing if a non-positive number is given or the array is empty.
+ *  When a block is given, and argument is omitted or +nil+, cycles forever:
  *
- *  Returns +nil+ if the loop has finished without getting interrupted.
+ *    # Prints 0 and 1 forever.
+ *    [0, 1].cycle {|element| puts element }
+ *    [0, 1].cycle(nil) {|element| puts element }
  *
- *  If no block is given, an Enumerator is returned instead.
+ *  When no block is given, returns a new \Enumerator:
  *
- *     a = ["a", "b", "c"]
- *     a.cycle { |x| puts x }     # print, a, b, c, a, b, c,.. forever.
- *     a.cycle(2) { |x| puts x }  # print, a, b, c, a, b, c.
+ *    [0, 1].cycle(2) # => #<Enumerator: [0, 1]:cycle(2)>
+ *    [0, 1].cycle # => # => #<Enumerator: [0, 1]:cycle>
+ *    [0, 1].cycle.first(5) # => [0, 1, 0, 1, 0]
  *
  */
-
 static VALUE
 rb_ary_cycle(int argc, VALUE *argv, VALUE ary)
 {
     long n, i;
-    VALUE nv = Qnil;
 
-    rb_scan_args(argc, argv, "01", &nv);
+    rb_check_arity(argc, 0, 1);
 
     RETURN_SIZED_ENUMERATOR(ary, argc, argv, rb_ary_cycle_size);
-    if (NIL_P(nv)) {
+    if (argc == 0 || NIL_P(argv[0])) {
         n = -1;
     }
     else {
-        n = NUM2LONG(nv);
+        n = NUM2LONG(argv[0]);
         if (n <= 0) return Qnil;
     }
 
@@ -4616,67 +6956,87 @@ rb_ary_cycle(int argc, VALUE *argv, VALUE ary)
     return Qnil;
 }
 
-#define tmpbuf(n, size) rb_str_tmp_new((n)*(size))
-#define tmpbuf_discard(s) (rb_str_resize((s), 0L), RBASIC_SET_CLASS_RAW(s, rb_cString))
-#define tmpary(n) rb_ary_tmp_new(n)
-#define tmpary_discard(a) (ary_discard(a), RBASIC_SET_CLASS_RAW(a, rb_cArray))
+/*
+ * Build a ruby array of the corresponding values and yield it to the
+ * associated block.
+ * Return the class of +values+ for reentry check.
+ */
+static int
+yield_indexed_values(const VALUE values, const long r, const long *const p)
+{
+    const VALUE result = rb_ary_new2(r);
+    long i;
+
+    for (i = 0; i < r; i++) ARY_SET(result, i, RARRAY_AREF(values, p[i]));
+    ARY_SET_LEN(result, r);
+    rb_yield(result);
+    return !RBASIC(values)->klass;
+}
 
 /*
- * Recursively compute permutations of +r+ elements of the set
- * <code>[0..n-1]</code>.
+ * Compute permutations of +r+ elements of the set <code>[0..n-1]</code>.
  *
- * When we have a complete permutation of array indexes, copy the values
- * at those indexes into a new array and yield that array.
+ * When we have a complete permutation of array indices, copy the values
+ * at those indices into a new array and yield that array.
  *
  * n: the size of the set
  * r: the number of elements in each permutation
  * p: the array (of size r) that we're filling in
- * index: what index we're filling in now
  * used: an array of booleans: whether a given index is already used
  * values: the Ruby array that holds the actual values to permute
  */
 static void
-permute0(long n, long r, long *p, long index, char *used, VALUE values)
+permute0(const long n, const long r, long *const p, char *const used, const VALUE values)
 {
-    long i,j;
-    for (i = 0; i < n; i++) {
-	if (used[i] == 0) {
-	    p[index] = i;
-	    if (index < r-1) {             /* if not done yet */
-		used[i] = 1;               /* mark index used */
-		permute0(n, r, p, index+1, /* recurse */
-			 used, values);
-		used[i] = 0;               /* index unused */
-	    }
-	    else {
-		/* We have a complete permutation of array indexes */
-		/* Build a ruby array of the corresponding values */
-		/* And yield it to the associated block */
-		VALUE result = rb_ary_new2(r);
-		VALUE *result_array = RARRAY_PTR(result);
-		const VALUE *values_array = RARRAY_PTR(values);
-
-		for (j = 0; j < r; j++) result_array[j] = values_array[p[j]];
-		ARY_SET_LEN(result, r);
-		rb_yield(result);
-		if (RBASIC(values)->klass) {
-		    rb_raise(rb_eRuntimeError, "permute reentered");
-		}
-	    }
-	}
+    long i = 0, index = 0;
+
+    for (;;) {
+        const char *const unused = memchr(&used[i], 0, n-i);
+        if (!unused) {
+            if (!index) break;
+            i = p[--index];                /* pop index */
+            used[i++] = 0;                 /* index unused */
+        }
+        else {
+            i = unused - used;
+            p[index] = i;
+            used[i] = 1;                   /* mark index used */
+            ++index;
+            if (index < r-1) {             /* if not done yet */
+                p[index] = i = 0;
+                continue;
+            }
+            for (i = 0; i < n; ++i) {
+                if (used[i]) continue;
+                p[index] = i;
+                if (!yield_indexed_values(values, r, p)) {
+                    rb_raise(rb_eRuntimeError, "permute reentered");
+                }
+            }
+            i = p[--index];                /* pop index */
+            used[i] = 0;                   /* index unused */
+            p[index] = ++i;
+        }
     }
 }
 
 /*
  * Returns the product of from, from-1, ..., from - how_many + 1.
- * http://en.wikipedia.org/wiki/Pochhammer_symbol
+ * https://en.wikipedia.org/wiki/Pochhammer_symbol
  */
 static VALUE
 descending_factorial(long from, long how_many)
 {
-    VALUE cnt = LONG2FIX(how_many >= 0);
-    while (how_many-- > 0) {
-        cnt = rb_funcall(cnt, '*', 1, LONG2FIX(from--));
+    VALUE cnt;
+    if (how_many > 0) {
+        cnt = LONG2FIX(from);
+        while (--how_many > 0) {
+            long v = --from;
+            cnt = rb_int_mul(cnt, LONG2FIX(v));
+        }
+    }
+    else {
+        cnt = LONG2FIX(how_many == 0);
     }
     return cnt;
 }
@@ -4684,13 +7044,23 @@ descending_factorial(long from, long how_many)
 static VALUE
 binomial_coefficient(long comb, long size)
 {
+    VALUE r;
+    long i;
     if (comb > size-comb) {
-	comb = size-comb;
+        comb = size-comb;
     }
     if (comb < 0) {
-	return LONG2FIX(0);
+        return LONG2FIX(0);
+    }
+    else if (comb == 0) {
+        return LONG2FIX(1);
     }
-    return rb_funcall(descending_factorial(size, comb), id_div, 1, descending_factorial(comb, comb));
+    r = LONG2FIX(size);
+    for (i = 1; i < comb; ++i) {
+        r = rb_int_mul(r, LONG2FIX(size - i));
+        r = rb_int_idiv(r, LONG2FIX(i + 1));
+    }
+    return r;
 }
 
 static VALUE
@@ -4704,72 +7074,143 @@ rb_ary_permutation_size(VALUE ary, VALUE args, VALUE eobj)
 
 /*
  *  call-seq:
- *     ary.permutation { |p| block }          -> ary
- *     ary.permutation                        -> Enumerator
- *     ary.permutation(n) { |p| block }       -> ary
- *     ary.permutation(n)                     -> Enumerator
+ *    array.permutation {|element| ... } -> self
+ *    array.permutation(n) {|element| ... } -> self
+ *    array.permutation -> new_enumerator
+ *    array.permutation(n) -> new_enumerator
+ *
+ *  When invoked with a block, yield all permutations of elements of +self+; returns +self+.
+ *  The order of permutations is indeterminate.
+ *
+ *  When a block and an in-range positive \Integer argument +n+ (<tt>0 < n <= self.size</tt>)
+ *  are given, calls the block with all +n+-tuple permutations of +self+.
+ *
+ *  Example:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(2) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 0]
+ *    [1, 2]
+ *    [2, 0]
+ *    [2, 1]
+ *
+ *  Another example:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(3) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1, 2]
+ *    [0, 2, 1]
+ *    [1, 0, 2]
+ *    [1, 2, 0]
+ *    [2, 0, 1]
+ *    [2, 1, 0]
+ *
+ *  When +n+ is zero, calls the block once with a new empty \Array:
  *
- * When invoked with a block, yield all permutations of length +n+ of the
- * elements of the array, then return the array itself.
+ *    a = [0, 1, 2]
+ *    a.permutation(0) {|permutation| p permutation }
  *
- * If +n+ is not specified, yield all permutations of all elements.
+ *  Output:
  *
- * The implementation makes no guarantees about the order in which the
- * permutations are yielded.
+ *    []
  *
- * If no block is given, an Enumerator is returned instead.
+ *  When +n+ is out of range (negative or larger than <tt>self.size</tt>),
+ *  does not call the block:
  *
- * Examples:
+ *    a = [0, 1, 2]
+ *    a.permutation(-1) {|permutation| fail 'Cannot happen' }
+ *    a.permutation(4) {|permutation| fail 'Cannot happen' }
+ *
+ *  When a block given but no argument,
+ *  behaves the same as <tt>a.permutation(a.size)</tt>:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1, 2]
+ *    [0, 2, 1]
+ *    [1, 0, 2]
+ *    [1, 2, 0]
+ *    [2, 0, 1]
+ *    [2, 1, 0]
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation # => #<Enumerator: [0, 1, 2]:permutation>
+ *    a.permutation(2) # => #<Enumerator: [0, 1, 2]:permutation(2)>
  *
- *   a = [1, 2, 3]
- *   a.permutation.to_a    #=> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
- *   a.permutation(1).to_a #=> [[1],[2],[3]]
- *   a.permutation(2).to_a #=> [[1,2],[1,3],[2,1],[2,3],[3,1],[3,2]]
- *   a.permutation(3).to_a #=> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
- *   a.permutation(0).to_a #=> [[]] # one permutation of length 0
- *   a.permutation(4).to_a #=> []   # no permutations of length 4
  */
 
 static VALUE
 rb_ary_permutation(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE num;
     long r, n, i;
 
     n = RARRAY_LEN(ary);                  /* Array length */
     RETURN_SIZED_ENUMERATOR(ary, argc, argv, rb_ary_permutation_size);   /* Return enumerator if no block */
-    rb_scan_args(argc, argv, "01", &num);
-    r = NIL_P(num) ? n : NUM2LONG(num);   /* Permutation size from argument */
+    r = n;
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(argv[0]))
+        r = NUM2LONG(argv[0]);            /* Permutation size from argument */
 
     if (r < 0 || n < r) {
-	/* no permutations: yield nothing */
+        /* no permutations: yield nothing */
     }
     else if (r == 0) { /* exactly one permutation: the zero-length array */
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (r == 1) { /* this is a special, easy case */
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {             /* this is the general case */
-	volatile VALUE t0 = tmpbuf(n,sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	volatile VALUE t1 = tmpbuf(n,sizeof(char));
-	char *used = (char*)RSTRING_PTR(t1);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC_CLEAR_CLASS(ary0);
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, r+roomof(n, sizeof(long)));
+        char *used = (char*)(p + r);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	MEMZERO(used, char, n); /* initialize array */
+        MEMZERO(used, char, n); /* initialize array */
 
-	permute0(n, r, p, 0, used, ary0); /* compute and yield permutations */
-	tmpbuf_discard(t0);
-	tmpbuf_discard(t1);
-	RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
+        permute0(n, r, p, used, ary0); /* compute and yield permutations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
+static void
+combinate0(const long len, const long n, long *const stack, const VALUE values)
+{
+    long lev = 0;
+
+    MEMZERO(stack+1, long, n);
+    stack[0] = -1;
+    for (;;) {
+        for (lev++; lev < n; lev++) {
+            stack[lev+1] = stack[lev]+1;
+        }
+        if (!yield_indexed_values(values, n, stack+1)) {
+            rb_raise(rb_eRuntimeError, "combination reentered");
+        }
+        do {
+            if (lev == 0) return;
+            stack[lev--]++;
+        } while (stack[lev+1]+n == len+lev+1);
+    }
+}
+
 static VALUE
 rb_ary_combination_size(VALUE ary, VALUE args, VALUE eobj)
 {
@@ -4781,115 +7222,122 @@ rb_ary_combination_size(VALUE ary, VALUE args, VALUE eobj)
 
 /*
  *  call-seq:
- *     ary.combination(n) { |c| block }    -> ary
- *     ary.combination(n)                  -> Enumerator
+ *    array.combination(n) {|element| ... } -> self
+ *    array.combination(n) -> new_enumerator
+ *
+ *  Calls the block, if given, with combinations of elements of +self+;
+ *  returns +self+. The order of combinations is indeterminate.
+ *
+ *  When a block and an in-range positive \Integer argument +n+ (<tt>0 < n <= self.size</tt>)
+ *  are given, calls the block with all +n+-tuple combinations of +self+.
+ *
+ *  Example:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(2) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 2]
+ *
+ *  Another example:
  *
- * When invoked with a block, yields all combinations of length +n+ of elements
- * from the array and then returns the array itself.
+ *    a = [0, 1, 2]
+ *    a.combination(3) {|combination| p combination }
  *
- * The implementation makes no guarantees about the order in which the
- * combinations are yielded.
+ *  Output:
  *
- * If no block is given, an Enumerator is returned instead.
+ *    [0, 1, 2]
  *
- * Examples:
+ *  When +n+ is zero, calls the block once with a new empty \Array:
  *
- *     a = [1, 2, 3, 4]
- *     a.combination(1).to_a  #=> [[1],[2],[3],[4]]
- *     a.combination(2).to_a  #=> [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]
- *     a.combination(3).to_a  #=> [[1,2,3],[1,2,4],[1,3,4],[2,3,4]]
- *     a.combination(4).to_a  #=> [[1,2,3,4]]
- *     a.combination(0).to_a  #=> [[]] # one combination of length 0
- *     a.combination(5).to_a  #=> []   # no combinations of length 5
+ *    a = [0, 1, 2]
+ *    a1 = a.combination(0) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    []
+ *
+ *  When +n+ is out of range (negative or larger than <tt>self.size</tt>),
+ *  does not call the block:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(-1) {|combination| fail 'Cannot happen' }
+ *    a.combination(4) {|combination| fail 'Cannot happen' }
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(2) # => #<Enumerator: [0, 1, 2]:combination(2)>
  *
  */
 
 static VALUE
 rb_ary_combination(VALUE ary, VALUE num)
 {
-    long n, i, len;
+    long i, n, len;
 
     n = NUM2LONG(num);
     RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_combination_size);
     len = RARRAY_LEN(ary);
     if (n < 0 || len < n) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else if (n == 0) {
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (n == 1) {
-	for (i = 0; i < len; i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {
-	volatile VALUE t0 = tmpbuf(n+1, sizeof(long));
-	long *stack = (long*)RSTRING_PTR(t0);
-	volatile VALUE cc = tmpary(n);
-	VALUE *chosen = RARRAY_PTR(cc);
-	long lev = 0;
-
-	MEMZERO(stack, long, n);
-	stack[0] = -1;
-	for (;;) {
-	    chosen[lev] = RARRAY_AREF(ary, stack[lev+1]);
-	    for (lev++; lev < n; lev++) {
-		chosen[lev] = RARRAY_AREF(ary, stack[lev+1] = stack[lev]+1);
-	    }
-	    rb_yield(rb_ary_new4(n, chosen));
-	    if (RBASIC(t0)->klass) {
-		rb_raise(rb_eRuntimeError, "combination reentered");
-	    }
-	    do {
-		if (lev == 0) goto done;
-		stack[lev--]++;
-	    } while (stack[lev+1]+n == len+lev+1);
-	}
-    done:
-	tmpbuf_discard(t0);
-	tmpary_discard(cc);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        volatile VALUE t0;
+        long *stack = ALLOCV_N(long, t0, n+1);
+
+        RBASIC_CLEAR_CLASS(ary0);
+        combinate0(len, n, stack, ary0);
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 /*
- * Recursively compute repeated permutations of +r+ elements of the set
+ * Compute repeated permutations of +r+ elements of the set
  * <code>[0..n-1]</code>.
  *
- * When we have a complete repeated permutation of array indexes, copy the
- * values at those indexes into a new array and yield that array.
+ * When we have a complete repeated permutation of array indices, copy the
+ * values at those indices into a new array and yield that array.
  *
  * n: the size of the set
  * r: the number of elements in each permutation
  * p: the array (of size r) that we're filling in
- * index: what index we're filling in now
  * values: the Ruby array that holds the actual values to permute
  */
 static void
-rpermute0(long n, long r, long *p, long index, VALUE values)
+rpermute0(const long n, const long r, long *const p, const VALUE values)
 {
-    long i, j;
-    for (i = 0; i < n; i++) {
-	p[index] = i;
-	if (index < r-1) {              /* if not done yet */
-	    rpermute0(n, r, p, index+1, values); /* recurse */
-	}
-	else {
-	    /* We have a complete permutation of array indexes */
-	    /* Build a ruby array of the corresponding values */
-	    /* And yield it to the associated block */
-	    VALUE result = rb_ary_new2(r);
-	    VALUE *result_array = RARRAY_PTR(result);
-	    const VALUE *values_array = RARRAY_PTR(values);
+    long i = 0, index = 0;
 
-	    for (j = 0; j < r; j++) result_array[j] = values_array[p[j]];
-	    ARY_SET_LEN(result, r);
-	    rb_yield(result);
-	    if (RBASIC(values)->klass) {
-		rb_raise(rb_eRuntimeError, "repeated permute reentered");
-	    }
-	}
+    p[index] = i;
+    for (;;) {
+        if (++index < r-1) {
+            p[index] = i = 0;
+            continue;
+        }
+        for (i = 0; i < n; ++i) {
+            p[index] = i;
+            if (!yield_indexed_values(values, r, p)) {
+                rb_raise(rb_eRuntimeError, "repeated permute reentered");
+            }
+        }
+        do {
+            if (index <= 0) return;
+        } while ((i = ++p[--index]) >= n);
     }
 }
 
@@ -4900,35 +7348,79 @@ rb_ary_repeated_permutation_size(VALUE ary, VALUE args, VALUE eobj)
     long k = NUM2LONG(RARRAY_AREF(args, 0));
 
     if (k < 0) {
-	return LONG2FIX(0);
+        return LONG2FIX(0);
     }
-
-    return rb_funcall(LONG2NUM(n), id_power, 1, LONG2NUM(k));
+    if (n <= 0) {
+        return LONG2FIX(!k);
+    }
+    return rb_int_positive_pow(n, (unsigned long)k);
 }
 
 /*
  *  call-seq:
- *     ary.repeated_permutation(n) { |p| block } -> ary
- *     ary.repeated_permutation(n)               -> Enumerator
+ *    array.repeated_permutation(n) {|permutation| ... } -> self
+ *    array.repeated_permutation(n) -> new_enumerator
+ *
+ *  Calls the block with each repeated permutation of length +n+ of the elements of +self+;
+ *  each permutation is an \Array;
+ *  returns +self+. The order of the permutations is indeterminate.
+ *
+ *  When a block and a positive \Integer argument +n+ are given, calls the block with each
+ *  +n+-tuple repeated permutation of the elements of +self+.
+ *  The number of permutations is <tt>self.size**n</tt>.
+ *
+ *  +n+ = 1:
+ *
+ *    a = [0, 1, 2]
+ *    a.repeated_permutation(1) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0]
+ *    [1]
+ *    [2]
+ *
+ *  +n+ = 2:
+ *
+ *    a.repeated_permutation(2) {|permutation| p permutation }
  *
- * When invoked with a block, yield all repeated permutations of length +n+ of
- * the elements of the array, then return the array itself.
+ *  Output:
  *
- * The implementation makes no guarantees about the order in which the repeated
- * permutations are yielded.
+ *    [0, 0]
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 0]
+ *    [1, 1]
+ *    [1, 2]
+ *    [2, 0]
+ *    [2, 1]
+ *    [2, 2]
  *
- * If no block is given, an Enumerator is returned instead.
+ *  If +n+ is zero, calls the block once with an empty \Array.
  *
- * Examples:
+ *  If +n+ is negative, does not call the block:
+ *
+ *    a.repeated_permutation(-1) {|permutation| fail 'Cannot happen' }
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.repeated_permutation(2) # => #<Enumerator: [0, 1, 2]:permutation(2)>
+ *
+ *  Using Enumerators, it's convenient to show the permutations and counts
+ *  for some values of +n+:
+ *
+ *    e = a.repeated_permutation(0)
+ *    e.size # => 1
+ *    e.to_a # => [[]]
+ *    e = a.repeated_permutation(1)
+ *    e.size # => 3
+ *    e.to_a # => [[0], [1], [2]]
+ *    e = a.repeated_permutation(2)
+ *    e.size # => 9
+ *    e.to_a # => [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
  *
- *     a = [1, 2]
- *     a.repeated_permutation(1).to_a  #=> [[1], [2]]
- *     a.repeated_permutation(2).to_a  #=> [[1,1],[1,2],[2,1],[2,2]]
- *     a.repeated_permutation(3).to_a  #=> [[1,1,1],[1,1,2],[1,2,1],[1,2,2],
- *                                     #    [2,1,1],[2,1,2],[2,2,1],[2,2,2]]
- *     a.repeated_permutation(0).to_a  #=> [[]] # one permutation of length 0
  */
-
 static VALUE
 rb_ary_repeated_permutation(VALUE ary, VALUE num)
 {
@@ -4939,50 +7431,49 @@ rb_ary_repeated_permutation(VALUE ary, VALUE num)
     r = NUM2LONG(num);                    /* Permutation size from argument */
 
     if (r < 0) {
-	/* no permutations: yield nothing */
+        /* no permutations: yield nothing */
     }
     else if (r == 0) { /* exactly one permutation: the zero-length array */
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (r == 1) { /* this is a special, easy case */
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {             /* this is the general case */
-	volatile VALUE t0 = tmpbuf(r, sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC_CLEAR_CLASS(ary0);
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, r);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	rpermute0(n, r, p, 0, ary0); /* compute and yield repeated permutations */
-	tmpbuf_discard(t0);
-	RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
+        rpermute0(n, r, p, ary0); /* compute and yield repeated permutations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 static void
-rcombinate0(long n, long r, long *p, long index, long rest, VALUE values)
+rcombinate0(const long n, const long r, long *const p, const long rest, const VALUE values)
 {
-    long j;
-    if (rest > 0) {
-	for (; index < n; ++index) {
-	    p[r-rest] = index;
-	    rcombinate0(n, r, p, index, rest-1, values);
-	}
-    }
-    else {
-	VALUE result = rb_ary_new2(r);
-	VALUE *result_array = RARRAY_PTR(result);
-	const VALUE *values_array = RARRAY_PTR(values);
+    long i = 0, index = 0;
 
-	for (j = 0; j < r; ++j) result_array[j] = values_array[p[j]];
-	ARY_SET_LEN(result, r);
-	rb_yield(result);
-	if (RBASIC(values)->klass) {
-	    rb_raise(rb_eRuntimeError, "repeated combination reentered");
-	}
+    p[index] = i;
+    for (;;) {
+        if (++index < r-1) {
+            p[index] = i;
+            continue;
+        }
+        for (; i < n; ++i) {
+            p[index] = i;
+            if (!yield_indexed_values(values, r, p)) {
+                rb_raise(rb_eRuntimeError, "repeated combination reentered");
+            }
+        }
+        do {
+            if (index <= 0) return;
+        } while ((i = ++p[--index]) >= n);
     }
 }
 
@@ -4992,35 +7483,71 @@ rb_ary_repeated_combination_size(VALUE ary, VALUE args, VALUE eobj)
     long n = RARRAY_LEN(ary);
     long k = NUM2LONG(RARRAY_AREF(args, 0));
     if (k == 0) {
-	return LONG2FIX(1);
+        return LONG2FIX(1);
     }
     return binomial_coefficient(k, n + k - 1);
 }
 
 /*
  *  call-seq:
- *     ary.repeated_combination(n) { |c| block } -> ary
- *     ary.repeated_combination(n)               -> Enumerator
+ *    array.repeated_combination(n) {|combination| ... } -> self
+ *    array.repeated_combination(n) -> new_enumerator
+ *
+ *  Calls the block with each repeated combination of length +n+ of the elements of +self+;
+ *  each combination is an \Array;
+ *  returns +self+. The order of the combinations is indeterminate.
+ *
+ *  When a block and a positive \Integer argument +n+ are given, calls the block with each
+ *  +n+-tuple repeated combination of the elements of +self+.
+ *  The number of combinations is <tt>(n+1)(n+2)/2</tt>.
+ *
+ *  +n+ = 1:
  *
- * When invoked with a block, yields all repeated combinations of length +n+ of
- * elements from the array and then returns the array itself.
+ *    a = [0, 1, 2]
+ *    a.repeated_combination(1) {|combination| p combination }
  *
- * The implementation makes no guarantees about the order in which the repeated
- * combinations are yielded.
+ *  Output:
  *
- * If no block is given, an Enumerator is returned instead.
+ *    [0]
+ *    [1]
+ *    [2]
  *
- * Examples:
+ *  +n+ = 2:
  *
- *   a = [1, 2, 3]
- *   a.repeated_combination(1).to_a  #=> [[1], [2], [3]]
- *   a.repeated_combination(2).to_a  #=> [[1,1],[1,2],[1,3],[2,2],[2,3],[3,3]]
- *   a.repeated_combination(3).to_a  #=> [[1,1,1],[1,1,2],[1,1,3],[1,2,2],[1,2,3],
- *                                   #    [1,3,3],[2,2,2],[2,2,3],[2,3,3],[3,3,3]]
- *   a.repeated_combination(4).to_a  #=> [[1,1,1,1],[1,1,1,2],[1,1,1,3],[1,1,2,2],[1,1,2,3],
- *                                   #    [1,1,3,3],[1,2,2,2],[1,2,2,3],[1,2,3,3],[1,3,3,3],
- *                                   #    [2,2,2,2],[2,2,2,3],[2,2,3,3],[2,3,3,3],[3,3,3,3]]
- *   a.repeated_combination(0).to_a  #=> [[]] # one combination of length 0
+ *    a.repeated_combination(2) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 0]
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 1]
+ *    [1, 2]
+ *    [2, 2]
+ *
+ *  If +n+ is zero, calls the block once with an empty \Array.
+ *
+ *  If +n+ is negative, does not call the block:
+ *
+ *    a.repeated_combination(-1) {|combination| fail 'Cannot happen' }
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.repeated_combination(2) # => #<Enumerator: [0, 1, 2]:combination(2)>
+ *
+ *  Using Enumerators, it's convenient to show the combinations and counts
+ *  for some values of +n+:
+ *
+ *    e = a.repeated_combination(0)
+ *    e.size # => 1
+ *    e.to_a # => [[]]
+ *    e = a.repeated_combination(1)
+ *    e.size # => 3
+ *    e.to_a # => [[0], [1], [2]]
+ *    e = a.repeated_combination(2)
+ *    e.size # => 6
+ *    e.to_a # => [[0, 0], [0, 1], [0, 2], [1, 1], [1, 2], [2, 2]]
  *
  */
 
@@ -5033,67 +7560,105 @@ rb_ary_repeated_combination(VALUE ary, VALUE num)
     RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_repeated_combination_size);   /* Return enumerator if no block */
     len = RARRAY_LEN(ary);
     if (n < 0) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else if (n == 0) {
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (n == 1) {
-	for (i = 0; i < len; i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else if (len == 0) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else {
-	volatile VALUE t0 = tmpbuf(n, sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC_CLEAR_CLASS(ary0);
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, n);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	rcombinate0(len, n, p, 0, n, ary0); /* compute and yield repeated combinations */
-	tmpbuf_discard(t0);
-	RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
+        rcombinate0(len, n, p, n, ary0); /* compute and yield repeated combinations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.product(other_ary, ...)                -> new_ary
- *     ary.product(other_ary, ...) { |p| block }  -> ary
+ *    array.product(*other_arrays) -> new_array
+ *    array.product(*other_arrays) {|combination| ... } -> self
+ *
+ *  Computes and returns or yields all combinations of elements from all the Arrays,
+ *  including both +self+ and +other_arrays+:
+ *
+ *  - The number of combinations is the product of the sizes of all the arrays,
+ *    including both +self+ and +other_arrays+.
+ *  - The order of the returned combinations is indeterminate.
+ *
+ *  When no block is given, returns the combinations as an \Array of Arrays:
+ *
+ *    a = [0, 1, 2]
+ *    a1 = [3, 4]
+ *    a2 = [5, 6]
+ *    p = a.product(a1)
+ *    p.size # => 6 # a.size * a1.size
+ *    p # => [[0, 3], [0, 4], [1, 3], [1, 4], [2, 3], [2, 4]]
+ *    p = a.product(a1, a2)
+ *    p.size # => 12 # a.size * a1.size * a2.size
+ *    p # => [[0, 3, 5], [0, 3, 6], [0, 4, 5], [0, 4, 6], [1, 3, 5], [1, 3, 6], [1, 4, 5], [1, 4, 6], [2, 3, 5], [2, 3, 6], [2, 4, 5], [2, 4, 6]]
+ *
+ *  If any argument is an empty \Array, returns an empty \Array.
+ *
+ *  If no argument is given, returns an \Array of 1-element Arrays,
+ *  each containing an element of +self+:
  *
- *  Returns an array of all combinations of elements from all arrays.
+ *    a.product # => [[0], [1], [2]]
  *
- *  The length of the returned array is the product of the length of +self+ and
- *  the argument arrays.
+ *  When a block is given, yields each combination as an \Array; returns +self+:
  *
- *  If given a block, #product will yield all combinations and return +self+
- *  instead.
+ *    a.product(a1) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 3]
+ *    [0, 4]
+ *    [1, 3]
+ *    [1, 4]
+ *    [2, 3]
+ *    [2, 4]
+ *
+ *  If any argument is an empty \Array, does not call the block:
+ *
+ *    a.product(a1, a2, []) {|combination| fail 'Cannot happen' }
+ *
+ *  If no argument is given, yields each element of +self+ as a 1-element \Array:
+ *
+ *    a.product {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0]
+ *    [1]
+ *    [2]
  *
- *     [1,2,3].product([4,5])     #=> [[1,4],[1,5],[2,4],[2,5],[3,4],[3,5]]
- *     [1,2].product([1,2])       #=> [[1,1],[1,2],[2,1],[2,2]]
- *     [1,2].product([3,4],[5,6]) #=> [[1,3,5],[1,3,6],[1,4,5],[1,4,6],
- *                                #     [2,3,5],[2,3,6],[2,4,5],[2,4,6]]
- *     [1,2].product()            #=> [[1],[2]]
- *     [1,2].product([])          #=> []
  */
 
 static VALUE
 rb_ary_product(int argc, VALUE *argv, VALUE ary)
 {
     int n = argc+1;    /* How many arrays we're operating on */
-    volatile VALUE t0 = tmpary(n);
-    volatile VALUE t1 = tmpbuf(n, sizeof(int));
+    volatile VALUE t0 = rb_ary_hidden_new(n);
+    volatile VALUE t1 = Qundef;
     VALUE *arrays = RARRAY_PTR(t0); /* The arrays we're computing the product of */
-    int *counters = (int*)RSTRING_PTR(t1); /* The current position in each one */
+    int *counters = ALLOCV_N(int, t1, n); /* The current position in each one */
     VALUE result = Qnil;      /* The array we'll be returning, when no block given */
     long i,j;
     long resultlen = 1;
 
     RBASIC_CLEAR_CLASS(t0);
-    RBASIC_CLEAR_CLASS(t1);
 
     /* initialize the arrays of arrays */
     ARY_SET_LEN(t0, n);
@@ -5106,81 +7671,84 @@ rb_ary_product(int argc, VALUE *argv, VALUE ary)
 
     /* Otherwise, allocate and fill in an array of results */
     if (rb_block_given_p()) {
-	/* Make defensive copies of arrays; exit if any is empty */
-	for (i = 0; i < n; i++) {
-	    if (RARRAY_LEN(arrays[i]) == 0) goto done;
-	    arrays[i] = ary_make_shared_copy(arrays[i]);
-	}
+        /* Make defensive copies of arrays; exit if any is empty */
+        for (i = 0; i < n; i++) {
+            if (RARRAY_LEN(arrays[i]) == 0) goto done;
+            arrays[i] = ary_make_shared_copy(arrays[i]);
+        }
     }
     else {
-	/* Compute the length of the result array; return [] if any is empty */
-	for (i = 0; i < n; i++) {
-	    long k = RARRAY_LEN(arrays[i]);
-	    if (k == 0) {
-		result = rb_ary_new2(0);
-		goto done;
-	    }
+        /* Compute the length of the result array; return [] if any is empty */
+        for (i = 0; i < n; i++) {
+            long k = RARRAY_LEN(arrays[i]);
+            if (k == 0) {
+                result = rb_ary_new2(0);
+                goto done;
+            }
             if (MUL_OVERFLOW_LONG_P(resultlen, k))
-		rb_raise(rb_eRangeError, "too big to product");
-	    resultlen *= k;
-	}
-	result = rb_ary_new2(resultlen);
+                rb_raise(rb_eRangeError, "too big to product");
+            resultlen *= k;
+        }
+        result = rb_ary_new2(resultlen);
     }
     for (;;) {
-	int m;
-	/* fill in one subarray */
-	VALUE subarray = rb_ary_new2(n);
-	for (j = 0; j < n; j++) {
-	    rb_ary_push(subarray, rb_ary_entry(arrays[j], counters[j]));
-	}
-
-	/* put it on the result array */
-	if (NIL_P(result)) {
-	    FL_SET(t0, FL_USER5);
-	    rb_yield(subarray);
-	    if (! FL_TEST(t0, FL_USER5)) {
-		rb_raise(rb_eRuntimeError, "product reentered");
-	    }
-	    else {
-		FL_UNSET(t0, FL_USER5);
-	    }
-	}
-	else {
-	    rb_ary_push(result, subarray);
-	}
-
-	/*
-	 * Increment the last counter.  If it overflows, reset to 0
-	 * and increment the one before it.
-	 */
-	m = n-1;
-	counters[m]++;
-	while (counters[m] == RARRAY_LEN(arrays[m])) {
-	    counters[m] = 0;
-	    /* If the first counter overflows, we are done */
-	    if (--m < 0) goto done;
-	    counters[m]++;
-	}
+        int m;
+        /* fill in one subarray */
+        VALUE subarray = rb_ary_new2(n);
+        for (j = 0; j < n; j++) {
+            rb_ary_push(subarray, rb_ary_entry(arrays[j], counters[j]));
+        }
+
+        /* put it on the result array */
+        if (NIL_P(result)) {
+            FL_SET(t0, RARRAY_SHARED_ROOT_FLAG);
+            rb_yield(subarray);
+            if (!FL_TEST(t0, RARRAY_SHARED_ROOT_FLAG)) {
+                rb_raise(rb_eRuntimeError, "product reentered");
+            }
+            else {
+                FL_UNSET(t0, RARRAY_SHARED_ROOT_FLAG);
+            }
+        }
+        else {
+            rb_ary_push(result, subarray);
+        }
+
+        /*
+         * Increment the last counter.  If it overflows, reset to 0
+         * and increment the one before it.
+         */
+        m = n-1;
+        counters[m]++;
+        while (counters[m] == RARRAY_LEN(arrays[m])) {
+            counters[m] = 0;
+            /* If the first counter overflows, we are done */
+            if (--m < 0) goto done;
+            counters[m]++;
+        }
     }
+
 done:
-    tmpary_discard(t0);
-    tmpbuf_discard(t1);
+    ALLOCV_END(t1);
 
     return NIL_P(result) ? ary : result;
 }
 
 /*
  *  call-seq:
- *     ary.take(n)               -> new_ary
+ *    array.take(n) -> new_array
  *
- *  Returns first +n+ elements from the array.
+ *  Returns a new \Array containing the first +n+ element of +self+,
+ *  where +n+ is a non-negative \Integer;
+ *  does not modify +self+.
  *
- *  If a negative number is given, raises an ArgumentError.
+ *  Examples:
  *
- *  See also Array#drop
- *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.take(3)             #=> [1, 2, 3]
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.take(1) # => [0]
+ *    a.take(2) # => [0, 1]
+ *    a.take(50) # => [0, 1, 2, 3, 4, 5]
+ *    a # => [0, 1, 2, 3, 4, 5]
  *
  */
 
@@ -5189,25 +7757,31 @@ rb_ary_take(VALUE obj, VALUE n)
 {
     long len = NUM2LONG(n);
     if (len < 0) {
-	rb_raise(rb_eArgError, "attempt to take negative size");
+        rb_raise(rb_eArgError, "attempt to take negative size");
     }
     return rb_ary_subseq(obj, 0, len);
 }
 
 /*
  *  call-seq:
- *     ary.take_while { |arr| block }  -> new_ary
- *     ary.take_while                  -> Enumerator
+ *    array.take_while {|element| ... } -> new_array
+ *    array.take_while -> new_enumerator
+ *
+ *  Returns a new \Array containing zero or more leading elements of +self+;
+ *  does not modify +self+.
  *
- *  Passes elements to the block until the block returns +nil+ or +false+, then
- *  stops iterating and returns an array of all prior elements.
+ *  With a block given, calls the block with each successive element of +self+;
+ *  stops if the block returns +false+ or +nil+;
+ *  returns a new \Array containing those elements for which the block returned a truthy value:
  *
- *  If no block is given, an Enumerator is returned instead.
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.take_while {|element| element < 3 } # => [0, 1, 2]
+ *    a.take_while {|element| true } # => [0, 1, 2, 3, 4, 5]
+ *    a # => [0, 1, 2, 3, 4, 5]
  *
- *  See also Array#drop_while
+ *  With no block given, returns a new \Enumerator:
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.take_while { |i| i < 3 }  #=> [1, 2]
+ *    [0, 1].take_while # => #<Enumerator: [0, 1]:take_while>
  *
  */
 
@@ -5218,24 +7792,25 @@ rb_ary_take_while(VALUE ary)
 
     RETURN_ENUMERATOR(ary, 0, 0);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
     }
     return rb_ary_take(ary, LONG2FIX(i));
 }
 
 /*
  *  call-seq:
- *     ary.drop(n)               -> new_ary
+ *    array.drop(n) -> new_array
  *
- *  Drops first +n+ elements from +ary+ and returns the rest of the elements in
- *  an array.
+ *  Returns a new \Array containing all but the first +n+ element of +self+,
+ *  where +n+ is a non-negative \Integer;
+ *  does not modify +self+.
  *
- *  If a negative number is given, raises an ArgumentError.
+ *  Examples:
  *
- *  See also Array#take
- *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.drop(3)             #=> [4, 5, 0]
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.drop(0) # => [0, 1, 2, 3, 4, 5]
+ *    a.drop(1) # => [1, 2, 3, 4, 5]
+ *    a.drop(2) # => [2, 3, 4, 5]
  *
  */
 
@@ -5245,29 +7820,32 @@ rb_ary_drop(VALUE ary, VALUE n)
     VALUE result;
     long pos = NUM2LONG(n);
     if (pos < 0) {
-	rb_raise(rb_eArgError, "attempt to drop negative size");
+        rb_raise(rb_eArgError, "attempt to drop negative size");
     }
 
     result = rb_ary_subseq(ary, pos, RARRAY_LEN(ary));
-    if (result == Qnil) result = rb_ary_new();
+    if (NIL_P(result)) result = rb_ary_new();
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.drop_while { |arr| block }   -> new_ary
- *     ary.drop_while                  -> Enumerator
+ *    array.drop_while {|element| ... } -> new_array
+ *    array.drop_while -> new_enumerator
+
+ *  Returns a new \Array containing zero or more trailing elements of +self+;
+ *  does not modify +self+.
  *
- *  Drops elements up to, but not including, the first element for which the
- *  block returns +nil+ or +false+ and returns an array containing the
- *  remaining elements.
+ *  With a block given, calls the block with each successive element of +self+;
+ *  stops if the block returns +false+ or +nil+;
+ *  returns a new \Array _omitting_ those elements for which the block returned a truthy value:
  *
- *  If no block is given, an Enumerator is returned instead.
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.drop_while {|element| element < 3 } # => [3, 4, 5]
  *
- *  See also Array#take_while
+ *  With no block given, returns a new \Enumerator:
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.drop_while {|i| i < 3 }   #=> [3, 4, 5, 0]
+ *    [0, 1].drop_while # => # => #<Enumerator: [0, 1]:drop_while>
  *
  */
 
@@ -5278,60 +7856,588 @@ rb_ary_drop_while(VALUE ary)
 
     RETURN_ENUMERATOR(ary, 0, 0);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
     }
     return rb_ary_drop(ary, LONG2FIX(i));
 }
 
 /*
- *  Arrays are ordered, integer-indexed collections of any object.
+ *  call-seq:
+ *    array.any? -> true or false
+ *    array.any? {|element| ... } -> true or false
+ *    array.any?(obj) -> true or false
+ *
+ *  Returns +true+ if any element of +self+ meets a given criterion.
+ *
+ *  With no block given and no argument, returns +true+ if +self+ has any truthy element,
+ *  +false+ otherwise:
+ *
+ *    [nil, 0, false].any? # => true
+ *    [nil, false].any? # => false
+ *    [].any? # => false
+ *
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns any truthy value, +false+ otherwise:
+ *
+ *    [0, 1, 2].any? {|element| element > 1 } # => true
+ *    [0, 1, 2].any? {|element| element > 2 } # => false
+ *
+ *  If argument +obj+ is given, returns +true+ if +obj+.<tt>===</tt> any element,
+ *  +false+ otherwise:
+ *
+ *    ['food', 'drink'].any?(/foo/) # => true
+ *    ['food', 'drink'].any?(/bar/) # => false
+ *    [].any?(/foo/) # => false
+ *    [0, 1, 2].any?(1) # => true
+ *    [0, 1, 2].any?(3) # => false
+ *
+ *  Related: Enumerable#any?
+ */
+
+static VALUE
+rb_ary_any_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qfalse;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qtrue;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) return Qtrue;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qtrue;
+        }
+    }
+    return Qfalse;
+}
+
+/*
+ *  call-seq:
+ *    array.all? -> true or false
+ *    array.all? {|element| ... } -> true or false
+ *    array.all?(obj) -> true or false
+ *
+ *  Returns +true+ if all elements of +self+ meet a given criterion.
+ *
+ *  With no block given and no argument, returns +true+ if +self+ contains only truthy elements,
+ *  +false+ otherwise:
+ *
+ *    [0, 1, :foo].all? # => true
+ *    [0, nil, 2].all? # => false
+ *    [].all? # => true
+ *
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns only truthy values, +false+ otherwise:
+ *
+ *    [0, 1, 2].all? { |element| element < 3 } # => true
+ *    [0, 1, 2].all? { |element| element < 2 } # => false
+ *
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> every element, +false+ otherwise:
+ *
+ *    ['food', 'fool', 'foot'].all?(/foo/) # => true
+ *    ['food', 'drink'].all?(/bar/) # => false
+ *    [].all?(/foo/) # => true
+ *    [0, 0, 0].all?(0) # => true
+ *    [0, 1, 2].all?(1) # => false
+ *
+ *  Related: Enumerable#all?
+ */
+
+static VALUE
+rb_ary_all_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qtrue;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (!RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (!RTEST(RARRAY_AREF(ary, i))) return Qfalse;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    return Qtrue;
+}
+
+/*
+ *  call-seq:
+ *    array.none? -> true or false
+ *    array.none? {|element| ... } -> true or false
+ *    array.none?(obj) -> true or false
+ *
+ *  Returns +true+ if no element of +self+ meet a given criterion.
+ *
+ *  With no block given and no argument, returns +true+ if +self+ has no truthy elements,
+ *  +false+ otherwise:
+ *
+ *    [nil, false].none? # => true
+ *    [nil, 0, false].none? # => false
+ *    [].none? # => true
+ *
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns no truthy value, +false+ otherwise:
+ *
+ *    [0, 1, 2].none? {|element| element > 3 } # => true
+ *    [0, 1, 2].none? {|element| element > 1 } # => false
+ *
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> no element, +false+ otherwise:
+ *
+ *    ['food', 'drink'].none?(/bar/) # => true
+ *    ['food', 'drink'].none?(/foo/) # => false
+ *    [].none?(/foo/) # => true
+ *    [0, 1, 2].none?(3) # => true
+ *    [0, 1, 2].none?(1) # => false
+ *
+ *  Related: Enumerable#none?
+ */
+
+static VALUE
+rb_ary_none_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qtrue;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) return Qfalse;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    return Qtrue;
+}
+
+/*
+ *  call-seq:
+ *    array.one? -> true or false
+ *    array.one? {|element| ... } -> true or false
+ *    array.one?(obj) -> true or false
+ *
+ *  Returns +true+ if exactly one element of +self+ meets a given criterion.
+ *
+ *  With no block given and no argument, returns +true+ if +self+ has exactly one truthy element,
+ *  +false+ otherwise:
+ *
+ *    [nil, 0].one? # => true
+ *    [0, 0].one? # => false
+ *    [nil, nil].one? # => false
+ *    [].one? # => false
+ *
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block a truthy value for exactly one element, +false+ otherwise:
+ *
+ *    [0, 1, 2].one? {|element| element > 0 } # => false
+ *    [0, 1, 2].one? {|element| element > 1 } # => true
+ *    [0, 1, 2].one? {|element| element > 2 } # => false
+ *
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> exactly one element,
+ *  +false+ otherwise:
+ *
+ *    [0, 1, 2].one?(0) # => true
+ *    [0, 0, 1].one?(0) # => false
+ *    [1, 1, 2].one?(0) # => false
+ *    ['food', 'drink'].one?(/bar/) # => false
+ *    ['food', 'drink'].one?(/foo/) # => true
+ *    [].one?(/foo/) # => false
+ *
+ *  Related: Enumerable#one?
+ */
+
+static VALUE
+rb_ary_one_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+    VALUE result = Qfalse;
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qfalse;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    array.dig(index, *identifiers) -> object
+ *
+ *  Finds and returns the object in nested objects
+ *  that is specified by +index+ and +identifiers+.
+ *  The nested objects may be instances of various classes.
+ *  See {Dig Methods}[rdoc-ref:dig_methods.rdoc].
+ *
+ *  Examples:
+ *
+ *    a = [:foo, [:bar, :baz, [:bat, :bam]]]
+ *    a.dig(1) # => [:bar, :baz, [:bat, :bam]]
+ *    a.dig(1, 2) # => [:bat, :bam]
+ *    a.dig(1, 2, 0) # => :bat
+ *    a.dig(1, 2, 3) # => nil
+ *
+ */
+
+static VALUE
+rb_ary_dig(int argc, VALUE *argv, VALUE self)
+{
+    rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
+    self = rb_ary_at(self, *argv);
+    if (!--argc) return self;
+    ++argv;
+    return rb_obj_dig(argc, argv, self, Qnil);
+}
+
+static inline VALUE
+finish_exact_sum(long n, VALUE r, VALUE v, int z)
+{
+    if (n != 0)
+        v = rb_fix_plus(LONG2FIX(n), v);
+    if (!UNDEF_P(r)) {
+        v = rb_rational_plus(r, v);
+    }
+    else if (!n && z) {
+        v = rb_fix_plus(LONG2FIX(0), v);
+    }
+    return v;
+}
+
+/*
+ * call-seq:
+ *   array.sum(init = 0) -> object
+ *   array.sum(init = 0) {|element| ... } -> object
+ *
+ *  When no block is given, returns the object equivalent to:
+ *
+ *    sum = init
+ *    array.each {|element| sum += element }
+ *    sum
+ *
+ *  For example, <tt>[e1, e2, e3].sum</tt> returns <tt>init + e1 + e2 + e3</tt>.
+ *
+ *  Examples:
+ *
+ *    a = [0, 1, 2, 3]
+ *    a.sum # => 6
+ *    a.sum(100) # => 106
+ *
+ *  The elements need not be numeric, but must be <tt>+</tt>-compatible
+ *  with each other and with +init+:
+ *
+ *    a = ['abc', 'def', 'ghi']
+ *    a.sum('jkl') # => "jklabcdefghi"
+ *
+ *  When a block is given, it is called with each element
+ *  and the block's return value (instead of the element itself) is used as the addend:
+ *
+ *    a = ['zero', 1, :two]
+ *    s = a.sum('Coerced and concatenated: ') {|element| element.to_s }
+ *    s # => "Coerced and concatenated: zero1two"
+ *
+ *  Notes:
+ *
+ *  - Array#join and Array#flatten may be faster than Array#sum
+ *    for an \Array of Strings or an \Array of Arrays.
+ *  - Array#sum method may not respect method redefinition of "+" methods such as Integer#+.
+ *
+ */
+
+static VALUE
+rb_ary_sum(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE e, v, r;
+    long i, n;
+    int block_given;
+
+    v = (rb_check_arity(argc, 0, 1) ? argv[0] : LONG2FIX(0));
+
+    block_given = rb_block_given_p();
+
+    if (RARRAY_LEN(ary) == 0)
+        return v;
+
+    n = 0;
+    r = Qundef;
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (block_given)
+            e = rb_yield(e);
+        if (FIXNUM_P(e)) {
+            n += FIX2LONG(e); /* should not overflow long type */
+            if (!FIXABLE(n)) {
+                v = rb_big_plus(LONG2NUM(n), v);
+                n = 0;
+            }
+        }
+        else if (RB_BIGNUM_TYPE_P(e))
+            v = rb_big_plus(e, v);
+        else if (RB_TYPE_P(e, T_RATIONAL)) {
+            if (UNDEF_P(r))
+                r = e;
+            else
+                r = rb_rational_plus(r, e);
+        }
+        else
+            goto not_exact;
+    }
+    v = finish_exact_sum(n, r, v, argc!=0);
+    return v;
+
+  not_exact:
+    v = finish_exact_sum(n, r, v, i!=0);
+
+    if (RB_FLOAT_TYPE_P(e)) {
+        /*
+         * Kahan-Babuska balancing compensated summation algorithm
+         * See https://link.springer.com/article/10.1007/s00607-005-0139-x
+         */
+        double f, c;
+        double x, t;
+
+        f = NUM2DBL(v);
+        c = 0.0;
+        goto has_float_value;
+        for (; i < RARRAY_LEN(ary); i++) {
+            e = RARRAY_AREF(ary, i);
+            if (block_given)
+                e = rb_yield(e);
+            if (RB_FLOAT_TYPE_P(e))
+              has_float_value:
+                x = RFLOAT_VALUE(e);
+            else if (FIXNUM_P(e))
+                x = FIX2LONG(e);
+            else if (RB_BIGNUM_TYPE_P(e))
+                x = rb_big2dbl(e);
+            else if (RB_TYPE_P(e, T_RATIONAL))
+                x = rb_num2dbl(e);
+            else
+                goto not_float;
+
+            if (isnan(f)) continue;
+            if (isnan(x)) {
+                f = x;
+                continue;
+            }
+            if (isinf(x)) {
+                if (isinf(f) && signbit(x) != signbit(f))
+                    f = NAN;
+                else
+                    f = x;
+                continue;
+            }
+            if (isinf(f)) continue;
+
+            t = f + x;
+            if (fabs(f) >= fabs(x))
+                c += ((f - t) + x);
+            else
+                c += ((x - t) + f);
+            f = t;
+        }
+        f += c;
+        return DBL2NUM(f);
+
+      not_float:
+        v = DBL2NUM(f);
+    }
+
+    goto has_some_value;
+    for (; i < RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (block_given)
+            e = rb_yield(e);
+      has_some_value:
+        v = rb_funcall(v, idPLUS, 1, e);
+    }
+    return v;
+}
+
+static VALUE
+rb_ary_deconstruct(VALUE ary)
+{
+    return ary;
+}
+
+/*
+ *  An \Array is an ordered, integer-indexed collection of objects, called _elements_.
+ *  Any object (even another array) may be an array element,
+ *  and an array can contain objects of different types.
+ *
+ *  == \Array Indexes
+ *
+ *  \Array indexing starts at 0, as in C or Java.
+ *
+ *  A positive index is an offset from the first element:
+ *
+ *  - Index 0 indicates the first element.
+ *  - Index 1 indicates the second element.
+ *  - ...
+ *
+ *  A negative index is an offset, backwards, from the end of the array:
+ *
+ *  - Index -1 indicates the last element.
+ *  - Index -2 indicates the next-to-last element.
+ *  - ...
+ *
+ *  A non-negative index is <i>in range</i> if and only if it is smaller than
+ *  the size of the array.  For a 3-element array:
+ *
+ *  - Indexes 0 through 2 are in range.
+ *  - Index 3 is out of range.
+ *
+ *  A negative index is <i>in range</i> if and only if its absolute value is
+ *  not larger than the size of the array.  For a 3-element array:
+ *
+ *  - Indexes -1 through -3 are in range.
+ *  - Index -4 is out of range.
+ *
+ *  Although the effective index into an array is always an integer,
+ *  some methods (both within and outside of class \Array)
+ *  accept one or more non-integer arguments that are
+ *  {integer-convertible objects}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
  *
- *  Array indexing starts at 0, as in C or Java.  A negative index is assumed
- *  to be relative to the end of the array---that is, an index of -1 indicates
- *  the last element of the array, -2 is the next to last element in the
- *  array, and so on.
  *
  *  == Creating Arrays
  *
- *  A new array can be created by using the literal constructor
- *  <code>[]</code>.  Arrays can contain different types of objects.  For
- *  example, the array below contains an Integer, a String and a Float:
+ *  You can create an \Array object explicitly with:
+ *
+ *  - An {array literal}[rdoc-ref:literals.rdoc@Array+Literals]:
+ *
+ *      [1, 'one', :one, [2, 'two', :two]]
+ *
+ *  - A {%w or %W: string-array Literal}[rdoc-ref:literals.rdoc@25w+and+-25W-3A+String-Array+Literals]:
+ *
+ *      %w[foo bar baz] # => ["foo", "bar", "baz"]
+ *      %w[1 % *]       # => ["1", "%", "*"]
  *
- *     ary = [1, "two", 3.0] #=> [1, "two", 3.0]
+ *  - A {%i pr %I: symbol-array Literal}[rdoc-ref:literals.rdoc@25i+and+-25I-3A+Symbol-Array+Literals]:
  *
- *  An array can also be created by explicitly calling Array.new with zero, one
- *  (the initial size of the Array) or two arguments (the initial size and a
- *  default object).
+ *      %i[foo bar baz] # => [:foo, :bar, :baz]
+ *      %i[1 % *]       # => [:"1", :%, :*]
  *
- *     ary = Array.new    #=> []
- *     Array.new(3)       #=> [nil, nil, nil]
- *     Array.new(3, true) #=> [true, true, true]
+ *  - \Method Kernel#Array:
  *
- *  Note that the second argument populates the array with references to the
- *  same object.  Therefore, it is only recommended in cases when you need to
- *  instantiate arrays with natively immutable objects such as Symbols,
- *  numbers, true or false.
+ *      Array(["a", "b"])             # => ["a", "b"]
+ *      Array(1..5)                   # => [1, 2, 3, 4, 5]
+ *      Array(key: :value)            # => [[:key, :value]]
+ *      Array(nil)                    # => []
+ *      Array(1)                      # => [1]
+ *      Array({:a => "a", :b => "b"}) # => [[:a, "a"], [:b, "b"]]
  *
- *  To create an array with separate objects a block can be passed instead.
- *  This method is safe to use with mutable objects such as hashes, strings or
- *  other arrays:
+ *  - \Method Array.new:
  *
- *     Array.new(4) { Hash.new } #=> [{}, {}, {}, {}]
+ *      Array.new               # => []
+ *      Array.new(3)            # => [nil, nil, nil]
+ *      Array.new(4) {Hash.new} # => [{}, {}, {}, {}]
+ *      Array.new(3, true)      # => [true, true, true]
  *
- *  This is also a quick way to build up multi-dimensional arrays:
+ *    Note that the last example above populates the array
+ *    with references to the same object.
+ *    This is recommended only in cases where that object is a natively immutable object
+ *    such as a symbol, a numeric, +nil+, +true+, or +false+.
  *
- *     empty_table = Array.new(3) { Array.new(3) }
- *     #=> [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
+ *    Another way to create an array with various objects, using a block;
+ *    this usage is safe for mutable objects such as hashes, strings or
+ *    other arrays:
  *
- *  An array can also be created by using the Array() method, provided by
- *  Kernel, which tries to call #to_ary, then #to_a on its argument.
+ *      Array.new(4) {|i| i.to_s } # => ["0", "1", "2", "3"]
  *
- *	Array({:a => "a", :b => "b"}) #=> [[:a, "a"], [:b, "b"]]
+ *    Here is a way to create a multi-dimensional array:
+ *
+ *      Array.new(3) {Array.new(3)}
+ *      # => [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
+ *
+ *  A number of Ruby methods, both in the core and in the standard library,
+ *  provide instance method +to_a+, which converts an object to an array.
+ *
+ *  - ARGF#to_a
+ *  - Array#to_a
+ *  - Enumerable#to_a
+ *  - Hash#to_a
+ *  - MatchData#to_a
+ *  - NilClass#to_a
+ *  - OptionParser#to_a
+ *  - Range#to_a
+ *  - Set#to_a
+ *  - Struct#to_a
+ *  - Time#to_a
+ *  - Benchmark::Tms#to_a
+ *  - CSV::Table#to_a
+ *  - Enumerator::Lazy#to_a
+ *  - Gem::List#to_a
+ *  - Gem::NameTuple#to_a
+ *  - Gem::Platform#to_a
+ *  - Gem::RequestSet::Lockfile::Tokenizer#to_a
+ *  - Gem::SourceList#to_a
+ *  - OpenSSL::X509::Extension#to_a
+ *  - OpenSSL::X509::Name#to_a
+ *  - Racc::ISet#to_a
+ *  - Rinda::RingFinger#to_a
+ *  - Ripper::Lexer::Elem#to_a
+ *  - RubyVM::InstructionSequence#to_a
+ *  - YAML::DBM#to_a
  *
  *  == Example Usage
  *
  *  In addition to the methods it mixes in through the Enumerable module, the
- *  Array class has proprietary methods for accessing, searching and otherwise
+ *  \Array class has proprietary methods for accessing, searching and otherwise
  *  manipulating arrays.
  *
  *  Some of the more common ones are illustrated below.
@@ -5340,7 +8446,8 @@ rb_ary_drop_while(VALUE ary)
  *
  *  Elements in an array can be retrieved using the Array#[] method.  It can
  *  take a single integer argument (a numeric index), a pair of arguments
- *  (start and length) or a range.
+ *  (start and length) or a range. Negative indices start counting from the end,
+ *  with -1 being the last element.
  *
  *     arr = [1, 2, 3, 4, 5, 6]
  *     arr[2]    #=> 3
@@ -5348,6 +8455,7 @@ rb_ary_drop_while(VALUE ary)
  *     arr[-3]   #=> 4
  *     arr[2, 3] #=> [3, 4, 5]
  *     arr[1..4] #=> [2, 3, 4, 5]
+ *     arr[1..-3] #=> [2, 3, 4]
  *
  *  Another way to access a particular array element is by using the #at method
  *
@@ -5377,7 +8485,7 @@ rb_ary_drop_while(VALUE ary)
  *
  *     arr.drop(3) #=> [4, 5, 6]
  *
- *  == Obtaining Information about an Array
+ *  == Obtaining Information about an \Array
  *
  *  Arrays keep track of their own length at all times.  To query an array
  *  about the number of elements it contains, use #length, #count or #size.
@@ -5415,7 +8523,7 @@ rb_ary_drop_while(VALUE ary)
  *     arr.insert(3, 'orange', 'pear', 'grapefruit')
  *     #=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
  *
- *  == Removing Items from an Array
+ *  == Removing Items from an \Array
  *
  *  The method #pop removes the last element in an array and returns it:
  *
@@ -5457,15 +8565,15 @@ rb_ary_drop_while(VALUE ary)
  *
  *  == Iterating over Arrays
  *
- *  Like all classes that include the Enumerable module, Array has an each
+ *  Like all classes that include the Enumerable module, \Array has an each
  *  method, which defines what elements should be iterated over and how.  In
- *  case of Array's #each, all elements in the Array instance are yielded to
+ *  case of Array's #each, all elements in the \Array instance are yielded to
  *  the supplied block in sequence.
  *
  *  Note that this operation leaves the array unchanged.
  *
  *     arr = [1, 2, 3, 4, 5]
- *     arr.each { |a| print a -= 10, " " }
+ *     arr.each {|a| print a -= 10, " "}
  *     # prints: -9 -8 -7 -6 -5
  *     #=> [1, 2, 3, 4, 5]
  *
@@ -5474,18 +8582,19 @@ rb_ary_drop_while(VALUE ary)
  *
  *     words = %w[first second third fourth fifth sixth]
  *     str = ""
- *     words.reverse_each { |word| str += "#{word} " }
+ *     words.reverse_each {|word| str += "#{word} "}
  *     p str #=> "sixth fifth fourth third second first "
  *
  *  The #map method can be used to create a new array based on the original
  *  array, but with the values modified by the supplied block:
  *
- *     arr.map { |a| 2*a }   #=> [2, 4, 6, 8, 10]
+ *     arr.map {|a| 2*a}     #=> [2, 4, 6, 8, 10]
  *     arr                   #=> [1, 2, 3, 4, 5]
- *     arr.map! { |a| a**2 } #=> [1, 4, 9, 16, 25]
+ *     arr.map! {|a| a**2}   #=> [1, 4, 9, 16, 25]
  *     arr                   #=> [1, 4, 9, 16, 25]
  *
- *  == Selecting Items from an Array
+ *
+ *  == Selecting Items from an \Array
  *
  *  Elements can be selected from an array according to criteria defined in a
  *  block.  The selection can happen in a destructive or a non-destructive
@@ -5496,9 +8605,9 @@ rb_ary_drop_while(VALUE ary)
  *  === Non-destructive Selection
  *
  *     arr = [1, 2, 3, 4, 5, 6]
- *     arr.select { |a| a > 3 }     #=> [4, 5, 6]
- *     arr.reject { |a| a < 3 }     #=> [3, 4, 5, 6]
- *     arr.drop_while { |a| a < 4 } #=> [4, 5, 6]
+ *     arr.select {|a| a > 3}       #=> [4, 5, 6]
+ *     arr.reject {|a| a < 3}       #=> [3, 4, 5, 6]
+ *     arr.drop_while {|a| a < 4}   #=> [4, 5, 6]
  *     arr                          #=> [1, 2, 3, 4, 5, 6]
  *
  *  === Destructive Selection
@@ -5509,25 +8618,205 @@ rb_ary_drop_while(VALUE ary)
  *  Similar to #select vs. #reject, #delete_if and #keep_if have the exact
  *  opposite result when supplied with the same block:
  *
- *     arr.delete_if { |a| a < 4 } #=> [4, 5, 6]
+ *     arr.delete_if {|a| a < 4}   #=> [4, 5, 6]
  *     arr                         #=> [4, 5, 6]
  *
  *     arr = [1, 2, 3, 4, 5, 6]
- *     arr.keep_if { |a| a < 4 } #=> [1, 2, 3]
+ *     arr.keep_if {|a| a < 4}   #=> [1, 2, 3]
  *     arr                       #=> [1, 2, 3]
  *
+ *  == What's Here
+ *
+ *  First, what's elsewhere. \Class \Array:
+ *
+ *  - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
+ *  - Includes {module Enumerable}[rdoc-ref:Enumerable@What-27s+Here],
+ *    which provides dozens of additional methods.
+ *
+ *  Here, class \Array provides methods that are useful for:
+ *
+ *  - {Creating an Array}[rdoc-ref:Array@Methods+for+Creating+an+Array]
+ *  - {Querying}[rdoc-ref:Array@Methods+for+Querying]
+ *  - {Comparing}[rdoc-ref:Array@Methods+for+Comparing]
+ *  - {Fetching}[rdoc-ref:Array@Methods+for+Fetching]
+ *  - {Assigning}[rdoc-ref:Array@Methods+for+Assigning]
+ *  - {Deleting}[rdoc-ref:Array@Methods+for+Deleting]
+ *  - {Combining}[rdoc-ref:Array@Methods+for+Combining]
+ *  - {Iterating}[rdoc-ref:Array@Methods+for+Iterating]
+ *  - {Converting}[rdoc-ref:Array@Methods+for+Converting]
+ *  - {And more....}[rdoc-ref:Array@Other+Methods]
+ *
+ *  === Methods for Creating an \Array
+ *
+ *  - ::[]: Returns a new array populated with given objects.
+ *  - ::new: Returns a new array.
+ *  - ::try_convert: Returns a new array created from a given object.
+ *
+ *  === Methods for Querying
+ *
+ *  - #length, #size: Returns the count of elements.
+ *  - #include?: Returns whether any element <tt>==</tt> a given object.
+ *  - #empty?: Returns whether there are no elements.
+ *  - #all?: Returns whether all elements meet a given criterion.
+ *  - #any?: Returns whether any element meets a given criterion.
+ *  - #none?: Returns whether no element <tt>==</tt> a given object.
+ *  - #one?: Returns whether exactly one element <tt>==</tt> a given object.
+ *  - #count: Returns the count of elements that meet a given criterion.
+ *  - #find_index, #index: Returns the index of the first element that meets a given criterion.
+ *  - #rindex: Returns the index of the last element that meets a given criterion.
+ *  - #hash: Returns the integer hash code.
+ *
+ *  === Methods for Comparing
+ *
+ *  - #<=>: Returns -1, 0, or 1 * as +self+ is less than, equal to, or
+ *    greater than a given object.
+ *  - #==: Returns whether each element in +self+ is <tt>==</tt> to the corresponding element
+ *    in a given object.
+ *  - #eql?: Returns whether each element in +self+ is <tt>eql?</tt> to the corresponding
+ *    element in a given object.
+
+ *  === Methods for Fetching
+ *
+ *  These methods do not modify +self+.
+ *
+ *  - #[]: Returns one or more elements.
+ *  - #fetch: Returns the element at a given offset.
+ *  - #first: Returns one or more leading elements.
+ *  - #last: Returns one or more trailing elements.
+ *  - #max: Returns one or more maximum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #min: Returns one or more minimum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #minmax: Returns the minimum-valued and maximum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #assoc: Returns the first element that is an array
+ *    whose first element <tt>==</tt> a given object.
+ *  - #rassoc: Returns the first element that is an array
+ *    whose second element <tt>==</tt> a given object.
+ *  - #at: Returns the element at a given offset.
+ *  - #values_at: Returns the elements at given offsets.
+ *  - #dig: Returns the object in nested objects
+ *    that is specified by a given index and additional arguments.
+ *  - #drop: Returns trailing elements as determined by a given index.
+ *  - #take: Returns leading elements as determined by a given index.
+ *  - #drop_while: Returns trailing elements as determined by a given block.
+ *  - #take_while: Returns leading elements as determined by a given block.
+ *  - #slice: Returns consecutive elements as determined by a given argument.
+ *  - #sort: Returns all elements in an order determined by <tt><=></tt> or a given block.
+ *  - #reverse: Returns all elements in reverse order.
+ *  - #compact: Returns an array containing all non-+nil+ elements.
+ *  - #select, #filter: Returns an array containing elements selected by a given block.
+ *  - #uniq: Returns an array containing non-duplicate elements.
+ *  - #rotate: Returns all elements with some rotated from one end to the other.
+ *  - #bsearch: Returns an element selected via a binary search
+ *    as determined by a given block.
+ *  - #bsearch_index: Returns the index of an element selected via a binary search
+ *    as determined by a given block.
+ *  - #sample: Returns one or more random elements.
+ *  - #shuffle: Returns elements in a random order.
+ *
+ *  === Methods for Assigning
+ *
+ *  These methods add, replace, or reorder elements in +self+.
+ *
+ *  - #[]=: Assigns specified elements with a given object.
+ *  - #push, #append, #<<: Appends trailing elements.
+ *  - #unshift, #prepend: Prepends leading elements.
+ *  - #insert: Inserts given objects at a given offset; does not replace elements.
+ *  - #concat: Appends all elements from given arrays.
+ *  - #fill: Replaces specified elements with specified objects.
+ *  - #replace: Replaces the content of +self+ with the content of a given array.
+ *  - #reverse!: Replaces +self+ with its elements reversed.
+ *  - #rotate!: Replaces +self+ with its elements rotated.
+ *  - #shuffle!: Replaces +self+ with its elements in random order.
+ *  - #sort!: Replaces +self+ with its elements sorted,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #sort_by!: Replaces +self+ with its elements sorted, as determined by a given block.
+ *
+ *  === Methods for Deleting
+ *
+ *  Each of these methods removes elements from +self+:
+ *
+ *  - #pop: Removes and returns the last element.
+ *  - #shift:  Removes and returns the first element.
+ *  - #compact!: Removes all +nil+ elements.
+ *  - #delete: Removes elements equal to a given object.
+ *  - #delete_at: Removes the element at a given offset.
+ *  - #delete_if: Removes elements specified by a given block.
+ *  - #keep_if: Removes elements not specified by a given block.
+ *  - #reject!: Removes elements specified by a given block.
+ *  - #select!, #filter!: Removes elements not specified by a given block.
+ *  - #slice!: Removes and returns a sequence of elements.
+ *  - #uniq!: Removes duplicates.
+ *
+ *  === Methods for Combining
+ *
+ *  - #&: Returns an array containing elements found both in +self+ and a given array.
+ *  - #intersection: Returns an array containing elements found both in +self+
+ *    and in each given array.
+ *  - #+: Returns an array containing all elements of +self+ followed by all elements of a given array.
+ *  - #-: Returns an array containing all elements of +self+ that are not found in a given array.
+ *  - #|: Returns an array containing all elements of +self+ and all elements of a given array,
+ *    duplicates removed.
+ *  - #union: Returns an array containing all elements of +self+ and all elements of given arrays,
+ *    duplicates removed.
+ *  - #difference: Returns an array containing all elements of +self+ that are not found
+ *    in any of the given arrays..
+ *  - #product: Returns or yields all combinations of elements from +self+ and given arrays.
+ *
+ *  === Methods for Iterating
+ *
+ *  - #each: Passes each element to a given block.
+ *  - #reverse_each:  Passes each element, in reverse order, to a given block.
+ *  - #each_index: Passes each element index to a given block.
+ *  - #cycle: Calls a given block with each element, then does so again,
+ *    for a specified number of times, or forever.
+ *  - #combination: Calls a given block with combinations of elements of +self+;
+ *    a combination does not use the same element more than once.
+ *  - #permutation: Calls a given block with permutations of elements of +self+;
+ *    a permutation does not use the same element more than once.
+ *  - #repeated_combination: Calls a given block with combinations of elements of +self+;
+ *    a combination may use the same element more than once.
+ *  - #repeated_permutation: Calls a given block with permutations of elements of +self+;
+ *    a permutation may use the same element more than once.
+ *
+ *  === Methods for Converting
+ *
+ *  - #map, #collect: Returns an array containing the block return-value for each element.
+ *  - #map!, #collect!: Replaces each element with a block return-value.
+ *  - #flatten: Returns an array that is a recursive flattening of +self+.
+ *  - #flatten!: Replaces each nested array in +self+ with the elements from that array.
+ *  - #inspect, #to_s: Returns a new String containing the elements.
+ *  - #join: Returns a newsString containing the elements joined by the field separator.
+ *  - #to_a: Returns +self+ or a new array containing all elements.
+ *  - #to_ary: Returns +self+.
+ *  - #to_h: Returns a new hash formed from the elements.
+ *  - #transpose: Transposes +self+, which must be an array of arrays.
+ *  - #zip: Returns a new array of arrays containing +self+ and given arrays;
+ *    follow the link for details.
+ *
+ *  === Other Methods
+ *
+ *  - #*: Returns one of the following:
+ *
+ *    - With integer argument +n+, a new array that is the concatenation
+ *      of +n+ copies of +self+.
+ *    - With string argument +field_separator+, a new string that is equivalent to
+ *      <tt>join(field_separator)</tt>.
+ *
+ *  - #abbrev: Returns a hash of unambiguous abbreviations for elements.
+ *  - #pack: Packs the elements into a binary sequence.
+ *  - #sum: Returns a sum of elements according to either <tt>+</tt> or a given block.
  */
 
 void
 Init_Array(void)
 {
-#undef rb_intern
-#define rb_intern(str) rb_intern_const(str)
-
     rb_cArray  = rb_define_class("Array", rb_cObject);
     rb_include_module(rb_cArray, rb_mEnumerable);
 
     rb_define_alloc_func(rb_cArray, empty_ary_alloc);
+    rb_define_singleton_method(rb_cArray, "new", rb_ary_s_new, -1);
     rb_define_singleton_method(rb_cArray, "[]", rb_ary_s_create, -1);
     rb_define_singleton_method(rb_cArray, "try_convert", rb_ary_s_try_convert, 1);
     rb_define_method(rb_cArray, "initialize", rb_ary_initialize, -1);
@@ -5536,8 +8825,8 @@ Init_Array(void)
     rb_define_method(rb_cArray, "inspect", rb_ary_inspect, 0);
     rb_define_alias(rb_cArray,  "to_s", "inspect");
     rb_define_method(rb_cArray, "to_a", rb_ary_to_a, 0);
+    rb_define_method(rb_cArray, "to_h", rb_ary_to_h, 0);
     rb_define_method(rb_cArray, "to_ary", rb_ary_to_ary_m, 0);
-    rb_define_method(rb_cArray, "frozen?",  rb_ary_frozen_p, 0);
 
     rb_define_method(rb_cArray, "==", rb_ary_equal, 1);
     rb_define_method(rb_cArray, "eql?", rb_ary_eql, 1);
@@ -5549,18 +8838,24 @@ Init_Array(void)
     rb_define_method(rb_cArray, "fetch", rb_ary_fetch, -1);
     rb_define_method(rb_cArray, "first", rb_ary_first, -1);
     rb_define_method(rb_cArray, "last", rb_ary_last, -1);
-    rb_define_method(rb_cArray, "concat", rb_ary_concat, 1);
+    rb_define_method(rb_cArray, "concat", rb_ary_concat_multi, -1);
+    rb_define_method(rb_cArray, "union", rb_ary_union_multi, -1);
+    rb_define_method(rb_cArray, "difference", rb_ary_difference_multi, -1);
+    rb_define_method(rb_cArray, "intersection", rb_ary_intersection_multi, -1);
+    rb_define_method(rb_cArray, "intersect?", rb_ary_intersect_p, 1);
     rb_define_method(rb_cArray, "<<", rb_ary_push, 1);
     rb_define_method(rb_cArray, "push", rb_ary_push_m, -1);
+    rb_define_alias(rb_cArray,  "append", "push");
     rb_define_method(rb_cArray, "pop", rb_ary_pop_m, -1);
     rb_define_method(rb_cArray, "shift", rb_ary_shift_m, -1);
     rb_define_method(rb_cArray, "unshift", rb_ary_unshift_m, -1);
+    rb_define_alias(rb_cArray,  "prepend", "unshift");
     rb_define_method(rb_cArray, "insert", rb_ary_insert, -1);
     rb_define_method(rb_cArray, "each", rb_ary_each, 0);
     rb_define_method(rb_cArray, "each_index", rb_ary_each_index, 0);
     rb_define_method(rb_cArray, "reverse_each", rb_ary_reverse_each, 0);
     rb_define_method(rb_cArray, "length", rb_ary_length, 0);
-    rb_define_alias(rb_cArray,  "size", "length");
+    rb_define_method(rb_cArray, "size", rb_ary_length, 0);
     rb_define_method(rb_cArray, "empty?", rb_ary_empty_p, 0);
     rb_define_method(rb_cArray, "find_index", rb_ary_index, -1);
     rb_define_method(rb_cArray, "index", rb_ary_index, -1);
@@ -5579,6 +8874,8 @@ Init_Array(void)
     rb_define_method(rb_cArray, "map!", rb_ary_collect_bang, 0);
     rb_define_method(rb_cArray, "select", rb_ary_select, 0);
     rb_define_method(rb_cArray, "select!", rb_ary_select_bang, 0);
+    rb_define_method(rb_cArray, "filter", rb_ary_select, 0);
+    rb_define_method(rb_cArray, "filter!", rb_ary_select_bang, 0);
     rb_define_method(rb_cArray, "keep_if", rb_ary_keep_if, 0);
     rb_define_method(rb_cArray, "values_at", rb_ary_values_at, -1);
     rb_define_method(rb_cArray, "delete", rb_ary_delete, 1);
@@ -5607,6 +8904,10 @@ Init_Array(void)
     rb_define_method(rb_cArray, "&", rb_ary_and, 1);
     rb_define_method(rb_cArray, "|", rb_ary_or, 1);
 
+    rb_define_method(rb_cArray, "max", rb_ary_max, -1);
+    rb_define_method(rb_cArray, "min", rb_ary_min, -1);
+    rb_define_method(rb_cArray, "minmax", rb_ary_minmax, 0);
+
     rb_define_method(rb_cArray, "uniq", rb_ary_uniq, 0);
     rb_define_method(rb_cArray, "uniq!", rb_ary_uniq_bang, 0);
     rb_define_method(rb_cArray, "compact", rb_ary_compact, 0);
@@ -5614,9 +8915,6 @@ Init_Array(void)
     rb_define_method(rb_cArray, "flatten", rb_ary_flatten, -1);
     rb_define_method(rb_cArray, "flatten!", rb_ary_flatten_bang, -1);
     rb_define_method(rb_cArray, "count", rb_ary_count, -1);
-    rb_define_method(rb_cArray, "shuffle!", rb_ary_shuffle_bang, -1);
-    rb_define_method(rb_cArray, "shuffle", rb_ary_shuffle, -1);
-    rb_define_method(rb_cArray, "sample", rb_ary_sample, -1);
     rb_define_method(rb_cArray, "cycle", rb_ary_cycle, -1);
     rb_define_method(rb_cArray, "permutation", rb_ary_permutation, -1);
     rb_define_method(rb_cArray, "combination", rb_ary_combination, 1);
@@ -5629,9 +8927,15 @@ Init_Array(void)
     rb_define_method(rb_cArray, "drop", rb_ary_drop, 1);
     rb_define_method(rb_cArray, "drop_while", rb_ary_drop_while, 0);
     rb_define_method(rb_cArray, "bsearch", rb_ary_bsearch, 0);
+    rb_define_method(rb_cArray, "bsearch_index", rb_ary_bsearch_index, 0);
+    rb_define_method(rb_cArray, "any?", rb_ary_any_p, -1);
+    rb_define_method(rb_cArray, "all?", rb_ary_all_p, -1);
+    rb_define_method(rb_cArray, "none?", rb_ary_none_p, -1);
+    rb_define_method(rb_cArray, "one?", rb_ary_one_p, -1);
+    rb_define_method(rb_cArray, "dig", rb_ary_dig, -1);
+    rb_define_method(rb_cArray, "sum", rb_ary_sum, -1);
 
-    id_cmp = rb_intern("<=>");
-    sym_random = ID2SYM(rb_intern("random"));
-    id_div = rb_intern("div");
-    id_power = rb_intern("**");
+    rb_define_method(rb_cArray, "deconstruct", rb_ary_deconstruct, 0);
 }
+
+#include "array.rbinc"
diff --git a/array.rb b/array.rb
new file mode 100644
index 0000000000..b9fa9844e6
--- /dev/null
+++ b/array.rb
@@ -0,0 +1,69 @@
+class Array
+  # call-seq:
+  #    array.shuffle!(random: Random) -> array
+  #
+  # Shuffles the elements of +self+ in place.
+  #    a = [1, 2, 3] #=> [1, 2, 3]
+  #    a.shuffle!    #=> [2, 3, 1]
+  #    a             #=> [2, 3, 1]
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a.shuffle!(random: Random.new(1))  #=> [1, 3, 2]
+  def shuffle!(random: Random)
+    Primitive.rb_ary_shuffle_bang(random)
+  end
+
+  # call-seq:
+  #    array.shuffle(random: Random) -> new_ary
+  #
+  # Returns a new array with elements of +self+ shuffled.
+  #    a = [1, 2, 3] #=> [1, 2, 3]
+  #    a.shuffle     #=> [2, 3, 1]
+  #    a             #=> [1, 2, 3]
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a.shuffle(random: Random.new(1))  #=> [1, 3, 2]
+  def shuffle(random: Random)
+    Primitive.rb_ary_shuffle(random)
+  end
+
+  # call-seq:
+  #    array.sample(random: Random) -> object
+  #    array.sample(n, random: Random) -> new_ary
+  #
+  # Returns random elements from +self+.
+  #
+  # When no arguments are given, returns a random element from +self+:
+  #    a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+  #    a.sample # => 3
+  #    a.sample # => 8
+  # If +self+ is empty, returns +nil+.
+  #
+  # When argument +n+ is given, returns a new \Array containing +n+ random
+  # elements from +self+:
+  #    a.sample(3) # => [8, 9, 2]
+  #    a.sample(6) # => [9, 6, 10, 3, 1, 4]
+  # Returns no more than <tt>a.size</tt> elements
+  # (because no new duplicates are introduced):
+  #    a.sample(a.size * 2) # => [6, 4, 1, 8, 5, 9, 10, 2, 3, 7]
+  # But +self+ may contain duplicates:
+  #    a = [1, 1, 1, 2, 2, 3]
+  #    a.sample(a.size * 2) # => [1, 1, 3, 2, 1, 2]
+  # The argument +n+ must be a non-negative numeric value.
+  # The order of the result array is unrelated to the order of +self+.
+  # Returns a new empty \Array if +self+ is empty.
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+  #    a.sample(random: Random.new(1))     #=> 6
+  #    a.sample(4, random: Random.new(1))  #=> [6, 10, 9, 2]
+  def sample(n = (ary = false), random: Random)
+    if Primitive.mandatory_only?
+      # Primitive.cexpr! %{ rb_ary_sample(self, rb_cRandom, Qfalse, Qfalse) }
+      Primitive.ary_sample0
+    else
+      # Primitive.cexpr! %{ rb_ary_sample(self, random, n, ary) }
+      Primitive.ary_sample(random, n, ary)
+    end
+  end
+end
diff --git a/ast.c b/ast.c
new file mode 100644
index 0000000000..adb7287ed3
--- /dev/null
+++ b/ast.c
@@ -0,0 +1,773 @@
+/* indent-tabs-mode: nil */
+#include "internal.h"
+#include "internal/parse.h"
+#include "internal/symbol.h"
+#include "internal/warnings.h"
+#include "iseq.h"
+#include "node.h"
+#include "ruby.h"
+#include "ruby/encoding.h"
+#include "ruby/util.h"
+#include "vm_core.h"
+
+#include "builtin.h"
+
+static VALUE rb_mAST;
+static VALUE rb_cNode;
+
+struct ASTNodeData {
+    rb_ast_t *ast;
+    const NODE *node;
+};
+
+static void
+node_gc_mark(void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    rb_gc_mark((VALUE)data->ast);
+}
+
+static size_t
+node_memsize(const void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    return rb_ast_memsize(data->ast);
+}
+
+static const rb_data_type_t rb_node_type = {
+    "AST/node",
+    {node_gc_mark, RUBY_TYPED_DEFAULT_FREE, node_memsize,},
+    0, 0,
+    RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+static VALUE rb_ast_node_alloc(VALUE klass);
+
+static void
+setup_node(VALUE obj, rb_ast_t *ast, const NODE *node)
+{
+    struct ASTNodeData *data;
+
+    TypedData_Get_Struct(obj, struct ASTNodeData, &rb_node_type, data);
+    data->ast = ast;
+    data->node = node;
+}
+
+static VALUE
+ast_new_internal(rb_ast_t *ast, const NODE *node)
+{
+    VALUE obj;
+
+    obj = rb_ast_node_alloc(rb_cNode);
+    setup_node(obj, ast, node);
+
+    return obj;
+}
+
+static VALUE rb_ast_parse_str(VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens);
+static VALUE rb_ast_parse_file(VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens);
+
+static VALUE
+ast_parse_new(void)
+{
+    return rb_parser_set_context(rb_parser_new(), NULL, 0);
+}
+
+static VALUE
+ast_parse_done(rb_ast_t *ast)
+{
+    if (!ast->body.root) {
+        rb_ast_dispose(ast);
+        rb_exc_raise(GET_EC()->errinfo);
+    }
+
+    return ast_new_internal(ast, (NODE *)ast->body.root);
+}
+
+static VALUE
+ast_s_parse(rb_execution_context_t *ec, VALUE module, VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    return rb_ast_parse_str(str, keep_script_lines, error_tolerant, keep_tokens);
+}
+
+static VALUE
+rb_ast_parse_str(VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    rb_ast_t *ast = 0;
+
+    StringValue(str);
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant)) rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens)) rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_string_path(vparser, Qnil, str, 1);
+    return ast_parse_done(ast);
+}
+
+static VALUE
+ast_s_parse_file(rb_execution_context_t *ec, VALUE module, VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    return rb_ast_parse_file(path, keep_script_lines, error_tolerant, keep_tokens);
+}
+
+static VALUE
+rb_ast_parse_file(VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE f;
+    rb_ast_t *ast = 0;
+    rb_encoding *enc = rb_utf8_encoding();
+
+    FilePathValue(path);
+    f = rb_file_open_str(path, "r");
+    rb_funcall(f, rb_intern("set_encoding"), 2, rb_enc_from_encoding(enc), rb_str_new_cstr("-"));
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant))  rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens))  rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_file_path(vparser, Qnil, f, 1);
+    rb_io_close(f);
+    return ast_parse_done(ast);
+}
+
+static VALUE
+lex_array(VALUE array, int index)
+{
+    VALUE str = rb_ary_entry(array, index);
+    if (!NIL_P(str)) {
+        StringValue(str);
+        if (!rb_enc_asciicompat(rb_enc_get(str))) {
+            rb_raise(rb_eArgError, "invalid source encoding");
+        }
+    }
+    return str;
+}
+
+static VALUE
+rb_ast_parse_array(VALUE array, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    rb_ast_t *ast = 0;
+
+    array = rb_check_array_type(array);
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant)) rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens)) rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_generic(vparser, lex_array, Qnil, array, 1);
+    return ast_parse_done(ast);
+}
+
+static VALUE node_children(rb_ast_t*, const NODE*);
+
+static VALUE
+node_find(VALUE self, const int node_id)
+{
+    VALUE ary;
+    long i;
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    if (nd_node_id(data->node) == node_id) return self;
+
+    ary = node_children(data->ast, data->node);
+
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        VALUE child = RARRAY_AREF(ary, i);
+
+        if (CLASS_OF(child) == rb_cNode) {
+            VALUE result = node_find(child, node_id);
+            if (RTEST(result)) return result;
+        }
+    }
+
+    return Qnil;
+}
+
+extern VALUE rb_e_script;
+
+static VALUE
+script_lines(VALUE path)
+{
+    VALUE hash, lines;
+    ID script_lines;
+    CONST_ID(script_lines, "SCRIPT_LINES__");
+    if (!rb_const_defined_at(rb_cObject, script_lines)) return Qnil;
+    hash = rb_const_get_at(rb_cObject, script_lines);
+    if (!RB_TYPE_P(hash, T_HASH)) return Qnil;
+    lines = rb_hash_lookup(hash, path);
+    if (!RB_TYPE_P(lines, T_ARRAY)) return Qnil;
+    return lines;
+}
+
+static VALUE
+node_id_for_backtrace_location(rb_execution_context_t *ec, VALUE module, VALUE location)
+{
+    int node_id;
+
+    if (!rb_frame_info_p(location)) {
+        rb_raise(rb_eTypeError, "Thread::Backtrace::Location object expected");
+    }
+
+    node_id = rb_get_node_id_from_frame_info(location);
+    if (node_id == -1) {
+        return Qnil;
+    }
+
+    return INT2NUM(node_id);
+}
+
+static VALUE
+ast_s_of(rb_execution_context_t *ec, VALUE module, VALUE body, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE node, lines = Qnil;
+    const rb_iseq_t *iseq;
+    int node_id;
+
+    if (rb_frame_info_p(body)) {
+        iseq = rb_get_iseq_from_frame_info(body);
+        node_id = rb_get_node_id_from_frame_info(body);
+    }
+    else {
+        iseq = NULL;
+
+        if (rb_obj_is_proc(body)) {
+            iseq = vm_proc_iseq(body);
+
+            if (!rb_obj_is_iseq((VALUE)iseq)) return Qnil;
+        }
+        else {
+            iseq = rb_method_iseq(body);
+        }
+        if (iseq) {
+            node_id = ISEQ_BODY(iseq)->location.node_id;
+        }
+    }
+
+    if (!iseq) {
+        return Qnil;
+    }
+    lines = ISEQ_BODY(iseq)->variable.script_lines;
+
+    VALUE path = rb_iseq_path(iseq);
+    int e_option = RSTRING_LEN(path) == 2 && memcmp(RSTRING_PTR(path), "-e", 2) == 0;
+
+    if (NIL_P(lines) && rb_iseq_from_eval_p(iseq) && !e_option) {
+        rb_raise(rb_eArgError, "cannot get AST for method defined in eval");
+    }
+
+    if (!NIL_P(lines) || !NIL_P(lines = script_lines(path))) {
+        node = rb_ast_parse_array(lines, keep_script_lines, error_tolerant, keep_tokens);
+    }
+    else if (e_option) {
+        node = rb_ast_parse_str(rb_e_script, keep_script_lines, error_tolerant, keep_tokens);
+    }
+    else {
+        node = rb_ast_parse_file(path, keep_script_lines, error_tolerant, keep_tokens);
+    }
+
+    return node_find(node, node_id);
+}
+
+static VALUE
+rb_ast_node_alloc(VALUE klass)
+{
+    struct ASTNodeData *data;
+    VALUE obj = TypedData_Make_Struct(klass, struct ASTNodeData, &rb_node_type, data);
+
+    return obj;
+}
+
+static const char*
+node_type_to_str(const NODE *node)
+{
+    return (ruby_node_name(nd_type(node)) + rb_strlen_lit("NODE_"));
+}
+
+static VALUE
+ast_node_type(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return rb_sym_intern_ascii_cstr(node_type_to_str(data->node));
+}
+
+static VALUE
+ast_node_node_id(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2FIX(nd_node_id(data->node));
+}
+
+#define NEW_CHILD(ast, node) node ? ast_new_internal(ast, node) : Qnil
+
+static VALUE
+rb_ary_new_from_node_args(rb_ast_t *ast, long n, ...)
+{
+    va_list ar;
+    VALUE ary;
+    long i;
+
+    ary = rb_ary_new2(n);
+
+    va_start(ar, n);
+    for (i=0; i<n; i++) {
+        NODE *node;
+        node = va_arg(ar, NODE *);
+        rb_ary_push(ary, NEW_CHILD(ast, node));
+    }
+    va_end(ar);
+    return ary;
+}
+
+static VALUE
+dump_block(rb_ast_t *ast, const NODE *node)
+{
+    VALUE ary = rb_ary_new();
+    do {
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+    } while (node->nd_next &&
+        nd_type_p(node->nd_next, NODE_BLOCK) &&
+        (node = node->nd_next, 1));
+    if (node->nd_next) {
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_next));
+    }
+
+    return ary;
+}
+
+static VALUE
+dump_array(rb_ast_t *ast, const NODE *node)
+{
+    VALUE ary = rb_ary_new();
+    rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+
+    while (node->nd_next && nd_type_p(node->nd_next, NODE_LIST)) {
+        node = node->nd_next;
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+    }
+    rb_ary_push(ary, NEW_CHILD(ast, node->nd_next));
+
+    return ary;
+}
+
+static VALUE
+var_name(ID id)
+{
+    if (!id) return Qnil;
+    if (!rb_id2str(id)) return Qnil;
+    return ID2SYM(id);
+}
+
+static VALUE
+no_name_rest(void)
+{
+    ID rest;
+    CONST_ID(rest, "NODE_SPECIAL_NO_NAME_REST");
+    return ID2SYM(rest);
+}
+
+static VALUE
+rest_arg(rb_ast_t *ast, const NODE *rest_arg)
+{
+    return NODE_NAMED_REST_P(rest_arg) ? NEW_CHILD(ast, rest_arg) : no_name_rest();
+}
+
+static VALUE
+node_children(rb_ast_t *ast, const NODE *node)
+{
+    char name[DECIMAL_SIZE_OF_BITS(sizeof(long) * CHAR_BIT) + 2]; /* including '$' */
+
+    enum node_type type = nd_type(node);
+    switch (type) {
+      case NODE_BLOCK:
+        return dump_block(ast, node);
+      case NODE_IF:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cond, node->nd_body, node->nd_else);
+      case NODE_UNLESS:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cond, node->nd_body, node->nd_else);
+      case NODE_CASE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_CASE2:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_CASE3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_WHEN:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_body, node->nd_next);
+      case NODE_IN:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_body, node->nd_next);
+      case NODE_WHILE:
+      case NODE_UNTIL:
+        return rb_ary_push(rb_ary_new_from_node_args(ast, 2, node->nd_cond, node->nd_body),
+                           RBOOL(node->nd_state));
+      case NODE_ITER:
+      case NODE_FOR:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_iter, node->nd_body);
+      case NODE_FOR_MASGN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_var);
+      case NODE_BREAK:
+      case NODE_NEXT:
+      case NODE_RETURN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_stts);
+      case NODE_REDO:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_RETRY:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_BEGIN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_RESCUE:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_resq, node->nd_else);
+      case NODE_RESBODY:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_args, node->nd_body, node->nd_head);
+      case NODE_ENSURE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_ensr);
+      case NODE_AND:
+      case NODE_OR:
+        {
+            VALUE ary = rb_ary_new();
+
+            while (1) {
+                rb_ary_push(ary, NEW_CHILD(ast, node->nd_1st));
+                if (!node->nd_2nd || !nd_type_p(node->nd_2nd, type))
+                    break;
+                node = node->nd_2nd;
+            }
+            rb_ary_push(ary, NEW_CHILD(ast, node->nd_2nd));
+            return ary;
+        }
+      case NODE_MASGN:
+        if (NODE_NAMED_REST_P(node->nd_args)) {
+            return rb_ary_new_from_node_args(ast, 3, node->nd_value, node->nd_head, node->nd_args);
+        }
+        else {
+            return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_value),
+                                        NEW_CHILD(ast, node->nd_head),
+                                        no_name_rest());
+        }
+      case NODE_LASGN:
+      case NODE_DASGN:
+      case NODE_IASGN:
+      case NODE_CVASGN:
+      case NODE_GASGN:
+        if (NODE_REQUIRED_KEYWORD_P(node)) {
+            return rb_ary_new_from_args(2, var_name(node->nd_vid), ID2SYM(rb_intern("NODE_SPECIAL_REQUIRED_KEYWORD")));
+        }
+        return rb_ary_new_from_args(2, var_name(node->nd_vid), NEW_CHILD(ast, node->nd_value));
+      case NODE_CDECL:
+        if (node->nd_vid) {
+            return rb_ary_new_from_args(2, ID2SYM(node->nd_vid), NEW_CHILD(ast, node->nd_value));
+        }
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_else), ID2SYM(node->nd_else->nd_mid), NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN1:
+        return rb_ary_new_from_args(4, NEW_CHILD(ast, node->nd_recv),
+                                    ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args->nd_head),
+                                    NEW_CHILD(ast, node->nd_args->nd_body));
+      case NODE_OP_ASGN2:
+        return rb_ary_new_from_args(5, NEW_CHILD(ast, node->nd_recv),
+                                    RBOOL(node->nd_next->nd_aid),
+                                    ID2SYM(node->nd_next->nd_vid),
+                                    ID2SYM(node->nd_next->nd_mid),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN_AND:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head), ID2SYM(idANDOP),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN_OR:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head), ID2SYM(idOROP),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_CDECL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head),
+                                    ID2SYM(node->nd_aid),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_CALL:
+      case NODE_OPCALL:
+      case NODE_QCALL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv),
+                                    ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args));
+      case NODE_FCALL:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args));
+      case NODE_VCALL:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_mid));
+      case NODE_SUPER:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_args);
+      case NODE_ZSUPER:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_LIST:
+      case NODE_VALUES:
+        return dump_array(ast, node);
+      case NODE_ZLIST:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_HASH:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_YIELD:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_LVAR:
+      case NODE_DVAR:
+        return rb_ary_new_from_args(1, var_name(node->nd_vid));
+      case NODE_IVAR:
+      case NODE_CONST:
+      case NODE_CVAR:
+      case NODE_GVAR:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_vid));
+      case NODE_NTH_REF:
+        snprintf(name, sizeof(name), "$%ld", node->nd_nth);
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_BACK_REF:
+        name[0] = '$';
+        name[1] = (char)node->nd_nth;
+        name[2] = '\0';
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_MATCH2:
+        if (node->nd_args) {
+            return rb_ary_new_from_node_args(ast, 3, node->nd_recv, node->nd_value, node->nd_args);
+        }
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_value);
+      case NODE_MATCH3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_value);
+      case NODE_MATCH:
+      case NODE_LIT:
+      case NODE_STR:
+      case NODE_XSTR:
+        return rb_ary_new_from_args(1, node->nd_lit);
+      case NODE_ONCE:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_DSTR:
+      case NODE_DXSTR:
+      case NODE_DREGX:
+      case NODE_DSYM:
+        {
+            NODE *n = node->nd_next;
+            VALUE head = Qnil, next = Qnil;
+            if (n) {
+                head = NEW_CHILD(ast, n->nd_head);
+                next = NEW_CHILD(ast, n->nd_next);
+            }
+            return rb_ary_new_from_args(3, node->nd_lit, head, next);
+        }
+      case NODE_EVSTR:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_ARGSCAT:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_ARGSPUSH:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_SPLAT:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_BLOCK_PASS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_DEFN:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_defn));
+      case NODE_DEFS:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv), ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_defn));
+      case NODE_ALIAS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_1st, node->nd_2nd);
+      case NODE_VALIAS:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_alias), ID2SYM(node->nd_orig));
+      case NODE_UNDEF:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_undef);
+      case NODE_CLASS:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cpath, node->nd_super, node->nd_body);
+      case NODE_MODULE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_cpath, node->nd_body);
+      case NODE_SCLASS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_body);
+      case NODE_COLON2:
+        return rb_ary_new_from_args(2, NEW_CHILD(ast, node->nd_head), ID2SYM(node->nd_mid));
+      case NODE_COLON3:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_mid));
+      case NODE_DOT2:
+      case NODE_DOT3:
+      case NODE_FLIP2:
+      case NODE_FLIP3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_beg, node->nd_end);
+      case NODE_SELF:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_NIL:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_TRUE:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_FALSE:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_ERRINFO:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_DEFINED:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_POSTEXE:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_ATTRASGN:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv), ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_args));
+      case NODE_LAMBDA:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_OPT_ARG:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_body, node->nd_next);
+      case NODE_KW_ARG:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_body, node->nd_next);
+      case NODE_POSTARG:
+        if (NODE_NAMED_REST_P(node->nd_1st)) {
+            return rb_ary_new_from_node_args(ast, 2, node->nd_1st, node->nd_2nd);
+        }
+        return rb_ary_new_from_args(2, no_name_rest(),
+                                    NEW_CHILD(ast, node->nd_2nd));
+      case NODE_ARGS:
+        {
+            struct rb_args_info *ainfo = node->nd_ainfo;
+            return rb_ary_new_from_args(10,
+                                        INT2NUM(ainfo->pre_args_num),
+                                        NEW_CHILD(ast, ainfo->pre_init),
+                                        NEW_CHILD(ast, ainfo->opt_args),
+                                        var_name(ainfo->first_post_arg),
+                                        INT2NUM(ainfo->post_args_num),
+                                        NEW_CHILD(ast, ainfo->post_init),
+                                        (ainfo->rest_arg == NODE_SPECIAL_EXCESSIVE_COMMA
+                                            ? ID2SYM(rb_intern("NODE_SPECIAL_EXCESSIVE_COMMA"))
+                                            : var_name(ainfo->rest_arg)),
+                                        (ainfo->no_kwarg ? Qfalse : NEW_CHILD(ast, ainfo->kw_args)),
+                                        (ainfo->no_kwarg ? Qfalse : NEW_CHILD(ast, ainfo->kw_rest_arg)),
+                                        var_name(ainfo->block_arg));
+        }
+      case NODE_SCOPE:
+        {
+            rb_ast_id_table_t *tbl = node->nd_tbl;
+            int i, size = tbl ? tbl->size : 0;
+            VALUE locals = rb_ary_new_capa(size);
+            for (i = 0; i < size; i++) {
+                rb_ary_push(locals, var_name(tbl->ids[i]));
+            }
+            return rb_ary_new_from_args(3, locals, NEW_CHILD(ast, node->nd_args), NEW_CHILD(ast, node->nd_body));
+        }
+      case NODE_ARYPTN:
+        {
+            struct rb_ary_pattern_info *apinfo = node->nd_apinfo;
+            VALUE rest = rest_arg(ast, apinfo->rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        NEW_CHILD(ast, apinfo->pre_args),
+                                        rest,
+                                        NEW_CHILD(ast, apinfo->post_args));
+        }
+      case NODE_FNDPTN:
+        {
+            struct rb_fnd_pattern_info *fpinfo = node->nd_fpinfo;
+            VALUE pre_rest = rest_arg(ast, fpinfo->pre_rest_arg);
+            VALUE post_rest = rest_arg(ast, fpinfo->post_rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        pre_rest,
+                                        NEW_CHILD(ast, fpinfo->args),
+                                        post_rest);
+        }
+      case NODE_HSHPTN:
+        {
+            VALUE kwrest = node->nd_pkwrestarg == NODE_SPECIAL_NO_REST_KEYWORD ? ID2SYM(rb_intern("NODE_SPECIAL_NO_REST_KEYWORD")) :
+                                                                                 NEW_CHILD(ast, node->nd_pkwrestarg);
+
+            return rb_ary_new_from_args(3,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        NEW_CHILD(ast, node->nd_pkwargs),
+                                        kwrest);
+        }
+      case NODE_ERROR:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_ARGS_AUX:
+      case NODE_LAST:
+        break;
+    }
+
+    rb_bug("node_children: unknown node: %s", ruby_node_name(type));
+}
+
+static VALUE
+ast_node_children(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return node_children(data->ast, data->node);
+}
+
+static VALUE
+ast_node_first_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_first_lineno(data->node));
+}
+
+static VALUE
+ast_node_first_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_first_column(data->node));
+}
+
+static VALUE
+ast_node_last_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_last_lineno(data->node));
+}
+
+static VALUE
+ast_node_last_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_last_column(data->node));
+}
+
+static VALUE
+ast_node_all_tokens(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return rb_ast_tokens(data->ast);
+}
+
+static VALUE
+ast_node_inspect(rb_execution_context_t *ec, VALUE self)
+{
+    VALUE str;
+    VALUE cname;
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    cname = rb_class_path(rb_obj_class(self));
+    str = rb_str_new2("#<");
+
+    rb_str_append(str, cname);
+    rb_str_catf(str, ":%s@%d:%d-%d:%d>",
+                node_type_to_str(data->node),
+                nd_first_lineno(data->node), nd_first_column(data->node),
+                nd_last_lineno(data->node), nd_last_column(data->node));
+
+    return str;
+}
+
+static VALUE
+ast_node_script_lines(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+    VALUE ret = data->ast->body.script_lines;
+    if (!RB_TYPE_P(ret, T_ARRAY)) return Qnil;
+    return ret;
+}
+
+#include "ast.rbinc"
+
+void
+Init_ast(void)
+{
+    rb_mAST = rb_define_module_under(rb_cRubyVM, "AbstractSyntaxTree");
+    rb_cNode = rb_define_class_under(rb_mAST, "Node", rb_cObject);
+    rb_undef_alloc_func(rb_cNode);
+}
diff --git a/ast.rb b/ast.rb
new file mode 100644
index 0000000000..f3f72c747f
--- /dev/null
+++ b/ast.rb
@@ -0,0 +1,276 @@
+# for ast.c
+
+# AbstractSyntaxTree provides methods to parse Ruby code into
+# abstract syntax trees. The nodes in the tree
+# are instances of RubyVM::AbstractSyntaxTree::Node.
+#
+# This module is MRI specific as it exposes implementation details
+# of the MRI abstract syntax tree.
+#
+# This module is experimental and its API is not stable, therefore it might
+# change without notice. As examples, the order of children nodes is not
+# guaranteed, the number of children nodes might change, there is no way to
+# access children nodes by name, etc.
+#
+# If you are looking for a stable API or an API working under multiple Ruby
+# implementations, consider using the _parser_ gem or Ripper. If you would
+# like to make RubyVM::AbstractSyntaxTree stable, please join the discussion
+# at https://bugs.ruby-lang.org/issues/14844.
+#
+module RubyVM::AbstractSyntaxTree
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.parse(string, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #  Parses the given _string_ into an abstract syntax tree,
+  #  returning the root node of that tree.
+  #
+  #    RubyVM::AbstractSyntaxTree.parse("x = 1 + 2")
+  #    # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-1:9>
+  #
+  #  If <tt>keep_script_lines: true</tt> option is provided, the text of the parsed
+  #  source is associated with nodes and is available via Node#script_lines.
+  #
+  #  If <tt>keep_tokens: true</tt> option is provided, Node#tokens are populated.
+  #
+  #  SyntaxError is raised if the given _string_ is invalid syntax. To overwrite this
+  #  behavior, <tt>error_tolerant: true</tt> can be provided. In this case, the parser
+  #  will produce a tree where expressions with syntax errors would be represented by
+  #  Node with <tt>type=:ERROR</tt>.
+  #
+  #     root = RubyVM::AbstractSyntaxTree.parse("x = 1; p(x; y=2")
+  #     # <internal:ast>:33:in `parse': syntax error, unexpected ';', expecting ')' (SyntaxError)
+  #     # x = 1; p(x; y=2
+  #     #           ^
+  #
+  #     root = RubyVM::AbstractSyntaxTree.parse("x = 1; p(x; y=2", error_tolerant: true)
+  #     # (SCOPE@1:0-1:15
+  #     #  tbl: [:x, :y]
+  #     #  args: nil
+  #     #  body: (BLOCK@1:0-1:15 (LASGN@1:0-1:5 :x (LIT@1:4-1:5 1)) (ERROR@1:7-1:11) (LASGN@1:12-1:15 :y (LIT@1:14-1:15 2))))
+  #     root.children.last.children
+  #     # [(LASGN@1:0-1:5 :x (LIT@1:4-1:5 1)),
+  #     #  (ERROR@1:7-1:11),
+  #     #  (LASGN@1:12-1:15 :y (LIT@1:14-1:15 2))]
+  #
+  #  Note that parsing continues even after the errored expresion.
+  #
+  def self.parse string, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_parse string, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.parse_file(pathname, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #   Reads the file from _pathname_, then parses it like ::parse,
+  #   returning the root node of the abstract syntax tree.
+  #
+  #   SyntaxError is raised if _pathname_'s contents are not
+  #   valid Ruby syntax.
+  #
+  #     RubyVM::AbstractSyntaxTree.parse_file("my-app/app.rb")
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-31:3>
+  #
+  #   See ::parse for explanation of keyword argument meaning and usage.
+  def self.parse_file pathname, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_parse_file pathname, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.of(proc, keep_script_lines: false, error_tolerant: false, keep_tokens: false)   -> RubyVM::AbstractSyntaxTree::Node
+  #     RubyVM::AbstractSyntaxTree.of(method, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #   Returns AST nodes of the given _proc_ or _method_.
+  #
+  #     RubyVM::AbstractSyntaxTree.of(proc {1 + 2})
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:35-1:42>
+  #
+  #     def hello
+  #       puts "hello, world"
+  #     end
+  #
+  #     RubyVM::AbstractSyntaxTree.of(method(:hello))
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-3:3>
+  #
+  #   See ::parse for explanation of keyword argument meaning and usage.
+  def self.of body, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_of body, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(backtrace_location)   -> integer
+  #
+  #   Returns the node id for the given backtrace location.
+  #
+  #     begin
+  #       raise
+  #     rescue =>  e
+  #       loc = e.backtrace_locations.first
+  #       RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(loc)
+  #     end # => 0
+  def self.node_id_for_backtrace_location backtrace_location
+    Primitive.node_id_for_backtrace_location backtrace_location
+  end
+
+  # RubyVM::AbstractSyntaxTree::Node instances are created by parse methods in
+  # RubyVM::AbstractSyntaxTree.
+  #
+  # This class is MRI specific.
+  #
+  class Node
+
+    #  call-seq:
+    #     node.type -> symbol
+    #
+    #  Returns the type of this node as a symbol.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2")
+    #    root.type # => :SCOPE
+    #    lasgn = root.children[2]
+    #    lasgn.type # => :LASGN
+    #    call = lasgn.children[1]
+    #    call.type # => :OPCALL
+    def type
+      Primitive.ast_node_type
+    end
+
+    #  call-seq:
+    #     node.first_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text began.
+    def first_lineno
+      Primitive.ast_node_first_lineno
+    end
+
+    #  call-seq:
+    #     node.first_column -> integer
+    #
+    #  The column number in the source code where this AST's text began.
+    def first_column
+      Primitive.ast_node_first_column
+    end
+
+    #  call-seq:
+    #     node.last_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text ended.
+    def last_lineno
+      Primitive.ast_node_last_lineno
+    end
+
+    #  call-seq:
+    #     node.last_column -> integer
+    #
+    #  The column number in the source code where this AST's text ended.
+    def last_column
+      Primitive.ast_node_last_column
+    end
+
+    #  call-seq:
+    #     node.tokens -> array
+    #
+    #  Returns tokens corresponding to the location of the node.
+    #  Returns +nil+ if +keep_tokens+ is not enabled when #parse method is called.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+    #    root.tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    #    root.tokens.map{_1[2]}.join # => "x = 1 + 2"
+    #
+    #  Token is an array of:
+    #
+    #  - id
+    #  - token type
+    #  - source code text
+    #  - location [ first_lineno, first_column, last_lineno, last_column ]
+    def tokens
+      return nil unless all_tokens
+
+      all_tokens.each_with_object([]) do |token, a|
+        loc = token.last
+        if ([first_lineno, first_column] <=> [loc[0], loc[1]]) <= 0 &&
+           ([last_lineno, last_column]   <=> [loc[2], loc[3]]) >= 0
+           a << token
+        end
+      end
+    end
+
+    #  call-seq:
+    #     node.all_tokens -> array
+    #
+    #  Returns all tokens for the input script regardless the receiver node.
+    #  Returns +nil+ if +keep_tokens+ is not enabled when #parse method is called.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+    #    root.all_tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    #    root.children[-1].all_tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    def all_tokens
+      Primitive.ast_node_all_tokens
+    end
+
+    #  call-seq:
+    #     node.children -> array
+    #
+    #  Returns AST nodes under this one.  Each kind of node
+    #  has different children, depending on what kind of node it is.
+    #
+    #  The returned array may contain other nodes or <code>nil</code>.
+    def children
+      Primitive.ast_node_children
+    end
+
+    #  call-seq:
+    #     node.inspect -> string
+    #
+    #  Returns debugging information about this node as a string.
+    def inspect
+      Primitive.ast_node_inspect
+    end
+
+    #  call-seq:
+    #     node.node_id -> integer
+    #
+    #  Returns an internal node_id number.
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    def node_id
+      Primitive.ast_node_node_id
+    end
+
+    #  call-seq:
+    #     node.script_lines -> array
+    #
+    #  Returns the original source code as an array of lines.
+    #
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    def script_lines
+      Primitive.ast_node_script_lines
+    end
+
+    #  call-seq:
+    #     node.source -> string
+    #
+    #  Returns the code fragment that corresponds to this AST.
+    #
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    #
+    #  Also note that this API may return an incomplete code fragment
+    #  that does not parse; for example, a here document following
+    #  an expression may be dropped.
+    def source
+      lines = script_lines
+      if lines
+        lines = lines[first_lineno - 1 .. last_lineno - 1]
+        lines[-1] = lines[-1][0...last_column]
+        lines[0] = lines[0][first_column..-1]
+        lines.join
+      else
+        nil
+      end
+    end
+  end
+end
diff --git a/autogen.sh b/autogen.sh
new file mode 100755
index 0000000000..f8cdf3c0c1
--- /dev/null
+++ b/autogen.sh
@@ -0,0 +1,17 @@
+#!/bin/sh
+
+PWD=
+case "$0" in
+*/*) srcdir=`dirname $0`;;
+*) srcdir="";;
+esac
+
+symlink='--install --symlink'
+case " $* " in
+    *" -i "*|*" --install "*)
+        # reset to copy missing standard auxiliary files, instead of symlinks
+        symlink=
+        ;;
+esac
+
+exec ${AUTORECONF:-autoreconf} ${symlink} "$@" ${srcdir:+"$srcdir"}
diff --git a/basictest/runner.rb b/basictest/runner.rb
new file mode 100755
index 0000000000..0f398e7acc
--- /dev/null
+++ b/basictest/runner.rb
@@ -0,0 +1,33 @@
+#! ./miniruby
+
+exit if defined?(CROSS_COMPILING) and CROSS_COMPILING
+ruby = ENV["RUBY"]
+unless ruby
+  load './rbconfig.rb'
+  ruby = "./#{RbConfig::CONFIG['ruby_install_name']}#{RbConfig::CONFIG['EXEEXT']}"
+end
+unless File.exist? ruby
+  print "#{ruby} is not found.\n"
+  print "Try `make' first, then `make test', please.\n"
+  exit false
+end
+ARGV[0] and opt = ARGV[0][/\A--run-opt=(.*)/, 1] and ARGV.shift
+
+$stderr.reopen($stdout)
+error = ''
+
+srcdir = File.expand_path('..', File.dirname(__FILE__))
+if env = ENV["RUBYOPT"]
+  ENV["RUBYOPT"] = env + " -W1"
+end
+`#{ruby} #{opt} -W1 #{srcdir}/basictest/test.rb #{ARGV.join(' ')}`.each_line do |line|
+  if line =~ /^end of test/
+    print "\ntest succeeded\n"
+    exit true
+  end
+  error << line if %r:^(basictest/test.rb|not): =~ line
+end
+puts
+print error
+print "test failed\n"
+exit false
diff --git a/basictest/test.rb b/basictest/test.rb
new file mode 100755
index 0000000000..95875b52a6
--- /dev/null
+++ b/basictest/test.rb
@@ -0,0 +1,2367 @@
+#! /usr/bin/env ruby
+# -*- coding: us-ascii -*-
+
+$testnum=0
+$ntest=0
+$failed = 0
+class Progress
+  def initialize
+    @color = nil
+    @tty = nil
+    @quiet = nil
+    @verbose = nil
+    ARGV.each do |arg|
+      case arg
+      when /\A--color(?:=(?:always|(auto)|(never)|(.*)))?\z/
+        warn "unknown --color argument: #$3" if $3
+        @color = $1 ? nil : !$2
+      when /\A--tty(=(?:yes|(no)|(.*)))?\z/
+        warn "unknown --tty argument: #$3" if $3
+        @tty = !$1 || !$2
+        true
+      when /\A-(q|-quiet)\z/
+        @quiet = true
+      when /\A-(v|-verbose)\z/
+        @verbose = true
+      end
+    end
+    @tty = STDERR.tty? && !STDOUT.tty? && /dumb/ !~ ENV["TERM"] if @tty.nil?
+    @eol = @tty && !@verbose ? "\r\e[K\r" : "\n"
+    case @color
+    when nil
+      @color = @tty
+    end
+    if @color
+      # dircolors-like style
+      colors = (colors = ENV['TEST_COLORS']) ? Hash[colors.scan(/(\w+)=([^:\n]*)/)] : {}
+      begin
+        File.read(File.join(__dir__, "../tool/colors")).scan(/(\w+)=([^:\n]*)/) do |n, c|
+          colors[n] ||= c
+        end
+      rescue
+      end
+      @passed = "\e[;#{colors["pass"] || "32"}m"
+      @failed = "\e[;#{colors["fail"] || "31"}m"
+      @reset = "\e[m"
+    else
+      @passed = @failed = @reset = ""
+    end
+    extend(Rotator) if @tty
+  end
+
+  def passed_string
+    "."
+  end
+  def failed_string
+    "#{@failed}F#{@reset}"
+  end
+  def init_string
+  end
+  def finish_string
+    if @quiet
+      @eol
+    else
+      "#{@passed}#{@ok ? 'OK' : ''} #{$testnum}#{@reset}#{@eol}"
+    end
+  end
+  def pass
+    STDERR.print passed_string
+  end
+  def fail
+    @ok = false
+    STDERR.print failed_string
+  end
+  def init
+    @ok = true
+    STDERR.print init_string
+  end
+  def finish
+    STDERR.print finish_string
+  end
+
+  module Rotator
+    ROTATOR = %w[- \\ | /]
+    BS = "\b" * ROTATOR[0].size
+    def passed_string
+      "#{BS}#{ROTATOR[(@count += 1) % ROTATOR.size]}"
+    end
+    def failed_string
+      "#{BS}#{super}#{ROTATOR[@count % ROTATOR.size]}"
+    end
+    def init_string
+      @count = 0
+      " "
+    end
+    def finish_string
+      s = "#{BS}#{' ' * BS.size}#{BS}#{super}"
+      s.gsub!(/\n/, "\r\e[2K\r") if @quiet
+      s
+    end
+  end
+end
+PROGRESS = Progress.new
+
+def test_check(what)
+  unless $ntest.zero?
+    PROGRESS.finish
+  end
+  STDERR.print "#{$0}:#{what} "
+  PROGRESS.init
+  $what = what
+  $testnum = 0
+end
+
+def test_ok(cond,n=1)
+  $testnum+=1
+  $ntest+=1
+  where = (st = caller(n)) ? st[0] : "caller error! (n=#{n}, trace=#{caller(0).join(', ')}"
+  if cond
+    PROGRESS.pass
+    printf "ok %d (%s)\n", $testnum, where
+  else
+    PROGRESS.fail
+    printf "not ok %s %d -- %s\n", $what, $testnum, where
+    $failed+=1
+  end
+  STDOUT.flush
+  STDERR.flush
+end
+
+# make sure conditional operators work
+
+test_check "assignment"
+
+a=[]; a[0] ||= "bar";
+test_ok(a[0] == "bar")
+h={}; h["foo"] ||= "bar";
+test_ok(h["foo"] == "bar")
+
+aa = 5
+aa ||= 25
+test_ok(aa == 5)
+bb ||= 25
+test_ok(bb == 25)
+cc &&=33
+test_ok(cc == nil)
+cc = 5
+cc &&=44
+test_ok(cc == 44)
+
+a = nil; test_ok(a == nil)
+a = 1; test_ok(a == 1)
+a = []; test_ok(a == [])
+a = [1]; test_ok(a == [1])
+a = [nil]; test_ok(a == [nil])
+a = [[]]; test_ok(a == [[]])
+a = [1,2]; test_ok(a == [1,2])
+a = [*[]]; test_ok(a == [])
+a = [*[1]]; test_ok(a == [1])
+a = [*[1,2]]; test_ok(a == [1,2])
+
+a = *[]; test_ok(a == [])
+a = *[1]; test_ok(a == [1])
+a = *[nil]; test_ok(a == [nil])
+a = *[[]]; test_ok(a == [[]])
+a = *[1,2]; test_ok(a == [1,2])
+a = *[*[]]; test_ok(a == [])
+a = *[*[1]]; test_ok(a == [1])
+a = *[*[1,2]]; test_ok(a == [1,2])
+
+a, = nil; test_ok(a == nil)
+a, = 1; test_ok(a == 1)
+a, = []; test_ok(a == nil)
+a, = [1]; test_ok(a == 1)
+a, = [nil]; test_ok(a == nil)
+a, = [[]]; test_ok(a == [])
+a, = 1,2; test_ok(a == 1)
+a, = [1,2]; test_ok(a == 1)
+a, = [*[]]; test_ok(a == nil)
+a, = [*[1]]; test_ok(a == 1)
+a, = *[1,2]; test_ok(a == 1)
+a, = [*[1,2]]; test_ok(a == 1)
+
+a, = *[]; test_ok(a == nil)
+a, = *[1]; test_ok(a == 1)
+a, = *[nil]; test_ok(a == nil)
+a, = *[[]]; test_ok(a == [])
+a, = *[1,2]; test_ok(a == 1)
+a, = *[*[]]; test_ok(a == nil)
+a, = *[*[1]]; test_ok(a == 1)
+a, = *[*[1,2]]; test_ok(a == 1)
+
+*a = nil; test_ok(a == [nil])
+*a = 1; test_ok(a == [1])
+*a = []; test_ok(a == [])
+*a = [1]; test_ok(a == [1])
+*a = [nil]; test_ok(a == [nil])
+*a = [[]]; test_ok(a == [[]])
+*a = [1,2]; test_ok(a == [1,2])
+*a = [*[]]; test_ok(a == [])
+*a = [*[1]]; test_ok(a == [1])
+*a = [*[1,2]]; test_ok(a == [1,2])
+
+*a = *[]; test_ok(a == [])
+*a = *[1]; test_ok(a == [1])
+*a = *[nil]; test_ok(a == [nil])
+*a = *[[]]; test_ok(a == [[]])
+*a = *[1,2]; test_ok(a == [1,2])
+*a = *[*[]]; test_ok(a == [])
+*a = *[*[1]]; test_ok(a == [1])
+*a = *[*[1,2]]; test_ok(a == [1,2])
+
+a,b,*c = nil; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = 1; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = []; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [1]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = [nil]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [[]]; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = [1,2]; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = [*[]]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [*[1]]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = [*[1,2]]; test_ok([a,b,c] == [1,2,[]])
+
+a,b,*c = *[]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[1]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = *[nil]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[[]]; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = *[1,2]; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = *[*[]]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[*[1]]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = *[*[1,2]]; test_ok([a,b,c] == [1,2,[]])
+
+def f; yield nil; end; f {|a| test_ok(a == nil)}
+def f; yield 1; end; f {|a| test_ok(a == 1)}
+def f; yield []; end; f {|a| test_ok(a == [])}
+def f; yield [1]; end; f {|a| test_ok(a == [1])}
+def f; yield [nil]; end; f {|a| test_ok(a == [nil])}
+def f; yield [[]]; end; f {|a| test_ok(a == [[]])}
+def f; yield [*[]]; end; f {|a| test_ok(a == [])}
+def f; yield [*[1]]; end; f {|a| test_ok(a == [1])}
+def f; yield [*[1,2]]; end; f {|a| test_ok(a == [1,2])}
+def f; yield *[]; end; f {|a| test_ok(a == nil)}
+def f; yield *[1]; end; f {|a| test_ok(a == 1)}
+def f; yield *[nil]; end; f {|a| test_ok(a == nil)}
+def f; yield *[[]]; end; f {|a| test_ok(a == [])}
+def f; yield *[*[]]; end; f {|a| test_ok(a == nil)}
+def f; yield *[*[1]]; end; f {|a| test_ok(a == 1)}
+def f; yield *[*[1,2]]; end; f {|a| test_ok(a == 1)}
+
+def f; yield; end; f {|a,| test_ok(a == nil)}
+def f; yield nil; end; f {|a,| test_ok(a == nil)}
+def f; yield 1; end; f {|a,| test_ok(a == 1)}
+def f; yield []; end; f {|a,| test_ok(a == nil)}
+def f; yield [1]; end; f {|a,| test_ok(a == 1)}
+def f; yield [nil]; end; f {|a,| test_ok(a == nil)}
+def f; yield [[]]; end; f {|a,| test_ok(a == [])}
+def f; yield [*[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield [*[1]]; end; f {|a,| test_ok(a == 1)}
+def f; yield [*[1,2]]; end; f {|a,| test_ok(a == 1)}
+
+def f; yield *[]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[1]; end; f {|a,| test_ok(a == 1)}
+def f; yield *[nil]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[*[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[*[1]]; end; f {|a,| test_ok(a == 1)}
+def f; yield *[*[1,2]]; end; f {|a,| test_ok(a == 1)}
+
+def f; yield; end; f {|*a| test_ok(a == [])}
+def f; yield nil; end; f {|*a| test_ok(a == [nil])}
+def f; yield 1; end; f {|*a| test_ok(a == [1])}
+def f; yield []; end; f {|*a| test_ok(a == [[]])}
+def f; yield [1]; end; f {|*a| test_ok(a == [[1]])}
+def f; yield [nil]; end; f {|*a| test_ok(a == [[nil]])}
+def f; yield [[]]; end; f {|*a| test_ok(a == [[[]]])}
+def f; yield [1,2]; end; f {|*a| test_ok(a == [[1,2]])}
+def f; yield [*[]]; end; f {|*a| test_ok(a == [[]])}
+def f; yield [*[1]]; end; f {|*a| test_ok(a == [[1]])}
+def f; yield [*[1,2]]; end; f {|*a| test_ok(a == [[1,2]])}
+
+def f; yield *[]; end; f {|*a| test_ok(a == [])}
+def f; yield *[1]; end; f {|*a| test_ok(a == [1])}
+def f; yield *[nil]; end; f {|*a| test_ok(a == [nil])}
+def f; yield *[[]]; end; f {|*a| test_ok(a == [[]])}
+def f; yield *[*[]]; end; f {|*a| test_ok(a == [])}
+def f; yield *[*[1]]; end; f {|*a| test_ok(a == [1])}
+def f; yield *[*[1,2]]; end; f {|*a| test_ok(a == [1,2])}
+
+def f; yield; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield nil; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield 1; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield []; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [1]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield [nil]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [[]]; end; f {|a,b,*c| test_ok([a,b,c] == [[],nil,[]])}
+def f; yield [*[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [*[1]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield [*[1,2]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,2,[]])}
+
+def f; yield *[]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[1]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield *[nil]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[*[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[*[1]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield *[*[1,2]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,2,[]])}
+
+def r; return; end; a = r(); test_ok(a == nil)
+def r; return nil; end; a = r(); test_ok(a == nil)
+def r; return 1; end; a = r(); test_ok(a == 1)
+def r; return []; end; a = r(); test_ok(a == [])
+def r; return [1]; end; a = r(); test_ok(a == [1])
+def r; return [nil]; end; a = r(); test_ok(a == [nil])
+def r; return [[]]; end; a = r(); test_ok(a == [[]])
+def r; return [*[]]; end; a = r(); test_ok(a == [])
+def r; return [*[1]]; end; a = r(); test_ok(a == [1])
+def r; return [*[1,2]]; end; a = r(); test_ok(a == [1,2])
+
+def r; return *[]; end; a = r(); test_ok(a == [])
+def r; return *[1]; end; a = r(); test_ok(a == [1])
+def r; return *[nil]; end; a = r(); test_ok(a == [nil])
+def r; return *[[]]; end; a = r(); test_ok(a == [[]])
+def r; return *[*[]]; end; a = r(); test_ok(a == [])
+def r; return *[*[1]]; end; a = r(); test_ok(a == [1])
+def r; return *[*[1,2]]; end; a = r(); test_ok(a == [1,2])
+
+def r; return *[[]]; end; a = *r(); test_ok(a == [[]])
+def r; return *[*[1,2]]; end; a = *r(); test_ok(a == [1,2])
+
+def r; return; end; *a = r(); test_ok(a == [nil])
+def r; return nil; end; *a = r(); test_ok(a == [nil])
+def r; return 1; end; *a = r(); test_ok(a == [1])
+def r; return []; end; *a = r(); test_ok(a == [])
+def r; return [1]; end; *a = r(); test_ok(a == [1])
+def r; return [nil]; end; *a = r(); test_ok(a == [nil])
+def r; return [[]]; end; *a = r(); test_ok(a == [[]])
+def r; return [1,2]; end; *a = r(); test_ok(a == [1,2])
+def r; return [*[]]; end; *a = r(); test_ok(a == [])
+def r; return [*[1]]; end; *a = r(); test_ok(a == [1])
+def r; return [*[1,2]]; end; *a = r(); test_ok(a == [1,2])
+
+def r; return *[]; end; *a = r(); test_ok(a == [])
+def r; return *[1]; end; *a = r(); test_ok(a == [1])
+def r; return *[nil]; end; *a = r(); test_ok(a == [nil])
+def r; return *[[]]; end; *a = r(); test_ok(a == [[]])
+def r; return *[1,2]; end; *a = r(); test_ok(a == [1,2])
+def r; return *[*[]]; end; *a = r(); test_ok(a == [])
+def r; return *[*[1]]; end; *a = r(); test_ok(a == [1])
+def r; return *[*[1,2]]; end; *a = r(); test_ok(a == [1,2])
+
+def r; return *[[]]; end; *a = *r(); test_ok(a == [[]])
+def r; return *[1,2]; end; *a = *r(); test_ok(a == [1,2])
+def r; return *[*[1,2]]; end; *a = *r(); test_ok(a == [1,2])
+
+def r; return; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return nil; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return 1; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return []; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [1]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return [nil]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [[]]; end; a,b,*c = r(); test_ok([a,b,c] == [[],nil,[]])
+def r; return [1,2]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+def r; return [*[]]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [*[1]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return [*[1,2]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+
+def r; return *[]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[1]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return *[nil]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[[]]; end; a,b,*c = r(); test_ok([a,b,c] == [[],nil,[]])
+def r; return *[1,2]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+def r; return *[*[]]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[*[1]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return *[*[1,2]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+
+f = lambda {|r,| test_ok([] == r)}
+f.call([], *[])
+
+f = lambda {|r,*l| test_ok([] == r); test_ok([1] == l)}
+f.call([], *[1])
+
+f = lambda{|x| x}
+test_ok(f.call(42) == 42)
+test_ok(f.call([42]) == [42])
+test_ok(f.call([[42]]) == [[42]])
+test_ok(f.call([42,55]) == [42,55])
+
+f = lambda{|x,| x}
+test_ok(f.call(42) == 42)
+test_ok(f.call([42]) == [42])
+test_ok(f.call([[42]]) == [[42]])
+test_ok(f.call([42,55]) == [42,55])
+
+f = lambda{|*x| x}
+test_ok(f.call(42) == [42])
+test_ok(f.call([42]) == [[42]])
+test_ok(f.call([[42]]) == [[[42]]])
+test_ok(f.call([42,55]) == [[42,55]])
+test_ok(f.call(42,55) == [42,55])
+
+f = lambda { |a, b=42, *c| [a,b,c] }
+test_ok(f.call(1      ) == [1,42,[  ]] )
+test_ok(f.call(1,43   ) == [1,43,[  ]] )
+test_ok(f.call(1,43,44) == [1,43,[44]] )
+
+f = lambda { |a, b=(a|16), *c, &block| [a,b,c,block&&block[]] }
+test_ok(f.call(8      )     == [8,24,[  ],nil] )
+test_ok(f.call(8,43   )     == [8,43,[  ],nil] )
+test_ok(f.call(8,43,44)     == [8,43,[44],nil] )
+test_ok(f.call(8      ){45} == [8,24,[  ],45 ] )
+test_ok(f.call(8,43   ){45} == [8,43,[  ],45 ] )
+test_ok(f.call(8,43,44){45} == [8,43,[44],45 ] )
+
+f = lambda { |a, b=42, *c, d| [a,b,c,d] }
+test_ok(f.call(1      ,99) == [1,42,[  ],99] )
+test_ok(f.call(1,43   ,99) == [1,43,[  ],99] )
+test_ok(f.call(1,43,44,99) == [1,43,[44],99] )
+
+f = lambda { |a, b=(a|16), &block| [a,b,block&&block[]] }
+test_ok(f.call(8   )     == [8,24,nil] )
+test_ok(f.call(8,43)     == [8,43,nil] )
+test_ok(f.call(8,43)     == [8,43,nil] )
+test_ok(f.call(8   ){45} == [8,24,45 ] )
+test_ok(f.call(8,43){45} == [8,43,45 ] )
+test_ok(f.call(8,43){45} == [8,43,45 ] )
+
+f = lambda { |a, b=42, d| [a,b,d] }
+test_ok(f.call(1   ,99) == [1,42,99] )
+test_ok(f.call(1,43,99) == [1,43,99] )
+test_ok(f.call(1,43,99) == [1,43,99] )
+
+f = lambda { |b=42, *c, &block| [b,c,block&&block[]] }
+test_ok(f.call(     )     == [42,[  ],nil] )
+test_ok(f.call(43   )     == [43,[  ],nil] )
+test_ok(f.call(43,44)     == [43,[44],nil] )
+test_ok(f.call(     ){45} == [42,[  ],45 ] )
+test_ok(f.call(43   ){45} == [43,[  ],45 ] )
+test_ok(f.call(43,44){45} == [43,[44],45 ] )
+
+f = lambda { |b=42, *c, d| [b,c,d] }
+test_ok(f.call(      99) == [42,[  ],99] )
+test_ok(f.call(43   ,99) == [43,[  ],99] )
+test_ok(f.call(43,44,99) == [43,[44],99] )
+
+f = lambda { |b=42, &block| [b,block&&block[]] }
+test_ok(f.call(  )     == [42,nil] )
+test_ok(f.call(43)     == [43,nil] )
+test_ok(f.call(43)     == [43,nil] )
+test_ok(f.call(  ){45} == [42,45 ] )
+test_ok(f.call(43){45} == [43,45 ] )
+test_ok(f.call(43){45} == [43,45 ] )
+
+f = lambda { |b=42, d| [b,d] }
+test_ok(f.call(   99) == [42,99] )
+test_ok(f.call(43,99) == [43,99] )
+test_ok(f.call(43,99) == [43,99] )
+
+
+a,=*[1]
+test_ok(a == 1)
+a,=*[[1]]
+test_ok(a == [1])
+a,=*[[[1]]]
+test_ok(a == [[1]])
+
+x, (y, z) = 1, 2, 3
+test_ok([1,2,nil] == [x,y,z])
+x, (y, z) = 1, [2,3]
+test_ok([1,2,3] == [x,y,z])
+x, (y, z) = 1, [2]
+test_ok([1,2,nil] == [x,y,z])
+
+a = loop do break; end; test_ok(a == nil)
+a = loop do break nil; end; test_ok(a == nil)
+a = loop do break 1; end; test_ok(a == 1)
+a = loop do break []; end; test_ok(a == [])
+a = loop do break [1]; end; test_ok(a == [1])
+a = loop do break [nil]; end; test_ok(a == [nil])
+a = loop do break [[]]; end; test_ok(a == [[]])
+a = loop do break [*[]]; end; test_ok(a == [])
+a = loop do break [*[1]]; end; test_ok(a == [1])
+a = loop do break [*[1,2]]; end; test_ok(a == [1,2])
+
+a = loop do break *[]; end; test_ok(a == [])
+a = loop do break *[1]; end; test_ok(a == [1])
+a = loop do break *[nil]; end; test_ok(a == [nil])
+a = loop do break *[[]]; end; test_ok(a == [[]])
+a = loop do break *[*[]]; end; test_ok(a == [])
+a = loop do break *[*[1]]; end; test_ok(a == [1])
+a = loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+*a = loop do break; end; test_ok(a == [nil])
+*a = loop do break nil; end; test_ok(a == [nil])
+*a = loop do break 1; end; test_ok(a == [1])
+*a = loop do break []; end; test_ok(a == [])
+*a = loop do break [1]; end; test_ok(a == [1])
+*a = loop do break [nil]; end; test_ok(a == [nil])
+*a = loop do break [[]]; end; test_ok(a == [[]])
+*a = loop do break [1,2]; end; test_ok(a == [1,2])
+*a = loop do break [*[]]; end; test_ok(a == [])
+*a = loop do break [*[1]]; end; test_ok(a == [1])
+*a = loop do break [*[1,2]]; end; test_ok(a == [1,2])
+
+*a = loop do break *[]; end; test_ok(a == [])
+*a = loop do break *[1]; end; test_ok(a == [1])
+*a = loop do break *[nil]; end; test_ok(a == [nil])
+*a = loop do break *[[]]; end; test_ok(a == [[]])
+*a = loop do break *[1,2]; end; test_ok(a == [1,2])
+*a = loop do break *[*[]]; end; test_ok(a == [])
+*a = loop do break *[*[1]]; end; test_ok(a == [1])
+*a = loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+*a = *loop do break *[[]]; end; test_ok(a == [[]])
+*a = *loop do break *[1,2]; end; test_ok(a == [1,2])
+*a = *loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+a,b,*c = loop do break; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break nil; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break 1; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break []; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [1]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break [nil]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [[]]; end; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = loop do break [1,2]; end; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = loop do break [*[]]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [*[1]]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break [*[1,2]]; end; test_ok([a,b,c] == [1,2,[]])
+
+a,b,*c = loop do break *[]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[1]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break *[nil]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[[]]; end; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = loop do break *[1,2]; end; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = loop do break *[*[]]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[*[1]]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break *[*[1,2]]; end; test_ok([a,b,c] == [1,2,[]])
+
+def r(val); a = yield(); test_ok(a == val, 2); end
+r(nil){next}
+r(nil){next nil}
+r(1){next 1}
+r([]){next []}
+r([1]){next [1]}
+r([nil]){next [nil]}
+r([[]]){next [[]]}
+r([]){next [*[]]}
+r([1]){next [*[1]]}
+r([1,2]){next [*[1,2]]}
+
+r([]){next *[]}
+r([1]){next *[1]}
+r([nil]){next *[nil]}
+r([[]]){next *[[]]}
+r([]){next *[*[]]}
+r([1]){next *[*[1]]}
+r([1,2]){next *[*[1,2]]}
+
+def r(val); *a = yield(); test_ok(a == val, 2); end
+r([nil]){next}
+r([nil]){next nil}
+r([1]){next 1}
+r([]){next []}
+r([1]){next [1]}
+r([nil]){next [nil]}
+r([[]]){next [[]]}
+r([1,2]){next [1,2]}
+r([]){next [*[]]}
+r([1]){next [*[1]]}
+r([1,2]){next [*[1,2]]}
+
+def r(val); *a = *yield(); test_ok(a == val, 2); end
+r([[]]){next *[[]]}
+r([1,2]){next *[1,2]}
+r([1,2]){next *[*[1,2]]}
+
+def r(val); a,b,*c = yield(); test_ok([a,b,c] == val, 2); end
+r([nil,nil,[]]){next}
+r([nil,nil,[]]){next nil}
+r([1,nil,[]]){next 1}
+r([nil,nil,[]]){next []}
+r([1,nil,[]]){next [1]}
+r([nil,nil,[]]){next [nil]}
+r([[],nil,[]]){next [[]]}
+r([1,2,[]]){next [1,2]}
+r([nil,nil,[]]){next [*[]]}
+r([1,nil,[]]){next [*[1]]}
+r([1,2,[]]){next [*[1,2]]}
+
+def r(val); a,b,*c = *yield(); test_ok([a,b,c] == val, 2); end
+r([[],nil,[]]){next *[[]]}
+r([1,2,[]]){next *[1,2]}
+r([1,2,[]]){next *[*[1,2]]}
+
+test_check "condition"
+
+$x = '0';
+
+$x == $x && test_ok(true)
+$x != $x && test_ok(false)
+$x == $x || test_ok(false)
+$x != $x || test_ok(true)
+
+# first test to see if we can run the tests.
+
+test_check "if/unless";
+
+$x = 'test';
+test_ok(if $x == $x then true else false end)
+$bad = false
+unless $x == $x
+  $bad = true
+end
+test_ok(!$bad)
+test_ok(unless $x != $x then true else false end)
+
+test_check "case"
+
+case 5
+when 1, 2, 3, 4, 6, 7, 8
+  test_ok(false)
+when 5
+  test_ok(true)
+end
+
+case 5
+when 5
+  test_ok(true)
+when 1..10
+  test_ok(false)
+end
+
+case 5
+when 1..10
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+case 5
+when 5
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+case "foobar"
+when /^f.*r$/
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+test_check "while/until";
+
+while_tmp = "while_tmp.#{$$}"
+tmp = open(while_tmp, "w")
+tmp.print "tvi925\n";
+tmp.print "tvi920\n";
+tmp.print "vt100\n";
+tmp.print "Amiga\n";
+tmp.print "paper\n";
+tmp.close
+
+# test break
+
+tmp = open(while_tmp, "r")
+test_ok(tmp.kind_of?(File))
+
+while line = tmp.gets()
+  break if /vt100/ =~ line
+end
+
+test_ok(!tmp.eof? && /vt100/ =~ line)
+tmp.close
+
+# test next
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  next if /vt100/ =~ line
+  $bad = 1 if /vt100/ =~ line
+end
+test_ok(!(!tmp.eof? || /vt100/ =~ line || $bad))
+tmp.close
+
+# test redo
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  lastline = line
+  line = line.gsub(/vt100/, 'VT100')
+  if lastline != line
+    line.gsub!('VT100', 'Vt100')
+    redo
+  end
+  $bad = 1 if /vt100/ =~ line
+  $bad = 1 if /VT100/ =~ line
+end
+test_ok(tmp.eof? && !$bad)
+tmp.close
+
+sum=0
+for i in 1..10
+  sum += i
+  i -= 1
+  if i > 0
+    redo
+  end
+end
+test_ok(sum == 220)
+
+# test interval
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  break if 3
+  case line
+  when /vt100/, /Amiga/, /paper/
+    $bad = true
+  end
+end
+test_ok(!$bad)
+tmp.close
+
+File.unlink while_tmp or `/bin/rm -f "#{while_tmp}"`
+test_ok(!File.exist?(while_tmp))
+
+i = 0
+until i>4
+  i+=1
+end
+test_ok(i>4)
+
+
+# exception handling
+test_check "exception";
+
+begin
+  raise "this must be handled"
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+$bad = true
+begin
+  raise "this must be handled no.2"
+rescue
+  if $bad
+    $bad = false
+    retry
+    test_ok(false)
+  end
+end
+test_ok(true)
+
+# exception in rescue clause
+$string = "this must be handled no.3"
+begin
+  begin
+    raise "exception in rescue clause"
+  rescue
+    raise $string
+  end
+  test_ok(false)
+rescue => e
+  test_ok($! == e)
+  test_ok(e.message == $string)
+  test_ok(e != $string)
+end
+
+# exception in ensure clause
+begin
+  begin
+    raise "this must be handled no.4"
+  ensure
+    raise "exception in ensure clause"
+  end
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+$bad = true
+begin
+  begin
+    raise "this must be handled no.5"
+  ensure
+    $bad = false
+  end
+rescue
+end
+test_ok(!$bad)
+
+$bad = true
+begin
+  begin
+    raise "this must be handled no.6"
+  ensure
+    $bad = false
+  end
+rescue
+end
+test_ok(!$bad)
+
+$bad = true
+while true
+  begin
+    break
+  ensure
+    $bad = false
+  end
+end
+test_ok(!$bad)
+
+test_ok(catch(:foo) {
+     loop do
+       loop do
+	 throw :foo, true
+	 break
+       end
+       break
+       test_ok(false)			# should not reach here
+     end
+     false
+   })
+
+test_check "array"
+test_ok([1, 2] + [3, 4] == [1, 2, 3, 4])
+test_ok([1, 2] * 2 == [1, 2, 1, 2])
+test_ok([1, 2] * ":" == "1:2")
+
+test_ok([1, 2].hash == [1, 2].hash)
+
+test_ok([1,2,3] & [2,3,4] == [2,3])
+test_ok([1,2,3] | [2,3,4] == [1,2,3,4])
+test_ok([1,2,3] - [2,3] == [1])
+
+$x = [0, 1, 2, 3, 4, 5]
+test_ok($x[2] == 2)
+test_ok($x[1..3] == [1, 2, 3])
+test_ok($x[1,3] == [1, 2, 3])
+
+$x[0, 2] = 10
+test_ok($x[0] == 10 && $x[1] == 2)
+
+$x[0, 0] = -1
+test_ok($x[0] == -1 && $x[1] == 10)
+
+$x[-1, 1] = 20
+test_ok($x[-1] == 20 && $x.pop == 20)
+
+# array and/or
+test_ok(([1,2,3]&[2,4,6]) == [2])
+test_ok(([1,2,3]|[2,4,6]) == [1,2,3,4,6])
+
+# compact
+$x = [nil, 1, nil, nil, 5, nil, nil]
+$x.compact!
+test_ok($x == [1, 5])
+
+# uniq
+$x = [1, 1, 4, 2, 5, 4, 5, 1, 2]
+$x.uniq!
+test_ok($x == [1, 4, 2, 5])
+
+# empty?
+test_ok(!$x.empty?)
+$x = []
+test_ok($x.empty?)
+
+# sort
+$x = ["it", "came", "to", "pass", "that", "..."]
+$x = $x.sort.join(" ")
+test_ok($x == "... came it pass that to")
+$x = [2,5,3,1,7]
+$x.sort!{|a,b| a<=>b}		# sort with condition
+test_ok($x == [1,2,3,5,7])
+$x.sort!{|a,b| b-a}		# reverse sort
+test_ok($x == [7,5,3,2,1])
+
+# split test
+$x = "The Book of Mormon"
+test_ok($x.split(//).reverse!.join == $x.reverse)
+test_ok($x.reverse == $x.reverse!)
+test_ok("1 byte string".split(//).reverse.join(":") == "g:n:i:r:t:s: :e:t:y:b: :1")
+$x = "a b c  d"
+test_ok($x.split == ['a', 'b', 'c', 'd'])
+test_ok($x.split(' ') == ['a', 'b', 'c', 'd'])
+test_ok(defined? "a".chomp)
+test_ok("abc".scan(/./) == ["a", "b", "c"])
+test_ok("1a2b3c".scan(/(\d.)/) == [["1a"], ["2b"], ["3c"]])
+# non-greedy match
+test_ok("a=12;b=22".scan(/(.*?)=(\d*);?/) == [["a", "12"], ["b", "22"]])
+
+$x = [1]
+test_ok(($x * 5).join(":") == '1:1:1:1:1')
+test_ok(($x * 1).join(":") == '1')
+test_ok(($x * 0).join(":") == '')
+
+*$x = *(1..7).to_a
+test_ok($x.size == 7)
+test_ok($x == [1, 2, 3, 4, 5, 6, 7])
+
+$x = [1,2,3]
+$x[1,0] = $x
+test_ok($x == [1,1,2,3,2,3])
+
+$x = [1,2,3]
+$x[-1,0] = $x
+test_ok($x == [1,2,1,2,3,3])
+
+$x = [1,2,3]
+$x.concat($x)
+test_ok($x == [1,2,3,1,2,3])
+
+test_check "hash"
+$x = {1=>2, 2=>4, 3=>6}
+
+test_ok($x[1] == 2)
+
+test_ok(begin
+     for k,v in $x
+       raise if k*2 != v
+     end
+     true
+   rescue
+     false
+   end)
+
+test_ok($x.length == 3)
+test_ok($x.has_key?(1))
+test_ok($x.has_value?(4))
+test_ok($x.values_at(2,3) == [4,6])
+test_ok($x == {1=>2, 2=>4, 3=>6})
+
+$z = $x.keys.sort.join(":")
+test_ok($z == "1:2:3")
+
+$z = $x.values.sort.join(":")
+test_ok($z == "2:4:6")
+test_ok($x == $x)
+
+$x.shift
+test_ok($x.length == 2)
+
+$z = [1,2]
+$x[$z] = 256
+test_ok($x[$z] == 256)
+
+$x = Hash.new(0)
+$x[1] = 1
+test_ok($x[1] == 1)
+test_ok($x[2] == 0)
+
+$x = Hash.new([])
+test_ok($x[22] == [])
+test_ok($x[22].equal?($x[22]))
+
+$x = Hash.new{[]}
+test_ok($x[22] == [])
+test_ok(!$x[22].equal?($x[22]))
+
+$x = Hash.new{|h,k| $z = k; h[k] = k*2}
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 22)
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 0)
+$x.default = 5
+test_ok($x[23] == 5)
+
+$x = Hash.new
+def $x.default(k)
+  $z = k
+  self[k] = k*2
+end
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 22)
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 0)
+
+test_check "iterator"
+
+# yield at top level
+test_ok(!defined?(yield))
+
+$x = [1, 2, 3, 4]
+$y = []
+
+# iterator over array
+for i in $x
+  $y.push i
+end
+test_ok($x == $y)
+
+# nested iterator
+def tt
+  1.upto(10) {|i|
+    yield i
+  }
+end
+
+i=0
+tt{|i| break if i == 5}
+test_ok(i == 0)
+
+def tt2(dummy)
+  yield 1
+end
+
+def tt3(&block)
+  tt2(raise(ArgumentError,""),&block)
+end
+
+$x = false
+begin
+  tt3{}
+rescue ArgumentError
+  $x = true
+rescue Exception
+end
+test_ok($x)
+
+def tt4 &block
+  tt2(raise(ArgumentError,""),&block)
+end
+$x = false
+begin
+  tt4{}
+rescue ArgumentError
+  $x = true
+rescue Exception
+end
+test_ok($x)
+
+# iterator break/redo/next/retry
+done = true
+loop{
+  break
+  done = false			# should not reach here
+}
+test_ok(done)
+
+done = false
+$bad = false
+loop {
+  break if done
+  done = true
+  next
+  $bad = true			# should not reach here
+}
+test_ok(!$bad)
+
+done = false
+$bad = false
+loop {
+  break if done
+  done = true
+  redo
+  $bad = true			# should not reach here
+}
+test_ok(!$bad)
+
+$x = []
+for i in 1 .. 7
+  $x.push i
+end
+test_ok($x.size == 7)
+test_ok($x == [1, 2, 3, 4, 5, 6, 7])
+
+# append method to built-in class
+class Array
+  def iter_test1
+    collect{|e| [e, yield(e)]}.sort{|a,b|a[1]<=>b[1]}
+  end
+  def iter_test2
+    a = collect{|e| [e, yield(e)]}
+    a.sort{|a,b|a[1]<=>b[1]}
+  end
+end
+$x = [[1,2],[3,4],[5,6]]
+test_ok($x.iter_test1{|x|x} == $x.iter_test2{|x|x})
+
+class IterTest
+  def initialize(e); @body = e; end
+
+  def each0(&block); @body.each(&block); end
+  def each1(&block); @body.each {|*x| block.call(*x) } end
+  def each2(&block); @body.each {|*x| block.call(x) } end
+  def each3(&block); @body.each {|x| block.call(*x) } end
+  def each4(&block); @body.each {|x| block.call(x) } end
+  def each5; @body.each {|*x| yield(*x) } end
+  def each6; @body.each {|*x| yield(x) } end
+  def each7; @body.each {|x| yield(*x) } end
+  def each8; @body.each {|x| yield(x) } end
+
+  def f(a)
+    a
+  end
+end
+test_ok(IterTest.new(nil).method(:f).to_proc.call([1]) == [1])
+m = /\w+/.match("abc")
+test_ok(IterTest.new(nil).method(:f).to_proc.call([m]) == [m])
+
+IterTest.new([0]).each0 {|x| test_ok(x == 0)}
+IterTest.new([1]).each1 {|x| test_ok(x == 1)}
+IterTest.new([2]).each2 {|x| test_ok(x == [2])}
+#IterTest.new([3]).each3 {|x| test_ok(x == 3)}
+IterTest.new([4]).each4 {|x| test_ok(x == 4)}
+IterTest.new([5]).each5 {|x| test_ok(x == 5)}
+IterTest.new([6]).each6 {|x| test_ok(x == [6])}
+#IterTest.new([7]).each7 {|x| test_ok(x == 7)}
+IterTest.new([8]).each8 {|x| test_ok(x == 8)}
+
+IterTest.new([[0]]).each0 {|x| test_ok(x == [0])}
+IterTest.new([[1]]).each1 {|x| test_ok(x == [1])}
+IterTest.new([[2]]).each2 {|x| test_ok(x == [[2]])}
+IterTest.new([[3]]).each3 {|x| test_ok(x == 3)}
+IterTest.new([[4]]).each4 {|x| test_ok(x == [4])}
+IterTest.new([[5]]).each5 {|x| test_ok(x == [5])}
+IterTest.new([[6]]).each6 {|x| test_ok(x == [[6]])}
+IterTest.new([[7]]).each7 {|x| test_ok(x == 7)}
+IterTest.new([[8]]).each8 {|x| test_ok(x == [8])}
+
+IterTest.new([[0,0]]).each0 {|*x| test_ok(x == [[0,0]])}
+IterTest.new([[8,8]]).each8 {|*x| test_ok(x == [[8,8]])}
+
+def m0(v)
+  v
+end
+
+def m1
+  m0(block_given?)
+end
+test_ok(m1{p 'test'})
+test_ok(!m1)
+
+def m
+  m0(block_given?,&Proc.new{})
+end
+test_ok(m1{p 'test'})
+test_ok(!m1)
+
+class C
+  include Enumerable
+  def initialize
+    @a = [1,2,3]
+  end
+  def each(&block)
+    @a.each(&block)
+  end
+end
+
+test_ok(C.new.collect{|n| n} == [1,2,3])
+
+test_ok(Proc == lambda{}.class)
+test_ok(Proc == Proc.new{}.class)
+lambda{|a|test_ok(a==1)}.call(1)
+def block_test(klass, &block)
+  test_ok(klass === block)
+end
+
+block_test(NilClass)
+block_test(Proc){}
+
+def call_argument_test(state, proc, *args)
+  x = state
+  begin
+    proc.call(*args)
+  rescue ArgumentError
+    x = !x
+  end
+  test_ok(x,2)
+end
+
+call_argument_test(true, lambda{||})
+call_argument_test(false, lambda{||}, 1)
+call_argument_test(true, lambda{|a,|}, 1)
+call_argument_test(false, lambda{|a,|})
+call_argument_test(false, lambda{|a,|}, 1,2)
+
+call_argument_test(true, Proc.new{||})
+call_argument_test(true, Proc.new{||}, 1)
+call_argument_test(true, Proc.new{|a,|}, 1)
+call_argument_test(true, Proc.new{|a,|})
+call_argument_test(true, Proc.new{|a,|}, 1,2)
+
+def block_get(&block)
+  block
+end
+
+test_ok(Proc == block_get{}.class)
+call_argument_test(true, block_get{||})
+call_argument_test(true, block_get{||}, 1)
+call_argument_test(true, block_get{|a,|}, 1)
+call_argument_test(true, block_get{|a,|})
+call_argument_test(true, block_get{|a,|}, 1,2)
+
+call_argument_test(true, block_get(&lambda{||}))
+call_argument_test(false, block_get(&lambda{||}),1)
+call_argument_test(true, block_get(&lambda{|a,|}),1)
+call_argument_test(false, block_get(&lambda{|a,|}),1,2)
+
+blk = block_get{11}
+test_ok(blk.class == Proc)
+test_ok(blk.to_proc.class == Proc)
+test_ok(blk.clone.call == 11)
+test_ok(block_get(&blk).class == Proc)
+
+lmd = lambda{44}
+test_ok(lmd.class == Proc)
+test_ok(lmd.to_proc.class == Proc)
+test_ok(lmd.clone.call == 44)
+test_ok(block_get(&lmd).class == Proc)
+
+test_ok(Proc.new{|a,| a}.yield(1,2,3) == 1)
+call_argument_test(true, Proc.new{|a,|}, 1,2)
+
+test_ok(Proc.new{|&b| b.call(10)}.call {|x| x} == 10)
+test_ok(Proc.new{|a,&b| b.call(a)}.call(12) {|x| x} == 12)
+
+def test_return1
+  Proc.new {
+    return 55
+  }.yield + 5
+end
+test_ok(test_return1() == 55)
+def test_return2
+  lambda {
+    return 55
+  }.call + 5
+end
+test_ok(test_return2() == 60)
+
+def proc_call(&b)
+  b.call
+end
+def proc_yield()
+  yield
+end
+def proc_return1
+  lambda{return 42}.call+1
+end
+test_ok(proc_return1() == 43)
+def proc_return2
+  ->{return 42}.call+1
+end
+test_ok(proc_return2() == 43)
+def proc_return3
+  proc_call{return 42}+1
+end
+test_ok(proc_return3() == 42)
+def proc_return4
+  proc_yield{return 42}+1
+end
+test_ok(proc_return4() == 42)
+
+def ljump_test(state, proc, *args)
+  x = state
+  begin
+    proc.call(*args)
+  rescue LocalJumpError
+    x = !x
+  end
+  test_ok(x,2)
+end
+
+ljump_test(false, block_get{break})
+ljump_test(true, lambda{break})
+
+def exit_value_test(&block)
+  block.call
+rescue LocalJumpError
+  $!.exit_value
+end
+
+test_ok(45 == exit_value_test{break 45})
+
+test_ok(55 == begin
+              block_get{break 55}.call
+            rescue LocalJumpError
+              $!.exit_value
+            end)
+
+def block_call(&block)
+  block.call
+end
+
+def test_b1
+  block_call{break 11}
+end
+test_ok(test_b1() == 11)
+
+def ljump_rescue(r)
+  begin
+    yield
+  rescue LocalJumpError => e
+    r if /from proc-closure/ =~ e.message
+  end
+end
+
+def test_b2
+  ljump_rescue(22) do
+    block_get{break 21}.call
+  end
+end
+test_ok(test_b2() == 22)
+
+def test_b3
+  ljump_rescue(33) do
+    Proc.new{break 31}.yield
+  end
+end
+test_ok(test_b3() == 33)
+
+def test_b4
+  lambda{break 44}.call
+end
+test_ok(test_b4() == 44)
+
+def test_b5
+  ljump_rescue(55) do
+    b = block_get{break 54}
+    block_call(&b)
+  end
+end
+test_ok(test_b5() == 55)
+
+def test_b6
+  b = lambda{break 67}
+  block_call(&b)
+  66
+end
+test_ok(test_b6() == 66)
+
+def util_r7
+  block_get{break 78}
+end
+
+def test_b7
+  b = util_r7()
+  ljump_rescue(77) do
+    block_call(&b)
+  end
+end
+test_ok(test_b7() == 77)
+
+def util_b8(&block)
+  block_call(&block)
+end
+
+def test_b8
+  util_b8{break 88}
+end
+test_ok(test_b8() == 88)
+
+def util_b9(&block)
+  lambda{block.call; 98}.call
+end
+
+def test_b9
+  util_b9{break 99}
+end
+test_ok(test_b9() == 99)
+
+def util_b10
+  util_b9{break 100}
+end
+
+def test_b10
+  util_b10()
+end
+test_ok(test_b10() == 100)
+
+def test_b11
+  ljump_rescue(111) do
+    loop do
+      Proc.new{break 110}.yield
+      break 112
+    end
+  end
+end
+test_ok(test_b11() == 111)
+
+def test_b12
+  loop do
+    break lambda{break 122}.call
+    break 121
+  end
+end
+test_ok(test_b12() == 122)
+
+def test_b13
+  ljump_rescue(133) do
+    while true
+      Proc.new{break 130}.yield
+      break 131
+    end
+  end
+end
+test_ok(test_b13() == 133)
+
+def test_b14
+  while true
+    break lambda{break 144}.call
+    break 143
+  end
+end
+test_ok(test_b14() == 144)
+
+def test_b15
+  [0].each {|c| yield 1 }
+  156
+end
+test_ok(test_b15{|e| break 155 } == 155)
+
+def marity_test(m)
+  method = method(m)
+  test_ok(method.arity == method.to_proc.arity, 2)
+end
+marity_test(:test_ok)
+marity_test(:marity_test)
+marity_test(:p)
+
+class ITER_TEST1
+   def a
+     block_given?
+   end
+end
+
+class ITER_TEST2 < ITER_TEST1
+   def a
+     test_ok(super)
+     super
+   end
+end
+test_ok(ITER_TEST2.new.a {})
+
+class ITER_TEST3
+  def foo x
+    return yield if block_given?
+    x
+  end
+end
+
+class ITER_TEST4 < ITER_TEST3
+  def foo x
+    test_ok(super == yield)
+    test_ok(super(x, &nil) == x)
+  end
+end
+
+ITER_TEST4.new.foo(44){55}
+
+class ITER_TEST5
+   def tt(aa)
+     aa
+   end
+
+   def uu(a)
+      class << self
+         define_method(:tt) do |sym|
+            super(sym)
+         end
+      end
+   end
+
+   def xx(*x)
+     x.size
+   end
+end
+
+a = ITER_TEST5.new
+a.uu(12)
+test_ok(a.tt(1) == 1)
+
+class ITER_TEST6 < ITER_TEST5
+   def xx(*a)
+      a << 12
+      super
+   end
+end
+
+test_ok(ITER_TEST6.new.xx([24]) == 2)
+
+test_check "float"
+test_ok(2.6.floor == 2)
+test_ok((-2.6).floor == -3)
+test_ok(2.6.ceil == 3)
+test_ok((-2.6).ceil == -2)
+test_ok(2.6.truncate == 2)
+test_ok((-2.6).truncate == -2)
+test_ok(2.6.round == 3)
+test_ok((-2.4).truncate == -2)
+test_ok((13.4 % 1 - 0.4).abs < 0.0001)
+nan = 0.0/0
+def nan_test(x,y)
+  test_ok(x != y)
+  test_ok((x < y) == false)
+  test_ok((x > y) == false)
+  test_ok((x <= y) == false)
+  test_ok((x >= y) == false)
+end
+nan_test(nan, nan)
+nan_test(nan, 0)
+nan_test(nan, 1)
+nan_test(nan, -1)
+nan_test(nan, 1000)
+nan_test(nan, -1000)
+nan_test(nan, 1_000_000_000_000)
+nan_test(nan, -1_000_000_000_000)
+nan_test(nan, 100.0);
+nan_test(nan, -100.0);
+nan_test(nan, 0.001);
+nan_test(nan, -0.001);
+nan_test(nan, 1.0/0);
+nan_test(nan, -1.0/0);
+
+#s = "3.7517675036461267e+17"
+#test_ok(s == sprintf("%.16e", s.to_f))
+f = 3.7517675036461267e+17
+test_ok(f == sprintf("%.16e", f).to_f)
+
+
+test_check "bignum"
+def fact(n)
+  return 1 if n == 0
+  f = 1
+  while n>0
+    f *= n
+    n -= 1
+  end
+  return f
+end
+$x = fact(40)
+test_ok($x == $x)
+test_ok($x == fact(40))
+test_ok($x < $x+2)
+test_ok($x > $x-2)
+test_ok($x == 815915283247897734345611269596115894272000000000)
+test_ok($x != 815915283247897734345611269596115894272000000001)
+test_ok($x+1 == 815915283247897734345611269596115894272000000001)
+test_ok($x/fact(20) == 335367096786357081410764800000)
+$x = -$x
+test_ok($x == -815915283247897734345611269596115894272000000000)
+test_ok(2-(2**32) == -(2**32-2))
+test_ok(2**32 - 5 == (2**32-3)-2)
+
+$good = true;
+for i in 1000..1014
+  $good = false if ((1 << i) != (2**i))
+end
+test_ok($good)
+
+$good = true;
+n1= 1 << 1000
+for i in 1000..1014
+  $good = false if ((1 << i) != n1)
+  n1 *= 2
+end
+test_ok($good)
+
+$good = true;
+n2=n1
+for i in 1..10
+  n1 = n1 / 2
+  n2 = n2 >> 1
+  $good = false if (n1 != n2)
+end
+test_ok($good)
+
+$good = true;
+for i in 4000..4096
+  n1 = 1 << i;
+  if (n1**2-1) / (n1+1) != (n1-1)
+    $good = false
+  end
+end
+test_ok($good)
+
+b = 10**80
+a = b * 9 + 7
+test_ok(7 == a.modulo(b))
+test_ok(-b + 7 == a.modulo(-b))
+test_ok(b + -7 == (-a).modulo(b))
+test_ok(-7 == (-a).modulo(-b))
+test_ok(7 == a.remainder(b))
+test_ok(7 == a.remainder(-b))
+test_ok(-7 == (-a).remainder(b))
+test_ok(-7 == (-a).remainder(-b))
+
+test_ok(10**40+10**20 == 10000000000000000000100000000000000000000)
+test_ok(10**40/10**20 == 100000000000000000000)
+
+a = 677330545177305025495135714080
+b = 14269972710765292560
+test_ok(a % b == 0)
+test_ok(-a % b == 0)
+
+def shift_test(a)
+  b = a / (2 ** 32)
+  c = a >> 32
+  test_ok(b == c)
+
+  b = a * (2 ** 32)
+  c = a << 32
+  test_ok(b == c)
+end
+
+shift_test(-4518325415524767873)
+shift_test(-0xfffffffffffffffff)
+
+test_check "string & char"
+
+test_ok("abcd" == "abcd")
+test_ok("abcd" =~ /abcd/)
+test_ok("abcd" === "abcd")
+# compile time string concatenation
+test_ok("ab" "cd" == "abcd")
+test_ok("#{22}aa" "cd#{44}" == "22aacd44")
+test_ok("#{22}aa" "cd#{44}" "55" "#{66}" == "22aacd445566")
+test_ok("abc" !~ /^$/)
+test_ok("abc\n" !~ /^$/)
+test_ok("abc" !~ /^d*$/)
+test_ok(("abc" =~ /d*$/) == 3)
+test_ok("" =~ /^$/)
+test_ok("\n" =~ /^$/)
+test_ok("a\n\n" =~ /^$/)
+test_ok("abcabc" =~ /.*a/ && $& == "abca")
+test_ok("abcabc" =~ /.*c/ && $& == "abcabc")
+test_ok("abcabc" =~ /.*?a/ && $& == "a")
+test_ok("abcabc" =~ /.*?c/ && $& == "abc")
+test_ok(/(.|\n)*?\n(b|\n)/ =~ "a\nb\n\n" && $& == "a\nb")
+
+test_ok(/^(ab+)+b/ =~ "ababb" && $& == "ababb")
+test_ok(/^(?:ab+)+b/ =~ "ababb" && $& == "ababb")
+test_ok(/^(ab+)+/ =~ "ababb" && $& == "ababb")
+test_ok(/^(?:ab+)+/ =~ "ababb" && $& == "ababb")
+
+test_ok(/(\s+\d+){2}/ =~ " 1 2" && $& == " 1 2")
+test_ok(/(?:\s+\d+){2}/ =~ " 1 2" && $& == " 1 2")
+
+$x = <<END;
+ABCD
+ABCD
+END
+$x.gsub!(/((.|\n)*?)B((.|\n)*?)D/, '\1\3')
+test_ok($x == "AC\nAC\n")
+
+test_ok("foobar" =~ /foo(?=(bar)|(baz))/)
+test_ok("foobaz" =~ /foo(?=(bar)|(baz))/)
+
+$foo = "abc"
+test_ok("#$foo = abc" == "abc = abc")
+test_ok("#{$foo} = abc" == "abc = abc")
+
+foo = "abc"
+test_ok("#{foo} = abc" == "abc = abc")
+
+test_ok('-' * 5 == '-----')
+test_ok('-' * 1 == '-')
+test_ok('-' * 0 == '')
+
+foo = '-'
+test_ok(foo * 5 == '-----')
+test_ok(foo * 1 == '-')
+test_ok(foo * 0 == '')
+
+$x = "a.gif"
+test_ok($x.sub(/.*\.([^\.]+)$/, '\1') == "gif")
+test_ok($x.sub(/.*\.([^\.]+)$/, 'b.\1') == "b.gif")
+test_ok($x.sub(/.*\.([^\.]+)$/, '\2') == "")
+test_ok($x.sub(/.*\.([^\.]+)$/, 'a\2b') == "ab")
+test_ok($x.sub(/.*\.([^\.]+)$/, '<\&>') == "<a.gif>")
+
+# character constants(assumes ASCII)
+test_ok("a"[0] == ?a)
+test_ok(?a == ?a)
+test_ok(?\C-a == "\1")
+test_ok(?\M-a == "\341")
+test_ok(?\M-\C-a == "\201")
+test_ok("a".upcase![0] == ?A)
+test_ok("A".downcase![0] == ?a)
+test_ok("abc".tr!("a-z", "A-Z") == "ABC")
+test_ok("aabbcccc".tr_s!("a-z", "A-Z") == "ABC")
+test_ok("abcc".squeeze!("a-z") == "abc")
+test_ok("abcd".delete!("bc") == "ad")
+
+$x = "abcdef"
+$y = [ ?a, ?b, ?c, ?d, ?e, ?f ]
+$bad = false
+$x.each_byte {|i|
+  if i.chr != $y.shift
+    $bad = true
+    break
+  end
+}
+test_ok(!$bad)
+
+s = "a string"
+s[0..s.size]="another string"
+test_ok(s == "another string")
+
+s = <<EOS
+#{
+[1,2,3].join(",")
+}
+EOS
+test_ok(s == "1,2,3\n")
+test_ok("Just".to_i(36) == 926381)
+test_ok("-another".to_i(36) == -23200231779)
+test_ok(1299022.to_s(36) == "ruby")
+test_ok(-1045307475.to_s(36) == "-hacker")
+test_ok("Just_another_Ruby_hacker".to_i(36) == 265419172580680477752431643787347)
+test_ok(-265419172580680477752431643787347.to_s(36) == "-justanotherrubyhacker")
+
+a = []
+(0..255).each {|n|
+  ch = [n].pack("C")
+  a.push ch if /a#{Regexp.quote ch}b/x =~ "ab"
+}
+test_ok(a.size == 0)
+
+test_check "assignment"
+a = nil
+test_ok(defined?(a))
+test_ok(a == nil)
+
+# multiple assignment
+a, b = 1, 2
+test_ok(a == 1 && b == 2)
+
+a, b = b, a
+test_ok(a == 2 && b == 1)
+
+a, = 1,2
+test_ok(a == 1)
+
+a, *b = 1, 2, 3
+test_ok(a == 1 && b == [2, 3])
+
+a, (b, c), d = 1, [2, 3], 4
+test_ok(a == 1 && b == 2 && c == 3 && d == 4)
+
+*a = 1, 2, 3
+test_ok(a == [1, 2, 3])
+
+*a = 4
+test_ok(a == [4])
+
+*a = nil
+test_ok(a == [nil])
+
+test_check "call"
+def aaa(a, b=100, *rest)
+  res = [a, b]
+  res += rest if rest
+  return res
+end
+
+# not enough argument
+begin
+  aaa()				# need at least 1 arg
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+begin
+  aaa				# no arg given (exception raised)
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+test_ok(aaa(1) == [1, 100])
+test_ok(aaa(1, 2) == [1, 2])
+test_ok(aaa(1, 2, 3, 4) == [1, 2, 3, 4])
+test_ok(aaa(1, *[2, 3, 4]) == [1, 2, 3, 4])
+
+test_check "proc"
+$proc = Proc.new{|i| i}
+test_ok($proc.call(2) == 2)
+test_ok($proc.call(3) == 3)
+
+$proc = Proc.new{|i| i*2}
+test_ok($proc.call(2) == 4)
+test_ok($proc.call(3) == 6)
+
+Proc.new{
+  iii=5				# nested local variable
+  $proc = Proc.new{|i|
+    iii = i
+  }
+  $proc2 = Proc.new {
+    $x = iii			# nested variables shared by procs
+  }
+  # scope of nested variables
+  test_ok(defined?(iii))
+}.call
+test_ok(!defined?(iii))		# out of scope
+
+loop{iii=5; test_ok(eval("defined? iii")); break}
+loop {
+  iii = 10
+  def dyna_var_check
+    loop {
+      test_ok(!defined?(iii))
+      break
+    }
+  end
+  dyna_var_check
+  break
+}
+$x=0
+$proc.call(5)
+$proc2.call
+test_ok($x == 5)
+
+if defined? Process.kill
+  test_check "signal"
+
+  $x = 0
+  trap "SIGINT", Proc.new{|sig| $x = 2}
+  Process.kill "SIGINT", $$
+  100.times {
+    sleep 0.1
+    break if $x != 0
+  }
+  test_ok($x == 2)
+
+  trap "SIGINT", Proc.new{raise "Interrupt"}
+
+  x = false
+  begin
+    Process.kill "SIGINT", $$
+    sleep 0.1
+  rescue
+    x = $!
+  end
+  test_ok(x && /Interrupt/ =~ x.message)
+end
+
+test_check "eval"
+test_ok(eval("") == nil)
+$bad=false
+eval 'while false; $bad = true; print "foo\n" end'
+test_ok(!$bad)
+
+test_ok(eval('Object'))
+test_ok(eval('true'))
+test_ok(!eval('nil'))
+test_ok(!eval('false'))
+
+$foo = 'test_ok(true)'
+begin
+  eval $foo
+rescue
+  test_ok(false)
+end
+
+test_ok(eval("$foo") == 'test_ok(true)')
+test_ok(eval("true") == true)
+i = 5
+test_ok(eval("i == 5"))
+test_ok(eval("i") == 5)
+test_ok(eval("defined? i"))
+
+# eval with binding
+def test_ev
+  local1 = "local1"
+  lambda {
+    local2 = "local2"
+    return binding
+  }.call
+end
+
+$x = test_ev
+test_ok(eval("local1", $x) == "local1") # normal local var
+test_ok(eval("local2", $x) == "local2") # nested local var
+$bad = true
+begin
+  p eval("local1")
+rescue NameError		# must raise error
+  $bad = false
+end
+test_ok(!$bad)
+
+module EvTest
+  EVTEST1 = 25
+  evtest2 = 125
+  $x = binding
+end
+test_ok(eval("EVTEST1", $x) == 25)	# constant in module
+test_ok(eval("evtest2", $x) == 125)	# local var in module
+$bad = true
+begin
+  eval("EVTEST1")
+rescue NameError		# must raise error
+  $bad = false
+end
+test_ok(!$bad)
+
+x = binding #! YARV Limitation: Proc.new{}
+eval "i4 = 1", x
+test_ok(eval("i4", x) == 1)
+x = Proc.new{binding}.call #! YARV Limitation: Proc.new{Proc.new{}}.call
+eval "i4 = 22", x
+test_ok(eval("i4", x) == 22)
+$x = []
+x = Proc.new{binding}.call #! YARV Limitation: Proc.new{Proc.new{}}.call
+eval "(0..9).each{|i5| $x[i5] = Proc.new{i5*2}}", x
+test_ok($x[4].call == 8)
+
+x = binding
+eval "i = 1", x
+test_ok(eval("i", x) == 1)
+x = Proc.new{binding}.call
+eval "i = 22", x
+test_ok(eval("i", x) == 22)
+$x = []
+x = Proc.new{binding}.call
+eval "(0..9).each{|i5| $x[i5] = Proc.new{i5*2}}", x
+test_ok($x[4].call == 8)
+x = Proc.new{binding}.call
+eval "for i6 in 1..1; j6=i6; end", x
+test_ok(eval("defined? i6", x))
+test_ok(eval("defined? j6", x))
+
+Proc.new {
+  p = binding
+  eval "foo11 = 1", p
+  foo22 = 5
+  Proc.new{foo11=22}.call
+  Proc.new{foo22=55}.call
+  test_ok(eval("foo11", p) == eval("foo11"))
+  test_ok(eval("foo11") == 1)
+  test_ok(eval("foo22", p) == eval("foo22"))
+  test_ok(eval("foo22") == 55)
+}.call if false #! YARV Limitation
+
+#! YARV Limitation: p1 = Proc.new{i7 = 0; Proc.new{i7}}.call
+p1 = Proc.new{i7 = 0; binding}.call
+#! YARV Limitation: test_ok(p1.call == 0)
+eval "i7=5", p1
+#! YARV Limitation: test_ok(p1.call == 5)
+test_ok(!defined?(i7))
+
+if false #! YARV Limitation
+p1 = Proc.new{i7 = 0; Proc.new{i7}}.call
+i7 = nil
+test_ok(p1.call == 0)
+eval "i7=1", p1
+test_ok(p1.call == 1)
+eval "i7=5", p1
+test_ok(p1.call == 5)
+test_ok(i7 == nil)
+end
+
+# WASI doesn't support spawning a new process for now.
+unless /wasi/ =~ RUBY_PLATFORM
+test_check "system"
+test_ok(`echo foobar` == "foobar\n")
+test_ok(`./miniruby -e 'print "foobar"'` == 'foobar')
+
+script_tmp = "script_tmp.#{$$}"
+tmp = open(script_tmp, "w")
+tmp.print "print $zzz\n";
+tmp.close
+
+test_ok(`./miniruby -s #{script_tmp} -zzz` == 'true')
+test_ok(`./miniruby -s #{script_tmp} -zzz=555` == '555')
+
+tmp = open(script_tmp, "w")
+tmp.print "#! /usr/local/bin/ruby -s\n";
+tmp.print "print $zzz\n";
+tmp.close
+
+test_ok(`./miniruby #{script_tmp} -zzz=678` == '678')
+
+tmp = open(script_tmp, "w")
+tmp.print "this is a leading junk\n";
+tmp.print "#! /usr/local/bin/ruby -s\n";
+tmp.print "print $zzz\n";
+tmp.print "__END__\n";
+tmp.print "this is a trailing junk\n";
+tmp.close
+
+test_ok(`./miniruby -x #{script_tmp}` == '')
+test_ok(`./miniruby -x #{script_tmp} -zzz=555` == '555')
+
+tmp = open(script_tmp, "w")
+for i in 1..5
+  tmp.print i, "\n"
+end
+tmp.close
+
+`./miniruby -i.bak -pe '$_.sub!(/^[0-9]+$/){$&.to_i * 5}' #{script_tmp}`
+done = true
+tmp = open(script_tmp, "r")
+while tmp.gets
+  if $_.to_i % 5 != 0
+    done = false
+    break
+  end
+end
+tmp.close
+test_ok(done)
+
+File.unlink script_tmp or `/bin/rm -f "#{script_tmp}"`
+File.unlink "#{script_tmp}.bak" or `/bin/rm -f "#{script_tmp}.bak"`
+end # not /wasi/ =~ RUBY_PLATFORM
+
+test_check "const"
+TEST1 = 1
+TEST2 = 2
+
+module Const
+  TEST3 = 3
+  TEST4 = 4
+end
+
+module Const2
+  TEST3 = 6
+  TEST4 = 8
+end
+
+include Const
+
+test_ok([TEST1,TEST2,TEST3,TEST4] == [1,2,3,4])
+
+include Const2
+STDERR.print "intentionally redefines TEST3, TEST4\n" if $VERBOSE
+test_ok([TEST1,TEST2,TEST3,TEST4] == [1,2,6,8])
+
+
+test_ok((String <=> Object) == -1)
+test_ok((Object <=> String) == 1)
+test_ok((Array <=> String) == nil)
+
+test_check "clone"
+foo = Object.new
+def foo.test
+  "test"
+end
+bar = foo.clone
+def bar.test2
+  "test2"
+end
+
+test_ok(bar.test2 == "test2")
+test_ok(bar.test == "test")
+test_ok(foo.test == "test")
+
+begin
+  foo.test2
+  test_ok false
+rescue NoMethodError
+  test_ok true
+end
+
+module M001; end
+module M002; end
+module M003; include M002; end
+module M002; include M001; end
+module M003; include M002; end
+
+test_ok(M003.ancestors == [M003, M002, M001])
+
+test_check "marshal"
+$x = [1,2,3,[4,5,"foo"],{1=>"bar"},2.5,fact(30)]
+$y = Marshal.dump($x)
+test_ok($x == Marshal.load($y))
+
+StrClone=String.clone;
+test_ok(Marshal.load(Marshal.dump(StrClone.new("abc"))).class == StrClone)
+
+[[1,2,3,4], [81, 2, 118, 3146]].each { |w,x,y,z|
+  a = (x.to_f + y.to_f / z.to_f) * Math.exp(w.to_f / (x.to_f + y.to_f / z.to_f))
+  ma = Marshal.dump(a)
+  b = Marshal.load(ma)
+  test_ok(a == b)
+}
+
+test_check "pack"
+
+$format = "c2x5CCxsdils_l_a6";
+# Need the expression in here to force ary[5] to be numeric.  This avoids
+# test2 failing because ary2 goes str->numeric->str and ary does not.
+ary = [1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,-32767,-123456,"abcdef"]
+$x = ary.pack($format)
+ary2 = $x.unpack($format)
+
+test_ok(ary.length == ary2.length)
+test_ok(ary.join(':') == ary2.join(':'))
+test_ok($x =~ /def/)
+
+$x = [-1073741825]
+test_ok($x.pack("q").unpack("q") == $x)
+
+test_check "math"
+test_ok(Math.sqrt(4) == 2)
+
+include Math
+test_ok(sqrt(4) == 2)
+
+test_check "struct"
+struct_test = Struct.new("Test", :foo, :bar)
+test_ok(struct_test == Struct::Test)
+
+test = struct_test.new(1, 2)
+test_ok(test.foo == 1 && test.bar == 2)
+test_ok(test[0] == 1 && test[1] == 2)
+
+a, b = test.to_a
+test_ok(a == 1 && b == 2)
+
+test[0] = 22
+test_ok(test.foo == 22)
+
+test.bar = 47
+test_ok(test.bar == 47)
+
+test_check "variable"
+test_ok($$.instance_of?(Integer))
+
+# read-only variable
+begin
+  $$ = 5
+  test_ok false
+rescue NameError
+  test_ok true
+end
+
+foobar = "foobar"
+$_ = foobar
+test_ok($_ == foobar)
+
+class Gods
+  @@rule = "Uranus"
+  def ruler0
+    @@rule
+  end
+
+  def self.ruler1		# <= per method definition style
+    @@rule
+  end
+  class << self			# <= multiple method definition style
+    def ruler2
+      @@rule
+    end
+  end
+end
+
+module Olympians
+  @@rule ="Zeus"
+  def ruler3
+    @@rule
+  end
+end
+
+class Titans < Gods
+  @@rule = "Cronus"		# modifies @@rule in Gods
+  include Olympians
+  def ruler4
+    @@rule
+  end
+end
+
+test_ok(Gods.new.ruler0 == "Cronus")
+test_ok(Gods.ruler1 == "Cronus")
+test_ok(Gods.ruler2 == "Cronus")
+test_ok(Titans.ruler1 == "Cronus")
+test_ok(Titans.ruler2 == "Cronus")
+atlas = Titans.new
+test_ok(atlas.ruler0 == "Cronus")
+test_ok(atlas.ruler3 == "Zeus")
+begin
+  atlas.ruler4
+rescue RuntimeError => e
+  test_ok(e.message.include?("class variable @@rule of Olympians is overtaken by Gods"))
+else
+  test_ok(false)
+end
+test_ok(atlas.ruler3 == "Zeus")
+
+test_check "trace"
+$x = 1234
+$y = 0
+trace_var :$x, Proc.new{$y = $x}
+$x = 40414
+test_ok($y == $x)
+
+untrace_var :$x
+$x = 19660208
+test_ok($y != $x)
+
+trace_var :$x, Proc.new{$x *= 2}
+$x = 5
+test_ok($x == 10)
+
+untrace_var :$x
+
+test_check "defined?"
+
+test_ok(defined?($x))		# global variable
+test_ok(defined?($x) == 'global-variable')# returns description
+
+foo=5
+test_ok(defined?(foo))		# local variable
+
+test_ok(defined?(Array))	# constant
+test_ok(defined?(Object.new))	# method
+test_ok(!defined?(Object.print))# private method
+test_ok(defined?(1 == 2))	# operator expression
+
+class Foo
+  def foo
+    p :foo
+  end
+  protected :foo
+  def bar(f)
+    test_ok(defined?(self.foo))
+    test_ok(defined?(f.foo))
+  end
+end
+f = Foo.new
+test_ok(defined?(f.foo) == nil)
+f.bar(f)
+
+def defined_test
+  return !defined?(yield)
+end
+
+test_ok(defined_test)		# not iterator
+test_ok(!defined_test{})	# called as iterator
+
+test_check "alias"
+class Alias0
+  def foo; "foo" end
+end
+class Alias1 < Alias0
+  alias bar foo
+  def foo; "foo+" + super end
+end
+class Alias2 < Alias1
+  alias baz foo
+  undef foo
+end
+
+x = Alias2.new
+test_ok(x.bar == "foo")
+test_ok(x.baz == "foo+foo")
+
+# test_check for cache
+test_ok(x.baz == "foo+foo")
+
+class Alias3 < Alias2
+  def foo
+    defined? super
+  end
+  def bar
+    defined? super
+  end
+  def quux
+    defined? super
+  end
+end
+x = Alias3.new
+test_ok(!x.foo)
+test_ok(x.bar)
+test_ok(!x.quux)
+
+test_check "path"
+test_ok(File.basename("a") == "a")
+test_ok(File.basename("a/b") == "b")
+test_ok(File.basename("a/b/") == "b")
+test_ok(File.basename("/") == "/")
+test_ok(File.basename("//") == "/")
+test_ok(File.basename("///") == "/")
+test_ok(File.basename("a/b////") == "b")
+test_ok(File.basename("a.rb", ".rb") == "a")
+test_ok(File.basename("a.rb///", ".rb") == "a")
+test_ok(File.basename("a.rb///", ".*") == "a")
+test_ok(File.basename("a.rb///", ".c") == "a.rb")
+test_ok(File.dirname("a") == ".")
+test_ok(File.dirname("/") == "/")
+test_ok(File.dirname("/a") == "/")
+test_ok(File.dirname("a/b") == "a")
+test_ok(File.dirname("a/b/c") == "a/b")
+test_ok(File.dirname("/a/b/c") == "/a/b")
+test_ok(File.dirname("/a/b/") == "/a")
+test_ok(File.dirname("/a/b///") == "/a")
+case Dir.pwd
+when %r'\A\w:'
+  test_ok(/\A\w:\/\z/ =~ File.expand_path(".", "/"))
+  test_ok(/\A\w:\/a\z/ =~ File.expand_path("a", "/"))
+  dosish = true
+when %r'\A//'
+  test_ok(%r'\A//[^/]+/[^/]+\z' =~ File.expand_path(".", "/"))
+  test_ok(%r'\A//[^/]+/[^/]+/a\z' =~ File.expand_path(".", "/"))
+  dosish = true
+else
+  test_ok(File.expand_path(".", "/") == "/")
+  test_ok(File.expand_path("sub", "/") == "/sub")
+end
+if dosish
+  test_ok(File.expand_path("/", "//machine/share/sub") == "//machine/share")
+  test_ok(File.expand_path("/dir", "//machine/share/sub") == "//machine/share/dir")
+  test_ok(File.expand_path("/", "z:/sub") == "z:/")
+  test_ok(File.expand_path("/dir", "z:/sub") == "z:/dir")
+end
+test_ok(File.expand_path(".", "//") == "//")
+test_ok(File.expand_path("sub", "//") == "//sub")
+
+# test_check "Proc#binding"
+ObjectSpace.each_object(Proc){|o|
+  begin
+    b = o.binding
+    eval 'self', b
+  rescue ArgumentError
+  end
+}
+
+test_check "gc"
+begin
+  1.upto(10000) {
+    tmp = [0,1,2,3,4,5,6,7,8,9]
+  }
+  tmp = nil
+  test_ok true
+rescue
+  test_ok false
+end
+class S
+  def initialize(a)
+    @a = a
+  end
+end
+l=nil
+100000.times {
+  l = S.new(l)
+}
+GC.start
+test_ok true   # reach here or dumps core
+l = []
+100000.times {
+  l.push([l])
+}
+GC.start
+test_ok true   # reach here or dumps core
+
+ObjectSpace.each_object{|o|
+  o.class.name
+}
+
+test_ok true   # reach here or dumps core
+
+PROGRESS.finish
+if $failed > 0
+  printf "not ok/test: %d failed %d\n", $ntest, $failed
+else
+  printf "end of test(test: %d)\n", $ntest
+end
diff --git a/benchmark/README.md b/benchmark/README.md
new file mode 100644
index 0000000000..e11381cad9
--- /dev/null
+++ b/benchmark/README.md
@@ -0,0 +1,74 @@
+# ruby/benchmark
+
+This directory has benchmark definitions to be run with
+[benchmark\_driver.gem](https://github.com/benchmark-driver/benchmark-driver).
+
+## Normal usage
+
+Execute `gem install benchmark_driver` and run a command like:
+
+```bash
+# Run a benchmark script with the ruby in the $PATH
+benchmark-driver benchmark/app_fib.rb
+
+# Run benchmark scripts with multiple Ruby executables or options
+benchmark-driver benchmark/*.rb -e /path/to/ruby -e '/path/to/ruby --jit'
+
+# Or compare Ruby versions managed by rbenv
+benchmark-driver benchmark/*.rb --rbenv '2.5.1;2.6.0-preview2 --jit'
+
+# You can collect many metrics in many ways
+benchmark-driver benchmark/*.rb --runner memory --output markdown
+
+# Some are defined with YAML for complex setup or accurate measurement
+benchmark-driver benchmark/*.yml
+```
+
+See also:
+
+```console
+Usage: benchmark-driver [options] RUBY|YAML...
+    -r, --runner TYPE                Specify runner type: ips, time, memory, once, block (default: ips)
+    -o, --output TYPE                Specify output type: compare, simple, markdown, record, all (default: compare)
+    -e, --executables EXECS          Ruby executables (e1::path1 arg1; e2::path2 arg2;...)
+        --rbenv VERSIONS             Ruby executables in rbenv (x.x.x arg1;y.y.y arg2;...)
+        --repeat-count NUM           Try benchmark NUM times and use the fastest result or the worst memory usage
+        --repeat-result TYPE         Yield "best", "average" or "worst" result with --repeat-count (default: best)
+        --alternate                  Alternate executables instead of running the same executable in a row with --repeat-count
+        --bundler                    Install and use gems specified in Gemfile
+        --filter REGEXP              Filter out benchmarks with given regexp
+        --run-duration SECONDS       Warmup estimates loop_count to run for this duration (default: 3)
+        --timeout SECONDS            Timeout ruby command execution with timeout(1)
+    -v, --verbose                    Verbose mode. Multiple -v options increase visilibity (max: 2)
+```
+
+## make benchmark
+
+Using `make benchmark`, `make update-benchmark-driver` automatically downloads
+the supported version of benchmark\_driver, and it runs benchmarks with the downloaded
+benchmark\_driver.
+
+```bash
+# Run all benchmarks with the ruby in the $PATH and the built ruby
+make benchmark
+
+# Or compare with specific ruby binary
+make benchmark COMPARE_RUBY="/path/to/ruby --jit"
+
+# Run vm benchmarks
+make benchmark ITEM=vm
+
+# Run some limited benchmarks in ITEM-matched files
+make benchmark ITEM=vm OPTS=--filter=block
+
+# You can specify the benchmark by an exact filename instead of using the default argument:
+# ARGS = $$(find $(srcdir)/benchmark -maxdepth 1 -name '*$(ITEM)*.yml' -o -name '*$(ITEM)*.rb')
+make benchmark ARGS=benchmark/erb_render.yml
+
+# You can specify any option via $OPTS
+make benchmark OPTS="--help"
+
+# With `make benchmark`, some special runner plugins are available:
+#   -r peak, -r size, -r total, -r utime, -r stime, -r cutime, -r cstime
+make benchmark ITEM=vm_bigarray OPTS="-r peak"
+```
diff --git a/benchmark/bm_app_answer.rb b/benchmark/app_answer.rb
index 3cd8a8fd37..3cd8a8fd37 100644
--- a/benchmark/bm_app_answer.rb
+++ b/benchmark/app_answer.rb
diff --git a/benchmark/app_aobench.rb b/benchmark/app_aobench.rb
new file mode 100644
index 0000000000..16296af12b
--- /dev/null
+++ b/benchmark/app_aobench.rb
@@ -0,0 +1,297 @@
+# coding: US-ASCII
+
+# AO render benchmark
+# Original program (C) Syoyo Fujita in Javascript (and other languages)
+#      https://code.google.com/p/aobench/
+# Ruby(yarv2llvm) version by Hideki Miura
+#
+
+IMAGE_WIDTH = 256
+IMAGE_HEIGHT = 256
+NSUBSAMPLES = 2
+NAO_SAMPLES = 8
+
+srand(0)
+
+class Vec
+  def initialize(x, y, z)
+    @x = x
+    @y = y
+    @z = z
+  end
+
+  attr_accessor :x, :y, :z
+
+  def vadd(b)
+    Vec.new(@x + b.x, @y + b.y, @z + b.z)
+  end
+
+  def vsub(b)
+    Vec.new(@x - b.x, @y - b.y, @z - b.z)
+  end
+
+  def vcross(b)
+    Vec.new(@y * b.z - @z * b.y,
+            @z * b.x - @x * b.z,
+            @x * b.y - @y * b.x)
+  end
+
+  def vdot(b)
+    @x * b.x + @y * b.y + @z * b.z
+  end
+
+  def vlength
+    Math.sqrt(@x * @x + @y * @y + @z * @z)
+  end
+
+  def vnormalize
+    len = vlength
+    v = Vec.new(@x, @y, @z)
+    if len > 1.0e-17 then
+      v.x = v.x / len
+      v.y = v.y / len
+      v.z = v.z / len
+    end
+    v
+  end
+end
+
+
+class Sphere
+  def initialize(center, radius)
+    @center = center
+    @radius = radius
+  end
+
+  attr_reader :center, :radius
+
+  def intersect(ray, isect)
+    rs = ray.org.vsub(@center)
+    b = rs.vdot(ray.dir)
+    c = rs.vdot(rs) - (@radius * @radius)
+    d = b * b - c
+    if d > 0.0 then
+      t = - b - Math.sqrt(d)
+
+      if t > 0.0 and t < isect.t then
+        isect.t = t
+        isect.hit = true
+        isect.pl = Vec.new(ray.org.x + ray.dir.x * t,
+                          ray.org.y + ray.dir.y * t,
+                          ray.org.z + ray.dir.z * t)
+        n = isect.pl.vsub(@center)
+        isect.n = n.vnormalize
+      else
+        0.0
+      end
+    end
+    nil
+  end
+end
+
+class Plane
+  def initialize(p, n)
+    @p = p
+    @n = n
+  end
+
+  def intersect(ray, isect)
+    d = -@p.vdot(@n)
+    v = ray.dir.vdot(@n)
+    v0 = v
+    if v < 0.0 then
+      v0 = -v
+    end
+    if v0 < 1.0e-17 then
+      return
+    end
+
+    t = -(ray.org.vdot(@n) + d) / v
+
+    if t > 0.0 and t < isect.t then
+      isect.hit = true
+      isect.t = t
+      isect.n = @n
+      isect.pl = Vec.new(ray.org.x + t * ray.dir.x,
+                        ray.org.y + t * ray.dir.y,
+                        ray.org.z + t * ray.dir.z)
+    end
+    nil
+  end
+end
+
+class Ray
+  def initialize(org, dir)
+    @org = org
+    @dir = dir
+  end
+
+  attr_accessor :org, :dir
+end
+
+class Isect
+  def initialize
+    @t = 10000000.0
+    @hit = false
+    @pl = Vec.new(0.0, 0.0, 0.0)
+    @n = Vec.new(0.0, 0.0, 0.0)
+  end
+
+  attr_accessor :t, :hit, :pl, :n
+end
+
+def clamp(f)
+  i = f * 255.5
+  if i > 255.0 then
+    i = 255.0
+  end
+  if i < 0.0 then
+    i = 0.0
+  end
+  i.to_i
+end
+
+def otherBasis(basis, n)
+  basis[2] = Vec.new(n.x, n.y, n.z)
+  basis[1] = Vec.new(0.0, 0.0, 0.0)
+
+  if n.x < 0.6 and n.x > -0.6 then
+    basis[1].x = 1.0
+  elsif n.y < 0.6 and n.y > -0.6 then
+    basis[1].y = 1.0
+  elsif n.z < 0.6 and n.z > -0.6 then
+    basis[1].z = 1.0
+  else
+    basis[1].x = 1.0
+  end
+
+  basis[0] = basis[1].vcross(basis[2])
+  basis[0] = basis[0].vnormalize
+
+  basis[1] = basis[2].vcross(basis[0])
+  basis[1] = basis[1].vnormalize
+end
+
+class Scene
+  def initialize
+    @spheres = Array.new
+    @spheres[0] = Sphere.new(Vec.new(-2.0, 0.0, -3.5), 0.5)
+    @spheres[1] = Sphere.new(Vec.new(-0.5, 0.0, -3.0), 0.5)
+    @spheres[2] = Sphere.new(Vec.new(1.0, 0.0, -2.2), 0.5)
+    @plane = Plane.new(Vec.new(0.0, -0.5, 0.0), Vec.new(0.0, 1.0, 0.0))
+  end
+
+  def ambient_occlusion(isect)
+    basis = Array.new
+    otherBasis(basis, isect.n)
+
+    ntheta    = NAO_SAMPLES
+    nphi      = NAO_SAMPLES
+    eps       = 0.0001
+    occlusion = 0.0
+
+    p0 = Vec.new(isect.pl.x + eps * isect.n.x,
+                isect.pl.y + eps * isect.n.y,
+                isect.pl.z + eps * isect.n.z)
+    nphi.times do |j|
+      ntheta.times do |i|
+        r = rand
+        phi = 2.0 * 3.14159265 * rand
+        x = Math.cos(phi) * Math.sqrt(1.0 - r)
+        y = Math.sin(phi) * Math.sqrt(1.0 - r)
+        z = Math.sqrt(r)
+
+        rx = x * basis[0].x + y * basis[1].x + z * basis[2].x
+        ry = x * basis[0].y + y * basis[1].y + z * basis[2].y
+        rz = x * basis[0].z + y * basis[1].z + z * basis[2].z
+
+        raydir = Vec.new(rx, ry, rz)
+        ray = Ray.new(p0, raydir)
+
+        occisect = Isect.new
+        @spheres[0].intersect(ray, occisect)
+        @spheres[1].intersect(ray, occisect)
+        @spheres[2].intersect(ray, occisect)
+        @plane.intersect(ray, occisect)
+        if occisect.hit then
+          occlusion = occlusion + 1.0
+        else
+          0.0
+        end
+      end
+    end
+
+    occlusion = (ntheta.to_f * nphi.to_f - occlusion) / (ntheta.to_f * nphi.to_f)
+
+    Vec.new(occlusion, occlusion, occlusion)
+  end
+
+  def render(w, h, nsubsamples)
+    cnt = 0
+    nsf = nsubsamples.to_f
+    h.times do |y|
+      w.times do |x|
+        rad = Vec.new(0.0, 0.0, 0.0)
+
+        # Subsampling
+        nsubsamples.times do |v|
+          nsubsamples.times do |u|
+
+            cnt = cnt + 1
+            wf = w.to_f
+            hf = h.to_f
+            xf = x.to_f
+            yf = y.to_f
+            uf = u.to_f
+            vf = v.to_f
+
+            px = (xf + (uf / nsf) - (wf / 2.0)) / (wf / 2.0)
+            py = -(yf + (vf / nsf) - (hf / 2.0)) / (hf / 2.0)
+
+            eye = Vec.new(px, py, -1.0).vnormalize
+
+            ray = Ray.new(Vec.new(0.0, 0.0, 0.0), eye)
+
+            isect = Isect.new
+            @spheres[0].intersect(ray, isect)
+            @spheres[1].intersect(ray, isect)
+            @spheres[2].intersect(ray, isect)
+            @plane.intersect(ray, isect)
+            if isect.hit then
+              col = ambient_occlusion(isect)
+              rad.x = rad.x + col.x
+              rad.y = rad.y + col.y
+              rad.z = rad.z + col.z
+            end
+          end
+        end
+
+        r = rad.x / (nsf * nsf)
+        g = rad.y / (nsf * nsf)
+        b = rad.z / (nsf * nsf)
+        printf("%c", clamp(r))
+        printf("%c", clamp(g))
+        printf("%c", clamp(b))
+      end
+      nil
+    end
+
+    nil
+  end
+end
+
+alias printf_orig printf
+def printf *args
+  # $fp.printf(*args)
+end
+
+# File.open("ao.ppm", "w") do |fp|
+  # $fp = fp
+  printf("P6\n")
+  printf("%d %d\n", IMAGE_WIDTH, IMAGE_HEIGHT)
+  printf("255\n")
+  Scene.new.render(IMAGE_WIDTH, IMAGE_HEIGHT, NSUBSAMPLES)
+# end
+
+undef printf
+alias printf printf_orig
diff --git a/benchmark/app_erb.yml b/benchmark/app_erb.yml
new file mode 100644
index 0000000000..31e29b7644
--- /dev/null
+++ b/benchmark/app_erb.yml
@@ -0,0 +1,23 @@
+#
+# Create many HTML strings with ERB.
+#
+prelude: |
+  require 'erb'
+
+  data = <<erb
+  <html>
+    <head> <%= title %> </head>
+    <body>
+      <h1> <%= title %> </h1>
+      <p>
+        <%= content %>
+      </p>
+    </body>
+  </html>
+  erb
+
+  title = "hello world!"
+  content = "hello world!\n" * 10
+benchmark:
+  app_erb: ERB.new(data).result(binding)
+loop_count: 15000
diff --git a/benchmark/bm_app_factorial.rb b/benchmark/app_factorial.rb
index 45f471dfdb..45f471dfdb 100644
--- a/benchmark/bm_app_factorial.rb
+++ b/benchmark/app_factorial.rb
diff --git a/benchmark/bm_app_fib.rb b/benchmark/app_fib.rb
index 34a7b2e725..34a7b2e725 100644
--- a/benchmark/bm_app_fib.rb
+++ b/benchmark/app_fib.rb
diff --git a/benchmark/app_lc_fizzbuzz.rb b/benchmark/app_lc_fizzbuzz.rb
new file mode 100644
index 0000000000..f09574bbeb
--- /dev/null
+++ b/benchmark/app_lc_fizzbuzz.rb
@@ -0,0 +1,52 @@
+#
+# FizzBuzz program using only lambda calculus
+#
+# This program is quoted from
+#   "Understanding Computation" by Tom Stuart
+#   http://computationbook.com/
+#
+# You can understand why this program works fine by reading this book.
+#
+
+solution = -> k { -> f { -> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> l { -> x { -> g { -> b { b }[-> p { p[-> x { -> y { x } }] }[l]][x][-> y { g[f[-> l { -> p { p[-> x { -> y { y } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][x][g]][-> l { -> p { p[-> x { -> y { x } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][y] }] } } } }][k][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> l { -> x { -> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[l][f[x]] } }] } }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[m][n]][-> x { -> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[f[-> n { -> p { -> x { p[n[p][x]] } } }[m]][n]][m][x] }][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]] } } }][-> p { -> x { p[x] } }][-> p { -> x { p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[x]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]] } }]][-> n { -> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[x]]]]]]]]]]]]]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[x]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> n { -> l { -> x { -> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> l { -> x { -> g { -> b { b }[-> p { p[-> x { -> y { x } }] }[l]][x][-> y { g[f[-> l { -> p { p[-> x { -> y { y } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][x][g]][-> l { -> p { p[-> x { -> y { x } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][y] }] } } } }][l][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][x]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }] } }[-> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> x { f[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { -> n { -> p { -> x { p[n[p][x]] } } }[f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n]][x] }][-> p { -> x { x } }] } } }][n][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][x] }]][-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]] } }][n]]]] }]
+
+FIRST     = -> l { LEFT[RIGHT[l]] }
+IF        = -> b { b }
+LEFT      = -> p { p[-> x { -> y { x } } ] }
+RIGHT     = -> p { p[-> x { -> y { y } } ] }
+IS_EMPTY  = LEFT
+REST      = -> l { RIGHT[RIGHT[l]] }
+
+def to_integer(proc)
+  proc[-> n { n + 1 }][0]
+end
+
+def to_boolean(proc)
+  IF[proc][true][false]
+end
+
+def to_array(proc)
+  array = []
+
+  until to_boolean(IS_EMPTY[proc])
+    array.push(FIRST[proc])
+    proc = REST[proc]
+  end
+
+  array
+end
+
+def to_char(c)
+  '0123456789BFiuz'.slice(to_integer(c))
+end
+
+def to_string(s)
+  to_array(s).map { |c| to_char(c) }.join
+end
+
+answer = to_array(solution).map do |p|
+  to_string(p)
+end
+
+answer_ary = answer.to_a
+# puts answer_ary
diff --git a/benchmark/bm_app_mandelbrot.rb b/benchmark/app_mandelbrot.rb
index 801b75e8e2..801b75e8e2 100644
--- a/benchmark/bm_app_mandelbrot.rb
+++ b/benchmark/app_mandelbrot.rb
diff --git a/benchmark/app_pentomino.rb b/benchmark/app_pentomino.rb
new file mode 100644
index 0000000000..47be7b203f
--- /dev/null
+++ b/benchmark/app_pentomino.rb
@@ -0,0 +1,130 @@
+#!/usr/local/bin/ruby
+# This program is contributed by Shin Nishiyama
+
+
+# modified by K.Sasada
+
+NP = 5
+ROW = 8 + NP
+COL = 8
+
+$p = []
+$b = []
+$no = 0
+
+def piece(n, a, nb)
+  nb.each{|x|
+    a[n] = x
+    if n == NP-1
+      $p << [a.sort]
+    else
+      nbc=nb.dup
+      [-ROW, -1, 1, ROW].each{|d|
+        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
+          nbc << x+d
+        end
+      }
+      nbc.delete x
+      piece(n+1,a[0..n],nbc)
+    end
+  }
+end
+
+def kikaku(a)
+  a.collect {|x| x - a[0]}
+end
+def ud(a)
+  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
+end
+def rl(a)
+  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
+end
+def xy(a)
+  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
+end
+
+def mkpieces
+  piece(0,[],[0])
+  $p.each do |a|
+    a0 = a[0]
+    a[1] = ud(a0)
+    a[2] = rl(a0)
+    a[3] = ud(rl(a0))
+    a[4] = xy(a0)
+    a[5] = ud(xy(a0))
+    a[6] = rl(xy(a0))
+    a[7] = ud(rl(xy(a0)))
+    a.sort!
+    a.uniq!
+  end
+  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
+end
+
+def mkboard
+  (0...ROW*COL).each{|i|
+    if i % ROW >= ROW-NP
+      $b[i] = -2
+    else
+      $b[i] = -1
+    end
+    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
+  }
+end
+
+def pboard
+  return # skip print
+  print "No. #$no\n"
+  (0...COL).each{|i|
+    print "|"
+    (0...ROW-NP).each{|j|
+      x = $b[i*ROW+j]
+      if x < 0
+        print "..|"
+      else
+        printf "%2d|",x+1
+      end
+    }
+    print "\n"
+  }
+  print "\n"
+end
+
+$pnum=[]
+def setpiece(a,pos)
+  if a.length == $p.length then
+    $no += 1
+    pboard
+    return
+  end
+  while $b[pos] != -1
+    pos += 1
+  end
+  ($pnum - a).each do |i|
+    $p[i].each do |x|
+      f = 0
+      x.each{|s|
+        if $b[pos+s] != -1
+          f=1
+          break
+        end
+      }
+      if f == 0 then
+        x.each{|s|
+          $b[pos+s] = i
+        }
+        a << i
+        setpiece(a.dup, pos)
+        a.pop
+        x.each{|s|
+          $b[pos+s] = -1
+        }
+      end
+    end
+  end
+end
+
+mkpieces
+mkboard
+$p[4] = [$p[4][0]]
+$pnum = (0...$p.length).to_a
+setpiece([],0)
diff --git a/benchmark/bm_app_raise.rb b/benchmark/app_raise.rb
index 5db8f95d50..5db8f95d50 100644
--- a/benchmark/bm_app_raise.rb
+++ b/benchmark/app_raise.rb
diff --git a/benchmark/bm_app_strconcat.rb b/benchmark/app_strconcat.rb
index 7eed7c1aed..7eed7c1aed 100644
--- a/benchmark/bm_app_strconcat.rb
+++ b/benchmark/app_strconcat.rb
diff --git a/benchmark/bm_app_tak.rb b/benchmark/app_tak.rb
index efe5380f4e..efe5380f4e 100644
--- a/benchmark/bm_app_tak.rb
+++ b/benchmark/app_tak.rb
diff --git a/benchmark/bm_app_tarai.rb b/benchmark/app_tarai.rb
index 4c146f5ccf..4c146f5ccf 100644
--- a/benchmark/bm_app_tarai.rb
+++ b/benchmark/app_tarai.rb
diff --git a/benchmark/bm_app_uri.rb b/benchmark/app_uri.rb
index 586edfd5dc..586edfd5dc 100644
--- a/benchmark/bm_app_uri.rb
+++ b/benchmark/app_uri.rb
diff --git a/benchmark/array_flatten.yml b/benchmark/array_flatten.yml
new file mode 100644
index 0000000000..88ef544ba0
--- /dev/null
+++ b/benchmark/array_flatten.yml
@@ -0,0 +1,19 @@
+prelude: |
+  small_flat_ary = 5.times.to_a
+  large_flat_ary = 100.times.to_a
+  small_pairs_ary = [[1, 2]] * 5
+  large_pairs_ary = [[1, 2]] * 100
+  mostly_flat_ary = 100.times.to_a.push([101, 102])
+
+benchmark:
+  small_flat_ary.flatten: small_flat_ary.flatten
+  small_flat_ary.flatten!: small_flat_ary.flatten!
+  large_flat_ary.flatten: large_flat_ary.flatten
+  large_flat_ary.flatten!: large_flat_ary.flatten!
+  small_pairs_ary.flatten: small_pairs_ary.flatten
+  small_pairs_ary.flatten!: small_pairs_ary.dup.flatten!
+  large_pairs_ary.flatten: large_pairs_ary.flatten
+  large_pairs_ary.flatten!: large_pairs_ary.dup.flatten!
+  mostly_flat_ary.flatten: mostly_flat_ary.flatten
+  mostly_flat_ary.flatten!: mostly_flat_ary.dup.flatten!
+loop_count: 10000
diff --git a/benchmark/array_intersection.yml b/benchmark/array_intersection.yml
new file mode 100644
index 0000000000..26705323fd
--- /dev/null
+++ b/benchmark/array_intersection.yml
@@ -0,0 +1,14 @@
+prelude: |
+  small1 = [1, 2, 3]
+  small2 = [1, 2, 3, 4, 5]
+  small3 = [2, 3, 4, 5]
+  small4 = [2]
+  big1 = [1, 2, 3, 4] * 64
+  big2 = [1, 2, 3] * 64
+  big3 = [1, 2] * 64
+
+benchmark:
+  small-&: small1 & small2 & small3 & small4
+  small-intersection: small1.intersection(small2, small3, small4)
+  big-&: big1 & big2 & big3
+  big-intersection: big1.intersection(big2, big3)
diff --git a/benchmark/array_max_float.yml b/benchmark/array_max_float.yml
new file mode 100644
index 0000000000..ace1ae2e14
--- /dev/null
+++ b/benchmark/array_max_float.yml
@@ -0,0 +1,30 @@
+prelude: |
+  ary2 = 2.times.map(&:to_f).shuffle
+  ary10 = 10.times.map(&:to_f).shuffle
+  ary100 = 100.times.map(&:to_f).shuffle
+  ary500 = 500.times.map(&:to_f).shuffle
+  ary1000 = 1000.times.map(&:to_f).shuffle
+  ary2000 = 2500.times.map(&:to_f).shuffle
+  ary3000 = 2500.times.map(&:to_f).shuffle
+  ary5000 = 5000.times.map(&:to_f).shuffle
+  ary10000 = 10000.times.map(&:to_f).shuffle
+  ary20000 = 20000.times.map(&:to_f).shuffle
+  ary50000 = 50000.times.map(&:to_f).shuffle
+  ary100000 = 100000.times.map(&:to_f).shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+
+loop_count: 10000
+
diff --git a/benchmark/array_max_int.yml b/benchmark/array_max_int.yml
new file mode 100644
index 0000000000..acd83684d0
--- /dev/null
+++ b/benchmark/array_max_int.yml
@@ -0,0 +1,31 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary500 = 500.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary2000 = 2500.times.to_a.shuffle
+  ary3000 = 2500.times.to_a.shuffle
+  ary5000 = 5000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+  ary20000 = 20000.times.to_a.shuffle
+  ary50000 = 50000.times.to_a.shuffle
+  ary100000 = 100000.times.to_a.shuffle
+  ary1000000 = 1000000.times.to_a.shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+  ary1000000.max: ary1000000.max
+
+loop_count: 10000
diff --git a/benchmark/array_max_str.yml b/benchmark/array_max_str.yml
new file mode 100644
index 0000000000..2aeed010f2
--- /dev/null
+++ b/benchmark/array_max_str.yml
@@ -0,0 +1,30 @@
+prelude: |
+  ary2 = 2.times.map(&:to_s).shuffle
+  ary10 = 10.times.map(&:to_s).shuffle
+  ary100 = 100.times.map(&:to_s).shuffle
+  ary500 = 500.times.map(&:to_s).shuffle
+  ary1000 = 1000.times.map(&:to_s).shuffle
+  ary2000 = 2500.times.map(&:to_s).shuffle
+  ary3000 = 2500.times.map(&:to_s).shuffle
+  ary5000 = 5000.times.map(&:to_s).shuffle
+  ary10000 = 10000.times.map(&:to_s).shuffle
+  ary20000 = 20000.times.map(&:to_s).shuffle
+  ary50000 = 50000.times.map(&:to_s).shuffle
+  ary100000 = 100000.times.map(&:to_s).shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+
+loop_count: 10000
+
diff --git a/benchmark/array_min.yml b/benchmark/array_min.yml
new file mode 100644
index 0000000000..53e5072b14
--- /dev/null
+++ b/benchmark/array_min.yml
@@ -0,0 +1,31 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary500 = 500.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary2000 = 2500.times.to_a.shuffle
+  ary3000 = 2500.times.to_a.shuffle
+  ary5000 = 5000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+  ary20000 = 20000.times.to_a.shuffle
+  ary50000 = 50000.times.to_a.shuffle
+  ary100000 = 100000.times.to_a.shuffle
+  ary1000000 = 1000000.times.to_a.shuffle
+
+benchmark:
+  ary2.min: ary2.min
+  ary10.min: ary10.min
+  ary100.min: ary100.min
+  ary500.min: ary500.min
+  ary1000.min: ary1000.min
+  ary2000.min: ary2000.min
+  ary3000.min: ary3000.min
+  ary5000.min: ary5000.min
+  ary10000.min: ary10000.min
+  ary20000.min: ary20000.min
+  ary50000.min: ary50000.min
+  ary100000.min: ary100000.min
+  ary1000000.min: ary1000000.min
+
+loop_count: 10000
diff --git a/benchmark/array_sample.yml b/benchmark/array_sample.yml
new file mode 100644
index 0000000000..1cd2b34794
--- /dev/null
+++ b/benchmark/array_sample.yml
@@ -0,0 +1,4 @@
+prelude: ary = (1..10_000).to_a
+benchmark:
+  - ary.sample
+  - ary.sample(2)
diff --git a/benchmark/array_sample_100k_10.rb b/benchmark/array_sample_100k_10.rb
new file mode 100644
index 0000000000..5f41ecc32b
--- /dev/null
+++ b/benchmark/array_sample_100k_10.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 10}
diff --git a/benchmark/array_sample_100k_11.rb b/benchmark/array_sample_100k_11.rb
new file mode 100644
index 0000000000..18b1715319
--- /dev/null
+++ b/benchmark/array_sample_100k_11.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 11}
diff --git a/benchmark/array_sample_100k__100.rb b/benchmark/array_sample_100k__100.rb
new file mode 100644
index 0000000000..22863afe89
--- /dev/null
+++ b/benchmark/array_sample_100k__100.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 100}
diff --git a/benchmark/array_sample_100k__1k.rb b/benchmark/array_sample_100k__1k.rb
new file mode 100644
index 0000000000..4cd79e6c67
--- /dev/null
+++ b/benchmark/array_sample_100k__1k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 1000}
diff --git a/benchmark/array_sample_100k__6k.rb b/benchmark/array_sample_100k__6k.rb
new file mode 100644
index 0000000000..b3d264249e
--- /dev/null
+++ b/benchmark/array_sample_100k__6k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 6000}
diff --git a/benchmark/array_sample_100k___10k.rb b/benchmark/array_sample_100k___10k.rb
new file mode 100644
index 0000000000..5dd55ec058
--- /dev/null
+++ b/benchmark/array_sample_100k___10k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 10_000}
diff --git a/benchmark/array_sample_100k___50k.rb b/benchmark/array_sample_100k___50k.rb
new file mode 100644
index 0000000000..1506732c3c
--- /dev/null
+++ b/benchmark/array_sample_100k___50k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 50_000}
diff --git a/benchmark/array_shift.rb b/benchmark/array_shift.rb
new file mode 100644
index 0000000000..798bb9e3f4
--- /dev/null
+++ b/benchmark/array_shift.rb
@@ -0,0 +1,14 @@
+require 'benchmark'
+
+Benchmark.bm do |x|
+  [10_000,1_000_000,100_000_000].each do |n|
+    ary = Array.new(n,0)
+    GC.start
+    x.report("#{n}:shift"){ ary.shift }
+    (0..4).each do |i|
+      ary = Array.new(n,0)
+      GC.start
+      x.report("#{n}:shift(#{i})"){ ary.shift(i) }
+    end
+  end
+end
diff --git a/benchmark/array_small_and.rb b/benchmark/array_small_and.rb
new file mode 100644
index 0000000000..e53a6edae6
--- /dev/null
+++ b/benchmark/array_small_and.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 & arr2
+    end
+  end
+end
diff --git a/benchmark/array_small_diff.rb b/benchmark/array_small_diff.rb
new file mode 100644
index 0000000000..9661ee48db
--- /dev/null
+++ b/benchmark/array_small_diff.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 - arr2
+    end
+  end
+end
diff --git a/benchmark/array_small_or.rb b/benchmark/array_small_or.rb
new file mode 100644
index 0000000000..c58b5fd1ff
--- /dev/null
+++ b/benchmark/array_small_or.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 | arr2
+    end
+  end
+end
diff --git a/benchmark/array_sort_block.rb b/benchmark/array_sort_block.rb
new file mode 100644
index 0000000000..3579786056
--- /dev/null
+++ b/benchmark/array_sort_block.rb
@@ -0,0 +1,2 @@
+ary = Array.new(1000) { rand(1000) }
+10000.times { ary.sort { |a, b| a <=> b } }
diff --git a/benchmark/array_sort_float.rb b/benchmark/array_sort_float.rb
new file mode 100644
index 0000000000..9a6e2f8bd2
--- /dev/null
+++ b/benchmark/array_sort_float.rb
@@ -0,0 +1,2 @@
+arr = Array.new(1000) { rand }
+10000.times { arr.sort }
diff --git a/benchmark/array_sort_int.yml b/benchmark/array_sort_int.yml
new file mode 100644
index 0000000000..7b9027ebf7
--- /dev/null
+++ b/benchmark/array_sort_int.yml
@@ -0,0 +1,15 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+
+benchmark:
+  ary2.sort: ary2.sort
+  ary10.sort: ary10.sort
+  ary100.sort: ary100.sort
+  ary1000.sort: ary1000.sort
+  ary10000.sort: ary10000.sort
+
+loop_count: 10000
diff --git a/benchmark/array_values_at_int.rb b/benchmark/array_values_at_int.rb
new file mode 100644
index 0000000000..6cb394cb9f
--- /dev/null
+++ b/benchmark/array_values_at_int.rb
@@ -0,0 +1,2 @@
+ary = Array.new(10000) {|i| i}
+100000.times { ary.values_at(500) }
diff --git a/benchmark/array_values_at_range.rb b/benchmark/array_values_at_range.rb
new file mode 100644
index 0000000000..5b53806d1c
--- /dev/null
+++ b/benchmark/array_values_at_range.rb
@@ -0,0 +1,2 @@
+ary = Array.new(10000) {|i| i}
+100000.times { ary.values_at(1..2000) }
diff --git a/benchmark/attr_accessor.yml b/benchmark/attr_accessor.yml
new file mode 100644
index 0000000000..82134cdf9b
--- /dev/null
+++ b/benchmark/attr_accessor.yml
@@ -0,0 +1,29 @@
+prelude: |
+  class C
+    attr_accessor :x
+    def initialize
+      @x = nil
+    end
+    class_eval <<-END
+      def ar
+        #{'x;'*256}
+      end
+      def aw
+        #{'self.x = nil;'*256}
+      end
+      def arm
+        m = method(:x)
+        #{'m.call;'*256}
+      end
+      def awm
+        m = method(:x=)
+        #{'m.call(nil);'*256}
+      end
+    END
+  end
+  obj = C.new
+benchmark:
+  attr_reader: "obj.ar"
+  attr_writer: "obj.aw"
+  attr_reader_method: "obj.arm"
+  attr_writer_method: "obj.awm"
diff --git a/benchmark/bighash.rb b/benchmark/bighash.rb
new file mode 100644
index 0000000000..e2ad5a5c94
--- /dev/null
+++ b/benchmark/bighash.rb
@@ -0,0 +1 @@
+h = {}; 5000000.times {|n| h[n] = n }
diff --git a/benchmark/bm_app_aobench.rb b/benchmark/bm_app_aobench.rb
deleted file mode 100644
index 807349089f..0000000000
--- a/benchmark/bm_app_aobench.rb
+++ /dev/null
@@ -1,292 +0,0 @@
-# AO rebder benchmark
-# Original program (C) Syoyo Fujita in Javascript (and other languages)
-#      http://lucille.atso-net.jp/blog/?p=642
-#      http://lucille.atso-net.jp/blog/?p=711
-# Ruby(yarv2llvm) version by Hideki Miura
-#
-
-IMAGE_WIDTH = 256
-IMAGE_HEIGHT = 256
-NSUBSAMPLES = 2
-NAO_SAMPLES = 8
-
-class Vec
-  def initialize(x, y, z)
-    @x = x
-    @y = y
-    @z = z
-  end
-
-  attr_accessor :x, :y, :z
-
-  def vadd(b)
-    Vec.new(@x + b.x, @y + b.y, @z + b.z)
-  end
-
-  def vsub(b)
-    Vec.new(@x - b.x, @y - b.y, @z - b.z)
-  end
-
-  def vcross(b)
-    Vec.new(@y * b.z - @z * b.y,
-            @z * b.x - @x * b.z,
-            @x * b.y - @y * b.x)
-  end
-
-  def vdot(b)
-    @x * b.x + @y * b.y + @z * b.z
-  end
-
-  def vlength
-    Math.sqrt(@x * @x + @y * @y + @z * @z)
-  end
-
-  def vnormalize
-    len = vlength
-    v = Vec.new(@x, @y, @z)
-    if len > 1.0e-17 then
-      v.x = v.x / len
-      v.y = v.y / len
-      v.z = v.z / len
-    end
-    v
-  end
-end
-
-
-class Sphere
-  def initialize(center, radius)
-    @center = center
-    @radius = radius
-  end
-
-  attr_reader :center, :radius
-
-  def intersect(ray, isect)
-    rs = ray.org.vsub(@center)
-    b = rs.vdot(ray.dir)
-    c = rs.vdot(rs) - (@radius * @radius)
-    d = b * b - c
-    if d > 0.0 then
-      t = - b - Math.sqrt(d)
-
-      if t > 0.0 and t < isect.t then
-        isect.t = t
-        isect.hit = true
-        isect.pl = Vec.new(ray.org.x + ray.dir.x * t,
-                          ray.org.y + ray.dir.y * t,
-                          ray.org.z + ray.dir.z * t)
-        n = isect.pl.vsub(@center)
-        isect.n = n.vnormalize
-      else
-        0.0
-      end
-    end
-    nil
-  end
-end
-
-class Plane
-  def initialize(p, n)
-    @p = p
-    @n = n
-  end
-
-  def intersect(ray, isect)
-    d = -@p.vdot(@n)
-    v = ray.dir.vdot(@n)
-    v0 = v
-    if v < 0.0 then
-      v0 = -v
-    end
-    if v0 < 1.0e-17 then
-      return
-    end
-
-    t = -(ray.org.vdot(@n) + d) / v
-
-    if t > 0.0 and t < isect.t then
-      isect.hit = true
-      isect.t = t
-      isect.n = @n
-      isect.pl = Vec.new(ray.org.x + t * ray.dir.x,
-                        ray.org.y + t * ray.dir.y,
-                        ray.org.z + t * ray.dir.z)
-    end
-    nil
-  end
-end
-
-class Ray
-  def initialize(org, dir)
-    @org = org
-    @dir = dir
-  end
-
-  attr_accessor :org, :dir
-end
-
-class Isect
-  def initialize
-    @t = 10000000.0
-    @hit = false
-    @pl = Vec.new(0.0, 0.0, 0.0)
-    @n = Vec.new(0.0, 0.0, 0.0)
-  end
-
-  attr_accessor :t, :hit, :pl, :n
-end
-
-def clamp(f)
-  i = f * 255.5
-  if i > 255.0 then
-    i = 255.0
-  end
-  if i < 0.0 then
-    i = 0.0
-  end
-  i.to_i
-end
-
-def otherBasis(basis, n)
-  basis[2] = Vec.new(n.x, n.y, n.z)
-  basis[1] = Vec.new(0.0, 0.0, 0.0)
-
-  if n.x < 0.6 and n.x > -0.6 then
-    basis[1].x = 1.0
-  elsif n.y < 0.6 and n.y > -0.6 then
-    basis[1].y = 1.0
-  elsif n.z < 0.6 and n.z > -0.6 then
-    basis[1].z = 1.0
-  else
-    basis[1].x = 1.0
-  end
-
-  basis[0] = basis[1].vcross(basis[2])
-  basis[0] = basis[0].vnormalize
-
-  basis[1] = basis[2].vcross(basis[0])
-  basis[1] = basis[1].vnormalize
-end
-
-class Scene
-  def initialize
-    @spheres = Array.new
-    @spheres[0] = Sphere.new(Vec.new(-2.0, 0.0, -3.5), 0.5)
-    @spheres[1] = Sphere.new(Vec.new(-0.5, 0.0, -3.0), 0.5)
-    @spheres[2] = Sphere.new(Vec.new(1.0, 0.0, -2.2), 0.5)
-    @plane = Plane.new(Vec.new(0.0, -0.5, 0.0), Vec.new(0.0, 1.0, 0.0))
-  end
-
-  def ambient_occlusion(isect)
-    basis = Array.new
-    otherBasis(basis, isect.n)
-
-    ntheta    = NAO_SAMPLES
-    nphi      = NAO_SAMPLES
-    eps       = 0.0001
-    occlusion = 0.0
-
-    p0 = Vec.new(isect.pl.x + eps * isect.n.x,
-                isect.pl.y + eps * isect.n.y,
-                isect.pl.z + eps * isect.n.z)
-    nphi.times do |j|
-      ntheta.times do |i|
-        r = rand
-        phi = 2.0 * 3.14159265 * rand
-        x = Math.cos(phi) * Math.sqrt(1.0 - r)
-        y = Math.sin(phi) * Math.sqrt(1.0 - r)
-        z = Math.sqrt(r)
-
-        rx = x * basis[0].x + y * basis[1].x + z * basis[2].x
-        ry = x * basis[0].y + y * basis[1].y + z * basis[2].y
-        rz = x * basis[0].z + y * basis[1].z + z * basis[2].z
-
-        raydir = Vec.new(rx, ry, rz)
-        ray = Ray.new(p0, raydir)
-
-        occisect = Isect.new
-        @spheres[0].intersect(ray, occisect)
-        @spheres[1].intersect(ray, occisect)
-        @spheres[2].intersect(ray, occisect)
-        @plane.intersect(ray, occisect)
-        if occisect.hit then
-          occlusion = occlusion + 1.0
-        else
-          0.0
-        end
-      end
-    end
-
-    occlusion = (ntheta.to_f * nphi.to_f - occlusion) / (ntheta.to_f * nphi.to_f)
-
-    Vec.new(occlusion, occlusion, occlusion)
-  end
-
-  def render(w, h, nsubsamples)
-    cnt = 0
-    nsf = nsubsamples.to_f
-    h.times do |y|
-      w.times do |x|
-        rad = Vec.new(0.0, 0.0, 0.0)
-
-        # Subsmpling
-        nsubsamples.times do |v|
-          nsubsamples.times do |u|
-
-            cnt = cnt + 1
-            wf = w.to_f
-            hf = h.to_f
-            xf = x.to_f
-            yf = y.to_f
-            uf = u.to_f
-            vf = v.to_f
-
-            px = (xf + (uf / nsf) - (wf / 2.0)) / (wf / 2.0)
-            py = -(yf + (vf / nsf) - (hf / 2.0)) / (hf / 2.0)
-
-            eye = Vec.new(px, py, -1.0).vnormalize
-
-            ray = Ray.new(Vec.new(0.0, 0.0, 0.0), eye)
-
-            isect = Isect.new
-            @spheres[0].intersect(ray, isect)
-            @spheres[1].intersect(ray, isect)
-            @spheres[2].intersect(ray, isect)
-            @plane.intersect(ray, isect)
-            if isect.hit then
-              col = ambient_occlusion(isect)
-              rad.x = rad.x + col.x
-              rad.y = rad.y + col.y
-              rad.z = rad.z + col.z
-            end
-          end
-        end
-
-        r = rad.x / (nsf * nsf)
-        g = rad.y / (nsf * nsf)
-        b = rad.z / (nsf * nsf)
-        printf("%c", clamp(r))
-        printf("%c", clamp(g))
-        printf("%c", clamp(b))
-      end
-      nil
-    end
-
-    nil
-  end
-end
-
-alias printf_orig printf
-def printf *args
-end
-
-# File.open("ao.ppm", "w") do |fp|
-  printf("P6\n")
-  printf("%d %d\n", IMAGE_WIDTH, IMAGE_HEIGHT)
-  printf("255\n", IMAGE_WIDTH, IMAGE_HEIGHT)
-  Scene.new.render(IMAGE_WIDTH, IMAGE_HEIGHT, NSUBSAMPLES)
-# end
-
-undef printf
-alias printf printf_orig
diff --git a/benchmark/bm_app_erb.rb b/benchmark/bm_app_erb.rb
deleted file mode 100644
index 77c66a7949..0000000000
--- a/benchmark/bm_app_erb.rb
+++ /dev/null
@@ -1,26 +0,0 @@
-#
-# Create many HTML strings with ERB.
-#
-
-require 'erb'
-
-data = DATA.read
-max = 15_000
-title = "hello world!"
-content = "hello world!\n" * 10
-
-max.times{
-  ERB.new(data).result(binding)
-}
-
-__END__
-
-<html>
-  <head> <%= title %> </head>
-  <body>
-    <h1> <%= title %> </h1>
-    <p>
-      <%= content %>
-    </p>
-  </body>
-</html>
diff --git a/benchmark/bm_app_pentomino.rb b/benchmark/bm_app_pentomino.rb
deleted file mode 100644
index 59c63f358e..0000000000
--- a/benchmark/bm_app_pentomino.rb
+++ /dev/null
@@ -1,259 +0,0 @@
-#!/usr/local/bin/ruby
-# This program is contributed by Shin Nishiyama
-
-
-# modified by K.Sasada
-
-NP = 5
-ROW = 8 + NP
-COL = 8
-
-$p = []
-$b = []
-$no = 0
-
-def piece(n, a, nb)
-  nb.each{|x|
-    a[n] = x
-    if n == NP-1
-      $p << [a.sort]
-    else
-      nbc=nb.dup
-      [-ROW, -1, 1, ROW].each{|d|
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
-          nbc << x+d
-        end
-      }
-      nbc.delete x
-      piece(n+1,a[0..n],nbc)
-    end
-  }
-end
-
-def kikaku(a)
-  a.collect {|x| x - a[0]}
-end
-def ud(a)
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
-end
-def rl(a)
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
-end
-def xy(a)
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
-end
-
-def mkpieces
-  piece(0,[],[0])
-  $p.each do |a|
-    a0 = a[0]
-    a[1] = ud(a0)
-    a[2] = rl(a0)
-    a[3] = ud(rl(a0))
-    a[4] = xy(a0)
-    a[5] = ud(xy(a0))
-    a[6] = rl(xy(a0))
-    a[7] = ud(rl(xy(a0)))
-    a.sort!
-    a.uniq!
-  end
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
-end
-
-def mkboard
-  (0...ROW*COL).each{|i|
-    if i % ROW >= ROW-NP
-      $b[i] = -2
-    else
-      $b[i] = -1
-    end
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
-  }
-end
-
-def pboard
-  return # skip print
-  print "No. #$no\n"
-  (0...COL).each{|i|
-    print "|"
-    (0...ROW-NP).each{|j|
-      x = $b[i*ROW+j]
-      if x < 0
-        print "..|"
-      else
-        printf "%2d|",x+1
-      end
-    }
-    print "\n"
-  }
-  print "\n"
-end
-
-$pnum=[]
-def setpiece(a,pos)
-  if a.length == $p.length then
-    $no += 1
-    pboard
-    return
-  end
-  while $b[pos] != -1
-    pos += 1
-  end
-  ($pnum - a).each do |i|
-    $p[i].each do |x|
-      f = 0
-      x.each{|s|
-        if $b[pos+s] != -1
-          f=1
-          break
-        end
-      }
-      if f == 0 then
-        x.each{|s|
-          $b[pos+s] = i
-        }
-        a << i
-        setpiece(a.dup, pos)
-        a.pop
-        x.each{|s|
-          $b[pos+s] = -1
-        }
-      end
-    end
-  end
-end
-
-mkpieces
-mkboard
-$p[4] = [$p[4][0]]
-$pnum = (0...$p.length).to_a
-setpiece([],0)
-
-
-__END__
-
-# original
-
-NP = 5
-ROW = 8 + NP
-COL = 8
-
-$p = []
-$b = []
-$no = 0
-
-def piece(n,a,nb)
-  for x in nb
-    a[n] = x
-    if n == NP-1
-      $p << [a.sort]
-    else
-      nbc=nb.dup
-      for d in [-ROW, -1, 1, ROW]
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
-          nbc << x+d
-        end
-      end
-      nbc.delete x
-      piece(n+1,a[0..n],nbc)
-    end
-  end
-end
-
-def kikaku(a)
-  a.collect {|x| x - a[0]}
-end
-def ud(a)
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
-end
-def rl(a)
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
-end
-def xy(a)
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
-end
-
-def mkpieces
-  piece(0,[],[0])
-  $p.each do |a|
-    a0 = a[0]
-    a[1] = ud(a0)
-    a[2] = rl(a0)
-    a[3] = ud(rl(a0))
-    a[4] = xy(a0)
-    a[5] = ud(xy(a0))
-    a[6] = rl(xy(a0))
-    a[7] = ud(rl(xy(a0)))
-    a.sort!
-    a.uniq!
-  end
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
-end
-
-def mkboard
-  for i in 0...ROW*COL
-    if i % ROW >= ROW-NP
-      $b[i] = -2
-    else
-      $b[i] = -1
-    end
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
-  end
-end
-
-def pboard
-  print "No. #$no\n"
-  for i in 0...COL
-    print "|"
-    for j in 0...ROW-NP
-      x = $b[i*ROW+j]
-      if x < 0
-        print "..|"
-      else
-        printf "%2d|",x+1
-      end
-    end
-    print "\n"
-  end
-  print "\n"
-end
-
-$pnum=[]
-def setpiece(a,pos)
-  if a.length == $p.length then
-    $no += 1
-    pboard
-    return
-  end
-  while $b[pos] != -1
-    pos += 1
-  end
-  ($pnum - a).each do |i|
-    $p[i].each do |x|
-      f = 0
-      for s in x do
-        if $b[pos+s] != -1
-          f=1
-          break
-        end
-      end
-      if f == 0 then
-        for s in x do
-          $b[pos+s] = i
-        end
-        a << i
-        setpiece(a.dup, pos)
-        a.pop
-        for s in x do
-          $b[pos+s] = -1
-        end
-      end
-    end
-  end
-end
-
-mkpieces
-mkboard
-$p[4] = [$p[4][0]]
-$pnum = (0...$p.length).to_a
-setpiece([],0)
diff --git a/benchmark/bm_so_ackermann.rb b/benchmark/bm_so_ackermann.rb
deleted file mode 100644
index 7db5be9050..0000000000
--- a/benchmark/bm_so_ackermann.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: ackermann-ruby.code,v 1.4 2004/11/13 07:40:41 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-def ack(m, n)
-    if m == 0 then
-        n + 1
-    elsif n == 0 then
-        ack(m - 1, 1)
-    else
-        ack(m - 1, ack(m, n - 1))
-    end
-end
-
-NUM = 9
-ack(3, NUM)
-
-
diff --git a/benchmark/bm_so_array.rb b/benchmark/bm_so_array.rb
deleted file mode 100644
index 2b8fce8f99..0000000000
--- a/benchmark/bm_so_array.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: ary-ruby.code,v 1.4 2004/11/13 07:41:27 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Paul Brannan and Mark Hubbart
-
-n = 9000 # Integer(ARGV.shift || 1)
-
-x = Array.new(n)
-y = Array.new(n, 0)
-
-n.times{|bi|
-  x[bi] = bi + 1
-}
-
-(0 .. 999).each do |e|
-  (n-1).step(0,-1) do |bi|
-    y[bi] += x.at(bi)
-  end
-end
-# puts "#{y.first} #{y.last}"
-
-
diff --git a/benchmark/bm_so_concatenate.rb b/benchmark/bm_so_concatenate.rb
deleted file mode 100644
index 873214de7c..0000000000
--- a/benchmark/bm_so_concatenate.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: strcat-ruby.code,v 1.4 2004/11/13 07:43:28 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# based on code from Aristarkh A Zagorodnikov and Dat Nguyen
-
-STUFF = "hello\n"
-i = 0
-while i<10
-  i += 1
-  hello = ''
-  4_000_000.times do |e|
-    hello << STUFF
-  end
-end
-# puts hello.length
-
-
diff --git a/benchmark/bm_so_count_words.rb b/benchmark/bm_so_count_words.rb
deleted file mode 100644
index 65f6337a4a..0000000000
--- a/benchmark/bm_so_count_words.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: wc-ruby.code,v 1.4 2004/11/13 07:43:32 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Paul Brannan
-
-input = open(File.join(File.dirname($0), 'wc.input'), 'rb')
-
-nl = nw = nc = 0
-while true
-  tmp = input.read(4096) or break
-  data = tmp << (input.gets || "")
-  nc += data.length
-  nl += data.count("\n")
-  ((data.strip! || data).tr!("\n", " ") || data).squeeze!
-  nw += data.count(" ") + 1
-end
-# STDERR.puts "#{nl} #{nw} #{nc}"
-
diff --git a/benchmark/bm_so_exception.rb b/benchmark/bm_so_exception.rb
deleted file mode 100644
index deb003a594..0000000000
--- a/benchmark/bm_so_exception.rb
+++ /dev/null
@@ -1,61 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: except-ruby.code,v 1.4 2004/11/13 07:41:33 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-$HI = 0
-$LO = 0
-NUM = 250000 # Integer(ARGV[0] || 1)
-
-
-class Lo_Exception < Exception
-  def initialize(num)
-    @value = num
-  end
-end
-
-class Hi_Exception < Exception
-  def initialize(num)
-    @value = num
-  end
-end
-
-def some_function(num)
-  begin
-    hi_function(num)
-  rescue
-    print "We shouldn't get here, exception is: #{$!.type}\n"
-  end
-end
-
-def hi_function(num)
-  begin
-    lo_function(num)
-  rescue Hi_Exception
-    $HI = $HI + 1
-  end
-end
-
-def lo_function(num)
-  begin
-    blowup(num)
-  rescue Lo_Exception
-    $LO = $LO + 1
-  end
-end
-
-def blowup(num)
-  if num % 2 == 0
-    raise Lo_Exception.new(num)
-  else
-    raise Hi_Exception.new(num)
-  end
-end
-
-
-i = 1
-max = NUM+1
-while i < max
-  i += 1
-  some_function(i+1)
-end
diff --git a/benchmark/bm_so_fasta.rb b/benchmark/bm_so_fasta.rb
deleted file mode 100644
index 3f759ba7ae..0000000000
--- a/benchmark/bm_so_fasta.rb
+++ /dev/null
@@ -1,81 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org/
-# Contributed by Sokolov Yura
-
-$last = 42.0
-def gen_random (max,im=139968,ia=3877,ic=29573)
-    (max * ($last = ($last * ia + ic) % im)) / im
-end
-
-alu =
-   "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
-   "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
-   "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
-   "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
-   "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
-   "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
-   "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
-
-iub = [
-    ["a", 0.27],
-    ["c", 0.12],
-    ["g", 0.12],
-    ["t", 0.27],
-
-    ["B", 0.02],
-    ["D", 0.02],
-    ["H", 0.02],
-    ["K", 0.02],
-    ["M", 0.02],
-    ["N", 0.02],
-    ["R", 0.02],
-    ["S", 0.02],
-    ["V", 0.02],
-    ["W", 0.02],
-    ["Y", 0.02],
-]
-homosapiens = [
-    ["a", 0.3029549426680],
-    ["c", 0.1979883004921],
-    ["g", 0.1975473066391],
-    ["t", 0.3015094502008],
-]
-
-def make_repeat_fasta(id, desc, src, n)
-    puts ">#{id} #{desc}"
-    v = nil
-    width = 60
-    l = src.length
-    s = src * ((n / l) + 1)
-    s.slice!(n, l)
-    puts(s.scan(/.{1,#{width}}/).join("\n"))
-end
-
-def make_random_fasta(id, desc, table, n)
-    puts ">#{id} #{desc}"
-    rand, v = nil,nil
-    width = 60
-    chunk = 1 * width
-    prob = 0.0
-    table.each{|v| v[1]= (prob += v[1])}
-    for i in 1..(n/width)
-        puts((1..width).collect{
-            rand = gen_random(1.0)
-            table.find{|v| v[1]>rand}[0]
-        }.join)
-    end
-    if n%width != 0
-        puts((1..(n%width)).collect{
-            rand = gen_random(1.0)
-            table.find{|v| v[1]>rand}[0]
-        }.join)
-    end
-end
-
-
-n = (ARGV[0] or 250_000).to_i
-
-make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
-make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
-make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
-
diff --git a/benchmark/bm_so_k_nucleotide.rb b/benchmark/bm_so_k_nucleotide.rb
deleted file mode 100644
index dadab3e79c..0000000000
--- a/benchmark/bm_so_k_nucleotide.rb
+++ /dev/null
@@ -1,48 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org
-#
-# contributed by jose fco. gonzalez
-# modified by Sokolov Yura
-
-seq = String.new
-
-def frecuency( seq,length )
-    n, table = seq.length - length + 1, Hash.new(0)
-    f, i = nil, nil
-    (0 ... length).each do |f|
-        (f ... n).step(length) do |i|
-            table[seq[i,length]] += 1
-        end
-    end
-    [n,table]
-
-end
-
-def sort_by_freq( seq,length )
-    n,table = frecuency( seq,length )
-    a, b, v = nil, nil, nil
-    table.sort{|a,b| b[1] <=> a[1]}.each do |v|
-        puts "%s %.3f" % [v[0].upcase,((v[1]*100).to_f/n)]
-    end
-    puts
-end
-
-def find_seq( seq,s )
-    n,table = frecuency( seq,s.length )
-    puts "#{table[s].to_s}\t#{s.upcase}"
-end
-
-input = open(File.join(File.dirname($0), 'fasta.output.100000'), 'rb')
-
-line = input.gets while line !~ /^>THREE/
-line = input.gets
-
-while (line !~ /^>/) & line do
-    seq << line.chomp
-    line = input.gets
-end
-
-[1,2].each {|i| sort_by_freq( seq,i ) }
-
-%w(ggt ggta ggtatt ggtattttaatt ggtattttaatttatagt).each{|s| find_seq( seq,s) }
-
diff --git a/benchmark/bm_so_matrix.rb b/benchmark/bm_so_matrix.rb
deleted file mode 100644
index e2c5c8e559..0000000000
--- a/benchmark/bm_so_matrix.rb
+++ /dev/null
@@ -1,48 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: matrix-ruby.code,v 1.4 2004/11/13 07:42:14 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-n = 60 #Integer(ARGV.shift || 1)
-
-size = 40
-
-def mkmatrix(rows, cols)
-    count = 1
-    mx = Array.new(rows)
-    (0 .. (rows - 1)).each do |bi|
-        row = Array.new(cols, 0)
-        (0 .. (cols - 1)).each do |j|
-            row[j] = count
-            count += 1
-        end
-        mx[bi] = row
-    end
-    mx
-end
-
-def mmult(rows, cols, m1, m2)
-    m3 = Array.new(rows)
-    (0 .. (rows - 1)).each do |bi|
-        row = Array.new(cols, 0)
-        (0 .. (cols - 1)).each do |j|
-            val = 0
-            (0 .. (cols - 1)).each do |k|
-                val += m1.at(bi).at(k) * m2.at(k).at(j)
-            end
-            row[j] = val
-        end
-        m3[bi] = row
-    end
-    m3
-end
-
-m1 = mkmatrix(size, size)
-m2 = mkmatrix(size, size)
-mm = Array.new
-n.times do
-    mm = mmult(size, size, m1, m2)
-end
-# puts "#{mm[0][0]} #{mm[2][3]} #{mm[3][2]} #{mm[4][4]}"
-
-
diff --git a/benchmark/bm_so_meteor_contest.rb b/benchmark/bm_so_meteor_contest.rb
deleted file mode 100644
index 99cf6a91cc..0000000000
--- a/benchmark/bm_so_meteor_contest.rb
+++ /dev/null
@@ -1,564 +0,0 @@
-#!/usr/bin/env ruby
-#
-# The Computer Language Shootout
-#   http://shootout.alioth.debian.org
-#   contributed by Kevin Barnes (Ruby novice)
-
-# PROGRAM:  the main body is at the bottom.
-#   1) read about the problem here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
-#   2) see how I represent a board as a bitmask by reading the blank_board comments
-#   3) read as your mental paths take you
-
-def print *args
-end
-
-# class to represent all information about a particular rotation of a particular piece
-class Rotation
-  # an array (by location) containing a bit mask for how the piece maps at the given location.
-  # if the rotation is invalid at that location the mask will contain false
-  attr_reader :start_masks
-
-  # maps a direction to a relative location.  these differ depending on whether it is an even or
-  # odd row being mapped from
-  @@rotation_even_adder = { :west => -1, :east => 1, :nw => -7, :ne => -6, :sw => 5, :se => 6 }
-  @@rotation_odd_adder = { :west => -1, :east => 1, :nw => -6, :ne => -5, :sw => 6, :se => 7 }
-
-  def initialize( directions )
-    @even_offsets, @odd_offsets = normalize_offsets( get_values( directions ))
-
-    @even_mask = mask_for_offsets( @even_offsets)
-    @odd_mask = mask_for_offsets( @odd_offsets)
-
-    @start_masks = Array.new(60)
-
-    # create the rotational masks by placing the base mask at the location and seeing if
-    # 1) it overlaps the boundries and 2) it produces a prunable board.  if either of these
-    # is true the piece cannot be placed
-    0.upto(59) do | offset |
-      mask = is_even(offset) ? (@even_mask << offset) : (@odd_mask << offset)
-      if (blank_board & mask == 0 && !prunable(blank_board | mask, 0, true)) then
-        imask = compute_required( mask, offset)
-        @start_masks[offset] = [ mask, imask, imask | mask ]
-      else
-        @start_masks[offset] = false
-      end
-    end
-  end
-
-  def compute_required( mask, offset )
-    board = blank_board
-    0.upto(offset) { | i | board |= 1 << i }
-    board |= mask
-    return 0 if (!prunable(board | mask, offset))
-    board = flood_fill(board,58)
-    count = 0
-    imask = 0
-    0.upto(59) do | i |
-      if (board[i] == 0) then
-        imask |= (1 << i)
-        count += 1
-      end
-    end
-    (count > 0 && count < 5) ? imask : 0
-  end
-
-  def flood_fill( board, location)
-    return board if (board[location] == 1)
-    board |= 1 << location
-    row, col = location.divmod(6)
-    board = flood_fill( board, location - 1) if (col > 0)
-    board = flood_fill( board, location + 1) if (col < 4)
-    if (row % 2 == 0) then
-      board = flood_fill( board, location - 7) if (col > 0 && row > 0)
-      board = flood_fill( board, location - 6) if (row > 0)
-      board = flood_fill( board, location + 6) if (row < 9)
-      board = flood_fill( board, location + 5) if (col > 0 && row < 9)
-    else
-      board = flood_fill( board, location - 5) if (col < 4 && row > 0)
-      board = flood_fill( board, location - 6) if (row > 0)
-      board = flood_fill( board, location + 6) if (row < 9)
-      board = flood_fill( board, location + 7) if (col < 4 && row < 9)
-    end
-    board
-  end
-
-  # given a location, produces a list of relative locations covered by the piece at this rotation
-  def offsets( location)
-    if is_even( location) then
-      @even_offsets.collect { | value | value + location }
-    else
-      @odd_offsets.collect { | value | value + location }
-    end
-  end
-
-  # returns a set of offsets relative to the top-left most piece of the rotation (by even or odd rows)
-  # this is hard to explain. imagine we have this partial board:
-  #   0 0 0 0 0 x        [positions 0-5]
-  #    0 0 1 1 0 x       [positions 6-11]
-  #   0 0 1 0 0 x        [positions 12-17]
-  #    0 1 0 0 0 x       [positions 18-23]
-  #   0 1 0 0 0 x        [positions 24-29]
-  #    0 0 0 0 0 x       [positions 30-35]
-  #       ...
-  # The top-left of the piece is at position 8, the
-  # board would be passed as a set of positions (values array) containing [8,9,14,19,25] not necessarily in that
-  # sorted order.  Since that array starts on an odd row, the offsets for an odd row are: [0,1,6,11,17] obtained
-  # by subtracting 8 from everything.  Now imagine the piece shifted up and to the right so it's on an even row:
-  #   0 0 0 1 1 x        [positions 0-5]
-  #    0 0 1 0 0 x       [positions 6-11]
-  #   0 0 1 0 0 x        [positions 12-17]
-  #    0 1 0 0 0 x       [positions 18-23]
-  #   0 0 0 0 0 x        [positions 24-29]
-  #    0 0 0 0 0 x       [positions 30-35]
-  #       ...
-  # Now the positions are [3,4,8,14,19] which after subtracting the lowest value (3) gives [0,1,5,11,16] thus, the
-  # offsets for this particular piece are (in even, odd order) [0,1,5,11,16],[0,1,6,11,17] which is what
-  # this function would return
-  def normalize_offsets( values)
-    min = values.min
-    even_min = is_even(min)
-    other_min = even_min ? min + 6 : min + 7
-    other_values = values.collect do | value |
-      if is_even(value) then
-        value + 6 - other_min
-      else
-        value + 7 - other_min
-      end
-    end
-    values.collect! { | value | value - min }
-
-    if even_min then
-      [values, other_values]
-    else
-      [other_values, values]
-    end
-  end
-
-  # produce a bitmask representation of an array of offset locations
-  def mask_for_offsets( offsets )
-    mask = 0
-    offsets.each { | value | mask = mask + ( 1 << value ) }
-    mask
-  end
-
-  # finds a "safe" position that a position as described by a list of directions can be placed
-  # without falling off any edge of the board.  the values returned a location to place the first piece
-  # at so it will fit after making the described moves
-  def start_adjust( directions )
-    south = east = 0;
-    directions.each do | direction |
-      east += 1 if ( direction == :sw || direction == :nw || direction == :west )
-      south += 1 if ( direction == :nw || direction == :ne )
-    end
-    south * 6 + east
-  end
-
-  # given a set of directions places the piece (as defined by a set of directions) on the board at
-  # a location that will not take it off the edge
-  def get_values ( directions )
-    start = start_adjust(directions)
-    values = [ start ]
-    directions.each do | direction |
-      if (start % 12 >= 6) then
-        start += @@rotation_odd_adder[direction]
-      else
-        start += @@rotation_even_adder[direction]
-      end
-      values += [ start ]
-    end
-
-    # some moves take you back to an existing location, we'll strip duplicates
-    values.uniq
-  end
-end
-
-# describes a piece and caches information about its rotations to as to be efficient for iteration
-# ATTRIBUTES:
-#   rotations -- all the rotations of the piece
-#   type -- a numeic "name" of the piece
-#   masks -- an array by location of all legal rotational masks (a n inner array) for that location
-#   placed -- the mask that this piece was last placed at (not a location, but the actual mask used)
-class Piece
-  attr_reader :rotations, :type, :masks
-  attr_accessor :placed
-
-  # transform hashes that change one direction into another when you either flip or rotate a set of directions
-  @@flip_converter = { :west => :west, :east => :east, :nw => :sw, :ne => :se, :sw => :nw, :se => :ne }
-  @@rotate_converter = { :west => :nw, :east => :se, :nw => :ne, :ne => :east, :sw => :west, :se => :sw }
-
-  def initialize( directions, type )
-    @type = type
-    @rotations = Array.new();
-    @map = {}
-
-    generate_rotations( directions )
-    directions.collect! { | value | @@flip_converter[value] }
-    generate_rotations( directions )
-
-    # creates the masks AND a map that returns [location, rotation] for any given mask
-    # this is used when a board is found and we want to draw it, otherwise the map is unused
-    @masks = Array.new();
-    0.upto(59) do | i |
-      even = true
-      @masks[i] = @rotations.collect do | rotation |
-        mask = rotation.start_masks[i]
-        @map[mask[0]] = [ i, rotation ] if (mask)
-        mask || nil
-      end
-      @masks[i].compact!
-    end
-  end
-
-  # rotates a set of directions through all six angles and adds a Rotation to the list for each one
-  def generate_rotations( directions )
-    6.times do
-      rotations.push( Rotation.new(directions))
-      directions.collect! { | value | @@rotate_converter[value] }
-    end
-  end
-
-  # given a board string, adds this piece to the board at whatever location/rotation
-  # important: the outbound board string is 5 wide, the normal location notation is six wide (padded)
-  def fill_string( board_string)
-    location, rotation = @map[@placed]
-    rotation.offsets(location).each do | offset |
-      row, col = offset.divmod(6)
-      board_string[ row*5 + col, 1 ] = @type.to_s
-    end
-  end
-end
-
-# a blank bit board having this form:
-#
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    1 1 1 1 1 1
-#
-# where left lest significant bit is the top left and the most significant is the lower right
-# the actual board only consists of the 0 places, the 1 places are blockers to keep things from running
-# off the edges or bottom
-def blank_board
-  0b111111100000100000100000100000100000100000100000100000100000100000
-end
-
-def full_board
-  0b111111111111111111111111111111111111111111111111111111111111111111
-end
-
-# determines if a location (bit position) is in an even row
-def is_even( location)
-  (location % 12) < 6
-end
-
-# support function that create three utility maps:
-#  $converter -- for each row an array that maps a five bit row (via array mapping)
-#                to the a a five bit representation of the bits below it
-#  $bit_count -- maps a five bit row (via array mapping) to the number of 1s in the row
-#  @@new_regions -- maps a five bit row (via array mapping) to an array of "region" arrays
-#                   a region array has three values the first is a mask of bits in the region,
-#                   the second is the count of those bits and the third is identical to the first
-#                   examples:
-#                           0b10010 => [ 0b01100, 2, 0b01100 ], [ 0b00001, 1, 0b00001]
-#                           0b01010 => [ 0b10000, 1, 0b10000 ], [ 0b00100, 1, 0b00100 ], [ 0b00001, 1, 0b00001]
-#                           0b10001 => [ 0b01110, 3, 0b01110 ]
-def create_collector_support
-  odd_map = [0b11, 0b110, 0b1100, 0b11000, 0b10000]
-  even_map = [0b1, 0b11, 0b110, 0b1100, 0b11000]
-
-  all_odds = Array.new(0b100000)
-  all_evens = Array.new(0b100000)
-  bit_counts = Array.new(0b100000)
-  new_regions = Array.new(0b100000)
-  0.upto(0b11111) do | i |
-    bit_count = odd = even = 0
-    0.upto(4) do | bit |
-      if (i[bit] == 1) then
-        bit_count += 1
-        odd |= odd_map[bit]
-        even |= even_map[bit]
-      end
-    end
-    all_odds[i] = odd
-    all_evens[i] = even
-    bit_counts[i] = bit_count
-    new_regions[i] = create_regions( i)
-  end
-
-  $converter = []
-  10.times { | row | $converter.push((row % 2 == 0) ? all_evens : all_odds) }
-  $bit_counts = bit_counts
-  $regions = new_regions.collect { | set | set.collect { | value | [ value, bit_counts[value], value] } }
-end
-
-# determines if a board is punable, meaning that there is no possibility that it
-# can be filled up with pieces.  A board is prunable if there is a grouping of unfilled spaces
-# that are not a multiple of five.  The following board is an example of a prunable board:
-#    0 0 1 0 0
-#     0 1 0 0 0
-#    1 1 0 0 0
-#     0 1 0 0 0
-#    0 0 0 0 0
-#       ...
-#
-# This board is prunable because the top left corner is only 3 bits in area, no piece will ever fit it
-# parameters:
-#   board -- an initial bit board (6 bit padded rows, see blank_board for format)
-#   location -- starting location, everything above and to the left is already full
-#   slotting -- set to true only when testing initial pieces, when filling normally
-#               additional assumptions are possible
-#
-# Algorithm:
-#    The algorithm starts at the top row (as determined by location) and iterates a row at a time
-#    maintainng counts of active open areas (kept in the collector array) each collector contains
-#    three values at the start of an iteration:
-#          0: mask of bits that would be adjacent to the collector in this row
-#          1: the number of bits collected so far
-#          2: a scratch space starting as zero, but used during the computation to represent
-#             the empty bits in the new row that are adjacent (position 0)
-#  The exact procedure is described in-code
-def prunable( board, location, slotting = false)
-  collectors = []
-  # loop accross the rows
-  (location / 6).to_i.upto(9) do | row_on |
-    # obtain a set of regions representing the bits of the curent row.
-    regions = $regions[(board >> (row_on * 6)) & 0b11111]
-    converter = $converter[row_on]
-
-    # track the number of collectors at the start of the cycle so that
-    # we don't compute against newly created collectors, only existing collectors
-    initial_collector_count = collectors.length
-
-    # loop against the regions.  For each region of the row
-    # we will see if it connects to one or more existing collectors.
-    # if it connects to 1 collector, the bits from the region are added to the
-    # bits of the collector and the mask is placed in collector[2]
-    # If the region overlaps more than one collector then all the collectors
-    # it overlaps with are merged into the first one (the others are set to nil in the array)
-    # if NO collectors are found then the region is copied as a new collector
-    regions.each do | region |
-      collector_found = nil
-      region_mask = region[2]
-      initial_collector_count.times do | collector_num |
-        collector = collectors[collector_num]
-        if (collector) then
-          collector_mask = collector[0]
-          if (collector_mask & region_mask != 0) then
-            if (collector_found) then
-              collector_found[0] |= collector_mask
-              collector_found[1] += collector[1]
-              collector_found[2] |= collector[2]
-              collectors[collector_num] = nil
-            else
-              collector_found = collector
-              collector[1] += region[1]
-              collector[2] |= region_mask
-            end
-          end
-        end
-      end
-      if (collector_found == nil) then
-        collectors.push(Array.new(region))
-      end
-    end
-
-    # check the existing collectors, if any collector overlapped no bits in the region its [2] value will
-    # be zero.  The size of any such reaason is tested if it is not a muliple of five true is returned since
-    # the board is prunable.  if it is a multiple of five it is removed.
-    # Collector that are still active have a new adjacent value [0] set based n the matched bits
-    # and have [2] cleared out for the next cycle.
-    collectors.length.times do | collector_num |
-      collector = collectors[collector_num]
-      if (collector) then
-        if (collector[2] == 0) then
-          return true if (collector[1] % 5 != 0)
-          collectors[collector_num] = nil
-        else
-          # if a collector matches all bits in the row then we can return unprunable early for the
-          # follwing reasons:
-          #    1) there can be no more unavailable bits bince we fill from the top left downward
-          #    2) all previous regions have been closed or joined so only this region can fail
-          #    3) this region must be good since there can never be only 1 region that is nuot
-          #       a multiple of five
-          # this rule only applies when filling normally, so we ignore the rule if we are "slotting"
-          # in pieces to see what configurations work for them (the only other time this algorithm is used).
-          return false if (collector[2] == 0b11111 && !slotting)
-          collector[0] = converter[collector[2]]
-          collector[2] = 0
-        end
-      end
-    end
-
-    # get rid of all the empty converters for the next round
-    collectors.compact!
-  end
-  return false if (collectors.length <= 1) # 1 collector or less and the region is fine
-  collectors.any? { | collector | (collector[1] % 5) != 0 } # more than 1 and we test them all for bad size
-end
-
-# creates a region given a row mask.  see prunable for what a "region" is
-def create_regions( value )
-  regions = []
-  cur_region = 0
-  5.times do | bit |
-    if (value[bit] == 0) then
-      cur_region |= 1 << bit
-    else
-      if (cur_region != 0 ) then
-        regions.push( cur_region)
-        cur_region = 0;
-      end
-    end
-  end
-  regions.push(cur_region) if (cur_region != 0)
-  regions
-end
-
-# find up to the counted number of solutions (or all solutions) and prints the final result
-def find_all
-  find_top( 1)
-  find_top( 0)
-  print_results
-end
-
-# show the board
-def print_results
-  print "#{@boards_found} solutions found\n\n"
-  print_full_board( @min_board)
-  print "\n"
-  print_full_board( @max_board)
-  print "\n"
-end
-
-# finds solutions.  This special version of the main function is only used for the top level
-# the reason for it is basically to force a particular ordering on how the rotations are tested for
-# the first piece.  It is called twice, first looking for placements of the odd rotations and then
-# looking for placements of the even locations.
-#
-# WHY?
-#   Since any found solution has an inverse we want to maximize finding solutions that are not already found
-#   as an inverse.  The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away
-#   (an odd number).  Checking even vs odd then produces a higher probability of finding more pieces earlier
-#   in the cycle.  We still need to keep checking all the permutations, but our probability of finding one will
-#   diminsh over time.  Since we are TOLD how many to search for this lets us exit before checking all pieces
-#   this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the
-#   maximum number
-def find_top( rotation_skip)
-  board = blank_board
-  (@pieces.length-1).times do
-    piece = @pieces.shift
-    piece.masks[0].each do | mask, imask, cmask |
-      if ((rotation_skip += 1) % 2 == 0) then
-        piece.placed = mask
-        find( 1, 1, board | mask)
-      end
-    end
-    @pieces.push(piece)
-  end
-  piece = @pieces.shift
-  @pieces.push(piece)
-end
-
-# the normail find routine, iterates through the available pieces, checks all rotations at the current location
-# and adds any boards found.  depth is acheived via recursion.  the overall approach is described
-# here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
-# parameters:
-#  start_location -- where to start looking for place for the next piece at
-#  placed -- number of pieces placed
-#  board -- current state of the board
-#
-# see in-code comments
-def find( start_location, placed, board)
-  # find the next location to place a piece by looking for an empty bit
-  while board[start_location] == 1
-    start_location += 1
-  end
-
-  @pieces.length.times do
-    piece = @pieces.shift
-    piece.masks[start_location].each do | mask, imask, cmask |
-      if ( board & cmask == imask) then
-        piece.placed = mask
-        if (placed == 9) then
-          add_board
-        else
-          find( start_location + 1, placed + 1, board | mask)
-        end
-      end
-    end
-    @pieces.push(piece)
-  end
-end
-
-# print the board
-def print_full_board( board_string)
-  10.times do | row |
-    print " " if (row % 2 == 1)
-    5.times do | col |
-      print "#{board_string[row*5 + col,1]} "
-    end
-    print "\n"
-  end
-end
-
-# when a board is found we "draw it" into a string and then flip that string, adding both to
-# the list (hash) of solutions if they are unique.
-def add_board
-  board_string = "99999999999999999999999999999999999999999999999999"
-  @all_pieces.each {  | piece | piece.fill_string( board_string ) }
-  save( board_string)
-  save( board_string.reverse)
-end
-
-# adds a board string to the list (if new) and updates the current best/worst board
-def save( board_string)
-  if (@all_boards[board_string] == nil) then
-    @min_board = board_string if (board_string < @min_board)
-    @max_board = board_string if (board_string > @max_board)
-    @all_boards.store(board_string,true)
-    @boards_found += 1
-
-    # the exit motif is a time saver.  Ideally the function should return, but those tests
-    # take noticable time (performance).
-    if (@boards_found == @stop_count) then
-      print_results
-      exit(0)
-    end
-  end
-end
-
-
-##
-## MAIN BODY :)
-##
-create_collector_support
-@pieces = [
-  Piece.new( [ :nw, :ne, :east, :east ], 2),
-  Piece.new( [ :ne, :se, :east, :ne ], 7),
-  Piece.new( [ :ne, :east, :ne, :nw ], 1),
-  Piece.new( [ :east, :sw, :sw, :se ], 6),
-  Piece.new( [ :east, :ne, :se, :ne ], 5),
-  Piece.new( [ :east, :east, :east, :se ], 0),
-  Piece.new( [ :ne, :nw, :se, :east, :se ], 4),
-  Piece.new( [ :se, :se, :se, :west ], 9),
-  Piece.new( [ :se, :se, :east, :se ], 8),
-  Piece.new( [ :east, :east, :sw, :se ], 3)
-  ];
-
-@all_pieces = Array.new( @pieces)
-
-@min_board = "99999999999999999999999999999999999999999999999999"
-@max_board = "00000000000000000000000000000000000000000000000000"
-@stop_count = ARGV[0].to_i || 2089
-@all_boards = {}
-@boards_found = 0
-
-find_all ######## DO IT!!!
-
diff --git a/benchmark/bm_so_nbody.rb b/benchmark/bm_so_nbody.rb
deleted file mode 100644
index d6c5bb9e61..0000000000
--- a/benchmark/bm_so_nbody.rb
+++ /dev/null
@@ -1,148 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org
-#
-# Optimized for Ruby by Jesse Millikan
-# From version ported by Michael Neumann from the C gcc version,
-# which was written by Christoph Bauer.
-
-SOLAR_MASS = 4 * Math::PI**2
-DAYS_PER_YEAR = 365.24
-
-def _puts *args
-end
-
-class Planet
- attr_accessor :x, :y, :z, :vx, :vy, :vz, :mass
-
- def initialize(x, y, z, vx, vy, vz, mass)
-  @x, @y, @z = x, y, z
-  @vx, @vy, @vz = vx * DAYS_PER_YEAR, vy * DAYS_PER_YEAR, vz * DAYS_PER_YEAR
-  @mass = mass * SOLAR_MASS
- end
-
- def move_from_i(bodies, nbodies, dt, i)
-  while i < nbodies
-   b2 = bodies[i]
-   dx = @x - b2.x
-   dy = @y - b2.y
-   dz = @z - b2.z
-
-   distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
-   mag = dt / (distance * distance * distance)
-   b_mass_mag, b2_mass_mag = @mass * mag, b2.mass * mag
-
-   @vx -= dx * b2_mass_mag
-   @vy -= dy * b2_mass_mag
-   @vz -= dz * b2_mass_mag
-   b2.vx += dx * b_mass_mag
-   b2.vy += dy * b_mass_mag
-   b2.vz += dz * b_mass_mag
-   i += 1
-  end
-
-  @x += dt * @vx
-  @y += dt * @vy
-  @z += dt * @vz
- end
-end
-
-def energy(bodies)
-  e = 0.0
-  nbodies = bodies.size
-
-  for i in 0 ... nbodies
-    b = bodies[i]
-    e += 0.5 * b.mass * (b.vx * b.vx + b.vy * b.vy + b.vz * b.vz)
-    for j in (i + 1) ... nbodies
-      b2 = bodies[j]
-      dx = b.x - b2.x
-      dy = b.y - b2.y
-      dz = b.z - b2.z
-      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
-      e -= (b.mass * b2.mass) / distance
-    end
-  end
-  e
-end
-
-def offset_momentum(bodies)
-  px, py, pz = 0.0, 0.0, 0.0
-
-  for b in bodies
-    m = b.mass
-    px += b.vx * m
-    py += b.vy * m
-    pz += b.vz * m
-  end
-
-  b = bodies[0]
-  b.vx = - px / SOLAR_MASS
-  b.vy = - py / SOLAR_MASS
-  b.vz = - pz / SOLAR_MASS
-end
-
-BODIES = [
-  # sun
-  Planet.new(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0),
-
-  # jupiter
-  Planet.new(
-    4.84143144246472090e+00,
-    -1.16032004402742839e+00,
-    -1.03622044471123109e-01,
-    1.66007664274403694e-03,
-    7.69901118419740425e-03,
-    -6.90460016972063023e-05,
-    9.54791938424326609e-04),
-
-  # saturn
-  Planet.new(
-    8.34336671824457987e+00,
-    4.12479856412430479e+00,
-    -4.03523417114321381e-01,
-    -2.76742510726862411e-03,
-    4.99852801234917238e-03,
-    2.30417297573763929e-05,
-    2.85885980666130812e-04),
-
-  # uranus
-  Planet.new(
-    1.28943695621391310e+01,
-    -1.51111514016986312e+01,
-    -2.23307578892655734e-01,
-    2.96460137564761618e-03,
-    2.37847173959480950e-03,
-    -2.96589568540237556e-05,
-    4.36624404335156298e-05),
-
-  # neptune
-  Planet.new(
-    1.53796971148509165e+01,
-    -2.59193146099879641e+01,
-    1.79258772950371181e-01,
-    2.68067772490389322e-03,
-    1.62824170038242295e-03,
-    -9.51592254519715870e-05,
-    5.15138902046611451e-05)
-]
-
-init = 200_000 # ARGV[0]
-n = Integer(init)
-
-offset_momentum(BODIES)
-
-puts "%.9f" % energy(BODIES)
-
-nbodies = BODIES.size
-dt = 0.01
-
-n.times do
-  i = 0
-  while i < nbodies
-    b = BODIES[i]
-    b.move_from_i(BODIES, nbodies, dt, i + 1)
-    i += 1
-  end
-end
-
-puts "%.9f" % energy(BODIES)
diff --git a/benchmark/bm_so_nested_loop.rb b/benchmark/bm_so_nested_loop.rb
deleted file mode 100644
index a0513f8c47..0000000000
--- a/benchmark/bm_so_nested_loop.rb
+++ /dev/null
@@ -1,24 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: nestedloop-ruby.code,v 1.4 2004/11/13 07:42:22 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# from Avi Bryant
-
-n = 16 # Integer(ARGV.shift || 1)
-x = 0
-n.times do
-    n.times do
-        n.times do
-            n.times do
-                n.times do
-                    n.times do
-                        x += 1
-                    end
-                end
-            end
-        end
-    end
-end
-# puts x
-
-
diff --git a/benchmark/bm_so_object.rb b/benchmark/bm_so_object.rb
deleted file mode 100644
index e8607c7199..0000000000
--- a/benchmark/bm_so_object.rb
+++ /dev/null
@@ -1,56 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: objinst-ruby.code,v 1.4 2004/11/13 07:42:25 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Aristarkh Zagorodnikov
-
-class Toggle
-    def initialize(start_state)
-        @bool = start_state
-    end
-
-    def value
-        @bool
-    end
-
-    def activate
-        @bool = !@bool
-        self
-    end
-end
-
-class NthToggle < Toggle
-    def initialize(start_state, max_counter)
-        super start_state
-        @count_max = max_counter
-        @counter = 0
-    end
-
-    def activate
-        @counter += 1
-        if @counter >= @count_max
-            @bool = !@bool
-            @counter = 0
-        end
-        self
-    end
-end
-
-n = 1500000 # (ARGV.shift || 1).to_i
-
-toggle = Toggle.new 1
-5.times do
-    toggle.activate.value ? 'true' : 'false'
-end
-n.times do
-    toggle = Toggle.new 1
-end
-
-ntoggle = NthToggle.new 1, 3
-8.times do
-    ntoggle.activate.value ? 'true' : 'false'
-end
-n.times do
-    ntoggle = NthToggle.new 1, 3
-end
-
diff --git a/benchmark/bm_so_pidigits.rb b/benchmark/bm_so_pidigits.rb
deleted file mode 100644
index c7d6fbfb4d..0000000000
--- a/benchmark/bm_so_pidigits.rb
+++ /dev/null
@@ -1,92 +0,0 @@
-# The Great Computer Language Shootout
-# http://shootout.alioth.debian.org/
-#
-# contributed by Gabriele Renzi
-
-class PiDigitSpigot
-
-    def initialize()
-        @z = Transformation.new 1,0,0,1
-        @x = Transformation.new 0,0,0,0
-        @inverse = Transformation.new 0,0,0,0
-    end
-
-    def next!
-        @y = @z.extract(3)
-        if safe? @y
-            @z = produce(@y)
-            @y
-        else
-            @z = consume @x.next!()
-            next!()
-        end
-    end
-
-    def safe?(digit)
-        digit == @z.extract(4)
-    end
-
-    def produce(i)
-        @inverse.qrst(10,-10*i,0,1).compose(@z)
-    end
-
-    def consume(a)
-        @z.compose(a)
-    end
-end
-
-
-class Transformation
-    attr_reader :q, :r, :s, :t
-    def initialize (q, r, s, t)
-        @q,@r,@s,@t,@k = q,r,s,t,0
-    end
-
-    def next!()
-        @q = @k = @k + 1
-        @r = 4 * @k + 2
-        @s = 0
-        @t = 2 * @k + 1
-        self
-    end
-
-    def extract(j)
-        (@q * j + @r) / (@s * j + @t)
-    end
-
-    def compose(a)
-        self.class.new( @q * a.q,
-                        @q * a.r + r * a.t,
-                        @s * a.q + t * a.s,
-                        @s * a.r + t * a.t
-                    )
-    end
-
-    def qrst *args
-        initialize *args
-        self
-    end
-
-
-end
-
-
-WIDTH = 10
-n = 2_500 # Integer(ARGV[0])
-j = 0
-
-digits = PiDigitSpigot.new
-
-while n > 0
-    if n >= WIDTH
-        WIDTH.times {print digits.next!}
-        j += WIDTH
-    else
-        n.times {print digits.next!}
-        (WIDTH-n).times {print " "}
-        j += n
-    end
-    puts "\t:"+j.to_s
-    n -= WIDTH
-end
-
diff --git a/benchmark/bm_so_reverse_complement.rb b/benchmark/bm_so_reverse_complement.rb
deleted file mode 100644
index 82ea666994..0000000000
--- a/benchmark/bm_so_reverse_complement.rb
+++ /dev/null
@@ -1,30 +0,0 @@
-#!/usr/bin/ruby
-# The Great Computer Language Shootout
-# http://shootout.alioth.debian.org/
-#
-# Contributed by Peter Bjarke Olsen
-# Modified by Doug King
-
-seq=Array.new
-
-def revcomp(seq)
-  seq.reverse!.tr!('wsatugcyrkmbdhvnATUGCYRKMBDHVN','WSTAACGRYMKVHDBNTAACGRYMKVHDBN')
-  stringlen=seq.length
-  0.step(stringlen-1,60) {|x| print seq.slice(x,60) , "\n"}
-end
-
-input = open(File.join(File.dirname($0), 'fasta.output.2500000'), 'rb')
-
-while input.gets
-  if $_ =~ />/
-    if seq.length != 0
-      revcomp(seq.join)
-      seq=Array.new
-    end
-    puts $_
-  else
-    $_.sub(/\n/,'')
-    seq.push $_
-  end
-end
-revcomp(seq.join)
diff --git a/benchmark/bm_vm1_attr_ivar.rb b/benchmark/bm_vm1_attr_ivar.rb
deleted file mode 100644
index 16906f3605..0000000000
--- a/benchmark/bm_vm1_attr_ivar.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-class C
-  attr_reader :a, :b
-  def initialize
-    @a = nil
-    @b = nil
-  end
-end
-obj = C.new
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  j = obj.a
-  k = obj.b
-end
diff --git a/benchmark/bm_vm1_attr_ivar_set.rb b/benchmark/bm_vm1_attr_ivar_set.rb
deleted file mode 100644
index 7e7a6b48c0..0000000000
--- a/benchmark/bm_vm1_attr_ivar_set.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-class C
-  attr_accessor :a, :b
-  def initialize
-    @a = nil
-    @b = nil
-  end
-end
-obj = C.new
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  obj.a = 1
-  obj.b = 2
-end
diff --git a/benchmark/bm_vm1_block.rb b/benchmark/bm_vm1_block.rb
deleted file mode 100644
index a9f56b15ea..0000000000
--- a/benchmark/bm_vm1_block.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-def m
-  yield
-end
-
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  m{
-  }
-end
diff --git a/benchmark/bm_vm1_const.rb b/benchmark/bm_vm1_const.rb
deleted file mode 100644
index ac59ebccf1..0000000000
--- a/benchmark/bm_vm1_const.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-Const = 1
-
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  j = Const
-  k = Const
-end
diff --git a/benchmark/bm_vm1_ensure.rb b/benchmark/bm_vm1_ensure.rb
deleted file mode 100644
index a1596145f2..0000000000
--- a/benchmark/bm_vm1_ensure.rb
+++ /dev/null
@@ -1,11 +0,0 @@
-i = 0
-while i<30_000_000 # benchmark loop 1
-  i += 1
-  begin
-    begin
-    ensure
-    end
-  ensure
-  end
-end
-
diff --git a/benchmark/bm_vm1_float_simple.rb b/benchmark/bm_vm1_float_simple.rb
deleted file mode 100644
index d4581439ff..0000000000
--- a/benchmark/bm_vm1_float_simple.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-i = 0.0; f = 0.0
-while i<30_000_000
-  i += 1
-  f += 0.1; f -= 0.1
-  f += 0.1; f -= 0.1
-  f += 0.1; f -= 0.1
-end
diff --git a/benchmark/bm_vm1_ivar.rb b/benchmark/bm_vm1_ivar.rb
deleted file mode 100644
index 68a73cf92f..0000000000
--- a/benchmark/bm_vm1_ivar.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-@a = 1
-
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  j = @a
-  k = @a
-end
diff --git a/benchmark/bm_vm1_ivar_set.rb b/benchmark/bm_vm1_ivar_set.rb
deleted file mode 100644
index bd81b06c34..0000000000
--- a/benchmark/bm_vm1_ivar_set.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  @a = 1
-  @b = 2
-end
diff --git a/benchmark/bm_vm1_length.rb b/benchmark/bm_vm1_length.rb
deleted file mode 100644
index 353de3ab0e..0000000000
--- a/benchmark/bm_vm1_length.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-a = 'abc'
-b = [1, 2, 3]
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  a.length
-  b.length
-end
-
diff --git a/benchmark/bm_vm1_lvar_init.rb b/benchmark/bm_vm1_lvar_init.rb
deleted file mode 100644
index 36f2068811..0000000000
--- a/benchmark/bm_vm1_lvar_init.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-def m v
-  unless v
-    # unreachable code
-    v1 = v2 = v3 = v4 = v5 = v6 = v7 = v8 = v9 = v10 =
-    v11 = v12 = v13 = v14 = v15 = v16 = v17 = v18 = v19 = v20 =
-    v21 = v22 = v23 = v24 = v25 = v26 = v27 = v28 = v29 = v30 =
-    v31 = v32 = v33 = v34 = v35 = v36 = v37 = v38 = v39 = v40 =
-    v41 = v42 = v43 = v44 = v45 = v46 = v47 = v48 = v49 = v50 = 1
-  end
-end
-
-i = 0
-
-while i<30_000_000 # while loop 1
-  i += 1
-  m i
-end
-
diff --git a/benchmark/bm_vm1_lvar_set.rb b/benchmark/bm_vm1_lvar_set.rb
deleted file mode 100644
index 222e864134..0000000000
--- a/benchmark/bm_vm1_lvar_set.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  a = b = c = d = e = f = g = h = j = k = l = m = n = o = p = q = r = 1
-end
diff --git a/benchmark/bm_vm1_neq.rb b/benchmark/bm_vm1_neq.rb
deleted file mode 100644
index bbb4ae07a4..0000000000
--- a/benchmark/bm_vm1_neq.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i = 0
-obj1 = Object.new
-obj2 = Object.new
-
-while i<30_000_000 # while loop 1
-  i += 1
-  obj1 != obj2
-end
diff --git a/benchmark/bm_vm1_not.rb b/benchmark/bm_vm1_not.rb
deleted file mode 100644
index b09ecdcc21..0000000000
--- a/benchmark/bm_vm1_not.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-i = 0
-obj = Object.new
-
-while i<30_000_000 # while loop 1
-  i += 1
-  !obj
-end
diff --git a/benchmark/bm_vm1_rescue.rb b/benchmark/bm_vm1_rescue.rb
deleted file mode 100644
index b0d3e2bdfa..0000000000
--- a/benchmark/bm_vm1_rescue.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  begin
-  rescue
-  end
-end
diff --git a/benchmark/bm_vm1_simplereturn.rb b/benchmark/bm_vm1_simplereturn.rb
deleted file mode 100644
index 63f9f21675..0000000000
--- a/benchmark/bm_vm1_simplereturn.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  return 1
-end
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  m
-end
-
diff --git a/benchmark/bm_vm1_swap.rb b/benchmark/bm_vm1_swap.rb
deleted file mode 100644
index 918f8b2112..0000000000
--- a/benchmark/bm_vm1_swap.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-a = 1
-b = 2
-i = 0
-while i<30_000_000 # while loop 1
-  i += 1
-  a, b = b, a
-end
-
diff --git a/benchmark/bm_vm1_yield.rb b/benchmark/bm_vm1_yield.rb
deleted file mode 100644
index 775597cea6..0000000000
--- a/benchmark/bm_vm1_yield.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-def m
-  i = 0
-  while i<30_000_000 # while loop 1
-    i += 1
-    yield
-  end
-end
-
-m{}
-
diff --git a/benchmark/bm_vm2_array.rb b/benchmark/bm_vm2_array.rb
deleted file mode 100644
index df9037c83c..0000000000
--- a/benchmark/bm_vm2_array.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  a = [1,2,3,4,5,6,7,8,9,10]
-end
diff --git a/benchmark/bm_vm2_bigarray.rb b/benchmark/bm_vm2_bigarray.rb
deleted file mode 100644
index b02509d6a2..0000000000
--- a/benchmark/bm_vm2_bigarray.rb
+++ /dev/null
@@ -1,106 +0,0 @@
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  a = [
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-    1,2,3,4,5,6,7,8,9,10,
-  ]
-end
diff --git a/benchmark/bm_vm2_bighash.rb b/benchmark/bm_vm2_bighash.rb
deleted file mode 100644
index 5e3f437bb8..0000000000
--- a/benchmark/bm_vm2_bighash.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-i = 0
-while i<60_000 # benchmark loop 2
-  i += 1
-  a = {0=>0, 1=>1, 2=>2, 3=>3, 4=>4, 5=>5, 6=>6, 7=>7, 8=>8, 9=>9, 10=>10, 11=>11, 12=>12, 13=>13, 14=>14, 15=>15, 16=>16, 17=>17, 18=>18, 19=>19, 20=>20, 21=>21, 22=>22, 23=>23, 24=>24, 25=>25, 26=>26, 27=>27, 28=>28, 29=>29, 30=>30, 31=>31, 32=>32, 33=>33, 34=>34, 35=>35, 36=>36, 37=>37, 38=>38, 39=>39, 40=>40, 41=>41, 42=>42, 43=>43, 44=>44, 45=>45, 46=>46, 47=>47, 48=>48, 49=>49, 50=>50, 51=>51, 52=>52, 53=>53, 54=>54, 55=>55, 56=>56, 57=>57, 58=>58, 59=>59, 60=>60, 61=>61, 62=>62, 63=>63, 64=>64, 65=>65, 66=>66, 67=>67, 68=>68, 69=>69, 70=>70, 71=>71, 72=>72, 73=>73, 74=>74, 75=>75, 76=>76, 77=>77, 78=>78, 79=>79, 80=>80, 81=>81, 82=>82, 83=>83, 84=>84, 85=>85, 86=>86, 87=>87, 88=>88, 89=>89, 90=>90, 91=>91, 92=>92, 93=>93, 94=>94, 95=>95, 96=>96, 97=>97, 98=>98, 99=>99, 100=>100, 101=>101, 102=>102, 103=>103, 104=>104, 105=>105, 106=>106, 107=>107, 108=>108, 109=>109, 110=>110, 111=>111, 112=>112, 113=>113, 114=>114, 115=>115, 116=>116, 117=>117, 118=>118, 119=>119, 120=>120, 121=>121, 122=>122, 123=>123, 124=>124, 125=>125, 126=>126, 127=>127, 128=>128, 129=>129, 130=>130, 131=>131, 132=>132, 133=>133, 134=>134, 135=>135, 136=>136, 137=>137, 138=>138, 139=>139, 140=>140, 141=>141, 142=>142, 143=>143, 144=>144, 145=>145, 146=>146, 147=>147, 148=>148, 149=>149, 150=>150, 151=>151, 152=>152, 153=>153, 154=>154, 155=>155, 156=>156, 157=>157, 158=>158, 159=>159, 160=>160, 161=>161, 162=>162, 163=>163, 164=>164, 165=>165, 166=>166, 167=>167, 168=>168, 169=>169, 170=>170, 171=>171, 172=>172, 173=>173, 174=>174, 175=>175, 176=>176, 177=>177, 178=>178, 179=>179, 180=>180, 181=>181, 182=>182, 183=>183, 184=>184, 185=>185, 186=>186, 187=>187, 188=>188, 189=>189, 190=>190, 191=>191, 192=>192, 193=>193, 194=>194, 195=>195, 196=>196, 197=>197, 198=>198, 199=>199, 200=>200, 201=>201, 202=>202, 203=>203, 204=>204, 205=>205, 206=>206, 207=>207, 208=>208, 209=>209, 210=>210, 211=>211, 212=>212, 213=>213, 214=>214, 215=>215, 216=>216, 217=>217, 218=>218, 219=>219, 220=>220, 221=>221, 222=>222, 223=>223, 224=>224, 225=>225, 226=>226, 227=>227, 228=>228, 229=>229, 230=>230, 231=>231, 232=>232, 233=>233, 234=>234, 235=>235, 236=>236, 237=>237, 238=>238, 239=>239, 240=>240, 241=>241, 242=>242, 243=>243, 244=>244, 245=>245, 246=>246, 247=>247, 248=>248, 249=>249, 250=>250, 251=>251, 252=>252, 253=>253, 254=>254, 255=>255, 256=>256, 257=>257, 258=>258, 259=>259, 260=>260, 261=>261, 262=>262, 263=>263, 264=>264, 265=>265, 266=>266, 267=>267, 268=>268, 269=>269, 270=>270, 271=>271, 272=>272, 273=>273, 274=>274, 275=>275, 276=>276, 277=>277, 278=>278, 279=>279, 280=>280, 281=>281, 282=>282, 283=>283, 284=>284, 285=>285, 286=>286, 287=>287, 288=>288, 289=>289, 290=>290, 291=>291, 292=>292, 293=>293, 294=>294, 295=>295, 296=>296, 297=>297, 298=>298, 299=>299, 300=>300, 301=>301, 302=>302, 303=>303, 304=>304, 305=>305, 306=>306, 307=>307, 308=>308, 309=>309, 310=>310, 311=>311, 312=>312, 313=>313, 314=>314, 315=>315, 316=>316, 317=>317, 318=>318, 319=>319, 320=>320, 321=>321, 322=>322, 323=>323, 324=>324, 325=>325, 326=>326, 327=>327, 328=>328, 329=>329, 330=>330, 331=>331, 332=>332, 333=>333, 334=>334, 335=>335, 336=>336, 337=>337, 338=>338, 339=>339, 340=>340, 341=>341, 342=>342, 343=>343, 344=>344, 345=>345, 346=>346, 347=>347, 348=>348, 349=>349, 350=>350, 351=>351, 352=>352, 353=>353, 354=>354, 355=>355, 356=>356, 357=>357, 358=>358, 359=>359, 360=>360, 361=>361, 362=>362, 363=>363, 364=>364, 365=>365, 366=>366, 367=>367, 368=>368, 369=>369, 370=>370, 371=>371, 372=>372, 373=>373, 374=>374, 375=>375, 376=>376, 377=>377, 378=>378, 379=>379, 380=>380, 381=>381, 382=>382, 383=>383, 384=>384, 385=>385, 386=>386, 387=>387, 388=>388, 389=>389, 390=>390, 391=>391, 392=>392, 393=>393, 394=>394, 395=>395, 396=>396, 397=>397, 398=>398, 399=>399, 400=>400, 401=>401, 402=>402, 403=>403, 404=>404, 405=>405, 406=>406, 407=>407, 408=>408, 409=>409, 410=>410, 411=>411, 412=>412, 413=>413, 414=>414, 415=>415, 416=>416, 417=>417, 418=>418, 419=>419, 420=>420, 421=>421, 422=>422, 423=>423, 424=>424, 425=>425, 426=>426, 427=>427, 428=>428, 429=>429, 430=>430, 431=>431, 432=>432, 433=>433, 434=>434, 435=>435, 436=>436, 437=>437, 438=>438, 439=>439, 440=>440, 441=>441, 442=>442, 443=>443, 444=>444, 445=>445, 446=>446, 447=>447, 448=>448, 449=>449, 450=>450, 451=>451, 452=>452, 453=>453, 454=>454, 455=>455, 456=>456, 457=>457, 458=>458, 459=>459, 460=>460, 461=>461, 462=>462, 463=>463, 464=>464, 465=>465, 466=>466, 467=>467, 468=>468, 469=>469, 470=>470, 471=>471, 472=>472, 473=>473, 474=>474, 475=>475, 476=>476, 477=>477, 478=>478, 479=>479, 480=>480, 481=>481, 482=>482, 483=>483, 484=>484, 485=>485, 486=>486, 487=>487, 488=>488, 489=>489, 490=>490, 491=>491, 492=>492, 493=>493, 494=>494, 495=>495, 496=>496, 497=>497, 498=>498, 499=>499, 500=>500,}
-end
diff --git a/benchmark/bm_vm2_case.rb b/benchmark/bm_vm2_case.rb
deleted file mode 100644
index adc6e4df0a..0000000000
--- a/benchmark/bm_vm2_case.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-i = 0
-while i<6_000_000 # while loop 2
-  case :foo
-  when :bar
-    raise
-  when :baz
-    raise
-  when :boo
-    raise
-  when :foo
-    i += 1
-  end
-end
-
diff --git a/benchmark/bm_vm2_defined_method.rb b/benchmark/bm_vm2_defined_method.rb
deleted file mode 100644
index 053ed6c912..0000000000
--- a/benchmark/bm_vm2_defined_method.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-class Object
-  define_method(:m){}
-end
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  m; m; m; m; m; m; m; m;
-end
diff --git a/benchmark/bm_vm2_dstr.rb b/benchmark/bm_vm2_dstr.rb
deleted file mode 100644
index 58c0f7bbc3..0000000000
--- a/benchmark/bm_vm2_dstr.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i = 0
-x = y = 'z'
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  str = "foo#{x}bar#{y}baz"
-end
diff --git a/benchmark/bm_vm2_eval.rb b/benchmark/bm_vm2_eval.rb
deleted file mode 100644
index 307cfc28ef..0000000000
--- a/benchmark/bm_vm2_eval.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  eval("1")
-end
-
diff --git a/benchmark/bm_vm2_method.rb b/benchmark/bm_vm2_method.rb
deleted file mode 100644
index a8ccff7138..0000000000
--- a/benchmark/bm_vm2_method.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  nil
-end
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  m; m; m; m; m; m; m; m;
-end
diff --git a/benchmark/bm_vm2_method_missing.rb b/benchmark/bm_vm2_method_missing.rb
deleted file mode 100644
index 2badc73101..0000000000
--- a/benchmark/bm_vm2_method_missing.rb
+++ /dev/null
@@ -1,12 +0,0 @@
-class C
-  def method_missing mid
-  end
-end
-
-obj = C.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m;
-end
diff --git a/benchmark/bm_vm2_method_with_block.rb b/benchmark/bm_vm2_method_with_block.rb
deleted file mode 100644
index b4efb4f520..0000000000
--- a/benchmark/bm_vm2_method_with_block.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  nil
-end
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  m{}; m{}; m{}; m{}; m{}; m{}; m{}; m{};
-end
diff --git a/benchmark/bm_vm2_mutex.rb b/benchmark/bm_vm2_mutex.rb
deleted file mode 100644
index 7362f738c5..0000000000
--- a/benchmark/bm_vm2_mutex.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-require 'thread'
-
-m = Mutex.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  m.synchronize{}
-end
diff --git a/benchmark/bm_vm2_poly_method.rb b/benchmark/bm_vm2_poly_method.rb
deleted file mode 100644
index c82c0e4bce..0000000000
--- a/benchmark/bm_vm2_poly_method.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-class C1
-  def m
-    1
-  end
-end
-class C2
-  def m
-    2
-  end
-end
-
-o1 = C1.new
-o2 = C2.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  o = (i % 2 == 0) ? o1 : o2
-  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
-  i += 1
-end
diff --git a/benchmark/bm_vm2_poly_method_ov.rb b/benchmark/bm_vm2_poly_method_ov.rb
deleted file mode 100644
index aa5fd1dd38..0000000000
--- a/benchmark/bm_vm2_poly_method_ov.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-class C1
-  def m
-    1
-  end
-end
-class C2
-  def m
-    2
-  end
-end
-
-o1 = C1.new
-o2 = C2.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  o = (i % 2 == 0) ? o1 : o2
-#  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
-  i += 1
-end
diff --git a/benchmark/bm_vm2_proc.rb b/benchmark/bm_vm2_proc.rb
deleted file mode 100644
index 65e5217371..0000000000
--- a/benchmark/bm_vm2_proc.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-def m &b
-  b
-end
-
-pr = m{
-  a = 1
-}
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  pr.call
-end
-
diff --git a/benchmark/bm_vm2_raise1.rb b/benchmark/bm_vm2_raise1.rb
deleted file mode 100644
index aa5387987f..0000000000
--- a/benchmark/bm_vm2_raise1.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-def rec n
-  if n > 0
-    rec n-1
-  else
-    raise
-  end
-end
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-
-  begin
-    rec 1
-  rescue
-    # ignore
-  end
-end
diff --git a/benchmark/bm_vm2_raise2.rb b/benchmark/bm_vm2_raise2.rb
deleted file mode 100644
index 1f61c63157..0000000000
--- a/benchmark/bm_vm2_raise2.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-def rec n
-  if n > 0
-    rec n-1
-  else
-    raise
-  end
-end
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-
-  begin
-    rec 10
-  rescue
-    # ignore
-  end
-end
diff --git a/benchmark/bm_vm2_regexp.rb b/benchmark/bm_vm2_regexp.rb
deleted file mode 100644
index 55f9e957a3..0000000000
--- a/benchmark/bm_vm2_regexp.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i = 0
-str = 'xxxhogexxx'
-while i<6_000_000 # benchmark loop 2
-  /hoge/ =~ str
-  i += 1
-end
diff --git a/benchmark/bm_vm2_send.rb b/benchmark/bm_vm2_send.rb
deleted file mode 100644
index 6a3ab6fdab..0000000000
--- a/benchmark/bm_vm2_send.rb
+++ /dev/null
@@ -1,12 +0,0 @@
-class C
-  def m
-  end
-end
-
-o = C.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  o.__send__ :m
-end
diff --git a/benchmark/bm_vm2_super.rb b/benchmark/bm_vm2_super.rb
deleted file mode 100644
index afd8579e7b..0000000000
--- a/benchmark/bm_vm2_super.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-
-class C
-  def m
-    1
-  end
-end
-
-class CC < C
-  def m
-    super()
-  end
-end
-
-obj = CC.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  obj.m
-  i += 1
-end
diff --git a/benchmark/bm_vm2_unif1.rb b/benchmark/bm_vm2_unif1.rb
deleted file mode 100644
index 1774625942..0000000000
--- a/benchmark/bm_vm2_unif1.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i = 0
-def m a, b
-end
-
-while i<6_000_000 # benchmark loop 2
-  i += 1
-  m 100, 200
-end
diff --git a/benchmark/bm_vm2_zsuper.rb b/benchmark/bm_vm2_zsuper.rb
deleted file mode 100644
index 2a43e62217..0000000000
--- a/benchmark/bm_vm2_zsuper.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-i = 0
-
-class C
-  def m a
-    1
-  end
-end
-
-class CC < C
-  def m a
-    super
-  end
-end
-
-obj = CC.new
-
-while i<6_000_000 # benchmark loop 2
-  obj.m 10
-  i += 1
-end
diff --git a/benchmark/bm_vm3_gc.rb b/benchmark/bm_vm3_gc.rb
deleted file mode 100755
index 7db9829d44..0000000000
--- a/benchmark/bm_vm3_gc.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-#! /usr/bin/ruby
-5000.times do
-  100.times do
-    {"xxxx"=>"yyyy"}
-  end
-  GC.start
-end
diff --git a/benchmark/bm_vm_thread_alive_check1.rb b/benchmark/bm_vm_thread_alive_check1.rb
deleted file mode 100644
index c993accdda..0000000000
--- a/benchmark/bm_vm_thread_alive_check1.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-5_000.times{
-  t = Thread.new{}
-  while t.alive?
-    Thread.pass
-  end
-}
diff --git a/benchmark/bm_vm_thread_mutex1.rb b/benchmark/bm_vm_thread_mutex1.rb
deleted file mode 100644
index 5c9f85dfb7..0000000000
--- a/benchmark/bm_vm_thread_mutex1.rb
+++ /dev/null
@@ -1,21 +0,0 @@
-# one thread, one mutex (no contention)
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-lmax = max * max
-(1..1).map{
-  Thread.new{
-    i = 0
-    while i<lmax
-      i += 1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_mutex2.rb b/benchmark/bm_vm_thread_mutex2.rb
deleted file mode 100644
index 10de59054f..0000000000
--- a/benchmark/bm_vm_thread_mutex2.rb
+++ /dev/null
@@ -1,21 +0,0 @@
-# two threads, one mutex
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-lmax = (max * max)/2
-(1..2).map{
-  Thread.new{
-    i = 0
-    while i<lmax
-      i += 1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_mutex3.rb b/benchmark/bm_vm_thread_mutex3.rb
deleted file mode 100644
index 7f9a44b39d..0000000000
--- a/benchmark/bm_vm_thread_mutex3.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-# 1000 threads, one mutex
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-(1..max).map{
-  Thread.new{
-    i = 0
-    while i<max
-      i += 1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_pass.rb b/benchmark/bm_vm_thread_pass.rb
deleted file mode 100644
index b5b3c0bc85..0000000000
--- a/benchmark/bm_vm_thread_pass.rb
+++ /dev/null
@@ -1,15 +0,0 @@
-# Plenty Thtread.pass
-# A performance may depend on GVL implementation.
-
-tmax = (ARGV.shift || 2).to_i
-lmax = 200_000 / tmax
-
-(1..tmax).map{
-  Thread.new{
-    lmax.times{
-      Thread.pass
-    }
-  }
-}.each{|t| t.join}
-
-
diff --git a/benchmark/bm_vm_thread_pass_flood.rb b/benchmark/bm_vm_thread_pass_flood.rb
deleted file mode 100644
index 27157d1a6f..0000000000
--- a/benchmark/bm_vm_thread_pass_flood.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-1000.times{
-  Thread.new{loop{Thread.pass}}
-}
-
-i = 0
-while i<10000
-  i += 1
-end
diff --git a/benchmark/bm_vm_thread_pipe.rb b/benchmark/bm_vm_thread_pipe.rb
deleted file mode 100644
index 272d231eba..0000000000
--- a/benchmark/bm_vm_thread_pipe.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# Mesure small and plenty pipe read/write.
-# A performance may depend on GVL implementation.
-
-lmax = 100_000
-r, w = IO.pipe
-[Thread.new{
-  lmax.times{
-    w.write('a')
-  }
-  p "w:exit"
-}, Thread.new{
-  lmax.times{
-    r.read(1)
-  }
-  p "r:exit"
-}].each{|t| t.join}
-
diff --git a/benchmark/buffer_each.yml b/benchmark/buffer_each.yml
new file mode 100644
index 0000000000..417941104e
--- /dev/null
+++ b/benchmark/buffer_each.yml
@@ -0,0 +1,27 @@
+prelude: |
+  # frozen_string_literal: true
+  Warning[:experimental] = false
+  string = "The quick brown fox jumped over the lazy dog."
+  array = string.bytes
+  buffer = IO::Buffer.for(string)
+benchmark:
+  string.each_byte: |
+    upcased = String.new
+    string.each_byte do |byte|
+      upcased << (byte ^ 32)
+    end
+  array.each: |
+    upcased = String.new
+    array.each do |byte|
+      upcased << (byte ^ 32)
+    end
+  buffer.each: |
+    upcased = String.new
+    buffer.each(:U8) do |offset, byte|
+      upcased << (byte ^ 32)
+    end
+  buffer.each_byte: |
+    upcased = String.new
+    buffer.each_byte do |byte|
+      upcased << (byte ^ 32)
+    end
diff --git a/benchmark/buffer_get.yml b/benchmark/buffer_get.yml
new file mode 100644
index 0000000000..9e1f99d64e
--- /dev/null
+++ b/benchmark/buffer_get.yml
@@ -0,0 +1,25 @@
+prelude: |
+  # frozen_string_literal: true
+  Warning[:experimental] = false
+  string = "The quick brown fox jumped over the lazy dog."
+  buffer = IO::Buffer.for(string)
+  format = [:U32, :U32, :U32, :U32]
+benchmark:
+  string.unpack1: |
+    [
+      string.unpack1("N"),
+      string.unpack1("N", offset: 4),
+      string.unpack1("N", offset: 8),
+      string.unpack1("N", offset: 12),
+    ]
+  buffer.get_value: |
+    [
+      buffer.get_value(:U32, 0),
+      buffer.get_value(:U32, 4),
+      buffer.get_value(:U32, 8),
+      buffer.get_value(:U32, 12),
+    ]
+  buffer.get_values: |
+    buffer.get_values(format, 0)
+  string.unpack: |
+    string.unpack("NNNN")
diff --git a/benchmark/cgi_escape_html.yml b/benchmark/cgi_escape_html.yml
new file mode 100644
index 0000000000..655be9d7d8
--- /dev/null
+++ b/benchmark/cgi_escape_html.yml
@@ -0,0 +1,31 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'cgi/escape'
+benchmark:
+  - script: CGI.escapeHTML("")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("abcde")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("abcd<")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("'&\"<>")
+    loop_count: 5000000
+  - prelude: long_no_escape = "abcde" * 300
+    script: CGI.escapeHTML(long_no_escape)
+    loop_count: 1000000
+  - prelude: long_all_escape = "'&\"<>" * 10
+    script: CGI.escapeHTML(long_all_escape)
+    loop_count: 1000000
+  - prelude: | # http://example.com/
+      example_html = <<~HTML
+        <body>
+        <div>
+            <h1>Example Domain</h1>
+            <p>This domain is established to be used for illustrative examples in documents. You may use this
+            domain in examples without prior coordination or asking for permission.</p>
+            <p><a href="http://www.iana.org/domains/example">More information...</a></p>
+        </div>
+        </body>
+      HTML
+    script: CGI.escapeHTML(example_html)
+    loop_count: 1000000
diff --git a/benchmark/complex_float_add.yml b/benchmark/complex_float_add.yml
new file mode 100644
index 0000000000..d0150c5e5b
--- /dev/null
+++ b/benchmark/complex_float_add.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_add: c = a + b
+loop_count: 1000000
diff --git a/benchmark/complex_float_div.yml b/benchmark/complex_float_div.yml
new file mode 100644
index 0000000000..b9f5e1d51c
--- /dev/null
+++ b/benchmark/complex_float_div.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_div: c = a / b
+loop_count: 1000000
diff --git a/benchmark/complex_float_mul.yml b/benchmark/complex_float_mul.yml
new file mode 100644
index 0000000000..59b096a6dc
--- /dev/null
+++ b/benchmark/complex_float_mul.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_mul: c = a * b
+loop_count: 1000000
diff --git a/benchmark/complex_float_new.yml b/benchmark/complex_float_new.yml
new file mode 100644
index 0000000000..6fcde3125b
--- /dev/null
+++ b/benchmark/complex_float_new.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_new: c = Complex(a, b)
+loop_count: 1000000
diff --git a/benchmark/complex_float_power.yml b/benchmark/complex_float_power.yml
new file mode 100644
index 0000000000..c40a31ab55
--- /dev/null
+++ b/benchmark/complex_float_power.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_power: c = a ** b
+loop_count: 1000000
diff --git a/benchmark/complex_float_sub.yml b/benchmark/complex_float_sub.yml
new file mode 100644
index 0000000000..3fafe7cdbe
--- /dev/null
+++ b/benchmark/complex_float_sub.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_sub: c = a - b
+loop_count: 1000000
diff --git a/benchmark/constant_invalidation.rb b/benchmark/constant_invalidation.rb
new file mode 100644
index 0000000000..a95ec6f37e
--- /dev/null
+++ b/benchmark/constant_invalidation.rb
@@ -0,0 +1,22 @@
+$VERBOSE = nil
+
+CONSTANT1 = 1
+CONSTANT2 = 1
+CONSTANT3 = 1
+CONSTANT4 = 1
+CONSTANT5 = 1
+
+def constants
+  [CONSTANT1, CONSTANT2, CONSTANT3, CONSTANT4, CONSTANT5]
+end
+
+500_000.times do
+  constants
+
+  # With previous behavior, this would cause all of the constant caches
+  # associated with the constant lookups listed above to invalidate, meaning
+  # they would all have to be fetched again. With current behavior, it only
+  # invalidates when a name matches, so the following constant set shouldn't
+  # impact the constant lookups listed above.
+  INVALIDATE = true
+end
diff --git a/benchmark/dir_empty_p.rb b/benchmark/dir_empty_p.rb
new file mode 100644
index 0000000000..8329c757cf
--- /dev/null
+++ b/benchmark/dir_empty_p.rb
@@ -0,0 +1,5 @@
+require 'tmpdir'
+max = 100_000
+Dir.mktmpdir('bm_dir_empty_p') do |dir|
+  max.times { Dir.empty?(dir) }
+end
diff --git a/benchmark/driver.rb b/benchmark/driver.rb
deleted file mode 100644
index 695dc41aff..0000000000
--- a/benchmark/driver.rb
+++ /dev/null
@@ -1,301 +0,0 @@
-#
-# Ruby Benchmark driver
-#
-
-first = true
-
-begin
-  require 'optparse'
-rescue LoadError
-  if first
-    first = false
-    $:.unshift File.join(File.dirname(__FILE__), '../lib')
-    retry
-  else
-    raise
-  end
-end
-
-require 'benchmark'
-require 'pp'
-
-class BenchmarkDriver
-  def self.benchmark(opt)
-    driver = self.new(opt[:execs], opt[:dir], opt)
-    begin
-      driver.run
-    ensure
-      driver.show_results
-    end
-  end
-
-  def output *args
-    puts(*args)
-    @output and @output.puts(*args)
-  end
-
-  def message *args
-    output(*args) if @verbose
-  end
-
-  def message_print *args
-    if @verbose
-      print(*args)
-      STDOUT.flush
-      @output and @output.print(*args)
-    end
-  end
-
-  def progress_message *args
-    unless STDOUT.tty?
-      STDERR.print(*args)
-      STDERR.flush
-    end
-  end
-
-  def initialize execs, dir, opt = {}
-    @execs = execs.map{|e|
-      e.strip!
-      next if e.empty?
-
-      if /(.+)::(.+)/ =~ e
-        # ex) ruby-a::/path/to/ruby-a
-        label = $1.strip
-        path = $2
-        version = `#{path} -v`.chomp
-      else
-        path = e
-        version = label = `#{path} -v`.chomp
-      end
-      [path, label, version]
-    }.compact
-
-    @dir = dir
-    @repeat = opt[:repeat] || 1
-    @repeat = 1 if @repeat < 1
-    @pattern = opt[:pattern] || nil
-    @exclude = opt[:exclude] || nil
-    @verbose = opt[:quiet] ? false : (opt[:verbose] || false)
-    @output = opt[:output] ? open(opt[:output], 'w') : nil
-    @loop_wl1 = @loop_wl2 = nil
-    @ruby_arg = opt[:ruby_arg] || nil
-    @opt = opt
-
-    # [[name, [[r-1-1, r-1-2, ...], [r-2-1, r-2-2, ...]]], ...]
-    @results = []
-
-    if @verbose
-      @start_time = Time.now
-      message @start_time
-      @execs.each_with_index{|(path, label, version), i|
-        message "target #{i}: " + (label == version ? "#{label}" : "#{label} (#{version})") + " at \"#{path}\""
-      }
-    end
-  end
-
-  def adjusted_results name, results
-    s = nil
-    results.each_with_index{|e, i|
-      r = e.min
-      case name
-      when /^vm1_/
-        if @loop_wl1
-          r -= @loop_wl1[i]
-          r = 0 if r < 0
-          s = '*'
-        end
-      when /^vm2_/
-        if @loop_wl2
-          r -= @loop_wl2[i]
-          r = 0 if r < 0
-          s = '*'
-        end
-      end
-      yield r
-    }
-    s
-  end
-
-  def show_results
-    output
-
-    if @verbose
-      message '-----------------------------------------------------------'
-      message 'raw data:'
-      message
-      message PP.pp(@results, "", 79)
-      message
-      message "Elapsed time: #{Time.now - @start_time} (sec)"
-    end
-
-    output '-----------------------------------------------------------'
-    output 'benchmark results:'
-
-    if @verbose and @repeat > 1
-      output "minimum results in each #{@repeat} measurements."
-    end
-
-    output "Execution time (sec)"
-    output "name\t#{@execs.map{|(_, v)| v}.join("\t")}"
-    @results.each{|v, result|
-      rets = []
-      s = adjusted_results(v, result){|r|
-        rets << sprintf("%.3f", r)
-      }
-      output "#{v}#{s}\t#{rets.join("\t")}"
-    }
-
-    if @execs.size > 1
-      output
-      output "Speedup ratio: compare with the result of `#{@execs[0][1]}' (greater is better)"
-      output "name\t#{@execs[1..-1].map{|(_, v)| v}.join("\t")}"
-      @results.each{|v, result|
-        rets = []
-        first_value = nil
-        s = adjusted_results(v, result){|r|
-          if first_value
-            if r == 0
-              rets << "Error"
-            else
-              rets << sprintf("%.3f", first_value/r)
-            end
-          else
-            first_value = r
-          end
-        }
-        output "#{v}#{s}\t#{rets.join("\t")}"
-      }
-    end
-
-    if @opt[:output]
-      output
-      output "Log file: #{@opt[:output]}"
-    end
-  end
-
-  def files
-    flag = {}
-    @files = Dir.glob(File.join(@dir, 'bm*.rb')).map{|file|
-      next if @pattern && /#{@pattern}/ !~ File.basename(file)
-      next if @exclude && /#{@exclude}/ =~ File.basename(file)
-      case file
-      when /bm_(vm[12])_/, /bm_loop_(whileloop2?).rb/
-        flag[$1] = true
-      end
-      file
-    }.compact
-
-    if flag['vm1'] && !flag['whileloop']
-      @files << File.join(@dir, 'bm_loop_whileloop.rb')
-    elsif flag['vm2'] && !flag['whileloop2']
-      @files << File.join(@dir, 'bm_loop_whileloop2.rb')
-    end
-
-    @files.sort!
-    progress_message "total: #{@files.size * @repeat} trial(s) (#{@repeat} trial(s) for #{@files.size} benchmark(s))\n"
-    @files
-  end
-
-  def run
-    files.each_with_index{|file, i|
-      @i = i
-      r = measure_file(file)
-
-      if /bm_loop_whileloop.rb/ =~ file
-        @loop_wl1 = r[1].map{|e| e.min}
-      elsif /bm_loop_whileloop2.rb/ =~ file
-        @loop_wl2 = r[1].map{|e| e.min}
-      end
-    }
-  end
-
-  def measure_file file
-    name = File.basename(file, '.rb').sub(/^bm_/, '')
-    prepare_file = File.join(File.dirname(file), "prepare_#{name}.rb")
-    load prepare_file if FileTest.exist?(prepare_file)
-
-    if @verbose
-      output
-      output '-----------------------------------------------------------'
-      output name
-      output
-      output File.read(file)
-      output
-    end
-
-    result = [name]
-    result << @execs.map{|(e, v)|
-      (0...@repeat).map{
-        message_print "#{v}\t"
-        progress_message '.'
-
-        m = measure(e, file)
-        message "#{m}"
-        m
-      }
-    }
-    @results << result
-    result
-  end
-
-  def measure executable, file
-    cmd = "#{executable} #{@ruby_arg} #{file}"
-
-    m = Benchmark.measure{
-      `#{cmd}`
-    }
-
-    if $? != 0
-      output "\`#{cmd}\' exited with abnormal status (#{$?})"
-      0
-    else
-      m.real
-    end
-  end
-end
-
-if __FILE__ == $0
-  opt = {
-    :execs => [],
-    :dir => File.dirname(__FILE__),
-    :repeat => 1,
-    :output => "bmlog-#{Time.now.strftime('%Y%m%d-%H%M%S')}.#{$$}",
-  }
-
-  parser = OptionParser.new{|o|
-    o.on('-e', '--executables [EXECS]',
-      "Specify benchmark one or more targets (e1::path1; e2::path2; e3::path3;...)"){|e|
-       e.split(/;/).each{|path|
-         opt[:execs] << path
-       }
-    }
-    o.on('-d', '--directory [DIRECTORY]', "Benchmark suites directory"){|d|
-      opt[:dir] = d
-    }
-    o.on('-p', '--pattern [PATTERN]', "Benchmark name pattern"){|p|
-      opt[:pattern] = p
-    }
-    o.on('-x', '--exclude [PATTERN]', "Benchmark exclude pattern"){|e|
-      opt[:exclude] = e
-    }
-    o.on('-r', '--repeat-count [NUM]', "Repeat count"){|n|
-      opt[:repeat] = n.to_i
-    }
-    o.on('-o', '--output-file [FILE]', "Output file"){|f|
-      opt[:output] = f
-    }
-    o.on('--ruby-arg [ARG]', "Optional argument for ruby"){|a|
-      opt[:ruby_arg] = a
-    }
-    o.on('-q', '--quiet', "Run without notify information except result table."){|q|
-      opt[:quiet] = q
-    }
-    o.on('-v', '--verbose'){|v|
-      opt[:verbose] = v
-    }
-  }
-
-  parser.parse!(ARGV)
-  BenchmarkDriver.benchmark(opt)
-end
-
diff --git a/benchmark/enum_lazy_flat_map.yml b/benchmark/enum_lazy_flat_map.yml
new file mode 100644
index 0000000000..0ee390a441
--- /dev/null
+++ b/benchmark/enum_lazy_flat_map.yml
@@ -0,0 +1,16 @@
+prelude: |
+  num = (1..).lazy.take(100)
+  ary2 = [[1,2]].cycle.lazy.take(10)
+  ary10 = [[*1..10]].cycle.lazy.take(10)
+  ary20 = [[*1..20]].cycle.lazy.take(10)
+  ary50 = [[*1..50]].cycle.lazy.take(10)
+  ary100 = [[*1..100]].cycle.lazy.take(10)
+
+benchmark:
+  num3: num.flat_map {|x| x}.take(3).to_a
+  num10: num.flat_map {|x| x}.take(3).to_a
+  ary2:  ary2.flat_map {|x| x}.take(3).to_a
+  ary10: ary10.flat_map {|x| x}.take(3).to_a
+  ary20: ary20.flat_map {|x| x}.take(3).to_a
+  ary50: ary50.flat_map {|x| x}.take(3).to_a
+  ary100: ary100.flat_map {|x| x}.take(3).to_a
diff --git a/benchmark/enum_lazy_grep_v_100.rb b/benchmark/enum_lazy_grep_v_100.rb
new file mode 100644
index 0000000000..8832392e65
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_100.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i == 0}).grep_v(->(i){i == 0})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_grep_v_20.rb b/benchmark/enum_lazy_grep_v_20.rb
new file mode 100644
index 0000000000..329509fa8f
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_20.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i > 2}).grep_v(->(i){i > 2})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_grep_v_50.rb b/benchmark/enum_lazy_grep_v_50.rb
new file mode 100644
index 0000000000..02ea4d4e71
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_50.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i > 5}).grep_v(->(i){i > 5})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_100.rb b/benchmark/enum_lazy_uniq_100.rb
new file mode 100644
index 0000000000..2e6434d9c4
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_100.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 10000}.uniq {|i| i % 10000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_20.rb b/benchmark/enum_lazy_uniq_20.rb
new file mode 100644
index 0000000000..75e6398fee
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_20.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 2000}.uniq {|i| i % 2000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_50.rb b/benchmark/enum_lazy_uniq_50.rb
new file mode 100644
index 0000000000..59a39b78ff
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_50.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 5000}.uniq {|i| i % 5000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_zip.yml b/benchmark/enum_lazy_zip.yml
new file mode 100644
index 0000000000..4566ff0261
--- /dev/null
+++ b/benchmark/enum_lazy_zip.yml
@@ -0,0 +1,22 @@
+prelude: |
+  a = (1..3).lazy
+  b = a.map {|x| x}
+
+benchmark:
+  first_ary: a.zip(["a", "b", "c"]).first
+  first_nonary: a.zip("a".."c").first
+  first_noarg: a.zip.first
+
+  take3_ary: a.zip(["a", "b", "c"]).take(3).force
+  take3_nonary: a.zip("a".."c").take(3).force
+  take3_noarg: a.zip.take(3).force
+
+  chain-first_ary: b.zip(["a", "b", "c"]).first
+  chain-first_nonary: b.zip("a".."c").first
+  chain-first_noarg: b.zip.first
+
+  chain-take3_ary: b.zip(["a", "b", "c"]).take(3).force
+  chain-take3_nonary: b.zip("a".."c").take(3).force
+  chain-take3_noarg: b.zip.take(3).force
+
+  block: a.zip("a".."c") {|x, y| [x, y]}
diff --git a/benchmark/enum_minmax.yml b/benchmark/enum_minmax.yml
new file mode 100644
index 0000000000..9d01731abb
--- /dev/null
+++ b/benchmark/enum_minmax.yml
@@ -0,0 +1,25 @@
+prelude: |
+  set2 = 2.times.to_a.shuffle.to_set
+  set10 = 10.times.to_a.shuffle.to_set
+  set100 = 100.times.to_a.shuffle.to_set
+  set1000 = 1000.times.to_a.shuffle.to_set
+  set10000 = 10000.times.to_a.shuffle.to_set
+
+benchmark:
+  set2.min: set2.min
+  set10.min: set10.min
+  set100.min: set100.min
+  set1000.min: set1000.min
+  set10000.min: set10000.min
+  set2.max: set2.max
+  set10.max: set10.max
+  set100.max: set100.max
+  set1000.max: set1000.max
+  set10000.max: set10000.max
+  set2.minmax: set2.minmax
+  set10.minmax: set10.minmax
+  set100.minmax: set100.minmax
+  set1000.minmax: set1000.minmax
+  set10000.minmax: set10000.minmax
+
+loop_count: 10000
diff --git a/benchmark/enum_sort.yml b/benchmark/enum_sort.yml
new file mode 100644
index 0000000000..6f26e748c6
--- /dev/null
+++ b/benchmark/enum_sort.yml
@@ -0,0 +1,15 @@
+prelude: |
+  set2 = 2.times.to_a.shuffle.to_set
+  set10 = 10.times.to_a.shuffle.to_set
+  set100 = 100.times.to_a.shuffle.to_set
+  set1000 = 1000.times.to_a.shuffle.to_set
+  set10000 = 10000.times.to_a.shuffle.to_set
+
+benchmark:
+  set2.sort_by: set2.sort_by { 0 }
+  set10.sort_by: set10.sort_by { 0 }
+  set100.sort_by: set100.sort_by { 0 }
+  set1000.sort_by: set1000.sort_by { 0 }
+  set10000.sort_by: set10000.sort_by { 0 }
+
+loop_count: 10000
diff --git a/benchmark/enum_tally.yml b/benchmark/enum_tally.yml
new file mode 100644
index 0000000000..edd2e040a0
--- /dev/null
+++ b/benchmark/enum_tally.yml
@@ -0,0 +1,4 @@
+prelude: |
+  list = ("aaa".."zzz").to_a*10
+benchmark:
+  tally: list.tally
diff --git a/benchmark/erb_escape_html.yml b/benchmark/erb_escape_html.yml
new file mode 100644
index 0000000000..ca28d756e7
--- /dev/null
+++ b/benchmark/erb_escape_html.yml
@@ -0,0 +1,31 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'erb'
+benchmark:
+  - script: ERB::Util.html_escape("")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("abcde")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("abcd<")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("'&\"<>")
+    loop_count: 5000000
+  - prelude: long_no_escape = "abcde" * 300
+    script: ERB::Util.html_escape(long_no_escape)
+    loop_count: 1000000
+  - prelude: long_all_escape = "'&\"<>" * 10
+    script: ERB::Util.html_escape(long_all_escape)
+    loop_count: 1000000
+  - prelude: | # http://example.com/
+      example_html = <<~HTML
+        <body>
+        <div>
+            <h1>Example Domain</h1>
+            <p>This domain is established to be used for illustrative examples in documents. You may use this
+            domain in examples without prior coordination or asking for permission.</p>
+            <p><a href="http://www.iana.org/domains/example">More information...</a></p>
+        </div>
+        </body>
+      HTML
+    script: ERB::Util.html_escape(example_html)
+    loop_count: 1000000
diff --git a/benchmark/erb_render.yml b/benchmark/erb_render.yml
new file mode 100644
index 0000000000..15f6c3880b
--- /dev/null
+++ b/benchmark/erb_render.yml
@@ -0,0 +1,24 @@
+prelude: |
+  require 'erb'
+
+  data = <<erb
+  <html>
+    <head> <%= title %> </head>
+    <body>
+      <h1> <%= title %> </h1>
+      <p>
+        <%= content %>
+      </p>
+    </body>
+  </html>
+  erb
+
+  title = "hello world!"
+  content = "hello world!\n" * 10
+
+  src = "def self.render(title, content); #{ERB.new(data).src}; end"
+  mod = Module.new
+  mod.instance_eval(src, "(ERB)")
+benchmark:
+  erb_render: mod.render(title, content)
+loop_count: 1500000
diff --git a/benchmark/fiber_chain.yml b/benchmark/fiber_chain.yml
new file mode 100644
index 0000000000..a36c759f8e
--- /dev/null
+++ b/benchmark/fiber_chain.yml
@@ -0,0 +1,36 @@
+prelude: |
+  def make_link(previous)
+    Fiber.new do
+      while message = previous.resume
+        Fiber.yield(message)
+      end
+    end
+  end
+
+  def make_chain(length = 1000, &block)
+    chain = Fiber.new(&block)
+
+    (length - 1).times do
+      chain = make_link(chain)
+    end
+
+    return chain
+  end
+
+  message = "Hello World!"
+
+  chain = make_chain do
+    while true
+      Fiber.yield(message)
+    end
+  end
+benchmark:
+  make_chain: |
+    make_chain(100) do
+      while true
+        Fiber.yield(message)
+      end
+    end
+  resume_chain: |
+    chain.resume
+loop_count: 5000
diff --git a/benchmark/fiber_locals.yml b/benchmark/fiber_locals.yml
new file mode 100644
index 0000000000..8588686477
--- /dev/null
+++ b/benchmark/fiber_locals.yml
@@ -0,0 +1,8 @@
+prelude: |
+  th = Thread.current
+  th[:key] = :val
+benchmark:
+  key?: th.key?(:key)
+  []: th[:key]
+  keys: th.keys
+loop_count: 1_000_000
diff --git a/benchmark/file_chmod.rb b/benchmark/file_chmod.rb
new file mode 100644
index 0000000000..1cd4760c9d
--- /dev/null
+++ b/benchmark/file_chmod.rb
@@ -0,0 +1,9 @@
+# chmod file
+require 'tempfile'
+max = 200_000
+tmp = Tempfile.new('chmod')
+path = tmp.path
+max.times do
+  File.chmod(0777, path)
+end
+tmp.close!
diff --git a/benchmark/file_rename.rb b/benchmark/file_rename.rb
new file mode 100644
index 0000000000..bbb44aebac
--- /dev/null
+++ b/benchmark/file_rename.rb
@@ -0,0 +1,11 @@
+# rename file
+require 'tempfile'
+
+max = 100_000
+tmp = [ Tempfile.new('rename-a'), Tempfile.new('rename-b') ]
+a, b = tmp.map { |x| x.path }
+tmp.each { |t| t.close } # Windows can't rename files without closing them
+max.times do
+  File.rename(a, b)
+  File.rename(b, a)
+end
diff --git a/benchmark/float_methods.yml b/benchmark/float_methods.yml
new file mode 100644
index 0000000000..56ea41effc
--- /dev/null
+++ b/benchmark/float_methods.yml
@@ -0,0 +1,14 @@
+prelude: |
+  flo = 4.2
+benchmark:
+  to_f: |
+    flo.to_f
+  abs: |
+    flo.abs
+  magnitude: |
+    flo.magnitude
+  -@: |
+    -flo
+  zero?: |
+    flo.zero?
+loop_count: 20000000
diff --git a/benchmark/float_neg_posi.yml b/benchmark/float_neg_posi.yml
new file mode 100644
index 0000000000..172db1bf6d
--- /dev/null
+++ b/benchmark/float_neg_posi.yml
@@ -0,0 +1,8 @@
+prelude: |
+  flo = 4.2
+benchmark:
+  negative?: |
+    flo.negative?
+  positive?: |
+    flo.positive?
+loop_count: 20000000
diff --git a/benchmark/float_to_s.yml b/benchmark/float_to_s.yml
new file mode 100644
index 0000000000..0abae5cdb8
--- /dev/null
+++ b/benchmark/float_to_s.yml
@@ -0,0 +1,7 @@
+prelude: |
+  floats = [*0.0.step(1.0, 0.0001)]
+
+benchmark:
+  to_s: floats.each {|f| f.to_s}
+
+loop_count: 1000
diff --git a/benchmark/gc/aobench.rb b/benchmark/gc/aobench.rb
index 2eed7abc83..275f58b924 100644
--- a/benchmark/gc/aobench.rb
+++ b/benchmark/gc/aobench.rb
@@ -1 +1 @@
-require_relative '../bm_app_aobench.rb'
+require_relative '../app_aobench'
diff --git a/benchmark/gc/binary_trees.rb b/benchmark/gc/binary_trees.rb
index af8ea722aa..83347cdd20 100644
--- a/benchmark/gc/binary_trees.rb
+++ b/benchmark/gc/binary_trees.rb
@@ -1 +1 @@
-require_relative '../bm_so_binary_trees.rb'
+require_relative '../so_binary_trees'
diff --git a/benchmark/gc/gcbench.rb b/benchmark/gc/gcbench.rb
index 722a69f0ed..23d0b91c6c 100644
--- a/benchmark/gc/gcbench.rb
+++ b/benchmark/gc/gcbench.rb
@@ -1,6 +1,15 @@
-
 require 'benchmark'
 require 'pp'
+require 'optparse'
+
+$list = true
+$gcprof = false
+
+opt = OptionParser.new
+opt.on('-q'){$list = false}
+opt.on('-d'){$gcprof = false}
+opt.on('-p'){$gcprof = true}
+opt.parse!(ARGV)
 
 script = File.join(File.dirname(__FILE__), ARGV.shift)
 script += '.rb' unless FileTest.exist?(script)
@@ -8,15 +17,26 @@ raise "#{script} not found" unless FileTest.exist?(script)
 
 puts "Script: #{script}"
 
-GC::Profiler.enable
+if $gcprof
+  GC::Profiler.enable
+end
+
 tms = Benchmark.measure{|x|
   load script
 }
-gc_time = GC::Profiler.total_time
-GC::Profiler.report if RUBY_VERSION >= '2.0.0' # before 1.9.3, report() may run infinite loop
-GC::Profiler.disable
+
+gc_time = 0
+
+if $gcprof
+  gc_time = GC::Profiler.total_time
+  GC::Profiler.report if $list and RUBY_VERSION >= '2.0.0' # before 1.9.3, report() may run infinite loop
+  GC::Profiler.disable
+end
+
 pp GC.stat
 
+puts "#{RUBY_DESCRIPTION} #{GC::OPTS.inspect}" if defined?(GC::OPTS)
+
 desc = "#{RUBY_VERSION}#{RUBY_PATCHLEVEL >= 0 ? "p#{RUBY_PATCHLEVEL}" : "dev"}"
 name = File.basename(script, '.rb')
 
@@ -25,6 +45,13 @@ puts script
 puts Benchmark::CAPTION
 puts tms
 puts "GC total time (sec): #{gc_time}"
+
+# show High-Water Mark on Linux
+if File.exist?('/proc/self/status') && /VmHWM:\s*(\d+.+)/ =~ File.read('/proc/self/status')
+  puts
+  puts "VmHWM: #{$1.chomp}"
+end
+
 puts
 puts "Summary of #{name} on #{desc}\t#{tms.real}\t#{gc_time}\t#{GC.count}"
 puts "         (real time in sec, GC time in sec, GC count)"
diff --git a/benchmark/gc/pentomino.rb b/benchmark/gc/pentomino.rb
index 94ba74be89..8ebdff7d1d 100644
--- a/benchmark/gc/pentomino.rb
+++ b/benchmark/gc/pentomino.rb
@@ -1 +1 @@
-require_relative '../bm_app_pentomino.rb'
+require_relative '../app_pentomino'
diff --git a/benchmark/hash_aref_array.rb b/benchmark/hash_aref_array.rb
new file mode 100644
index 0000000000..ac7a683d95
--- /dev/null
+++ b/benchmark/hash_aref_array.rb
@@ -0,0 +1,5 @@
+h = {}
+arrays = (0..99).each_slice(10).to_a
+#STDERR.puts arrays.inspect
+arrays.each { |s| h[s] = s }
+200_000.times { arrays.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_dsym.rb b/benchmark/hash_aref_dsym.rb
new file mode 100644
index 0000000000..af4f8c36d4
--- /dev/null
+++ b/benchmark/hash_aref_dsym.rb
@@ -0,0 +1,4 @@
+h = {}
+syms = ('a'..'z').map { |s| s.to_sym }
+syms.each { |s| h[s] = 1 }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_dsym_long.rb b/benchmark/hash_aref_dsym_long.rb
new file mode 100644
index 0000000000..9d7759379e
--- /dev/null
+++ b/benchmark/hash_aref_dsym_long.rb
@@ -0,0 +1,21 @@
+# [ruby-core:70129] [Bug #11396]
+collection_size = 200000
+sample_size = 10000
+
+values = (1..collection_size).to_a.map do |x|
+  "THIS IS A LONGER STRING THAT IS ALSO UNIQUE #{x}"
+end
+
+symbol_hash = {}
+
+values.each do |x|
+  symbol_hash[x.to_sym] = 1
+end
+
+# use the same samples each time to minimize deviations
+rng = Random.new(0)
+symbol_sample_array = values.sample(sample_size, random: rng).map(&:to_sym)
+
+3000.times do
+  symbol_sample_array.each { |x| symbol_hash[x] }
+end
diff --git a/benchmark/hash_aref_fix.rb b/benchmark/hash_aref_fix.rb
new file mode 100644
index 0000000000..1346890582
--- /dev/null
+++ b/benchmark/hash_aref_fix.rb
@@ -0,0 +1,4 @@
+h = {}
+nums = (1..26).to_a
+nums.each { |i| h[i] = i }
+200_000.times { nums.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_flo.rb b/benchmark/hash_aref_flo.rb
new file mode 100644
index 0000000000..2217274c82
--- /dev/null
+++ b/benchmark/hash_aref_flo.rb
@@ -0,0 +1,4 @@
+h = {}
+strs = [*1..10000].map! {|i| i.fdiv(10)}
+strs.each { |s| h[s] = s }
+50.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_miss.rb b/benchmark/hash_aref_miss.rb
new file mode 100644
index 0000000000..b0913dd4bb
--- /dev/null
+++ b/benchmark/hash_aref_miss.rb
@@ -0,0 +1,5 @@
+h = {}
+strs = ('a'..'z').to_a.map!(&:freeze)
+strs.each { |s| h[s] = s }
+strs = ('A'..'Z').to_a
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_str.rb b/benchmark/hash_aref_str.rb
new file mode 100644
index 0000000000..19439b061b
--- /dev/null
+++ b/benchmark/hash_aref_str.rb
@@ -0,0 +1,4 @@
+h = {}
+strs = ('a'..'z').to_a.map!(&:freeze)
+strs.each { |s| h[s] = s }
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_sym.rb b/benchmark/hash_aref_sym.rb
new file mode 100644
index 0000000000..f75d163fe6
--- /dev/null
+++ b/benchmark/hash_aref_sym.rb
@@ -0,0 +1,9 @@
+h = {}
+syms = ('a'..'z').to_a
+begin
+  syms = eval("%i[#{syms.join(' ')}]")
+rescue SyntaxError # <= 1.9.3
+  syms.map!(&:to_sym)
+end
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_sym_long.rb b/benchmark/hash_aref_sym_long.rb
new file mode 100644
index 0000000000..9dab8df7be
--- /dev/null
+++ b/benchmark/hash_aref_sym_long.rb
@@ -0,0 +1,13 @@
+h = {}
+syms = %w[puts warn syswrite write stat bacon lettuce tomato
+some symbols in this array may already be interned  others should not be
+hash browns make good breakfast but not cooked using prime numbers
+shift for division entries delete_if keys exist?
+]
+begin
+  syms = eval("%i[#{syms.join(' ')}]")
+rescue SyntaxError # <= 1.9.3
+  syms.map!(&:to_sym)
+end
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_defaults.yml b/benchmark/hash_defaults.yml
new file mode 100644
index 0000000000..833f10e1c7
--- /dev/null
+++ b/benchmark/hash_defaults.yml
@@ -0,0 +1,6 @@
+prelude: |
+  h = Hash.new { :foo }
+benchmark:
+  default_aref: h[1]
+  default_method: h.default(1)
+loop_count: 1000000
diff --git a/benchmark/hash_dup.yml b/benchmark/hash_dup.yml
new file mode 100644
index 0000000000..65f521ec94
--- /dev/null
+++ b/benchmark/hash_dup.yml
@@ -0,0 +1,8 @@
+prelude: |
+  small_hash = { a: 1 }
+  larger_hash = 20.times.map { |i| [('a'.ord + i).chr.to_sym, i] }.to_h
+
+benchmark:
+  dup_small: small_hash.dup
+  dup_larger: larger_hash.dup
+loop_count: 10000
diff --git a/benchmark/hash_first.yml b/benchmark/hash_first.yml
new file mode 100644
index 0000000000..c26df1a7ed
--- /dev/null
+++ b/benchmark/hash_first.yml
@@ -0,0 +1,11 @@
+prelude: |
+  hash1 = 1_000_000.times.to_h { [rand, true]}
+  hash2 = hash1.dup
+  hash2.keys[1..100_000].each { hash2.delete _1 }
+  hash2.delete hash2.first[0]
+
+benchmark:
+  hash1: hash1.first
+  hash2: hash2.first
+
+loop_count: 100_000
diff --git a/benchmark/hash_flatten.rb b/benchmark/hash_flatten.rb
new file mode 100644
index 0000000000..e944aae9f2
--- /dev/null
+++ b/benchmark/hash_flatten.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+1000.times do
+  h.flatten
+end
diff --git a/benchmark/hash_ident_flo.rb b/benchmark/hash_ident_flo.rb
new file mode 100644
index 0000000000..0c7edfed3e
--- /dev/null
+++ b/benchmark/hash_ident_flo.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+strs = (1..10000).to_a.map!(&:to_f)
+strs.each { |s| h[s] = s }
+50.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_ident_num.rb b/benchmark/hash_ident_num.rb
new file mode 100644
index 0000000000..b226736c6f
--- /dev/null
+++ b/benchmark/hash_ident_num.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+nums = (1..26).to_a
+nums.each { |n| h[n] = n }
+200_000.times { nums.each { |n| h[n] } }
diff --git a/benchmark/hash_ident_obj.rb b/benchmark/hash_ident_obj.rb
new file mode 100644
index 0000000000..4b3b58edec
--- /dev/null
+++ b/benchmark/hash_ident_obj.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+objs = 26.times.map { Object.new }
+objs.each { |o| h[o] = o }
+200_000.times { objs.each { |o| h[o] } }
diff --git a/benchmark/hash_ident_str.rb b/benchmark/hash_ident_str.rb
new file mode 100644
index 0000000000..8582b38e31
--- /dev/null
+++ b/benchmark/hash_ident_str.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+strs = ('a'..'z').to_a
+strs.each { |s| h[s] = s }
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_ident_sym.rb b/benchmark/hash_ident_sym.rb
new file mode 100644
index 0000000000..4c81e3d28e
--- /dev/null
+++ b/benchmark/hash_ident_sym.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+syms = ('a'..'z').to_a.map(&:to_sym)
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_keys.rb b/benchmark/hash_keys.rb
new file mode 100644
index 0000000000..6863cd01f9
--- /dev/null
+++ b/benchmark/hash_keys.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do
+  h.keys
+end
diff --git a/benchmark/hash_literal_small2.rb b/benchmark/hash_literal_small2.rb
new file mode 100644
index 0000000000..c188529260
--- /dev/null
+++ b/benchmark/hash_literal_small2.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz" }  }
diff --git a/benchmark/hash_literal_small4.rb b/benchmark/hash_literal_small4.rb
new file mode 100644
index 0000000000..739f71b5b0
--- /dev/null
+++ b/benchmark/hash_literal_small4.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz", "baz" => "lol", "lol" => "lgtm" } }
diff --git a/benchmark/hash_literal_small8.rb b/benchmark/hash_literal_small8.rb
new file mode 100644
index 0000000000..53d80af535
--- /dev/null
+++ b/benchmark/hash_literal_small8.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz", "baz" => "lol", "lol" => "lgtm", "lgtm" => "nope", "nope" => "ok", "ok" => "again", "again" => "wait" } }
diff --git a/benchmark/hash_long.rb b/benchmark/hash_long.rb
new file mode 100644
index 0000000000..03d9109602
--- /dev/null
+++ b/benchmark/hash_long.rb
@@ -0,0 +1,4 @@
+k1 = "Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong";
+k2 = "Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping";
+h = {k1 => 0, k2 => 0};
+3000000.times{|i| k = i % 2 ? k2 : k1; h [k] = h[k] + 1}
diff --git a/benchmark/bm_hash_shift.rb b/benchmark/hash_shift.rb
index a645671a5b..a645671a5b 100644
--- a/benchmark/bm_hash_shift.rb
+++ b/benchmark/hash_shift.rb
diff --git a/benchmark/hash_shift_u16.rb b/benchmark/hash_shift_u16.rb
new file mode 100644
index 0000000000..ec800d0342
--- /dev/null
+++ b/benchmark/hash_shift_u16.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(16384..65536).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_shift_u24.rb b/benchmark/hash_shift_u24.rb
new file mode 100644
index 0000000000..de4e0fa696
--- /dev/null
+++ b/benchmark/hash_shift_u24.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(0xff4000..0xffffff).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_shift_u32.rb b/benchmark/hash_shift_u32.rb
new file mode 100644
index 0000000000..656aa55583
--- /dev/null
+++ b/benchmark/hash_shift_u32.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(0xffff4000..0xffffffff).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_small2.rb b/benchmark/hash_small2.rb
new file mode 100644
index 0000000000..45485d9c71
--- /dev/null
+++ b/benchmark/hash_small2.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 2.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_small4.rb b/benchmark/hash_small4.rb
new file mode 100644
index 0000000000..acd4084334
--- /dev/null
+++ b/benchmark/hash_small4.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 4.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_small8.rb b/benchmark/hash_small8.rb
new file mode 100644
index 0000000000..9cffcc91b6
--- /dev/null
+++ b/benchmark/hash_small8.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 8.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_to_proc.rb b/benchmark/hash_to_proc.rb
new file mode 100644
index 0000000000..2b675bf509
--- /dev/null
+++ b/benchmark/hash_to_proc.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do |i|
+  [i].map(&h)
+end
diff --git a/benchmark/hash_values.rb b/benchmark/hash_values.rb
new file mode 100644
index 0000000000..069441302f
--- /dev/null
+++ b/benchmark/hash_values.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do
+  h.values
+end
diff --git a/benchmark/int_quo.rb b/benchmark/int_quo.rb
new file mode 100644
index 0000000000..e22a3f8c30
--- /dev/null
+++ b/benchmark/int_quo.rb
@@ -0,0 +1 @@
+5000000.times { 42.quo(3) }
diff --git a/benchmark/io_copy_stream_write.rb b/benchmark/io_copy_stream_write.rb
new file mode 100644
index 0000000000..3fd87250a4
--- /dev/null
+++ b/benchmark/io_copy_stream_write.rb
@@ -0,0 +1,24 @@
+# The goal of this is to use a synthetic (non-IO) reader
+# to trigger the read/write loop of IO.copy_stream,
+# bypassing in-kernel mechanisms like sendfile for zero copy,
+# so we wrap the /dev/zero IO object:
+
+class Zero
+  def initialize
+    @n = 100000
+    @in = File.open('/dev/zero', 'rb')
+  end
+
+  def read(len, buf)
+    return if (@n -= 1) == 0
+    @in.read(len, buf)
+  end
+end
+
+begin
+  src = Zero.new
+  dst = File.open(IO::NULL, 'wb')
+  n = IO.copy_stream(src, dst)
+rescue Errno::ENOENT
+  # not *nix
+end if IO.respond_to?(:copy_stream) && IO.const_defined?(:NULL)
diff --git a/benchmark/io_copy_stream_write_socket.rb b/benchmark/io_copy_stream_write_socket.rb
new file mode 100644
index 0000000000..11f369bd0d
--- /dev/null
+++ b/benchmark/io_copy_stream_write_socket.rb
@@ -0,0 +1,35 @@
+# The goal of this is to use a synthetic (non-IO) reader
+# to trigger the read/write loop of IO.copy_stream,
+# bypassing in-kernel mechanisms like sendfile for zero copy,
+# so we wrap the /dev/zero IO object:
+class Zero
+  def initialize
+    @n = 100000
+    @in = File.open('/dev/zero', 'rb')
+  end
+
+  def read(len, buf)
+    return if (@n -= 1) == 0
+    @in.read(len, buf)
+  end
+end
+
+begin
+  require 'socket'
+  src = Zero.new
+  rd, wr = UNIXSocket.pair
+  pid = fork do
+    wr.close
+    buf = String.new
+    while rd.read(16384, buf)
+    end
+  end
+  rd.close
+  IO.copy_stream(src, wr)
+rescue Errno::ENOENT, NotImplementedError, NameError
+  # not *nix: missing /dev/zero, fork, or UNIXSocket
+rescue LoadError # no socket?
+ensure
+  wr.close if wr
+  Process.waitpid(pid) if pid
+end if IO.respond_to?(:copy_stream)
diff --git a/benchmark/bm_io_file_create.rb b/benchmark/io_file_create.rb
index 2f205c1333..2f205c1333 100644
--- a/benchmark/bm_io_file_create.rb
+++ b/benchmark/io_file_create.rb
diff --git a/benchmark/bm_io_file_read.rb b/benchmark/io_file_read.rb
index b9e796ed30..b9e796ed30 100644
--- a/benchmark/bm_io_file_read.rb
+++ b/benchmark/io_file_read.rb
diff --git a/benchmark/bm_io_file_write.rb b/benchmark/io_file_write.rb
index aa1be0e5fe..aa1be0e5fe 100644
--- a/benchmark/bm_io_file_write.rb
+++ b/benchmark/io_file_write.rb
diff --git a/benchmark/io_nonblock_noex.rb b/benchmark/io_nonblock_noex.rb
new file mode 100644
index 0000000000..da9357fdc6
--- /dev/null
+++ b/benchmark/io_nonblock_noex.rb
@@ -0,0 +1,22 @@
+nr = 1_000_000
+i = 0
+msg = '.'
+buf = '.'
+noex = { exception: false }
+begin
+  r, w = IO.pipe
+  while i < nr
+    i += 1
+    w.write_nonblock(msg, noex)
+    r.read_nonblock(1, buf, noex)
+  end
+rescue ArgumentError # old Rubies
+  while i < nr
+    i += 1
+    w.write_nonblock(msg)
+    r.read_nonblock(1, buf)
+  end
+ensure
+  r.close
+  w.close
+end
diff --git a/benchmark/io_nonblock_noex2.rb b/benchmark/io_nonblock_noex2.rb
new file mode 100644
index 0000000000..56819d049b
--- /dev/null
+++ b/benchmark/io_nonblock_noex2.rb
@@ -0,0 +1,21 @@
+nr = 1_000_000
+i = 0
+msg = '.'
+buf = '.'
+begin
+  r, w = IO.pipe
+  while i < nr
+    i += 1
+    w.write_nonblock(msg, exception: false)
+    r.read_nonblock(1, buf, exception: false)
+  end
+rescue ArgumentError # old Rubies
+  while i < nr
+    i += 1
+    w.write_nonblock(msg)
+    r.read_nonblock(1, buf)
+  end
+ensure
+  r.close
+  w.close
+end
diff --git a/benchmark/io_pipe_rw.rb b/benchmark/io_pipe_rw.rb
new file mode 100644
index 0000000000..6862a8ae61
--- /dev/null
+++ b/benchmark/io_pipe_rw.rb
@@ -0,0 +1,13 @@
+# Measure uncontended GVL performance via read/write with 1:1 threading
+# If we switch to M:N threading, this will benchmark something else...
+r, w = IO.pipe
+src = '0'.freeze
+dst = String.new
+i = 0
+while i < 1_000_000
+  i += 1
+  w.write(src)
+  r.read(1, dst)
+end
+w.close
+r.close
diff --git a/benchmark/bm_io_select.rb b/benchmark/io_select.rb
index 19248daeb1..19248daeb1 100644
--- a/benchmark/bm_io_select.rb
+++ b/benchmark/io_select.rb
diff --git a/benchmark/bm_io_select2.rb b/benchmark/io_select2.rb
index 10e37d71b2..10e37d71b2 100644
--- a/benchmark/bm_io_select2.rb
+++ b/benchmark/io_select2.rb
diff --git a/benchmark/bm_io_select3.rb b/benchmark/io_select3.rb
index 7d0ba1f092..7d0ba1f092 100644
--- a/benchmark/bm_io_select3.rb
+++ b/benchmark/io_select3.rb
diff --git a/benchmark/io_write.rb b/benchmark/io_write.rb
new file mode 100644
index 0000000000..cdb409948b
--- /dev/null
+++ b/benchmark/io_write.rb
@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+require 'benchmark'
+
+i, o = IO.pipe
+o.sync = true
+
+DOT = ".".freeze
+
+chunks = 100_000.times.collect{DOT}
+
+thread = Thread.new do
+  while i.read(1024)
+  end
+end
+
+100.times do
+  o.write(*chunks)
+end
+
+o.close
+thread.join
diff --git a/benchmark/irb_color.yml b/benchmark/irb_color.yml
new file mode 100644
index 0000000000..ebdc8d7e8b
--- /dev/null
+++ b/benchmark/irb_color.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'irb/color'
+  code = <<~'CODE'
+    def self.foo # bar
+      :"erb #{ERB.new("<%= self %>", trim_mode: ?-).result}"
+    end
+  CODE
+benchmark:
+  irb_color_complete: |
+    IRB::Color.colorize_code(code, complete: true)
+  irb_color_incomplete: |
+    IRB::Color.colorize_code(code, complete: false)
+loop_count: 2000000
diff --git a/benchmark/irb_exec.yml b/benchmark/irb_exec.yml
new file mode 100644
index 0000000000..28933f8b38
--- /dev/null
+++ b/benchmark/irb_exec.yml
@@ -0,0 +1,10 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'rbconfig'
+  irb_f = [File.join(File.dirname(RbConfig.ruby), 'irb'), '-f']
+benchmark:
+  irb_exec: |
+    IO.popen(irb_f, 'w') do |io|
+      io.write('exit')
+    end
+loop_count: 30
diff --git a/benchmark/iseq_load_from_binary.yml b/benchmark/iseq_load_from_binary.yml
new file mode 100644
index 0000000000..7e9d73bdd4
--- /dev/null
+++ b/benchmark/iseq_load_from_binary.yml
@@ -0,0 +1,25 @@
+prelude: |
+  symbol = RubyVM::InstructionSequence.compile(":foo; :bar; :baz; :egg; :spam").to_binary
+
+  define_method = RubyVM::InstructionSequence.compile(%{
+    def foo; end
+    def bar; end
+    def baz; end
+    def egg; end
+    def spam; end
+  }).to_binary
+
+  all = RubyVM::InstructionSequence.compile(%{
+    module Foo; def foo; :foo; end; end
+    module Bar; def bar; :bar; end; end
+    module Baz; def baz; :baz; end; end
+    class Egg; def egg; :egg; end; end
+    class Spaml; def spam; :spam; end; end
+  }).to_binary
+
+benchmark:
+  symbol: RubyVM::InstructionSequence.load_from_binary(symbol)
+  define_method: RubyVM::InstructionSequence.load_from_binary(define_method)
+  all: RubyVM::InstructionSequence.load_from_binary(all)
+
+loop_count: 100_000
diff --git a/benchmark/ivar_extend.yml b/benchmark/ivar_extend.yml
new file mode 100644
index 0000000000..eb9ee923f5
--- /dev/null
+++ b/benchmark/ivar_extend.yml
@@ -0,0 +1,23 @@
+prelude: |
+  class Embedded
+    def initialize
+      @a = 1
+      @b = 1
+      @c = 1
+    end
+  end
+
+  class Extended
+    def initialize
+      @a = 1
+      @b = 1
+      @c = 1
+      @d = 1
+      @e = 1
+      @f = 1
+    end
+  end
+benchmark:
+  embedded: Embedded.new
+  extended: Extended.new
+loop_count: 20_000_000
diff --git a/benchmark/kernel_clone.yml b/benchmark/kernel_clone.yml
new file mode 100644
index 0000000000..069b23abcd
--- /dev/null
+++ b/benchmark/kernel_clone.yml
@@ -0,0 +1,6 @@
+prelude: "object = Object.new"
+benchmark:
+  clone: "object.clone"
+  clone_true: "object.clone(freeze: true)"
+  clone_false: "object.clone(freeze: false)"
+loop_count: 10000
diff --git a/benchmark/kernel_float.yml b/benchmark/kernel_float.yml
new file mode 100644
index 0000000000..215f6750fc
--- /dev/null
+++ b/benchmark/kernel_float.yml
@@ -0,0 +1,5 @@
+benchmark:
+  float: "Float(42)"
+  float_true: "Float(42, exception: true)"
+  float_false: "Float(42, exception: false)"
+loop_count: 10000
diff --git a/benchmark/kernel_tap.yml b/benchmark/kernel_tap.yml
new file mode 100644
index 0000000000..4dcbb31b4d
--- /dev/null
+++ b/benchmark/kernel_tap.yml
@@ -0,0 +1,6 @@
+prelude: |
+  obj = Object.new
+  x = nil
+benchmark:
+  kernel_tap: obj.tap { |o| x = o }
+loop_count: 20000000
diff --git a/benchmark/kernel_then.yml b/benchmark/kernel_then.yml
new file mode 100644
index 0000000000..85f7341e33
--- /dev/null
+++ b/benchmark/kernel_then.yml
@@ -0,0 +1,6 @@
+benchmark:
+  kernel_then: 1.then { |i| i + 1 }
+  kernel_then_enum: 1.then
+  kernel_yield_self: 1.yield_self { |i| i + 1 }
+  kernel_yield_self_enum: 1.yield_self
+loop_count: 20000000
diff --git a/benchmark/keyword_arguments.yml b/benchmark/keyword_arguments.yml
new file mode 100644
index 0000000000..fce6bce0b8
--- /dev/null
+++ b/benchmark/keyword_arguments.yml
@@ -0,0 +1,13 @@
+prelude: |
+  h = {a: 1}
+  def kw(a: 1) a end
+  def kws(**kw) kw end
+benchmark:
+  kw_to_kw: "kw(a: 1)"
+  kw_splat_to_kw: "kw(**h)"
+  kw_to_kw_splat: "kws(a: 1)"
+  kw_splat_to_kw_splat: "kws(**h)"
+  kw_and_splat_to_kw: "kw(a: 1, **h)"
+  kw_splats_to_kw: "kw(**h, **h)"
+  kw_and_splat_to_kw_splat: "kws(a: 1, **h)"
+  kw_splats_to_kw_splat: "kws(**h, **h)"
diff --git a/benchmark/lib/benchmark_driver/output/driver.rb b/benchmark/lib/benchmark_driver/output/driver.rb
new file mode 100644
index 0000000000..d22236e9fb
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/output/driver.rb
@@ -0,0 +1,36 @@
+require 'benchmark_driver/output/simple'
+
+# This replicates the legacy benchmark/driver.rb behavior.
+class BenchmarkDriver::Output::Driver < BenchmarkDriver::Output::Simple
+  def initialize(*)
+    super
+    @stdout = $stdout
+    @strio  = StringIO.new
+    $stdout = IOMultiplexer.new(@stdout, @strio)
+  end
+
+  def with_benchmark(*)
+    super
+  ensure
+    logfile = "bmlog-#{Time.now.strftime('%Y%m%d-%H%M%S')}.#{$$}.log"
+    puts "\nLog file: #{logfile}"
+
+    $stdout = @stdout
+    File.write(logfile, @strio.tap(&:rewind).read)
+  end
+
+  class IOMultiplexer
+    def initialize(io1, io2)
+      @io1 = io1
+      @io2 = io2
+    end
+
+    [:write, :sync, :sync=, :puts, :print, :flush].each do |method|
+      define_method(method) do |*args|
+        @io1.send(method, *args)
+        @io2.send(method, *args)
+      end
+    end
+  end
+  private_constant :IOMultiplexer
+end
diff --git a/benchmark/lib/benchmark_driver/runner/cstime.rb b/benchmark/lib/benchmark_driver/runner/cstime.rb
new file mode 100644
index 0000000000..3c3453e527
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/cstime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Cstime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'cstime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :cstime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/cutime.rb b/benchmark/lib/benchmark_driver/runner/cutime.rb
new file mode 100644
index 0000000000..e139962ef2
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/cutime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Cutime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'cutime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :cutime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/mjit.rb b/benchmark/lib/benchmark_driver/runner/mjit.rb
new file mode 100644
index 0000000000..3a58a620de
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/mjit.rb
@@ -0,0 +1,34 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'erb'
+
+# A runner to measure after-JIT performance easily
+class BenchmarkDriver::Runner::Mjit < BenchmarkDriver::Runner::Ips
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC]).extend(Module.new{
+    def parse(**)
+      jobs = super
+      jobs.map do |job|
+        job = job.dup
+        job.prelude = "#{job.prelude}\n#{<<~EOS}"
+          if defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled?
+            __bmdv_ruby_i = 0
+            while __bmdv_ruby_i < 10000 # MJIT call threshold
+              #{job.script}
+              __bmdv_ruby_i += 1
+            end
+            RubyVM::MJIT.pause # compile
+            #{job.script}
+            RubyVM::MJIT.resume; RubyVM::MJIT.pause # recompile
+            #{job.script}
+            RubyVM::MJIT.resume; RubyVM::MJIT.pause # recompile 2
+          end
+        EOS
+        job
+      end
+    end
+  })
+end
diff --git a/benchmark/lib/benchmark_driver/runner/peak.rb b/benchmark/lib/benchmark_driver/runner/peak.rb
new file mode 100644
index 0000000000..d04f2e51ff
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/peak.rb
@@ -0,0 +1,151 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'benchmark_driver/default_job'
+require 'benchmark_driver/default_job_parser'
+require 'tempfile'
+
+class BenchmarkDriver::Runner::Peak
+  METRIC = BenchmarkDriver::Metric.new(
+    name: 'Peak memory usage', unit: 'bytes', larger_better: false, worse_word: 'larger',
+  )
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  # @param [BenchmarkDriver::Config::RunnerConfig] config
+  # @param [BenchmarkDriver::Output] output
+  # @param [BenchmarkDriver::Context] contexts
+  def initialize(config:, output:, contexts:)
+    @config = config
+    @output = output
+    @contexts = contexts
+  end
+
+  # This method is dynamically called by `BenchmarkDriver::JobRunner.run`
+  # @param [Array<BenchmarkDriver::Runner::Peak::Job>] jobs
+  def run(jobs)
+    if jobs.any? { |job| job.loop_count.nil? }
+      jobs = jobs.map do |job|
+        job.loop_count ? job : Job.new(job.to_h.merge(loop_count: 1))
+      end
+    end
+
+    @output.with_benchmark do
+      jobs.each do |job|
+        @output.with_job(name: job.name) do
+          job.runnable_contexts(@contexts).each do |context|
+            value = BenchmarkDriver::Repeater.with_repeat(config: @config, larger_better: false) do
+              run_benchmark(job, context: context)
+            end
+            @output.with_context(name: context.name, executable: context.executable, gems: context.gems, prelude: context.prelude) do
+              @output.report(values: { metric => value }, loop_count: job.loop_count)
+            end
+          end
+        end
+      end
+    end
+  end
+
+  private
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    memory_status = File.expand_path('../../../../tool/lib/memory_status', __dir__)
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      with_script(benchmark.render) do |path|
+        output = IO.popen([*context.executable.command, path, f.path, target, memory_status], &:read)
+        if $?.success?
+          Integer(f.read)
+        else
+          $stdout.print(output)
+          BenchmarkDriver::Result::ERROR
+        end
+      end
+    end
+  end
+
+  # Overridden by BenchmarkDriver::Runner::Size
+  def target
+    'peak'
+  end
+
+  # Overridden by BenchmarkDriver::Runner::Size
+  def metric
+    METRIC
+  end
+
+  def with_script(script)
+    if @config.verbose >= 2
+      sep = '-' * 30
+      $stdout.puts "\n\n#{sep}[Script begin]#{sep}\n#{script}#{sep}[Script end]#{sep}\n\n"
+    end
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      f.puts script
+      f.close
+      return yield(f.path)
+    end
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    def render
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      <<-RUBY
+#{prelude}
+#{while_loop(script, loop_count)}
+#{teardown}
+
+result_file, target, memory_status = ARGV
+require_relative memory_status
+
+ms = Memory::Status.new
+case target.to_sym
+when :peak
+  key = ms.respond_to?(:hwm) ? :hwm : :peak
+when :size
+  key = ms.respond_to?(:rss) ? :rss : :size
+else
+  raise('unexpected target: ' + target)
+end
+
+File.write(result_file, ms[key])
+      RUBY
+    end
+
+    private
+
+    def while_loop(content, times)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      end
+
+      if times > 1
+        <<-RUBY
+__bmdv_i = 0
+while __bmdv_i < #{times}
+  #{content}
+  __bmdv_i += 1
+end
+        RUBY
+      else
+        content
+      end
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/ractor.rb b/benchmark/lib/benchmark_driver/runner/ractor.rb
new file mode 100644
index 0000000000..c730b8e4a5
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/ractor.rb
@@ -0,0 +1,122 @@
+require 'erb'
+
+# A runner to measure performance *inside* Ractor
+class BenchmarkDriver::Runner::Ractor < BenchmarkDriver::Runner::Ips
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob) do
+    attr_accessor :ractor
+  end
+
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC]).extend(Module.new{
+    def parse(ractor: 1, **kwargs)
+      super(**kwargs).each do |job|
+        job.ractor = ractor
+      end
+    end
+  })
+
+  private
+
+  unless private_instance_methods.include?(:run_benchmark)
+    raise "#run_benchmark is no longer defined in BenchmarkDriver::Runner::Ips"
+  end
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    results = job.ractor.times.map do
+      Tempfile.open('benchmark_driver_result')
+    end
+    duration = with_script(benchmark.render(results: results.map(&:path))) do |path|
+      success = execute(*context.executable.command, path, exception: false)
+      if success && ((value = results.map { |f| Float(f.read) }.max) > 0)
+        value
+      else
+        BenchmarkDriver::Result::ERROR
+      end
+    end
+    results.each(&:close)
+
+    value_duration(
+      loop_count: job.loop_count,
+      duration: duration,
+    )
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    # @param [String] result - A file to write result
+    def render(results:)
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      ERB.new(<<-RUBY).result_with_hash(results: results)
+Warning[:experimental] = false
+# shareable-constant-value: experimental_everything
+#{prelude}
+
+if #{loop_count} == 1
+  __bmdv_loop_before = 0
+  __bmdv_loop_after = 0
+else
+  __bmdv_loop_before = Time.new
+  #{while_loop('', loop_count, id: 0)}
+  __bmdv_loop_after = Time.new
+end
+
+__bmdv_ractors = []
+<% results.size.times do %>
+__bmdv_ractors << Ractor.new(__bmdv_loop_after - __bmdv_loop_before) { |__bmdv_loop_time|
+  __bmdv_time = Time
+  __bmdv_script_before = __bmdv_time.new
+  #{while_loop(script, loop_count, id: 1)}
+  __bmdv_script_after = __bmdv_time.new
+
+  (__bmdv_script_after - __bmdv_script_before) - __bmdv_loop_time
+}
+<% end %>
+
+# Wait for all Ractors before executing code to write results
+__bmdv_ractors.map!(&:take)
+
+<% results.each do |result| %>
+File.write(<%= result.dump %>, __bmdv_ractors.shift)
+<% end %>
+
+#{teardown}
+      RUBY
+    end
+
+    private
+
+    # id is to prevent:
+    # can not isolate a Proc because it accesses outer variables (__bmdv_i)
+    def while_loop(content, times, id:)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      elsif times == 1
+        return content
+      end
+
+      # TODO: execute in batch
+      <<-RUBY
+__bmdv_i#{id} = 0
+while __bmdv_i#{id} < #{times}
+  #{content}
+  __bmdv_i#{id} += 1
+end
+      RUBY
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/size.rb b/benchmark/lib/benchmark_driver/runner/size.rb
new file mode 100644
index 0000000000..1b31f901c7
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/size.rb
@@ -0,0 +1,25 @@
+require 'benchmark_driver/runner/peak'
+
+# Actually the same as BenchmarkDriver::Runner::Memory
+class BenchmarkDriver::Runner::Size < BenchmarkDriver::Runner::Peak
+  METRIC = BenchmarkDriver::Metric.new(
+    name: 'Max resident set size', unit: 'bytes', larger_better: false, worse_word: 'larger',
+  )
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Peak#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Peak#target
+  def target
+    'size'
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/stime.rb b/benchmark/lib/benchmark_driver/runner/stime.rb
new file mode 100644
index 0000000000..4577fb0bf8
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/stime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Stime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'stime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :stime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/total.rb b/benchmark/lib/benchmark_driver/runner/total.rb
new file mode 100644
index 0000000000..64dc14f84e
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/total.rb
@@ -0,0 +1,137 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'benchmark_driver/default_job'
+require 'benchmark_driver/default_job_parser'
+require 'tempfile'
+
+class BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'Total time', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  # @param [BenchmarkDriver::Config::RunnerConfig] config
+  # @param [BenchmarkDriver::Output] output
+  # @param [BenchmarkDriver::Context] contexts
+  def initialize(config:, output:, contexts:)
+    @config = config
+    @output = output
+    @contexts = contexts
+  end
+
+  # This method is dynamically called by `BenchmarkDriver::JobRunner.run`
+  # @param [Array<BenchmarkDriver::Runner::Total::Job>] jobs
+  def run(jobs)
+    if jobs.any? { |job| job.loop_count.nil? }
+      raise 'missing loop_count is not supported in Ruby repository'
+    end
+
+    @output.with_benchmark do
+      jobs.each do |job|
+        @output.with_job(name: job.name) do
+          job.runnable_contexts(@contexts).each do |context|
+            duration = BenchmarkDriver::Repeater.with_repeat(config: @config, larger_better: false) do
+              run_benchmark(job, context: context)
+            end
+            @output.with_context(name: context.name, executable: context.executable, gems: context.gems, prelude: context.prelude) do
+              @output.report(values: { metric => duration }, duration: duration, loop_count: job.loop_count)
+            end
+          end
+        end
+      end
+    end
+  end
+
+  private
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      with_script(benchmark.render(result: f.path, target: target)) do |path|
+        IO.popen([*context.executable.command, path], &:read) # TODO: print stdout if verbose=2
+        if $?.success?
+          Float(f.read)
+        else
+          BenchmarkDriver::Result::ERROR
+        end
+      end
+    end
+  end
+
+  # This method is overridden by some subclasses
+  def metric
+    METRIC
+  end
+
+  # This method is overridden by some subclasses
+  def target
+    :total
+  end
+
+  def with_script(script)
+    if @config.verbose >= 2
+      sep = '-' * 30
+      $stdout.puts "\n\n#{sep}[Script begin]#{sep}\n#{script}#{sep}[Script end]#{sep}\n\n"
+    end
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      f.puts script
+      f.close
+      return yield(f.path)
+    end
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    # @param [String] result - A file to write result
+    def render(result:, target:)
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      <<-RUBY
+#{prelude}
+
+require 'benchmark'
+__bmdv_result = Benchmark.measure {
+  #{while_loop(script, loop_count)}
+}
+
+#{teardown}
+
+File.write(#{result.dump}, __bmdv_result.#{target})
+      RUBY
+    end
+
+    private
+
+    def while_loop(content, times)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      elsif times == 1
+        return content
+      end
+
+      # TODO: execute in batch
+      <<-RUBY
+__bmdv_i = 0
+while __bmdv_i < #{times}
+  #{content}
+  __bmdv_i += 1
+end
+      RUBY
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/utime.rb b/benchmark/lib/benchmark_driver/runner/utime.rb
new file mode 100644
index 0000000000..b61d83a188
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/utime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Utime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'utime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :utime
+  end
+end
diff --git a/benchmark/lib/load.rb b/benchmark/lib/load.rb
new file mode 100644
index 0000000000..31b770c484
--- /dev/null
+++ b/benchmark/lib/load.rb
@@ -0,0 +1,18 @@
+# How to use this file:
+#   1. write a `$(srcdir)/test.rb` like:
+=begin
+require_relative 'benchmark/lib/load'
+
+Benchmark.driver(repeat_count: 5){|x|
+  x.executable name: 'clean-miniruby', command: %w'../clean-trunk/miniruby'
+  x.executable name: 'modif-miniruby', command: %w'./miniruby'
+
+  x.report %q{
+    h = {a: 1, b: 2, c: 3, d: 4}
+  }
+}
+=end
+#
+#  2. `make run`
+$:.unshift(File.join(__dir__, '../benchmark-driver/lib'))
+require 'benchmark_driver'
diff --git a/benchmark/bm_loop_for.rb b/benchmark/loop_for.rb
index 0fc4cc1511..0fc4cc1511 100644
--- a/benchmark/bm_loop_for.rb
+++ b/benchmark/loop_for.rb
diff --git a/benchmark/bm_loop_generator.rb b/benchmark/loop_generator.rb
index d3375c744c..d3375c744c 100644
--- a/benchmark/bm_loop_generator.rb
+++ b/benchmark/loop_generator.rb
diff --git a/benchmark/bm_loop_times.rb b/benchmark/loop_times.rb
index 521f72ad1a..521f72ad1a 100644
--- a/benchmark/bm_loop_times.rb
+++ b/benchmark/loop_times.rb
diff --git a/benchmark/bm_loop_whileloop.rb b/benchmark/loop_whileloop.rb
index 0072822c06..0072822c06 100644
--- a/benchmark/bm_loop_whileloop.rb
+++ b/benchmark/loop_whileloop.rb
diff --git a/benchmark/bm_loop_whileloop2.rb b/benchmark/loop_whileloop2.rb
index 47d02dffc4..47d02dffc4 100644
--- a/benchmark/bm_loop_whileloop2.rb
+++ b/benchmark/loop_whileloop2.rb
diff --git a/benchmark/make_fasta_output.rb b/benchmark/make_fasta_output.rb
deleted file mode 100644
index b6d787ae27..0000000000
--- a/benchmark/make_fasta_output.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-# prepare 'fasta.output'
-
-def prepare_fasta_output n
-  filebase = File.join(File.dirname($0), 'fasta.output')
-  script = File.join(File.dirname($0), 'bm_so_fasta.rb')
-  file = "#{filebase}.#{n}"
-
-  unless FileTest.exist?(file)
-    STDERR.puts "preparing #{file}"
-
-    open(file, 'w'){|f|
-      ARGV[0] = n
-      $stdout = f
-      load script
-      $stdout = STDOUT
-    }
-  end
-end
-
diff --git a/benchmark/marshal_dump_flo.rb b/benchmark/marshal_dump_flo.rb
new file mode 100644
index 0000000000..9b8d0c6afb
--- /dev/null
+++ b/benchmark/marshal_dump_flo.rb
@@ -0,0 +1,2 @@
+bug10761 = 10000.times.map { |x| x.to_f }
+100.times { Marshal.dump(bug10761) }
diff --git a/benchmark/marshal_dump_load_geniv.rb b/benchmark/marshal_dump_load_geniv.rb
new file mode 100644
index 0000000000..8252ad90fa
--- /dev/null
+++ b/benchmark/marshal_dump_load_geniv.rb
@@ -0,0 +1,10 @@
+a = ''
+a.instance_eval do
+  @a = :a
+  @b = :b
+  @c = :c
+end
+100000.times do
+  a = Marshal.load(Marshal.dump(a))
+end
+#p(a.instance_eval { @a == :a && @b == :b && @c == :c })
diff --git a/benchmark/marshal_dump_load_integer.yml b/benchmark/marshal_dump_load_integer.yml
new file mode 100644
index 0000000000..78ebf823d2
--- /dev/null
+++ b/benchmark/marshal_dump_load_integer.yml
@@ -0,0 +1,22 @@
+prelude: |
+  smallint_array = 1000.times.map { |x| x }
+  bigint32_array = 1000.times.map { |x| x + 2**32 }
+  bigint64_array = 1000.times.map { |x| x + 2**64 }
+
+  smallint_dump = Marshal.dump(smallint_array)
+  bigint32_dump = Marshal.dump(bigint32_array)
+  bigint64_dump = Marshal.dump(bigint64_array)
+benchmark:
+  marshal_dump_integer_small: |
+    Marshal.dump(smallint_array)
+  marshal_dump_integer_over_32_bit: |
+    Marshal.dump(bigint32_array)
+  marshal_dump_integer_over_64_bit: |
+    Marshal.dump(bigint64_array)
+  marshal_load_integer_small: |
+    Marshal.load(smallint_dump)
+  marshal_load_integer_over_32_bit: |
+    Marshal.load(bigint32_dump)
+  marshal_load_integer_over_64_bit: |
+    Marshal.load(bigint64_dump)
+loop_count: 4000
diff --git a/benchmark/marshal_dump_load_time.rb b/benchmark/marshal_dump_load_time.rb
new file mode 100644
index 0000000000..e29743b791
--- /dev/null
+++ b/benchmark/marshal_dump_load_time.rb
@@ -0,0 +1 @@
+100000.times { Marshal.load(Marshal.dump(Time.now)) }
diff --git a/benchmark/masgn.yml b/benchmark/masgn.yml
new file mode 100644
index 0000000000..31cb8ee4a3
--- /dev/null
+++ b/benchmark/masgn.yml
@@ -0,0 +1,53 @@
+prelude: |
+  a = [nil] * 3
+  b = Class.new{attr_writer :a, :b, :c}.new
+  c = d = e = f = g = h = i = nil
+benchmark:
+  array2_2: "c = (a[0], a[1] = 1, 2)"
+  array2_3: "c = (a[0], a[1] = 1, 2, 3)"
+  array3_2: "c = (a[0], a[1], a[2] = 1, 2)"
+  array3_3: "c = (a[0], a[1], a[2] = 1, 2, 3)"
+  attr2_2: "c = (b.a, b.b = 1, 2)"
+  attr2_3: "c = (b.a, b.b = 1, 2, 3)"
+  attr3_2: "c = (b.a, b.b, b.c = 1, 2)"
+  attr3_3: "c = (b.a, b.b, b.c = 1, 2, 3)"
+  lvar2_2: "c = (d, e = 1, 2)"
+  lvar2_3: "c = (d, e = 1, 2, 3)"
+  lvar3_2: "c = (d, e, f = 1, 2)"
+  lvar3_3: "c = (d, e, f = 1, 2, 3)"
+  array2_2p: "(a[0], a[1] = 1, 2; nil)"
+  array2_3p: "(a[0], a[1] = 1, 2, 3; nil)"
+  array3_2p: "(a[0], a[1], a[2] = 1, 2; nil)"
+  array3_3p: "(a[0], a[1], a[2] = 1, 2, 3; nil)"
+  attr2_2p: "(b.a, b.b = 1, 2; nil)"
+  attr2_3p: "(b.a, b.b = 1, 2, 3; nil)"
+  attr3_2p: "(b.a, b.b, b.c = 1, 2; nil)"
+  attr3_3p: "(b.a, b.b, b.c = 1, 2, 3; nil)"
+  lvar2_2p: "(d, e = 1, 2; nil)"
+  lvar2_3p: "(d, e = 1, 2, 3; nil)"
+  lvar3_2p: "(d, e, f = 1, 2; nil)"
+  lvar3_3p: "(d, e, f = 1, 2, 3; nil)"
+  array2_2lv: "c = (a[0], a[1] = g, h)"
+  array2_ilv: "c = (a[0], a[1] = g, h, i)"
+  arrayi_2lv: "c = (a[0], a[1], a[2] = g, h)"
+  arrayi_ilv: "c = (a[0], a[1], a[2] = g, h, i)"
+  attr2_2lv: "c = (b.a, b.b = g, h)"
+  attr2_ilv: "c = (b.a, b.b = g, h, i)"
+  attri_2lv: "c = (b.a, b.b, b.c = g, h)"
+  attri_ilv: "c = (b.a, b.b, b.c = g, h, i)"
+  lvar2_2lv: "c = (d, e = g, h)"
+  lvar2_ilv: "c = (d, e = g, h, i)"
+  lvari_2lv: "c = (d, e, f = g, h)"
+  lvari_ilv: "c = (d, e, f = g, h, i)"
+  array2_2plv: "(a[0], a[1] = g, h; nil)"
+  array2_iplv: "(a[0], a[1] = g, h, i; nil)"
+  arrayi_2plv: "(a[0], a[1], a[2] = g, h; nil)"
+  arrayi_iplv: "(a[0], a[1], a[2] = g, h, i; nil)"
+  attr2_2plv: "(b.a, b.b = g, h; nil)"
+  attr2_iplv: "(b.a, b.b = g, h, i; nil)"
+  attri_2plv: "(b.a, b.b, b.c = g, h; nil)"
+  attri_iplv: "(b.a, b.b, b.c = g, h, i; nil)"
+  lvar2_2plv: "(d, e = g, h; nil)"
+  lvar2_iplv: "(d, e = g, h, i; nil)"
+  lvari_2plv: "(d, e, f = g, h; nil)"
+  lvari_iplv: "(d, e, f = g, h, i; nil)"
diff --git a/benchmark/match_gt4.rb b/benchmark/match_gt4.rb
new file mode 100644
index 0000000000..ffda109912
--- /dev/null
+++ b/benchmark/match_gt4.rb
@@ -0,0 +1 @@
+1000000.times { /(.)(.)(\d+)(\d)/.match("THX1138.") }
diff --git a/benchmark/match_small.rb b/benchmark/match_small.rb
new file mode 100644
index 0000000000..3b743d484a
--- /dev/null
+++ b/benchmark/match_small.rb
@@ -0,0 +1 @@
+1000000.times { 'haystack'.match(/hay/) }
diff --git a/benchmark/method_bind_call.yml b/benchmark/method_bind_call.yml
new file mode 100644
index 0000000000..9e0e046ed4
--- /dev/null
+++ b/benchmark/method_bind_call.yml
@@ -0,0 +1,16 @@
+prelude: |
+  named_module = Kernel
+
+  module FakeName
+    def self.name
+      "NotMyame".freeze
+    end
+  end
+
+  MOD_NAME = Module.instance_method(:name)
+
+benchmark:
+  fastpath: MOD_NAME.bind_call(Kernel)
+  slowpath: MOD_NAME.bind_call(FakeName)
+
+loop_count: 100_000
diff --git a/benchmark/mjit_exivar.yml b/benchmark/mjit_exivar.yml
new file mode 100644
index 0000000000..2584fa6410
--- /dev/null
+++ b/benchmark/mjit_exivar.yml
@@ -0,0 +1,18 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  class Bench < Hash
+    def initialize
+      @exivar = nil
+    end
+
+    def exivar
+      @exivar
+    end
+  end
+
+  bench = Bench.new
+
+benchmark:
+  mjit_exivar: bench.exivar
+
+loop_count: 200000000
diff --git a/benchmark/mjit_integer.yml b/benchmark/mjit_integer.yml
new file mode 100644
index 0000000000..a6b5c9ee16
--- /dev/null
+++ b/benchmark/mjit_integer.yml
@@ -0,0 +1,32 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_abs(int)        int.abs        end
+  def mjit_bit_length(int) int.bit_length end
+  def mjit_comp(int)       ~int           end
+  def mjit_even?(int)      int.even?      end
+  def mjit_integer?(int)   int.integer?   end
+  def mjit_magnitude(int)  int.magnitude  end
+  def mjit_odd?(int)       int.odd?       end
+  def mjit_ord(int)        int.ord        end
+  def mjit_size(int)       int.size       end
+  def mjit_to_i(int)       int.to_i       end
+  def mjit_to_int(int)     int.to_int     end
+  def mjit_uminus(int)     -int           end
+  def mjit_zero?(int)      int.zero?      end
+
+benchmark:
+  - mjit_abs(-1)
+  - mjit_bit_length(100)
+  - mjit_comp(1)
+  - mjit_even?(2)
+  - mjit_integer?(0)
+  - mjit_magnitude(-1)
+  - mjit_odd?(1)
+  - mjit_ord(1)
+  - mjit_size(1)
+  - mjit_to_i(1)
+  - mjit_to_int(1)
+  - mjit_uminus(1)
+  - mjit_zero?(0)
+
+loop_count: 40000000
diff --git a/benchmark/mjit_kernel.yml b/benchmark/mjit_kernel.yml
new file mode 100644
index 0000000000..7720e65c2c
--- /dev/null
+++ b/benchmark/mjit_kernel.yml
@@ -0,0 +1,20 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_class(obj)
+    obj.class
+  end
+
+  def mjit_frozen?(obj)
+    obj.frozen?
+  end
+
+  str = ""
+  fstr = "".freeze
+
+benchmark:
+  - mjit_class(self)
+  - mjit_class(1)
+  - mjit_frozen?(str)
+  - mjit_frozen?(fstr)
+
+loop_count: 40000000
diff --git a/benchmark/mjit_leave.yml b/benchmark/mjit_leave.yml
new file mode 100644
index 0000000000..9ac68b164b
--- /dev/null
+++ b/benchmark/mjit_leave.yml
@@ -0,0 +1,8 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def leave
+    nil
+  end
+benchmark:
+  mjit_leave: leave
+loop_count: 200000000
diff --git a/benchmark/mjit_opt_cc_insns.yml b/benchmark/mjit_opt_cc_insns.yml
new file mode 100644
index 0000000000..fed6d34bd5
--- /dev/null
+++ b/benchmark/mjit_opt_cc_insns.yml
@@ -0,0 +1,27 @@
+# opt_* insns using vm_method_cfunc_is with send-compatible operands:
+#   * opt_nil_p
+#   * opt_not
+#   * opt_eq
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_nil?(obj)
+    obj.nil?
+  end
+
+  def mjit_not(obj)
+    !obj
+  end
+
+  def mjit_eq(a, b)
+    a == b
+  end
+
+benchmark:
+  - script: mjit_nil?(1)
+    loop_count: 40000000
+  - script: mjit_not(1)
+    loop_count: 40000000
+  - script: mjit_eq(1, nil)
+    loop_count: 8000000
+  - script: mjit_eq(nil, 1)
+    loop_count: 8000000
diff --git a/benchmark/mjit_struct_aref.yml b/benchmark/mjit_struct_aref.yml
new file mode 100644
index 0000000000..bfba1323f2
--- /dev/null
+++ b/benchmark/mjit_struct_aref.yml
@@ -0,0 +1,10 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_struct_aref(struct)
+    struct.aa
+  end
+  struct = Struct.new(:a0, :a1, :a2, :a3, :a4, :a5, :a6, :a7, :a8, :a9, :aa).new
+
+benchmark: mjit_struct_aref(struct)
+
+loop_count: 40000000
diff --git a/benchmark/module_eqq.yml b/benchmark/module_eqq.yml
new file mode 100644
index 0000000000..a561fb86dc
--- /dev/null
+++ b/benchmark/module_eqq.yml
@@ -0,0 +1,27 @@
+prelude: |
+  class SimpleClass; end
+  class MediumClass
+    10.times { include Module.new }
+  end
+  class LargeClass
+    100.times { include Module.new }
+  end
+  class HugeClass
+    300.times { include Module.new }
+  end
+  SimpleObj = SimpleClass.new
+  MediumObj = MediumClass.new
+  LargeObj = LargeClass.new
+  HugeObj = HugeClass.new
+benchmark:
+  simple_class_eqq_simple_obj: |
+    SimpleClass === SimpleObj
+  medium_class_eqq_simple_obj: |
+    MediumClass === SimpleObj
+  simple_class_eqq_medium_obj: |
+    SimpleClass === MediumObj
+  simple_class_eqq_large_obj: |
+    SimpleClass === LargeObj
+  simple_class_eqq_huge_obj: |
+    SimpleClass === HugeObj
+loop_count: 20000000
diff --git a/benchmark/nil_p.yml b/benchmark/nil_p.yml
new file mode 100644
index 0000000000..79ba4f2177
--- /dev/null
+++ b/benchmark/nil_p.yml
@@ -0,0 +1,9 @@
+prelude: |
+  class Niller; def nil?; true; end; end
+  xnil, notnil = nil, Object.new
+  niller = Niller.new
+benchmark:
+  - xnil.nil?
+  - notnil.nil?
+  - niller.nil?
+loop_count: 10000000
diff --git a/benchmark/nilclass.yml b/benchmark/nilclass.yml
new file mode 100644
index 0000000000..fba67a5f6a
--- /dev/null
+++ b/benchmark/nilclass.yml
@@ -0,0 +1,6 @@
+benchmark:
+  to_i: |
+    nil.to_i
+  to_f: |
+    nil.to_f
+loop_count: 100000
diff --git a/benchmark/num_zero_p.yml b/benchmark/num_zero_p.yml
new file mode 100644
index 0000000000..2195963433
--- /dev/null
+++ b/benchmark/num_zero_p.yml
@@ -0,0 +1,8 @@
+benchmark:
+  - 0.zero?
+  - 1.zero?
+  - 0r.zero?
+  - 1r.zero?
+  - 0i.zero?
+  - 1i.zero?
+loop_count: 50000000
diff --git a/benchmark/numeric_methods.yml b/benchmark/numeric_methods.yml
new file mode 100644
index 0000000000..1384902935
--- /dev/null
+++ b/benchmark/numeric_methods.yml
@@ -0,0 +1,29 @@
+prelude: |
+  int = 42
+  flo = 4.2
+benchmark:
+  real?: |
+    int.real?
+  integer?: |
+    flo.integer?
+  finite?: |
+    int.finite?
+  infinite?: |
+    int.infinite?
+  integer_real: |
+    int.real
+  float_real: |
+    flo.real
+  integr_imag: |
+    int.imag
+  float_imag: |
+    flo.imag
+  integer_conj: |
+    int.conj
+  float_conj: |
+    flo.conj
+  integer_numerator: |
+    int.numerator
+  integer_denominator: |
+    int.denominator
+loop_count: 20000000
diff --git a/benchmark/object_allocate.yml b/benchmark/object_allocate.yml
new file mode 100644
index 0000000000..93ff463e41
--- /dev/null
+++ b/benchmark/object_allocate.yml
@@ -0,0 +1,21 @@
+prelude: |
+  class Eight
+    8.times { include(Module.new) }
+  end
+  class ThirtyTwo
+    32.times { include(Module.new) }
+  end
+  class SixtyFour
+    64.times { include(Module.new) }
+  end
+  class OneTwentyEight
+    128.times { include(Module.new) }
+  end
+  # Disable GC to see raw throughput:
+  GC.disable
+benchmark:
+  allocate_8_deep: Eight.new
+  allocate_32_deep: ThirtyTwo.new
+  allocate_64_deep: SixtyFour.new
+  allocate_128_deep: OneTwentyEight.new
+loop_count: 100000
diff --git a/benchmark/objspace_dump_all.yml b/benchmark/objspace_dump_all.yml
new file mode 100644
index 0000000000..ebab562d2e
--- /dev/null
+++ b/benchmark/objspace_dump_all.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'objspace'
+  require 'tempfile'
+  $objs = 1_000.times.map { Object.new }
+  $strings = 1_000.times.map { |i| "string #{i}" }
+  $file = Tempfile.new('heap')
+  $dev_null = File.open(File::NULL, 'w+')
+
+benchmark:
+  dump_all_string: "ObjectSpace.dump_all(output: :string)"
+  dump_all_file: "ObjectSpace.dump_all(output: $file)"
+  dump_all_dev_null: "ObjectSpace.dump_all(output: $dev_null)"
+loop_count: 1
diff --git a/benchmark/other-lang/fact.py b/benchmark/other-lang/fact.py
index 01593965d9..1ce9f76275 100644
--- a/benchmark/other-lang/fact.py
+++ b/benchmark/other-lang/fact.py
@@ -3,7 +3,7 @@
 
 def factL(n):
 	r = 1
-	for x in range(2, n):
+	for x in range(2, n+1):
 		r *= x
 	return r
 
diff --git a/benchmark/pm_array.yml b/benchmark/pm_array.yml
new file mode 100644
index 0000000000..babb65a289
--- /dev/null
+++ b/benchmark/pm_array.yml
@@ -0,0 +1,19 @@
+prelude: |
+  def call(*val)
+    case val
+      in [String => body]
+        [200, {}, [body]]
+      in [Integer => status]
+        [status, {}, [""]]
+      in [Integer, String] => response
+        [response[0], {}, [response[1]]]
+      in [Integer, Hash, String] => response
+        [response[0], response[1], [response[2]]]
+    end
+  end
+
+benchmark:
+  first_match: call("ok")
+  second_match: call(401)
+  third_match: call(200, "ok")
+  fourth_match: call(201, {}, "created")
diff --git a/benchmark/prepare_so_count_words.rb b/benchmark/prepare_so_count_words.rb
deleted file mode 100644
index ee2138cdb2..0000000000
--- a/benchmark/prepare_so_count_words.rb
+++ /dev/null
@@ -1,15 +0,0 @@
-# prepare 'wc.input'
-
-def prepare_wc_input
-  wcinput = File.join(File.dirname($0), 'wc.input')
-  wcbase  = File.join(File.dirname($0), 'wc.input.base')
-  unless FileTest.exist?(wcinput)
-    data = File.read(wcbase)
-    13.times{
-      data << data
-    }
-    open(wcinput, 'w'){|f| f.write data}
-  end
-end
-
-prepare_wc_input
diff --git a/benchmark/prepare_so_k_nucleotide.rb b/benchmark/prepare_so_k_nucleotide.rb
deleted file mode 100644
index f28f4460a1..0000000000
--- a/benchmark/prepare_so_k_nucleotide.rb
+++ /dev/null
@@ -1,2 +0,0 @@
-require File.join(File.dirname(__FILE__), 'make_fasta_output')
-prepare_fasta_output(100_000)
diff --git a/benchmark/prepare_so_reverse_complement.rb b/benchmark/prepare_so_reverse_complement.rb
deleted file mode 100644
index 7f089109de..0000000000
--- a/benchmark/prepare_so_reverse_complement.rb
+++ /dev/null
@@ -1,2 +0,0 @@
-require File.join(File.dirname(__FILE__), 'make_fasta_output')
-prepare_fasta_output(2_500_000)
diff --git a/benchmark/ractor_const.yml b/benchmark/ractor_const.yml
new file mode 100644
index 0000000000..d7ab74bdca
--- /dev/null
+++ b/benchmark/ractor_const.yml
@@ -0,0 +1,4 @@
+type: lib/benchmark_driver/runner/ractor
+benchmark:
+  ractor_const: Object
+ractor: 1
diff --git a/benchmark/ractor_float_to_s.yml b/benchmark/ractor_float_to_s.yml
new file mode 100644
index 0000000000..8f492be668
--- /dev/null
+++ b/benchmark/ractor_float_to_s.yml
@@ -0,0 +1,8 @@
+type: lib/benchmark_driver/runner/ractor
+prelude: |
+  FLOATS = [*0.0.step(1.0, 0.001)]
+benchmark:
+  ractor_float_to_s: |
+    FLOATS.each {|f| f.to_s}
+loop_count: 100
+ractor: 2
diff --git a/benchmark/range_last.yml b/benchmark/range_last.yml
new file mode 100644
index 0000000000..a6674f82ee
--- /dev/null
+++ b/benchmark/range_last.yml
@@ -0,0 +1,4 @@
+benchmark:
+  - (1..1_000_000).last(100)
+  - (1..1_000_000).last(1000)
+  - (1..1_000_000).last(10000)
diff --git a/benchmark/range_min.yml b/benchmark/range_min.yml
new file mode 100644
index 0000000000..9e60dd7308
--- /dev/null
+++ b/benchmark/range_min.yml
@@ -0,0 +1,2 @@
+benchmark:
+  - (1..10).min
diff --git a/benchmark/realpath.yml b/benchmark/realpath.yml
new file mode 100644
index 0000000000..90a029d5b9
--- /dev/null
+++ b/benchmark/realpath.yml
@@ -0,0 +1,30 @@
+prelude: |
+  f = File
+  pwd = Dir.pwd
+  Dir.mkdir('b') unless f.directory?('b')
+  f.write('b/a', '') unless f.file?('b/a')
+
+  relative = 'b/a'
+  absolute = File.join(pwd, relative)
+  dir = 'b'
+  file = 'a'
+
+  relative_dir = 'b/c'
+  absolute_dir = File.join(pwd, relative_dir)
+  file_dir = 'c'
+benchmark:
+  relative_nil: "f.realpath(relative, nil)"
+  absolute_nil: "f.realpath(absolute, nil)"
+  relative_relative: "f.realpath(file, dir)"
+  absolute_relative: "f.realpath(absolute, dir)"
+  relative_absolute: "f.realpath(relative, pwd)"
+  relative_nil_dir: "f.realdirpath(relative_dir, nil)"
+  absolute_nil_dir: "f.realdirpath(absolute_dir, nil)"
+  relative_relative_dir: "f.realdirpath(file_dir, dir)"
+  absolute_relative_dir: "f.realdirpath(absolute_dir, dir)"
+  relative_absolute_dir: "f.realdirpath(relative_dir, pwd)"
+  relative_nil_notexist: "f.realpath(relative_dir, nil) rescue nil"
+  absolute_nil_notexist: "f.realpath(absolute_dir, nil) rescue nil"
+  relative_relative_notexist: "f.realpath(file_dir, dir) rescue nil"
+  absolute_relative_notexist: "f.realpath(absolute_dir, dir) rescue nil"
+  relative_absolute_notexist: "f.realpath(relative_dir, pwd) rescue nil"
diff --git a/benchmark/report.rb b/benchmark/report.rb
deleted file mode 100644
index d2dc56b1e1..0000000000
--- a/benchmark/report.rb
+++ /dev/null
@@ -1,79 +0,0 @@
-#
-# YARV benchmark driver
-#
-
-require 'yarvutil'
-require 'benchmark'
-require 'rbconfig'
-
-def exec_command type, file, w
-  <<-EOP
-  $DRIVER_PATH = '#{File.dirname($0)}'
-  $LOAD_PATH.replace $LOAD_PATH | #{$LOAD_PATH.inspect}
-  require 'benchmark'
-  require 'yarvutil'
-#  print '#{type}'
-  begin
-    puts Benchmark.measure{
-      #{w}('#{file}')
-    }.utime
-  rescue Exception => exec_command_error_variable
-    puts "\t" + exec_command_error_variable.message
-  end
-  EOP
-end
-
-def benchmark cmd
-  rubybin = ENV['RUBY'] || RbConfig.ruby
-
-  IO.popen(rubybin, 'r+'){|io|
-    io.write cmd
-    io.close_write
-    return io.gets
-  }
-end
-
-def ruby_exec file
-  prog = exec_command 'ruby', file, 'load'
-  benchmark prog
-end
-
-def yarv_exec file
-  prog = exec_command 'yarv', file, 'YARVUtil.load_bm'
-  benchmark prog
-end
-
-$wr = $wy = nil
-
-def measure bench
-  file = File.dirname($0) + "/bm_#{bench}.rb"
-  r = ruby_exec(file).to_f
-  y = yarv_exec(file).to_f
-  puts "#{bench}\t#{r}\t#{y}"
-end
-
-def measure2
-  r = ruby_exec.to_f
-  y = yarv_exec.to_f
-  puts r/y
-end
-
-if $0 == __FILE__
-  %w{
-    whileloop
-    whileloop2
-    times
-    const
-    method
-    poly_method
-    block
-    rescue
-    rescue2
-  }.each{|bench|
-    measure bench
-  }
-end
-
-
-
-
diff --git a/benchmark/require.yml b/benchmark/require.yml
new file mode 100644
index 0000000000..09f218cf08
--- /dev/null
+++ b/benchmark/require.yml
@@ -0,0 +1,32 @@
+prelude: |
+  require "fileutils"
+
+  def prepare
+    num_files = 10000
+
+    basename = File.dirname($0)
+    data_dir = File.join(basename, "bm_require.data")
+
+    # skip if all of files exists
+    if File.exist?(File.join(data_dir, "c#{num_files}.rb"))
+      return
+    end
+
+    FileUtils.mkdir_p(data_dir)
+
+    1.upto(num_files) do |i|
+      File.write("#{data_dir}/c#{i}.rb", "class C#{i}\n""end\n")
+    end
+  end
+
+  prepare
+benchmark:
+  require: |
+    $:.push File.join(File.dirname(__FILE__), "bm_require.data")
+
+    1.upto(10000) do |i|
+      require "c#{i}"
+    end
+
+    $:.pop
+loop_count: 1
diff --git a/benchmark/require_thread.yml b/benchmark/require_thread.yml
new file mode 100644
index 0000000000..0c63257106
--- /dev/null
+++ b/benchmark/require_thread.yml
@@ -0,0 +1,40 @@
+prelude: |
+  require "fileutils"
+
+  def prepare
+    num_files = 10000
+
+    basename = File.dirname($0)
+    data_dir = File.join(basename, "bm_require.data")
+
+    # skip if all of files exists
+    if File.exist?(File.join(data_dir, "c#{num_files}.rb"))
+      return
+    end
+
+    FileUtils.mkdir_p(data_dir)
+
+    1.upto(num_files) do |i|
+      File.write("#{data_dir}/c#{i}.rb", "class C#{i}\n""end\n")
+    end
+  end
+
+  prepare
+benchmark:
+  require_thread: |
+    $:.push File.join(File.dirname(__FILE__), "bm_require.data")
+
+    i=0
+    t = Thread.new do
+      while true
+        i = i+1 # dummy loop
+      end
+    end
+
+    1.upto(100) do |i|
+      require "c#{i}"
+    end
+
+    $:.pop
+    t.kill
+loop_count: 1
diff --git a/benchmark/run.rb b/benchmark/run.rb
deleted file mode 100644
index 0cd2363849..0000000000
--- a/benchmark/run.rb
+++ /dev/null
@@ -1,127 +0,0 @@
-#
-# Ruby benchmark driver
-#
-
-require 'benchmark'
-require 'rbconfig'
-
-$matzrubyonly = false
-$rubyonly = false
-
-$results  = []
-
-# prepare 'wc.input'
-def prepare_wc_input
-  wcinput = File.join(File.dirname($0), 'wc.input')
-  wcbase  = File.join(File.dirname($0), 'wc.input.base')
-  unless FileTest.exist?(wcinput)
-    data = File.read(wcbase)
-    13.times{
-      data << data
-    }
-    open(wcinput, 'w'){|f| f.write data}
-  end
-end
-
-prepare_wc_input
-
-def bm file
-  prog = File.readlines(file).map{|e| e.rstrip}.join("\n")
-  return if prog.empty?
-
-  /[a-z]+_(.+)\.rb/ =~ file
-  bm_name = $1
-  puts '-----------------------------------------------------------' unless $rubyonly || $matzrubyonly
-  puts "#{bm_name}: "
-
-
-puts <<EOS unless $matzrubyonly || $rubyonly
-#{prog}
---
-EOS
-  begin
-    result = [bm_name]
-    result << matzruby_exec(file) unless $rubyonly
-    result << ruby_exec(file) unless $matzrubyonly
-    $results << result
-
-  rescue Exception => e
-    puts
-    puts "** benchmark failure: #{e}"
-    puts e.backtrace
-  end
-end
-
-def benchmark file, bin
-  m = Benchmark.measure{
-    `#{bin} #{$opts} #{file}`
-  }
-  sec = '%.3f' % m.real
-  puts " #{sec}"
-  sec
-end
-
-def ruby_exec file
-  print 'ruby'
-  benchmark file, $ruby_program
-end
-
-def matzruby_exec file
-  print 'matz'
-  rubylib = ENV['RUBYLIB']
-  ENV['RUBYLIB'] = ''
-  r = benchmark file, $matzruby_program
-  ENV['RUBYLIB'] = rubylib
-  r
-end
-
-if $0 == __FILE__
-  ARGV.each{|arg|
-    case arg
-    when /\A--ruby=(.+)/
-      $ruby_program = $1
-    when /\A--matzruby=(.+)/
-      $matzruby_program = $1
-    when /\A--opts=(.+)/
-      $opts = $1
-    when /\A(-r|--only-ruby)\z/
-      $rubyonly = true
-    when /\A(-m|--only-matzruby)\z/
-      $matzrubyonly = true
-    end
-  }
-  ARGV.delete_if{|arg|
-    /\A-/ =~ arg
-  }
-
-  puts "MatzRuby:"
-  system("#{$matzruby_program} -v")
-  puts "Ruby:"
-  system("#{$ruby_program} -v")
-  puts
-
-  if ARGV.empty?
-    Dir.glob(File.dirname(__FILE__) + '/bm_*.rb').sort.each{|file|
-      bm file
-    }
-  else
-    ARGV.each{|file|
-      Dir.glob(File.join(File.dirname(__FILE__), file + '*')){|ef|
-        # file = "#{File.dirname(__FILE__)}/#{file}.rb"
-        bm ef
-      }
-    }
-  end
-
-  puts
-  puts "-- benchmark summary ---------------------------"
-  $results.each{|res|
-    print res.shift, "\t"
-    (res||[]).each{|result|
-      /([\d\.]+)/ =~ result
-      print $1 + "\t" if $1
-    }
-    puts
-  }
-end
-
diff --git a/benchmark/runc.rb b/benchmark/runc.rb
deleted file mode 100644
index 97c5cef045..0000000000
--- a/benchmark/runc.rb
+++ /dev/null
@@ -1,27 +0,0 @@
-#
-#
-#
-
-require 'benchmark'
-require 'rbconfig'
-
-$rubybin = ENV['RUBY'] || RbConfig.ruby
-
-def runfile file
-  puts file
-  file = File.join(File.dirname($0), 'contrib', file)
-  Benchmark.bm{|x|
-    x.report('ruby'){
-      system("#{$rubybin} #{file}")
-    }
-    x.report('yarv'){
-      system("#{$rubybin} -rite -I.. #{file}")
-    }
-  }
-end
-
-ARGV.each{|file|
-  runfile file
-}
-
-
diff --git a/benchmark/securerandom.rb b/benchmark/securerandom.rb
new file mode 100644
index 0000000000..a082ea6d5b
--- /dev/null
+++ b/benchmark/securerandom.rb
@@ -0,0 +1,5 @@
+require "securerandom"
+
+20_0000.times do
+  SecureRandom.random_number(100)
+end
diff --git a/benchmark/so_ackermann.rb b/benchmark/so_ackermann.rb
new file mode 100644
index 0000000000..4effa1ecaf
--- /dev/null
+++ b/benchmark/so_ackermann.rb
@@ -0,0 +1,19 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: ackermann-ruby.code,v 1.4 2004/11/13 07:40:41 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+def ack(m, n)
+    if m == 0 then
+        n + 1
+    elsif n == 0 then
+        ack(m - 1, 1)
+    else
+        ack(m - 1, ack(m, n - 1))
+    end
+end
+
+NUM = 9
+ack(3, NUM)
+
+
diff --git a/benchmark/so_array.rb b/benchmark/so_array.rb
new file mode 100644
index 0000000000..767e03db5f
--- /dev/null
+++ b/benchmark/so_array.rb
@@ -0,0 +1,23 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: ary-ruby.code,v 1.4 2004/11/13 07:41:27 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# with help from Paul Brannan and Mark Hubbart
+
+n = 9000 # Integer(ARGV.shift || 1)
+
+x = Array.new(n)
+y = Array.new(n, 0)
+
+n.times{|bi|
+  x[bi] = bi + 1
+}
+
+(0 .. 999).each do |e|
+  (n-1).step(0,-1) do |bi|
+    y[bi] += x.at(bi)
+  end
+end
+# puts "#{y.first} #{y.last}"
+
+
diff --git a/benchmark/bm_so_binary_trees.rb b/benchmark/so_binary_trees.rb
index b1693e4109..b1693e4109 100644
--- a/benchmark/bm_so_binary_trees.rb
+++ b/benchmark/so_binary_trees.rb
diff --git a/benchmark/so_concatenate.rb b/benchmark/so_concatenate.rb
new file mode 100644
index 0000000000..4468e20ac8
--- /dev/null
+++ b/benchmark/so_concatenate.rb
@@ -0,0 +1,18 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: strcat-ruby.code,v 1.4 2004/11/13 07:43:28 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# based on code from Aristarkh A Zagorodnikov and Dat Nguyen
+
+STUFF = "hello\n"
+i = 0
+while i<10
+  i += 1
+  hello = ''
+  4_000_000.times do |e|
+    hello << STUFF
+  end
+end
+# puts hello.length
+
+
diff --git a/benchmark/so_count_words.yml b/benchmark/so_count_words.yml
new file mode 100644
index 0000000000..99683505f9
--- /dev/null
+++ b/benchmark/so_count_words.yml
@@ -0,0 +1,65 @@
+prelude: |
+  #!/usr/bin/ruby
+
+  wc_input_base = <<EOS
+  Subject:      Re: Who was Izchak Miller?
+  From:         "Jane D. Anonymous" <nobody@yale.edu>
+  Date:         1996/04/28
+  Message-Id:   <4lv7bc$oh@news.ycc.yale.edu>
+  References:   <317C405E.5DFA@panix.com> <4lk6vl$gde@ns.oar.net>
+  To:           75176.2330@compuserve.com
+  Content-Type: text/plain; charset=us-ascii
+  Organization: Yale University
+  X-Url:        news:4lk6vl$gde@ns.oar.net
+  Mime-Version: 1.0
+  Newsgroups:   rec.games.roguelike.nethack
+  X-Mailer:     Mozilla 1.1N (Macintosh; I; 68K)
+
+  Hello there, Izchak Miller was my father.  When I was younger I spent 
+  many a night, hunched over the keyboard with a cup of tea, playing 
+  nethack with him and my brother.  my dad was a philosopher with a strong 
+  weakness for fantasy/sci fi.  I remember when he started to get involved 
+  with the Nethack team- my brother's Dungeons and Dragons monster book 
+  found a regular place beside my dad's desk. it's nice to see him living 
+  on in the game he loved so much :-).  
+                                                                    Tamar Miller
+
+  The following is a really long word of 5000 characters:
+
+  wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww
+  EOS
+
+  # prepare 'wc.input'
+
+  def prepare_wc_input(wcbase)
+    wcinput = File.join(File.dirname($0), 'wc.input')
+    unless FileTest.exist?(wcinput)
+      data = wcbase.dup
+      13.times{
+        data << data
+      }
+      open(wcinput, 'w'){|f| f.write data}
+    end
+  end
+
+  prepare_wc_input(wc_input_base)
+
+benchmark:
+  so_count_words: |
+    # $Id: wc-ruby.code,v 1.4 2004/11/13 07:43:32 bfulgham Exp $
+    # http://www.bagley.org/~doug/shootout/
+    # with help from Paul Brannan
+    input = open(File.join(File.dirname($0), 'wc.input'), 'rb')
+
+    nl = nw = nc = 0
+    while true
+      tmp = input.read(4096) or break
+      data = tmp << (input.gets || "")
+      nc += data.length
+      nl += data.count("\n")
+      ((data.strip! || data).tr!("\n", " ") || data).squeeze!
+      nw += data.count(" ") + 1
+    end
+    # STDERR.puts "#{nl} #{nw} #{nc}"
+
+loop_count: 1
diff --git a/benchmark/so_exception.rb b/benchmark/so_exception.rb
new file mode 100644
index 0000000000..eb205b4df1
--- /dev/null
+++ b/benchmark/so_exception.rb
@@ -0,0 +1,61 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: except-ruby.code,v 1.4 2004/11/13 07:41:33 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+$HI = 0
+$LO = 0
+NUM = 250000 # Integer(ARGV[0] || 1)
+
+
+class Lo_Exception < Exception
+  def initialize(num)
+    @value = num
+  end
+end
+
+class Hi_Exception < Exception
+  def initialize(num)
+    @value = num
+  end
+end
+
+def some_function(num)
+  begin
+    hi_function(num)
+  rescue
+    print "We shouldn't get here, exception is: #{$!.type}\n"
+  end
+end
+
+def hi_function(num)
+  begin
+    lo_function(num)
+  rescue Hi_Exception
+    $HI = $HI + 1
+  end
+end
+
+def lo_function(num)
+  begin
+    blowup(num)
+  rescue Lo_Exception
+    $LO = $LO + 1
+  end
+end
+
+def blowup(num)
+  if num % 2 == 0
+    raise Lo_Exception.new(num)
+  else
+    raise Hi_Exception.new(num)
+  end
+end
+
+
+i = 1
+max = NUM+1
+while i < max
+  i += 1
+  some_function(i+1)
+end
diff --git a/benchmark/bm_so_fannkuch.rb b/benchmark/so_fannkuch.rb
index bac5ecd44c..bac5ecd44c 100644
--- a/benchmark/bm_so_fannkuch.rb
+++ b/benchmark/so_fannkuch.rb
diff --git a/benchmark/so_fasta.rb b/benchmark/so_fasta.rb
new file mode 100644
index 0000000000..dcc6b39507
--- /dev/null
+++ b/benchmark/so_fasta.rb
@@ -0,0 +1,81 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+# Contributed by Sokolov Yura
+
+$last = 42.0
+def gen_random(max, im=139968, ia=3877, ic=29573)
+    (max * ($last = ($last * ia + ic) % im)) / im
+end
+
+alu =
+   "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+   "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+   "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+   "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+   "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+   "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+   "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+iub = [
+    ["a", 0.27],
+    ["c", 0.12],
+    ["g", 0.12],
+    ["t", 0.27],
+
+    ["B", 0.02],
+    ["D", 0.02],
+    ["H", 0.02],
+    ["K", 0.02],
+    ["M", 0.02],
+    ["N", 0.02],
+    ["R", 0.02],
+    ["S", 0.02],
+    ["V", 0.02],
+    ["W", 0.02],
+    ["Y", 0.02],
+]
+homosapiens = [
+    ["a", 0.3029549426680],
+    ["c", 0.1979883004921],
+    ["g", 0.1975473066391],
+    ["t", 0.3015094502008],
+]
+
+def make_repeat_fasta(id, desc, src, n)
+    puts ">#{id} #{desc}"
+    v = nil
+    width = 60
+    l = src.length
+    s = src * ((n / l) + 1)
+    s.slice!(n, l)
+    puts(s.scan(/.{1,#{width}}/).join("\n"))
+end
+
+def make_random_fasta(id, desc, table, n)
+    puts ">#{id} #{desc}"
+    rand, v = nil,nil
+    width = 60
+    chunk = 1 * width
+    prob = 0.0
+    table.each{|v| v[1]= (prob += v[1])}
+    for i in 1..(n/width)
+        puts((1..width).collect{
+            rand = gen_random(1.0)
+            table.find{|v| v[1]>rand}[0]
+        }.join)
+    end
+    if n%width != 0
+        puts((1..(n%width)).collect{
+            rand = gen_random(1.0)
+            table.find{|v| v[1]>rand}[0]
+        }.join)
+    end
+end
+
+
+n = (ARGV[0] or 250_000).to_i
+
+make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+
diff --git a/benchmark/so_k_nucleotide.yml b/benchmark/so_k_nucleotide.yml
new file mode 100644
index 0000000000..d7df086c39
--- /dev/null
+++ b/benchmark/so_k_nucleotide.yml
@@ -0,0 +1,155 @@
+prelude: |
+  bm_so_fasta = <<'EOS'
+  # The Computer Language Shootout
+  # http://shootout.alioth.debian.org/
+  # Contributed by Sokolov Yura
+
+  $last = 42.0
+  def gen_random(max, im=139968, ia=3877, ic=29573)
+      (max * ($last = ($last * ia + ic) % im)) / im
+  end
+
+  alu =
+     "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+     "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+     "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+     "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+     "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+     "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+     "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+  iub = [
+      ["a", 0.27],
+      ["c", 0.12],
+      ["g", 0.12],
+      ["t", 0.27],
+
+      ["B", 0.02],
+      ["D", 0.02],
+      ["H", 0.02],
+      ["K", 0.02],
+      ["M", 0.02],
+      ["N", 0.02],
+      ["R", 0.02],
+      ["S", 0.02],
+      ["V", 0.02],
+      ["W", 0.02],
+      ["Y", 0.02],
+  ]
+  homosapiens = [
+      ["a", 0.3029549426680],
+      ["c", 0.1979883004921],
+      ["g", 0.1975473066391],
+      ["t", 0.3015094502008],
+  ]
+
+  def make_repeat_fasta(id, desc, src, n)
+      puts ">#{id} #{desc}"
+      v = nil
+      width = 60
+      l = src.length
+      s = src * ((n / l) + 1)
+      s.slice!(n, l)
+      puts(s.scan(/.{1,#{width}}/).join("\n"))
+  end
+
+  def make_random_fasta(id, desc, table, n)
+      puts ">#{id} #{desc}"
+      rand, v = nil,nil
+      width = 60
+      chunk = 1 * width
+      prob = 0.0
+      table.each{|v| v[1]= (prob += v[1])}
+      for i in 1..(n/width)
+          puts((1..width).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+      if n%width != 0
+          puts((1..(n%width)).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+  end
+
+
+  n = (ARGV[0] or 250_000).to_i
+
+  make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+  make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+  make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+  EOS
+benchmark:
+  - name: so_k_nucleotide
+    prelude: |
+      script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+      File.write(script, bm_so_fasta)
+
+      def prepare_fasta_output n
+        filebase = File.join(File.dirname($0), 'fasta.output')
+        script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+        file = "#{filebase}.#{n}"
+
+        unless FileTest.exist?(file)
+          STDERR.puts "preparing #{file}"
+
+          open(file, 'w'){|f|
+            ARGV[0] = n
+            $stdout = f
+            load script
+            $stdout = STDOUT
+          }
+        end
+      end
+      prepare_fasta_output(100_000)
+    script: |
+      # The Computer Language Shootout
+      # http://shootout.alioth.debian.org
+      #
+      # contributed by jose fco. gonzalez
+      # modified by Sokolov Yura
+
+      seq = String.new
+
+      def frecuency( seq,length )
+          n, table = seq.length - length + 1, Hash.new(0)
+          f, i = nil, nil
+          (0 ... length).each do |f|
+              (f ... n).step(length) do |i|
+                  table[seq[i,length]] += 1
+              end
+          end
+          [n,table]
+
+      end
+
+      def sort_by_freq( seq,length )
+          n,table = frecuency( seq,length )
+          a, b, v = nil, nil, nil
+          table.sort{|a,b| b[1] <=> a[1]}.each do |v|
+              puts "%s %.3f" % [v[0].upcase,((v[1]*100).to_f/n)]
+          end
+          puts
+      end
+
+      def find_seq( seq,s )
+          n,table = frecuency( seq,s.length )
+          puts "#{table[s].to_s}\t#{s.upcase}"
+      end
+
+      input = open(File.join(File.dirname($0), 'fasta.output.100000'), 'rb')
+
+      line = input.gets while line !~ /^>THREE/
+      line = input.gets
+
+      while (line !~ /^>/) & line do
+          seq << line.chomp
+          line = input.gets
+      end
+
+      [1,2].each {|i| sort_by_freq( seq,i ) }
+
+      %w(ggt ggta ggtatt ggtattttaatt ggtattttaatttatagt).each{|s| find_seq( seq,s) }
+    loop_count: 1
diff --git a/benchmark/bm_so_lists.rb b/benchmark/so_lists.rb
index e8f4a2a5f7..e8f4a2a5f7 100644
--- a/benchmark/bm_so_lists.rb
+++ b/benchmark/so_lists.rb
diff --git a/benchmark/bm_so_mandelbrot.rb b/benchmark/so_mandelbrot.rb
index 76331c64b8..76331c64b8 100644
--- a/benchmark/bm_so_mandelbrot.rb
+++ b/benchmark/so_mandelbrot.rb
diff --git a/benchmark/so_matrix.rb b/benchmark/so_matrix.rb
new file mode 100644
index 0000000000..2d1e72bda9
--- /dev/null
+++ b/benchmark/so_matrix.rb
@@ -0,0 +1,48 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: matrix-ruby.code,v 1.4 2004/11/13 07:42:14 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+n = 60 #Integer(ARGV.shift || 1)
+
+size = 40
+
+def mkmatrix(rows, cols)
+    count = 1
+    mx = Array.new(rows)
+    (0 .. (rows - 1)).each do |bi|
+        row = Array.new(cols, 0)
+        (0 .. (cols - 1)).each do |j|
+            row[j] = count
+            count += 1
+        end
+        mx[bi] = row
+    end
+    mx
+end
+
+def mmult(rows, cols, m1, m2)
+    m3 = Array.new(rows)
+    (0 .. (rows - 1)).each do |bi|
+        row = Array.new(cols, 0)
+        (0 .. (cols - 1)).each do |j|
+            val = 0
+            (0 .. (cols - 1)).each do |k|
+                val += m1.at(bi).at(k) * m2.at(k).at(j)
+            end
+            row[j] = val
+        end
+        m3[bi] = row
+    end
+    m3
+end
+
+m1 = mkmatrix(size, size)
+m2 = mkmatrix(size, size)
+mm = Array.new
+n.times do
+    mm = mmult(size, size, m1, m2)
+end
+# puts "#{mm[0][0]} #{mm[2][3]} #{mm[3][2]} #{mm[4][4]}"
+
+
diff --git a/benchmark/so_meteor_contest.rb b/benchmark/so_meteor_contest.rb
new file mode 100644
index 0000000000..8c136baa6c
--- /dev/null
+++ b/benchmark/so_meteor_contest.rb
@@ -0,0 +1,563 @@
+#!/usr/bin/env ruby
+#
+# The Computer Language Shootout
+#   http://shootout.alioth.debian.org
+#   contributed by Kevin Barnes (Ruby novice)
+
+# PROGRAM:  the main body is at the bottom.
+#   1) read about the problem here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
+#   2) see how I represent a board as a bitmask by reading the blank_board comments
+#   3) read as your mental paths take you
+
+def print *args
+end
+
+# class to represent all information about a particular rotation of a particular piece
+class Rotation
+  # an array (by location) containing a bit mask for how the piece maps at the given location.
+  # if the rotation is invalid at that location the mask will contain false
+  attr_reader :start_masks
+
+  # maps a direction to a relative location.  these differ depending on whether it is an even or
+  # odd row being mapped from
+  @@rotation_even_adder = { :west => -1, :east => 1, :nw => -7, :ne => -6, :sw => 5, :se => 6 }
+  @@rotation_odd_adder = { :west => -1, :east => 1, :nw => -6, :ne => -5, :sw => 6, :se => 7 }
+
+  def initialize( directions )
+    @even_offsets, @odd_offsets = normalize_offsets( get_values( directions ))
+
+    @even_mask = mask_for_offsets( @even_offsets)
+    @odd_mask = mask_for_offsets( @odd_offsets)
+
+    @start_masks = Array.new(60)
+
+    # create the rotational masks by placing the base mask at the location and seeing if
+    # 1) it overlaps the boundaries and 2) it produces a prunable board.  if either of these
+    # is true the piece cannot be placed
+    0.upto(59) do | offset |
+      mask = is_even(offset) ? (@even_mask << offset) : (@odd_mask << offset)
+      if (blank_board & mask == 0 && !prunable(blank_board | mask, 0, true)) then
+        imask = compute_required( mask, offset)
+        @start_masks[offset] = [ mask, imask, imask | mask ]
+      else
+        @start_masks[offset] = false
+      end
+    end
+  end
+
+  def compute_required( mask, offset )
+    board = blank_board
+    0.upto(offset) { | i | board |= 1 << i }
+    board |= mask
+    return 0 if (!prunable(board | mask, offset))
+    board = flood_fill(board,58)
+    count = 0
+    imask = 0
+    0.upto(59) do | i |
+      if (board[i] == 0) then
+        imask |= (1 << i)
+        count += 1
+      end
+    end
+    (count > 0 && count < 5) ? imask : 0
+  end
+
+  def flood_fill( board, location)
+    return board if (board[location] == 1)
+    board |= 1 << location
+    row, col = location.divmod(6)
+    board = flood_fill( board, location - 1) if (col > 0)
+    board = flood_fill( board, location + 1) if (col < 4)
+    if (row % 2 == 0) then
+      board = flood_fill( board, location - 7) if (col > 0 && row > 0)
+      board = flood_fill( board, location - 6) if (row > 0)
+      board = flood_fill( board, location + 6) if (row < 9)
+      board = flood_fill( board, location + 5) if (col > 0 && row < 9)
+    else
+      board = flood_fill( board, location - 5) if (col < 4 && row > 0)
+      board = flood_fill( board, location - 6) if (row > 0)
+      board = flood_fill( board, location + 6) if (row < 9)
+      board = flood_fill( board, location + 7) if (col < 4 && row < 9)
+    end
+    board
+  end
+
+  # given a location, produces a list of relative locations covered by the piece at this rotation
+  def offsets( location)
+    if is_even( location) then
+      @even_offsets.collect { | value | value + location }
+    else
+      @odd_offsets.collect { | value | value + location }
+    end
+  end
+
+  # returns a set of offsets relative to the top-left most piece of the rotation (by even or odd rows)
+  # this is hard to explain. imagine we have this partial board:
+  #   0 0 0 0 0 x        [positions 0-5]
+  #    0 0 1 1 0 x       [positions 6-11]
+  #   0 0 1 0 0 x        [positions 12-17]
+  #    0 1 0 0 0 x       [positions 18-23]
+  #   0 1 0 0 0 x        [positions 24-29]
+  #    0 0 0 0 0 x       [positions 30-35]
+  #       ...
+  # The top-left of the piece is at position 8, the
+  # board would be passed as a set of positions (values array) containing [8,9,14,19,25] not necessarily in that
+  # sorted order.  Since that array starts on an odd row, the offsets for an odd row are: [0,1,6,11,17] obtained
+  # by subtracting 8 from everything.  Now imagine the piece shifted up and to the right so it's on an even row:
+  #   0 0 0 1 1 x        [positions 0-5]
+  #    0 0 1 0 0 x       [positions 6-11]
+  #   0 0 1 0 0 x        [positions 12-17]
+  #    0 1 0 0 0 x       [positions 18-23]
+  #   0 0 0 0 0 x        [positions 24-29]
+  #    0 0 0 0 0 x       [positions 30-35]
+  #       ...
+  # Now the positions are [3,4,8,14,19] which after subtracting the lowest value (3) gives [0,1,5,11,16] thus, the
+  # offsets for this particular piece are (in even, odd order) [0,1,5,11,16],[0,1,6,11,17] which is what
+  # this function would return
+  def normalize_offsets( values)
+    min = values.min
+    even_min = is_even(min)
+    other_min = even_min ? min + 6 : min + 7
+    other_values = values.collect do | value |
+      if is_even(value) then
+        value + 6 - other_min
+      else
+        value + 7 - other_min
+      end
+    end
+    values.collect! { | value | value - min }
+
+    if even_min then
+      [values, other_values]
+    else
+      [other_values, values]
+    end
+  end
+
+  # produce a bitmask representation of an array of offset locations
+  def mask_for_offsets( offsets )
+    mask = 0
+    offsets.each { | value | mask = mask + ( 1 << value ) }
+    mask
+  end
+
+  # finds a "safe" position that a position as described by a list of directions can be placed
+  # without falling off any edge of the board.  the values returned a location to place the first piece
+  # at so it will fit after making the described moves
+  def start_adjust( directions )
+    south = east = 0;
+    directions.each do | direction |
+      east += 1 if ( direction == :sw || direction == :nw || direction == :west )
+      south += 1 if ( direction == :nw || direction == :ne )
+    end
+    south * 6 + east
+  end
+
+  # given a set of directions places the piece (as defined by a set of directions) on the board at
+  # a location that will not take it off the edge
+  def get_values( directions )
+    start = start_adjust(directions)
+    values = [ start ]
+    directions.each do | direction |
+      if (start % 12 >= 6) then
+        start += @@rotation_odd_adder[direction]
+      else
+        start += @@rotation_even_adder[direction]
+      end
+      values += [ start ]
+    end
+
+    # some moves take you back to an existing location, we'll strip duplicates
+    values.uniq
+  end
+end
+
+# describes a piece and caches information about its rotations to as to be efficient for iteration
+# ATTRIBUTES:
+#   rotations -- all the rotations of the piece
+#   type -- a numeic "name" of the piece
+#   masks -- an array by location of all legal rotational masks (a n inner array) for that location
+#   placed -- the mask that this piece was last placed at (not a location, but the actual mask used)
+class Piece
+  attr_reader :rotations, :type, :masks
+  attr_accessor :placed
+
+  # transform hashes that change one direction into another when you either flip or rotate a set of directions
+  @@flip_converter = { :west => :west, :east => :east, :nw => :sw, :ne => :se, :sw => :nw, :se => :ne }
+  @@rotate_converter = { :west => :nw, :east => :se, :nw => :ne, :ne => :east, :sw => :west, :se => :sw }
+
+  def initialize( directions, type )
+    @type = type
+    @rotations = Array.new();
+    @map = {}
+
+    generate_rotations( directions )
+    directions.collect! { | value | @@flip_converter[value] }
+    generate_rotations( directions )
+
+    # creates the masks AND a map that returns [location, rotation] for any given mask
+    # this is used when a board is found and we want to draw it, otherwise the map is unused
+    @masks = Array.new();
+    0.upto(59) do | i |
+      even = true
+      @masks[i] = @rotations.collect do | rotation |
+        mask = rotation.start_masks[i]
+        @map[mask[0]] = [ i, rotation ] if (mask)
+        mask || nil
+      end
+      @masks[i].compact!
+    end
+  end
+
+  # rotates a set of directions through all six angles and adds a Rotation to the list for each one
+  def generate_rotations( directions )
+    6.times do
+      rotations.push( Rotation.new(directions))
+      directions.collect! { | value | @@rotate_converter[value] }
+    end
+  end
+
+  # given a board string, adds this piece to the board at whatever location/rotation
+  # important: the outbound board string is 5 wide, the normal location notation is six wide (padded)
+  def fill_string( board_string)
+    location, rotation = @map[@placed]
+    rotation.offsets(location).each do | offset |
+      row, col = offset.divmod(6)
+      board_string[ row*5 + col, 1 ] = @type.to_s
+    end
+  end
+end
+
+# a blank bit board having this form:
+#
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    1 1 1 1 1 1
+#
+# where left lest significant bit is the top left and the most significant is the lower right
+# the actual board only consists of the 0 places, the 1 places are blockers to keep things from running
+# off the edges or bottom
+def blank_board
+  0b111111100000100000100000100000100000100000100000100000100000100000
+end
+
+def full_board
+  0b111111111111111111111111111111111111111111111111111111111111111111
+end
+
+# determines if a location (bit position) is in an even row
+def is_even( location)
+  (location % 12) < 6
+end
+
+# support function that create three utility maps:
+#  $converter -- for each row an array that maps a five bit row (via array mapping)
+#                to the a five bit representation of the bits below it
+#  $bit_count -- maps a five bit row (via array mapping) to the number of 1s in the row
+#  @@new_regions -- maps a five bit row (via array mapping) to an array of "region" arrays
+#                   a region array has three values the first is a mask of bits in the region,
+#                   the second is the count of those bits and the third is identical to the first
+#                   examples:
+#                           0b10010 => [ 0b01100, 2, 0b01100 ], [ 0b00001, 1, 0b00001]
+#                           0b01010 => [ 0b10000, 1, 0b10000 ], [ 0b00100, 1, 0b00100 ], [ 0b00001, 1, 0b00001]
+#                           0b10001 => [ 0b01110, 3, 0b01110 ]
+def create_collector_support
+  odd_map = [0b11, 0b110, 0b1100, 0b11000, 0b10000]
+  even_map = [0b1, 0b11, 0b110, 0b1100, 0b11000]
+
+  all_odds = Array.new(0b100000)
+  all_evens = Array.new(0b100000)
+  bit_counts = Array.new(0b100000)
+  new_regions = Array.new(0b100000)
+  0.upto(0b11111) do | i |
+    bit_count = odd = even = 0
+    0.upto(4) do | bit |
+      if (i[bit] == 1) then
+        bit_count += 1
+        odd |= odd_map[bit]
+        even |= even_map[bit]
+      end
+    end
+    all_odds[i] = odd
+    all_evens[i] = even
+    bit_counts[i] = bit_count
+    new_regions[i] = create_regions( i)
+  end
+
+  $converter = []
+  10.times { | row | $converter.push((row % 2 == 0) ? all_evens : all_odds) }
+  $bit_counts = bit_counts
+  $regions = new_regions.collect { | set | set.collect { | value | [ value, bit_counts[value], value] } }
+end
+
+# determines if a board is punable, meaning that there is no possibility that it
+# can be filled up with pieces.  A board is prunable if there is a grouping of unfilled spaces
+# that are not a multiple of five.  The following board is an example of a prunable board:
+#    0 0 1 0 0
+#     0 1 0 0 0
+#    1 1 0 0 0
+#     0 1 0 0 0
+#    0 0 0 0 0
+#       ...
+#
+# This board is prunable because the top left corner is only 3 bits in area, no piece will ever fit it
+# parameters:
+#   board -- an initial bit board (6 bit padded rows, see blank_board for format)
+#   location -- starting location, everything above and to the left is already full
+#   slotting -- set to true only when testing initial pieces, when filling normally
+#               additional assumptions are possible
+#
+# Algorithm:
+#    The algorithm starts at the top row (as determined by location) and iterates a row at a time
+#    maintainng counts of active open areas (kept in the collector array) each collector contains
+#    three values at the start of an iteration:
+#          0: mask of bits that would be adjacent to the collector in this row
+#          1: the number of bits collected so far
+#          2: a scratch space starting as zero, but used during the computation to represent
+#             the empty bits in the new row that are adjacent (position 0)
+#  The exact procedure is described in-code
+def prunable( board, location, slotting = false)
+  collectors = []
+  # loop across the rows
+  (location / 6).to_i.upto(9) do | row_on |
+    # obtain a set of regions representing the bits of the current row.
+    regions = $regions[(board >> (row_on * 6)) & 0b11111]
+    converter = $converter[row_on]
+
+    # track the number of collectors at the start of the cycle so that
+    # we don't compute against newly created collectors, only existing collectors
+    initial_collector_count = collectors.length
+
+    # loop against the regions.  For each region of the row
+    # we will see if it connects to one or more existing collectors.
+    # if it connects to 1 collector, the bits from the region are added to the
+    # bits of the collector and the mask is placed in collector[2]
+    # If the region overlaps more than one collector then all the collectors
+    # it overlaps with are merged into the first one (the others are set to nil in the array)
+    # if NO collectors are found then the region is copied as a new collector
+    regions.each do | region |
+      collector_found = nil
+      region_mask = region[2]
+      initial_collector_count.times do | collector_num |
+        collector = collectors[collector_num]
+        if (collector) then
+          collector_mask = collector[0]
+          if (collector_mask & region_mask != 0) then
+            if (collector_found) then
+              collector_found[0] |= collector_mask
+              collector_found[1] += collector[1]
+              collector_found[2] |= collector[2]
+              collectors[collector_num] = nil
+            else
+              collector_found = collector
+              collector[1] += region[1]
+              collector[2] |= region_mask
+            end
+          end
+        end
+      end
+      if (collector_found == nil) then
+        collectors.push(Array.new(region))
+      end
+    end
+
+    # check the existing collectors, if any collector overlapped no bits in the region its [2] value will
+    # be zero.  The size of any such reaason is tested if it is not a multiple of five true is returned since
+    # the board is prunable.  if it is a multiple of five it is removed.
+    # Collector that are still active have a new adjacent value [0] set based n the matched bits
+    # and have [2] cleared out for the next cycle.
+    collectors.length.times do | collector_num |
+      collector = collectors[collector_num]
+      if (collector) then
+        if (collector[2] == 0) then
+          return true if (collector[1] % 5 != 0)
+          collectors[collector_num] = nil
+        else
+          # if a collector matches all bits in the row then we can return unprunable early for the
+          # following reasons:
+          #    1) there can be no more unavailable bits bince we fill from the top left downward
+          #    2) all previous regions have been closed or joined so only this region can fail
+          #    3) this region must be good since there can never be only 1 region that is nuot
+          #       a multiple of five
+          # this rule only applies when filling normally, so we ignore the rule if we are "slotting"
+          # in pieces to see what configurations work for them (the only other time this algorithm is used).
+          return false if (collector[2] == 0b11111 && !slotting)
+          collector[0] = converter[collector[2]]
+          collector[2] = 0
+        end
+      end
+    end
+
+    # get rid of all the empty converters for the next round
+    collectors.compact!
+  end
+  return false if (collectors.length <= 1) # 1 collector or less and the region is fine
+  collectors.any? { | collector | (collector[1] % 5) != 0 } # more than 1 and we test them all for bad size
+end
+
+# creates a region given a row mask.  see prunable for what a "region" is
+def create_regions( value )
+  regions = []
+  cur_region = 0
+  5.times do | bit |
+    if (value[bit] == 0) then
+      cur_region |= 1 << bit
+    else
+      if (cur_region != 0 ) then
+        regions.push( cur_region)
+        cur_region = 0;
+      end
+    end
+  end
+  regions.push(cur_region) if (cur_region != 0)
+  regions
+end
+
+# find up to the counted number of solutions (or all solutions) and prints the final result
+def find_all
+  find_top( 1)
+  find_top( 0)
+  print_results
+end
+
+# show the board
+def print_results
+  print "#{@boards_found} solutions found\n\n"
+  print_full_board( @min_board)
+  print "\n"
+  print_full_board( @max_board)
+  print "\n"
+end
+
+# finds solutions.  This special version of the main function is only used for the top level
+# the reason for it is basically to force a particular ordering on how the rotations are tested for
+# the first piece.  It is called twice, first looking for placements of the odd rotations and then
+# looking for placements of the even locations.
+#
+# WHY?
+#   Since any found solution has an inverse we want to maximize finding solutions that are not already found
+#   as an inverse.  The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away
+#   (an odd number).  Checking even vs odd then produces a higher probability of finding more pieces earlier
+#   in the cycle.  We still need to keep checking all the permutations, but our probability of finding one will
+#   diminsh over time.  Since we are TOLD how many to search for this lets us exit before checking all pieces
+#   this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the
+#   maximum number
+def find_top( rotation_skip)
+  board = blank_board
+  (@pieces.length-1).times do
+    piece = @pieces.shift
+    piece.masks[0].each do | mask, imask, cmask |
+      if ((rotation_skip += 1) % 2 == 0) then
+        piece.placed = mask
+        find( 1, 1, board | mask)
+      end
+    end
+    @pieces.push(piece)
+  end
+  piece = @pieces.shift
+  @pieces.push(piece)
+end
+
+# the normail find routine, iterates through the available pieces, checks all rotations at the current location
+# and adds any boards found.  depth is achieved via recursion.  the overall approach is described
+# here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
+# parameters:
+#  start_location -- where to start looking for place for the next piece at
+#  placed -- number of pieces placed
+#  board -- current state of the board
+#
+# see in-code comments
+def find( start_location, placed, board)
+  # find the next location to place a piece by looking for an empty bit
+  while board[start_location] == 1
+    start_location += 1
+  end
+
+  @pieces.length.times do
+    piece = @pieces.shift
+    piece.masks[start_location].each do | mask, imask, cmask |
+      if ( board & cmask == imask) then
+        piece.placed = mask
+        if (placed == 9) then
+          add_board
+        else
+          find( start_location + 1, placed + 1, board | mask)
+        end
+      end
+    end
+    @pieces.push(piece)
+  end
+end
+
+# print the board
+def print_full_board( board_string)
+  10.times do | row |
+    print " " if (row % 2 == 1)
+    5.times do | col |
+      print "#{board_string[row*5 + col,1]} "
+    end
+    print "\n"
+  end
+end
+
+# when a board is found we "draw it" into a string and then flip that string, adding both to
+# the list (hash) of solutions if they are unique.
+def add_board
+  board_string = "99999999999999999999999999999999999999999999999999"
+  @all_pieces.each {  | piece | piece.fill_string( board_string ) }
+  save( board_string)
+  save( board_string.reverse)
+end
+
+# adds a board string to the list (if new) and updates the current best/worst board
+def save( board_string)
+  if (@all_boards[board_string] == nil) then
+    @min_board = board_string if (board_string < @min_board)
+    @max_board = board_string if (board_string > @max_board)
+    @all_boards.store(board_string,true)
+    @boards_found += 1
+
+    # the exit motif is a time saver.  Ideally the function should return, but those tests
+    # take noticeable time (performance).
+    if (@boards_found == @stop_count) then
+      print_results
+      exit(0)
+    end
+  end
+end
+
+
+##
+## MAIN BODY :)
+##
+create_collector_support
+@pieces = [
+  Piece.new( [ :nw, :ne, :east, :east ], 2),
+  Piece.new( [ :ne, :se, :east, :ne ], 7),
+  Piece.new( [ :ne, :east, :ne, :nw ], 1),
+  Piece.new( [ :east, :sw, :sw, :se ], 6),
+  Piece.new( [ :east, :ne, :se, :ne ], 5),
+  Piece.new( [ :east, :east, :east, :se ], 0),
+  Piece.new( [ :ne, :nw, :se, :east, :se ], 4),
+  Piece.new( [ :se, :se, :se, :west ], 9),
+  Piece.new( [ :se, :se, :east, :se ], 8),
+  Piece.new( [ :east, :east, :sw, :se ], 3)
+  ];
+
+@all_pieces = Array.new( @pieces)
+
+@min_board = "99999999999999999999999999999999999999999999999999"
+@max_board = "00000000000000000000000000000000000000000000000000"
+@stop_count = ARGV[0].to_i || 2089
+@all_boards = {}
+@boards_found = 0
+
+find_all ######## DO IT!!!
diff --git a/benchmark/so_nbody.rb b/benchmark/so_nbody.rb
new file mode 100644
index 0000000000..9884fc4edc
--- /dev/null
+++ b/benchmark/so_nbody.rb
@@ -0,0 +1,148 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org
+#
+# Optimized for Ruby by Jesse Millikan
+# From version ported by Michael Neumann from the C gcc version,
+# which was written by Christoph Bauer.
+
+SOLAR_MASS = 4 * Math::PI**2
+DAYS_PER_YEAR = 365.24
+
+def _puts *args
+end
+
+class Planet
+  attr_accessor :x, :y, :z, :vx, :vy, :vz, :mass
+
+  def initialize(x, y, z, vx, vy, vz, mass)
+    @x, @y, @z = x, y, z
+    @vx, @vy, @vz = vx * DAYS_PER_YEAR, vy * DAYS_PER_YEAR, vz * DAYS_PER_YEAR
+    @mass = mass * SOLAR_MASS
+  end
+
+  def move_from_i(bodies, nbodies, dt, i)
+    while i < nbodies
+      b2 = bodies[i]
+      dx = @x - b2.x
+      dy = @y - b2.y
+      dz = @z - b2.z
+
+      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+      mag = dt / (distance * distance * distance)
+      b_mass_mag, b2_mass_mag = @mass * mag, b2.mass * mag
+
+      @vx -= dx * b2_mass_mag
+      @vy -= dy * b2_mass_mag
+      @vz -= dz * b2_mass_mag
+      b2.vx += dx * b_mass_mag
+      b2.vy += dy * b_mass_mag
+      b2.vz += dz * b_mass_mag
+      i += 1
+    end
+
+    @x += dt * @vx
+    @y += dt * @vy
+    @z += dt * @vz
+  end
+end
+
+def energy(bodies)
+  e = 0.0
+  nbodies = bodies.size
+
+  for i in 0 ... nbodies
+    b = bodies[i]
+    e += 0.5 * b.mass * (b.vx * b.vx + b.vy * b.vy + b.vz * b.vz)
+    for j in (i + 1) ... nbodies
+      b2 = bodies[j]
+      dx = b.x - b2.x
+      dy = b.y - b2.y
+      dz = b.z - b2.z
+      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+      e -= (b.mass * b2.mass) / distance
+    end
+  end
+  e
+end
+
+def offset_momentum(bodies)
+  px, py, pz = 0.0, 0.0, 0.0
+
+  for b in bodies
+    m = b.mass
+    px += b.vx * m
+    py += b.vy * m
+    pz += b.vz * m
+  end
+
+  b = bodies[0]
+  b.vx = - px / SOLAR_MASS
+  b.vy = - py / SOLAR_MASS
+  b.vz = - pz / SOLAR_MASS
+end
+
+BODIES = [
+  # sun
+  Planet.new(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0),
+
+  # jupiter
+  Planet.new(
+    4.84143144246472090e+00,
+    -1.16032004402742839e+00,
+    -1.03622044471123109e-01,
+    1.66007664274403694e-03,
+    7.69901118419740425e-03,
+    -6.90460016972063023e-05,
+    9.54791938424326609e-04),
+
+  # saturn
+  Planet.new(
+    8.34336671824457987e+00,
+    4.12479856412430479e+00,
+    -4.03523417114321381e-01,
+    -2.76742510726862411e-03,
+    4.99852801234917238e-03,
+    2.30417297573763929e-05,
+    2.85885980666130812e-04),
+
+  # uranus
+  Planet.new(
+    1.28943695621391310e+01,
+    -1.51111514016986312e+01,
+    -2.23307578892655734e-01,
+    2.96460137564761618e-03,
+    2.37847173959480950e-03,
+    -2.96589568540237556e-05,
+    4.36624404335156298e-05),
+
+  # neptune
+  Planet.new(
+    1.53796971148509165e+01,
+    -2.59193146099879641e+01,
+    1.79258772950371181e-01,
+    2.68067772490389322e-03,
+    1.62824170038242295e-03,
+    -9.51592254519715870e-05,
+    5.15138902046611451e-05)
+]
+
+init = 200_000 # ARGV[0]
+n = Integer(init)
+
+offset_momentum(BODIES)
+
+puts "%.9f" % energy(BODIES)
+
+nbodies = BODIES.size
+dt = 0.01
+
+n.times do
+  i = 0
+  while i < nbodies
+    b = BODIES[i]
+    b.move_from_i(BODIES, nbodies, dt, i + 1)
+    i += 1
+  end
+end
+
+puts "%.9f" % energy(BODIES)
diff --git a/benchmark/so_nested_loop.rb b/benchmark/so_nested_loop.rb
new file mode 100644
index 0000000000..766fcf7b84
--- /dev/null
+++ b/benchmark/so_nested_loop.rb
@@ -0,0 +1,24 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: nestedloop-ruby.code,v 1.4 2004/11/13 07:42:22 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# from Avi Bryant
+
+n = 16 # Integer(ARGV.shift || 1)
+x = 0
+n.times do
+    n.times do
+        n.times do
+            n.times do
+                n.times do
+                    n.times do
+                        x += 1
+                    end
+                end
+            end
+        end
+    end
+end
+# puts x
+
+
diff --git a/benchmark/bm_so_nsieve.rb b/benchmark/so_nsieve.rb
index a65cc78233..a65cc78233 100644
--- a/benchmark/bm_so_nsieve.rb
+++ b/benchmark/so_nsieve.rb
diff --git a/benchmark/bm_so_nsieve_bits.rb b/benchmark/so_nsieve_bits.rb
index 6f958ee44e..6f958ee44e 100644
--- a/benchmark/bm_so_nsieve_bits.rb
+++ b/benchmark/so_nsieve_bits.rb
diff --git a/benchmark/so_object.rb b/benchmark/so_object.rb
new file mode 100644
index 0000000000..131f44624c
--- /dev/null
+++ b/benchmark/so_object.rb
@@ -0,0 +1,56 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: objinst-ruby.code,v 1.4 2004/11/13 07:42:25 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# with help from Aristarkh Zagorodnikov
+
+class Toggle
+    def initialize(start_state)
+        @bool = start_state
+    end
+
+    def value
+        @bool
+    end
+
+    def activate
+        @bool = !@bool
+        self
+    end
+end
+
+class NthToggle < Toggle
+    def initialize(start_state, max_counter)
+        super start_state
+        @count_max = max_counter
+        @counter = 0
+    end
+
+    def activate
+        @counter += 1
+        if @counter >= @count_max
+            @bool = !@bool
+            @counter = 0
+        end
+        self
+    end
+end
+
+n = 1500000 # (ARGV.shift || 1).to_i
+
+toggle = Toggle.new 1
+5.times do
+    toggle.activate.value ? 'true' : 'false'
+end
+n.times do
+    toggle = Toggle.new 1
+end
+
+ntoggle = NthToggle.new 1, 3
+8.times do
+    ntoggle.activate.value ? 'true' : 'false'
+end
+n.times do
+    ntoggle = NthToggle.new 1, 3
+end
+
diff --git a/benchmark/bm_so_partial_sums.rb b/benchmark/so_partial_sums.rb
index 630b45cb8d..630b45cb8d 100644
--- a/benchmark/bm_so_partial_sums.rb
+++ b/benchmark/so_partial_sums.rb
diff --git a/benchmark/so_pidigits.rb b/benchmark/so_pidigits.rb
new file mode 100644
index 0000000000..9a537b2d1c
--- /dev/null
+++ b/benchmark/so_pidigits.rb
@@ -0,0 +1,92 @@
+# The Great Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# contributed by Gabriele Renzi
+
+class PiDigitSpigot
+
+    def initialize()
+        @z = Transformation.new 1,0,0,1
+        @x = Transformation.new 0,0,0,0
+        @inverse = Transformation.new 0,0,0,0
+    end
+
+    def next!
+        @y = @z.extract(3)
+        if safe? @y
+            @z = produce(@y)
+            @y
+        else
+            @z = consume @x.next!()
+            next!()
+        end
+    end
+
+    def safe?(digit)
+        digit == @z.extract(4)
+    end
+
+    def produce(i)
+        @inverse.qrst(10,-10*i,0,1).compose(@z)
+    end
+
+    def consume(a)
+        @z.compose(a)
+    end
+end
+
+
+class Transformation
+    attr_reader :q, :r, :s, :t
+    def initialize(q, r, s, t)
+        @q,@r,@s,@t,@k = q,r,s,t,0
+    end
+
+    def next!()
+        @q = @k = @k + 1
+        @r = 4 * @k + 2
+        @s = 0
+        @t = 2 * @k + 1
+        self
+    end
+
+    def extract(j)
+        (@q * j + @r) / (@s * j + @t)
+    end
+
+    def compose(a)
+        self.class.new( @q * a.q,
+                        @q * a.r + r * a.t,
+                        @s * a.q + t * a.s,
+                        @s * a.r + t * a.t
+                    )
+    end
+
+    def qrst *args
+        initialize *args
+        self
+    end
+
+
+end
+
+
+WIDTH = 10
+n = 2_500 # Integer(ARGV[0])
+j = 0
+
+digits = PiDigitSpigot.new
+
+while n > 0
+    if n >= WIDTH
+        WIDTH.times {print digits.next!}
+        j += WIDTH
+    else
+        n.times {print digits.next!}
+        (WIDTH-n).times {print " "}
+        j += n
+    end
+    puts "\t:"+j.to_s
+    n -= WIDTH
+end
+
diff --git a/benchmark/bm_so_random.rb b/benchmark/so_random.rb
index a66b9e8e63..a66b9e8e63 100644
--- a/benchmark/bm_so_random.rb
+++ b/benchmark/so_random.rb
diff --git a/benchmark/so_reverse_complement.yml b/benchmark/so_reverse_complement.yml
new file mode 100644
index 0000000000..de05eedfc4
--- /dev/null
+++ b/benchmark/so_reverse_complement.yml
@@ -0,0 +1,137 @@
+prelude: |
+  bm_so_fasta = <<'EOS'
+  # The Computer Language Shootout
+  # http://shootout.alioth.debian.org/
+  # Contributed by Sokolov Yura
+
+  $last = 42.0
+  def gen_random(max, im=139968, ia=3877, ic=29573)
+      (max * ($last = ($last * ia + ic) % im)) / im
+  end
+
+  alu =
+     "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+     "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+     "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+     "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+     "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+     "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+     "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+  iub = [
+      ["a", 0.27],
+      ["c", 0.12],
+      ["g", 0.12],
+      ["t", 0.27],
+
+      ["B", 0.02],
+      ["D", 0.02],
+      ["H", 0.02],
+      ["K", 0.02],
+      ["M", 0.02],
+      ["N", 0.02],
+      ["R", 0.02],
+      ["S", 0.02],
+      ["V", 0.02],
+      ["W", 0.02],
+      ["Y", 0.02],
+  ]
+  homosapiens = [
+      ["a", 0.3029549426680],
+      ["c", 0.1979883004921],
+      ["g", 0.1975473066391],
+      ["t", 0.3015094502008],
+  ]
+
+  def make_repeat_fasta(id, desc, src, n)
+      puts ">#{id} #{desc}"
+      v = nil
+      width = 60
+      l = src.length
+      s = src * ((n / l) + 1)
+      s.slice!(n, l)
+      puts(s.scan(/.{1,#{width}}/).join("\n"))
+  end
+
+  def make_random_fasta(id, desc, table, n)
+      puts ">#{id} #{desc}"
+      rand, v = nil,nil
+      width = 60
+      chunk = 1 * width
+      prob = 0.0
+      table.each{|v| v[1]= (prob += v[1])}
+      for i in 1..(n/width)
+          puts((1..width).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+      if n%width != 0
+          puts((1..(n%width)).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+  end
+
+
+  n = (ARGV[0] or 250_000).to_i
+
+  make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+  make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+  make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+  EOS
+benchmark:
+  - name: so_reverse_complement
+    prelude: |
+      script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+      File.write(script, bm_so_fasta)
+
+      def prepare_fasta_output n
+        filebase = File.join(File.dirname($0), 'fasta.output')
+        script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+        file = "#{filebase}.#{n}"
+
+        unless FileTest.exist?(file)
+          STDERR.puts "preparing #{file}"
+
+          open(file, 'w'){|f|
+            ARGV[0] = n
+            $stdout = f
+            load script
+            $stdout = STDOUT
+          }
+        end
+      end
+      prepare_fasta_output(2_500_000)
+    script: |
+      # The Great Computer Language Shootout
+      # http://shootout.alioth.debian.org/
+      #
+      # Contributed by Peter Bjarke Olsen
+      # Modified by Doug King
+
+      seq=Array.new
+
+      def revcomp(seq)
+        seq.reverse!.tr!('wsatugcyrkmbdhvnATUGCYRKMBDHVN','WSTAACGRYMKVHDBNTAACGRYMKVHDBN')
+        stringlen=seq.length
+        0.step(stringlen-1,60) {|x| print seq.slice(x,60) , "\n"}
+      end
+
+      input = open(File.join(File.dirname($0), 'fasta.output.2500000'), 'rb')
+
+      while input.gets
+        if $_ =~ />/
+          if seq.length != 0
+            revcomp(seq.join)
+            seq=Array.new
+          end
+          puts $_
+        else
+          $_.sub(/\n/,'')
+          seq.push $_
+        end
+      end
+      revcomp(seq.join)
+    loop_count: 1
diff --git a/benchmark/bm_so_sieve.rb b/benchmark/so_sieve.rb
index 43dc302648..43dc302648 100644
--- a/benchmark/bm_so_sieve.rb
+++ b/benchmark/so_sieve.rb
diff --git a/benchmark/bm_so_spectralnorm.rb b/benchmark/so_spectralnorm.rb
index 6b97206689..6b97206689 100644
--- a/benchmark/bm_so_spectralnorm.rb
+++ b/benchmark/so_spectralnorm.rb
diff --git a/benchmark/string_capitalize.yml b/benchmark/string_capitalize.yml
new file mode 100644
index 0000000000..7d23fd3d35
--- /dev/null
+++ b/benchmark/string_capitalize.yml
@@ -0,0 +1,10 @@
+prelude: |
+  str1 = [*"a".."m",*"N".."Z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+benchmark:
+  capitalize-1: str1.capitalize
+  capitalize-10: str10.capitalize
+  capitalize-100: str100.capitalize
+  capitalize-1000: str1000.capitalize
diff --git a/benchmark/string_casecmp.yml b/benchmark/string_casecmp.yml
new file mode 100644
index 0000000000..2354040a04
--- /dev/null
+++ b/benchmark/string_casecmp.yml
@@ -0,0 +1,26 @@
+prelude: |
+  lstr1 = [*"a".."z",*"0".."9"].join("")
+  lstr10 = lstr1 * 10
+  lstr100 = lstr10 * 10
+  lstr1000 = lstr100 * 10
+  lnonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  lnonascii10 = lnonascii1 * 10
+  lnonascii100 = lnonascii10 * 10
+  lnonascii1000 = lnonascii100 * 10
+  ustr1 = [*"A".."Z",*"0".."9"].join("")
+  ustr10 = ustr1 * 10
+  ustr100 = ustr10 * 10
+  ustr1000 = ustr100 * 10
+  unonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  unonascii10 = unonascii1 * 10
+  unonascii100 = unonascii10 * 10
+  unonascii1000 = unonascii100 * 10
+benchmark:
+  casecmp-1: lstr1.casecmp(ustr1)
+  casecmp-10: lstr10.casecmp(ustr10)
+  casecmp-100: lstr100.casecmp(ustr100)
+  casecmp-1000: lstr1000.casecmp(ustr1000)
+  casecmp-nonascii1: lnonascii1.casecmp(unonascii1)
+  casecmp-nonascii10: lnonascii10.casecmp(unonascii10)
+  casecmp-nonascii100: lnonascii100.casecmp(unonascii100)
+  casecmp-nonascii1000: lnonascii1000.casecmp(unonascii1000)
diff --git a/benchmark/string_casecmp_p.yml b/benchmark/string_casecmp_p.yml
new file mode 100644
index 0000000000..a790ce7d55
--- /dev/null
+++ b/benchmark/string_casecmp_p.yml
@@ -0,0 +1,26 @@
+prelude: |
+  lstr1 = [*"a".."z",*"0".."9"].join("")
+  lstr10 = lstr1 * 10
+  lstr100 = lstr10 * 10
+  lstr1000 = lstr100 * 10
+  lnonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  lnonascii10 = lnonascii1 * 10
+  lnonascii100 = lnonascii10 * 10
+  lnonascii1000 = lnonascii100 * 10
+  ustr1 = [*"A".."Z",*"0".."9"].join("")
+  ustr10 = ustr1 * 10
+  ustr100 = ustr10 * 10
+  ustr1000 = ustr100 * 10
+  unonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  unonascii10 = unonascii1 * 10
+  unonascii100 = unonascii10 * 10
+  unonascii1000 = unonascii100 * 10
+benchmark:
+  casecmp_p-1: lstr1.casecmp?(ustr1)
+  casecmp_p-10: lstr10.casecmp?(ustr10)
+  casecmp_p-100: lstr100.casecmp?(ustr100)
+  casecmp_p-1000: lstr1000.casecmp?(ustr1000)
+  casecmp_p-nonascii1: lnonascii1.casecmp?(unonascii1)
+  casecmp_p-nonascii10: lnonascii10.casecmp?(unonascii10)
+  casecmp_p-nonascii100: lnonascii100.casecmp?(unonascii100)
+  casecmp_p-nonascii1000: lnonascii1000.casecmp?(unonascii1000)
diff --git a/benchmark/string_concat.yml b/benchmark/string_concat.yml
new file mode 100644
index 0000000000..e65c00cca9
--- /dev/null
+++ b/benchmark/string_concat.yml
@@ -0,0 +1,45 @@
+prelude: |
+  CHUNK = "a" * 64
+  UCHUNK = "é" * 32
+  GC.disable # GC causes a lot of variance
+benchmark:
+  binary_concat_7bit: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::BINARY)
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+  utf8_concat_7bit: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::UTF_8)
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+  utf8_concat_UTF8: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::UTF_8)
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+  interpolation: |
+    buffer = "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}"
diff --git a/benchmark/string_downcase.yml b/benchmark/string_downcase.yml
new file mode 100644
index 0000000000..1fea6afbec
--- /dev/null
+++ b/benchmark/string_downcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"A".."Z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  downcase-1: str1.upcase
+  downcase-10: str10.upcase
+  downcase-100: str100.upcase
+  downcase-1000: str1000.upcase
+  downcase-nonascii1: nonascii1.downcase
+  downcase-nonascii10: nonascii10.downcase
+  downcase-nonascii100: nonascii100.downcase
+  downcase-nonascii1000: nonascii1000.downcase
diff --git a/benchmark/string_index.rb b/benchmark/string_index.rb
new file mode 100644
index 0000000000..7783111082
--- /dev/null
+++ b/benchmark/string_index.rb
@@ -0,0 +1,3 @@
+str1 = "あ" * 1024 + "い" # not single byte optimizable
+str2 = "い"
+100_000.times { str1.index(str2) }
diff --git a/benchmark/string_scan_re.rb b/benchmark/string_scan_re.rb
new file mode 100644
index 0000000000..b0d60201a9
--- /dev/null
+++ b/benchmark/string_scan_re.rb
@@ -0,0 +1,2 @@
+str = Array.new(1_000, 'abc').join(',')
+1_000.times { str.scan(/abc/) }
diff --git a/benchmark/string_scan_str.rb b/benchmark/string_scan_str.rb
new file mode 100644
index 0000000000..42440bd948
--- /dev/null
+++ b/benchmark/string_scan_str.rb
@@ -0,0 +1,2 @@
+str = Array.new(1_000, 'abc').join(',')
+1_000.times { str.scan('abc') }
diff --git a/benchmark/string_slice.yml b/benchmark/string_slice.yml
new file mode 100644
index 0000000000..fc2393c5d1
--- /dev/null
+++ b/benchmark/string_slice.yml
@@ -0,0 +1,11 @@
+prelude: |
+  long_string = "x"*1000+"-hår"
+benchmark:
+  regexp-short: |
+    "x-hår".slice!(/-(.)(.)(.)/, 3)
+  regexp-long: |
+    long_string.dup.slice!(/-(.)(.)(.)/, 3)
+  string-short: |
+    "x-hår".slice!("r")
+  string-long: |
+    long_string.dup.slice!("r")
diff --git a/benchmark/string_split.yml b/benchmark/string_split.yml
new file mode 100644
index 0000000000..cc2c7d7855
--- /dev/null
+++ b/benchmark/string_split.yml
@@ -0,0 +1,22 @@
+prelude: |
+  str1 = [*0..5].join(" ") + " "
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+benchmark:
+  to_chars-1: str1.split('')
+  to_chars-10: str10.split('')
+  to_chars-100: str100.split('')
+  to_chars-1000: str1000.split('')
+  to_words-1: str1.split(' ')
+  to_words-10: str10.split(' ')
+  to_words-100: str100.split(' ')
+  to_words-1000: str1000.split(' ')
+  re_chars-1: str1.split(//)
+  re_chars-10: str10.split(//)
+  re_chars-100: str100.split(//)
+  re_chars-1000: str1000.split(//)
+  re_space-1: str1.split(/ /)
+  re_space-10: str10.split(/ /)
+  re_space-100: str100.split(/ /)
+  re_space-1000: str1000.split(/ /)
diff --git a/benchmark/string_swapcase.yml b/benchmark/string_swapcase.yml
new file mode 100644
index 0000000000..eeb5928907
--- /dev/null
+++ b/benchmark/string_swapcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"A".."M",*"n".."z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{c0}".."\u{cf}",*"\u{f0}".."\u{ff}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  swapcase-1: str1.swapcase
+  swapcase-10: str10.swapcase
+  swapcase-100: str100.swapcase
+  swapcase-1000: str1000.swapcase
+  swapcase-nonascii1: nonascii1.swapcase
+  swapcase-nonascii10: nonascii10.swapcase
+  swapcase-nonascii100: nonascii100.swapcase
+  swapcase-nonascii1000: nonascii1000.swapcase
diff --git a/benchmark/string_upcase.yml b/benchmark/string_upcase.yml
new file mode 100644
index 0000000000..dab84bbde2
--- /dev/null
+++ b/benchmark/string_upcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"a".."z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  upcase-1: str1.upcase
+  upcase-10: str10.upcase
+  upcase-100: str100.upcase
+  upcase-1000: str1000.upcase
+  upcase-nonascii1: nonascii1.upcase
+  upcase-nonascii10: nonascii10.upcase
+  upcase-nonascii100: nonascii100.upcase
+  upcase-nonascii1000: nonascii1000.upcase
diff --git a/benchmark/time_at.yml b/benchmark/time_at.yml
new file mode 100644
index 0000000000..3247efbe77
--- /dev/null
+++ b/benchmark/time_at.yml
@@ -0,0 +1,7 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  - 'Time.at(0)'
+  - 'Time.at(0, 500)'
+  - 'Time.at(0, in: "+09:00")'
+  - 'Time.at(0, 500, in: "+09:00")'
diff --git a/benchmark/time_new.yml b/benchmark/time_new.yml
new file mode 100644
index 0000000000..5947dd3a41
--- /dev/null
+++ b/benchmark/time_new.yml
@@ -0,0 +1,4 @@
+benchmark:
+  - 'Time.new(2021)'
+  - 'Time.new(2021, 8, 22)'
+  - 'Time.new(2021, 8, 22, in: "+09:00")'
diff --git a/benchmark/time_now.yml b/benchmark/time_now.yml
new file mode 100644
index 0000000000..f6d6a31489
--- /dev/null
+++ b/benchmark/time_now.yml
@@ -0,0 +1,3 @@
+benchmark:
+  - 'Time.now'
+  - 'Time.now(in: "+09:00")'
diff --git a/benchmark/time_parse.yml b/benchmark/time_parse.yml
new file mode 100644
index 0000000000..6060b58bc6
--- /dev/null
+++ b/benchmark/time_parse.yml
@@ -0,0 +1,10 @@
+prelude: |
+  require 'time'
+  inspect = "2021-08-23 09:57:02 +0900"
+  iso8601 = "2021-08-23T09:57:02+09:00"
+benchmark:
+  - Time.iso8601(iso8601)
+  - Time.parse(iso8601)
+  - Time.parse(inspect)
+  - Time.new(iso8601) rescue Time.iso8601(iso8601)
+  - Time.new(inspect) rescue Time.parse(inspect)
diff --git a/benchmark/time_strptime.yml b/benchmark/time_strptime.yml
new file mode 100644
index 0000000000..8d89ebb7a7
--- /dev/null
+++ b/benchmark/time_strptime.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'time'
+benchmark:
+  - Time.strptime("28/Aug/2005:06:54:20 +0000", "%d/%b/%Y:%T %z")
+  - Time.strptime("1", "%s")
+  - Time.strptime("0 +0100", "%s %z")
+  - Time.strptime("0 UTC", "%s %z")
+  - Time.strptime("1.5", "%s.%N")
+  - Time.strptime("1.000000000001", "%s.%N")
+  - Time.strptime("20010203 -0200", "%Y%m%d %z")
+  - Time.strptime("20010203 UTC", "%Y%m%d %z")
+  - Time.strptime("2018-365", "%Y-%j")
+  - Time.strptime("2018-091", "%Y-%j")
diff --git a/benchmark/time_subsec.rb b/benchmark/time_subsec.rb
new file mode 100644
index 0000000000..505021c701
--- /dev/null
+++ b/benchmark/time_subsec.rb
@@ -0,0 +1,2 @@
+t = Time.now
+4000000.times { t.subsec }
diff --git a/benchmark/vm_array.yml b/benchmark/vm_array.yml
new file mode 100644
index 0000000000..2a177237ef
--- /dev/null
+++ b/benchmark/vm_array.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_array: |
+    a = [1,2,3,4,5,6,7,8,9,10]
+loop_count: 6000000
diff --git a/benchmark/vm_attr_ivar.yml b/benchmark/vm_attr_ivar.yml
new file mode 100644
index 0000000000..75b803478e
--- /dev/null
+++ b/benchmark/vm_attr_ivar.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    attr_reader :a, :b
+    def initialize
+      @a = nil
+      @b = nil
+    end
+  end
+  obj = C.new
+benchmark:
+  vm_attr_ivar: |
+    j = obj.a
+    k = obj.b
+loop_count: 30000000
diff --git a/benchmark/vm_attr_ivar_set.yml b/benchmark/vm_attr_ivar_set.yml
new file mode 100644
index 0000000000..a0d379b18a
--- /dev/null
+++ b/benchmark/vm_attr_ivar_set.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    attr_accessor :a, :b
+    def initialize
+      @a = nil
+      @b = nil
+    end
+  end
+  obj = C.new
+benchmark:
+  vm_attr_ivar_set: |
+    obj.a = 1
+    obj.b = 2
+loop_count: 30000000
diff --git a/benchmark/bm_vm3_backtrace.rb b/benchmark/vm_backtrace.rb
index 0fbf73e1ca..0fbf73e1ca 100644
--- a/benchmark/bm_vm3_backtrace.rb
+++ b/benchmark/vm_backtrace.rb
diff --git a/benchmark/vm_bigarray.yml b/benchmark/vm_bigarray.yml
new file mode 100644
index 0000000000..8b2d3f3443
--- /dev/null
+++ b/benchmark/vm_bigarray.yml
@@ -0,0 +1,105 @@
+benchmark:
+  vm_bigarray: |
+    a = [
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+    ]
+loop_count: 6000000
diff --git a/benchmark/vm_bighash.yml b/benchmark/vm_bighash.yml
new file mode 100644
index 0000000000..4dacfde793
--- /dev/null
+++ b/benchmark/vm_bighash.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_bighash: |
+    a = {0=>0, 1=>1, 2=>2, 3=>3, 4=>4, 5=>5, 6=>6, 7=>7, 8=>8, 9=>9, 10=>10, 11=>11, 12=>12, 13=>13, 14=>14, 15=>15, 16=>16, 17=>17, 18=>18, 19=>19, 20=>20, 21=>21, 22=>22, 23=>23, 24=>24, 25=>25, 26=>26, 27=>27, 28=>28, 29=>29, 30=>30, 31=>31, 32=>32, 33=>33, 34=>34, 35=>35, 36=>36, 37=>37, 38=>38, 39=>39, 40=>40, 41=>41, 42=>42, 43=>43, 44=>44, 45=>45, 46=>46, 47=>47, 48=>48, 49=>49, 50=>50, 51=>51, 52=>52, 53=>53, 54=>54, 55=>55, 56=>56, 57=>57, 58=>58, 59=>59, 60=>60, 61=>61, 62=>62, 63=>63, 64=>64, 65=>65, 66=>66, 67=>67, 68=>68, 69=>69, 70=>70, 71=>71, 72=>72, 73=>73, 74=>74, 75=>75, 76=>76, 77=>77, 78=>78, 79=>79, 80=>80, 81=>81, 82=>82, 83=>83, 84=>84, 85=>85, 86=>86, 87=>87, 88=>88, 89=>89, 90=>90, 91=>91, 92=>92, 93=>93, 94=>94, 95=>95, 96=>96, 97=>97, 98=>98, 99=>99, 100=>100, 101=>101, 102=>102, 103=>103, 104=>104, 105=>105, 106=>106, 107=>107, 108=>108, 109=>109, 110=>110, 111=>111, 112=>112, 113=>113, 114=>114, 115=>115, 116=>116, 117=>117, 118=>118, 119=>119, 120=>120, 121=>121, 122=>122, 123=>123, 124=>124, 125=>125, 126=>126, 127=>127, 128=>128, 129=>129, 130=>130, 131=>131, 132=>132, 133=>133, 134=>134, 135=>135, 136=>136, 137=>137, 138=>138, 139=>139, 140=>140, 141=>141, 142=>142, 143=>143, 144=>144, 145=>145, 146=>146, 147=>147, 148=>148, 149=>149, 150=>150, 151=>151, 152=>152, 153=>153, 154=>154, 155=>155, 156=>156, 157=>157, 158=>158, 159=>159, 160=>160, 161=>161, 162=>162, 163=>163, 164=>164, 165=>165, 166=>166, 167=>167, 168=>168, 169=>169, 170=>170, 171=>171, 172=>172, 173=>173, 174=>174, 175=>175, 176=>176, 177=>177, 178=>178, 179=>179, 180=>180, 181=>181, 182=>182, 183=>183, 184=>184, 185=>185, 186=>186, 187=>187, 188=>188, 189=>189, 190=>190, 191=>191, 192=>192, 193=>193, 194=>194, 195=>195, 196=>196, 197=>197, 198=>198, 199=>199, 200=>200, 201=>201, 202=>202, 203=>203, 204=>204, 205=>205, 206=>206, 207=>207, 208=>208, 209=>209, 210=>210, 211=>211, 212=>212, 213=>213, 214=>214, 215=>215, 216=>216, 217=>217, 218=>218, 219=>219, 220=>220, 221=>221, 222=>222, 223=>223, 224=>224, 225=>225, 226=>226, 227=>227, 228=>228, 229=>229, 230=>230, 231=>231, 232=>232, 233=>233, 234=>234, 235=>235, 236=>236, 237=>237, 238=>238, 239=>239, 240=>240, 241=>241, 242=>242, 243=>243, 244=>244, 245=>245, 246=>246, 247=>247, 248=>248, 249=>249, 250=>250, 251=>251, 252=>252, 253=>253, 254=>254, 255=>255, 256=>256, 257=>257, 258=>258, 259=>259, 260=>260, 261=>261, 262=>262, 263=>263, 264=>264, 265=>265, 266=>266, 267=>267, 268=>268, 269=>269, 270=>270, 271=>271, 272=>272, 273=>273, 274=>274, 275=>275, 276=>276, 277=>277, 278=>278, 279=>279, 280=>280, 281=>281, 282=>282, 283=>283, 284=>284, 285=>285, 286=>286, 287=>287, 288=>288, 289=>289, 290=>290, 291=>291, 292=>292, 293=>293, 294=>294, 295=>295, 296=>296, 297=>297, 298=>298, 299=>299, 300=>300, 301=>301, 302=>302, 303=>303, 304=>304, 305=>305, 306=>306, 307=>307, 308=>308, 309=>309, 310=>310, 311=>311, 312=>312, 313=>313, 314=>314, 315=>315, 316=>316, 317=>317, 318=>318, 319=>319, 320=>320, 321=>321, 322=>322, 323=>323, 324=>324, 325=>325, 326=>326, 327=>327, 328=>328, 329=>329, 330=>330, 331=>331, 332=>332, 333=>333, 334=>334, 335=>335, 336=>336, 337=>337, 338=>338, 339=>339, 340=>340, 341=>341, 342=>342, 343=>343, 344=>344, 345=>345, 346=>346, 347=>347, 348=>348, 349=>349, 350=>350, 351=>351, 352=>352, 353=>353, 354=>354, 355=>355, 356=>356, 357=>357, 358=>358, 359=>359, 360=>360, 361=>361, 362=>362, 363=>363, 364=>364, 365=>365, 366=>366, 367=>367, 368=>368, 369=>369, 370=>370, 371=>371, 372=>372, 373=>373, 374=>374, 375=>375, 376=>376, 377=>377, 378=>378, 379=>379, 380=>380, 381=>381, 382=>382, 383=>383, 384=>384, 385=>385, 386=>386, 387=>387, 388=>388, 389=>389, 390=>390, 391=>391, 392=>392, 393=>393, 394=>394, 395=>395, 396=>396, 397=>397, 398=>398, 399=>399, 400=>400, 401=>401, 402=>402, 403=>403, 404=>404, 405=>405, 406=>406, 407=>407, 408=>408, 409=>409, 410=>410, 411=>411, 412=>412, 413=>413, 414=>414, 415=>415, 416=>416, 417=>417, 418=>418, 419=>419, 420=>420, 421=>421, 422=>422, 423=>423, 424=>424, 425=>425, 426=>426, 427=>427, 428=>428, 429=>429, 430=>430, 431=>431, 432=>432, 433=>433, 434=>434, 435=>435, 436=>436, 437=>437, 438=>438, 439=>439, 440=>440, 441=>441, 442=>442, 443=>443, 444=>444, 445=>445, 446=>446, 447=>447, 448=>448, 449=>449, 450=>450, 451=>451, 452=>452, 453=>453, 454=>454, 455=>455, 456=>456, 457=>457, 458=>458, 459=>459, 460=>460, 461=>461, 462=>462, 463=>463, 464=>464, 465=>465, 466=>466, 467=>467, 468=>468, 469=>469, 470=>470, 471=>471, 472=>472, 473=>473, 474=>474, 475=>475, 476=>476, 477=>477, 478=>478, 479=>479, 480=>480, 481=>481, 482=>482, 483=>483, 484=>484, 485=>485, 486=>486, 487=>487, 488=>488, 489=>489, 490=>490, 491=>491, 492=>492, 493=>493, 494=>494, 495=>495, 496=>496, 497=>497, 498=>498, 499=>499, 500=>500,}
+loop_count: 60000
diff --git a/benchmark/vm_block.yml b/benchmark/vm_block.yml
new file mode 100644
index 0000000000..68b3e40bf5
--- /dev/null
+++ b/benchmark/vm_block.yml
@@ -0,0 +1,9 @@
+prelude: |
+  def m
+    yield
+  end
+benchmark:
+  vm_block: |
+    m{
+    }
+loop_count: 30000000
diff --git a/benchmark/vm_block_handler.yml b/benchmark/vm_block_handler.yml
new file mode 100644
index 0000000000..461d7953ad
--- /dev/null
+++ b/benchmark/vm_block_handler.yml
@@ -0,0 +1,27 @@
+# :FIXME: is there a way to benchmark block_handler_type_ifunc?
+
+prelude: |
+  p = proc{_1}
+  o = Object.new
+  def o.each
+    i = 0
+    while i < 3_000_000 do
+      yield i
+      i += 1
+    end
+  end
+
+benchmark:
+  - name: block_handler_type_iseq
+    script: |
+      o.each{_1}
+
+  - name: block_handler_type_symbol
+    script: |
+      o.each(&:itself)
+
+  - name: block_handler_type_proc
+    script: |
+      o.each(&p)
+
+loop_count: 1
diff --git a/benchmark/vm_blockparam.yml b/benchmark/vm_blockparam.yml
new file mode 100644
index 0000000000..5e5a0170a2
--- /dev/null
+++ b/benchmark/vm_blockparam.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m &b
+  end
+benchmark:
+  vm_blockparam: |
+    m{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_call.yml b/benchmark/vm_blockparam_call.yml
new file mode 100644
index 0000000000..a7d8d366ea
--- /dev/null
+++ b/benchmark/vm_blockparam_call.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m &b
+    b.call
+  end
+benchmark:
+  vm_blockparam_call: |
+    m{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_pass.yml b/benchmark/vm_blockparam_pass.yml
new file mode 100644
index 0000000000..841f5e7a63
--- /dev/null
+++ b/benchmark/vm_blockparam_pass.yml
@@ -0,0 +1,12 @@
+prelude: |
+  def bp_yield
+    yield
+  end
+
+  def bp_pass &b
+    bp_yield &b
+  end
+benchmark:
+  vm_blockparam_pass: |
+    bp_pass{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_yield.yml b/benchmark/vm_blockparam_yield.yml
new file mode 100644
index 0000000000..8ea9b46ed2
--- /dev/null
+++ b/benchmark/vm_blockparam_yield.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def bp_yield &b
+    yield
+  end
+benchmark:
+  vm_blockparam_yield: |
+    bp_yield{}
+loop_count: 30000000
diff --git a/benchmark/vm_case.yml b/benchmark/vm_case.yml
new file mode 100644
index 0000000000..b26a491a15
--- /dev/null
+++ b/benchmark/vm_case.yml
@@ -0,0 +1,13 @@
+benchmark:
+  vm_case: |
+    case :foo
+    when :bar
+      raise
+    when :baz
+      raise
+    when :boo
+      raise
+    when :foo
+      # noop
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_case_classes.yml b/benchmark/vm_case_classes.yml
new file mode 100644
index 0000000000..cacc4f0464
--- /dev/null
+++ b/benchmark/vm_case_classes.yml
@@ -0,0 +1,9 @@
+benchmark:
+  vm_case_classes: |
+    case :foo
+    when Hash
+      raise
+    when Array
+      raise
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_case_lit.yml b/benchmark/vm_case_lit.yml
new file mode 100644
index 0000000000..9f91801544
--- /dev/null
+++ b/benchmark/vm_case_lit.yml
@@ -0,0 +1,23 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_case_lit: |
+    i = 0
+    @ret = [ "foo", true, false, :sym, 6, nil, 0.1, 0xffffffffffffffff ]
+    def foo(i)
+      @ret[i % @ret.size]
+    end
+
+    while i<6_000_000
+      case foo(i)
+      when "foo" then :foo
+      when true then true
+      when false then false
+      when :sym then :sym
+      when 6 then :fix
+      when nil then nil
+      when 0.1 then :float
+      when 0xffffffffffffffff then :big
+      end
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/bm_vm3_clearmethodcache.rb b/benchmark/vm_clearmethodcache.rb
index 9661323cd2..9661323cd2 100644
--- a/benchmark/bm_vm3_clearmethodcache.rb
+++ b/benchmark/vm_clearmethodcache.rb
diff --git a/benchmark/vm_const.yml b/benchmark/vm_const.yml
new file mode 100644
index 0000000000..8939ca0cd3
--- /dev/null
+++ b/benchmark/vm_const.yml
@@ -0,0 +1,13 @@
+prelude: |
+  Const = 1
+  A = B = C = D = E = F = G = H = I = J = K = L = M = N = O = P = Q = R = S = T = U = V = W = X = Y = Z = 1
+  def foo
+    A; B; C; D; E; F; G; H; I; J; K; L; M; N; O; P; Q; R; S; T; U; V; W; X; Y; Z
+  end
+benchmark:
+  vm_const: |
+    j = Const
+    k = Const
+  vm_const_many: |
+    foo
+loop_count: 30000000
diff --git a/benchmark/vm_cvar.yml b/benchmark/vm_cvar.yml
new file mode 100644
index 0000000000..1d0e161829
--- /dev/null
+++ b/benchmark/vm_cvar.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class A
+    @@foo = 1
+
+    def self.foo
+      @@foo
+    end
+
+    ("A".."Z").each do |module_name|
+      eval <<-EOM
+        module #{module_name}
+        end
+
+        include #{module_name}
+      EOM
+    end
+  end
+benchmark:
+  vm_cvar: A.foo
+loop_count: 600000
diff --git a/benchmark/vm_defined_method.yml b/benchmark/vm_defined_method.yml
new file mode 100644
index 0000000000..347e0cfd33
--- /dev/null
+++ b/benchmark/vm_defined_method.yml
@@ -0,0 +1,8 @@
+prelude: |
+  class Object
+    define_method(:m){}
+  end
+benchmark:
+  vm_defined_method: |
+    m; m; m; m; m; m; m; m;
+loop_count: 6000000
diff --git a/benchmark/vm_dstr.yml b/benchmark/vm_dstr.yml
new file mode 100644
index 0000000000..30c7a3193c
--- /dev/null
+++ b/benchmark/vm_dstr.yml
@@ -0,0 +1,6 @@
+prelude: |
+  x = y = 'z'
+benchmark:
+  vm_dstr: |
+    str = "foo#{x}bar#{y}baz"
+loop_count: 6000000
diff --git a/benchmark/vm_dstr_ary.rb b/benchmark/vm_dstr_ary.rb
new file mode 100644
index 0000000000..1d3aa3b97b
--- /dev/null
+++ b/benchmark/vm_dstr_ary.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = []
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_bool.rb b/benchmark/vm_dstr_bool.rb
new file mode 100644
index 0000000000..631ca54755
--- /dev/null
+++ b/benchmark/vm_dstr_bool.rb
@@ -0,0 +1,7 @@
+i = 0
+x = true
+y = false
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_class_module.rb b/benchmark/vm_dstr_class_module.rb
new file mode 100644
index 0000000000..becf0861c7
--- /dev/null
+++ b/benchmark/vm_dstr_class_module.rb
@@ -0,0 +1,10 @@
+i = 0
+class A; end unless defined?(A)
+module B; end unless defined?(B)
+x = A
+y = B
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
+
diff --git a/benchmark/vm_dstr_digit.rb b/benchmark/vm_dstr_digit.rb
new file mode 100644
index 0000000000..caaa395192
--- /dev/null
+++ b/benchmark/vm_dstr_digit.rb
@@ -0,0 +1,7 @@
+i = 0
+x = 0
+y = 9
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_int.rb b/benchmark/vm_dstr_int.rb
new file mode 100644
index 0000000000..ed380d7595
--- /dev/null
+++ b/benchmark/vm_dstr_int.rb
@@ -0,0 +1,5 @@
+i = 0
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{i}bar#{i}baz"
+end
diff --git a/benchmark/vm_dstr_nil.rb b/benchmark/vm_dstr_nil.rb
new file mode 100644
index 0000000000..ec4f5d6c67
--- /dev/null
+++ b/benchmark/vm_dstr_nil.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = nil
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_obj.rb b/benchmark/vm_dstr_obj.rb
new file mode 100644
index 0000000000..fb78637ead
--- /dev/null
+++ b/benchmark/vm_dstr_obj.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = Object.new
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_obj_def.rb b/benchmark/vm_dstr_obj_def.rb
new file mode 100644
index 0000000000..99ff7b98fb
--- /dev/null
+++ b/benchmark/vm_dstr_obj_def.rb
@@ -0,0 +1,8 @@
+i = 0
+o = Object.new
+def o.to_s; -""; end
+x = y = o
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_str.rb b/benchmark/vm_dstr_str.rb
new file mode 100644
index 0000000000..45fc107892
--- /dev/null
+++ b/benchmark/vm_dstr_str.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = ""
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_sym.rb b/benchmark/vm_dstr_sym.rb
new file mode 100644
index 0000000000..484b8f8150
--- /dev/null
+++ b/benchmark/vm_dstr_sym.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = :z
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_ensure.yml b/benchmark/vm_ensure.yml
new file mode 100644
index 0000000000..4ea62f30de
--- /dev/null
+++ b/benchmark/vm_ensure.yml
@@ -0,0 +1,14 @@
+# Not utilizing loop_count since using it for this is too unstable for now
+benchmark:
+  vm_ensure: |
+    i = 0
+    while i<30_000_000
+      i += 1
+      begin
+        begin
+        ensure
+        end
+      ensure
+      end
+    end
+loop_count: 1
diff --git a/benchmark/vm_eval.yml b/benchmark/vm_eval.yml
new file mode 100644
index 0000000000..7ba1a8d1de
--- /dev/null
+++ b/benchmark/vm_eval.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_eval: |
+    eval("1")
+loop_count: 6000000
diff --git a/benchmark/vm_fiber_allocate.yml b/benchmark/vm_fiber_allocate.yml
new file mode 100644
index 0000000000..b5a54e1ddf
--- /dev/null
+++ b/benchmark/vm_fiber_allocate.yml
@@ -0,0 +1,8 @@
+prelude: |
+  # Disable GC to see raw throughput:
+  GC.disable
+benchmark:
+  vm_fiber_allocate: |
+    fiber = Fiber.new{Fiber.yield}
+    fiber.resume
+loop_count: 100000
diff --git a/benchmark/vm_fiber_count.yml b/benchmark/vm_fiber_count.yml
new file mode 100644
index 0000000000..b83d3152d4
--- /dev/null
+++ b/benchmark/vm_fiber_count.yml
@@ -0,0 +1,10 @@
+# On Linux, you will need to increase the maximum number of memory maps:
+# sudo sysctl -w vm.max_map_count=200000
+prelude: |
+  fibers = []
+benchmark:
+  vm_fiber_count: |
+    fiber = Fiber.new{Fiber.yield}
+    fibers << fiber
+    fiber.resume
+loop_count: 100000
diff --git a/benchmark/vm_fiber_reuse.yml b/benchmark/vm_fiber_reuse.yml
new file mode 100644
index 0000000000..4ca41085b1
--- /dev/null
+++ b/benchmark/vm_fiber_reuse.yml
@@ -0,0 +1,14 @@
+prelude: |
+  GC.disable
+  fibers = []
+benchmark:
+  vm_fiber_reuse: |
+    1024.times do
+      fiber = Fiber.new{Fiber.yield}
+      fibers << fiber
+      fiber.resume
+    end
+
+    fibers.clear
+    GC.start
+loop_count: 200
diff --git a/benchmark/vm_fiber_reuse_gc.yml b/benchmark/vm_fiber_reuse_gc.yml
new file mode 100644
index 0000000000..892622f121
--- /dev/null
+++ b/benchmark/vm_fiber_reuse_gc.yml
@@ -0,0 +1,12 @@
+# https://bugs.ruby-lang.org/issues/16009
+prelude: |
+  fibers = []
+benchmark:
+  vm_fiber_reuse_gc: |
+    2000.times do
+      fiber = Fiber.new{Fiber.yield}
+      fibers << fiber
+      fiber.resume
+    end
+    fibers.clear
+loop_count: 100
diff --git a/benchmark/vm_fiber_switch.yml b/benchmark/vm_fiber_switch.yml
new file mode 100644
index 0000000000..3de36b66eb
--- /dev/null
+++ b/benchmark/vm_fiber_switch.yml
@@ -0,0 +1,9 @@
+prelude: |
+  # based on benchmark for [ruby-core:65518] [Feature #10341] by Knut Franke
+  fib = Fiber.new do
+    loop { Fiber.yield }
+  end
+benchmark:
+  vm_fiber_switch: |
+    fib.resume
+loop_count: 20000000
diff --git a/benchmark/vm_float_simple.yml b/benchmark/vm_float_simple.yml
new file mode 100644
index 0000000000..92f5fd52ab
--- /dev/null
+++ b/benchmark/vm_float_simple.yml
@@ -0,0 +1,8 @@
+prelude: |
+  f = 0.0
+benchmark:
+  vm_float_simple: |
+    f += 0.1; f -= 0.1
+    f += 0.1; f -= 0.1
+    f += 0.1; f -= 0.1
+loop_count: 30000000
diff --git a/benchmark/vm_freezeobj.yml b/benchmark/vm_freezeobj.yml
new file mode 100644
index 0000000000..69a795a354
--- /dev/null
+++ b/benchmark/vm_freezeobj.yml
@@ -0,0 +1,6 @@
+prelude: |
+ objs = 100000.times.map { Object.new }
+benchmark:
+  vm_freeze_obj: |
+    objs.map(&:freeze)
+loop_count: 600
diff --git a/benchmark/vm_freezestring.yml b/benchmark/vm_freezestring.yml
new file mode 100644
index 0000000000..facc9aa043
--- /dev/null
+++ b/benchmark/vm_freezestring.yml
@@ -0,0 +1,10 @@
+prelude: |
+  class String
+    def freeze
+      -self
+    end
+  end
+benchmark:
+  vm_freezestring: |
+    "tXnL1BP5T1WPXMjuFNLQtallEtRcay1t2lHtJSrlVsDgvunlbtfpr/DGdH0NGYE9".freeze
+loop_count: 6000000
diff --git a/benchmark/vm_gc.rb b/benchmark/vm_gc.rb
new file mode 100644
index 0000000000..e668026915
--- /dev/null
+++ b/benchmark/vm_gc.rb
@@ -0,0 +1,6 @@
+5000.times do
+  100.times do
+    {"xxxx"=>"yyyy"}
+  end
+  GC.start
+end
diff --git a/benchmark/vm_gc_old_full.rb b/benchmark/vm_gc_old_full.rb
new file mode 100644
index 0000000000..cfdfc8c5a5
--- /dev/null
+++ b/benchmark/vm_gc_old_full.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+100.times do
+  GC.start
+end
diff --git a/benchmark/vm_gc_old_immediate.rb b/benchmark/vm_gc_old_immediate.rb
new file mode 100644
index 0000000000..ad22feb655
--- /dev/null
+++ b/benchmark/vm_gc_old_immediate.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+30_000.times do
+  GC.start(full_mark: false, immediate_sweep: true)
+end
diff --git a/benchmark/vm_gc_old_lazy.rb b/benchmark/vm_gc_old_lazy.rb
new file mode 100644
index 0000000000..b74d44baf1
--- /dev/null
+++ b/benchmark/vm_gc_old_lazy.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+30_000.times do
+  GC.start(full_mark: false, immediate_sweep: false)
+end
diff --git a/benchmark/vm_gc_short_lived.yml b/benchmark/vm_gc_short_lived.yml
new file mode 100644
index 0000000000..29c803fee3
--- /dev/null
+++ b/benchmark/vm_gc_short_lived.yml
@@ -0,0 +1,9 @@
+benchmark:
+  vm_gc_short_lived: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_complex_long.yml b/benchmark/vm_gc_short_with_complex_long.yml
new file mode 100644
index 0000000000..4b6c3ed7b9
--- /dev/null
+++ b/benchmark/vm_gc_short_with_complex_long.yml
@@ -0,0 +1,25 @@
+prelude: |
+  def nested_hash h, n
+    if n == 0
+      ''
+    else
+      10.times{
+        h[Object.new] = nested_hash(h, n-1)
+      }
+    end
+  end
+
+  long_lived = Hash.new
+  nested_hash long_lived, 6
+
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_complex_long: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_long.yml b/benchmark/vm_gc_short_with_long.yml
new file mode 100644
index 0000000000..03ba0f95a9
--- /dev/null
+++ b/benchmark/vm_gc_short_with_long.yml
@@ -0,0 +1,13 @@
+prelude: |
+  long_lived = Array.new(1_000_000){|i| "#{i}"}
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_long: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_symbol.yml b/benchmark/vm_gc_short_with_symbol.yml
new file mode 100644
index 0000000000..129b8bf4ed
--- /dev/null
+++ b/benchmark/vm_gc_short_with_symbol.yml
@@ -0,0 +1,13 @@
+prelude: |
+  50_000.times{|i| sym = "sym#{i}".to_sym}
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_symbol: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_ary.yml b/benchmark/vm_gc_wb_ary.yml
new file mode 100644
index 0000000000..e3293e72d0
--- /dev/null
+++ b/benchmark/vm_gc_wb_ary.yml
@@ -0,0 +1,12 @@
+prelude: |
+  short_lived_ary = []
+
+  if RUBY_VERSION >= "2.2.0"
+    GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true)
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_ary: |
+    short_lived_ary[0] = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_ary_promoted.yml b/benchmark/vm_gc_wb_ary_promoted.yml
new file mode 100644
index 0000000000..003995945b
--- /dev/null
+++ b/benchmark/vm_gc_wb_ary_promoted.yml
@@ -0,0 +1,15 @@
+prelude: |
+  long_lived = []
+
+  if RUBY_VERSION > "2.2.0"
+    3.times{ GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true) }
+  elsif
+    GC.start
+  end
+
+  short_lived = ''
+
+benchmark:
+  vm_gc_wb_ary_promoted: |
+    long_lived[0] = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_obj.yml b/benchmark/vm_gc_wb_obj.yml
new file mode 100644
index 0000000000..a2a2ce2d18
--- /dev/null
+++ b/benchmark/vm_gc_wb_obj.yml
@@ -0,0 +1,15 @@
+prelude: |
+  class C
+    attr_accessor :foo
+  end
+  short_lived_obj = C.new
+
+  if RUBY_VERSION >= "2.2.0"
+    GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true)
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_obj: |
+    short_lived_obj.foo = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_obj_promoted.yml b/benchmark/vm_gc_wb_obj_promoted.yml
new file mode 100644
index 0000000000..00a454ba72
--- /dev/null
+++ b/benchmark/vm_gc_wb_obj_promoted.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C
+    attr_accessor :foo
+  end
+  long_lived = C.new
+
+  if RUBY_VERSION >= "2.2.0"
+    3.times{ GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true) }
+  elsif
+    GC.start
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_obj_promoted: |
+    long_lived.foo = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_iclass_super.yml b/benchmark/vm_iclass_super.yml
new file mode 100644
index 0000000000..21bb7db247
--- /dev/null
+++ b/benchmark/vm_iclass_super.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class C
+    def m
+      1
+    end
+
+    ("A".."M").each do |module_name|
+      eval <<-EOM
+          module #{module_name}
+            def m; super; end
+          end
+          prepend #{module_name}
+      EOM
+    end
+  end
+
+  obj = C.new
+benchmark:
+  vm_iclass_super: obj.m
+loop_count: 6000000
diff --git a/benchmark/vm_ivar.yml b/benchmark/vm_ivar.yml
new file mode 100644
index 0000000000..119531d5ef
--- /dev/null
+++ b/benchmark/vm_ivar.yml
@@ -0,0 +1,6 @@
+prelude: "@a = 1\n"
+benchmark:
+  vm_ivar: |
+    j = @a
+    k = @a
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_embedded_obj_init.yml b/benchmark/vm_ivar_embedded_obj_init.yml
new file mode 100644
index 0000000000..74fe20a630
--- /dev/null
+++ b/benchmark/vm_ivar_embedded_obj_init.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_embedded_obj_init: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_extended_obj_init.yml b/benchmark/vm_ivar_extended_obj_init.yml
new file mode 100644
index 0000000000..f054bab282
--- /dev/null
+++ b/benchmark/vm_ivar_extended_obj_init.yml
@@ -0,0 +1,16 @@
+prelude: |
+  class C
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+      @d = nil
+      @e = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_extended_obj_init: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_generic_get.yml b/benchmark/vm_ivar_generic_get.yml
new file mode 100644
index 0000000000..dae2d37671
--- /dev/null
+++ b/benchmark/vm_ivar_generic_get.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C < Array
+    attr_reader :a, :b, :c
+    def initialize
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_generic_get: |
+    c.a
+    c.b
+    c.c
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_generic_set.yml b/benchmark/vm_ivar_generic_set.yml
new file mode 100644
index 0000000000..102a6577fb
--- /dev/null
+++ b/benchmark/vm_ivar_generic_set.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C < Array
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_generic_set: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_get.yml b/benchmark/vm_ivar_get.yml
new file mode 100644
index 0000000000..9174af6965
--- /dev/null
+++ b/benchmark/vm_ivar_get.yml
@@ -0,0 +1,37 @@
+prelude: |
+  class Example
+    def initialize
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+      @levar = 1
+    end
+
+    def get_value_loop
+      sum = 0
+
+      i = 0
+      while i < 1000000
+        # 10 times to de-emphasize loop overhead
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        i += 1
+      end
+
+      return sum
+    end
+  end
+
+  obj = Example.new
+benchmark:
+  vm_ivar_get: |
+    obj.get_value_loop
+loop_count: 100
diff --git a/benchmark/vm_ivar_get_unintialized.yml b/benchmark/vm_ivar_get_unintialized.yml
new file mode 100644
index 0000000000..a1ccfb06ce
--- /dev/null
+++ b/benchmark/vm_ivar_get_unintialized.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class Example
+    def read
+      @uninitialized
+    end
+  end
+
+  obj = Example.new
+benchmark:
+  vm_ivar_get_uninitialized: |
+    obj.read
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_lazy_set.yml b/benchmark/vm_ivar_lazy_set.yml
new file mode 100644
index 0000000000..7372ffcfbc
--- /dev/null
+++ b/benchmark/vm_ivar_lazy_set.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class Example
+    def lazy_set
+      @uninitialized ||= 123
+    end
+  end
+
+  objs = 10000000.times.map { Example.new }
+benchmark:
+  vm_ivar_lazy_set: |
+    objs.each(&:lazy_set)
+loop_count: 1
diff --git a/benchmark/vm_ivar_of_class.yml b/benchmark/vm_ivar_of_class.yml
new file mode 100644
index 0000000000..172e28b2fd
--- /dev/null
+++ b/benchmark/vm_ivar_of_class.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class C
+    @a = 1
+    def self.a
+      _a = @a; _a = @a; _a = @a; _a = @a; _a = @a;
+      _a = @a; _a = @a; _a = @a; _a = @a; _a = @a;
+    end
+  end
+benchmark:
+  vm_ivar_of_class: |
+    a = C.a
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_of_class_set.yml b/benchmark/vm_ivar_of_class_set.yml
new file mode 100644
index 0000000000..2ea5199423
--- /dev/null
+++ b/benchmark/vm_ivar_of_class_set.yml
@@ -0,0 +1,11 @@
+prelude: |
+  class C
+    @a = 1
+    def self.a o
+      @a = o; @a = o; @a = o; @a = o; @a = o; @a = o;
+    end
+  end
+benchmark:
+  vm_ivar_of_class_set: |
+    a = C.a(nil)
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_set.yml b/benchmark/vm_ivar_set.yml
new file mode 100644
index 0000000000..8bbb60043b
--- /dev/null
+++ b/benchmark/vm_ivar_set.yml
@@ -0,0 +1,5 @@
+benchmark:
+  vm_ivar_set: |
+    @a = 1
+    @b = 2
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_set_on_instance.yml b/benchmark/vm_ivar_set_on_instance.yml
new file mode 100644
index 0000000000..91857b7742
--- /dev/null
+++ b/benchmark/vm_ivar_set_on_instance.yml
@@ -0,0 +1,35 @@
+prelude: |
+  class TheClass
+    def initialize
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+      @levar = 1
+    end
+
+    def set_value_loop
+      # 1M
+      i = 0
+      while i < 1000000
+        # 10 times to de-emphasize loop overhead
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        i += 1
+      end
+    end
+  end
+
+  obj = TheClass.new
+
+benchmark:
+  vm_ivar_set_on_instance: |
+    obj.set_value_loop
+loop_count: 100
diff --git a/benchmark/vm_ivar_set_subclass.yml b/benchmark/vm_ivar_set_subclass.yml
new file mode 100644
index 0000000000..bc8bf5bf6b
--- /dev/null
+++ b/benchmark/vm_ivar_set_subclass.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class A
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+      @d = nil
+      @e = nil
+    end
+  end
+  class B < A; end
+  class C < A; end
+
+  b = B.new
+  c = C.new
+benchmark:
+  vm_ivar_init_subclass: |
+    b.set_ivars
+    c.set_ivars
+loop_count: 3000000
diff --git a/benchmark/vm_length.yml b/benchmark/vm_length.yml
new file mode 100644
index 0000000000..5fd94e7d86
--- /dev/null
+++ b/benchmark/vm_length.yml
@@ -0,0 +1,8 @@
+prelude: |
+  a = 'abc'
+  b = [1, 2, 3]
+benchmark:
+  vm_length: |
+    a.length
+    b.length
+loop_count: 30000000
diff --git a/benchmark/vm_lvar_cond_set.yml b/benchmark/vm_lvar_cond_set.yml
new file mode 100644
index 0000000000..1845f9d12e
--- /dev/null
+++ b/benchmark/vm_lvar_cond_set.yml
@@ -0,0 +1,8 @@
+benchmark:
+  vm_lvar_cond_set: |
+    a ||= 1
+    b ||= 1
+    c ||= 1
+    d ||= 1
+    nil
+loop_count: 30000000
diff --git a/benchmark/vm_lvar_init.yml b/benchmark/vm_lvar_init.yml
new file mode 100644
index 0000000000..70a9b1c0ca
--- /dev/null
+++ b/benchmark/vm_lvar_init.yml
@@ -0,0 +1,21 @@
+# while loop cost is not removed because `i` is used in the script
+benchmark:
+  vm_lvar_init: |
+    def m v
+      unless v
+        # unreachable code
+        v1 = v2 = v3 = v4 = v5 = v6 = v7 = v8 = v9 = v10 =
+        v11 = v12 = v13 = v14 = v15 = v16 = v17 = v18 = v19 = v20 =
+        v21 = v22 = v23 = v24 = v25 = v26 = v27 = v28 = v29 = v30 =
+        v31 = v32 = v33 = v34 = v35 = v36 = v37 = v38 = v39 = v40 =
+        v41 = v42 = v43 = v44 = v45 = v46 = v47 = v48 = v49 = v50 = 1
+      end
+    end
+
+    i = 0
+
+    while i<30_000_000
+      i += 1
+      m i
+    end
+loop_count: 1
diff --git a/benchmark/vm_lvar_set.yml b/benchmark/vm_lvar_set.yml
new file mode 100644
index 0000000000..f29f763d81
--- /dev/null
+++ b/benchmark/vm_lvar_set.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_lvar_set: |
+    a = b = c = d = e = f = g = h = j = k = l = m = n = o = p = q = r = 1
+loop_count: 30000000
diff --git a/benchmark/vm_method.yml b/benchmark/vm_method.yml
new file mode 100644
index 0000000000..d45e4ec572
--- /dev/null
+++ b/benchmark/vm_method.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m
+    nil
+  end
+benchmark:
+  vm_method: |
+    m; m; m; m; m; m; m; m;
+loop_count: 6000000
diff --git a/benchmark/vm_method_missing.yml b/benchmark/vm_method_missing.yml
new file mode 100644
index 0000000000..3da456c0bb
--- /dev/null
+++ b/benchmark/vm_method_missing.yml
@@ -0,0 +1,11 @@
+prelude: |
+  class C
+    def method_missing mid
+    end
+  end
+
+  obj = C.new
+benchmark:
+  vm_method_missing: |
+    obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m;
+loop_count: 6000000
diff --git a/benchmark/vm_method_with_block.yml b/benchmark/vm_method_with_block.yml
new file mode 100644
index 0000000000..281a481394
--- /dev/null
+++ b/benchmark/vm_method_with_block.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m
+    nil
+  end
+benchmark:
+  vm_method_with_block: |
+    m{}; m{}; m{}; m{}; m{}; m{}; m{}; m{};
+loop_count: 6000000
diff --git a/benchmark/vm_module_ann_const_set.yml b/benchmark/vm_module_ann_const_set.yml
new file mode 100644
index 0000000000..243229ba4a
--- /dev/null
+++ b/benchmark/vm_module_ann_const_set.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_module_ann_const_set: |
+    Module.new.const_set(:X, Module.new)
+loop_count: 6000000
diff --git a/benchmark/vm_module_const_set.yml b/benchmark/vm_module_const_set.yml
new file mode 100644
index 0000000000..e5a24181a9
--- /dev/null
+++ b/benchmark/vm_module_const_set.yml
@@ -0,0 +1,8 @@
+prelude: |
+  module M
+  end
+  $VERBOSE = nil
+benchmark:
+  vm_module_const_set: |
+    M.const_set(:X, Module.new)
+loop_count: 6000000
diff --git a/benchmark/vm_mutex.yml b/benchmark/vm_mutex.yml
new file mode 100644
index 0000000000..abcf1e28ce
--- /dev/null
+++ b/benchmark/vm_mutex.yml
@@ -0,0 +1,8 @@
+prelude: |
+  require 'thread'
+
+  m = Thread::Mutex.new
+benchmark:
+  vm_mutex: |
+    m.synchronize{}
+loop_count: 6000000
diff --git a/benchmark/vm_neq.yml b/benchmark/vm_neq.yml
new file mode 100644
index 0000000000..fb04d15ae8
--- /dev/null
+++ b/benchmark/vm_neq.yml
@@ -0,0 +1,7 @@
+prelude: |
+  obj1 = Object.new
+  obj2 = Object.new
+benchmark:
+  vm_neq: |
+    obj1 != obj2
+loop_count: 30000000
diff --git a/benchmark/vm_newlambda.yml b/benchmark/vm_newlambda.yml
new file mode 100644
index 0000000000..0b9787d91a
--- /dev/null
+++ b/benchmark/vm_newlambda.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_newlambda: |
+    lambda {}
+loop_count: 6000000
diff --git a/benchmark/vm_not.yml b/benchmark/vm_not.yml
new file mode 100644
index 0000000000..c68dde3c50
--- /dev/null
+++ b/benchmark/vm_not.yml
@@ -0,0 +1,6 @@
+prelude: |
+  obj = Object.new
+benchmark:
+  vm_not: |
+    !obj
+loop_count: 30000000
diff --git a/benchmark/vm_poly_method.yml b/benchmark/vm_poly_method.yml
new file mode 100644
index 0000000000..dd2f4e71de
--- /dev/null
+++ b/benchmark/vm_poly_method.yml
@@ -0,0 +1,24 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_method: |
+    class C1
+      def m
+        1
+      end
+    end
+    class C2
+      def m
+        2
+      end
+    end
+
+    o1 = C1.new
+    o2 = C2.new
+
+    i = 0
+    while i<6_000_000
+      o = (i % 2 == 0) ? o1 : o2
+      o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_poly_method_ov.yml b/benchmark/vm_poly_method_ov.yml
new file mode 100644
index 0000000000..bca1b62729
--- /dev/null
+++ b/benchmark/vm_poly_method_ov.yml
@@ -0,0 +1,24 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_method_ov: |
+    class C1
+      def m
+        1
+      end
+    end
+    class C2
+      def m
+        2
+      end
+    end
+
+    o1 = C1.new
+    o2 = C2.new
+
+    i = 0
+    while i<6_000_000
+      o = (i % 2 == 0) ? o1 : o2
+    #  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_poly_same_method.yml b/benchmark/vm_poly_same_method.yml
new file mode 100644
index 0000000000..6c5404ac84
--- /dev/null
+++ b/benchmark/vm_poly_same_method.yml
@@ -0,0 +1,25 @@
+prelude: |
+  module AR; end
+  class AR::Base
+    def create_or_update
+      nil
+    end
+    def save
+      create_or_update
+    end
+  end
+  class Foo < AR::Base; end
+  class Bar < AR::Base; end
+  o1 = Foo.new
+  o2 = Bar.new
+benchmark:
+  vm_poly_same_method: |
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+loop_count: 6000000
diff --git a/benchmark/vm_poly_singleton.yml b/benchmark/vm_poly_singleton.yml
new file mode 100644
index 0000000000..c7923160fb
--- /dev/null
+++ b/benchmark/vm_poly_singleton.yml
@@ -0,0 +1,18 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_singleton: |
+    class C1
+      def m; 1; end
+    end
+
+    o1 = C1.new
+    o2 = C1.new
+    o2.singleton_class
+
+    i = 0
+    while i<6_000_000 # benchmark loop 2
+      o = (i % 2 == 0) ? o1 : o2
+      o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_proc.yml b/benchmark/vm_proc.yml
new file mode 100644
index 0000000000..2f8de6c272
--- /dev/null
+++ b/benchmark/vm_proc.yml
@@ -0,0 +1,12 @@
+prelude: |
+  def m &b
+    b
+  end
+
+  pr = m{
+    a = 1
+  }
+benchmark:
+  vm_proc: |
+    pr.call
+loop_count: 6000000
diff --git a/benchmark/vm_raise1.yml b/benchmark/vm_raise1.yml
new file mode 100644
index 0000000000..247d9f70ee
--- /dev/null
+++ b/benchmark/vm_raise1.yml
@@ -0,0 +1,16 @@
+prelude: |
+  def rec n
+    if n > 0
+      rec n-1
+    else
+      raise
+    end
+  end
+benchmark:
+  vm_raise1: |
+    begin
+      rec 1
+    rescue
+      # ignore
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_raise2.yml b/benchmark/vm_raise2.yml
new file mode 100644
index 0000000000..f0fa047b3c
--- /dev/null
+++ b/benchmark/vm_raise2.yml
@@ -0,0 +1,16 @@
+prelude: |
+  def rec n
+    if n > 0
+      rec n-1
+    else
+      raise
+    end
+  end
+benchmark:
+  vm_raise2: |
+    begin
+      rec 10
+    rescue
+      # ignore
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_regexp.yml b/benchmark/vm_regexp.yml
new file mode 100644
index 0000000000..2aa3d94dbd
--- /dev/null
+++ b/benchmark/vm_regexp.yml
@@ -0,0 +1,8 @@
+prelude: |
+  str = 'xxxhogexxx'
+benchmark:
+  vm_regexp: |
+    /hoge/ =~ str
+  vm_regexp_invert: |
+    str =~ /hoge/
+loop_count: 6000000
diff --git a/benchmark/vm_rescue.yml b/benchmark/vm_rescue.yml
new file mode 100644
index 0000000000..b4a0af521f
--- /dev/null
+++ b/benchmark/vm_rescue.yml
@@ -0,0 +1,6 @@
+benchmark:
+  vm_rescue: |
+    begin
+    rescue
+    end
+loop_count: 30000000
diff --git a/benchmark/vm_send.yml b/benchmark/vm_send.yml
new file mode 100644
index 0000000000..f31bc7ac89
--- /dev/null
+++ b/benchmark/vm_send.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    def m
+    end
+  end
+
+  o = C.new
+  m = :m
+benchmark:
+  vm_send: |
+    o.__send__ :m
+  vm_send_var: |
+    o.__send__ m
+loop_count: 6000000
diff --git a/benchmark/vm_send_cfunc.yml b/benchmark/vm_send_cfunc.yml
new file mode 100644
index 0000000000..b114ac317d
--- /dev/null
+++ b/benchmark/vm_send_cfunc.yml
@@ -0,0 +1,3 @@
+benchmark:
+  vm_send_cfunc: self.class
+loop_count: 100000000
diff --git a/benchmark/vm_simplereturn.yml b/benchmark/vm_simplereturn.yml
new file mode 100644
index 0000000000..c9829cff0b
--- /dev/null
+++ b/benchmark/vm_simplereturn.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m
+    return 1
+  end
+benchmark:
+  vm_simplereturn: m
+loop_count: 30000000
diff --git a/benchmark/vm_string_literal.yml b/benchmark/vm_string_literal.yml
new file mode 100644
index 0000000000..64439c7980
--- /dev/null
+++ b/benchmark/vm_string_literal.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_string_literal: |
+    x = "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aref_hi.yml b/benchmark/vm_struct_big_aref_hi.yml
new file mode 100644
index 0000000000..4cf78970cb
--- /dev/null
+++ b/benchmark/vm_struct_big_aref_hi.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_aref_hi: |
+    x.z # x[25]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aref_lo.yml b/benchmark/vm_struct_big_aref_lo.yml
new file mode 100644
index 0000000000..c91af27fa5
--- /dev/null
+++ b/benchmark/vm_struct_big_aref_lo.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_aref_lo: |
+    x.k # x[10]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aset.yml b/benchmark/vm_struct_big_aset.yml
new file mode 100644
index 0000000000..69550d14ea
--- /dev/null
+++ b/benchmark/vm_struct_big_aset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_big_aset: |
+    s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x.k = i # x[10] = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_big_href_hi.yml b/benchmark/vm_struct_big_href_hi.yml
new file mode 100644
index 0000000000..09b764dd13
--- /dev/null
+++ b/benchmark/vm_struct_big_href_hi.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_href_hi: |
+    x[:z]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_href_lo.yml b/benchmark/vm_struct_big_href_lo.yml
new file mode 100644
index 0000000000..d2f00b220f
--- /dev/null
+++ b/benchmark/vm_struct_big_href_lo.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_href_lo: |
+    x[:k]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_hset.yml b/benchmark/vm_struct_big_hset.yml
new file mode 100644
index 0000000000..fc45cbee9c
--- /dev/null
+++ b/benchmark/vm_struct_big_hset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_big_hset: |
+    s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x[:k] = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_small_aref.yml b/benchmark/vm_struct_small_aref.yml
new file mode 100644
index 0000000000..5a83251d1e
--- /dev/null
+++ b/benchmark/vm_struct_small_aref.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_aref: |
+    x.a
+loop_count: 6000000
diff --git a/benchmark/vm_struct_small_aset.yml b/benchmark/vm_struct_small_aset.yml
new file mode 100644
index 0000000000..74f435f126
--- /dev/null
+++ b/benchmark/vm_struct_small_aset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_small_aset: |
+    s = Struct.new(:a, :b, :c)
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x.a = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_small_href.yml b/benchmark/vm_struct_small_href.yml
new file mode 100644
index 0000000000..6b7d7f39e7
--- /dev/null
+++ b/benchmark/vm_struct_small_href.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_href: |
+    x[:a]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_small_hset.yml b/benchmark/vm_struct_small_hset.yml
new file mode 100644
index 0000000000..5d43b150de
--- /dev/null
+++ b/benchmark/vm_struct_small_hset.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_hset: |
+    x[:a] = 1
+loop_count: 6000000
diff --git a/benchmark/vm_super.yml b/benchmark/vm_super.yml
new file mode 100644
index 0000000000..0d1e965c6e
--- /dev/null
+++ b/benchmark/vm_super.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C
+    def m
+      1
+    end
+  end
+
+  class CC < C
+    def m
+      super()
+    end
+  end
+
+  obj = CC.new
+benchmark:
+  vm_super: obj.m
+loop_count: 6000000
diff --git a/benchmark/vm_swap.yml b/benchmark/vm_swap.yml
new file mode 100644
index 0000000000..e824a65e0a
--- /dev/null
+++ b/benchmark/vm_swap.yml
@@ -0,0 +1,7 @@
+prelude: |
+  a = 1
+  b = 2
+benchmark:
+  vm_swap: |
+    a, b = b, a
+loop_count: 30000000
diff --git a/benchmark/vm_symbol_block_pass.rb b/benchmark/vm_symbol_block_pass.rb
new file mode 100644
index 0000000000..1d433353e1
--- /dev/null
+++ b/benchmark/vm_symbol_block_pass.rb
@@ -0,0 +1,13 @@
+class C
+  1000.times {|i|
+    eval("def i#{i};end")
+  }
+end
+
+c = C.new
+m = C.instance_methods(false)
+5_000.times do
+  m.each do |n|
+    c.tap(&n)
+  end
+end
diff --git a/benchmark/vm_thread_alive_check.yml b/benchmark/vm_thread_alive_check.yml
new file mode 100644
index 0000000000..d21737d3e8
--- /dev/null
+++ b/benchmark/vm_thread_alive_check.yml
@@ -0,0 +1,8 @@
+benchmark:
+  vm_thread_alive_check: |
+    t = Thread.new{}
+    while t.alive?
+      Thread.pass
+    end
+loop_count: 50_000
+
diff --git a/benchmark/vm_thread_close.rb b/benchmark/vm_thread_close.rb
new file mode 100644
index 0000000000..3e9a265ce8
--- /dev/null
+++ b/benchmark/vm_thread_close.rb
@@ -0,0 +1,6 @@
+1000.times { Thread.new { sleep } }
+i = 0
+while i<100_000 # benchmark loop 3
+  i += 1
+  IO.pipe.each(&:close)
+end
diff --git a/benchmark/vm_thread_condvar1.rb b/benchmark/vm_thread_condvar1.rb
new file mode 100644
index 0000000000..feed27c3ad
--- /dev/null
+++ b/benchmark/vm_thread_condvar1.rb
@@ -0,0 +1,28 @@
+# two threads, two mutex, two condvar ping-pong
+require 'thread'
+m1 = Thread::Mutex.new
+m2 = Thread::Mutex.new
+cv1 = Thread::ConditionVariable.new
+cv2 = Thread::ConditionVariable.new
+max = 100000
+i = 0
+wait = nil
+m2.synchronize do
+  wait = Thread.new do
+    m1.synchronize do
+      m2.synchronize { cv2.signal }
+      while (i += 1) < max
+        cv1.wait(m1)
+        cv2.signal
+      end
+    end
+  end
+  cv2.wait(m2)
+end
+m1.synchronize do
+  while i < max
+    cv1.signal
+    cv2.wait(m1)
+  end
+end
+wait.join
diff --git a/benchmark/vm_thread_condvar2.rb b/benchmark/vm_thread_condvar2.rb
new file mode 100644
index 0000000000..6590c4134b
--- /dev/null
+++ b/benchmark/vm_thread_condvar2.rb
@@ -0,0 +1,35 @@
+# many threads, one mutex, many condvars
+require 'thread'
+m = Thread::Mutex.new
+cv1 = Thread::ConditionVariable.new
+cv2 = Thread::ConditionVariable.new
+max = 1000
+n = 100
+waiting = 0
+scvs = []
+waiters = n.times.map do |i|
+  start_cv = Thread::ConditionVariable.new
+  scvs << start_cv
+  start_mtx = Thread::Mutex.new
+  start_mtx.synchronize do
+    th = Thread.new(start_mtx, start_cv) do |sm, scv|
+      m.synchronize do
+        sm.synchronize { scv.signal }
+        max.times do
+          cv2.signal if (waiting += 1) == n
+          cv1.wait(m)
+        end
+      end
+    end
+    start_cv.wait(start_mtx)
+    th
+  end
+end
+m.synchronize do
+  max.times do
+    cv2.wait(m) until waiting == n
+    waiting = 0
+    cv1.broadcast
+  end
+end
+waiters.each(&:join)
diff --git a/benchmark/bm_vm_thread_create_join.rb b/benchmark/vm_thread_create_join.rb
index 393cd45df9..393cd45df9 100644
--- a/benchmark/bm_vm_thread_create_join.rb
+++ b/benchmark/vm_thread_create_join.rb
diff --git a/benchmark/vm_thread_mutex1.rb b/benchmark/vm_thread_mutex1.rb
new file mode 100644
index 0000000000..66e42c85e1
--- /dev/null
+++ b/benchmark/vm_thread_mutex1.rb
@@ -0,0 +1,21 @@
+# one thread, one mutex (no contention)
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+lmax = max * max
+(1..1).map{
+  Thread.new{
+    i = 0
+    while i<lmax
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_mutex2.rb b/benchmark/vm_thread_mutex2.rb
new file mode 100644
index 0000000000..6e6c804c31
--- /dev/null
+++ b/benchmark/vm_thread_mutex2.rb
@@ -0,0 +1,21 @@
+# two threads, one mutex
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+lmax = (max * max)/2
+(1..2).map{
+  Thread.new{
+    i = 0
+    while i<lmax
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_mutex3.rb b/benchmark/vm_thread_mutex3.rb
new file mode 100644
index 0000000000..c750dc542a
--- /dev/null
+++ b/benchmark/vm_thread_mutex3.rb
@@ -0,0 +1,20 @@
+# 1000 threads, one mutex
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+(1..max).map{
+  Thread.new{
+    i = 0
+    while i<max
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_pass.rb b/benchmark/vm_thread_pass.rb
new file mode 100644
index 0000000000..438bd08d45
--- /dev/null
+++ b/benchmark/vm_thread_pass.rb
@@ -0,0 +1,15 @@
+# Plenty Thread.pass
+# A performance may depend on GVL implementation.
+
+tmax = (ARGV.shift || 8).to_i
+lmax = 400_000 / tmax
+
+(1..tmax).map{
+  Thread.new{
+    lmax.times{
+      Thread.pass
+    }
+  }
+}.each{|t| t.join}
+
+
diff --git a/benchmark/vm_thread_pass_flood.rb b/benchmark/vm_thread_pass_flood.rb
new file mode 100644
index 0000000000..65df8e6154
--- /dev/null
+++ b/benchmark/vm_thread_pass_flood.rb
@@ -0,0 +1,10 @@
+# n.b. this is a good test for GVL when pinned to a single CPU
+
+5_000.times{
+  Thread.new{loop{Thread.pass}}
+}
+
+i = 0
+while i<10_000
+  i += 1
+end
diff --git a/benchmark/vm_thread_pipe.rb b/benchmark/vm_thread_pipe.rb
new file mode 100644
index 0000000000..112a621905
--- /dev/null
+++ b/benchmark/vm_thread_pipe.rb
@@ -0,0 +1,17 @@
+# Measure small and plenty pipe read/write.
+# A performance may depend on GVL implementation.
+
+lmax = 100_000
+r, w = IO.pipe
+[Thread.new{
+  lmax.times{
+    w.write('a')
+  }
+  p "w:exit"
+}, Thread.new{
+  lmax.times{
+    r.read(1)
+  }
+  p "r:exit"
+}].each{|t| t.join}
+
diff --git a/benchmark/vm_thread_queue.rb b/benchmark/vm_thread_queue.rb
new file mode 100644
index 0000000000..1dd3696a3c
--- /dev/null
+++ b/benchmark/vm_thread_queue.rb
@@ -0,0 +1,18 @@
+require 'thread'
+
+n = 10_000_000
+q = Thread::Queue.new
+consumer = Thread.new{
+  while q.pop
+    # consuming
+  end
+}
+
+producer = Thread.new{
+  n.times{
+    q.push true
+  }
+  q.push nil
+}
+
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue.rb b/benchmark/vm_thread_sized_queue.rb
new file mode 100644
index 0000000000..7b9af5482b
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue.rb
@@ -0,0 +1,20 @@
+require 'thread'
+# on producer, one consumer
+
+n = 1_000_000
+q = Thread::SizedQueue.new(100)
+consumer = Thread.new{
+  while q.pop
+    # consuming
+  end
+}
+
+producer = Thread.new{
+  while n > 0
+    q.push true
+    n -= 1
+  end
+  q.push nil
+}
+
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue2.rb b/benchmark/vm_thread_sized_queue2.rb
new file mode 100644
index 0000000000..de9f55e978
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue2.rb
@@ -0,0 +1,23 @@
+require 'thread'
+# one producer, many consumers
+n = 1_000_000
+m = 10
+q = Thread::SizedQueue.new(100)
+consumers = m.times.map do
+  Thread.new do
+    while q.pop
+      # consuming
+    end
+  end
+end
+
+producer = Thread.new do
+  while n > 0
+    q.push true
+    n -= 1
+  end
+  m.times { q.push nil }
+end
+
+producer.join
+consumers.each(&:join)
diff --git a/benchmark/vm_thread_sized_queue3.rb b/benchmark/vm_thread_sized_queue3.rb
new file mode 100644
index 0000000000..ce5f1796d8
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue3.rb
@@ -0,0 +1,22 @@
+require 'thread'
+# many producers, one consumer
+n = 1_000_000
+m = 10
+q = Thread::SizedQueue.new(100)
+consumer = Thread.new do
+  while q.pop
+    # consuming
+  end
+end
+
+producers = m.times.map do
+  Thread.new do
+    while n > 0
+      q.push true
+      n -= 1
+    end
+  end
+end
+producers.each(&:join)
+q.push nil
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue4.rb b/benchmark/vm_thread_sized_queue4.rb
new file mode 100644
index 0000000000..a9b7d80ec0
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue4.rb
@@ -0,0 +1,26 @@
+require 'thread'
+# many producers, many consumers
+nr = 1_000_000
+n = 10
+m = 10
+q = Thread::SizedQueue.new(100)
+consumers = n.times.map do
+  Thread.new do
+    while q.pop
+      # consuming
+    end
+  end
+end
+
+producers = m.times.map do
+  Thread.new do
+    while nr > 0
+      q.push true
+      nr -= 1
+    end
+  end
+end
+
+producers.each(&:join)
+n.times { q.push nil }
+consumers.each(&:join)
diff --git a/benchmark/vm_thread_sleep.yml b/benchmark/vm_thread_sleep.yml
new file mode 100644
index 0000000000..96901d8466
--- /dev/null
+++ b/benchmark/vm_thread_sleep.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_thread_sleep: |
+    Thread.new { sleep }
+loop_count: 10_000
diff --git a/benchmark/vm_unif1.yml b/benchmark/vm_unif1.yml
new file mode 100644
index 0000000000..04187bb0e2
--- /dev/null
+++ b/benchmark/vm_unif1.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m a, b
+  end
+benchmark:
+  vm_unif1: |
+    m 100, 200
+loop_count: 6000000
diff --git a/benchmark/vm_yield.yml b/benchmark/vm_yield.yml
new file mode 100644
index 0000000000..230be3d84f
--- /dev/null
+++ b/benchmark/vm_yield.yml
@@ -0,0 +1,13 @@
+# while loop cost is not removed due to benchmark_driver.gem's limitation
+benchmark:
+  vm_yield: |
+    def m
+      i = 0
+      while i<30_000_000
+        i += 1
+        yield
+      end
+    end
+
+    m{}
+loop_count: 1
diff --git a/benchmark/vm_zsuper.yml b/benchmark/vm_zsuper.yml
new file mode 100644
index 0000000000..bfb5837578
--- /dev/null
+++ b/benchmark/vm_zsuper.yml
@@ -0,0 +1,18 @@
+prelude: |
+  class C
+    def m a
+      1
+    end
+  end
+
+  class CC < C
+    def m a
+      super
+    end
+  end
+
+  obj = CC.new
+benchmark:
+  vm_zsuper: |
+    obj.m 10
+loop_count: 6000000
diff --git a/benchmark/wc.input.base b/benchmark/wc.input.base
deleted file mode 100644
index 41143fbac0..0000000000
--- a/benchmark/wc.input.base
+++ /dev/null
@@ -1,25 +0,0 @@
-Subject:      Re: Who was Izchak Miller?
-From:         "Jane D. Anonymous" <nobody@yale.edu>
-Date:         1996/04/28
-Message-Id:   <4lv7bc$oh@news.ycc.yale.edu>
-References:   <317C405E.5DFA@panix.com> <4lk6vl$gde@ns.oar.net>
-To:           75176.2330@compuserve.com
-Content-Type: text/plain; charset=us-ascii
-Organization: Yale University
-X-Url:        news:4lk6vl$gde@ns.oar.net
-Mime-Version: 1.0
-Newsgroups:   rec.games.roguelike.nethack
-X-Mailer:     Mozilla 1.1N (Macintosh; I; 68K)
-
-Hello there, Izchak Miller was my father.  When I was younger I spent 
-many a night, hunched over the keyboard with a cup of tea, playing 
-nethack with him and my brother.  my dad was a philosopher with a strong 
-weakness for fantasy/sci fi.  I remember when he started to get involved 
-with the Nethack team- my brother's Dungeons and Dragons monster book 
-found a regular place beside my dad's desk. it's nice to see him living 
-on in the game he loved so much :-).  
-                                                                  Tamar Miller
-
-The following is a really long word of 5000 characters:
-
-wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww
diff --git a/bignum.c b/bignum.c
index f7599c3449..cb2c3b6f07 100644
--- a/bignum.c
+++ b/bignum.c
@@ -9,29 +9,49 @@
 
 **********************************************************************/
 
-#include "ruby/ruby.h"
-#include "ruby/thread.h"
-#include "ruby/util.h"
-#include "internal.h"
+#include "ruby/internal/config.h"
+
+#include <ctype.h>
+#include <float.h>
+#include <math.h>
 
 #ifdef HAVE_STRINGS_H
-#include <strings.h>
+# include <strings.h>
 #endif
-#include <math.h>
-#include <float.h>
-#include <ctype.h>
+
 #ifdef HAVE_IEEEFP_H
-#include <ieeefp.h>
+# include <ieeefp.h>
+#endif
+
+#if !defined(USE_GMP)
+#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
+# define USE_GMP 1
+#else
+# define USE_GMP 0
+#endif
 #endif
-#include <assert.h>
+#if USE_GMP
+# include <gmp.h>
+#endif
+
+#include "id.h"
+#include "internal.h"
+#include "internal/bignum.h"
+#include "internal/complex.h"
+#include "internal/gc.h"
+#include "internal/numeric.h"
+#include "internal/object.h"
+#include "internal/sanitizers.h"
+#include "internal/variable.h"
+#include "internal/warnings.h"
+#include "ruby/thread.h"
+#include "ruby/util.h"
+#include "ruby_assert.h"
 
-VALUE rb_cBignum;
 const char ruby_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";
 
 #ifndef SIZEOF_BDIGIT_DBL
-# if defined(HAVE_INT64_T) && defined(HAVE_INT128_T)
-#  define SIZEOF_BDIGIT_DBL SIZEOF_INT128_T
-# elif SIZEOF_INT*2 <= SIZEOF_LONG_LONG
+# if SIZEOF_INT*2 <= SIZEOF_LONG_LONG
 #  define SIZEOF_BDIGIT_DBL SIZEOF_LONG_LONG
 # else
 #  define SIZEOF_BDIGIT_DBL SIZEOF_LONG
@@ -40,17 +60,17 @@ const char ruby_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";
 
 STATIC_ASSERT(sizeof_bdigit_dbl, sizeof(BDIGIT_DBL) == SIZEOF_BDIGIT_DBL);
 STATIC_ASSERT(sizeof_bdigit_dbl_signed, sizeof(BDIGIT_DBL_SIGNED) == SIZEOF_BDIGIT_DBL);
-STATIC_ASSERT(sizeof_bdigit, SIZEOF_BDIGITS <= sizeof(BDIGIT));
-STATIC_ASSERT(sizeof_bdigit_and_dbl, SIZEOF_BDIGITS*2 <= SIZEOF_BDIGIT_DBL);
+STATIC_ASSERT(sizeof_bdigit, SIZEOF_BDIGIT <= sizeof(BDIGIT));
+STATIC_ASSERT(sizeof_bdigit_and_dbl, SIZEOF_BDIGIT*2 <= SIZEOF_BDIGIT_DBL);
 STATIC_ASSERT(bdigit_signedness, 0 < (BDIGIT)-1);
 STATIC_ASSERT(bdigit_dbl_signedness, 0 < (BDIGIT_DBL)-1);
 STATIC_ASSERT(bdigit_dbl_signed_signedness, 0 > (BDIGIT_DBL_SIGNED)-1);
-STATIC_ASSERT(rbignum_embed_len_max, RBIGNUM_EMBED_LEN_MAX <= (RBIGNUM_EMBED_LEN_MASK >> RBIGNUM_EMBED_LEN_SHIFT));
+STATIC_ASSERT(rbignum_embed_len_max, BIGNUM_EMBED_LEN_MAX <= (BIGNUM_EMBED_LEN_MASK >> BIGNUM_EMBED_LEN_SHIFT));
 
-#if SIZEOF_BDIGITS < SIZEOF_LONG
-STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_LONG % SIZEOF_BDIGITS == 0);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_LONG % SIZEOF_BDIGIT == 0);
 #else
-STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGITS % SIZEOF_LONG == 0);
+STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGIT % SIZEOF_LONG == 0);
 #endif
 
 #ifdef WORDS_BIGENDIAN
@@ -58,19 +78,15 @@ STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGITS % SIZEOF_LONG == 0);
 #else
 #   define HOST_BIGENDIAN_P 0
 #endif
-#define ALIGNOF(type) ((int)offsetof(struct { char f1; type f2; }, f2))
-/* (sizeof(d) * CHAR_BIT <= (n) ? 0 : (n)) is same as n but suppress a warning, C4293, by Visual Studio.  */
+/* (!LSHIFTABLE(d, n) ? 0 : (n)) is the same as n but suppress a warning, C4293, by Visual Studio.  */
 #define LSHIFTABLE(d, n) ((n) < sizeof(d) * CHAR_BIT)
 #define LSHIFTX(d, n) (!LSHIFTABLE(d, n) ? 0 : ((d) << (!LSHIFTABLE(d, n) ? 0 : (n))))
 #define CLEAR_LOWBITS(d, numbits) ((d) & LSHIFTX(~((d)*0), (numbits)))
 #define FILL_LOWBITS(d, numbits) ((d) | (LSHIFTX(((d)*0+1), (numbits))-1))
 #define POW2_P(x) (((x)&((x)-1))==0)
 
-#define BDIGITS(x) (RBIGNUM_DIGITS(x))
-#define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT)
-#if BITSPERDIG >= INT_MAX
-# error incredible BDIGIT
-#endif
+#define BDIGITS(x) (BIGNUM_DIGITS(x))
+#define BITSPERDIG (SIZEOF_BDIGIT*CHAR_BIT)
 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)
 #define BIGRAD_HALF ((BDIGIT)(BIGRAD >> 1))
 #define BDIGIT_MSB(d) (((d) & BIGRAD_HALF) != 0)
@@ -80,37 +96,36 @@ STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGITS % SIZEOF_LONG == 0);
 #define BDIGMAX ((BDIGIT)(BIGRAD-1))
 #define BDIGIT_DBL_MAX (~(BDIGIT_DBL)0)
 
-#if SIZEOF_BDIGITS == 2
+#if SIZEOF_BDIGIT == 2
 #   define swap_bdigit(x) swap16(x)
-#elif SIZEOF_BDIGITS == 4
+#elif SIZEOF_BDIGIT == 4
 #   define swap_bdigit(x) swap32(x)
-#elif SIZEOF_BDIGITS == 8
+#elif SIZEOF_BDIGIT == 8
 #   define swap_bdigit(x) swap64(x)
 #endif
 
-#define BIGZEROP(x) (RBIGNUM_LEN(x) == 0 || \
-		     (BDIGITS(x)[0] == 0 && \
-		      (RBIGNUM_LEN(x) == 1 || bigzero_p(x))))
-#define BIGSIZE(x) (RBIGNUM_LEN(x) == 0 ? (size_t)0 : \
-    BDIGITS(x)[RBIGNUM_LEN(x)-1] ? \
-        (size_t)(RBIGNUM_LEN(x)*SIZEOF_BDIGITS - nlz(BDIGITS(x)[RBIGNUM_LEN(x)-1])/CHAR_BIT) : \
+#define BIGZEROP(x) (BIGNUM_LEN(x) == 0 || \
+                     (BDIGITS(x)[0] == 0 && \
+                      (BIGNUM_LEN(x) == 1 || bigzero_p(x))))
+#define BIGSIZE(x) (BIGNUM_LEN(x) == 0 ? (size_t)0 : \
+    BDIGITS(x)[BIGNUM_LEN(x)-1] ? \
+        (size_t)(BIGNUM_LEN(x)*SIZEOF_BDIGIT - nlz(BDIGITS(x)[BIGNUM_LEN(x)-1])/CHAR_BIT) : \
     rb_absint_size(x, NULL))
 
-#define BIGDIVREM_EXTRA_WORDS 2
-#define roomof(n, m) ((long)(((n)+(m)-1) / (m)))
-#define bdigit_roomof(n) roomof(n, SIZEOF_BDIGITS)
+#define BIGDIVREM_EXTRA_WORDS 1
+#define bdigit_roomof(n) roomof(n, SIZEOF_BDIGIT)
 #define BARY_ARGS(ary) ary, numberof(ary)
 
 #define BARY_ADD(z, x, y) bary_add(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
 #define BARY_SUB(z, x, y) bary_sub(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
-#define BARY_MUL1(z, x, y) bary_mul1(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
+#define BARY_SHORT_MUL(z, x, y) bary_short_mul(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
 #define BARY_DIVMOD(q, r, x, y) bary_divmod(BARY_ARGS(q), BARY_ARGS(r), BARY_ARGS(x), BARY_ARGS(y))
 #define BARY_ZERO_P(x) bary_zero_p(BARY_ARGS(x))
 
-#define RBIGNUM_SET_NEGATIVE_SIGN(b) RBIGNUM_SET_SIGN(b, 0)
-#define RBIGNUM_SET_POSITIVE_SIGN(b) RBIGNUM_SET_SIGN(b, 1)
+#define BIGNUM_SET_NEGATIVE_SIGN(b) BIGNUM_SET_SIGN(b, 0)
+#define BIGNUM_SET_POSITIVE_SIGN(b) BIGNUM_SET_SIGN(b, 1)
 
-#define bignew(len,sign) bignew_1(rb_cBignum,(len),(sign))
+#define bignew(len,sign) bignew_1(rb_cInteger,(len),(sign))
 
 #define BDIGITS_ZERO(ptr, n) do { \
   BDIGIT *bdigitz_zero_ptr = (ptr); \
@@ -121,137 +136,47 @@ STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGITS % SIZEOF_LONG == 0);
   } \
 } while (0)
 
+#define BARY_TRUNC(ds, n) do { \
+        while (0 < (n) && (ds)[(n)-1] == 0) \
+            (n)--; \
+    } while (0)
+
 #define KARATSUBA_BALANCED(xn, yn) ((yn)/2 < (xn))
 #define TOOM3_BALANCED(xn, yn) (((yn)+2)/3 * 2 < (xn))
 
+#define GMP_MUL_DIGITS 20
 #define KARATSUBA_MUL_DIGITS 70
 #define TOOM3_MUL_DIGITS 150
 
-typedef void (mulfunc_t)(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl);
+#define GMP_DIV_DIGITS 20
+#define GMP_BIG2STR_DIGITS 20
+#define GMP_STR2BIG_DIGITS 20
+#if USE_GMP
+# define NAIVE_MUL_DIGITS GMP_MUL_DIGITS
+#else
+# define NAIVE_MUL_DIGITS KARATSUBA_MUL_DIGITS
+#endif
+
+typedef void (mulfunc_t)(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn);
 
 static mulfunc_t bary_mul_toom3_start;
 static mulfunc_t bary_mul_karatsuba_start;
-static BDIGIT bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, long nx, BDIGIT y);
-static void bary_divmod(BDIGIT *qds, size_t nq, BDIGIT *rds, size_t nr, const BDIGIT *xds, size_t nx, const BDIGIT *yds, size_t ny);
+static BDIGIT bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT y);
 
-static VALUE bigmul0(VALUE x, VALUE y);
-static void bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn);
-static VALUE bignew_1(VALUE klass, long len, int sign);
+static VALUE bignew_1(VALUE klass, size_t len, int sign);
 static inline VALUE bigtrunc(VALUE x);
 
 static VALUE bigsq(VALUE x);
-static void bigdivmod(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp);
 static inline VALUE power_cache_get_power(int base, int power_level, size_t *numdigits_ret);
 
-static int
-nlz16(uint16_t x)
-{
-#if defined(HAVE_BUILTIN___BUILTIN_CLZ) && 2 <= SIZEOF_INT
-    if (x == 0) return 16;
-    return __builtin_clz(x) - (SIZEOF_INT-2)*CHAR_BIT;
-#else
-    uint16_t y;
-    int n = 16;
-    y = x >>  8; if (y) {n -=  8; x = y;}
-    y = x >>  4; if (y) {n -=  4; x = y;}
-    y = x >>  2; if (y) {n -=  2; x = y;}
-    y = x >>  1; if (y) {return n - 2;}
-    return (int)(n - x);
-#endif
-}
-
-static int
-nlz32(uint32_t x)
-{
-#if defined(HAVE_BUILTIN___BUILTIN_CLZ) && 4 <= SIZEOF_INT
-    if (x == 0) return 32;
-    return __builtin_clz(x) - (SIZEOF_INT-4)*CHAR_BIT;
-#elif defined(HAVE_BUILTIN___BUILTIN_CLZL) && 4 <= SIZEOF_LONG
-    if (x == 0) return 32;
-    return __builtin_clzl(x) - (SIZEOF_LONG-4)*CHAR_BIT;
-#else
-    uint32_t y;
-    int n = 32;
-    y = x >> 16; if (y) {n -= 16; x = y;}
-    y = x >>  8; if (y) {n -=  8; x = y;}
-    y = x >>  4; if (y) {n -=  4; x = y;}
-    y = x >>  2; if (y) {n -=  2; x = y;}
-    y = x >>  1; if (y) {return n - 2;}
-    return (int)(n - x);
-#endif
-}
-
-#if defined(HAVE_UINT64_T)
-static int
-nlz64(uint64_t x)
-{
-#if defined(HAVE_BUILTIN___BUILTIN_CLZL) && 8 <= SIZEOF_LONG
-    if (x == 0) return 64;
-    return __builtin_clzl(x) - (SIZEOF_LONG-8)*CHAR_BIT;
-#elif defined(HAVE_BUILTIN___BUILTIN_CLZLL) && 8 <= SIZEOF_LONG_LONG
-    if (x == 0) return 64;
-    return __builtin_clzll(x) - (SIZEOF_LONG_LONG-8)*CHAR_BIT;
-#else
-    uint64_t y;
-    int n = 64;
-    y = x >> 32; if (y) {n -= 32; x = y;}
-    y = x >> 16; if (y) {n -= 16; x = y;}
-    y = x >>  8; if (y) {n -=  8; x = y;}
-    y = x >>  4; if (y) {n -=  4; x = y;}
-    y = x >>  2; if (y) {n -=  2; x = y;}
-    y = x >>  1; if (y) {return n - 2;}
-    return (int)(n - x);
-#endif
-}
-#endif
-
-#if defined(HAVE_UINT128_T)
-static int
-nlz128(uint128_t x)
-{
-#if defined(HAVE_BUILTIN___BUILTIN_CLZLL) && 16 <= SIZEOF_LONG_LONG
-    if (x == 0) return 128;
-    return __builtin_clzll(x) - (SIZEOF_LONG_LONG-16)*CHAR_BIT;
-#else
-    uint128_t y;
-    int n = 128;
-    y = x >> 64; if (y) {n -= 64; x = y;}
-    y = x >> 32; if (y) {n -= 32; x = y;}
-    y = x >> 16; if (y) {n -= 16; x = y;}
-    y = x >>  8; if (y) {n -=  8; x = y;}
-    y = x >>  4; if (y) {n -=  4; x = y;}
-    y = x >>  2; if (y) {n -=  2; x = y;}
-    y = x >>  1; if (y) {return n - 2;}
-    return (int)(n - x);
-#endif
-}
-#endif
-
-#if SIZEOF_BDIGITS == 2
-static int nlz(BDIGIT x) { return nlz16((uint16_t)x); }
-#elif SIZEOF_BDIGITS == 4
-static int nlz(BDIGIT x) { return nlz32((uint32_t)x); }
-#elif SIZEOF_BDIGITS == 8
-static int nlz(BDIGIT x) { return nlz64((uint64_t)x); }
-#elif SIZEOF_BDIGITS == 16
-static int nlz(BDIGIT x) { return nlz128((uint128_t)x); }
-#endif
-
-#if defined(HAVE_UINT128_T)
-#   define bitsize(x) \
-        (sizeof(x) <= 2 ? 16 - nlz16(x) : \
-         sizeof(x) <= 4 ? 32 - nlz32(x) : \
-         sizeof(x) <= 8 ? 64 - nlz64(x) : \
-         128 - nlz128(x))
-#elif defined(HAVE_UINT64_T)
-#   define bitsize(x) \
-        (sizeof(x) <= 2 ? 16 - nlz16(x) : \
-         sizeof(x) <= 4 ? 32 - nlz32(x) : \
-         64 - nlz64(x))
-#else
-#   define bitsize(x) \
-        (sizeof(x) <= 2 ? 16 - nlz16(x) : \
-         32 - nlz32(x))
+#if SIZEOF_BDIGIT <= SIZEOF_INT
+static int nlz(BDIGIT x) { return nlz_int((unsigned int)x) - (SIZEOF_INT-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_LONG
+static int nlz(BDIGIT x) { return nlz_long((unsigned long)x) - (SIZEOF_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_LONG_LONG
+static int nlz(BDIGIT x) { return nlz_long_long((unsigned LONG_LONG)x) - (SIZEOF_LONG_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_INT128_T
+static int nlz(BDIGIT x) { return nlz_int128((uint128_t)x) - (SIZEOF_INT128_T-SIZEOF_BDIGIT) * CHAR_BIT; }
 #endif
 
 #define U16(a) ((uint16_t)(a))
@@ -263,7 +188,7 @@ static int nlz(BDIGIT x) { return nlz128((uint128_t)x); }
 #define U128(a,b,c,d) (((uint128_t)U64(a,b) << 64) | U64(c,d))
 #endif
 
-/* The following scirpt, maxpow.rb, generates the tables follows.
+/* The following script, maxpow.rb, generates the tables follows.
 
 def big(n, bits)
   ns = []
@@ -307,7 +232,7 @@ end
 
  */
 
-#ifdef HAVE_UINT16_T
+#if SIZEOF_BDIGIT_DBL == 2
 static const int maxpow16_exp[35] = {
     15, 10, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3,
     3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
@@ -323,8 +248,7 @@ static const uint16_t maxpow16_num[35] = {
     U16(0x00006978), U16(0x0000745f), U16(0x00008000), U16(0x00008c61),
     U16(0x00009988), U16(0x0000a77b), U16(0x0000b640),
 };
-#endif
-#ifdef HAVE_UINT32_T
+#elif SIZEOF_BDIGIT_DBL == 4
 static const int maxpow32_exp[35] = {
     31, 20, 15, 13, 12, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7,
     7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
@@ -340,8 +264,7 @@ static const uint32_t maxpow32_num[35] = {
     U32(0x2b73a840), U32(0x34e63b41), U32(0x40000000), U32(0x4cfa3cc1),
     U32(0x5c13d840), U32(0x6d91b519), U32(0x81bf1000),
 };
-#endif
-#ifdef HAVE_UINT64_T
+#elif SIZEOF_BDIGIT_DBL == 8 && defined HAVE_UINT64_T
 static const int maxpow64_exp[35] = {
     63, 40, 31, 27, 24, 22, 21, 20, 19, 18, 17, 17, 16, 16, 15, 15, 15,
     15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12,
@@ -367,8 +290,7 @@ static const uint64_t maxpow64_num[35] = {
     U64(0x211e44f7,0xd02c1000), U64(0x2ee56725,0xf06e5c71),
     U64(0x41c21cb8,0xe1000000),
 };
-#endif
-#ifdef HAVE_UINT128_T
+#elif SIZEOF_BDIGIT_DBL == 16 && defined HAVE_UINT128_T
 static const int maxpow128_exp[35] = {
     127, 80, 63, 55, 49, 45, 42, 40, 38, 37, 35, 34, 33, 32, 31, 31, 30,
     30, 29, 29, 28, 28, 27, 27, 27, 26, 26, 26, 26, 25, 25, 25, 25, 24,
@@ -448,40 +370,6 @@ maxpow_in_bdigit_dbl(int base, int *exp_ret)
     return maxpow;
 }
 
-static BDIGIT
-maxpow_in_bdigit(int base, int *exp_ret)
-{
-    BDIGIT maxpow;
-    int exponent;
-
-    {
-#if SIZEOF_BDIGITS == 0
-#elif SIZEOF_BDIGITS == 2
-        maxpow = maxpow16_num[base-2];
-        exponent = maxpow16_exp[base-2];
-#elif SIZEOF_BDIGITS == 4
-        maxpow = maxpow32_num[base-2];
-        exponent = maxpow32_exp[base-2];
-#elif SIZEOF_BDIGITS == 8 && defined HAVE_UINT64_T
-        maxpow = maxpow64_num[base-2];
-        exponent = maxpow64_exp[base-2];
-#elif SIZEOF_BDIGITS == 16 && defined HAVE_UINT128_T
-        maxpow = maxpow128_num[base-2];
-        exponent = maxpow128_exp[base-2];
-#else
-        maxpow = base;
-        exponent = 1;
-        while (maxpow <= BDIGMAX / base) {
-            maxpow *= base;
-            exponent++;
-        }
-#endif
-    }
-
-    *exp_ret = exponent;
-    return maxpow;
-}
-
 static inline BDIGIT_DBL
 bary2bdigitdbl(const BDIGIT *ds, size_t n)
 {
@@ -506,21 +394,21 @@ bdigitdbl2bary(BDIGIT *ds, size_t n, BDIGIT_DBL num)
 static int
 bary_cmp(const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
 {
-    while (0 < xn && xds[xn-1] == 0)
-        xn--;
-    while (0 < yn && yds[yn-1] == 0)
-        yn--;
+    size_t i;
+    BARY_TRUNC(xds, xn);
+    BARY_TRUNC(yds, yn);
 
     if (xn < yn)
         return -1;
     if (xn > yn)
         return 1;
 
-    while (xn-- && xds[xn] == yds[xn])
-        ;
-    if (xn == (size_t)-1)
+    for (i = 0; i < xn; i++)
+        if (xds[xn - i - 1] != yds[yn - i - 1])
+            break;
+    if (i == xn)
         return 0;
-    return xds[xn] < yds[xn] ? -1 : 1;
+    return xds[xn - i - 1] < yds[yn - i - 1] ? -1 : 1;
 }
 
 static BDIGIT
@@ -531,55 +419,53 @@ bary_small_lshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift)
     assert(0 <= shift && shift < BITSPERDIG);
 
     for (i=0; i<n; i++) {
-	num = num | (BDIGIT_DBL)*xds++ << shift;
-	*zds++ = BIGLO(num);
-	num = BIGDN(num);
+        num = num | (BDIGIT_DBL)*xds++ << shift;
+        *zds++ = BIGLO(num);
+        num = BIGDN(num);
     }
     return BIGLO(num);
 }
 
 static void
-bary_small_rshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift, int sign_bit)
+bary_small_rshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift, BDIGIT higher_bdigit)
 {
+    size_t i;
     BDIGIT_DBL num = 0;
-    BDIGIT x;
 
     assert(0 <= shift && shift < BITSPERDIG);
 
-    if (sign_bit) {
-	num = (~(BDIGIT_DBL)0) << BITSPERDIG;
-    }
-    while (n--) {
-	num = (num | xds[n]) >> shift;
-        x = xds[n];
-	zds[n] = BIGLO(num);
-	num = BIGUP(x);
+    num = BIGUP(higher_bdigit);
+    for (i = 0; i < n; i++) {
+        BDIGIT x = xds[n - i - 1];
+        num = (num | x) >> shift;
+        zds[n - i - 1] = BIGLO(num);
+        num = BIGUP(x);
     }
 }
 
 static int
-bary_zero_p(BDIGIT *xds, size_t nx)
+bary_zero_p(const BDIGIT *xds, size_t xn)
 {
-    if (nx == 0)
+    if (xn == 0)
         return 1;
     do {
-	if (xds[--nx]) return 0;
-    } while (nx);
+        if (xds[--xn]) return 0;
+    } while (xn);
     return 1;
 }
 
 static void
 bary_neg(BDIGIT *ds, size_t n)
 {
-    while (n--)
-        ds[n] = BIGLO(~ds[n]);
+    size_t i;
+    for (i = 0; i < n; i++)
+        ds[n - i - 1] = BIGLO(~ds[n - i - 1]);
 }
 
 static int
 bary_2comp(BDIGIT *ds, size_t n)
 {
     size_t i;
-    i = 0;
     for (i = 0; i < n; i++) {
         if (ds[i] != 0) {
             goto non_zero;
@@ -737,12 +623,17 @@ integer_pack_take_lowbits(int n, BDIGIT_DBL *ddp, int *numbits_in_dd_p)
     return ret;
 }
 
+#if !defined(WORDS_BIGENDIAN)
 static int
 bytes_2comp(unsigned char *buf, size_t len)
 {
     size_t i;
-    for (i = 0; i < len; i++)
-        buf[i] = ~buf[i];
+    for (i = 0; i < len; i++) {
+        signed char c = buf[i];
+        signed int d = ~c;
+        unsigned int e = d & 0xFF;
+        buf[i] = e;
+    }
     for (i = 0; i < len; i++) {
         buf[i]++;
         if (buf[i] != 0)
@@ -750,6 +641,7 @@ bytes_2comp(unsigned char *buf, size_t len)
     }
     return 1;
 }
+#endif
 
 static int
 bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
@@ -790,24 +682,24 @@ bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords
                     *((unsigned char *)words) = (unsigned char)(d = dp[0]);
                     return ((1 < de - dp || CLEAR_LOWBITS(d, 8) != 0) ? 2 : 1) * sign;
                 }
-#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGITS
-                if (wordsize == 2 && (uintptr_t)words % ALIGNOF(uint16_t) == 0) {
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+                if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
                     uint16_t u = (uint16_t)(d = dp[0]);
                     if (need_swap) u = swap16(u);
                     *((uint16_t *)words) = u;
                     return ((1 < de - dp || CLEAR_LOWBITS(d, 16) != 0) ? 2 : 1) * sign;
                 }
 #endif
-#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGITS
-                if (wordsize == 4 && (uintptr_t)words % ALIGNOF(uint32_t) == 0) {
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+                if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
                     uint32_t u = (uint32_t)(d = dp[0]);
                     if (need_swap) u = swap32(u);
                     *((uint32_t *)words) = u;
                     return ((1 < de - dp || CLEAR_LOWBITS(d, 32) != 0) ? 2 : 1) * sign;
                 }
 #endif
-#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGITS
-                if (wordsize == 8 && (uintptr_t)words % ALIGNOF(uint64_t) == 0) {
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+                if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
                     uint64_t u = (uint64_t)(d = dp[0]);
                     if (need_swap) u = swap64(u);
                     *((uint64_t *)words) = u;
@@ -821,40 +713,40 @@ bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords
                     *((unsigned char *)words) = (unsigned char)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
                     return (1 < de - dp || FILL_LOWBITS(d, 8) != -1) ? -2 : -1;
                 }
-#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGITS
-                if (wordsize == 2 && (uintptr_t)words % ALIGNOF(uint16_t) == 0) {
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+                if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
                     uint16_t u = (uint16_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
                     if (need_swap) u = swap16(u);
                     *((uint16_t *)words) = u;
-                    return (wordsize == SIZEOF_BDIGITS && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
                         (1 < de - dp || FILL_LOWBITS(d, 16) != -1) ? -2 : -1;
                 }
 #endif
-#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGITS
-                if (wordsize == 4 && (uintptr_t)words % ALIGNOF(uint32_t) == 0) {
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+                if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
                     uint32_t u = (uint32_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
                     if (need_swap) u = swap32(u);
                     *((uint32_t *)words) = u;
-                    return (wordsize == SIZEOF_BDIGITS && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
                         (1 < de - dp || FILL_LOWBITS(d, 32) != -1) ? -2 : -1;
                 }
 #endif
-#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGITS
-                if (wordsize == 8 && (uintptr_t)words % ALIGNOF(uint64_t) == 0) {
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+                if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
                     uint64_t u = (uint64_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
                     if (need_swap) u = swap64(u);
                     *((uint64_t *)words) = u;
-                    return (wordsize == SIZEOF_BDIGITS && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
                         (1 < de - dp || FILL_LOWBITS(d, 64) != -1) ? -2 : -1;
                 }
 #endif
             }
         }
 #if !defined(WORDS_BIGENDIAN)
-        if (nails == 0 && SIZEOF_BDIGITS == sizeof(BDIGIT) &&
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
             (flags & INTEGER_PACK_WORDORDER_MASK) == INTEGER_PACK_LSWORD_FIRST &&
             (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_MSBYTE_FIRST) {
-            size_t src_size = (de - dp) * SIZEOF_BDIGITS;
+            size_t src_size = (de - dp) * SIZEOF_BDIGIT;
             size_t dst_size = numwords * wordsize;
             int overflow = 0;
             while (0 < src_size && ((unsigned char *)ds)[src_size-1] == 0)
@@ -882,9 +774,9 @@ bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords
             return sign;
         }
 #endif
-        if (nails == 0 && SIZEOF_BDIGITS == sizeof(BDIGIT) &&
-            wordsize % SIZEOF_BDIGITS == 0 && (uintptr_t)words % ALIGNOF(BDIGIT) == 0) {
-            size_t bdigits_per_word = wordsize / SIZEOF_BDIGITS;
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            wordsize % SIZEOF_BDIGIT == 0 && (uintptr_t)words % RUBY_ALIGNOF(BDIGIT) == 0) {
+            size_t bdigits_per_word = wordsize / SIZEOF_BDIGIT;
             size_t src_num_bdigits = de - dp;
             size_t dst_num_bdigits = numwords * bdigits_per_word;
             int overflow = 0;
@@ -1026,8 +918,6 @@ bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords
     }
 
     if ((flags & INTEGER_PACK_2COMP) && (sign < 0 && numwords != 0)) {
-        unsigned char *buf;
-
         int word_num_partialbits;
         size_t word_num_fullbytes;
 
@@ -1087,7 +977,7 @@ integer_unpack_num_bdigits_small(size_t numwords, size_t wordsize, size_t nails,
 {
     /* nlp_bits stands for number of leading padding bits */
     size_t num_bits = (wordsize * CHAR_BIT - nails) * numwords;
-    size_t num_bdigits = (num_bits + BITSPERDIG - 1) / BITSPERDIG;
+    size_t num_bdigits = roomof(num_bits, BITSPERDIG);
     *nlp_bits_ret = (int)(num_bdigits * BITSPERDIG - num_bits);
     return num_bdigits;
 }
@@ -1095,9 +985,9 @@ integer_unpack_num_bdigits_small(size_t numwords, size_t wordsize, size_t nails,
 static size_t
 integer_unpack_num_bdigits_generic(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
 {
-    /* BITSPERDIG = SIZEOF_BDIGITS * CHAR_BIT */
+    /* BITSPERDIG = SIZEOF_BDIGIT * CHAR_BIT */
     /* num_bits = (wordsize * CHAR_BIT - nails) * numwords */
-    /* num_bdigits = (num_bits + BITSPERDIG - 1) / BITSPERDIG */
+    /* num_bdigits = roomof(num_bits, BITSPERDIG) */
 
     /* num_bits = CHAR_BIT * (wordsize * numwords) - nails * numwords = CHAR_BIT * num_bytes1 - nails * numwords */
     size_t num_bytes1 = wordsize * numwords;
@@ -1165,6 +1055,7 @@ integer_unpack_num_bdigits(size_t numwords, size_t wordsize, size_t nails, int *
             size_t num_bdigits1 = integer_unpack_num_bdigits_generic(numwords, wordsize, nails, &nlp_bits1);
             assert(num_bdigits == num_bdigits1);
             assert(*nlp_bits_ret == nlp_bits1);
+            (void)num_bdigits1;
         }
 #endif
     }
@@ -1192,7 +1083,7 @@ integer_unpack_single_bdigit(BDIGIT u, size_t size, int flags, BDIGIT *dp)
     int sign;
     if (flags & INTEGER_PACK_2COMP) {
         sign = (flags & INTEGER_PACK_NEGATIVE) ?
-            ((size == SIZEOF_BDIGITS && u == 0) ? -2 : -1) :
+            ((size == SIZEOF_BDIGIT && u == 0) ? -2 : -1) :
             ((u >> (size * CHAR_BIT - 1)) ? -1 : 1);
         if (sign < 0) {
             u |= LSHIFTX(BDIGMAX, size * CHAR_BIT);
@@ -1205,6 +1096,13 @@ integer_unpack_single_bdigit(BDIGIT u, size_t size, int flags, BDIGIT *dp)
     return sign;
 }
 
+#ifdef HAVE_BUILTIN___BUILTIN_ASSUME_ALIGNED
+#define reinterpret_cast(type, value) (type) \
+    __builtin_assume_aligned((value), sizeof(*(type)NULL));
+#else
+#define reinterpret_cast(type, value) (type)value
+#endif
+
 static int
 bary_unpack_internal(BDIGIT *bdigits, size_t num_bdigits, const void *words, size_t numwords, size_t wordsize, size_t nails, int flags, int nlp_bits)
 {
@@ -1224,31 +1122,32 @@ bary_unpack_internal(BDIGIT *bdigits, size_t num_bdigits, const void *words, siz
             if (wordsize == 1) {
                 return integer_unpack_single_bdigit(*(uint8_t *)buf, sizeof(uint8_t), flags, dp);
             }
-#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGITS
-            if (wordsize == 2 && (uintptr_t)words % ALIGNOF(uint16_t) == 0) {
-                uint16_t u = *(uint16_t *)buf;
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+            if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
+                uint16_t u = *reinterpret_cast(const uint16_t *, buf);
                 return integer_unpack_single_bdigit(need_swap ? swap16(u) : u, sizeof(uint16_t), flags, dp);
             }
 #endif
-#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGITS
-            if (wordsize == 4 && (uintptr_t)words % ALIGNOF(uint32_t) == 0) {
-                uint32_t u = *(uint32_t *)buf;
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+            if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
+                uint32_t u = *reinterpret_cast(const uint32_t *, buf);
                 return integer_unpack_single_bdigit(need_swap ? swap32(u) : u, sizeof(uint32_t), flags, dp);
             }
 #endif
-#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGITS
-            if (wordsize == 8 && (uintptr_t)words % ALIGNOF(uint64_t) == 0) {
-                uint64_t u = *(uint64_t *)buf;
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+            if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
+                uint64_t u = *reinterpret_cast(const uint64_t *, buf);
                 return integer_unpack_single_bdigit(need_swap ? swap64(u) : u, sizeof(uint64_t), flags, dp);
             }
 #endif
+#undef reinterpret_cast
         }
 #if !defined(WORDS_BIGENDIAN)
-        if (nails == 0 && SIZEOF_BDIGITS == sizeof(BDIGIT) &&
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
             (flags & INTEGER_PACK_WORDORDER_MASK) == INTEGER_PACK_LSWORD_FIRST &&
             (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_MSBYTE_FIRST) {
             size_t src_size = numwords * wordsize;
-            size_t dst_size = num_bdigits * SIZEOF_BDIGITS;
+            size_t dst_size = num_bdigits * SIZEOF_BDIGIT;
             MEMCPY(dp, words, char, src_size);
             if (flags & INTEGER_PACK_2COMP) {
                 if (flags & INTEGER_PACK_NEGATIVE) {
@@ -1274,9 +1173,9 @@ bary_unpack_internal(BDIGIT *bdigits, size_t num_bdigits, const void *words, siz
             return sign;
         }
 #endif
-        if (nails == 0 && SIZEOF_BDIGITS == sizeof(BDIGIT) &&
-            wordsize % SIZEOF_BDIGITS == 0) {
-            size_t bdigits_per_word = wordsize / SIZEOF_BDIGITS;
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            wordsize % SIZEOF_BDIGIT == 0) {
+            size_t bdigits_per_word = wordsize / SIZEOF_BDIGIT;
             int mswordfirst_p = (flags & INTEGER_PACK_MSWORD_FIRST) != 0;
             int msbytefirst_p = (flags & INTEGER_PACK_NATIVE_BYTE_ORDER) ? HOST_BIGENDIAN_P :
                 (flags & INTEGER_PACK_MSBYTE_FIRST) != 0;
@@ -1451,9 +1350,9 @@ bary_subb(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yd
 
     num = borrow ? -1 : 0;
     for (i = 0; i < sn; i++) {
-	num += (BDIGIT_DBL_SIGNED)xds[i] - yds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        num += (BDIGIT_DBL_SIGNED)xds[i] - yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     if (yn <= xn) {
         for (; i < xn; i++) {
@@ -1472,7 +1371,7 @@ bary_subb(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yd
     }
     if (num == 0) goto num_is_zero;
     for (; i < zn; i++) {
-	zds[i] = BDIGMAX;
+        zds[i] = BDIGMAX;
     }
     return 1;
 
@@ -1480,10 +1379,10 @@ bary_subb(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yd
     if (xds == zds && xn == zn)
         return 0;
     for (; i < xn; i++) {
-	zds[i] = xds[i];
+        zds[i] = xds[i];
     }
     for (; i < zn; i++) {
-	zds[i] = 0;
+        zds[i] = 0;
     }
     return 0;
 }
@@ -1510,27 +1409,27 @@ bary_addc(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yd
     assert(yn <= zn);
 
     if (xn > yn) {
-	const BDIGIT *tds;
-	tds = xds; xds = yds; yds = tds;
-	i = xn; xn = yn; yn = i;
+        const BDIGIT *tds;
+        tds = xds; xds = yds; yds = tds;
+        i = xn; xn = yn; yn = i;
     }
 
     num = carry ? 1 : 0;
     for (i = 0; i < xn; i++) {
-	num += (BDIGIT_DBL)xds[i] + yds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        num += (BDIGIT_DBL)xds[i] + yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     for (; i < yn; i++) {
         if (num == 0) goto num_is_zero;
-	num += yds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        num += yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     for (; i < zn; i++) {
         if (num == 0) goto num_is_zero;
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     return num != 0;
 
@@ -1538,10 +1437,10 @@ bary_addc(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yd
     if (yds == zds && yn == zn)
         return 0;
     for (; i < yn; i++) {
-	zds[i] = yds[i];
+        zds[i] = yds[i];
     }
     for (; i < zn; i++) {
-	zds[i] = 0;
+        zds[i] = 0;
     }
     return 0;
 }
@@ -1557,7 +1456,9 @@ bary_add_one(BDIGIT *ds, size_t n)
 {
     size_t i;
     for (i = 0; i < n; i++) {
-	ds[i] = BIGLO(ds[i]+1);
+        BDIGIT_DBL n = ds[i];
+        n += 1;
+        ds[i] = BIGLO(n);
         if (ds[i] != 0)
             return 0;
     }
@@ -1565,31 +1466,31 @@ bary_add_one(BDIGIT *ds, size_t n)
 }
 
 static void
-bary_mul_single(BDIGIT *zds, size_t zl, BDIGIT x, BDIGIT y)
+bary_mul_single(BDIGIT *zds, size_t zn, BDIGIT x, BDIGIT y)
 {
     BDIGIT_DBL n;
 
-    assert(2 <= zl);
+    assert(2 <= zn);
 
     n = (BDIGIT_DBL)x * y;
     bdigitdbl2bary(zds, 2, n);
-    BDIGITS_ZERO(zds + 2, zl - 2);
+    BDIGITS_ZERO(zds + 2, zn - 2);
 }
 
 static int
-bary_muladd_1xN(BDIGIT *zds, size_t zl, BDIGIT x, const BDIGIT *yds, size_t yl)
+bary_muladd_1xN(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
 {
     BDIGIT_DBL n;
     BDIGIT_DBL dd;
     size_t j;
 
-    assert(zl > yl);
+    assert(zn > yn);
 
     if (x == 0)
         return 0;
     dd = x;
     n = 0;
-    for (j = 0; j < yl; j++) {
+    for (j = 0; j < yn; j++) {
         BDIGIT_DBL ee = n + dd * yds[j];
         if (ee) {
             n = zds[j] + ee;
@@ -1601,7 +1502,7 @@ bary_muladd_1xN(BDIGIT *zds, size_t zl, BDIGIT x, const BDIGIT *yds, size_t yl)
         }
 
     }
-    for (; j < zl; j++) {
+    for (; j < zn; j++) {
         if (n == 0)
             break;
         n += zds[j];
@@ -1625,15 +1526,16 @@ bigdivrem_mulsub(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
     i = 0;
 
     do {
-        BDIGIT_DBL ee;
+        BDIGIT_DBL_SIGNED ee;
         t2 += (BDIGIT_DBL)yds[i] * x;
         ee = num - BIGLO(t2);
-        num = (BDIGIT_DBL)zds[i] + ee;
+        num = (BDIGIT_DBL_SIGNED)zds[i] + ee;
         if (ee) zds[i] = BIGLO(num);
         num = BIGDN(num);
         t2 = BIGDN(t2);
     } while (++i < yn);
-    num += zds[i] - t2; /* borrow from high digit; don't update */
+    num -= (BDIGIT_DBL_SIGNED)t2;
+    num += (BDIGIT_DBL_SIGNED)zds[yn]; /* borrow from high digit; don't update */
     return num;
 }
 
@@ -1652,23 +1554,23 @@ bary_mulsub_1xN(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
 }
 
 static void
-bary_mul_normal(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl)
+bary_mul_normal(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
 {
     size_t i;
 
-    assert(xl + yl <= zl);
+    assert(xn + yn <= zn);
 
-    BDIGITS_ZERO(zds, zl);
-    for (i = 0; i < xl; i++) {
-        bary_muladd_1xN(zds+i, zl-i, xds[i], yds, yl);
+    BDIGITS_ZERO(zds, zn);
+    for (i = 0; i < xn; i++) {
+        bary_muladd_1xN(zds+i, zn-i, xds[i], yds, yn);
     }
 }
 
 VALUE
 rb_big_mul_normal(VALUE x, VALUE y)
 {
-    size_t xn = RBIGNUM_LEN(x), yn = RBIGNUM_LEN(y), zn = xn + yn;
-    VALUE z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
     bary_mul_normal(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn);
     RB_GC_GUARD(x);
     RB_GC_GUARD(y);
@@ -1677,7 +1579,7 @@ rb_big_mul_normal(VALUE x, VALUE y)
 
 /* efficient squaring (2 times faster than normal multiplication)
  * ref: Handbook of Applied Cryptography, Algorithm 14.16
- *      http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf
+ *      https://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf
  */
 static void
 bary_sq_fast(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn)
@@ -1695,30 +1597,30 @@ bary_sq_fast(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn)
         return;
 
     for (i = 0; i < xn-1; i++) {
-	v = (BDIGIT_DBL)xds[i];
-	if (!v)
+        v = (BDIGIT_DBL)xds[i];
+        if (!v)
             continue;
-	c = (BDIGIT_DBL)zds[i + i] + v * v;
-	zds[i + i] = BIGLO(c);
-	c = BIGDN(c);
-	v *= 2;
+        c = (BDIGIT_DBL)zds[i + i] + v * v;
+        zds[i + i] = BIGLO(c);
+        c = BIGDN(c);
+        v *= 2;
         vl = BIGLO(v);
         vh = (int)BIGDN(v);
-	for (j = i + 1; j < xn; j++) {
-	    w = (BDIGIT_DBL)xds[j];
-	    c += (BDIGIT_DBL)zds[i + j] + vl * w;
-	    zds[i + j] = BIGLO(c);
-	    c = BIGDN(c);
-	    if (vh)
+        for (j = i + 1; j < xn; j++) {
+            w = (BDIGIT_DBL)xds[j];
+            c += (BDIGIT_DBL)zds[i + j] + vl * w;
+            zds[i + j] = BIGLO(c);
+            c = BIGDN(c);
+            if (vh)
                 c += w;
-	}
-	if (c) {
-	    c += (BDIGIT_DBL)zds[i + xn];
-	    zds[i + xn] = BIGLO(c);
-	    c = BIGDN(c);
+        }
+        if (c) {
+            c += (BDIGIT_DBL)zds[i + xn];
+            zds[i + xn] = BIGLO(c);
+            c = BIGDN(c);
             if (c)
                 zds[i + xn + 1] += (BDIGIT)c;
-	}
+        }
     }
 
     /* i == xn-1 */
@@ -1736,57 +1638,81 @@ bary_sq_fast(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn)
 VALUE
 rb_big_sq_fast(VALUE x)
 {
-    size_t xn = RBIGNUM_LEN(x), zn = 2 * xn;
+    size_t xn = BIGNUM_LEN(x), zn = 2 * xn;
     VALUE z = bignew(zn, 1);
     bary_sq_fast(BDIGITS(z), zn, BDIGITS(x), xn);
     RB_GC_GUARD(x);
     return z;
 }
 
+static inline size_t
+max_size(size_t a, size_t b)
+{
+    return (a > b ? a : b);
+}
+
 /* balancing multiplication by slicing larger argument */
 static void
-bary_mul_balance_with_mulfunc(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl, mulfunc_t *mulfunc)
+bary_mul_balance_with_mulfunc(BDIGIT *const zds, const size_t zn,
+                              const BDIGIT *const xds, const size_t xn,
+                              const BDIGIT *const yds, const size_t yn,
+                              BDIGIT *wds, size_t wn, mulfunc_t *const mulfunc)
 {
     VALUE work = 0;
-    size_t yl0 = yl;
-    size_t r, n;
+    size_t n;
 
-    assert(xl + yl <= zl);
-    assert(xl <= yl);
-    assert(!KARATSUBA_BALANCED(xl, yl) || !TOOM3_BALANCED(xl, yl));
+    assert(xn + yn <= zn);
+    assert(xn <= yn);
+    assert(!KARATSUBA_BALANCED(xn, yn) || !TOOM3_BALANCED(xn, yn));
 
-    BDIGITS_ZERO(zds, xl);
+    BDIGITS_ZERO(zds, xn);
+
+    if (wn < xn) {
+        /* The condition when a new buffer is needed:
+         * 1. (2(xn+r) > zn-(yn-r)) => (2xn+r > zn-yn), at the last
+         *    iteration (or r == 0)
+         * 2. (2(xn+xn) > zn-(yn-r-xn)) => (3xn-r > zn-yn), at the
+         *    previous iteration.
+         */
+        const size_t r = yn % xn;
+        if (2*xn + yn + max_size(xn-r, r) > zn) {
+            wn = xn;
+            wds = ALLOCV_N(BDIGIT, work, wn);
+        }
+    }
 
     n = 0;
-    while (yl > 0) {
-        BDIGIT *tds;
-        size_t tl;
-	r = xl > yl ? yl : xl;
-        tl = xl + r;
-        if (2 * (xl + r) <= zl - n) {
-            tds = zds + n + xl + r;
-            mulfunc(tds, tl, xds, xl, yds + n, r, wds, wl);
-            BDIGITS_ZERO(zds + n + xl, r);
-            bary_add(zds + n, tl,
-                     zds + n, tl,
-                     tds, tl);
+    while (yn > n) {
+        const size_t r = (xn > (yn - n) ? (yn - n) : xn);
+        const size_t tn = (xn + r);
+        if (2 * (xn + r) <= zn - n) {
+            BDIGIT *const tds = zds + n + xn + r;
+            mulfunc(tds, tn, xds, xn, yds + n, r, wds, wn);
+            BDIGITS_ZERO(zds + n + xn, r);
+            bary_add(zds + n, tn,
+                     zds + n, tn,
+                     tds, tn);
         }
         else {
-            if (wl < xl) {
-                wl = xl;
-                wds = ALLOCV_N(BDIGIT, work, wl);
+            BDIGIT *const tds = zds + n;
+            if (wn < xn) {
+                /* xn is invariant, only once here */
+#if 0
+                wn = xn;
+                wds = ALLOCV_N(BDIGIT, work, wn);
+#else
+                rb_bug("wds is not enough: %" PRIdSIZE " for %" PRIdSIZE, wn, xn);
+#endif
             }
-            tds = zds + n;
-            MEMCPY(wds, zds + n, BDIGIT, xl);
-            mulfunc(tds, tl, xds, xl, yds + n, r, wds-xl, wl-xl);
-            bary_add(zds + n, tl,
-                     zds + n, tl,
-                     wds, xl);
+            MEMCPY(wds, zds + n, BDIGIT, xn);
+            mulfunc(tds, tn, xds, xn, yds + n, r, wds+xn, wn-xn);
+            bary_add(zds + n, tn,
+                     zds + n, tn,
+                     wds, xn);
         }
-	yl -= r;
-	n += r;
+        n += r;
     }
-    BDIGITS_ZERO(zds+xl+yl0, zl - (xl+yl0));
+    BDIGITS_ZERO(zds+xn+yn, zn - (xn+yn));
 
     if (work)
         ALLOCV_END(work);
@@ -1795,8 +1721,8 @@ bary_mul_balance_with_mulfunc(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t
 VALUE
 rb_big_mul_balance(VALUE x, VALUE y)
 {
-    size_t xn = RBIGNUM_LEN(x), yn = RBIGNUM_LEN(y), zn = xn + yn;
-    VALUE z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
     bary_mul_balance_with_mulfunc(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0, bary_mul_toom3_start);
     RB_GC_GUARD(x);
     RB_GC_GUARD(y);
@@ -1805,7 +1731,7 @@ rb_big_mul_balance(VALUE x, VALUE y)
 
 /* multiplication by karatsuba method */
 static void
-bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl)
+bary_mul_karatsuba(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
     VALUE work = 0;
 
@@ -1819,34 +1745,34 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
     const BDIGIT *xds0, *xds1, *yds0, *yds1;
     BDIGIT *zds0, *zds1, *zds2, *zds3;
 
-    assert(xl + yl <= zl);
-    assert(xl <= yl);
-    assert(yl < 2 * xl);
+    assert(xn + yn <= zn);
+    assert(xn <= yn);
+    assert(yn < 2 * xn);
 
-    sq = xds == yds && xl == yl;
+    sq = xds == yds && xn == yn;
 
-    if (yl & 1) {
+    if (yn & 1) {
         odd_y = 1;
-        yl--;
-        if (yl < xl) {
+        yn--;
+        if (yn < xn) {
             odd_xy = 1;
-            xl--;
+            xn--;
         }
     }
 
-    n = yl / 2;
+    n = yn / 2;
 
-    assert(n < xl);
+    assert(n < xn);
 
-    if (wl < n) {
+    if (wn < n) {
         /* This function itself needs only n BDIGITs for work area.
          * However this function calls bary_mul_karatsuba and
          * bary_mul_balance recursively.
          * 2n BDIGITs are enough to avoid allocations in
          * the recursively called functions.
          */
-        wl = 2*n;
-        wds = ALLOCV_N(BDIGIT, work, wl);
+        wn = 2*n;
+        wds = ALLOCV_N(BDIGIT, work, wn);
     }
 
     /* Karatsuba algorithm:
@@ -1873,7 +1799,7 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
     /* zds0:? zds1:? zds2:? zds3:? wds:? */
 
-    if (bary_sub(zds0, n, xds, n, xds+n, xl-n)) {
+    if (bary_sub(zds0, n, xds, n, xds+n, xn-n)) {
         bary_2comp(zds0, n);
         sub_p = !sub_p;
     }
@@ -1882,7 +1808,7 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
     if (sq) {
         sub_p = 1;
-        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, zds0, n, wds, wl);
+        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, zds0, n, wds, wn);
     }
     else {
         if (bary_sub(wds, n, yds, n, yds+n, n)) {
@@ -1892,7 +1818,7 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
         /* zds0:|x1-x0| zds1:? zds2:? zds3:? wds:|y1-y0| */
 
-        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, wds, n, wds+n, wl-n);
+        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, wds, n, wds+n, wn-n);
     }
 
     /* zds0:|x1-x0| zds1,zds2:|x1-x0|*|y1-y0| zds3:? wds:|y1-y0| */
@@ -1907,7 +1833,7 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
     /* zds0:|x1-x0| zds1,zds2:-?|x1-x0|*|y1-y0| zds3:? wds:lo(-?|x1-x0|*|y1-y0|) */
 
-    bary_mul_karatsuba_start(zds0, 2*n, xds0, n, yds0, n, wds+n, wl-n);
+    bary_mul_karatsuba_start(zds0, 2*n, xds0, n, yds0, n, wds+n, wn-n);
 
     /* zds0,zds1:x0*y0 zds2:hi(-?|x1-x0|*|y1-y0|) zds3:? wds:lo(-?|x1-x0|*|y1-y0|) */
 
@@ -1924,7 +1850,7 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
     /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2:_ zds3:? wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
 
-    bary_mul_karatsuba_start(zds2, zl-2*n, xds1, xl-n, yds1, n, wds+n, wl-n);
+    bary_mul_karatsuba_start(zds2, zn-2*n, xds1, xn-n, yds1, n, wds+n, wn-n);
 
     /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2,zds3:x1*y1 wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
 
@@ -1932,41 +1858,41 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 
     /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1 wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
 
-    carry3 = bary_addc(zds2, n, zds2, n, zds3, (4*n < zl ? n : zl-3*n), carry3);
+    carry3 = bary_addc(zds2, n, zds2, n, zds3, (4*n < zn ? n : zn-3*n), carry3);
 
     /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1+hi(x1*y1) wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
 
-    bary_add(zds2, zl-2*n, zds2, zl-2*n, wds, n);
+    bary_add(zds2, zn-2*n, zds2, zn-2*n, wds, n);
 
     /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1+hi(x1*y1)+hi(x0*y0-?|x1-x0|*|y1-y0|) wds:_ */
 
     if (carry2)
-        bary_add_one(zds2, zl-2*n);
+        bary_add_one(zds2, zn-2*n);
 
     if (carry1 + carry3 - borrow < 0)
-        bary_sub_one(zds3, zl-3*n);
+        bary_sub_one(zds3, zn-3*n);
     else if (carry1 + carry3 - borrow > 0) {
         BDIGIT c = carry1 + carry3 - borrow;
-        bary_add(zds3, zl-3*n, zds3, zl-3*n, &c, 1);
+        bary_add(zds3, zn-3*n, zds3, zn-3*n, &c, 1);
     }
 
     /*
-    if (SIZEOF_BDIGITS * zl <= 16) {
+    if (SIZEOF_BDIGIT * zn <= 16) {
         uint128_t z, x, y;
         ssize_t i;
-        for (x = 0, i = xl-1; 0 <= i; i--) { x <<= SIZEOF_BDIGITS*CHAR_BIT; x |= xds[i]; }
-        for (y = 0, i = yl-1; 0 <= i; i--) { y <<= SIZEOF_BDIGITS*CHAR_BIT; y |= yds[i]; }
-        for (z = 0, i = zl-1; 0 <= i; i--) { z <<= SIZEOF_BDIGITS*CHAR_BIT; z |= zds[i]; }
+        for (x = 0, i = xn-1; 0 <= i; i--) { x <<= SIZEOF_BDIGIT*CHAR_BIT; x |= xds[i]; }
+        for (y = 0, i = yn-1; 0 <= i; i--) { y <<= SIZEOF_BDIGIT*CHAR_BIT; y |= yds[i]; }
+        for (z = 0, i = zn-1; 0 <= i; i--) { z <<= SIZEOF_BDIGIT*CHAR_BIT; z |= zds[i]; }
         assert(z == x * y);
     }
     */
 
     if (odd_xy) {
-        bary_muladd_1xN(zds+yl, zl-yl, yds[yl], xds, xl);
-        bary_muladd_1xN(zds+xl, zl-xl, xds[xl], yds, yl+1);
+        bary_muladd_1xN(zds+yn, zn-yn, yds[yn], xds, xn);
+        bary_muladd_1xN(zds+xn, zn-xn, xds[xn], yds, yn+1);
     }
     else if (odd_y) {
-        bary_muladd_1xN(zds+yl, zl-yl, yds[yl], xds, xl);
+        bary_muladd_1xN(zds+yn, zn-yn, yds[yn], xds, xn);
     }
 
     if (work)
@@ -1976,9 +1902,9 @@ bary_mul_karatsuba(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const B
 VALUE
 rb_big_mul_karatsuba(VALUE x, VALUE y)
 {
-    size_t xn = RBIGNUM_LEN(x), yn = RBIGNUM_LEN(y), zn = xn + yn;
-    VALUE z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    if (!(xn <= yn && yn < 2 || KARATSUBA_BALANCED(xn, yn)))
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    if (!((xn <= yn && yn < 2) || KARATSUBA_BALANCED(xn, yn)))
         rb_raise(rb_eArgError, "unexpected bignum length for karatsuba");
     bary_mul_karatsuba(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0);
     RB_GC_GUARD(x);
@@ -1993,7 +1919,7 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
     size_t wnc;
     VALUE work = 0;
 
-    /* "p" means "positive".  Actually "non-negative", though. */
+    /* "p" stands for "positive".  Actually it means "non-negative", though. */
     size_t x0n; const BDIGIT *x0ds;
     size_t x1n; const BDIGIT *x1ds;
     size_t x2n; const BDIGIT *x2ds;
@@ -2019,7 +1945,7 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
     size_t z1n; BDIGIT *z1ds; int z1p;
     size_t z2n; BDIGIT *z2ds; int z2p;
     size_t z3n; BDIGIT *z3ds; int z3p;
-    size_t z4n; BDIGIT *z4ds; int z4p;
+    size_t z4n; BDIGIT *z4ds;
 
     size_t zzn; BDIGIT *zzds;
 
@@ -2103,7 +2029,7 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
     }
 
     /*
-     * ref. http://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication
+     * ref. https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication
      *
      * x(b) = x0 * b^0 + x1 * b^1 + x2 * b^2
      * y(b) = y0 * b^0 + y1 * b^1 + y2 * b^2
@@ -2176,21 +2102,21 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
         v3n = u3n; v3ds = u3ds; v3p = u3p;
     }
     else {
-	/* v1 <- y0 + y2 */
+        /* v1 <- y0 + y2 */
         bary_add(v1ds, v1n, y0ds, y0n, y2ds, y2n);
         v1p = 1;
 
-	/* y(-1) : v2 <- v1 - y1 = y0 - y1 + y2 */
+        /* y(-1) : v2 <- v1 - y1 = y0 - y1 + y2 */
         v2p = 1;
         if (bary_sub(v2ds, v2n, v1ds, v1n, y1ds, y1n)) {
             bary_2comp(v2ds, v2n);
             v2p = 0;
         }
 
-	/* y(1) : v1 <- v1 + y1 = y0 + y1 + y2 */
+        /* y(1) : v1 <- v1 + y1 = y0 + y1 + y2 */
         bary_add(v1ds, v1n, v1ds, v1n, y1ds, y1n);
 
-	/* y(-2) : v3 <- 2 * (v2 + y2) - y0 = y0 - 2 * (y1 - 2 * y2) */
+        /* y(-2) : v3 <- 2 * (v2 + y2) - y0 = y0 - 2 * (y1 - 2 * y2) */
         v3p = 1;
         if (v2p) {
             bary_add(v3ds, v3n, v2ds, v2n, y2ds, y2n);
@@ -2243,7 +2169,7 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
     z0n = t0n; z0ds = t0ds;
 
     /* z4 <- z(inf) == t4 */
-    z4n = t4n; z4ds = t4ds; z4p = t4p;
+    z4n = t4n; z4ds = t4ds;
 
     /* z3 <- (z(-2) - z(1)) / 3 == (t3 - t1) / 3 */
     if (t3p == t1p) {
@@ -2346,7 +2272,9 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
      */
 
     MEMCPY(zzds, z0ds, BDIGIT, z0n);
-    BDIGITS_ZERO(zzds + z0n, zzn - z0n);
+    BDIGITS_ZERO(zzds + z0n, 4*n - z0n);
+    MEMCPY(zzds + 4*n, z4ds, BDIGIT, z4n);
+    BDIGITS_ZERO(zzds + 4*n + z4n, zzn - (4*n + z4n));
     if (z1p)
         bary_add(zzds +   n, zzn -   n, zzds +   n, zzn -   n, z1ds, z1n);
     else
@@ -2359,13 +2287,8 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
         bary_add(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
     else
         bary_sub(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
-    if (z4p)
-        bary_add(zzds + 4*n, zzn - 4*n, zzds + 4*n, zzn - 4*n, z4ds, z4n);
-    else
-        bary_sub(zzds + 4*n, zzn - 4*n, zzds + 4*n, zzn - 4*n, z4ds, z4n);
 
-    while (0 < zzn && zzds[zzn-1] == 0)
-        zzn--;
+    BARY_TRUNC(zzds, zzn);
     MEMCPY(zds, zzds, BDIGIT, zzn);
     BDIGITS_ZERO(zds + zzn, zn - zzn);
 
@@ -2376,8 +2299,8 @@ bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGI
 VALUE
 rb_big_mul_toom3(VALUE x, VALUE y)
 {
-    size_t xn = RBIGNUM_LEN(x), yn = RBIGNUM_LEN(y), zn = xn + yn;
-    VALUE z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
     if (xn > yn || yn < 3 || !TOOM3_BALANCED(xn,yn))
         rb_raise(rb_eArgError, "unexpected bignum length for toom3");
     bary_mul_toom3(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0);
@@ -2386,16 +2309,69 @@ rb_big_mul_toom3(VALUE x, VALUE y)
     return z;
 }
 
+#if USE_GMP
+static inline void
+bdigits_to_mpz(mpz_t mp, const BDIGIT *digits, size_t len)
+{
+    const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
+    mpz_import(mp, len, -1, sizeof(BDIGIT), 0, nails, digits);
+}
+
+static inline void
+bdigits_from_mpz(mpz_t mp, BDIGIT *digits, size_t *len)
+{
+    const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
+    mpz_export(digits, len, -1, sizeof(BDIGIT), 0, nails, mp);
+}
+
 static void
-bary_mul1(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl)
+bary_mul_gmp(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
 {
-    assert(xl + yl <= zl);
+    mpz_t x, y, z;
+    size_t count;
 
-    if (xl == 1 && yl == 1) {
-        bary_mul_single(zds, zl, xds[0], yds[0]);
+    assert(xn + yn <= zn);
+
+    mpz_init(x);
+    mpz_init(y);
+    mpz_init(z);
+    bdigits_to_mpz(x, xds, xn);
+    if (xds == yds && xn == yn) {
+        mpz_mul(z, x, x);
     }
     else {
-        bary_mul_normal(zds, zl, xds, xl, yds, yl);
+        bdigits_to_mpz(y, yds, yn);
+        mpz_mul(z, x, y);
+    }
+    bdigits_from_mpz(z, zds, &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(x);
+    mpz_clear(y);
+    mpz_clear(z);
+}
+
+VALUE
+rb_big_mul_gmp(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    bary_mul_gmp(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+#endif
+
+static void
+bary_short_mul(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    assert(xn + yn <= zn);
+
+    if (xn == 1 && yn == 1) {
+        bary_mul_single(zds, zn, xds[0], yds[0]);
+    }
+    else {
+        bary_mul_normal(zds, zn, xds, xn, yds, yn);
         rb_thread_check_ints();
     }
 }
@@ -2406,57 +2382,57 @@ bary_sparse_p(const BDIGIT *ds, size_t n)
 {
     long c = 0;
 
-    if (          ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
-    if (c <= 1 && ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
-    if (c <= 1 && ds[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
+    if (          ds[2 * n / 5]) c++;
+    if (c <= 1 && ds[    n / 2]) c++;
+    if (c <= 1 && ds[3 * n / 5]) c++;
 
     return (c <= 1) ? 1 : 0;
 }
 
 static int
-bary_mul_precheck(BDIGIT **zdsp, size_t *zlp, const BDIGIT **xdsp, size_t *xlp, const BDIGIT **ydsp, size_t *ylp)
+bary_mul_precheck(BDIGIT **zdsp, size_t *znp, const BDIGIT **xdsp, size_t *xnp, const BDIGIT **ydsp, size_t *ynp)
 {
     size_t nlsz; /* number of least significant zero BDIGITs */
 
     BDIGIT *zds = *zdsp;
-    size_t zl = *zlp;
+    size_t zn = *znp;
     const BDIGIT *xds = *xdsp;
-    size_t xl = *xlp;
+    size_t xn = *xnp;
     const BDIGIT *yds = *ydsp;
-    size_t yl = *ylp;
+    size_t yn = *ynp;
 
-    assert(xl + yl <= zl);
+    assert(xn + yn <= zn);
 
     nlsz = 0;
 
-    while (0 < xl) {
-        if (xds[xl-1] == 0) {
-            xl--;
+    while (0 < xn) {
+        if (xds[xn-1] == 0) {
+            xn--;
         }
         else {
             do {
                 if (xds[0] != 0)
                     break;
                 xds++;
-                xl--;
+                xn--;
                 nlsz++;
-            } while (0 < xl);
+            } while (0 < xn);
             break;
         }
     }
 
-    while (0 < yl) {
-        if (yds[yl-1] == 0) {
-            yl--;
+    while (0 < yn) {
+        if (yds[yn-1] == 0) {
+            yn--;
         }
         else {
             do {
-                if (xds[0] != 0)
+                if (yds[0] != 0)
                     break;
                 yds++;
-                yl--;
+                yn--;
                 nlsz++;
-            } while (0 < yl);
+            } while (0 < yn);
             break;
         }
     }
@@ -2464,141 +2440,149 @@ bary_mul_precheck(BDIGIT **zdsp, size_t *zlp, const BDIGIT **xdsp, size_t *xlp,
     if (nlsz) {
         BDIGITS_ZERO(zds, nlsz);
         zds += nlsz;
-        zl -= nlsz;
+        zn -= nlsz;
     }
 
     /* make sure that y is longer than x */
-    if (xl > yl) {
+    if (xn > yn) {
         const BDIGIT *tds;
-        size_t tl;
-	tds = xds; xds = yds; yds = tds;
-	tl = xl; xl = yl; yl = tl;
+        size_t tn;
+        tds = xds; xds = yds; yds = tds;
+        tn = xn; xn = yn; yn = tn;
     }
-    assert(xl <= yl);
+    assert(xn <= yn);
 
-    if (xl <= 1) {
-        if (xl == 0) {
-            BDIGITS_ZERO(zds, zl);
+    if (xn <= 1) {
+        if (xn == 0) {
+            BDIGITS_ZERO(zds, zn);
             return 1;
         }
 
         if (xds[0] == 1) {
-            MEMCPY(zds, yds, BDIGIT, yl);
-            BDIGITS_ZERO(zds+yl, zl-yl);
+            MEMCPY(zds, yds, BDIGIT, yn);
+            BDIGITS_ZERO(zds+yn, zn-yn);
             return 1;
         }
         if (POW2_P(xds[0])) {
-            zds[yl] = bary_small_lshift(zds, yds, yl, bitsize(xds[0])-1);
-            BDIGITS_ZERO(zds+yl+1, zl-yl-1);
+            zds[yn] = bary_small_lshift(zds, yds, yn, bit_length(xds[0])-1);
+            BDIGITS_ZERO(zds+yn+1, zn-yn-1);
             return 1;
         }
-        if (yl == 1 && yds[0] == 1) {
+        if (yn == 1 && yds[0] == 1) {
             zds[0] = xds[0];
-            BDIGITS_ZERO(zds+1, zl-1);
+            BDIGITS_ZERO(zds+1, zn-1);
             return 1;
         }
-        bary_mul_normal(zds, zl, xds, xl, yds, yl);
+        bary_mul_normal(zds, zn, xds, xn, yds, yn);
         return 1;
     }
 
     *zdsp = zds;
-    *zlp = zl;
+    *znp = zn;
     *xdsp = xds;
-    *xlp = xl;
+    *xnp = xn;
     *ydsp = yds;
-    *ylp = yl;
+    *ynp = yn;
 
     return 0;
 }
 
 static void
-bary_mul_karatsuba_branch(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl)
+bary_mul_karatsuba_branch(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
     /* normal multiplication when x is small */
-    if (xl < KARATSUBA_MUL_DIGITS) {
-      normal:
-        if (xds == yds && xl == yl)
-            bary_sq_fast(zds, zl, xds, xl);
-        else
-            bary_mul1(zds, zl, xds, xl, yds, yl);
-        return;
+    if (xn < KARATSUBA_MUL_DIGITS) {
+        goto normal;
     }
 
     /* normal multiplication when x or y is a sparse bignum */
-    if (bary_sparse_p(xds, xl)) goto normal;
-    if (bary_sparse_p(yds, yl)) {
-        bary_mul1(zds, zl, yds, yl, xds, xl);
+    if (bary_sparse_p(xds, xn)) goto normal;
+    if (bary_sparse_p(yds, yn)) {
+        bary_short_mul(zds, zn, yds, yn, xds, xn);
         return;
     }
 
     /* balance multiplication by slicing y when x is much smaller than y */
-    if (!KARATSUBA_BALANCED(xl, yl)) {
-        bary_mul_balance_with_mulfunc(zds, zl, xds, xl, yds, yl, wds, wl, bary_mul_karatsuba_start);
+    if (!KARATSUBA_BALANCED(xn, yn)) {
+        bary_mul_balance_with_mulfunc(zds, zn, xds, xn, yds, yn, wds, wn, bary_mul_karatsuba_start);
         return;
     }
 
     /* multiplication by karatsuba method */
-    bary_mul_karatsuba(zds, zl, xds, xl, yds, yl, wds, wl);
+    bary_mul_karatsuba(zds, zn, xds, xn, yds, yn, wds, wn);
+    return;
+
+  normal:
+    if (xds == yds && xn == yn) {
+        bary_sq_fast(zds, zn, xds, xn);
+    }
+    else {
+        bary_short_mul(zds, zn, xds, xn, yds, yn);
+    }
 }
 
 static void
-bary_mul_karatsuba_start(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl)
+bary_mul_karatsuba_start(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
-    if (bary_mul_precheck(&zds, &zl, &xds, &xl, &yds, &yl))
+    if (bary_mul_precheck(&zds, &zn, &xds, &xn, &yds, &yn))
         return;
 
-    bary_mul_karatsuba_branch(zds, zl, xds, xl, yds, yl, wds, wl);
+    bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
 }
 
 static void
-bary_mul_toom3_branch(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl)
+bary_mul_toom3_branch(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
-    if (xl < TOOM3_MUL_DIGITS) {
-        bary_mul_karatsuba_branch(zds, zl, xds, xl, yds, yl, wds, wl);
+    if (xn < TOOM3_MUL_DIGITS) {
+        bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
         return;
     }
 
-    if (!TOOM3_BALANCED(xl, yl)) {
-        bary_mul_balance_with_mulfunc(zds, zl, xds, xl, yds, yl, wds, wl, bary_mul_toom3_start);
+    if (!TOOM3_BALANCED(xn, yn)) {
+        bary_mul_balance_with_mulfunc(zds, zn, xds, xn, yds, yn, wds, wn, bary_mul_toom3_start);
         return;
     }
 
-    bary_mul_toom3(zds, zl, xds, xl, yds, yl, wds, wl);
+    bary_mul_toom3(zds, zn, xds, xn, yds, yn, wds, wn);
 }
 
 static void
-bary_mul_toom3_start(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl, BDIGIT *wds, size_t wl)
+bary_mul_toom3_start(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
-    if (bary_mul_precheck(&zds, &zl, &xds, &xl, &yds, &yl))
+    if (bary_mul_precheck(&zds, &zn, &xds, &xn, &yds, &yn))
         return;
 
-    bary_mul_toom3_branch(zds, zl, xds, xl, yds, yl, wds, wl);
+    bary_mul_toom3_branch(zds, zn, xds, xn, yds, yn, wds, wn);
 }
 
 static void
-bary_mul(BDIGIT *zds, size_t zl, const BDIGIT *xds, size_t xl, const BDIGIT *yds, size_t yl)
+bary_mul(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
 {
-    if (xl <= yl) {
-        if (xl < KARATSUBA_MUL_DIGITS) {
-            if (xds == yds && xl == yl)
-                bary_sq_fast(zds, zl, xds, xl);
+    if (xn <= yn) {
+        if (xn < NAIVE_MUL_DIGITS) {
+            if (xds == yds && xn == yn)
+                bary_sq_fast(zds, zn, xds, xn);
             else
-                bary_mul1(zds, zl, xds, xl, yds, yl);
+                bary_short_mul(zds, zn, xds, xn, yds, yn);
             return;
         }
     }
     else {
-        if (yl < KARATSUBA_MUL_DIGITS) {
-            bary_mul1(zds, zl, yds, yl, xds, xl);
+        if (yn < NAIVE_MUL_DIGITS) {
+            bary_short_mul(zds, zn, yds, yn, xds, xn);
             return;
         }
     }
 
-    bary_mul_toom3_start(zds, zl, xds, xl, yds, yl, NULL, 0);
+#if USE_GMP
+    bary_mul_gmp(zds, zn, xds, xn, yds, yn);
+#else
+    bary_mul_toom3_start(zds, zn, xds, xn, yds, yn, NULL, 0);
+#endif
 }
 
 struct big_div_struct {
-    long nx, ny, j, nyzero;
+    size_t yn, zn;
     BDIGIT *yds, *zds;
     volatile VALUE stop;
 };
@@ -2607,38 +2591,38 @@ static void *
 bigdivrem1(void *ptr)
 {
     struct big_div_struct *bds = (struct big_div_struct*)ptr;
-    long ny = bds->ny;
-    long j;
-    long nyzero = bds->nyzero;
+    size_t yn = bds->yn;
+    size_t zn = bds->zn;
     BDIGIT *yds = bds->yds, *zds = bds->zds;
     BDIGIT_DBL_SIGNED num;
     BDIGIT q;
 
-    j = bds->j;
     do {
-	if (bds->stop) {
-	    bds->j = j;
-	    return 0;
-        }
-	if (zds[j] == yds[ny-1]) q = BDIGMAX;
-	else q = (BDIGIT)((BIGUP(zds[j]) + zds[j-1])/yds[ny-1]);
-	if (q) {
-            num = bigdivrem_mulsub(zds+j-(ny-nyzero), ny-nyzero+1,
+        if (bds->stop) {
+            bds->zn = zn;
+            return 0;
+        }
+        if (zds[zn-1] == yds[yn-1]) q = BDIGMAX;
+        else q = (BDIGIT)((BIGUP(zds[zn-1]) + zds[zn-2])/yds[yn-1]);
+        if (q) {
+            num = bigdivrem_mulsub(zds+zn-(yn+1), yn+1,
                                    q,
-                                   yds+nyzero, ny-nyzero);
-	    while (num) { /* "add back" required */
-		q--;
-                num = bary_add(zds+j-(ny-nyzero), ny-nyzero,
-                               zds+j-(ny-nyzero), ny-nyzero,
-                               yds+nyzero, ny-nyzero);
+                                   yds, yn);
+            while (num) { /* "add back" required */
+                q--;
+                num = bary_add(zds+zn-(yn+1), yn,
+                               zds+zn-(yn+1), yn,
+                               yds, yn);
                 num--;
-	    }
-	}
-	zds[j] = q;
-    } while (--j >= ny);
+            }
+        }
+        zn--;
+        zds[zn] = q;
+    } while (zn > yn);
     return 0;
 }
 
+/* async-signal-safe */
 static void
 rb_big_stop(void *ptr)
 {
@@ -2646,189 +2630,317 @@ rb_big_stop(void *ptr)
     bds->stop = Qtrue;
 }
 
-static inline int
-bigdivrem_num_extra_words(long nx, long ny)
+static BDIGIT
+bigdivrem_single1(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT x_higher_bdigit, BDIGIT y)
 {
-    int ret = nx==ny ? 2 : 1;
-    assert(ret <= BIGDIVREM_EXTRA_WORDS);
-    return ret;
+    assert(0 < xn);
+    assert(x_higher_bdigit < y);
+    if (POW2_P(y)) {
+        BDIGIT r;
+        r = xds[0] & (y-1);
+        bary_small_rshift(qds, xds, xn, bit_length(y)-1, x_higher_bdigit);
+        return r;
+    }
+    else {
+        size_t i;
+        BDIGIT_DBL t2;
+        t2 = x_higher_bdigit;
+        for (i = 0; i < xn; i++) {
+            t2 = BIGUP(t2) + xds[xn - i - 1];
+            qds[xn - i - 1] = (BDIGIT)(t2 / y);
+            t2 %= y;
+        }
+        return (BDIGIT)t2;
+    }
 }
 
 static BDIGIT
-bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, long nx, BDIGIT y)
+bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT y)
 {
-    long i;
-    BDIGIT_DBL t2;
-    t2 = 0;
-    i = nx;
-    while (i--) {
-        t2 = BIGUP(t2) + xds[i];
-        qds[i] = (BDIGIT)(t2 / y);
-        t2 %= y;
-    }
-    return (BDIGIT)t2;
+    return bigdivrem_single1(qds, xds, xn, 0, y);
 }
 
 static void
-bigdivrem_normal(BDIGIT *zds, long nz, const BDIGIT *xds, long nx, BDIGIT *yds, long ny, int needs_mod)
+bigdivrem_restoring(BDIGIT *zds, size_t zn, BDIGIT *yds, size_t yn)
 {
     struct big_div_struct bds;
-    BDIGIT q;
+    size_t ynzero;
+
+    assert(yn < zn);
+    assert(BDIGIT_MSB(yds[yn-1]));
+    assert(zds[zn-1] < yds[yn-1]);
+
+    for (ynzero = 0; !yds[ynzero]; ynzero++);
+
+    if (ynzero+1 == yn) {
+        BDIGIT r;
+        r = bigdivrem_single1(zds+yn, zds+ynzero, zn-yn, zds[zn-1], yds[ynzero]);
+        zds[ynzero] = r;
+        return;
+    }
+
+    bds.yn = yn - ynzero;
+    bds.zds = zds + ynzero;
+    bds.yds = yds + ynzero;
+    bds.stop = Qfalse;
+    bds.zn = zn - ynzero;
+    if (bds.zn > 10000 || bds.yn > 10000) {
+      retry:
+        bds.stop = Qfalse;
+        rb_nogvl(bigdivrem1, &bds, rb_big_stop, &bds, RB_NOGVL_UBF_ASYNC_SAFE);
+
+        if (bds.stop == Qtrue) {
+            /* execute trap handler, but exception was not raised. */
+            goto retry;
+        }
+    }
+    else {
+        bigdivrem1(&bds);
+    }
+}
+
+static void
+bary_divmod_normal(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
     int shift;
+    BDIGIT *zds, *yyds;
+    size_t zn;
+    VALUE tmpyz = 0;
+
+    assert(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    assert(qds ? (xn - yn + 1) <= qn : 1);
+    assert(rds ? yn <= rn : 1);
+
+    zn = xn + BIGDIVREM_EXTRA_WORDS;
 
-    q = yds[ny-1];
-    shift = nlz(q);
+    shift = nlz(yds[yn-1]);
     if (shift) {
-        bary_small_lshift(yds, yds, ny, shift);
-        zds[nx] = bary_small_lshift(zds, xds, nx, shift);
+        int alloc_y = !rds;
+        int alloc_z = !qds || qn < zn;
+        if (alloc_y && alloc_z) {
+            yyds = ALLOCV_N(BDIGIT, tmpyz, yn+zn);
+            zds = yyds + yn;
+        }
+        else {
+            yyds = alloc_y ? ALLOCV_N(BDIGIT, tmpyz, yn) : rds;
+            zds = alloc_z ? ALLOCV_N(BDIGIT, tmpyz, zn) : qds;
+        }
+        zds[xn] = bary_small_lshift(zds, xds, xn, shift);
+        bary_small_lshift(yyds, yds, yn, shift);
     }
     else {
-        MEMCPY(zds, xds, BDIGIT, nx);
-	zds[nx] = 0;
+        if (qds && zn <= qn)
+            zds = qds;
+        else
+            zds = ALLOCV_N(BDIGIT, tmpyz, zn);
+        MEMCPY(zds, xds, BDIGIT, xn);
+        zds[xn] = 0;
+        /* bigdivrem_restoring will not modify y.
+         * So use yds directly.  */
+        yyds = (BDIGIT *)yds;
     }
-    if (nx+1 < nz) zds[nx+1] = 0;
 
-    bds.nx = nx;
-    bds.ny = ny;
-    bds.zds = zds;
-    bds.yds = yds;
-    bds.stop = Qfalse;
-    bds.j = nz - 1;
-    for (bds.nyzero = 0; !yds[bds.nyzero]; bds.nyzero++);
-    if (nx > 10000 || ny > 10000) {
-      retry:
-	bds.stop = Qfalse;
-	rb_thread_call_without_gvl(bigdivrem1, &bds, rb_big_stop, &bds);
+    bigdivrem_restoring(zds, zn, yyds, yn);
+
+    if (rds) {
+        if (shift)
+            bary_small_rshift(rds, zds, yn, shift, 0);
+        else
+            MEMCPY(rds, zds, BDIGIT, yn);
+        BDIGITS_ZERO(rds+yn, rn-yn);
+    }
+
+    if (qds) {
+        size_t j = zn - yn;
+        MEMMOVE(qds, zds+yn, BDIGIT, j);
+        BDIGITS_ZERO(qds+j, qn-j);
+    }
+
+    if (tmpyz)
+        ALLOCV_END(tmpyz);
+}
+
+VALUE
+rb_big_divrem_normal(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), qn, rn;
+    BDIGIT *xds = BDIGITS(x), *yds = BDIGITS(y), *qds, *rds;
+    VALUE q, r;
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1]))
+        return rb_assoc_new(LONG2FIX(0), x);
+
+    qn = xn + BIGDIVREM_EXTRA_WORDS;
+    q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    qds = BDIGITS(q);
+
+    rn = yn;
+    r = bignew(rn, BIGNUM_SIGN(x));
+    rds = BDIGITS(r);
+
+    bary_divmod_normal(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    bigtrunc(q);
+    bigtrunc(r);
 
-	if (bds.stop == Qtrue) {
-	    /* execute trap handler, but exception was not raised. */
-	    goto retry;
-	}
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+
+    return rb_assoc_new(q, r);
+}
+
+#if USE_GMP
+static void
+bary_divmod_gmp(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    mpz_t x, y, q, r;
+    size_t count;
+
+    assert(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    assert(qds ? (xn - yn + 1) <= qn : 1);
+    assert(rds ? yn <= rn : 1);
+    assert(qds || rds);
+
+    mpz_init(x);
+    mpz_init(y);
+    if (qds) mpz_init(q);
+    if (rds) mpz_init(r);
+
+    bdigits_to_mpz(x, xds, xn);
+    bdigits_to_mpz(y, yds, yn);
+
+    if (!rds) {
+        mpz_fdiv_q(q, x, y);
+    }
+    else if (!qds) {
+        mpz_fdiv_r(r, x, y);
     }
     else {
-	bigdivrem1(&bds);
+        mpz_fdiv_qr(q, r, x, y);
+    }
+
+    mpz_clear(x);
+    mpz_clear(y);
+
+    if (qds) {
+        bdigits_from_mpz(q, qds, &count);
+        BDIGITS_ZERO(qds+count, qn-count);
+        mpz_clear(q);
     }
 
-    if (needs_mod && shift) {
-        bary_small_rshift(zds, zds, ny, shift, 0);
+    if (rds) {
+        bdigits_from_mpz(r, rds, &count);
+        BDIGITS_ZERO(rds+count, rn-count);
+        mpz_clear(r);
+    }
+}
+
+VALUE
+rb_big_divrem_gmp(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), qn, rn;
+    BDIGIT *xds = BDIGITS(x), *yds = BDIGITS(y), *qds, *rds;
+    VALUE q, r;
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1]))
+        return rb_assoc_new(LONG2FIX(0), x);
+
+    qn = xn - yn + 1;
+    q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    qds = BDIGITS(q);
+
+    rn = yn;
+    r = bignew(rn, BIGNUM_SIGN(x));
+    rds = BDIGITS(r);
+
+    bary_divmod_gmp(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    bigtrunc(q);
+    bigtrunc(r);
+
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+
+    return rb_assoc_new(q, r);
+}
+#endif
+
+static void
+bary_divmod_branch(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+#if USE_GMP
+    if (GMP_DIV_DIGITS < xn) {
+        bary_divmod_gmp(qds, qn, rds, rn, xds, xn, yds, yn);
+        return;
     }
+#endif
+    bary_divmod_normal(qds, qn, rds, rn, xds, xn, yds, yn);
 }
 
 static void
-bary_divmod(BDIGIT *qds, size_t nq, BDIGIT *rds, size_t nr, const BDIGIT *xds, size_t nx, const BDIGIT *yds, size_t ny)
+bary_divmod(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
 {
-    assert(nx <= nq);
-    assert(ny <= nr);
+    assert(xn <= qn);
+    assert(yn <= rn);
 
-    while (0 < ny && !yds[ny-1]) ny--;
-    if (ny == 0)
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
         rb_num_zerodiv();
 
-    while (0 < nx && !xds[nx-1]) nx--;
-    if (nx == 0) {
-        BDIGITS_ZERO(qds, nq);
-        BDIGITS_ZERO(rds, nr);
+    BARY_TRUNC(xds, xn);
+    if (xn == 0) {
+        BDIGITS_ZERO(qds, qn);
+        BDIGITS_ZERO(rds, rn);
         return;
     }
 
-    if (nx < ny || (nx == ny && xds[nx - 1] < yds[ny - 1])) {
-        MEMCPY(rds, xds, BDIGIT, nx);
-        BDIGITS_ZERO(rds+nx, nr-nx);
-        BDIGITS_ZERO(qds, nq);
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1])) {
+        MEMCPY(rds, xds, BDIGIT, xn);
+        BDIGITS_ZERO(rds+xn, rn-xn);
+        BDIGITS_ZERO(qds, qn);
     }
-    else if (ny == 1) {
-        MEMCPY(qds, xds, BDIGIT, nx);
-        BDIGITS_ZERO(qds+nx, nq-nx);
-        rds[0] = bigdivrem_single(qds, xds, nx, yds[0]);
-        BDIGITS_ZERO(rds+1, nr-1);
+    else if (yn == 1) {
+        MEMCPY(qds, xds, BDIGIT, xn);
+        BDIGITS_ZERO(qds+xn, qn-xn);
+        rds[0] = bigdivrem_single(qds, xds, xn, yds[0]);
+        BDIGITS_ZERO(rds+1, rn-1);
     }
-    else if (nx == 2 && ny == 2) {
+    else if (xn == 2 && yn == 2) {
         BDIGIT_DBL x = bary2bdigitdbl(xds, 2);
         BDIGIT_DBL y = bary2bdigitdbl(yds, 2);
         BDIGIT_DBL q = x / y;
         BDIGIT_DBL r = x % y;
         qds[0] = BIGLO(q);
         qds[1] = BIGLO(BIGDN(q));
-        BDIGITS_ZERO(qds+2, nq-2);
+        BDIGITS_ZERO(qds+2, qn-2);
         rds[0] = BIGLO(r);
         rds[1] = BIGLO(BIGDN(r));
-        BDIGITS_ZERO(rds+2, nr-2);
+        BDIGITS_ZERO(rds+2, rn-2);
     }
     else {
-        int extra_words;
-        long j;
-        long nz;
-        BDIGIT *zds;
-        VALUE tmpz = 0;
-        BDIGIT *tds;
-
-        extra_words = bigdivrem_num_extra_words(nx, ny);
-        nz = nx + extra_words;
-        if (nx + extra_words <= nq)
-            zds = qds;
-        else
-            zds = ALLOCV_N(BDIGIT, tmpz, nx + extra_words);
-        MEMCPY(zds, xds, BDIGIT, nx);
-        BDIGITS_ZERO(zds+nx, nz-nx);
-
-        if (BDIGIT_MSB(yds[ny-1])) {
-            /* bigdivrem_normal will not modify y.
-             * So use yds directly.  */
-            tds = (BDIGIT *)yds;
-        }
-        else {
-            /* bigdivrem_normal will modify y.
-             * So use rds as a temporary buffer.  */
-            MEMCPY(rds, yds, BDIGIT, ny);
-            tds = rds;
-        }
-
-        bigdivrem_normal(zds, nz, xds, nx, tds, ny, 1);
-
-        /* copy remainder */
-        MEMCPY(rds, zds, BDIGIT, ny);
-        BDIGITS_ZERO(rds+ny, nr-ny);
-
-        /* move quotient */
-        j = nz - ny;
-        MEMMOVE(qds, zds+ny, BDIGIT, j);
-        BDIGITS_ZERO(qds+j, nq-j);
-
-        if (tmpz)
-            ALLOCV_END(tmpz);
+        bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
     }
 }
 
 
-#define BIGNUM_DEBUG 0
-#if BIGNUM_DEBUG
-#define ON_DEBUG(x) do { x; } while (0)
-static void
-dump_bignum(VALUE x)
-{
-    long i;
-    printf("%c0x0", RBIGNUM_SIGN(x) ? '+' : '-');
-    for (i = RBIGNUM_LEN(x); i--; ) {
-        printf("_%0*"PRIxBDIGIT, SIZEOF_BDIGITS*2, BDIGITS(x)[i]);
-    }
-    printf(", len=%lu", RBIGNUM_LEN(x));
-    puts("");
-}
-
-static VALUE
-rb_big_dump(VALUE x)
-{
-    dump_bignum(x);
-    return x;
-}
-#else
-#define ON_DEBUG(x)
+#ifndef BIGNUM_DEBUG
+# define BIGNUM_DEBUG (0+RUBY_DEBUG)
 #endif
 
 static int
 bigzero_p(VALUE x)
 {
-    return bary_zero_p(BDIGITS(x), RBIGNUM_LEN(x));
+    return bary_zero_p(BDIGITS(x), BIGNUM_LEN(x));
 }
 
 int
@@ -2841,7 +2953,7 @@ int
 rb_cmpint(VALUE val, VALUE a, VALUE b)
 {
     if (NIL_P(val)) {
-	rb_cmperr(a, b);
+        rb_cmperr(a, b);
     }
     if (FIXNUM_P(val)) {
         long l = FIX2LONG(val);
@@ -2849,83 +2961,86 @@ rb_cmpint(VALUE val, VALUE a, VALUE b)
         if (l < 0) return -1;
         return 0;
     }
-    if (RB_TYPE_P(val, T_BIGNUM)) {
-	if (BIGZEROP(val)) return 0;
-	if (RBIGNUM_SIGN(val)) return 1;
-	return -1;
+    if (RB_BIGNUM_TYPE_P(val)) {
+        if (BIGZEROP(val)) return 0;
+        if (BIGNUM_SIGN(val)) return 1;
+        return -1;
     }
     if (RTEST(rb_funcall(val, '>', 1, INT2FIX(0)))) return 1;
     if (RTEST(rb_funcall(val, '<', 1, INT2FIX(0)))) return -1;
     return 0;
 }
 
-#define RBIGNUM_SET_LEN(b,l) \
-    ((RBASIC(b)->flags & RBIGNUM_EMBED_FLAG) ? \
+#define BIGNUM_SET_LEN(b,l) \
+    (BIGNUM_EMBED_P(b) ? \
      (void)(RBASIC(b)->flags = \
-	    (RBASIC(b)->flags & ~RBIGNUM_EMBED_LEN_MASK) | \
-	    ((l) << RBIGNUM_EMBED_LEN_SHIFT)) : \
+            (RBASIC(b)->flags & ~BIGNUM_EMBED_LEN_MASK) | \
+            ((l) << BIGNUM_EMBED_LEN_SHIFT)) : \
      (void)(RBIGNUM(b)->as.heap.len = (l)))
 
 static void
-rb_big_realloc(VALUE big, long len)
+rb_big_realloc(VALUE big, size_t len)
 {
     BDIGIT *ds;
-    if (RBASIC(big)->flags & RBIGNUM_EMBED_FLAG) {
-	if (RBIGNUM_EMBED_LEN_MAX < len) {
-	    ds = ALLOC_N(BDIGIT, len);
-	    MEMCPY(ds, RBIGNUM(big)->as.ary, BDIGIT, RBIGNUM_EMBED_LEN_MAX);
-	    RBIGNUM(big)->as.heap.len = RBIGNUM_LEN(big);
-	    RBIGNUM(big)->as.heap.digits = ds;
-	    RBASIC(big)->flags &= ~RBIGNUM_EMBED_FLAG;
-	}
+    if (BIGNUM_EMBED_P(big)) {
+        if (BIGNUM_EMBED_LEN_MAX < len) {
+            ds = ALLOC_N(BDIGIT, len);
+            MEMCPY(ds, RBIGNUM(big)->as.ary, BDIGIT, BIGNUM_EMBED_LEN_MAX);
+            RBIGNUM(big)->as.heap.len = BIGNUM_LEN(big);
+            RBIGNUM(big)->as.heap.digits = ds;
+            FL_UNSET_RAW(big, BIGNUM_EMBED_FLAG);
+        }
     }
     else {
-	if (len <= RBIGNUM_EMBED_LEN_MAX) {
-	    ds = RBIGNUM(big)->as.heap.digits;
-	    RBASIC(big)->flags |= RBIGNUM_EMBED_FLAG;
-	    RBIGNUM_SET_LEN(big, len);
-	    if (ds) {
-		MEMCPY(RBIGNUM(big)->as.ary, ds, BDIGIT, len);
-		xfree(ds);
-	    }
-	}
-	else {
-	    if (RBIGNUM_LEN(big) == 0) {
-		RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
-	    }
-	    else {
-		REALLOC_N(RBIGNUM(big)->as.heap.digits, BDIGIT, len);
-	    }
-	}
+        if (len <= BIGNUM_EMBED_LEN_MAX) {
+            ds = RBIGNUM(big)->as.heap.digits;
+            FL_SET_RAW(big, BIGNUM_EMBED_FLAG);
+            BIGNUM_SET_LEN(big, len);
+            (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)RBIGNUM(big)->as.ary, sizeof(RBIGNUM(big)->as.ary));
+            if (ds) {
+                MEMCPY(RBIGNUM(big)->as.ary, ds, BDIGIT, len);
+                xfree(ds);
+            }
+        }
+        else {
+            if (BIGNUM_LEN(big) == 0) {
+                RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
+            }
+            else {
+                REALLOC_N(RBIGNUM(big)->as.heap.digits, BDIGIT, len);
+            }
+        }
     }
 }
 
 void
-rb_big_resize(VALUE big, long len)
+rb_big_resize(VALUE big, size_t len)
 {
     rb_big_realloc(big, len);
-    RBIGNUM_SET_LEN(big, len);
+    BIGNUM_SET_LEN(big, len);
 }
 
 static VALUE
-bignew_1(VALUE klass, long len, int sign)
+bignew_1(VALUE klass, size_t len, int sign)
 {
     NEWOBJ_OF(big, struct RBignum, klass, T_BIGNUM | (RGENGC_WB_PROTECTED_BIGNUM ? FL_WB_PROTECTED : 0));
-    RBIGNUM_SET_SIGN(big, sign?1:0);
-    if (len <= RBIGNUM_EMBED_LEN_MAX) {
-	RBASIC(big)->flags |= RBIGNUM_EMBED_FLAG;
-	RBIGNUM_SET_LEN(big, len);
+    VALUE bigv = (VALUE)big;
+    BIGNUM_SET_SIGN(bigv, sign);
+    if (len <= BIGNUM_EMBED_LEN_MAX) {
+        FL_SET_RAW(bigv, BIGNUM_EMBED_FLAG);
+        BIGNUM_SET_LEN(bigv, len);
+        (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)big->as.ary, sizeof(big->as.ary));
     }
     else {
-	RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
-	RBIGNUM(big)->as.heap.len = len;
+        big->as.heap.digits = ALLOC_N(BDIGIT, len);
+        big->as.heap.len = len;
     }
-    OBJ_FREEZE(big);
-    return (VALUE)big;
+    OBJ_FREEZE(bigv);
+    return bigv;
 }
 
 VALUE
-rb_big_new(long len, int sign)
+rb_big_new(size_t len, int sign)
 {
     return bignew(len, sign != 0);
 }
@@ -2933,8 +3048,8 @@ rb_big_new(long len, int sign)
 VALUE
 rb_big_clone(VALUE x)
 {
-    long len = RBIGNUM_LEN(x);
-    VALUE z = bignew_1(CLASS_OF(x), len, RBIGNUM_SIGN(x));
+    size_t len = BIGNUM_LEN(x);
+    VALUE z = bignew_1(CLASS_OF(x), len, BIGNUM_SIGN(x));
 
     MEMCPY(BDIGITS(z), BDIGITS(x), BDIGIT, len);
     return z;
@@ -2943,15 +3058,15 @@ rb_big_clone(VALUE x)
 static void
 big_extend_carry(VALUE x)
 {
-    rb_big_resize(x, RBIGNUM_LEN(x)+1);
-    BDIGITS(x)[RBIGNUM_LEN(x)-1] = 1;
+    rb_big_resize(x, BIGNUM_LEN(x)+1);
+    BDIGITS(x)[BIGNUM_LEN(x)-1] = 1;
 }
 
 /* modify a bignum by 2's complement */
 static void
 get2comp(VALUE x)
 {
-    long i = RBIGNUM_LEN(x);
+    long i = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
 
     if (bary_2comp(ds, i)) {
@@ -2969,19 +3084,18 @@ static BDIGIT
 abs2twocomp(VALUE *xp, long *n_ret)
 {
     VALUE x = *xp;
-    long n = RBIGNUM_LEN(x);
+    long n = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
     BDIGIT hibits = 0;
 
-    while (0 < n && ds[n-1] == 0)
-        n--;
+    BARY_TRUNC(ds, n);
 
-    if (n != 0 && RBIGNUM_NEGATIVE_P(x)) {
+    if (n != 0 && BIGNUM_NEGATIVE_P(x)) {
         VALUE z = bignew_1(CLASS_OF(x), n, 0);
         MEMCPY(BDIGITS(z), ds, BDIGIT, n);
         bary_2comp(BDIGITS(z), n);
         hibits = BDIGMAX;
-	*xp = z;
+        *xp = z;
     }
     *n_ret = n;
     return hibits;
@@ -2990,7 +3104,7 @@ abs2twocomp(VALUE *xp, long *n_ret)
 static void
 twocomp2abs_bang(VALUE x, int hibits)
 {
-    RBIGNUM_SET_SIGN(x, !hibits);
+    BIGNUM_SET_SIGN(x, !hibits);
     if (hibits) {
         get2comp(x);
     }
@@ -2999,13 +3113,13 @@ twocomp2abs_bang(VALUE x, int hibits)
 static inline VALUE
 bigtrunc(VALUE x)
 {
-    long len = RBIGNUM_LEN(x);
+    size_t len = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
 
     if (len == 0) return x;
     while (--len && !ds[len]);
-    if (RBIGNUM_LEN(x) > len+1) {
-	rb_big_resize(x, len+1);
+    if (BIGNUM_LEN(x) > len+1) {
+        rb_big_resize(x, len+1);
     }
     return x;
 }
@@ -3013,37 +3127,36 @@ bigtrunc(VALUE x)
 static inline VALUE
 bigfixize(VALUE x)
 {
-    size_t len = RBIGNUM_LEN(x);
+    size_t n = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     unsigned long u;
 #else
     BDIGIT u;
 #endif
 
-    while (0 < len && ds[len-1] == 0)
-        len--;
+    BARY_TRUNC(ds, n);
 
-    if (len == 0) return INT2FIX(0);
+    if (n == 0) return INT2FIX(0);
 
-#if SIZEOF_BDIGITS < SIZEOF_LONG
-    if (sizeof(long)/SIZEOF_BDIGITS < len)
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (sizeof(long)/SIZEOF_BDIGIT < n)
         goto return_big;
     else {
-        int i = (int)len;
+        int i = (int)n;
         u = 0;
         while (i--) {
             u = (unsigned long)(BIGUP(u) + ds[i]);
         }
     }
-#else /* SIZEOF_BDIGITS >= SIZEOF_LONG */
-    if (1 < len)
+#else /* SIZEOF_BDIGIT >= SIZEOF_LONG */
+    if (1 < n)
         goto return_big;
     else
         u = ds[0];
 #endif
 
-    if (RBIGNUM_POSITIVE_P(x)) {
+    if (BIGNUM_POSITIVE_P(x)) {
         if (POSFIXABLE(u)) return LONG2FIX((long)u);
     }
     else {
@@ -3051,15 +3164,15 @@ bigfixize(VALUE x)
     }
 
   return_big:
-    rb_big_resize(x, len);
+    rb_big_resize(x, n);
     return x;
 }
 
 static VALUE
 bignorm(VALUE x)
 {
-    if (RB_TYPE_P(x, T_BIGNUM)) {
-	x = bigfixize(x);
+    if (RB_BIGNUM_TYPE_P(x)) {
+        x = bigfixize(x);
     }
     return x;
 }
@@ -3071,29 +3184,29 @@ rb_big_norm(VALUE x)
 }
 
 VALUE
-rb_uint2big(VALUE n)
+rb_uint2big(uintptr_t n)
 {
     long i;
     VALUE big = bignew(bdigit_roomof(SIZEOF_VALUE), 1);
     BDIGIT *digits = BDIGITS(big);
 
-#if SIZEOF_BDIGITS >= SIZEOF_VALUE
+#if SIZEOF_BDIGIT >= SIZEOF_VALUE
     digits[0] = n;
 #else
     for (i = 0; i < bdigit_roomof(SIZEOF_VALUE); i++) {
-	digits[i] = BIGLO(n);
-	n = BIGDN(n);
+        digits[i] = BIGLO(n);
+        n = BIGDN(n);
     }
 #endif
 
     i = bdigit_roomof(SIZEOF_VALUE);
     while (--i && !digits[i]) ;
-    RBIGNUM_SET_LEN(big, i+1);
+    BIGNUM_SET_LEN(big, i+1);
     return big;
 }
 
 VALUE
-rb_int2big(SIGNED_VALUE n)
+rb_int2big(intptr_t n)
 {
     long neg = 0;
     VALUE u;
@@ -3101,27 +3214,27 @@ rb_int2big(SIGNED_VALUE n)
 
     if (n < 0) {
         u = 1 + (VALUE)(-(n + 1)); /* u = -n avoiding overflow */
-	neg = 1;
+        neg = 1;
     }
     else {
         u = n;
     }
     big = rb_uint2big(u);
     if (neg) {
-	RBIGNUM_SET_SIGN(big, 0);
+        BIGNUM_SET_NEGATIVE_SIGN(big);
     }
     return big;
 }
 
 VALUE
-rb_uint2inum(VALUE n)
+rb_uint2inum(uintptr_t n)
 {
     if (POSFIXABLE(n)) return LONG2FIX(n);
     return rb_uint2big(n);
 }
 
 VALUE
-rb_int2inum(SIGNED_VALUE n)
+rb_int2inum(intptr_t n)
 {
     if (FIXABLE(n)) return LONG2FIX(n);
     return rb_int2big(n);
@@ -3175,7 +3288,7 @@ rb_absint_size(VALUE val, int *nlz_bits_ret)
         if (v < 0) {
             v = -v;
         }
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
         fixbuf[0] = v;
 #else
         {
@@ -3191,7 +3304,7 @@ rb_absint_size(VALUE val, int *nlz_bits_ret)
     }
     else {
         dp = BDIGITS(val);
-        de = dp + RBIGNUM_LEN(val);
+        de = dp + BIGNUM_LEN(val);
     }
     while (dp < de && de[-1] == 0)
         de--;
@@ -3203,7 +3316,7 @@ rb_absint_size(VALUE val, int *nlz_bits_ret)
     num_leading_zeros = nlz(de[-1]);
     if (nlz_bits_ret)
         *nlz_bits_ret = num_leading_zeros % CHAR_BIT;
-    return (de - dp) * SIZEOF_BDIGITS - num_leading_zeros / CHAR_BIT;
+    return (de - dp) * SIZEOF_BDIGIT - num_leading_zeros / CHAR_BIT;
 }
 
 static size_t
@@ -3226,7 +3339,7 @@ absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_num
     static const BDIGIT char_bit[1] = { CHAR_BIT };
     BDIGIT numbytes_bary[bdigit_roomof(sizeof(numbytes))];
     BDIGIT val_numbits_bary[bdigit_roomof(sizeof(numbytes) + 1)];
-    BDIGIT nlz_bits_in_msbyte_bary[1] = { nlz_bits_in_msbyte };
+    BDIGIT nlz_bits_in_msbyte_bary[1];
     BDIGIT word_numbits_bary[bdigit_roomof(sizeof(word_numbits))];
     BDIGIT div_bary[numberof(val_numbits_bary) + BIGDIVREM_EXTRA_WORDS];
     BDIGIT mod_bary[numberof(word_numbits_bary)];
@@ -3236,6 +3349,8 @@ absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_num
     int sign;
     size_t numwords;
 
+    nlz_bits_in_msbyte_bary[0] = nlz_bits_in_msbyte;
+
     /*
      * val_numbits = numbytes * CHAR_BIT - nlz_bits_in_msbyte
      * div, mod = val_numbits.divmod(word_numbits)
@@ -3245,7 +3360,7 @@ absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_num
 
     bary_unpack(BARY_ARGS(numbytes_bary), &numbytes, 1, sizeof(numbytes), 0,
         INTEGER_PACK_NATIVE_BYTE_ORDER);
-    BARY_MUL1(val_numbits_bary, numbytes_bary, char_bit);
+    BARY_SHORT_MUL(val_numbits_bary, numbytes_bary, char_bit);
     if (nlz_bits_in_msbyte)
         BARY_SUB(val_numbits_bary, val_numbits_bary, nlz_bits_in_msbyte_bary);
     bary_unpack(BARY_ARGS(word_numbits_bary), &word_numbits, 1, sizeof(word_numbits), 0,
@@ -3263,8 +3378,12 @@ absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_num
     sign = bary_pack(+1, BARY_ARGS(div_bary), &numwords, 1, sizeof(numwords), 0,
         INTEGER_PACK_NATIVE_BYTE_ORDER);
 
-    if (sign == 2)
+    if (sign == 2) {
+#if defined __GNUC__ && (__GNUC__ == 4 && __GNUC_MINOR__ == 4)
+        *nlz_bits_ret = 0;
+#endif
         return (size_t)-1;
+    }
     *nlz_bits_ret = nlz_bits;
     return numwords;
 }
@@ -3294,7 +3413,7 @@ rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret)
     size_t numbytes;
     int nlz_bits_in_msbyte;
     size_t numwords;
-    size_t nlz_bits;
+    size_t nlz_bits = 0;
 
     if (word_numbits == 0)
         return (size_t)-1;
@@ -3309,6 +3428,7 @@ rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret)
             numwords0 = absint_numwords_generic(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits0);
             assert(numwords0 == numwords);
             assert(nlz_bits0 == nlz_bits);
+            (void)numwords0;
         }
 #endif
     }
@@ -3336,7 +3456,7 @@ rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret)
  * represent val in two's complement number, without sign bit.
  *
  *   size_t size;
- *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : RBIGNUM_NEGATIVE_P(val);
+ *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : BIGNUM_NEGATIVE_P(val);
  *   size = rb_absint_numwords(val, 1, NULL)
  *   if (size == (size_t)-1) ...overflow...
  *   if (neg && rb_absint_singlebit_p(val))
@@ -3346,7 +3466,7 @@ rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret)
  * represent val in two's complement number, with sign bit.
  *
  *   size_t size;
- *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : RBIGNUM_NEGATIVE_P(val);
+ *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : BIGNUM_NEGATIVE_P(val);
  *   int nlz_bits;
  *   size = rb_absint_size(val, &nlz_bits);
  *   if (nlz_bits == 0 && !(neg && rb_absint_singlebit_p(val)))
@@ -3367,7 +3487,7 @@ rb_absint_singlebit_p(VALUE val)
         if (v < 0) {
             v = -v;
         }
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
         fixbuf[0] = v;
 #else
         {
@@ -3383,7 +3503,7 @@ rb_absint_singlebit_p(VALUE val)
     }
     else {
         dp = BDIGITS(val);
-        de = dp + RBIGNUM_LEN(val);
+        de = dp + BIGNUM_LEN(val);
     }
     while (dp < de && de[-1] == 0)
         de--;
@@ -3472,7 +3592,7 @@ rb_integer_pack(VALUE val, void *words, size_t numwords, size_t wordsize, size_t
         else {
             sign = 1;
         }
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
         fixbuf[0] = v;
 #else
         {
@@ -3487,16 +3607,16 @@ rb_integer_pack(VALUE val, void *words, size_t numwords, size_t wordsize, size_t
         num_bdigits = numberof(fixbuf);
     }
     else {
-        sign = RBIGNUM_POSITIVE_P(val) ? 1 : -1;
+        sign = BIGNUM_POSITIVE_P(val) ? 1 : -1;
         ds = BDIGITS(val);
-        num_bdigits = RBIGNUM_LEN(val);
+        num_bdigits = BIGNUM_LEN(val);
     }
 
     return bary_pack(sign, ds, num_bdigits, words, numwords, wordsize, nails, flags);
 }
 
 /*
- * Import an integer into a buffer.
+ * Import an integer from a buffer.
  *
  * [words] buffer to import.
  * [numwords] the size of given buffer as number of words.
@@ -3580,7 +3700,7 @@ rb_integer_unpack(const void *words, size_t numwords, size_t wordsize, size_t na
         }
         else if (num_bdigits == numberof(fixbuf)) {
             val = bignew((long)num_bdigits+1, 0);
-	    MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
+            MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
             BDIGITS(val)[num_bdigits++] = 1;
         }
         else {
@@ -3592,370 +3712,756 @@ rb_integer_unpack(const void *words, size_t numwords, size_t wordsize, size_t na
         BDIGIT_DBL u = fixbuf[0] + BIGUP(fixbuf[1]);
         if (u == 0)
             return LONG2FIX(0);
-	if (0 < sign && POSFIXABLE(u))
-            return LONG2FIX(u);
-	if (sign < 0 && BDIGIT_MSB(fixbuf[1]) == 0 &&
+        if (0 < sign && POSFIXABLE(u))
+            return LONG2FIX((long)u);
+        if (sign < 0 && BDIGIT_MSB(fixbuf[1]) == 0 &&
                 NEGFIXABLE(-(BDIGIT_DBL_SIGNED)u))
-            return LONG2FIX(-(BDIGIT_DBL_SIGNED)u);
+            return LONG2FIX((long)-(BDIGIT_DBL_SIGNED)u);
         val = bignew((long)num_bdigits, 0 <= sign);
         MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
     }
 
     if ((flags & INTEGER_PACK_FORCE_BIGNUM) && sign != 0 &&
-        bary_zero_p(BDIGITS(val), RBIGNUM_LEN(val)))
+        bary_zero_p(BDIGITS(val), BIGNUM_LEN(val)))
         sign = 0;
-    RBIGNUM_SET_SIGN(val, 0 <= sign);
+    BIGNUM_SET_SIGN(val, 0 <= sign);
 
     if (flags & INTEGER_PACK_FORCE_BIGNUM)
         return bigtrunc(val);
     return bignorm(val);
 }
 
-#define QUAD_SIZE 8
+#define conv_digit(c) (ruby_digit36_to_number_table[(unsigned char)(c)])
+
+NORETURN(static inline void invalid_radix(int base));
+NORETURN(static inline void invalid_integer(VALUE s));
 
-void
-rb_quad_pack(char *buf, VALUE val)
+static inline int
+valid_radix_p(int base)
 {
-    rb_integer_pack(val, buf, 1, QUAD_SIZE, 0,
-            INTEGER_PACK_NATIVE_BYTE_ORDER|
-            INTEGER_PACK_2COMP);
+    return (1 < base && base <= 36);
 }
 
-VALUE
-rb_quad_unpack(const char *buf, int signed_p)
+static inline void
+invalid_radix(int base)
 {
-    return rb_integer_unpack(buf, 1, QUAD_SIZE, 0,
-            INTEGER_PACK_NATIVE_BYTE_ORDER|
-            (signed_p ? INTEGER_PACK_2COMP : 0));
+    rb_raise(rb_eArgError, "invalid radix %d", base);
 }
 
-VALUE
-rb_cstr_to_inum(const char *str, int base, int badcheck)
+static inline void
+invalid_integer(VALUE s)
+{
+    rb_raise(rb_eArgError, "invalid value for Integer(): %+"PRIsVALUE, s);
+}
+
+static int
+str2big_scan_digits(const char *s, const char *str, int base, int badcheck, size_t *num_digits_p, ssize_t *len_p)
+{
+    char nondigit = 0;
+    size_t num_digits = 0;
+    const char *digits_start = str;
+    const char *digits_end = str;
+    ssize_t len = *len_p;
+
+    int c;
+
+    if (!len) {
+        *num_digits_p = 0;
+        *len_p = 0;
+        return TRUE;
+    }
+
+    if (badcheck && *str == '_') return FALSE;
+
+    while ((c = *str++) != 0) {
+        if (c == '_') {
+            if (nondigit) {
+                if (badcheck) return FALSE;
+                break;
+            }
+            nondigit = (char) c;
+        }
+        else if ((c = conv_digit(c)) < 0 || c >= base) {
+            break;
+        }
+        else {
+            nondigit = 0;
+            num_digits++;
+            digits_end = str;
+        }
+        if (len > 0 && !--len) break;
+    }
+    if (badcheck && nondigit) return FALSE;
+    if (badcheck && len) {
+        str--;
+        while (*str && ISSPACE(*str)) {
+            str++;
+            if (len > 0 && !--len) break;
+        }
+        if (len && *str) {
+            return FALSE;
+        }
+    }
+    *num_digits_p = num_digits;
+    *len_p = digits_end - digits_start;
+    return TRUE;
+}
+
+static VALUE
+str2big_poweroftwo(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    int bits_per_digit)
 {
-    const char *s = str;
-    char sign = 1, nondigit = 0;
+    BDIGIT *dp;
+    BDIGIT_DBL dd;
+    int numbits;
+
+    size_t num_bdigits;
+    const char *p;
     int c;
     VALUE z;
 
-    int bits_per_digit;
+    num_bdigits = (num_digits / BITSPERDIG) * bits_per_digit + roomof((num_digits % BITSPERDIG) * bits_per_digit, BITSPERDIG);
+    z = bignew(num_bdigits, sign);
+    dp = BDIGITS(z);
+    dd = 0;
+    numbits = 0;
+    for (p = digits_end; digits_start < p; p--) {
+        if ((c = conv_digit(p[-1])) < 0)
+            continue;
+        dd |= (BDIGIT_DBL)c << numbits;
+        numbits += bits_per_digit;
+        if (BITSPERDIG <= numbits) {
+            *dp++ = BIGLO(dd);
+            dd = BIGDN(dd);
+            numbits -= BITSPERDIG;
+        }
+    }
+    if (numbits) {
+        *dp++ = BIGLO(dd);
+    }
+    assert((size_t)(dp - BDIGITS(z)) == num_bdigits);
+
+    return z;
+}
+
+static VALUE
+str2big_normal(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_bdigits,
+    int base)
+{
+    size_t blen = 1;
+    BDIGIT *zds;
+    BDIGIT_DBL num;
+
     size_t i;
+    const char *p;
+    int c;
+    VALUE z;
 
-    const char *digits_start, *digits_end, *p;
-    size_t num_digits;
-    size_t num_bdigits;
+    z = bignew(num_bdigits, sign);
+    zds = BDIGITS(z);
+    BDIGITS_ZERO(zds, num_bdigits);
 
-#undef ISDIGIT
-#define ISDIGIT(c) ('0' <= (c) && (c) <= '9')
-#define conv_digit(c) (ruby_digit36_to_number_table[(unsigned char)(c)])
+    for (p = digits_start; p < digits_end; p++) {
+        if ((c = conv_digit(*p)) < 0)
+            continue;
+        num = c;
+        i = 0;
+        for (;;) {
+            while (i<blen) {
+                num += (BDIGIT_DBL)zds[i]*base;
+                zds[i++] = BIGLO(num);
+                num = BIGDN(num);
+            }
+            if (num) {
+                blen++;
+                continue;
+            }
+            break;
+        }
+        assert(blen <= num_bdigits);
+    }
 
-    if (!str) {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
+    return z;
+}
+
+static VALUE
+str2big_karatsuba(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    size_t num_bdigits,
+    int digits_per_bdigits_dbl,
+    int base)
+{
+    VALUE powerv;
+    size_t unit;
+    VALUE tmpuv = 0;
+    BDIGIT *uds, *vds, *tds;
+    BDIGIT_DBL dd;
+    BDIGIT_DBL current_base;
+    int m;
+    int power_level = 0;
+
+    size_t i;
+    const char *p;
+    int c;
+    VALUE z;
+
+    uds = ALLOCV_N(BDIGIT, tmpuv, 2*num_bdigits);
+    vds = uds + num_bdigits;
+
+    powerv = power_cache_get_power(base, power_level, NULL);
+
+    i = 0;
+    dd = 0;
+    current_base = 1;
+    m = digits_per_bdigits_dbl;
+    if (num_digits < (size_t)m)
+        m = (int)num_digits;
+    for (p = digits_end; digits_start < p; p--) {
+        if ((c = conv_digit(p[-1])) < 0)
+            continue;
+        dd = dd + c * current_base;
+        current_base *= base;
+        num_digits--;
+        m--;
+        if (m == 0) {
+            uds[i++] = BIGLO(dd);
+            uds[i++] = (BDIGIT)BIGDN(dd);
+            dd = 0;
+            m = digits_per_bdigits_dbl;
+            if (num_digits < (size_t)m)
+                m = (int)num_digits;
+            current_base = 1;
+        }
+    }
+    assert(i == num_bdigits);
+    for (unit = 2; unit < num_bdigits; unit *= 2) {
+        for (i = 0; i < num_bdigits; i += unit*2) {
+            if (2*unit <= num_bdigits - i) {
+                bary_mul(vds+i, unit*2, BDIGITS(powerv), BIGNUM_LEN(powerv), uds+i+unit, unit);
+                bary_add(vds+i, unit*2, vds+i, unit*2, uds+i, unit);
+            }
+            else if (unit <= num_bdigits - i) {
+                bary_mul(vds+i, num_bdigits-i, BDIGITS(powerv), BIGNUM_LEN(powerv), uds+i+unit, num_bdigits-(i+unit));
+                bary_add(vds+i, num_bdigits-i, vds+i, num_bdigits-i, uds+i, unit);
+            }
+            else {
+                MEMCPY(vds+i, uds+i, BDIGIT, num_bdigits-i);
+            }
+        }
+        power_level++;
+        powerv = power_cache_get_power(base, power_level, NULL);
+        tds = vds;
+        vds = uds;
+        uds = tds;
     }
-    while (ISSPACE(*str)) str++;
+    BARY_TRUNC(uds, num_bdigits);
+    z = bignew(num_bdigits, sign);
+    MEMCPY(BDIGITS(z), uds, BDIGIT, num_bdigits);
+
+    if (tmpuv)
+        ALLOCV_END(tmpuv);
+
+    return z;
+}
 
-    if (str[0] == '+') {
-	str++;
+#if USE_GMP
+static VALUE
+str2big_gmp(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    size_t num_bdigits,
+    int base)
+{
+    char *buf, *p;
+    const char *q;
+    VALUE tmps;
+    mpz_t mz;
+    VALUE z;
+    BDIGIT *zds;
+    size_t zn, count;
+
+    buf = ALLOCV_N(char, tmps, num_digits+1);
+    p = buf;
+    for (q = digits_start; q < digits_end; q++) {
+        if (conv_digit(*q) < 0)
+            continue;
+        *p++ = *q;
     }
-    else if (str[0] == '-') {
-	str++;
-	sign = 0;
+    *p = '\0';
+
+    mpz_init(mz);
+    mpz_set_str(mz, buf, base);
+    zn = num_bdigits;
+    z = bignew(zn, sign);
+    zds = BDIGITS(z);
+    bdigits_from_mpz(mz, BDIGITS(z), &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(mz);
+
+    if (tmps)
+        ALLOCV_END(tmps);
+
+    return z;
+}
+#endif
+
+static VALUE rb_cstr_parse_inum(const char *str, ssize_t len, char **endp, int base);
+
+/*
+ * Parse +str+ as Ruby Integer, i.e., underscores, 0d and 0b prefixes.
+ *
+ * str:      pointer to the string to be parsed.
+ *	     should be NUL-terminated.
+ * base:     base of conversion, must be 2..36, or -36..0.
+ *           if +base+ > 0, the conversion is done according to the +base+
+ *           and unmatched prefix is parsed as a part of the result if
+ *           present.
+ *           if +base+ <= 0, the conversion is done according to the
+ *           prefix if present, in base <code>-base</code> if +base+ < -1,
+ *           or in base 10.
+ * badcheck: if non-zero, +ArgumentError+ is raised when +str+ is not
+ *           valid as an Integer.  if zero, Fixnum 0 is returned in
+ *           that case.
+ */
+VALUE
+rb_cstr_to_inum(const char *str, int base, int badcheck)
+{
+    char *end;
+    VALUE ret = rb_cstr_parse_inum(str, -1, (badcheck ? NULL : &end), base);
+    if (NIL_P(ret)) {
+        if (badcheck) rb_invalid_str(str, "Integer()");
+        ret = INT2FIX(0);
     }
-    if (str[0] == '+' || str[0] == '-') {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
+    return ret;
+}
+
+/*
+ * Parse +str+ as Ruby Integer, i.e., underscores, 0d and 0b prefixes.
+ *
+ * str:  pointer to the string to be parsed.
+ *       should be NUL-terminated if +len+ is negative.
+ * len:  length of +str+ if >= 0.  if +len+ is negative, +str+ should
+ *       be NUL-terminated.
+ * endp: if non-NULL, the address after parsed part is stored.  if
+ *       NULL, Qnil is returned when +str+ is not valid as an Integer.
+ * ndigits: if non-NULL, the number of parsed digits is stored.
+ * base: see +rb_cstr_to_inum+
+ * flags: bitwise OR of below flags:
+ *       RB_INT_PARSE_SIGN: allow preceding spaces and +/- sign
+ *       RB_INT_PARSE_UNDERSCORE: allow an underscore between digits
+ *       RB_INT_PARSE_PREFIX: allow preceding prefix
+ */
+
+VALUE
+rb_int_parse_cstr(const char *str, ssize_t len, char **endp, size_t *ndigits,
+                  int base, int flags)
+{
+    const char *const s = str;
+    char sign = 1;
+    int c;
+    VALUE z = Qnil;
+
+    unsigned long val;
+    int ov;
+
+    const char *digits_start, *digits_end;
+    size_t num_digits = 0;
+    size_t num_bdigits;
+    const ssize_t len0 = len;
+    const int badcheck = !endp;
+
+#define ADV(n) do {\
+        if (len > 0 && len <= (n)) goto bad; \
+        str += (n); \
+        len -= (n); \
+    } while (0)
+#define ASSERT_LEN() do {\
+        assert(len != 0); \
+        if (len0 >= 0) assert(s + len0 == str + len); \
+    } while (0)
+
+    if (!str) {
+        goto bad;
+    }
+    if (len && (flags & RB_INT_PARSE_SIGN)) {
+        while (ISSPACE(*str)) ADV(1);
+
+        if (str[0] == '+') {
+            ADV(1);
+        }
+        else if (str[0] == '-') {
+            ADV(1);
+            sign = 0;
+        }
+        ASSERT_LEN();
     }
     if (base <= 0) {
-	if (str[0] == '0') {
-	    switch (str[1]) {
-	      case 'x': case 'X':
-		base = 16;
-                str += 2;
-		break;
-	      case 'b': case 'B':
-		base = 2;
-                str += 2;
-		break;
-	      case 'o': case 'O':
-		base = 8;
-                str += 2;
-		break;
-	      case 'd': case 'D':
-		base = 10;
-                str += 2;
-		break;
-	      default:
-		base = 8;
-	    }
-	}
-	else if (base < -1) {
-	    base = -base;
-	}
-	else {
-	    base = 10;
-	}
+        if (str[0] == '0' && len > 1) {
+            switch (str[1]) {
+              case 'x': case 'X':
+                base = 16;
+                ADV(2);
+                break;
+              case 'b': case 'B':
+                base = 2;
+                ADV(2);
+                break;
+              case 'o': case 'O':
+                base = 8;
+                ADV(2);
+                break;
+              case 'd': case 'D':
+                base = 10;
+                ADV(2);
+                break;
+              default:
+                base = 8;
+            }
+        }
+        else if (base < -1) {
+            base = -base;
+        }
+        else {
+            base = 10;
+        }
+    }
+    else if (len == 1 || !(flags & RB_INT_PARSE_PREFIX)) {
+        /* no prefix */
     }
     else if (base == 2) {
-	if (str[0] == '0' && (str[1] == 'b'||str[1] == 'B')) {
-	    str += 2;
-	}
+        if (str[0] == '0' && (str[1] == 'b'||str[1] == 'B')) {
+            ADV(2);
+        }
     }
     else if (base == 8) {
-	if (str[0] == '0' && (str[1] == 'o'||str[1] == 'O')) {
-	    str += 2;
-	}
+        if (str[0] == '0' && (str[1] == 'o'||str[1] == 'O')) {
+            ADV(2);
+        }
     }
     else if (base == 10) {
-	if (str[0] == '0' && (str[1] == 'd'||str[1] == 'D')) {
-	    str += 2;
-	}
+        if (str[0] == '0' && (str[1] == 'd'||str[1] == 'D')) {
+            ADV(2);
+        }
     }
     else if (base == 16) {
-	if (str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) {
-	    str += 2;
-	}
-    }
-    if (base < 2 || 36 < base) {
-        rb_raise(rb_eArgError, "invalid radix %d", base);
-    }
-    if (*str == '0') {		/* squeeze preceding 0s */
-	int us = 0;
-	while ((c = *++str) == '0' || c == '_') {
-	    if (c == '_') {
-		if (++us >= 2)
-		    break;
-	    } else
-		us = 0;
-	}
-	if (!(c = *str) || ISSPACE(c)) --str;
+        if (str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) {
+            ADV(2);
+        }
+    }
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+    if (!len) goto bad;
+    num_digits = str - s;
+    if (*str == '0' && len != 1) { /* squeeze preceding 0s */
+        int us = 0;
+        const char *end = len < 0 ? NULL : str + len;
+        ++num_digits;
+        while ((c = *++str) == '0' ||
+               ((flags & RB_INT_PARSE_UNDERSCORE) && c == '_')) {
+            if (c == '_') {
+                if (++us >= 2)
+                    break;
+            }
+            else {
+                ++num_digits;
+                us = 0;
+            }
+            if (str == end) break;
+        }
+        if (!c || ISSPACE(c)) --str;
+        if (end) len = end - str;
     }
     c = *str;
     c = conv_digit(c);
     if (c < 0 || c >= base) {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
-    }
-
-    bits_per_digit = bitsize(base-1);
-    if (bits_per_digit * strlen(str) <= sizeof(long) * CHAR_BIT) {
-        char *end;
-	unsigned long val = STRTOUL(str, &end, base);
-
-	if (str < end && *end == '_') goto bigparse;
-	if (badcheck) {
-	    if (end == str) goto bad; /* no number */
-	    while (*end && ISSPACE(*end)) end++;
-	    if (*end) goto bad;	      /* trailing garbage */
-	}
-
-	if (POSFIXABLE(val)) {
-	    if (sign) return LONG2FIX(val);
-	    else {
-		long result = -(long)val;
-		return LONG2FIX(result);
-	    }
-	}
-	else {
-	    VALUE big = rb_uint2big(val);
-	    RBIGNUM_SET_SIGN(big, sign);
-	    return bignorm(big);
-	}
-    }
-  bigparse:
-    if (badcheck && *str == '_') goto bad;
-
-    num_digits = 0;
-    digits_start = digits_end = str;
-    while ((c = *str++) != 0) {
-	if (c == '_') {
-	    if (nondigit) {
-		if (badcheck) goto bad;
-		break;
-	    }
-	    nondigit = (char) c;
-	    continue;
-	}
-	else if ((c = conv_digit(c)) < 0) {
-	    break;
-	}
-	if (c >= base) break;
-	nondigit = 0;
-        num_digits++;
-        digits_end = str;
-    }
-    if (badcheck) {
-	str--;
-	if (s+1 < str && str[-1] == '_') goto bad;
-	while (*str && ISSPACE(*str)) str++;
-	if (*str) {
-	  bad:
-	    rb_invalid_str(s, "Integer()");
-	}
-    }
+        if (!badcheck && num_digits) z = INT2FIX(0);
+        goto bad;
+    }
+
+    if (ndigits) *ndigits = num_digits;
+    val = ruby_scan_digits(str, len, base, &num_digits, &ov);
+    if (!ov) {
+        const char *end = &str[num_digits];
+        if (num_digits > 0 && *end == '_' && (flags & RB_INT_PARSE_UNDERSCORE))
+            goto bigparse;
+        if (endp) *endp = (char *)end;
+        if (ndigits) *ndigits += num_digits;
+        if (badcheck) {
+            if (num_digits == 0) return Qnil; /* no number */
+            while (len < 0 ? *end : end < str + len) {
+                if (!ISSPACE(*end)) return Qnil; /* trailing garbage */
+                end++;
+            }
+        }
 
-    if (POW2_P(base)) {
-        BDIGIT *dp;
-        BDIGIT_DBL dd;
-        int numbits;
-        num_bdigits = (num_digits / BITSPERDIG) * bits_per_digit + roomof((num_digits % BITSPERDIG) * bits_per_digit, BITSPERDIG);
-        z = bignew(num_bdigits, sign);
-        dp = BDIGITS(z);
-        dd = 0;
-        numbits = 0;
-        for (p = digits_end; digits_start < p; p--) {
-            if ((c = conv_digit(p[-1])) < 0)
-                continue;
-            dd |= (BDIGIT_DBL)c << numbits;
-            numbits += bits_per_digit;
-            if (BITSPERDIG <= numbits) {
-                *dp++ = BIGLO(dd);
-                dd = BIGDN(dd);
-                numbits -= BITSPERDIG;
+        if (POSFIXABLE(val)) {
+            if (sign) return LONG2FIX(val);
+            else {
+                long result = -(long)val;
+                return LONG2FIX(result);
             }
         }
-        if (numbits) {
-            *dp++ = BIGLO(dd);
+        else {
+            VALUE big = rb_uint2big(val);
+            BIGNUM_SET_SIGN(big, sign);
+            return bignorm(big);
         }
-        assert((size_t)(dp - BDIGITS(z)) == num_bdigits);
+    }
+
+  bigparse:
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        goto bad;
+    if (endp) *endp = (char *)(str + len);
+    if (ndigits) *ndigits += num_digits;
+    digits_end = digits_start + len;
+
+    if (POW2_P(base)) {
+        z = str2big_poweroftwo(sign, digits_start, digits_end, num_digits,
+                               bit_length(base-1));
     }
     else {
         int digits_per_bdigits_dbl;
         maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
         num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
 
+#if USE_GMP
+        if (GMP_STR2BIG_DIGITS < num_bdigits) {
+            z = str2big_gmp(sign, digits_start, digits_end, num_digits,
+                    num_bdigits, base);
+        }
+        else
+#endif
         if (num_bdigits < KARATSUBA_MUL_DIGITS) {
-            size_t blen = 1;
-            BDIGIT *zds;
-            BDIGIT_DBL num;
-
-            z = bignew(num_bdigits, sign);
-            zds = BDIGITS(z);
-            BDIGITS_ZERO(zds, num_bdigits);
-
-            for (p = digits_start; p < digits_end; p++) {
-                if ((c = conv_digit(*p)) < 0)
-                    continue;
-                num = c;
-                i = 0;
-                for (;;) {
-                    while (i<blen) {
-                        num += (BDIGIT_DBL)zds[i]*base;
-                        zds[i++] = BIGLO(num);
-                        num = BIGDN(num);
-                    }
-                    if (num) {
-                        blen++;
-                        continue;
-                    }
-                    break;
-                }
-                assert(blen <= num_bdigits);
-            }
+            z = str2big_normal(sign, digits_start, digits_end,
+                    num_bdigits, base);
         }
         else {
-            VALUE powerv;
-            size_t unit;
-            VALUE tmpuv = 0;
-            BDIGIT *uds, *vds, *tds;
-            BDIGIT_DBL dd;
-            BDIGIT_DBL current_base;
-            int m;
-            int power_level = 0;
+            z = str2big_karatsuba(sign, digits_start, digits_end, num_digits,
+                    num_bdigits, digits_per_bdigits_dbl, base);
+        }
+    }
 
-            uds = ALLOCV_N(BDIGIT, tmpuv, 2*num_bdigits);
-            vds = uds + num_bdigits;
+    return bignorm(z);
 
-            powerv = power_cache_get_power(base, power_level, NULL);
+  bad:
+    if (endp) *endp = (char *)str;
+    if (ndigits) *ndigits = num_digits;
+    return z;
+}
 
-            i = 0;
-            dd = 0;
-            current_base = 1;
-            m = digits_per_bdigits_dbl;
-            if (num_digits < (size_t)m)
-                m = (int)num_digits;
-            for (p = digits_end; digits_start < p; p--) {
-                if ((c = conv_digit(p[-1])) < 0)
-                    continue;
-                dd = dd + c * current_base;
-                current_base *= base;
-                num_digits--;
-                m--;
-                if (m == 0) {
-                    uds[i++] = BIGLO(dd);
-                    uds[i++] = (BDIGIT)BIGDN(dd);
-                    dd = 0;
-                    m = digits_per_bdigits_dbl;
-                    if (num_digits < (size_t)m)
-                        m = (int)num_digits;
-                    current_base = 1;
-                }
-            }
-            assert(i == num_bdigits);
-            for (unit = 2; unit < num_bdigits; unit *= 2) {
-                for (i = 0; i < num_bdigits; i += unit*2) {
-                    if (2*unit <= num_bdigits - i) {
-                        bary_mul(vds+i, unit*2, BDIGITS(powerv), RBIGNUM_LEN(powerv), uds+i+unit, unit);
-                        bary_add(vds+i, unit*2, vds+i, unit*2, uds+i, unit);
-                    }
-                    else if (unit <= num_bdigits - i) {
-                        bary_mul(vds+i, num_bdigits-i, BDIGITS(powerv), RBIGNUM_LEN(powerv), uds+i+unit, num_bdigits-(i+unit));
-                        bary_add(vds+i, num_bdigits-i, vds+i, num_bdigits-i, uds+i, unit);
-                    }
-                    else {
-                        MEMCPY(vds+i, uds+i, BDIGIT, num_bdigits-i);
-                    }
-                }
-                power_level++;
-                powerv = power_cache_get_power(base, power_level, NULL);
-                tds = vds;
-                vds = uds;
-                uds = tds;
-            }
-            while (0 < num_bdigits && uds[num_bdigits-1] == 0)
-                num_bdigits--;
-            z = bignew(num_bdigits, sign);
-            MEMCPY(BDIGITS(z), uds, BDIGIT, num_bdigits);
+static VALUE
+rb_cstr_parse_inum(const char *str, ssize_t len, char **endp, int base)
+{
+    return rb_int_parse_cstr(str, len, endp, NULL, base,
+                             RB_INT_PARSE_DEFAULT);
+}
+
+VALUE
+rb_str_convert_to_inum(VALUE str, int base, int badcheck, int raise_exception)
+{
+    VALUE ret;
+    const char *s;
+    long len;
+    char *end;
 
-            if (tmpuv)
-                ALLOCV_END(tmpuv);
+    StringValue(str);
+    rb_must_asciicompat(str);
+    RSTRING_GETMEM(str, s, len);
+    ret = rb_cstr_parse_inum(s, len, (badcheck ? NULL : &end), base);
+    if (NIL_P(ret)) {
+        if (badcheck) {
+            if (!raise_exception) return Qnil;
+            invalid_integer(str);
         }
+        ret = INT2FIX(0);
     }
+    return ret;
+}
+
+VALUE
+rb_str_to_inum(VALUE str, int base, int badcheck)
+{
+    return rb_str_convert_to_inum(str, base, badcheck, TRUE);
+}
+
+VALUE
+rb_str2big_poweroftwo(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    if (!valid_radix_p(base) || !POW2_P(base)) {
+        invalid_radix(base);
+    }
+
+    rb_must_asciicompat(arg);
+    s = str = StringValueCStr(arg);
+    len = RSTRING_LEN(arg);
+    if (*str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    z = str2big_poweroftwo(positive_p, digits_start, digits_end, num_digits,
+            bit_length(base-1));
+
+    RB_GC_GUARD(arg);
 
     return bignorm(z);
 }
 
 VALUE
-rb_str_to_inum(VALUE str, int base, int badcheck)
+rb_str2big_normal(VALUE arg, int base, int badcheck)
 {
-    char *s;
-    long len;
-    VALUE v = 0;
-    VALUE ret;
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
 
-    StringValue(str);
-    rb_must_asciicompat(str);
-    if (badcheck) {
-	s = StringValueCStr(str);
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
     }
-    else {
-	s = RSTRING_PTR(str);
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
     }
-    if (s) {
-	len = RSTRING_LEN(str);
-	if (s[len]) {		/* no sentinel somehow */
-	    char *p = ALLOCV(v, len+1);
 
-	    MEMCPY(p, s, char, len);
-	    p[len] = '\0';
-	    s = p;
-	}
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_normal(positive_p, digits_start, digits_end,
+            num_bdigits, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
+}
+
+VALUE
+rb_str2big_karatsuba(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
     }
-    ret = rb_cstr_to_inum(s, base, badcheck);
-    if (v)
-	ALLOCV_END(v);
-    return ret;
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_karatsuba(positive_p, digits_start, digits_end, num_digits,
+            num_bdigits, digits_per_bdigits_dbl, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
 }
 
+#if USE_GMP
+VALUE
+rb_str2big_gmp(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_gmp(positive_p, digits_start, digits_end, num_digits, num_bdigits, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
+}
+#endif
+
 #if HAVE_LONG_LONG
 
 static VALUE
@@ -3965,18 +4471,18 @@ rb_ull2big(unsigned LONG_LONG n)
     VALUE big = bignew(bdigit_roomof(SIZEOF_LONG_LONG), 1);
     BDIGIT *digits = BDIGITS(big);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG_LONG
     digits[0] = n;
 #else
     for (i = 0; i < bdigit_roomof(SIZEOF_LONG_LONG); i++) {
-	digits[i] = BIGLO(n);
-	n = BIGDN(n);
+        digits[i] = BIGLO(n);
+        n = BIGDN(n);
     }
 #endif
 
     i = bdigit_roomof(SIZEOF_LONG_LONG);
     while (i-- && !digits[i]) ;
-    RBIGNUM_SET_LEN(big, i+1);
+    BIGNUM_SET_LEN(big, i+1);
     return big;
 }
 
@@ -3989,14 +4495,14 @@ rb_ll2big(LONG_LONG n)
 
     if (n < 0) {
         u = 1 + (unsigned LONG_LONG)(-(n + 1)); /* u = -n avoiding overflow */
-	neg = 1;
+        neg = 1;
     }
     else {
         u = n;
     }
     big = rb_ull2big(u);
     if (neg) {
-	RBIGNUM_SET_SIGN(big, 0);
+        BIGNUM_SET_NEGATIVE_SIGN(big);
     }
     return big;
 }
@@ -4004,19 +4510,59 @@ rb_ll2big(LONG_LONG n)
 VALUE
 rb_ull2inum(unsigned LONG_LONG n)
 {
-    if (POSFIXABLE(n)) return LONG2FIX(n);
+    if (POSFIXABLE(n)) return LONG2FIX((long)n);
     return rb_ull2big(n);
 }
 
 VALUE
 rb_ll2inum(LONG_LONG n)
 {
-    if (FIXABLE(n)) return LONG2FIX(n);
+    if (FIXABLE(n)) return LONG2FIX((long)n);
     return rb_ll2big(n);
 }
 
 #endif  /* HAVE_LONG_LONG */
 
+#ifdef HAVE_INT128_T
+static VALUE
+rb_uint128t2big(uint128_t n)
+{
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_INT128_T), 1);
+    BDIGIT *digits = BDIGITS(big);
+
+    for (i = 0; i < bdigit_roomof(SIZEOF_INT128_T); i++) {
+        digits[i] = BIGLO(RSHIFT(n ,BITSPERDIG*i));
+    }
+
+    i = bdigit_roomof(SIZEOF_INT128_T);
+    while (i-- && !digits[i]) ;
+    BIGNUM_SET_LEN(big, i+1);
+    return big;
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_int128t2big(int128_t n)
+{
+    int neg = 0;
+    uint128_t u;
+    VALUE big;
+
+    if (n < 0) {
+        u = 1 + (uint128_t)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
+    }
+    else {
+        u = n;
+    }
+    big = rb_uint128t2big(u);
+    if (neg) {
+        BIGNUM_SET_NEGATIVE_SIGN(big);
+    }
+    return big;
+}
+#endif
+
 VALUE
 rb_cstr2inum(const char *str, int base)
 {
@@ -4040,12 +4586,15 @@ big_shift3(VALUE x, int lshift_p, size_t shift_numdigits, int shift_numbits)
 
     if (lshift_p) {
         if (LONG_MAX < shift_numdigits) {
-            rb_raise(rb_eArgError, "too big number");
+          too_big:
+            rb_raise(rb_eRangeError, "shift width too big");
         }
         s1 = shift_numdigits;
         s2 = shift_numbits;
-        xn = RBIGNUM_LEN(x);
-        z = bignew(xn+s1+1, RBIGNUM_SIGN(x));
+        if ((size_t)s1 != shift_numdigits) goto too_big;
+        xn = BIGNUM_LEN(x);
+        if (LONG_MAX/SIZEOF_BDIGIT <= xn+s1) goto too_big;
+        z = bignew(xn+s1+1, BIGNUM_SIGN(x));
         zds = BDIGITS(z);
         BDIGITS_ZERO(zds, s1);
         xds = BDIGITS(x);
@@ -4054,9 +4603,9 @@ big_shift3(VALUE x, int lshift_p, size_t shift_numdigits, int shift_numbits)
     else {
         long zn;
         BDIGIT hibitsx;
-        if (LONG_MAX < shift_numdigits || (size_t)RBIGNUM_LEN(x) <= shift_numdigits) {
-            if (RBIGNUM_POSITIVE_P(x) ||
-                bary_zero_p(BDIGITS(x), RBIGNUM_LEN(x)))
+        if (LONG_MAX < shift_numdigits || (size_t)BIGNUM_LEN(x) <= shift_numdigits) {
+            if (BIGNUM_POSITIVE_P(x) ||
+                bary_zero_p(BDIGITS(x), BIGNUM_LEN(x)))
                 return INT2FIX(0);
             else
                 return INT2FIX(-1);
@@ -4071,7 +4620,7 @@ big_shift3(VALUE x, int lshift_p, size_t shift_numdigits, int shift_numbits)
         zn = xn - s1;
         z = bignew(zn, 0);
         zds = BDIGITS(z);
-        bary_small_rshift(zds, xds+s1, zn, s2, hibitsx != 0);
+        bary_small_rshift(zds, xds+s1, zn, s2, hibitsx != 0 ? BDIGMAX : 0);
         twocomp2abs_bang(z, hibitsx != 0);
     }
     RB_GC_GUARD(x);
@@ -4103,11 +4652,11 @@ big_shift2(VALUE x, int lshift_p, VALUE y)
     }
     else {
         if (1 < sign || CHAR_BIT <= lens[1])
-            return RBIGNUM_POSITIVE_P(x) ? INT2FIX(0) : INT2FIX(-1);
+            return BIGNUM_POSITIVE_P(x) ? INT2FIX(0) : INT2FIX(-1);
     }
     shift_numbits = (int)(lens[0] & (BITSPERDIG-1));
-    shift_numdigits = (lens[0] >> bitsize(BITSPERDIG-1)) |
-      (lens[1] << (CHAR_BIT*SIZEOF_SIZE_T - bitsize(BITSPERDIG-1)));
+    shift_numdigits = (lens[0] >> bit_length(BITSPERDIG-1)) |
+      (lens[1] << (CHAR_BIT*SIZEOF_SIZE_T - bit_length(BITSPERDIG-1)));
     return big_shift3(x, lshift_p, shift_numdigits, shift_numbits);
 }
 
@@ -4135,12 +4684,6 @@ static size_t base36_numdigits_cache[35][MAX_BASE36_POWER_TABLE_ENTRIES];
 static void
 power_cache_init(void)
 {
-    int i, j;
-    for (i = 0; i < 35; ++i) {
-	for (j = 0; j < MAX_BASE36_POWER_TABLE_ENTRIES; ++j) {
-	    base36_power_cache[i][j] = Qnil;
-	}
-    }
 }
 
 static inline VALUE
@@ -4163,8 +4706,8 @@ power_cache_get_power(int base, int power_level, size_t *numdigits_ret)
     if (MAX_BASE36_POWER_TABLE_ENTRIES <= power_level)
         rb_bug("too big power number requested: maxpow_in_bdigit_dbl(%d)**(2**%d)", base, power_level);
 
-    if (NIL_P(base36_power_cache[base - 2][power_level])) {
-        VALUE power;
+    VALUE power = base36_power_cache[base - 2][power_level];
+    if (!power) {
         size_t numdigits;
         if (power_level == 0) {
             int numdigits0;
@@ -4180,73 +4723,16 @@ power_cache_get_power(int base, int power_level, size_t *numdigits_ret)
         rb_obj_hide(power);
         base36_power_cache[base - 2][power_level] = power;
         base36_numdigits_cache[base - 2][power_level] = numdigits;
-	rb_gc_register_mark_object(power);
+        rb_gc_register_mark_object(power);
     }
     if (numdigits_ret)
         *numdigits_ret = base36_numdigits_cache[base - 2][power_level];
-    return base36_power_cache[base - 2][power_level];
-}
-
-/*
- * deprecated.  (used only from deprecated rb_big2str0)
- *
- * big2str_muraken_find_n1
- *
- * Let a natural number x is given by:
- * x = 2^0 * x_0 + 2^1 * x_1 + ... + 2^(B*n_0 - 1) * x_{B*n_0 - 1},
- * where B is BITSPERDIG (i.e. BDIGITS*CHAR_BIT) and n_0 is
- * RBIGNUM_LEN(x).
- *
- * Now, we assume n_1 = min_n \{ n | 2^(B*n_0/2) <= b_1^(n_1) \}, so
- * it is realized that 2^(B*n_0) <= {b_1}^{2*n_1}, where b_1 is a
- * given radix number. And then, we have n_1 <= (B*n_0) /
- * (2*log_2(b_1)), therefore n_1 is given by ceil((B*n_0) /
- * (2*log_2(b_1))).
- */
-static long
-big2str_find_n1(VALUE x, int base)
-{
-    static const double log_2[] = {
-	1.0,              1.58496250072116, 2.0,
-	2.32192809488736, 2.58496250072116, 2.8073549220576,
-	3.0,              3.16992500144231, 3.32192809488736,
-	3.4594316186373,  3.58496250072116, 3.70043971814109,
-	3.8073549220576,  3.90689059560852, 4.0,
-	4.08746284125034, 4.16992500144231, 4.24792751344359,
-	4.32192809488736, 4.39231742277876, 4.4594316186373,
-	4.52356195605701, 4.58496250072116, 4.64385618977472,
-	4.70043971814109, 4.75488750216347, 4.8073549220576,
-	4.85798099512757, 4.90689059560852, 4.95419631038688,
-	5.0,              5.04439411935845, 5.08746284125034,
-	5.12928301694497, 5.16992500144231
-    };
-    long bits;
-
-    if (base < 2 || 36 < base)
-	rb_bug("invalid radix %d", base);
-
-    if (FIXNUM_P(x)) {
-	bits = (SIZEOF_LONG*CHAR_BIT - 1)/2 + 1;
-    }
-    else if (BIGZEROP(x)) {
-	return 0;
-    }
-    else if (RBIGNUM_LEN(x) >= LONG_MAX/BITSPERDIG) {
-	rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
-    }
-    else {
-	bits = BITSPERDIG*RBIGNUM_LEN(x);
-    }
-
-    /* @shyouhei note: vvvvvvvvvvvvv this cast is suspicious.  But I believe it is OK, because if that cast loses data, this x value is too big, and should have raised RangeError. */
-    return (long)ceil(((double)bits)/log_2[base - 2]);
+    return power;
 }
 
 struct big2str_struct {
     int negative;
     int base;
-    BDIGIT hbase;
-    int hbase_numdigits;
     BDIGIT_DBL hbase2;
     int hbase2_numdigits;
     VALUE result;
@@ -4265,7 +4751,7 @@ big2str_alloc(struct big2str_struct *b2s, size_t len)
 }
 
 static void
-big2str_orig(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
+big2str_2bdigits(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
 {
     size_t j;
     BDIGIT_DBL num;
@@ -4282,19 +4768,21 @@ big2str_orig(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
         p = buf;
         j = sizeof(buf);
         do {
-            p[--j] = ruby_digitmap[num % b2s->base];
+            BDIGIT_DBL idx = num % b2s->base;
             num /= b2s->base;
+            p[--j] = ruby_digitmap[idx];
         } while (num);
         len = sizeof(buf) - j;
         big2str_alloc(b2s, len + taillen);
-	MEMCPY(b2s->ptr, buf + j, char, len);
+        MEMCPY(b2s->ptr, buf + j, char, len);
     }
     else {
         p = b2s->ptr;
         j = b2s->hbase2_numdigits;
         do {
-            p[--j] = ruby_digitmap[num % b2s->base];
+            BDIGIT_DBL idx = num % b2s->base;
             num /= b2s->base;
+            p[--j] = ruby_digitmap[idx];
         } while (j);
         len = b2s->hbase2_numdigits;
     }
@@ -4302,15 +4790,14 @@ big2str_orig(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
 }
 
 static void
-big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn,
-		  int power_level, size_t taillen,
-                  BDIGIT *wds, size_t wn)
+big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t wn,
+                  int power_level, size_t taillen)
 {
     VALUE b;
     size_t half_numdigits, lower_numdigits;
     int lower_power_level;
     size_t bn;
-    BDIGIT *bds;
+    const BDIGIT *bds;
     size_t len;
 
     /*
@@ -4334,23 +4821,23 @@ big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn,
      */
 
     if (xn == 0 || bary_zero_p(xds, xn)) {
-	if (b2s->ptr) {
+        if (b2s->ptr) {
             /* When x is zero, power_cache_get_power(base, power_level) should be cached already. */
             power_cache_get_power(b2s->base, power_level, &len);
-	    memset(b2s->ptr, '0', len);
+            memset(b2s->ptr, '0', len);
             b2s->ptr += len;
-	}
+        }
         return;
     }
 
     if (power_level == 0) {
-	big2str_orig(b2s, xds, xn, taillen);
+        big2str_2bdigits(b2s, xds, xn, taillen);
         return;
     }
 
     lower_power_level = power_level-1;
     b = power_cache_get_power(b2s->base, lower_power_level, &lower_numdigits);
-    bn = RBIGNUM_LEN(b);
+    bn = BIGNUM_LEN(b);
     bds = BDIGITS(b);
 
     half_numdigits = lower_numdigits;
@@ -4360,7 +4847,7 @@ big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn,
              (xn == bn && bary_cmp(xds, xn, bds, bn) < 0))) {
         lower_power_level--;
         b = power_cache_get_power(b2s->base, lower_power_level, &lower_numdigits);
-        bn = RBIGNUM_LEN(b);
+        bn = BIGNUM_LEN(b);
         bds = BDIGITS(b);
     }
 
@@ -4372,53 +4859,73 @@ big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn,
             memset(b2s->ptr, '0', len);
             b2s->ptr += len;
         }
-	big2str_orig(b2s, xds, xn, taillen);
+        big2str_2bdigits(b2s, xds, xn, taillen);
     }
     else {
-        VALUE tmpw = 0;
         BDIGIT *qds, *rds;
         size_t qn, rn;
+        BDIGIT *tds;
+        int shift;
+
         if (lower_power_level != power_level-1 && b2s->ptr) {
             len = (half_numdigits - lower_numdigits) * 2;
             memset(b2s->ptr, '0', len);
             b2s->ptr += len;
         }
+
+        shift = nlz(bds[bn-1]);
+
+        qn = xn + BIGDIVREM_EXTRA_WORDS;
+
+        if (shift == 0) {
+            /* bigdivrem_restoring will not modify y.
+             * So use bds directly.  */
+            tds = (BDIGIT *)bds;
+            xds[xn] = 0;
+        }
+        else {
+            /* bigdivrem_restoring will modify y.
+             * So use temporary buffer.  */
+            tds = xds + qn;
+            assert(qn + bn <= xn + wn);
+            bary_small_lshift(tds, bds, bn, shift);
+            xds[xn] = bary_small_lshift(xds, xds, xn, shift);
+        }
+
+        bigdivrem_restoring(xds, qn, tds, bn);
+
+        rds = xds;
         rn = bn;
-        qn = xn+BIGDIVREM_EXTRA_WORDS;
-        if (wn < rn + qn) {
-            wn = bn * 4 + BIGDIVREM_EXTRA_WORDS;
-            assert(rn + qn <= wn);
-            wds = ALLOCV_N(BDIGIT, tmpw, wn);
-        }
-        rds = wds;
-        qds = wds+rn;
-        bary_divmod(qds, qn, rds, rn, xds, xn, bds, bn);
-        while (0 < qn && qds[qn-1] == 0)
-            qn--;
+
+        qds = xds + bn;
+        qn = qn - bn;
+
+        if (shift) {
+            bary_small_rshift(rds, rds, rn, shift, 0);
+        }
+
+        BARY_TRUNC(qds, qn);
         assert(qn <= bn);
-        big2str_karatsuba(b2s, qds, qn, lower_power_level, lower_numdigits+taillen, qds+qn, wn-(rn+qn));
-        while (0 < rn && rds[rn-1] == 0)
-            rn--;
-        big2str_karatsuba(b2s, rds, rn, lower_power_level, taillen, rds+rn, wn-rn);
-        if (tmpw)
-            ALLOCV_END(tmpw);
+        big2str_karatsuba(b2s, qds, qn, xn+wn - (rn+qn), lower_power_level, lower_numdigits+taillen);
+        BARY_TRUNC(rds, rn);
+        big2str_karatsuba(b2s, rds, rn, xn+wn - rn, lower_power_level, taillen);
     }
 }
 
 static VALUE
-big2str_base_powerof2(VALUE x, int base)
+big2str_base_poweroftwo(VALUE x, int base)
 {
     int word_numbits = ffs(base) - 1;
     size_t numwords;
     VALUE result;
     char *ptr;
     numwords = rb_absint_numwords(x, word_numbits, NULL);
-    if (RBIGNUM_NEGATIVE_P(x)) {
+    if (BIGNUM_NEGATIVE_P(x)) {
         if (LONG_MAX-1 < numwords)
             rb_raise(rb_eArgError, "too big number");
         result = rb_usascii_str_new(0, 1+numwords);
         ptr = RSTRING_PTR(result);
-        *ptr++ = RBIGNUM_POSITIVE_P(x) ? '+' : '-';
+        *ptr++ = BIGNUM_POSITIVE_P(x) ? '+' : '-';
     }
     else {
         if (LONG_MAX < numwords)
@@ -4436,42 +4943,46 @@ big2str_base_powerof2(VALUE x, int base)
     return result;
 }
 
+VALUE
+rb_big2str_poweroftwo(VALUE x, int base)
+{
+    return big2str_base_poweroftwo(x, base);
+}
+
 static VALUE
-rb_big2str1(VALUE x, int base)
+big2str_generic(VALUE x, int base)
 {
+    BDIGIT *xds;
+    size_t xn;
     struct big2str_struct b2s_data;
     int power_level;
     VALUE power;
 
-    if (FIXNUM_P(x)) {
-	return rb_fix2str(x, base);
-    }
-    if (BIGZEROP(x)) {
-	return rb_usascii_str_new2("0");
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+    BARY_TRUNC(xds, xn);
+
+    if (xn == 0) {
+        return rb_usascii_str_new2("0");
     }
 
-    if (base < 2 || 36 < base)
-	rb_raise(rb_eArgError, "invalid radix %d", base);
+    if (!valid_radix_p(base))
+        invalid_radix(base);
 
-    if (RBIGNUM_LEN(x) >= LONG_MAX/BITSPERDIG) {
+    if (xn >= LONG_MAX/BITSPERDIG) {
         rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
     }
 
-    if (POW2_P(base)) {
-        /* base == 2 || base == 4 || base == 8 || base == 16 || base == 32 */
-        return big2str_base_powerof2(x, base);
-    }
-
     power_level = 0;
     power = power_cache_get_power(base, power_level, NULL);
     while (power_level < MAX_BASE36_POWER_TABLE_ENTRIES &&
-           RBIGNUM_LEN(power) <= (RBIGNUM_LEN(x)+1)/2) {
+           (size_t)BIGNUM_LEN(power) <= (xn+1)/2) {
         power_level++;
         power = power_cache_get_power(base, power_level, NULL);
     }
     assert(power_level != MAX_BASE36_POWER_TABLE_ENTRIES);
 
-    if (RBIGNUM_LEN(power) <= RBIGNUM_LEN(x)) {
+    if ((size_t)BIGNUM_LEN(power) <= xn) {
         /*
          * This increment guarantees x < power_cache_get_power(base, power_level)
          * without invoking it actually.
@@ -4485,102 +4996,135 @@ rb_big2str1(VALUE x, int base)
         power_level++;
     }
 
-    b2s_data.negative = RBIGNUM_NEGATIVE_P(x);
+    b2s_data.negative = BIGNUM_NEGATIVE_P(x);
     b2s_data.base = base;
-    b2s_data.hbase = maxpow_in_bdigit(base, &b2s_data.hbase_numdigits);
     b2s_data.hbase2 = maxpow_in_bdigit_dbl(base, &b2s_data.hbase2_numdigits);
 
     b2s_data.result = Qnil;
     b2s_data.ptr = NULL;
 
     if (power_level == 0) {
-	big2str_orig(&b2s_data, BDIGITS(x), RBIGNUM_LEN(x), 0);
+        big2str_2bdigits(&b2s_data, xds, xn, 0);
     }
     else {
-	big2str_karatsuba(&b2s_data, BDIGITS(x), RBIGNUM_LEN(x), power_level, 0, NULL, 0);
+        VALUE tmpw = 0;
+        BDIGIT *wds;
+        size_t wn;
+        wn = power_level * BIGDIVREM_EXTRA_WORDS + BIGNUM_LEN(power);
+        wds = ALLOCV_N(BDIGIT, tmpw, xn + wn);
+        MEMCPY(wds, xds, BDIGIT, xn);
+        big2str_karatsuba(&b2s_data, wds, xn, wn, power_level, 0);
+        if (tmpw)
+            ALLOCV_END(tmpw);
     }
     RB_GC_GUARD(x);
 
     *b2s_data.ptr = '\0';
     rb_str_resize(b2s_data.result, (long)(b2s_data.ptr - RSTRING_PTR(b2s_data.result)));
 
+    RB_GC_GUARD(x);
     return b2s_data.result;
 }
 
-/* deprecated */
 VALUE
-rb_big2str0(VALUE x, int base, int trim)
+rb_big2str_generic(VALUE x, int base)
+{
+    return big2str_generic(x, base);
+}
+
+#if USE_GMP
+static VALUE
+big2str_gmp(VALUE x, int base)
 {
+    mpz_t mx;
+    size_t size;
     VALUE str;
-    long oldlen;
-    long n2;
+    BDIGIT *xds = BDIGITS(x);
+    size_t xn = BIGNUM_LEN(x);
 
-    str = rb_big2str1(x, base);
+    mpz_init(mx);
+    bdigits_to_mpz(mx, xds, xn);
 
-    if (trim || FIXNUM_P(x) || BIGZEROP(x))
-        return str;
+    size = mpz_sizeinbase(mx, base);
 
-    oldlen = RSTRING_LEN(str);
-    if (oldlen && RSTRING_PTR(str)[0] != '-') {
-        rb_str_resize(str, oldlen+1);
-        MEMMOVE(RSTRING_PTR(str)+1, RSTRING_PTR(str), char, oldlen);
-        RSTRING_PTR(str)[0] = '+';
+    if (BIGNUM_NEGATIVE_P(x)) {
+        mpz_neg(mx, mx);
+        str = rb_usascii_str_new(0, size+1);
     }
-
-    n2 = big2str_find_n1(x, base);
-
-    oldlen = RSTRING_LEN(str);
-    if (oldlen-1 < n2) {
-        long off = n2 - (oldlen-1);
-        rb_str_resize(str, n2+1);
-        MEMMOVE(RSTRING_PTR(str)+1+off, RSTRING_PTR(str)+1, char, oldlen-1);
-        memset(RSTRING_PTR(str)+1, '0', off);
+    else {
+        str = rb_usascii_str_new(0, size);
     }
+    mpz_get_str(RSTRING_PTR(str), base, mx);
+    mpz_clear(mx);
 
-    RSTRING_PTR(str)[RSTRING_LEN(str)] = '\0';
+    if (RSTRING_PTR(str)[RSTRING_LEN(str)-1] == '\0') {
+        rb_str_set_len(str, RSTRING_LEN(str)-1);
+    }
 
+    RB_GC_GUARD(x);
     return str;
 }
 
 VALUE
-rb_big2str(VALUE x, int base)
+rb_big2str_gmp(VALUE x, int base)
 {
-    return rb_big2str1(x, base);
+    return big2str_gmp(x, base);
 }
-
-/*
- *  call-seq:
- *     big.to_s(base=10)   ->  string
- *
- *  Returns a string containing the representation of <i>big</i> radix
- *  <i>base</i> (2 through 36).
- *
- *     12345654321.to_s         #=> "12345654321"
- *     12345654321.to_s(2)      #=> "1011011111110110111011110000110001"
- *     12345654321.to_s(8)      #=> "133766736061"
- *     12345654321.to_s(16)     #=> "2dfdbbc31"
- *     78546939656932.to_s(36)  #=> "rubyrules"
- */
+#endif
 
 static VALUE
-rb_big_to_s(int argc, VALUE *argv, VALUE x)
+rb_big2str1(VALUE x, int base)
 {
-    int base;
+    BDIGIT *xds;
+    size_t xn;
 
-    if (argc == 0) base = 10;
-    else {
-	VALUE b;
+    if (FIXNUM_P(x)) {
+        return rb_fix2str(x, base);
+    }
+
+    bigtrunc(x);
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+    BARY_TRUNC(xds, xn);
+
+    if (xn == 0) {
+        return rb_usascii_str_new2("0");
+    }
+
+    if (!valid_radix_p(base))
+        invalid_radix(base);
+
+    if (xn >= LONG_MAX/BITSPERDIG) {
+        rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
+    }
+
+    if (POW2_P(base)) {
+        /* base == 2 || base == 4 || base == 8 || base == 16 || base == 32 */
+        return big2str_base_poweroftwo(x, base);
+    }
 
-	rb_scan_args(argc, argv, "01", &b);
-	base = NUM2INT(b);
+#if USE_GMP
+    if (GMP_BIG2STR_DIGITS < xn) {
+        return big2str_gmp(x, base);
     }
-    return rb_big2str(x, base);
+#endif
+
+    return big2str_generic(x, base);
+}
+
+VALUE
+rb_big2str(VALUE x, int base)
+{
+    return rb_big2str1(x, base);
 }
 
 static unsigned long
 big2ulong(VALUE x, const char *type)
 {
-    long len = RBIGNUM_LEN(x);
+#if SIZEOF_LONG > SIZEOF_BDIGIT
+    size_t i;
+#endif
+    size_t len = BIGNUM_LEN(x);
     unsigned long num;
     BDIGIT *ds;
 
@@ -4590,59 +5134,45 @@ big2ulong(VALUE x, const char *type)
         rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
     }
     ds = BDIGITS(x);
-#if SIZEOF_LONG <= SIZEOF_BDIGITS
+#if SIZEOF_LONG <= SIZEOF_BDIGIT
     num = (unsigned long)ds[0];
 #else
     num = 0;
-    while (len--) {
-	num <<= BITSPERDIG;
-	num += (unsigned long)ds[len]; /* overflow is already checked */
+    for (i = 0; i < len; i++) {
+        num <<= BITSPERDIG;
+        num += (unsigned long)ds[len - i - 1]; /* overflow is already checked */
     }
 #endif
     return num;
 }
 
-/* deprecated */
-VALUE
-rb_big2ulong_pack(VALUE x)
-{
-    unsigned long num;
-    rb_integer_pack(x, &num, 1, sizeof(num), 0,
-        INTEGER_PACK_NATIVE_BYTE_ORDER|INTEGER_PACK_2COMP);
-    return num;
-}
-
-VALUE
+unsigned long
 rb_big2ulong(VALUE x)
 {
     unsigned long num = big2ulong(x, "unsigned long");
 
-    if (RBIGNUM_POSITIVE_P(x)) {
+    if (BIGNUM_POSITIVE_P(x)) {
         return num;
     }
     else {
-        if (num <= LONG_MAX)
-            return -(long)num;
-        if (num == 1+(unsigned long)(-(LONG_MIN+1)))
-            return LONG_MIN;
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
     }
     rb_raise(rb_eRangeError, "bignum out of range of unsigned long");
 }
 
-SIGNED_VALUE
+long
 rb_big2long(VALUE x)
 {
     unsigned long num = big2ulong(x, "long");
 
-    if (RBIGNUM_POSITIVE_P(x)) {
+    if (BIGNUM_POSITIVE_P(x)) {
         if (num <= LONG_MAX)
             return num;
     }
     else {
-        if (num <= LONG_MAX)
-            return -(long)num;
-        if (num == 1+(unsigned long)(-(LONG_MIN+1)))
-            return LONG_MIN;
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
     }
     rb_raise(rb_eRangeError, "bignum too big to convert into `long'");
 }
@@ -4652,21 +5182,24 @@ rb_big2long(VALUE x)
 static unsigned LONG_LONG
 big2ull(VALUE x, const char *type)
 {
-    long len = RBIGNUM_LEN(x);
+#if SIZEOF_LONG_LONG > SIZEOF_BDIGIT
+    size_t i;
+#endif
+    size_t len = BIGNUM_LEN(x);
     unsigned LONG_LONG num;
     BDIGIT *ds = BDIGITS(x);
 
     if (len == 0)
         return 0;
     if (BIGSIZE(x) > SIZEOF_LONG_LONG)
-	rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
-#if SIZEOF_LONG_LONG <= SIZEOF_BDIGITS
+        rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
+#if SIZEOF_LONG_LONG <= SIZEOF_BDIGIT
     num = (unsigned LONG_LONG)ds[0];
 #else
     num = 0;
-    while (len--) {
-	num = BIGUP(num);
-	num += ds[len];
+    for (i = 0; i < len; i++) {
+        num = BIGUP(num);
+        num += ds[len - i - 1];
     }
 #endif
     return num;
@@ -4677,14 +5210,12 @@ rb_big2ull(VALUE x)
 {
     unsigned LONG_LONG num = big2ull(x, "unsigned long long");
 
-    if (RBIGNUM_POSITIVE_P(x)) {
+    if (BIGNUM_POSITIVE_P(x)) {
         return num;
     }
     else {
-        if (num <= LLONG_MAX)
-            return -(LONG_LONG)num;
-        if (num == 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
-            return LLONG_MIN;
+        if (num <= 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
+            return -(LONG_LONG)(num-1)-1;
     }
     rb_raise(rb_eRangeError, "bignum out of range of unsigned long long");
 }
@@ -4694,15 +5225,13 @@ rb_big2ll(VALUE x)
 {
     unsigned LONG_LONG num = big2ull(x, "long long");
 
-    if (RBIGNUM_POSITIVE_P(x)) {
+    if (BIGNUM_POSITIVE_P(x)) {
         if (num <= LLONG_MAX)
             return num;
     }
     else {
-        if (num <= LLONG_MAX)
-            return -(LONG_LONG)num;
-        if (num == 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
-            return LLONG_MIN;
+        if (num <= 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
+            return -(LONG_LONG)(num-1)-1;
     }
     rb_raise(rb_eRangeError, "bignum too big to convert into `long long'");
 }
@@ -4719,23 +5248,23 @@ dbl2big(double d)
     double u = (d < 0)?-d:d;
 
     if (isinf(d)) {
-	rb_raise(rb_eFloatDomainError, d < 0 ? "-Infinity" : "Infinity");
+        rb_raise(rb_eFloatDomainError, d < 0 ? "-Infinity" : "Infinity");
     }
     if (isnan(d)) {
-	rb_raise(rb_eFloatDomainError, "NaN");
+        rb_raise(rb_eFloatDomainError, "NaN");
     }
 
-    while (!POSFIXABLE(u) || 0 != (long)u) {
-	u /= (double)(BIGRAD);
-	i++;
+    while (1.0 <= u) {
+        u /= (double)(BIGRAD);
+        i++;
     }
     z = bignew(i, d>=0);
     digits = BDIGITS(z);
     while (i--) {
-	u *= BIGRAD;
-	c = (BDIGIT)u;
-	u -= c;
-	digits[i] = c;
+        u *= BIGRAD;
+        c = (BDIGIT)u;
+        u -= c;
+        digits[i] = c;
     }
 
     return z;
@@ -4751,49 +5280,54 @@ static double
 big2dbl(VALUE x)
 {
     double d = 0.0;
-    long i = (bigtrunc(x), RBIGNUM_LEN(x)), lo = 0, bits;
+    long i = (bigtrunc(x), BIGNUM_LEN(x)), lo = 0, bits;
     BDIGIT *ds = BDIGITS(x), dl;
 
     if (i) {
-	bits = i * BITSPERDIG - nlz(ds[i-1]);
-	if (bits > DBL_MANT_DIG+DBL_MAX_EXP) {
-	    d = HUGE_VAL;
-	}
-	else {
-	    if (bits > DBL_MANT_DIG+1)
-		lo = (bits -= DBL_MANT_DIG+1) / BITSPERDIG;
-	    else
-		bits = 0;
-	    while (--i > lo) {
-		d = ds[i] + BIGRAD*d;
-	    }
-	    dl = ds[i];
-	    if (bits && (dl & ((BDIGIT)1 << (bits %= BITSPERDIG)))) {
-		int carry = (dl & ~(BDIGMAX << bits)) != 0;
-		if (!carry) {
-		    while (i-- > 0) {
-			carry = ds[i] != 0;
-			if (carry) break;
-		    }
-		}
-		if (carry) {
-		    dl &= BDIGMAX << bits;
-		    dl = BIGLO(dl + ((BDIGIT)1 << bits));
-		    if (!dl) d += 1;
-		}
-	    }
-	    d = dl + BIGRAD*d;
-	    if (lo) {
-		if (lo > INT_MAX / BITSPERDIG)
-		    d = HUGE_VAL;
-		else if (lo < INT_MIN / BITSPERDIG)
-		    d = 0.0;
-		else
-		    d = ldexp(d, (int)(lo * BITSPERDIG));
-	    }
-	}
-    }
-    if (!RBIGNUM_SIGN(x)) d = -d;
+        bits = i * BITSPERDIG - nlz(ds[i-1]);
+        if (bits > DBL_MANT_DIG+DBL_MAX_EXP) {
+            d = HUGE_VAL;
+        }
+        else {
+            if (bits > DBL_MANT_DIG+1)
+                lo = (bits -= DBL_MANT_DIG+1) / BITSPERDIG;
+            else
+                bits = 0;
+            while (--i > lo) {
+                d = ds[i] + BIGRAD*d;
+            }
+            dl = ds[i];
+            if (bits && (dl & ((BDIGIT)1 << (bits %= BITSPERDIG)))) {
+                int carry = (dl & ~(BDIGMAX << bits)) != 0;
+                if (!carry) {
+                    while (i-- > 0) {
+                        carry = ds[i] != 0;
+                        if (carry) break;
+                    }
+                }
+                if (carry) {
+                    BDIGIT mask = BDIGMAX;
+                    BDIGIT bit = 1;
+                    mask <<= bits;
+                    bit <<= bits;
+                    dl &= mask;
+                    dl += bit;
+                    dl = BIGLO(dl);
+                    if (!dl) d += 1;
+                }
+            }
+            d = dl + BIGRAD*d;
+            if (lo) {
+                if (lo > INT_MAX / BITSPERDIG)
+                    d = HUGE_VAL;
+                else if (lo < INT_MIN / BITSPERDIG)
+                    d = 0.0;
+                else
+                    d = ldexp(d, (int)(lo * BITSPERDIG));
+            }
+        }
+    }
+    if (BIGNUM_NEGATIVE_P(x)) d = -d;
     return d;
 }
 
@@ -4803,30 +5337,15 @@ rb_big2dbl(VALUE x)
     double d = big2dbl(x);
 
     if (isinf(d)) {
-	rb_warning("Bignum out of Float range");
-	if (d < 0.0)
-	    d = -HUGE_VAL;
-	else
-	    d = HUGE_VAL;
+        rb_warning("Integer out of Float range");
+        if (d < 0.0)
+            d = -HUGE_VAL;
+        else
+            d = HUGE_VAL;
     }
     return d;
 }
 
-/*
- *  call-seq:
- *     big.to_f -> float
- *
- *  Converts <i>big</i> to a <code>Float</code>. If <i>big</i> doesn't
- *  fit in a <code>Float</code>, the result is infinity.
- *
- */
-
-static VALUE
-rb_big_to_f(VALUE x)
-{
-    return DBL2NUM(rb_big2dbl(x));
-}
-
 VALUE
 rb_integer_float_cmp(VALUE x, VALUE y)
 {
@@ -4850,16 +5369,16 @@ rb_integer_float_cmp(VALUE x, VALUE y)
             return INT2FIX(1);
         return INT2FIX(0);
 #else
-        long xl, yl;
+        long xn, yn;
         if (yi < FIXNUM_MIN)
             return INT2FIX(1);
         if (FIXNUM_MAX+1 <= yi)
             return INT2FIX(-1);
-        xl = FIX2LONG(x);
-        yl = (long)yi;
-        if (xl < yl)
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        if (xn < yn)
             return INT2FIX(-1);
-        if (xl > yl)
+        if (xn > yn)
             return INT2FIX(1);
         if (yf < 0.0)
             return INT2FIX(1);
@@ -4877,13 +5396,22 @@ rb_integer_float_cmp(VALUE x, VALUE y)
     return INT2FIX(-1);
 }
 
+#if SIZEOF_LONG * CHAR_BIT >= DBL_MANT_DIG /* assume FLT_RADIX == 2 */
+COMPILER_WARNING_PUSH
+#if __has_warning("-Wimplicit-int-float-conversion")
+COMPILER_WARNING_IGNORED(-Wimplicit-int-float-conversion)
+#endif
+static const double LONG_MAX_as_double = LONG_MAX;
+COMPILER_WARNING_POP
+#endif
+
 VALUE
 rb_integer_float_eq(VALUE x, VALUE y)
 {
     double yd = RFLOAT_VALUE(y);
     double yi, yf;
 
-    if (isnan(yd) || isinf(yd))
+    if (!isfinite(yd))
         return Qfalse;
     yf = modf(yd, &yi);
     if (yf != 0)
@@ -4891,64 +5419,47 @@ rb_integer_float_eq(VALUE x, VALUE y)
     if (FIXNUM_P(x)) {
 #if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
         double xd = (double)FIX2LONG(x);
-        if (xd != yd)
-            return Qfalse;
-        return Qtrue;
+        return RBOOL(xd == yd);
 #else
-        long xl, yl;
-        if (yi < LONG_MIN || LONG_MAX < yi)
-            return Qfalse;
-        xl = FIX2LONG(x);
-        yl = (long)yi;
-        if (xl != yl)
+        long xn, yn;
+        if (yi < LONG_MIN || LONG_MAX_as_double <= yi)
             return Qfalse;
-        return Qtrue;
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        return RBOOL(xn == yn);
 #endif
     }
     y = rb_dbl2big(yi);
     return rb_big_eq(x, y);
 }
 
-/*
- *  call-seq:
- *     big <=> numeric   -> -1, 0, +1 or nil
- *
- *  Comparison---Returns -1, 0, or +1 depending on whether +big+ is
- *  less than, equal to, or greater than +numeric+. This is the
- *  basis for the tests in Comparable.
- *
- *  +nil+ is returned if the two values are incomparable.
- *
- */
 
 VALUE
 rb_big_cmp(VALUE x, VALUE y)
 {
-    int cmp;
-
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      case T_FLOAT:
+    if (FIXNUM_P(y)) {
+        x = bigfixize(x);
+        if (FIXNUM_P(x)) {
+            /* SIGNED_VALUE and Fixnum have same sign-bits, same
+             * order */
+            SIGNED_VALUE sx = (SIGNED_VALUE)x, sy = (SIGNED_VALUE)y;
+            if (sx < sy) return INT2FIX(-1);
+            return INT2FIX(sx > sy);
+        }
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        if (BIGNUM_SIGN(x) == BIGNUM_SIGN(y)) {
+            int cmp = bary_cmp(BDIGITS(x), BIGNUM_LEN(x), BDIGITS(y), BIGNUM_LEN(y));
+            return INT2FIX(BIGNUM_SIGN(x) ? cmp : -cmp);
+        }
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
         return rb_integer_float_cmp(x, y);
-
-      default:
-	return rb_num_coerce_cmp(x, y, rb_intern("<=>"));
     }
-
-    if (RBIGNUM_SIGN(x) > RBIGNUM_SIGN(y)) return INT2FIX(1);
-    if (RBIGNUM_SIGN(x) < RBIGNUM_SIGN(y)) return INT2FIX(-1);
-
-    cmp = bary_cmp(BDIGITS(x), RBIGNUM_LEN(x), BDIGITS(y), RBIGNUM_LEN(y));
-    if (RBIGNUM_SIGN(x))
-        return INT2FIX(cmp);
-    else
-        return INT2FIX(-cmp);
+    else {
+        return rb_num_coerce_cmp(x, y, idCmp);
+    }
+    return INT2FIX(BIGNUM_SIGN(x) ? 1 : -1);
 }
 
 enum big_op_t {
@@ -4964,93 +5475,55 @@ big_op(VALUE x, VALUE y, enum big_op_t op)
     VALUE rel;
     int n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-      case T_BIGNUM:
-	rel = rb_big_cmp(x, y);
-	break;
-
-      case T_FLOAT:
+    if (RB_INTEGER_TYPE_P(y)) {
+        rel = rb_big_cmp(x, y);
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
         rel = rb_integer_float_cmp(x, y);
-        break;
-
-      default:
-	{
-	    ID id = 0;
-	    switch (op) {
-		case big_op_gt: id = '>'; break;
-		case big_op_ge: id = rb_intern(">="); break;
-		case big_op_lt: id = '<'; break;
-		case big_op_le: id = rb_intern("<="); break;
-	    }
-	    return rb_num_coerce_relop(x, y, id);
-	}
+    }
+    else {
+        ID id = 0;
+        switch (op) {
+          case big_op_gt: id = '>'; break;
+          case big_op_ge: id = idGE; break;
+          case big_op_lt: id = '<'; break;
+          case big_op_le: id = idLE; break;
+        }
+        return rb_num_coerce_relop(x, y, id);
     }
 
     if (NIL_P(rel)) return Qfalse;
     n = FIX2INT(rel);
 
     switch (op) {
-	case big_op_gt: return n >  0 ? Qtrue : Qfalse;
-	case big_op_ge: return n >= 0 ? Qtrue : Qfalse;
-	case big_op_lt: return n <  0 ? Qtrue : Qfalse;
-	case big_op_le: return n <= 0 ? Qtrue : Qfalse;
+        case big_op_gt: return RBOOL(n >  0);
+        case big_op_ge: return RBOOL(n >= 0);
+        case big_op_lt: return RBOOL(n <  0);
+        case big_op_le: return RBOOL(n <= 0);
     }
     return Qundef;
 }
 
-/*
- * call-seq:
- *   big > real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * greater than that of <code>real</code>.
- */
-
-static VALUE
-big_gt(VALUE x, VALUE y)
+VALUE
+rb_big_gt(VALUE x, VALUE y)
 {
     return big_op(x, y, big_op_gt);
 }
 
-/*
- * call-seq:
- *   big >= real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * greater than or equal to that of <code>real</code>.
- */
-
-static VALUE
-big_ge(VALUE x, VALUE y)
+VALUE
+rb_big_ge(VALUE x, VALUE y)
 {
     return big_op(x, y, big_op_ge);
 }
 
-/*
- * call-seq:
- *   big < real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * less than that of <code>real</code>.
- */
-
-static VALUE
-big_lt(VALUE x, VALUE y)
+VALUE
+rb_big_lt(VALUE x, VALUE y)
 {
     return big_op(x, y, big_op_lt);
 }
 
-/*
- * call-seq:
- *   big <= real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * less than or equal to that of <code>real</code>.
- */
-
-static VALUE
-big_le(VALUE x, VALUE y)
+VALUE
+rb_big_le(VALUE x, VALUE y)
 {
     return big_op(x, y, big_op_le);
 }
@@ -5060,8 +5533,8 @@ big_le(VALUE x, VALUE y)
  *     big == obj  -> true or false
  *
  *  Returns <code>true</code> only if <i>obj</i> has the same value
- *  as <i>big</i>. Contrast this with <code>Bignum#eql?</code>, which
- *  requires <i>obj</i> to be a <code>Bignum</code>.
+ *  as <i>big</i>. Contrast this with Integer#eql?, which requires
+ *  <i>obj</i> to be an Integer.
  *
  *     68719476736 == 68719476736.0   #=> true
  */
@@ -5069,95 +5542,62 @@ big_le(VALUE x, VALUE y)
 VALUE
 rb_big_eq(VALUE x, VALUE y)
 {
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	if (bignorm(x) == y) return Qtrue;
-	y = rb_int2big(FIX2LONG(y));
-	break;
-      case T_BIGNUM:
-	break;
-      case T_FLOAT:
+    if (FIXNUM_P(y)) {
+        return RBOOL(bignorm(x) == y);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
         return rb_integer_float_eq(x, y);
-      default:
-	return rb_equal(y, x);
     }
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y)) return Qfalse;
-    if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
-    if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
-    return Qtrue;
+    else {
+        return rb_equal(y, x);
+    }
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y)) return Qfalse;
+    if (BIGNUM_LEN(x) != BIGNUM_LEN(y)) return Qfalse;
+    return RBOOL(MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,BIGNUM_LEN(y)) == 0);
 }
 
-/*
- *  call-seq:
- *     big.eql?(obj)   -> true or false
- *
- *  Returns <code>true</code> only if <i>obj</i> is a
- *  <code>Bignum</code> with the same value as <i>big</i>. Contrast this
- *  with <code>Bignum#==</code>, which performs type conversions.
- *
- *     68719476736.eql?(68719476736.0)   #=> false
- */
-
 VALUE
 rb_big_eql(VALUE x, VALUE y)
 {
-    if (!RB_TYPE_P(y, T_BIGNUM)) return Qfalse;
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y)) return Qfalse;
-    if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
-    if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
-    return Qtrue;
+    if (!RB_BIGNUM_TYPE_P(y)) return Qfalse;
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y)) return Qfalse;
+    if (BIGNUM_LEN(x) != BIGNUM_LEN(y)) return Qfalse;
+    return RBOOL(MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,BIGNUM_LEN(y)) == 0);
 }
 
-/*
- * call-seq:
- *    -big   ->  integer
- *
- * Unary minus (returns an integer whose value is 0-big)
- */
-
 VALUE
 rb_big_uminus(VALUE x)
 {
     VALUE z = rb_big_clone(x);
 
-    RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(x));
+    BIGNUM_NEGATE(z);
 
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     ~big  ->  integer
- *
- * Inverts the bits in big. As Bignums are conceptually infinite
- * length, the result acts as if it had an infinite number of one
- * bits to the left. In hex representations, this is displayed
- * as two periods to the left of the digits.
- *
- *   sprintf("%X", ~0x1122334455)    #=> "..FEEDDCCBBAA"
- */
-
-static VALUE
-rb_big_neg(VALUE x)
+VALUE
+rb_big_comp(VALUE x)
 {
     VALUE z = rb_big_clone(x);
     BDIGIT *ds = BDIGITS(z);
-    long n = RBIGNUM_LEN(z);
+    long n = BIGNUM_LEN(z);
 
     if (!n) return INT2FIX(-1);
 
-    if (RBIGNUM_POSITIVE_P(z)) {
+    if (BIGNUM_POSITIVE_P(z)) {
         if (bary_add_one(ds, n)) {
             big_extend_carry(z);
         }
-        RBIGNUM_SET_NEGATIVE_SIGN(z);
+        BIGNUM_SET_NEGATIVE_SIGN(z);
     }
     else {
         bary_neg(ds, n);
         if (bary_add_one(ds, n))
             return INT2FIX(-1);
         bary_neg(ds, n);
-        RBIGNUM_SET_POSITIVE_SIGN(z);
+        BIGNUM_SET_POSITIVE_SIGN(z);
     }
 
     return bignorm(z);
@@ -5170,8 +5610,8 @@ bigsub(VALUE x, VALUE y)
     BDIGIT *xds, *yds, *zds;
     long xn, yn, zn;
 
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
     zn = xn < yn ? yn : xn;
 
     z = bignew(zn, 1);
@@ -5182,7 +5622,7 @@ bigsub(VALUE x, VALUE y)
 
     if (bary_sub(zds, zn, xds, xn, yds, yn)) {
         bary_2comp(zds, zn);
-        RBIGNUM_SET_NEGATIVE_SIGN(z);
+        BIGNUM_SET_NEGATIVE_SIGN(z);
     }
 
     return z;
@@ -5201,27 +5641,27 @@ bigsub_int(VALUE x, long y0)
 
     y = y0;
     xds = BDIGITS(x);
-    xn = RBIGNUM_LEN(x);
+    xn = BIGNUM_LEN(x);
 
     if (xn == 0)
         return LONG2NUM(-y0);
 
     zn = xn;
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     if (zn < bdigit_roomof(SIZEOF_LONG))
         zn = bdigit_roomof(SIZEOF_LONG);
 #endif
-    z = bignew(zn, RBIGNUM_SIGN(x));
+    z = bignew(zn, BIGNUM_SIGN(x));
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     assert(xn == zn);
     num = (BDIGIT_DBL_SIGNED)xds[0] - y;
     if (xn == 1 && num < 0) {
-	RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(x));
-	zds[0] = (BDIGIT)-num;
-	RB_GC_GUARD(x);
-	return bignorm(z);
+        BIGNUM_NEGATE(z);
+        zds[0] = (BDIGIT)-num;
+        RB_GC_GUARD(x);
+        return bignorm(z);
     }
     zds[0] = BIGLO(num);
     num = BIGDN(num);
@@ -5233,10 +5673,10 @@ bigsub_int(VALUE x, long y0)
     num = 0;
     for (i=0; i < xn; i++) {
         if (y == 0) goto y_is_zero_x;
-	num += (BDIGIT_DBL_SIGNED)xds[i] - BIGLO(y);
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-	y = BIGDN(y);
+        num += (BDIGIT_DBL_SIGNED)xds[i] - BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
     }
     for (; i < zn; i++) {
         if (y == 0) goto y_is_zero_z;
@@ -5251,11 +5691,11 @@ bigsub_int(VALUE x, long y0)
     for (; i < xn; i++) {
       y_is_zero_x:
         if (num == 0) goto num_is_zero_x;
-	num += xds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        num += xds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     for (; i < zn; i++) {
       y_is_zero_z:
         if (num == 0) goto num_is_zero_z;
@@ -5267,9 +5707,9 @@ bigsub_int(VALUE x, long y0)
 
     for (; i < xn; i++) {
       num_is_zero_x:
-	zds[i] = xds[i];
+        zds[i] = xds[i];
     }
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     for (; i < zn; i++) {
       num_is_zero_z:
         zds[i] = 0;
@@ -5281,7 +5721,7 @@ bigsub_int(VALUE x, long y0)
     assert(num == 0 || num == -1);
     if (num < 0) {
         get2comp(z);
-	RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(x));
+        BIGNUM_NEGATE(z);
     }
     RB_GC_GUARD(x);
     return bignorm(z);
@@ -5297,22 +5737,22 @@ bigadd_int(VALUE x, long y)
     long i;
 
     xds = BDIGITS(x);
-    xn = RBIGNUM_LEN(x);
+    xn = BIGNUM_LEN(x);
 
     if (xn == 0)
         return LONG2NUM(y);
 
     zn = xn;
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     if (zn < bdigit_roomof(SIZEOF_LONG))
         zn = bdigit_roomof(SIZEOF_LONG);
 #endif
     zn++;
 
-    z = bignew(zn, RBIGNUM_SIGN(x));
+    z = bignew(zn, BIGNUM_SIGN(x));
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     num = (BDIGIT_DBL)xds[0] + y;
     zds[0] = BIGLO(num);
     num = BIGDN(num);
@@ -5324,17 +5764,17 @@ bigadd_int(VALUE x, long y)
     num = 0;
     for (i=0; i < xn; i++) {
         if (y == 0) goto y_is_zero_x;
-	num += (BDIGIT_DBL)xds[i] + BIGLO(y);
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-	y = BIGDN(y);
+        num += (BDIGIT_DBL)xds[i] + BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
     }
     for (; i < zn; i++) {
         if (y == 0) goto y_is_zero_z;
-	num += BIGLO(y);
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-	y = BIGDN(y);
+        num += BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
     }
     goto finish;
 
@@ -5343,25 +5783,25 @@ bigadd_int(VALUE x, long y)
     for (;i < xn; i++) {
       y_is_zero_x:
         if (num == 0) goto num_is_zero_x;
-	num += (BDIGIT_DBL)xds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        num += (BDIGIT_DBL)xds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     for (; i < zn; i++) {
       y_is_zero_z:
         if (num == 0) goto num_is_zero_z;
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
     goto finish;
 
     for (;i < xn; i++) {
       num_is_zero_x:
-	zds[i] = xds[i];
+        zds[i] = xds[i];
     }
     for (; i < zn; i++) {
       num_is_zero_z:
-	zds[i] = 0;
+        zds[i] = 0;
     }
     goto finish;
 
@@ -5374,106 +5814,87 @@ static VALUE
 bigadd(VALUE x, VALUE y, int sign)
 {
     VALUE z;
-    long len;
+    size_t len;
 
-    sign = (sign == RBIGNUM_SIGN(y));
-    if (RBIGNUM_SIGN(x) != sign) {
-	if (sign) return bigsub(y, x);
-	return bigsub(x, y);
+    sign = (sign == BIGNUM_SIGN(y));
+    if (BIGNUM_SIGN(x) != sign) {
+        if (sign) return bigsub(y, x);
+        return bigsub(x, y);
     }
 
-    if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
-	len = RBIGNUM_LEN(x) + 1;
+    if (BIGNUM_LEN(x) > BIGNUM_LEN(y)) {
+        len = BIGNUM_LEN(x) + 1;
     }
     else {
-	len = RBIGNUM_LEN(y) + 1;
+        len = BIGNUM_LEN(y) + 1;
     }
     z = bignew(len, sign);
 
-    bary_add(BDIGITS(z), RBIGNUM_LEN(z),
-             BDIGITS(x), RBIGNUM_LEN(x),
-             BDIGITS(y), RBIGNUM_LEN(y));
+    bary_add(BDIGITS(z), BIGNUM_LEN(z),
+             BDIGITS(x), BIGNUM_LEN(x),
+             BDIGITS(y), BIGNUM_LEN(y));
 
     return z;
 }
 
-/*
- *  call-seq:
- *     big + other  -> Numeric
- *
- *  Adds big and other, returning the result.
- */
-
 VALUE
 rb_big_plus(VALUE x, VALUE y)
 {
     long n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	n = FIX2LONG(y);
-	if ((n > 0) != RBIGNUM_SIGN(x)) {
-	    if (n < 0) {
-		n = -n;
-	    }
-	    return bigsub_int(x, n);
-	}
-	if (n < 0) {
-	    n = -n;
-	}
-	return bigadd_int(x, n);
-
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 1));
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) + RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '+');
+    if (FIXNUM_P(y)) {
+        n = FIX2LONG(y);
+        if ((n > 0) != BIGNUM_SIGN(x)) {
+            if (n < 0) {
+                n = -n;
+            }
+            return bigsub_int(x, n);
+        }
+        if (n < 0) {
+            n = -n;
+        }
+        return bigadd_int(x, n);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return bignorm(bigadd(x, y, 1));
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) + RFLOAT_VALUE(y));
+    }
+    else {
+        return rb_num_coerce_bin(x, y, '+');
     }
 }
 
-/*
- *  call-seq:
- *     big - other  -> Numeric
- *
- *  Subtracts other from big, returning the result.
- */
-
 VALUE
 rb_big_minus(VALUE x, VALUE y)
 {
     long n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	n = FIX2LONG(y);
-	if ((n > 0) != RBIGNUM_SIGN(x)) {
-	    if (n < 0) {
-		n = -n;
-	    }
-	    return bigadd_int(x, n);
-	}
-	if (n < 0) {
-	    n = -n;
-	}
-	return bigsub_int(x, n);
-
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 0));
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) - RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '-');
+    if (FIXNUM_P(y)) {
+        n = FIX2LONG(y);
+        if ((n > 0) != BIGNUM_SIGN(x)) {
+            if (n < 0) {
+                n = -n;
+            }
+            return bigadd_int(x, n);
+        }
+        if (n < 0) {
+            n = -n;
+        }
+        return bigsub_int(x, n);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return bignorm(bigadd(x, y, 0));
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) - RFLOAT_VALUE(y));
+    }
+    else {
+        return rb_num_coerce_bin(x, y, '-');
     }
 }
 
-
-static VALUE bigdivrem(VALUE, VALUE, volatile VALUE*, volatile VALUE*);
-
 static VALUE
 bigsq(VALUE x)
 {
@@ -5481,7 +5902,7 @@ bigsq(VALUE x)
     VALUE z;
     BDIGIT *xds, *zds;
 
-    xn = RBIGNUM_LEN(x);
+    xn = BIGNUM_LEN(x);
     zn = 2 * xn;
 
     z = bignew(zn, 1);
@@ -5489,7 +5910,7 @@ bigsq(VALUE x)
     xds = BDIGITS(x);
     zds = BDIGITS(z);
 
-    if (xn < KARATSUBA_MUL_DIGITS)
+    if (xn < NAIVE_MUL_DIGITS)
         bary_sq_fast(zds, zn, xds, xn);
     else
         bary_mul(zds, zn, xds, xn, xds, xn);
@@ -5508,11 +5929,11 @@ bigmul0(VALUE x, VALUE y)
     if (x == y)
         return bigsq(x);
 
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
     zn = xn + yn;
 
-    z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+    z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
 
     xds = BDIGITS(x);
     yds = BDIGITS(y);
@@ -5525,29 +5946,19 @@ bigmul0(VALUE x, VALUE y)
     return z;
 }
 
-/*
- *  call-seq:
- *     big * other  -> Numeric
- *
- *  Multiplies big and other, returning the result.
- */
-
 VALUE
 rb_big_mul(VALUE x, VALUE y)
 {
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) * RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '*');
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) * RFLOAT_VALUE(y));
+    }
+    else {
+        return rb_num_coerce_bin(x, y, '*');
     }
 
     return bignorm(bigmul0(x, y));
@@ -5556,52 +5967,54 @@ rb_big_mul(VALUE x, VALUE y)
 static VALUE
 bigdivrem(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
 {
-    long nx = RBIGNUM_LEN(x), ny = RBIGNUM_LEN(y), nz;
-    long j;
-    VALUE z, zz;
-    VALUE tmpy = 0, tmpz = 0;
-    BDIGIT *xds, *yds, *zds, *tds;
+    long xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y);
+    VALUE z;
+    BDIGIT *xds, *yds, *zds;
     BDIGIT dd;
 
+    VALUE q = Qnil, r = Qnil;
+    BDIGIT *qds, *rds;
+    long qn, rn;
+
     yds = BDIGITS(y);
-    while (0 < ny && !yds[ny-1]) ny--;
-    if (ny == 0)
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
         rb_num_zerodiv();
 
     xds = BDIGITS(x);
-    while (0 < nx && !xds[nx-1]) nx--;
-
-    if (nx < ny || (nx == ny && xds[nx - 1] < yds[ny - 1])) {
-	if (divp) *divp = rb_int2big(0);
-	if (modp) *modp = x;
-	return Qnil;
-    }
-    if (ny == 1) {
-	dd = yds[0];
-	z = bignew(nx, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-	zds = BDIGITS(z);
-        dd = bigdivrem_single(zds, xds, nx, dd);
-	if (modp) {
-	    *modp = rb_uint2big((VALUE)dd);
-	    RBIGNUM_SET_SIGN(*modp, RBIGNUM_SIGN(x));
-	}
-	if (divp) *divp = z;
-	return Qnil;
-    }
-    if (nx == 2 && ny == 2) {
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1])) {
+        if (divp) *divp = rb_int2big(0);
+        if (modp) *modp = x;
+        return Qnil;
+    }
+    if (yn == 1) {
+        dd = yds[0];
+        z = bignew(xn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+        zds = BDIGITS(z);
+        dd = bigdivrem_single(zds, xds, xn, dd);
+        if (modp) {
+            *modp = rb_uint2big((uintptr_t)dd);
+            BIGNUM_SET_SIGN(*modp, BIGNUM_SIGN(x));
+        }
+        if (divp) *divp = z;
+        return Qnil;
+    }
+    if (xn == 2 && yn == 2) {
         BDIGIT_DBL x0 = bary2bdigitdbl(xds, 2);
         BDIGIT_DBL y0 = bary2bdigitdbl(yds, 2);
         BDIGIT_DBL q0 = x0 / y0;
         BDIGIT_DBL r0 = x0 % y0;
         if (divp) {
-            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
             zds = BDIGITS(z);
             zds[0] = BIGLO(q0);
             zds[1] = BIGLO(BIGDN(q0));
             *divp = z;
         }
         if (modp) {
-            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), RBIGNUM_SIGN(x));
+            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), BIGNUM_SIGN(x));
             zds = BDIGITS(z);
             zds[0] = BIGLO(r0);
             zds[1] = BIGLO(BIGDN(r0));
@@ -5610,33 +6023,37 @@ bigdivrem(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
         return Qnil;
     }
 
-    if (BDIGIT_MSB(yds[ny-1]) == 0) {
-        /* Make yds modifiable. */
-        tds = ALLOCV_N(BDIGIT, tmpy, ny);
-        MEMCPY(tds, yds, BDIGIT, ny);
-        yds = tds;
+    if (divp) {
+        qn = xn + BIGDIVREM_EXTRA_WORDS;
+        q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+        qds = BDIGITS(q);
+    }
+    else {
+        qn = 0;
+        qds = NULL;
     }
 
-    nz = nx + bigdivrem_num_extra_words(nx, ny);
-    zds = ALLOCV_N(BDIGIT, tmpz, nz);
-    bigdivrem_normal(zds, nz, xds, nx, yds, ny, modp != NULL);
+    if (modp) {
+        rn = yn;
+        r = bignew(rn, BIGNUM_SIGN(x));
+        rds = BDIGITS(r);
+    }
+    else {
+        rn = 0;
+        rds = NULL;
+    }
 
-    if (divp) {			/* move quotient down in z */
-        j = nz - ny;
-	while (0 < j && !zds[j-1+ny])
-            j--;
-	*divp = zz = bignew(j, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-        MEMCPY(BDIGITS(zz), zds+ny, BDIGIT, j);
+    bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    if (divp) {
+        bigtrunc(q);
+        *divp = q;
     }
-    if (modp) {			/* normalize remainder */
-	while (ny > 0 && !zds[ny-1]) --ny;
-	*modp = zz = bignew(ny, RBIGNUM_SIGN(x));
-	MEMCPY(BDIGITS(zz), zds, BDIGIT, ny);
+    if (modp) {
+        bigtrunc(r);
+        *modp = r;
     }
-    if (tmpy)
-        ALLOCV_END(tmpy);
-    if (tmpz)
-        ALLOCV_END(tmpz);
+
     return Qnil;
 }
 
@@ -5646,12 +6063,12 @@ bigdivmod(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
     VALUE mod;
 
     bigdivrem(x, y, divp, &mod);
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y) && !BIGZEROP(mod)) {
-	if (divp) *divp = bigadd(*divp, rb_int2big(1), 0);
-	if (modp) *modp = bigadd(mod, y, 1);
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y) && !BIGZEROP(mod)) {
+        if (divp) *divp = bigadd(*divp, rb_int2big(1), 0);
+        if (modp) *modp = bigadd(mod, y, 1);
     }
     else if (modp) {
-	*modp = mod;
+        *modp = mod;
     }
 }
 
@@ -5661,144 +6078,86 @@ rb_big_divide(VALUE x, VALUE y, ID op)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      case T_FLOAT:
-	{
-	    if (op == '/') {
-		return DBL2NUM(rb_big2dbl(x) / RFLOAT_VALUE(y));
-	    }
-	    else {
-		double dy = RFLOAT_VALUE(y);
-		if (dy == 0.0) rb_num_zerodiv();
-		return rb_dbl2big(rb_big2dbl(x) / dy);
-	    }
-	}
-
-      default:
-	return rb_num_coerce_bin(x, y, op);
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        if (op == '/') {
+            double dx = rb_big2dbl(x);
+            return rb_flo_div_flo(DBL2NUM(dx), y);
+        }
+        else {
+            VALUE v;
+            double dy = RFLOAT_VALUE(y);
+            if (dy == 0.0) rb_num_zerodiv();
+            v = rb_big_divide(x, y, '/');
+            return rb_dbl2big(RFLOAT_VALUE(v));
+        }
+    }
+    else {
+        return rb_num_coerce_bin(x, y, op);
     }
     bigdivmod(x, y, &z, 0);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big / other     -> Numeric
- *
- * Performs division: the class of the resulting object depends on
- * the class of <code>numeric</code> and on the magnitude of the
- * result.
- */
-
 VALUE
 rb_big_div(VALUE x, VALUE y)
 {
     return rb_big_divide(x, y, '/');
 }
 
-/*
- *  call-seq:
- *     big.div(other)  -> integer
- *
- * Performs integer division: returns integer value.
- */
-
 VALUE
 rb_big_idiv(VALUE x, VALUE y)
 {
-    return rb_big_divide(x, y, rb_intern("div"));
+    return rb_big_divide(x, y, idDiv);
 }
 
-/*
- *  call-seq:
- *     big % other         -> Numeric
- *     big.modulo(other)   -> Numeric
- *
- *  Returns big modulo other. See Numeric.divmod for more
- *  information.
- */
-
 VALUE
 rb_big_modulo(VALUE x, VALUE y)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, '%');
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, '%');
     }
     bigdivmod(x, y, 0, &z);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big.remainder(numeric)    -> number
- *
- *  Returns the remainder after dividing <i>big</i> by <i>numeric</i>.
- *
- *     -1234567890987654321.remainder(13731)      #=> -6966
- *     -1234567890987654321.remainder(13731.24)   #=> -9906.22531493148
- */
-static VALUE
+VALUE
 rb_big_remainder(VALUE x, VALUE y)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("remainder"));
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, rb_intern("remainder"));
     }
     bigdivrem(x, y, 0, &z);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big.divmod(numeric)   -> array
- *
- *  See <code>Numeric#divmod</code>.
- *
- */
 VALUE
 rb_big_divmod(VALUE x, VALUE y)
 {
     VALUE div, mod;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("divmod"));
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, idDivmod);
     }
     bigdivmod(x, y, &div, &mod);
 
@@ -5809,113 +6168,94 @@ static VALUE
 big_shift(VALUE x, long n)
 {
     if (n < 0)
-	return big_lshift(x, 1+(unsigned long)(-(n+1)));
+        return big_lshift(x, 1+(unsigned long)(-(n+1)));
     else if (n > 0)
-	return big_rshift(x, (unsigned long)n);
+        return big_rshift(x, (unsigned long)n);
     return x;
 }
 
-static VALUE
-big_fdiv(VALUE x, VALUE y)
+enum {DBL_BIGDIG = ((DBL_MANT_DIG + BITSPERDIG) / BITSPERDIG)};
+
+static double
+big_fdiv(VALUE x, VALUE y, long ey)
 {
-#define DBL_BIGDIG ((DBL_MANT_DIG + BITSPERDIG) / BITSPERDIG)
     VALUE z;
-    long l, ex, ey;
-    int i;
+    long l, ex;
 
     bigtrunc(x);
-    l = RBIGNUM_LEN(x);
+    l = BIGNUM_LEN(x);
     ex = l * BITSPERDIG - nlz(BDIGITS(x)[l-1]);
     ex -= 2 * DBL_BIGDIG * BITSPERDIG;
+    if (ex > BITSPERDIG) ex -= BITSPERDIG;
+    else if (ex > 0) ex = 0;
     if (ex) x = big_shift(x, ex);
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-      case T_BIGNUM:
-	bigtrunc(y);
-	l = RBIGNUM_LEN(y);
-	ey = l * BITSPERDIG - nlz(BDIGITS(y)[l-1]);
-	ey -= DBL_BIGDIG * BITSPERDIG;
-	if (ey) y = big_shift(y, ey);
-	break;
-      case T_FLOAT:
-	y = dbl2big(ldexp(frexp(RFLOAT_VALUE(y), &i), DBL_MANT_DIG));
-	ey = i - DBL_MANT_DIG;
-	break;
-      default:
-	rb_bug("big_fdiv");
-    }
     bigdivrem(x, y, &z, 0);
     l = ex - ey;
 #if SIZEOF_LONG > SIZEOF_INT
     {
-	/* Visual C++ can't be here */
-	if (l > INT_MAX) return DBL2NUM(INFINITY);
-	if (l < INT_MIN) return DBL2NUM(0.0);
+        /* Visual C++ can't be here */
+        if (l > INT_MAX) return HUGE_VAL;
+        if (l < INT_MIN) return 0.0;
     }
 #endif
-    return DBL2NUM(ldexp(big2dbl(z), (int)l));
+    return ldexp(big2dbl(z), (int)l);
 }
 
-/*
- *  call-seq:
-  *     big.fdiv(numeric) -> float
- *
- *  Returns the floating point result of dividing <i>big</i> by
- *  <i>numeric</i>.
- *
- *     -1234567890987654321.fdiv(13731)      #=> -89910996357705.5
- *     -1234567890987654321.fdiv(13731.24)   #=> -89909424858035.7
- *
- */
+static double
+big_fdiv_int(VALUE x, VALUE y)
+{
+    long l, ey;
+    bigtrunc(y);
+    l = BIGNUM_LEN(y);
+    ey = l * BITSPERDIG - nlz(BDIGITS(y)[l-1]);
+    ey -= DBL_BIGDIG * BITSPERDIG;
+    if (ey) y = big_shift(y, ey);
+    return big_fdiv(x, y, ey);
+}
 
+static double
+big_fdiv_float(VALUE x, VALUE y)
+{
+    int i;
+    y = dbl2big(ldexp(frexp(RFLOAT_VALUE(y), &i), DBL_MANT_DIG));
+    return big_fdiv(x, y, i - DBL_MANT_DIG);
+}
 
-VALUE
-rb_big_fdiv(VALUE x, VALUE y)
+double
+rb_big_fdiv_double(VALUE x, VALUE y)
 {
     double dx, dy;
+    VALUE v;
 
     dx = big2dbl(x);
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	dy = (double)FIX2LONG(y);
-	if (isinf(dx))
-	    return big_fdiv(x, y);
-	break;
-
-      case T_BIGNUM:
-	dy = rb_big2dbl(y);
-	if (isinf(dx) || isinf(dy))
-	    return big_fdiv(x, y);
-	break;
-
-      case T_FLOAT:
-	dy = RFLOAT_VALUE(y);
-	if (isnan(dy))
-	    return y;
-	if (isinf(dx))
-	    return big_fdiv(x, y);
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("fdiv"));
+    if (FIXNUM_P(y)) {
+        dy = (double)FIX2LONG(y);
+        if (isinf(dx))
+            return big_fdiv_int(x, rb_int2big(FIX2LONG(y)));
     }
-    return DBL2NUM(dx / dy);
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return big_fdiv_int(x, y);
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        dy = RFLOAT_VALUE(y);
+        if (isnan(dy))
+            return dy;
+        if (isinf(dx))
+            return big_fdiv_float(x, y);
+    }
+    else {
+        return NUM2DBL(rb_num_coerce_bin(x, y, idFdiv));
+    }
+    v = rb_flo_div_flo(DBL2NUM(dx), DBL2NUM(dy));
+    return NUM2DBL(v);
 }
 
-/*
- *  call-seq:
- *     big ** exponent   -> numeric
- *
- *  Raises _big_ to the _exponent_ power (which may be an integer, float,
- *  or anything that will coerce to a number). The result may be
- *  a Fixnum, Bignum, or Float
- *
- *    123456789 ** 2      #=> 15241578750190521
- *    123456789 ** 1.2    #=> 5126464716.09932
- *    123456789 ** -2     #=> 6.5610001194102e-17
- */
+VALUE
+rb_big_fdiv(VALUE x, VALUE y)
+{
+    return DBL2NUM(rb_big_fdiv_double(x, y));
+}
 
 VALUE
 rb_big_pow(VALUE x, VALUE y)
@@ -5925,52 +6265,55 @@ rb_big_pow(VALUE x, VALUE y)
 
   again:
     if (y == INT2FIX(0)) return INT2FIX(1);
-    switch (TYPE(y)) {
-      case T_FLOAT:
-	d = RFLOAT_VALUE(y);
-	if ((!RBIGNUM_SIGN(x) && !BIGZEROP(x)) && d != round(d))
-	    return rb_funcall(rb_complex_raw1(x), rb_intern("**"), 1, y);
-	break;
-
-      case T_BIGNUM:
-	y = bignorm(y);
-	if (FIXNUM_P(y))
-	    goto again;
-	rb_warn("in a**b, b may be too big");
-	d = rb_big2dbl(y);
-	break;
-
-      case T_FIXNUM:
-	yy = FIX2LONG(y);
-
-	if (yy < 0)
-	    return rb_funcall(rb_rational_raw1(x), rb_intern("**"), 1, y);
-	else {
-	    VALUE z = 0;
-	    SIGNED_VALUE mask;
+    if (y == INT2FIX(1)) return x;
+    if (RB_FLOAT_TYPE_P(y)) {
+        d = RFLOAT_VALUE(y);
+        if ((BIGNUM_NEGATIVE_P(x) && !BIGZEROP(x))) {
+            return rb_dbl_complex_new_polar_pi(pow(-rb_big2dbl(x), d), d);
+        }
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        y = bignorm(y);
+        if (FIXNUM_P(y))
+            goto again;
+        rb_warn("in a**b, b may be too big");
+        d = rb_big2dbl(y);
+    }
+    else if (FIXNUM_P(y)) {
+        yy = FIX2LONG(y);
+
+        if (yy < 0) {
+            x = rb_big_pow(x, LONG2NUM(-yy));
+            if (RB_INTEGER_TYPE_P(x))
+                return rb_rational_raw(INT2FIX(1), x);
+            else
+                return DBL2NUM(1.0 / NUM2DBL(x));
+        }
+        else {
+            VALUE z = 0;
+            SIGNED_VALUE mask;
             const size_t xbits = rb_absint_numwords(x, 1, NULL);
-	    const size_t BIGLEN_LIMIT = 32*1024*1024;
+            const size_t BIGLEN_LIMIT = 32*1024*1024;
 
-	    if (xbits == (size_t)-1 ||
+            if (xbits == (size_t)-1 ||
                 (xbits > BIGLEN_LIMIT) ||
                 (xbits * yy > BIGLEN_LIMIT)) {
-		rb_warn("in a**b, b may be too big");
-		d = (double)yy;
-		break;
-	    }
-	    for (mask = FIXNUM_MAX + 1; mask; mask >>= 1) {
-		if (z) z = bigsq(z);
-		if (yy & mask) {
-		    z = z ? bigtrunc(bigmul0(z, x)) : x;
-		}
-	    }
-	    return bignorm(z);
-	}
-	/* NOTREACHED */
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("**"));
+                rb_warn("in a**b, b may be too big");
+                d = (double)yy;
+            }
+            else {
+                for (mask = FIXNUM_MAX + 1; mask; mask >>= 1) {
+                    if (z) z = bigsq(z);
+                    if (yy & mask) {
+                        z = z ? bigtrunc(bigmul0(z, x)) : x;
+                    }
+                }
+                return bignorm(z);
+            }
+        }
+    }
+    else {
+        return rb_num_coerce_bin(x, y, idPow);
     }
     return DBL2NUM(pow(rb_big2dbl(x), d));
 }
@@ -5988,15 +6331,15 @@ bigand_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     if (xn == 0) return hibitsx ? LONG2NUM(y) : 0;
     hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     if (!hibitsy) {
-	y &= xds[0];
-	return LONG2NUM(y);
+        y &= xds[0];
+        return LONG2NUM(y);
     }
 #endif
 
     zn = xn;
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     if (hibitsx && zn < bdigit_roomof(SIZEOF_LONG))
         zn = bdigit_roomof(SIZEOF_LONG);
 #endif
@@ -6004,9 +6347,9 @@ bigand_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] & y;
+    zds[0] = xds[0] & BIGLO(y);
 #else
     for (i=0; i < xn; i++) {
         if (y == 0 || y == -1) break;
@@ -6020,67 +6363,60 @@ bigand_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     }
 #endif
     for (;i < xn; i++) {
-	zds[i] = xds[i] & hibitsy;
+        zds[i] = xds[i] & hibitsy;
     }
     for (;i < zn; i++) {
-	zds[i] = hibitsx & hibitsy;
+        zds[i] = hibitsx & hibitsy;
     }
     twocomp2abs_bang(z, hibitsx && hibitsy);
     RB_GC_GUARD(x);
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     big & numeric   ->  integer
- *
- * Performs bitwise +and+ between _big_ and _numeric_.
- */
-
 VALUE
 rb_big_and(VALUE x, VALUE y)
 {
     VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, xl, yl, l1, l2;
+    long i, xn, yn, n1, n2;
     BDIGIT hibitsx, hibitsy;
     BDIGIT hibits1, hibits2;
     VALUE tmpv;
     BDIGIT tmph;
-    long tmpl;
+    long tmpn;
 
-    if (!FIXNUM_P(y) && !RB_TYPE_P(y, T_BIGNUM)) {
-	return rb_num_coerce_bit(x, y, '&');
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '&');
     }
 
-    hibitsx = abs2twocomp(&x, &xl);
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigand_int(x, xl, hibitsx, FIX2LONG(y));
+        return bigand_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    hibitsy = abs2twocomp(&y, &yl);
-    if (xl > yl) {
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
         tmpv = x; x = y; y = tmpv;
-        tmpl = xl; xl = yl; yl = tmpl;
+        tmpn = xn; xn = yn; yn = tmpn;
         tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
-    l1 = xl;
-    l2 = yl;
+    n1 = xn;
+    n2 = yn;
     ds1 = BDIGITS(x);
     ds2 = BDIGITS(y);
     hibits1 = hibitsx;
     hibits2 = hibitsy;
 
     if (!hibits1)
-        l2 = l1;
+        n2 = n1;
 
-    z = bignew(l2, 0);
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] & ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] & ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = hibits1 & ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibits1 & ds2[i];
     }
     twocomp2abs_bang(z, hibits1 && hibits2);
     RB_GC_GUARD(x);
@@ -6102,17 +6438,17 @@ bigor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
 
-    zn = RBIGNUM_LEN(x);
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+    zn = BIGNUM_LEN(x);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     if (zn < bdigit_roomof(SIZEOF_LONG))
         zn = bdigit_roomof(SIZEOF_LONG);
 #endif
     z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] | y;
+    zds[0] = xds[0] | BIGLO(y);
     if (i < zn)
         goto y_is_fixed_point;
     goto finish;
@@ -6156,57 +6492,50 @@ bigor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     big | numeric   ->  integer
- *
- * Performs bitwise +or+ between _big_ and _numeric_.
- */
-
 VALUE
 rb_big_or(VALUE x, VALUE y)
 {
     VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, xl, yl, l1, l2;
+    long i, xn, yn, n1, n2;
     BDIGIT hibitsx, hibitsy;
     BDIGIT hibits1, hibits2;
     VALUE tmpv;
     BDIGIT tmph;
-    long tmpl;
+    long tmpn;
 
-    if (!FIXNUM_P(y) && !RB_TYPE_P(y, T_BIGNUM)) {
-	return rb_num_coerce_bit(x, y, '|');
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '|');
     }
 
-    hibitsx = abs2twocomp(&x, &xl);
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigor_int(x, xl, hibitsx, FIX2LONG(y));
+        return bigor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    hibitsy = abs2twocomp(&y, &yl);
-    if (xl > yl) {
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
         tmpv = x; x = y; y = tmpv;
-        tmpl = xl; xl = yl; yl = tmpl;
+        tmpn = xn; xn = yn; yn = tmpn;
         tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
-    l1 = xl;
-    l2 = yl;
+    n1 = xn;
+    n2 = yn;
     ds1 = BDIGITS(x);
     ds2 = BDIGITS(y);
     hibits1 = hibitsx;
     hibits2 = hibitsy;
 
     if (hibits1)
-        l2 = l1;
+        n2 = n1;
 
-    z = bignew(l2, 0);
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] | ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] | ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = hibits1 | ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibits1 | ds2[i];
     }
     twocomp2abs_bang(z, hibits1 || hibits2);
     RB_GC_GUARD(x);
@@ -6225,17 +6554,17 @@ bigxor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
 
     hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
-    zn = RBIGNUM_LEN(x);
-#if SIZEOF_BDIGITS < SIZEOF_LONG
+    zn = BIGNUM_LEN(x);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
     if (zn < bdigit_roomof(SIZEOF_LONG))
         zn = bdigit_roomof(SIZEOF_LONG);
 #endif
     z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS >= SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] ^ y;
+    zds[0] = xds[0] ^ BIGLO(y);
 #else
     for (i = 0; i < xn; i++) {
         zds[i] = xds[i] ^ BIGLO(y);
@@ -6256,54 +6585,48 @@ bigxor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
     RB_GC_GUARD(x);
     return bignorm(z);
 }
-/*
- * call-seq:
- *     big ^ numeric   ->  integer
- *
- * Performs bitwise +exclusive or+ between _big_ and _numeric_.
- */
 
 VALUE
 rb_big_xor(VALUE x, VALUE y)
 {
     VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, xl, yl, l1, l2;
+    long i, xn, yn, n1, n2;
     BDIGIT hibitsx, hibitsy;
     BDIGIT hibits1, hibits2;
     VALUE tmpv;
     BDIGIT tmph;
-    long tmpl;
+    long tmpn;
 
-    if (!FIXNUM_P(y) && !RB_TYPE_P(y, T_BIGNUM)) {
-	return rb_num_coerce_bit(x, y, '^');
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '^');
     }
 
-    hibitsx = abs2twocomp(&x, &xl);
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigxor_int(x, xl, hibitsx, FIX2LONG(y));
+        return bigxor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    hibitsy = abs2twocomp(&y, &yl);
-    if (xl > yl) {
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
         tmpv = x; x = y; y = tmpv;
-        tmpl = xl; xl = yl; yl = tmpl;
+        tmpn = xn; xn = yn; yn = tmpn;
         tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
-    l1 = xl;
-    l2 = yl;
+    n1 = xn;
+    n2 = yn;
     ds1 = BDIGITS(x);
     ds2 = BDIGITS(y);
     hibits1 = hibitsx;
     hibits2 = hibitsy;
 
-    z = bignew(l2, 0);
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] ^ ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] ^ ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = hibitsx ^ ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibitsx ^ ds2[i];
     }
     twocomp2abs_bang(z, (hibits1 ^ hibits2) != 0);
     RB_GC_GUARD(x);
@@ -6311,13 +6634,6 @@ rb_big_xor(VALUE x, VALUE y)
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     big << numeric   ->  integer
- *
- * Shifts big left _numeric_ positions (right if _numeric_ is negative).
- */
-
 VALUE
 rb_big_lshift(VALUE x, VALUE y)
 {
@@ -6326,36 +6642,28 @@ rb_big_lshift(VALUE x, VALUE y)
     int shift_numbits;
 
     for (;;) {
-	if (FIXNUM_P(y)) {
-	    long l = FIX2LONG(y);
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
             unsigned long shift;
-	    if (0 <= l) {
-		lshift_p = 1;
+            if (0 <= l) {
+                lshift_p = 1;
                 shift = l;
             }
             else {
-		lshift_p = 0;
-		shift = 1+(unsigned long)(-(l+1));
-	    }
+                lshift_p = 0;
+                shift = 1+(unsigned long)(-(l+1));
+            }
             shift_numbits = (int)(shift & (BITSPERDIG-1));
-            shift_numdigits = shift >> bitsize(BITSPERDIG-1);
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
             return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
-	}
-	else if (RB_TYPE_P(y, T_BIGNUM)) {
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
             return bignorm(big_shift2(x, 1, y));
-	}
-	y = rb_to_int(y);
+        }
+        y = rb_to_int(y);
     }
 }
 
-
-/*
- * call-seq:
- *     big >> numeric   ->  integer
- *
- * Shifts big right _numeric_ positions (left if _numeric_ is negative).
- */
-
 VALUE
 rb_big_rshift(VALUE x, VALUE y)
 {
@@ -6364,8 +6672,8 @@ rb_big_rshift(VALUE x, VALUE y)
     int shift_numbits;
 
     for (;;) {
-	if (FIXNUM_P(y)) {
-	    long l = FIX2LONG(y);
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
             unsigned long shift;
             if (0 <= l) {
                 lshift_p = 0;
@@ -6373,69 +6681,55 @@ rb_big_rshift(VALUE x, VALUE y)
             }
             else {
                 lshift_p = 1;
-		shift = 1+(unsigned long)(-(l+1));
-	    }
+                shift = 1+(unsigned long)(-(l+1));
+            }
             shift_numbits = (int)(shift & (BITSPERDIG-1));
-            shift_numdigits = shift >> bitsize(BITSPERDIG-1);
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
             return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
-	}
-	else if (RB_TYPE_P(y, T_BIGNUM)) {
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
             return bignorm(big_shift2(x, 0, y));
-	}
-	y = rb_to_int(y);
+        }
+        y = rb_to_int(y);
     }
 }
 
-/*
- *  call-seq:
- *     big[n] -> 0, 1
- *
- *  Bit Reference---Returns the <em>n</em>th bit in the (assumed) binary
- *  representation of <i>big</i>, where <i>big</i>[0] is the least
- *  significant bit.
- *
- *     a = 9**15
- *     50.downto(0) do |n|
- *       print a[n]
- *     end
- *
- *  <em>produces:</em>
- *
- *     000101110110100000111000011110010100111100010111001
- *
- */
-
-static VALUE
+VALUE
 rb_big_aref(VALUE x, VALUE y)
 {
     BDIGIT *xds;
-    unsigned long shift;
-    long i, s1, s2;
+    size_t shift;
+    size_t i, s1, s2;
+    long l;
     BDIGIT bit;
 
-    if (RB_TYPE_P(y, T_BIGNUM)) {
-	if (!RBIGNUM_SIGN(y))
-	    return INT2FIX(0);
-	bigtrunc(y);
-	if (BIGSIZE(y) > sizeof(long)) {
-	  out_of_range:
-	    return RBIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
-	}
-	shift = big2ulong(y, "long");
+    if (RB_BIGNUM_TYPE_P(y)) {
+        if (BIGNUM_NEGATIVE_P(y))
+            return INT2FIX(0);
+        bigtrunc(y);
+        if (BIGSIZE(y) > sizeof(size_t)) {
+            return BIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
+        }
+#if SIZEOF_SIZE_T <= SIZEOF_LONG
+        shift = big2ulong(y, "long");
+#else
+        shift = big2ull(y, "long long");
+#endif
     }
     else {
-	i = NUM2LONG(y);
-	if (i < 0) return INT2FIX(0);
-	shift = i;
+        l = NUM2LONG(y);
+        if (l < 0) return INT2FIX(0);
+        shift = (size_t)l;
     }
     s1 = shift/BITSPERDIG;
     s2 = shift%BITSPERDIG;
     bit = (BDIGIT)1 << s2;
 
-    if (s1 >= RBIGNUM_LEN(x)) goto out_of_range;
+    if (s1 >= BIGNUM_LEN(x))
+        return BIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
 
     xds = BDIGITS(x);
-    if (RBIGNUM_POSITIVE_P(x))
+    if (BIGNUM_POSITIVE_P(x))
         return (xds[s1] & bit) ? INT2FIX(1) : INT2FIX(0);
     if (xds[s1] & (bit-1))
         return (xds[s1] & bit) ? INT2FIX(0) : INT2FIX(1);
@@ -6445,117 +6739,434 @@ rb_big_aref(VALUE x, VALUE y)
     return (xds[s1] & bit) ? INT2FIX(1) : INT2FIX(0);
 }
 
-/*
- * call-seq:
- *   big.hash   -> fixnum
- *
- * Compute a hash based on the value of _big_.
- */
-
-static VALUE
+VALUE
 rb_big_hash(VALUE x)
 {
     st_index_t hash;
 
-    hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*RBIGNUM_LEN(x)) ^ RBIGNUM_SIGN(x);
-    return INT2FIX(hash);
+    hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*BIGNUM_LEN(x)) ^ BIGNUM_SIGN(x);
+    return ST2FIX(hash);
 }
 
 /*
  * call-seq:
- *   big.coerce(numeric)  ->  array
+ *   int.coerce(numeric)  ->  array
  *
- * Returns an array with both a +numeric+ and a +big+ represented as Bignum
- * objects.
+ * Returns an array with both a +numeric+ and a +int+ represented as
+ * Integer objects or Float objects.
  *
- * This is achieved by converting +numeric+ to a Bignum.
+ * This is achieved by converting +numeric+ to an Integer or a Float.
  *
- * A TypeError is raised if the +numeric+ is not a Fixnum or Bignum type.
+ * A TypeError is raised if the +numeric+ is not an Integer or a Float
+ * type.
  *
  *     (0x3FFFFFFFFFFFFFFF+1).coerce(42)   #=> [42, 4611686018427387904]
  */
 
 static VALUE
-rb_big_coerce(VALUE x, VALUE y)
+rb_int_coerce(VALUE x, VALUE y)
 {
-    if (FIXNUM_P(y)) {
-	y = rb_int2big(FIX2LONG(y));
+    if (RB_INTEGER_TYPE_P(y)) {
+        return rb_assoc_new(y, x);
     }
-    else if (!RB_TYPE_P(y, T_BIGNUM)) {
-	rb_raise(rb_eTypeError, "can't coerce %s to Bignum",
-		 rb_obj_classname(y));
+    else {
+        x = rb_Float(x);
+        y = rb_Float(y);
+        return rb_assoc_new(y, x);
     }
-    return rb_assoc_new(y, x);
 }
 
-/*
- *  call-seq:
- *     big.abs -> aBignum
- *     big.magnitude -> aBignum
- *
- *  Returns the absolute value of <i>big</i>.
- *
- *     -1234567890987654321.abs   #=> 1234567890987654321
- */
-
-static VALUE
+VALUE
 rb_big_abs(VALUE x)
 {
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	RBIGNUM_SET_SIGN(x, 1);
+    if (BIGNUM_NEGATIVE_P(x)) {
+        x = rb_big_clone(x);
+        BIGNUM_SET_POSITIVE_SIGN(x);
     }
     return x;
 }
 
-/*
- *  call-seq:
- *     big.size -> integer
- *
- *  Returns the number of bytes in the machine representation of
- *  <i>big</i>.
- *
- *     (256**10 - 1).size   #=> 12
- *     (256**20 - 1).size   #=> 20
- *     (256**40 - 1).size   #=> 40
- */
+int
+rb_big_sign(VALUE x)
+{
+    return BIGNUM_SIGN(x);
+}
 
-static VALUE
+size_t
 rb_big_size(VALUE big)
 {
-    return SIZET2NUM(BIGSIZE(big));
+    return BIGSIZE(big);
+}
+
+VALUE
+rb_big_size_m(VALUE big)
+{
+    return SIZET2NUM(rb_big_size(big));
+}
+
+VALUE
+rb_big_bit_length(VALUE big)
+{
+    int nlz_bits;
+    size_t numbytes;
+
+    static const BDIGIT char_bit[1] = { CHAR_BIT };
+    BDIGIT numbytes_bary[bdigit_roomof(sizeof(size_t))];
+    BDIGIT nlz_bary[1];
+    BDIGIT result_bary[bdigit_roomof(sizeof(size_t)+1)];
+
+    numbytes = rb_absint_size(big, &nlz_bits);
+
+    if (numbytes == 0)
+        return LONG2FIX(0);
+
+    if (BIGNUM_NEGATIVE_P(big) && rb_absint_singlebit_p(big)) {
+        if (nlz_bits != CHAR_BIT-1) {
+            nlz_bits++;
+        }
+        else {
+            nlz_bits = 0;
+            numbytes--;
+        }
+    }
+
+    if (numbytes <= SIZE_MAX / CHAR_BIT) {
+        return SIZET2NUM(numbytes * CHAR_BIT - nlz_bits);
+    }
+
+    nlz_bary[0] = nlz_bits;
+
+    bary_unpack(BARY_ARGS(numbytes_bary), &numbytes, 1, sizeof(numbytes), 0,
+            INTEGER_PACK_NATIVE_BYTE_ORDER);
+    BARY_SHORT_MUL(result_bary, numbytes_bary, char_bit);
+    BARY_SUB(result_bary, result_bary, nlz_bary);
+
+    return rb_integer_unpack(result_bary, numberof(result_bary), sizeof(BDIGIT), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER);
+}
+
+VALUE
+rb_big_odd_p(VALUE num)
+{
+    return RBOOL(BIGNUM_LEN(num) != 0 && BDIGITS(num)[0] & 1);
+}
+
+VALUE
+rb_big_even_p(VALUE num)
+{
+    if (BIGNUM_LEN(num) != 0 && BDIGITS(num)[0] & 1) {
+        return Qfalse;
+    }
+    return Qtrue;
+}
+
+unsigned long rb_ulong_isqrt(unsigned long);
+#if SIZEOF_BDIGIT*2 > SIZEOF_LONG
+BDIGIT rb_bdigit_dbl_isqrt(BDIGIT_DBL);
+# ifdef ULL_TO_DOUBLE
+#   define BDIGIT_DBL_TO_DOUBLE(n) ULL_TO_DOUBLE(n)
+# endif
+#else
+# define rb_bdigit_dbl_isqrt(x) (BDIGIT)rb_ulong_isqrt(x)
+#endif
+#ifndef BDIGIT_DBL_TO_DOUBLE
+# define BDIGIT_DBL_TO_DOUBLE(n) (double)(n)
+#endif
+
+static BDIGIT *
+estimate_initial_sqrt(VALUE *xp, const size_t xn, const BDIGIT *nds, size_t len)
+{
+    enum {dbl_per_bdig = roomof(DBL_MANT_DIG,BITSPERDIG)};
+    const int zbits = nlz(nds[len-1]);
+    VALUE x = *xp = bignew_1(0, xn, 1); /* division may release the GVL */
+    BDIGIT *xds = BDIGITS(x);
+    BDIGIT_DBL d = bary2bdigitdbl(nds+len-dbl_per_bdig, dbl_per_bdig);
+    BDIGIT lowbits = 1;
+    int rshift = (int)((BITSPERDIG*2-zbits+(len&BITSPERDIG&1) - DBL_MANT_DIG + 1) & ~1);
+    double f;
+
+    if (rshift > 0) {
+        lowbits = (BDIGIT)d & ~(~(BDIGIT)1U << rshift);
+        d >>= rshift;
+    }
+    else if (rshift < 0) {
+        d <<= -rshift;
+        d |= nds[len-dbl_per_bdig-1] >> (BITSPERDIG+rshift);
+    }
+    f = sqrt(BDIGIT_DBL_TO_DOUBLE(d));
+    d = (BDIGIT_DBL)ceil(f);
+    if (BDIGIT_DBL_TO_DOUBLE(d) == f) {
+        if (lowbits || (lowbits = !bary_zero_p(nds, len-dbl_per_bdig)))
+            ++d;
+    }
+    else {
+        lowbits = 1;
+    }
+    rshift /= 2;
+    rshift += (2-(len&1))*BITSPERDIG/2;
+    if (rshift >= 0) {
+        if (nlz((BDIGIT)d) + rshift >= BITSPERDIG) {
+            /* (d << rshift) does cause overflow.
+             * example: Integer.sqrt(0xffff_ffff_ffff_ffff ** 2)
+             */
+            d = ~(BDIGIT_DBL)0;
+        }
+        else {
+            d <<= rshift;
+        }
+    }
+    BDIGITS_ZERO(xds, xn-2);
+    bdigitdbl2bary(&xds[xn-2], 2, d);
+
+    if (!lowbits) return NULL; /* special case, exact result */
+    return xds;
+}
+
+VALUE
+rb_big_isqrt(VALUE n)
+{
+    BDIGIT *nds = BDIGITS(n);
+    size_t len = BIGNUM_LEN(n);
+    size_t xn = (len+1) / 2;
+    VALUE x;
+    BDIGIT *xds;
+
+    if (len <= 2) {
+        BDIGIT sq = rb_bdigit_dbl_isqrt(bary2bdigitdbl(nds, len));
+#if SIZEOF_BDIGIT > SIZEOF_LONG
+        return ULL2NUM(sq);
+#else
+        return ULONG2NUM(sq);
+#endif
+    }
+    else if ((xds = estimate_initial_sqrt(&x, xn, nds, len)) != 0) {
+        size_t tn = xn + BIGDIVREM_EXTRA_WORDS;
+        VALUE t = bignew_1(0, tn, 1);
+        BDIGIT *tds = BDIGITS(t);
+        tn = BIGNUM_LEN(t);
+
+        /* t = n/x */
+        while (bary_divmod_branch(tds, tn, NULL, 0, nds, len, xds, xn),
+               bary_cmp(tds, tn, xds, xn) < 0) {
+            int carry;
+            BARY_TRUNC(tds, tn);
+            /* x = (x+t)/2 */
+            carry = bary_add(xds, xn, xds, xn, tds, tn);
+            bary_small_rshift(xds, xds, xn, 1, carry);
+            tn = BIGNUM_LEN(t);
+        }
+    }
+    RBASIC_SET_CLASS_RAW(x, rb_cInteger);
+    return x;
+}
+
+#if USE_GMP
+static void
+bary_powm_gmp(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, const BDIGIT *mds, size_t mn)
+{
+    mpz_t z, x, y, m;
+    size_t count;
+    mpz_init(x);
+    mpz_init(y);
+    mpz_init(m);
+    mpz_init(z);
+    bdigits_to_mpz(x, xds, xn);
+    bdigits_to_mpz(y, yds, yn);
+    bdigits_to_mpz(m, mds, mn);
+    mpz_powm(z, x, y, m);
+    bdigits_from_mpz(z, zds, &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(x);
+    mpz_clear(y);
+    mpz_clear(m);
+    mpz_clear(z);
+}
+#endif
+
+static VALUE
+int_pow_tmp3(VALUE x, VALUE y, VALUE m, int nega_flg)
+{
+#if USE_GMP
+    VALUE z;
+    size_t xn, yn, mn, zn;
+
+    if (FIXNUM_P(x)) {
+       x = rb_int2big(FIX2LONG(x));
+    }
+    if (FIXNUM_P(y)) {
+       y = rb_int2big(FIX2LONG(y));
+    }
+    assert(RB_BIGNUM_TYPE_P(m));
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    mn = BIGNUM_LEN(m);
+    zn = mn;
+    z = bignew(zn, 1);
+    bary_powm_gmp(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, BDIGITS(m), mn);
+    if (nega_flg & BIGNUM_POSITIVE_P(z)) {
+        z = rb_big_minus(z, m);
+    }
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    RB_GC_GUARD(m);
+    return rb_big_norm(z);
+#else
+    VALUE tmp = LONG2FIX(1L);
+    long yy;
+
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp = rb_int_mul(tmp, x);
+            tmp = rb_int_modulo(tmp, m);
+        }
+        x = rb_int_mul(x, x);
+        x = rb_int_modulo(x, m);
+    }
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp = rb_int_mul(tmp, x);
+            tmp = rb_int_modulo(tmp, m);
+        }
+        x = rb_int_mul(x, x);
+        x = rb_int_modulo(x, m);
+    }
+
+    if (nega_flg && rb_int_positive_p(tmp)) {
+        tmp = rb_int_minus(tmp, m);
+    }
+    return tmp;
+#endif
 }
 
 /*
- *  call-seq:
- *     big.odd? -> true or false
- *
- *  Returns <code>true</code> if <i>big</i> is an odd number.
+ * Integer#pow
  */
 
 static VALUE
-rb_big_odd_p(VALUE num)
+int_pow_tmp1(VALUE x, VALUE y, long mm, int nega_flg)
 {
-    if (BDIGITS(num)[0] & 1) {
-	return Qtrue;
+    long xx = FIX2LONG(x);
+    long tmp = 1L;
+    long yy;
+
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp = (tmp * xx) % mm;
+        }
+        xx = (xx * xx) % mm;
+    }
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp = (tmp * xx) % mm;
+        }
+        xx = (xx * xx) % mm;
+    }
+
+    if (nega_flg && tmp) {
+        tmp -= mm;
     }
-    return Qfalse;
+    return LONG2FIX(tmp);
+}
+
+static VALUE
+int_pow_tmp2(VALUE x, VALUE y, long mm, int nega_flg)
+{
+    long tmp = 1L;
+    long yy;
+#ifdef DLONG
+    const DLONG m = mm;
+    long tmp2 = tmp;
+    long xx = FIX2LONG(x);
+# define MUL_MODULO(a, b, c) (long)(((DLONG)(a) * (DLONG)(b)) % (c))
+#else
+    const VALUE m = LONG2FIX(mm);
+    VALUE tmp2 = LONG2FIX(tmp);
+    VALUE xx = x;
+# define MUL_MODULO(a, b, c) rb_int_modulo(rb_fix_mul_fix((a), (b)), (c))
+#endif
+
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp2 = MUL_MODULO(tmp2, xx, m);
+        }
+        xx = MUL_MODULO(xx, xx, m);
+    }
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp2 = MUL_MODULO(tmp2, xx, m);
+        }
+        xx = MUL_MODULO(xx, xx, m);
+    }
+
+#ifdef DLONG
+    tmp = tmp2;
+#else
+    tmp = FIX2LONG(tmp2);
+#endif
+    if (nega_flg && tmp) {
+        tmp -= mm;
+    }
+    return LONG2FIX(tmp);
 }
 
 /*
- *  call-seq:
- *     big.even? -> true or false
+ * Document-method: Integer#pow
+ * call-seq:
+ *    integer.pow(numeric)           ->  numeric
+ *    integer.pow(integer, integer)  ->  integer
+ *
+ * Returns (modular) exponentiation as:
  *
- *  Returns <code>true</code> if <i>big</i> is an even number.
+ *   a.pow(b)     #=> same as a**b
+ *   a.pow(b, m)  #=> same as (a**b) % m, but avoids huge temporary values
  */
-
-static VALUE
-rb_big_even_p(VALUE num)
+VALUE
+rb_int_powm(int const argc, VALUE * const argv, VALUE const num)
 {
-    if (BDIGITS(num)[0] & 1) {
-	return Qfalse;
+    rb_check_arity(argc, 1, 2);
+
+    if (argc == 1) {
+        return rb_int_pow(num, argv[0]);
     }
-    return Qtrue;
+    else {
+        VALUE const a = num;
+        VALUE const b = argv[0];
+        VALUE m = argv[1];
+        int nega_flg = 0;
+        if ( ! RB_INTEGER_TYPE_P(b)) {
+            rb_raise(rb_eTypeError, "Integer#pow() 2nd argument not allowed unless a 1st argument is integer");
+        }
+        if (rb_int_negative_p(b)) {
+            rb_raise(rb_eRangeError, "Integer#pow() 1st argument cannot be negative when 2nd argument specified");
+        }
+        if (!RB_INTEGER_TYPE_P(m)) {
+            rb_raise(rb_eTypeError, "Integer#pow() 2nd argument not allowed unless all arguments are integers");
+        }
+
+        if (rb_int_negative_p(m)) {
+            m = rb_int_uminus(m);
+            nega_flg = 1;
+        }
+
+        if (FIXNUM_P(m)) {
+            long const half_val = (long)HALF_LONG_MSB;
+            long const mm = FIX2LONG(m);
+            if (!mm) rb_num_zerodiv();
+            if (mm == 1) return INT2FIX(0);
+            if (mm <= half_val) {
+                return int_pow_tmp1(rb_int_modulo(a, m), b, mm, nega_flg);
+            }
+            else {
+                return int_pow_tmp2(rb_int_modulo(a, m), b, mm, nega_flg);
+            }
+        }
+        else {
+            if (rb_bigzero_p(m)) rb_num_zerodiv();
+            if (bignorm(m) == INT2FIX(1)) return INT2FIX(0);
+            return int_pow_tmp3(rb_int_modulo(a, m), b, m, nega_flg);
+        }
+    }
+    UNREACHABLE_RETURN(Qnil);
 }
 
 /*
@@ -6579,46 +7190,12 @@ rb_big_even_p(VALUE num)
 void
 Init_Bignum(void)
 {
-    rb_cBignum = rb_define_class("Bignum", rb_cInteger);
-
-    rb_define_method(rb_cBignum, "to_s", rb_big_to_s, -1);
-    rb_define_alias(rb_cBignum, "inspect", "to_s");
-    rb_define_method(rb_cBignum, "coerce", rb_big_coerce, 1);
-    rb_define_method(rb_cBignum, "-@", rb_big_uminus, 0);
-    rb_define_method(rb_cBignum, "+", rb_big_plus, 1);
-    rb_define_method(rb_cBignum, "-", rb_big_minus, 1);
-    rb_define_method(rb_cBignum, "*", rb_big_mul, 1);
-    rb_define_method(rb_cBignum, "/", rb_big_div, 1);
-    rb_define_method(rb_cBignum, "%", rb_big_modulo, 1);
-    rb_define_method(rb_cBignum, "div", rb_big_idiv, 1);
-    rb_define_method(rb_cBignum, "divmod", rb_big_divmod, 1);
-    rb_define_method(rb_cBignum, "modulo", rb_big_modulo, 1);
-    rb_define_method(rb_cBignum, "remainder", rb_big_remainder, 1);
-    rb_define_method(rb_cBignum, "fdiv", rb_big_fdiv, 1);
-    rb_define_method(rb_cBignum, "**", rb_big_pow, 1);
-    rb_define_method(rb_cBignum, "&", rb_big_and, 1);
-    rb_define_method(rb_cBignum, "|", rb_big_or, 1);
-    rb_define_method(rb_cBignum, "^", rb_big_xor, 1);
-    rb_define_method(rb_cBignum, "~", rb_big_neg, 0);
-    rb_define_method(rb_cBignum, "<<", rb_big_lshift, 1);
-    rb_define_method(rb_cBignum, ">>", rb_big_rshift, 1);
-    rb_define_method(rb_cBignum, "[]", rb_big_aref, 1);
-
-    rb_define_method(rb_cBignum, "<=>", rb_big_cmp, 1);
-    rb_define_method(rb_cBignum, "==", rb_big_eq, 1);
-    rb_define_method(rb_cBignum, ">", big_gt, 1);
-    rb_define_method(rb_cBignum, ">=", big_ge, 1);
-    rb_define_method(rb_cBignum, "<", big_lt, 1);
-    rb_define_method(rb_cBignum, "<=", big_le, 1);
-    rb_define_method(rb_cBignum, "===", rb_big_eq, 1);
-    rb_define_method(rb_cBignum, "eql?", rb_big_eql, 1);
-    rb_define_method(rb_cBignum, "hash", rb_big_hash, 0);
-    rb_define_method(rb_cBignum, "to_f", rb_big_to_f, 0);
-    rb_define_method(rb_cBignum, "abs", rb_big_abs, 0);
-    rb_define_method(rb_cBignum, "magnitude", rb_big_abs, 0);
-    rb_define_method(rb_cBignum, "size", rb_big_size, 0);
-    rb_define_method(rb_cBignum, "odd?", rb_big_odd_p, 0);
-    rb_define_method(rb_cBignum, "even?", rb_big_even_p, 0);
+    rb_define_method(rb_cInteger, "coerce", rb_int_coerce, 1);
+
+#if USE_GMP
+    /* The version of loaded GMP. */
+    rb_define_const(rb_cInteger, "GMP_VERSION", rb_sprintf("GMP %s", gmp_version));
+#endif
 
     power_cache_init();
 }
diff --git a/bin/erb b/bin/erb
deleted file mode 100755
index 6b92ac2284..0000000000
--- a/bin/erb
+++ /dev/null
@@ -1,155 +0,0 @@
-#!/usr/bin/env ruby
-# Tiny eRuby --- ERB2
-# Copyright (c) 1999-2000,2002 Masatoshi SEKI
-# You can redistribute it and/or modify it under the same terms as Ruby.
-
-require 'erb'
-
-class ERB
-  module Main
-    def ARGV.switch
-      return nil if self.empty?
-      arg = self.shift
-      return nil if arg == '--'
-      if arg =~ /^-(.)(.*)/
-        if $1 == '-'
-          arg, @maybe_arg = arg.split(/=/, 2)
-          return arg
-        end
-        raise 'unknown switch "-"' if $2[0] == ?- and $1 != 'T'
-        if $2.size > 0
-          self.unshift "-#{$2}"
-          @maybe_arg = $2
-        else
-          @maybe_arg = nil
-        end
-        "-#{$1}"
-      else
-        self.unshift arg
-        nil
-      end
-    end
-
-    def ARGV.req_arg
-      (@maybe_arg || self.shift || raise('missing argument')).tap {
-        @maybe_arg = nil
-      }
-    end
-
-    def trim_mode_opt(trim_mode, disable_percent)
-      return trim_mode if disable_percent
-      case trim_mode
-      when 0
-        return '%'
-      when 1
-        return '%>'
-      when 2
-        return '%<>'
-      when '-'
-        return '%-'
-      end
-    end
-    module_function :trim_mode_opt
-
-    def run(factory=ERB)
-      trim_mode = 0
-      disable_percent = false
-      begin
-        while switch = ARGV.switch
-          case switch
-          when '-x'                        # ruby source
-            output = true
-          when '-n'                        # line number
-            number = true
-          when '-v'                        # verbose
-            $VERBOSE = true
-          when '--version'                 # version
-            STDERR.puts factory.version
-            exit
-          when '-d', '--debug'             # debug
-            $DEBUG = true
-          when '-r'                        # require
-            require ARGV.req_arg
-          when '-S'                        # security level
-            arg = ARGV.req_arg
-            raise "invalid safe_level #{arg.dump}" unless arg =~ /^[0-4]$/
-            safe_level = arg.to_i
-          when '-T'                        # trim mode
-            arg = ARGV.req_arg
-            if arg == '-'
-              trim_mode = arg
-              next
-            end
-            raise "invalid trim mode #{arg.dump}" unless arg =~ /^[0-2]$/
-            trim_mode = arg.to_i
-          when '-E', '--encoding'
-            arg = ARGV.req_arg
-            set_encoding(*arg.split(/:/, 2))
-          when '-U'
-            set_encoding(Encoding::UTF_8, Encoding::UTF_8)
-          when '-P'
-            disable_percent = true
-          when '--help'
-            raise "print this help"
-          else
-            raise "unknown switch #{switch.dump}"
-          end
-        end
-      rescue                               # usage
-        STDERR.puts $!.to_s
-        STDERR.puts File.basename($0) +
-          " [switches] [inputfile]"
-        STDERR.puts <<EOU
-  -x               print ruby script
-  -n               print ruby script with line number
-  -v               enable verbose mode
-  -d               set $DEBUG to true
-  -r library       load a library
-  -S safe_level    set $SAFE (0..4)
-  -E ex[:in]       set default external/internal encodings
-  -U               set default encoding to UTF-8.
-  -T trim_mode     specify trim_mode (0..2, -)
-  -P               ignore lines which start with "%"
-EOU
-        exit 1
-      end
-
-      $<.set_encoding(Encoding::ASCII_8BIT, nil)
-      src = $<.read
-      filename = $FILENAME
-      exit 2 unless src
-      trim = trim_mode_opt(trim_mode, disable_percent)
-      erb = factory.new(src.untaint, safe_level, trim)
-      erb.filename = filename
-      if output
-        if number
-          erb.src.each_line.with_index do |line, l|
-            puts "%3d %s"%[l+1, line]
-          end
-        else
-          puts erb.src
-        end
-      else
-        erb.run(TOPLEVEL_BINDING.taint)
-      end
-    end
-    module_function :run
-
-    def set_encoding(extern, intern = nil)
-      verbose, $VERBOSE = $VERBOSE, nil
-      Encoding.default_external = extern unless extern.nil? || extern.empty?
-      Encoding.default_internal = intern unless intern.nil? || intern.empty?
-      [$stdin, $stdout, $stderr].each do |io|
-        io.set_encoding(extern, intern)
-      end
-    ensure
-      $VERBOSE = verbose
-    end
-    module_function :set_encoding
-    class << self; private :set_encoding; end
-  end
-end
-
-if __FILE__ == $0
-  ERB::Main.run
-end
diff --git a/bin/gem b/bin/gem
index a4ec754abb..1c16ea7ddd 100755
--- a/bin/gem
+++ b/bin/gem
@@ -5,21 +5,6 @@
 # See LICENSE.txt for permissions.
 #++
 
-require 'rubygems'
-require 'rubygems/gem_runner'
-require 'rubygems/exceptions'
-
-required_version = Gem::Requirement.new ">= 1.8.7"
-
-unless required_version.satisfied_by? Gem.ruby_version then
-  abort "Expected Ruby Version #{required_version}, is #{Gem.ruby_version}"
-end
-
-args = ARGV.clone
-
-begin
-  Gem::GemRunner.new.run args
-rescue Gem::SystemExitException => e
-  exit e.exit_code
-end
+require "rubygems/gem_runner"
 
+Gem::GemRunner.new.run ARGV.clone
diff --git a/bin/rake b/bin/rake
deleted file mode 100755
index 6aad2f0df3..0000000000
--- a/bin/rake
+++ /dev/null
@@ -1,37 +0,0 @@
-#!/usr/bin/env ruby
-
-#--
-# Copyright (c) 2003, 2004, 2005, 2006, 2007  Jim Weirich
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to
-# deal in the Software without restriction, including without limitation the
-# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-# sell copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-#
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-# IN THE SOFTWARE.
-#++
-
-begin
-  require 'rubygems'
-  gem 'rake'
-rescue LoadError
-end
-
-module Rake
-  REDUCE_COMPAT = true if ARGV.include?("--reduce-compat")
-end
-
-require 'rake'
-
-Rake.application.run
diff --git a/bin/rdoc b/bin/rdoc
deleted file mode 100755
index aaa23292df..0000000000
--- a/bin/rdoc
+++ /dev/null
@@ -1,44 +0,0 @@
-#!/usr/bin/env ruby
-#
-#  RDoc: Documentation tool for source code
-#        (see lib/rdoc/rdoc.rb for more information)
-#
-#  Copyright (c) 2003 Dave Thomas
-#  Released under the same terms as Ruby
-
-begin
-  gem 'rdoc'
-rescue NameError => e # --disable-gems
-  raise unless e.name == :gem
-rescue Gem::LoadError
-end
-
-require 'rdoc/rdoc'
-
-begin
-  r = RDoc::RDoc.new
-  r.document ARGV
-rescue Errno::ENOSPC
-  $stderr.puts 'Ran out of space creating documentation'
-  $stderr.puts
-  $stderr.puts 'Please free up some space and try again'
-rescue SystemExit
-  raise
-rescue Exception => e
-  if $DEBUG_RDOC then
-    $stderr.puts e.message
-    $stderr.puts "#{e.backtrace.join "\n\t"}"
-    $stderr.puts
-  elsif Interrupt === e then
-    $stderr.puts
-    $stderr.puts 'Interrupted'
-  else
-    $stderr.puts "uh-oh! RDoc had a problem:"
-    $stderr.puts e.message
-    $stderr.puts
-    $stderr.puts "run with --debug for full backtrace"
-  end
-
-  exit 1
-end
-
diff --git a/bin/testrb b/bin/testrb
deleted file mode 100755
index 23a00b439f..0000000000
--- a/bin/testrb
+++ /dev/null
@@ -1,3 +0,0 @@
-#!/usr/bin/env ruby
-require 'test/unit'
-exit Test::Unit::AutoRunner.run(true)
diff --git a/bootstraptest/pending.rb b/bootstraptest/pending.rb
index 744c0adac1..2c4b85a419 100644
--- a/bootstraptest/pending.rb
+++ b/bootstraptest/pending.rb
@@ -1,19 +1,3 @@
-assert_equal 'A', %q{
-  class A
-    @@a = 'A'
-    def a=(x)
-      @@a = x
-    end
-    def a
-      @@a
-    end
-  end
-
-  B = A.dup
-  B.new.a = 'B'
-  A.new.a
-}, '[ruby-core:17019]'
-
 assert_equal 'ok', %q{
   def m
     lambda{
@@ -31,9 +15,7 @@ assert_equal 'ok', %q{
   end
 }
 
-assert_normal_exit %q{
-  r = Range.allocate
-  def r.<=>(o) true end
-  r.instance_eval { initialize r, r }
-  r.inspect
+# This randomly fails on mswin.
+assert_equal %q{[]}, %q{
+  Thread.new{sleep}.backtrace
 }
diff --git a/bootstraptest/runner.rb b/bootstraptest/runner.rb
index 75e255428a..f9b3e919b8 100755
--- a/bootstraptest/runner.rb
+++ b/bootstraptest/runner.rb
@@ -1,4 +1,4 @@
-"exec" "${RUBY-ruby}" "-x" "$0" "$@" || true # -*- mode: ruby; coding: utf-8 -*-
+"exec" "${RUBY-ruby}" "-x" "$0" "$@" || true # -*- Ruby -*-
 #!./ruby
 # $Id$
 
@@ -6,6 +6,9 @@
 # Never use optparse in this file.
 # Never use test/unit in this file.
 # Never use Ruby extensions in this file.
+# Maintain Ruby 1.8 compatibility for now
+
+$start_time = Time.now
 
 begin
   require 'fileutils'
@@ -57,23 +60,114 @@ if !Dir.respond_to?(:mktmpdir)
   end
 end
 
+# Configuration
+bt = Struct.new(:ruby,
+                :verbose,
+                :color,
+                :tty,
+                :quiet,
+                :wn,
+                :progress,
+                :progress_bs,
+                :passed,
+                :failed,
+                :reset,
+                :columns,
+                :window_width,
+                :width,
+                :indent,
+                :platform,
+                )
+BT = Class.new(bt) do
+  def indent=(n)
+    super
+    if (self.columns ||= 0) < n
+      $stderr.print(' ' * (n - self.columns))
+    end
+    self.columns = indent
+  end
+
+  def putc(c)
+    unless self.quiet
+      if self.window_width == nil
+        unless w = ENV["COLUMNS"] and (w = w.to_i) > 0
+          w = 80
+        end
+        w -= 1
+        self.window_width = w
+      end
+      if self.window_width and self.columns >= self.window_width
+        $stderr.print "\n", " " * (self.indent ||= 0)
+        self.columns = indent
+      end
+      $stderr.print c
+      $stderr.flush
+      self.columns += 1
+    end
+  end
+
+  def wn=(wn)
+    unless wn == 1
+      if /(?:\A|\s)--jobserver-(?:auth|fds)=(?:(\d+),(\d+)|fifo:((?:\\.|\S)+))/ =~ ENV.delete("MAKEFLAGS")
+        begin
+          if fifo = $3
+            fifo.gsub!(/\\(?=.)/, '')
+            r = File.open(fifo, IO::RDONLY|IO::NONBLOCK|IO::BINARY)
+            w = File.open(fifo, IO::WRONLY|IO::NONBLOCK|IO::BINARY)
+          else
+            r = IO.for_fd($1.to_i(10), "rb", autoclose: false)
+            w = IO.for_fd($2.to_i(10), "wb", autoclose: false)
+          end
+        rescue => e
+          r.close if r
+        else
+          r.close_on_exec = true
+          w.close_on_exec = true
+          tokens = r.read_nonblock(wn > 0 ? wn : 1024, exception: false)
+          r.close
+          if String === tokens
+            tokens.freeze
+            auth = w
+            w = nil
+            at_exit {auth << tokens; auth.close}
+            wn = tokens.size + 1
+          else
+            w.close
+            wn = 1
+          end
+        end
+      end
+      if wn <= 0
+        require 'etc'
+        wn = [Etc.nprocessors / 2, 1].max
+      end
+    end
+    super wn
+  end
+end.new
+
+BT_STATE = Struct.new(:count, :error).new
+
 def main
-  @ruby = File.expand_path('miniruby')
-  @verbose = false
+  BT.ruby = File.expand_path('miniruby')
+  BT.verbose = false
+  $VERBOSE = false
   $stress = false
-  @color = nil
-  @tty = nil
-  @quiet = false
+  BT.color = nil
+  BT.tty = nil
+  BT.quiet = false
+  # BT.wn = 1
   dir = nil
   quiet = false
   tests = nil
   ARGV.delete_if {|arg|
     case arg
     when /\A--ruby=(.*)/
-      @ruby = $1
-      @ruby.gsub!(/^([^ ]*)/){File.expand_path($1)}
-      @ruby.gsub!(/(\s+-I\s*)((?!(?:\.\/)*-(?:\s|\z))\S+)/){$1+File.expand_path($2)}
-      @ruby.gsub!(/(\s+-r\s*)(\.\.?\/\S+)/){$1+File.expand_path($2)}
+      ruby = $1
+      ruby.gsub!(/^([^ ]*)/){File.expand_path($1)}
+      ruby.gsub!(/(\s+-I\s*)((?!(?:\.\/)*-(?:\s|\z))\S+)/){$1+File.expand_path($2)}
+      ruby.gsub!(/(\s+-r\s*)(\.\.?\/\S+)/){$1+File.expand_path($2)}
+      BT.ruby = ruby
       true
     when /\A--sets=(.*)/
       tests = Dir.glob("#{File.dirname($0)}/test_{#{$1}}*.rb").sort
@@ -86,18 +180,23 @@ def main
       $stress = true
     when /\A--color(?:=(?:always|(auto)|(never)|(.*)))?\z/
       warn "unknown --color argument: #$3" if $3
-      @color = $1 ? nil : !$2
+      BT.color = color = $1 ? nil : !$2
       true
     when /\A--tty(=(?:yes|(no)|(.*)))?\z/
       warn "unknown --tty argument: #$3" if $3
-      @tty = !$1 || !$2
+      BT.tty = !$1 || !$2
       true
     when /\A(-q|--q(uiet))\z/
       quiet = true
-      @quiet = true
+      BT.quiet = true
+      true
+    when /\A-j(\d+)?/
+      BT.wn = $1.to_i
       true
     when /\A(-v|--v(erbose))\z/
-      @verbose = true
+      BT.verbose = true
+      BT.quiet = false
+      true
     when /\A(-h|--h(elp)?)\z/
       puts(<<-End)
 Usage: #{File.basename($0, '.*')} --ruby=PATH [--sets=NAME,NAME,...]
@@ -119,33 +218,41 @@ End
     end
   }
   if tests and not ARGV.empty?
-    $stderr.puts "--tests and arguments are exclusive"
-    exit false
+    abort "--sets and arguments are exclusive"
   end
   tests ||= ARGV
   tests = Dir.glob("#{File.dirname($0)}/test_*.rb").sort if tests.empty?
   pathes = tests.map {|path| File.expand_path(path) }
 
-  @progress = %w[- \\ | /]
-  @progress_bs = "\b" * @progress[0].size
-  @tty = $stderr.tty? if @tty.nil?
-  case @color
+  BT.progress = %w[- \\ | /]
+  BT.progress_bs = "\b" * BT.progress[0].size
+  BT.tty = $stderr.tty? if BT.tty.nil?
+  BT.wn ||= /-j(\d+)?/ =~ (ENV["MAKEFLAGS"] || ENV["MFLAGS"]) ? $1.to_i : 1
+
+  case BT.color
   when nil
-    @color = @tty && /dumb/ !~ ENV["TERM"]
+    BT.color = BT.tty && /dumb/ !~ ENV["TERM"]
   end
-  @tty &&= !@verbose
-  if @color
+  BT.tty &&= !BT.verbose
+  if BT.color
     # dircolors-like style
-    colors = (colors = ENV['TEST_COLORS']) ? Hash[colors.scan(/(\w+)=([^:]*)/)] : {}
-    @passed = "\e[#{colors["pass"] || "32"}m"
-    @failed = "\e[#{colors["fail"] || "31"}m"
-    @reset = "\e[m"
-    @erase = "\r\e[2K\r"
+    colors = (colors = ENV['TEST_COLORS']) ? Hash[colors.scan(/(\w+)=([^:\n]*)/)] : {}
+    begin
+      File.read(File.join(__dir__, "../tool/colors")).scan(/(\w+)=([^:\n]*)/) do |n, c|
+        colors[n] ||= c
+      end
+    rescue
+    end
+    BT.passed = "\e[;#{colors["pass"] || "32"}m"
+    BT.failed = "\e[;#{colors["fail"] || "31"}m"
+    BT.reset = "\e[m"
   else
-    @passed = @failed = @reset = @erase = ""
+    BT.passed = BT.failed = BT.reset = ""
   end
+  target_version = `#{BT.ruby} -v`.chomp
+  BT.platform = target_version[/\[(.*)\]\z/, 1]
   unless quiet
-    puts Time.now
+    puts $start_time
     if defined?(RUBY_DESCRIPTION)
       puts "Driver is #{RUBY_DESCRIPTION}"
     elsif defined?(RUBY_PATCHLEVEL)
@@ -153,305 +260,486 @@ End
     else
       puts "Driver is ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}) [#{RUBY_PLATFORM}]"
     end
-    puts "Target is #{`#{@ruby} -v`.chomp}"
+    puts "Target is #{target_version}"
     puts
     $stdout.flush
   end
 
-  in_temporary_working_directory(dir) {
+  in_temporary_working_directory(dir) do
     exec_test pathes
-  }
+  end
 end
 
-def exec_test(pathes)
-  @count = 0
-  @error = 0
-  @errbuf = []
-  @location = nil
+def erase(e = true)
+  if e and BT.columns > 0 and BT.tty and !BT.verbose
+    "\e[1K\r"
+  else
+    ""
+  end
+end
+
+def load_test pathes
   pathes.each do |path|
-    @basename = File.basename(path)
-    $stderr.print @basename, " "
-    $stderr.puts if @verbose
-    count = @count
-    error = @error
     load File.expand_path(path)
-    if @tty
-      if @error == error
-        $stderr.print "#{@progress_bs}#{@passed}PASS #{@count-count}#{@reset}"
-        $stderr.print @erase if @quiet
+  end
+end
+
+def concurrent_exec_test
+  aq = Queue.new
+  rq = Queue.new
+
+  ts = BT.wn.times.map do
+    Thread.new do
+      while as = aq.pop
+        as.call
+        rq << as
+      end
+    ensure
+      rq << nil
+    end
+  end
+
+  Assertion.all.to_a.shuffle.each do |path, assertions|
+    assertions.each do |as|
+      aq << as
+    end
+  end
+
+  BT.indent = 1
+  aq.close
+  i = 1
+  term_wn = 0
+  begin
+    while BT.wn != term_wn
+      if r = rq.pop
+        case
+        when BT.quiet
+        when BT.tty
+          $stderr.print "#{BT.progress_bs}#{BT.progress[(i+=1) % BT.progress.size]}"
+        else
+          BT.putc '.'
+        end
       else
-        $stderr.print "#{@progress_bs}#{@failed}FAIL #{@error-error}/#{@count-count}#{@reset}"
+        term_wn += 1
       end
     end
-    $stderr.puts unless @quiet and @tty
+  ensure
+    ts.each(&:kill)
+    ts.each(&:join)
   end
-  if @error == 0
-    if @count == 0
-      $stderr.puts "No tests, no problem"
+end
+
+def exec_test(pathes)
+  # setup
+  load_test pathes
+  BT_STATE.count = 0
+  BT_STATE.error = 0
+  BT.columns = 0
+  BT.width = pathes.map {|path| File.basename(path).size}.max + 2
+
+  # execute tests
+  if BT.wn > 1
+    concurrent_exec_test
+  else
+    prev_basename = nil
+    Assertion.all.each do |basename, assertions|
+      if !BT.quiet && basename != prev_basename
+        prev_basename = basename
+        $stderr.printf("%s%-*s ", erase(BT.quiet), BT.width, basename)
+        $stderr.flush
+      end
+      BT.columns = BT.width + 1
+      $stderr.puts if BT.verbose
+      count = BT_STATE.count
+      error = BT_STATE.error
+
+      assertions.each do |assertion|
+        BT_STATE.count += 1
+        assertion.call
+      end
+
+      if BT.tty
+        if BT_STATE.error == error
+          msg = "PASS #{BT_STATE.count-count}"
+          BT.columns += msg.size - 1
+          $stderr.print "#{BT.progress_bs}#{BT.passed}#{msg}#{BT.reset}" unless BT.quiet
+        else
+          msg = "FAIL #{BT_STATE.error-error}/#{BT_STATE.count-count}"
+          $stderr.print "#{BT.progress_bs}#{BT.failed}#{msg}#{BT.reset}"
+          BT.columns = 0
+        end
+      end
+      $stderr.puts if !BT.quiet and (BT.tty or BT_STATE.error == error)
+    end
+  end
+
+  # show results
+  unless BT.quiet
+    $stderr.puts(erase)
+
+    sec = Time.now - $start_time
+    $stderr.puts "Finished in #{'%.2f' % sec} sec\n\n" if Assertion.count > 0
+  end
+
+  Assertion.errbuf.each do |msg|
+    $stderr.puts msg
+  end
+
+  out = BT.quiet ? $stdout : $stderr
+
+  if BT_STATE.error == 0
+    if Assertion.count == 0
+      out.puts "No tests, no problem" unless BT.quiet
     else
-      $stderr.puts "#{@passed}PASS#{@reset} all #{@count} tests"
+      out.puts "#{BT.passed}PASS#{BT.reset} all #{Assertion.count} tests"
     end
-    exit true
+    true
   else
-    @errbuf.each do |msg|
-      $stderr.puts msg
-    end
-    $stderr.puts "#{@failed}FAIL#{@reset} #{@error}/#{@count} tests failed"
-    exit false
+    $stderr.puts "#{BT.failed}FAIL#{BT.reset} #{BT_STATE.error}/#{BT_STATE.count} tests failed"
+    false
   end
 end
 
-def show_progress(message = '')
-  if @verbose
-    $stderr.print "\##{@count} #{@location} "
-  elsif @tty
-    $stderr.print "#{@progress_bs}#{@progress[@count % @progress.size]}"
+def target_platform
+  BT.platform or RUBY_PLATFORM
+end
+
+class Assertion < Struct.new(:src, :path, :lineno, :proc)
+  @count = 0
+  @all = Hash.new{|h, k| h[k] = []}
+  @errbuf = []
+
+  class << self
+    attr_reader :count, :errbuf
+
+    def all
+      @all
+    end
+
+    def add as
+      @all[as.path] << as
+      as.id = (@count += 1)
+    end
+  end
+
+  attr_accessor :id
+  attr_reader :err, :category
+
+  def initialize(*args)
+    super
+    self.class.add self
+    @category = self.path.match(/test_(.+)\.rb/)[1]
   end
-  faildesc, errout = with_stderr {yield}
-  if !faildesc
-    if @tty
-      $stderr.print "#{@progress_bs}#{@progress[@count % @progress.size]}"
+
+  def call
+    self.proc.call self
+  end
+
+  def assert_check(message = '', opt = '', **argh)
+    show_progress(message) {
+      result = get_result_string(opt, **argh)
+      yield(result)
+    }
+  end
+
+  def with_stderr
+    out = err = nil
+    r, w = IO.pipe
+    @err = w
+    err_reader = Thread.new{ r.read }
+
+    begin
+      out = yield
+    ensure
+      w.close
+      err = err_reader.value
+      r.close rescue nil
+    end
+
+    return out, err
+  end
+
+  def show_error(msg, additional_message)
+    msg = "#{BT.failed}\##{self.id} #{self.path}:#{self.lineno}#{BT.reset}: #{msg}  #{additional_message}"
+    if BT.tty
+      $stderr.puts "#{erase}#{msg}"
     else
-      $stderr.print '.'
+      Assertion.errbuf << msg
     end
-    $stderr.puts if @verbose
-  else
-    $stderr.print "#{@failed}F#{@reset}"
-    $stderr.puts if @verbose
-    error faildesc, message
-    unless errout.empty?
-      $stderr.print "#{@failed}stderr output is not empty#{@reset}\n", adjust_indent(errout)
+    BT_STATE.error += 1
+  end
+
+
+  def show_progress(message = '')
+    if BT.quiet || BT.wn > 1
+      # do nothing
+    elsif BT.verbose
+      $stderr.print "\##{@id} #{self.path}:#{self.lineno} "
+    elsif BT.tty
+      $stderr.print "#{BT.progress_bs}#{BT.progress[BT_STATE.count % BT.progress.size]}"
     end
-    if @tty and !@verbose
-      $stderr.print @basename, " ", @progress[@count % @progress.size]
+
+    t = Time.now if BT.verbose
+    faildesc, errout = with_stderr {yield}
+    t = Time.now - t if BT.verbose
+
+    if !faildesc
+      # success
+      if BT.quiet || BT.wn > 1
+        # do nothing
+      elsif BT.tty
+        $stderr.print "#{BT.progress_bs}#{BT.progress[BT_STATE.count % BT.progress.size]}"
+      elsif BT.verbose
+        $stderr.printf(". %.3f\n", t)
+      else
+        BT.putc '.'
+      end
+    else
+      $stderr.print "#{BT.failed}F"
+      $stderr.printf(" %.3f", t) if BT.verbose
+      $stderr.print BT.reset
+      $stderr.puts if BT.verbose
+      show_error faildesc, message
+      unless errout.empty?
+        $stderr.print "#{BT.failed}stderr output is not empty#{BT.reset}\n", adjust_indent(errout)
+      end
+
+      if BT.tty and !BT.verbose and BT.wn == 1
+        $stderr.printf("%-*s%s", BT.width, path, BT.progress[BT_STATE.count % BT.progress.size])
+      end
+    end
+  rescue Interrupt
+    $stderr.puts "\##{@id} #{path}:#{lineno}"
+    raise
+  rescue Exception => err
+    $stderr.print 'E'
+    $stderr.puts if BT.verbose
+    show_error err.message, message
+  ensure
+    begin
+      check_coredump
+    rescue CoreDumpError => err
+      $stderr.print 'E'
+      $stderr.puts if BT.verbose
+      show_error err.message, message
+      cleanup_coredump
+    end
+  end
+
+  def get_result_string(opt = '', **argh)
+    if BT.ruby
+      filename = make_srcfile(**argh)
+      begin
+        kw = self.err ? {err: self.err} : {}
+        out = IO.popen("#{BT.ruby} -W0 #{opt} #{filename}", **kw)
+        pid = out.pid
+        out.read.tap{ Process.waitpid(pid); out.close }
+      ensure
+        raise Interrupt if $? and $?.signaled? && $?.termsig == Signal.list["INT"]
+
+        begin
+          Process.kill :KILL, pid
+        rescue Errno::ESRCH
+          # OK
+        end
+      end
+    else
+      eval(src).to_s
     end
   end
-rescue Interrupt
-  raise Interrupt
-rescue Exception => err
-  $stderr.print 'E'
-  $stderr.puts if @verbose
-  error err.message, message
-end
 
-# NativeClient is special.  The binary is cross-compiled.  But runs on the build environment.
-# So RUBY_PLATFORM in this process is not useful to detect it.
-def nacl?
-  @ruby and File.basename(@ruby.split(/\s/).first)['sel_ldr']
+  def make_srcfile(frozen_string_literal: nil)
+    filename = "bootstraptest.#{self.path}_#{self.lineno}_#{self.id}.rb"
+    File.open(filename, 'w') {|f|
+      f.puts "#frozen_string_literal:true" if frozen_string_literal
+      f.puts "GC.stress = true" if $stress
+      f.puts "print(begin; #{self.src}; end)"
+    }
+    filename
+  end
 end
 
-def assert_check(testsrc, message = '', opt = '')
-  show_progress(message) {
-    result = get_result_string(testsrc, opt)
-    check_coredump
-    yield(result)
-  }
+def add_assertion src, pr
+  loc = caller_locations(2, 1).first
+  lineno = loc.lineno
+  path = File.basename(loc.path)
+
+  Assertion.new(src, path, lineno, pr)
 end
 
-def assert_equal(expected, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if expected == result
-      nil
-    else
-      desc = "#{result.inspect} (expected #{expected.inspect})"
-      pretty(testsrc, desc, result)
-    end
-  }
+def assert_equal(expected, testsrc, message = '', opt = '', **argh)
+  add_assertion testsrc, -> as do
+    as.assert_check(message, opt, **argh) {|result|
+      if expected == result
+        nil
+      else
+        desc = "#{result.inspect} (expected #{expected.inspect})"
+        pretty(testsrc, desc, result)
+      end
+    }
+  end
 end
 
 def assert_match(expected_pattern, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if expected_pattern =~ result
-      nil
-    else
-      desc = "#{expected_pattern.inspect} expected to be =~\n#{result.inspect}"
-      pretty(testsrc, desc, result)
-    end
-  }
+  add_assertion testsrc, -> as do
+    as.assert_check(message) {|result|
+      if expected_pattern =~ result
+        nil
+      else
+        desc = "#{expected_pattern.inspect} expected to be =~\n#{result.inspect}"
+        pretty(testsrc, desc, result)
+      end
+    }
+  end
 end
 
 def assert_not_match(unexpected_pattern, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if unexpected_pattern !~ result
-      nil
-    else
-      desc = "#{unexpected_pattern.inspect} expected to be !~\n#{result.inspect}"
-      pretty(testsrc, desc, result)
-    end
-  }
+  add_assertion testsrc, -> as do
+    as.assert_check(message) {|result|
+      if unexpected_pattern !~ result
+        nil
+      else
+        desc = "#{unexpected_pattern.inspect} expected to be !~\n#{result.inspect}"
+        pretty(testsrc, desc, result)
+      end
+    }
+  end
 end
 
 def assert_valid_syntax(testsrc, message = '')
-  newtest
-  assert_check(testsrc, message, '-c') {|result|
-    result if /Syntax OK/ !~ result
-  }
+  add_assertion testsrc, -> as do
+    as.assert_check(message, '-c') {|result|
+      result if /Syntax OK/ !~ result
+    }
+  end
 end
 
-def assert_normal_exit(testsrc, *rest)
-  newtest
-  opt = {}
-  opt = rest.pop if Hash === rest.last
-  message, ignore_signals = rest
-  message ||= ''
-  timeout = opt[:timeout]
-  show_progress(message) {
-    faildesc = nil
-    filename = make_srcfile(testsrc)
-    old_stderr = $stderr.dup
-    timeout_signaled = false
-    begin
-      $stderr.reopen("assert_normal_exit.log", "w")
-      io = IO.popen("#{@ruby} -W0 #{filename}")
-      pid = io.pid
-      th = Thread.new {
-        io.read
-        io.close
-        $?
-      }
-      if !th.join(timeout)
-        Process.kill :KILL, pid
-        timeout_signaled = true
-      end
-      status = th.value
-    ensure
-      $stderr.reopen(old_stderr)
-      old_stderr.close
-    end
-    if status.signaled?
-      signo = status.termsig
-      signame = Signal.list.invert[signo]
-      unless ignore_signals and ignore_signals.include?(signame)
-        sigdesc = "signal #{signo}"
-        if signame
-          sigdesc = "SIG#{signame} (#{sigdesc})"
-        end
-        if timeout_signaled
-          sigdesc << " (timeout)"
+def assert_normal_exit(testsrc, *rest, timeout: nil, **opt)
+  add_assertion testsrc, -> as do
+    message, ignore_signals = rest
+    message ||= ''
+    as.show_progress(message) {
+      faildesc = nil
+      filename = as.make_srcfile
+      timeout_signaled = false
+      logfile = "assert_normal_exit.#{as.path}.#{as.lineno}.log"
+
+      begin
+        err = open(logfile, "w")
+        io = IO.popen("#{BT.ruby} -W0 #{filename}", err: err)
+        pid = io.pid
+        th = Thread.new {
+          io.read
+          io.close
+          $?
+        }
+        if !th.join(timeout)
+          Process.kill :KILL, pid
+          timeout_signaled = true
         end
-        faildesc = pretty(testsrc, "killed by #{sigdesc}", nil)
-        stderr_log = File.read("assert_normal_exit.log")
-        if !stderr_log.empty?
-          faildesc << "\n" if /\n\z/ !~ faildesc
-          stderr_log << "\n" if /\n\z/ !~ stderr_log
-          stderr_log.gsub!(/^.*\n/) { '| ' + $& }
-          faildesc << stderr_log
+        status = th.value
+      ensure
+        err.close
+      end
+      if status && status.signaled?
+        signo = status.termsig
+        signame = Signal.list.invert[signo]
+        unless ignore_signals and ignore_signals.include?(signame)
+          sigdesc = "signal #{signo}"
+          if signame
+            sigdesc = "SIG#{signame} (#{sigdesc})"
+          end
+          if timeout_signaled
+            sigdesc << " (timeout)"
+          end
+          faildesc = pretty(testsrc, "killed by #{sigdesc}", nil)
+          stderr_log = File.read(logfile)
+          if !stderr_log.empty?
+            faildesc << "\n" if /\n\z/ !~ faildesc
+            stderr_log << "\n" if /\n\z/ !~ stderr_log
+            stderr_log.gsub!(/^.*\n/) { '| ' + $& }
+            faildesc << stderr_log
+          end
         end
       end
-    end
-    faildesc
-  }
+      faildesc
+    }
+  end
 end
 
 def assert_finish(timeout_seconds, testsrc, message = '')
-  newtest
-  show_progress(message) {
-    faildesc = nil
-    filename = make_srcfile(testsrc)
-    io = IO.popen("#{@ruby} -W0 #{filename}")
-    pid = io.pid
-    waited = false
-    tlimit = Time.now + timeout_seconds
-    while Time.now < tlimit
-      if Process.waitpid pid, Process::WNOHANG
-        waited = true
-        break
-      end
-      sleep 0.1
+  add_assertion testsrc, -> as do
+    if defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # for --jit-wait
+      timeout_seconds *= 3
     end
-    if !waited
-      Process.kill(:KILL, pid)
-      Process.waitpid pid
-      faildesc = pretty(testsrc, "not finished in #{timeout_seconds} seconds", nil)
-    end
-    io.close
-    faildesc
-  }
+
+    as.show_progress(message) {
+      faildesc = nil
+      filename = as.make_srcfile
+      io = IO.popen("#{BT.ruby} -W0 #{filename}", err: as.err)
+      pid = io.pid
+      waited = false
+      tlimit = Time.now + timeout_seconds
+      diff = timeout_seconds
+      while diff > 0
+        if Process.waitpid pid, Process::WNOHANG
+          waited = true
+          break
+        end
+        if io.respond_to?(:read_nonblock)
+          if IO.select([io], nil, nil, diff)
+            begin
+              io.read_nonblock(1024)
+            rescue Errno::EAGAIN, IO::WaitReadable, EOFError
+              break
+            end while true
+          end
+        else
+          sleep 0.1
+        end
+        diff = tlimit - Time.now
+      end
+      if !waited
+        Process.kill(:KILL, pid)
+        Process.waitpid pid
+        faildesc = pretty(testsrc, "not finished in #{timeout_seconds} seconds", nil)
+      end
+      io.close
+      faildesc
+    }
+  end
 end
 
 def flunk(message = '')
-  newtest
-  show_progress('') { message }
+  add_assertion '', -> as do
+    as.show_progress('') { message }
+  end
+end
+
+def show_limit(testsrc, opt = '', **argh)
+  return if BT.quiet
+
+  add_assertion testsrc, -> as do
+    result = as.get_result_string(opt, **argh)
+    Assertion.errbuf << result
+  end
 end
 
 def pretty(src, desc, result)
-  src = src.sub(/\A.*\n/, '')
+  src = src.sub(/\A\s*\n/, '')
   (/\n/ =~ src ? "\n#{adjust_indent(src)}" : src) + "  #=> #{desc}"
 end
 
 INDENT = 27
 
 def adjust_indent(src)
-  untabify(src).gsub(/^ {#{INDENT}}/o, '').gsub(/^/, '   ')
+  untabify(src).gsub(/^ {#{INDENT}}/o, '').gsub(/^/, '   ').sub(/\s*\z/, "\n")
 end
 
 def untabify(str)
   str.gsub(/^\t+/) {' ' * (8 * $&.size) }
 end
 
-def make_srcfile(src)
-  filename = 'bootstraptest.tmp.rb'
-  File.open(filename, 'w') {|f|
-    f.puts "GC.stress = true" if $stress
-    f.puts "print(begin; #{src}; end)"
-  }
-  filename
-end
-
-def get_result_string(src, opt = '')
-  if @ruby
-    filename = make_srcfile(src)
-    begin
-      `#{@ruby} -W0 #{opt} #{filename}`
-    ensure
-      raise Interrupt if $?.signaled? && $?.termsig == Signal.list["INT"]
-      raise CoreDumpError, "core dumped" if $? and $?.coredump?
-    end
-  else
-    eval(src).to_s
-  end
-end
-
-def with_stderr
-  out = err = nil
-  begin
-    r, w = IO.pipe
-    stderr = $stderr.dup
-    $stderr.reopen(w)
-    w.close
-    reader = Thread.start {r.read}
-    begin
-      out = yield
-    ensure
-      $stderr.reopen(stderr)
-      err = reader.value
-    end
-  ensure
-    w.close rescue nil
-    r.close rescue nil
-  end
-  return out, err
-end
-
-def newtest
-  @location = File.basename(caller(2).first)
-  @count += 1
-  cleanup_coredump
-end
-
-def error(msg, additional_message)
-  msg = "#{@failed}\##{@count} #{@location}#{@reset}: #{msg}  #{additional_message}"
-  if @tty
-    $stderr.puts "#{@erase}#{msg}"
-  else
-    @errbuf.push msg
-  end
-  @error += 1
-end
-
 def in_temporary_working_directory(dir)
   if dir
     Dir.mkdir dir
@@ -468,18 +756,32 @@ def in_temporary_working_directory(dir)
 end
 
 def cleanup_coredump
-  FileUtils.rm_f 'core'
+  if File.file?('core')
+    require 'time'
+    Dir.glob('/tmp/bootstraptest-core.*').each do |f|
+      if Time.now - File.mtime(f) > 7 * 24 * 60 * 60 # 7 days
+        warn "Deleting an old core file: #{f}"
+        FileUtils.rm(f)
+      end
+    end
+    core_path = "/tmp/bootstraptest-core.#{Time.now.utc.iso8601}"
+    warn "A core file is found. Saving it at: #{core_path.dump}"
+    FileUtils.mv('core', core_path)
+    cmd = ['gdb', BT.ruby, '-c', core_path, '-ex', 'bt', '-batch']
+    p cmd # debugging why it's not working
+    system(*cmd)
+  end
   FileUtils.rm_f Dir.glob('core.*')
-  FileUtils.rm_f @ruby+'.stackdump' if @ruby
+  FileUtils.rm_f BT.ruby+'.stackdump' if BT.ruby
 end
 
 class CoreDumpError < StandardError; end
 
 def check_coredump
   if File.file?('core') or not Dir.glob('core.*').empty? or
-      (@ruby and File.exist?(@ruby+'.stackdump'))
+      (BT.ruby and File.exist?(BT.ruby+'.stackdump'))
     raise CoreDumpError, "core dumped"
   end
 end
 
-main
+exit main
diff --git a/bootstraptest/test_attr.rb b/bootstraptest/test_attr.rb
index 721a847145..3cb9d3eb39 100644
--- a/bootstraptest/test_attr.rb
+++ b/bootstraptest/test_attr.rb
@@ -34,3 +34,19 @@ assert_equal %{ok}, %{
     print "ok"
   end
 }, '[ruby-core:15120]'
+
+assert_equal %{ok}, %{
+  class Big
+    attr_reader :foo
+    def initialize
+      @foo = "ok"
+    end
+  end
+
+  obj = Big.new
+  100.times do |i|
+    obj.instance_variable_set(:"@ivar_\#{i}", i)
+  end
+
+  Big.new.foo
+}
diff --git a/bootstraptest/test_autoload.rb b/bootstraptest/test_autoload.rb
index a9f8e6dacd..9e0850bc52 100644
--- a/bootstraptest/test_autoload.rb
+++ b/bootstraptest/test_autoload.rb
@@ -1,7 +1,7 @@
 assert_equal 'ok', %q{
-  File.unlink('zzz.rb') if File.file?('zzz.rb')
+  File.unlink('zzz1.rb') if File.file?('zzz1.rb')
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz1.rb'
     begin
       ZZZ
     rescue LoadError
@@ -11,9 +11,9 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open('zzz.rb', 'w') {|f| f.puts '' }
+  open('zzz2.rb', 'w') {|f| f.puts '' }
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz2.rb'
     begin
       ZZZ
     rescue NameError
@@ -23,29 +23,29 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open('zzz.rb', 'w') {|f| f.puts 'class ZZZ; def self.ok;:ok;end;end'}
+  open('zzz3.rb', 'w') {|f| f.puts 'class ZZZ; def self.ok;:ok;end;end'}
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz3.rb'
     ZZZ.ok
   end
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
+  open("zzz4.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz4.rb"
   ZZZ.ok
 }
 
 assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
-  require "./zzz.rb"
+  open("zzz5.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz5.rb"
+  require "./zzz5.rb"
   ZZZ.ok
 }
 
 assert_equal 'okok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
+  open("zzz6.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz6.rb"
   t1 = Thread.new {ZZZ.ok}
   t2 = Thread.new {ZZZ.ok}
   [t1.value, t2.value].join
@@ -60,9 +60,9 @@ assert_finish 5, %q{
 }, '[ruby-core:21696]'
 
 assert_equal 'A::C', %q{
-  open("zzz.rb", "w") {}
+  open("zzz7.rb", "w") {}
   class A
-    autoload :C, "./zzz"
+    autoload :C, "./zzz7"
     class C
     end
     C
diff --git a/bootstraptest/test_block.rb b/bootstraptest/test_block.rb
index 6a2ccfc6da..cdc5960a59 100644
--- a/bootstraptest/test_block.rb
+++ b/bootstraptest/test_block.rb
@@ -597,3 +597,17 @@ assert_equal 'true', %q{
   C1.new.foo{}
 }
 
+assert_equal 'ok', %q{
+  1.times do
+    begin
+      raise
+    rescue
+      begin
+        raise
+      rescue
+        break
+      end
+    end
+  end
+  'ok'
+}
diff --git a/bootstraptest/test_class.rb b/bootstraptest/test_class.rb
index 664dd2f166..b7fe0a1acd 100644
--- a/bootstraptest/test_class.rb
+++ b/bootstraptest/test_class.rb
@@ -11,6 +11,16 @@ assert_equal 'C',       %q( class C; end
                             C.new.class.name )
 assert_equal 'Class',   %q( class C; end
                             C.new.class.class )
+assert_equal 'true',    %q( Object.__send__(:remove_const, :TrueClass)
+                            GC.start
+                            true.inspect)
+assert_equal 'false',   %q( Object.__send__(:remove_const, :FalseClass)
+                            GC.start
+                            false.inspect)
+assert_equal 'nil',     %q( Object.__send__(:remove_const, :NilClass)
+                            GC.start
+                            nil.inspect)
+
 
 # inherited class
 assert_equal 'true',    %q( class A; end
diff --git a/bootstraptest/test_constant_cache.rb b/bootstraptest/test_constant_cache.rb
new file mode 100644
index 0000000000..1fa83256ed
--- /dev/null
+++ b/bootstraptest/test_constant_cache.rb
@@ -0,0 +1,187 @@
+# Constant lookup is cached.
+assert_equal '1', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+  const
+}
+
+# Invalidate when a constant is set.
+assert_equal '2', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+
+  CONST = 2
+
+  const
+}
+
+# Invalidate when a constant of the same name is set.
+assert_equal '1', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+
+  class Container
+    CONST = 2
+  end
+
+  const
+}
+
+# Invalidate when a constant is removed.
+assert_equal 'missing', %q{
+  class Container
+    CONST = 1
+
+    def const
+      CONST
+    end
+
+    def self.const_missing(name)
+      'missing'
+    end
+
+    new.const
+    remove_const :CONST
+  end
+
+  Container.new.const
+}
+
+# Invalidate when a constant's visibility changes.
+assert_equal 'missing', %q{
+  class Container
+    CONST = 1
+
+    def self.const_missing(name)
+      'missing'
+    end
+  end
+
+  def const
+    Container::CONST
+  end
+
+  const
+
+  Container.private_constant :CONST
+
+  const
+}
+
+# Invalidate when a constant's visibility changes even if the call to the
+# visibility change method fails.
+assert_equal 'missing', %q{
+  class Container
+    CONST1 = 1
+
+    def self.const_missing(name)
+      'missing'
+    end
+  end
+
+  def const1
+    Container::CONST1
+  end
+
+  const1
+
+  begin
+    Container.private_constant :CONST1, :CONST2
+  rescue NameError
+  end
+
+  const1
+}
+
+# Invalidate when a module is included.
+assert_equal 'INCLUDE', %q{
+  module Include
+    CONST = :INCLUDE
+  end
+
+  class Parent
+    CONST = :PARENT
+  end
+
+  class Child < Parent
+    def const
+      CONST
+    end
+
+    new.const
+
+    include Include
+  end
+
+  Child.new.const
+}
+
+# Invalidate when const_missing is hit.
+assert_equal '2', %q{
+  module Container
+    Foo = 1
+    Bar = 2
+
+    class << self
+      attr_accessor :count
+
+      def const_missing(name)
+        @count += 1
+        @count == 1 ? Foo : Bar
+      end
+    end
+
+    @count = 0
+  end
+
+  def const
+    Container::Baz
+  end
+
+  const
+  const
+}
+
+# Invalidate when the iseq gets cleaned up.
+assert_equal '2', %q{
+  CONSTANT = 1
+
+  iseq = RubyVM::InstructionSequence.compile(<<~RUBY)
+    CONSTANT
+  RUBY
+
+  iseq.eval
+  iseq = nil
+
+  GC.start
+  CONSTANT = 2
+}
+
+# Invalidate when the iseq gets cleaned up even if it was never in the cache.
+assert_equal '2', %q{
+  CONSTANT = 1
+
+  iseq = RubyVM::InstructionSequence.compile(<<~RUBY)
+    CONSTANT
+  RUBY
+
+  iseq = nil
+
+  GC.start
+  CONSTANT = 2
+}
diff --git a/bootstraptest/test_env.rb b/bootstraptest/test_env.rb
new file mode 100644
index 0000000000..7d1b45b75e
--- /dev/null
+++ b/bootstraptest/test_env.rb
@@ -0,0 +1,12 @@
+assert_equal "true", %q{
+  ENV["ENVTEST"] = "\u{e9 3042 d76c}"
+  env = ENV["ENVTEST"]
+  env.valid_encoding?
+}
+
+# different encoding is used for PATH
+assert_equal "true", %q{
+  ENV["PATH"] = "\u{e9 3042 d76c}"
+  env = ENV["PATH"]
+  env.valid_encoding?
+}
diff --git a/bootstraptest/test_eval.rb b/bootstraptest/test_eval.rb
index bf7478006d..a9f389c673 100644
--- a/bootstraptest/test_eval.rb
+++ b/bootstraptest/test_eval.rb
@@ -109,13 +109,40 @@ assert_equal %q{foo}, %q{
   }
 }
 assert_equal %q{1}, %q{
-  class Fixnum
+  class Integer
     Const = 1
   end
   1.instance_eval %{
     Const
   }
 }
+assert_equal %q{1}, %q{
+  class TrueClass
+    Const = 1
+  end
+  true.instance_eval %{
+    Const
+  }
+}
+assert_equal %q{[:Const]}, %q{
+  mod = Module.new
+  mod.instance_eval %{
+    Const = 1
+  }
+  raise if defined?(Module::Const)
+  mod.singleton_class.constants
+}
+assert_equal %q{can't define singleton}, %q{
+  begin
+    123.instance_eval %{
+      Const = 1
+    }
+    "bad"
+  rescue TypeError => e
+    raise "bad" if defined?(Integer::Const)
+    e.message
+  end
+}
 assert_equal %q{top}, %q{
   Const = :top
   class C
@@ -190,7 +217,8 @@ assert_equal %q{[10, main]}, %q{
 }
 
 %w[break next redo].each do |keyword|
-  assert_match %r"Can't escape from eval with #{keyword}\z", %{
+  assert_match %r"Can't escape from eval with #{keyword}\b", %{
+    $stderr = STDOUT
     begin
       eval "0 rescue #{keyword}"
     rescue SyntaxError => e
@@ -200,7 +228,7 @@ assert_equal %q{[10, main]}, %q{
 end
 
 assert_normal_exit %q{
-  STDERR.reopen(STDOUT)
+  $stderr = STDOUT
   class Foo
      def self.add_method
        class_eval("def some-bad-name; puts 'hello' unless @some_variable.some_function(''); end")
@@ -249,7 +277,9 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    12.instance_eval { @@a }
+    class A
+      12.instance_eval { @@a }
+    end
   rescue NameError
     :ok
   end
@@ -257,7 +287,9 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    12.instance_exec { @@a }
+    class A
+      12.instance_exec { @@a }
+    end
   rescue NameError
     :ok
   end
diff --git a/bootstraptest/test_exception.rb b/bootstraptest/test_exception.rb
index 35c8d25e37..0fb6f552b8 100644
--- a/bootstraptest/test_exception.rb
+++ b/bootstraptest/test_exception.rb
@@ -402,7 +402,7 @@ assert_equal 'nil', %q{
   exc.inspect
 }, '[ruby-dev:32608]'
 
-assert_equal 'exception class/object expected', %q{
+assert_equal 'divided by 0', %q{
   class ZeroDivisionError
     def self.new(message)
       42
diff --git a/bootstraptest/test_fiber.rb b/bootstraptest/test_fiber.rb
new file mode 100644
index 0000000000..2614dd13bf
--- /dev/null
+++ b/bootstraptest/test_fiber.rb
@@ -0,0 +1,39 @@
+show_limit %q{
+  fibers = []
+  begin
+    fiber = Fiber.new{Fiber.yield}
+    fiber.resume
+    fibers << fiber
+
+    raise Exception, "skipping" if fibers.count >= 10_000
+  rescue Exception => error
+    puts "Fiber count: #{fibers.count} (#{error})"
+    break
+  end while true
+}
+
+assert_equal %q{ok}, %q{
+  Fiber.new{
+  }.resume
+  :ok
+}
+
+assert_equal %q{ok}, %q{
+  100.times.collect{Fiber.new{}}
+  :ok
+}
+
+assert_equal %q{ok}, %q{
+  fibers = 1000.times.collect{Fiber.new{Fiber.yield}}
+  fibers.each(&:resume)
+  fibers.each(&:resume)
+  :ok
+}
+
+assert_normal_exit %q{
+  at_exit { Fiber.new{}.resume }
+}
+
+assert_normal_exit %q{
+  Fiber.new(&Object.method(:class_eval)).resume("foo")
+}, '[ruby-dev:34128]'
diff --git a/bootstraptest/test_flow.rb b/bootstraptest/test_flow.rb
index 0390062a24..35f19db588 100644
--- a/bootstraptest/test_flow.rb
+++ b/bootstraptest/test_flow.rb
@@ -534,11 +534,11 @@ assert_equal %Q{ENSURE\n}, %q{
  ['[ruby-core:39125]', %q{
   class Bug5234
     include Enumerable
-    def each
+    def each(&block)
       begin
         yield :foo
       ensure
-        proc
+        proc(&block)
       end
     end
   end
@@ -547,11 +547,11 @@ assert_equal %Q{ENSURE\n}, %q{
  ['[ruby-dev:45656]', %q{
   class Bug6460
     include Enumerable
-    def each
+    def each(&block)
       begin
         yield :foo
       ensure
-        1.times { Proc.new }
+        1.times { Proc.new(&block) }
       end
     end
   end
@@ -589,3 +589,13 @@ assert_equal "foo", %q{
   end
   Bug6460.new.m1
 }, '[ruby-dev:46372]'
+
+assert_equal "foo", %q{
+  obj = "foo"
+  if obj || any1
+    any2 = any2
+  else
+    raise obj.inspect
+  end
+  obj
+}, '[ruby-core:87830]'
diff --git a/bootstraptest/test_fork.rb b/bootstraptest/test_fork.rb
index 384294727f..83923dad97 100644
--- a/bootstraptest/test_fork.rb
+++ b/bootstraptest/test_fork.rb
@@ -21,27 +21,35 @@ assert_finish 10, %q{
   end
 }, '[ruby-core:22158]'
 
-assert_normal_exit(<<'End', '[ruby-dev:37934]')
-  Thread.new { sleep 1; Thread.kill Thread.main }
-  Process.setrlimit(:NPROC, 1)
+# temporarily stop this test to enable explicit failure when
+# timer thread couldn't be created (r61706 and r61717).
+assert_normal_exit(<<'End', '[ruby-dev:37934]') if false
+  main = Thread.current
+  Thread.new { sleep 0.01 until main.stop?; Thread.kill main }
+  Process.setrlimit(:NPROC, 1) if defined?(Process::RLIMIT_NPROC)
   fork {}
 End
 
 assert_equal 'ok', %q{
   begin
+    r, w = IO.pipe
     if pid1 = fork
-      sleep 1
+      w.close
+      r.read(1)
       Process.kill("USR1", pid1)
       _, s = Process.wait2(pid1)
       s.success? ? :ok : :ng
     else
+      r.close
       if pid2 = fork
-        trap("USR1") { Time.now.to_s }
+        trap("USR1") { Time.now.to_s; Process.kill("USR2", pid2) }
+        w.close
         Process.wait2(pid2)
       else
-        sleep 2
+        w.close
+        sleep 0.2
       end
-      exit 0
+      exit true
     end
   rescue NotImplementedError
     :ok
@@ -50,17 +58,17 @@ assert_equal 'ok', %q{
 
 assert_equal '[1, 2]', %q{
   a = []
-  trap(:INT) { a.push(1) }
-  trap(:TERM) { a.push(2) }
+  main = Thread.current
+  trap(:INT) { a.push(1).size == 2 and main.wakeup }
+  trap(:TERM) { a.push(2).size == 2 and main.wakeup }
   pid = $$
   begin
-    fork do
-      sleep 0.5
+    pid = fork do
       Process.kill(:INT, pid)
       Process.kill(:TERM, pid)
     end
-
-    sleep 1
+    Process.wait(pid)
+    100.times {break if a.size > 1; sleep 0.001}
     a.sort
   rescue NotImplementedError
     [1, 2]
diff --git a/bootstraptest/test_insns.rb b/bootstraptest/test_insns.rb
new file mode 100644
index 0000000000..91fba9b011
--- /dev/null
+++ b/bootstraptest/test_insns.rb
@@ -0,0 +1,440 @@
+# C0 coverage of each instructions
+
+# :NOTE: This is for development purpose; never consider this file as
+# ISeq compilation specification.
+
+begin
+  # This library brings some additional coverage.
+  # Not mandatory.
+  require 'rbconfig/sizeof'
+rescue LoadError
+  # OK, just skip
+else
+  if defined? RbConfig::LIMITS
+    $FIXNUM_MAX = RbConfig::LIMITS["FIXNUM_MAX"]
+    $FIXNUM_MIN = RbConfig::LIMITS["FIXNUM_MIN"]
+  end
+end
+
+fsl   = { frozen_string_literal: true } # used later
+tests = [
+  # insn ,   expression to generate such insn
+  [ 'nop',   %q{ raise rescue true }, ],
+
+  [ 'setlocal *, 0', %q{ x = true }, ],
+  [ 'setlocal *, 1', %q{ x = nil; -> { x = true }.call }, ],
+  [ 'setlocal',      %q{ x = nil; -> { -> { x = true }.() }.() }, ],
+  [ 'getlocal *, 0', %q{ x = true; x }, ],
+  [ 'getlocal *, 1', %q{ x = true; -> { x }.call }, ],
+  [ 'getlocal',      %q{ x = true; -> { -> { x }.() }.() }, ],
+
+  [ 'setblockparam', <<-'},', ], # {
+    def m&b
+      b = # here
+        proc { true }
+    end
+    m { false }.call
+  },
+  [ 'getblockparam', <<-'},', ], # {
+    def m&b
+      b # here
+    end
+    m { true }.call
+  },
+  [ 'getblockparamproxy', <<-'},', ], # {
+    def m&b
+      b # here
+        .call
+    end
+    m { true }
+  },
+
+  [ 'setspecial', %q{ true if true..true }, ],
+  [ 'getspecial', %q{ $&.nil? }, ],
+  [ 'getspecial', %q{ $`.nil? }, ],
+  [ 'getspecial', %q{ $'.nil? }, ],
+  [ 'getspecial', %q{ $+.nil? }, ],
+  [ 'getspecial', %q{ $1.nil? }, ],
+  [ 'getspecial', %q{ $128.nil? }, ],
+
+  [ 'getglobal', %q{ String === $0 }, ],
+  [ 'getglobal', %q{ $_.nil? }, ],
+  [ 'setglobal', %q{ $0 = "true" }, ],
+
+  [ 'setinstancevariable', %q{ @x = true }, ],
+  [ 'getinstancevariable', %q{ @x = true; @x }, ],
+
+  [ 'setclassvariable', %q{ class A; @@x = true; end }, ],
+  [ 'getclassvariable', %q{ class A; @@x = true; @@x end }, ],
+
+  [ 'setconstant', %q{ X = true }, ],
+  [ 'setconstant', %q{ Object::X = true }, ],
+  [ 'getconstant', %q{ X = true; X }, ],
+  [ 'getconstant', %q{ X = true; Object::X }, ],
+
+  [ 'getinlinecache / setinlinecache', %q{ def x; X; end; X = true; x; x; x }, ],
+
+  [ 'putnil',               %q{ $~ == nil }, ],
+  [ 'putself',              %q{ $~ != self }, ],
+  [ 'putobject INT2FIX(0)', %q{ $~ != 0 }, ],
+  [ 'putobject INT2FIX(1)', %q{ $~ != 1 }, ],
+  [ 'putobject',            %q{ $~ != -1 }, ],
+  [ 'putobject',            %q{ $~ != /x/ }, ],
+  [ 'putobject',            %q{ $~ != :x }, ],
+  [ 'putobject',            %q{ $~ != (1..2) }, ],
+  [ 'putobject',            %q{ $~ != true }, ],
+  [ 'putobject',            %q{ /(?<x>x)/ =~ "x"; x == "x" }, ],
+
+  [ 'putspecialobject',         %q{ {//=>true}[//] }, ],
+  [ 'putstring',                %q{ "true" }, ],
+  [ 'tostring / concatstrings', %q{ "#{true}" }, ],
+  [ 'toregexp',                 %q{ /#{true}/ =~ "true" && $~ }, ],
+  [ 'intern',                   %q{ :"#{true}" }, ],
+
+  [ 'newarray',    %q{ ["true"][0] }, ],
+  [ 'newarraykwsplat', %q{ [**{x:'true'}][0][:x] }, ],
+  [ 'duparray',    %q{ [ true ][0] }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, = y; x }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, *z = y; x }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, *z, w = y; x }, ],
+  [ 'splatarray',  %q{ x, = *(y = true), false; x }, ],
+  [ 'concatarray', %q{ ["t", "r", *x = "u", "e"].join }, ],
+  [ 'concatarray', <<-'},', ],  # {
+    class X; def to_a; ['u']; end; end
+    ['t', 'r', *X.new, 'e'].join
+  },
+  [ 'concatarray', <<-'},', ],  # {
+    r = false
+    t = [true, nil]
+    q, w, e = r, *t             # here
+    w
+  },
+
+  [ 'newhash',  %q{ x = {}; x[x] = true }, ],
+  [ 'newhash',  %q{ x = true; { x => x }[x] }, ],
+  [ 'newhashfromarray', %q{ { a: true }[:a] }, ],
+  [ 'newrange', %q{ x = 1; [*(0..x)][0] == 0 }, ],
+  [ 'newrange', %q{ x = 1; [*(0...x)][0] == 0 }, ],
+
+  [ 'pop',     %q{ def x; true; end; x }, ],
+  [ 'dup',     %q{ x = y = true; x }, ],
+  [ 'dupn',    %q{ Object::X ||= true }, ],
+  [ 'reverse', %q{ q, (w, e), r = 1, [2, 3], 4; e == 3 }, ],
+  [ 'swap',    %q{ !!defined?([[]]) }, ],
+  [ 'swap',    <<-'},', ],      # {
+    x = [[false, true]]
+    for i, j in x               # here
+      ;
+    end
+    j
+  },
+
+  [ 'topn',        %q{ x, y = [], 0; x[*y], = [true, false]; x[0] }, ],
+  [ 'setn',        %q{ x, y = [], 0; x[*y]  =  true        ; x[0] }, ],
+  [ 'adjuststack', %q{ x = [true]; x[0] ||= nil; x[0] }, ],
+
+  [ 'defined',      %q{ !defined?(x) }, ],
+  [ 'checkkeyword', %q{ def x x:rand;x end; x x: true }, ],
+  [ 'checktype',    %q{ x = true; "#{x}" }, ],
+  [ 'checkmatch',   <<-'},', ], # {
+    x = y = true
+    case x
+    when false
+      y = false
+    when true                   # here
+      y = nil
+    end
+    y == nil
+  },
+  [ 'checkmatch',   <<-'},', ], # {
+    x, y = true, [false]
+    case x
+    when *y                     # here
+      z = false
+    else
+      z = true
+    end
+    z
+  },
+  [ 'checkmatch',   <<-'},', ], # {
+    x = false
+    begin
+      raise
+    rescue                      # here
+      x = true
+    end
+    x
+  },
+
+  [ 'defineclass', %q{                 module X;    true end }, ],
+  [ 'defineclass', %q{ X = Module.new; module X;    true end }, ],
+  [ 'defineclass', %q{                 class X;     true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class X;     true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class Y < X; true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class << X;  true end }, ],
+  [ 'defineclass', <<-'},', ], # {
+    X = Class.new
+    Y = Class.new(X)
+    class Y < X
+      true
+    end
+  },
+
+  [ 'opt_send_without_block', %q{ true.to_s }, ],
+  [ 'send',                   %q{ true.tap {|i| i.to_s } }, ],
+  [ 'leave',                  %q{ def x; true; end; x }, ],
+  [ 'invokesuper',            <<-'},', ], # {
+    class X < String
+      def empty?
+        super                   # here
+      end
+    end
+   X.new.empty?
+  },
+  [ 'invokeblock',            <<-'},', ], # {
+    def x
+      return yield self         # here
+    end
+    x do
+      true
+    end
+  },
+
+  [ 'opt_str_freeze', %q{ 'true'.freeze }, ],
+  [ 'opt_nil_p',      %q{ nil.nil? }, ],
+  [ 'opt_nil_p',      %q{ !Object.nil? }, ],
+  [ 'opt_nil_p',      %q{ Class.new{def nil?; true end}.new.nil? }, ],
+  [ 'opt_str_uminus', %q{ -'true' }, ],
+  [ 'opt_str_freeze', <<-'},', ], # {
+    class String
+      def freeze
+        true
+      end
+    end
+    'true'.freeze
+  },
+
+  [ 'opt_newarray_max', %q{ [ ].max.nil? }, ],
+  [ 'opt_newarray_max', %q{ [1, x = 2, 3].max == 3 }, ],
+  [ 'opt_newarray_max', <<-'},', ], # {
+    class Array
+      def max
+        true
+      end
+    end
+    [1, x = 2, 3].max
+  },
+  [ 'opt_newarray_min', %q{ [ ].min.nil? }, ],
+  [ 'opt_newarray_min', %q{ [3, x = 2, 1].min == 1 }, ],
+  [ 'opt_newarray_min', <<-'},', ], # {
+    class Array
+      def min
+        true
+      end
+    end
+    [3, x = 2, 1].min
+  },
+
+  [ 'throw',        %q{ false.tap { break true } }, ],
+  [ 'branchif',     %q{ x = nil;  x ||= true }, ],
+  [ 'branchif',     %q{ x = true; x ||= nil; x }, ],
+  [ 'branchunless', %q{ x = 1;    x &&= true }, ],
+  [ 'branchunless', %q{ x = nil;  x &&= true; x.nil? }, ],
+  [ 'branchnil',    %q{ x = true; x&.to_s }, ],
+  [ 'branchnil',    %q{ x = nil;  (x&.to_s).nil? }, ],
+  [ 'jump',         <<-'},', ], # {
+    y = 1
+    x = if y == 0 then nil elsif y == 1 then true else nil end
+    x
+  },
+  [ 'jump',         <<-'},', ], # {
+    # ultra complicated situation: this ||= assignment only generates
+    # 15 instructions, not including the class definition.
+    class X; attr_accessor :x; end
+    x = X.new
+    x&.x ||= true               # here
+  },
+
+  [ 'once', %q{ /#{true}/o =~ "true" && $~ }, ],
+  [ 'once', <<-'},', ],         # {
+    def once expr
+      return /#{expr}/o         # here
+    end
+    x = once(true); x = once(false); x = once(nil);
+    x =~ "true" && $~
+  },
+  [ 'once', <<-'},', ],         # {
+    # recursive once
+    def once n
+      return %r/#{
+        if n == 0
+          true
+        else
+          once(n-1)             # here
+        end
+      }/ox
+    end
+    x = once(128); x = once(7); x = once(16);
+    x =~ "true" && $~
+  },
+  [ 'once', <<-'},', ],         # {
+    # inter-thread lockup situation
+    def once n
+      return Thread.start n do |m|
+        Thread.pass
+        next %r/#{
+          sleep m               # here
+          true
+        }/ox
+      end
+    end
+    x = once(1); y = once(0.1); z = y.value
+    z =~ "true" && $~
+  },
+
+  [ 'opt_case_dispatch', %q{ case   0 when 1.1 then false else true end }, ],
+  [ 'opt_case_dispatch', %q{ case 1.0 when 1.1 then false else true end }, ],
+
+  [ 'opt_plus',    %q{ 1 + 1 == 2 }, ],
+  if defined? $FIXNUM_MAX then
+    [ 'opt_plus',  %Q{ #{ $FIXNUM_MAX } + 1 == #{ $FIXNUM_MAX + 1 } }, ]
+  end,
+  [ 'opt_plus',    %q{ 1.0 + 1.0 == 2.0 }, ],
+  [ 'opt_plus',    %q{ x = +0.0.next_float; x + x >= x }, ],
+  [ 'opt_plus',    %q{ 't' + 'rue' }, ],
+  [ 'opt_plus',    %q{ ( ['t'] + ['r', ['u', ['e'], ], ] ).join }, ],
+  [ 'opt_plus',    %q{ Time.at(1) + 1 == Time.at(2) }, ],
+  [ 'opt_minus',   %q{ 1 - 1 == 0 }, ],
+  if defined? $FIXNUM_MIN then
+    [ 'opt_minus', %Q{ #{ $FIXNUM_MIN } - 1 == #{ $FIXNUM_MIN - 1 } }, ]
+  end,
+  [ 'opt_minus',   %q{ 1.0 - 1.0 == 0.0 }, ],
+  [ 'opt_minus',   %q{ x = -0.0.prev_float; x - x == 0.0 }, ],
+  [ 'opt_minus',   %q{ ( [false, true] - [false] )[0] }, ],
+  [ 'opt_mult',    %q{ 1 * 1 == 1 }, ],
+  [ 'opt_mult',    %q{ 1.0 * 1.0 == 1.0 }, ],
+  [ 'opt_mult',    %q{ x = +0.0.next_float; x * x <= x }, ],
+  [ 'opt_mult',    %q{ ( "ruet" * 3 )[7,4] }, ],
+  [ 'opt_div',     %q{ 1 / 1 == 1 }, ],
+  [ 'opt_div',     %q{ 1.0 / 1.0 == 1.0 }, ],
+  [ 'opt_div',     %q{ x = +0.0.next_float; x / x >= x }, ],
+  [ 'opt_div',     %q{ x = 1/2r; x / x == 1 }, ],
+  [ 'opt_mod',     %q{ 1 % 1 == 0 }, ],
+  [ 'opt_mod',     %q{ 1.0 % 1.0 == 0.0 }, ],
+  [ 'opt_mod',     %q{ x = +0.0.next_float; x % x == 0.0 }, ],
+  [ 'opt_mod',     %q{ '%s' % [ true ] }, ],
+
+  [ 'opt_eq', %q{ 1 == 1 }, ],
+  [ 'opt_eq', <<-'},', ],       # {
+    class X; def == other; true; end; end
+    X.new == true
+  },
+  [ 'opt_neq', %q{ 1 != 0 }, ],
+  [ 'opt_neq', <<-'},', ],       # {
+    class X; def != other; true; end; end
+    X.new != true
+  },
+
+  [ 'opt_lt', %q{            -1   <  0 }, ],
+  [ 'opt_lt', %q{            -1.0 <  0.0 }, ],
+  [ 'opt_lt', %q{ -0.0.prev_float <  0.0 }, ],
+  [ 'opt_lt', %q{              ?a <  ?z }, ],
+  [ 'opt_le', %q{            -1   <= 0 }, ],
+  [ 'opt_le', %q{            -1.0 <= 0.0 }, ],
+  [ 'opt_le', %q{ -0.0.prev_float <= 0.0 }, ],
+  [ 'opt_le', %q{              ?a <= ?z }, ],
+  [ 'opt_gt', %q{             1   >  0 }, ],
+  [ 'opt_gt', %q{             1.0 >  0.0 }, ],
+  [ 'opt_gt', %q{ +0.0.next_float >  0.0 }, ],
+  [ 'opt_gt', %q{              ?z >  ?a }, ],
+  [ 'opt_ge', %q{             1   >= 0 }, ],
+  [ 'opt_ge', %q{             1.0 >= 0.0 }, ],
+  [ 'opt_ge', %q{ +0.0.next_float >= 0.0 }, ],
+  [ 'opt_ge', %q{              ?z >= ?a }, ],
+
+  [ 'opt_ltlt', %q{  '' << 'true' }, ],
+  [ 'opt_ltlt', %q{ ([] << 'true').join }, ],
+  [ 'opt_ltlt', %q{ (1 << 31) == 2147483648 }, ],
+
+  [ 'opt_aref', %q{ ['true'][0] }, ],
+  [ 'opt_aref', %q{ { 0 => 'true'}[0] }, ],
+  [ 'opt_aref', %q{ 'true'[0] == ?t }, ],
+  [ 'opt_aset', %q{ [][0] = true }, ],
+  [ 'opt_aset', %q{ {}[0] = true }, ],
+  [ 'opt_aset', %q{ x = 'frue'; x[0] = 't'; x }, ],
+  [ 'opt_aset', <<-'},', ], # {
+    # opt_aref / opt_aset mixup situation
+    class X; def x; {}; end; end
+    x = X.new
+    x&.x[true] ||= true         # here
+  },
+
+  [ 'opt_aref_with', %q{ { 'true' => true }['true'] }, ],
+  [ 'opt_aref_with', %q{ Struct.new(:nil).new['nil'].nil? }, ],
+  [ 'opt_aset_with', %q{ {}['true'] = true }, ],
+  [ 'opt_aset_with', %q{ Struct.new(:true).new['true'] = true }, ],
+
+  [ 'opt_length',  %q{   'true'       .length == 4 }, ],
+  [ 'opt_length',  %q{   :true        .length == 4 }, ],
+  [ 'opt_length',  %q{ [ 'true' ]     .length == 1 }, ],
+  [ 'opt_length',  %q{ { 'true' => 1 }.length == 1 }, ],
+  [ 'opt_size',    %q{   'true'       .size   == 4 }, ],
+  [ 'opt_size',    %q{               1.size   >= 4 }, ],
+  [ 'opt_size',    %q{ [ 'true' ]     .size   == 1 }, ],
+  [ 'opt_size',    %q{ { 'true' => 1 }.size   == 1 }, ],
+  [ 'opt_empty_p', %q{ ''.empty? }, ],
+  [ 'opt_empty_p', %q{ [].empty? }, ],
+  [ 'opt_empty_p', %q{ {}.empty? }, ],
+  [ 'opt_empty_p', %q{ Thread::Queue.new.empty? }, ],
+
+  [ 'opt_succ',  %q{ 1.succ == 2 }, ],
+  if defined? $FIXNUM_MAX then
+    [ 'opt_succ',%Q{ #{ $FIXNUM_MAX }.succ == #{ $FIXNUM_MAX + 1 } }, ]
+  end,
+  [ 'opt_succ',  %q{ '1'.succ == '2' }, ],
+
+  [ 'opt_not',  %q{ ! false }, ],
+  [ 'opt_neq', <<-'},', ],       # {
+    class X; def !; true; end; end
+    ! X.new
+  },
+
+  [ 'opt_regexpmatch2',  %q{ /true/ =~ 'true' && $~ }, ],
+  [ 'opt_regexpmatch2', <<-'},', ],       # {
+    class Regexp; def =~ other; true; end; end
+    /true/ =~ 'true'
+  },
+  [ 'opt_regexpmatch2',  %q{ 'true' =~ /true/ && $~ }, ],
+  [ 'opt_regexpmatch2', <<-'},', ],       # {
+    class String; def =~ other; true; end; end
+    'true' =~ /true/
+  },
+]
+
+# normal path
+tests.compact.each do |(insn, expr, *a)|
+  if a.last.is_a?(Hash)
+    a = a.dup
+    kw = a.pop
+    assert_equal 'true', expr, insn, *a, **kw
+  else
+    assert_equal 'true', expr, insn, *a
+  end
+end
+
+# with trace
+tests.compact.each {|(insn, expr, *a)|
+  progn = "set_trace_func(proc{})\n" + expr
+  if a.last.is_a?(Hash)
+    a = a.dup
+    kw = a.pop
+    assert_equal 'true', progn, 'trace_' + insn, *a, **kw
+  else
+    assert_equal 'true', progn, 'trace_' + insn, *a
+  end
+}
+
+assert_normal_exit("#{<<-"begin;"}\n#{<<-'end;'}")
+begin;
+  RubyVM::InstructionSequence.compile("", debug_level: 5)
+end;
diff --git a/bootstraptest/test_io.rb b/bootstraptest/test_io.rb
index f7360f34b3..666e5a011b 100644
--- a/bootstraptest/test_io.rb
+++ b/bootstraptest/test_io.rb
@@ -1,10 +1,10 @@
+/freebsd/ =~ RUBY_PLATFORM or
 assert_finish 5, %q{
   r, w = IO.pipe
   t1 = Thread.new { r.sysread(1) }
   t2 = Thread.new { r.sysread(1) }
-  sleep 0.1
+  sleep 0.01 until t1.stop? and t2.stop?
   w.write "a"
-  sleep 0.1
   w.write "a"
 }, '[ruby-dev:31866]'
 
@@ -27,16 +27,17 @@ assert_finish 10, %q{
       t1.join
       t2.join
     end
-  rescue LoadError, TimeoutError, NotImplementedError
+  rescue LoadError, Timeout::Error, NotImplementedError
   end
 }, '[ruby-dev:32566]'
 
-assert_finish 1, %q{
+/freebsd/ =~ RUBY_PLATFORM or
+assert_finish 5, %q{
   r, w = IO.pipe
   Thread.new {
-  w << "ab"
-  sleep 0.1
-  w << "ab"
+    w << "ab"
+    sleep 0.01
+    w << "ab"
   }
   r.gets("abab")
 }
@@ -53,7 +54,7 @@ assert_equal 'ok', %q{
   STDIN.reopen(rw)
   STDIN.reopen(save)
   rw.close
-  File.unlink(tmpname) unless RUBY_PLATFORM['nacl']
+  File.unlink(tmpname)
   :ok
 }
 
@@ -70,7 +71,7 @@ assert_equal 'ok', %q{
   STDIN.print "a"
   STDIN.reopen(save)
   rw.close
-  File.unlink(tmpname) unless RUBY_PLATFORM['nacl']
+  File.unlink(tmpname)
   :ok
 }
 
@@ -84,6 +85,7 @@ assert_normal_exit %q{
   ARGF.set_encoding "foo"
 }
 
+/freebsd/ =~ RUBY_PLATFORM or
 10.times do
   assert_normal_exit %q{
     at_exit { p :foo }
@@ -91,7 +93,8 @@ assert_normal_exit %q{
     megacontent = "abc" * 12345678
     #File.open("megasrc", "w") {|f| f << megacontent }
 
-    Thread.new { sleep rand*0.2; Process.kill(:INT, $$) }
+    t0 = Thread.main
+    Thread.new { sleep 0.001 until t0.stop?; Process.kill(:INT, $$) }
 
     r1, w1 = IO.pipe
     r2, w2 = IO.pipe
diff --git a/bootstraptest/test_jump.rb b/bootstraptest/test_jump.rb
index 595aaa7c4b..d07c47a56d 100644
--- a/bootstraptest/test_jump.rb
+++ b/bootstraptest/test_jump.rb
@@ -146,15 +146,16 @@ assert_equal %q{131}, %q{
     end
   }
 }
-assert_equal %q{ok}, %q{
+assert_match %r{Invalid retry}, %q{
+$stderr = STDOUT
 begin
   eval %q{
     1.times{
       retry
     }
   }
-rescue SyntaxError
-  :ok
+rescue SyntaxError => e
+  e.message
 end
 }
 assert_equal %q{3}, %q{
@@ -295,14 +296,19 @@ assert_equal "true", %q{
   s.return_eigenclass == class << s; self; end
 }, '[ruby-core:21379]'
 
-assert_equal "true", %q{
-  class Object
-    def yield_eigenclass
-      class << self
-        yield self
+assert_match %r{Invalid yield}, %q{
+$stderr = STDOUT
+begin
+  eval %q{
+    class Object
+      def yield_eigenclass
+        class << self
+          yield self
+        end
       end
     end
-  end
-  s = "foo"
-  s.yield_eigenclass {|c| c == class << s; self; end }
-}, '[ruby-dev:40975]'
+  }
+rescue SyntaxError => e
+  e.message
+end
+}
diff --git a/bootstraptest/test_literal.rb b/bootstraptest/test_literal.rb
index b95a2f2d0a..a0d4ee08c6 100644
--- a/bootstraptest/test_literal.rb
+++ b/bootstraptest/test_literal.rb
@@ -15,17 +15,17 @@ assert_equal 'sym',             ':sym'
 assert_equal ':sym',            ':sym.inspect'
 assert_equal 'Symbol',          ':sym.class'
 assert_equal '1234',            '1234'
-assert_equal 'Fixnum',          '1234.class'
+assert_equal 'Integer',         '1234.class'
 assert_equal '1234',            '1_2_3_4'
-assert_equal 'Fixnum',          '1_2_3_4.class'
+assert_equal 'Integer',         '1_2_3_4.class'
 assert_equal '18',              '0x12'
-assert_equal 'Fixnum',          '0x12.class'
+assert_equal 'Integer',         '0x12.class'
 assert_equal '15',              '0o17'
-assert_equal 'Fixnum',          '0o17.class'
+assert_equal 'Integer',         '0o17.class'
 assert_equal '5',               '0b101'
-assert_equal 'Fixnum',          '0b101.class'
+assert_equal 'Integer',         '0b101.class'
 assert_equal '123456789012345678901234567890', '123456789012345678901234567890'
-assert_equal 'Bignum',          '123456789012345678901234567890.class'
+assert_equal 'Integer',         '123456789012345678901234567890.class'
 assert_equal '2.0',             '2.0'
 assert_equal 'Float',           '1.3.class'
 
@@ -65,7 +65,8 @@ assert_equal ':a3c',            ':"a#{1+2}c".inspect'
 assert_equal 'Symbol',          ':"a#{1+2}c".class'
 
 # xstring
-unless nacl?
+# WASI doesn't support spawning a new process for now.
+if /wasi/ !~ target_platform
   assert_equal "foo\n",           %q(`echo foo`)
   assert_equal "foo\n",           %q(s = "foo"; `echo #{s}`)
 end
@@ -84,7 +85,7 @@ assert_equal '0',               're = /test/; re =~ "test"'
 assert_equal '0',               'str = "test"; /test/ =~ str'
 assert_equal '0',               're = /test/; str = "test"; re =~ str'
 
-# dynacmi regexp
+# dynamic regexp
 assert_equal 'regexp',          %q(/re#{'ge'}xp/.source)
 assert_equal 'Regexp',          %q(/re#{'ge'}xp/.class)
 
@@ -99,7 +100,7 @@ assert_equal '[3]',             '[3].inspect'
 assert_equal '3',               'a = [3]; a[0]'
 assert_equal 'Array',           '[1,2].class'
 assert_equal '2',               '[1,2].size'
-assert_equal '[1, 2]',           '[1,2].inspect'
+assert_equal '[1, 2]',          '[1,2].inspect'
 assert_equal 'Array',           '[1,2,3,4,5].class'
 assert_equal '5',               '[1,2,3,4,5].size'
 assert_equal '[1, 2, 3, 4, 5]', '[1,2,3,4,5].inspect'
@@ -169,7 +170,7 @@ assert_equal 'a',               'r = ("a".."c"); r.begin'
 assert_equal 'c',               'r = ("a".."c"); r.end'
 
 assert_equal 'String',          '__FILE__.class'
-assert_equal 'Fixnum',          '__LINE__.class'
+assert_equal 'Integer',         '__LINE__.class'
 
 ###
 
@@ -225,6 +226,24 @@ assert_equal 'ok', %q{ #  long hash literal (optimized)
   :ok
 }
 
+assert_equal 'ok', %q{ #  Bug #15536
+  eval <<-END
+    {
+      **{
+        a0: nil, a1: nil, a2: nil, a3: nil, a4: nil, a5: nil, a6: nil, a7: nil, a8: nil,
+      },
+      a0: nil, a1: nil, a2: nil, a3: nil, a4: nil, a5: nil, a6: nil, a7: nil, a8: nil,
+      **{
+        c: nil
+      },
+      b0: nil, b1: nil, b2: nil, b3: nil, b4: nil, b5: nil, b6: nil, b7: nil, b8: nil,
+      b9: nil, b10: nil, b11: nil, b12: nil, b13: nil, b14: nil, b15: nil, b16: nil,
+      b17: nil, b18: nil, b19: nil, b20: nil, b21: nil,
+    }
+  END
+  :ok
+}
+
 assert_equal 'ok', %q{
   [print(:ok), exit] # void literal with side-effect
   :dummy
diff --git a/bootstraptest/test_literal_suffix.rb b/bootstraptest/test_literal_suffix.rb
index 4316c9e040..c36fa7078f 100644
--- a/bootstraptest/test_literal_suffix.rb
+++ b/bootstraptest/test_literal_suffix.rb
@@ -46,9 +46,9 @@ assert_equal '1',               '1rescue nil'
 assert_equal '10000000000000000001/10000000000000000000',
              '1.0000000000000000001r'
 
-assert_equal 'syntax error, unexpected tIDENTIFIER, expecting end-of-input',
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
              %q{begin eval('1ir', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
-assert_equal 'syntax error, unexpected tIDENTIFIER, expecting end-of-input',
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
              %q{begin eval('1.2ir', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
-assert_equal 'syntax error, unexpected tIDENTIFIER, expecting end-of-input',
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
              %q{begin eval('1e1r', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
diff --git a/bootstraptest/test_method.rb b/bootstraptest/test_method.rb
index 4282bc6273..04c9eb2d11 100644
--- a/bootstraptest/test_method.rb
+++ b/bootstraptest/test_method.rb
@@ -3,7 +3,7 @@ assert_equal '1',       'def m() 1 end; m()'
 assert_equal '1',       'def m(a) a end; m(1)'
 assert_equal '[1, 2]',  'def m(a,b) [a, b] end; m(1,2)'
 assert_equal '[1, 2, 3]', 'def m(a,b,c) [a, b, c] end; m(1,2,3)'
-assert_equal 'wrong number of arguments (1 for 0)', %q{
+assert_match /\Awrong number of arguments \(.*\b1\b.* 0\)\z/, %q{
   def m; end
   begin
     m(1)
@@ -12,7 +12,7 @@ assert_equal 'wrong number of arguments (1 for 0)', %q{
   end
 }
 
-assert_equal 'wrong number of arguments (0 for 1)', %q{
+assert_match /\Awrong number of arguments \(.*\b0\b.* 1\)\z/, %q{
   def m a; end
   begin
     m
@@ -22,7 +22,7 @@ assert_equal 'wrong number of arguments (0 for 1)', %q{
 }
 
 # default argument
-assert_equal '1',       'def m(x=1) x end; m()'
+assert_equal '1',       'def m(x=1) x end; m();'
 assert_equal '1',       'def m(x=7) x end; m(1)'
 assert_equal '1',       'def m(a,x=1) x end; m(7)'
 assert_equal '1',       'def m(a,x=7) x end; m(7,1)'
@@ -910,34 +910,6 @@ assert_equal 'ok', %q{
 }, '[ruby-core:11998]'
 
 assert_equal 'ok', %q{
-  proc{
-    $SAFE = 2
-    class C
-      def m
-        :ok
-      end
-    end
-  }.call
-  C.new.m
-}, '[ruby-core:11998]'
-
-assert_equal 'ok', %q{
-  proc{
-    $SAFE = 3
-    class C
-      def m
-        :ng
-      end
-    end
-  }.call
-  begin
-    C.new.m
-  rescue SecurityError
-    :ok
-  end
-}, '[ruby-core:11998]'
-
-assert_equal 'ok', %q{
   class B
     def m() :fail end
   end
@@ -957,8 +929,8 @@ assert_equal 'ok', %q{
 
 assert_normal_exit %q{
   begin
-    Process.setrlimit(Process::RLIMIT_STACK, 4_202_496)
-    # FreeBSD fails this less than 4M + 8K bytes.
+    Process.setrlimit(Process::RLIMIT_STACK, 4_206_592)
+    # FreeBSD SEGVs this less than 4M + 12K bytes.
   rescue Exception
     exit
   end
diff --git a/bootstraptest/test_objectspace.rb b/bootstraptest/test_objectspace.rb
index 862a94e376..63a8d99322 100644
--- a/bootstraptest/test_objectspace.rb
+++ b/bootstraptest/test_objectspace.rb
@@ -35,7 +35,7 @@ assert_normal_exit %q{
 
 assert_normal_exit %q{
   ObjectSpace.define_finalizer("") do
-    Mutex.new.lock
+    Thread::Mutex.new.lock
   end
 }, '[ruby-dev:44049]'
 
@@ -44,3 +44,12 @@ assert_normal_exit %q{
     Thread.new {}
   end
 }, '[ruby-core:37858]'
+
+assert_equal 'ok', %q{
+  objects_and_ids = 1000.times.map { o = Object.new; [o, o.object_id] }
+  objects_and_ids.each { |expected, id|
+    actual = ObjectSpace._id2ref(id)
+    raise "expected #{expected.inspect}, got #{actual.inspect}" unless actual.equal?(expected)
+  }
+  'ok'
+}
diff --git a/bootstraptest/test_proc.rb b/bootstraptest/test_proc.rb
index c23394e8d2..637603243d 100644
--- a/bootstraptest/test_proc.rb
+++ b/bootstraptest/test_proc.rb
@@ -224,19 +224,6 @@ assert_equal %q{[[nil, []], [1, []], [1, [2]], [1, [2, 3]]]}, %q{
   Proc.new{|a, *b| [a, b]}.call(1, 2, 3),
   ]
 }
-assert_equal %q{0}, %q{
-  pr = proc{
-    $SAFE
-  }
-  $SAFE = 1
-  pr.call
-}
-assert_equal %q{[1, 0]}, %q{
-  pr = proc{
-    $SAFE += 1
-  }
-  [pr.call, $SAFE]
-}
 assert_equal %q{1}, %q{
   def m(&b)
     b
@@ -380,8 +367,8 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   class Foo
-    def call_it
-      p = Proc.new
+    def call_it(&block)
+      p = Proc.new(&block)
       p.call
     end
   end
diff --git a/bootstraptest/test_ractor.rb b/bootstraptest/test_ractor.rb
new file mode 100644
index 0000000000..67e66b03ee
--- /dev/null
+++ b/bootstraptest/test_ractor.rb
@@ -0,0 +1,1628 @@
+# Ractor.current returns a current ractor
+assert_equal 'Ractor', %q{
+  Ractor.current.class
+}
+
+# Ractor.new returns new Ractor
+assert_equal 'Ractor', %q{
+  Ractor.new{}.class
+}
+
+# Ractor.allocate is not supported
+assert_equal "[:ok, :ok]", %q{
+  rs = []
+  begin
+    Ractor.allocate
+  rescue => e
+    rs << :ok if e.message == 'allocator undefined for Ractor'
+  end
+
+  begin
+    Ractor.new{}.dup
+  rescue
+    rs << :ok if e.message == 'allocator undefined for Ractor'
+  end
+
+  rs
+}
+
+# A Ractor can have a name
+assert_equal 'test-name', %q{
+  r = Ractor.new name: 'test-name' do
+  end
+  r.name
+}
+
+# If Ractor doesn't have a name, Ractor#name returns nil.
+assert_equal 'nil', %q{
+  r = Ractor.new do
+  end
+  r.name.inspect
+}
+
+# Raises exceptions if initialize with an invalid name
+assert_equal 'ok', %q{
+  begin
+    r = Ractor.new(name: [{}]) {}
+  rescue TypeError => e
+    'ok'
+  end
+}
+
+# Ractor.new must call with a block
+assert_equal "must be called with a block", %q{
+  begin
+    Ractor.new
+  rescue ArgumentError => e
+    e.message
+  end
+}
+
+# Ractor#inspect
+# Return only id and status for main ractor
+assert_equal "#<Ractor:#1 running>", %q{
+  Ractor.current.inspect
+}
+
+# Return id, loc, and status for no-name ractor
+assert_match /^#<Ractor:#([^ ]*?) .+:[0-9]+ terminated>$/, %q{
+  r = Ractor.new { '' }
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+  r.inspect
+}
+
+# Return id, name, loc, and status for named ractor
+assert_match /^#<Ractor:#([^ ]*?) Test Ractor .+:[0-9]+ terminated>$/, %q{
+  r = Ractor.new(name: 'Test Ractor') { '' }
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+  r.inspect
+}
+
+# A return value of a Ractor block will be a message from the Ractor.
+assert_equal 'ok', %q{
+  # join
+  r = Ractor.new do
+    'ok'
+  end
+  r.take
+}
+
+# Passed arguments to Ractor.new will be a block parameter
+# The values are passed with Ractor-communication pass.
+assert_equal 'ok', %q{
+  # ping-pong with arg
+  r = Ractor.new 'ok' do |msg|
+    msg
+  end
+  r.take
+}
+
+# Pass multiple arguments to Ractor.new
+assert_equal 'ok', %q{
+  # ping-pong with two args
+  r =  Ractor.new 'ping', 'pong' do |msg, msg2|
+    [msg, msg2]
+  end
+  'ok' if r.take == ['ping', 'pong']
+}
+
+# Ractor#send passes an object with copy to a Ractor
+# and Ractor.receive in the Ractor block can receive the passed value.
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    msg = Ractor.receive
+  end
+  r.send 'ok'
+  r.take
+}
+
+# Ractor#receive_if can filter the message
+assert_equal '[2, 3, 1]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+  a = []
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| msg == 3}
+  a << Ractor.receive
+}
+
+# Ractor#receive_if with break
+assert_equal '[2, [1, :break], 3]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+
+  a = []
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| break [msg, :break]}
+  a << Ractor.receive
+}
+
+# Ractor#receive_if can't be called recursively
+assert_equal '[[:e1, 1], [:e2, 2]]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+
+  a = []
+
+  Ractor.receive_if do |msg|
+    begin
+      Ractor.receive
+    rescue Ractor::Error
+      a << [:e1, msg]
+    end
+    true # delete 1 from queue
+  end
+
+  Ractor.receive_if do |msg|
+    begin
+      Ractor.receive_if{}
+    rescue Ractor::Error
+      a << [:e2, msg]
+    end
+    true # delete 2 from queue
+  end
+
+  a #
+}
+
+# dtoa race condition
+assert_equal '[:ok, :ok, :ok]', %q{
+  n = 3
+  n.times.map{
+    Ractor.new{
+      10_000.times{ rand.to_s }
+      :ok
+    }
+  }.map(&:take)
+}
+
+# Ractor.make_shareable issue for locals in proc [Bug #18023]
+assert_equal '[:a, :b, :c, :d, :e]', %q{
+  v1, v2, v3, v4, v5 = :a, :b, :c, :d, :e
+  closure = Ractor.current.instance_eval{ Proc.new { [v1, v2, v3, v4, v5] } }
+
+  Ractor.make_shareable(closure).call
+}
+
+# Ractor.make_shareable issue for locals in proc [Bug #18023]
+assert_equal '[:a, :b, :c, :d, :e, :f, :g]', %q{
+  a = :a
+  closure = Ractor.current.instance_eval do
+    -> {
+      b, c, d = :b, :c, :d
+      -> {
+        e, f, g = :e, :f, :g
+        -> { [a, b, c, d, e, f, g] }
+      }.call
+    }.call
+  end
+
+  Ractor.make_shareable(closure).call
+}
+
+# Now autoload in non-main Ractor is not supported
+assert_equal 'ok', %q{
+  autoload :Foo, 'foo.rb'
+  r = Ractor.new do
+    p Foo
+  rescue Ractor::UnsafeError
+    :ok
+  end
+  r.take
+}
+
+###
+###
+# Ractor still has several memory corruption so skip huge number of tests
+if ENV['GITHUB_WORKFLOW'] &&
+   ENV['GITHUB_WORKFLOW'] == 'Compilations'
+   # ignore the follow
+else
+
+# Ractor.select(*ractors) receives a values from a ractors.
+# It is similar to select(2) and Go's select syntax.
+# The return value is [ch, received_value]
+assert_equal 'ok', %q{
+  # select 1
+  r1 = Ractor.new{'r1'}
+  r, obj = Ractor.select(r1)
+  'ok' if r == r1 and obj == 'r1'
+}
+
+# Ractor.select from two ractors.
+assert_equal '["r1", "r2"]', %q{
+  # select 2
+  r1 = Ractor.new{'r1'}
+  r2 = Ractor.new{'r2'}
+  rs = [r1, r2]
+  as = []
+  r, obj = Ractor.select(*rs)
+  rs.delete(r)
+  as << obj
+  r, obj = Ractor.select(*rs)
+  as << obj
+  as.sort #=> ["r1", "r2"]
+}
+
+# Ractor.select from multiple ractors.
+assert_equal 30.times.map { 'ok' }.to_s, %q{
+  def test n
+    rs = (1..n).map do |i|
+      Ractor.new(i) do |i|
+        "r#{i}"
+      end
+    end
+    as = []
+    all_rs = rs.dup
+
+    n.times{
+      r, obj = Ractor.select(*rs)
+      as << [r, obj]
+      rs.delete(r)
+    }
+
+    if as.map{|r, o| r.object_id}.sort == all_rs.map{|r| r.object_id}.sort &&
+       as.map{|r, o| o}.sort == (1..n).map{|i| "r#{i}"}.sort
+      'ok'
+    else
+      'ng'
+    end
+  end
+
+  30.times.map{|i|
+    test i
+  }
+} unless ENV['RUN_OPTS'] =~ /--mjit-call-threshold=5/ || # This always fails with --mjit-wait --mjit-call-threshold=5
+  (ENV.key?('TRAVIS') && ENV['TRAVIS_CPU_ARCH'] == 'arm64') || # https://bugs.ruby-lang.org/issues/17878
+  true # too flaky everywhere http://ci.rvm.jp/results/trunk@ruby-sp1/4321096
+
+# Exception for empty select
+assert_match /specify at least one ractor/, %q{
+  begin
+    Ractor.select
+  rescue ArgumentError => e
+    e.message
+  end
+}
+
+# Outgoing port of a ractor will be closed when the Ractor is terminated.
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    'finish'
+  end
+
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+
+  begin
+    o = r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    "ng: #{o}"
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a terminated ractor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+  end
+
+  r.take # closed
+  sleep 0.1 until r.inspect =~ /terminated/
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a closed actor
+assert_equal 'ok', %q{
+  r = Ractor.new { Ractor.receive }
+  r.close_incoming
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to take from closed actor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    Ractor.receive
+  end
+
+  r.close_outgoing
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Can mix with Thread#interrupt and Ractor#take [Bug #17366]
+assert_equal 'err', %q{
+  Ractor.new{
+    t = Thread.current
+    begin
+      Thread.new{ t.raise "err" }.join
+    rescue => e
+      e.message
+    end
+  }.take
+}
+
+# Killed Ractor's thread yields nil
+assert_equal 'nil', %q{
+  Ractor.new{
+    t = Thread.current
+    Thread.new{ t.kill }.join
+  }.take.inspect #=> nil
+}
+
+# Ractor.yield raises Ractor::ClosedError when outgoing port is closed.
+assert_equal 'ok', %q{
+  r = Ractor.new Ractor.current do |main|
+    Ractor.receive
+    main << true
+    Ractor.yield 1
+  end
+
+  r.close_outgoing
+  r << true
+  Ractor.receive
+
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a ractor with closed incoming port
+assert_equal 'ok', %q{
+  r = Ractor.new { Ractor.receive }
+  r.close_incoming
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# A ractor with closed incoming port still can send messages out
+assert_equal '[1, 2]', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    2
+  end
+  r.close_incoming
+
+  [r.take, r.take]
+}
+
+# Raise Ractor::ClosedError when try to take from a ractor with closed outgoing port
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    Ractor.receive
+  end
+
+  sleep 0.01 # wait for Ractor.yield in r
+  r.close_outgoing
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# A ractor with closed outgoing port still can receive messages from incoming port
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.receive
+  end
+
+  r.close_outgoing
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ng'
+  else
+    'ok'
+  end
+}
+
+# Ractor.main returns main ractor
+assert_equal 'true', %q{
+  Ractor.new{
+    Ractor.main
+  }.take == Ractor.current
+}
+
+# a ractor with closed outgoing port should terminate
+assert_equal 'ok', %q{
+  Ractor.new do
+    close_outgoing
+  end
+
+  true until Ractor.count == 1
+  :ok
+}
+
+# multiple Ractors can receive (wait) from one Ractor
+assert_equal '[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]', %q{
+  pipe = Ractor.new do
+    loop do
+      Ractor.yield Ractor.receive
+    end
+  end
+
+  RN = 10
+  rs = RN.times.map{|i|
+    Ractor.new pipe, i do |pipe, i|
+      msg = pipe.take
+      msg # ping-pong
+    end
+  }
+  RN.times{|i|
+    pipe << i
+  }
+  RN.times.map{
+    r, n = Ractor.select(*rs)
+    rs.delete r
+    n
+  }.sort
+} unless /mswin/ =~ RUBY_PLATFORM # randomly hangs on mswin https://github.com/ruby/ruby/actions/runs/3753871445/jobs/6377551069#step:20:131
+
+# Ractor.select also support multiple take, receive and yield
+assert_equal '[true, true, true]', %q{
+  RN = 10
+  CR = Ractor.current
+
+  rs = (1..RN).map{
+    Ractor.new do
+      CR.send 'send' + CR.take #=> 'sendyield'
+      'take'
+    end
+  }
+  received = []
+  take = []
+  yielded = []
+  until rs.empty?
+    r, v = Ractor.select(CR, *rs, yield_value: 'yield')
+    case r
+    when :receive
+      received << v
+    when :yield
+      yielded << v
+    else
+      take << v
+      rs.delete r
+    end
+  end
+  [received.all?('sendyield'), yielded.all?(nil), take.all?('take')]
+}
+
+# multiple Ractors can send to one Ractor
+assert_equal '[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]', %q{
+  pipe = Ractor.new do
+    loop do
+      Ractor.yield Ractor.receive
+    end
+  end
+
+  RN = 10
+  RN.times.map{|i|
+    Ractor.new pipe, i do |pipe, i|
+      pipe << i
+    end
+  }
+  RN.times.map{
+    pipe.take
+  }.sort
+}
+
+# an exception in a Ractor will be re-raised at Ractor#receive
+assert_equal '[RuntimeError, "ok", true]', %q{
+  r = Ractor.new do
+    raise 'ok' # exception will be transferred receiver
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    [e.cause.class,   #=> RuntimeError
+     e.cause.message, #=> 'ok'
+     e.ractor == r]   #=> true
+  end
+}
+
+# threads in a ractor will killed
+assert_equal '{:ok=>3}', %q{
+  Ractor.new Ractor.current do |main|
+    q = Thread::Queue.new
+    Thread.new do
+      q << true
+      loop{}
+    ensure
+      main << :ok
+    end
+
+    Thread.new do
+      q << true
+      while true
+      end
+    ensure
+      main << :ok
+    end
+
+    Thread.new do
+      q << true
+      sleep 1
+    ensure
+      main << :ok
+    end
+
+    # wait for the start of all threads
+    3.times{q.pop}
+  end
+
+  3.times.map{Ractor.receive}.tally
+}
+
+# unshareable object are copied
+assert_equal 'false', %q{
+  obj = 'str'.dup
+  r = Ractor.new obj do |msg|
+    msg.object_id
+  end
+
+  obj.object_id == r.take
+}
+
+# To copy the object, now Marshal#dump is used
+assert_equal "allocator undefined for Thread", %q{
+  obj = Thread.new{}
+  begin
+    r = Ractor.new obj do |msg|
+      msg
+    end
+  rescue TypeError => e
+    e.message #=> no _dump_data is defined for class Thread
+  else
+    'ng'
+  end
+}
+
+# send shareable and unshareable objects
+assert_equal "ok", %q{
+  echo_ractor = Ractor.new do
+    loop do
+      v = Ractor.receive
+      Ractor.yield v
+    end
+  end
+
+  class C; end
+  module M; end
+  S = Struct.new(:a, :b, :c, :d)
+
+  shareable_objects = [
+    true,
+    false,
+    nil,
+    1,
+    1.1,    # Float
+    1+2r,   # Rational
+    3+4i,   # Complex
+    2**128, # Bignum
+    :sym,   # Symbol
+    'xyzzy'.to_sym, # dynamic symbol
+    'frozen'.freeze, # frozen String
+    /regexp/, # regexp literal
+    /reg{true}exp/.freeze, # frozen dregexp
+    [1, 2].freeze,   # frozen Array which only refers to shareable
+    {a: 1}.freeze,   # frozen Hash which only refers to shareable
+    [{a: 1}.freeze, 'str'.freeze].freeze, # nested frozen container
+    S.new(1, 2).freeze, # frozen Struct
+    S.new(1, 2, 3, 4).freeze, # frozen Struct
+    (1..2), # Range on Struct
+    (1..),  # Range on Struct
+    (..1),  # Range on Struct
+    C, # class
+    M, # module
+    Ractor.current, # Ractor
+  ]
+
+  unshareable_objects = [
+    'mutable str'.dup,
+    [:array],
+    {hash: true},
+    S.new(1, 2),
+    S.new(1, 2, 3, 4),
+    S.new("a", 2).freeze, # frozen, but refers to an unshareable object
+  ]
+
+  results = []
+
+  shareable_objects.map{|o|
+    echo_ractor << o
+    o2 = echo_ractor.take
+    results << "#{o} is copied" unless o.object_id == o2.object_id
+  }
+
+  unshareable_objects.map{|o|
+    echo_ractor << o
+    o2 = echo_ractor.take
+    results << "#{o.inspect} is not copied" if o.object_id == o2.object_id
+  }
+
+  if results.empty?
+    :ok
+  else
+    results.inspect
+  end
+}
+
+# frozen Objects are shareable
+assert_equal [false, true, false].inspect, %q{
+  class C
+    def initialize freeze
+      @a = 1
+      @b = :sym
+      @c = 'frozen_str'
+      @c.freeze if freeze
+      @d = true
+    end
+  end
+
+  def check obj1
+    obj2 = Ractor.new obj1 do |obj|
+      obj
+    end.take
+
+    obj1.object_id == obj2.object_id
+  end
+
+  results = []
+  results << check(C.new(true))         # false
+  results << check(C.new(true).freeze)  # true
+  results << check(C.new(false).freeze) # false
+}
+
+# move example2: String
+# touching moved object causes an error
+assert_equal 'hello world', %q{
+  # move
+  r = Ractor.new do
+    obj = Ractor.receive
+    obj << ' world'
+  end
+
+  str = 'hello'
+  r.send str, move: true
+  modified = r.take
+
+  begin
+    str << ' exception' # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    modified #=> 'hello world'
+  else
+    raise 'unreachable'
+  end
+}
+
+# move example2: Array
+assert_equal '[0, 1]', %q{
+  r = Ractor.new do
+    ary = Ractor.receive
+    ary << 1
+  end
+
+  a1 = [0]
+  r.send a1, move: true
+  a2 = r.take
+  begin
+    a1 << 2 # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    a2.inspect
+  end
+}
+
+# move with yield
+assert_equal 'hello', %q{
+  r = Ractor.new do
+    Thread.current.report_on_exception = false
+    obj = 'hello'
+    Ractor.yield obj, move: true
+    obj << 'world'
+  end
+
+  str = r.take
+  begin
+    r.take
+  rescue Ractor::RemoteError
+    str #=> "hello"
+  end
+}
+
+# yield/move should not make moved object when the yield is not succeeded
+assert_equal '"str"', %q{
+  R = Ractor.new{}
+  M = Ractor.current
+  r = Ractor.new do
+    s = 'str'
+    selected_r, v = Ractor.select R, yield_value: s, move: true
+    raise if selected_r != R # taken from R
+    M.send s.inspect # s should not be a moved object
+  end
+
+  Ractor.receive
+}
+
+# yield/move can fail
+assert_equal "allocator undefined for Thread", %q{
+  r = Ractor.new do
+    obj = Thread.new{}
+    Ractor.yield obj
+  rescue => e
+    e.message
+  end
+  r.take
+}
+
+# Access to global-variables are prohibited
+assert_equal 'can not access global variables $gv from non-main Ractors', %q{
+  $gv = 1
+  r = Ractor.new do
+    $gv
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Access to global-variables are prohibited
+assert_equal 'can not access global variables $gv from non-main Ractors', %q{
+  r = Ractor.new do
+    $gv = 1
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# $stdin,out,err is Ractor local, but shared fds
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    [$stdin, $stdout, $stderr].map{|io|
+      [io.object_id, io.fileno]
+    }
+  end
+
+  [$stdin, $stdout, $stderr].zip(r.take){|io, (oid, fno)|
+    raise "should not be different object" if io.object_id == oid
+    raise "fd should be same" unless io.fileno == fno
+  }
+  'ok'
+}
+
+# $stdin,out,err belong to Ractor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    $stdin.itself
+    $stdout.itself
+    $stderr.itself
+    'ok'
+  end
+
+  r.take
+}
+
+# $DEBUG, $VERBOSE are Ractor local
+assert_equal 'true', %q{
+  $DEBUG = true
+  $VERBOSE = true
+
+  def ractor_local_globals
+    /a(b)(c)d/ =~ 'abcd' # for $~
+    `echo foo` unless  /solaris/ =~ RUBY_PLATFORM
+
+    {
+     # ractor-local (derived from created ractor): debug
+     '$DEBUG' => $DEBUG,
+     '$-d' => $-d,
+
+     # ractor-local (derived from created ractor): verbose
+     '$VERBOSE' => $VERBOSE,
+     '$-w' => $-w,
+     '$-W' => $-W,
+     '$-v' => $-v,
+
+     # process-local (readonly): other commandline parameters
+     '$-p' => $-p,
+     '$-l' => $-l,
+     '$-a' => $-a,
+
+     # process-local (readonly): getpid
+     '$$'  => $$,
+
+     # thread local: process result
+     '$?'  => $?,
+
+     # scope local: match
+     '$~'  => $~.inspect,
+     '$&'  => $&,
+     '$`'  => $`,
+     '$\''  => $',
+     '$+'  => $+,
+     '$1'  => $1,
+
+     # scope local: last line
+     '$_' => $_,
+
+     # scope local: last backtrace
+     '$@' => $@,
+     '$!' => $!,
+
+     # ractor local: stdin, out, err
+     '$stdin'  => $stdin.inspect,
+     '$stdout' => $stdout.inspect,
+     '$stderr' => $stderr.inspect,
+    }
+  end
+
+  h = Ractor.new do
+    ractor_local_globals
+  end.take
+  ractor_local_globals == h #=> true
+}
+
+# selfs are different objects
+assert_equal 'false', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  r.take == self.object_id #=> false
+}
+
+# self is a Ractor instance
+assert_equal 'true', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  r.object_id == r.take #=> true
+}
+
+# given block Proc will be isolated, so can not access outer variables.
+assert_equal 'ArgumentError', %q{
+  begin
+    a = true
+    r = Ractor.new do
+      a
+    end
+  rescue => e
+    e.class
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal "can not get unshareable values from instance variables of classes/modules from non-main Ractors", %q{
+  class C
+    @iv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @iv
+    end
+  end
+
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  shared = Ractor.new{}
+  shared.instance_variable_set(:@iv, 'str')
+
+  r = Ractor.new shared do |shared|
+    p shared.instance_variable_get(:@iv)
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor, by @iv (get)
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  class Ractor
+    def setup
+      @foo = ''
+    end
+
+    def foo
+      @foo
+    end
+  end
+
+  shared = Ractor.new{}
+  shared.setup
+
+  r = Ractor.new shared do |shared|
+    p shared.foo
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor, by @iv (set)
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  class Ractor
+    def setup
+      @foo = ''
+    end
+  end
+
+  shared = Ractor.new{}
+
+  r = Ractor.new shared do |shared|
+    p shared.setup
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# But a shareable object is frozen, it is allowed to access ivars from non-main Ractor
+assert_equal '11', %q{
+  [Object.new, [], ].map{|obj|
+    obj.instance_variable_set('@a', 1)
+    Ractor.make_shareable obj = obj.freeze
+
+    Ractor.new obj do |obj|
+      obj.instance_variable_get('@a')
+    end.take.to_s
+  }.join
+}
+
+# and instance variables of classes/modules are accessible if they refer shareable objects
+assert_equal '333', %q{
+  class C
+    @int = 1
+    @str = '-1000'.dup
+    @fstr = '100'.freeze
+
+    def self.int = @int
+    def self.str = @str
+    def self.fstr = @fstr
+  end
+
+  module M
+    @int = 2
+    @str = '-2000'.dup
+    @fstr = '200'.freeze
+
+    def self.int = @int
+    def self.str = @str
+    def self.fstr = @fstr
+  end
+
+  a = Ractor.new{ C.int }.take
+  b = Ractor.new do
+    C.str.to_i
+  rescue Ractor::IsolationError
+    10
+  end.take
+  c = Ractor.new do
+    C.fstr.to_i
+  end.take
+
+  d = Ractor.new{ M.int }.take
+  e = Ractor.new do
+    M.str.to_i
+  rescue Ractor::IsolationError
+    20
+  end.take
+  f = Ractor.new do
+    M.fstr.to_i
+  end.take
+
+
+  # 1 + 10 + 100 + 2 + 20 + 200
+  a + b + c + d + e + f
+}
+
+# cvar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access class variables from non-main Ractors', %q{
+  class C
+    @@cv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @@cv
+    end
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# also cached cvar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access class variables from non-main Ractors', %q{
+  class C
+    @@cv = 'str'
+    def self.cv
+      @@cv
+    end
+  end
+
+  C.cv # cache
+
+  r = Ractor.new do
+    C.cv
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Getting non-shareable objects via constants by other Ractors is not allowed
+assert_equal 'can not access non-shareable objects in constant C::CONST by non-main Ractor.', %q{
+  class C
+    CONST = 'str'
+  end
+  r = Ractor.new do
+    C::CONST
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Constant cache should care about non-sharable constants
+assert_equal "can not access non-shareable objects in constant Object::STR by non-main Ractor.", %q{
+  STR = "hello"
+  def str; STR; end
+  s = str() # fill const cache
+  begin
+    Ractor.new{ str() }.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Setting non-shareable objects into constants by other Ractors is not allowed
+assert_equal 'can not set constants with non-shareable objects by non-main Ractors', %q{
+  class C
+  end
+  r = Ractor.new do
+    C::CONST = 'str'
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# define_method is not allowed
+assert_equal "defined with an un-shareable Proc in a different Ractor", %q{
+  str = "foo"
+  define_method(:buggy){|i| str << "#{i}"}
+  begin
+    Ractor.new{buggy(10)}.take
+  rescue => e
+    e.cause.message
+  end
+}
+
+# Immutable Array and Hash are shareable, so it can be shared with constants
+assert_equal '[1000, 3]', %q{
+  A = Array.new(1000).freeze # [nil, ...]
+  H = {a: 1, b: 2, c: 3}.freeze
+
+  Ractor.new{ [A.size, H.size] }.take
+}
+
+# Ractor.count
+assert_equal '[1, 4, 3, 2, 1]', %q{
+  counts = []
+  counts << Ractor.count
+  ractors = (1..3).map { Ractor.new { Ractor.receive } }
+  counts << Ractor.count
+
+  ractors[0].send('End 0').take
+  sleep 0.1 until ractors[0].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[1].send('End 1').take
+  sleep 0.1 until ractors[1].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[2].send('End 2').take
+  sleep 0.1 until ractors[2].inspect =~ /terminated/
+  counts << Ractor.count
+
+  counts.inspect
+}
+
+# ObjectSpace.each_object can not handle unshareable objects with Ractors
+assert_equal '0', %q{
+  Ractor.new{
+    n = 0
+    ObjectSpace.each_object{|o| n += 1 unless Ractor.shareable?(o)}
+    n
+  }.take
+}
+
+# ObjectSpace._id2ref can not handle unshareable objects with Ractors
+assert_equal 'ok', %q{
+  s = 'hello'
+
+  Ractor.new s.object_id do |id ;s|
+    begin
+      s = ObjectSpace._id2ref(id)
+    rescue => e
+      :ok
+    end
+  end.take
+}
+
+# Ractor.make_shareable(obj)
+assert_equal 'true', %q{
+  class C
+    def initialize
+      @a = 'foo'
+      @b = 'bar'
+    end
+
+    def freeze
+      @c = [:freeze_called]
+      super
+    end
+
+    attr_reader :a, :b, :c
+  end
+  S = Struct.new(:s1, :s2)
+  str = "hello"
+  str.instance_variable_set("@iv", "hello")
+  /a/ =~ 'a'
+  m = $~
+  class N < Numeric
+    def /(other)
+      1
+    end
+  end
+  ary = []; ary << ary
+
+  a = [[1, ['2', '3']],
+       {Object.new => "hello"},
+       C.new,
+       S.new("x", "y"),
+       ("a".."b"),
+       str,
+       ary,             # cycle
+       /regexp/,
+       /#{'r'.upcase}/,
+       m,
+       Complex(N.new,0),
+       Rational(N.new,0),
+       true,
+       false,
+       nil,
+       1, 1.2, 1+3r, 1+4i, # Numeric
+  ]
+  Ractor.make_shareable(a)
+
+  # check all frozen
+  a.each{|o|
+    raise o.inspect unless o.frozen?
+
+    case o
+    when C
+      raise o.a.inspect unless o.a.frozen?
+      raise o.b.inspect unless o.b.frozen?
+      raise o.c.inspect unless o.c.frozen? && o.c == [:freeze_called]
+    when Rational
+      raise o.numerator.inspect unless o.numerator.frozen?
+    when Complex
+      raise o.real.inspect unless o.real.frozen?
+    when Array
+      if o[0] == 1
+        raise o[1][1].inspect unless o[1][1].frozen?
+      end
+    when Hash
+      o.each{|k, v|
+        raise k.inspect unless k.frozen?
+        raise v.inspect unless v.frozen?
+      }
+    end
+  }
+
+  Ractor.shareable?(a)
+}
+
+# Ractor.make_shareable(obj) doesn't freeze shareable objects
+assert_equal 'true', %q{
+  r = Ractor.new{}
+  Ractor.make_shareable(a = [r])
+  [a.frozen?, a[0].frozen?] == [true, false]
+}
+
+# Ractor.make_shareable(a_proc) makes a proc shareable.
+assert_equal 'true', %q{
+  a = [1, [2, 3], {a: "4"}]
+
+  pr = Ractor.current.instance_eval do
+    Proc.new do
+      a
+    end
+  end
+
+  Ractor.make_shareable(a) # referred value should be shareable
+  Ractor.make_shareable(pr)
+  Ractor.shareable?(pr)
+}
+
+# Ractor.shareable?(recursive_objects)
+assert_equal '[false, false]', %q{
+  y = []
+  x = [y, {}].freeze
+  y << x
+  y.freeze
+  [Ractor.shareable?(x), Ractor.shareable?(y)]
+}
+
+# Ractor.make_shareable(recursive_objects)
+assert_equal '[:ok, false, false]', %q{
+  o = Object.new
+  def o.freeze; raise; end
+  y = []
+  x = [y, o].freeze
+  y << x
+  y.freeze
+  [(Ractor.make_shareable(x) rescue :ok), Ractor.shareable?(x), Ractor.shareable?(y)]
+}
+
+# Ractor.make_shareable with Class/Module
+assert_equal '[C, M]', %q{
+  class C; end
+  module M; end
+
+  Ractor.make_shareable(ary = [C, M])
+}
+
+# define_method() can invoke different Ractor's proc if the proc is shareable.
+assert_equal '1', %q{
+  class C
+    a = 1
+    define_method "foo", Ractor.make_shareable(Proc.new{ a })
+    a = 2
+  end
+
+  Ractor.new{ C.new.foo }.take
+}
+
+# Ractor.make_shareable(a_proc) makes a proc shareable.
+assert_equal 'can not make a Proc shareable because it accesses outer variables (a).', %q{
+  a = b = nil
+  pr = Ractor.current.instance_eval do
+    Proc.new do
+      c = b # assign to a is okay because c is block local variable
+      # reading b is okay
+      a = b # assign to a is not allowed #=> Ractor::Error
+    end
+  end
+
+  begin
+    Ractor.make_shareable(pr)
+  rescue => e
+    e.message
+  end
+}
+
+# Ractor.make_shareable(obj, copy: true) makes copied shareable object.
+assert_equal '[false, false, true, true]', %q{
+  r = []
+  o1 = [1, 2, ["3"]]
+
+  o2 = Ractor.make_shareable(o1, copy: true)
+  r << Ractor.shareable?(o1) # false
+  r << (o1.object_id == o2.object_id) # false
+
+  o3 = Ractor.make_shareable(o1)
+  r << Ractor.shareable?(o1) # true
+  r << (o1.object_id == o3.object_id) # false
+  r
+}
+
+# TracePoint with normal Proc should be Ractor local
+assert_equal '[4, 8]', %q{
+  rs = []
+  TracePoint.new(:line){|tp| rs << tp.lineno if tp.path == __FILE__}.enable do
+    Ractor.new{ # line 4
+      a = 1
+      b = 2
+    }.take
+    c = 3       # line 8
+  end
+  rs
+}
+
+# Ractor deep copies frozen objects (ary)
+assert_equal '[true, false]', %q{
+  Ractor.new([[]].freeze) { |ary|
+    [ary.frozen?, ary.first.frozen? ]
+  }.take
+}
+
+# Ractor deep copies frozen objects (str)
+assert_equal '[true, false]', %q{
+  s = String.new.instance_eval { @x = []; freeze}
+  Ractor.new(s) { |s|
+    [s.frozen?, s.instance_variable_get(:@x).frozen?]
+  }.take
+}
+
+# Can not trap with not isolated Proc on non-main ractor
+assert_equal '[:ok, :ok]', %q{
+  a = []
+  Ractor.new{
+    trap(:INT){p :ok}
+  }.take
+  a << :ok
+
+  begin
+    Ractor.new{
+      s = 'str'
+      trap(:INT){p s}
+    }.take
+  rescue => Ractor::RemoteError
+    a << :ok
+  end
+}
+
+# Ractor-local storage
+assert_equal '[nil, "b", "a"]', %q{
+  ans = []
+  Ractor.current[:key] = 'a'
+  r = Ractor.new{
+    Ractor.yield self[:key]
+    self[:key] = 'b'
+    self[:key]
+  }
+  ans << r.take
+  ans << r.take
+  ans << Ractor.current[:key]
+}
+
+###
+### Synchronization tests
+###
+
+N = 100_000
+
+# fstring pool
+assert_equal "#{N}#{N}", %Q{
+  N = #{N}
+  2.times.map{
+    Ractor.new{
+      N.times{|i| -(i.to_s)}
+    }
+  }.map{|r| r.take}.join
+}
+
+# enc_table
+assert_equal "100", %Q{
+  Ractor.new do
+    loop do
+      Encoding.find("test-enc-#{rand(5_000)}").inspect
+    rescue ArgumentError => e
+    end
+  end
+
+  src = Encoding.find("UTF-8")
+  100.times{|i|
+    src.replicate("test-enc-\#{i}")
+  }
+}
+
+# Generic ivtbl
+n = N/2
+assert_equal "#{n}#{n}", %Q{
+  2.times.map{
+    Ractor.new do
+      #{n}.times do
+        obj = ''
+        obj.instance_variable_set("@a", 1)
+        obj.instance_variable_set("@b", 1)
+        obj.instance_variable_set("@c", 1)
+        obj.instance_variable_defined?("@a")
+      end
+    end
+  }.map{|r| r.take}.join
+}
+
+# NameError
+assert_equal "ok", %q{
+  begin
+    bar
+  rescue => err
+  end
+  begin
+    Ractor.new{} << err
+  rescue TypeError
+    'ok'
+  end
+}
+
+assert_equal "ok", %q{
+  GC.disable
+  Ractor.new {}
+  raise "not ok" unless GC.disable
+
+  foo = []
+  10.times { foo << 1 }
+
+  GC.start
+
+  'ok'
+}
+
+# Can yield back values while GC is sweeping [Bug #18117]
+assert_equal "ok", %q{
+  workers = (0...8).map do
+    Ractor.new do
+      loop do
+        10_000.times.map { Object.new }
+        Ractor.yield Time.now
+      end
+    end
+  end
+
+  1_000.times { idle_worker, tmp_reporter = Ractor.select(*workers) }
+  "ok"
+}
+
+assert_equal "ok", %q{
+  def foo(*); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo(**); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo(...); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo((x), (y)); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo([], []))
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  module M
+    def foo
+      @foo
+    end
+  end
+
+  class A
+    include M
+
+    def initialize
+      100.times { |i| instance_variable_set(:"@var_#{i}", "bad: #{i}") }
+      @foo = 2
+    end
+  end
+
+  class B
+    include M
+
+    def initialize
+      @foo = 1
+    end
+  end
+
+  Ractor.new do
+    b = B.new
+    100_000.times do
+      raise unless b.foo == 1
+    end
+  end
+
+  a = A.new
+  100_000.times do
+    raise unless a.foo == 2
+  end
+
+  "ok"
+}
+
+assert_match /\Atest_ractor\.rb:1:\s+warning:\s+Ractor is experimental/, %q{
+  Warning[:experimental] = $VERBOSE = true
+  STDERR.reopen(STDOUT)
+  eval("Ractor.new{}.take", nil, "test_ractor.rb", 1)
+}
+
+end # if !ENV['GITHUB_WORKFLOW']
diff --git a/bootstraptest/test_string.rb b/bootstraptest/test_string.rb
new file mode 100644
index 0000000000..849dcd45b0
--- /dev/null
+++ b/bootstraptest/test_string.rb
@@ -0,0 +1,3 @@
+assert_normal_exit %q{
+  inspect.clear
+}, '[ruby-core:68110]'
diff --git a/bootstraptest/test_syntax.rb b/bootstraptest/test_syntax.rb
index 80eaa6416d..948e2d7809 100644
--- a/bootstraptest/test_syntax.rb
+++ b/bootstraptest/test_syntax.rb
@@ -268,8 +268,10 @@ assert_equal %q{}, %q{
   defined?(@@a)
 }
 assert_equal %q{class variable}, %q{
-  @@a = 1
-  defined?(@@a)
+  class A
+    @@a = 1
+    defined?(@@a)
+  end
 }
 assert_equal %q{}, %q{
   defined?($a)
@@ -376,6 +378,8 @@ assert_equal %q{1}, %q{1 or 2 or 3 or 4}
 assert_equal %q{1}, %q{1 or false or 3 or 4}
 assert_equal %q{2}, %q{nil or 2 or 3 or 4}
 assert_equal %q{2}, %q{false or 2 or 3 or 4}
+assert_equal %q{1}, %q{if true && ""; then 1; end}
+assert_equal %q{1}, %q{if nil || true; then 1; end}
 assert_equal %q{false}, %q{nil or false or nil or false}
 assert_equal %q{elseng}, %q{
   case
@@ -624,7 +628,7 @@ assert_equal '2', %q{
 }
 
 assert_match /invalid multibyte char/, %q{
-  STDERR.reopen(STDOUT)
+  $stderr = STDOUT
   eval("\"\xf0".force_encoding("utf-8"))
 }, '[ruby-dev:32429]'
 
diff --git a/bootstraptest/test_thread.rb b/bootstraptest/test_thread.rb
index c2b2b8ce9b..5361828403 100644
--- a/bootstraptest/test_thread.rb
+++ b/bootstraptest/test_thread.rb
@@ -1,4 +1,14 @@
-# Thread and Fiber
+show_limit %q{
+  threads = []
+  begin
+    threads << Thread.new{sleep}
+
+    raise Exception, "skipping" if threads.count >= 10_000
+  rescue Exception => error
+    puts "Thread count: #{threads.count} (#{error})"
+    break
+  end while true
+} if false # disable to pass CI
 
 assert_equal %q{ok}, %q{
   Thread.new{
@@ -22,11 +32,12 @@ begin
   }
   v == 20100 ? :ok : v
 rescue ThreadError => e
-  :ok if e.message =~ "can't create Thread"
+  :ok if /can't create Thread/ =~ e.message
 end
 }
-assert_equal %q{5000}, %q{
-  5000.times{|e|
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
     (1..2).map{
       Thread.new{
       }
@@ -34,9 +45,13 @@ assert_equal %q{5000}, %q{
       e.join()
     }
   }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
 }
-assert_equal %q{5000}, %q{
-  5000.times{|e|
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
     (1..2).map{
       Thread.new{
       }
@@ -44,6 +59,9 @@ assert_equal %q{5000}, %q{
       e.join(1000000000)
     }
   }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
 }
 assert_equal %q{ok}, %q{
 begin
@@ -85,7 +103,7 @@ assert_equal %q{ok}, %q{
       ans = :ok
     end
   }
-  Thread.pass
+  Thread.pass until t.stop?
   t.kill
   t.join
   ans
@@ -225,7 +243,7 @@ assert_equal 'true', %{
 }
 
 assert_equal 'ok', %{
-  open("zzz.rb", "w") do |f|
+  open("zzz_t1.rb", "w") do |f|
     f.puts <<-END
       begin
         Thread.new { fork { GC.start } }.join
@@ -236,21 +254,21 @@ assert_equal 'ok', %{
       end
     END
   end
-  require "./zzz.rb"
+  require "./zzz_t1.rb"
   $result
 }
 
 assert_finish 3, %{
-  th = Thread.new {sleep 2}
-  th.join(1)
+  th = Thread.new {sleep 0.2}
+  th.join(0.1)
   th.join
 }
 
 assert_finish 3, %{
   require 'timeout'
-  th = Thread.new {sleep 2}
+  th = Thread.new {sleep 0.2}
   begin
-    Timeout.timeout(1) {th.join}
+    Timeout.timeout(0.1) {th.join}
   rescue Timeout::Error
   end
   th.join
@@ -276,7 +294,7 @@ assert_normal_exit %q{
 assert_equal 'ok', %q{
   def m
     t = Thread.new { while true; // =~ "" end }
-    sleep 0.1
+    sleep 0.01
     10.times {
       if /((ab)*(ab)*)*(b)/ =~ "ab"*7
         return :ng if !$4
@@ -291,10 +309,6 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:34492]'
 
 assert_normal_exit %q{
-  at_exit { Fiber.new{}.resume }
-}
-
-assert_normal_exit %q{
   g = enum_for(:local_variables)
   loop { g.next }
 }, '[ruby-dev:34128]'
@@ -320,10 +334,6 @@ assert_normal_exit %q{
 }, '[ruby-dev:34128]'
 
 assert_normal_exit %q{
-  Fiber.new(&Object.method(:class_eval)).resume("foo")
-}, '[ruby-dev:34128]'
-
-assert_normal_exit %q{
   Thread.new("foo", &Object.method(:class_eval)).join
 }, '[ruby-dev:34128]'
 
@@ -339,9 +349,10 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    m1, m2 = Mutex.new, Mutex.new
-    Thread.new { m1.lock; sleep 1; m2.lock }
-    m2.lock; sleep 1; m1.lock
+    m1, m2 = Thread::Mutex.new, Thread::Mutex.new
+    f1 = f2 = false
+    Thread.new { m1.lock; f2 = true; sleep 0.001 until f1; m2.lock }
+    m2.lock; f1 = true; sleep 0.001 until f2; m1.lock
     :ng
   rescue Exception
     :ok
@@ -349,34 +360,34 @@ assert_equal 'ok', %q{
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock }; sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock }; sleep 0.1; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
+  m = Thread::Mutex.new
   Thread.new { m.lock }; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
+  m = Thread::Mutex.new
   Thread.new { m.lock }.join; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock; sleep 2 }
-  sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2 }
+  sleep 0.1; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock; sleep 2; m.unlock }
-  sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2; m.unlock }
+  sleep 0.1; m.lock
   :ok
 }
 
@@ -397,20 +408,21 @@ assert_equal 'ok', %q{
 }
 
 assert_equal 'ok', %{
-  open("zzz.rb", "w") do |f|
-    f.puts <<-END
+  open("zzz_t2.rb", "w") do |f|
+    f.puts <<-'end;' # do
       begin
-        m = Mutex.new
-        Thread.new { m.lock; sleep 1 }
-        sleep 0.3
+        m = Thread::Mutex.new
         parent = Thread.current
+        th1 = Thread.new { m.lock; sleep }
+        sleep 0.01 until th1.stop?
         Thread.new do
-          sleep 0.3
+          sleep 0.01 until parent.stop?
           begin
             fork { GC.start }
           rescue Exception
             parent.raise $!
           end
+          th1.run
         end
         m.lock
         pid, status = Process.wait2
@@ -418,17 +430,17 @@ assert_equal 'ok', %{
       rescue NotImplementedError
         $result = :ok
       end
-    END
+    end;
   end
-  require "./zzz.rb"
+  require "./zzz_t2.rb"
   $result
 }
 
 assert_finish 3, %q{
   require 'thread'
 
-  lock = Mutex.new
-  cond = ConditionVariable.new
+  lock = Thread::Mutex.new
+  cond = Thread::ConditionVariable.new
   t = Thread.new do
     lock.synchronize do
       cond.wait(lock)
@@ -448,17 +460,41 @@ assert_finish 3, %q{
 
 assert_equal 'ok', %q{
   begin
-    Process.waitpid2(fork {sleep 1})[1].success? ? 'ok' : 'ng'
+    Process.waitpid2(fork {})[1].success? ? 'ok' : 'ng'
   rescue NotImplementedError
     'ok'
   end
 }
 
 assert_equal 'foo', %q{
-  f = proc {|s| /#{ sleep 1; s }/o }
-  [ Thread.new {            f.call("foo"); nil },
-    Thread.new { sleep 0.5; f.call("bar"); nil },
-  ].each {|t| t.join }
+  i = 0
+  Thread.start {sleep 1; exit!}
+  f = proc {|s, c| /#{c.call; s}/o }
+  th2 = Thread.new {
+    sleep 0.01 until i == 1
+    i = 2
+    f.call("bar", proc {sleep 2});
+    nil
+  }
+  th1 = Thread.new {
+    f.call("foo", proc {i = 1; sleep 0.01 until i == 2; sleep 0.01})
+    nil
+  }
+  [th1, th2].each {|t| t.join }
   GC.start
   f.call.source
 }
+assert_normal_exit %q{
+  class C
+    def inspect
+      sleep 0.5
+      'C!!'
+    end
+  end
+  Thread.new{
+    loop{
+      p C.new
+    }
+  }
+  sleep 0.1
+}, timeout: 5
diff --git a/bootstraptest/test_yjit.rb b/bootstraptest/test_yjit.rb
new file mode 100644
index 0000000000..5c655b8f25
--- /dev/null
+++ b/bootstraptest/test_yjit.rb
@@ -0,0 +1,3530 @@
+# Regression test for yielding with autosplat to block with
+# optional parameters. https://github.com/Shopify/yjit/issues/313
+assert_equal '[:a, :b, :a, :b]', %q{
+  def yielder(arg) = yield(arg) + yield(arg)
+
+  yielder([:a, :b]) do |c = :c, d = :d|
+    [c, d]
+  end
+}
+
+# Regression test for GC mishap while doing shape transition
+assert_equal '[:ok]', %q{
+  # [Bug #19601]
+  class RegressionTest
+    def initialize
+      @a = @b = @fourth_ivar_does_shape_transition = nil
+    end
+
+    def extender
+      @first_extended_ivar = [:ok]
+    end
+  end
+
+  GC.stress = true
+
+  # Used to crash due to GC run in rb_ensure_iv_list_size()
+  # not marking the newly allocated [:ok].
+  RegressionTest.new.extender.itself
+}
+
+assert_equal 'true', %q{
+  # regression test for tracking type of locals for too long
+  def local_setting_cmp(five)
+    victim = 5
+    five.define_singleton_method(:respond_to?) do |_, _|
+      victim = nil
+    end
+
+    # +1 makes YJIT track that victim is a number and
+    # defined? calls respond_to? from above indirectly
+    unless (victim + 1) && defined?(five.something)
+      # Would return wrong result if we still think `five` is a number
+      victim.nil?
+    end
+  end
+
+  local_setting_cmp(Object.new)
+  local_setting_cmp(Object.new)
+}
+
+assert_equal '18374962167983112447', %q{
+  # regression test for incorrectly discarding 32 bits of a pointer when it
+  # comes to default values.
+  def large_literal_default(n: 0xff00_fabcafe0_00ff)
+    n
+  end
+
+  def call_graph_root
+    large_literal_default
+  end
+
+  call_graph_root
+  call_graph_root
+}
+
+assert_normal_exit %q{
+  # regression test for a leak caught by an assert on --yjit-call-threshold=2
+  Foo = 1
+
+  eval("def foo = [#{(['Foo,']*256).join}]")
+
+  foo
+  foo
+
+  Object.send(:remove_const, :Foo)
+}
+
+assert_normal_exit %q{
+  # Test to ensure send on overriden c functions
+  # doesn't corrupt the stack
+  class Bar
+    def bar(x)
+      x
+    end
+  end
+
+  class Foo
+    def bar
+      Bar.new
+    end
+  end
+
+  foo = Foo.new
+  # before this change, this line would error
+  # because "s" would still be on the stack
+  # String.to_s is the overridden method here
+  p foo.bar.bar("s".__send__(:to_s))
+}
+
+
+assert_equal '[nil, nil, nil, nil, nil, nil]', %q{
+  [NilClass, TrueClass, FalseClass, Integer, Float, Symbol].each do |klass|
+    klass.class_eval("def foo = @foo")
+  end
+
+  [nil, true, false, 0xFABCAFE, 0.42, :cake].map do |instance|
+    instance.foo
+    instance.foo
+  end
+}
+
+assert_equal '0', %q{
+  # This is a regression test for incomplete invalidation from
+  # opt_setinlinecache. This test might be brittle, so
+  # feel free to remove it in the future if it's too annoying.
+  # This test assumes --yjit-call-threshold=2.
+  module M
+    Foo = 1
+    def foo
+      Foo
+    end
+
+    def pin_self_type_then_foo
+      _ = @foo
+      foo
+    end
+
+    def only_ints
+      1 + self
+      foo
+    end
+  end
+
+  class Integer
+    include M
+  end
+
+  class Sub
+    include M
+  end
+
+  foo_method = M.instance_method(:foo)
+
+  dbg = ->(message) do
+    return # comment this out to get printouts
+
+    $stderr.puts RubyVM::YJIT.disasm(foo_method)
+    $stderr.puts message
+  end
+
+  2.times { 42.only_ints }
+
+  dbg["There should be two versions of getinlineache"]
+
+  module M
+    remove_const(:Foo)
+  end
+
+  dbg["There should be no getinlinecaches"]
+
+  2.times do
+    42.only_ints
+  rescue NameError => err
+    _ = "caught name error #{err}"
+  end
+
+  dbg["There should be one version of getinlineache"]
+
+  2.times do
+    Sub.new.pin_self_type_then_foo
+  rescue NameError
+    _ = 'second specialization'
+  end
+
+  dbg["There should be two versions of getinlineache"]
+
+  module M
+    Foo = 1
+  end
+
+  dbg["There should still be two versions of getinlineache"]
+
+  42.only_ints
+
+  dbg["There should be no getinlinecaches"]
+
+  # Find name of the first VM instruction in M#foo.
+  insns = RubyVM::InstructionSequence.of(foo_method).to_a
+  if defined?(RubyVM::YJIT.blocks_for) && (insns.last.find { Array === _1 }&.first == :opt_getinlinecache)
+    RubyVM::YJIT.blocks_for(RubyVM::InstructionSequence.of(foo_method))
+      .filter { _1.iseq_start_index == 0 }.count
+  else
+    0 # skip the test
+  end
+}
+
+# Check that frozen objects are respected
+assert_equal 'great', %q{
+  class Foo
+    attr_accessor :bar
+    def initialize
+      @bar = 1
+      freeze
+    end
+  end
+
+  foo = Foo.new
+
+  5.times do
+    begin
+      foo.bar = 2
+    rescue FrozenError
+    end
+  end
+
+  foo.bar == 1 ? "great" : "NG"
+}
+
+# Check that global variable set works
+assert_equal 'string', %q{
+  def foo
+    $foo = "string"
+  end
+
+  foo
+}
+
+# Check that exceptions work when setting global variables
+assert_equal 'rescued', %q{
+  def set_var
+    $var = 100
+  rescue
+    :rescued
+  end
+
+  set_var
+  trace_var(:$var) { raise }
+  set_var
+}
+
+# Check that global variables work
+assert_equal 'string', %q{
+  $foo = "string"
+
+  def foo
+    $foo
+  end
+
+  foo
+}
+
+# Check that exceptions work when getting global variable
+assert_equal 'rescued', %q{
+  Warning[:deprecated] = true
+
+  module Warning
+    def warn(message)
+      raise
+    end
+  end
+
+  def get_var
+    $=
+  rescue
+    :rescued
+  end
+
+  $VERBOSE = true
+  get_var
+  get_var
+}
+
+# Check that global tracepoints work
+assert_equal 'true', %q{
+  def foo
+    1
+  end
+
+  foo
+  foo
+  foo
+
+  called = false
+
+  tp = TracePoint.new(:return) { |event|
+    if event.method_id == :foo
+      called = true
+    end
+  }
+  tp.enable
+  foo
+  tp.disable
+  called
+}
+
+# Check that local tracepoints work
+assert_equal 'true', %q{
+  def foo
+    1
+  end
+
+  foo
+  foo
+  foo
+
+  called = false
+
+  tp = TracePoint.new(:return) { |_| called = true }
+  tp.enable(target: method(:foo))
+  foo
+  tp.disable
+  called
+}
+
+# Make sure that optional param methods return the correct value
+assert_equal '1', %q{
+  def m(ary = [])
+    yield(ary)
+  end
+
+  # Warm the JIT with a 0 param call
+  2.times { m { } }
+  m(1) { |v| v }
+}
+
+# Test for topn
+assert_equal 'array', %q{
+  def threequals(a)
+    case a
+    when Array
+      "array"
+    when Hash
+      "hash"
+    else
+      "unknown"
+    end
+  end
+
+  threequals([])
+  threequals([])
+  threequals([])
+}
+
+# Test for opt_mod
+assert_equal '2', %q{
+  def mod(a, b)
+    a % b
+  end
+
+  mod(7, 5)
+  mod(7, 5)
+}
+
+# Test for opt_mult
+assert_equal '12', %q{
+  def mult(a, b)
+    a * b
+  end
+
+  mult(6, 2)
+  mult(6, 2)
+}
+
+# Test for opt_div
+assert_equal '3', %q{
+  def div(a, b)
+    a / b
+  end
+
+  div(6, 2)
+  div(6, 2)
+}
+
+# BOP redefined methods work when JIT compiled
+assert_equal 'false', %q{
+  def less_than x
+    x < 10
+  end
+
+  class Integer
+    def < x
+      false
+    end
+  end
+
+  less_than 2
+  less_than 2
+  less_than 2
+}
+
+# BOP redefinition works on Integer#<
+assert_equal 'false', %q{
+  def less_than x
+    x < 10
+  end
+
+  less_than 2
+  less_than 2
+
+  class Integer
+    def < x
+      false
+    end
+  end
+
+  less_than 2
+}
+
+# Putobject, less-than operator, fixnums
+assert_equal '2', %q{
+    def check_index(index)
+        if 0x40000000 < index
+            raise "wat? #{index}"
+        end
+        index
+    end
+    check_index 2
+    check_index 2
+}
+
+# foo leaves a temp on the stack before the call
+assert_equal '6', %q{
+    def bar
+        return 5
+    end
+
+    def foo
+        return 1 + bar
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Method with one arguments
+# foo leaves a temp on the stack before the call
+assert_equal '7', %q{
+    def bar(a)
+        return a + 1
+    end
+
+    def foo
+        return 1 + bar(5)
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Method with two arguments
+# foo leaves a temp on the stack before the call
+assert_equal '0', %q{
+    def bar(a, b)
+        return a - b
+    end
+
+    def foo
+        return 1 + bar(1, 2)
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Passing argument types to callees
+assert_equal '8.5', %q{
+    def foo(x, y)
+        x + y
+    end
+
+    def bar
+        foo(7, 1.5)
+    end
+
+    bar
+    bar
+}
+
+# Recursive Ruby-to-Ruby calls
+assert_equal '21', %q{
+    def fib(n)
+        if n < 2
+            return n
+        end
+
+        return fib(n-1) + fib(n-2)
+    end
+
+    r = fib(8)
+}
+
+# Ruby-to-Ruby call and C call
+assert_normal_exit %q{
+  def bar
+    puts('hi!')
+  end
+
+  def foo
+    bar
+  end
+
+  foo()
+  foo()
+}
+
+# Method aliasing
+assert_equal '42', %q{
+  class Foo
+    def method_a
+      42
+    end
+
+    alias method_b method_a
+
+    def method_a
+        :somethingelse
+    end
+  end
+
+  @obj = Foo.new
+
+  def test
+    @obj.method_b
+  end
+
+  test
+  test
+}
+
+# Method aliasing with method from parent class
+assert_equal '777', %q{
+  class A
+    def method_a
+      777
+    end
+  end
+
+  class B < A
+    alias method_b method_a
+  end
+
+  @obj = B.new
+
+  def test
+    @obj.method_b
+  end
+
+  test
+  test
+}
+
+# The hash method is a C function and uses the self argument
+assert_equal 'true', %q{
+    def lehashself
+        hash
+    end
+
+    a = lehashself
+    b = lehashself
+    a == b
+}
+
+# Method redefinition (code invalidation) test
+assert_equal '1', %q{
+    def ret1
+        return 1
+    end
+
+    klass = Class.new do
+        def alias_then_hash(klass, method_to_redefine)
+            # Redefine the method to be ret1
+            klass.alias_method(method_to_redefine, :ret1)
+            hash
+        end
+    end
+
+    instance = klass.new
+
+    i = 0
+    while i < 12
+        if i < 11
+            # Redefine the bar method
+            instance.alias_then_hash(klass, :bar)
+        else
+            # Redefine the hash method to be ret1
+            retval = instance.alias_then_hash(klass, :hash)
+        end
+        i += 1
+    end
+
+    retval
+}
+
+# Code invalidation and opt_getinlinecache
+assert_normal_exit %q{
+  class Foo; end
+
+  # Uses the class constant Foo
+  def use_constant(arg)
+    [Foo.new, arg]
+  end
+
+  def propagate_type
+    i = Array.new
+    i.itself # make it remember that i is on-heap
+    use_constant(i)
+  end
+
+  propagate_type
+  propagate_type
+  use_constant(Foo.new)
+  class Jo; end # bump global constant state
+  use_constant(3)
+}
+
+# Method redefinition (code invalidation) and GC
+assert_equal '7', %q{
+    def bar()
+        return 5
+    end
+
+    def foo()
+        bar()
+    end
+
+    foo()
+    foo()
+
+    def bar()
+        return 7
+    end
+
+    4.times { GC.start }
+
+    foo()
+    foo()
+}
+
+# Method redefinition with two block versions
+assert_equal '7', %q{
+    def bar()
+        return 5
+    end
+
+    def foo(n)
+        return ((n < 5)? 5:false), bar()
+    end
+
+    foo(4)
+    foo(4)
+    foo(10)
+    foo(10)
+
+    def bar()
+        return 7
+    end
+
+    4.times { GC.start }
+
+    foo(4)
+    foo(4)[1]
+}
+
+# Method redefinition while the method is on the stack
+assert_equal '[777, 1]', %q{
+    def foo
+        redef()
+        777
+    end
+
+    def redef
+        # Redefine the global foo
+        eval("def foo; 1; end", TOPLEVEL_BINDING)
+
+        # Collect dead code
+        GC.stress = true
+        GC.start
+
+        # But we will return to the original foo,
+        # which remains alive because it's on the stack
+    end
+
+    # Must produce [777, 1]
+    [foo, foo]
+}
+
+# Test for GC safety. Don't invalidate dead iseqs.
+assert_normal_exit %q{
+  Class.new do
+    def foo
+      itself
+    end
+
+    new.foo
+    new.foo
+    new.foo
+    new.foo
+  end
+
+  4.times { GC.start }
+  def itself
+    self
+  end
+}
+
+# test setinstancevariable on extended objects
+assert_equal '1', %q{
+  class Extended
+    attr_reader :one
+
+    def write_many
+      @a = 1
+      @b = 2
+      @c = 3
+      @d = 4
+      @one = 1
+    end
+  end
+
+  foo = Extended.new
+  foo.write_many
+  foo.write_many
+  foo.write_many
+}
+
+# test setinstancevariable on embedded objects
+assert_equal '1', %q{
+  class Embedded
+    attr_reader :one
+
+    def write_one
+      @one = 1
+    end
+  end
+
+  foo = Embedded.new
+  foo.write_one
+  foo.write_one
+  foo.write_one
+}
+
+# test setinstancevariable after extension
+assert_equal '[10, 11, 12, 13, 1]', %q{
+  class WillExtend
+    attr_reader :one
+
+    def make_extended
+      @foo1 = 10
+      @foo2 = 11
+      @foo3 = 12
+      @foo4 = 13
+    end
+
+    def write_one
+      @one = 1
+    end
+
+    def read_all
+      [@foo1, @foo2, @foo3, @foo4, @one]
+    end
+  end
+
+  foo = WillExtend.new
+  foo.write_one
+  foo.write_one
+  foo.make_extended
+  foo.write_one
+  foo.read_all
+}
+
+# test setinstancevariable on frozen object
+assert_equal 'object was not modified', %q{
+  class WillFreeze
+    def write
+      @ivar = 1
+    end
+  end
+
+  wf = WillFreeze.new
+  wf.write
+  wf.write
+  wf.freeze
+
+  begin
+    wf.write
+  rescue FrozenError
+    "object was not modified"
+  end
+}
+
+# Test getinstancevariable and inline caches
+assert_equal '6', %q{
+  class Foo
+    def initialize
+      @x1 = 1
+      @x2 = 1
+      @x2 = 1
+      @x3 = 1
+      @x4 = 3
+    end
+
+    def bar
+      x = 1
+      @x4 + @x4
+    end
+  end
+
+  f = Foo.new
+  f.bar
+  f.bar
+}
+
+# Test that getinstancevariable codegen checks for extended table size
+assert_equal "nil\n", %q{
+  class A
+    def read
+      @ins1000
+    end
+  end
+
+  ins = A.new
+  other = A.new
+  10.times { other.instance_variable_set(:"@otr#{_1}", 'value') }
+  1001.times { ins.instance_variable_set(:"@ins#{_1}", 'value') }
+
+  ins.read
+  ins.read
+  ins.read
+
+  p other.read
+}
+
+# Test that opt_aref checks the class of the receiver
+assert_equal 'special', %q{
+  def foo(array)
+    array[30]
+  end
+
+  foo([])
+  foo([])
+
+  special = []
+  def special.[](idx)
+    'special'
+  end
+
+  foo(special)
+}
+
+# Test that object references in generated code get marked and moved
+assert_equal "good", %q{
+  def bar
+    "good"
+  end
+
+  def foo
+    bar
+  end
+
+  foo
+  foo
+
+  begin
+    GC.verify_compaction_references(expand_heap: true, toward: :empty)
+  rescue NotImplementedError
+    # in case compaction isn't supported
+  end
+
+  foo
+}
+
+# Test polymorphic getinstancevariable. T_OBJECT -> T_STRING
+assert_equal 'ok', %q{
+  @hello = @h1 = @h2 = @h3 = @h4 = 'ok'
+  str = ""
+  str.instance_variable_set(:@hello, 'ok')
+
+  public def get
+    @hello
+  end
+
+  get
+  get
+  str.get
+  str.get
+}
+
+# Test polymorphic getinstancevariable, two different classes
+assert_equal 'ok', %q{
+  class Embedded
+    def initialize
+      @ivar = 0
+    end
+
+    def get
+      @ivar
+    end
+  end
+
+  class Extended < Embedded
+    def initialize
+      @v1 = @v2 = @v3 = @v4 = @ivar = 'ok'
+    end
+  end
+
+  embed = Embedded.new
+  extend = Extended.new
+
+  embed.get
+  embed.get
+  extend.get
+  extend.get
+}
+
+# Test megamorphic getinstancevariable
+assert_equal 'ok', %q{
+  parent = Class.new do
+    def initialize
+      @hello = @h1 = @h2 = @h3 = @h4 = 'ok'
+    end
+
+    def get
+      @hello
+    end
+  end
+
+  subclasses = 300.times.map { Class.new(parent) }
+  subclasses.each { _1.new.get }
+  parent.new.get
+}
+
+# Test polymorphic opt_aref. array -> hash
+assert_equal '[42, :key]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  index([], 0) # get over compilation threshold
+
+  [
+    index([42], 0),
+    index({0=>:key}, 0),
+  ]
+}
+
+# Test polymorphic opt_aref. hash -> array -> custom class
+assert_equal '[nil, nil, :custom]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.[](_idx)
+    :custom
+  end
+
+  index({}, 0) # get over compilation threshold
+
+  [
+    index({}, 0),
+    index([], 0),
+    index(custom, 0)
+  ]
+}
+
+# Test polymorphic opt_aref. array -> custom class
+assert_equal '[42, :custom]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.[](_idx)
+    :custom
+  end
+
+  index([], 0) # get over compilation threshold
+
+  [
+    index([42], 0),
+    index(custom, 0)
+  ]
+}
+
+# Test custom hash method with opt_aref
+assert_equal '[nil, :ok]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.hash
+    42
+  end
+
+  h = {custom => :ok}
+
+  [
+    index(h, 0),
+    index(h, custom)
+  ]
+}
+
+# Test default value block for Hash with opt_aref
+assert_equal '[42, :default]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  h = Hash.new { :default }
+  h[0] = 42
+
+  [
+    index(h, 0),
+    index(h, 1)
+  ]
+}
+
+# A regression test for making sure cfp->sp is proper when
+# hitting stubs. See :stub-sp-flush:
+assert_equal 'ok', %q{
+  class D
+    def foo
+      Object.new
+    end
+  end
+
+  GC.stress = true
+  10.times do
+    D.new.foo
+    #    ^
+    #  This hits a stub with sp_offset > 0
+  end
+
+  :ok
+}
+
+# Test polymorphic callsite, cfunc -> iseq
+assert_equal '[Cfunc, Iseq]', %q{
+  public def call_itself
+    itself # the polymorphic callsite
+  end
+
+  class Cfunc; end
+
+  class Iseq
+    def itself
+      self
+    end
+  end
+
+  call_itself # cross threshold
+
+  [Cfunc.call_itself, Iseq.call_itself]
+}
+
+# Test polymorphic callsite, iseq -> cfunc
+assert_equal '[Iseq, Cfunc]', %q{
+  public def call_itself
+    itself # the polymorphic callsite
+  end
+
+  class Cfunc; end
+
+  class Iseq
+    def itself
+      self
+    end
+  end
+
+  call_itself # cross threshold
+
+  [Iseq.call_itself, Cfunc.call_itself]
+}
+
+# attr_reader method
+assert_equal '[100, 299]', %q{
+  class A
+    attr_reader :foo
+
+    def initialize
+      @foo = 100
+    end
+
+    # Make it extended
+    def fill!
+      @bar = @jojo = @as = @sdfsdf = @foo = 299
+    end
+  end
+
+  def bar(ins)
+    ins.foo
+  end
+
+  ins = A.new
+  oth = A.new
+  oth.fill!
+
+  bar(ins)
+  bar(oth)
+
+  [bar(ins), bar(oth)]
+}
+
+# get ivar on object, then on hash
+assert_equal '[42, 100]', %q{
+  class Hash
+    attr_accessor :foo
+  end
+
+  class A
+    attr_reader :foo
+
+    def initialize
+      @foo = 42
+    end
+  end
+
+  def use(val)
+    val.foo
+  end
+
+
+  h = {}
+  h.foo = 100
+  obj = A.new
+
+  use(obj)
+  [use(obj), use(h)]
+}
+
+# get ivar on String
+assert_equal '[nil, nil, 42, 42]', %q{
+  # @foo to exercise the getinstancevariable instruction
+  public def get_foo
+    @foo
+  end
+
+  get_foo
+  get_foo # compile it for the top level object
+
+  class String
+    attr_reader :foo
+  end
+
+  def run
+    str = String.new
+
+    getter = str.foo
+    insn = str.get_foo
+
+    str.instance_variable_set(:@foo, 42)
+
+    [getter, insn, str.foo, str.get_foo]
+  end
+
+  run
+  run
+}
+
+# splatting an empty array on a getter
+assert_equal '42', %q{
+  @foo = 42
+  module Kernel
+    attr_reader :foo
+  end
+
+  def run
+    foo(*[])
+  end
+
+  run
+  run
+}
+
+# splatting an empty array on a specialized method
+assert_equal 'ok', %q{
+  def run
+    "ok".to_s(*[])
+  end
+
+  run
+  run
+}
+
+# splatting an single element array on a specialized method
+assert_equal '[1]', %q{
+  def run
+    [].<<(*[1])
+  end
+
+  run
+  run
+}
+
+# specialized method with wrong args
+assert_equal 'ok', %q{
+  def run(x)
+    "bad".to_s(123) if x
+  rescue
+    :ok
+  end
+
+  run(false)
+  run(true)
+}
+
+# getinstancevariable on Symbol
+assert_equal '[nil, nil]', %q{
+  # @foo to exercise the getinstancevariable instruction
+  public def get_foo
+    @foo
+  end
+
+  dyn_sym = ("a" + "b").to_sym
+  sym = :static
+
+  # compile get_foo
+  dyn_sym.get_foo
+  dyn_sym.get_foo
+
+  [dyn_sym.get_foo, sym.get_foo]
+}
+
+# attr_reader on Symbol
+assert_equal '[nil, nil]', %q{
+  class Symbol
+    attr_reader :foo
+  end
+
+  public def get_foo
+    foo
+  end
+
+  dyn_sym = ("a" + "b").to_sym
+  sym = :static
+
+  # compile get_foo
+  dyn_sym.get_foo
+  dyn_sym.get_foo
+
+  [dyn_sym.get_foo, sym.get_foo]
+}
+
+# passing too few arguments to method with optional parameters
+assert_equal 'raised', %q{
+  def opt(a, b = 0)
+  end
+
+  def use
+    opt
+  end
+
+  use rescue nil
+  begin
+    use
+    :ng
+  rescue ArgumentError
+    :raised
+  end
+}
+
+# passing too many arguments to method with optional parameters
+assert_equal 'raised', %q{
+  def opt(a, b = 0)
+  end
+
+  def use
+    opt(1, 2, 3, 4)
+  end
+
+  use rescue nil
+  begin
+    use
+    :ng
+  rescue ArgumentError
+    :raised
+  end
+}
+
+# test calling Ruby method with a block
+assert_equal '[1, 2, 42]', %q{
+  def thing(a, b)
+    [a, b, yield]
+  end
+
+  def use
+    thing(1,2) { 42 }
+  end
+
+  use
+  use
+}
+
+# test calling C method with a block
+assert_equal '[42, 42]', %q{
+  def use(array, initial)
+    array.reduce(initial) { |a, b| a + b }
+  end
+
+  use([], 0)
+  [use([2, 2], 38), use([14, 14, 14], 0)]
+}
+
+# test calling block param
+assert_equal '[1, 2, 42]', %q{
+  def foo(&block)
+    block.call
+  end
+
+  [foo {1}, foo {2}, foo {42}]
+}
+
+# test calling without block param
+assert_equal '[1, false, 2, false]', %q{
+  def bar
+    block_given? && yield
+  end
+
+  def foo(&block)
+    bar(&block)
+  end
+
+  [foo { 1 }, foo, foo { 2 }, foo]
+}
+
+# test calling block param failing
+assert_equal '42', %q{
+  def foo(&block)
+    block.call
+  end
+
+  foo {} # warmup
+
+  begin
+    foo
+  rescue NoMethodError => e
+    42 if nil == e.receiver
+  end
+}
+
+# test calling method taking block param
+assert_equal '[Proc, 1, 2, 3, Proc]', %q{
+  def three(a, b, c, &block)
+    [a, b, c, block.class]
+  end
+
+  def zero(&block)
+    block.class
+  end
+
+  def use_three
+    three(1, 2, 3) {}
+  end
+
+  def use_zero
+    zero {}
+  end
+
+  use_three
+  use_zero
+
+  [use_zero] + use_three
+}
+
+# test building empty array
+assert_equal '[]', %q{
+  def build_arr
+    []
+  end
+
+  build_arr
+  build_arr
+}
+
+# test building array of one element
+assert_equal '[5]', %q{
+  def build_arr(val)
+    [val]
+  end
+
+  build_arr(5)
+  build_arr(5)
+}
+
+# test building array of several element
+assert_equal '[5, 5, 5, 5, 5]', %q{
+  def build_arr(val)
+    [val, val, val, val, val]
+  end
+
+  build_arr(5)
+  build_arr(5)
+}
+
+# test building empty hash
+assert_equal '{}', %q{
+  def build_hash
+    {}
+  end
+
+  build_hash
+  build_hash
+}
+
+# test building hash with values
+assert_equal '{:foo=>:bar}', %q{
+  def build_hash(val)
+    { foo: val }
+  end
+
+  build_hash(:bar)
+  build_hash(:bar)
+}
+
+# test string interpolation with known types
+assert_equal 'foobar', %q{
+  def make_str
+    foo = -"foo"
+    bar = -"bar"
+    "#{foo}#{bar}"
+  end
+
+  make_str
+  make_str
+}
+
+# test string interpolation with unknown types
+assert_equal 'foobar', %q{
+  def make_str(foo, bar)
+    "#{foo}#{bar}"
+  end
+
+  make_str("foo", "bar")
+  make_str("foo", "bar")
+}
+
+# test string interpolation with known non-strings
+assert_equal 'foo123', %q{
+  def make_str
+    foo = -"foo"
+    bar = 123
+    "#{foo}#{bar}"
+  end
+
+  make_str
+  make_str
+}
+
+# test string interpolation with unknown non-strings
+assert_equal 'foo123', %q{
+  def make_str(foo, bar)
+    "#{foo}#{bar}"
+  end
+
+  make_str("foo", 123)
+  make_str("foo", 123)
+}
+
+# test that invalidation of String#to_s doesn't crash
+assert_equal 'meh', %q{
+  def inval_method
+    "".to_s
+  end
+
+  inval_method
+
+  class String
+    def to_s
+      "meh"
+    end
+  end
+
+  inval_method
+}
+
+# test that overriding to_s on a String subclass works consistently
+assert_equal 'meh', %q{
+  class MyString < String
+    def to_s
+      "meh"
+    end
+  end
+
+  def test_to_s(obj)
+    obj.to_s
+  end
+
+  OBJ = MyString.new
+
+  # Should return '' both times
+  test_to_s("")
+  test_to_s("")
+
+  # Can return '' if YJIT optimises String#to_s too aggressively
+  test_to_s(OBJ)
+  test_to_s(OBJ)
+}
+
+# test string interpolation with overridden to_s
+assert_equal 'foo', %q{
+  class String
+    def to_s
+      "bad"
+    end
+  end
+
+  def make_str(foo)
+    "#{foo}"
+  end
+
+  make_str("foo")
+  make_str("foo")
+}
+
+# Test that String unary plus returns the same object ID for an unfrozen string.
+assert_equal 'true', %q{
+  def jittable_method
+    str = "bar"
+
+    old_obj_id = str.object_id
+    uplus_str = +str
+
+    uplus_str.object_id == old_obj_id
+  end
+  jittable_method
+}
+
+# Test that String unary plus returns a different unfrozen string when given a frozen string
+assert_equal 'false', %q{
+  # Logic needs to be inside an ISEQ, such as a method, for YJIT to compile it
+  def jittable_method
+    frozen_str = "foo".freeze
+
+    old_obj_id = frozen_str.object_id
+    uplus_str = +frozen_str
+
+    uplus_str.object_id == old_obj_id || uplus_str.frozen?
+  end
+
+  jittable_method
+}
+
+# String-subclass objects should behave as expected inside string-interpolation via concatstrings
+assert_equal 'monkeys / monkeys, yo!', %q{
+  class MyString < String
+    # This is a terrible idea in production code, but we'd like YJIT to match CRuby
+    def to_s
+      super + ", yo!"
+    end
+  end
+
+  def jittable_method
+    m = MyString.new('monkeys')
+    "#{m} / #{m.to_s}"
+  end
+
+  jittable_method
+}
+
+# String-subclass objects should behave as expected for string equality
+assert_equal 'false', %q{
+  class MyString < String
+    # This is a terrible idea in production code, but we'd like YJIT to match CRuby
+    def ==(b)
+      "#{self}_" == b
+    end
+  end
+
+  def jittable_method
+    ma = MyString.new("a")
+
+    # Check equality with string-subclass receiver
+    ma == "a" || ma != "a_" ||
+      # Check equality with string receiver
+      "a_" == ma || "a" != ma ||
+      # Check equality between string subclasses
+      ma != MyString.new("a_") ||
+      # Make sure "string always equals itself" check isn't used with overridden equality
+      ma == ma
+  end
+  jittable_method
+}
+
+# Test to_s duplicates a string subclass object but not a string
+assert_equal 'false', %q{
+  class MyString < String; end
+
+  def jittable_method
+    a = "a"
+    ma = MyString.new("a")
+
+    a.object_id != a.to_s.object_id ||
+      ma.object_id == ma.to_s.object_id
+  end
+  jittable_method
+}
+
+# Test freeze on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    fma = MyString.new("a").freeze
+
+    # Freezing a string subclass should not duplicate it
+    fma.object_id == fma.freeze.object_id
+  end
+  jittable_method
+}
+
+# Test unary minus on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    ma = MyString.new("a")
+    fma = MyString.new("a").freeze
+
+    # Unary minus on frozen string subclass should not duplicate it
+    fma.object_id == (-fma).object_id &&
+      # Unary minus on unfrozen string subclass should duplicate it
+      ma.object_id != (-ma).object_id
+  end
+  jittable_method
+}
+
+# Test unary plus on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    fma = MyString.new("a").freeze
+
+    # Unary plus on frozen string subclass should not duplicate it
+    fma.object_id != (+fma).object_id
+  end
+  jittable_method
+}
+
+# Test << operator on string subclass
+assert_equal 'abab', %q{
+  class MyString < String; end
+
+  def jittable_method
+    a = -"a"
+    mb = MyString.new("b")
+
+    buf = String.new
+    mbuf = MyString.new
+
+    buf << a << mb
+    mbuf << a << mb
+
+    buf + mbuf
+  end
+  jittable_method
+}
+
+# test invokebuiltin as used in struct assignment
+assert_equal '123', %q{
+  def foo(obj)
+    obj.foo = 123
+  end
+
+  struct = Struct.new(:foo)
+  obj = struct.new
+  foo(obj)
+  foo(obj)
+}
+
+# test invokebuiltin_delegate as used inside Dir.open
+assert_equal '.', %q{
+  def foo(path)
+    Dir.open(path).path
+  end
+
+  foo(".")
+  foo(".")
+}
+
+# test invokebuiltin_delegate_leave in method called from jit
+assert_normal_exit %q{
+  def foo(obj)
+    obj.clone
+  end
+
+  foo(Object.new)
+  foo(Object.new)
+}
+
+# test invokebuiltin_delegate_leave in method called from cfunc
+assert_normal_exit %q{
+  def foo(obj)
+    [obj].map(&:clone)
+  end
+
+  foo(Object.new)
+  foo(Object.new)
+}
+
+# defining TrueClass#!
+assert_equal '[false, false, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(true)
+  y = foo(true)
+
+  class TrueClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(true)
+
+  [x, y, z]
+}
+
+# defining FalseClass#!
+assert_equal '[true, true, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(false)
+  y = foo(false)
+
+  class FalseClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(false)
+
+  [x, y, z]
+}
+
+# defining NilClass#!
+assert_equal '[true, true, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(nil)
+  y = foo(nil)
+
+  class NilClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(nil)
+
+  [x, y, z]
+}
+
+# polymorphic opt_not
+assert_equal '[true, true, false, false, false, false, false]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  foo(0)
+  [foo(nil), foo(false), foo(true), foo([]), foo(0), foo(4.2), foo(:sym)]
+}
+
+# getlocal with 2 levels
+assert_equal '7', %q{
+  def foo(foo, bar)
+    while foo > 0
+      while bar > 0
+        return foo + bar
+      end
+    end
+  end
+
+  foo(5,2)
+  foo(5,2)
+}
+
+# test pattern matching
+assert_equal '[:ok, :ok]', %q{
+  class C
+    def destructure_keys
+      {}
+    end
+  end
+
+  pattern_match = ->(i) do
+    case i
+    in a: 0
+      :ng
+    else
+      :ok
+    end
+  end
+
+  [{}, C.new].map(&pattern_match)
+}
+
+# Call to object with singleton
+assert_equal '123', %q{
+  obj = Object.new
+  def obj.foo
+    123
+  end
+
+  def foo(obj)
+    obj.foo()
+  end
+
+  foo(obj)
+  foo(obj)
+}
+
+# Call method on an object that has a non-material
+# singleton class.
+# TODO: assert that it takes no side exits? This
+# test case revealed that we were taking exits unnecessarily.
+assert_normal_exit %q{
+  def foo(obj)
+    obj.itself
+  end
+
+  o = Object.new.singleton_class
+  foo(o)
+  foo(o)
+}
+
+# Call to singleton class
+assert_equal '123', %q{
+  class Foo
+    def self.foo
+      123
+    end
+  end
+
+  def foo(obj)
+    obj.foo()
+  end
+
+  foo(Foo)
+  foo(Foo)
+}
+
+# invokesuper edge case
+assert_equal '[:A, [:A, :B]]', %q{
+  class B
+    def foo = :B
+  end
+
+  class A < B
+    def foo = [:A, super()]
+  end
+
+  A.new.foo
+  A.new.foo # compile A#foo
+
+  class C < A
+    define_method(:bar, A.instance_method(:foo))
+  end
+
+  C.new.bar
+}
+
+# Same invokesuper bytecode, multiple destinations
+assert_equal '[:Forward, :SecondTerminus]', %q{
+  module Terminus
+    def foo = :Terminus
+  end
+
+  module SecondTerminus
+    def foo = :SecondTerminus
+  end
+
+
+  module Forward
+    def foo = [:Forward, super]
+  end
+
+  class B
+    include SecondTerminus
+  end
+
+  class A < B
+    include Terminus
+    include Forward
+  end
+
+  A.new.foo
+  A.new.foo # compile
+
+  class B
+    include Forward
+    alias bar foo
+  end
+
+  # A.ancestors.take(5) == [A, Forward, Terminus, B, Forward, SecondTerminus]
+
+  A.new.bar
+}
+
+# invokesuper calling into itself
+assert_equal '[:B, [:B, :m]]', %q{
+  module M
+    def foo = :m
+  end
+
+  class B
+    include M
+    def foo = [:B, super]
+  end
+
+  ins = B.new
+  ins.singleton_class # materialize the singleton class
+  ins.foo
+  ins.foo # compile
+
+  ins.singleton_class.define_method(:bar, B.instance_method(:foo))
+  ins.bar
+}
+
+# invokesuper changed ancestor
+assert_equal '[:A, [:M, :B]]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  module M
+    def foo
+      [:M, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  A.include(M)
+  ins.foo
+}
+
+# invokesuper changed ancestor via prepend
+assert_equal '[:A, [:M, :B]]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  module M
+    def foo
+      [:M, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  B.prepend(M)
+  ins.foo
+}
+
+# invokesuper replaced method
+assert_equal '[:A, :Btwo]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  class B
+    def foo
+      :Btwo
+    end
+  end
+  ins.foo
+}
+
+# Call to fixnum
+assert_equal '[true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  is_odd(1)
+  is_odd(1)
+
+  [is_odd(123), is_odd(456)]
+}
+
+# Call to bignum
+assert_equal '[true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  bignum = 99999999999999999999
+  is_odd(bignum)
+  is_odd(bignum)
+
+  [is_odd(bignum), is_odd(bignum+1)]
+}
+
+# Call to fixnum and bignum
+assert_equal '[true, false, true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  bignum = 99999999999999999999
+  is_odd(bignum)
+  is_odd(bignum)
+  is_odd(123)
+  is_odd(123)
+
+  [is_odd(123), is_odd(456), is_odd(bignum), is_odd(bignum+1)]
+}
+
+# Call to static and dynamic symbol
+assert_equal 'bar', %q{
+  def to_string(obj)
+    obj.to_s
+  end
+
+  to_string(:foo)
+  to_string(:foo)
+  to_string((-"bar").to_sym)
+  to_string((-"bar").to_sym)
+}
+
+# Call to flonum and heap float
+assert_equal '[nil, nil, nil, 1]', %q{
+  def is_inf(obj)
+    obj.infinite?
+  end
+
+  is_inf(0.0)
+  is_inf(0.0)
+  is_inf(1e256)
+  is_inf(1e256)
+
+  [
+    is_inf(0.0),
+    is_inf(1.0),
+    is_inf(1e256),
+    is_inf(1.0/0.0)
+  ]
+}
+
+assert_equal '[1, 2, 3, 4, 5]', %q{
+  def splatarray
+    [*(1..5)]
+  end
+
+  splatarray
+  splatarray
+}
+
+assert_equal '[1, 1, 2, 1, 2, 3]', %q{
+  def expandarray
+    arr = [1, 2, 3]
+
+    a, = arr
+    b, c, = arr
+    d, e, f = arr
+
+    [a, b, c, d, e, f]
+  end
+
+  expandarray
+  expandarray
+}
+
+assert_equal '[1, 1]', %q{
+  def expandarray_useless_splat
+    arr = (1..10).to_a
+
+    a, * = arr
+    b, (*) = arr
+
+    [a, b]
+  end
+
+  expandarray_useless_splat
+  expandarray_useless_splat
+}
+
+assert_equal '[:not_heap, nil, nil]', %q{
+  def expandarray_not_heap
+    a, b, c = :not_heap
+    [a, b, c]
+  end
+
+  expandarray_not_heap
+  expandarray_not_heap
+}
+
+assert_equal '[:not_array, nil, nil]', %q{
+  def expandarray_not_array(obj)
+    a, b, c = obj
+    [a, b, c]
+  end
+
+  obj = Object.new
+  def obj.to_ary
+    [:not_array]
+  end
+
+  expandarray_not_array(obj)
+  expandarray_not_array(obj)
+}
+
+assert_equal '[1, 2, nil]', %q{
+  def expandarray_rhs_too_small
+    a, b, c = [1, 2]
+    [a, b, c]
+  end
+
+  expandarray_rhs_too_small
+  expandarray_rhs_too_small
+}
+
+assert_equal '[1, [2]]', %q{
+  def expandarray_splat
+    a, *b = [1, 2]
+    [a, b]
+  end
+
+  expandarray_splat
+  expandarray_splat
+}
+
+assert_equal '2', %q{
+  def expandarray_postarg
+    *, a = [1, 2]
+    a
+  end
+
+  expandarray_postarg
+  expandarray_postarg
+}
+
+assert_equal '10', %q{
+  obj = Object.new
+  val = nil
+  obj.define_singleton_method(:to_ary) { val = 10; [] }
+
+  def expandarray_always_call_to_ary(object)
+    * = object
+  end
+
+  expandarray_always_call_to_ary(obj)
+  expandarray_always_call_to_ary(obj)
+
+  val
+}
+
+# regression test of local type change
+assert_equal '1.1', %q{
+def bar(baz, quux)
+  if baz.integer?
+    baz, quux = quux, nil
+  end
+  baz.to_s
+end
+
+bar(123, 1.1)
+bar(123, 1.1)
+}
+
+# test enabling a line TracePoint in a C method call
+assert_equal '[[:line, true]]', %q{
+  events = []
+  events.instance_variable_set(
+    :@tp,
+    TracePoint.new(:line) { |tp| events << [tp.event, tp.lineno] if tp.path == __FILE__ }
+  )
+  def events.to_str
+    @tp.enable; ''
+  end
+
+  # Stay in generated code while enabling tracing
+  def events.compiled(obj)
+    String(obj)
+    @tp.disable; __LINE__
+  end
+
+  line = events.compiled(events)
+  events[0][-1] = (events[0][-1] == line)
+
+  events
+}
+
+# test enabling a c_return TracePoint in a C method call
+assert_equal '[[:c_return, :String, :string_alias, "events_to_str"]]', %q{
+  events = []
+  events.instance_variable_set(:@tp, TracePoint.new(:c_return) { |tp| events << [tp.event, tp.method_id, tp.callee_id, tp.return_value] })
+  def events.to_str
+    @tp.enable; 'events_to_str'
+  end
+
+  # Stay in generated code while enabling tracing
+  alias string_alias String
+  def events.compiled(obj)
+    string_alias(obj)
+    @tp.disable
+  end
+
+  events.compiled(events)
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test enabling a TracePoint that targets a particular line in a C method call
+assert_equal '[true]', %q{
+  events = []
+  events.instance_variable_set(:@tp, TracePoint.new(:line) { |tp| events << tp.lineno })
+  def events.to_str
+    @tp.enable(target: method(:compiled))
+    ''
+  end
+
+  # Stay in generated code while enabling tracing
+  def events.compiled(obj)
+    String(obj)
+    __LINE__
+  end
+
+  line = events.compiled(events)
+  events[0] = (events[0] == line)
+
+  events
+}
+
+# test enabling tracing in the middle of splatarray
+assert_equal '[true]', %q{
+  events = []
+  obj = Object.new
+  obj.instance_variable_set(:@tp, TracePoint.new(:line) { |tp| events << tp.lineno })
+  def obj.to_a
+    @tp.enable(target: method(:compiled))
+    []
+  end
+
+  # Enable tracing in the middle of the splatarray instruction
+  def obj.compiled(obj)
+    * = *obj
+    __LINE__
+  end
+
+  obj.compiled([])
+  line = obj.compiled(obj)
+  events[0] = (events[0] == line)
+
+  events
+}
+
+# test enabling tracing in the middle of opt_aref. Different since the codegen
+# for it ends in a jump.
+assert_equal '[true]', %q{
+  def lookup(hash, tp)
+    hash[42]
+    tp.disable; __LINE__
+  end
+
+  lines = []
+  tp = TracePoint.new(:line) { lines << _1.lineno if _1.path == __FILE__ }
+
+  lookup(:foo, tp)
+  lookup({}, tp)
+
+  enable_tracing_on_missing = Hash.new { tp.enable }
+
+  expected_line = lookup(enable_tracing_on_missing, tp)
+
+  lines[0] = true if lines[0] == expected_line
+
+  lines
+}
+
+# test enabling c_call tracing before compiling
+assert_equal '[[:c_call, :itself]]', %q{
+  def shouldnt_compile
+    itself
+  end
+
+  events = []
+  tp = TracePoint.new(:c_call) { |tp| events << [tp.event, tp.method_id] }
+
+  # assume first call compiles
+  tp.enable { shouldnt_compile }
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test enabling c_return tracing before compiling
+assert_equal '[[:c_return, :itself, main]]', %q{
+  def shouldnt_compile
+    itself
+  end
+
+  events = []
+  tp = TracePoint.new(:c_return) { |tp| events << [tp.event, tp.method_id, tp.return_value] }
+
+  # assume first call compiles
+  tp.enable { shouldnt_compile }
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test c_call invalidation
+assert_equal '[[:c_call, :itself]]', %q{
+  # enable the event once to make sure invalidation
+  # happens the second time we enable it
+  TracePoint.new(:c_call) {}.enable{}
+
+  def compiled
+    itself
+  end
+
+  # assume first call compiles
+  compiled
+
+  events = []
+  tp = TracePoint.new(:c_call) { |tp| events << [tp.event, tp.method_id] }
+  tp.enable { compiled }
+
+  events
+}
+
+# test enabling tracing for a suspended fiber
+assert_equal '[[:return, 42]]', %q{
+  def traced_method
+    Fiber.yield
+    42
+  end
+
+  events = []
+  tp = TracePoint.new(:return) { events << [_1.event, _1.return_value] }
+  # assume first call compiles
+  fiber = Fiber.new { traced_method }
+  fiber.resume
+  tp.enable(target: method(:traced_method))
+  fiber.resume
+
+  events
+}
+
+# test compiling on non-tracing ractor then running on a tracing one
+assert_equal '[:itself]', %q{
+  def traced_method
+    itself
+  end
+
+  tracing_ractor = Ractor.new do
+    # 1: start tracing
+    events = []
+    tp = TracePoint.new(:c_call) { events << _1.method_id }
+    tp.enable
+    Ractor.yield(nil)
+
+    # 3: run compiled method on tracing ractor
+    Ractor.yield(nil)
+    traced_method
+
+    events
+  ensure
+    tp&.disable
+  end
+
+  tracing_ractor.take
+
+  # 2: compile on non tracing ractor
+  traced_method
+
+  tracing_ractor.take
+  tracing_ractor.take
+}
+
+# Try to hit a lazy branch stub while another ractor enables tracing
+assert_equal '42', %q{
+  def compiled(arg)
+    if arg
+      arg + 1
+    else
+      itself
+      itself
+    end
+  end
+
+  ractor = Ractor.new do
+    compiled(false)
+    Ractor.yield(nil)
+    compiled(41)
+  end
+
+  tp = TracePoint.new(:line) { itself }
+  ractor.take
+  tp.enable
+
+  ractor.take
+}
+
+# Test equality with changing types
+assert_equal '[true, false, false, false]', %q{
+  def eq(a, b)
+    a == b
+  end
+
+  [
+    eq("foo", "foo"),
+    eq("foo", "bar"),
+    eq(:foo, "bar"),
+    eq("foo", :bar)
+  ]
+}
+
+# Redefined String eq
+assert_equal 'true', %q{
+  class String
+    def ==(other)
+      true
+    end
+  end
+
+  def eq(a, b)
+    a == b
+  end
+
+  eq("foo", "bar")
+  eq("foo", "bar")
+}
+
+# Redefined Integer eq
+assert_equal 'true', %q{
+  class Integer
+    def ==(other)
+      true
+    end
+  end
+
+  def eq(a, b)
+    a == b
+  end
+
+  eq(1, 2)
+  eq(1, 2)
+}
+
+# aset on array with invalid key
+assert_normal_exit %q{
+  def foo(arr)
+    arr[:foo] = 123
+  end
+
+  foo([1]) rescue nil
+  foo([1]) rescue nil
+}
+
+# test ractor exception on when setting ivar
+assert_equal '42',  %q{
+  class A
+    def self.foo
+      _foo = 1
+      _bar = 2
+      begin
+        @bar = _foo + _bar
+      rescue Ractor::IsolationError
+        42
+      end
+    end
+  end
+
+  A.foo
+  A.foo
+
+  Ractor.new { A.foo }.take
+}
+
+assert_equal '["plain", "special", "sub", "plain"]', %q{
+  def foo(arg)
+    arg.to_s
+  end
+
+  class Sub < String
+  end
+
+  special = String.new("special")
+  special.singleton_class
+
+  [
+    foo("plain"),
+    foo(special),
+    foo(Sub.new("sub")),
+    foo("plain")
+  ]
+}
+
+assert_equal '["sub", "sub"]', %q{
+  def foo(arg)
+    arg.to_s
+  end
+
+  class Sub < String
+    def to_s
+      super
+    end
+  end
+
+  sub = Sub.new("sub")
+
+  [foo(sub), foo(sub)]
+}
+
+assert_equal '[1]', %q{
+  def kwargs(value:)
+    value
+  end
+
+  5.times.map { kwargs(value: 1) }.uniq
+}
+
+assert_equal '[:ok]', %q{
+  def kwargs(value:)
+    value
+  end
+
+  5.times.map { kwargs() rescue :ok }.uniq
+}
+
+assert_equal '[:ok]', %q{
+  def kwargs(a:, b: nil)
+    value
+  end
+
+  5.times.map { kwargs(b: 123) rescue :ok }.uniq
+}
+
+assert_equal '[[1, 2]]', %q{
+  def kwargs(left:, right:)
+    [left, right]
+  end
+
+  5.times.flat_map do
+    [
+      kwargs(left: 1, right: 2),
+      kwargs(right: 2, left: 1)
+    ]
+  end.uniq
+}
+
+assert_equal '[[1, 2]]', %q{
+  def kwargs(lead, kwarg:)
+    [lead, kwarg]
+  end
+
+  5.times.map { kwargs(1, kwarg: 2) }.uniq
+}
+
+# optional and keyword args
+assert_equal '[[1, 2, 3]]', %q{
+  def opt_and_kwargs(a, b=2, c: nil)
+    [a,b,c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 3) }.uniq
+}
+
+assert_equal '[[1, 2, 3]]', %q{
+  def opt_and_kwargs(a, b=nil, c: nil)
+    [a,b,c]
+  end
+
+  5.times.map { opt_and_kwargs(1, 2, c: 3) }.uniq
+}
+
+# Bug #18453
+assert_equal '[[1, nil, 2]]', %q{
+  def opt_and_kwargs(a = {}, b: nil, c: nil)
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 2) }.uniq
+}
+
+assert_equal '[[{}, nil, 1]]', %q{
+  def opt_and_kwargs(a = {}, b: nil, c: nil)
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(c: 1) }.uniq
+}
+
+# leading and keyword arguments are swapped into the right order
+assert_equal '[[1, 2, 3, 4, 5, 6]]', %q{
+  def kwargs(five, six, a:, b:, c:, d:)
+    [a, b, c, d, five, six]
+  end
+
+  5.times.flat_map do
+    [
+      kwargs(5, 6, a: 1, b: 2, c: 3, d: 4),
+      kwargs(5, 6, a: 1, b: 2, d: 4, c: 3),
+      kwargs(5, 6, a: 1, c: 3, b: 2, d: 4),
+      kwargs(5, 6, a: 1, c: 3, d: 4, b: 2),
+      kwargs(5, 6, a: 1, d: 4, b: 2, c: 3),
+      kwargs(5, 6, a: 1, d: 4, c: 3, b: 2),
+      kwargs(5, 6, b: 2, a: 1, c: 3, d: 4),
+      kwargs(5, 6, b: 2, a: 1, d: 4, c: 3),
+      kwargs(5, 6, b: 2, c: 3, a: 1, d: 4),
+      kwargs(5, 6, b: 2, c: 3, d: 4, a: 1),
+      kwargs(5, 6, b: 2, d: 4, a: 1, c: 3),
+      kwargs(5, 6, b: 2, d: 4, c: 3, a: 1),
+      kwargs(5, 6, c: 3, a: 1, b: 2, d: 4),
+      kwargs(5, 6, c: 3, a: 1, d: 4, b: 2),
+      kwargs(5, 6, c: 3, b: 2, a: 1, d: 4),
+      kwargs(5, 6, c: 3, b: 2, d: 4, a: 1),
+      kwargs(5, 6, c: 3, d: 4, a: 1, b: 2),
+      kwargs(5, 6, c: 3, d: 4, b: 2, a: 1),
+      kwargs(5, 6, d: 4, a: 1, b: 2, c: 3),
+      kwargs(5, 6, d: 4, a: 1, c: 3, b: 2),
+      kwargs(5, 6, d: 4, b: 2, a: 1, c: 3),
+      kwargs(5, 6, d: 4, b: 2, c: 3, a: 1),
+      kwargs(5, 6, d: 4, c: 3, a: 1, b: 2),
+      kwargs(5, 6, d: 4, c: 3, b: 2, a: 1)
+    ]
+  end.uniq
+}
+
+# implicit hashes get skipped and don't break compilation
+assert_equal '[[:key]]', %q{
+  def implicit(hash)
+    hash.keys
+  end
+
+  5.times.map { implicit(key: :value) }.uniq
+}
+
+# default values on keywords don't mess up argument order
+assert_equal '[2]', %q{
+  def default_value
+    1
+  end
+
+  def default_expression(value: default_value)
+    value
+  end
+
+  5.times.map { default_expression(value: 2) }.uniq
+}
+
+# constant default values on keywords
+assert_equal '[3]', %q{
+  def default_expression(value: 3)
+    value
+  end
+
+  5.times.map { default_expression }.uniq
+}
+
+# non-constant default values on keywords
+assert_equal '[3]', %q{
+  def default_value
+    3
+  end
+
+  def default_expression(value: default_value)
+    value
+  end
+
+  5.times.map { default_expression }.uniq
+}
+
+# reordered optional kwargs
+assert_equal '[[100, 1]]', %q{
+  def foo(capacity: 100, max: nil)
+    [capacity, max]
+  end
+
+  5.times.map { foo(max: 1) }.uniq
+}
+
+# invalid lead param
+assert_equal 'ok', %q{
+  def bar(baz: 2)
+    baz
+  end
+
+  def foo
+    bar(1, baz: 123)
+  end
+
+  begin
+    foo
+    foo
+  rescue ArgumentError => e
+    print "ok"
+  end
+}
+
+# reordered required kwargs
+assert_equal '[[1, 2, 3, 4]]', %q{
+  def foo(default1: 1, required1:, default2: 3, required2:)
+    [default1, required1, default2, required2]
+  end
+
+  5.times.map { foo(required1: 2, required2: 4) }.uniq
+}
+
+# reordered default expression kwargs
+assert_equal '[[:one, :two, 3]]', %q{
+  def foo(arg1: (1+0), arg2: (2+0), arg3: (3+0))
+    [arg1, arg2, arg3]
+  end
+
+  5.times.map { foo(arg2: :two, arg1: :one) }.uniq
+}
+
+# complex kwargs
+assert_equal '[[1, 2, 3, 4]]', %q{
+  def foo(required:, specified: 999, simple_default: 3, complex_default: "4".to_i)
+    [required, specified, simple_default, complex_default]
+  end
+
+  5.times.map { foo(specified: 2, required: 1) }.uniq
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.store(:value, foo: 123)
+    bar[:value]
+  end
+
+  foo({})
+  foo({})
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.replace(foo: 123)
+  end
+
+  foo({})
+  foo({})
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123, :bar=>456}', %q{
+  def foo(bar)
+    bar.replace(foo: 123, bar: 456)
+  end
+
+  foo({})
+  foo({})
+}
+
+# variadic cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.merge(foo: 123)
+  end
+
+  foo({})
+  foo({})
+}
+
+# optimized cfunc kwargs
+assert_equal 'false', %q{
+  def foo
+    :foo.eql?(foo: :foo)
+  end
+
+  foo
+  foo
+}
+
+# attr_reader on frozen object
+assert_equal 'false', %q{
+  class Foo
+    attr_reader :exception
+
+    def failed?
+      !exception.nil?
+    end
+  end
+
+  foo = Foo.new.freeze
+  foo.failed?
+  foo.failed?
+}
+
+# regression test for doing kwarg shuffle before checking for interrupts
+assert_equal 'ok', %q{
+  def new_media_drop(attributes:, product_drop:, context:, sources:)
+    nil.nomethod rescue nil # force YJIT to bail to side exit
+
+    [attributes, product_drop, context, sources]
+  end
+
+  def load_medias(product_drop: nil, raw_medias:, context:)
+    raw_medias.map do |raw_media|
+      case new_media_drop(context: context, attributes: raw_media, product_drop: product_drop, sources: [])
+      in [Hash, ProductDrop, Context, Array]
+      else
+        raise "bad shuffle"
+      end
+    end
+  end
+
+  class Context; end
+
+  class ProductDrop
+    attr_reader :title
+    def initialize(title)
+      @title = title
+    end
+  end
+
+  # Make a thread so we have thread switching interrupts
+  th = Thread.new do
+    while true; end
+  end
+  1_000.times do |i|
+    load_medias(product_drop: ProductDrop.new("foo"), raw_medias: [{}, {}], context: Context.new)
+  end
+  th.kill.join
+
+  :ok
+}
+
+# regression test for tracing attr_accessor methods.
+assert_equal "true", %q{
+    c = Class.new do
+      attr_accessor :x
+      alias y x
+      alias y= x=
+    end
+    obj = c.new
+
+    ar_meth = obj.method(:x)
+    aw_meth = obj.method(:x=)
+    aar_meth = obj.method(:y)
+    aaw_meth = obj.method(:y=)
+    events = []
+    trace = TracePoint.new(:c_call, :c_return){|tp|
+      next if tp.path != __FILE__
+      next if tp.method_id == :call
+      case tp.event
+      when :c_call
+        events << [tp.event, tp.method_id, tp.callee_id]
+      when :c_return
+        events << [tp.event, tp.method_id, tp.callee_id, tp.return_value]
+      end
+    }
+    test_proc = proc do
+      obj.x = 1
+      obj.x
+      obj.y = 2
+      obj.y
+      aw_meth.call(1)
+      ar_meth.call
+      aaw_meth.call(2)
+      aar_meth.call
+    end
+    test_proc.call # populate call caches
+    trace.enable(&test_proc)
+    expected = [
+      [:c_call, :x=, :x=],
+      [:c_return, :x=, :x=, 1],
+      [:c_call, :x, :x],
+      [:c_return, :x, :x, 1],
+      [:c_call, :x=, :y=],
+      [:c_return, :x=, :y=, 2],
+      [:c_call, :x, :y],
+      [:c_return, :x, :y, 2],
+    ] * 2
+
+    expected == events
+}
+
+# duphash
+assert_equal '{:foo=>123}', %q{
+  def foo
+    {foo: 123}
+  end
+
+  foo
+  foo
+}
+
+# newhash
+assert_equal '{:foo=>2}', %q{
+  def foo
+    {foo: 1+1}
+  end
+
+  foo
+  foo
+}
+
+# block invalidation edge case
+assert_equal 'undef', %q{
+  class A
+    def foo(arg)
+      arg.times { A.remove_method(:bar) }
+      self
+    end
+
+    def bar
+      4
+    end
+
+    def use(arg)
+      # two consecutive sends. When bar is removed, the return address
+      # for calling it is already on foo's control frame
+      foo(arg).bar
+    rescue NoMethodError
+      :undef
+    end
+  end
+
+  A.new.use 0
+  A.new.use 0
+  A.new.use 1
+}
+
+# block invalidation edge case
+assert_equal 'ok', %q{
+  class A
+    Good = :ng
+    def foo(arg)
+      arg.times { A.const_set(:Good, :ok) }
+      self
+    end
+
+    def id(arg)
+      arg
+    end
+
+    def use(arg)
+      # send followed by an opt_getinlinecache.
+      # The return address remains on the control frame
+      # when opt_getinlinecache is invalidated.
+      foo(arg).id(Good)
+    end
+  end
+
+  A.new.use 0
+  A.new.use 0
+  A.new.use 1
+}
+
+assert_equal 'ok', %q{
+  # test hitting a branch stub when out of memory
+  def nimai(jita)
+    if jita
+      :ng
+    else
+      :ok
+    end
+  end
+
+  nimai(true)
+  nimai(true)
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  nimai(false)
+}
+
+assert_equal 'new', %q{
+  # test block invalidation while out of memory
+  def foo
+    :old
+  end
+
+  def test
+    foo
+  end
+
+  def bar
+    :bar
+  end
+
+
+  test
+  test
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  # Old simulat_omm! leaves one byte of space and this fills it up
+  bar
+  bar
+
+  def foo
+    :new
+  end
+
+  test
+}
+
+assert_equal 'ok', %q{
+  # Try to compile new method while OOM
+  def foo
+    :ok
+  end
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  foo
+  foo
+}
+
+# struct aref embedded
+assert_equal '2', %q{
+  def foo(s)
+    s.foo
+  end
+
+  S = Struct.new(:foo)
+  foo(S.new(1))
+  foo(S.new(2))
+}
+
+# struct aref non-embedded
+assert_equal '4', %q{
+  def foo(s)
+    s.d
+  end
+
+  S = Struct.new(:a, :b, :c, :d, :e)
+  foo(S.new(1,2,3,4,5))
+  foo(S.new(1,2,3,4,5))
+}
+
+# struct aset embedded
+assert_equal '123', %q{
+  def foo(s)
+    s.foo = 123
+  end
+
+  s = Struct.new(:foo).new
+  foo(s)
+  s = Struct.new(:foo).new
+  foo(s)
+  s.foo
+}
+
+# struct aset non-embedded
+assert_equal '[1, 2, 3, 4, 5]', %q{
+  def foo(s)
+    s.a = 1
+    s.b = 2
+    s.c = 3
+    s.d = 4
+    s.e = 5
+  end
+
+  S = Struct.new(:a, :b, :c, :d, :e)
+  s = S.new
+  foo(s)
+  s = S.new
+  foo(s)
+  [s.a, s.b, s.c, s.d, s.e]
+}
+
+# struct aref too many args
+assert_equal 'ok', %q{
+  def foo(s)
+    s.foo(:bad)
+  end
+
+  s = Struct.new(:foo).new
+  foo(s) rescue :ok
+  foo(s) rescue :ok
+}
+
+# struct aset too many args
+assert_equal 'ok', %q{
+  def foo(s)
+    s.set_foo(123, :bad)
+  end
+
+  s = Struct.new(:foo) do
+    alias :set_foo :foo=
+  end
+  foo(s) rescue :ok
+  foo(s) rescue :ok
+}
+
+# File.join is a cfunc accepting variable arguments as a Ruby array (argc = -2)
+assert_equal 'foo/bar', %q{
+  def foo
+    File.join("foo", "bar")
+  end
+
+  foo
+  foo
+}
+
+# File.join is a cfunc accepting variable arguments as a Ruby array (argc = -2)
+assert_equal '', %q{
+  def foo
+    File.join()
+  end
+
+  foo
+  foo
+}
+
+# Make sure we're correctly reading RStruct's as.ary union for embedded RStructs
+assert_equal '3,12', %q{
+  pt_struct = Struct.new(:x, :y)
+  p = pt_struct.new(3, 12)
+  def pt_inspect(pt)
+    "#{pt.x},#{pt.y}"
+  end
+
+  # Make sure pt_inspect is JITted
+  10.times { pt_inspect(p) }
+
+  # Make sure it's returning '3,12' instead of e.g. '3,false'
+  pt_inspect(p)
+}
+
+# Regression test for deadlock between branch_stub_hit and ractor_receive_if
+assert_equal '10', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+    main << 4
+    main << 5
+    main << 6
+    main << 7
+    main << 8
+    main << 9
+    main << 10
+  end
+
+  a = []
+  a << Ractor.receive_if{|msg| msg == 10}
+  a << Ractor.receive_if{|msg| msg == 9}
+  a << Ractor.receive_if{|msg| msg == 8}
+  a << Ractor.receive_if{|msg| msg == 7}
+  a << Ractor.receive_if{|msg| msg == 6}
+  a << Ractor.receive_if{|msg| msg == 5}
+  a << Ractor.receive_if{|msg| msg == 4}
+  a << Ractor.receive_if{|msg| msg == 3}
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| msg == 1}
+
+  a.length
+}
+
+# checktype
+assert_equal 'false', %q{
+    def function()
+        [1, 2] in [Integer, String]
+    end
+    function()
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_ATTRSET)
+assert_equal 'foo', %q{
+    class Foo
+      attr_writer :foo
+
+      def foo()
+        self.foo = "foo"
+      end
+    end
+    foo = Foo.new
+    foo.foo
+}
+
+# anytostring, intern
+assert_equal 'true', %q{
+    def foo()
+      :"#{true}"
+    end
+    foo()
+}
+
+# toregexp, objtostring
+assert_equal '/true/', %q{
+    def foo()
+      /#{true}/
+    end
+    foo().inspect
+}
+
+# concatstrings, objtostring
+assert_equal '9001', %q{
+    def foo()
+      "#{9001}"
+    end
+    foo()
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_CFUNC)
+assert_equal 'nil', %q{
+    def foo
+      nil.inspect # argc: 0
+    end
+    foo
+}
+assert_equal '4', %q{
+    def foo
+      2.pow(2) # argc: 1
+    end
+    foo
+}
+assert_equal 'aba', %q{
+    def foo
+      "abc".tr("c", "a") # argc: 2
+    end
+    foo
+}
+assert_equal 'true', %q{
+    def foo
+      respond_to?(:inspect) # argc: -1
+    end
+    foo
+}
+assert_equal '["a", "b"]', %q{
+    def foo
+      "a\nb".lines(chomp: true) # kwargs
+    end
+    foo
+}
+
+# invokebuiltin
+assert_equal '123', %q{
+  def foo(obj)
+    obj.foo = 123
+  end
+
+  struct = Struct.new(:foo)
+  obj = struct.new
+  foo(obj)
+}
+
+# invokebuiltin_delegate
+assert_equal '.', %q{
+  def foo(path)
+    Dir.open(path).path
+  end
+  foo(".")
+}
+
+# opt_invokebuiltin_delegate_leave
+assert_equal '[0]', %q{"\x00".unpack("c")}
+
+# opt_send_without_block (VM_METHOD_TYPE_ISEQ)
+assert_equal '1', %q{
+  def foo = 1
+  def bar = foo
+  bar
+}
+assert_equal '[1, 2, 3]', %q{
+  def foo(a, b) = [1, a, b]
+  def bar = foo(2, 3)
+  bar
+}
+assert_equal '[1, 2, 3, 4, 5, 6]', %q{
+  def foo(a, b, c:, d:, e: 0, f: 6) = [a, b, c, d, e, f]
+  def bar = foo(1, 2, c: 3, d: 4, e: 5)
+  bar
+}
+assert_equal '[1, 2, 3, 4]', %q{
+  def foo(a, b = 2) = [a, b]
+  def bar = foo(1) + foo(3, 4)
+  bar
+}
+
+assert_equal '1', %q{
+  def foo(a) = a
+  def bar = foo(1) { 2 }
+  bar
+}
+assert_equal '[1, 2]', %q{
+  def foo(a, &block) = [a, block.call]
+  def bar = foo(1) { 2 }
+  bar
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_IVAR)
+assert_equal 'foo', %q{
+  class Foo
+    attr_reader :foo
+
+    def initialize
+      @foo = "foo"
+    end
+  end
+  Foo.new.foo
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_OPTIMIZED)
+assert_equal 'foo', %q{
+  Foo = Struct.new(:bar)
+  Foo.new("bar").bar = "foo"
+}
+assert_equal 'foo', %q{
+  Foo = Struct.new(:bar)
+  Foo.new("foo").bar
+}
+
+# getblockparamproxy
+assert_equal 'foo', %q{
+  def foo(&block)
+    block.call
+  end
+  foo { "foo" }
+}
+
+# getblockparam
+assert_equal 'foo', %q{
+  def foo(&block)
+    block
+  end
+  foo { "foo" }.call
+}
+
+assert_equal '[1, 2]', %q{
+  def foo
+    x = [2]
+    [1, *x]
+  end
+
+  foo
+  foo
+}
+
+# respond_to? with changing symbol
+assert_equal 'false', %q{
+  def foo(name)
+    :sym.respond_to?(name)
+  end
+  foo(:to_s)
+  foo(:to_s)
+  foo(:not_exist)
+}
+
+# respond_to? with method being defined
+assert_equal 'true', %q{
+  def foo
+    :sym.respond_to?(:not_yet_defined)
+  end
+  foo
+  foo
+  module Kernel
+    def not_yet_defined = true
+  end
+  foo
+}
+
+# respond_to? with undef method
+assert_equal 'false', %q{
+  module Kernel
+    def to_be_removed = true
+  end
+  def foo
+    :sym.respond_to?(:to_be_removed)
+  end
+  foo
+  foo
+  class Object
+    undef_method :to_be_removed
+  end
+  foo
+}
+
+# respond_to? with respond_to_missing?
+assert_equal 'true', %q{
+  class Foo
+  end
+  def foo(x)
+    x.respond_to?(:bar)
+  end
+  foo(Foo.new)
+  foo(Foo.new)
+  class Foo
+    def respond_to_missing?(*) = true
+  end
+  foo(Foo.new)
+}
+
+# bmethod
+assert_equal '[1, 2, 3]', %q{
+  one = 1
+  define_method(:foo) do
+    one
+  end
+
+  3.times.map { |i| foo + i }
+}
+
+# return inside bmethod
+assert_equal 'ok', %q{
+  define_method(:foo) do
+    1.tap { return :ok }
+  end
+
+  foo
+}
+
+# bmethod optional and keywords
+assert_equal '[[1, nil, 2]]', %q{
+  define_method(:opt_and_kwargs) do |a = {}, b: nil, c: nil|
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 2) }.uniq
+}
+
+# bmethod with forwarded block
+assert_equal '2', %q{
+  define_method(:foo) do |&block|
+    block.call
+  end
+
+  def bar(&block)
+    foo(&block)
+  end
+
+  bar { 1 }
+  bar { 2 }
+}
+
+# bmethod with forwarded block and arguments
+assert_equal '5', %q{
+  define_method(:foo) do |n, &block|
+    n + block.call
+  end
+
+  def bar(n, &block)
+    foo(n, &block)
+  end
+
+  bar(0) { 1 }
+  bar(3) { 2 }
+}
+
+# bmethod with forwarded unwanted block
+assert_equal '1', %q{
+  one = 1
+  define_method(:foo) do
+    one
+  end
+
+  def bar(&block)
+    foo(&block)
+  end
+
+  bar { }
+  bar { }
+}
+
+# test for return stub lifetime issue
+assert_equal '1', %q{
+  def foo(n)
+    if n == 2
+      return 1.times { Object.define_method(:foo) {} }
+    end
+
+    foo(n + 1)
+  end
+
+  foo(1)
+}
+
+# case-when with redefined ===
+assert_equal 'ok', %q{
+  class Symbol
+    def ===(a)
+      true
+    end
+  end
+
+  def cw(arg)
+    case arg
+    when :b
+      :ok
+    when 4
+      :ng
+    end
+  end
+
+  cw(4)
+}
+
+assert_normal_exit %{
+  class Bug20997
+    def foo(&) = self.class.name(&)
+
+    new.foo
+  end
+}
diff --git a/bootstraptest/test_yjit_30k_ifelse.rb b/bootstraptest/test_yjit_30k_ifelse.rb
new file mode 100644
index 0000000000..c3afa95e4d
--- /dev/null
+++ b/bootstraptest/test_yjit_30k_ifelse.rb
@@ -0,0 +1,241023 @@
+# This is a torture test for the JIT.
+# There are 30K tiny methods with if-else statements in a 30-deep call hierarchy.
+assert_equal '100000', %q{
+
+def fun_l0_n0(x)
+    if (x < 1)
+        fun_l1_n310(x)
+    else
+        fun_l1_n485(x)
+    end
+end
+
+def fun_l0_n1(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n418(x)
+    end
+end
+
+def fun_l0_n2(x)
+    if (x < 1)
+        fun_l1_n549(x)
+    else
+        fun_l1_n44(x)
+    end
+end
+
+def fun_l0_n3(x)
+    if (x < 1)
+        fun_l1_n394(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n4(x)
+    if (x < 1)
+        fun_l1_n683(x)
+    else
+        fun_l1_n547(x)
+    end
+end
+
+def fun_l0_n5(x)
+    if (x < 1)
+        fun_l1_n320(x)
+    else
+        fun_l1_n896(x)
+    end
+end
+
+def fun_l0_n6(x)
+    if (x < 1)
+        fun_l1_n649(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n7(x)
+    if (x < 1)
+        fun_l1_n100(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n8(x)
+    if (x < 1)
+        fun_l1_n839(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n9(x)
+    if (x < 1)
+        fun_l1_n177(x)
+    else
+        fun_l1_n555(x)
+    end
+end
+
+def fun_l0_n10(x)
+    if (x < 1)
+        fun_l1_n814(x)
+    else
+        fun_l1_n900(x)
+    end
+end
+
+def fun_l0_n11(x)
+    if (x < 1)
+        fun_l1_n585(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n12(x)
+    if (x < 1)
+        fun_l1_n952(x)
+    else
+        fun_l1_n270(x)
+    end
+end
+
+def fun_l0_n13(x)
+    if (x < 1)
+        fun_l1_n172(x)
+    else
+        fun_l1_n209(x)
+    end
+end
+
+def fun_l0_n14(x)
+    if (x < 1)
+        fun_l1_n514(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n15(x)
+    if (x < 1)
+        fun_l1_n190(x)
+    else
+        fun_l1_n100(x)
+    end
+end
+
+def fun_l0_n16(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n997(x)
+    end
+end
+
+def fun_l0_n17(x)
+    if (x < 1)
+        fun_l1_n568(x)
+    else
+        fun_l1_n820(x)
+    end
+end
+
+def fun_l0_n18(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n588(x)
+    end
+end
+
+def fun_l0_n19(x)
+    if (x < 1)
+        fun_l1_n206(x)
+    else
+        fun_l1_n126(x)
+    end
+end
+
+def fun_l0_n20(x)
+    if (x < 1)
+        fun_l1_n317(x)
+    else
+        fun_l1_n722(x)
+    end
+end
+
+def fun_l0_n21(x)
+    if (x < 1)
+        fun_l1_n614(x)
+    else
+        fun_l1_n372(x)
+    end
+end
+
+def fun_l0_n22(x)
+    if (x < 1)
+        fun_l1_n530(x)
+    else
+        fun_l1_n862(x)
+    end
+end
+
+def fun_l0_n23(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n24(x)
+    if (x < 1)
+        fun_l1_n996(x)
+    else
+        fun_l1_n717(x)
+    end
+end
+
+def fun_l0_n25(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n939(x)
+    end
+end
+
+def fun_l0_n26(x)
+    if (x < 1)
+        fun_l1_n316(x)
+    else
+        fun_l1_n293(x)
+    end
+end
+
+def fun_l0_n27(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n596(x)
+    end
+end
+
+def fun_l0_n28(x)
+    if (x < 1)
+        fun_l1_n743(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n29(x)
+    if (x < 1)
+        fun_l1_n896(x)
+    else
+        fun_l1_n247(x)
+    end
+end
+
+def fun_l0_n30(x)
+    if (x < 1)
+        fun_l1_n2(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n31(x)
+    if (x < 1)
+        fun_l1_n380(x)
+    else
+        fun_l1_n655(x)
+    end
+end
+
+def fun_l0_n32(x)
+    if (x < 1)
+        fun_l1_n572(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n33(x)
+    if (x < 1)
+        fun_l1_n485(x)
+    else
+        fun_l1_n282(x)
+    end
+end
+
+def fun_l0_n34(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n179(x)
+    end
+end
+
+def fun_l0_n35(x)
+    if (x < 1)
+        fun_l1_n281(x)
+    else
+        fun_l1_n572(x)
+    end
+end
+
+def fun_l0_n36(x)
+    if (x < 1)
+        fun_l1_n48(x)
+    else
+        fun_l1_n286(x)
+    end
+end
+
+def fun_l0_n37(x)
+    if (x < 1)
+        fun_l1_n539(x)
+    else
+        fun_l1_n86(x)
+    end
+end
+
+def fun_l0_n38(x)
+    if (x < 1)
+        fun_l1_n918(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n39(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n40(x)
+    if (x < 1)
+        fun_l1_n213(x)
+    else
+        fun_l1_n580(x)
+    end
+end
+
+def fun_l0_n41(x)
+    if (x < 1)
+        fun_l1_n413(x)
+    else
+        fun_l1_n793(x)
+    end
+end
+
+def fun_l0_n42(x)
+    if (x < 1)
+        fun_l1_n451(x)
+    else
+        fun_l1_n779(x)
+    end
+end
+
+def fun_l0_n43(x)
+    if (x < 1)
+        fun_l1_n118(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n44(x)
+    if (x < 1)
+        fun_l1_n162(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n45(x)
+    if (x < 1)
+        fun_l1_n157(x)
+    else
+        fun_l1_n280(x)
+    end
+end
+
+def fun_l0_n46(x)
+    if (x < 1)
+        fun_l1_n748(x)
+    else
+        fun_l1_n881(x)
+    end
+end
+
+def fun_l0_n47(x)
+    if (x < 1)
+        fun_l1_n529(x)
+    else
+        fun_l1_n732(x)
+    end
+end
+
+def fun_l0_n48(x)
+    if (x < 1)
+        fun_l1_n417(x)
+    else
+        fun_l1_n483(x)
+    end
+end
+
+def fun_l0_n49(x)
+    if (x < 1)
+        fun_l1_n743(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n50(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n309(x)
+    end
+end
+
+def fun_l0_n51(x)
+    if (x < 1)
+        fun_l1_n436(x)
+    else
+        fun_l1_n304(x)
+    end
+end
+
+def fun_l0_n52(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n590(x)
+    end
+end
+
+def fun_l0_n53(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n53(x)
+    end
+end
+
+def fun_l0_n54(x)
+    if (x < 1)
+        fun_l1_n807(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n55(x)
+    if (x < 1)
+        fun_l1_n607(x)
+    else
+        fun_l1_n609(x)
+    end
+end
+
+def fun_l0_n56(x)
+    if (x < 1)
+        fun_l1_n721(x)
+    else
+        fun_l1_n994(x)
+    end
+end
+
+def fun_l0_n57(x)
+    if (x < 1)
+        fun_l1_n472(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n58(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n954(x)
+    end
+end
+
+def fun_l0_n59(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n148(x)
+    end
+end
+
+def fun_l0_n60(x)
+    if (x < 1)
+        fun_l1_n761(x)
+    else
+        fun_l1_n40(x)
+    end
+end
+
+def fun_l0_n61(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n858(x)
+    end
+end
+
+def fun_l0_n62(x)
+    if (x < 1)
+        fun_l1_n114(x)
+    else
+        fun_l1_n767(x)
+    end
+end
+
+def fun_l0_n63(x)
+    if (x < 1)
+        fun_l1_n287(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n64(x)
+    if (x < 1)
+        fun_l1_n16(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n65(x)
+    if (x < 1)
+        fun_l1_n230(x)
+    else
+        fun_l1_n954(x)
+    end
+end
+
+def fun_l0_n66(x)
+    if (x < 1)
+        fun_l1_n98(x)
+    else
+        fun_l1_n320(x)
+    end
+end
+
+def fun_l0_n67(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n985(x)
+    end
+end
+
+def fun_l0_n68(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n648(x)
+    end
+end
+
+def fun_l0_n69(x)
+    if (x < 1)
+        fun_l1_n453(x)
+    else
+        fun_l1_n466(x)
+    end
+end
+
+def fun_l0_n70(x)
+    if (x < 1)
+        fun_l1_n787(x)
+    else
+        fun_l1_n802(x)
+    end
+end
+
+def fun_l0_n71(x)
+    if (x < 1)
+        fun_l1_n656(x)
+    else
+        fun_l1_n347(x)
+    end
+end
+
+def fun_l0_n72(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n336(x)
+    end
+end
+
+def fun_l0_n73(x)
+    if (x < 1)
+        fun_l1_n291(x)
+    else
+        fun_l1_n536(x)
+    end
+end
+
+def fun_l0_n74(x)
+    if (x < 1)
+        fun_l1_n795(x)
+    else
+        fun_l1_n606(x)
+    end
+end
+
+def fun_l0_n75(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n76(x)
+    if (x < 1)
+        fun_l1_n513(x)
+    else
+        fun_l1_n300(x)
+    end
+end
+
+def fun_l0_n77(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n78(x)
+    if (x < 1)
+        fun_l1_n712(x)
+    else
+        fun_l1_n906(x)
+    end
+end
+
+def fun_l0_n79(x)
+    if (x < 1)
+        fun_l1_n555(x)
+    else
+        fun_l1_n850(x)
+    end
+end
+
+def fun_l0_n80(x)
+    if (x < 1)
+        fun_l1_n320(x)
+    else
+        fun_l1_n892(x)
+    end
+end
+
+def fun_l0_n81(x)
+    if (x < 1)
+        fun_l1_n191(x)
+    else
+        fun_l1_n187(x)
+    end
+end
+
+def fun_l0_n82(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n83(x)
+    if (x < 1)
+        fun_l1_n314(x)
+    else
+        fun_l1_n697(x)
+    end
+end
+
+def fun_l0_n84(x)
+    if (x < 1)
+        fun_l1_n459(x)
+    else
+        fun_l1_n500(x)
+    end
+end
+
+def fun_l0_n85(x)
+    if (x < 1)
+        fun_l1_n912(x)
+    else
+        fun_l1_n992(x)
+    end
+end
+
+def fun_l0_n86(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n87(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n829(x)
+    end
+end
+
+def fun_l0_n88(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n799(x)
+    end
+end
+
+def fun_l0_n89(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n90(x)
+    if (x < 1)
+        fun_l1_n961(x)
+    else
+        fun_l1_n694(x)
+    end
+end
+
+def fun_l0_n91(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n848(x)
+    end
+end
+
+def fun_l0_n92(x)
+    if (x < 1)
+        fun_l1_n612(x)
+    else
+        fun_l1_n358(x)
+    end
+end
+
+def fun_l0_n93(x)
+    if (x < 1)
+        fun_l1_n148(x)
+    else
+        fun_l1_n312(x)
+    end
+end
+
+def fun_l0_n94(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n95(x)
+    if (x < 1)
+        fun_l1_n573(x)
+    else
+        fun_l1_n692(x)
+    end
+end
+
+def fun_l0_n96(x)
+    if (x < 1)
+        fun_l1_n66(x)
+    else
+        fun_l1_n936(x)
+    end
+end
+
+def fun_l0_n97(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n98(x)
+    if (x < 1)
+        fun_l1_n737(x)
+    else
+        fun_l1_n338(x)
+    end
+end
+
+def fun_l0_n99(x)
+    if (x < 1)
+        fun_l1_n335(x)
+    else
+        fun_l1_n739(x)
+    end
+end
+
+def fun_l0_n100(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n101(x)
+    if (x < 1)
+        fun_l1_n559(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n102(x)
+    if (x < 1)
+        fun_l1_n261(x)
+    else
+        fun_l1_n162(x)
+    end
+end
+
+def fun_l0_n103(x)
+    if (x < 1)
+        fun_l1_n400(x)
+    else
+        fun_l1_n156(x)
+    end
+end
+
+def fun_l0_n104(x)
+    if (x < 1)
+        fun_l1_n747(x)
+    else
+        fun_l1_n361(x)
+    end
+end
+
+def fun_l0_n105(x)
+    if (x < 1)
+        fun_l1_n717(x)
+    else
+        fun_l1_n522(x)
+    end
+end
+
+def fun_l0_n106(x)
+    if (x < 1)
+        fun_l1_n513(x)
+    else
+        fun_l1_n150(x)
+    end
+end
+
+def fun_l0_n107(x)
+    if (x < 1)
+        fun_l1_n710(x)
+    else
+        fun_l1_n602(x)
+    end
+end
+
+def fun_l0_n108(x)
+    if (x < 1)
+        fun_l1_n866(x)
+    else
+        fun_l1_n111(x)
+    end
+end
+
+def fun_l0_n109(x)
+    if (x < 1)
+        fun_l1_n725(x)
+    else
+        fun_l1_n448(x)
+    end
+end
+
+def fun_l0_n110(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n127(x)
+    end
+end
+
+def fun_l0_n111(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n666(x)
+    end
+end
+
+def fun_l0_n112(x)
+    if (x < 1)
+        fun_l1_n647(x)
+    else
+        fun_l1_n567(x)
+    end
+end
+
+def fun_l0_n113(x)
+    if (x < 1)
+        fun_l1_n543(x)
+    else
+        fun_l1_n992(x)
+    end
+end
+
+def fun_l0_n114(x)
+    if (x < 1)
+        fun_l1_n12(x)
+    else
+        fun_l1_n470(x)
+    end
+end
+
+def fun_l0_n115(x)
+    if (x < 1)
+        fun_l1_n25(x)
+    else
+        fun_l1_n917(x)
+    end
+end
+
+def fun_l0_n116(x)
+    if (x < 1)
+        fun_l1_n201(x)
+    else
+        fun_l1_n110(x)
+    end
+end
+
+def fun_l0_n117(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n118(x)
+    if (x < 1)
+        fun_l1_n990(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n119(x)
+    if (x < 1)
+        fun_l1_n712(x)
+    else
+        fun_l1_n5(x)
+    end
+end
+
+def fun_l0_n120(x)
+    if (x < 1)
+        fun_l1_n28(x)
+    else
+        fun_l1_n89(x)
+    end
+end
+
+def fun_l0_n121(x)
+    if (x < 1)
+        fun_l1_n341(x)
+    else
+        fun_l1_n983(x)
+    end
+end
+
+def fun_l0_n122(x)
+    if (x < 1)
+        fun_l1_n123(x)
+    else
+        fun_l1_n452(x)
+    end
+end
+
+def fun_l0_n123(x)
+    if (x < 1)
+        fun_l1_n514(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n124(x)
+    if (x < 1)
+        fun_l1_n280(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n125(x)
+    if (x < 1)
+        fun_l1_n512(x)
+    else
+        fun_l1_n772(x)
+    end
+end
+
+def fun_l0_n126(x)
+    if (x < 1)
+        fun_l1_n911(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n127(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n574(x)
+    end
+end
+
+def fun_l0_n128(x)
+    if (x < 1)
+        fun_l1_n318(x)
+    else
+        fun_l1_n266(x)
+    end
+end
+
+def fun_l0_n129(x)
+    if (x < 1)
+        fun_l1_n677(x)
+    else
+        fun_l1_n10(x)
+    end
+end
+
+def fun_l0_n130(x)
+    if (x < 1)
+        fun_l1_n994(x)
+    else
+        fun_l1_n48(x)
+    end
+end
+
+def fun_l0_n131(x)
+    if (x < 1)
+        fun_l1_n335(x)
+    else
+        fun_l1_n473(x)
+    end
+end
+
+def fun_l0_n132(x)
+    if (x < 1)
+        fun_l1_n641(x)
+    else
+        fun_l1_n48(x)
+    end
+end
+
+def fun_l0_n133(x)
+    if (x < 1)
+        fun_l1_n914(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n134(x)
+    if (x < 1)
+        fun_l1_n479(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n135(x)
+    if (x < 1)
+        fun_l1_n186(x)
+    else
+        fun_l1_n692(x)
+    end
+end
+
+def fun_l0_n136(x)
+    if (x < 1)
+        fun_l1_n325(x)
+    else
+        fun_l1_n279(x)
+    end
+end
+
+def fun_l0_n137(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n293(x)
+    end
+end
+
+def fun_l0_n138(x)
+    if (x < 1)
+        fun_l1_n788(x)
+    else
+        fun_l1_n364(x)
+    end
+end
+
+def fun_l0_n139(x)
+    if (x < 1)
+        fun_l1_n565(x)
+    else
+        fun_l1_n63(x)
+    end
+end
+
+def fun_l0_n140(x)
+    if (x < 1)
+        fun_l1_n128(x)
+    else
+        fun_l1_n299(x)
+    end
+end
+
+def fun_l0_n141(x)
+    if (x < 1)
+        fun_l1_n782(x)
+    else
+        fun_l1_n195(x)
+    end
+end
+
+def fun_l0_n142(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n117(x)
+    end
+end
+
+def fun_l0_n143(x)
+    if (x < 1)
+        fun_l1_n263(x)
+    else
+        fun_l1_n683(x)
+    end
+end
+
+def fun_l0_n144(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n92(x)
+    end
+end
+
+def fun_l0_n145(x)
+    if (x < 1)
+        fun_l1_n626(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n146(x)
+    if (x < 1)
+        fun_l1_n296(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n147(x)
+    if (x < 1)
+        fun_l1_n395(x)
+    else
+        fun_l1_n750(x)
+    end
+end
+
+def fun_l0_n148(x)
+    if (x < 1)
+        fun_l1_n164(x)
+    else
+        fun_l1_n580(x)
+    end
+end
+
+def fun_l0_n149(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n264(x)
+    end
+end
+
+def fun_l0_n150(x)
+    if (x < 1)
+        fun_l1_n383(x)
+    else
+        fun_l1_n558(x)
+    end
+end
+
+def fun_l0_n151(x)
+    if (x < 1)
+        fun_l1_n522(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n152(x)
+    if (x < 1)
+        fun_l1_n496(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n153(x)
+    if (x < 1)
+        fun_l1_n374(x)
+    else
+        fun_l1_n561(x)
+    end
+end
+
+def fun_l0_n154(x)
+    if (x < 1)
+        fun_l1_n314(x)
+    else
+        fun_l1_n368(x)
+    end
+end
+
+def fun_l0_n155(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n189(x)
+    end
+end
+
+def fun_l0_n156(x)
+    if (x < 1)
+        fun_l1_n46(x)
+    else
+        fun_l1_n620(x)
+    end
+end
+
+def fun_l0_n157(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n158(x)
+    if (x < 1)
+        fun_l1_n881(x)
+    else
+        fun_l1_n786(x)
+    end
+end
+
+def fun_l0_n159(x)
+    if (x < 1)
+        fun_l1_n607(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n160(x)
+    if (x < 1)
+        fun_l1_n824(x)
+    else
+        fun_l1_n415(x)
+    end
+end
+
+def fun_l0_n161(x)
+    if (x < 1)
+        fun_l1_n443(x)
+    else
+        fun_l1_n787(x)
+    end
+end
+
+def fun_l0_n162(x)
+    if (x < 1)
+        fun_l1_n124(x)
+    else
+        fun_l1_n529(x)
+    end
+end
+
+def fun_l0_n163(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n96(x)
+    end
+end
+
+def fun_l0_n164(x)
+    if (x < 1)
+        fun_l1_n775(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n165(x)
+    if (x < 1)
+        fun_l1_n860(x)
+    else
+        fun_l1_n212(x)
+    end
+end
+
+def fun_l0_n166(x)
+    if (x < 1)
+        fun_l1_n378(x)
+    else
+        fun_l1_n904(x)
+    end
+end
+
+def fun_l0_n167(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n640(x)
+    end
+end
+
+def fun_l0_n168(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n861(x)
+    end
+end
+
+def fun_l0_n169(x)
+    if (x < 1)
+        fun_l1_n468(x)
+    else
+        fun_l1_n586(x)
+    end
+end
+
+def fun_l0_n170(x)
+    if (x < 1)
+        fun_l1_n477(x)
+    else
+        fun_l1_n674(x)
+    end
+end
+
+def fun_l0_n171(x)
+    if (x < 1)
+        fun_l1_n509(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n172(x)
+    if (x < 1)
+        fun_l1_n612(x)
+    else
+        fun_l1_n828(x)
+    end
+end
+
+def fun_l0_n173(x)
+    if (x < 1)
+        fun_l1_n440(x)
+    else
+        fun_l1_n204(x)
+    end
+end
+
+def fun_l0_n174(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n947(x)
+    end
+end
+
+def fun_l0_n175(x)
+    if (x < 1)
+        fun_l1_n402(x)
+    else
+        fun_l1_n588(x)
+    end
+end
+
+def fun_l0_n176(x)
+    if (x < 1)
+        fun_l1_n245(x)
+    else
+        fun_l1_n540(x)
+    end
+end
+
+def fun_l0_n177(x)
+    if (x < 1)
+        fun_l1_n869(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n178(x)
+    if (x < 1)
+        fun_l1_n830(x)
+    else
+        fun_l1_n210(x)
+    end
+end
+
+def fun_l0_n179(x)
+    if (x < 1)
+        fun_l1_n692(x)
+    else
+        fun_l1_n222(x)
+    end
+end
+
+def fun_l0_n180(x)
+    if (x < 1)
+        fun_l1_n220(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n181(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n182(x)
+    if (x < 1)
+        fun_l1_n44(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l0_n183(x)
+    if (x < 1)
+        fun_l1_n944(x)
+    else
+        fun_l1_n230(x)
+    end
+end
+
+def fun_l0_n184(x)
+    if (x < 1)
+        fun_l1_n678(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n185(x)
+    if (x < 1)
+        fun_l1_n73(x)
+    else
+        fun_l1_n398(x)
+    end
+end
+
+def fun_l0_n186(x)
+    if (x < 1)
+        fun_l1_n121(x)
+    else
+        fun_l1_n689(x)
+    end
+end
+
+def fun_l0_n187(x)
+    if (x < 1)
+        fun_l1_n946(x)
+    else
+        fun_l1_n613(x)
+    end
+end
+
+def fun_l0_n188(x)
+    if (x < 1)
+        fun_l1_n987(x)
+    else
+        fun_l1_n785(x)
+    end
+end
+
+def fun_l0_n189(x)
+    if (x < 1)
+        fun_l1_n181(x)
+    else
+        fun_l1_n644(x)
+    end
+end
+
+def fun_l0_n190(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n679(x)
+    end
+end
+
+def fun_l0_n191(x)
+    if (x < 1)
+        fun_l1_n784(x)
+    else
+        fun_l1_n274(x)
+    end
+end
+
+def fun_l0_n192(x)
+    if (x < 1)
+        fun_l1_n71(x)
+    else
+        fun_l1_n773(x)
+    end
+end
+
+def fun_l0_n193(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n194(x)
+    if (x < 1)
+        fun_l1_n608(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n195(x)
+    if (x < 1)
+        fun_l1_n25(x)
+    else
+        fun_l1_n437(x)
+    end
+end
+
+def fun_l0_n196(x)
+    if (x < 1)
+        fun_l1_n410(x)
+    else
+        fun_l1_n674(x)
+    end
+end
+
+def fun_l0_n197(x)
+    if (x < 1)
+        fun_l1_n949(x)
+    else
+        fun_l1_n708(x)
+    end
+end
+
+def fun_l0_n198(x)
+    if (x < 1)
+        fun_l1_n714(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n199(x)
+    if (x < 1)
+        fun_l1_n41(x)
+    else
+        fun_l1_n865(x)
+    end
+end
+
+def fun_l0_n200(x)
+    if (x < 1)
+        fun_l1_n383(x)
+    else
+        fun_l1_n90(x)
+    end
+end
+
+def fun_l0_n201(x)
+    if (x < 1)
+        fun_l1_n581(x)
+    else
+        fun_l1_n273(x)
+    end
+end
+
+def fun_l0_n202(x)
+    if (x < 1)
+        fun_l1_n350(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n203(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n922(x)
+    end
+end
+
+def fun_l0_n204(x)
+    if (x < 1)
+        fun_l1_n448(x)
+    else
+        fun_l1_n741(x)
+    end
+end
+
+def fun_l0_n205(x)
+    if (x < 1)
+        fun_l1_n86(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n206(x)
+    if (x < 1)
+        fun_l1_n412(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n207(x)
+    if (x < 1)
+        fun_l1_n196(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n208(x)
+    if (x < 1)
+        fun_l1_n777(x)
+    else
+        fun_l1_n150(x)
+    end
+end
+
+def fun_l0_n209(x)
+    if (x < 1)
+        fun_l1_n20(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n210(x)
+    if (x < 1)
+        fun_l1_n934(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n211(x)
+    if (x < 1)
+        fun_l1_n803(x)
+    else
+        fun_l1_n636(x)
+    end
+end
+
+def fun_l0_n212(x)
+    if (x < 1)
+        fun_l1_n93(x)
+    else
+        fun_l1_n791(x)
+    end
+end
+
+def fun_l0_n213(x)
+    if (x < 1)
+        fun_l1_n76(x)
+    else
+        fun_l1_n172(x)
+    end
+end
+
+def fun_l0_n214(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n381(x)
+    end
+end
+
+def fun_l0_n215(x)
+    if (x < 1)
+        fun_l1_n433(x)
+    else
+        fun_l1_n349(x)
+    end
+end
+
+def fun_l0_n216(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n740(x)
+    end
+end
+
+def fun_l0_n217(x)
+    if (x < 1)
+        fun_l1_n927(x)
+    else
+        fun_l1_n886(x)
+    end
+end
+
+def fun_l0_n218(x)
+    if (x < 1)
+        fun_l1_n804(x)
+    else
+        fun_l1_n6(x)
+    end
+end
+
+def fun_l0_n219(x)
+    if (x < 1)
+        fun_l1_n921(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n220(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n224(x)
+    end
+end
+
+def fun_l0_n221(x)
+    if (x < 1)
+        fun_l1_n818(x)
+    else
+        fun_l1_n105(x)
+    end
+end
+
+def fun_l0_n222(x)
+    if (x < 1)
+        fun_l1_n162(x)
+    else
+        fun_l1_n700(x)
+    end
+end
+
+def fun_l0_n223(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n734(x)
+    end
+end
+
+def fun_l0_n224(x)
+    if (x < 1)
+        fun_l1_n283(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n225(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n363(x)
+    end
+end
+
+def fun_l0_n226(x)
+    if (x < 1)
+        fun_l1_n962(x)
+    else
+        fun_l1_n660(x)
+    end
+end
+
+def fun_l0_n227(x)
+    if (x < 1)
+        fun_l1_n255(x)
+    else
+        fun_l1_n536(x)
+    end
+end
+
+def fun_l0_n228(x)
+    if (x < 1)
+        fun_l1_n377(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n229(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n230(x)
+    if (x < 1)
+        fun_l1_n781(x)
+    else
+        fun_l1_n494(x)
+    end
+end
+
+def fun_l0_n231(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n967(x)
+    end
+end
+
+def fun_l0_n232(x)
+    if (x < 1)
+        fun_l1_n509(x)
+    else
+        fun_l1_n910(x)
+    end
+end
+
+def fun_l0_n233(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n5(x)
+    end
+end
+
+def fun_l0_n234(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n788(x)
+    end
+end
+
+def fun_l0_n235(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n705(x)
+    end
+end
+
+def fun_l0_n236(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n908(x)
+    end
+end
+
+def fun_l0_n237(x)
+    if (x < 1)
+        fun_l1_n329(x)
+    else
+        fun_l1_n2(x)
+    end
+end
+
+def fun_l0_n238(x)
+    if (x < 1)
+        fun_l1_n767(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n239(x)
+    if (x < 1)
+        fun_l1_n304(x)
+    else
+        fun_l1_n507(x)
+    end
+end
+
+def fun_l0_n240(x)
+    if (x < 1)
+        fun_l1_n845(x)
+    else
+        fun_l1_n777(x)
+    end
+end
+
+def fun_l0_n241(x)
+    if (x < 1)
+        fun_l1_n69(x)
+    else
+        fun_l1_n260(x)
+    end
+end
+
+def fun_l0_n242(x)
+    if (x < 1)
+        fun_l1_n194(x)
+    else
+        fun_l1_n412(x)
+    end
+end
+
+def fun_l0_n243(x)
+    if (x < 1)
+        fun_l1_n974(x)
+    else
+        fun_l1_n922(x)
+    end
+end
+
+def fun_l0_n244(x)
+    if (x < 1)
+        fun_l1_n532(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n245(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n656(x)
+    end
+end
+
+def fun_l0_n246(x)
+    if (x < 1)
+        fun_l1_n253(x)
+    else
+        fun_l1_n235(x)
+    end
+end
+
+def fun_l0_n247(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n775(x)
+    end
+end
+
+def fun_l0_n248(x)
+    if (x < 1)
+        fun_l1_n89(x)
+    else
+        fun_l1_n129(x)
+    end
+end
+
+def fun_l0_n249(x)
+    if (x < 1)
+        fun_l1_n284(x)
+    else
+        fun_l1_n642(x)
+    end
+end
+
+def fun_l0_n250(x)
+    if (x < 1)
+        fun_l1_n67(x)
+    else
+        fun_l1_n867(x)
+    end
+end
+
+def fun_l0_n251(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n442(x)
+    end
+end
+
+def fun_l0_n252(x)
+    if (x < 1)
+        fun_l1_n196(x)
+    else
+        fun_l1_n583(x)
+    end
+end
+
+def fun_l0_n253(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n254(x)
+    if (x < 1)
+        fun_l1_n984(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n255(x)
+    if (x < 1)
+        fun_l1_n941(x)
+    else
+        fun_l1_n744(x)
+    end
+end
+
+def fun_l0_n256(x)
+    if (x < 1)
+        fun_l1_n785(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n257(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n730(x)
+    end
+end
+
+def fun_l0_n258(x)
+    if (x < 1)
+        fun_l1_n453(x)
+    else
+        fun_l1_n641(x)
+    end
+end
+
+def fun_l0_n259(x)
+    if (x < 1)
+        fun_l1_n407(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n260(x)
+    if (x < 1)
+        fun_l1_n252(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n261(x)
+    if (x < 1)
+        fun_l1_n940(x)
+    else
+        fun_l1_n678(x)
+    end
+end
+
+def fun_l0_n262(x)
+    if (x < 1)
+        fun_l1_n350(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n263(x)
+    if (x < 1)
+        fun_l1_n688(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n264(x)
+    if (x < 1)
+        fun_l1_n366(x)
+    else
+        fun_l1_n790(x)
+    end
+end
+
+def fun_l0_n265(x)
+    if (x < 1)
+        fun_l1_n592(x)
+    else
+        fun_l1_n93(x)
+    end
+end
+
+def fun_l0_n266(x)
+    if (x < 1)
+        fun_l1_n189(x)
+    else
+        fun_l1_n467(x)
+    end
+end
+
+def fun_l0_n267(x)
+    if (x < 1)
+        fun_l1_n813(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n268(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n269(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n270(x)
+    if (x < 1)
+        fun_l1_n634(x)
+    else
+        fun_l1_n726(x)
+    end
+end
+
+def fun_l0_n271(x)
+    if (x < 1)
+        fun_l1_n192(x)
+    else
+        fun_l1_n468(x)
+    end
+end
+
+def fun_l0_n272(x)
+    if (x < 1)
+        fun_l1_n278(x)
+    else
+        fun_l1_n355(x)
+    end
+end
+
+def fun_l0_n273(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n274(x)
+    if (x < 1)
+        fun_l1_n643(x)
+    else
+        fun_l1_n806(x)
+    end
+end
+
+def fun_l0_n275(x)
+    if (x < 1)
+        fun_l1_n389(x)
+    else
+        fun_l1_n559(x)
+    end
+end
+
+def fun_l0_n276(x)
+    if (x < 1)
+        fun_l1_n283(x)
+    else
+        fun_l1_n539(x)
+    end
+end
+
+def fun_l0_n277(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n351(x)
+    end
+end
+
+def fun_l0_n278(x)
+    if (x < 1)
+        fun_l1_n813(x)
+    else
+        fun_l1_n513(x)
+    end
+end
+
+def fun_l0_n279(x)
+    if (x < 1)
+        fun_l1_n501(x)
+    else
+        fun_l1_n967(x)
+    end
+end
+
+def fun_l0_n280(x)
+    if (x < 1)
+        fun_l1_n727(x)
+    else
+        fun_l1_n232(x)
+    end
+end
+
+def fun_l0_n281(x)
+    if (x < 1)
+        fun_l1_n946(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n282(x)
+    if (x < 1)
+        fun_l1_n260(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n283(x)
+    if (x < 1)
+        fun_l1_n957(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n284(x)
+    if (x < 1)
+        fun_l1_n91(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n285(x)
+    if (x < 1)
+        fun_l1_n71(x)
+    else
+        fun_l1_n24(x)
+    end
+end
+
+def fun_l0_n286(x)
+    if (x < 1)
+        fun_l1_n594(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n287(x)
+    if (x < 1)
+        fun_l1_n869(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n288(x)
+    if (x < 1)
+        fun_l1_n182(x)
+    else
+        fun_l1_n835(x)
+    end
+end
+
+def fun_l0_n289(x)
+    if (x < 1)
+        fun_l1_n188(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n290(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n259(x)
+    end
+end
+
+def fun_l0_n291(x)
+    if (x < 1)
+        fun_l1_n593(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n292(x)
+    if (x < 1)
+        fun_l1_n680(x)
+    else
+        fun_l1_n564(x)
+    end
+end
+
+def fun_l0_n293(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n91(x)
+    end
+end
+
+def fun_l0_n294(x)
+    if (x < 1)
+        fun_l1_n945(x)
+    else
+        fun_l1_n807(x)
+    end
+end
+
+def fun_l0_n295(x)
+    if (x < 1)
+        fun_l1_n442(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n296(x)
+    if (x < 1)
+        fun_l1_n536(x)
+    else
+        fun_l1_n987(x)
+    end
+end
+
+def fun_l0_n297(x)
+    if (x < 1)
+        fun_l1_n519(x)
+    else
+        fun_l1_n657(x)
+    end
+end
+
+def fun_l0_n298(x)
+    if (x < 1)
+        fun_l1_n204(x)
+    else
+        fun_l1_n437(x)
+    end
+end
+
+def fun_l0_n299(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n385(x)
+    end
+end
+
+def fun_l0_n300(x)
+    if (x < 1)
+        fun_l1_n629(x)
+    else
+        fun_l1_n803(x)
+    end
+end
+
+def fun_l0_n301(x)
+    if (x < 1)
+        fun_l1_n576(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n302(x)
+    if (x < 1)
+        fun_l1_n466(x)
+    else
+        fun_l1_n475(x)
+    end
+end
+
+def fun_l0_n303(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n333(x)
+    end
+end
+
+def fun_l0_n304(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n749(x)
+    end
+end
+
+def fun_l0_n305(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n552(x)
+    end
+end
+
+def fun_l0_n306(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n958(x)
+    end
+end
+
+def fun_l0_n307(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n386(x)
+    end
+end
+
+def fun_l0_n308(x)
+    if (x < 1)
+        fun_l1_n831(x)
+    else
+        fun_l1_n176(x)
+    end
+end
+
+def fun_l0_n309(x)
+    if (x < 1)
+        fun_l1_n770(x)
+    else
+        fun_l1_n334(x)
+    end
+end
+
+def fun_l0_n310(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n643(x)
+    end
+end
+
+def fun_l0_n311(x)
+    if (x < 1)
+        fun_l1_n673(x)
+    else
+        fun_l1_n298(x)
+    end
+end
+
+def fun_l0_n312(x)
+    if (x < 1)
+        fun_l1_n753(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n313(x)
+    if (x < 1)
+        fun_l1_n299(x)
+    else
+        fun_l1_n350(x)
+    end
+end
+
+def fun_l0_n314(x)
+    if (x < 1)
+        fun_l1_n190(x)
+    else
+        fun_l1_n519(x)
+    end
+end
+
+def fun_l0_n315(x)
+    if (x < 1)
+        fun_l1_n934(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n316(x)
+    if (x < 1)
+        fun_l1_n695(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n317(x)
+    if (x < 1)
+        fun_l1_n194(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n318(x)
+    if (x < 1)
+        fun_l1_n145(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n319(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n237(x)
+    end
+end
+
+def fun_l0_n320(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n653(x)
+    end
+end
+
+def fun_l0_n321(x)
+    if (x < 1)
+        fun_l1_n216(x)
+    else
+        fun_l1_n67(x)
+    end
+end
+
+def fun_l0_n322(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n948(x)
+    end
+end
+
+def fun_l0_n323(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n324(x)
+    if (x < 1)
+        fun_l1_n533(x)
+    else
+        fun_l1_n252(x)
+    end
+end
+
+def fun_l0_n325(x)
+    if (x < 1)
+        fun_l1_n284(x)
+    else
+        fun_l1_n670(x)
+    end
+end
+
+def fun_l0_n326(x)
+    if (x < 1)
+        fun_l1_n327(x)
+    else
+        fun_l1_n298(x)
+    end
+end
+
+def fun_l0_n327(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n890(x)
+    end
+end
+
+def fun_l0_n328(x)
+    if (x < 1)
+        fun_l1_n941(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n329(x)
+    if (x < 1)
+        fun_l1_n859(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n330(x)
+    if (x < 1)
+        fun_l1_n282(x)
+    else
+        fun_l1_n569(x)
+    end
+end
+
+def fun_l0_n331(x)
+    if (x < 1)
+        fun_l1_n33(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n332(x)
+    if (x < 1)
+        fun_l1_n847(x)
+    else
+        fun_l1_n540(x)
+    end
+end
+
+def fun_l0_n333(x)
+    if (x < 1)
+        fun_l1_n485(x)
+    else
+        fun_l1_n756(x)
+    end
+end
+
+def fun_l0_n334(x)
+    if (x < 1)
+        fun_l1_n396(x)
+    else
+        fun_l1_n781(x)
+    end
+end
+
+def fun_l0_n335(x)
+    if (x < 1)
+        fun_l1_n225(x)
+    else
+        fun_l1_n417(x)
+    end
+end
+
+def fun_l0_n336(x)
+    if (x < 1)
+        fun_l1_n906(x)
+    else
+        fun_l1_n301(x)
+    end
+end
+
+def fun_l0_n337(x)
+    if (x < 1)
+        fun_l1_n863(x)
+    else
+        fun_l1_n409(x)
+    end
+end
+
+def fun_l0_n338(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n339(x)
+    if (x < 1)
+        fun_l1_n787(x)
+    else
+        fun_l1_n434(x)
+    end
+end
+
+def fun_l0_n340(x)
+    if (x < 1)
+        fun_l1_n308(x)
+    else
+        fun_l1_n875(x)
+    end
+end
+
+def fun_l0_n341(x)
+    if (x < 1)
+        fun_l1_n146(x)
+    else
+        fun_l1_n566(x)
+    end
+end
+
+def fun_l0_n342(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n770(x)
+    end
+end
+
+def fun_l0_n343(x)
+    if (x < 1)
+        fun_l1_n668(x)
+    else
+        fun_l1_n60(x)
+    end
+end
+
+def fun_l0_n344(x)
+    if (x < 1)
+        fun_l1_n305(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n345(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n920(x)
+    end
+end
+
+def fun_l0_n346(x)
+    if (x < 1)
+        fun_l1_n257(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n347(x)
+    if (x < 1)
+        fun_l1_n740(x)
+    else
+        fun_l1_n372(x)
+    end
+end
+
+def fun_l0_n348(x)
+    if (x < 1)
+        fun_l1_n698(x)
+    else
+        fun_l1_n63(x)
+    end
+end
+
+def fun_l0_n349(x)
+    if (x < 1)
+        fun_l1_n4(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n350(x)
+    if (x < 1)
+        fun_l1_n186(x)
+    else
+        fun_l1_n352(x)
+    end
+end
+
+def fun_l0_n351(x)
+    if (x < 1)
+        fun_l1_n619(x)
+    else
+        fun_l1_n583(x)
+    end
+end
+
+def fun_l0_n352(x)
+    if (x < 1)
+        fun_l1_n2(x)
+    else
+        fun_l1_n275(x)
+    end
+end
+
+def fun_l0_n353(x)
+    if (x < 1)
+        fun_l1_n843(x)
+    else
+        fun_l1_n986(x)
+    end
+end
+
+def fun_l0_n354(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n355(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n356(x)
+    if (x < 1)
+        fun_l1_n642(x)
+    else
+        fun_l1_n559(x)
+    end
+end
+
+def fun_l0_n357(x)
+    if (x < 1)
+        fun_l1_n385(x)
+    else
+        fun_l1_n532(x)
+    end
+end
+
+def fun_l0_n358(x)
+    if (x < 1)
+        fun_l1_n672(x)
+    else
+        fun_l1_n721(x)
+    end
+end
+
+def fun_l0_n359(x)
+    if (x < 1)
+        fun_l1_n663(x)
+    else
+        fun_l1_n590(x)
+    end
+end
+
+def fun_l0_n360(x)
+    if (x < 1)
+        fun_l1_n240(x)
+    else
+        fun_l1_n743(x)
+    end
+end
+
+def fun_l0_n361(x)
+    if (x < 1)
+        fun_l1_n301(x)
+    else
+        fun_l1_n943(x)
+    end
+end
+
+def fun_l0_n362(x)
+    if (x < 1)
+        fun_l1_n108(x)
+    else
+        fun_l1_n975(x)
+    end
+end
+
+def fun_l0_n363(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n364(x)
+    if (x < 1)
+        fun_l1_n360(x)
+    else
+        fun_l1_n821(x)
+    end
+end
+
+def fun_l0_n365(x)
+    if (x < 1)
+        fun_l1_n992(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n366(x)
+    if (x < 1)
+        fun_l1_n439(x)
+    else
+        fun_l1_n506(x)
+    end
+end
+
+def fun_l0_n367(x)
+    if (x < 1)
+        fun_l1_n229(x)
+    else
+        fun_l1_n714(x)
+    end
+end
+
+def fun_l0_n368(x)
+    if (x < 1)
+        fun_l1_n459(x)
+    else
+        fun_l1_n874(x)
+    end
+end
+
+def fun_l0_n369(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n406(x)
+    end
+end
+
+def fun_l0_n370(x)
+    if (x < 1)
+        fun_l1_n791(x)
+    else
+        fun_l1_n669(x)
+    end
+end
+
+def fun_l0_n371(x)
+    if (x < 1)
+        fun_l1_n99(x)
+    else
+        fun_l1_n344(x)
+    end
+end
+
+def fun_l0_n372(x)
+    if (x < 1)
+        fun_l1_n585(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n373(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n369(x)
+    end
+end
+
+def fun_l0_n374(x)
+    if (x < 1)
+        fun_l1_n41(x)
+    else
+        fun_l1_n378(x)
+    end
+end
+
+def fun_l0_n375(x)
+    if (x < 1)
+        fun_l1_n372(x)
+    else
+        fun_l1_n406(x)
+    end
+end
+
+def fun_l0_n376(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n563(x)
+    end
+end
+
+def fun_l0_n377(x)
+    if (x < 1)
+        fun_l1_n998(x)
+    else
+        fun_l1_n302(x)
+    end
+end
+
+def fun_l0_n378(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n333(x)
+    end
+end
+
+def fun_l0_n379(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n863(x)
+    end
+end
+
+def fun_l0_n380(x)
+    if (x < 1)
+        fun_l1_n248(x)
+    else
+        fun_l1_n297(x)
+    end
+end
+
+def fun_l0_n381(x)
+    if (x < 1)
+        fun_l1_n85(x)
+    else
+        fun_l1_n726(x)
+    end
+end
+
+def fun_l0_n382(x)
+    if (x < 1)
+        fun_l1_n75(x)
+    else
+        fun_l1_n990(x)
+    end
+end
+
+def fun_l0_n383(x)
+    if (x < 1)
+        fun_l1_n353(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n384(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n192(x)
+    end
+end
+
+def fun_l0_n385(x)
+    if (x < 1)
+        fun_l1_n659(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n386(x)
+    if (x < 1)
+        fun_l1_n528(x)
+    else
+        fun_l1_n654(x)
+    end
+end
+
+def fun_l0_n387(x)
+    if (x < 1)
+        fun_l1_n857(x)
+    else
+        fun_l1_n638(x)
+    end
+end
+
+def fun_l0_n388(x)
+    if (x < 1)
+        fun_l1_n311(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n389(x)
+    if (x < 1)
+        fun_l1_n406(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n390(x)
+    if (x < 1)
+        fun_l1_n464(x)
+    else
+        fun_l1_n684(x)
+    end
+end
+
+def fun_l0_n391(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n635(x)
+    end
+end
+
+def fun_l0_n392(x)
+    if (x < 1)
+        fun_l1_n863(x)
+    else
+        fun_l1_n486(x)
+    end
+end
+
+def fun_l0_n393(x)
+    if (x < 1)
+        fun_l1_n587(x)
+    else
+        fun_l1_n387(x)
+    end
+end
+
+def fun_l0_n394(x)
+    if (x < 1)
+        fun_l1_n553(x)
+    else
+        fun_l1_n789(x)
+    end
+end
+
+def fun_l0_n395(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n148(x)
+    end
+end
+
+def fun_l0_n396(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n845(x)
+    end
+end
+
+def fun_l0_n397(x)
+    if (x < 1)
+        fun_l1_n749(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n398(x)
+    if (x < 1)
+        fun_l1_n929(x)
+    else
+        fun_l1_n458(x)
+    end
+end
+
+def fun_l0_n399(x)
+    if (x < 1)
+        fun_l1_n908(x)
+    else
+        fun_l1_n188(x)
+    end
+end
+
+def fun_l0_n400(x)
+    if (x < 1)
+        fun_l1_n932(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n401(x)
+    if (x < 1)
+        fun_l1_n29(x)
+    else
+        fun_l1_n666(x)
+    end
+end
+
+def fun_l0_n402(x)
+    if (x < 1)
+        fun_l1_n877(x)
+    else
+        fun_l1_n518(x)
+    end
+end
+
+def fun_l0_n403(x)
+    if (x < 1)
+        fun_l1_n639(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n404(x)
+    if (x < 1)
+        fun_l1_n177(x)
+    else
+        fun_l1_n487(x)
+    end
+end
+
+def fun_l0_n405(x)
+    if (x < 1)
+        fun_l1_n536(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n406(x)
+    if (x < 1)
+        fun_l1_n626(x)
+    else
+        fun_l1_n894(x)
+    end
+end
+
+def fun_l0_n407(x)
+    if (x < 1)
+        fun_l1_n533(x)
+    else
+        fun_l1_n367(x)
+    end
+end
+
+def fun_l0_n408(x)
+    if (x < 1)
+        fun_l1_n146(x)
+    else
+        fun_l1_n546(x)
+    end
+end
+
+def fun_l0_n409(x)
+    if (x < 1)
+        fun_l1_n872(x)
+    else
+        fun_l1_n387(x)
+    end
+end
+
+def fun_l0_n410(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n973(x)
+    end
+end
+
+def fun_l0_n411(x)
+    if (x < 1)
+        fun_l1_n168(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n412(x)
+    if (x < 1)
+        fun_l1_n895(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n413(x)
+    if (x < 1)
+        fun_l1_n235(x)
+    else
+        fun_l1_n593(x)
+    end
+end
+
+def fun_l0_n414(x)
+    if (x < 1)
+        fun_l1_n328(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n415(x)
+    if (x < 1)
+        fun_l1_n882(x)
+    else
+        fun_l1_n290(x)
+    end
+end
+
+def fun_l0_n416(x)
+    if (x < 1)
+        fun_l1_n433(x)
+    else
+        fun_l1_n220(x)
+    end
+end
+
+def fun_l0_n417(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n74(x)
+    end
+end
+
+def fun_l0_n418(x)
+    if (x < 1)
+        fun_l1_n750(x)
+    else
+        fun_l1_n547(x)
+    end
+end
+
+def fun_l0_n419(x)
+    if (x < 1)
+        fun_l1_n94(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n420(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n421(x)
+    if (x < 1)
+        fun_l1_n663(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n422(x)
+    if (x < 1)
+        fun_l1_n686(x)
+    else
+        fun_l1_n67(x)
+    end
+end
+
+def fun_l0_n423(x)
+    if (x < 1)
+        fun_l1_n210(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n424(x)
+    if (x < 1)
+        fun_l1_n375(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n425(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n426(x)
+    if (x < 1)
+        fun_l1_n819(x)
+    else
+        fun_l1_n601(x)
+    end
+end
+
+def fun_l0_n427(x)
+    if (x < 1)
+        fun_l1_n588(x)
+    else
+        fun_l1_n875(x)
+    end
+end
+
+def fun_l0_n428(x)
+    if (x < 1)
+        fun_l1_n682(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n429(x)
+    if (x < 1)
+        fun_l1_n972(x)
+    else
+        fun_l1_n891(x)
+    end
+end
+
+def fun_l0_n430(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n655(x)
+    end
+end
+
+def fun_l0_n431(x)
+    if (x < 1)
+        fun_l1_n393(x)
+    else
+        fun_l1_n454(x)
+    end
+end
+
+def fun_l0_n432(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n433(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n246(x)
+    end
+end
+
+def fun_l0_n434(x)
+    if (x < 1)
+        fun_l1_n216(x)
+    else
+        fun_l1_n78(x)
+    end
+end
+
+def fun_l0_n435(x)
+    if (x < 1)
+        fun_l1_n357(x)
+    else
+        fun_l1_n61(x)
+    end
+end
+
+def fun_l0_n436(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n507(x)
+    end
+end
+
+def fun_l0_n437(x)
+    if (x < 1)
+        fun_l1_n182(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n438(x)
+    if (x < 1)
+        fun_l1_n69(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n439(x)
+    if (x < 1)
+        fun_l1_n275(x)
+    else
+        fun_l1_n723(x)
+    end
+end
+
+def fun_l0_n440(x)
+    if (x < 1)
+        fun_l1_n469(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n441(x)
+    if (x < 1)
+        fun_l1_n595(x)
+    else
+        fun_l1_n624(x)
+    end
+end
+
+def fun_l0_n442(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n896(x)
+    end
+end
+
+def fun_l0_n443(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n503(x)
+    end
+end
+
+def fun_l0_n444(x)
+    if (x < 1)
+        fun_l1_n875(x)
+    else
+        fun_l1_n110(x)
+    end
+end
+
+def fun_l0_n445(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n154(x)
+    end
+end
+
+def fun_l0_n446(x)
+    if (x < 1)
+        fun_l1_n538(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n447(x)
+    if (x < 1)
+        fun_l1_n183(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n448(x)
+    if (x < 1)
+        fun_l1_n680(x)
+    else
+        fun_l1_n93(x)
+    end
+end
+
+def fun_l0_n449(x)
+    if (x < 1)
+        fun_l1_n147(x)
+    else
+        fun_l1_n924(x)
+    end
+end
+
+def fun_l0_n450(x)
+    if (x < 1)
+        fun_l1_n702(x)
+    else
+        fun_l1_n830(x)
+    end
+end
+
+def fun_l0_n451(x)
+    if (x < 1)
+        fun_l1_n750(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n452(x)
+    if (x < 1)
+        fun_l1_n520(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n453(x)
+    if (x < 1)
+        fun_l1_n132(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n454(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n455(x)
+    if (x < 1)
+        fun_l1_n180(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n456(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n487(x)
+    end
+end
+
+def fun_l0_n457(x)
+    if (x < 1)
+        fun_l1_n276(x)
+    else
+        fun_l1_n528(x)
+    end
+end
+
+def fun_l0_n458(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n459(x)
+    if (x < 1)
+        fun_l1_n986(x)
+    else
+        fun_l1_n552(x)
+    end
+end
+
+def fun_l0_n460(x)
+    if (x < 1)
+        fun_l1_n874(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n461(x)
+    if (x < 1)
+        fun_l1_n524(x)
+    else
+        fun_l1_n335(x)
+    end
+end
+
+def fun_l0_n462(x)
+    if (x < 1)
+        fun_l1_n471(x)
+    else
+        fun_l1_n578(x)
+    end
+end
+
+def fun_l0_n463(x)
+    if (x < 1)
+        fun_l1_n173(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n464(x)
+    if (x < 1)
+        fun_l1_n872(x)
+    else
+        fun_l1_n745(x)
+    end
+end
+
+def fun_l0_n465(x)
+    if (x < 1)
+        fun_l1_n387(x)
+    else
+        fun_l1_n776(x)
+    end
+end
+
+def fun_l0_n466(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n428(x)
+    end
+end
+
+def fun_l0_n467(x)
+    if (x < 1)
+        fun_l1_n416(x)
+    else
+        fun_l1_n738(x)
+    end
+end
+
+def fun_l0_n468(x)
+    if (x < 1)
+        fun_l1_n762(x)
+    else
+        fun_l1_n694(x)
+    end
+end
+
+def fun_l0_n469(x)
+    if (x < 1)
+        fun_l1_n27(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n470(x)
+    if (x < 1)
+        fun_l1_n12(x)
+    else
+        fun_l1_n812(x)
+    end
+end
+
+def fun_l0_n471(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n472(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n39(x)
+    end
+end
+
+def fun_l0_n473(x)
+    if (x < 1)
+        fun_l1_n309(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n474(x)
+    if (x < 1)
+        fun_l1_n828(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n475(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n476(x)
+    if (x < 1)
+        fun_l1_n818(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n477(x)
+    if (x < 1)
+        fun_l1_n88(x)
+    else
+        fun_l1_n73(x)
+    end
+end
+
+def fun_l0_n478(x)
+    if (x < 1)
+        fun_l1_n709(x)
+    else
+        fun_l1_n680(x)
+    end
+end
+
+def fun_l0_n479(x)
+    if (x < 1)
+        fun_l1_n271(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n480(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n481(x)
+    if (x < 1)
+        fun_l1_n642(x)
+    else
+        fun_l1_n221(x)
+    end
+end
+
+def fun_l0_n482(x)
+    if (x < 1)
+        fun_l1_n838(x)
+    else
+        fun_l1_n345(x)
+    end
+end
+
+def fun_l0_n483(x)
+    if (x < 1)
+        fun_l1_n411(x)
+    else
+        fun_l1_n266(x)
+    end
+end
+
+def fun_l0_n484(x)
+    if (x < 1)
+        fun_l1_n916(x)
+    else
+        fun_l1_n791(x)
+    end
+end
+
+def fun_l0_n485(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n68(x)
+    end
+end
+
+def fun_l0_n486(x)
+    if (x < 1)
+        fun_l1_n834(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n487(x)
+    if (x < 1)
+        fun_l1_n398(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n488(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n167(x)
+    end
+end
+
+def fun_l0_n489(x)
+    if (x < 1)
+        fun_l1_n54(x)
+    else
+        fun_l1_n28(x)
+    end
+end
+
+def fun_l0_n490(x)
+    if (x < 1)
+        fun_l1_n24(x)
+    else
+        fun_l1_n9(x)
+    end
+end
+
+def fun_l0_n491(x)
+    if (x < 1)
+        fun_l1_n497(x)
+    else
+        fun_l1_n297(x)
+    end
+end
+
+def fun_l0_n492(x)
+    if (x < 1)
+        fun_l1_n951(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n493(x)
+    if (x < 1)
+        fun_l1_n213(x)
+    else
+        fun_l1_n808(x)
+    end
+end
+
+def fun_l0_n494(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n495(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n496(x)
+    if (x < 1)
+        fun_l1_n45(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n497(x)
+    if (x < 1)
+        fun_l1_n482(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n498(x)
+    if (x < 1)
+        fun_l1_n78(x)
+    else
+        fun_l1_n785(x)
+    end
+end
+
+def fun_l0_n499(x)
+    if (x < 1)
+        fun_l1_n174(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n500(x)
+    if (x < 1)
+        fun_l1_n608(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n501(x)
+    if (x < 1)
+        fun_l1_n157(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n502(x)
+    if (x < 1)
+        fun_l1_n823(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n503(x)
+    if (x < 1)
+        fun_l1_n13(x)
+    else
+        fun_l1_n502(x)
+    end
+end
+
+def fun_l0_n504(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n505(x)
+    if (x < 1)
+        fun_l1_n503(x)
+    else
+        fun_l1_n974(x)
+    end
+end
+
+def fun_l0_n506(x)
+    if (x < 1)
+        fun_l1_n893(x)
+    else
+        fun_l1_n582(x)
+    end
+end
+
+def fun_l0_n507(x)
+    if (x < 1)
+        fun_l1_n403(x)
+    else
+        fun_l1_n228(x)
+    end
+end
+
+def fun_l0_n508(x)
+    if (x < 1)
+        fun_l1_n640(x)
+    else
+        fun_l1_n362(x)
+    end
+end
+
+def fun_l0_n509(x)
+    if (x < 1)
+        fun_l1_n629(x)
+    else
+        fun_l1_n824(x)
+    end
+end
+
+def fun_l0_n510(x)
+    if (x < 1)
+        fun_l1_n84(x)
+    else
+        fun_l1_n330(x)
+    end
+end
+
+def fun_l0_n511(x)
+    if (x < 1)
+        fun_l1_n91(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n512(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n126(x)
+    end
+end
+
+def fun_l0_n513(x)
+    if (x < 1)
+        fun_l1_n905(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n514(x)
+    if (x < 1)
+        fun_l1_n766(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n515(x)
+    if (x < 1)
+        fun_l1_n798(x)
+    else
+        fun_l1_n698(x)
+    end
+end
+
+def fun_l0_n516(x)
+    if (x < 1)
+        fun_l1_n124(x)
+    else
+        fun_l1_n356(x)
+    end
+end
+
+def fun_l0_n517(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n518(x)
+    if (x < 1)
+        fun_l1_n483(x)
+    else
+        fun_l1_n586(x)
+    end
+end
+
+def fun_l0_n519(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n37(x)
+    end
+end
+
+def fun_l0_n520(x)
+    if (x < 1)
+        fun_l1_n48(x)
+    else
+        fun_l1_n216(x)
+    end
+end
+
+def fun_l0_n521(x)
+    if (x < 1)
+        fun_l1_n805(x)
+    else
+        fun_l1_n846(x)
+    end
+end
+
+def fun_l0_n522(x)
+    if (x < 1)
+        fun_l1_n422(x)
+    else
+        fun_l1_n190(x)
+    end
+end
+
+def fun_l0_n523(x)
+    if (x < 1)
+        fun_l1_n168(x)
+    else
+        fun_l1_n272(x)
+    end
+end
+
+def fun_l0_n524(x)
+    if (x < 1)
+        fun_l1_n766(x)
+    else
+        fun_l1_n125(x)
+    end
+end
+
+def fun_l0_n525(x)
+    if (x < 1)
+        fun_l1_n56(x)
+    else
+        fun_l1_n224(x)
+    end
+end
+
+def fun_l0_n526(x)
+    if (x < 1)
+        fun_l1_n540(x)
+    else
+        fun_l1_n303(x)
+    end
+end
+
+def fun_l0_n527(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n955(x)
+    end
+end
+
+def fun_l0_n528(x)
+    if (x < 1)
+        fun_l1_n571(x)
+    else
+        fun_l1_n640(x)
+    end
+end
+
+def fun_l0_n529(x)
+    if (x < 1)
+        fun_l1_n650(x)
+    else
+        fun_l1_n107(x)
+    end
+end
+
+def fun_l0_n530(x)
+    if (x < 1)
+        fun_l1_n240(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n531(x)
+    if (x < 1)
+        fun_l1_n975(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n532(x)
+    if (x < 1)
+        fun_l1_n753(x)
+    else
+        fun_l1_n147(x)
+    end
+end
+
+def fun_l0_n533(x)
+    if (x < 1)
+        fun_l1_n269(x)
+    else
+        fun_l1_n292(x)
+    end
+end
+
+def fun_l0_n534(x)
+    if (x < 1)
+        fun_l1_n791(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n535(x)
+    if (x < 1)
+        fun_l1_n469(x)
+    else
+        fun_l1_n58(x)
+    end
+end
+
+def fun_l0_n536(x)
+    if (x < 1)
+        fun_l1_n526(x)
+    else
+        fun_l1_n265(x)
+    end
+end
+
+def fun_l0_n537(x)
+    if (x < 1)
+        fun_l1_n681(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n538(x)
+    if (x < 1)
+        fun_l1_n377(x)
+    else
+        fun_l1_n969(x)
+    end
+end
+
+def fun_l0_n539(x)
+    if (x < 1)
+        fun_l1_n935(x)
+    else
+        fun_l1_n556(x)
+    end
+end
+
+def fun_l0_n540(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n541(x)
+    if (x < 1)
+        fun_l1_n451(x)
+    else
+        fun_l1_n35(x)
+    end
+end
+
+def fun_l0_n542(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n795(x)
+    end
+end
+
+def fun_l0_n543(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n544(x)
+    if (x < 1)
+        fun_l1_n176(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n545(x)
+    if (x < 1)
+        fun_l1_n34(x)
+    else
+        fun_l1_n989(x)
+    end
+end
+
+def fun_l0_n546(x)
+    if (x < 1)
+        fun_l1_n534(x)
+    else
+        fun_l1_n705(x)
+    end
+end
+
+def fun_l0_n547(x)
+    if (x < 1)
+        fun_l1_n997(x)
+    else
+        fun_l1_n883(x)
+    end
+end
+
+def fun_l0_n548(x)
+    if (x < 1)
+        fun_l1_n379(x)
+    else
+        fun_l1_n33(x)
+    end
+end
+
+def fun_l0_n549(x)
+    if (x < 1)
+        fun_l1_n454(x)
+    else
+        fun_l1_n516(x)
+    end
+end
+
+def fun_l0_n550(x)
+    if (x < 1)
+        fun_l1_n678(x)
+    else
+        fun_l1_n652(x)
+    end
+end
+
+def fun_l0_n551(x)
+    if (x < 1)
+        fun_l1_n13(x)
+    else
+        fun_l1_n864(x)
+    end
+end
+
+def fun_l0_n552(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n553(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n703(x)
+    end
+end
+
+def fun_l0_n554(x)
+    if (x < 1)
+        fun_l1_n306(x)
+    else
+        fun_l1_n24(x)
+    end
+end
+
+def fun_l0_n555(x)
+    if (x < 1)
+        fun_l1_n110(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n556(x)
+    if (x < 1)
+        fun_l1_n367(x)
+    else
+        fun_l1_n117(x)
+    end
+end
+
+def fun_l0_n557(x)
+    if (x < 1)
+        fun_l1_n967(x)
+    else
+        fun_l1_n662(x)
+    end
+end
+
+def fun_l0_n558(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n47(x)
+    end
+end
+
+def fun_l0_n559(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n344(x)
+    end
+end
+
+def fun_l0_n560(x)
+    if (x < 1)
+        fun_l1_n835(x)
+    else
+        fun_l1_n577(x)
+    end
+end
+
+def fun_l0_n561(x)
+    if (x < 1)
+        fun_l1_n393(x)
+    else
+        fun_l1_n419(x)
+    end
+end
+
+def fun_l0_n562(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n630(x)
+    end
+end
+
+def fun_l0_n563(x)
+    if (x < 1)
+        fun_l1_n9(x)
+    else
+        fun_l1_n109(x)
+    end
+end
+
+def fun_l0_n564(x)
+    if (x < 1)
+        fun_l1_n65(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n565(x)
+    if (x < 1)
+        fun_l1_n156(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n566(x)
+    if (x < 1)
+        fun_l1_n88(x)
+    else
+        fun_l1_n743(x)
+    end
+end
+
+def fun_l0_n567(x)
+    if (x < 1)
+        fun_l1_n92(x)
+    else
+        fun_l1_n27(x)
+    end
+end
+
+def fun_l0_n568(x)
+    if (x < 1)
+        fun_l1_n462(x)
+    else
+        fun_l1_n988(x)
+    end
+end
+
+def fun_l0_n569(x)
+    if (x < 1)
+        fun_l1_n241(x)
+    else
+        fun_l1_n199(x)
+    end
+end
+
+def fun_l0_n570(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n571(x)
+    if (x < 1)
+        fun_l1_n412(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n572(x)
+    if (x < 1)
+        fun_l1_n100(x)
+    else
+        fun_l1_n270(x)
+    end
+end
+
+def fun_l0_n573(x)
+    if (x < 1)
+        fun_l1_n326(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n574(x)
+    if (x < 1)
+        fun_l1_n151(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n575(x)
+    if (x < 1)
+        fun_l1_n322(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n576(x)
+    if (x < 1)
+        fun_l1_n995(x)
+    else
+        fun_l1_n658(x)
+    end
+end
+
+def fun_l0_n577(x)
+    if (x < 1)
+        fun_l1_n193(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n578(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n517(x)
+    end
+end
+
+def fun_l0_n579(x)
+    if (x < 1)
+        fun_l1_n885(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n580(x)
+    if (x < 1)
+        fun_l1_n789(x)
+    else
+        fun_l1_n711(x)
+    end
+end
+
+def fun_l0_n581(x)
+    if (x < 1)
+        fun_l1_n848(x)
+    else
+        fun_l1_n321(x)
+    end
+end
+
+def fun_l0_n582(x)
+    if (x < 1)
+        fun_l1_n389(x)
+    else
+        fun_l1_n360(x)
+    end
+end
+
+def fun_l0_n583(x)
+    if (x < 1)
+        fun_l1_n319(x)
+    else
+        fun_l1_n972(x)
+    end
+end
+
+def fun_l0_n584(x)
+    if (x < 1)
+        fun_l1_n421(x)
+    else
+        fun_l1_n659(x)
+    end
+end
+
+def fun_l0_n585(x)
+    if (x < 1)
+        fun_l1_n462(x)
+    else
+        fun_l1_n302(x)
+    end
+end
+
+def fun_l0_n586(x)
+    if (x < 1)
+        fun_l1_n122(x)
+    else
+        fun_l1_n50(x)
+    end
+end
+
+def fun_l0_n587(x)
+    if (x < 1)
+        fun_l1_n795(x)
+    else
+        fun_l1_n622(x)
+    end
+end
+
+def fun_l0_n588(x)
+    if (x < 1)
+        fun_l1_n719(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n589(x)
+    if (x < 1)
+        fun_l1_n916(x)
+    else
+        fun_l1_n925(x)
+    end
+end
+
+def fun_l0_n590(x)
+    if (x < 1)
+        fun_l1_n541(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n591(x)
+    if (x < 1)
+        fun_l1_n610(x)
+    else
+        fun_l1_n509(x)
+    end
+end
+
+def fun_l0_n592(x)
+    if (x < 1)
+        fun_l1_n217(x)
+    else
+        fun_l1_n452(x)
+    end
+end
+
+def fun_l0_n593(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n888(x)
+    end
+end
+
+def fun_l0_n594(x)
+    if (x < 1)
+        fun_l1_n987(x)
+    else
+        fun_l1_n462(x)
+    end
+end
+
+def fun_l0_n595(x)
+    if (x < 1)
+        fun_l1_n571(x)
+    else
+        fun_l1_n429(x)
+    end
+end
+
+def fun_l0_n596(x)
+    if (x < 1)
+        fun_l1_n751(x)
+    else
+        fun_l1_n773(x)
+    end
+end
+
+def fun_l0_n597(x)
+    if (x < 1)
+        fun_l1_n181(x)
+    else
+        fun_l1_n340(x)
+    end
+end
+
+def fun_l0_n598(x)
+    if (x < 1)
+        fun_l1_n6(x)
+    else
+        fun_l1_n39(x)
+    end
+end
+
+def fun_l0_n599(x)
+    if (x < 1)
+        fun_l1_n814(x)
+    else
+        fun_l1_n320(x)
+    end
+end
+
+def fun_l0_n600(x)
+    if (x < 1)
+        fun_l1_n931(x)
+    else
+        fun_l1_n535(x)
+    end
+end
+
+def fun_l0_n601(x)
+    if (x < 1)
+        fun_l1_n99(x)
+    else
+        fun_l1_n154(x)
+    end
+end
+
+def fun_l0_n602(x)
+    if (x < 1)
+        fun_l1_n981(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n603(x)
+    if (x < 1)
+        fun_l1_n975(x)
+    else
+        fun_l1_n364(x)
+    end
+end
+
+def fun_l0_n604(x)
+    if (x < 1)
+        fun_l1_n112(x)
+    else
+        fun_l1_n226(x)
+    end
+end
+
+def fun_l0_n605(x)
+    if (x < 1)
+        fun_l1_n995(x)
+    else
+        fun_l1_n95(x)
+    end
+end
+
+def fun_l0_n606(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n77(x)
+    end
+end
+
+def fun_l0_n607(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n957(x)
+    end
+end
+
+def fun_l0_n608(x)
+    if (x < 1)
+        fun_l1_n844(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n609(x)
+    if (x < 1)
+        fun_l1_n861(x)
+    else
+        fun_l1_n74(x)
+    end
+end
+
+def fun_l0_n610(x)
+    if (x < 1)
+        fun_l1_n521(x)
+    else
+        fun_l1_n46(x)
+    end
+end
+
+def fun_l0_n611(x)
+    if (x < 1)
+        fun_l1_n258(x)
+    else
+        fun_l1_n208(x)
+    end
+end
+
+def fun_l0_n612(x)
+    if (x < 1)
+        fun_l1_n620(x)
+    else
+        fun_l1_n427(x)
+    end
+end
+
+def fun_l0_n613(x)
+    if (x < 1)
+        fun_l1_n583(x)
+    else
+        fun_l1_n400(x)
+    end
+end
+
+def fun_l0_n614(x)
+    if (x < 1)
+        fun_l1_n933(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n615(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n879(x)
+    end
+end
+
+def fun_l0_n616(x)
+    if (x < 1)
+        fun_l1_n715(x)
+    else
+        fun_l1_n862(x)
+    end
+end
+
+def fun_l0_n617(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n285(x)
+    end
+end
+
+def fun_l0_n618(x)
+    if (x < 1)
+        fun_l1_n458(x)
+    else
+        fun_l1_n217(x)
+    end
+end
+
+def fun_l0_n619(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n405(x)
+    end
+end
+
+def fun_l0_n620(x)
+    if (x < 1)
+        fun_l1_n470(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n621(x)
+    if (x < 1)
+        fun_l1_n755(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n622(x)
+    if (x < 1)
+        fun_l1_n426(x)
+    else
+        fun_l1_n737(x)
+    end
+end
+
+def fun_l0_n623(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n55(x)
+    end
+end
+
+def fun_l0_n624(x)
+    if (x < 1)
+        fun_l1_n437(x)
+    else
+        fun_l1_n79(x)
+    end
+end
+
+def fun_l0_n625(x)
+    if (x < 1)
+        fun_l1_n691(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n626(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n585(x)
+    end
+end
+
+def fun_l0_n627(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n628(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n744(x)
+    end
+end
+
+def fun_l0_n629(x)
+    if (x < 1)
+        fun_l1_n40(x)
+    else
+        fun_l1_n942(x)
+    end
+end
+
+def fun_l0_n630(x)
+    if (x < 1)
+        fun_l1_n528(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n631(x)
+    if (x < 1)
+        fun_l1_n139(x)
+    else
+        fun_l1_n403(x)
+    end
+end
+
+def fun_l0_n632(x)
+    if (x < 1)
+        fun_l1_n421(x)
+    else
+        fun_l1_n510(x)
+    end
+end
+
+def fun_l0_n633(x)
+    if (x < 1)
+        fun_l1_n718(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n634(x)
+    if (x < 1)
+        fun_l1_n67(x)
+    else
+        fun_l1_n342(x)
+    end
+end
+
+def fun_l0_n635(x)
+    if (x < 1)
+        fun_l1_n943(x)
+    else
+        fun_l1_n941(x)
+    end
+end
+
+def fun_l0_n636(x)
+    if (x < 1)
+        fun_l1_n170(x)
+    else
+        fun_l1_n527(x)
+    end
+end
+
+def fun_l0_n637(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n638(x)
+    if (x < 1)
+        fun_l1_n730(x)
+    else
+        fun_l1_n10(x)
+    end
+end
+
+def fun_l0_n639(x)
+    if (x < 1)
+        fun_l1_n939(x)
+    else
+        fun_l1_n940(x)
+    end
+end
+
+def fun_l0_n640(x)
+    if (x < 1)
+        fun_l1_n73(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n641(x)
+    if (x < 1)
+        fun_l1_n460(x)
+    else
+        fun_l1_n828(x)
+    end
+end
+
+def fun_l0_n642(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n113(x)
+    end
+end
+
+def fun_l0_n643(x)
+    if (x < 1)
+        fun_l1_n972(x)
+    else
+        fun_l1_n15(x)
+    end
+end
+
+def fun_l0_n644(x)
+    if (x < 1)
+        fun_l1_n417(x)
+    else
+        fun_l1_n228(x)
+    end
+end
+
+def fun_l0_n645(x)
+    if (x < 1)
+        fun_l1_n876(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n646(x)
+    if (x < 1)
+        fun_l1_n404(x)
+    else
+        fun_l1_n147(x)
+    end
+end
+
+def fun_l0_n647(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n824(x)
+    end
+end
+
+def fun_l0_n648(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n421(x)
+    end
+end
+
+def fun_l0_n649(x)
+    if (x < 1)
+        fun_l1_n807(x)
+    else
+        fun_l1_n955(x)
+    end
+end
+
+def fun_l0_n650(x)
+    if (x < 1)
+        fun_l1_n221(x)
+    else
+        fun_l1_n367(x)
+    end
+end
+
+def fun_l0_n651(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n401(x)
+    end
+end
+
+def fun_l0_n652(x)
+    if (x < 1)
+        fun_l1_n203(x)
+    else
+        fun_l1_n909(x)
+    end
+end
+
+def fun_l0_n653(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n535(x)
+    end
+end
+
+def fun_l0_n654(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n393(x)
+    end
+end
+
+def fun_l0_n655(x)
+    if (x < 1)
+        fun_l1_n232(x)
+    else
+        fun_l1_n981(x)
+    end
+end
+
+def fun_l0_n656(x)
+    if (x < 1)
+        fun_l1_n873(x)
+    else
+        fun_l1_n510(x)
+    end
+end
+
+def fun_l0_n657(x)
+    if (x < 1)
+        fun_l1_n919(x)
+    else
+        fun_l1_n706(x)
+    end
+end
+
+def fun_l0_n658(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n112(x)
+    end
+end
+
+def fun_l0_n659(x)
+    if (x < 1)
+        fun_l1_n547(x)
+    else
+        fun_l1_n712(x)
+    end
+end
+
+def fun_l0_n660(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n695(x)
+    end
+end
+
+def fun_l0_n661(x)
+    if (x < 1)
+        fun_l1_n801(x)
+    else
+        fun_l1_n659(x)
+    end
+end
+
+def fun_l0_n662(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n663(x)
+    if (x < 1)
+        fun_l1_n11(x)
+    else
+        fun_l1_n620(x)
+    end
+end
+
+def fun_l0_n664(x)
+    if (x < 1)
+        fun_l1_n652(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n665(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n331(x)
+    end
+end
+
+def fun_l0_n666(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n1(x)
+    end
+end
+
+def fun_l0_n667(x)
+    if (x < 1)
+        fun_l1_n55(x)
+    else
+        fun_l1_n32(x)
+    end
+end
+
+def fun_l0_n668(x)
+    if (x < 1)
+        fun_l1_n241(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n669(x)
+    if (x < 1)
+        fun_l1_n234(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n670(x)
+    if (x < 1)
+        fun_l1_n235(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n671(x)
+    if (x < 1)
+        fun_l1_n990(x)
+    else
+        fun_l1_n236(x)
+    end
+end
+
+def fun_l0_n672(x)
+    if (x < 1)
+        fun_l1_n970(x)
+    else
+        fun_l1_n595(x)
+    end
+end
+
+def fun_l0_n673(x)
+    if (x < 1)
+        fun_l1_n294(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n674(x)
+    if (x < 1)
+        fun_l1_n597(x)
+    else
+        fun_l1_n956(x)
+    end
+end
+
+def fun_l0_n675(x)
+    if (x < 1)
+        fun_l1_n942(x)
+    else
+        fun_l1_n352(x)
+    end
+end
+
+def fun_l0_n676(x)
+    if (x < 1)
+        fun_l1_n309(x)
+    else
+        fun_l1_n294(x)
+    end
+end
+
+def fun_l0_n677(x)
+    if (x < 1)
+        fun_l1_n752(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n678(x)
+    if (x < 1)
+        fun_l1_n890(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n679(x)
+    if (x < 1)
+        fun_l1_n808(x)
+    else
+        fun_l1_n881(x)
+    end
+end
+
+def fun_l0_n680(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n681(x)
+    if (x < 1)
+        fun_l1_n104(x)
+    else
+        fun_l1_n262(x)
+    end
+end
+
+def fun_l0_n682(x)
+    if (x < 1)
+        fun_l1_n425(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n683(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n458(x)
+    end
+end
+
+def fun_l0_n684(x)
+    if (x < 1)
+        fun_l1_n760(x)
+    else
+        fun_l1_n997(x)
+    end
+end
+
+def fun_l0_n685(x)
+    if (x < 1)
+        fun_l1_n496(x)
+    else
+        fun_l1_n223(x)
+    end
+end
+
+def fun_l0_n686(x)
+    if (x < 1)
+        fun_l1_n363(x)
+    else
+        fun_l1_n543(x)
+    end
+end
+
+def fun_l0_n687(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n473(x)
+    end
+end
+
+def fun_l0_n688(x)
+    if (x < 1)
+        fun_l1_n854(x)
+    else
+        fun_l1_n999(x)
+    end
+end
+
+def fun_l0_n689(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n690(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n691(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n83(x)
+    end
+end
+
+def fun_l0_n692(x)
+    if (x < 1)
+        fun_l1_n797(x)
+    else
+        fun_l1_n427(x)
+    end
+end
+
+def fun_l0_n693(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n1(x)
+    end
+end
+
+def fun_l0_n694(x)
+    if (x < 1)
+        fun_l1_n601(x)
+    else
+        fun_l1_n809(x)
+    end
+end
+
+def fun_l0_n695(x)
+    if (x < 1)
+        fun_l1_n252(x)
+    else
+        fun_l1_n233(x)
+    end
+end
+
+def fun_l0_n696(x)
+    if (x < 1)
+        fun_l1_n36(x)
+    else
+        fun_l1_n796(x)
+    end
+end
+
+def fun_l0_n697(x)
+    if (x < 1)
+        fun_l1_n893(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n698(x)
+    if (x < 1)
+        fun_l1_n511(x)
+    else
+        fun_l1_n88(x)
+    end
+end
+
+def fun_l0_n699(x)
+    if (x < 1)
+        fun_l1_n573(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n700(x)
+    if (x < 1)
+        fun_l1_n475(x)
+    else
+        fun_l1_n539(x)
+    end
+end
+
+def fun_l0_n701(x)
+    if (x < 1)
+        fun_l1_n238(x)
+    else
+        fun_l1_n253(x)
+    end
+end
+
+def fun_l0_n702(x)
+    if (x < 1)
+        fun_l1_n731(x)
+    else
+        fun_l1_n225(x)
+    end
+end
+
+def fun_l0_n703(x)
+    if (x < 1)
+        fun_l1_n594(x)
+    else
+        fun_l1_n16(x)
+    end
+end
+
+def fun_l0_n704(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n705(x)
+    if (x < 1)
+        fun_l1_n812(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n706(x)
+    if (x < 1)
+        fun_l1_n731(x)
+    else
+        fun_l1_n343(x)
+    end
+end
+
+def fun_l0_n707(x)
+    if (x < 1)
+        fun_l1_n134(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n708(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n709(x)
+    if (x < 1)
+        fun_l1_n120(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n710(x)
+    if (x < 1)
+        fun_l1_n22(x)
+    else
+        fun_l1_n254(x)
+    end
+end
+
+def fun_l0_n711(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n712(x)
+    if (x < 1)
+        fun_l1_n820(x)
+    else
+        fun_l1_n96(x)
+    end
+end
+
+def fun_l0_n713(x)
+    if (x < 1)
+        fun_l1_n145(x)
+    else
+        fun_l1_n226(x)
+    end
+end
+
+def fun_l0_n714(x)
+    if (x < 1)
+        fun_l1_n643(x)
+    else
+        fun_l1_n407(x)
+    end
+end
+
+def fun_l0_n715(x)
+    if (x < 1)
+        fun_l1_n349(x)
+    else
+        fun_l1_n450(x)
+    end
+end
+
+def fun_l0_n716(x)
+    if (x < 1)
+        fun_l1_n954(x)
+    else
+        fun_l1_n707(x)
+    end
+end
+
+def fun_l0_n717(x)
+    if (x < 1)
+        fun_l1_n723(x)
+    else
+        fun_l1_n762(x)
+    end
+end
+
+def fun_l0_n718(x)
+    if (x < 1)
+        fun_l1_n299(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n719(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n521(x)
+    end
+end
+
+def fun_l0_n720(x)
+    if (x < 1)
+        fun_l1_n39(x)
+    else
+        fun_l1_n17(x)
+    end
+end
+
+def fun_l0_n721(x)
+    if (x < 1)
+        fun_l1_n297(x)
+    else
+        fun_l1_n800(x)
+    end
+end
+
+def fun_l0_n722(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n723(x)
+    if (x < 1)
+        fun_l1_n471(x)
+    else
+        fun_l1_n351(x)
+    end
+end
+
+def fun_l0_n724(x)
+    if (x < 1)
+        fun_l1_n381(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n725(x)
+    if (x < 1)
+        fun_l1_n624(x)
+    else
+        fun_l1_n162(x)
+    end
+end
+
+def fun_l0_n726(x)
+    if (x < 1)
+        fun_l1_n143(x)
+    else
+        fun_l1_n417(x)
+    end
+end
+
+def fun_l0_n727(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n19(x)
+    end
+end
+
+def fun_l0_n728(x)
+    if (x < 1)
+        fun_l1_n687(x)
+    else
+        fun_l1_n574(x)
+    end
+end
+
+def fun_l0_n729(x)
+    if (x < 1)
+        fun_l1_n225(x)
+    else
+        fun_l1_n871(x)
+    end
+end
+
+def fun_l0_n730(x)
+    if (x < 1)
+        fun_l1_n830(x)
+    else
+        fun_l1_n273(x)
+    end
+end
+
+def fun_l0_n731(x)
+    if (x < 1)
+        fun_l1_n95(x)
+    else
+        fun_l1_n864(x)
+    end
+end
+
+def fun_l0_n732(x)
+    if (x < 1)
+        fun_l1_n902(x)
+    else
+        fun_l1_n522(x)
+    end
+end
+
+def fun_l0_n733(x)
+    if (x < 1)
+        fun_l1_n564(x)
+    else
+        fun_l1_n55(x)
+    end
+end
+
+def fun_l0_n734(x)
+    if (x < 1)
+        fun_l1_n481(x)
+    else
+        fun_l1_n880(x)
+    end
+end
+
+def fun_l0_n735(x)
+    if (x < 1)
+        fun_l1_n87(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n736(x)
+    if (x < 1)
+        fun_l1_n72(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n737(x)
+    if (x < 1)
+        fun_l1_n920(x)
+    else
+        fun_l1_n852(x)
+    end
+end
+
+def fun_l0_n738(x)
+    if (x < 1)
+        fun_l1_n342(x)
+    else
+        fun_l1_n959(x)
+    end
+end
+
+def fun_l0_n739(x)
+    if (x < 1)
+        fun_l1_n682(x)
+    else
+        fun_l1_n714(x)
+    end
+end
+
+def fun_l0_n740(x)
+    if (x < 1)
+        fun_l1_n264(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n741(x)
+    if (x < 1)
+        fun_l1_n621(x)
+    else
+        fun_l1_n339(x)
+    end
+end
+
+def fun_l0_n742(x)
+    if (x < 1)
+        fun_l1_n46(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n743(x)
+    if (x < 1)
+        fun_l1_n333(x)
+    else
+        fun_l1_n353(x)
+    end
+end
+
+def fun_l0_n744(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n745(x)
+    if (x < 1)
+        fun_l1_n785(x)
+    else
+        fun_l1_n114(x)
+    end
+end
+
+def fun_l0_n746(x)
+    if (x < 1)
+        fun_l1_n402(x)
+    else
+        fun_l1_n803(x)
+    end
+end
+
+def fun_l0_n747(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n870(x)
+    end
+end
+
+def fun_l0_n748(x)
+    if (x < 1)
+        fun_l1_n683(x)
+    else
+        fun_l1_n287(x)
+    end
+end
+
+def fun_l0_n749(x)
+    if (x < 1)
+        fun_l1_n816(x)
+    else
+        fun_l1_n849(x)
+    end
+end
+
+def fun_l0_n750(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n555(x)
+    end
+end
+
+def fun_l0_n751(x)
+    if (x < 1)
+        fun_l1_n270(x)
+    else
+        fun_l1_n660(x)
+    end
+end
+
+def fun_l0_n752(x)
+    if (x < 1)
+        fun_l1_n786(x)
+    else
+        fun_l1_n749(x)
+    end
+end
+
+def fun_l0_n753(x)
+    if (x < 1)
+        fun_l1_n567(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n754(x)
+    if (x < 1)
+        fun_l1_n502(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n755(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n756(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n484(x)
+    end
+end
+
+def fun_l0_n757(x)
+    if (x < 1)
+        fun_l1_n849(x)
+    else
+        fun_l1_n42(x)
+    end
+end
+
+def fun_l0_n758(x)
+    if (x < 1)
+        fun_l1_n294(x)
+    else
+        fun_l1_n483(x)
+    end
+end
+
+def fun_l0_n759(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n9(x)
+    end
+end
+
+def fun_l0_n760(x)
+    if (x < 1)
+        fun_l1_n860(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n761(x)
+    if (x < 1)
+        fun_l1_n577(x)
+    else
+        fun_l1_n0(x)
+    end
+end
+
+def fun_l0_n762(x)
+    if (x < 1)
+        fun_l1_n28(x)
+    else
+        fun_l1_n834(x)
+    end
+end
+
+def fun_l0_n763(x)
+    if (x < 1)
+        fun_l1_n147(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n764(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n765(x)
+    if (x < 1)
+        fun_l1_n474(x)
+    else
+        fun_l1_n22(x)
+    end
+end
+
+def fun_l0_n766(x)
+    if (x < 1)
+        fun_l1_n264(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n767(x)
+    if (x < 1)
+        fun_l1_n351(x)
+    else
+        fun_l1_n813(x)
+    end
+end
+
+def fun_l0_n768(x)
+    if (x < 1)
+        fun_l1_n798(x)
+    else
+        fun_l1_n684(x)
+    end
+end
+
+def fun_l0_n769(x)
+    if (x < 1)
+        fun_l1_n202(x)
+    else
+        fun_l1_n982(x)
+    end
+end
+
+def fun_l0_n770(x)
+    if (x < 1)
+        fun_l1_n611(x)
+    else
+        fun_l1_n52(x)
+    end
+end
+
+def fun_l0_n771(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n772(x)
+    if (x < 1)
+        fun_l1_n98(x)
+    else
+        fun_l1_n149(x)
+    end
+end
+
+def fun_l0_n773(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n603(x)
+    end
+end
+
+def fun_l0_n774(x)
+    if (x < 1)
+        fun_l1_n604(x)
+    else
+        fun_l1_n318(x)
+    end
+end
+
+def fun_l0_n775(x)
+    if (x < 1)
+        fun_l1_n831(x)
+    else
+        fun_l1_n635(x)
+    end
+end
+
+def fun_l0_n776(x)
+    if (x < 1)
+        fun_l1_n738(x)
+    else
+        fun_l1_n563(x)
+    end
+end
+
+def fun_l0_n777(x)
+    if (x < 1)
+        fun_l1_n570(x)
+    else
+        fun_l1_n671(x)
+    end
+end
+
+def fun_l0_n778(x)
+    if (x < 1)
+        fun_l1_n945(x)
+    else
+        fun_l1_n840(x)
+    end
+end
+
+def fun_l0_n779(x)
+    if (x < 1)
+        fun_l1_n116(x)
+    else
+        fun_l1_n942(x)
+    end
+end
+
+def fun_l0_n780(x)
+    if (x < 1)
+        fun_l1_n835(x)
+    else
+        fun_l1_n244(x)
+    end
+end
+
+def fun_l0_n781(x)
+    if (x < 1)
+        fun_l1_n427(x)
+    else
+        fun_l1_n556(x)
+    end
+end
+
+def fun_l0_n782(x)
+    if (x < 1)
+        fun_l1_n280(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n783(x)
+    if (x < 1)
+        fun_l1_n674(x)
+    else
+        fun_l1_n560(x)
+    end
+end
+
+def fun_l0_n784(x)
+    if (x < 1)
+        fun_l1_n978(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n785(x)
+    if (x < 1)
+        fun_l1_n928(x)
+    else
+        fun_l1_n11(x)
+    end
+end
+
+def fun_l0_n786(x)
+    if (x < 1)
+        fun_l1_n829(x)
+    else
+        fun_l1_n239(x)
+    end
+end
+
+def fun_l0_n787(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n829(x)
+    end
+end
+
+def fun_l0_n788(x)
+    if (x < 1)
+        fun_l1_n968(x)
+    else
+        fun_l1_n596(x)
+    end
+end
+
+def fun_l0_n789(x)
+    if (x < 1)
+        fun_l1_n214(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n790(x)
+    if (x < 1)
+        fun_l1_n566(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n791(x)
+    if (x < 1)
+        fun_l1_n936(x)
+    else
+        fun_l1_n31(x)
+    end
+end
+
+def fun_l0_n792(x)
+    if (x < 1)
+        fun_l1_n291(x)
+    else
+        fun_l1_n835(x)
+    end
+end
+
+def fun_l0_n793(x)
+    if (x < 1)
+        fun_l1_n300(x)
+    else
+        fun_l1_n658(x)
+    end
+end
+
+def fun_l0_n794(x)
+    if (x < 1)
+        fun_l1_n609(x)
+    else
+        fun_l1_n156(x)
+    end
+end
+
+def fun_l0_n795(x)
+    if (x < 1)
+        fun_l1_n419(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n796(x)
+    if (x < 1)
+        fun_l1_n401(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n797(x)
+    if (x < 1)
+        fun_l1_n538(x)
+    else
+        fun_l1_n905(x)
+    end
+end
+
+def fun_l0_n798(x)
+    if (x < 1)
+        fun_l1_n427(x)
+    else
+        fun_l1_n978(x)
+    end
+end
+
+def fun_l0_n799(x)
+    if (x < 1)
+        fun_l1_n851(x)
+    else
+        fun_l1_n57(x)
+    end
+end
+
+def fun_l0_n800(x)
+    if (x < 1)
+        fun_l1_n836(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n801(x)
+    if (x < 1)
+        fun_l1_n414(x)
+    else
+        fun_l1_n679(x)
+    end
+end
+
+def fun_l0_n802(x)
+    if (x < 1)
+        fun_l1_n645(x)
+    else
+        fun_l1_n115(x)
+    end
+end
+
+def fun_l0_n803(x)
+    if (x < 1)
+        fun_l1_n884(x)
+    else
+        fun_l1_n801(x)
+    end
+end
+
+def fun_l0_n804(x)
+    if (x < 1)
+        fun_l1_n713(x)
+    else
+        fun_l1_n974(x)
+    end
+end
+
+def fun_l0_n805(x)
+    if (x < 1)
+        fun_l1_n301(x)
+    else
+        fun_l1_n589(x)
+    end
+end
+
+def fun_l0_n806(x)
+    if (x < 1)
+        fun_l1_n912(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n807(x)
+    if (x < 1)
+        fun_l1_n656(x)
+    else
+        fun_l1_n765(x)
+    end
+end
+
+def fun_l0_n808(x)
+    if (x < 1)
+        fun_l1_n517(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n809(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n810(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n841(x)
+    end
+end
+
+def fun_l0_n811(x)
+    if (x < 1)
+        fun_l1_n564(x)
+    else
+        fun_l1_n541(x)
+    end
+end
+
+def fun_l0_n812(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n681(x)
+    end
+end
+
+def fun_l0_n813(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n561(x)
+    end
+end
+
+def fun_l0_n814(x)
+    if (x < 1)
+        fun_l1_n547(x)
+    else
+        fun_l1_n631(x)
+    end
+end
+
+def fun_l0_n815(x)
+    if (x < 1)
+        fun_l1_n956(x)
+    else
+        fun_l1_n889(x)
+    end
+end
+
+def fun_l0_n816(x)
+    if (x < 1)
+        fun_l1_n817(x)
+    else
+        fun_l1_n957(x)
+    end
+end
+
+def fun_l0_n817(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n827(x)
+    end
+end
+
+def fun_l0_n818(x)
+    if (x < 1)
+        fun_l1_n7(x)
+    else
+        fun_l1_n208(x)
+    end
+end
+
+def fun_l0_n819(x)
+    if (x < 1)
+        fun_l1_n411(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n820(x)
+    if (x < 1)
+        fun_l1_n676(x)
+    else
+        fun_l1_n144(x)
+    end
+end
+
+def fun_l0_n821(x)
+    if (x < 1)
+        fun_l1_n489(x)
+    else
+        fun_l1_n963(x)
+    end
+end
+
+def fun_l0_n822(x)
+    if (x < 1)
+        fun_l1_n645(x)
+    else
+        fun_l1_n953(x)
+    end
+end
+
+def fun_l0_n823(x)
+    if (x < 1)
+        fun_l1_n974(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n824(x)
+    if (x < 1)
+        fun_l1_n295(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n825(x)
+    if (x < 1)
+        fun_l1_n141(x)
+    else
+        fun_l1_n633(x)
+    end
+end
+
+def fun_l0_n826(x)
+    if (x < 1)
+        fun_l1_n317(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n827(x)
+    if (x < 1)
+        fun_l1_n570(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n828(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n477(x)
+    end
+end
+
+def fun_l0_n829(x)
+    if (x < 1)
+        fun_l1_n277(x)
+    else
+        fun_l1_n276(x)
+    end
+end
+
+def fun_l0_n830(x)
+    if (x < 1)
+        fun_l1_n579(x)
+    else
+        fun_l1_n648(x)
+    end
+end
+
+def fun_l0_n831(x)
+    if (x < 1)
+        fun_l1_n8(x)
+    else
+        fun_l1_n25(x)
+    end
+end
+
+def fun_l0_n832(x)
+    if (x < 1)
+        fun_l1_n724(x)
+    else
+        fun_l1_n617(x)
+    end
+end
+
+def fun_l0_n833(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n619(x)
+    end
+end
+
+def fun_l0_n834(x)
+    if (x < 1)
+        fun_l1_n23(x)
+    else
+        fun_l1_n127(x)
+    end
+end
+
+def fun_l0_n835(x)
+    if (x < 1)
+        fun_l1_n322(x)
+    else
+        fun_l1_n327(x)
+    end
+end
+
+def fun_l0_n836(x)
+    if (x < 1)
+        fun_l1_n7(x)
+    else
+        fun_l1_n600(x)
+    end
+end
+
+def fun_l0_n837(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n838(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n899(x)
+    end
+end
+
+def fun_l0_n839(x)
+    if (x < 1)
+        fun_l1_n16(x)
+    else
+        fun_l1_n349(x)
+    end
+end
+
+def fun_l0_n840(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n960(x)
+    end
+end
+
+def fun_l0_n841(x)
+    if (x < 1)
+        fun_l1_n295(x)
+    else
+        fun_l1_n176(x)
+    end
+end
+
+def fun_l0_n842(x)
+    if (x < 1)
+        fun_l1_n302(x)
+    else
+        fun_l1_n639(x)
+    end
+end
+
+def fun_l0_n843(x)
+    if (x < 1)
+        fun_l1_n342(x)
+    else
+        fun_l1_n373(x)
+    end
+end
+
+def fun_l0_n844(x)
+    if (x < 1)
+        fun_l1_n5(x)
+    else
+        fun_l1_n787(x)
+    end
+end
+
+def fun_l0_n845(x)
+    if (x < 1)
+        fun_l1_n89(x)
+    else
+        fun_l1_n951(x)
+    end
+end
+
+def fun_l0_n846(x)
+    if (x < 1)
+        fun_l1_n954(x)
+    else
+        fun_l1_n982(x)
+    end
+end
+
+def fun_l0_n847(x)
+    if (x < 1)
+        fun_l1_n971(x)
+    else
+        fun_l1_n917(x)
+    end
+end
+
+def fun_l0_n848(x)
+    if (x < 1)
+        fun_l1_n845(x)
+    else
+        fun_l1_n343(x)
+    end
+end
+
+def fun_l0_n849(x)
+    if (x < 1)
+        fun_l1_n684(x)
+    else
+        fun_l1_n683(x)
+    end
+end
+
+def fun_l0_n850(x)
+    if (x < 1)
+        fun_l1_n670(x)
+    else
+        fun_l1_n256(x)
+    end
+end
+
+def fun_l0_n851(x)
+    if (x < 1)
+        fun_l1_n405(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n852(x)
+    if (x < 1)
+        fun_l1_n809(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n853(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n92(x)
+    end
+end
+
+def fun_l0_n854(x)
+    if (x < 1)
+        fun_l1_n735(x)
+    else
+        fun_l1_n948(x)
+    end
+end
+
+def fun_l0_n855(x)
+    if (x < 1)
+        fun_l1_n684(x)
+    else
+        fun_l1_n566(x)
+    end
+end
+
+def fun_l0_n856(x)
+    if (x < 1)
+        fun_l1_n508(x)
+    else
+        fun_l1_n35(x)
+    end
+end
+
+def fun_l0_n857(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n930(x)
+    end
+end
+
+def fun_l0_n858(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n241(x)
+    end
+end
+
+def fun_l0_n859(x)
+    if (x < 1)
+        fun_l1_n938(x)
+    else
+        fun_l1_n108(x)
+    end
+end
+
+def fun_l0_n860(x)
+    if (x < 1)
+        fun_l1_n491(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n861(x)
+    if (x < 1)
+        fun_l1_n991(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n862(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n513(x)
+    end
+end
+
+def fun_l0_n863(x)
+    if (x < 1)
+        fun_l1_n279(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n864(x)
+    if (x < 1)
+        fun_l1_n52(x)
+    else
+        fun_l1_n765(x)
+    end
+end
+
+def fun_l0_n865(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n572(x)
+    end
+end
+
+def fun_l0_n866(x)
+    if (x < 1)
+        fun_l1_n4(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n867(x)
+    if (x < 1)
+        fun_l1_n112(x)
+    else
+        fun_l1_n758(x)
+    end
+end
+
+def fun_l0_n868(x)
+    if (x < 1)
+        fun_l1_n924(x)
+    else
+        fun_l1_n251(x)
+    end
+end
+
+def fun_l0_n869(x)
+    if (x < 1)
+        fun_l1_n558(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n870(x)
+    if (x < 1)
+        fun_l1_n804(x)
+    else
+        fun_l1_n746(x)
+    end
+end
+
+def fun_l0_n871(x)
+    if (x < 1)
+        fun_l1_n111(x)
+    else
+        fun_l1_n407(x)
+    end
+end
+
+def fun_l0_n872(x)
+    if (x < 1)
+        fun_l1_n973(x)
+    else
+        fun_l1_n384(x)
+    end
+end
+
+def fun_l0_n873(x)
+    if (x < 1)
+        fun_l1_n102(x)
+    else
+        fun_l1_n199(x)
+    end
+end
+
+def fun_l0_n874(x)
+    if (x < 1)
+        fun_l1_n735(x)
+    else
+        fun_l1_n903(x)
+    end
+end
+
+def fun_l0_n875(x)
+    if (x < 1)
+        fun_l1_n95(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n876(x)
+    if (x < 1)
+        fun_l1_n864(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n877(x)
+    if (x < 1)
+        fun_l1_n729(x)
+    else
+        fun_l1_n207(x)
+    end
+end
+
+def fun_l0_n878(x)
+    if (x < 1)
+        fun_l1_n104(x)
+    else
+        fun_l1_n209(x)
+    end
+end
+
+def fun_l0_n879(x)
+    if (x < 1)
+        fun_l1_n566(x)
+    else
+        fun_l1_n918(x)
+    end
+end
+
+def fun_l0_n880(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n104(x)
+    end
+end
+
+def fun_l0_n881(x)
+    if (x < 1)
+        fun_l1_n745(x)
+    else
+        fun_l1_n476(x)
+    end
+end
+
+def fun_l0_n882(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n642(x)
+    end
+end
+
+def fun_l0_n883(x)
+    if (x < 1)
+        fun_l1_n78(x)
+    else
+        fun_l1_n210(x)
+    end
+end
+
+def fun_l0_n884(x)
+    if (x < 1)
+        fun_l1_n864(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n885(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n886(x)
+    if (x < 1)
+        fun_l1_n217(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n887(x)
+    if (x < 1)
+        fun_l1_n193(x)
+    else
+        fun_l1_n788(x)
+    end
+end
+
+def fun_l0_n888(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n793(x)
+    end
+end
+
+def fun_l0_n889(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n936(x)
+    end
+end
+
+def fun_l0_n890(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n52(x)
+    end
+end
+
+def fun_l0_n891(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n424(x)
+    end
+end
+
+def fun_l0_n892(x)
+    if (x < 1)
+        fun_l1_n627(x)
+    else
+        fun_l1_n284(x)
+    end
+end
+
+def fun_l0_n893(x)
+    if (x < 1)
+        fun_l1_n42(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n894(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n895(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n896(x)
+    if (x < 1)
+        fun_l1_n665(x)
+    else
+        fun_l1_n731(x)
+    end
+end
+
+def fun_l0_n897(x)
+    if (x < 1)
+        fun_l1_n618(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n898(x)
+    if (x < 1)
+        fun_l1_n64(x)
+    else
+        fun_l1_n697(x)
+    end
+end
+
+def fun_l0_n899(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n657(x)
+    end
+end
+
+def fun_l0_n900(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n901(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n392(x)
+    end
+end
+
+def fun_l0_n902(x)
+    if (x < 1)
+        fun_l1_n529(x)
+    else
+        fun_l1_n708(x)
+    end
+end
+
+def fun_l0_n903(x)
+    if (x < 1)
+        fun_l1_n900(x)
+    else
+        fun_l1_n830(x)
+    end
+end
+
+def fun_l0_n904(x)
+    if (x < 1)
+        fun_l1_n424(x)
+    else
+        fun_l1_n564(x)
+    end
+end
+
+def fun_l0_n905(x)
+    if (x < 1)
+        fun_l1_n557(x)
+    else
+        fun_l1_n612(x)
+    end
+end
+
+def fun_l0_n906(x)
+    if (x < 1)
+        fun_l1_n725(x)
+    else
+        fun_l1_n166(x)
+    end
+end
+
+def fun_l0_n907(x)
+    if (x < 1)
+        fun_l1_n534(x)
+    else
+        fun_l1_n159(x)
+    end
+end
+
+def fun_l0_n908(x)
+    if (x < 1)
+        fun_l1_n50(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n909(x)
+    if (x < 1)
+        fun_l1_n568(x)
+    else
+        fun_l1_n276(x)
+    end
+end
+
+def fun_l0_n910(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n324(x)
+    end
+end
+
+def fun_l0_n911(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n524(x)
+    end
+end
+
+def fun_l0_n912(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n650(x)
+    end
+end
+
+def fun_l0_n913(x)
+    if (x < 1)
+        fun_l1_n593(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n914(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n915(x)
+    if (x < 1)
+        fun_l1_n422(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n916(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n932(x)
+    end
+end
+
+def fun_l0_n917(x)
+    if (x < 1)
+        fun_l1_n403(x)
+    else
+        fun_l1_n58(x)
+    end
+end
+
+def fun_l0_n918(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n579(x)
+    end
+end
+
+def fun_l0_n919(x)
+    if (x < 1)
+        fun_l1_n933(x)
+    else
+        fun_l1_n434(x)
+    end
+end
+
+def fun_l0_n920(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n921(x)
+    if (x < 1)
+        fun_l1_n17(x)
+    else
+        fun_l1_n637(x)
+    end
+end
+
+def fun_l0_n922(x)
+    if (x < 1)
+        fun_l1_n551(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n923(x)
+    if (x < 1)
+        fun_l1_n861(x)
+    else
+        fun_l1_n248(x)
+    end
+end
+
+def fun_l0_n924(x)
+    if (x < 1)
+        fun_l1_n171(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n925(x)
+    if (x < 1)
+        fun_l1_n233(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n926(x)
+    if (x < 1)
+        fun_l1_n310(x)
+    else
+        fun_l1_n941(x)
+    end
+end
+
+def fun_l0_n927(x)
+    if (x < 1)
+        fun_l1_n363(x)
+    else
+        fun_l1_n567(x)
+    end
+end
+
+def fun_l0_n928(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n840(x)
+    end
+end
+
+def fun_l0_n929(x)
+    if (x < 1)
+        fun_l1_n368(x)
+    else
+        fun_l1_n713(x)
+    end
+end
+
+def fun_l0_n930(x)
+    if (x < 1)
+        fun_l1_n37(x)
+    else
+        fun_l1_n355(x)
+    end
+end
+
+def fun_l0_n931(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n784(x)
+    end
+end
+
+def fun_l0_n932(x)
+    if (x < 1)
+        fun_l1_n591(x)
+    else
+        fun_l1_n844(x)
+    end
+end
+
+def fun_l0_n933(x)
+    if (x < 1)
+        fun_l1_n996(x)
+    else
+        fun_l1_n943(x)
+    end
+end
+
+def fun_l0_n934(x)
+    if (x < 1)
+        fun_l1_n631(x)
+    else
+        fun_l1_n643(x)
+    end
+end
+
+def fun_l0_n935(x)
+    if (x < 1)
+        fun_l1_n875(x)
+    else
+        fun_l1_n89(x)
+    end
+end
+
+def fun_l0_n936(x)
+    if (x < 1)
+        fun_l1_n842(x)
+    else
+        fun_l1_n595(x)
+    end
+end
+
+def fun_l0_n937(x)
+    if (x < 1)
+        fun_l1_n921(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n938(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n170(x)
+    end
+end
+
+def fun_l0_n939(x)
+    if (x < 1)
+        fun_l1_n567(x)
+    else
+        fun_l1_n463(x)
+    end
+end
+
+def fun_l0_n940(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n192(x)
+    end
+end
+
+def fun_l0_n941(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n951(x)
+    end
+end
+
+def fun_l0_n942(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n943(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n234(x)
+    end
+end
+
+def fun_l0_n944(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n33(x)
+    end
+end
+
+def fun_l0_n945(x)
+    if (x < 1)
+        fun_l1_n859(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n946(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n369(x)
+    end
+end
+
+def fun_l0_n947(x)
+    if (x < 1)
+        fun_l1_n64(x)
+    else
+        fun_l1_n356(x)
+    end
+end
+
+def fun_l0_n948(x)
+    if (x < 1)
+        fun_l1_n279(x)
+    else
+        fun_l1_n244(x)
+    end
+end
+
+def fun_l0_n949(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n548(x)
+    end
+end
+
+def fun_l0_n950(x)
+    if (x < 1)
+        fun_l1_n3(x)
+    else
+        fun_l1_n698(x)
+    end
+end
+
+def fun_l0_n951(x)
+    if (x < 1)
+        fun_l1_n665(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n952(x)
+    if (x < 1)
+        fun_l1_n812(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n953(x)
+    if (x < 1)
+        fun_l1_n851(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n954(x)
+    if (x < 1)
+        fun_l1_n415(x)
+    else
+        fun_l1_n379(x)
+    end
+end
+
+def fun_l0_n955(x)
+    if (x < 1)
+        fun_l1_n806(x)
+    else
+        fun_l1_n919(x)
+    end
+end
+
+def fun_l0_n956(x)
+    if (x < 1)
+        fun_l1_n207(x)
+    else
+        fun_l1_n798(x)
+    end
+end
+
+def fun_l0_n957(x)
+    if (x < 1)
+        fun_l1_n269(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n958(x)
+    if (x < 1)
+        fun_l1_n654(x)
+    else
+        fun_l1_n236(x)
+    end
+end
+
+def fun_l0_n959(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n623(x)
+    end
+end
+
+def fun_l0_n960(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n279(x)
+    end
+end
+
+def fun_l0_n961(x)
+    if (x < 1)
+        fun_l1_n476(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n962(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n570(x)
+    end
+end
+
+def fun_l0_n963(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n114(x)
+    end
+end
+
+def fun_l0_n964(x)
+    if (x < 1)
+        fun_l1_n197(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l0_n965(x)
+    if (x < 1)
+        fun_l1_n37(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n966(x)
+    if (x < 1)
+        fun_l1_n775(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n967(x)
+    if (x < 1)
+        fun_l1_n373(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n968(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n122(x)
+    end
+end
+
+def fun_l0_n969(x)
+    if (x < 1)
+        fun_l1_n497(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n970(x)
+    if (x < 1)
+        fun_l1_n621(x)
+    else
+        fun_l1_n931(x)
+    end
+end
+
+def fun_l0_n971(x)
+    if (x < 1)
+        fun_l1_n963(x)
+    else
+        fun_l1_n613(x)
+    end
+end
+
+def fun_l0_n972(x)
+    if (x < 1)
+        fun_l1_n613(x)
+    else
+        fun_l1_n508(x)
+    end
+end
+
+def fun_l0_n973(x)
+    if (x < 1)
+        fun_l1_n466(x)
+    else
+        fun_l1_n929(x)
+    end
+end
+
+def fun_l0_n974(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n975(x)
+    if (x < 1)
+        fun_l1_n674(x)
+    else
+        fun_l1_n609(x)
+    end
+end
+
+def fun_l0_n976(x)
+    if (x < 1)
+        fun_l1_n963(x)
+    else
+        fun_l1_n601(x)
+    end
+end
+
+def fun_l0_n977(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n242(x)
+    end
+end
+
+def fun_l0_n978(x)
+    if (x < 1)
+        fun_l1_n515(x)
+    else
+        fun_l1_n113(x)
+    end
+end
+
+def fun_l0_n979(x)
+    if (x < 1)
+        fun_l1_n734(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n980(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n733(x)
+    end
+end
+
+def fun_l0_n981(x)
+    if (x < 1)
+        fun_l1_n326(x)
+    else
+        fun_l1_n213(x)
+    end
+end
+
+def fun_l0_n982(x)
+    if (x < 1)
+        fun_l1_n733(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n983(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n700(x)
+    end
+end
+
+def fun_l0_n984(x)
+    if (x < 1)
+        fun_l1_n266(x)
+    else
+        fun_l1_n348(x)
+    end
+end
+
+def fun_l0_n985(x)
+    if (x < 1)
+        fun_l1_n931(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n986(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n987(x)
+    if (x < 1)
+        fun_l1_n474(x)
+    else
+        fun_l1_n638(x)
+    end
+end
+
+def fun_l0_n988(x)
+    if (x < 1)
+        fun_l1_n615(x)
+    else
+        fun_l1_n283(x)
+    end
+end
+
+def fun_l0_n989(x)
+    if (x < 1)
+        fun_l1_n410(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n990(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n77(x)
+    end
+end
+
+def fun_l0_n991(x)
+    if (x < 1)
+        fun_l1_n153(x)
+    else
+        fun_l1_n255(x)
+    end
+end
+
+def fun_l0_n992(x)
+    if (x < 1)
+        fun_l1_n447(x)
+    else
+        fun_l1_n239(x)
+    end
+end
+
+def fun_l0_n993(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n582(x)
+    end
+end
+
+def fun_l0_n994(x)
+    if (x < 1)
+        fun_l1_n385(x)
+    else
+        fun_l1_n939(x)
+    end
+end
+
+def fun_l0_n995(x)
+    if (x < 1)
+        fun_l1_n236(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n996(x)
+    if (x < 1)
+        fun_l1_n63(x)
+    else
+        fun_l1_n721(x)
+    end
+end
+
+def fun_l0_n997(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n376(x)
+    end
+end
+
+def fun_l0_n998(x)
+    if (x < 1)
+        fun_l1_n362(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n999(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l1_n0(x)
+    if (x < 1)
+        fun_l2_n498(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n1(x)
+    if (x < 1)
+        fun_l2_n424(x)
+    else
+        fun_l2_n137(x)
+    end
+end
+
+def fun_l1_n2(x)
+    if (x < 1)
+        fun_l2_n325(x)
+    else
+        fun_l2_n95(x)
+    end
+end
+
+def fun_l1_n3(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n469(x)
+    end
+end
+
+def fun_l1_n4(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n147(x)
+    end
+end
+
+def fun_l1_n5(x)
+    if (x < 1)
+        fun_l2_n796(x)
+    else
+        fun_l2_n907(x)
+    end
+end
+
+def fun_l1_n6(x)
+    if (x < 1)
+        fun_l2_n555(x)
+    else
+        fun_l2_n309(x)
+    end
+end
+
+def fun_l1_n7(x)
+    if (x < 1)
+        fun_l2_n475(x)
+    else
+        fun_l2_n193(x)
+    end
+end
+
+def fun_l1_n8(x)
+    if (x < 1)
+        fun_l2_n317(x)
+    else
+        fun_l2_n284(x)
+    end
+end
+
+def fun_l1_n9(x)
+    if (x < 1)
+        fun_l2_n297(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n10(x)
+    if (x < 1)
+        fun_l2_n66(x)
+    else
+        fun_l2_n959(x)
+    end
+end
+
+def fun_l1_n11(x)
+    if (x < 1)
+        fun_l2_n833(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n12(x)
+    if (x < 1)
+        fun_l2_n640(x)
+    else
+        fun_l2_n588(x)
+    end
+end
+
+def fun_l1_n13(x)
+    if (x < 1)
+        fun_l2_n91(x)
+    else
+        fun_l2_n294(x)
+    end
+end
+
+def fun_l1_n14(x)
+    if (x < 1)
+        fun_l2_n166(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n15(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n16(x)
+    if (x < 1)
+        fun_l2_n84(x)
+    else
+        fun_l2_n278(x)
+    end
+end
+
+def fun_l1_n17(x)
+    if (x < 1)
+        fun_l2_n308(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n18(x)
+    if (x < 1)
+        fun_l2_n713(x)
+    else
+        fun_l2_n575(x)
+    end
+end
+
+def fun_l1_n19(x)
+    if (x < 1)
+        fun_l2_n81(x)
+    else
+        fun_l2_n301(x)
+    end
+end
+
+def fun_l1_n20(x)
+    if (x < 1)
+        fun_l2_n516(x)
+    else
+        fun_l2_n164(x)
+    end
+end
+
+def fun_l1_n21(x)
+    if (x < 1)
+        fun_l2_n900(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n22(x)
+    if (x < 1)
+        fun_l2_n472(x)
+    else
+        fun_l2_n288(x)
+    end
+end
+
+def fun_l1_n23(x)
+    if (x < 1)
+        fun_l2_n587(x)
+    else
+        fun_l2_n515(x)
+    end
+end
+
+def fun_l1_n24(x)
+    if (x < 1)
+        fun_l2_n506(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n25(x)
+    if (x < 1)
+        fun_l2_n935(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n26(x)
+    if (x < 1)
+        fun_l2_n485(x)
+    else
+        fun_l2_n368(x)
+    end
+end
+
+def fun_l1_n27(x)
+    if (x < 1)
+        fun_l2_n984(x)
+    else
+        fun_l2_n290(x)
+    end
+end
+
+def fun_l1_n28(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n837(x)
+    end
+end
+
+def fun_l1_n29(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n311(x)
+    end
+end
+
+def fun_l1_n30(x)
+    if (x < 1)
+        fun_l2_n215(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n31(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n32(x)
+    if (x < 1)
+        fun_l2_n386(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n33(x)
+    if (x < 1)
+        fun_l2_n268(x)
+    else
+        fun_l2_n256(x)
+    end
+end
+
+def fun_l1_n34(x)
+    if (x < 1)
+        fun_l2_n348(x)
+    else
+        fun_l2_n464(x)
+    end
+end
+
+def fun_l1_n35(x)
+    if (x < 1)
+        fun_l2_n25(x)
+    else
+        fun_l2_n33(x)
+    end
+end
+
+def fun_l1_n36(x)
+    if (x < 1)
+        fun_l2_n387(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n37(x)
+    if (x < 1)
+        fun_l2_n580(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n38(x)
+    if (x < 1)
+        fun_l2_n33(x)
+    else
+        fun_l2_n33(x)
+    end
+end
+
+def fun_l1_n39(x)
+    if (x < 1)
+        fun_l2_n861(x)
+    else
+        fun_l2_n52(x)
+    end
+end
+
+def fun_l1_n40(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n41(x)
+    if (x < 1)
+        fun_l2_n956(x)
+    else
+        fun_l2_n159(x)
+    end
+end
+
+def fun_l1_n42(x)
+    if (x < 1)
+        fun_l2_n445(x)
+    else
+        fun_l2_n775(x)
+    end
+end
+
+def fun_l1_n43(x)
+    if (x < 1)
+        fun_l2_n667(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n44(x)
+    if (x < 1)
+        fun_l2_n185(x)
+    else
+        fun_l2_n210(x)
+    end
+end
+
+def fun_l1_n45(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n21(x)
+    end
+end
+
+def fun_l1_n46(x)
+    if (x < 1)
+        fun_l2_n751(x)
+    else
+        fun_l2_n639(x)
+    end
+end
+
+def fun_l1_n47(x)
+    if (x < 1)
+        fun_l2_n431(x)
+    else
+        fun_l2_n917(x)
+    end
+end
+
+def fun_l1_n48(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n170(x)
+    end
+end
+
+def fun_l1_n49(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n77(x)
+    end
+end
+
+def fun_l1_n50(x)
+    if (x < 1)
+        fun_l2_n546(x)
+    else
+        fun_l2_n759(x)
+    end
+end
+
+def fun_l1_n51(x)
+    if (x < 1)
+        fun_l2_n453(x)
+    else
+        fun_l2_n951(x)
+    end
+end
+
+def fun_l1_n52(x)
+    if (x < 1)
+        fun_l2_n989(x)
+    else
+        fun_l2_n716(x)
+    end
+end
+
+def fun_l1_n53(x)
+    if (x < 1)
+        fun_l2_n652(x)
+    else
+        fun_l2_n36(x)
+    end
+end
+
+def fun_l1_n54(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n760(x)
+    end
+end
+
+def fun_l1_n55(x)
+    if (x < 1)
+        fun_l2_n706(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n56(x)
+    if (x < 1)
+        fun_l2_n666(x)
+    else
+        fun_l2_n295(x)
+    end
+end
+
+def fun_l1_n57(x)
+    if (x < 1)
+        fun_l2_n424(x)
+    else
+        fun_l2_n447(x)
+    end
+end
+
+def fun_l1_n58(x)
+    if (x < 1)
+        fun_l2_n408(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n59(x)
+    if (x < 1)
+        fun_l2_n567(x)
+    else
+        fun_l2_n765(x)
+    end
+end
+
+def fun_l1_n60(x)
+    if (x < 1)
+        fun_l2_n241(x)
+    else
+        fun_l2_n701(x)
+    end
+end
+
+def fun_l1_n61(x)
+    if (x < 1)
+        fun_l2_n831(x)
+    else
+        fun_l2_n382(x)
+    end
+end
+
+def fun_l1_n62(x)
+    if (x < 1)
+        fun_l2_n634(x)
+    else
+        fun_l2_n908(x)
+    end
+end
+
+def fun_l1_n63(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n48(x)
+    end
+end
+
+def fun_l1_n64(x)
+    if (x < 1)
+        fun_l2_n528(x)
+    else
+        fun_l2_n110(x)
+    end
+end
+
+def fun_l1_n65(x)
+    if (x < 1)
+        fun_l2_n767(x)
+    else
+        fun_l2_n973(x)
+    end
+end
+
+def fun_l1_n66(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n673(x)
+    end
+end
+
+def fun_l1_n67(x)
+    if (x < 1)
+        fun_l2_n927(x)
+    else
+        fun_l2_n309(x)
+    end
+end
+
+def fun_l1_n68(x)
+    if (x < 1)
+        fun_l2_n851(x)
+    else
+        fun_l2_n160(x)
+    end
+end
+
+def fun_l1_n69(x)
+    if (x < 1)
+        fun_l2_n575(x)
+    else
+        fun_l2_n800(x)
+    end
+end
+
+def fun_l1_n70(x)
+    if (x < 1)
+        fun_l2_n396(x)
+    else
+        fun_l2_n382(x)
+    end
+end
+
+def fun_l1_n71(x)
+    if (x < 1)
+        fun_l2_n508(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n72(x)
+    if (x < 1)
+        fun_l2_n360(x)
+    else
+        fun_l2_n848(x)
+    end
+end
+
+def fun_l1_n73(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n83(x)
+    end
+end
+
+def fun_l1_n74(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n284(x)
+    end
+end
+
+def fun_l1_n75(x)
+    if (x < 1)
+        fun_l2_n999(x)
+    else
+        fun_l2_n954(x)
+    end
+end
+
+def fun_l1_n76(x)
+    if (x < 1)
+        fun_l2_n182(x)
+    else
+        fun_l2_n997(x)
+    end
+end
+
+def fun_l1_n77(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n409(x)
+    end
+end
+
+def fun_l1_n78(x)
+    if (x < 1)
+        fun_l2_n163(x)
+    else
+        fun_l2_n417(x)
+    end
+end
+
+def fun_l1_n79(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n688(x)
+    end
+end
+
+def fun_l1_n80(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n356(x)
+    end
+end
+
+def fun_l1_n81(x)
+    if (x < 1)
+        fun_l2_n44(x)
+    else
+        fun_l2_n302(x)
+    end
+end
+
+def fun_l1_n82(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n892(x)
+    end
+end
+
+def fun_l1_n83(x)
+    if (x < 1)
+        fun_l2_n494(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n84(x)
+    if (x < 1)
+        fun_l2_n631(x)
+    else
+        fun_l2_n922(x)
+    end
+end
+
+def fun_l1_n85(x)
+    if (x < 1)
+        fun_l2_n797(x)
+    else
+        fun_l2_n874(x)
+    end
+end
+
+def fun_l1_n86(x)
+    if (x < 1)
+        fun_l2_n209(x)
+    else
+        fun_l2_n365(x)
+    end
+end
+
+def fun_l1_n87(x)
+    if (x < 1)
+        fun_l2_n516(x)
+    else
+        fun_l2_n371(x)
+    end
+end
+
+def fun_l1_n88(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n88(x)
+    end
+end
+
+def fun_l1_n89(x)
+    if (x < 1)
+        fun_l2_n70(x)
+    else
+        fun_l2_n521(x)
+    end
+end
+
+def fun_l1_n90(x)
+    if (x < 1)
+        fun_l2_n666(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n91(x)
+    if (x < 1)
+        fun_l2_n504(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n92(x)
+    if (x < 1)
+        fun_l2_n734(x)
+    else
+        fun_l2_n277(x)
+    end
+end
+
+def fun_l1_n93(x)
+    if (x < 1)
+        fun_l2_n300(x)
+    else
+        fun_l2_n826(x)
+    end
+end
+
+def fun_l1_n94(x)
+    if (x < 1)
+        fun_l2_n733(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n95(x)
+    if (x < 1)
+        fun_l2_n834(x)
+    else
+        fun_l2_n644(x)
+    end
+end
+
+def fun_l1_n96(x)
+    if (x < 1)
+        fun_l2_n183(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n97(x)
+    if (x < 1)
+        fun_l2_n372(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n98(x)
+    if (x < 1)
+        fun_l2_n208(x)
+    else
+        fun_l2_n543(x)
+    end
+end
+
+def fun_l1_n99(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n974(x)
+    end
+end
+
+def fun_l1_n100(x)
+    if (x < 1)
+        fun_l2_n620(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n101(x)
+    if (x < 1)
+        fun_l2_n248(x)
+    else
+        fun_l2_n189(x)
+    end
+end
+
+def fun_l1_n102(x)
+    if (x < 1)
+        fun_l2_n489(x)
+    else
+        fun_l2_n390(x)
+    end
+end
+
+def fun_l1_n103(x)
+    if (x < 1)
+        fun_l2_n452(x)
+    else
+        fun_l2_n22(x)
+    end
+end
+
+def fun_l1_n104(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n135(x)
+    end
+end
+
+def fun_l1_n105(x)
+    if (x < 1)
+        fun_l2_n988(x)
+    else
+        fun_l2_n118(x)
+    end
+end
+
+def fun_l1_n106(x)
+    if (x < 1)
+        fun_l2_n817(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n107(x)
+    if (x < 1)
+        fun_l2_n812(x)
+    else
+        fun_l2_n206(x)
+    end
+end
+
+def fun_l1_n108(x)
+    if (x < 1)
+        fun_l2_n514(x)
+    else
+        fun_l2_n300(x)
+    end
+end
+
+def fun_l1_n109(x)
+    if (x < 1)
+        fun_l2_n482(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n110(x)
+    if (x < 1)
+        fun_l2_n571(x)
+    else
+        fun_l2_n758(x)
+    end
+end
+
+def fun_l1_n111(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n811(x)
+    end
+end
+
+def fun_l1_n112(x)
+    if (x < 1)
+        fun_l2_n23(x)
+    else
+        fun_l2_n844(x)
+    end
+end
+
+def fun_l1_n113(x)
+    if (x < 1)
+        fun_l2_n865(x)
+    else
+        fun_l2_n149(x)
+    end
+end
+
+def fun_l1_n114(x)
+    if (x < 1)
+        fun_l2_n930(x)
+    else
+        fun_l2_n327(x)
+    end
+end
+
+def fun_l1_n115(x)
+    if (x < 1)
+        fun_l2_n67(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n116(x)
+    if (x < 1)
+        fun_l2_n278(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n117(x)
+    if (x < 1)
+        fun_l2_n457(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n118(x)
+    if (x < 1)
+        fun_l2_n384(x)
+    else
+        fun_l2_n594(x)
+    end
+end
+
+def fun_l1_n119(x)
+    if (x < 1)
+        fun_l2_n361(x)
+    else
+        fun_l2_n770(x)
+    end
+end
+
+def fun_l1_n120(x)
+    if (x < 1)
+        fun_l2_n24(x)
+    else
+        fun_l2_n269(x)
+    end
+end
+
+def fun_l1_n121(x)
+    if (x < 1)
+        fun_l2_n57(x)
+    else
+        fun_l2_n2(x)
+    end
+end
+
+def fun_l1_n122(x)
+    if (x < 1)
+        fun_l2_n421(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n123(x)
+    if (x < 1)
+        fun_l2_n623(x)
+    else
+        fun_l2_n985(x)
+    end
+end
+
+def fun_l1_n124(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n530(x)
+    end
+end
+
+def fun_l1_n125(x)
+    if (x < 1)
+        fun_l2_n565(x)
+    else
+        fun_l2_n155(x)
+    end
+end
+
+def fun_l1_n126(x)
+    if (x < 1)
+        fun_l2_n135(x)
+    else
+        fun_l2_n971(x)
+    end
+end
+
+def fun_l1_n127(x)
+    if (x < 1)
+        fun_l2_n691(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n128(x)
+    if (x < 1)
+        fun_l2_n555(x)
+    else
+        fun_l2_n67(x)
+    end
+end
+
+def fun_l1_n129(x)
+    if (x < 1)
+        fun_l2_n95(x)
+    else
+        fun_l2_n192(x)
+    end
+end
+
+def fun_l1_n130(x)
+    if (x < 1)
+        fun_l2_n432(x)
+    else
+        fun_l2_n771(x)
+    end
+end
+
+def fun_l1_n131(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n539(x)
+    end
+end
+
+def fun_l1_n132(x)
+    if (x < 1)
+        fun_l2_n809(x)
+    else
+        fun_l2_n902(x)
+    end
+end
+
+def fun_l1_n133(x)
+    if (x < 1)
+        fun_l2_n95(x)
+    else
+        fun_l2_n928(x)
+    end
+end
+
+def fun_l1_n134(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n832(x)
+    end
+end
+
+def fun_l1_n135(x)
+    if (x < 1)
+        fun_l2_n231(x)
+    else
+        fun_l2_n392(x)
+    end
+end
+
+def fun_l1_n136(x)
+    if (x < 1)
+        fun_l2_n102(x)
+    else
+        fun_l2_n449(x)
+    end
+end
+
+def fun_l1_n137(x)
+    if (x < 1)
+        fun_l2_n196(x)
+    else
+        fun_l2_n909(x)
+    end
+end
+
+def fun_l1_n138(x)
+    if (x < 1)
+        fun_l2_n449(x)
+    else
+        fun_l2_n190(x)
+    end
+end
+
+def fun_l1_n139(x)
+    if (x < 1)
+        fun_l2_n638(x)
+    else
+        fun_l2_n149(x)
+    end
+end
+
+def fun_l1_n140(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n297(x)
+    end
+end
+
+def fun_l1_n141(x)
+    if (x < 1)
+        fun_l2_n476(x)
+    else
+        fun_l2_n161(x)
+    end
+end
+
+def fun_l1_n142(x)
+    if (x < 1)
+        fun_l2_n893(x)
+    else
+        fun_l2_n686(x)
+    end
+end
+
+def fun_l1_n143(x)
+    if (x < 1)
+        fun_l2_n958(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n144(x)
+    if (x < 1)
+        fun_l2_n104(x)
+    else
+        fun_l2_n912(x)
+    end
+end
+
+def fun_l1_n145(x)
+    if (x < 1)
+        fun_l2_n332(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n146(x)
+    if (x < 1)
+        fun_l2_n40(x)
+    else
+        fun_l2_n468(x)
+    end
+end
+
+def fun_l1_n147(x)
+    if (x < 1)
+        fun_l2_n771(x)
+    else
+        fun_l2_n314(x)
+    end
+end
+
+def fun_l1_n148(x)
+    if (x < 1)
+        fun_l2_n340(x)
+    else
+        fun_l2_n203(x)
+    end
+end
+
+def fun_l1_n149(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n265(x)
+    end
+end
+
+def fun_l1_n150(x)
+    if (x < 1)
+        fun_l2_n11(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n151(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n317(x)
+    end
+end
+
+def fun_l1_n152(x)
+    if (x < 1)
+        fun_l2_n140(x)
+    else
+        fun_l2_n906(x)
+    end
+end
+
+def fun_l1_n153(x)
+    if (x < 1)
+        fun_l2_n75(x)
+    else
+        fun_l2_n485(x)
+    end
+end
+
+def fun_l1_n154(x)
+    if (x < 1)
+        fun_l2_n842(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n155(x)
+    if (x < 1)
+        fun_l2_n346(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n156(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n373(x)
+    end
+end
+
+def fun_l1_n157(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n99(x)
+    end
+end
+
+def fun_l1_n158(x)
+    if (x < 1)
+        fun_l2_n540(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n159(x)
+    if (x < 1)
+        fun_l2_n785(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n160(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n222(x)
+    end
+end
+
+def fun_l1_n161(x)
+    if (x < 1)
+        fun_l2_n29(x)
+    else
+        fun_l2_n946(x)
+    end
+end
+
+def fun_l1_n162(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n758(x)
+    end
+end
+
+def fun_l1_n163(x)
+    if (x < 1)
+        fun_l2_n861(x)
+    else
+        fun_l2_n799(x)
+    end
+end
+
+def fun_l1_n164(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n413(x)
+    end
+end
+
+def fun_l1_n165(x)
+    if (x < 1)
+        fun_l2_n160(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n166(x)
+    if (x < 1)
+        fun_l2_n114(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n167(x)
+    if (x < 1)
+        fun_l2_n806(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n168(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n53(x)
+    end
+end
+
+def fun_l1_n169(x)
+    if (x < 1)
+        fun_l2_n644(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n170(x)
+    if (x < 1)
+        fun_l2_n172(x)
+    else
+        fun_l2_n289(x)
+    end
+end
+
+def fun_l1_n171(x)
+    if (x < 1)
+        fun_l2_n920(x)
+    else
+        fun_l2_n851(x)
+    end
+end
+
+def fun_l1_n172(x)
+    if (x < 1)
+        fun_l2_n552(x)
+    else
+        fun_l2_n822(x)
+    end
+end
+
+def fun_l1_n173(x)
+    if (x < 1)
+        fun_l2_n747(x)
+    else
+        fun_l2_n265(x)
+    end
+end
+
+def fun_l1_n174(x)
+    if (x < 1)
+        fun_l2_n287(x)
+    else
+        fun_l2_n762(x)
+    end
+end
+
+def fun_l1_n175(x)
+    if (x < 1)
+        fun_l2_n627(x)
+    else
+        fun_l2_n951(x)
+    end
+end
+
+def fun_l1_n176(x)
+    if (x < 1)
+        fun_l2_n459(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n177(x)
+    if (x < 1)
+        fun_l2_n214(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n178(x)
+    if (x < 1)
+        fun_l2_n620(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n179(x)
+    if (x < 1)
+        fun_l2_n136(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n180(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n672(x)
+    end
+end
+
+def fun_l1_n181(x)
+    if (x < 1)
+        fun_l2_n218(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n182(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n525(x)
+    end
+end
+
+def fun_l1_n183(x)
+    if (x < 1)
+        fun_l2_n648(x)
+    else
+        fun_l2_n725(x)
+    end
+end
+
+def fun_l1_n184(x)
+    if (x < 1)
+        fun_l2_n579(x)
+    else
+        fun_l2_n974(x)
+    end
+end
+
+def fun_l1_n185(x)
+    if (x < 1)
+        fun_l2_n10(x)
+    else
+        fun_l2_n514(x)
+    end
+end
+
+def fun_l1_n186(x)
+    if (x < 1)
+        fun_l2_n829(x)
+    else
+        fun_l2_n754(x)
+    end
+end
+
+def fun_l1_n187(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n401(x)
+    end
+end
+
+def fun_l1_n188(x)
+    if (x < 1)
+        fun_l2_n839(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n189(x)
+    if (x < 1)
+        fun_l2_n553(x)
+    else
+        fun_l2_n553(x)
+    end
+end
+
+def fun_l1_n190(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n191(x)
+    if (x < 1)
+        fun_l2_n275(x)
+    else
+        fun_l2_n11(x)
+    end
+end
+
+def fun_l1_n192(x)
+    if (x < 1)
+        fun_l2_n1(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n193(x)
+    if (x < 1)
+        fun_l2_n569(x)
+    else
+        fun_l2_n557(x)
+    end
+end
+
+def fun_l1_n194(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n195(x)
+    if (x < 1)
+        fun_l2_n297(x)
+    else
+        fun_l2_n813(x)
+    end
+end
+
+def fun_l1_n196(x)
+    if (x < 1)
+        fun_l2_n565(x)
+    else
+        fun_l2_n514(x)
+    end
+end
+
+def fun_l1_n197(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n64(x)
+    end
+end
+
+def fun_l1_n198(x)
+    if (x < 1)
+        fun_l2_n182(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n199(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n506(x)
+    end
+end
+
+def fun_l1_n200(x)
+    if (x < 1)
+        fun_l2_n834(x)
+    else
+        fun_l2_n348(x)
+    end
+end
+
+def fun_l1_n201(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n432(x)
+    end
+end
+
+def fun_l1_n202(x)
+    if (x < 1)
+        fun_l2_n115(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n203(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n4(x)
+    end
+end
+
+def fun_l1_n204(x)
+    if (x < 1)
+        fun_l2_n951(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n205(x)
+    if (x < 1)
+        fun_l2_n703(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n206(x)
+    if (x < 1)
+        fun_l2_n614(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n207(x)
+    if (x < 1)
+        fun_l2_n210(x)
+    else
+        fun_l2_n139(x)
+    end
+end
+
+def fun_l1_n208(x)
+    if (x < 1)
+        fun_l2_n471(x)
+    else
+        fun_l2_n346(x)
+    end
+end
+
+def fun_l1_n209(x)
+    if (x < 1)
+        fun_l2_n922(x)
+    else
+        fun_l2_n54(x)
+    end
+end
+
+def fun_l1_n210(x)
+    if (x < 1)
+        fun_l2_n494(x)
+    else
+        fun_l2_n41(x)
+    end
+end
+
+def fun_l1_n211(x)
+    if (x < 1)
+        fun_l2_n87(x)
+    else
+        fun_l2_n190(x)
+    end
+end
+
+def fun_l1_n212(x)
+    if (x < 1)
+        fun_l2_n458(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n213(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n214(x)
+    if (x < 1)
+        fun_l2_n706(x)
+    else
+        fun_l2_n694(x)
+    end
+end
+
+def fun_l1_n215(x)
+    if (x < 1)
+        fun_l2_n116(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n216(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n857(x)
+    end
+end
+
+def fun_l1_n217(x)
+    if (x < 1)
+        fun_l2_n643(x)
+    else
+        fun_l2_n289(x)
+    end
+end
+
+def fun_l1_n218(x)
+    if (x < 1)
+        fun_l2_n535(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n219(x)
+    if (x < 1)
+        fun_l2_n478(x)
+    else
+        fun_l2_n793(x)
+    end
+end
+
+def fun_l1_n220(x)
+    if (x < 1)
+        fun_l2_n57(x)
+    else
+        fun_l2_n64(x)
+    end
+end
+
+def fun_l1_n221(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n222(x)
+    if (x < 1)
+        fun_l2_n438(x)
+    else
+        fun_l2_n616(x)
+    end
+end
+
+def fun_l1_n223(x)
+    if (x < 1)
+        fun_l2_n900(x)
+    else
+        fun_l2_n744(x)
+    end
+end
+
+def fun_l1_n224(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n225(x)
+    if (x < 1)
+        fun_l2_n916(x)
+    else
+        fun_l2_n471(x)
+    end
+end
+
+def fun_l1_n226(x)
+    if (x < 1)
+        fun_l2_n236(x)
+    else
+        fun_l2_n980(x)
+    end
+end
+
+def fun_l1_n227(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n291(x)
+    end
+end
+
+def fun_l1_n228(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n353(x)
+    end
+end
+
+def fun_l1_n229(x)
+    if (x < 1)
+        fun_l2_n404(x)
+    else
+        fun_l2_n254(x)
+    end
+end
+
+def fun_l1_n230(x)
+    if (x < 1)
+        fun_l2_n641(x)
+    else
+        fun_l2_n464(x)
+    end
+end
+
+def fun_l1_n231(x)
+    if (x < 1)
+        fun_l2_n592(x)
+    else
+        fun_l2_n646(x)
+    end
+end
+
+def fun_l1_n232(x)
+    if (x < 1)
+        fun_l2_n162(x)
+    else
+        fun_l2_n215(x)
+    end
+end
+
+def fun_l1_n233(x)
+    if (x < 1)
+        fun_l2_n219(x)
+    else
+        fun_l2_n772(x)
+    end
+end
+
+def fun_l1_n234(x)
+    if (x < 1)
+        fun_l2_n304(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n235(x)
+    if (x < 1)
+        fun_l2_n610(x)
+    else
+        fun_l2_n716(x)
+    end
+end
+
+def fun_l1_n236(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n237(x)
+    if (x < 1)
+        fun_l2_n288(x)
+    else
+        fun_l2_n261(x)
+    end
+end
+
+def fun_l1_n238(x)
+    if (x < 1)
+        fun_l2_n139(x)
+    else
+        fun_l2_n18(x)
+    end
+end
+
+def fun_l1_n239(x)
+    if (x < 1)
+        fun_l2_n559(x)
+    else
+        fun_l2_n148(x)
+    end
+end
+
+def fun_l1_n240(x)
+    if (x < 1)
+        fun_l2_n520(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n241(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n196(x)
+    end
+end
+
+def fun_l1_n242(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n540(x)
+    end
+end
+
+def fun_l1_n243(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n890(x)
+    end
+end
+
+def fun_l1_n244(x)
+    if (x < 1)
+        fun_l2_n559(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n245(x)
+    if (x < 1)
+        fun_l2_n110(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n246(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n247(x)
+    if (x < 1)
+        fun_l2_n118(x)
+    else
+        fun_l2_n209(x)
+    end
+end
+
+def fun_l1_n248(x)
+    if (x < 1)
+        fun_l2_n764(x)
+    else
+        fun_l2_n932(x)
+    end
+end
+
+def fun_l1_n249(x)
+    if (x < 1)
+        fun_l2_n991(x)
+    else
+        fun_l2_n828(x)
+    end
+end
+
+def fun_l1_n250(x)
+    if (x < 1)
+        fun_l2_n354(x)
+    else
+        fun_l2_n53(x)
+    end
+end
+
+def fun_l1_n251(x)
+    if (x < 1)
+        fun_l2_n63(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n252(x)
+    if (x < 1)
+        fun_l2_n874(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n253(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n57(x)
+    end
+end
+
+def fun_l1_n254(x)
+    if (x < 1)
+        fun_l2_n302(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n255(x)
+    if (x < 1)
+        fun_l2_n122(x)
+    else
+        fun_l2_n888(x)
+    end
+end
+
+def fun_l1_n256(x)
+    if (x < 1)
+        fun_l2_n326(x)
+    else
+        fun_l2_n616(x)
+    end
+end
+
+def fun_l1_n257(x)
+    if (x < 1)
+        fun_l2_n77(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n258(x)
+    if (x < 1)
+        fun_l2_n785(x)
+    else
+        fun_l2_n229(x)
+    end
+end
+
+def fun_l1_n259(x)
+    if (x < 1)
+        fun_l2_n504(x)
+    else
+        fun_l2_n766(x)
+    end
+end
+
+def fun_l1_n260(x)
+    if (x < 1)
+        fun_l2_n857(x)
+    else
+        fun_l2_n823(x)
+    end
+end
+
+def fun_l1_n261(x)
+    if (x < 1)
+        fun_l2_n72(x)
+    else
+        fun_l2_n875(x)
+    end
+end
+
+def fun_l1_n262(x)
+    if (x < 1)
+        fun_l2_n215(x)
+    else
+        fun_l2_n549(x)
+    end
+end
+
+def fun_l1_n263(x)
+    if (x < 1)
+        fun_l2_n232(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n264(x)
+    if (x < 1)
+        fun_l2_n183(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n265(x)
+    if (x < 1)
+        fun_l2_n906(x)
+    else
+        fun_l2_n154(x)
+    end
+end
+
+def fun_l1_n266(x)
+    if (x < 1)
+        fun_l2_n234(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n267(x)
+    if (x < 1)
+        fun_l2_n882(x)
+    else
+        fun_l2_n802(x)
+    end
+end
+
+def fun_l1_n268(x)
+    if (x < 1)
+        fun_l2_n844(x)
+    else
+        fun_l2_n430(x)
+    end
+end
+
+def fun_l1_n269(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n270(x)
+    if (x < 1)
+        fun_l2_n88(x)
+    else
+        fun_l2_n439(x)
+    end
+end
+
+def fun_l1_n271(x)
+    if (x < 1)
+        fun_l2_n334(x)
+    else
+        fun_l2_n508(x)
+    end
+end
+
+def fun_l1_n272(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n562(x)
+    end
+end
+
+def fun_l1_n273(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n356(x)
+    end
+end
+
+def fun_l1_n274(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n511(x)
+    end
+end
+
+def fun_l1_n275(x)
+    if (x < 1)
+        fun_l2_n309(x)
+    else
+        fun_l2_n840(x)
+    end
+end
+
+def fun_l1_n276(x)
+    if (x < 1)
+        fun_l2_n729(x)
+    else
+        fun_l2_n72(x)
+    end
+end
+
+def fun_l1_n277(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n278(x)
+    if (x < 1)
+        fun_l2_n664(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n279(x)
+    if (x < 1)
+        fun_l2_n225(x)
+    else
+        fun_l2_n403(x)
+    end
+end
+
+def fun_l1_n280(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n396(x)
+    end
+end
+
+def fun_l1_n281(x)
+    if (x < 1)
+        fun_l2_n114(x)
+    else
+        fun_l2_n114(x)
+    end
+end
+
+def fun_l1_n282(x)
+    if (x < 1)
+        fun_l2_n568(x)
+    else
+        fun_l2_n610(x)
+    end
+end
+
+def fun_l1_n283(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n990(x)
+    end
+end
+
+def fun_l1_n284(x)
+    if (x < 1)
+        fun_l2_n773(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n285(x)
+    if (x < 1)
+        fun_l2_n695(x)
+    else
+        fun_l2_n101(x)
+    end
+end
+
+def fun_l1_n286(x)
+    if (x < 1)
+        fun_l2_n239(x)
+    else
+        fun_l2_n242(x)
+    end
+end
+
+def fun_l1_n287(x)
+    if (x < 1)
+        fun_l2_n191(x)
+    else
+        fun_l2_n839(x)
+    end
+end
+
+def fun_l1_n288(x)
+    if (x < 1)
+        fun_l2_n246(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n289(x)
+    if (x < 1)
+        fun_l2_n300(x)
+    else
+        fun_l2_n975(x)
+    end
+end
+
+def fun_l1_n290(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n291(x)
+    if (x < 1)
+        fun_l2_n33(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n292(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n293(x)
+    if (x < 1)
+        fun_l2_n782(x)
+    else
+        fun_l2_n521(x)
+    end
+end
+
+def fun_l1_n294(x)
+    if (x < 1)
+        fun_l2_n995(x)
+    else
+        fun_l2_n944(x)
+    end
+end
+
+def fun_l1_n295(x)
+    if (x < 1)
+        fun_l2_n700(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n296(x)
+    if (x < 1)
+        fun_l2_n866(x)
+    else
+        fun_l2_n566(x)
+    end
+end
+
+def fun_l1_n297(x)
+    if (x < 1)
+        fun_l2_n373(x)
+    else
+        fun_l2_n881(x)
+    end
+end
+
+def fun_l1_n298(x)
+    if (x < 1)
+        fun_l2_n382(x)
+    else
+        fun_l2_n729(x)
+    end
+end
+
+def fun_l1_n299(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n192(x)
+    end
+end
+
+def fun_l1_n300(x)
+    if (x < 1)
+        fun_l2_n65(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n301(x)
+    if (x < 1)
+        fun_l2_n513(x)
+    else
+        fun_l2_n617(x)
+    end
+end
+
+def fun_l1_n302(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n303(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n774(x)
+    end
+end
+
+def fun_l1_n304(x)
+    if (x < 1)
+        fun_l2_n439(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n305(x)
+    if (x < 1)
+        fun_l2_n181(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n306(x)
+    if (x < 1)
+        fun_l2_n117(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n307(x)
+    if (x < 1)
+        fun_l2_n499(x)
+    else
+        fun_l2_n183(x)
+    end
+end
+
+def fun_l1_n308(x)
+    if (x < 1)
+        fun_l2_n358(x)
+    else
+        fun_l2_n226(x)
+    end
+end
+
+def fun_l1_n309(x)
+    if (x < 1)
+        fun_l2_n227(x)
+    else
+        fun_l2_n425(x)
+    end
+end
+
+def fun_l1_n310(x)
+    if (x < 1)
+        fun_l2_n724(x)
+    else
+        fun_l2_n278(x)
+    end
+end
+
+def fun_l1_n311(x)
+    if (x < 1)
+        fun_l2_n784(x)
+    else
+        fun_l2_n888(x)
+    end
+end
+
+def fun_l1_n312(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n849(x)
+    end
+end
+
+def fun_l1_n313(x)
+    if (x < 1)
+        fun_l2_n921(x)
+    else
+        fun_l2_n31(x)
+    end
+end
+
+def fun_l1_n314(x)
+    if (x < 1)
+        fun_l2_n469(x)
+    else
+        fun_l2_n856(x)
+    end
+end
+
+def fun_l1_n315(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n949(x)
+    end
+end
+
+def fun_l1_n316(x)
+    if (x < 1)
+        fun_l2_n216(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n317(x)
+    if (x < 1)
+        fun_l2_n591(x)
+    else
+        fun_l2_n203(x)
+    end
+end
+
+def fun_l1_n318(x)
+    if (x < 1)
+        fun_l2_n19(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n319(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n996(x)
+    end
+end
+
+def fun_l1_n320(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n321(x)
+    if (x < 1)
+        fun_l2_n708(x)
+    else
+        fun_l2_n150(x)
+    end
+end
+
+def fun_l1_n322(x)
+    if (x < 1)
+        fun_l2_n324(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n323(x)
+    if (x < 1)
+        fun_l2_n427(x)
+    else
+        fun_l2_n472(x)
+    end
+end
+
+def fun_l1_n324(x)
+    if (x < 1)
+        fun_l2_n847(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n325(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n854(x)
+    end
+end
+
+def fun_l1_n326(x)
+    if (x < 1)
+        fun_l2_n635(x)
+    else
+        fun_l2_n276(x)
+    end
+end
+
+def fun_l1_n327(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n328(x)
+    if (x < 1)
+        fun_l2_n979(x)
+    else
+        fun_l2_n558(x)
+    end
+end
+
+def fun_l1_n329(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n696(x)
+    end
+end
+
+def fun_l1_n330(x)
+    if (x < 1)
+        fun_l2_n483(x)
+    else
+        fun_l2_n218(x)
+    end
+end
+
+def fun_l1_n331(x)
+    if (x < 1)
+        fun_l2_n3(x)
+    else
+        fun_l2_n324(x)
+    end
+end
+
+def fun_l1_n332(x)
+    if (x < 1)
+        fun_l2_n396(x)
+    else
+        fun_l2_n718(x)
+    end
+end
+
+def fun_l1_n333(x)
+    if (x < 1)
+        fun_l2_n973(x)
+    else
+        fun_l2_n663(x)
+    end
+end
+
+def fun_l1_n334(x)
+    if (x < 1)
+        fun_l2_n441(x)
+    else
+        fun_l2_n468(x)
+    end
+end
+
+def fun_l1_n335(x)
+    if (x < 1)
+        fun_l2_n511(x)
+    else
+        fun_l2_n455(x)
+    end
+end
+
+def fun_l1_n336(x)
+    if (x < 1)
+        fun_l2_n732(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n337(x)
+    if (x < 1)
+        fun_l2_n484(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n338(x)
+    if (x < 1)
+        fun_l2_n604(x)
+    else
+        fun_l2_n683(x)
+    end
+end
+
+def fun_l1_n339(x)
+    if (x < 1)
+        fun_l2_n334(x)
+    else
+        fun_l2_n710(x)
+    end
+end
+
+def fun_l1_n340(x)
+    if (x < 1)
+        fun_l2_n233(x)
+    else
+        fun_l2_n394(x)
+    end
+end
+
+def fun_l1_n341(x)
+    if (x < 1)
+        fun_l2_n948(x)
+    else
+        fun_l2_n473(x)
+    end
+end
+
+def fun_l1_n342(x)
+    if (x < 1)
+        fun_l2_n858(x)
+    else
+        fun_l2_n466(x)
+    end
+end
+
+def fun_l1_n343(x)
+    if (x < 1)
+        fun_l2_n647(x)
+    else
+        fun_l2_n604(x)
+    end
+end
+
+def fun_l1_n344(x)
+    if (x < 1)
+        fun_l2_n872(x)
+    else
+        fun_l2_n965(x)
+    end
+end
+
+def fun_l1_n345(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n701(x)
+    end
+end
+
+def fun_l1_n346(x)
+    if (x < 1)
+        fun_l2_n75(x)
+    else
+        fun_l2_n332(x)
+    end
+end
+
+def fun_l1_n347(x)
+    if (x < 1)
+        fun_l2_n873(x)
+    else
+        fun_l2_n575(x)
+    end
+end
+
+def fun_l1_n348(x)
+    if (x < 1)
+        fun_l2_n303(x)
+    else
+        fun_l2_n445(x)
+    end
+end
+
+def fun_l1_n349(x)
+    if (x < 1)
+        fun_l2_n45(x)
+    else
+        fun_l2_n312(x)
+    end
+end
+
+def fun_l1_n350(x)
+    if (x < 1)
+        fun_l2_n751(x)
+    else
+        fun_l2_n316(x)
+    end
+end
+
+def fun_l1_n351(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n165(x)
+    end
+end
+
+def fun_l1_n352(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n595(x)
+    end
+end
+
+def fun_l1_n353(x)
+    if (x < 1)
+        fun_l2_n221(x)
+    else
+        fun_l2_n827(x)
+    end
+end
+
+def fun_l1_n354(x)
+    if (x < 1)
+        fun_l2_n290(x)
+    else
+        fun_l2_n27(x)
+    end
+end
+
+def fun_l1_n355(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n28(x)
+    end
+end
+
+def fun_l1_n356(x)
+    if (x < 1)
+        fun_l2_n474(x)
+    else
+        fun_l2_n811(x)
+    end
+end
+
+def fun_l1_n357(x)
+    if (x < 1)
+        fun_l2_n90(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n358(x)
+    if (x < 1)
+        fun_l2_n66(x)
+    else
+        fun_l2_n234(x)
+    end
+end
+
+def fun_l1_n359(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n674(x)
+    end
+end
+
+def fun_l1_n360(x)
+    if (x < 1)
+        fun_l2_n449(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n361(x)
+    if (x < 1)
+        fun_l2_n790(x)
+    else
+        fun_l2_n835(x)
+    end
+end
+
+def fun_l1_n362(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n22(x)
+    end
+end
+
+def fun_l1_n363(x)
+    if (x < 1)
+        fun_l2_n982(x)
+    else
+        fun_l2_n449(x)
+    end
+end
+
+def fun_l1_n364(x)
+    if (x < 1)
+        fun_l2_n980(x)
+    else
+        fun_l2_n861(x)
+    end
+end
+
+def fun_l1_n365(x)
+    if (x < 1)
+        fun_l2_n673(x)
+    else
+        fun_l2_n267(x)
+    end
+end
+
+def fun_l1_n366(x)
+    if (x < 1)
+        fun_l2_n862(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n367(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n275(x)
+    end
+end
+
+def fun_l1_n368(x)
+    if (x < 1)
+        fun_l2_n370(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n369(x)
+    if (x < 1)
+        fun_l2_n680(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n370(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n724(x)
+    end
+end
+
+def fun_l1_n371(x)
+    if (x < 1)
+        fun_l2_n331(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n372(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n350(x)
+    end
+end
+
+def fun_l1_n373(x)
+    if (x < 1)
+        fun_l2_n734(x)
+    else
+        fun_l2_n172(x)
+    end
+end
+
+def fun_l1_n374(x)
+    if (x < 1)
+        fun_l2_n657(x)
+    else
+        fun_l2_n765(x)
+    end
+end
+
+def fun_l1_n375(x)
+    if (x < 1)
+        fun_l2_n950(x)
+    else
+        fun_l2_n85(x)
+    end
+end
+
+def fun_l1_n376(x)
+    if (x < 1)
+        fun_l2_n276(x)
+    else
+        fun_l2_n892(x)
+    end
+end
+
+def fun_l1_n377(x)
+    if (x < 1)
+        fun_l2_n430(x)
+    else
+        fun_l2_n173(x)
+    end
+end
+
+def fun_l1_n378(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n876(x)
+    end
+end
+
+def fun_l1_n379(x)
+    if (x < 1)
+        fun_l2_n981(x)
+    else
+        fun_l2_n314(x)
+    end
+end
+
+def fun_l1_n380(x)
+    if (x < 1)
+        fun_l2_n680(x)
+    else
+        fun_l2_n600(x)
+    end
+end
+
+def fun_l1_n381(x)
+    if (x < 1)
+        fun_l2_n54(x)
+    else
+        fun_l2_n158(x)
+    end
+end
+
+def fun_l1_n382(x)
+    if (x < 1)
+        fun_l2_n692(x)
+    else
+        fun_l2_n673(x)
+    end
+end
+
+def fun_l1_n383(x)
+    if (x < 1)
+        fun_l2_n393(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n384(x)
+    if (x < 1)
+        fun_l2_n899(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n385(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n846(x)
+    end
+end
+
+def fun_l1_n386(x)
+    if (x < 1)
+        fun_l2_n291(x)
+    else
+        fun_l2_n864(x)
+    end
+end
+
+def fun_l1_n387(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n466(x)
+    end
+end
+
+def fun_l1_n388(x)
+    if (x < 1)
+        fun_l2_n883(x)
+    else
+        fun_l2_n613(x)
+    end
+end
+
+def fun_l1_n389(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n169(x)
+    end
+end
+
+def fun_l1_n390(x)
+    if (x < 1)
+        fun_l2_n94(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n391(x)
+    if (x < 1)
+        fun_l2_n874(x)
+    else
+        fun_l2_n400(x)
+    end
+end
+
+def fun_l1_n392(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n393(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n760(x)
+    end
+end
+
+def fun_l1_n394(x)
+    if (x < 1)
+        fun_l2_n947(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n395(x)
+    if (x < 1)
+        fun_l2_n833(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n396(x)
+    if (x < 1)
+        fun_l2_n429(x)
+    else
+        fun_l2_n280(x)
+    end
+end
+
+def fun_l1_n397(x)
+    if (x < 1)
+        fun_l2_n132(x)
+    else
+        fun_l2_n486(x)
+    end
+end
+
+def fun_l1_n398(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n135(x)
+    end
+end
+
+def fun_l1_n399(x)
+    if (x < 1)
+        fun_l2_n804(x)
+    else
+        fun_l2_n406(x)
+    end
+end
+
+def fun_l1_n400(x)
+    if (x < 1)
+        fun_l2_n661(x)
+    else
+        fun_l2_n216(x)
+    end
+end
+
+def fun_l1_n401(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n849(x)
+    end
+end
+
+def fun_l1_n402(x)
+    if (x < 1)
+        fun_l2_n13(x)
+    else
+        fun_l2_n205(x)
+    end
+end
+
+def fun_l1_n403(x)
+    if (x < 1)
+        fun_l2_n911(x)
+    else
+        fun_l2_n63(x)
+    end
+end
+
+def fun_l1_n404(x)
+    if (x < 1)
+        fun_l2_n518(x)
+    else
+        fun_l2_n845(x)
+    end
+end
+
+def fun_l1_n405(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n406(x)
+    if (x < 1)
+        fun_l2_n373(x)
+    else
+        fun_l2_n485(x)
+    end
+end
+
+def fun_l1_n407(x)
+    if (x < 1)
+        fun_l2_n402(x)
+    else
+        fun_l2_n582(x)
+    end
+end
+
+def fun_l1_n408(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n420(x)
+    end
+end
+
+def fun_l1_n409(x)
+    if (x < 1)
+        fun_l2_n728(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n410(x)
+    if (x < 1)
+        fun_l2_n189(x)
+    else
+        fun_l2_n588(x)
+    end
+end
+
+def fun_l1_n411(x)
+    if (x < 1)
+        fun_l2_n51(x)
+    else
+        fun_l2_n23(x)
+    end
+end
+
+def fun_l1_n412(x)
+    if (x < 1)
+        fun_l2_n548(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n413(x)
+    if (x < 1)
+        fun_l2_n763(x)
+    else
+        fun_l2_n581(x)
+    end
+end
+
+def fun_l1_n414(x)
+    if (x < 1)
+        fun_l2_n650(x)
+    else
+        fun_l2_n535(x)
+    end
+end
+
+def fun_l1_n415(x)
+    if (x < 1)
+        fun_l2_n500(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n416(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n154(x)
+    end
+end
+
+def fun_l1_n417(x)
+    if (x < 1)
+        fun_l2_n685(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n418(x)
+    if (x < 1)
+        fun_l2_n849(x)
+    else
+        fun_l2_n91(x)
+    end
+end
+
+def fun_l1_n419(x)
+    if (x < 1)
+        fun_l2_n629(x)
+    else
+        fun_l2_n698(x)
+    end
+end
+
+def fun_l1_n420(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n421(x)
+    if (x < 1)
+        fun_l2_n8(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n422(x)
+    if (x < 1)
+        fun_l2_n294(x)
+    else
+        fun_l2_n338(x)
+    end
+end
+
+def fun_l1_n423(x)
+    if (x < 1)
+        fun_l2_n408(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n424(x)
+    if (x < 1)
+        fun_l2_n349(x)
+    else
+        fun_l2_n896(x)
+    end
+end
+
+def fun_l1_n425(x)
+    if (x < 1)
+        fun_l2_n950(x)
+    else
+        fun_l2_n186(x)
+    end
+end
+
+def fun_l1_n426(x)
+    if (x < 1)
+        fun_l2_n817(x)
+    else
+        fun_l2_n605(x)
+    end
+end
+
+def fun_l1_n427(x)
+    if (x < 1)
+        fun_l2_n317(x)
+    else
+        fun_l2_n31(x)
+    end
+end
+
+def fun_l1_n428(x)
+    if (x < 1)
+        fun_l2_n804(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n429(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n430(x)
+    if (x < 1)
+        fun_l2_n822(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n431(x)
+    if (x < 1)
+        fun_l2_n412(x)
+    else
+        fun_l2_n366(x)
+    end
+end
+
+def fun_l1_n432(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n601(x)
+    end
+end
+
+def fun_l1_n433(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n878(x)
+    end
+end
+
+def fun_l1_n434(x)
+    if (x < 1)
+        fun_l2_n551(x)
+    else
+        fun_l2_n172(x)
+    end
+end
+
+def fun_l1_n435(x)
+    if (x < 1)
+        fun_l2_n914(x)
+    else
+        fun_l2_n640(x)
+    end
+end
+
+def fun_l1_n436(x)
+    if (x < 1)
+        fun_l2_n957(x)
+    else
+        fun_l2_n846(x)
+    end
+end
+
+def fun_l1_n437(x)
+    if (x < 1)
+        fun_l2_n622(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n438(x)
+    if (x < 1)
+        fun_l2_n830(x)
+    else
+        fun_l2_n537(x)
+    end
+end
+
+def fun_l1_n439(x)
+    if (x < 1)
+        fun_l2_n415(x)
+    else
+        fun_l2_n863(x)
+    end
+end
+
+def fun_l1_n440(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n441(x)
+    if (x < 1)
+        fun_l2_n525(x)
+    else
+        fun_l2_n656(x)
+    end
+end
+
+def fun_l1_n442(x)
+    if (x < 1)
+        fun_l2_n284(x)
+    else
+        fun_l2_n722(x)
+    end
+end
+
+def fun_l1_n443(x)
+    if (x < 1)
+        fun_l2_n485(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n444(x)
+    if (x < 1)
+        fun_l2_n268(x)
+    else
+        fun_l2_n443(x)
+    end
+end
+
+def fun_l1_n445(x)
+    if (x < 1)
+        fun_l2_n743(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n446(x)
+    if (x < 1)
+        fun_l2_n651(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n447(x)
+    if (x < 1)
+        fun_l2_n936(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n448(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n449(x)
+    if (x < 1)
+        fun_l2_n218(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n450(x)
+    if (x < 1)
+        fun_l2_n686(x)
+    else
+        fun_l2_n629(x)
+    end
+end
+
+def fun_l1_n451(x)
+    if (x < 1)
+        fun_l2_n648(x)
+    else
+        fun_l2_n322(x)
+    end
+end
+
+def fun_l1_n452(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n720(x)
+    end
+end
+
+def fun_l1_n453(x)
+    if (x < 1)
+        fun_l2_n53(x)
+    else
+        fun_l2_n830(x)
+    end
+end
+
+def fun_l1_n454(x)
+    if (x < 1)
+        fun_l2_n315(x)
+    else
+        fun_l2_n742(x)
+    end
+end
+
+def fun_l1_n455(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n111(x)
+    end
+end
+
+def fun_l1_n456(x)
+    if (x < 1)
+        fun_l2_n924(x)
+    else
+        fun_l2_n109(x)
+    end
+end
+
+def fun_l1_n457(x)
+    if (x < 1)
+        fun_l2_n249(x)
+    else
+        fun_l2_n865(x)
+    end
+end
+
+def fun_l1_n458(x)
+    if (x < 1)
+        fun_l2_n650(x)
+    else
+        fun_l2_n960(x)
+    end
+end
+
+def fun_l1_n459(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n460(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n322(x)
+    end
+end
+
+def fun_l1_n461(x)
+    if (x < 1)
+        fun_l2_n366(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n462(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n25(x)
+    end
+end
+
+def fun_l1_n463(x)
+    if (x < 1)
+        fun_l2_n333(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n464(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n465(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n988(x)
+    end
+end
+
+def fun_l1_n466(x)
+    if (x < 1)
+        fun_l2_n580(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n467(x)
+    if (x < 1)
+        fun_l2_n406(x)
+    else
+        fun_l2_n706(x)
+    end
+end
+
+def fun_l1_n468(x)
+    if (x < 1)
+        fun_l2_n858(x)
+    else
+        fun_l2_n393(x)
+    end
+end
+
+def fun_l1_n469(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n470(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n471(x)
+    if (x < 1)
+        fun_l2_n161(x)
+    else
+        fun_l2_n91(x)
+    end
+end
+
+def fun_l1_n472(x)
+    if (x < 1)
+        fun_l2_n98(x)
+    else
+        fun_l2_n661(x)
+    end
+end
+
+def fun_l1_n473(x)
+    if (x < 1)
+        fun_l2_n574(x)
+    else
+        fun_l2_n133(x)
+    end
+end
+
+def fun_l1_n474(x)
+    if (x < 1)
+        fun_l2_n109(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n475(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n584(x)
+    end
+end
+
+def fun_l1_n476(x)
+    if (x < 1)
+        fun_l2_n495(x)
+    else
+        fun_l2_n708(x)
+    end
+end
+
+def fun_l1_n477(x)
+    if (x < 1)
+        fun_l2_n649(x)
+    else
+        fun_l2_n290(x)
+    end
+end
+
+def fun_l1_n478(x)
+    if (x < 1)
+        fun_l2_n718(x)
+    else
+        fun_l2_n998(x)
+    end
+end
+
+def fun_l1_n479(x)
+    if (x < 1)
+        fun_l2_n557(x)
+    else
+        fun_l2_n359(x)
+    end
+end
+
+def fun_l1_n480(x)
+    if (x < 1)
+        fun_l2_n958(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n481(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n124(x)
+    end
+end
+
+def fun_l1_n482(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n170(x)
+    end
+end
+
+def fun_l1_n483(x)
+    if (x < 1)
+        fun_l2_n550(x)
+    else
+        fun_l2_n9(x)
+    end
+end
+
+def fun_l1_n484(x)
+    if (x < 1)
+        fun_l2_n82(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n485(x)
+    if (x < 1)
+        fun_l2_n760(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n486(x)
+    if (x < 1)
+        fun_l2_n550(x)
+    else
+        fun_l2_n881(x)
+    end
+end
+
+def fun_l1_n487(x)
+    if (x < 1)
+        fun_l2_n62(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n488(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n489(x)
+    if (x < 1)
+        fun_l2_n172(x)
+    else
+        fun_l2_n479(x)
+    end
+end
+
+def fun_l1_n490(x)
+    if (x < 1)
+        fun_l2_n821(x)
+    else
+        fun_l2_n767(x)
+    end
+end
+
+def fun_l1_n491(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n492(x)
+    if (x < 1)
+        fun_l2_n158(x)
+    else
+        fun_l2_n725(x)
+    end
+end
+
+def fun_l1_n493(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n767(x)
+    end
+end
+
+def fun_l1_n494(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n458(x)
+    end
+end
+
+def fun_l1_n495(x)
+    if (x < 1)
+        fun_l2_n379(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n496(x)
+    if (x < 1)
+        fun_l2_n996(x)
+    else
+        fun_l2_n296(x)
+    end
+end
+
+def fun_l1_n497(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n481(x)
+    end
+end
+
+def fun_l1_n498(x)
+    if (x < 1)
+        fun_l2_n887(x)
+    else
+        fun_l2_n343(x)
+    end
+end
+
+def fun_l1_n499(x)
+    if (x < 1)
+        fun_l2_n481(x)
+    else
+        fun_l2_n368(x)
+    end
+end
+
+def fun_l1_n500(x)
+    if (x < 1)
+        fun_l2_n738(x)
+    else
+        fun_l2_n349(x)
+    end
+end
+
+def fun_l1_n501(x)
+    if (x < 1)
+        fun_l2_n104(x)
+    else
+        fun_l2_n841(x)
+    end
+end
+
+def fun_l1_n502(x)
+    if (x < 1)
+        fun_l2_n549(x)
+    else
+        fun_l2_n684(x)
+    end
+end
+
+def fun_l1_n503(x)
+    if (x < 1)
+        fun_l2_n726(x)
+    else
+        fun_l2_n41(x)
+    end
+end
+
+def fun_l1_n504(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n830(x)
+    end
+end
+
+def fun_l1_n505(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n815(x)
+    end
+end
+
+def fun_l1_n506(x)
+    if (x < 1)
+        fun_l2_n284(x)
+    else
+        fun_l2_n599(x)
+    end
+end
+
+def fun_l1_n507(x)
+    if (x < 1)
+        fun_l2_n665(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n508(x)
+    if (x < 1)
+        fun_l2_n755(x)
+    else
+        fun_l2_n51(x)
+    end
+end
+
+def fun_l1_n509(x)
+    if (x < 1)
+        fun_l2_n860(x)
+    else
+        fun_l2_n273(x)
+    end
+end
+
+def fun_l1_n510(x)
+    if (x < 1)
+        fun_l2_n967(x)
+    else
+        fun_l2_n141(x)
+    end
+end
+
+def fun_l1_n511(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n512(x)
+    if (x < 1)
+        fun_l2_n784(x)
+    else
+        fun_l2_n941(x)
+    end
+end
+
+def fun_l1_n513(x)
+    if (x < 1)
+        fun_l2_n499(x)
+    else
+        fun_l2_n189(x)
+    end
+end
+
+def fun_l1_n514(x)
+    if (x < 1)
+        fun_l2_n207(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n515(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n316(x)
+    end
+end
+
+def fun_l1_n516(x)
+    if (x < 1)
+        fun_l2_n884(x)
+    else
+        fun_l2_n72(x)
+    end
+end
+
+def fun_l1_n517(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n518(x)
+    if (x < 1)
+        fun_l2_n452(x)
+    else
+        fun_l2_n733(x)
+    end
+end
+
+def fun_l1_n519(x)
+    if (x < 1)
+        fun_l2_n586(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n520(x)
+    if (x < 1)
+        fun_l2_n638(x)
+    else
+        fun_l2_n276(x)
+    end
+end
+
+def fun_l1_n521(x)
+    if (x < 1)
+        fun_l2_n186(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n522(x)
+    if (x < 1)
+        fun_l2_n816(x)
+    else
+        fun_l2_n687(x)
+    end
+end
+
+def fun_l1_n523(x)
+    if (x < 1)
+        fun_l2_n572(x)
+    else
+        fun_l2_n878(x)
+    end
+end
+
+def fun_l1_n524(x)
+    if (x < 1)
+        fun_l2_n528(x)
+    else
+        fun_l2_n188(x)
+    end
+end
+
+def fun_l1_n525(x)
+    if (x < 1)
+        fun_l2_n719(x)
+    else
+        fun_l2_n146(x)
+    end
+end
+
+def fun_l1_n526(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n209(x)
+    end
+end
+
+def fun_l1_n527(x)
+    if (x < 1)
+        fun_l2_n998(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n528(x)
+    if (x < 1)
+        fun_l2_n288(x)
+    else
+        fun_l2_n682(x)
+    end
+end
+
+def fun_l1_n529(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n651(x)
+    end
+end
+
+def fun_l1_n530(x)
+    if (x < 1)
+        fun_l2_n674(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n531(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n532(x)
+    if (x < 1)
+        fun_l2_n188(x)
+    else
+        fun_l2_n218(x)
+    end
+end
+
+def fun_l1_n533(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n541(x)
+    end
+end
+
+def fun_l1_n534(x)
+    if (x < 1)
+        fun_l2_n820(x)
+    else
+        fun_l2_n426(x)
+    end
+end
+
+def fun_l1_n535(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n36(x)
+    end
+end
+
+def fun_l1_n536(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n537(x)
+    if (x < 1)
+        fun_l2_n1(x)
+    else
+        fun_l2_n905(x)
+    end
+end
+
+def fun_l1_n538(x)
+    if (x < 1)
+        fun_l2_n252(x)
+    else
+        fun_l2_n597(x)
+    end
+end
+
+def fun_l1_n539(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n26(x)
+    end
+end
+
+def fun_l1_n540(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n541(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n957(x)
+    end
+end
+
+def fun_l1_n542(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n543(x)
+    if (x < 1)
+        fun_l2_n319(x)
+    else
+        fun_l2_n19(x)
+    end
+end
+
+def fun_l1_n544(x)
+    if (x < 1)
+        fun_l2_n251(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n545(x)
+    if (x < 1)
+        fun_l2_n482(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n546(x)
+    if (x < 1)
+        fun_l2_n338(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n547(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n243(x)
+    end
+end
+
+def fun_l1_n548(x)
+    if (x < 1)
+        fun_l2_n943(x)
+    else
+        fun_l2_n930(x)
+    end
+end
+
+def fun_l1_n549(x)
+    if (x < 1)
+        fun_l2_n775(x)
+    else
+        fun_l2_n338(x)
+    end
+end
+
+def fun_l1_n550(x)
+    if (x < 1)
+        fun_l2_n286(x)
+    else
+        fun_l2_n347(x)
+    end
+end
+
+def fun_l1_n551(x)
+    if (x < 1)
+        fun_l2_n611(x)
+    else
+        fun_l2_n108(x)
+    end
+end
+
+def fun_l1_n552(x)
+    if (x < 1)
+        fun_l2_n515(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n553(x)
+    if (x < 1)
+        fun_l2_n68(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n554(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n280(x)
+    end
+end
+
+def fun_l1_n555(x)
+    if (x < 1)
+        fun_l2_n421(x)
+    else
+        fun_l2_n412(x)
+    end
+end
+
+def fun_l1_n556(x)
+    if (x < 1)
+        fun_l2_n653(x)
+    else
+        fun_l2_n527(x)
+    end
+end
+
+def fun_l1_n557(x)
+    if (x < 1)
+        fun_l2_n181(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n558(x)
+    if (x < 1)
+        fun_l2_n270(x)
+    else
+        fun_l2_n367(x)
+    end
+end
+
+def fun_l1_n559(x)
+    if (x < 1)
+        fun_l2_n323(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n560(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n904(x)
+    end
+end
+
+def fun_l1_n561(x)
+    if (x < 1)
+        fun_l2_n903(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n562(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n880(x)
+    end
+end
+
+def fun_l1_n563(x)
+    if (x < 1)
+        fun_l2_n674(x)
+    else
+        fun_l2_n420(x)
+    end
+end
+
+def fun_l1_n564(x)
+    if (x < 1)
+        fun_l2_n76(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n565(x)
+    if (x < 1)
+        fun_l2_n78(x)
+    else
+        fun_l2_n741(x)
+    end
+end
+
+def fun_l1_n566(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n762(x)
+    end
+end
+
+def fun_l1_n567(x)
+    if (x < 1)
+        fun_l2_n992(x)
+    else
+        fun_l2_n416(x)
+    end
+end
+
+def fun_l1_n568(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n569(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n570(x)
+    if (x < 1)
+        fun_l2_n243(x)
+    else
+        fun_l2_n421(x)
+    end
+end
+
+def fun_l1_n571(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n572(x)
+    if (x < 1)
+        fun_l2_n647(x)
+    else
+        fun_l2_n614(x)
+    end
+end
+
+def fun_l1_n573(x)
+    if (x < 1)
+        fun_l2_n847(x)
+    else
+        fun_l2_n598(x)
+    end
+end
+
+def fun_l1_n574(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n492(x)
+    end
+end
+
+def fun_l1_n575(x)
+    if (x < 1)
+        fun_l2_n805(x)
+    else
+        fun_l2_n23(x)
+    end
+end
+
+def fun_l1_n576(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n271(x)
+    end
+end
+
+def fun_l1_n577(x)
+    if (x < 1)
+        fun_l2_n277(x)
+    else
+        fun_l2_n259(x)
+    end
+end
+
+def fun_l1_n578(x)
+    if (x < 1)
+        fun_l2_n645(x)
+    else
+        fun_l2_n638(x)
+    end
+end
+
+def fun_l1_n579(x)
+    if (x < 1)
+        fun_l2_n925(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n580(x)
+    if (x < 1)
+        fun_l2_n52(x)
+    else
+        fun_l2_n703(x)
+    end
+end
+
+def fun_l1_n581(x)
+    if (x < 1)
+        fun_l2_n126(x)
+    else
+        fun_l2_n511(x)
+    end
+end
+
+def fun_l1_n582(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n158(x)
+    end
+end
+
+def fun_l1_n583(x)
+    if (x < 1)
+        fun_l2_n604(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n584(x)
+    if (x < 1)
+        fun_l2_n889(x)
+    else
+        fun_l2_n197(x)
+    end
+end
+
+def fun_l1_n585(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n298(x)
+    end
+end
+
+def fun_l1_n586(x)
+    if (x < 1)
+        fun_l2_n165(x)
+    else
+        fun_l2_n340(x)
+    end
+end
+
+def fun_l1_n587(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n947(x)
+    end
+end
+
+def fun_l1_n588(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n163(x)
+    end
+end
+
+def fun_l1_n589(x)
+    if (x < 1)
+        fun_l2_n200(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n590(x)
+    if (x < 1)
+        fun_l2_n749(x)
+    else
+        fun_l2_n232(x)
+    end
+end
+
+def fun_l1_n591(x)
+    if (x < 1)
+        fun_l2_n850(x)
+    else
+        fun_l2_n897(x)
+    end
+end
+
+def fun_l1_n592(x)
+    if (x < 1)
+        fun_l2_n287(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n593(x)
+    if (x < 1)
+        fun_l2_n547(x)
+    else
+        fun_l2_n937(x)
+    end
+end
+
+def fun_l1_n594(x)
+    if (x < 1)
+        fun_l2_n517(x)
+    else
+        fun_l2_n602(x)
+    end
+end
+
+def fun_l1_n595(x)
+    if (x < 1)
+        fun_l2_n962(x)
+    else
+        fun_l2_n387(x)
+    end
+end
+
+def fun_l1_n596(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n597(x)
+    if (x < 1)
+        fun_l2_n343(x)
+    else
+        fun_l2_n704(x)
+    end
+end
+
+def fun_l1_n598(x)
+    if (x < 1)
+        fun_l2_n256(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n599(x)
+    if (x < 1)
+        fun_l2_n653(x)
+    else
+        fun_l2_n630(x)
+    end
+end
+
+def fun_l1_n600(x)
+    if (x < 1)
+        fun_l2_n587(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n601(x)
+    if (x < 1)
+        fun_l2_n798(x)
+    else
+        fun_l2_n318(x)
+    end
+end
+
+def fun_l1_n602(x)
+    if (x < 1)
+        fun_l2_n286(x)
+    else
+        fun_l2_n586(x)
+    end
+end
+
+def fun_l1_n603(x)
+    if (x < 1)
+        fun_l2_n931(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n604(x)
+    if (x < 1)
+        fun_l2_n311(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n605(x)
+    if (x < 1)
+        fun_l2_n998(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n606(x)
+    if (x < 1)
+        fun_l2_n782(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n607(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n797(x)
+    end
+end
+
+def fun_l1_n608(x)
+    if (x < 1)
+        fun_l2_n344(x)
+    else
+        fun_l2_n247(x)
+    end
+end
+
+def fun_l1_n609(x)
+    if (x < 1)
+        fun_l2_n627(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n610(x)
+    if (x < 1)
+        fun_l2_n431(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n611(x)
+    if (x < 1)
+        fun_l2_n307(x)
+    else
+        fun_l2_n857(x)
+    end
+end
+
+def fun_l1_n612(x)
+    if (x < 1)
+        fun_l2_n411(x)
+    else
+        fun_l2_n59(x)
+    end
+end
+
+def fun_l1_n613(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n880(x)
+    end
+end
+
+def fun_l1_n614(x)
+    if (x < 1)
+        fun_l2_n945(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n615(x)
+    if (x < 1)
+        fun_l2_n248(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n616(x)
+    if (x < 1)
+        fun_l2_n453(x)
+    else
+        fun_l2_n4(x)
+    end
+end
+
+def fun_l1_n617(x)
+    if (x < 1)
+        fun_l2_n599(x)
+    else
+        fun_l2_n966(x)
+    end
+end
+
+def fun_l1_n618(x)
+    if (x < 1)
+        fun_l2_n896(x)
+    else
+        fun_l2_n666(x)
+    end
+end
+
+def fun_l1_n619(x)
+    if (x < 1)
+        fun_l2_n715(x)
+    else
+        fun_l2_n918(x)
+    end
+end
+
+def fun_l1_n620(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n144(x)
+    end
+end
+
+def fun_l1_n621(x)
+    if (x < 1)
+        fun_l2_n17(x)
+    else
+        fun_l2_n411(x)
+    end
+end
+
+def fun_l1_n622(x)
+    if (x < 1)
+        fun_l2_n851(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n623(x)
+    if (x < 1)
+        fun_l2_n552(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n624(x)
+    if (x < 1)
+        fun_l2_n822(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n625(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n120(x)
+    end
+end
+
+def fun_l1_n626(x)
+    if (x < 1)
+        fun_l2_n640(x)
+    else
+        fun_l2_n603(x)
+    end
+end
+
+def fun_l1_n627(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n114(x)
+    end
+end
+
+def fun_l1_n628(x)
+    if (x < 1)
+        fun_l2_n374(x)
+    else
+        fun_l2_n295(x)
+    end
+end
+
+def fun_l1_n629(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n920(x)
+    end
+end
+
+def fun_l1_n630(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n571(x)
+    end
+end
+
+def fun_l1_n631(x)
+    if (x < 1)
+        fun_l2_n830(x)
+    else
+        fun_l2_n838(x)
+    end
+end
+
+def fun_l1_n632(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n633(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n173(x)
+    end
+end
+
+def fun_l1_n634(x)
+    if (x < 1)
+        fun_l2_n939(x)
+    else
+        fun_l2_n774(x)
+    end
+end
+
+def fun_l1_n635(x)
+    if (x < 1)
+        fun_l2_n17(x)
+    else
+        fun_l2_n166(x)
+    end
+end
+
+def fun_l1_n636(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n297(x)
+    end
+end
+
+def fun_l1_n637(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n776(x)
+    end
+end
+
+def fun_l1_n638(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n866(x)
+    end
+end
+
+def fun_l1_n639(x)
+    if (x < 1)
+        fun_l2_n677(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n640(x)
+    if (x < 1)
+        fun_l2_n252(x)
+    else
+        fun_l2_n766(x)
+    end
+end
+
+def fun_l1_n641(x)
+    if (x < 1)
+        fun_l2_n3(x)
+    else
+        fun_l2_n115(x)
+    end
+end
+
+def fun_l1_n642(x)
+    if (x < 1)
+        fun_l2_n495(x)
+    else
+        fun_l2_n340(x)
+    end
+end
+
+def fun_l1_n643(x)
+    if (x < 1)
+        fun_l2_n991(x)
+    else
+        fun_l2_n119(x)
+    end
+end
+
+def fun_l1_n644(x)
+    if (x < 1)
+        fun_l2_n379(x)
+    else
+        fun_l2_n519(x)
+    end
+end
+
+def fun_l1_n645(x)
+    if (x < 1)
+        fun_l2_n191(x)
+    else
+        fun_l2_n872(x)
+    end
+end
+
+def fun_l1_n646(x)
+    if (x < 1)
+        fun_l2_n979(x)
+    else
+        fun_l2_n980(x)
+    end
+end
+
+def fun_l1_n647(x)
+    if (x < 1)
+        fun_l2_n918(x)
+    else
+        fun_l2_n455(x)
+    end
+end
+
+def fun_l1_n648(x)
+    if (x < 1)
+        fun_l2_n966(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n649(x)
+    if (x < 1)
+        fun_l2_n838(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n650(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n42(x)
+    end
+end
+
+def fun_l1_n651(x)
+    if (x < 1)
+        fun_l2_n65(x)
+    else
+        fun_l2_n460(x)
+    end
+end
+
+def fun_l1_n652(x)
+    if (x < 1)
+        fun_l2_n479(x)
+    else
+        fun_l2_n251(x)
+    end
+end
+
+def fun_l1_n653(x)
+    if (x < 1)
+        fun_l2_n243(x)
+    else
+        fun_l2_n77(x)
+    end
+end
+
+def fun_l1_n654(x)
+    if (x < 1)
+        fun_l2_n392(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n655(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n157(x)
+    end
+end
+
+def fun_l1_n656(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n237(x)
+    end
+end
+
+def fun_l1_n657(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n174(x)
+    end
+end
+
+def fun_l1_n658(x)
+    if (x < 1)
+        fun_l2_n669(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n659(x)
+    if (x < 1)
+        fun_l2_n251(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n660(x)
+    if (x < 1)
+        fun_l2_n563(x)
+    else
+        fun_l2_n731(x)
+    end
+end
+
+def fun_l1_n661(x)
+    if (x < 1)
+        fun_l2_n684(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n662(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n1(x)
+    end
+end
+
+def fun_l1_n663(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n562(x)
+    end
+end
+
+def fun_l1_n664(x)
+    if (x < 1)
+        fun_l2_n480(x)
+    else
+        fun_l2_n488(x)
+    end
+end
+
+def fun_l1_n665(x)
+    if (x < 1)
+        fun_l2_n398(x)
+    else
+        fun_l2_n493(x)
+    end
+end
+
+def fun_l1_n666(x)
+    if (x < 1)
+        fun_l2_n778(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n667(x)
+    if (x < 1)
+        fun_l2_n332(x)
+    else
+        fun_l2_n441(x)
+    end
+end
+
+def fun_l1_n668(x)
+    if (x < 1)
+        fun_l2_n866(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n669(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n970(x)
+    end
+end
+
+def fun_l1_n670(x)
+    if (x < 1)
+        fun_l2_n926(x)
+    else
+        fun_l2_n883(x)
+    end
+end
+
+def fun_l1_n671(x)
+    if (x < 1)
+        fun_l2_n204(x)
+    else
+        fun_l2_n769(x)
+    end
+end
+
+def fun_l1_n672(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n367(x)
+    end
+end
+
+def fun_l1_n673(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n750(x)
+    end
+end
+
+def fun_l1_n674(x)
+    if (x < 1)
+        fun_l2_n296(x)
+    else
+        fun_l2_n608(x)
+    end
+end
+
+def fun_l1_n675(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n676(x)
+    if (x < 1)
+        fun_l2_n618(x)
+    else
+        fun_l2_n286(x)
+    end
+end
+
+def fun_l1_n677(x)
+    if (x < 1)
+        fun_l2_n98(x)
+    else
+        fun_l2_n264(x)
+    end
+end
+
+def fun_l1_n678(x)
+    if (x < 1)
+        fun_l2_n967(x)
+    else
+        fun_l2_n884(x)
+    end
+end
+
+def fun_l1_n679(x)
+    if (x < 1)
+        fun_l2_n351(x)
+    else
+        fun_l2_n854(x)
+    end
+end
+
+def fun_l1_n680(x)
+    if (x < 1)
+        fun_l2_n397(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n681(x)
+    if (x < 1)
+        fun_l2_n232(x)
+    else
+        fun_l2_n400(x)
+    end
+end
+
+def fun_l1_n682(x)
+    if (x < 1)
+        fun_l2_n321(x)
+    else
+        fun_l2_n500(x)
+    end
+end
+
+def fun_l1_n683(x)
+    if (x < 1)
+        fun_l2_n315(x)
+    else
+        fun_l2_n509(x)
+    end
+end
+
+def fun_l1_n684(x)
+    if (x < 1)
+        fun_l2_n854(x)
+    else
+        fun_l2_n921(x)
+    end
+end
+
+def fun_l1_n685(x)
+    if (x < 1)
+        fun_l2_n823(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n686(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n687(x)
+    if (x < 1)
+        fun_l2_n74(x)
+    else
+        fun_l2_n577(x)
+    end
+end
+
+def fun_l1_n688(x)
+    if (x < 1)
+        fun_l2_n47(x)
+    else
+        fun_l2_n664(x)
+    end
+end
+
+def fun_l1_n689(x)
+    if (x < 1)
+        fun_l2_n709(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n690(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n893(x)
+    end
+end
+
+def fun_l1_n691(x)
+    if (x < 1)
+        fun_l2_n934(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n692(x)
+    if (x < 1)
+        fun_l2_n194(x)
+    else
+        fun_l2_n915(x)
+    end
+end
+
+def fun_l1_n693(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n212(x)
+    end
+end
+
+def fun_l1_n694(x)
+    if (x < 1)
+        fun_l2_n554(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n695(x)
+    if (x < 1)
+        fun_l2_n372(x)
+    else
+        fun_l2_n652(x)
+    end
+end
+
+def fun_l1_n696(x)
+    if (x < 1)
+        fun_l2_n778(x)
+    else
+        fun_l2_n350(x)
+    end
+end
+
+def fun_l1_n697(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n467(x)
+    end
+end
+
+def fun_l1_n698(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n983(x)
+    end
+end
+
+def fun_l1_n699(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n700(x)
+    if (x < 1)
+        fun_l2_n276(x)
+    else
+        fun_l2_n778(x)
+    end
+end
+
+def fun_l1_n701(x)
+    if (x < 1)
+        fun_l2_n562(x)
+    else
+        fun_l2_n558(x)
+    end
+end
+
+def fun_l1_n702(x)
+    if (x < 1)
+        fun_l2_n600(x)
+    else
+        fun_l2_n120(x)
+    end
+end
+
+def fun_l1_n703(x)
+    if (x < 1)
+        fun_l2_n346(x)
+    else
+        fun_l2_n975(x)
+    end
+end
+
+def fun_l1_n704(x)
+    if (x < 1)
+        fun_l2_n139(x)
+    else
+        fun_l2_n241(x)
+    end
+end
+
+def fun_l1_n705(x)
+    if (x < 1)
+        fun_l2_n728(x)
+    else
+        fun_l2_n62(x)
+    end
+end
+
+def fun_l1_n706(x)
+    if (x < 1)
+        fun_l2_n719(x)
+    else
+        fun_l2_n955(x)
+    end
+end
+
+def fun_l1_n707(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n122(x)
+    end
+end
+
+def fun_l1_n708(x)
+    if (x < 1)
+        fun_l2_n456(x)
+    else
+        fun_l2_n128(x)
+    end
+end
+
+def fun_l1_n709(x)
+    if (x < 1)
+        fun_l2_n4(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n710(x)
+    if (x < 1)
+        fun_l2_n20(x)
+    else
+        fun_l2_n746(x)
+    end
+end
+
+def fun_l1_n711(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n886(x)
+    end
+end
+
+def fun_l1_n712(x)
+    if (x < 1)
+        fun_l2_n417(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n713(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n713(x)
+    end
+end
+
+def fun_l1_n714(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n985(x)
+    end
+end
+
+def fun_l1_n715(x)
+    if (x < 1)
+        fun_l2_n937(x)
+    else
+        fun_l2_n709(x)
+    end
+end
+
+def fun_l1_n716(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n842(x)
+    end
+end
+
+def fun_l1_n717(x)
+    if (x < 1)
+        fun_l2_n671(x)
+    else
+        fun_l2_n954(x)
+    end
+end
+
+def fun_l1_n718(x)
+    if (x < 1)
+        fun_l2_n948(x)
+    else
+        fun_l2_n128(x)
+    end
+end
+
+def fun_l1_n719(x)
+    if (x < 1)
+        fun_l2_n682(x)
+    else
+        fun_l2_n973(x)
+    end
+end
+
+def fun_l1_n720(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n721(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n722(x)
+    if (x < 1)
+        fun_l2_n907(x)
+    else
+        fun_l2_n776(x)
+    end
+end
+
+def fun_l1_n723(x)
+    if (x < 1)
+        fun_l2_n93(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n724(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n134(x)
+    end
+end
+
+def fun_l1_n725(x)
+    if (x < 1)
+        fun_l2_n938(x)
+    else
+        fun_l2_n603(x)
+    end
+end
+
+def fun_l1_n726(x)
+    if (x < 1)
+        fun_l2_n574(x)
+    else
+        fun_l2_n976(x)
+    end
+end
+
+def fun_l1_n727(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n658(x)
+    end
+end
+
+def fun_l1_n728(x)
+    if (x < 1)
+        fun_l2_n828(x)
+    else
+        fun_l2_n226(x)
+    end
+end
+
+def fun_l1_n729(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n730(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n853(x)
+    end
+end
+
+def fun_l1_n731(x)
+    if (x < 1)
+        fun_l2_n142(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n732(x)
+    if (x < 1)
+        fun_l2_n211(x)
+    else
+        fun_l2_n35(x)
+    end
+end
+
+def fun_l1_n733(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n734(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n224(x)
+    end
+end
+
+def fun_l1_n735(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n564(x)
+    end
+end
+
+def fun_l1_n736(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n153(x)
+    end
+end
+
+def fun_l1_n737(x)
+    if (x < 1)
+        fun_l2_n633(x)
+    else
+        fun_l2_n358(x)
+    end
+end
+
+def fun_l1_n738(x)
+    if (x < 1)
+        fun_l2_n0(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n739(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n531(x)
+    end
+end
+
+def fun_l1_n740(x)
+    if (x < 1)
+        fun_l2_n736(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n741(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n684(x)
+    end
+end
+
+def fun_l1_n742(x)
+    if (x < 1)
+        fun_l2_n976(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n743(x)
+    if (x < 1)
+        fun_l2_n519(x)
+    else
+        fun_l2_n633(x)
+    end
+end
+
+def fun_l1_n744(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n745(x)
+    if (x < 1)
+        fun_l2_n365(x)
+    else
+        fun_l2_n972(x)
+    end
+end
+
+def fun_l1_n746(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n715(x)
+    end
+end
+
+def fun_l1_n747(x)
+    if (x < 1)
+        fun_l2_n363(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n748(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n749(x)
+    if (x < 1)
+        fun_l2_n415(x)
+    else
+        fun_l2_n162(x)
+    end
+end
+
+def fun_l1_n750(x)
+    if (x < 1)
+        fun_l2_n157(x)
+    else
+        fun_l2_n406(x)
+    end
+end
+
+def fun_l1_n751(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n212(x)
+    end
+end
+
+def fun_l1_n752(x)
+    if (x < 1)
+        fun_l2_n733(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n753(x)
+    if (x < 1)
+        fun_l2_n960(x)
+    else
+        fun_l2_n20(x)
+    end
+end
+
+def fun_l1_n754(x)
+    if (x < 1)
+        fun_l2_n797(x)
+    else
+        fun_l2_n202(x)
+    end
+end
+
+def fun_l1_n755(x)
+    if (x < 1)
+        fun_l2_n113(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n756(x)
+    if (x < 1)
+        fun_l2_n84(x)
+    else
+        fun_l2_n390(x)
+    end
+end
+
+def fun_l1_n757(x)
+    if (x < 1)
+        fun_l2_n355(x)
+    else
+        fun_l2_n761(x)
+    end
+end
+
+def fun_l1_n758(x)
+    if (x < 1)
+        fun_l2_n823(x)
+    else
+        fun_l2_n37(x)
+    end
+end
+
+def fun_l1_n759(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n130(x)
+    end
+end
+
+def fun_l1_n760(x)
+    if (x < 1)
+        fun_l2_n364(x)
+    else
+        fun_l2_n680(x)
+    end
+end
+
+def fun_l1_n761(x)
+    if (x < 1)
+        fun_l2_n718(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n762(x)
+    if (x < 1)
+        fun_l2_n795(x)
+    else
+        fun_l2_n342(x)
+    end
+end
+
+def fun_l1_n763(x)
+    if (x < 1)
+        fun_l2_n561(x)
+    else
+        fun_l2_n593(x)
+    end
+end
+
+def fun_l1_n764(x)
+    if (x < 1)
+        fun_l2_n714(x)
+    else
+        fun_l2_n168(x)
+    end
+end
+
+def fun_l1_n765(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n109(x)
+    end
+end
+
+def fun_l1_n766(x)
+    if (x < 1)
+        fun_l2_n477(x)
+    else
+        fun_l2_n871(x)
+    end
+end
+
+def fun_l1_n767(x)
+    if (x < 1)
+        fun_l2_n596(x)
+    else
+        fun_l2_n81(x)
+    end
+end
+
+def fun_l1_n768(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n454(x)
+    end
+end
+
+def fun_l1_n769(x)
+    if (x < 1)
+        fun_l2_n308(x)
+    else
+        fun_l2_n890(x)
+    end
+end
+
+def fun_l1_n770(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n342(x)
+    end
+end
+
+def fun_l1_n771(x)
+    if (x < 1)
+        fun_l2_n44(x)
+    else
+        fun_l2_n1(x)
+    end
+end
+
+def fun_l1_n772(x)
+    if (x < 1)
+        fun_l2_n457(x)
+    else
+        fun_l2_n571(x)
+    end
+end
+
+def fun_l1_n773(x)
+    if (x < 1)
+        fun_l2_n88(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n774(x)
+    if (x < 1)
+        fun_l2_n459(x)
+    else
+        fun_l2_n446(x)
+    end
+end
+
+def fun_l1_n775(x)
+    if (x < 1)
+        fun_l2_n400(x)
+    else
+        fun_l2_n918(x)
+    end
+end
+
+def fun_l1_n776(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n696(x)
+    end
+end
+
+def fun_l1_n777(x)
+    if (x < 1)
+        fun_l2_n968(x)
+    else
+        fun_l2_n988(x)
+    end
+end
+
+def fun_l1_n778(x)
+    if (x < 1)
+        fun_l2_n242(x)
+    else
+        fun_l2_n496(x)
+    end
+end
+
+def fun_l1_n779(x)
+    if (x < 1)
+        fun_l2_n106(x)
+    else
+        fun_l2_n637(x)
+    end
+end
+
+def fun_l1_n780(x)
+    if (x < 1)
+        fun_l2_n945(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n781(x)
+    if (x < 1)
+        fun_l2_n269(x)
+    else
+        fun_l2_n582(x)
+    end
+end
+
+def fun_l1_n782(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n201(x)
+    end
+end
+
+def fun_l1_n783(x)
+    if (x < 1)
+        fun_l2_n326(x)
+    else
+        fun_l2_n744(x)
+    end
+end
+
+def fun_l1_n784(x)
+    if (x < 1)
+        fun_l2_n49(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n785(x)
+    if (x < 1)
+        fun_l2_n975(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n786(x)
+    if (x < 1)
+        fun_l2_n843(x)
+    else
+        fun_l2_n240(x)
+    end
+end
+
+def fun_l1_n787(x)
+    if (x < 1)
+        fun_l2_n179(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n788(x)
+    if (x < 1)
+        fun_l2_n536(x)
+    else
+        fun_l2_n112(x)
+    end
+end
+
+def fun_l1_n789(x)
+    if (x < 1)
+        fun_l2_n418(x)
+    else
+        fun_l2_n443(x)
+    end
+end
+
+def fun_l1_n790(x)
+    if (x < 1)
+        fun_l2_n770(x)
+    else
+        fun_l2_n127(x)
+    end
+end
+
+def fun_l1_n791(x)
+    if (x < 1)
+        fun_l2_n425(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n792(x)
+    if (x < 1)
+        fun_l2_n841(x)
+    else
+        fun_l2_n112(x)
+    end
+end
+
+def fun_l1_n793(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n294(x)
+    end
+end
+
+def fun_l1_n794(x)
+    if (x < 1)
+        fun_l2_n837(x)
+    else
+        fun_l2_n325(x)
+    end
+end
+
+def fun_l1_n795(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n796(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n957(x)
+    end
+end
+
+def fun_l1_n797(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n871(x)
+    end
+end
+
+def fun_l1_n798(x)
+    if (x < 1)
+        fun_l2_n386(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n799(x)
+    if (x < 1)
+        fun_l2_n669(x)
+    else
+        fun_l2_n237(x)
+    end
+end
+
+def fun_l1_n800(x)
+    if (x < 1)
+        fun_l2_n455(x)
+    else
+        fun_l2_n549(x)
+    end
+end
+
+def fun_l1_n801(x)
+    if (x < 1)
+        fun_l2_n708(x)
+    else
+        fun_l2_n611(x)
+    end
+end
+
+def fun_l1_n802(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n803(x)
+    if (x < 1)
+        fun_l2_n890(x)
+    else
+        fun_l2_n27(x)
+    end
+end
+
+def fun_l1_n804(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n567(x)
+    end
+end
+
+def fun_l1_n805(x)
+    if (x < 1)
+        fun_l2_n672(x)
+    else
+        fun_l2_n320(x)
+    end
+end
+
+def fun_l1_n806(x)
+    if (x < 1)
+        fun_l2_n207(x)
+    else
+        fun_l2_n691(x)
+    end
+end
+
+def fun_l1_n807(x)
+    if (x < 1)
+        fun_l2_n180(x)
+    else
+        fun_l2_n912(x)
+    end
+end
+
+def fun_l1_n808(x)
+    if (x < 1)
+        fun_l2_n370(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n809(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n465(x)
+    end
+end
+
+def fun_l1_n810(x)
+    if (x < 1)
+        fun_l2_n820(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n811(x)
+    if (x < 1)
+        fun_l2_n821(x)
+    else
+        fun_l2_n898(x)
+    end
+end
+
+def fun_l1_n812(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n999(x)
+    end
+end
+
+def fun_l1_n813(x)
+    if (x < 1)
+        fun_l2_n643(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n814(x)
+    if (x < 1)
+        fun_l2_n475(x)
+    else
+        fun_l2_n137(x)
+    end
+end
+
+def fun_l1_n815(x)
+    if (x < 1)
+        fun_l2_n117(x)
+    else
+        fun_l2_n685(x)
+    end
+end
+
+def fun_l1_n816(x)
+    if (x < 1)
+        fun_l2_n451(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n817(x)
+    if (x < 1)
+        fun_l2_n22(x)
+    else
+        fun_l2_n939(x)
+    end
+end
+
+def fun_l1_n818(x)
+    if (x < 1)
+        fun_l2_n586(x)
+    else
+        fun_l2_n206(x)
+    end
+end
+
+def fun_l1_n819(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n661(x)
+    end
+end
+
+def fun_l1_n820(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n821(x)
+    if (x < 1)
+        fun_l2_n794(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n822(x)
+    if (x < 1)
+        fun_l2_n519(x)
+    else
+        fun_l2_n446(x)
+    end
+end
+
+def fun_l1_n823(x)
+    if (x < 1)
+        fun_l2_n0(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n824(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n186(x)
+    end
+end
+
+def fun_l1_n825(x)
+    if (x < 1)
+        fun_l2_n292(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n826(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n515(x)
+    end
+end
+
+def fun_l1_n827(x)
+    if (x < 1)
+        fun_l2_n227(x)
+    else
+        fun_l2_n232(x)
+    end
+end
+
+def fun_l1_n828(x)
+    if (x < 1)
+        fun_l2_n860(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n829(x)
+    if (x < 1)
+        fun_l2_n140(x)
+    else
+        fun_l2_n304(x)
+    end
+end
+
+def fun_l1_n830(x)
+    if (x < 1)
+        fun_l2_n796(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n831(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n8(x)
+    end
+end
+
+def fun_l1_n832(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n836(x)
+    end
+end
+
+def fun_l1_n833(x)
+    if (x < 1)
+        fun_l2_n322(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n834(x)
+    if (x < 1)
+        fun_l2_n471(x)
+    else
+        fun_l2_n147(x)
+    end
+end
+
+def fun_l1_n835(x)
+    if (x < 1)
+        fun_l2_n601(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n836(x)
+    if (x < 1)
+        fun_l2_n105(x)
+    else
+        fun_l2_n63(x)
+    end
+end
+
+def fun_l1_n837(x)
+    if (x < 1)
+        fun_l2_n773(x)
+    else
+        fun_l2_n597(x)
+    end
+end
+
+def fun_l1_n838(x)
+    if (x < 1)
+        fun_l2_n933(x)
+    else
+        fun_l2_n964(x)
+    end
+end
+
+def fun_l1_n839(x)
+    if (x < 1)
+        fun_l2_n123(x)
+    else
+        fun_l2_n533(x)
+    end
+end
+
+def fun_l1_n840(x)
+    if (x < 1)
+        fun_l2_n94(x)
+    else
+        fun_l2_n127(x)
+    end
+end
+
+def fun_l1_n841(x)
+    if (x < 1)
+        fun_l2_n981(x)
+    else
+        fun_l2_n819(x)
+    end
+end
+
+def fun_l1_n842(x)
+    if (x < 1)
+        fun_l2_n743(x)
+    else
+        fun_l2_n747(x)
+    end
+end
+
+def fun_l1_n843(x)
+    if (x < 1)
+        fun_l2_n735(x)
+    else
+        fun_l2_n110(x)
+    end
+end
+
+def fun_l1_n844(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n845(x)
+    if (x < 1)
+        fun_l2_n316(x)
+    else
+        fun_l2_n391(x)
+    end
+end
+
+def fun_l1_n846(x)
+    if (x < 1)
+        fun_l2_n221(x)
+    else
+        fun_l2_n251(x)
+    end
+end
+
+def fun_l1_n847(x)
+    if (x < 1)
+        fun_l2_n795(x)
+    else
+        fun_l2_n513(x)
+    end
+end
+
+def fun_l1_n848(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n472(x)
+    end
+end
+
+def fun_l1_n849(x)
+    if (x < 1)
+        fun_l2_n863(x)
+    else
+        fun_l2_n759(x)
+    end
+end
+
+def fun_l1_n850(x)
+    if (x < 1)
+        fun_l2_n512(x)
+    else
+        fun_l2_n502(x)
+    end
+end
+
+def fun_l1_n851(x)
+    if (x < 1)
+        fun_l2_n561(x)
+    else
+        fun_l2_n697(x)
+    end
+end
+
+def fun_l1_n852(x)
+    if (x < 1)
+        fun_l2_n816(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n853(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n174(x)
+    end
+end
+
+def fun_l1_n854(x)
+    if (x < 1)
+        fun_l2_n439(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n855(x)
+    if (x < 1)
+        fun_l2_n15(x)
+    else
+        fun_l2_n402(x)
+    end
+end
+
+def fun_l1_n856(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n857(x)
+    if (x < 1)
+        fun_l2_n675(x)
+    else
+        fun_l2_n113(x)
+    end
+end
+
+def fun_l1_n858(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n859(x)
+    if (x < 1)
+        fun_l2_n628(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n860(x)
+    if (x < 1)
+        fun_l2_n67(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n861(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n862(x)
+    if (x < 1)
+        fun_l2_n767(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n863(x)
+    if (x < 1)
+        fun_l2_n50(x)
+    else
+        fun_l2_n777(x)
+    end
+end
+
+def fun_l1_n864(x)
+    if (x < 1)
+        fun_l2_n846(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n865(x)
+    if (x < 1)
+        fun_l2_n756(x)
+    else
+        fun_l2_n703(x)
+    end
+end
+
+def fun_l1_n866(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n867(x)
+    if (x < 1)
+        fun_l2_n636(x)
+    else
+        fun_l2_n841(x)
+    end
+end
+
+def fun_l1_n868(x)
+    if (x < 1)
+        fun_l2_n889(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n869(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n45(x)
+    end
+end
+
+def fun_l1_n870(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n722(x)
+    end
+end
+
+def fun_l1_n871(x)
+    if (x < 1)
+        fun_l2_n865(x)
+    else
+        fun_l2_n695(x)
+    end
+end
+
+def fun_l1_n872(x)
+    if (x < 1)
+        fun_l2_n54(x)
+    else
+        fun_l2_n581(x)
+    end
+end
+
+def fun_l1_n873(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n861(x)
+    end
+end
+
+def fun_l1_n874(x)
+    if (x < 1)
+        fun_l2_n645(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n875(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n329(x)
+    end
+end
+
+def fun_l1_n876(x)
+    if (x < 1)
+        fun_l2_n944(x)
+    else
+        fun_l2_n95(x)
+    end
+end
+
+def fun_l1_n877(x)
+    if (x < 1)
+        fun_l2_n270(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n878(x)
+    if (x < 1)
+        fun_l2_n115(x)
+    else
+        fun_l2_n414(x)
+    end
+end
+
+def fun_l1_n879(x)
+    if (x < 1)
+        fun_l2_n154(x)
+    else
+        fun_l2_n605(x)
+    end
+end
+
+def fun_l1_n880(x)
+    if (x < 1)
+        fun_l2_n859(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n881(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n267(x)
+    end
+end
+
+def fun_l1_n882(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n175(x)
+    end
+end
+
+def fun_l1_n883(x)
+    if (x < 1)
+        fun_l2_n176(x)
+    else
+        fun_l2_n286(x)
+    end
+end
+
+def fun_l1_n884(x)
+    if (x < 1)
+        fun_l2_n422(x)
+    else
+        fun_l2_n469(x)
+    end
+end
+
+def fun_l1_n885(x)
+    if (x < 1)
+        fun_l2_n532(x)
+    else
+        fun_l2_n795(x)
+    end
+end
+
+def fun_l1_n886(x)
+    if (x < 1)
+        fun_l2_n966(x)
+    else
+        fun_l2_n46(x)
+    end
+end
+
+def fun_l1_n887(x)
+    if (x < 1)
+        fun_l2_n446(x)
+    else
+        fun_l2_n944(x)
+    end
+end
+
+def fun_l1_n888(x)
+    if (x < 1)
+        fun_l2_n256(x)
+    else
+        fun_l2_n757(x)
+    end
+end
+
+def fun_l1_n889(x)
+    if (x < 1)
+        fun_l2_n566(x)
+    else
+        fun_l2_n992(x)
+    end
+end
+
+def fun_l1_n890(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n891(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n257(x)
+    end
+end
+
+def fun_l1_n892(x)
+    if (x < 1)
+        fun_l2_n79(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n893(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n894(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n184(x)
+    end
+end
+
+def fun_l1_n895(x)
+    if (x < 1)
+        fun_l2_n342(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n896(x)
+    if (x < 1)
+        fun_l2_n588(x)
+    else
+        fun_l2_n235(x)
+    end
+end
+
+def fun_l1_n897(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n462(x)
+    end
+end
+
+def fun_l1_n898(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n899(x)
+    if (x < 1)
+        fun_l2_n61(x)
+    else
+        fun_l2_n516(x)
+    end
+end
+
+def fun_l1_n900(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n901(x)
+    if (x < 1)
+        fun_l2_n398(x)
+    else
+        fun_l2_n425(x)
+    end
+end
+
+def fun_l1_n902(x)
+    if (x < 1)
+        fun_l2_n177(x)
+    else
+        fun_l2_n741(x)
+    end
+end
+
+def fun_l1_n903(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n331(x)
+    end
+end
+
+def fun_l1_n904(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n527(x)
+    end
+end
+
+def fun_l1_n905(x)
+    if (x < 1)
+        fun_l2_n138(x)
+    else
+        fun_l2_n248(x)
+    end
+end
+
+def fun_l1_n906(x)
+    if (x < 1)
+        fun_l2_n318(x)
+    else
+        fun_l2_n941(x)
+    end
+end
+
+def fun_l1_n907(x)
+    if (x < 1)
+        fun_l2_n493(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n908(x)
+    if (x < 1)
+        fun_l2_n899(x)
+    else
+        fun_l2_n745(x)
+    end
+end
+
+def fun_l1_n909(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n384(x)
+    end
+end
+
+def fun_l1_n910(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n911(x)
+    if (x < 1)
+        fun_l2_n712(x)
+    else
+        fun_l2_n810(x)
+    end
+end
+
+def fun_l1_n912(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n609(x)
+    end
+end
+
+def fun_l1_n913(x)
+    if (x < 1)
+        fun_l2_n997(x)
+    else
+        fun_l2_n241(x)
+    end
+end
+
+def fun_l1_n914(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n697(x)
+    end
+end
+
+def fun_l1_n915(x)
+    if (x < 1)
+        fun_l2_n257(x)
+    else
+        fun_l2_n626(x)
+    end
+end
+
+def fun_l1_n916(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n917(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n958(x)
+    end
+end
+
+def fun_l1_n918(x)
+    if (x < 1)
+        fun_l2_n213(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n919(x)
+    if (x < 1)
+        fun_l2_n466(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n920(x)
+    if (x < 1)
+        fun_l2_n835(x)
+    else
+        fun_l2_n460(x)
+    end
+end
+
+def fun_l1_n921(x)
+    if (x < 1)
+        fun_l2_n642(x)
+    else
+        fun_l2_n680(x)
+    end
+end
+
+def fun_l1_n922(x)
+    if (x < 1)
+        fun_l2_n467(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n923(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n462(x)
+    end
+end
+
+def fun_l1_n924(x)
+    if (x < 1)
+        fun_l2_n113(x)
+    else
+        fun_l2_n59(x)
+    end
+end
+
+def fun_l1_n925(x)
+    if (x < 1)
+        fun_l2_n329(x)
+    else
+        fun_l2_n994(x)
+    end
+end
+
+def fun_l1_n926(x)
+    if (x < 1)
+        fun_l2_n815(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n927(x)
+    if (x < 1)
+        fun_l2_n216(x)
+    else
+        fun_l2_n591(x)
+    end
+end
+
+def fun_l1_n928(x)
+    if (x < 1)
+        fun_l2_n441(x)
+    else
+        fun_l2_n437(x)
+    end
+end
+
+def fun_l1_n929(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n185(x)
+    end
+end
+
+def fun_l1_n930(x)
+    if (x < 1)
+        fun_l2_n125(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n931(x)
+    if (x < 1)
+        fun_l2_n203(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n932(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n234(x)
+    end
+end
+
+def fun_l1_n933(x)
+    if (x < 1)
+        fun_l2_n735(x)
+    else
+        fun_l2_n20(x)
+    end
+end
+
+def fun_l1_n934(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n166(x)
+    end
+end
+
+def fun_l1_n935(x)
+    if (x < 1)
+        fun_l2_n123(x)
+    else
+        fun_l2_n52(x)
+    end
+end
+
+def fun_l1_n936(x)
+    if (x < 1)
+        fun_l2_n99(x)
+    else
+        fun_l2_n336(x)
+    end
+end
+
+def fun_l1_n937(x)
+    if (x < 1)
+        fun_l2_n731(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n938(x)
+    if (x < 1)
+        fun_l2_n988(x)
+    else
+        fun_l2_n978(x)
+    end
+end
+
+def fun_l1_n939(x)
+    if (x < 1)
+        fun_l2_n592(x)
+    else
+        fun_l2_n932(x)
+    end
+end
+
+def fun_l1_n940(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n868(x)
+    end
+end
+
+def fun_l1_n941(x)
+    if (x < 1)
+        fun_l2_n863(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n942(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n960(x)
+    end
+end
+
+def fun_l1_n943(x)
+    if (x < 1)
+        fun_l2_n859(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n944(x)
+    if (x < 1)
+        fun_l2_n947(x)
+    else
+        fun_l2_n889(x)
+    end
+end
+
+def fun_l1_n945(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n211(x)
+    end
+end
+
+def fun_l1_n946(x)
+    if (x < 1)
+        fun_l2_n445(x)
+    else
+        fun_l2_n600(x)
+    end
+end
+
+def fun_l1_n947(x)
+    if (x < 1)
+        fun_l2_n932(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n948(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n32(x)
+    end
+end
+
+def fun_l1_n949(x)
+    if (x < 1)
+        fun_l2_n63(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n950(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n951(x)
+    if (x < 1)
+        fun_l2_n880(x)
+    else
+        fun_l2_n936(x)
+    end
+end
+
+def fun_l1_n952(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n40(x)
+    end
+end
+
+def fun_l1_n953(x)
+    if (x < 1)
+        fun_l2_n880(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n954(x)
+    if (x < 1)
+        fun_l2_n60(x)
+    else
+        fun_l2_n473(x)
+    end
+end
+
+def fun_l1_n955(x)
+    if (x < 1)
+        fun_l2_n855(x)
+    else
+        fun_l2_n601(x)
+    end
+end
+
+def fun_l1_n956(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n542(x)
+    end
+end
+
+def fun_l1_n957(x)
+    if (x < 1)
+        fun_l2_n116(x)
+    else
+        fun_l2_n584(x)
+    end
+end
+
+def fun_l1_n958(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n959(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n960(x)
+    if (x < 1)
+        fun_l2_n79(x)
+    else
+        fun_l2_n556(x)
+    end
+end
+
+def fun_l1_n961(x)
+    if (x < 1)
+        fun_l2_n664(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n962(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n393(x)
+    end
+end
+
+def fun_l1_n963(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n506(x)
+    end
+end
+
+def fun_l1_n964(x)
+    if (x < 1)
+        fun_l2_n362(x)
+    else
+        fun_l2_n631(x)
+    end
+end
+
+def fun_l1_n965(x)
+    if (x < 1)
+        fun_l2_n219(x)
+    else
+        fun_l2_n260(x)
+    end
+end
+
+def fun_l1_n966(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n732(x)
+    end
+end
+
+def fun_l1_n967(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n580(x)
+    end
+end
+
+def fun_l1_n968(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n969(x)
+    if (x < 1)
+        fun_l2_n138(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n970(x)
+    if (x < 1)
+        fun_l2_n266(x)
+    else
+        fun_l2_n522(x)
+    end
+end
+
+def fun_l1_n971(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n51(x)
+    end
+end
+
+def fun_l1_n972(x)
+    if (x < 1)
+        fun_l2_n619(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n973(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n974(x)
+    if (x < 1)
+        fun_l2_n442(x)
+    else
+        fun_l2_n258(x)
+    end
+end
+
+def fun_l1_n975(x)
+    if (x < 1)
+        fun_l2_n106(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n976(x)
+    if (x < 1)
+        fun_l2_n412(x)
+    else
+        fun_l2_n669(x)
+    end
+end
+
+def fun_l1_n977(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n435(x)
+    end
+end
+
+def fun_l1_n978(x)
+    if (x < 1)
+        fun_l2_n630(x)
+    else
+        fun_l2_n686(x)
+    end
+end
+
+def fun_l1_n979(x)
+    if (x < 1)
+        fun_l2_n683(x)
+    else
+        fun_l2_n99(x)
+    end
+end
+
+def fun_l1_n980(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n394(x)
+    end
+end
+
+def fun_l1_n981(x)
+    if (x < 1)
+        fun_l2_n856(x)
+    else
+        fun_l2_n11(x)
+    end
+end
+
+def fun_l1_n982(x)
+    if (x < 1)
+        fun_l2_n484(x)
+    else
+        fun_l2_n230(x)
+    end
+end
+
+def fun_l1_n983(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n882(x)
+    end
+end
+
+def fun_l1_n984(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n589(x)
+    end
+end
+
+def fun_l1_n985(x)
+    if (x < 1)
+        fun_l2_n545(x)
+    else
+        fun_l2_n139(x)
+    end
+end
+
+def fun_l1_n986(x)
+    if (x < 1)
+        fun_l2_n679(x)
+    else
+        fun_l2_n938(x)
+    end
+end
+
+def fun_l1_n987(x)
+    if (x < 1)
+        fun_l2_n803(x)
+    else
+        fun_l2_n454(x)
+    end
+end
+
+def fun_l1_n988(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n976(x)
+    end
+end
+
+def fun_l1_n989(x)
+    if (x < 1)
+        fun_l2_n364(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n990(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n991(x)
+    if (x < 1)
+        fun_l2_n842(x)
+    else
+        fun_l2_n810(x)
+    end
+end
+
+def fun_l1_n992(x)
+    if (x < 1)
+        fun_l2_n237(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n993(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n994(x)
+    if (x < 1)
+        fun_l2_n323(x)
+    else
+        fun_l2_n829(x)
+    end
+end
+
+def fun_l1_n995(x)
+    if (x < 1)
+        fun_l2_n904(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n996(x)
+    if (x < 1)
+        fun_l2_n390(x)
+    else
+        fun_l2_n169(x)
+    end
+end
+
+def fun_l1_n997(x)
+    if (x < 1)
+        fun_l2_n583(x)
+    else
+        fun_l2_n993(x)
+    end
+end
+
+def fun_l1_n998(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n240(x)
+    end
+end
+
+def fun_l1_n999(x)
+    if (x < 1)
+        fun_l2_n489(x)
+    else
+        fun_l2_n175(x)
+    end
+end
+
+def fun_l2_n0(x)
+    if (x < 1)
+        fun_l3_n293(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n1(x)
+    if (x < 1)
+        fun_l3_n310(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n2(x)
+    if (x < 1)
+        fun_l3_n484(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n3(x)
+    if (x < 1)
+        fun_l3_n353(x)
+    else
+        fun_l3_n871(x)
+    end
+end
+
+def fun_l2_n4(x)
+    if (x < 1)
+        fun_l3_n100(x)
+    else
+        fun_l3_n796(x)
+    end
+end
+
+def fun_l2_n5(x)
+    if (x < 1)
+        fun_l3_n547(x)
+    else
+        fun_l3_n663(x)
+    end
+end
+
+def fun_l2_n6(x)
+    if (x < 1)
+        fun_l3_n756(x)
+    else
+        fun_l3_n69(x)
+    end
+end
+
+def fun_l2_n7(x)
+    if (x < 1)
+        fun_l3_n393(x)
+    else
+        fun_l3_n333(x)
+    end
+end
+
+def fun_l2_n8(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n9(x)
+    if (x < 1)
+        fun_l3_n969(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n10(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n62(x)
+    end
+end
+
+def fun_l2_n11(x)
+    if (x < 1)
+        fun_l3_n671(x)
+    else
+        fun_l3_n303(x)
+    end
+end
+
+def fun_l2_n12(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n13(x)
+    if (x < 1)
+        fun_l3_n363(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n14(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n15(x)
+    if (x < 1)
+        fun_l3_n344(x)
+    else
+        fun_l3_n590(x)
+    end
+end
+
+def fun_l2_n16(x)
+    if (x < 1)
+        fun_l3_n759(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n17(x)
+    if (x < 1)
+        fun_l3_n902(x)
+    else
+        fun_l3_n948(x)
+    end
+end
+
+def fun_l2_n18(x)
+    if (x < 1)
+        fun_l3_n407(x)
+    else
+        fun_l3_n743(x)
+    end
+end
+
+def fun_l2_n19(x)
+    if (x < 1)
+        fun_l3_n360(x)
+    else
+        fun_l3_n953(x)
+    end
+end
+
+def fun_l2_n20(x)
+    if (x < 1)
+        fun_l3_n968(x)
+    else
+        fun_l3_n685(x)
+    end
+end
+
+def fun_l2_n21(x)
+    if (x < 1)
+        fun_l3_n964(x)
+    else
+        fun_l3_n210(x)
+    end
+end
+
+def fun_l2_n22(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n902(x)
+    end
+end
+
+def fun_l2_n23(x)
+    if (x < 1)
+        fun_l3_n154(x)
+    else
+        fun_l3_n52(x)
+    end
+end
+
+def fun_l2_n24(x)
+    if (x < 1)
+        fun_l3_n229(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n25(x)
+    if (x < 1)
+        fun_l3_n390(x)
+    else
+        fun_l3_n445(x)
+    end
+end
+
+def fun_l2_n26(x)
+    if (x < 1)
+        fun_l3_n11(x)
+    else
+        fun_l3_n113(x)
+    end
+end
+
+def fun_l2_n27(x)
+    if (x < 1)
+        fun_l3_n756(x)
+    else
+        fun_l3_n935(x)
+    end
+end
+
+def fun_l2_n28(x)
+    if (x < 1)
+        fun_l3_n567(x)
+    else
+        fun_l3_n984(x)
+    end
+end
+
+def fun_l2_n29(x)
+    if (x < 1)
+        fun_l3_n982(x)
+    else
+        fun_l3_n335(x)
+    end
+end
+
+def fun_l2_n30(x)
+    if (x < 1)
+        fun_l3_n78(x)
+    else
+        fun_l3_n571(x)
+    end
+end
+
+def fun_l2_n31(x)
+    if (x < 1)
+        fun_l3_n93(x)
+    else
+        fun_l3_n455(x)
+    end
+end
+
+def fun_l2_n32(x)
+    if (x < 1)
+        fun_l3_n118(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n33(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n0(x)
+    end
+end
+
+def fun_l2_n34(x)
+    if (x < 1)
+        fun_l3_n153(x)
+    else
+        fun_l3_n77(x)
+    end
+end
+
+def fun_l2_n35(x)
+    if (x < 1)
+        fun_l3_n815(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n36(x)
+    if (x < 1)
+        fun_l3_n503(x)
+    else
+        fun_l3_n428(x)
+    end
+end
+
+def fun_l2_n37(x)
+    if (x < 1)
+        fun_l3_n780(x)
+    else
+        fun_l3_n301(x)
+    end
+end
+
+def fun_l2_n38(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n444(x)
+    end
+end
+
+def fun_l2_n39(x)
+    if (x < 1)
+        fun_l3_n808(x)
+    else
+        fun_l3_n76(x)
+    end
+end
+
+def fun_l2_n40(x)
+    if (x < 1)
+        fun_l3_n216(x)
+    else
+        fun_l3_n943(x)
+    end
+end
+
+def fun_l2_n41(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n935(x)
+    end
+end
+
+def fun_l2_n42(x)
+    if (x < 1)
+        fun_l3_n769(x)
+    else
+        fun_l3_n564(x)
+    end
+end
+
+def fun_l2_n43(x)
+    if (x < 1)
+        fun_l3_n108(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n44(x)
+    if (x < 1)
+        fun_l3_n750(x)
+    else
+        fun_l3_n614(x)
+    end
+end
+
+def fun_l2_n45(x)
+    if (x < 1)
+        fun_l3_n497(x)
+    else
+        fun_l3_n584(x)
+    end
+end
+
+def fun_l2_n46(x)
+    if (x < 1)
+        fun_l3_n364(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n47(x)
+    if (x < 1)
+        fun_l3_n938(x)
+    else
+        fun_l3_n707(x)
+    end
+end
+
+def fun_l2_n48(x)
+    if (x < 1)
+        fun_l3_n14(x)
+    else
+        fun_l3_n178(x)
+    end
+end
+
+def fun_l2_n49(x)
+    if (x < 1)
+        fun_l3_n923(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n50(x)
+    if (x < 1)
+        fun_l3_n481(x)
+    else
+        fun_l3_n193(x)
+    end
+end
+
+def fun_l2_n51(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n59(x)
+    end
+end
+
+def fun_l2_n52(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n813(x)
+    end
+end
+
+def fun_l2_n53(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n972(x)
+    end
+end
+
+def fun_l2_n54(x)
+    if (x < 1)
+        fun_l3_n95(x)
+    else
+        fun_l3_n573(x)
+    end
+end
+
+def fun_l2_n55(x)
+    if (x < 1)
+        fun_l3_n148(x)
+    else
+        fun_l3_n369(x)
+    end
+end
+
+def fun_l2_n56(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n57(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n58(x)
+    if (x < 1)
+        fun_l3_n648(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n59(x)
+    if (x < 1)
+        fun_l3_n844(x)
+    else
+        fun_l3_n422(x)
+    end
+end
+
+def fun_l2_n60(x)
+    if (x < 1)
+        fun_l3_n6(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n61(x)
+    if (x < 1)
+        fun_l3_n35(x)
+    else
+        fun_l3_n316(x)
+    end
+end
+
+def fun_l2_n62(x)
+    if (x < 1)
+        fun_l3_n487(x)
+    else
+        fun_l3_n469(x)
+    end
+end
+
+def fun_l2_n63(x)
+    if (x < 1)
+        fun_l3_n272(x)
+    else
+        fun_l3_n909(x)
+    end
+end
+
+def fun_l2_n64(x)
+    if (x < 1)
+        fun_l3_n266(x)
+    else
+        fun_l3_n347(x)
+    end
+end
+
+def fun_l2_n65(x)
+    if (x < 1)
+        fun_l3_n696(x)
+    else
+        fun_l3_n499(x)
+    end
+end
+
+def fun_l2_n66(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n834(x)
+    end
+end
+
+def fun_l2_n67(x)
+    if (x < 1)
+        fun_l3_n966(x)
+    else
+        fun_l3_n454(x)
+    end
+end
+
+def fun_l2_n68(x)
+    if (x < 1)
+        fun_l3_n406(x)
+    else
+        fun_l3_n644(x)
+    end
+end
+
+def fun_l2_n69(x)
+    if (x < 1)
+        fun_l3_n616(x)
+    else
+        fun_l3_n90(x)
+    end
+end
+
+def fun_l2_n70(x)
+    if (x < 1)
+        fun_l3_n158(x)
+    else
+        fun_l3_n910(x)
+    end
+end
+
+def fun_l2_n71(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n72(x)
+    if (x < 1)
+        fun_l3_n585(x)
+    else
+        fun_l3_n405(x)
+    end
+end
+
+def fun_l2_n73(x)
+    if (x < 1)
+        fun_l3_n227(x)
+    else
+        fun_l3_n583(x)
+    end
+end
+
+def fun_l2_n74(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n110(x)
+    end
+end
+
+def fun_l2_n75(x)
+    if (x < 1)
+        fun_l3_n393(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n76(x)
+    if (x < 1)
+        fun_l3_n935(x)
+    else
+        fun_l3_n593(x)
+    end
+end
+
+def fun_l2_n77(x)
+    if (x < 1)
+        fun_l3_n239(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n78(x)
+    if (x < 1)
+        fun_l3_n192(x)
+    else
+        fun_l3_n722(x)
+    end
+end
+
+def fun_l2_n79(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n80(x)
+    if (x < 1)
+        fun_l3_n692(x)
+    else
+        fun_l3_n895(x)
+    end
+end
+
+def fun_l2_n81(x)
+    if (x < 1)
+        fun_l3_n246(x)
+    else
+        fun_l3_n340(x)
+    end
+end
+
+def fun_l2_n82(x)
+    if (x < 1)
+        fun_l3_n368(x)
+    else
+        fun_l3_n255(x)
+    end
+end
+
+def fun_l2_n83(x)
+    if (x < 1)
+        fun_l3_n942(x)
+    else
+        fun_l3_n595(x)
+    end
+end
+
+def fun_l2_n84(x)
+    if (x < 1)
+        fun_l3_n629(x)
+    else
+        fun_l3_n622(x)
+    end
+end
+
+def fun_l2_n85(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n615(x)
+    end
+end
+
+def fun_l2_n86(x)
+    if (x < 1)
+        fun_l3_n295(x)
+    else
+        fun_l3_n809(x)
+    end
+end
+
+def fun_l2_n87(x)
+    if (x < 1)
+        fun_l3_n957(x)
+    else
+        fun_l3_n452(x)
+    end
+end
+
+def fun_l2_n88(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n89(x)
+    if (x < 1)
+        fun_l3_n483(x)
+    else
+        fun_l3_n963(x)
+    end
+end
+
+def fun_l2_n90(x)
+    if (x < 1)
+        fun_l3_n262(x)
+    else
+        fun_l3_n458(x)
+    end
+end
+
+def fun_l2_n91(x)
+    if (x < 1)
+        fun_l3_n277(x)
+    else
+        fun_l3_n30(x)
+    end
+end
+
+def fun_l2_n92(x)
+    if (x < 1)
+        fun_l3_n310(x)
+    else
+        fun_l3_n215(x)
+    end
+end
+
+def fun_l2_n93(x)
+    if (x < 1)
+        fun_l3_n660(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n94(x)
+    if (x < 1)
+        fun_l3_n761(x)
+    else
+        fun_l3_n10(x)
+    end
+end
+
+def fun_l2_n95(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n65(x)
+    end
+end
+
+def fun_l2_n96(x)
+    if (x < 1)
+        fun_l3_n444(x)
+    else
+        fun_l3_n378(x)
+    end
+end
+
+def fun_l2_n97(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n96(x)
+    end
+end
+
+def fun_l2_n98(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n471(x)
+    end
+end
+
+def fun_l2_n99(x)
+    if (x < 1)
+        fun_l3_n544(x)
+    else
+        fun_l3_n1(x)
+    end
+end
+
+def fun_l2_n100(x)
+    if (x < 1)
+        fun_l3_n253(x)
+    else
+        fun_l3_n332(x)
+    end
+end
+
+def fun_l2_n101(x)
+    if (x < 1)
+        fun_l3_n69(x)
+    else
+        fun_l3_n946(x)
+    end
+end
+
+def fun_l2_n102(x)
+    if (x < 1)
+        fun_l3_n458(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n103(x)
+    if (x < 1)
+        fun_l3_n732(x)
+    else
+        fun_l3_n601(x)
+    end
+end
+
+def fun_l2_n104(x)
+    if (x < 1)
+        fun_l3_n737(x)
+    else
+        fun_l3_n530(x)
+    end
+end
+
+def fun_l2_n105(x)
+    if (x < 1)
+        fun_l3_n125(x)
+    else
+        fun_l3_n561(x)
+    end
+end
+
+def fun_l2_n106(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n660(x)
+    end
+end
+
+def fun_l2_n107(x)
+    if (x < 1)
+        fun_l3_n863(x)
+    else
+        fun_l3_n211(x)
+    end
+end
+
+def fun_l2_n108(x)
+    if (x < 1)
+        fun_l3_n221(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n109(x)
+    if (x < 1)
+        fun_l3_n100(x)
+    else
+        fun_l3_n673(x)
+    end
+end
+
+def fun_l2_n110(x)
+    if (x < 1)
+        fun_l3_n434(x)
+    else
+        fun_l3_n348(x)
+    end
+end
+
+def fun_l2_n111(x)
+    if (x < 1)
+        fun_l3_n923(x)
+    else
+        fun_l3_n413(x)
+    end
+end
+
+def fun_l2_n112(x)
+    if (x < 1)
+        fun_l3_n253(x)
+    else
+        fun_l3_n461(x)
+    end
+end
+
+def fun_l2_n113(x)
+    if (x < 1)
+        fun_l3_n946(x)
+    else
+        fun_l3_n406(x)
+    end
+end
+
+def fun_l2_n114(x)
+    if (x < 1)
+        fun_l3_n976(x)
+    else
+        fun_l3_n354(x)
+    end
+end
+
+def fun_l2_n115(x)
+    if (x < 1)
+        fun_l3_n205(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n116(x)
+    if (x < 1)
+        fun_l3_n304(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n117(x)
+    if (x < 1)
+        fun_l3_n917(x)
+    else
+        fun_l3_n276(x)
+    end
+end
+
+def fun_l2_n118(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n119(x)
+    if (x < 1)
+        fun_l3_n39(x)
+    else
+        fun_l3_n549(x)
+    end
+end
+
+def fun_l2_n120(x)
+    if (x < 1)
+        fun_l3_n325(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n121(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n259(x)
+    end
+end
+
+def fun_l2_n122(x)
+    if (x < 1)
+        fun_l3_n572(x)
+    else
+        fun_l3_n747(x)
+    end
+end
+
+def fun_l2_n123(x)
+    if (x < 1)
+        fun_l3_n639(x)
+    else
+        fun_l3_n810(x)
+    end
+end
+
+def fun_l2_n124(x)
+    if (x < 1)
+        fun_l3_n954(x)
+    else
+        fun_l3_n814(x)
+    end
+end
+
+def fun_l2_n125(x)
+    if (x < 1)
+        fun_l3_n932(x)
+    else
+        fun_l3_n275(x)
+    end
+end
+
+def fun_l2_n126(x)
+    if (x < 1)
+        fun_l3_n472(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n127(x)
+    if (x < 1)
+        fun_l3_n725(x)
+    else
+        fun_l3_n497(x)
+    end
+end
+
+def fun_l2_n128(x)
+    if (x < 1)
+        fun_l3_n94(x)
+    else
+        fun_l3_n801(x)
+    end
+end
+
+def fun_l2_n129(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n936(x)
+    end
+end
+
+def fun_l2_n130(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n738(x)
+    end
+end
+
+def fun_l2_n131(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n401(x)
+    end
+end
+
+def fun_l2_n132(x)
+    if (x < 1)
+        fun_l3_n459(x)
+    else
+        fun_l3_n998(x)
+    end
+end
+
+def fun_l2_n133(x)
+    if (x < 1)
+        fun_l3_n158(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n134(x)
+    if (x < 1)
+        fun_l3_n47(x)
+    else
+        fun_l3_n104(x)
+    end
+end
+
+def fun_l2_n135(x)
+    if (x < 1)
+        fun_l3_n154(x)
+    else
+        fun_l3_n239(x)
+    end
+end
+
+def fun_l2_n136(x)
+    if (x < 1)
+        fun_l3_n634(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n137(x)
+    if (x < 1)
+        fun_l3_n867(x)
+    else
+        fun_l3_n578(x)
+    end
+end
+
+def fun_l2_n138(x)
+    if (x < 1)
+        fun_l3_n905(x)
+    else
+        fun_l3_n434(x)
+    end
+end
+
+def fun_l2_n139(x)
+    if (x < 1)
+        fun_l3_n596(x)
+    else
+        fun_l3_n516(x)
+    end
+end
+
+def fun_l2_n140(x)
+    if (x < 1)
+        fun_l3_n150(x)
+    else
+        fun_l3_n901(x)
+    end
+end
+
+def fun_l2_n141(x)
+    if (x < 1)
+        fun_l3_n792(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n142(x)
+    if (x < 1)
+        fun_l3_n539(x)
+    else
+        fun_l3_n206(x)
+    end
+end
+
+def fun_l2_n143(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n788(x)
+    end
+end
+
+def fun_l2_n144(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n868(x)
+    end
+end
+
+def fun_l2_n145(x)
+    if (x < 1)
+        fun_l3_n869(x)
+    else
+        fun_l3_n865(x)
+    end
+end
+
+def fun_l2_n146(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n147(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n658(x)
+    end
+end
+
+def fun_l2_n148(x)
+    if (x < 1)
+        fun_l3_n582(x)
+    else
+        fun_l3_n694(x)
+    end
+end
+
+def fun_l2_n149(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n187(x)
+    end
+end
+
+def fun_l2_n150(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n666(x)
+    end
+end
+
+def fun_l2_n151(x)
+    if (x < 1)
+        fun_l3_n264(x)
+    else
+        fun_l3_n236(x)
+    end
+end
+
+def fun_l2_n152(x)
+    if (x < 1)
+        fun_l3_n984(x)
+    else
+        fun_l3_n469(x)
+    end
+end
+
+def fun_l2_n153(x)
+    if (x < 1)
+        fun_l3_n152(x)
+    else
+        fun_l3_n578(x)
+    end
+end
+
+def fun_l2_n154(x)
+    if (x < 1)
+        fun_l3_n452(x)
+    else
+        fun_l3_n807(x)
+    end
+end
+
+def fun_l2_n155(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n589(x)
+    end
+end
+
+def fun_l2_n156(x)
+    if (x < 1)
+        fun_l3_n356(x)
+    else
+        fun_l3_n454(x)
+    end
+end
+
+def fun_l2_n157(x)
+    if (x < 1)
+        fun_l3_n814(x)
+    else
+        fun_l3_n376(x)
+    end
+end
+
+def fun_l2_n158(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n159(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n571(x)
+    end
+end
+
+def fun_l2_n160(x)
+    if (x < 1)
+        fun_l3_n919(x)
+    else
+        fun_l3_n771(x)
+    end
+end
+
+def fun_l2_n161(x)
+    if (x < 1)
+        fun_l3_n147(x)
+    else
+        fun_l3_n936(x)
+    end
+end
+
+def fun_l2_n162(x)
+    if (x < 1)
+        fun_l3_n638(x)
+    else
+        fun_l3_n23(x)
+    end
+end
+
+def fun_l2_n163(x)
+    if (x < 1)
+        fun_l3_n349(x)
+    else
+        fun_l3_n46(x)
+    end
+end
+
+def fun_l2_n164(x)
+    if (x < 1)
+        fun_l3_n55(x)
+    else
+        fun_l3_n795(x)
+    end
+end
+
+def fun_l2_n165(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n233(x)
+    end
+end
+
+def fun_l2_n166(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n215(x)
+    end
+end
+
+def fun_l2_n167(x)
+    if (x < 1)
+        fun_l3_n244(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n168(x)
+    if (x < 1)
+        fun_l3_n744(x)
+    else
+        fun_l3_n337(x)
+    end
+end
+
+def fun_l2_n169(x)
+    if (x < 1)
+        fun_l3_n760(x)
+    else
+        fun_l3_n82(x)
+    end
+end
+
+def fun_l2_n170(x)
+    if (x < 1)
+        fun_l3_n877(x)
+    else
+        fun_l3_n566(x)
+    end
+end
+
+def fun_l2_n171(x)
+    if (x < 1)
+        fun_l3_n211(x)
+    else
+        fun_l3_n101(x)
+    end
+end
+
+def fun_l2_n172(x)
+    if (x < 1)
+        fun_l3_n143(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n173(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n150(x)
+    end
+end
+
+def fun_l2_n174(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n42(x)
+    end
+end
+
+def fun_l2_n175(x)
+    if (x < 1)
+        fun_l3_n482(x)
+    else
+        fun_l3_n606(x)
+    end
+end
+
+def fun_l2_n176(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n177(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n947(x)
+    end
+end
+
+def fun_l2_n178(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n812(x)
+    end
+end
+
+def fun_l2_n179(x)
+    if (x < 1)
+        fun_l3_n741(x)
+    else
+        fun_l3_n994(x)
+    end
+end
+
+def fun_l2_n180(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n335(x)
+    end
+end
+
+def fun_l2_n181(x)
+    if (x < 1)
+        fun_l3_n994(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n182(x)
+    if (x < 1)
+        fun_l3_n528(x)
+    else
+        fun_l3_n272(x)
+    end
+end
+
+def fun_l2_n183(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n200(x)
+    end
+end
+
+def fun_l2_n184(x)
+    if (x < 1)
+        fun_l3_n105(x)
+    else
+        fun_l3_n897(x)
+    end
+end
+
+def fun_l2_n185(x)
+    if (x < 1)
+        fun_l3_n980(x)
+    else
+        fun_l3_n651(x)
+    end
+end
+
+def fun_l2_n186(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n388(x)
+    end
+end
+
+def fun_l2_n187(x)
+    if (x < 1)
+        fun_l3_n769(x)
+    else
+        fun_l3_n162(x)
+    end
+end
+
+def fun_l2_n188(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n874(x)
+    end
+end
+
+def fun_l2_n189(x)
+    if (x < 1)
+        fun_l3_n407(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n190(x)
+    if (x < 1)
+        fun_l3_n594(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n191(x)
+    if (x < 1)
+        fun_l3_n303(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n192(x)
+    if (x < 1)
+        fun_l3_n768(x)
+    else
+        fun_l3_n226(x)
+    end
+end
+
+def fun_l2_n193(x)
+    if (x < 1)
+        fun_l3_n618(x)
+    else
+        fun_l3_n821(x)
+    end
+end
+
+def fun_l2_n194(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n195(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n196(x)
+    if (x < 1)
+        fun_l3_n943(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n197(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n198(x)
+    if (x < 1)
+        fun_l3_n597(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n199(x)
+    if (x < 1)
+        fun_l3_n517(x)
+    else
+        fun_l3_n34(x)
+    end
+end
+
+def fun_l2_n200(x)
+    if (x < 1)
+        fun_l3_n980(x)
+    else
+        fun_l3_n672(x)
+    end
+end
+
+def fun_l2_n201(x)
+    if (x < 1)
+        fun_l3_n510(x)
+    else
+        fun_l3_n804(x)
+    end
+end
+
+def fun_l2_n202(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n367(x)
+    end
+end
+
+def fun_l2_n203(x)
+    if (x < 1)
+        fun_l3_n546(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n204(x)
+    if (x < 1)
+        fun_l3_n189(x)
+    else
+        fun_l3_n639(x)
+    end
+end
+
+def fun_l2_n205(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n206(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n881(x)
+    end
+end
+
+def fun_l2_n207(x)
+    if (x < 1)
+        fun_l3_n342(x)
+    else
+        fun_l3_n522(x)
+    end
+end
+
+def fun_l2_n208(x)
+    if (x < 1)
+        fun_l3_n173(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n209(x)
+    if (x < 1)
+        fun_l3_n693(x)
+    else
+        fun_l3_n160(x)
+    end
+end
+
+def fun_l2_n210(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n580(x)
+    end
+end
+
+def fun_l2_n211(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n100(x)
+    end
+end
+
+def fun_l2_n212(x)
+    if (x < 1)
+        fun_l3_n915(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n213(x)
+    if (x < 1)
+        fun_l3_n260(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n214(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n257(x)
+    end
+end
+
+def fun_l2_n215(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n216(x)
+    if (x < 1)
+        fun_l3_n291(x)
+    else
+        fun_l3_n625(x)
+    end
+end
+
+def fun_l2_n217(x)
+    if (x < 1)
+        fun_l3_n493(x)
+    else
+        fun_l3_n726(x)
+    end
+end
+
+def fun_l2_n218(x)
+    if (x < 1)
+        fun_l3_n714(x)
+    else
+        fun_l3_n793(x)
+    end
+end
+
+def fun_l2_n219(x)
+    if (x < 1)
+        fun_l3_n683(x)
+    else
+        fun_l3_n715(x)
+    end
+end
+
+def fun_l2_n220(x)
+    if (x < 1)
+        fun_l3_n249(x)
+    else
+        fun_l3_n266(x)
+    end
+end
+
+def fun_l2_n221(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n22(x)
+    end
+end
+
+def fun_l2_n222(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n223(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n412(x)
+    end
+end
+
+def fun_l2_n224(x)
+    if (x < 1)
+        fun_l3_n636(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n225(x)
+    if (x < 1)
+        fun_l3_n971(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n226(x)
+    if (x < 1)
+        fun_l3_n429(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n227(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n267(x)
+    end
+end
+
+def fun_l2_n228(x)
+    if (x < 1)
+        fun_l3_n437(x)
+    else
+        fun_l3_n985(x)
+    end
+end
+
+def fun_l2_n229(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n298(x)
+    end
+end
+
+def fun_l2_n230(x)
+    if (x < 1)
+        fun_l3_n865(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n231(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n232(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n422(x)
+    end
+end
+
+def fun_l2_n233(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n32(x)
+    end
+end
+
+def fun_l2_n234(x)
+    if (x < 1)
+        fun_l3_n25(x)
+    else
+        fun_l3_n518(x)
+    end
+end
+
+def fun_l2_n235(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n179(x)
+    end
+end
+
+def fun_l2_n236(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n237(x)
+    if (x < 1)
+        fun_l3_n398(x)
+    else
+        fun_l3_n921(x)
+    end
+end
+
+def fun_l2_n238(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n795(x)
+    end
+end
+
+def fun_l2_n239(x)
+    if (x < 1)
+        fun_l3_n862(x)
+    else
+        fun_l3_n222(x)
+    end
+end
+
+def fun_l2_n240(x)
+    if (x < 1)
+        fun_l3_n968(x)
+    else
+        fun_l3_n320(x)
+    end
+end
+
+def fun_l2_n241(x)
+    if (x < 1)
+        fun_l3_n559(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n242(x)
+    if (x < 1)
+        fun_l3_n647(x)
+    else
+        fun_l3_n232(x)
+    end
+end
+
+def fun_l2_n243(x)
+    if (x < 1)
+        fun_l3_n425(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n244(x)
+    if (x < 1)
+        fun_l3_n752(x)
+    else
+        fun_l3_n690(x)
+    end
+end
+
+def fun_l2_n245(x)
+    if (x < 1)
+        fun_l3_n382(x)
+    else
+        fun_l3_n817(x)
+    end
+end
+
+def fun_l2_n246(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n380(x)
+    end
+end
+
+def fun_l2_n247(x)
+    if (x < 1)
+        fun_l3_n444(x)
+    else
+        fun_l3_n75(x)
+    end
+end
+
+def fun_l2_n248(x)
+    if (x < 1)
+        fun_l3_n368(x)
+    else
+        fun_l3_n314(x)
+    end
+end
+
+def fun_l2_n249(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n398(x)
+    end
+end
+
+def fun_l2_n250(x)
+    if (x < 1)
+        fun_l3_n376(x)
+    else
+        fun_l3_n449(x)
+    end
+end
+
+def fun_l2_n251(x)
+    if (x < 1)
+        fun_l3_n404(x)
+    else
+        fun_l3_n301(x)
+    end
+end
+
+def fun_l2_n252(x)
+    if (x < 1)
+        fun_l3_n274(x)
+    else
+        fun_l3_n430(x)
+    end
+end
+
+def fun_l2_n253(x)
+    if (x < 1)
+        fun_l3_n734(x)
+    else
+        fun_l3_n255(x)
+    end
+end
+
+def fun_l2_n254(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n944(x)
+    end
+end
+
+def fun_l2_n255(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n898(x)
+    end
+end
+
+def fun_l2_n256(x)
+    if (x < 1)
+        fun_l3_n175(x)
+    else
+        fun_l3_n477(x)
+    end
+end
+
+def fun_l2_n257(x)
+    if (x < 1)
+        fun_l3_n84(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n258(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n144(x)
+    end
+end
+
+def fun_l2_n259(x)
+    if (x < 1)
+        fun_l3_n51(x)
+    else
+        fun_l3_n542(x)
+    end
+end
+
+def fun_l2_n260(x)
+    if (x < 1)
+        fun_l3_n940(x)
+    else
+        fun_l3_n316(x)
+    end
+end
+
+def fun_l2_n261(x)
+    if (x < 1)
+        fun_l3_n702(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n262(x)
+    if (x < 1)
+        fun_l3_n164(x)
+    else
+        fun_l3_n21(x)
+    end
+end
+
+def fun_l2_n263(x)
+    if (x < 1)
+        fun_l3_n432(x)
+    else
+        fun_l3_n496(x)
+    end
+end
+
+def fun_l2_n264(x)
+    if (x < 1)
+        fun_l3_n265(x)
+    else
+        fun_l3_n40(x)
+    end
+end
+
+def fun_l2_n265(x)
+    if (x < 1)
+        fun_l3_n951(x)
+    else
+        fun_l3_n723(x)
+    end
+end
+
+def fun_l2_n266(x)
+    if (x < 1)
+        fun_l3_n279(x)
+    else
+        fun_l3_n167(x)
+    end
+end
+
+def fun_l2_n267(x)
+    if (x < 1)
+        fun_l3_n51(x)
+    else
+        fun_l3_n283(x)
+    end
+end
+
+def fun_l2_n268(x)
+    if (x < 1)
+        fun_l3_n389(x)
+    else
+        fun_l3_n264(x)
+    end
+end
+
+def fun_l2_n269(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n484(x)
+    end
+end
+
+def fun_l2_n270(x)
+    if (x < 1)
+        fun_l3_n435(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n271(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n272(x)
+    if (x < 1)
+        fun_l3_n901(x)
+    else
+        fun_l3_n332(x)
+    end
+end
+
+def fun_l2_n273(x)
+    if (x < 1)
+        fun_l3_n358(x)
+    else
+        fun_l3_n608(x)
+    end
+end
+
+def fun_l2_n274(x)
+    if (x < 1)
+        fun_l3_n885(x)
+    else
+        fun_l3_n490(x)
+    end
+end
+
+def fun_l2_n275(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n87(x)
+    end
+end
+
+def fun_l2_n276(x)
+    if (x < 1)
+        fun_l3_n698(x)
+    else
+        fun_l3_n846(x)
+    end
+end
+
+def fun_l2_n277(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n457(x)
+    end
+end
+
+def fun_l2_n278(x)
+    if (x < 1)
+        fun_l3_n925(x)
+    else
+        fun_l3_n674(x)
+    end
+end
+
+def fun_l2_n279(x)
+    if (x < 1)
+        fun_l3_n797(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n280(x)
+    if (x < 1)
+        fun_l3_n73(x)
+    else
+        fun_l3_n2(x)
+    end
+end
+
+def fun_l2_n281(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n282(x)
+    if (x < 1)
+        fun_l3_n473(x)
+    else
+        fun_l3_n639(x)
+    end
+end
+
+def fun_l2_n283(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n241(x)
+    end
+end
+
+def fun_l2_n284(x)
+    if (x < 1)
+        fun_l3_n0(x)
+    else
+        fun_l3_n445(x)
+    end
+end
+
+def fun_l2_n285(x)
+    if (x < 1)
+        fun_l3_n587(x)
+    else
+        fun_l3_n806(x)
+    end
+end
+
+def fun_l2_n286(x)
+    if (x < 1)
+        fun_l3_n169(x)
+    else
+        fun_l3_n546(x)
+    end
+end
+
+def fun_l2_n287(x)
+    if (x < 1)
+        fun_l3_n623(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n288(x)
+    if (x < 1)
+        fun_l3_n804(x)
+    else
+        fun_l3_n80(x)
+    end
+end
+
+def fun_l2_n289(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n290(x)
+    if (x < 1)
+        fun_l3_n551(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n291(x)
+    if (x < 1)
+        fun_l3_n686(x)
+    else
+        fun_l3_n884(x)
+    end
+end
+
+def fun_l2_n292(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n293(x)
+    if (x < 1)
+        fun_l3_n375(x)
+    else
+        fun_l3_n309(x)
+    end
+end
+
+def fun_l2_n294(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n295(x)
+    if (x < 1)
+        fun_l3_n332(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n296(x)
+    if (x < 1)
+        fun_l3_n333(x)
+    else
+        fun_l3_n254(x)
+    end
+end
+
+def fun_l2_n297(x)
+    if (x < 1)
+        fun_l3_n24(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n298(x)
+    if (x < 1)
+        fun_l3_n96(x)
+    else
+        fun_l3_n653(x)
+    end
+end
+
+def fun_l2_n299(x)
+    if (x < 1)
+        fun_l3_n920(x)
+    else
+        fun_l3_n475(x)
+    end
+end
+
+def fun_l2_n300(x)
+    if (x < 1)
+        fun_l3_n337(x)
+    else
+        fun_l3_n378(x)
+    end
+end
+
+def fun_l2_n301(x)
+    if (x < 1)
+        fun_l3_n778(x)
+    else
+        fun_l3_n216(x)
+    end
+end
+
+def fun_l2_n302(x)
+    if (x < 1)
+        fun_l3_n366(x)
+    else
+        fun_l3_n562(x)
+    end
+end
+
+def fun_l2_n303(x)
+    if (x < 1)
+        fun_l3_n656(x)
+    else
+        fun_l3_n779(x)
+    end
+end
+
+def fun_l2_n304(x)
+    if (x < 1)
+        fun_l3_n526(x)
+    else
+        fun_l3_n783(x)
+    end
+end
+
+def fun_l2_n305(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n744(x)
+    end
+end
+
+def fun_l2_n306(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n307(x)
+    if (x < 1)
+        fun_l3_n385(x)
+    else
+        fun_l3_n937(x)
+    end
+end
+
+def fun_l2_n308(x)
+    if (x < 1)
+        fun_l3_n742(x)
+    else
+        fun_l3_n984(x)
+    end
+end
+
+def fun_l2_n309(x)
+    if (x < 1)
+        fun_l3_n388(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n310(x)
+    if (x < 1)
+        fun_l3_n252(x)
+    else
+        fun_l3_n585(x)
+    end
+end
+
+def fun_l2_n311(x)
+    if (x < 1)
+        fun_l3_n121(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n312(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n338(x)
+    end
+end
+
+def fun_l2_n313(x)
+    if (x < 1)
+        fun_l3_n115(x)
+    else
+        fun_l3_n748(x)
+    end
+end
+
+def fun_l2_n314(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n315(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n428(x)
+    end
+end
+
+def fun_l2_n316(x)
+    if (x < 1)
+        fun_l3_n416(x)
+    else
+        fun_l3_n499(x)
+    end
+end
+
+def fun_l2_n317(x)
+    if (x < 1)
+        fun_l3_n305(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n318(x)
+    if (x < 1)
+        fun_l3_n506(x)
+    else
+        fun_l3_n579(x)
+    end
+end
+
+def fun_l2_n319(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n459(x)
+    end
+end
+
+def fun_l2_n320(x)
+    if (x < 1)
+        fun_l3_n278(x)
+    else
+        fun_l3_n89(x)
+    end
+end
+
+def fun_l2_n321(x)
+    if (x < 1)
+        fun_l3_n319(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n322(x)
+    if (x < 1)
+        fun_l3_n96(x)
+    else
+        fun_l3_n334(x)
+    end
+end
+
+def fun_l2_n323(x)
+    if (x < 1)
+        fun_l3_n913(x)
+    else
+        fun_l3_n309(x)
+    end
+end
+
+def fun_l2_n324(x)
+    if (x < 1)
+        fun_l3_n186(x)
+    else
+        fun_l3_n453(x)
+    end
+end
+
+def fun_l2_n325(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n326(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n700(x)
+    end
+end
+
+def fun_l2_n327(x)
+    if (x < 1)
+        fun_l3_n316(x)
+    else
+        fun_l3_n3(x)
+    end
+end
+
+def fun_l2_n328(x)
+    if (x < 1)
+        fun_l3_n680(x)
+    else
+        fun_l3_n275(x)
+    end
+end
+
+def fun_l2_n329(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n971(x)
+    end
+end
+
+def fun_l2_n330(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n389(x)
+    end
+end
+
+def fun_l2_n331(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n778(x)
+    end
+end
+
+def fun_l2_n332(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n478(x)
+    end
+end
+
+def fun_l2_n333(x)
+    if (x < 1)
+        fun_l3_n778(x)
+    else
+        fun_l3_n894(x)
+    end
+end
+
+def fun_l2_n334(x)
+    if (x < 1)
+        fun_l3_n198(x)
+    else
+        fun_l3_n830(x)
+    end
+end
+
+def fun_l2_n335(x)
+    if (x < 1)
+        fun_l3_n874(x)
+    else
+        fun_l3_n861(x)
+    end
+end
+
+def fun_l2_n336(x)
+    if (x < 1)
+        fun_l3_n66(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n337(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n849(x)
+    end
+end
+
+def fun_l2_n338(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n891(x)
+    end
+end
+
+def fun_l2_n339(x)
+    if (x < 1)
+        fun_l3_n377(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n340(x)
+    if (x < 1)
+        fun_l3_n278(x)
+    else
+        fun_l3_n495(x)
+    end
+end
+
+def fun_l2_n341(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n842(x)
+    end
+end
+
+def fun_l2_n342(x)
+    if (x < 1)
+        fun_l3_n971(x)
+    else
+        fun_l3_n296(x)
+    end
+end
+
+def fun_l2_n343(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n344(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n515(x)
+    end
+end
+
+def fun_l2_n345(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n766(x)
+    end
+end
+
+def fun_l2_n346(x)
+    if (x < 1)
+        fun_l3_n816(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n347(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n348(x)
+    if (x < 1)
+        fun_l3_n316(x)
+    else
+        fun_l3_n497(x)
+    end
+end
+
+def fun_l2_n349(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n536(x)
+    end
+end
+
+def fun_l2_n350(x)
+    if (x < 1)
+        fun_l3_n252(x)
+    else
+        fun_l3_n981(x)
+    end
+end
+
+def fun_l2_n351(x)
+    if (x < 1)
+        fun_l3_n783(x)
+    else
+        fun_l3_n596(x)
+    end
+end
+
+def fun_l2_n352(x)
+    if (x < 1)
+        fun_l3_n72(x)
+    else
+        fun_l3_n978(x)
+    end
+end
+
+def fun_l2_n353(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n354(x)
+    if (x < 1)
+        fun_l3_n671(x)
+    else
+        fun_l3_n297(x)
+    end
+end
+
+def fun_l2_n355(x)
+    if (x < 1)
+        fun_l3_n820(x)
+    else
+        fun_l3_n456(x)
+    end
+end
+
+def fun_l2_n356(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n760(x)
+    end
+end
+
+def fun_l2_n357(x)
+    if (x < 1)
+        fun_l3_n676(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n358(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n359(x)
+    if (x < 1)
+        fun_l3_n492(x)
+    else
+        fun_l3_n845(x)
+    end
+end
+
+def fun_l2_n360(x)
+    if (x < 1)
+        fun_l3_n58(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n361(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n434(x)
+    end
+end
+
+def fun_l2_n362(x)
+    if (x < 1)
+        fun_l3_n129(x)
+    else
+        fun_l3_n582(x)
+    end
+end
+
+def fun_l2_n363(x)
+    if (x < 1)
+        fun_l3_n901(x)
+    else
+        fun_l3_n405(x)
+    end
+end
+
+def fun_l2_n364(x)
+    if (x < 1)
+        fun_l3_n577(x)
+    else
+        fun_l3_n550(x)
+    end
+end
+
+def fun_l2_n365(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n660(x)
+    end
+end
+
+def fun_l2_n366(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n755(x)
+    end
+end
+
+def fun_l2_n367(x)
+    if (x < 1)
+        fun_l3_n875(x)
+    else
+        fun_l3_n784(x)
+    end
+end
+
+def fun_l2_n368(x)
+    if (x < 1)
+        fun_l3_n914(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n369(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n932(x)
+    end
+end
+
+def fun_l2_n370(x)
+    if (x < 1)
+        fun_l3_n796(x)
+    else
+        fun_l3_n920(x)
+    end
+end
+
+def fun_l2_n371(x)
+    if (x < 1)
+        fun_l3_n456(x)
+    else
+        fun_l3_n188(x)
+    end
+end
+
+def fun_l2_n372(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n905(x)
+    end
+end
+
+def fun_l2_n373(x)
+    if (x < 1)
+        fun_l3_n906(x)
+    else
+        fun_l3_n993(x)
+    end
+end
+
+def fun_l2_n374(x)
+    if (x < 1)
+        fun_l3_n811(x)
+    else
+        fun_l3_n629(x)
+    end
+end
+
+def fun_l2_n375(x)
+    if (x < 1)
+        fun_l3_n5(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n376(x)
+    if (x < 1)
+        fun_l3_n240(x)
+    else
+        fun_l3_n859(x)
+    end
+end
+
+def fun_l2_n377(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n196(x)
+    end
+end
+
+def fun_l2_n378(x)
+    if (x < 1)
+        fun_l3_n918(x)
+    else
+        fun_l3_n371(x)
+    end
+end
+
+def fun_l2_n379(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n269(x)
+    end
+end
+
+def fun_l2_n380(x)
+    if (x < 1)
+        fun_l3_n46(x)
+    else
+        fun_l3_n397(x)
+    end
+end
+
+def fun_l2_n381(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n647(x)
+    end
+end
+
+def fun_l2_n382(x)
+    if (x < 1)
+        fun_l3_n788(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n383(x)
+    if (x < 1)
+        fun_l3_n395(x)
+    else
+        fun_l3_n268(x)
+    end
+end
+
+def fun_l2_n384(x)
+    if (x < 1)
+        fun_l3_n39(x)
+    else
+        fun_l3_n950(x)
+    end
+end
+
+def fun_l2_n385(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n241(x)
+    end
+end
+
+def fun_l2_n386(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n416(x)
+    end
+end
+
+def fun_l2_n387(x)
+    if (x < 1)
+        fun_l3_n750(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n388(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n824(x)
+    end
+end
+
+def fun_l2_n389(x)
+    if (x < 1)
+        fun_l3_n3(x)
+    else
+        fun_l3_n872(x)
+    end
+end
+
+def fun_l2_n390(x)
+    if (x < 1)
+        fun_l3_n944(x)
+    else
+        fun_l3_n49(x)
+    end
+end
+
+def fun_l2_n391(x)
+    if (x < 1)
+        fun_l3_n645(x)
+    else
+        fun_l3_n604(x)
+    end
+end
+
+def fun_l2_n392(x)
+    if (x < 1)
+        fun_l3_n539(x)
+    else
+        fun_l3_n374(x)
+    end
+end
+
+def fun_l2_n393(x)
+    if (x < 1)
+        fun_l3_n728(x)
+    else
+        fun_l3_n620(x)
+    end
+end
+
+def fun_l2_n394(x)
+    if (x < 1)
+        fun_l3_n538(x)
+    else
+        fun_l3_n233(x)
+    end
+end
+
+def fun_l2_n395(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n396(x)
+    if (x < 1)
+        fun_l3_n54(x)
+    else
+        fun_l3_n958(x)
+    end
+end
+
+def fun_l2_n397(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n398(x)
+    if (x < 1)
+        fun_l3_n846(x)
+    else
+        fun_l3_n234(x)
+    end
+end
+
+def fun_l2_n399(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n128(x)
+    end
+end
+
+def fun_l2_n400(x)
+    if (x < 1)
+        fun_l3_n15(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n401(x)
+    if (x < 1)
+        fun_l3_n944(x)
+    else
+        fun_l3_n455(x)
+    end
+end
+
+def fun_l2_n402(x)
+    if (x < 1)
+        fun_l3_n962(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n403(x)
+    if (x < 1)
+        fun_l3_n408(x)
+    else
+        fun_l3_n689(x)
+    end
+end
+
+def fun_l2_n404(x)
+    if (x < 1)
+        fun_l3_n722(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n405(x)
+    if (x < 1)
+        fun_l3_n410(x)
+    else
+        fun_l3_n543(x)
+    end
+end
+
+def fun_l2_n406(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n407(x)
+    if (x < 1)
+        fun_l3_n426(x)
+    else
+        fun_l3_n467(x)
+    end
+end
+
+def fun_l2_n408(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n163(x)
+    end
+end
+
+def fun_l2_n409(x)
+    if (x < 1)
+        fun_l3_n418(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n410(x)
+    if (x < 1)
+        fun_l3_n915(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n411(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n507(x)
+    end
+end
+
+def fun_l2_n412(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n938(x)
+    end
+end
+
+def fun_l2_n413(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n414(x)
+    if (x < 1)
+        fun_l3_n801(x)
+    else
+        fun_l3_n604(x)
+    end
+end
+
+def fun_l2_n415(x)
+    if (x < 1)
+        fun_l3_n773(x)
+    else
+        fun_l3_n951(x)
+    end
+end
+
+def fun_l2_n416(x)
+    if (x < 1)
+        fun_l3_n335(x)
+    else
+        fun_l3_n157(x)
+    end
+end
+
+def fun_l2_n417(x)
+    if (x < 1)
+        fun_l3_n480(x)
+    else
+        fun_l3_n106(x)
+    end
+end
+
+def fun_l2_n418(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n419(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n698(x)
+    end
+end
+
+def fun_l2_n420(x)
+    if (x < 1)
+        fun_l3_n102(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n421(x)
+    if (x < 1)
+        fun_l3_n64(x)
+    else
+        fun_l3_n574(x)
+    end
+end
+
+def fun_l2_n422(x)
+    if (x < 1)
+        fun_l3_n208(x)
+    else
+        fun_l3_n904(x)
+    end
+end
+
+def fun_l2_n423(x)
+    if (x < 1)
+        fun_l3_n715(x)
+    else
+        fun_l3_n414(x)
+    end
+end
+
+def fun_l2_n424(x)
+    if (x < 1)
+        fun_l3_n455(x)
+    else
+        fun_l3_n219(x)
+    end
+end
+
+def fun_l2_n425(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n160(x)
+    end
+end
+
+def fun_l2_n426(x)
+    if (x < 1)
+        fun_l3_n729(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n427(x)
+    if (x < 1)
+        fun_l3_n159(x)
+    else
+        fun_l3_n482(x)
+    end
+end
+
+def fun_l2_n428(x)
+    if (x < 1)
+        fun_l3_n182(x)
+    else
+        fun_l3_n687(x)
+    end
+end
+
+def fun_l2_n429(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n856(x)
+    end
+end
+
+def fun_l2_n430(x)
+    if (x < 1)
+        fun_l3_n494(x)
+    else
+        fun_l3_n365(x)
+    end
+end
+
+def fun_l2_n431(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n82(x)
+    end
+end
+
+def fun_l2_n432(x)
+    if (x < 1)
+        fun_l3_n311(x)
+    else
+        fun_l3_n412(x)
+    end
+end
+
+def fun_l2_n433(x)
+    if (x < 1)
+        fun_l3_n824(x)
+    else
+        fun_l3_n494(x)
+    end
+end
+
+def fun_l2_n434(x)
+    if (x < 1)
+        fun_l3_n471(x)
+    else
+        fun_l3_n174(x)
+    end
+end
+
+def fun_l2_n435(x)
+    if (x < 1)
+        fun_l3_n10(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n436(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n518(x)
+    end
+end
+
+def fun_l2_n437(x)
+    if (x < 1)
+        fun_l3_n497(x)
+    else
+        fun_l3_n685(x)
+    end
+end
+
+def fun_l2_n438(x)
+    if (x < 1)
+        fun_l3_n639(x)
+    else
+        fun_l3_n695(x)
+    end
+end
+
+def fun_l2_n439(x)
+    if (x < 1)
+        fun_l3_n898(x)
+    else
+        fun_l3_n114(x)
+    end
+end
+
+def fun_l2_n440(x)
+    if (x < 1)
+        fun_l3_n12(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n441(x)
+    if (x < 1)
+        fun_l3_n556(x)
+    else
+        fun_l3_n684(x)
+    end
+end
+
+def fun_l2_n442(x)
+    if (x < 1)
+        fun_l3_n403(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n443(x)
+    if (x < 1)
+        fun_l3_n514(x)
+    else
+        fun_l3_n943(x)
+    end
+end
+
+def fun_l2_n444(x)
+    if (x < 1)
+        fun_l3_n218(x)
+    else
+        fun_l3_n94(x)
+    end
+end
+
+def fun_l2_n445(x)
+    if (x < 1)
+        fun_l3_n0(x)
+    else
+        fun_l3_n731(x)
+    end
+end
+
+def fun_l2_n446(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n447(x)
+    if (x < 1)
+        fun_l3_n79(x)
+    else
+        fun_l3_n900(x)
+    end
+end
+
+def fun_l2_n448(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n449(x)
+    if (x < 1)
+        fun_l3_n607(x)
+    else
+        fun_l3_n514(x)
+    end
+end
+
+def fun_l2_n450(x)
+    if (x < 1)
+        fun_l3_n855(x)
+    else
+        fun_l3_n223(x)
+    end
+end
+
+def fun_l2_n451(x)
+    if (x < 1)
+        fun_l3_n824(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n452(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n555(x)
+    end
+end
+
+def fun_l2_n453(x)
+    if (x < 1)
+        fun_l3_n553(x)
+    else
+        fun_l3_n130(x)
+    end
+end
+
+def fun_l2_n454(x)
+    if (x < 1)
+        fun_l3_n350(x)
+    else
+        fun_l3_n545(x)
+    end
+end
+
+def fun_l2_n455(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n950(x)
+    end
+end
+
+def fun_l2_n456(x)
+    if (x < 1)
+        fun_l3_n581(x)
+    else
+        fun_l3_n957(x)
+    end
+end
+
+def fun_l2_n457(x)
+    if (x < 1)
+        fun_l3_n688(x)
+    else
+        fun_l3_n560(x)
+    end
+end
+
+def fun_l2_n458(x)
+    if (x < 1)
+        fun_l3_n655(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n459(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n796(x)
+    end
+end
+
+def fun_l2_n460(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n461(x)
+    if (x < 1)
+        fun_l3_n153(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n462(x)
+    if (x < 1)
+        fun_l3_n401(x)
+    else
+        fun_l3_n248(x)
+    end
+end
+
+def fun_l2_n463(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n906(x)
+    end
+end
+
+def fun_l2_n464(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n911(x)
+    end
+end
+
+def fun_l2_n465(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n430(x)
+    end
+end
+
+def fun_l2_n466(x)
+    if (x < 1)
+        fun_l3_n537(x)
+    else
+        fun_l3_n470(x)
+    end
+end
+
+def fun_l2_n467(x)
+    if (x < 1)
+        fun_l3_n666(x)
+    else
+        fun_l3_n695(x)
+    end
+end
+
+def fun_l2_n468(x)
+    if (x < 1)
+        fun_l3_n126(x)
+    else
+        fun_l3_n201(x)
+    end
+end
+
+def fun_l2_n469(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n741(x)
+    end
+end
+
+def fun_l2_n470(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n471(x)
+    if (x < 1)
+        fun_l3_n619(x)
+    else
+        fun_l3_n425(x)
+    end
+end
+
+def fun_l2_n472(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n865(x)
+    end
+end
+
+def fun_l2_n473(x)
+    if (x < 1)
+        fun_l3_n182(x)
+    else
+        fun_l3_n350(x)
+    end
+end
+
+def fun_l2_n474(x)
+    if (x < 1)
+        fun_l3_n752(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n475(x)
+    if (x < 1)
+        fun_l3_n184(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n476(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n232(x)
+    end
+end
+
+def fun_l2_n477(x)
+    if (x < 1)
+        fun_l3_n588(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n478(x)
+    if (x < 1)
+        fun_l3_n320(x)
+    else
+        fun_l3_n599(x)
+    end
+end
+
+def fun_l2_n479(x)
+    if (x < 1)
+        fun_l3_n999(x)
+    else
+        fun_l3_n678(x)
+    end
+end
+
+def fun_l2_n480(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n637(x)
+    end
+end
+
+def fun_l2_n481(x)
+    if (x < 1)
+        fun_l3_n291(x)
+    else
+        fun_l3_n347(x)
+    end
+end
+
+def fun_l2_n482(x)
+    if (x < 1)
+        fun_l3_n873(x)
+    else
+        fun_l3_n435(x)
+    end
+end
+
+def fun_l2_n483(x)
+    if (x < 1)
+        fun_l3_n718(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n484(x)
+    if (x < 1)
+        fun_l3_n188(x)
+    else
+        fun_l3_n751(x)
+    end
+end
+
+def fun_l2_n485(x)
+    if (x < 1)
+        fun_l3_n501(x)
+    else
+        fun_l3_n235(x)
+    end
+end
+
+def fun_l2_n486(x)
+    if (x < 1)
+        fun_l3_n578(x)
+    else
+        fun_l3_n224(x)
+    end
+end
+
+def fun_l2_n487(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n488(x)
+    if (x < 1)
+        fun_l3_n17(x)
+    else
+        fun_l3_n727(x)
+    end
+end
+
+def fun_l2_n489(x)
+    if (x < 1)
+        fun_l3_n699(x)
+    else
+        fun_l3_n102(x)
+    end
+end
+
+def fun_l2_n490(x)
+    if (x < 1)
+        fun_l3_n518(x)
+    else
+        fun_l3_n15(x)
+    end
+end
+
+def fun_l2_n491(x)
+    if (x < 1)
+        fun_l3_n889(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n492(x)
+    if (x < 1)
+        fun_l3_n715(x)
+    else
+        fun_l3_n27(x)
+    end
+end
+
+def fun_l2_n493(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n130(x)
+    end
+end
+
+def fun_l2_n494(x)
+    if (x < 1)
+        fun_l3_n99(x)
+    else
+        fun_l3_n223(x)
+    end
+end
+
+def fun_l2_n495(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n811(x)
+    end
+end
+
+def fun_l2_n496(x)
+    if (x < 1)
+        fun_l3_n457(x)
+    else
+        fun_l3_n527(x)
+    end
+end
+
+def fun_l2_n497(x)
+    if (x < 1)
+        fun_l3_n312(x)
+    else
+        fun_l3_n902(x)
+    end
+end
+
+def fun_l2_n498(x)
+    if (x < 1)
+        fun_l3_n63(x)
+    else
+        fun_l3_n948(x)
+    end
+end
+
+def fun_l2_n499(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n752(x)
+    end
+end
+
+def fun_l2_n500(x)
+    if (x < 1)
+        fun_l3_n583(x)
+    else
+        fun_l3_n427(x)
+    end
+end
+
+def fun_l2_n501(x)
+    if (x < 1)
+        fun_l3_n536(x)
+    else
+        fun_l3_n671(x)
+    end
+end
+
+def fun_l2_n502(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n170(x)
+    end
+end
+
+def fun_l2_n503(x)
+    if (x < 1)
+        fun_l3_n280(x)
+    else
+        fun_l3_n390(x)
+    end
+end
+
+def fun_l2_n504(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n267(x)
+    end
+end
+
+def fun_l2_n505(x)
+    if (x < 1)
+        fun_l3_n241(x)
+    else
+        fun_l3_n345(x)
+    end
+end
+
+def fun_l2_n506(x)
+    if (x < 1)
+        fun_l3_n960(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n507(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n3(x)
+    end
+end
+
+def fun_l2_n508(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n597(x)
+    end
+end
+
+def fun_l2_n509(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n70(x)
+    end
+end
+
+def fun_l2_n510(x)
+    if (x < 1)
+        fun_l3_n855(x)
+    else
+        fun_l3_n259(x)
+    end
+end
+
+def fun_l2_n511(x)
+    if (x < 1)
+        fun_l3_n987(x)
+    else
+        fun_l3_n182(x)
+    end
+end
+
+def fun_l2_n512(x)
+    if (x < 1)
+        fun_l3_n787(x)
+    else
+        fun_l3_n656(x)
+    end
+end
+
+def fun_l2_n513(x)
+    if (x < 1)
+        fun_l3_n348(x)
+    else
+        fun_l3_n242(x)
+    end
+end
+
+def fun_l2_n514(x)
+    if (x < 1)
+        fun_l3_n530(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n515(x)
+    if (x < 1)
+        fun_l3_n840(x)
+    else
+        fun_l3_n302(x)
+    end
+end
+
+def fun_l2_n516(x)
+    if (x < 1)
+        fun_l3_n678(x)
+    else
+        fun_l3_n732(x)
+    end
+end
+
+def fun_l2_n517(x)
+    if (x < 1)
+        fun_l3_n160(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n518(x)
+    if (x < 1)
+        fun_l3_n518(x)
+    else
+        fun_l3_n830(x)
+    end
+end
+
+def fun_l2_n519(x)
+    if (x < 1)
+        fun_l3_n595(x)
+    else
+        fun_l3_n95(x)
+    end
+end
+
+def fun_l2_n520(x)
+    if (x < 1)
+        fun_l3_n939(x)
+    else
+        fun_l3_n954(x)
+    end
+end
+
+def fun_l2_n521(x)
+    if (x < 1)
+        fun_l3_n931(x)
+    else
+        fun_l3_n686(x)
+    end
+end
+
+def fun_l2_n522(x)
+    if (x < 1)
+        fun_l3_n117(x)
+    else
+        fun_l3_n501(x)
+    end
+end
+
+def fun_l2_n523(x)
+    if (x < 1)
+        fun_l3_n727(x)
+    else
+        fun_l3_n712(x)
+    end
+end
+
+def fun_l2_n524(x)
+    if (x < 1)
+        fun_l3_n152(x)
+    else
+        fun_l3_n453(x)
+    end
+end
+
+def fun_l2_n525(x)
+    if (x < 1)
+        fun_l3_n375(x)
+    else
+        fun_l3_n186(x)
+    end
+end
+
+def fun_l2_n526(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n465(x)
+    end
+end
+
+def fun_l2_n527(x)
+    if (x < 1)
+        fun_l3_n411(x)
+    else
+        fun_l3_n208(x)
+    end
+end
+
+def fun_l2_n528(x)
+    if (x < 1)
+        fun_l3_n696(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n529(x)
+    if (x < 1)
+        fun_l3_n606(x)
+    else
+        fun_l3_n682(x)
+    end
+end
+
+def fun_l2_n530(x)
+    if (x < 1)
+        fun_l3_n920(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n531(x)
+    if (x < 1)
+        fun_l3_n201(x)
+    else
+        fun_l3_n27(x)
+    end
+end
+
+def fun_l2_n532(x)
+    if (x < 1)
+        fun_l3_n643(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n533(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n576(x)
+    end
+end
+
+def fun_l2_n534(x)
+    if (x < 1)
+        fun_l3_n135(x)
+    else
+        fun_l3_n738(x)
+    end
+end
+
+def fun_l2_n535(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n810(x)
+    end
+end
+
+def fun_l2_n536(x)
+    if (x < 1)
+        fun_l3_n922(x)
+    else
+        fun_l3_n456(x)
+    end
+end
+
+def fun_l2_n537(x)
+    if (x < 1)
+        fun_l3_n511(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n538(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n826(x)
+    end
+end
+
+def fun_l2_n539(x)
+    if (x < 1)
+        fun_l3_n7(x)
+    else
+        fun_l3_n362(x)
+    end
+end
+
+def fun_l2_n540(x)
+    if (x < 1)
+        fun_l3_n132(x)
+    else
+        fun_l3_n819(x)
+    end
+end
+
+def fun_l2_n541(x)
+    if (x < 1)
+        fun_l3_n600(x)
+    else
+        fun_l3_n155(x)
+    end
+end
+
+def fun_l2_n542(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n827(x)
+    end
+end
+
+def fun_l2_n543(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n957(x)
+    end
+end
+
+def fun_l2_n544(x)
+    if (x < 1)
+        fun_l3_n912(x)
+    else
+        fun_l3_n503(x)
+    end
+end
+
+def fun_l2_n545(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n546(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n105(x)
+    end
+end
+
+def fun_l2_n547(x)
+    if (x < 1)
+        fun_l3_n352(x)
+    else
+        fun_l3_n762(x)
+    end
+end
+
+def fun_l2_n548(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n714(x)
+    end
+end
+
+def fun_l2_n549(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n799(x)
+    end
+end
+
+def fun_l2_n550(x)
+    if (x < 1)
+        fun_l3_n624(x)
+    else
+        fun_l3_n131(x)
+    end
+end
+
+def fun_l2_n551(x)
+    if (x < 1)
+        fun_l3_n53(x)
+    else
+        fun_l3_n377(x)
+    end
+end
+
+def fun_l2_n552(x)
+    if (x < 1)
+        fun_l3_n377(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n553(x)
+    if (x < 1)
+        fun_l3_n302(x)
+    else
+        fun_l3_n593(x)
+    end
+end
+
+def fun_l2_n554(x)
+    if (x < 1)
+        fun_l3_n573(x)
+    else
+        fun_l3_n727(x)
+    end
+end
+
+def fun_l2_n555(x)
+    if (x < 1)
+        fun_l3_n575(x)
+    else
+        fun_l3_n838(x)
+    end
+end
+
+def fun_l2_n556(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n557(x)
+    if (x < 1)
+        fun_l3_n921(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n558(x)
+    if (x < 1)
+        fun_l3_n987(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n559(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n560(x)
+    if (x < 1)
+        fun_l3_n950(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n561(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n491(x)
+    end
+end
+
+def fun_l2_n562(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n840(x)
+    end
+end
+
+def fun_l2_n563(x)
+    if (x < 1)
+        fun_l3_n473(x)
+    else
+        fun_l3_n907(x)
+    end
+end
+
+def fun_l2_n564(x)
+    if (x < 1)
+        fun_l3_n695(x)
+    else
+        fun_l3_n951(x)
+    end
+end
+
+def fun_l2_n565(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n12(x)
+    end
+end
+
+def fun_l2_n566(x)
+    if (x < 1)
+        fun_l3_n32(x)
+    else
+        fun_l3_n759(x)
+    end
+end
+
+def fun_l2_n567(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n297(x)
+    end
+end
+
+def fun_l2_n568(x)
+    if (x < 1)
+        fun_l3_n520(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n569(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n505(x)
+    end
+end
+
+def fun_l2_n570(x)
+    if (x < 1)
+        fun_l3_n661(x)
+    else
+        fun_l3_n447(x)
+    end
+end
+
+def fun_l2_n571(x)
+    if (x < 1)
+        fun_l3_n538(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n572(x)
+    if (x < 1)
+        fun_l3_n584(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n573(x)
+    if (x < 1)
+        fun_l3_n76(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n574(x)
+    if (x < 1)
+        fun_l3_n22(x)
+    else
+        fun_l3_n328(x)
+    end
+end
+
+def fun_l2_n575(x)
+    if (x < 1)
+        fun_l3_n397(x)
+    else
+        fun_l3_n640(x)
+    end
+end
+
+def fun_l2_n576(x)
+    if (x < 1)
+        fun_l3_n227(x)
+    else
+        fun_l3_n236(x)
+    end
+end
+
+def fun_l2_n577(x)
+    if (x < 1)
+        fun_l3_n743(x)
+    else
+        fun_l3_n974(x)
+    end
+end
+
+def fun_l2_n578(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n229(x)
+    end
+end
+
+def fun_l2_n579(x)
+    if (x < 1)
+        fun_l3_n401(x)
+    else
+        fun_l3_n672(x)
+    end
+end
+
+def fun_l2_n580(x)
+    if (x < 1)
+        fun_l3_n837(x)
+    else
+        fun_l3_n804(x)
+    end
+end
+
+def fun_l2_n581(x)
+    if (x < 1)
+        fun_l3_n526(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n582(x)
+    if (x < 1)
+        fun_l3_n2(x)
+    else
+        fun_l3_n692(x)
+    end
+end
+
+def fun_l2_n583(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n584(x)
+    if (x < 1)
+        fun_l3_n60(x)
+    else
+        fun_l3_n682(x)
+    end
+end
+
+def fun_l2_n585(x)
+    if (x < 1)
+        fun_l3_n646(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n586(x)
+    if (x < 1)
+        fun_l3_n466(x)
+    else
+        fun_l3_n91(x)
+    end
+end
+
+def fun_l2_n587(x)
+    if (x < 1)
+        fun_l3_n294(x)
+    else
+        fun_l3_n813(x)
+    end
+end
+
+def fun_l2_n588(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n64(x)
+    end
+end
+
+def fun_l2_n589(x)
+    if (x < 1)
+        fun_l3_n703(x)
+    else
+        fun_l3_n937(x)
+    end
+end
+
+def fun_l2_n590(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n970(x)
+    end
+end
+
+def fun_l2_n591(x)
+    if (x < 1)
+        fun_l3_n566(x)
+    else
+        fun_l3_n750(x)
+    end
+end
+
+def fun_l2_n592(x)
+    if (x < 1)
+        fun_l3_n905(x)
+    else
+        fun_l3_n840(x)
+    end
+end
+
+def fun_l2_n593(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n594(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n4(x)
+    end
+end
+
+def fun_l2_n595(x)
+    if (x < 1)
+        fun_l3_n818(x)
+    else
+        fun_l3_n117(x)
+    end
+end
+
+def fun_l2_n596(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n599(x)
+    end
+end
+
+def fun_l2_n597(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n960(x)
+    end
+end
+
+def fun_l2_n598(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n811(x)
+    end
+end
+
+def fun_l2_n599(x)
+    if (x < 1)
+        fun_l3_n299(x)
+    else
+        fun_l3_n188(x)
+    end
+end
+
+def fun_l2_n600(x)
+    if (x < 1)
+        fun_l3_n129(x)
+    else
+        fun_l3_n730(x)
+    end
+end
+
+def fun_l2_n601(x)
+    if (x < 1)
+        fun_l3_n412(x)
+    else
+        fun_l3_n353(x)
+    end
+end
+
+def fun_l2_n602(x)
+    if (x < 1)
+        fun_l3_n658(x)
+    else
+        fun_l3_n774(x)
+    end
+end
+
+def fun_l2_n603(x)
+    if (x < 1)
+        fun_l3_n378(x)
+    else
+        fun_l3_n722(x)
+    end
+end
+
+def fun_l2_n604(x)
+    if (x < 1)
+        fun_l3_n482(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n605(x)
+    if (x < 1)
+        fun_l3_n996(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n606(x)
+    if (x < 1)
+        fun_l3_n653(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n607(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n113(x)
+    end
+end
+
+def fun_l2_n608(x)
+    if (x < 1)
+        fun_l3_n157(x)
+    else
+        fun_l3_n692(x)
+    end
+end
+
+def fun_l2_n609(x)
+    if (x < 1)
+        fun_l3_n648(x)
+    else
+        fun_l3_n318(x)
+    end
+end
+
+def fun_l2_n610(x)
+    if (x < 1)
+        fun_l3_n979(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n611(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n986(x)
+    end
+end
+
+def fun_l2_n612(x)
+    if (x < 1)
+        fun_l3_n387(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n613(x)
+    if (x < 1)
+        fun_l3_n99(x)
+    else
+        fun_l3_n690(x)
+    end
+end
+
+def fun_l2_n614(x)
+    if (x < 1)
+        fun_l3_n485(x)
+    else
+        fun_l3_n733(x)
+    end
+end
+
+def fun_l2_n615(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n827(x)
+    end
+end
+
+def fun_l2_n616(x)
+    if (x < 1)
+        fun_l3_n496(x)
+    else
+        fun_l3_n912(x)
+    end
+end
+
+def fun_l2_n617(x)
+    if (x < 1)
+        fun_l3_n363(x)
+    else
+        fun_l3_n845(x)
+    end
+end
+
+def fun_l2_n618(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n964(x)
+    end
+end
+
+def fun_l2_n619(x)
+    if (x < 1)
+        fun_l3_n266(x)
+    else
+        fun_l3_n189(x)
+    end
+end
+
+def fun_l2_n620(x)
+    if (x < 1)
+        fun_l3_n906(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n621(x)
+    if (x < 1)
+        fun_l3_n145(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n622(x)
+    if (x < 1)
+        fun_l3_n797(x)
+    else
+        fun_l3_n328(x)
+    end
+end
+
+def fun_l2_n623(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n624(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n884(x)
+    end
+end
+
+def fun_l2_n625(x)
+    if (x < 1)
+        fun_l3_n852(x)
+    else
+        fun_l3_n985(x)
+    end
+end
+
+def fun_l2_n626(x)
+    if (x < 1)
+        fun_l3_n163(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n627(x)
+    if (x < 1)
+        fun_l3_n338(x)
+    else
+        fun_l3_n562(x)
+    end
+end
+
+def fun_l2_n628(x)
+    if (x < 1)
+        fun_l3_n300(x)
+    else
+        fun_l3_n245(x)
+    end
+end
+
+def fun_l2_n629(x)
+    if (x < 1)
+        fun_l3_n747(x)
+    else
+        fun_l3_n123(x)
+    end
+end
+
+def fun_l2_n630(x)
+    if (x < 1)
+        fun_l3_n42(x)
+    else
+        fun_l3_n46(x)
+    end
+end
+
+def fun_l2_n631(x)
+    if (x < 1)
+        fun_l3_n256(x)
+    else
+        fun_l3_n960(x)
+    end
+end
+
+def fun_l2_n632(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n393(x)
+    end
+end
+
+def fun_l2_n633(x)
+    if (x < 1)
+        fun_l3_n286(x)
+    else
+        fun_l3_n147(x)
+    end
+end
+
+def fun_l2_n634(x)
+    if (x < 1)
+        fun_l3_n62(x)
+    else
+        fun_l3_n994(x)
+    end
+end
+
+def fun_l2_n635(x)
+    if (x < 1)
+        fun_l3_n479(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n636(x)
+    if (x < 1)
+        fun_l3_n504(x)
+    else
+        fun_l3_n557(x)
+    end
+end
+
+def fun_l2_n637(x)
+    if (x < 1)
+        fun_l3_n716(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n638(x)
+    if (x < 1)
+        fun_l3_n972(x)
+    else
+        fun_l3_n391(x)
+    end
+end
+
+def fun_l2_n639(x)
+    if (x < 1)
+        fun_l3_n842(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n640(x)
+    if (x < 1)
+        fun_l3_n854(x)
+    else
+        fun_l3_n52(x)
+    end
+end
+
+def fun_l2_n641(x)
+    if (x < 1)
+        fun_l3_n321(x)
+    else
+        fun_l3_n109(x)
+    end
+end
+
+def fun_l2_n642(x)
+    if (x < 1)
+        fun_l3_n868(x)
+    else
+        fun_l3_n926(x)
+    end
+end
+
+def fun_l2_n643(x)
+    if (x < 1)
+        fun_l3_n864(x)
+    else
+        fun_l3_n98(x)
+    end
+end
+
+def fun_l2_n644(x)
+    if (x < 1)
+        fun_l3_n373(x)
+    else
+        fun_l3_n105(x)
+    end
+end
+
+def fun_l2_n645(x)
+    if (x < 1)
+        fun_l3_n293(x)
+    else
+        fun_l3_n846(x)
+    end
+end
+
+def fun_l2_n646(x)
+    if (x < 1)
+        fun_l3_n24(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n647(x)
+    if (x < 1)
+        fun_l3_n431(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n648(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n108(x)
+    end
+end
+
+def fun_l2_n649(x)
+    if (x < 1)
+        fun_l3_n93(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n650(x)
+    if (x < 1)
+        fun_l3_n176(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n651(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n635(x)
+    end
+end
+
+def fun_l2_n652(x)
+    if (x < 1)
+        fun_l3_n554(x)
+    else
+        fun_l3_n88(x)
+    end
+end
+
+def fun_l2_n653(x)
+    if (x < 1)
+        fun_l3_n165(x)
+    else
+        fun_l3_n962(x)
+    end
+end
+
+def fun_l2_n654(x)
+    if (x < 1)
+        fun_l3_n631(x)
+    else
+        fun_l3_n80(x)
+    end
+end
+
+def fun_l2_n655(x)
+    if (x < 1)
+        fun_l3_n529(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n656(x)
+    if (x < 1)
+        fun_l3_n809(x)
+    else
+        fun_l3_n44(x)
+    end
+end
+
+def fun_l2_n657(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n939(x)
+    end
+end
+
+def fun_l2_n658(x)
+    if (x < 1)
+        fun_l3_n355(x)
+    else
+        fun_l3_n750(x)
+    end
+end
+
+def fun_l2_n659(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n883(x)
+    end
+end
+
+def fun_l2_n660(x)
+    if (x < 1)
+        fun_l3_n22(x)
+    else
+        fun_l3_n544(x)
+    end
+end
+
+def fun_l2_n661(x)
+    if (x < 1)
+        fun_l3_n334(x)
+    else
+        fun_l3_n58(x)
+    end
+end
+
+def fun_l2_n662(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n647(x)
+    end
+end
+
+def fun_l2_n663(x)
+    if (x < 1)
+        fun_l3_n886(x)
+    else
+        fun_l3_n142(x)
+    end
+end
+
+def fun_l2_n664(x)
+    if (x < 1)
+        fun_l3_n713(x)
+    else
+        fun_l3_n710(x)
+    end
+end
+
+def fun_l2_n665(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n24(x)
+    end
+end
+
+def fun_l2_n666(x)
+    if (x < 1)
+        fun_l3_n993(x)
+    else
+        fun_l3_n741(x)
+    end
+end
+
+def fun_l2_n667(x)
+    if (x < 1)
+        fun_l3_n265(x)
+    else
+        fun_l3_n143(x)
+    end
+end
+
+def fun_l2_n668(x)
+    if (x < 1)
+        fun_l3_n725(x)
+    else
+        fun_l3_n272(x)
+    end
+end
+
+def fun_l2_n669(x)
+    if (x < 1)
+        fun_l3_n171(x)
+    else
+        fun_l3_n95(x)
+    end
+end
+
+def fun_l2_n670(x)
+    if (x < 1)
+        fun_l3_n409(x)
+    else
+        fun_l3_n774(x)
+    end
+end
+
+def fun_l2_n671(x)
+    if (x < 1)
+        fun_l3_n566(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n672(x)
+    if (x < 1)
+        fun_l3_n914(x)
+    else
+        fun_l3_n716(x)
+    end
+end
+
+def fun_l2_n673(x)
+    if (x < 1)
+        fun_l3_n889(x)
+    else
+        fun_l3_n339(x)
+    end
+end
+
+def fun_l2_n674(x)
+    if (x < 1)
+        fun_l3_n808(x)
+    else
+        fun_l3_n858(x)
+    end
+end
+
+def fun_l2_n675(x)
+    if (x < 1)
+        fun_l3_n895(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n676(x)
+    if (x < 1)
+        fun_l3_n674(x)
+    else
+        fun_l3_n183(x)
+    end
+end
+
+def fun_l2_n677(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n292(x)
+    end
+end
+
+def fun_l2_n678(x)
+    if (x < 1)
+        fun_l3_n302(x)
+    else
+        fun_l3_n511(x)
+    end
+end
+
+def fun_l2_n679(x)
+    if (x < 1)
+        fun_l3_n847(x)
+    else
+        fun_l3_n70(x)
+    end
+end
+
+def fun_l2_n680(x)
+    if (x < 1)
+        fun_l3_n200(x)
+    else
+        fun_l3_n436(x)
+    end
+end
+
+def fun_l2_n681(x)
+    if (x < 1)
+        fun_l3_n44(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n682(x)
+    if (x < 1)
+        fun_l3_n929(x)
+    else
+        fun_l3_n605(x)
+    end
+end
+
+def fun_l2_n683(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n684(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n976(x)
+    end
+end
+
+def fun_l2_n685(x)
+    if (x < 1)
+        fun_l3_n405(x)
+    else
+        fun_l3_n658(x)
+    end
+end
+
+def fun_l2_n686(x)
+    if (x < 1)
+        fun_l3_n685(x)
+    else
+        fun_l3_n379(x)
+    end
+end
+
+def fun_l2_n687(x)
+    if (x < 1)
+        fun_l3_n279(x)
+    else
+        fun_l3_n415(x)
+    end
+end
+
+def fun_l2_n688(x)
+    if (x < 1)
+        fun_l3_n234(x)
+    else
+        fun_l3_n634(x)
+    end
+end
+
+def fun_l2_n689(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n234(x)
+    end
+end
+
+def fun_l2_n690(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n102(x)
+    end
+end
+
+def fun_l2_n691(x)
+    if (x < 1)
+        fun_l3_n744(x)
+    else
+        fun_l3_n31(x)
+    end
+end
+
+def fun_l2_n692(x)
+    if (x < 1)
+        fun_l3_n29(x)
+    else
+        fun_l3_n238(x)
+    end
+end
+
+def fun_l2_n693(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n388(x)
+    end
+end
+
+def fun_l2_n694(x)
+    if (x < 1)
+        fun_l3_n70(x)
+    else
+        fun_l3_n356(x)
+    end
+end
+
+def fun_l2_n695(x)
+    if (x < 1)
+        fun_l3_n589(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n696(x)
+    if (x < 1)
+        fun_l3_n328(x)
+    else
+        fun_l3_n472(x)
+    end
+end
+
+def fun_l2_n697(x)
+    if (x < 1)
+        fun_l3_n705(x)
+    else
+        fun_l3_n709(x)
+    end
+end
+
+def fun_l2_n698(x)
+    if (x < 1)
+        fun_l3_n817(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n699(x)
+    if (x < 1)
+        fun_l3_n916(x)
+    else
+        fun_l3_n66(x)
+    end
+end
+
+def fun_l2_n700(x)
+    if (x < 1)
+        fun_l3_n461(x)
+    else
+        fun_l3_n648(x)
+    end
+end
+
+def fun_l2_n701(x)
+    if (x < 1)
+        fun_l3_n71(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n702(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n706(x)
+    end
+end
+
+def fun_l2_n703(x)
+    if (x < 1)
+        fun_l3_n480(x)
+    else
+        fun_l3_n665(x)
+    end
+end
+
+def fun_l2_n704(x)
+    if (x < 1)
+        fun_l3_n965(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n705(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n706(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n707(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n589(x)
+    end
+end
+
+def fun_l2_n708(x)
+    if (x < 1)
+        fun_l3_n331(x)
+    else
+        fun_l3_n299(x)
+    end
+end
+
+def fun_l2_n709(x)
+    if (x < 1)
+        fun_l3_n656(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n710(x)
+    if (x < 1)
+        fun_l3_n610(x)
+    else
+        fun_l3_n767(x)
+    end
+end
+
+def fun_l2_n711(x)
+    if (x < 1)
+        fun_l3_n281(x)
+    else
+        fun_l3_n942(x)
+    end
+end
+
+def fun_l2_n712(x)
+    if (x < 1)
+        fun_l3_n474(x)
+    else
+        fun_l3_n373(x)
+    end
+end
+
+def fun_l2_n713(x)
+    if (x < 1)
+        fun_l3_n668(x)
+    else
+        fun_l3_n881(x)
+    end
+end
+
+def fun_l2_n714(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n914(x)
+    end
+end
+
+def fun_l2_n715(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n946(x)
+    end
+end
+
+def fun_l2_n716(x)
+    if (x < 1)
+        fun_l3_n340(x)
+    else
+        fun_l3_n474(x)
+    end
+end
+
+def fun_l2_n717(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n718(x)
+    if (x < 1)
+        fun_l3_n830(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n719(x)
+    if (x < 1)
+        fun_l3_n945(x)
+    else
+        fun_l3_n98(x)
+    end
+end
+
+def fun_l2_n720(x)
+    if (x < 1)
+        fun_l3_n912(x)
+    else
+        fun_l3_n457(x)
+    end
+end
+
+def fun_l2_n721(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n722(x)
+    if (x < 1)
+        fun_l3_n438(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n723(x)
+    if (x < 1)
+        fun_l3_n447(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n724(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n572(x)
+    end
+end
+
+def fun_l2_n725(x)
+    if (x < 1)
+        fun_l3_n856(x)
+    else
+        fun_l3_n429(x)
+    end
+end
+
+def fun_l2_n726(x)
+    if (x < 1)
+        fun_l3_n747(x)
+    else
+        fun_l3_n823(x)
+    end
+end
+
+def fun_l2_n727(x)
+    if (x < 1)
+        fun_l3_n908(x)
+    else
+        fun_l3_n446(x)
+    end
+end
+
+def fun_l2_n728(x)
+    if (x < 1)
+        fun_l3_n170(x)
+    else
+        fun_l3_n546(x)
+    end
+end
+
+def fun_l2_n729(x)
+    if (x < 1)
+        fun_l3_n45(x)
+    else
+        fun_l3_n76(x)
+    end
+end
+
+def fun_l2_n730(x)
+    if (x < 1)
+        fun_l3_n688(x)
+    else
+        fun_l3_n826(x)
+    end
+end
+
+def fun_l2_n731(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n88(x)
+    end
+end
+
+def fun_l2_n732(x)
+    if (x < 1)
+        fun_l3_n191(x)
+    else
+        fun_l3_n395(x)
+    end
+end
+
+def fun_l2_n733(x)
+    if (x < 1)
+        fun_l3_n161(x)
+    else
+        fun_l3_n600(x)
+    end
+end
+
+def fun_l2_n734(x)
+    if (x < 1)
+        fun_l3_n586(x)
+    else
+        fun_l3_n770(x)
+    end
+end
+
+def fun_l2_n735(x)
+    if (x < 1)
+        fun_l3_n139(x)
+    else
+        fun_l3_n108(x)
+    end
+end
+
+def fun_l2_n736(x)
+    if (x < 1)
+        fun_l3_n719(x)
+    else
+        fun_l3_n210(x)
+    end
+end
+
+def fun_l2_n737(x)
+    if (x < 1)
+        fun_l3_n327(x)
+    else
+        fun_l3_n138(x)
+    end
+end
+
+def fun_l2_n738(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n739(x)
+    if (x < 1)
+        fun_l3_n499(x)
+    else
+        fun_l3_n998(x)
+    end
+end
+
+def fun_l2_n740(x)
+    if (x < 1)
+        fun_l3_n303(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n741(x)
+    if (x < 1)
+        fun_l3_n385(x)
+    else
+        fun_l3_n202(x)
+    end
+end
+
+def fun_l2_n742(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n617(x)
+    end
+end
+
+def fun_l2_n743(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n322(x)
+    end
+end
+
+def fun_l2_n744(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n841(x)
+    end
+end
+
+def fun_l2_n745(x)
+    if (x < 1)
+        fun_l3_n124(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n746(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n981(x)
+    end
+end
+
+def fun_l2_n747(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n154(x)
+    end
+end
+
+def fun_l2_n748(x)
+    if (x < 1)
+        fun_l3_n804(x)
+    else
+        fun_l3_n837(x)
+    end
+end
+
+def fun_l2_n749(x)
+    if (x < 1)
+        fun_l3_n787(x)
+    else
+        fun_l3_n890(x)
+    end
+end
+
+def fun_l2_n750(x)
+    if (x < 1)
+        fun_l3_n273(x)
+    else
+        fun_l3_n539(x)
+    end
+end
+
+def fun_l2_n751(x)
+    if (x < 1)
+        fun_l3_n397(x)
+    else
+        fun_l3_n630(x)
+    end
+end
+
+def fun_l2_n752(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n294(x)
+    end
+end
+
+def fun_l2_n753(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n121(x)
+    end
+end
+
+def fun_l2_n754(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n640(x)
+    end
+end
+
+def fun_l2_n755(x)
+    if (x < 1)
+        fun_l3_n441(x)
+    else
+        fun_l3_n731(x)
+    end
+end
+
+def fun_l2_n756(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n175(x)
+    end
+end
+
+def fun_l2_n757(x)
+    if (x < 1)
+        fun_l3_n294(x)
+    else
+        fun_l3_n732(x)
+    end
+end
+
+def fun_l2_n758(x)
+    if (x < 1)
+        fun_l3_n862(x)
+    else
+        fun_l3_n490(x)
+    end
+end
+
+def fun_l2_n759(x)
+    if (x < 1)
+        fun_l3_n959(x)
+    else
+        fun_l3_n58(x)
+    end
+end
+
+def fun_l2_n760(x)
+    if (x < 1)
+        fun_l3_n245(x)
+    else
+        fun_l3_n201(x)
+    end
+end
+
+def fun_l2_n761(x)
+    if (x < 1)
+        fun_l3_n174(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n762(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n624(x)
+    end
+end
+
+def fun_l2_n763(x)
+    if (x < 1)
+        fun_l3_n130(x)
+    else
+        fun_l3_n452(x)
+    end
+end
+
+def fun_l2_n764(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n519(x)
+    end
+end
+
+def fun_l2_n765(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n28(x)
+    end
+end
+
+def fun_l2_n766(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n767(x)
+    if (x < 1)
+        fun_l3_n89(x)
+    else
+        fun_l3_n284(x)
+    end
+end
+
+def fun_l2_n768(x)
+    if (x < 1)
+        fun_l3_n307(x)
+    else
+        fun_l3_n832(x)
+    end
+end
+
+def fun_l2_n769(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n358(x)
+    end
+end
+
+def fun_l2_n770(x)
+    if (x < 1)
+        fun_l3_n380(x)
+    else
+        fun_l3_n938(x)
+    end
+end
+
+def fun_l2_n771(x)
+    if (x < 1)
+        fun_l3_n245(x)
+    else
+        fun_l3_n156(x)
+    end
+end
+
+def fun_l2_n772(x)
+    if (x < 1)
+        fun_l3_n77(x)
+    else
+        fun_l3_n842(x)
+    end
+end
+
+def fun_l2_n773(x)
+    if (x < 1)
+        fun_l3_n972(x)
+    else
+        fun_l3_n143(x)
+    end
+end
+
+def fun_l2_n774(x)
+    if (x < 1)
+        fun_l3_n308(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n775(x)
+    if (x < 1)
+        fun_l3_n714(x)
+    else
+        fun_l3_n329(x)
+    end
+end
+
+def fun_l2_n776(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n141(x)
+    end
+end
+
+def fun_l2_n777(x)
+    if (x < 1)
+        fun_l3_n155(x)
+    else
+        fun_l3_n873(x)
+    end
+end
+
+def fun_l2_n778(x)
+    if (x < 1)
+        fun_l3_n551(x)
+    else
+        fun_l3_n293(x)
+    end
+end
+
+def fun_l2_n779(x)
+    if (x < 1)
+        fun_l3_n857(x)
+    else
+        fun_l3_n551(x)
+    end
+end
+
+def fun_l2_n780(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n230(x)
+    end
+end
+
+def fun_l2_n781(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n463(x)
+    end
+end
+
+def fun_l2_n782(x)
+    if (x < 1)
+        fun_l3_n89(x)
+    else
+        fun_l3_n514(x)
+    end
+end
+
+def fun_l2_n783(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n784(x)
+    if (x < 1)
+        fun_l3_n582(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n785(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n822(x)
+    end
+end
+
+def fun_l2_n786(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n162(x)
+    end
+end
+
+def fun_l2_n787(x)
+    if (x < 1)
+        fun_l3_n88(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n788(x)
+    if (x < 1)
+        fun_l3_n592(x)
+    else
+        fun_l3_n235(x)
+    end
+end
+
+def fun_l2_n789(x)
+    if (x < 1)
+        fun_l3_n337(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n790(x)
+    if (x < 1)
+        fun_l3_n481(x)
+    else
+        fun_l3_n361(x)
+    end
+end
+
+def fun_l2_n791(x)
+    if (x < 1)
+        fun_l3_n441(x)
+    else
+        fun_l3_n883(x)
+    end
+end
+
+def fun_l2_n792(x)
+    if (x < 1)
+        fun_l3_n424(x)
+    else
+        fun_l3_n387(x)
+    end
+end
+
+def fun_l2_n793(x)
+    if (x < 1)
+        fun_l3_n961(x)
+    else
+        fun_l3_n710(x)
+    end
+end
+
+def fun_l2_n794(x)
+    if (x < 1)
+        fun_l3_n653(x)
+    else
+        fun_l3_n869(x)
+    end
+end
+
+def fun_l2_n795(x)
+    if (x < 1)
+        fun_l3_n466(x)
+    else
+        fun_l3_n195(x)
+    end
+end
+
+def fun_l2_n796(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n797(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n911(x)
+    end
+end
+
+def fun_l2_n798(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n607(x)
+    end
+end
+
+def fun_l2_n799(x)
+    if (x < 1)
+        fun_l3_n964(x)
+    else
+        fun_l3_n425(x)
+    end
+end
+
+def fun_l2_n800(x)
+    if (x < 1)
+        fun_l3_n381(x)
+    else
+        fun_l3_n618(x)
+    end
+end
+
+def fun_l2_n801(x)
+    if (x < 1)
+        fun_l3_n803(x)
+    else
+        fun_l3_n697(x)
+    end
+end
+
+def fun_l2_n802(x)
+    if (x < 1)
+        fun_l3_n372(x)
+    else
+        fun_l3_n331(x)
+    end
+end
+
+def fun_l2_n803(x)
+    if (x < 1)
+        fun_l3_n450(x)
+    else
+        fun_l3_n707(x)
+    end
+end
+
+def fun_l2_n804(x)
+    if (x < 1)
+        fun_l3_n760(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n805(x)
+    if (x < 1)
+        fun_l3_n695(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n806(x)
+    if (x < 1)
+        fun_l3_n312(x)
+    else
+        fun_l3_n517(x)
+    end
+end
+
+def fun_l2_n807(x)
+    if (x < 1)
+        fun_l3_n794(x)
+    else
+        fun_l3_n37(x)
+    end
+end
+
+def fun_l2_n808(x)
+    if (x < 1)
+        fun_l3_n591(x)
+    else
+        fun_l3_n933(x)
+    end
+end
+
+def fun_l2_n809(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n69(x)
+    end
+end
+
+def fun_l2_n810(x)
+    if (x < 1)
+        fun_l3_n263(x)
+    else
+        fun_l3_n628(x)
+    end
+end
+
+def fun_l2_n811(x)
+    if (x < 1)
+        fun_l3_n647(x)
+    else
+        fun_l3_n133(x)
+    end
+end
+
+def fun_l2_n812(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n872(x)
+    end
+end
+
+def fun_l2_n813(x)
+    if (x < 1)
+        fun_l3_n716(x)
+    else
+        fun_l3_n254(x)
+    end
+end
+
+def fun_l2_n814(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n786(x)
+    end
+end
+
+def fun_l2_n815(x)
+    if (x < 1)
+        fun_l3_n163(x)
+    else
+        fun_l3_n175(x)
+    end
+end
+
+def fun_l2_n816(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n817(x)
+    if (x < 1)
+        fun_l3_n54(x)
+    else
+        fun_l3_n280(x)
+    end
+end
+
+def fun_l2_n818(x)
+    if (x < 1)
+        fun_l3_n261(x)
+    else
+        fun_l3_n958(x)
+    end
+end
+
+def fun_l2_n819(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n820(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n547(x)
+    end
+end
+
+def fun_l2_n821(x)
+    if (x < 1)
+        fun_l3_n726(x)
+    else
+        fun_l3_n386(x)
+    end
+end
+
+def fun_l2_n822(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n781(x)
+    end
+end
+
+def fun_l2_n823(x)
+    if (x < 1)
+        fun_l3_n392(x)
+    else
+        fun_l3_n357(x)
+    end
+end
+
+def fun_l2_n824(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n764(x)
+    end
+end
+
+def fun_l2_n825(x)
+    if (x < 1)
+        fun_l3_n339(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n826(x)
+    if (x < 1)
+        fun_l3_n613(x)
+    else
+        fun_l3_n767(x)
+    end
+end
+
+def fun_l2_n827(x)
+    if (x < 1)
+        fun_l3_n31(x)
+    else
+        fun_l3_n35(x)
+    end
+end
+
+def fun_l2_n828(x)
+    if (x < 1)
+        fun_l3_n838(x)
+    else
+        fun_l3_n939(x)
+    end
+end
+
+def fun_l2_n829(x)
+    if (x < 1)
+        fun_l3_n344(x)
+    else
+        fun_l3_n568(x)
+    end
+end
+
+def fun_l2_n830(x)
+    if (x < 1)
+        fun_l3_n892(x)
+    else
+        fun_l3_n564(x)
+    end
+end
+
+def fun_l2_n831(x)
+    if (x < 1)
+        fun_l3_n520(x)
+    else
+        fun_l3_n897(x)
+    end
+end
+
+def fun_l2_n832(x)
+    if (x < 1)
+        fun_l3_n986(x)
+    else
+        fun_l3_n523(x)
+    end
+end
+
+def fun_l2_n833(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n834(x)
+    if (x < 1)
+        fun_l3_n613(x)
+    else
+        fun_l3_n170(x)
+    end
+end
+
+def fun_l2_n835(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n790(x)
+    end
+end
+
+def fun_l2_n836(x)
+    if (x < 1)
+        fun_l3_n976(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n837(x)
+    if (x < 1)
+        fun_l3_n746(x)
+    else
+        fun_l3_n448(x)
+    end
+end
+
+def fun_l2_n838(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n978(x)
+    end
+end
+
+def fun_l2_n839(x)
+    if (x < 1)
+        fun_l3_n917(x)
+    else
+        fun_l3_n484(x)
+    end
+end
+
+def fun_l2_n840(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n617(x)
+    end
+end
+
+def fun_l2_n841(x)
+    if (x < 1)
+        fun_l3_n753(x)
+    else
+        fun_l3_n587(x)
+    end
+end
+
+def fun_l2_n842(x)
+    if (x < 1)
+        fun_l3_n21(x)
+    else
+        fun_l3_n256(x)
+    end
+end
+
+def fun_l2_n843(x)
+    if (x < 1)
+        fun_l3_n697(x)
+    else
+        fun_l3_n828(x)
+    end
+end
+
+def fun_l2_n844(x)
+    if (x < 1)
+        fun_l3_n59(x)
+    else
+        fun_l3_n855(x)
+    end
+end
+
+def fun_l2_n845(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n667(x)
+    end
+end
+
+def fun_l2_n846(x)
+    if (x < 1)
+        fun_l3_n229(x)
+    else
+        fun_l3_n379(x)
+    end
+end
+
+def fun_l2_n847(x)
+    if (x < 1)
+        fun_l3_n908(x)
+    else
+        fun_l3_n53(x)
+    end
+end
+
+def fun_l2_n848(x)
+    if (x < 1)
+        fun_l3_n72(x)
+    else
+        fun_l3_n882(x)
+    end
+end
+
+def fun_l2_n849(x)
+    if (x < 1)
+        fun_l3_n890(x)
+    else
+        fun_l3_n153(x)
+    end
+end
+
+def fun_l2_n850(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n404(x)
+    end
+end
+
+def fun_l2_n851(x)
+    if (x < 1)
+        fun_l3_n451(x)
+    else
+        fun_l3_n365(x)
+    end
+end
+
+def fun_l2_n852(x)
+    if (x < 1)
+        fun_l3_n591(x)
+    else
+        fun_l3_n974(x)
+    end
+end
+
+def fun_l2_n853(x)
+    if (x < 1)
+        fun_l3_n534(x)
+    else
+        fun_l3_n649(x)
+    end
+end
+
+def fun_l2_n854(x)
+    if (x < 1)
+        fun_l3_n438(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n855(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n856(x)
+    if (x < 1)
+        fun_l3_n856(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n857(x)
+    if (x < 1)
+        fun_l3_n664(x)
+    else
+        fun_l3_n659(x)
+    end
+end
+
+def fun_l2_n858(x)
+    if (x < 1)
+        fun_l3_n838(x)
+    else
+        fun_l3_n157(x)
+    end
+end
+
+def fun_l2_n859(x)
+    if (x < 1)
+        fun_l3_n542(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n860(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n954(x)
+    end
+end
+
+def fun_l2_n861(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n525(x)
+    end
+end
+
+def fun_l2_n862(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n376(x)
+    end
+end
+
+def fun_l2_n863(x)
+    if (x < 1)
+        fun_l3_n846(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n864(x)
+    if (x < 1)
+        fun_l3_n899(x)
+    else
+        fun_l3_n667(x)
+    end
+end
+
+def fun_l2_n865(x)
+    if (x < 1)
+        fun_l3_n326(x)
+    else
+        fun_l3_n664(x)
+    end
+end
+
+def fun_l2_n866(x)
+    if (x < 1)
+        fun_l3_n155(x)
+    else
+        fun_l3_n369(x)
+    end
+end
+
+def fun_l2_n867(x)
+    if (x < 1)
+        fun_l3_n583(x)
+    else
+        fun_l3_n12(x)
+    end
+end
+
+def fun_l2_n868(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n869(x)
+    if (x < 1)
+        fun_l3_n120(x)
+    else
+        fun_l3_n449(x)
+    end
+end
+
+def fun_l2_n870(x)
+    if (x < 1)
+        fun_l3_n459(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n871(x)
+    if (x < 1)
+        fun_l3_n298(x)
+    else
+        fun_l3_n6(x)
+    end
+end
+
+def fun_l2_n872(x)
+    if (x < 1)
+        fun_l3_n640(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n873(x)
+    if (x < 1)
+        fun_l3_n777(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n874(x)
+    if (x < 1)
+        fun_l3_n16(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n875(x)
+    if (x < 1)
+        fun_l3_n732(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n876(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n877(x)
+    if (x < 1)
+        fun_l3_n992(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n878(x)
+    if (x < 1)
+        fun_l3_n283(x)
+    else
+        fun_l3_n178(x)
+    end
+end
+
+def fun_l2_n879(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n963(x)
+    end
+end
+
+def fun_l2_n880(x)
+    if (x < 1)
+        fun_l3_n345(x)
+    else
+        fun_l3_n585(x)
+    end
+end
+
+def fun_l2_n881(x)
+    if (x < 1)
+        fun_l3_n859(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n882(x)
+    if (x < 1)
+        fun_l3_n718(x)
+    else
+        fun_l3_n354(x)
+    end
+end
+
+def fun_l2_n883(x)
+    if (x < 1)
+        fun_l3_n58(x)
+    else
+        fun_l3_n34(x)
+    end
+end
+
+def fun_l2_n884(x)
+    if (x < 1)
+        fun_l3_n442(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n885(x)
+    if (x < 1)
+        fun_l3_n37(x)
+    else
+        fun_l3_n665(x)
+    end
+end
+
+def fun_l2_n886(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n283(x)
+    end
+end
+
+def fun_l2_n887(x)
+    if (x < 1)
+        fun_l3_n674(x)
+    else
+        fun_l3_n940(x)
+    end
+end
+
+def fun_l2_n888(x)
+    if (x < 1)
+        fun_l3_n556(x)
+    else
+        fun_l3_n191(x)
+    end
+end
+
+def fun_l2_n889(x)
+    if (x < 1)
+        fun_l3_n451(x)
+    else
+        fun_l3_n33(x)
+    end
+end
+
+def fun_l2_n890(x)
+    if (x < 1)
+        fun_l3_n724(x)
+    else
+        fun_l3_n355(x)
+    end
+end
+
+def fun_l2_n891(x)
+    if (x < 1)
+        fun_l3_n811(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n892(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n956(x)
+    end
+end
+
+def fun_l2_n893(x)
+    if (x < 1)
+        fun_l3_n416(x)
+    else
+        fun_l3_n373(x)
+    end
+end
+
+def fun_l2_n894(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n148(x)
+    end
+end
+
+def fun_l2_n895(x)
+    if (x < 1)
+        fun_l3_n52(x)
+    else
+        fun_l3_n605(x)
+    end
+end
+
+def fun_l2_n896(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n897(x)
+    if (x < 1)
+        fun_l3_n631(x)
+    else
+        fun_l3_n167(x)
+    end
+end
+
+def fun_l2_n898(x)
+    if (x < 1)
+        fun_l3_n366(x)
+    else
+        fun_l3_n666(x)
+    end
+end
+
+def fun_l2_n899(x)
+    if (x < 1)
+        fun_l3_n758(x)
+    else
+        fun_l3_n441(x)
+    end
+end
+
+def fun_l2_n900(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n766(x)
+    end
+end
+
+def fun_l2_n901(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n348(x)
+    end
+end
+
+def fun_l2_n902(x)
+    if (x < 1)
+        fun_l3_n455(x)
+    else
+        fun_l3_n78(x)
+    end
+end
+
+def fun_l2_n903(x)
+    if (x < 1)
+        fun_l3_n373(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n904(x)
+    if (x < 1)
+        fun_l3_n595(x)
+    else
+        fun_l3_n742(x)
+    end
+end
+
+def fun_l2_n905(x)
+    if (x < 1)
+        fun_l3_n102(x)
+    else
+        fun_l3_n140(x)
+    end
+end
+
+def fun_l2_n906(x)
+    if (x < 1)
+        fun_l3_n458(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n907(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n841(x)
+    end
+end
+
+def fun_l2_n908(x)
+    if (x < 1)
+        fun_l3_n97(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n909(x)
+    if (x < 1)
+        fun_l3_n381(x)
+    else
+        fun_l3_n44(x)
+    end
+end
+
+def fun_l2_n910(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n225(x)
+    end
+end
+
+def fun_l2_n911(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n912(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n590(x)
+    end
+end
+
+def fun_l2_n913(x)
+    if (x < 1)
+        fun_l3_n858(x)
+    else
+        fun_l3_n140(x)
+    end
+end
+
+def fun_l2_n914(x)
+    if (x < 1)
+        fun_l3_n997(x)
+    else
+        fun_l3_n959(x)
+    end
+end
+
+def fun_l2_n915(x)
+    if (x < 1)
+        fun_l3_n184(x)
+    else
+        fun_l3_n910(x)
+    end
+end
+
+def fun_l2_n916(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n917(x)
+    if (x < 1)
+        fun_l3_n537(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n918(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n222(x)
+    end
+end
+
+def fun_l2_n919(x)
+    if (x < 1)
+        fun_l3_n640(x)
+    else
+        fun_l3_n406(x)
+    end
+end
+
+def fun_l2_n920(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n976(x)
+    end
+end
+
+def fun_l2_n921(x)
+    if (x < 1)
+        fun_l3_n262(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n922(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n368(x)
+    end
+end
+
+def fun_l2_n923(x)
+    if (x < 1)
+        fun_l3_n935(x)
+    else
+        fun_l3_n109(x)
+    end
+end
+
+def fun_l2_n924(x)
+    if (x < 1)
+        fun_l3_n982(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n925(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n266(x)
+    end
+end
+
+def fun_l2_n926(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n803(x)
+    end
+end
+
+def fun_l2_n927(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n441(x)
+    end
+end
+
+def fun_l2_n928(x)
+    if (x < 1)
+        fun_l3_n781(x)
+    else
+        fun_l3_n374(x)
+    end
+end
+
+def fun_l2_n929(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n851(x)
+    end
+end
+
+def fun_l2_n930(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n904(x)
+    end
+end
+
+def fun_l2_n931(x)
+    if (x < 1)
+        fun_l3_n379(x)
+    else
+        fun_l3_n211(x)
+    end
+end
+
+def fun_l2_n932(x)
+    if (x < 1)
+        fun_l3_n572(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n933(x)
+    if (x < 1)
+        fun_l3_n620(x)
+    else
+        fun_l3_n703(x)
+    end
+end
+
+def fun_l2_n934(x)
+    if (x < 1)
+        fun_l3_n238(x)
+    else
+        fun_l3_n220(x)
+    end
+end
+
+def fun_l2_n935(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n822(x)
+    end
+end
+
+def fun_l2_n936(x)
+    if (x < 1)
+        fun_l3_n818(x)
+    else
+        fun_l3_n384(x)
+    end
+end
+
+def fun_l2_n937(x)
+    if (x < 1)
+        fun_l3_n560(x)
+    else
+        fun_l3_n875(x)
+    end
+end
+
+def fun_l2_n938(x)
+    if (x < 1)
+        fun_l3_n417(x)
+    else
+        fun_l3_n900(x)
+    end
+end
+
+def fun_l2_n939(x)
+    if (x < 1)
+        fun_l3_n740(x)
+    else
+        fun_l3_n431(x)
+    end
+end
+
+def fun_l2_n940(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n147(x)
+    end
+end
+
+def fun_l2_n941(x)
+    if (x < 1)
+        fun_l3_n64(x)
+    else
+        fun_l3_n317(x)
+    end
+end
+
+def fun_l2_n942(x)
+    if (x < 1)
+        fun_l3_n347(x)
+    else
+        fun_l3_n778(x)
+    end
+end
+
+def fun_l2_n943(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n446(x)
+    end
+end
+
+def fun_l2_n944(x)
+    if (x < 1)
+        fun_l3_n492(x)
+    else
+        fun_l3_n381(x)
+    end
+end
+
+def fun_l2_n945(x)
+    if (x < 1)
+        fun_l3_n594(x)
+    else
+        fun_l3_n413(x)
+    end
+end
+
+def fun_l2_n946(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n838(x)
+    end
+end
+
+def fun_l2_n947(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n768(x)
+    end
+end
+
+def fun_l2_n948(x)
+    if (x < 1)
+        fun_l3_n9(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n949(x)
+    if (x < 1)
+        fun_l3_n365(x)
+    else
+        fun_l3_n322(x)
+    end
+end
+
+def fun_l2_n950(x)
+    if (x < 1)
+        fun_l3_n283(x)
+    else
+        fun_l3_n921(x)
+    end
+end
+
+def fun_l2_n951(x)
+    if (x < 1)
+        fun_l3_n740(x)
+    else
+        fun_l3_n336(x)
+    end
+end
+
+def fun_l2_n952(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n953(x)
+    if (x < 1)
+        fun_l3_n289(x)
+    else
+        fun_l3_n915(x)
+    end
+end
+
+def fun_l2_n954(x)
+    if (x < 1)
+        fun_l3_n234(x)
+    else
+        fun_l3_n198(x)
+    end
+end
+
+def fun_l2_n955(x)
+    if (x < 1)
+        fun_l3_n364(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n956(x)
+    if (x < 1)
+        fun_l3_n370(x)
+    else
+        fun_l3_n786(x)
+    end
+end
+
+def fun_l2_n957(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n375(x)
+    end
+end
+
+def fun_l2_n958(x)
+    if (x < 1)
+        fun_l3_n423(x)
+    else
+        fun_l3_n448(x)
+    end
+end
+
+def fun_l2_n959(x)
+    if (x < 1)
+        fun_l3_n887(x)
+    else
+        fun_l3_n33(x)
+    end
+end
+
+def fun_l2_n960(x)
+    if (x < 1)
+        fun_l3_n280(x)
+    else
+        fun_l3_n334(x)
+    end
+end
+
+def fun_l2_n961(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n524(x)
+    end
+end
+
+def fun_l2_n962(x)
+    if (x < 1)
+        fun_l3_n689(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n963(x)
+    if (x < 1)
+        fun_l3_n235(x)
+    else
+        fun_l3_n286(x)
+    end
+end
+
+def fun_l2_n964(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n308(x)
+    end
+end
+
+def fun_l2_n965(x)
+    if (x < 1)
+        fun_l3_n174(x)
+    else
+        fun_l3_n823(x)
+    end
+end
+
+def fun_l2_n966(x)
+    if (x < 1)
+        fun_l3_n792(x)
+    else
+        fun_l3_n29(x)
+    end
+end
+
+def fun_l2_n967(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n689(x)
+    end
+end
+
+def fun_l2_n968(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n287(x)
+    end
+end
+
+def fun_l2_n969(x)
+    if (x < 1)
+        fun_l3_n836(x)
+    else
+        fun_l3_n892(x)
+    end
+end
+
+def fun_l2_n970(x)
+    if (x < 1)
+        fun_l3_n201(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n971(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n972(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n686(x)
+    end
+end
+
+def fun_l2_n973(x)
+    if (x < 1)
+        fun_l3_n969(x)
+    else
+        fun_l3_n819(x)
+    end
+end
+
+def fun_l2_n974(x)
+    if (x < 1)
+        fun_l3_n87(x)
+    else
+        fun_l3_n120(x)
+    end
+end
+
+def fun_l2_n975(x)
+    if (x < 1)
+        fun_l3_n701(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n976(x)
+    if (x < 1)
+        fun_l3_n128(x)
+    else
+        fun_l3_n310(x)
+    end
+end
+
+def fun_l2_n977(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n5(x)
+    end
+end
+
+def fun_l2_n978(x)
+    if (x < 1)
+        fun_l3_n432(x)
+    else
+        fun_l3_n964(x)
+    end
+end
+
+def fun_l2_n979(x)
+    if (x < 1)
+        fun_l3_n198(x)
+    else
+        fun_l3_n161(x)
+    end
+end
+
+def fun_l2_n980(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n768(x)
+    end
+end
+
+def fun_l2_n981(x)
+    if (x < 1)
+        fun_l3_n635(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n982(x)
+    if (x < 1)
+        fun_l3_n326(x)
+    else
+        fun_l3_n338(x)
+    end
+end
+
+def fun_l2_n983(x)
+    if (x < 1)
+        fun_l3_n243(x)
+    else
+        fun_l3_n48(x)
+    end
+end
+
+def fun_l2_n984(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n141(x)
+    end
+end
+
+def fun_l2_n985(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n577(x)
+    end
+end
+
+def fun_l2_n986(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n833(x)
+    end
+end
+
+def fun_l2_n987(x)
+    if (x < 1)
+        fun_l3_n643(x)
+    else
+        fun_l3_n629(x)
+    end
+end
+
+def fun_l2_n988(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n712(x)
+    end
+end
+
+def fun_l2_n989(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n300(x)
+    end
+end
+
+def fun_l2_n990(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n281(x)
+    end
+end
+
+def fun_l2_n991(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n203(x)
+    end
+end
+
+def fun_l2_n992(x)
+    if (x < 1)
+        fun_l3_n727(x)
+    else
+        fun_l3_n437(x)
+    end
+end
+
+def fun_l2_n993(x)
+    if (x < 1)
+        fun_l3_n608(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n994(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n980(x)
+    end
+end
+
+def fun_l2_n995(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n122(x)
+    end
+end
+
+def fun_l2_n996(x)
+    if (x < 1)
+        fun_l3_n334(x)
+    else
+        fun_l3_n668(x)
+    end
+end
+
+def fun_l2_n997(x)
+    if (x < 1)
+        fun_l3_n241(x)
+    else
+        fun_l3_n515(x)
+    end
+end
+
+def fun_l2_n998(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n999(x)
+    if (x < 1)
+        fun_l3_n568(x)
+    else
+        fun_l3_n652(x)
+    end
+end
+
+def fun_l3_n0(x)
+    if (x < 1)
+        fun_l4_n169(x)
+    else
+        fun_l4_n923(x)
+    end
+end
+
+def fun_l3_n1(x)
+    if (x < 1)
+        fun_l4_n214(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n2(x)
+    if (x < 1)
+        fun_l4_n513(x)
+    else
+        fun_l4_n409(x)
+    end
+end
+
+def fun_l3_n3(x)
+    if (x < 1)
+        fun_l4_n133(x)
+    else
+        fun_l4_n293(x)
+    end
+end
+
+def fun_l3_n4(x)
+    if (x < 1)
+        fun_l4_n550(x)
+    else
+        fun_l4_n95(x)
+    end
+end
+
+def fun_l3_n5(x)
+    if (x < 1)
+        fun_l4_n13(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n6(x)
+    if (x < 1)
+        fun_l4_n607(x)
+    else
+        fun_l4_n140(x)
+    end
+end
+
+def fun_l3_n7(x)
+    if (x < 1)
+        fun_l4_n65(x)
+    else
+        fun_l4_n90(x)
+    end
+end
+
+def fun_l3_n8(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n9(x)
+    if (x < 1)
+        fun_l4_n713(x)
+    else
+        fun_l4_n487(x)
+    end
+end
+
+def fun_l3_n10(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n547(x)
+    end
+end
+
+def fun_l3_n11(x)
+    if (x < 1)
+        fun_l4_n561(x)
+    else
+        fun_l4_n530(x)
+    end
+end
+
+def fun_l3_n12(x)
+    if (x < 1)
+        fun_l4_n866(x)
+    else
+        fun_l4_n187(x)
+    end
+end
+
+def fun_l3_n13(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n458(x)
+    end
+end
+
+def fun_l3_n14(x)
+    if (x < 1)
+        fun_l4_n627(x)
+    else
+        fun_l4_n122(x)
+    end
+end
+
+def fun_l3_n15(x)
+    if (x < 1)
+        fun_l4_n988(x)
+    else
+        fun_l4_n4(x)
+    end
+end
+
+def fun_l3_n16(x)
+    if (x < 1)
+        fun_l4_n654(x)
+    else
+        fun_l4_n863(x)
+    end
+end
+
+def fun_l3_n17(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n223(x)
+    end
+end
+
+def fun_l3_n18(x)
+    if (x < 1)
+        fun_l4_n808(x)
+    else
+        fun_l4_n161(x)
+    end
+end
+
+def fun_l3_n19(x)
+    if (x < 1)
+        fun_l4_n265(x)
+    else
+        fun_l4_n860(x)
+    end
+end
+
+def fun_l3_n20(x)
+    if (x < 1)
+        fun_l4_n60(x)
+    else
+        fun_l4_n943(x)
+    end
+end
+
+def fun_l3_n21(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n990(x)
+    end
+end
+
+def fun_l3_n22(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n686(x)
+    end
+end
+
+def fun_l3_n23(x)
+    if (x < 1)
+        fun_l4_n552(x)
+    else
+        fun_l4_n935(x)
+    end
+end
+
+def fun_l3_n24(x)
+    if (x < 1)
+        fun_l4_n752(x)
+    else
+        fun_l4_n279(x)
+    end
+end
+
+def fun_l3_n25(x)
+    if (x < 1)
+        fun_l4_n325(x)
+    else
+        fun_l4_n440(x)
+    end
+end
+
+def fun_l3_n26(x)
+    if (x < 1)
+        fun_l4_n330(x)
+    else
+        fun_l4_n233(x)
+    end
+end
+
+def fun_l3_n27(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n399(x)
+    end
+end
+
+def fun_l3_n28(x)
+    if (x < 1)
+        fun_l4_n420(x)
+    else
+        fun_l4_n570(x)
+    end
+end
+
+def fun_l3_n29(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n485(x)
+    end
+end
+
+def fun_l3_n30(x)
+    if (x < 1)
+        fun_l4_n694(x)
+    else
+        fun_l4_n279(x)
+    end
+end
+
+def fun_l3_n31(x)
+    if (x < 1)
+        fun_l4_n683(x)
+    else
+        fun_l4_n396(x)
+    end
+end
+
+def fun_l3_n32(x)
+    if (x < 1)
+        fun_l4_n997(x)
+    else
+        fun_l4_n978(x)
+    end
+end
+
+def fun_l3_n33(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n34(x)
+    if (x < 1)
+        fun_l4_n510(x)
+    else
+        fun_l4_n147(x)
+    end
+end
+
+def fun_l3_n35(x)
+    if (x < 1)
+        fun_l4_n415(x)
+    else
+        fun_l4_n590(x)
+    end
+end
+
+def fun_l3_n36(x)
+    if (x < 1)
+        fun_l4_n164(x)
+    else
+        fun_l4_n990(x)
+    end
+end
+
+def fun_l3_n37(x)
+    if (x < 1)
+        fun_l4_n744(x)
+    else
+        fun_l4_n981(x)
+    end
+end
+
+def fun_l3_n38(x)
+    if (x < 1)
+        fun_l4_n243(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n39(x)
+    if (x < 1)
+        fun_l4_n874(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n40(x)
+    if (x < 1)
+        fun_l4_n39(x)
+    else
+        fun_l4_n115(x)
+    end
+end
+
+def fun_l3_n41(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n42(x)
+    if (x < 1)
+        fun_l4_n234(x)
+    else
+        fun_l4_n359(x)
+    end
+end
+
+def fun_l3_n43(x)
+    if (x < 1)
+        fun_l4_n481(x)
+    else
+        fun_l4_n368(x)
+    end
+end
+
+def fun_l3_n44(x)
+    if (x < 1)
+        fun_l4_n969(x)
+    else
+        fun_l4_n716(x)
+    end
+end
+
+def fun_l3_n45(x)
+    if (x < 1)
+        fun_l4_n858(x)
+    else
+        fun_l4_n446(x)
+    end
+end
+
+def fun_l3_n46(x)
+    if (x < 1)
+        fun_l4_n786(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n47(x)
+    if (x < 1)
+        fun_l4_n261(x)
+    else
+        fun_l4_n346(x)
+    end
+end
+
+def fun_l3_n48(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n710(x)
+    end
+end
+
+def fun_l3_n49(x)
+    if (x < 1)
+        fun_l4_n533(x)
+    else
+        fun_l4_n599(x)
+    end
+end
+
+def fun_l3_n50(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n90(x)
+    end
+end
+
+def fun_l3_n51(x)
+    if (x < 1)
+        fun_l4_n718(x)
+    else
+        fun_l4_n854(x)
+    end
+end
+
+def fun_l3_n52(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n996(x)
+    end
+end
+
+def fun_l3_n53(x)
+    if (x < 1)
+        fun_l4_n628(x)
+    else
+        fun_l4_n589(x)
+    end
+end
+
+def fun_l3_n54(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n258(x)
+    end
+end
+
+def fun_l3_n55(x)
+    if (x < 1)
+        fun_l4_n794(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n56(x)
+    if (x < 1)
+        fun_l4_n771(x)
+    else
+        fun_l4_n812(x)
+    end
+end
+
+def fun_l3_n57(x)
+    if (x < 1)
+        fun_l4_n106(x)
+    else
+        fun_l4_n144(x)
+    end
+end
+
+def fun_l3_n58(x)
+    if (x < 1)
+        fun_l4_n2(x)
+    else
+        fun_l4_n49(x)
+    end
+end
+
+def fun_l3_n59(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n164(x)
+    end
+end
+
+def fun_l3_n60(x)
+    if (x < 1)
+        fun_l4_n638(x)
+    else
+        fun_l4_n984(x)
+    end
+end
+
+def fun_l3_n61(x)
+    if (x < 1)
+        fun_l4_n144(x)
+    else
+        fun_l4_n236(x)
+    end
+end
+
+def fun_l3_n62(x)
+    if (x < 1)
+        fun_l4_n345(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n63(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n216(x)
+    end
+end
+
+def fun_l3_n64(x)
+    if (x < 1)
+        fun_l4_n213(x)
+    else
+        fun_l4_n370(x)
+    end
+end
+
+def fun_l3_n65(x)
+    if (x < 1)
+        fun_l4_n845(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n66(x)
+    if (x < 1)
+        fun_l4_n951(x)
+    else
+        fun_l4_n415(x)
+    end
+end
+
+def fun_l3_n67(x)
+    if (x < 1)
+        fun_l4_n997(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n68(x)
+    if (x < 1)
+        fun_l4_n595(x)
+    else
+        fun_l4_n517(x)
+    end
+end
+
+def fun_l3_n69(x)
+    if (x < 1)
+        fun_l4_n776(x)
+    else
+        fun_l4_n550(x)
+    end
+end
+
+def fun_l3_n70(x)
+    if (x < 1)
+        fun_l4_n360(x)
+    else
+        fun_l4_n836(x)
+    end
+end
+
+def fun_l3_n71(x)
+    if (x < 1)
+        fun_l4_n214(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n72(x)
+    if (x < 1)
+        fun_l4_n138(x)
+    else
+        fun_l4_n881(x)
+    end
+end
+
+def fun_l3_n73(x)
+    if (x < 1)
+        fun_l4_n793(x)
+    else
+        fun_l4_n866(x)
+    end
+end
+
+def fun_l3_n74(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n730(x)
+    end
+end
+
+def fun_l3_n75(x)
+    if (x < 1)
+        fun_l4_n525(x)
+    else
+        fun_l4_n188(x)
+    end
+end
+
+def fun_l3_n76(x)
+    if (x < 1)
+        fun_l4_n528(x)
+    else
+        fun_l4_n723(x)
+    end
+end
+
+def fun_l3_n77(x)
+    if (x < 1)
+        fun_l4_n954(x)
+    else
+        fun_l4_n581(x)
+    end
+end
+
+def fun_l3_n78(x)
+    if (x < 1)
+        fun_l4_n614(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n79(x)
+    if (x < 1)
+        fun_l4_n396(x)
+    else
+        fun_l4_n539(x)
+    end
+end
+
+def fun_l3_n80(x)
+    if (x < 1)
+        fun_l4_n1(x)
+    else
+        fun_l4_n708(x)
+    end
+end
+
+def fun_l3_n81(x)
+    if (x < 1)
+        fun_l4_n626(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n82(x)
+    if (x < 1)
+        fun_l4_n5(x)
+    else
+        fun_l4_n108(x)
+    end
+end
+
+def fun_l3_n83(x)
+    if (x < 1)
+        fun_l4_n683(x)
+    else
+        fun_l4_n679(x)
+    end
+end
+
+def fun_l3_n84(x)
+    if (x < 1)
+        fun_l4_n613(x)
+    else
+        fun_l4_n596(x)
+    end
+end
+
+def fun_l3_n85(x)
+    if (x < 1)
+        fun_l4_n490(x)
+    else
+        fun_l4_n178(x)
+    end
+end
+
+def fun_l3_n86(x)
+    if (x < 1)
+        fun_l4_n286(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n87(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n711(x)
+    end
+end
+
+def fun_l3_n88(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n89(x)
+    if (x < 1)
+        fun_l4_n938(x)
+    else
+        fun_l4_n123(x)
+    end
+end
+
+def fun_l3_n90(x)
+    if (x < 1)
+        fun_l4_n589(x)
+    else
+        fun_l4_n231(x)
+    end
+end
+
+def fun_l3_n91(x)
+    if (x < 1)
+        fun_l4_n484(x)
+    else
+        fun_l4_n439(x)
+    end
+end
+
+def fun_l3_n92(x)
+    if (x < 1)
+        fun_l4_n469(x)
+    else
+        fun_l4_n737(x)
+    end
+end
+
+def fun_l3_n93(x)
+    if (x < 1)
+        fun_l4_n93(x)
+    else
+        fun_l4_n907(x)
+    end
+end
+
+def fun_l3_n94(x)
+    if (x < 1)
+        fun_l4_n468(x)
+    else
+        fun_l4_n219(x)
+    end
+end
+
+def fun_l3_n95(x)
+    if (x < 1)
+        fun_l4_n409(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n96(x)
+    if (x < 1)
+        fun_l4_n952(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n97(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n98(x)
+    if (x < 1)
+        fun_l4_n351(x)
+    else
+        fun_l4_n89(x)
+    end
+end
+
+def fun_l3_n99(x)
+    if (x < 1)
+        fun_l4_n869(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n100(x)
+    if (x < 1)
+        fun_l4_n985(x)
+    else
+        fun_l4_n297(x)
+    end
+end
+
+def fun_l3_n101(x)
+    if (x < 1)
+        fun_l4_n48(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n102(x)
+    if (x < 1)
+        fun_l4_n92(x)
+    else
+        fun_l4_n36(x)
+    end
+end
+
+def fun_l3_n103(x)
+    if (x < 1)
+        fun_l4_n610(x)
+    else
+        fun_l4_n616(x)
+    end
+end
+
+def fun_l3_n104(x)
+    if (x < 1)
+        fun_l4_n472(x)
+    else
+        fun_l4_n689(x)
+    end
+end
+
+def fun_l3_n105(x)
+    if (x < 1)
+        fun_l4_n75(x)
+    else
+        fun_l4_n161(x)
+    end
+end
+
+def fun_l3_n106(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n767(x)
+    end
+end
+
+def fun_l3_n107(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n229(x)
+    end
+end
+
+def fun_l3_n108(x)
+    if (x < 1)
+        fun_l4_n761(x)
+    else
+        fun_l4_n97(x)
+    end
+end
+
+def fun_l3_n109(x)
+    if (x < 1)
+        fun_l4_n734(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n110(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n111(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n322(x)
+    end
+end
+
+def fun_l3_n112(x)
+    if (x < 1)
+        fun_l4_n907(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n113(x)
+    if (x < 1)
+        fun_l4_n473(x)
+    else
+        fun_l4_n620(x)
+    end
+end
+
+def fun_l3_n114(x)
+    if (x < 1)
+        fun_l4_n278(x)
+    else
+        fun_l4_n998(x)
+    end
+end
+
+def fun_l3_n115(x)
+    if (x < 1)
+        fun_l4_n185(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n116(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n117(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n456(x)
+    end
+end
+
+def fun_l3_n118(x)
+    if (x < 1)
+        fun_l4_n920(x)
+    else
+        fun_l4_n701(x)
+    end
+end
+
+def fun_l3_n119(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n837(x)
+    end
+end
+
+def fun_l3_n120(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n964(x)
+    end
+end
+
+def fun_l3_n121(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n543(x)
+    end
+end
+
+def fun_l3_n122(x)
+    if (x < 1)
+        fun_l4_n51(x)
+    else
+        fun_l4_n453(x)
+    end
+end
+
+def fun_l3_n123(x)
+    if (x < 1)
+        fun_l4_n726(x)
+    else
+        fun_l4_n785(x)
+    end
+end
+
+def fun_l3_n124(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n583(x)
+    end
+end
+
+def fun_l3_n125(x)
+    if (x < 1)
+        fun_l4_n471(x)
+    else
+        fun_l4_n518(x)
+    end
+end
+
+def fun_l3_n126(x)
+    if (x < 1)
+        fun_l4_n351(x)
+    else
+        fun_l4_n825(x)
+    end
+end
+
+def fun_l3_n127(x)
+    if (x < 1)
+        fun_l4_n759(x)
+    else
+        fun_l4_n203(x)
+    end
+end
+
+def fun_l3_n128(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n861(x)
+    end
+end
+
+def fun_l3_n129(x)
+    if (x < 1)
+        fun_l4_n573(x)
+    else
+        fun_l4_n568(x)
+    end
+end
+
+def fun_l3_n130(x)
+    if (x < 1)
+        fun_l4_n788(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n131(x)
+    if (x < 1)
+        fun_l4_n392(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n132(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n650(x)
+    end
+end
+
+def fun_l3_n133(x)
+    if (x < 1)
+        fun_l4_n895(x)
+    else
+        fun_l4_n983(x)
+    end
+end
+
+def fun_l3_n134(x)
+    if (x < 1)
+        fun_l4_n389(x)
+    else
+        fun_l4_n358(x)
+    end
+end
+
+def fun_l3_n135(x)
+    if (x < 1)
+        fun_l4_n732(x)
+    else
+        fun_l4_n747(x)
+    end
+end
+
+def fun_l3_n136(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n592(x)
+    end
+end
+
+def fun_l3_n137(x)
+    if (x < 1)
+        fun_l4_n581(x)
+    else
+        fun_l4_n24(x)
+    end
+end
+
+def fun_l3_n138(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n599(x)
+    end
+end
+
+def fun_l3_n139(x)
+    if (x < 1)
+        fun_l4_n955(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n140(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n141(x)
+    if (x < 1)
+        fun_l4_n152(x)
+    else
+        fun_l4_n696(x)
+    end
+end
+
+def fun_l3_n142(x)
+    if (x < 1)
+        fun_l4_n295(x)
+    else
+        fun_l4_n205(x)
+    end
+end
+
+def fun_l3_n143(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n951(x)
+    end
+end
+
+def fun_l3_n144(x)
+    if (x < 1)
+        fun_l4_n656(x)
+    else
+        fun_l4_n494(x)
+    end
+end
+
+def fun_l3_n145(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n749(x)
+    end
+end
+
+def fun_l3_n146(x)
+    if (x < 1)
+        fun_l4_n197(x)
+    else
+        fun_l4_n3(x)
+    end
+end
+
+def fun_l3_n147(x)
+    if (x < 1)
+        fun_l4_n519(x)
+    else
+        fun_l4_n36(x)
+    end
+end
+
+def fun_l3_n148(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n463(x)
+    end
+end
+
+def fun_l3_n149(x)
+    if (x < 1)
+        fun_l4_n890(x)
+    else
+        fun_l4_n947(x)
+    end
+end
+
+def fun_l3_n150(x)
+    if (x < 1)
+        fun_l4_n512(x)
+    else
+        fun_l4_n982(x)
+    end
+end
+
+def fun_l3_n151(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n781(x)
+    end
+end
+
+def fun_l3_n152(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n530(x)
+    end
+end
+
+def fun_l3_n153(x)
+    if (x < 1)
+        fun_l4_n189(x)
+    else
+        fun_l4_n209(x)
+    end
+end
+
+def fun_l3_n154(x)
+    if (x < 1)
+        fun_l4_n343(x)
+    else
+        fun_l4_n44(x)
+    end
+end
+
+def fun_l3_n155(x)
+    if (x < 1)
+        fun_l4_n536(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n156(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n790(x)
+    end
+end
+
+def fun_l3_n157(x)
+    if (x < 1)
+        fun_l4_n954(x)
+    else
+        fun_l4_n242(x)
+    end
+end
+
+def fun_l3_n158(x)
+    if (x < 1)
+        fun_l4_n19(x)
+    else
+        fun_l4_n735(x)
+    end
+end
+
+def fun_l3_n159(x)
+    if (x < 1)
+        fun_l4_n900(x)
+    else
+        fun_l4_n456(x)
+    end
+end
+
+def fun_l3_n160(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n606(x)
+    end
+end
+
+def fun_l3_n161(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n162(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n582(x)
+    end
+end
+
+def fun_l3_n163(x)
+    if (x < 1)
+        fun_l4_n713(x)
+    else
+        fun_l4_n601(x)
+    end
+end
+
+def fun_l3_n164(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n642(x)
+    end
+end
+
+def fun_l3_n165(x)
+    if (x < 1)
+        fun_l4_n45(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n166(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n92(x)
+    end
+end
+
+def fun_l3_n167(x)
+    if (x < 1)
+        fun_l4_n975(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n168(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n208(x)
+    end
+end
+
+def fun_l3_n169(x)
+    if (x < 1)
+        fun_l4_n133(x)
+    else
+        fun_l4_n636(x)
+    end
+end
+
+def fun_l3_n170(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n168(x)
+    end
+end
+
+def fun_l3_n171(x)
+    if (x < 1)
+        fun_l4_n396(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n172(x)
+    if (x < 1)
+        fun_l4_n963(x)
+    else
+        fun_l4_n420(x)
+    end
+end
+
+def fun_l3_n173(x)
+    if (x < 1)
+        fun_l4_n487(x)
+    else
+        fun_l4_n573(x)
+    end
+end
+
+def fun_l3_n174(x)
+    if (x < 1)
+        fun_l4_n847(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n175(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n522(x)
+    end
+end
+
+def fun_l3_n176(x)
+    if (x < 1)
+        fun_l4_n292(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n177(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n146(x)
+    end
+end
+
+def fun_l3_n178(x)
+    if (x < 1)
+        fun_l4_n163(x)
+    else
+        fun_l4_n28(x)
+    end
+end
+
+def fun_l3_n179(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n180(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n56(x)
+    end
+end
+
+def fun_l3_n181(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n155(x)
+    end
+end
+
+def fun_l3_n182(x)
+    if (x < 1)
+        fun_l4_n298(x)
+    else
+        fun_l4_n580(x)
+    end
+end
+
+def fun_l3_n183(x)
+    if (x < 1)
+        fun_l4_n860(x)
+    else
+        fun_l4_n176(x)
+    end
+end
+
+def fun_l3_n184(x)
+    if (x < 1)
+        fun_l4_n108(x)
+    else
+        fun_l4_n986(x)
+    end
+end
+
+def fun_l3_n185(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n110(x)
+    end
+end
+
+def fun_l3_n186(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n158(x)
+    end
+end
+
+def fun_l3_n187(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n803(x)
+    end
+end
+
+def fun_l3_n188(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n189(x)
+    if (x < 1)
+        fun_l4_n610(x)
+    else
+        fun_l4_n691(x)
+    end
+end
+
+def fun_l3_n190(x)
+    if (x < 1)
+        fun_l4_n784(x)
+    else
+        fun_l4_n300(x)
+    end
+end
+
+def fun_l3_n191(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n809(x)
+    end
+end
+
+def fun_l3_n192(x)
+    if (x < 1)
+        fun_l4_n812(x)
+    else
+        fun_l4_n633(x)
+    end
+end
+
+def fun_l3_n193(x)
+    if (x < 1)
+        fun_l4_n880(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n194(x)
+    if (x < 1)
+        fun_l4_n454(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n195(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n196(x)
+    if (x < 1)
+        fun_l4_n294(x)
+    else
+        fun_l4_n150(x)
+    end
+end
+
+def fun_l3_n197(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n319(x)
+    end
+end
+
+def fun_l3_n198(x)
+    if (x < 1)
+        fun_l4_n91(x)
+    else
+        fun_l4_n378(x)
+    end
+end
+
+def fun_l3_n199(x)
+    if (x < 1)
+        fun_l4_n590(x)
+    else
+        fun_l4_n195(x)
+    end
+end
+
+def fun_l3_n200(x)
+    if (x < 1)
+        fun_l4_n532(x)
+    else
+        fun_l4_n346(x)
+    end
+end
+
+def fun_l3_n201(x)
+    if (x < 1)
+        fun_l4_n340(x)
+    else
+        fun_l4_n129(x)
+    end
+end
+
+def fun_l3_n202(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n676(x)
+    end
+end
+
+def fun_l3_n203(x)
+    if (x < 1)
+        fun_l4_n210(x)
+    else
+        fun_l4_n982(x)
+    end
+end
+
+def fun_l3_n204(x)
+    if (x < 1)
+        fun_l4_n247(x)
+    else
+        fun_l4_n550(x)
+    end
+end
+
+def fun_l3_n205(x)
+    if (x < 1)
+        fun_l4_n727(x)
+    else
+        fun_l4_n737(x)
+    end
+end
+
+def fun_l3_n206(x)
+    if (x < 1)
+        fun_l4_n111(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n207(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n208(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n488(x)
+    end
+end
+
+def fun_l3_n209(x)
+    if (x < 1)
+        fun_l4_n697(x)
+    else
+        fun_l4_n366(x)
+    end
+end
+
+def fun_l3_n210(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n995(x)
+    end
+end
+
+def fun_l3_n211(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n212(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n430(x)
+    end
+end
+
+def fun_l3_n213(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n703(x)
+    end
+end
+
+def fun_l3_n214(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n648(x)
+    end
+end
+
+def fun_l3_n215(x)
+    if (x < 1)
+        fun_l4_n800(x)
+    else
+        fun_l4_n680(x)
+    end
+end
+
+def fun_l3_n216(x)
+    if (x < 1)
+        fun_l4_n205(x)
+    else
+        fun_l4_n185(x)
+    end
+end
+
+def fun_l3_n217(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n834(x)
+    end
+end
+
+def fun_l3_n218(x)
+    if (x < 1)
+        fun_l4_n551(x)
+    else
+        fun_l4_n399(x)
+    end
+end
+
+def fun_l3_n219(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n403(x)
+    end
+end
+
+def fun_l3_n220(x)
+    if (x < 1)
+        fun_l4_n874(x)
+    else
+        fun_l4_n584(x)
+    end
+end
+
+def fun_l3_n221(x)
+    if (x < 1)
+        fun_l4_n845(x)
+    else
+        fun_l4_n56(x)
+    end
+end
+
+def fun_l3_n222(x)
+    if (x < 1)
+        fun_l4_n947(x)
+    else
+        fun_l4_n299(x)
+    end
+end
+
+def fun_l3_n223(x)
+    if (x < 1)
+        fun_l4_n533(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n224(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n507(x)
+    end
+end
+
+def fun_l3_n225(x)
+    if (x < 1)
+        fun_l4_n47(x)
+    else
+        fun_l4_n712(x)
+    end
+end
+
+def fun_l3_n226(x)
+    if (x < 1)
+        fun_l4_n470(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n227(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n292(x)
+    end
+end
+
+def fun_l3_n228(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n855(x)
+    end
+end
+
+def fun_l3_n229(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n284(x)
+    end
+end
+
+def fun_l3_n230(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n407(x)
+    end
+end
+
+def fun_l3_n231(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n375(x)
+    end
+end
+
+def fun_l3_n232(x)
+    if (x < 1)
+        fun_l4_n165(x)
+    else
+        fun_l4_n38(x)
+    end
+end
+
+def fun_l3_n233(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n234(x)
+    if (x < 1)
+        fun_l4_n980(x)
+    else
+        fun_l4_n678(x)
+    end
+end
+
+def fun_l3_n235(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n834(x)
+    end
+end
+
+def fun_l3_n236(x)
+    if (x < 1)
+        fun_l4_n227(x)
+    else
+        fun_l4_n11(x)
+    end
+end
+
+def fun_l3_n237(x)
+    if (x < 1)
+        fun_l4_n724(x)
+    else
+        fun_l4_n659(x)
+    end
+end
+
+def fun_l3_n238(x)
+    if (x < 1)
+        fun_l4_n569(x)
+    else
+        fun_l4_n693(x)
+    end
+end
+
+def fun_l3_n239(x)
+    if (x < 1)
+        fun_l4_n933(x)
+    else
+        fun_l4_n897(x)
+    end
+end
+
+def fun_l3_n240(x)
+    if (x < 1)
+        fun_l4_n215(x)
+    else
+        fun_l4_n784(x)
+    end
+end
+
+def fun_l3_n241(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n430(x)
+    end
+end
+
+def fun_l3_n242(x)
+    if (x < 1)
+        fun_l4_n91(x)
+    else
+        fun_l4_n190(x)
+    end
+end
+
+def fun_l3_n243(x)
+    if (x < 1)
+        fun_l4_n375(x)
+    else
+        fun_l4_n638(x)
+    end
+end
+
+def fun_l3_n244(x)
+    if (x < 1)
+        fun_l4_n381(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n245(x)
+    if (x < 1)
+        fun_l4_n983(x)
+    else
+        fun_l4_n248(x)
+    end
+end
+
+def fun_l3_n246(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n647(x)
+    end
+end
+
+def fun_l3_n247(x)
+    if (x < 1)
+        fun_l4_n64(x)
+    else
+        fun_l4_n957(x)
+    end
+end
+
+def fun_l3_n248(x)
+    if (x < 1)
+        fun_l4_n313(x)
+    else
+        fun_l4_n662(x)
+    end
+end
+
+def fun_l3_n249(x)
+    if (x < 1)
+        fun_l4_n528(x)
+    else
+        fun_l4_n448(x)
+    end
+end
+
+def fun_l3_n250(x)
+    if (x < 1)
+        fun_l4_n9(x)
+    else
+        fun_l4_n424(x)
+    end
+end
+
+def fun_l3_n251(x)
+    if (x < 1)
+        fun_l4_n290(x)
+    else
+        fun_l4_n416(x)
+    end
+end
+
+def fun_l3_n252(x)
+    if (x < 1)
+        fun_l4_n159(x)
+    else
+        fun_l4_n780(x)
+    end
+end
+
+def fun_l3_n253(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n254(x)
+    if (x < 1)
+        fun_l4_n658(x)
+    else
+        fun_l4_n816(x)
+    end
+end
+
+def fun_l3_n255(x)
+    if (x < 1)
+        fun_l4_n686(x)
+    else
+        fun_l4_n586(x)
+    end
+end
+
+def fun_l3_n256(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n257(x)
+    if (x < 1)
+        fun_l4_n355(x)
+    else
+        fun_l4_n862(x)
+    end
+end
+
+def fun_l3_n258(x)
+    if (x < 1)
+        fun_l4_n63(x)
+    else
+        fun_l4_n205(x)
+    end
+end
+
+def fun_l3_n259(x)
+    if (x < 1)
+        fun_l4_n766(x)
+    else
+        fun_l4_n130(x)
+    end
+end
+
+def fun_l3_n260(x)
+    if (x < 1)
+        fun_l4_n670(x)
+    else
+        fun_l4_n313(x)
+    end
+end
+
+def fun_l3_n261(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n796(x)
+    end
+end
+
+def fun_l3_n262(x)
+    if (x < 1)
+        fun_l4_n925(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n263(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n298(x)
+    end
+end
+
+def fun_l3_n264(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n809(x)
+    end
+end
+
+def fun_l3_n265(x)
+    if (x < 1)
+        fun_l4_n138(x)
+    else
+        fun_l4_n665(x)
+    end
+end
+
+def fun_l3_n266(x)
+    if (x < 1)
+        fun_l4_n141(x)
+    else
+        fun_l4_n641(x)
+    end
+end
+
+def fun_l3_n267(x)
+    if (x < 1)
+        fun_l4_n936(x)
+    else
+        fun_l4_n233(x)
+    end
+end
+
+def fun_l3_n268(x)
+    if (x < 1)
+        fun_l4_n28(x)
+    else
+        fun_l4_n351(x)
+    end
+end
+
+def fun_l3_n269(x)
+    if (x < 1)
+        fun_l4_n62(x)
+    else
+        fun_l4_n17(x)
+    end
+end
+
+def fun_l3_n270(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n408(x)
+    end
+end
+
+def fun_l3_n271(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n799(x)
+    end
+end
+
+def fun_l3_n272(x)
+    if (x < 1)
+        fun_l4_n103(x)
+    else
+        fun_l4_n804(x)
+    end
+end
+
+def fun_l3_n273(x)
+    if (x < 1)
+        fun_l4_n850(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n274(x)
+    if (x < 1)
+        fun_l4_n651(x)
+    else
+        fun_l4_n484(x)
+    end
+end
+
+def fun_l3_n275(x)
+    if (x < 1)
+        fun_l4_n693(x)
+    else
+        fun_l4_n20(x)
+    end
+end
+
+def fun_l3_n276(x)
+    if (x < 1)
+        fun_l4_n897(x)
+    else
+        fun_l4_n328(x)
+    end
+end
+
+def fun_l3_n277(x)
+    if (x < 1)
+        fun_l4_n632(x)
+    else
+        fun_l4_n120(x)
+    end
+end
+
+def fun_l3_n278(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n279(x)
+    if (x < 1)
+        fun_l4_n461(x)
+    else
+        fun_l4_n219(x)
+    end
+end
+
+def fun_l3_n280(x)
+    if (x < 1)
+        fun_l4_n867(x)
+    else
+        fun_l4_n682(x)
+    end
+end
+
+def fun_l3_n281(x)
+    if (x < 1)
+        fun_l4_n233(x)
+    else
+        fun_l4_n589(x)
+    end
+end
+
+def fun_l3_n282(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n970(x)
+    end
+end
+
+def fun_l3_n283(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n934(x)
+    end
+end
+
+def fun_l3_n284(x)
+    if (x < 1)
+        fun_l4_n736(x)
+    else
+        fun_l4_n516(x)
+    end
+end
+
+def fun_l3_n285(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n539(x)
+    end
+end
+
+def fun_l3_n286(x)
+    if (x < 1)
+        fun_l4_n342(x)
+    else
+        fun_l4_n142(x)
+    end
+end
+
+def fun_l3_n287(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n311(x)
+    end
+end
+
+def fun_l3_n288(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n407(x)
+    end
+end
+
+def fun_l3_n289(x)
+    if (x < 1)
+        fun_l4_n714(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n290(x)
+    if (x < 1)
+        fun_l4_n862(x)
+    else
+        fun_l4_n807(x)
+    end
+end
+
+def fun_l3_n291(x)
+    if (x < 1)
+        fun_l4_n446(x)
+    else
+        fun_l4_n378(x)
+    end
+end
+
+def fun_l3_n292(x)
+    if (x < 1)
+        fun_l4_n418(x)
+    else
+        fun_l4_n194(x)
+    end
+end
+
+def fun_l3_n293(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n294(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n154(x)
+    end
+end
+
+def fun_l3_n295(x)
+    if (x < 1)
+        fun_l4_n764(x)
+    else
+        fun_l4_n335(x)
+    end
+end
+
+def fun_l3_n296(x)
+    if (x < 1)
+        fun_l4_n840(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n297(x)
+    if (x < 1)
+        fun_l4_n520(x)
+    else
+        fun_l4_n838(x)
+    end
+end
+
+def fun_l3_n298(x)
+    if (x < 1)
+        fun_l4_n831(x)
+    else
+        fun_l4_n344(x)
+    end
+end
+
+def fun_l3_n299(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n19(x)
+    end
+end
+
+def fun_l3_n300(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n301(x)
+    if (x < 1)
+        fun_l4_n659(x)
+    else
+        fun_l4_n439(x)
+    end
+end
+
+def fun_l3_n302(x)
+    if (x < 1)
+        fun_l4_n787(x)
+    else
+        fun_l4_n189(x)
+    end
+end
+
+def fun_l3_n303(x)
+    if (x < 1)
+        fun_l4_n549(x)
+    else
+        fun_l4_n594(x)
+    end
+end
+
+def fun_l3_n304(x)
+    if (x < 1)
+        fun_l4_n255(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n305(x)
+    if (x < 1)
+        fun_l4_n312(x)
+    else
+        fun_l4_n935(x)
+    end
+end
+
+def fun_l3_n306(x)
+    if (x < 1)
+        fun_l4_n831(x)
+    else
+        fun_l4_n299(x)
+    end
+end
+
+def fun_l3_n307(x)
+    if (x < 1)
+        fun_l4_n154(x)
+    else
+        fun_l4_n520(x)
+    end
+end
+
+def fun_l3_n308(x)
+    if (x < 1)
+        fun_l4_n768(x)
+    else
+        fun_l4_n676(x)
+    end
+end
+
+def fun_l3_n309(x)
+    if (x < 1)
+        fun_l4_n816(x)
+    else
+        fun_l4_n447(x)
+    end
+end
+
+def fun_l3_n310(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n244(x)
+    end
+end
+
+def fun_l3_n311(x)
+    if (x < 1)
+        fun_l4_n389(x)
+    else
+        fun_l4_n326(x)
+    end
+end
+
+def fun_l3_n312(x)
+    if (x < 1)
+        fun_l4_n125(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n313(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n123(x)
+    end
+end
+
+def fun_l3_n314(x)
+    if (x < 1)
+        fun_l4_n558(x)
+    else
+        fun_l4_n940(x)
+    end
+end
+
+def fun_l3_n315(x)
+    if (x < 1)
+        fun_l4_n652(x)
+    else
+        fun_l4_n10(x)
+    end
+end
+
+def fun_l3_n316(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n315(x)
+    end
+end
+
+def fun_l3_n317(x)
+    if (x < 1)
+        fun_l4_n567(x)
+    else
+        fun_l4_n540(x)
+    end
+end
+
+def fun_l3_n318(x)
+    if (x < 1)
+        fun_l4_n449(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n319(x)
+    if (x < 1)
+        fun_l4_n111(x)
+    else
+        fun_l4_n173(x)
+    end
+end
+
+def fun_l3_n320(x)
+    if (x < 1)
+        fun_l4_n373(x)
+    else
+        fun_l4_n615(x)
+    end
+end
+
+def fun_l3_n321(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n27(x)
+    end
+end
+
+def fun_l3_n322(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n695(x)
+    end
+end
+
+def fun_l3_n323(x)
+    if (x < 1)
+        fun_l4_n788(x)
+    else
+        fun_l4_n57(x)
+    end
+end
+
+def fun_l3_n324(x)
+    if (x < 1)
+        fun_l4_n7(x)
+    else
+        fun_l4_n75(x)
+    end
+end
+
+def fun_l3_n325(x)
+    if (x < 1)
+        fun_l4_n502(x)
+    else
+        fun_l4_n459(x)
+    end
+end
+
+def fun_l3_n326(x)
+    if (x < 1)
+        fun_l4_n572(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n327(x)
+    if (x < 1)
+        fun_l4_n860(x)
+    else
+        fun_l4_n250(x)
+    end
+end
+
+def fun_l3_n328(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n329(x)
+    if (x < 1)
+        fun_l4_n589(x)
+    else
+        fun_l4_n236(x)
+    end
+end
+
+def fun_l3_n330(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n331(x)
+    if (x < 1)
+        fun_l4_n779(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n332(x)
+    if (x < 1)
+        fun_l4_n277(x)
+    else
+        fun_l4_n441(x)
+    end
+end
+
+def fun_l3_n333(x)
+    if (x < 1)
+        fun_l4_n379(x)
+    else
+        fun_l4_n331(x)
+    end
+end
+
+def fun_l3_n334(x)
+    if (x < 1)
+        fun_l4_n802(x)
+    else
+        fun_l4_n588(x)
+    end
+end
+
+def fun_l3_n335(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n918(x)
+    end
+end
+
+def fun_l3_n336(x)
+    if (x < 1)
+        fun_l4_n532(x)
+    else
+        fun_l4_n254(x)
+    end
+end
+
+def fun_l3_n337(x)
+    if (x < 1)
+        fun_l4_n920(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n338(x)
+    if (x < 1)
+        fun_l4_n803(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n339(x)
+    if (x < 1)
+        fun_l4_n924(x)
+    else
+        fun_l4_n878(x)
+    end
+end
+
+def fun_l3_n340(x)
+    if (x < 1)
+        fun_l4_n166(x)
+    else
+        fun_l4_n776(x)
+    end
+end
+
+def fun_l3_n341(x)
+    if (x < 1)
+        fun_l4_n240(x)
+    else
+        fun_l4_n898(x)
+    end
+end
+
+def fun_l3_n342(x)
+    if (x < 1)
+        fun_l4_n810(x)
+    else
+        fun_l4_n423(x)
+    end
+end
+
+def fun_l3_n343(x)
+    if (x < 1)
+        fun_l4_n209(x)
+    else
+        fun_l4_n514(x)
+    end
+end
+
+def fun_l3_n344(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n321(x)
+    end
+end
+
+def fun_l3_n345(x)
+    if (x < 1)
+        fun_l4_n88(x)
+    else
+        fun_l4_n39(x)
+    end
+end
+
+def fun_l3_n346(x)
+    if (x < 1)
+        fun_l4_n848(x)
+    else
+        fun_l4_n357(x)
+    end
+end
+
+def fun_l3_n347(x)
+    if (x < 1)
+        fun_l4_n450(x)
+    else
+        fun_l4_n704(x)
+    end
+end
+
+def fun_l3_n348(x)
+    if (x < 1)
+        fun_l4_n881(x)
+    else
+        fun_l4_n916(x)
+    end
+end
+
+def fun_l3_n349(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n996(x)
+    end
+end
+
+def fun_l3_n350(x)
+    if (x < 1)
+        fun_l4_n839(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n351(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n859(x)
+    end
+end
+
+def fun_l3_n352(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n353(x)
+    if (x < 1)
+        fun_l4_n604(x)
+    else
+        fun_l4_n280(x)
+    end
+end
+
+def fun_l3_n354(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n576(x)
+    end
+end
+
+def fun_l3_n355(x)
+    if (x < 1)
+        fun_l4_n584(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n356(x)
+    if (x < 1)
+        fun_l4_n844(x)
+    else
+        fun_l4_n799(x)
+    end
+end
+
+def fun_l3_n357(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n905(x)
+    end
+end
+
+def fun_l3_n358(x)
+    if (x < 1)
+        fun_l4_n781(x)
+    else
+        fun_l4_n565(x)
+    end
+end
+
+def fun_l3_n359(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n326(x)
+    end
+end
+
+def fun_l3_n360(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n489(x)
+    end
+end
+
+def fun_l3_n361(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n733(x)
+    end
+end
+
+def fun_l3_n362(x)
+    if (x < 1)
+        fun_l4_n93(x)
+    else
+        fun_l4_n549(x)
+    end
+end
+
+def fun_l3_n363(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n883(x)
+    end
+end
+
+def fun_l3_n364(x)
+    if (x < 1)
+        fun_l4_n512(x)
+    else
+        fun_l4_n555(x)
+    end
+end
+
+def fun_l3_n365(x)
+    if (x < 1)
+        fun_l4_n800(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n366(x)
+    if (x < 1)
+        fun_l4_n535(x)
+    else
+        fun_l4_n320(x)
+    end
+end
+
+def fun_l3_n367(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n365(x)
+    end
+end
+
+def fun_l3_n368(x)
+    if (x < 1)
+        fun_l4_n306(x)
+    else
+        fun_l4_n614(x)
+    end
+end
+
+def fun_l3_n369(x)
+    if (x < 1)
+        fun_l4_n914(x)
+    else
+        fun_l4_n20(x)
+    end
+end
+
+def fun_l3_n370(x)
+    if (x < 1)
+        fun_l4_n230(x)
+    else
+        fun_l4_n585(x)
+    end
+end
+
+def fun_l3_n371(x)
+    if (x < 1)
+        fun_l4_n544(x)
+    else
+        fun_l4_n752(x)
+    end
+end
+
+def fun_l3_n372(x)
+    if (x < 1)
+        fun_l4_n984(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n373(x)
+    if (x < 1)
+        fun_l4_n478(x)
+    else
+        fun_l4_n618(x)
+    end
+end
+
+def fun_l3_n374(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n375(x)
+    if (x < 1)
+        fun_l4_n121(x)
+    else
+        fun_l4_n798(x)
+    end
+end
+
+def fun_l3_n376(x)
+    if (x < 1)
+        fun_l4_n851(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n377(x)
+    if (x < 1)
+        fun_l4_n502(x)
+    else
+        fun_l4_n538(x)
+    end
+end
+
+def fun_l3_n378(x)
+    if (x < 1)
+        fun_l4_n432(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n379(x)
+    if (x < 1)
+        fun_l4_n734(x)
+    else
+        fun_l4_n684(x)
+    end
+end
+
+def fun_l3_n380(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n116(x)
+    end
+end
+
+def fun_l3_n381(x)
+    if (x < 1)
+        fun_l4_n291(x)
+    else
+        fun_l4_n464(x)
+    end
+end
+
+def fun_l3_n382(x)
+    if (x < 1)
+        fun_l4_n285(x)
+    else
+        fun_l4_n943(x)
+    end
+end
+
+def fun_l3_n383(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n384(x)
+    if (x < 1)
+        fun_l4_n503(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n385(x)
+    if (x < 1)
+        fun_l4_n208(x)
+    else
+        fun_l4_n683(x)
+    end
+end
+
+def fun_l3_n386(x)
+    if (x < 1)
+        fun_l4_n673(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n387(x)
+    if (x < 1)
+        fun_l4_n921(x)
+    else
+        fun_l4_n800(x)
+    end
+end
+
+def fun_l3_n388(x)
+    if (x < 1)
+        fun_l4_n461(x)
+    else
+        fun_l4_n369(x)
+    end
+end
+
+def fun_l3_n389(x)
+    if (x < 1)
+        fun_l4_n86(x)
+    else
+        fun_l4_n403(x)
+    end
+end
+
+def fun_l3_n390(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n92(x)
+    end
+end
+
+def fun_l3_n391(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n826(x)
+    end
+end
+
+def fun_l3_n392(x)
+    if (x < 1)
+        fun_l4_n459(x)
+    else
+        fun_l4_n821(x)
+    end
+end
+
+def fun_l3_n393(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n376(x)
+    end
+end
+
+def fun_l3_n394(x)
+    if (x < 1)
+        fun_l4_n114(x)
+    else
+        fun_l4_n451(x)
+    end
+end
+
+def fun_l3_n395(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n13(x)
+    end
+end
+
+def fun_l3_n396(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n397(x)
+    if (x < 1)
+        fun_l4_n634(x)
+    else
+        fun_l4_n329(x)
+    end
+end
+
+def fun_l3_n398(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n399(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n14(x)
+    end
+end
+
+def fun_l3_n400(x)
+    if (x < 1)
+        fun_l4_n357(x)
+    else
+        fun_l4_n881(x)
+    end
+end
+
+def fun_l3_n401(x)
+    if (x < 1)
+        fun_l4_n283(x)
+    else
+        fun_l4_n614(x)
+    end
+end
+
+def fun_l3_n402(x)
+    if (x < 1)
+        fun_l4_n634(x)
+    else
+        fun_l4_n653(x)
+    end
+end
+
+def fun_l3_n403(x)
+    if (x < 1)
+        fun_l4_n660(x)
+    else
+        fun_l4_n127(x)
+    end
+end
+
+def fun_l3_n404(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n467(x)
+    end
+end
+
+def fun_l3_n405(x)
+    if (x < 1)
+        fun_l4_n593(x)
+    else
+        fun_l4_n78(x)
+    end
+end
+
+def fun_l3_n406(x)
+    if (x < 1)
+        fun_l4_n514(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n407(x)
+    if (x < 1)
+        fun_l4_n460(x)
+    else
+        fun_l4_n137(x)
+    end
+end
+
+def fun_l3_n408(x)
+    if (x < 1)
+        fun_l4_n3(x)
+    else
+        fun_l4_n224(x)
+    end
+end
+
+def fun_l3_n409(x)
+    if (x < 1)
+        fun_l4_n11(x)
+    else
+        fun_l4_n531(x)
+    end
+end
+
+def fun_l3_n410(x)
+    if (x < 1)
+        fun_l4_n94(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n411(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n526(x)
+    end
+end
+
+def fun_l3_n412(x)
+    if (x < 1)
+        fun_l4_n86(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n413(x)
+    if (x < 1)
+        fun_l4_n249(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n414(x)
+    if (x < 1)
+        fun_l4_n578(x)
+    else
+        fun_l4_n512(x)
+    end
+end
+
+def fun_l3_n415(x)
+    if (x < 1)
+        fun_l4_n176(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n416(x)
+    if (x < 1)
+        fun_l4_n757(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n417(x)
+    if (x < 1)
+        fun_l4_n249(x)
+    else
+        fun_l4_n180(x)
+    end
+end
+
+def fun_l3_n418(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n294(x)
+    end
+end
+
+def fun_l3_n419(x)
+    if (x < 1)
+        fun_l4_n441(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n420(x)
+    if (x < 1)
+        fun_l4_n492(x)
+    else
+        fun_l4_n239(x)
+    end
+end
+
+def fun_l3_n421(x)
+    if (x < 1)
+        fun_l4_n49(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n422(x)
+    if (x < 1)
+        fun_l4_n546(x)
+    else
+        fun_l4_n285(x)
+    end
+end
+
+def fun_l3_n423(x)
+    if (x < 1)
+        fun_l4_n687(x)
+    else
+        fun_l4_n973(x)
+    end
+end
+
+def fun_l3_n424(x)
+    if (x < 1)
+        fun_l4_n876(x)
+    else
+        fun_l4_n591(x)
+    end
+end
+
+def fun_l3_n425(x)
+    if (x < 1)
+        fun_l4_n626(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n426(x)
+    if (x < 1)
+        fun_l4_n439(x)
+    else
+        fun_l4_n709(x)
+    end
+end
+
+def fun_l3_n427(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n305(x)
+    end
+end
+
+def fun_l3_n428(x)
+    if (x < 1)
+        fun_l4_n61(x)
+    else
+        fun_l4_n520(x)
+    end
+end
+
+def fun_l3_n429(x)
+    if (x < 1)
+        fun_l4_n172(x)
+    else
+        fun_l4_n12(x)
+    end
+end
+
+def fun_l3_n430(x)
+    if (x < 1)
+        fun_l4_n432(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n431(x)
+    if (x < 1)
+        fun_l4_n194(x)
+    else
+        fun_l4_n673(x)
+    end
+end
+
+def fun_l3_n432(x)
+    if (x < 1)
+        fun_l4_n952(x)
+    else
+        fun_l4_n798(x)
+    end
+end
+
+def fun_l3_n433(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n263(x)
+    end
+end
+
+def fun_l3_n434(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n882(x)
+    end
+end
+
+def fun_l3_n435(x)
+    if (x < 1)
+        fun_l4_n499(x)
+    else
+        fun_l4_n947(x)
+    end
+end
+
+def fun_l3_n436(x)
+    if (x < 1)
+        fun_l4_n744(x)
+    else
+        fun_l4_n187(x)
+    end
+end
+
+def fun_l3_n437(x)
+    if (x < 1)
+        fun_l4_n244(x)
+    else
+        fun_l4_n366(x)
+    end
+end
+
+def fun_l3_n438(x)
+    if (x < 1)
+        fun_l4_n228(x)
+    else
+        fun_l4_n866(x)
+    end
+end
+
+def fun_l3_n439(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n924(x)
+    end
+end
+
+def fun_l3_n440(x)
+    if (x < 1)
+        fun_l4_n302(x)
+    else
+        fun_l4_n691(x)
+    end
+end
+
+def fun_l3_n441(x)
+    if (x < 1)
+        fun_l4_n559(x)
+    else
+        fun_l4_n758(x)
+    end
+end
+
+def fun_l3_n442(x)
+    if (x < 1)
+        fun_l4_n412(x)
+    else
+        fun_l4_n544(x)
+    end
+end
+
+def fun_l3_n443(x)
+    if (x < 1)
+        fun_l4_n130(x)
+    else
+        fun_l4_n764(x)
+    end
+end
+
+def fun_l3_n444(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n445(x)
+    if (x < 1)
+        fun_l4_n224(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n446(x)
+    if (x < 1)
+        fun_l4_n238(x)
+    else
+        fun_l4_n808(x)
+    end
+end
+
+def fun_l3_n447(x)
+    if (x < 1)
+        fun_l4_n832(x)
+    else
+        fun_l4_n460(x)
+    end
+end
+
+def fun_l3_n448(x)
+    if (x < 1)
+        fun_l4_n897(x)
+    else
+        fun_l4_n817(x)
+    end
+end
+
+def fun_l3_n449(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n926(x)
+    end
+end
+
+def fun_l3_n450(x)
+    if (x < 1)
+        fun_l4_n575(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n451(x)
+    if (x < 1)
+        fun_l4_n42(x)
+    else
+        fun_l4_n714(x)
+    end
+end
+
+def fun_l3_n452(x)
+    if (x < 1)
+        fun_l4_n101(x)
+    else
+        fun_l4_n470(x)
+    end
+end
+
+def fun_l3_n453(x)
+    if (x < 1)
+        fun_l4_n906(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n454(x)
+    if (x < 1)
+        fun_l4_n682(x)
+    else
+        fun_l4_n709(x)
+    end
+end
+
+def fun_l3_n455(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n456(x)
+    if (x < 1)
+        fun_l4_n10(x)
+    else
+        fun_l4_n101(x)
+    end
+end
+
+def fun_l3_n457(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n632(x)
+    end
+end
+
+def fun_l3_n458(x)
+    if (x < 1)
+        fun_l4_n2(x)
+    else
+        fun_l4_n723(x)
+    end
+end
+
+def fun_l3_n459(x)
+    if (x < 1)
+        fun_l4_n998(x)
+    else
+        fun_l4_n546(x)
+    end
+end
+
+def fun_l3_n460(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n461(x)
+    if (x < 1)
+        fun_l4_n896(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n462(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n529(x)
+    end
+end
+
+def fun_l3_n463(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n464(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n412(x)
+    end
+end
+
+def fun_l3_n465(x)
+    if (x < 1)
+        fun_l4_n296(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n466(x)
+    if (x < 1)
+        fun_l4_n241(x)
+    else
+        fun_l4_n649(x)
+    end
+end
+
+def fun_l3_n467(x)
+    if (x < 1)
+        fun_l4_n296(x)
+    else
+        fun_l4_n80(x)
+    end
+end
+
+def fun_l3_n468(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n469(x)
+    if (x < 1)
+        fun_l4_n655(x)
+    else
+        fun_l4_n605(x)
+    end
+end
+
+def fun_l3_n470(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n807(x)
+    end
+end
+
+def fun_l3_n471(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n902(x)
+    end
+end
+
+def fun_l3_n472(x)
+    if (x < 1)
+        fun_l4_n527(x)
+    else
+        fun_l4_n638(x)
+    end
+end
+
+def fun_l3_n473(x)
+    if (x < 1)
+        fun_l4_n775(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n474(x)
+    if (x < 1)
+        fun_l4_n856(x)
+    else
+        fun_l4_n182(x)
+    end
+end
+
+def fun_l3_n475(x)
+    if (x < 1)
+        fun_l4_n434(x)
+    else
+        fun_l4_n232(x)
+    end
+end
+
+def fun_l3_n476(x)
+    if (x < 1)
+        fun_l4_n208(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n477(x)
+    if (x < 1)
+        fun_l4_n146(x)
+    else
+        fun_l4_n764(x)
+    end
+end
+
+def fun_l3_n478(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n479(x)
+    if (x < 1)
+        fun_l4_n46(x)
+    else
+        fun_l4_n488(x)
+    end
+end
+
+def fun_l3_n480(x)
+    if (x < 1)
+        fun_l4_n637(x)
+    else
+        fun_l4_n48(x)
+    end
+end
+
+def fun_l3_n481(x)
+    if (x < 1)
+        fun_l4_n496(x)
+    else
+        fun_l4_n891(x)
+    end
+end
+
+def fun_l3_n482(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n736(x)
+    end
+end
+
+def fun_l3_n483(x)
+    if (x < 1)
+        fun_l4_n377(x)
+    else
+        fun_l4_n603(x)
+    end
+end
+
+def fun_l3_n484(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n201(x)
+    end
+end
+
+def fun_l3_n485(x)
+    if (x < 1)
+        fun_l4_n495(x)
+    else
+        fun_l4_n721(x)
+    end
+end
+
+def fun_l3_n486(x)
+    if (x < 1)
+        fun_l4_n128(x)
+    else
+        fun_l4_n400(x)
+    end
+end
+
+def fun_l3_n487(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n53(x)
+    end
+end
+
+def fun_l3_n488(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n814(x)
+    end
+end
+
+def fun_l3_n489(x)
+    if (x < 1)
+        fun_l4_n816(x)
+    else
+        fun_l4_n196(x)
+    end
+end
+
+def fun_l3_n490(x)
+    if (x < 1)
+        fun_l4_n754(x)
+    else
+        fun_l4_n451(x)
+    end
+end
+
+def fun_l3_n491(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n597(x)
+    end
+end
+
+def fun_l3_n492(x)
+    if (x < 1)
+        fun_l4_n539(x)
+    else
+        fun_l4_n893(x)
+    end
+end
+
+def fun_l3_n493(x)
+    if (x < 1)
+        fun_l4_n542(x)
+    else
+        fun_l4_n956(x)
+    end
+end
+
+def fun_l3_n494(x)
+    if (x < 1)
+        fun_l4_n479(x)
+    else
+        fun_l4_n448(x)
+    end
+end
+
+def fun_l3_n495(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n912(x)
+    end
+end
+
+def fun_l3_n496(x)
+    if (x < 1)
+        fun_l4_n463(x)
+    else
+        fun_l4_n112(x)
+    end
+end
+
+def fun_l3_n497(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n486(x)
+    end
+end
+
+def fun_l3_n498(x)
+    if (x < 1)
+        fun_l4_n155(x)
+    else
+        fun_l4_n298(x)
+    end
+end
+
+def fun_l3_n499(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n908(x)
+    end
+end
+
+def fun_l3_n500(x)
+    if (x < 1)
+        fun_l4_n769(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n501(x)
+    if (x < 1)
+        fun_l4_n544(x)
+    else
+        fun_l4_n749(x)
+    end
+end
+
+def fun_l3_n502(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n66(x)
+    end
+end
+
+def fun_l3_n503(x)
+    if (x < 1)
+        fun_l4_n900(x)
+    else
+        fun_l4_n917(x)
+    end
+end
+
+def fun_l3_n504(x)
+    if (x < 1)
+        fun_l4_n982(x)
+    else
+        fun_l4_n707(x)
+    end
+end
+
+def fun_l3_n505(x)
+    if (x < 1)
+        fun_l4_n102(x)
+    else
+        fun_l4_n564(x)
+    end
+end
+
+def fun_l3_n506(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n367(x)
+    end
+end
+
+def fun_l3_n507(x)
+    if (x < 1)
+        fun_l4_n969(x)
+    else
+        fun_l4_n354(x)
+    end
+end
+
+def fun_l3_n508(x)
+    if (x < 1)
+        fun_l4_n405(x)
+    else
+        fun_l4_n485(x)
+    end
+end
+
+def fun_l3_n509(x)
+    if (x < 1)
+        fun_l4_n477(x)
+    else
+        fun_l4_n629(x)
+    end
+end
+
+def fun_l3_n510(x)
+    if (x < 1)
+        fun_l4_n753(x)
+    else
+        fun_l4_n78(x)
+    end
+end
+
+def fun_l3_n511(x)
+    if (x < 1)
+        fun_l4_n221(x)
+    else
+        fun_l4_n637(x)
+    end
+end
+
+def fun_l3_n512(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n513(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n626(x)
+    end
+end
+
+def fun_l3_n514(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n32(x)
+    end
+end
+
+def fun_l3_n515(x)
+    if (x < 1)
+        fun_l4_n914(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n516(x)
+    if (x < 1)
+        fun_l4_n380(x)
+    else
+        fun_l4_n83(x)
+    end
+end
+
+def fun_l3_n517(x)
+    if (x < 1)
+        fun_l4_n175(x)
+    else
+        fun_l4_n830(x)
+    end
+end
+
+def fun_l3_n518(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n773(x)
+    end
+end
+
+def fun_l3_n519(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n520(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n754(x)
+    end
+end
+
+def fun_l3_n521(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n156(x)
+    end
+end
+
+def fun_l3_n522(x)
+    if (x < 1)
+        fun_l4_n299(x)
+    else
+        fun_l4_n937(x)
+    end
+end
+
+def fun_l3_n523(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n786(x)
+    end
+end
+
+def fun_l3_n524(x)
+    if (x < 1)
+        fun_l4_n988(x)
+    else
+        fun_l4_n930(x)
+    end
+end
+
+def fun_l3_n525(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n43(x)
+    end
+end
+
+def fun_l3_n526(x)
+    if (x < 1)
+        fun_l4_n367(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n527(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n394(x)
+    end
+end
+
+def fun_l3_n528(x)
+    if (x < 1)
+        fun_l4_n92(x)
+    else
+        fun_l4_n304(x)
+    end
+end
+
+def fun_l3_n529(x)
+    if (x < 1)
+        fun_l4_n369(x)
+    else
+        fun_l4_n458(x)
+    end
+end
+
+def fun_l3_n530(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n531(x)
+    if (x < 1)
+        fun_l4_n678(x)
+    else
+        fun_l4_n970(x)
+    end
+end
+
+def fun_l3_n532(x)
+    if (x < 1)
+        fun_l4_n349(x)
+    else
+        fun_l4_n853(x)
+    end
+end
+
+def fun_l3_n533(x)
+    if (x < 1)
+        fun_l4_n918(x)
+    else
+        fun_l4_n820(x)
+    end
+end
+
+def fun_l3_n534(x)
+    if (x < 1)
+        fun_l4_n369(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n535(x)
+    if (x < 1)
+        fun_l4_n437(x)
+    else
+        fun_l4_n930(x)
+    end
+end
+
+def fun_l3_n536(x)
+    if (x < 1)
+        fun_l4_n143(x)
+    else
+        fun_l4_n986(x)
+    end
+end
+
+def fun_l3_n537(x)
+    if (x < 1)
+        fun_l4_n603(x)
+    else
+        fun_l4_n818(x)
+    end
+end
+
+def fun_l3_n538(x)
+    if (x < 1)
+        fun_l4_n14(x)
+    else
+        fun_l4_n994(x)
+    end
+end
+
+def fun_l3_n539(x)
+    if (x < 1)
+        fun_l4_n650(x)
+    else
+        fun_l4_n115(x)
+    end
+end
+
+def fun_l3_n540(x)
+    if (x < 1)
+        fun_l4_n74(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n541(x)
+    if (x < 1)
+        fun_l4_n601(x)
+    else
+        fun_l4_n756(x)
+    end
+end
+
+def fun_l3_n542(x)
+    if (x < 1)
+        fun_l4_n733(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n543(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n97(x)
+    end
+end
+
+def fun_l3_n544(x)
+    if (x < 1)
+        fun_l4_n949(x)
+    else
+        fun_l4_n868(x)
+    end
+end
+
+def fun_l3_n545(x)
+    if (x < 1)
+        fun_l4_n346(x)
+    else
+        fun_l4_n0(x)
+    end
+end
+
+def fun_l3_n546(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n188(x)
+    end
+end
+
+def fun_l3_n547(x)
+    if (x < 1)
+        fun_l4_n403(x)
+    else
+        fun_l4_n670(x)
+    end
+end
+
+def fun_l3_n548(x)
+    if (x < 1)
+        fun_l4_n449(x)
+    else
+        fun_l4_n96(x)
+    end
+end
+
+def fun_l3_n549(x)
+    if (x < 1)
+        fun_l4_n585(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n550(x)
+    if (x < 1)
+        fun_l4_n963(x)
+    else
+        fun_l4_n979(x)
+    end
+end
+
+def fun_l3_n551(x)
+    if (x < 1)
+        fun_l4_n892(x)
+    else
+        fun_l4_n583(x)
+    end
+end
+
+def fun_l3_n552(x)
+    if (x < 1)
+        fun_l4_n846(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n553(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n428(x)
+    end
+end
+
+def fun_l3_n554(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n641(x)
+    end
+end
+
+def fun_l3_n555(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n556(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n0(x)
+    end
+end
+
+def fun_l3_n557(x)
+    if (x < 1)
+        fun_l4_n255(x)
+    else
+        fun_l4_n860(x)
+    end
+end
+
+def fun_l3_n558(x)
+    if (x < 1)
+        fun_l4_n807(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n559(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n352(x)
+    end
+end
+
+def fun_l3_n560(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n561(x)
+    if (x < 1)
+        fun_l4_n637(x)
+    else
+        fun_l4_n628(x)
+    end
+end
+
+def fun_l3_n562(x)
+    if (x < 1)
+        fun_l4_n281(x)
+    else
+        fun_l4_n394(x)
+    end
+end
+
+def fun_l3_n563(x)
+    if (x < 1)
+        fun_l4_n440(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n564(x)
+    if (x < 1)
+        fun_l4_n893(x)
+    else
+        fun_l4_n396(x)
+    end
+end
+
+def fun_l3_n565(x)
+    if (x < 1)
+        fun_l4_n94(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n566(x)
+    if (x < 1)
+        fun_l4_n968(x)
+    else
+        fun_l4_n444(x)
+    end
+end
+
+def fun_l3_n567(x)
+    if (x < 1)
+        fun_l4_n85(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n568(x)
+    if (x < 1)
+        fun_l4_n164(x)
+    else
+        fun_l4_n229(x)
+    end
+end
+
+def fun_l3_n569(x)
+    if (x < 1)
+        fun_l4_n594(x)
+    else
+        fun_l4_n756(x)
+    end
+end
+
+def fun_l3_n570(x)
+    if (x < 1)
+        fun_l4_n77(x)
+    else
+        fun_l4_n370(x)
+    end
+end
+
+def fun_l3_n571(x)
+    if (x < 1)
+        fun_l4_n724(x)
+    else
+        fun_l4_n965(x)
+    end
+end
+
+def fun_l3_n572(x)
+    if (x < 1)
+        fun_l4_n394(x)
+    else
+        fun_l4_n595(x)
+    end
+end
+
+def fun_l3_n573(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n41(x)
+    end
+end
+
+def fun_l3_n574(x)
+    if (x < 1)
+        fun_l4_n951(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n575(x)
+    if (x < 1)
+        fun_l4_n297(x)
+    else
+        fun_l4_n126(x)
+    end
+end
+
+def fun_l3_n576(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n276(x)
+    end
+end
+
+def fun_l3_n577(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n152(x)
+    end
+end
+
+def fun_l3_n578(x)
+    if (x < 1)
+        fun_l4_n950(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n579(x)
+    if (x < 1)
+        fun_l4_n484(x)
+    else
+        fun_l4_n99(x)
+    end
+end
+
+def fun_l3_n580(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n98(x)
+    end
+end
+
+def fun_l3_n581(x)
+    if (x < 1)
+        fun_l4_n10(x)
+    else
+        fun_l4_n537(x)
+    end
+end
+
+def fun_l3_n582(x)
+    if (x < 1)
+        fun_l4_n419(x)
+    else
+        fun_l4_n285(x)
+    end
+end
+
+def fun_l3_n583(x)
+    if (x < 1)
+        fun_l4_n330(x)
+    else
+        fun_l4_n732(x)
+    end
+end
+
+def fun_l3_n584(x)
+    if (x < 1)
+        fun_l4_n64(x)
+    else
+        fun_l4_n461(x)
+    end
+end
+
+def fun_l3_n585(x)
+    if (x < 1)
+        fun_l4_n326(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n586(x)
+    if (x < 1)
+        fun_l4_n423(x)
+    else
+        fun_l4_n945(x)
+    end
+end
+
+def fun_l3_n587(x)
+    if (x < 1)
+        fun_l4_n192(x)
+    else
+        fun_l4_n459(x)
+    end
+end
+
+def fun_l3_n588(x)
+    if (x < 1)
+        fun_l4_n292(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n589(x)
+    if (x < 1)
+        fun_l4_n612(x)
+    else
+        fun_l4_n902(x)
+    end
+end
+
+def fun_l3_n590(x)
+    if (x < 1)
+        fun_l4_n842(x)
+    else
+        fun_l4_n300(x)
+    end
+end
+
+def fun_l3_n591(x)
+    if (x < 1)
+        fun_l4_n265(x)
+    else
+        fun_l4_n906(x)
+    end
+end
+
+def fun_l3_n592(x)
+    if (x < 1)
+        fun_l4_n82(x)
+    else
+        fun_l4_n417(x)
+    end
+end
+
+def fun_l3_n593(x)
+    if (x < 1)
+        fun_l4_n896(x)
+    else
+        fun_l4_n794(x)
+    end
+end
+
+def fun_l3_n594(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n83(x)
+    end
+end
+
+def fun_l3_n595(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n596(x)
+    if (x < 1)
+        fun_l4_n655(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n597(x)
+    if (x < 1)
+        fun_l4_n810(x)
+    else
+        fun_l4_n824(x)
+    end
+end
+
+def fun_l3_n598(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n599(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n96(x)
+    end
+end
+
+def fun_l3_n600(x)
+    if (x < 1)
+        fun_l4_n879(x)
+    else
+        fun_l4_n757(x)
+    end
+end
+
+def fun_l3_n601(x)
+    if (x < 1)
+        fun_l4_n840(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n602(x)
+    if (x < 1)
+        fun_l4_n547(x)
+    else
+        fun_l4_n45(x)
+    end
+end
+
+def fun_l3_n603(x)
+    if (x < 1)
+        fun_l4_n978(x)
+    else
+        fun_l4_n646(x)
+    end
+end
+
+def fun_l3_n604(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n605(x)
+    if (x < 1)
+        fun_l4_n257(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n606(x)
+    if (x < 1)
+        fun_l4_n427(x)
+    else
+        fun_l4_n489(x)
+    end
+end
+
+def fun_l3_n607(x)
+    if (x < 1)
+        fun_l4_n465(x)
+    else
+        fun_l4_n48(x)
+    end
+end
+
+def fun_l3_n608(x)
+    if (x < 1)
+        fun_l4_n571(x)
+    else
+        fun_l4_n332(x)
+    end
+end
+
+def fun_l3_n609(x)
+    if (x < 1)
+        fun_l4_n813(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n610(x)
+    if (x < 1)
+        fun_l4_n931(x)
+    else
+        fun_l4_n913(x)
+    end
+end
+
+def fun_l3_n611(x)
+    if (x < 1)
+        fun_l4_n20(x)
+    else
+        fun_l4_n933(x)
+    end
+end
+
+def fun_l3_n612(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n787(x)
+    end
+end
+
+def fun_l3_n613(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n735(x)
+    end
+end
+
+def fun_l3_n614(x)
+    if (x < 1)
+        fun_l4_n315(x)
+    else
+        fun_l4_n913(x)
+    end
+end
+
+def fun_l3_n615(x)
+    if (x < 1)
+        fun_l4_n308(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n616(x)
+    if (x < 1)
+        fun_l4_n847(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n617(x)
+    if (x < 1)
+        fun_l4_n387(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n618(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n619(x)
+    if (x < 1)
+        fun_l4_n524(x)
+    else
+        fun_l4_n202(x)
+    end
+end
+
+def fun_l3_n620(x)
+    if (x < 1)
+        fun_l4_n836(x)
+    else
+        fun_l4_n548(x)
+    end
+end
+
+def fun_l3_n621(x)
+    if (x < 1)
+        fun_l4_n76(x)
+    else
+        fun_l4_n5(x)
+    end
+end
+
+def fun_l3_n622(x)
+    if (x < 1)
+        fun_l4_n223(x)
+    else
+        fun_l4_n438(x)
+    end
+end
+
+def fun_l3_n623(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n590(x)
+    end
+end
+
+def fun_l3_n624(x)
+    if (x < 1)
+        fun_l4_n609(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n625(x)
+    if (x < 1)
+        fun_l4_n966(x)
+    else
+        fun_l4_n278(x)
+    end
+end
+
+def fun_l3_n626(x)
+    if (x < 1)
+        fun_l4_n82(x)
+    else
+        fun_l4_n100(x)
+    end
+end
+
+def fun_l3_n627(x)
+    if (x < 1)
+        fun_l4_n312(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n628(x)
+    if (x < 1)
+        fun_l4_n682(x)
+    else
+        fun_l4_n791(x)
+    end
+end
+
+def fun_l3_n629(x)
+    if (x < 1)
+        fun_l4_n166(x)
+    else
+        fun_l4_n678(x)
+    end
+end
+
+def fun_l3_n630(x)
+    if (x < 1)
+        fun_l4_n507(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n631(x)
+    if (x < 1)
+        fun_l4_n97(x)
+    else
+        fun_l4_n13(x)
+    end
+end
+
+def fun_l3_n632(x)
+    if (x < 1)
+        fun_l4_n976(x)
+    else
+        fun_l4_n794(x)
+    end
+end
+
+def fun_l3_n633(x)
+    if (x < 1)
+        fun_l4_n994(x)
+    else
+        fun_l4_n743(x)
+    end
+end
+
+def fun_l3_n634(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n754(x)
+    end
+end
+
+def fun_l3_n635(x)
+    if (x < 1)
+        fun_l4_n602(x)
+    else
+        fun_l4_n997(x)
+    end
+end
+
+def fun_l3_n636(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n133(x)
+    end
+end
+
+def fun_l3_n637(x)
+    if (x < 1)
+        fun_l4_n413(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n638(x)
+    if (x < 1)
+        fun_l4_n843(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n639(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n640(x)
+    if (x < 1)
+        fun_l4_n384(x)
+    else
+        fun_l4_n444(x)
+    end
+end
+
+def fun_l3_n641(x)
+    if (x < 1)
+        fun_l4_n699(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n642(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n623(x)
+    end
+end
+
+def fun_l3_n643(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n644(x)
+    if (x < 1)
+        fun_l4_n804(x)
+    else
+        fun_l4_n618(x)
+    end
+end
+
+def fun_l3_n645(x)
+    if (x < 1)
+        fun_l4_n513(x)
+    else
+        fun_l4_n214(x)
+    end
+end
+
+def fun_l3_n646(x)
+    if (x < 1)
+        fun_l4_n605(x)
+    else
+        fun_l4_n920(x)
+    end
+end
+
+def fun_l3_n647(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n297(x)
+    end
+end
+
+def fun_l3_n648(x)
+    if (x < 1)
+        fun_l4_n871(x)
+    else
+        fun_l4_n75(x)
+    end
+end
+
+def fun_l3_n649(x)
+    if (x < 1)
+        fun_l4_n196(x)
+    else
+        fun_l4_n277(x)
+    end
+end
+
+def fun_l3_n650(x)
+    if (x < 1)
+        fun_l4_n25(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n651(x)
+    if (x < 1)
+        fun_l4_n603(x)
+    else
+        fun_l4_n46(x)
+    end
+end
+
+def fun_l3_n652(x)
+    if (x < 1)
+        fun_l4_n623(x)
+    else
+        fun_l4_n604(x)
+    end
+end
+
+def fun_l3_n653(x)
+    if (x < 1)
+        fun_l4_n854(x)
+    else
+        fun_l4_n955(x)
+    end
+end
+
+def fun_l3_n654(x)
+    if (x < 1)
+        fun_l4_n667(x)
+    else
+        fun_l4_n988(x)
+    end
+end
+
+def fun_l3_n655(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n831(x)
+    end
+end
+
+def fun_l3_n656(x)
+    if (x < 1)
+        fun_l4_n591(x)
+    else
+        fun_l4_n593(x)
+    end
+end
+
+def fun_l3_n657(x)
+    if (x < 1)
+        fun_l4_n308(x)
+    else
+        fun_l4_n547(x)
+    end
+end
+
+def fun_l3_n658(x)
+    if (x < 1)
+        fun_l4_n780(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n659(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n660(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n282(x)
+    end
+end
+
+def fun_l3_n661(x)
+    if (x < 1)
+        fun_l4_n953(x)
+    else
+        fun_l4_n832(x)
+    end
+end
+
+def fun_l3_n662(x)
+    if (x < 1)
+        fun_l4_n525(x)
+    else
+        fun_l4_n850(x)
+    end
+end
+
+def fun_l3_n663(x)
+    if (x < 1)
+        fun_l4_n606(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n664(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n591(x)
+    end
+end
+
+def fun_l3_n665(x)
+    if (x < 1)
+        fun_l4_n781(x)
+    else
+        fun_l4_n162(x)
+    end
+end
+
+def fun_l3_n666(x)
+    if (x < 1)
+        fun_l4_n848(x)
+    else
+        fun_l4_n133(x)
+    end
+end
+
+def fun_l3_n667(x)
+    if (x < 1)
+        fun_l4_n341(x)
+    else
+        fun_l4_n212(x)
+    end
+end
+
+def fun_l3_n668(x)
+    if (x < 1)
+        fun_l4_n320(x)
+    else
+        fun_l4_n131(x)
+    end
+end
+
+def fun_l3_n669(x)
+    if (x < 1)
+        fun_l4_n18(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n670(x)
+    if (x < 1)
+        fun_l4_n917(x)
+    else
+        fun_l4_n988(x)
+    end
+end
+
+def fun_l3_n671(x)
+    if (x < 1)
+        fun_l4_n50(x)
+    else
+        fun_l4_n27(x)
+    end
+end
+
+def fun_l3_n672(x)
+    if (x < 1)
+        fun_l4_n277(x)
+    else
+        fun_l4_n238(x)
+    end
+end
+
+def fun_l3_n673(x)
+    if (x < 1)
+        fun_l4_n303(x)
+    else
+        fun_l4_n643(x)
+    end
+end
+
+def fun_l3_n674(x)
+    if (x < 1)
+        fun_l4_n794(x)
+    else
+        fun_l4_n906(x)
+    end
+end
+
+def fun_l3_n675(x)
+    if (x < 1)
+        fun_l4_n688(x)
+    else
+        fun_l4_n312(x)
+    end
+end
+
+def fun_l3_n676(x)
+    if (x < 1)
+        fun_l4_n833(x)
+    else
+        fun_l4_n900(x)
+    end
+end
+
+def fun_l3_n677(x)
+    if (x < 1)
+        fun_l4_n649(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n678(x)
+    if (x < 1)
+        fun_l4_n958(x)
+    else
+        fun_l4_n939(x)
+    end
+end
+
+def fun_l3_n679(x)
+    if (x < 1)
+        fun_l4_n949(x)
+    else
+        fun_l4_n887(x)
+    end
+end
+
+def fun_l3_n680(x)
+    if (x < 1)
+        fun_l4_n630(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n681(x)
+    if (x < 1)
+        fun_l4_n553(x)
+    else
+        fun_l4_n940(x)
+    end
+end
+
+def fun_l3_n682(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n950(x)
+    end
+end
+
+def fun_l3_n683(x)
+    if (x < 1)
+        fun_l4_n898(x)
+    else
+        fun_l4_n374(x)
+    end
+end
+
+def fun_l3_n684(x)
+    if (x < 1)
+        fun_l4_n802(x)
+    else
+        fun_l4_n527(x)
+    end
+end
+
+def fun_l3_n685(x)
+    if (x < 1)
+        fun_l4_n751(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n686(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n687(x)
+    if (x < 1)
+        fun_l4_n694(x)
+    else
+        fun_l4_n819(x)
+    end
+end
+
+def fun_l3_n688(x)
+    if (x < 1)
+        fun_l4_n167(x)
+    else
+        fun_l4_n91(x)
+    end
+end
+
+def fun_l3_n689(x)
+    if (x < 1)
+        fun_l4_n692(x)
+    else
+        fun_l4_n422(x)
+    end
+end
+
+def fun_l3_n690(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n691(x)
+    if (x < 1)
+        fun_l4_n394(x)
+    else
+        fun_l4_n603(x)
+    end
+end
+
+def fun_l3_n692(x)
+    if (x < 1)
+        fun_l4_n909(x)
+    else
+        fun_l4_n528(x)
+    end
+end
+
+def fun_l3_n693(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n22(x)
+    end
+end
+
+def fun_l3_n694(x)
+    if (x < 1)
+        fun_l4_n6(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n695(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n948(x)
+    end
+end
+
+def fun_l3_n696(x)
+    if (x < 1)
+        fun_l4_n748(x)
+    else
+        fun_l4_n706(x)
+    end
+end
+
+def fun_l3_n697(x)
+    if (x < 1)
+        fun_l4_n720(x)
+    else
+        fun_l4_n693(x)
+    end
+end
+
+def fun_l3_n698(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n755(x)
+    end
+end
+
+def fun_l3_n699(x)
+    if (x < 1)
+        fun_l4_n975(x)
+    else
+        fun_l4_n415(x)
+    end
+end
+
+def fun_l3_n700(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n701(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n892(x)
+    end
+end
+
+def fun_l3_n702(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n189(x)
+    end
+end
+
+def fun_l3_n703(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n535(x)
+    end
+end
+
+def fun_l3_n704(x)
+    if (x < 1)
+        fun_l4_n886(x)
+    else
+        fun_l4_n223(x)
+    end
+end
+
+def fun_l3_n705(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n706(x)
+    if (x < 1)
+        fun_l4_n629(x)
+    else
+        fun_l4_n479(x)
+    end
+end
+
+def fun_l3_n707(x)
+    if (x < 1)
+        fun_l4_n477(x)
+    else
+        fun_l4_n302(x)
+    end
+end
+
+def fun_l3_n708(x)
+    if (x < 1)
+        fun_l4_n790(x)
+    else
+        fun_l4_n262(x)
+    end
+end
+
+def fun_l3_n709(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n995(x)
+    end
+end
+
+def fun_l3_n710(x)
+    if (x < 1)
+        fun_l4_n549(x)
+    else
+        fun_l4_n651(x)
+    end
+end
+
+def fun_l3_n711(x)
+    if (x < 1)
+        fun_l4_n77(x)
+    else
+        fun_l4_n555(x)
+    end
+end
+
+def fun_l3_n712(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n734(x)
+    end
+end
+
+def fun_l3_n713(x)
+    if (x < 1)
+        fun_l4_n778(x)
+    else
+        fun_l4_n884(x)
+    end
+end
+
+def fun_l3_n714(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n637(x)
+    end
+end
+
+def fun_l3_n715(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n249(x)
+    end
+end
+
+def fun_l3_n716(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n307(x)
+    end
+end
+
+def fun_l3_n717(x)
+    if (x < 1)
+        fun_l4_n482(x)
+    else
+        fun_l4_n4(x)
+    end
+end
+
+def fun_l3_n718(x)
+    if (x < 1)
+        fun_l4_n195(x)
+    else
+        fun_l4_n410(x)
+    end
+end
+
+def fun_l3_n719(x)
+    if (x < 1)
+        fun_l4_n862(x)
+    else
+        fun_l4_n91(x)
+    end
+end
+
+def fun_l3_n720(x)
+    if (x < 1)
+        fun_l4_n591(x)
+    else
+        fun_l4_n391(x)
+    end
+end
+
+def fun_l3_n721(x)
+    if (x < 1)
+        fun_l4_n776(x)
+    else
+        fun_l4_n129(x)
+    end
+end
+
+def fun_l3_n722(x)
+    if (x < 1)
+        fun_l4_n857(x)
+    else
+        fun_l4_n160(x)
+    end
+end
+
+def fun_l3_n723(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n724(x)
+    if (x < 1)
+        fun_l4_n582(x)
+    else
+        fun_l4_n100(x)
+    end
+end
+
+def fun_l3_n725(x)
+    if (x < 1)
+        fun_l4_n962(x)
+    else
+        fun_l4_n846(x)
+    end
+end
+
+def fun_l3_n726(x)
+    if (x < 1)
+        fun_l4_n892(x)
+    else
+        fun_l4_n334(x)
+    end
+end
+
+def fun_l3_n727(x)
+    if (x < 1)
+        fun_l4_n17(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n728(x)
+    if (x < 1)
+        fun_l4_n453(x)
+    else
+        fun_l4_n234(x)
+    end
+end
+
+def fun_l3_n729(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n139(x)
+    end
+end
+
+def fun_l3_n730(x)
+    if (x < 1)
+        fun_l4_n87(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n731(x)
+    if (x < 1)
+        fun_l4_n565(x)
+    else
+        fun_l4_n289(x)
+    end
+end
+
+def fun_l3_n732(x)
+    if (x < 1)
+        fun_l4_n821(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n733(x)
+    if (x < 1)
+        fun_l4_n464(x)
+    else
+        fun_l4_n929(x)
+    end
+end
+
+def fun_l3_n734(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n735(x)
+    if (x < 1)
+        fun_l4_n942(x)
+    else
+        fun_l4_n770(x)
+    end
+end
+
+def fun_l3_n736(x)
+    if (x < 1)
+        fun_l4_n826(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n737(x)
+    if (x < 1)
+        fun_l4_n47(x)
+    else
+        fun_l4_n357(x)
+    end
+end
+
+def fun_l3_n738(x)
+    if (x < 1)
+        fun_l4_n582(x)
+    else
+        fun_l4_n652(x)
+    end
+end
+
+def fun_l3_n739(x)
+    if (x < 1)
+        fun_l4_n641(x)
+    else
+        fun_l4_n479(x)
+    end
+end
+
+def fun_l3_n740(x)
+    if (x < 1)
+        fun_l4_n11(x)
+    else
+        fun_l4_n965(x)
+    end
+end
+
+def fun_l3_n741(x)
+    if (x < 1)
+        fun_l4_n402(x)
+    else
+        fun_l4_n512(x)
+    end
+end
+
+def fun_l3_n742(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n942(x)
+    end
+end
+
+def fun_l3_n743(x)
+    if (x < 1)
+        fun_l4_n770(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n744(x)
+    if (x < 1)
+        fun_l4_n575(x)
+    else
+        fun_l4_n158(x)
+    end
+end
+
+def fun_l3_n745(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n552(x)
+    end
+end
+
+def fun_l3_n746(x)
+    if (x < 1)
+        fun_l4_n887(x)
+    else
+        fun_l4_n319(x)
+    end
+end
+
+def fun_l3_n747(x)
+    if (x < 1)
+        fun_l4_n967(x)
+    else
+        fun_l4_n561(x)
+    end
+end
+
+def fun_l3_n748(x)
+    if (x < 1)
+        fun_l4_n4(x)
+    else
+        fun_l4_n766(x)
+    end
+end
+
+def fun_l3_n749(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n750(x)
+    if (x < 1)
+        fun_l4_n890(x)
+    else
+        fun_l4_n663(x)
+    end
+end
+
+def fun_l3_n751(x)
+    if (x < 1)
+        fun_l4_n267(x)
+    else
+        fun_l4_n449(x)
+    end
+end
+
+def fun_l3_n752(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n753(x)
+    if (x < 1)
+        fun_l4_n893(x)
+    else
+        fun_l4_n116(x)
+    end
+end
+
+def fun_l3_n754(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n755(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n81(x)
+    end
+end
+
+def fun_l3_n756(x)
+    if (x < 1)
+        fun_l4_n833(x)
+    else
+        fun_l4_n24(x)
+    end
+end
+
+def fun_l3_n757(x)
+    if (x < 1)
+        fun_l4_n740(x)
+    else
+        fun_l4_n803(x)
+    end
+end
+
+def fun_l3_n758(x)
+    if (x < 1)
+        fun_l4_n552(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n759(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n760(x)
+    if (x < 1)
+        fun_l4_n243(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n761(x)
+    if (x < 1)
+        fun_l4_n65(x)
+    else
+        fun_l4_n660(x)
+    end
+end
+
+def fun_l3_n762(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n761(x)
+    end
+end
+
+def fun_l3_n763(x)
+    if (x < 1)
+        fun_l4_n971(x)
+    else
+        fun_l4_n280(x)
+    end
+end
+
+def fun_l3_n764(x)
+    if (x < 1)
+        fun_l4_n441(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n765(x)
+    if (x < 1)
+        fun_l4_n577(x)
+    else
+        fun_l4_n586(x)
+    end
+end
+
+def fun_l3_n766(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n60(x)
+    end
+end
+
+def fun_l3_n767(x)
+    if (x < 1)
+        fun_l4_n380(x)
+    else
+        fun_l4_n32(x)
+    end
+end
+
+def fun_l3_n768(x)
+    if (x < 1)
+        fun_l4_n797(x)
+    else
+        fun_l4_n437(x)
+    end
+end
+
+def fun_l3_n769(x)
+    if (x < 1)
+        fun_l4_n615(x)
+    else
+        fun_l4_n369(x)
+    end
+end
+
+def fun_l3_n770(x)
+    if (x < 1)
+        fun_l4_n779(x)
+    else
+        fun_l4_n194(x)
+    end
+end
+
+def fun_l3_n771(x)
+    if (x < 1)
+        fun_l4_n287(x)
+    else
+        fun_l4_n819(x)
+    end
+end
+
+def fun_l3_n772(x)
+    if (x < 1)
+        fun_l4_n405(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n773(x)
+    if (x < 1)
+        fun_l4_n706(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n774(x)
+    if (x < 1)
+        fun_l4_n690(x)
+    else
+        fun_l4_n841(x)
+    end
+end
+
+def fun_l3_n775(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n776(x)
+    if (x < 1)
+        fun_l4_n342(x)
+    else
+        fun_l4_n359(x)
+    end
+end
+
+def fun_l3_n777(x)
+    if (x < 1)
+        fun_l4_n371(x)
+    else
+        fun_l4_n680(x)
+    end
+end
+
+def fun_l3_n778(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n343(x)
+    end
+end
+
+def fun_l3_n779(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n893(x)
+    end
+end
+
+def fun_l3_n780(x)
+    if (x < 1)
+        fun_l4_n706(x)
+    else
+        fun_l4_n140(x)
+    end
+end
+
+def fun_l3_n781(x)
+    if (x < 1)
+        fun_l4_n349(x)
+    else
+        fun_l4_n317(x)
+    end
+end
+
+def fun_l3_n782(x)
+    if (x < 1)
+        fun_l4_n491(x)
+    else
+        fun_l4_n616(x)
+    end
+end
+
+def fun_l3_n783(x)
+    if (x < 1)
+        fun_l4_n227(x)
+    else
+        fun_l4_n356(x)
+    end
+end
+
+def fun_l3_n784(x)
+    if (x < 1)
+        fun_l4_n387(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n785(x)
+    if (x < 1)
+        fun_l4_n648(x)
+    else
+        fun_l4_n34(x)
+    end
+end
+
+def fun_l3_n786(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n787(x)
+    if (x < 1)
+        fun_l4_n162(x)
+    else
+        fun_l4_n384(x)
+    end
+end
+
+def fun_l3_n788(x)
+    if (x < 1)
+        fun_l4_n221(x)
+    else
+        fun_l4_n617(x)
+    end
+end
+
+def fun_l3_n789(x)
+    if (x < 1)
+        fun_l4_n670(x)
+    else
+        fun_l4_n350(x)
+    end
+end
+
+def fun_l3_n790(x)
+    if (x < 1)
+        fun_l4_n202(x)
+    else
+        fun_l4_n112(x)
+    end
+end
+
+def fun_l3_n791(x)
+    if (x < 1)
+        fun_l4_n390(x)
+    else
+        fun_l4_n868(x)
+    end
+end
+
+def fun_l3_n792(x)
+    if (x < 1)
+        fun_l4_n746(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n793(x)
+    if (x < 1)
+        fun_l4_n471(x)
+    else
+        fun_l4_n60(x)
+    end
+end
+
+def fun_l3_n794(x)
+    if (x < 1)
+        fun_l4_n583(x)
+    else
+        fun_l4_n470(x)
+    end
+end
+
+def fun_l3_n795(x)
+    if (x < 1)
+        fun_l4_n567(x)
+    else
+        fun_l4_n218(x)
+    end
+end
+
+def fun_l3_n796(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n797(x)
+    if (x < 1)
+        fun_l4_n190(x)
+    else
+        fun_l4_n437(x)
+    end
+end
+
+def fun_l3_n798(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n843(x)
+    end
+end
+
+def fun_l3_n799(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n354(x)
+    end
+end
+
+def fun_l3_n800(x)
+    if (x < 1)
+        fun_l4_n711(x)
+    else
+        fun_l4_n606(x)
+    end
+end
+
+def fun_l3_n801(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n464(x)
+    end
+end
+
+def fun_l3_n802(x)
+    if (x < 1)
+        fun_l4_n143(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n803(x)
+    if (x < 1)
+        fun_l4_n223(x)
+    else
+        fun_l4_n293(x)
+    end
+end
+
+def fun_l3_n804(x)
+    if (x < 1)
+        fun_l4_n832(x)
+    else
+        fun_l4_n632(x)
+    end
+end
+
+def fun_l3_n805(x)
+    if (x < 1)
+        fun_l4_n649(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n806(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n807(x)
+    if (x < 1)
+        fun_l4_n257(x)
+    else
+        fun_l4_n712(x)
+    end
+end
+
+def fun_l3_n808(x)
+    if (x < 1)
+        fun_l4_n632(x)
+    else
+        fun_l4_n563(x)
+    end
+end
+
+def fun_l3_n809(x)
+    if (x < 1)
+        fun_l4_n154(x)
+    else
+        fun_l4_n561(x)
+    end
+end
+
+def fun_l3_n810(x)
+    if (x < 1)
+        fun_l4_n411(x)
+    else
+        fun_l4_n42(x)
+    end
+end
+
+def fun_l3_n811(x)
+    if (x < 1)
+        fun_l4_n560(x)
+    else
+        fun_l4_n531(x)
+    end
+end
+
+def fun_l3_n812(x)
+    if (x < 1)
+        fun_l4_n759(x)
+    else
+        fun_l4_n588(x)
+    end
+end
+
+def fun_l3_n813(x)
+    if (x < 1)
+        fun_l4_n311(x)
+    else
+        fun_l4_n813(x)
+    end
+end
+
+def fun_l3_n814(x)
+    if (x < 1)
+        fun_l4_n521(x)
+    else
+        fun_l4_n877(x)
+    end
+end
+
+def fun_l3_n815(x)
+    if (x < 1)
+        fun_l4_n578(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n816(x)
+    if (x < 1)
+        fun_l4_n337(x)
+    else
+        fun_l4_n562(x)
+    end
+end
+
+def fun_l3_n817(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n818(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n819(x)
+    if (x < 1)
+        fun_l4_n718(x)
+    else
+        fun_l4_n463(x)
+    end
+end
+
+def fun_l3_n820(x)
+    if (x < 1)
+        fun_l4_n780(x)
+    else
+        fun_l4_n103(x)
+    end
+end
+
+def fun_l3_n821(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n331(x)
+    end
+end
+
+def fun_l3_n822(x)
+    if (x < 1)
+        fun_l4_n84(x)
+    else
+        fun_l4_n176(x)
+    end
+end
+
+def fun_l3_n823(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n824(x)
+    if (x < 1)
+        fun_l4_n675(x)
+    else
+        fun_l4_n837(x)
+    end
+end
+
+def fun_l3_n825(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n826(x)
+    if (x < 1)
+        fun_l4_n268(x)
+    else
+        fun_l4_n908(x)
+    end
+end
+
+def fun_l3_n827(x)
+    if (x < 1)
+        fun_l4_n959(x)
+    else
+        fun_l4_n643(x)
+    end
+end
+
+def fun_l3_n828(x)
+    if (x < 1)
+        fun_l4_n290(x)
+    else
+        fun_l4_n718(x)
+    end
+end
+
+def fun_l3_n829(x)
+    if (x < 1)
+        fun_l4_n430(x)
+    else
+        fun_l4_n114(x)
+    end
+end
+
+def fun_l3_n830(x)
+    if (x < 1)
+        fun_l4_n817(x)
+    else
+        fun_l4_n296(x)
+    end
+end
+
+def fun_l3_n831(x)
+    if (x < 1)
+        fun_l4_n586(x)
+    else
+        fun_l4_n345(x)
+    end
+end
+
+def fun_l3_n832(x)
+    if (x < 1)
+        fun_l4_n321(x)
+    else
+        fun_l4_n805(x)
+    end
+end
+
+def fun_l3_n833(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n373(x)
+    end
+end
+
+def fun_l3_n834(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n835(x)
+    if (x < 1)
+        fun_l4_n761(x)
+    else
+        fun_l4_n295(x)
+    end
+end
+
+def fun_l3_n836(x)
+    if (x < 1)
+        fun_l4_n169(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n837(x)
+    if (x < 1)
+        fun_l4_n482(x)
+    else
+        fun_l4_n127(x)
+    end
+end
+
+def fun_l3_n838(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n662(x)
+    end
+end
+
+def fun_l3_n839(x)
+    if (x < 1)
+        fun_l4_n548(x)
+    else
+        fun_l4_n197(x)
+    end
+end
+
+def fun_l3_n840(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n17(x)
+    end
+end
+
+def fun_l3_n841(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n447(x)
+    end
+end
+
+def fun_l3_n842(x)
+    if (x < 1)
+        fun_l4_n66(x)
+    else
+        fun_l4_n110(x)
+    end
+end
+
+def fun_l3_n843(x)
+    if (x < 1)
+        fun_l4_n574(x)
+    else
+        fun_l4_n887(x)
+    end
+end
+
+def fun_l3_n844(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n845(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n903(x)
+    end
+end
+
+def fun_l3_n846(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n238(x)
+    end
+end
+
+def fun_l3_n847(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n924(x)
+    end
+end
+
+def fun_l3_n848(x)
+    if (x < 1)
+        fun_l4_n697(x)
+    else
+        fun_l4_n157(x)
+    end
+end
+
+def fun_l3_n849(x)
+    if (x < 1)
+        fun_l4_n608(x)
+    else
+        fun_l4_n426(x)
+    end
+end
+
+def fun_l3_n850(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n360(x)
+    end
+end
+
+def fun_l3_n851(x)
+    if (x < 1)
+        fun_l4_n558(x)
+    else
+        fun_l4_n152(x)
+    end
+end
+
+def fun_l3_n852(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n853(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n251(x)
+    end
+end
+
+def fun_l3_n854(x)
+    if (x < 1)
+        fun_l4_n131(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n855(x)
+    if (x < 1)
+        fun_l4_n493(x)
+    else
+        fun_l4_n631(x)
+    end
+end
+
+def fun_l3_n856(x)
+    if (x < 1)
+        fun_l4_n608(x)
+    else
+        fun_l4_n556(x)
+    end
+end
+
+def fun_l3_n857(x)
+    if (x < 1)
+        fun_l4_n808(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n858(x)
+    if (x < 1)
+        fun_l4_n407(x)
+    else
+        fun_l4_n648(x)
+    end
+end
+
+def fun_l3_n859(x)
+    if (x < 1)
+        fun_l4_n217(x)
+    else
+        fun_l4_n763(x)
+    end
+end
+
+def fun_l3_n860(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n159(x)
+    end
+end
+
+def fun_l3_n861(x)
+    if (x < 1)
+        fun_l4_n364(x)
+    else
+        fun_l4_n241(x)
+    end
+end
+
+def fun_l3_n862(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n729(x)
+    end
+end
+
+def fun_l3_n863(x)
+    if (x < 1)
+        fun_l4_n137(x)
+    else
+        fun_l4_n317(x)
+    end
+end
+
+def fun_l3_n864(x)
+    if (x < 1)
+        fun_l4_n818(x)
+    else
+        fun_l4_n782(x)
+    end
+end
+
+def fun_l3_n865(x)
+    if (x < 1)
+        fun_l4_n577(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n866(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n7(x)
+    end
+end
+
+def fun_l3_n867(x)
+    if (x < 1)
+        fun_l4_n238(x)
+    else
+        fun_l4_n944(x)
+    end
+end
+
+def fun_l3_n868(x)
+    if (x < 1)
+        fun_l4_n105(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n869(x)
+    if (x < 1)
+        fun_l4_n841(x)
+    else
+        fun_l4_n262(x)
+    end
+end
+
+def fun_l3_n870(x)
+    if (x < 1)
+        fun_l4_n32(x)
+    else
+        fun_l4_n992(x)
+    end
+end
+
+def fun_l3_n871(x)
+    if (x < 1)
+        fun_l4_n431(x)
+    else
+        fun_l4_n391(x)
+    end
+end
+
+def fun_l3_n872(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n879(x)
+    end
+end
+
+def fun_l3_n873(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n657(x)
+    end
+end
+
+def fun_l3_n874(x)
+    if (x < 1)
+        fun_l4_n529(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n875(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n876(x)
+    if (x < 1)
+        fun_l4_n388(x)
+    else
+        fun_l4_n949(x)
+    end
+end
+
+def fun_l3_n877(x)
+    if (x < 1)
+        fun_l4_n826(x)
+    else
+        fun_l4_n560(x)
+    end
+end
+
+def fun_l3_n878(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n122(x)
+    end
+end
+
+def fun_l3_n879(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n793(x)
+    end
+end
+
+def fun_l3_n880(x)
+    if (x < 1)
+        fun_l4_n141(x)
+    else
+        fun_l4_n132(x)
+    end
+end
+
+def fun_l3_n881(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n592(x)
+    end
+end
+
+def fun_l3_n882(x)
+    if (x < 1)
+        fun_l4_n585(x)
+    else
+        fun_l4_n341(x)
+    end
+end
+
+def fun_l3_n883(x)
+    if (x < 1)
+        fun_l4_n843(x)
+    else
+        fun_l4_n692(x)
+    end
+end
+
+def fun_l3_n884(x)
+    if (x < 1)
+        fun_l4_n360(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n885(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n886(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n699(x)
+    end
+end
+
+def fun_l3_n887(x)
+    if (x < 1)
+        fun_l4_n71(x)
+    else
+        fun_l4_n256(x)
+    end
+end
+
+def fun_l3_n888(x)
+    if (x < 1)
+        fun_l4_n406(x)
+    else
+        fun_l4_n493(x)
+    end
+end
+
+def fun_l3_n889(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n874(x)
+    end
+end
+
+def fun_l3_n890(x)
+    if (x < 1)
+        fun_l4_n365(x)
+    else
+        fun_l4_n910(x)
+    end
+end
+
+def fun_l3_n891(x)
+    if (x < 1)
+        fun_l4_n262(x)
+    else
+        fun_l4_n665(x)
+    end
+end
+
+def fun_l3_n892(x)
+    if (x < 1)
+        fun_l4_n274(x)
+    else
+        fun_l4_n849(x)
+    end
+end
+
+def fun_l3_n893(x)
+    if (x < 1)
+        fun_l4_n880(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n894(x)
+    if (x < 1)
+        fun_l4_n504(x)
+    else
+        fun_l4_n128(x)
+    end
+end
+
+def fun_l3_n895(x)
+    if (x < 1)
+        fun_l4_n555(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n896(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n225(x)
+    end
+end
+
+def fun_l3_n897(x)
+    if (x < 1)
+        fun_l4_n38(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n898(x)
+    if (x < 1)
+        fun_l4_n944(x)
+    else
+        fun_l4_n217(x)
+    end
+end
+
+def fun_l3_n899(x)
+    if (x < 1)
+        fun_l4_n967(x)
+    else
+        fun_l4_n853(x)
+    end
+end
+
+def fun_l3_n900(x)
+    if (x < 1)
+        fun_l4_n686(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n901(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n842(x)
+    end
+end
+
+def fun_l3_n902(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n701(x)
+    end
+end
+
+def fun_l3_n903(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n321(x)
+    end
+end
+
+def fun_l3_n904(x)
+    if (x < 1)
+        fun_l4_n504(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n905(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n57(x)
+    end
+end
+
+def fun_l3_n906(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n912(x)
+    end
+end
+
+def fun_l3_n907(x)
+    if (x < 1)
+        fun_l4_n962(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n908(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n14(x)
+    end
+end
+
+def fun_l3_n909(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n763(x)
+    end
+end
+
+def fun_l3_n910(x)
+    if (x < 1)
+        fun_l4_n859(x)
+    else
+        fun_l4_n243(x)
+    end
+end
+
+def fun_l3_n911(x)
+    if (x < 1)
+        fun_l4_n153(x)
+    else
+        fun_l4_n136(x)
+    end
+end
+
+def fun_l3_n912(x)
+    if (x < 1)
+        fun_l4_n325(x)
+    else
+        fun_l4_n113(x)
+    end
+end
+
+def fun_l3_n913(x)
+    if (x < 1)
+        fun_l4_n625(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n914(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n88(x)
+    end
+end
+
+def fun_l3_n915(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n3(x)
+    end
+end
+
+def fun_l3_n916(x)
+    if (x < 1)
+        fun_l4_n748(x)
+    else
+        fun_l4_n21(x)
+    end
+end
+
+def fun_l3_n917(x)
+    if (x < 1)
+        fun_l4_n132(x)
+    else
+        fun_l4_n132(x)
+    end
+end
+
+def fun_l3_n918(x)
+    if (x < 1)
+        fun_l4_n295(x)
+    else
+        fun_l4_n429(x)
+    end
+end
+
+def fun_l3_n919(x)
+    if (x < 1)
+        fun_l4_n105(x)
+    else
+        fun_l4_n984(x)
+    end
+end
+
+def fun_l3_n920(x)
+    if (x < 1)
+        fun_l4_n319(x)
+    else
+        fun_l4_n304(x)
+    end
+end
+
+def fun_l3_n921(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n639(x)
+    end
+end
+
+def fun_l3_n922(x)
+    if (x < 1)
+        fun_l4_n678(x)
+    else
+        fun_l4_n209(x)
+    end
+end
+
+def fun_l3_n923(x)
+    if (x < 1)
+        fun_l4_n755(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n924(x)
+    if (x < 1)
+        fun_l4_n311(x)
+    else
+        fun_l4_n272(x)
+    end
+end
+
+def fun_l3_n925(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n896(x)
+    end
+end
+
+def fun_l3_n926(x)
+    if (x < 1)
+        fun_l4_n994(x)
+    else
+        fun_l4_n671(x)
+    end
+end
+
+def fun_l3_n927(x)
+    if (x < 1)
+        fun_l4_n125(x)
+    else
+        fun_l4_n852(x)
+    end
+end
+
+def fun_l3_n928(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n350(x)
+    end
+end
+
+def fun_l3_n929(x)
+    if (x < 1)
+        fun_l4_n622(x)
+    else
+        fun_l4_n511(x)
+    end
+end
+
+def fun_l3_n930(x)
+    if (x < 1)
+        fun_l4_n134(x)
+    else
+        fun_l4_n288(x)
+    end
+end
+
+def fun_l3_n931(x)
+    if (x < 1)
+        fun_l4_n278(x)
+    else
+        fun_l4_n800(x)
+    end
+end
+
+def fun_l3_n932(x)
+    if (x < 1)
+        fun_l4_n139(x)
+    else
+        fun_l4_n966(x)
+    end
+end
+
+def fun_l3_n933(x)
+    if (x < 1)
+        fun_l4_n275(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n934(x)
+    if (x < 1)
+        fun_l4_n503(x)
+    else
+        fun_l4_n204(x)
+    end
+end
+
+def fun_l3_n935(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n126(x)
+    end
+end
+
+def fun_l3_n936(x)
+    if (x < 1)
+        fun_l4_n704(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n937(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n722(x)
+    end
+end
+
+def fun_l3_n938(x)
+    if (x < 1)
+        fun_l4_n937(x)
+    else
+        fun_l4_n195(x)
+    end
+end
+
+def fun_l3_n939(x)
+    if (x < 1)
+        fun_l4_n661(x)
+    else
+        fun_l4_n265(x)
+    end
+end
+
+def fun_l3_n940(x)
+    if (x < 1)
+        fun_l4_n423(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n941(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n942(x)
+    if (x < 1)
+        fun_l4_n501(x)
+    else
+        fun_l4_n816(x)
+    end
+end
+
+def fun_l3_n943(x)
+    if (x < 1)
+        fun_l4_n650(x)
+    else
+        fun_l4_n925(x)
+    end
+end
+
+def fun_l3_n944(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n647(x)
+    end
+end
+
+def fun_l3_n945(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n791(x)
+    end
+end
+
+def fun_l3_n946(x)
+    if (x < 1)
+        fun_l4_n551(x)
+    else
+        fun_l4_n104(x)
+    end
+end
+
+def fun_l3_n947(x)
+    if (x < 1)
+        fun_l4_n927(x)
+    else
+        fun_l4_n213(x)
+    end
+end
+
+def fun_l3_n948(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n609(x)
+    end
+end
+
+def fun_l3_n949(x)
+    if (x < 1)
+        fun_l4_n302(x)
+    else
+        fun_l4_n157(x)
+    end
+end
+
+def fun_l3_n950(x)
+    if (x < 1)
+        fun_l4_n955(x)
+    else
+        fun_l4_n492(x)
+    end
+end
+
+def fun_l3_n951(x)
+    if (x < 1)
+        fun_l4_n486(x)
+    else
+        fun_l4_n412(x)
+    end
+end
+
+def fun_l3_n952(x)
+    if (x < 1)
+        fun_l4_n850(x)
+    else
+        fun_l4_n885(x)
+    end
+end
+
+def fun_l3_n953(x)
+    if (x < 1)
+        fun_l4_n84(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n954(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n67(x)
+    end
+end
+
+def fun_l3_n955(x)
+    if (x < 1)
+        fun_l4_n347(x)
+    else
+        fun_l4_n757(x)
+    end
+end
+
+def fun_l3_n956(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n10(x)
+    end
+end
+
+def fun_l3_n957(x)
+    if (x < 1)
+        fun_l4_n393(x)
+    else
+        fun_l4_n482(x)
+    end
+end
+
+def fun_l3_n958(x)
+    if (x < 1)
+        fun_l4_n0(x)
+    else
+        fun_l4_n556(x)
+    end
+end
+
+def fun_l3_n959(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n960(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n843(x)
+    end
+end
+
+def fun_l3_n961(x)
+    if (x < 1)
+        fun_l4_n508(x)
+    else
+        fun_l4_n874(x)
+    end
+end
+
+def fun_l3_n962(x)
+    if (x < 1)
+        fun_l4_n15(x)
+    else
+        fun_l4_n197(x)
+    end
+end
+
+def fun_l3_n963(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n380(x)
+    end
+end
+
+def fun_l3_n964(x)
+    if (x < 1)
+        fun_l4_n315(x)
+    else
+        fun_l4_n196(x)
+    end
+end
+
+def fun_l3_n965(x)
+    if (x < 1)
+        fun_l4_n510(x)
+    else
+        fun_l4_n275(x)
+    end
+end
+
+def fun_l3_n966(x)
+    if (x < 1)
+        fun_l4_n725(x)
+    else
+        fun_l4_n94(x)
+    end
+end
+
+def fun_l3_n967(x)
+    if (x < 1)
+        fun_l4_n733(x)
+    else
+        fun_l4_n577(x)
+    end
+end
+
+def fun_l3_n968(x)
+    if (x < 1)
+        fun_l4_n280(x)
+    else
+        fun_l4_n702(x)
+    end
+end
+
+def fun_l3_n969(x)
+    if (x < 1)
+        fun_l4_n41(x)
+    else
+        fun_l4_n343(x)
+    end
+end
+
+def fun_l3_n970(x)
+    if (x < 1)
+        fun_l4_n102(x)
+    else
+        fun_l4_n785(x)
+    end
+end
+
+def fun_l3_n971(x)
+    if (x < 1)
+        fun_l4_n460(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n972(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n421(x)
+    end
+end
+
+def fun_l3_n973(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n401(x)
+    end
+end
+
+def fun_l3_n974(x)
+    if (x < 1)
+        fun_l4_n593(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n975(x)
+    if (x < 1)
+        fun_l4_n12(x)
+    else
+        fun_l4_n929(x)
+    end
+end
+
+def fun_l3_n976(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n402(x)
+    end
+end
+
+def fun_l3_n977(x)
+    if (x < 1)
+        fun_l4_n590(x)
+    else
+        fun_l4_n876(x)
+    end
+end
+
+def fun_l3_n978(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n94(x)
+    end
+end
+
+def fun_l3_n979(x)
+    if (x < 1)
+        fun_l4_n625(x)
+    else
+        fun_l4_n344(x)
+    end
+end
+
+def fun_l3_n980(x)
+    if (x < 1)
+        fun_l4_n128(x)
+    else
+        fun_l4_n454(x)
+    end
+end
+
+def fun_l3_n981(x)
+    if (x < 1)
+        fun_l4_n937(x)
+    else
+        fun_l4_n277(x)
+    end
+end
+
+def fun_l3_n982(x)
+    if (x < 1)
+        fun_l4_n237(x)
+    else
+        fun_l4_n113(x)
+    end
+end
+
+def fun_l3_n983(x)
+    if (x < 1)
+        fun_l4_n668(x)
+    else
+        fun_l4_n668(x)
+    end
+end
+
+def fun_l3_n984(x)
+    if (x < 1)
+        fun_l4_n783(x)
+    else
+        fun_l4_n771(x)
+    end
+end
+
+def fun_l3_n985(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n986(x)
+    if (x < 1)
+        fun_l4_n29(x)
+    else
+        fun_l4_n313(x)
+    end
+end
+
+def fun_l3_n987(x)
+    if (x < 1)
+        fun_l4_n765(x)
+    else
+        fun_l4_n885(x)
+    end
+end
+
+def fun_l3_n988(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n989(x)
+    if (x < 1)
+        fun_l4_n916(x)
+    else
+        fun_l4_n518(x)
+    end
+end
+
+def fun_l3_n990(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n468(x)
+    end
+end
+
+def fun_l3_n991(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n601(x)
+    end
+end
+
+def fun_l3_n992(x)
+    if (x < 1)
+        fun_l4_n437(x)
+    else
+        fun_l4_n77(x)
+    end
+end
+
+def fun_l3_n993(x)
+    if (x < 1)
+        fun_l4_n957(x)
+    else
+        fun_l4_n619(x)
+    end
+end
+
+def fun_l3_n994(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n108(x)
+    end
+end
+
+def fun_l3_n995(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n428(x)
+    end
+end
+
+def fun_l3_n996(x)
+    if (x < 1)
+        fun_l4_n53(x)
+    else
+        fun_l4_n278(x)
+    end
+end
+
+def fun_l3_n997(x)
+    if (x < 1)
+        fun_l4_n930(x)
+    else
+        fun_l4_n671(x)
+    end
+end
+
+def fun_l3_n998(x)
+    if (x < 1)
+        fun_l4_n574(x)
+    else
+        fun_l4_n879(x)
+    end
+end
+
+def fun_l3_n999(x)
+    if (x < 1)
+        fun_l4_n316(x)
+    else
+        fun_l4_n93(x)
+    end
+end
+
+def fun_l4_n0(x)
+    if (x < 1)
+        fun_l5_n524(x)
+    else
+        fun_l5_n284(x)
+    end
+end
+
+def fun_l4_n1(x)
+    if (x < 1)
+        fun_l5_n845(x)
+    else
+        fun_l5_n863(x)
+    end
+end
+
+def fun_l4_n2(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n860(x)
+    end
+end
+
+def fun_l4_n3(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n4(x)
+    if (x < 1)
+        fun_l5_n833(x)
+    else
+        fun_l5_n807(x)
+    end
+end
+
+def fun_l4_n5(x)
+    if (x < 1)
+        fun_l5_n890(x)
+    else
+        fun_l5_n669(x)
+    end
+end
+
+def fun_l4_n6(x)
+    if (x < 1)
+        fun_l5_n396(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n7(x)
+    if (x < 1)
+        fun_l5_n926(x)
+    else
+        fun_l5_n661(x)
+    end
+end
+
+def fun_l4_n8(x)
+    if (x < 1)
+        fun_l5_n990(x)
+    else
+        fun_l5_n765(x)
+    end
+end
+
+def fun_l4_n9(x)
+    if (x < 1)
+        fun_l5_n978(x)
+    else
+        fun_l5_n342(x)
+    end
+end
+
+def fun_l4_n10(x)
+    if (x < 1)
+        fun_l5_n500(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n11(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n796(x)
+    end
+end
+
+def fun_l4_n12(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n13(x)
+    if (x < 1)
+        fun_l5_n852(x)
+    else
+        fun_l5_n93(x)
+    end
+end
+
+def fun_l4_n14(x)
+    if (x < 1)
+        fun_l5_n526(x)
+    else
+        fun_l5_n144(x)
+    end
+end
+
+def fun_l4_n15(x)
+    if (x < 1)
+        fun_l5_n398(x)
+    else
+        fun_l5_n632(x)
+    end
+end
+
+def fun_l4_n16(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n716(x)
+    end
+end
+
+def fun_l4_n17(x)
+    if (x < 1)
+        fun_l5_n412(x)
+    else
+        fun_l5_n95(x)
+    end
+end
+
+def fun_l4_n18(x)
+    if (x < 1)
+        fun_l5_n446(x)
+    else
+        fun_l5_n885(x)
+    end
+end
+
+def fun_l4_n19(x)
+    if (x < 1)
+        fun_l5_n420(x)
+    else
+        fun_l5_n420(x)
+    end
+end
+
+def fun_l4_n20(x)
+    if (x < 1)
+        fun_l5_n274(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n21(x)
+    if (x < 1)
+        fun_l5_n174(x)
+    else
+        fun_l5_n781(x)
+    end
+end
+
+def fun_l4_n22(x)
+    if (x < 1)
+        fun_l5_n903(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n23(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n900(x)
+    end
+end
+
+def fun_l4_n24(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n515(x)
+    end
+end
+
+def fun_l4_n25(x)
+    if (x < 1)
+        fun_l5_n151(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n26(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n27(x)
+    if (x < 1)
+        fun_l5_n985(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n28(x)
+    if (x < 1)
+        fun_l5_n961(x)
+    else
+        fun_l5_n86(x)
+    end
+end
+
+def fun_l4_n29(x)
+    if (x < 1)
+        fun_l5_n359(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n30(x)
+    if (x < 1)
+        fun_l5_n426(x)
+    else
+        fun_l5_n983(x)
+    end
+end
+
+def fun_l4_n31(x)
+    if (x < 1)
+        fun_l5_n996(x)
+    else
+        fun_l5_n343(x)
+    end
+end
+
+def fun_l4_n32(x)
+    if (x < 1)
+        fun_l5_n300(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n33(x)
+    if (x < 1)
+        fun_l5_n755(x)
+    else
+        fun_l5_n623(x)
+    end
+end
+
+def fun_l4_n34(x)
+    if (x < 1)
+        fun_l5_n681(x)
+    else
+        fun_l5_n410(x)
+    end
+end
+
+def fun_l4_n35(x)
+    if (x < 1)
+        fun_l5_n356(x)
+    else
+        fun_l5_n351(x)
+    end
+end
+
+def fun_l4_n36(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n402(x)
+    end
+end
+
+def fun_l4_n37(x)
+    if (x < 1)
+        fun_l5_n250(x)
+    else
+        fun_l5_n681(x)
+    end
+end
+
+def fun_l4_n38(x)
+    if (x < 1)
+        fun_l5_n573(x)
+    else
+        fun_l5_n622(x)
+    end
+end
+
+def fun_l4_n39(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n210(x)
+    end
+end
+
+def fun_l4_n40(x)
+    if (x < 1)
+        fun_l5_n264(x)
+    else
+        fun_l5_n239(x)
+    end
+end
+
+def fun_l4_n41(x)
+    if (x < 1)
+        fun_l5_n635(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n42(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n125(x)
+    end
+end
+
+def fun_l4_n43(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n625(x)
+    end
+end
+
+def fun_l4_n44(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n465(x)
+    end
+end
+
+def fun_l4_n45(x)
+    if (x < 1)
+        fun_l5_n999(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n46(x)
+    if (x < 1)
+        fun_l5_n866(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n47(x)
+    if (x < 1)
+        fun_l5_n328(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n48(x)
+    if (x < 1)
+        fun_l5_n902(x)
+    else
+        fun_l5_n919(x)
+    end
+end
+
+def fun_l4_n49(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n262(x)
+    end
+end
+
+def fun_l4_n50(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n731(x)
+    end
+end
+
+def fun_l4_n51(x)
+    if (x < 1)
+        fun_l5_n502(x)
+    else
+        fun_l5_n149(x)
+    end
+end
+
+def fun_l4_n52(x)
+    if (x < 1)
+        fun_l5_n69(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n53(x)
+    if (x < 1)
+        fun_l5_n932(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n54(x)
+    if (x < 1)
+        fun_l5_n982(x)
+    else
+        fun_l5_n207(x)
+    end
+end
+
+def fun_l4_n55(x)
+    if (x < 1)
+        fun_l5_n949(x)
+    else
+        fun_l5_n9(x)
+    end
+end
+
+def fun_l4_n56(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n924(x)
+    end
+end
+
+def fun_l4_n57(x)
+    if (x < 1)
+        fun_l5_n757(x)
+    else
+        fun_l5_n609(x)
+    end
+end
+
+def fun_l4_n58(x)
+    if (x < 1)
+        fun_l5_n251(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n59(x)
+    if (x < 1)
+        fun_l5_n878(x)
+    else
+        fun_l5_n626(x)
+    end
+end
+
+def fun_l4_n60(x)
+    if (x < 1)
+        fun_l5_n859(x)
+    else
+        fun_l5_n646(x)
+    end
+end
+
+def fun_l4_n61(x)
+    if (x < 1)
+        fun_l5_n417(x)
+    else
+        fun_l5_n587(x)
+    end
+end
+
+def fun_l4_n62(x)
+    if (x < 1)
+        fun_l5_n164(x)
+    else
+        fun_l5_n861(x)
+    end
+end
+
+def fun_l4_n63(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n79(x)
+    end
+end
+
+def fun_l4_n64(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n336(x)
+    end
+end
+
+def fun_l4_n65(x)
+    if (x < 1)
+        fun_l5_n420(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n66(x)
+    if (x < 1)
+        fun_l5_n61(x)
+    else
+        fun_l5_n690(x)
+    end
+end
+
+def fun_l4_n67(x)
+    if (x < 1)
+        fun_l5_n939(x)
+    else
+        fun_l5_n139(x)
+    end
+end
+
+def fun_l4_n68(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n625(x)
+    end
+end
+
+def fun_l4_n69(x)
+    if (x < 1)
+        fun_l5_n532(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n70(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n886(x)
+    end
+end
+
+def fun_l4_n71(x)
+    if (x < 1)
+        fun_l5_n554(x)
+    else
+        fun_l5_n898(x)
+    end
+end
+
+def fun_l4_n72(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n690(x)
+    end
+end
+
+def fun_l4_n73(x)
+    if (x < 1)
+        fun_l5_n980(x)
+    else
+        fun_l5_n248(x)
+    end
+end
+
+def fun_l4_n74(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n247(x)
+    end
+end
+
+def fun_l4_n75(x)
+    if (x < 1)
+        fun_l5_n798(x)
+    else
+        fun_l5_n399(x)
+    end
+end
+
+def fun_l4_n76(x)
+    if (x < 1)
+        fun_l5_n419(x)
+    else
+        fun_l5_n754(x)
+    end
+end
+
+def fun_l4_n77(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n78(x)
+    if (x < 1)
+        fun_l5_n695(x)
+    else
+        fun_l5_n336(x)
+    end
+end
+
+def fun_l4_n79(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n627(x)
+    end
+end
+
+def fun_l4_n80(x)
+    if (x < 1)
+        fun_l5_n359(x)
+    else
+        fun_l5_n465(x)
+    end
+end
+
+def fun_l4_n81(x)
+    if (x < 1)
+        fun_l5_n284(x)
+    else
+        fun_l5_n232(x)
+    end
+end
+
+def fun_l4_n82(x)
+    if (x < 1)
+        fun_l5_n947(x)
+    else
+        fun_l5_n748(x)
+    end
+end
+
+def fun_l4_n83(x)
+    if (x < 1)
+        fun_l5_n254(x)
+    else
+        fun_l5_n836(x)
+    end
+end
+
+def fun_l4_n84(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n789(x)
+    end
+end
+
+def fun_l4_n85(x)
+    if (x < 1)
+        fun_l5_n682(x)
+    else
+        fun_l5_n547(x)
+    end
+end
+
+def fun_l4_n86(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n87(x)
+    if (x < 1)
+        fun_l5_n981(x)
+    else
+        fun_l5_n724(x)
+    end
+end
+
+def fun_l4_n88(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n914(x)
+    end
+end
+
+def fun_l4_n89(x)
+    if (x < 1)
+        fun_l5_n844(x)
+    else
+        fun_l5_n668(x)
+    end
+end
+
+def fun_l4_n90(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n415(x)
+    end
+end
+
+def fun_l4_n91(x)
+    if (x < 1)
+        fun_l5_n141(x)
+    else
+        fun_l5_n538(x)
+    end
+end
+
+def fun_l4_n92(x)
+    if (x < 1)
+        fun_l5_n563(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n93(x)
+    if (x < 1)
+        fun_l5_n967(x)
+    else
+        fun_l5_n549(x)
+    end
+end
+
+def fun_l4_n94(x)
+    if (x < 1)
+        fun_l5_n992(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n95(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n980(x)
+    end
+end
+
+def fun_l4_n96(x)
+    if (x < 1)
+        fun_l5_n543(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n97(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n709(x)
+    end
+end
+
+def fun_l4_n98(x)
+    if (x < 1)
+        fun_l5_n233(x)
+    else
+        fun_l5_n963(x)
+    end
+end
+
+def fun_l4_n99(x)
+    if (x < 1)
+        fun_l5_n944(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n100(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n805(x)
+    end
+end
+
+def fun_l4_n101(x)
+    if (x < 1)
+        fun_l5_n125(x)
+    else
+        fun_l5_n729(x)
+    end
+end
+
+def fun_l4_n102(x)
+    if (x < 1)
+        fun_l5_n339(x)
+    else
+        fun_l5_n394(x)
+    end
+end
+
+def fun_l4_n103(x)
+    if (x < 1)
+        fun_l5_n149(x)
+    else
+        fun_l5_n839(x)
+    end
+end
+
+def fun_l4_n104(x)
+    if (x < 1)
+        fun_l5_n750(x)
+    else
+        fun_l5_n514(x)
+    end
+end
+
+def fun_l4_n105(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n251(x)
+    end
+end
+
+def fun_l4_n106(x)
+    if (x < 1)
+        fun_l5_n810(x)
+    else
+        fun_l5_n46(x)
+    end
+end
+
+def fun_l4_n107(x)
+    if (x < 1)
+        fun_l5_n702(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n108(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n109(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n529(x)
+    end
+end
+
+def fun_l4_n110(x)
+    if (x < 1)
+        fun_l5_n193(x)
+    else
+        fun_l5_n210(x)
+    end
+end
+
+def fun_l4_n111(x)
+    if (x < 1)
+        fun_l5_n599(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n112(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n292(x)
+    end
+end
+
+def fun_l4_n113(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n269(x)
+    end
+end
+
+def fun_l4_n114(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n439(x)
+    end
+end
+
+def fun_l4_n115(x)
+    if (x < 1)
+        fun_l5_n580(x)
+    else
+        fun_l5_n656(x)
+    end
+end
+
+def fun_l4_n116(x)
+    if (x < 1)
+        fun_l5_n992(x)
+    else
+        fun_l5_n703(x)
+    end
+end
+
+def fun_l4_n117(x)
+    if (x < 1)
+        fun_l5_n549(x)
+    else
+        fun_l5_n300(x)
+    end
+end
+
+def fun_l4_n118(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n596(x)
+    end
+end
+
+def fun_l4_n119(x)
+    if (x < 1)
+        fun_l5_n236(x)
+    else
+        fun_l5_n84(x)
+    end
+end
+
+def fun_l4_n120(x)
+    if (x < 1)
+        fun_l5_n78(x)
+    else
+        fun_l5_n610(x)
+    end
+end
+
+def fun_l4_n121(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n122(x)
+    if (x < 1)
+        fun_l5_n927(x)
+    else
+        fun_l5_n40(x)
+    end
+end
+
+def fun_l4_n123(x)
+    if (x < 1)
+        fun_l5_n620(x)
+    else
+        fun_l5_n173(x)
+    end
+end
+
+def fun_l4_n124(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n330(x)
+    end
+end
+
+def fun_l4_n125(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n636(x)
+    end
+end
+
+def fun_l4_n126(x)
+    if (x < 1)
+        fun_l5_n401(x)
+    else
+        fun_l5_n747(x)
+    end
+end
+
+def fun_l4_n127(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n128(x)
+    if (x < 1)
+        fun_l5_n449(x)
+    else
+        fun_l5_n619(x)
+    end
+end
+
+def fun_l4_n129(x)
+    if (x < 1)
+        fun_l5_n564(x)
+    else
+        fun_l5_n306(x)
+    end
+end
+
+def fun_l4_n130(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n170(x)
+    end
+end
+
+def fun_l4_n131(x)
+    if (x < 1)
+        fun_l5_n383(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n132(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n54(x)
+    end
+end
+
+def fun_l4_n133(x)
+    if (x < 1)
+        fun_l5_n780(x)
+    else
+        fun_l5_n184(x)
+    end
+end
+
+def fun_l4_n134(x)
+    if (x < 1)
+        fun_l5_n880(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n135(x)
+    if (x < 1)
+        fun_l5_n819(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n136(x)
+    if (x < 1)
+        fun_l5_n301(x)
+    else
+        fun_l5_n676(x)
+    end
+end
+
+def fun_l4_n137(x)
+    if (x < 1)
+        fun_l5_n69(x)
+    else
+        fun_l5_n333(x)
+    end
+end
+
+def fun_l4_n138(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n69(x)
+    end
+end
+
+def fun_l4_n139(x)
+    if (x < 1)
+        fun_l5_n939(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n140(x)
+    if (x < 1)
+        fun_l5_n517(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n141(x)
+    if (x < 1)
+        fun_l5_n923(x)
+    else
+        fun_l5_n968(x)
+    end
+end
+
+def fun_l4_n142(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n841(x)
+    end
+end
+
+def fun_l4_n143(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n715(x)
+    end
+end
+
+def fun_l4_n144(x)
+    if (x < 1)
+        fun_l5_n434(x)
+    else
+        fun_l5_n771(x)
+    end
+end
+
+def fun_l4_n145(x)
+    if (x < 1)
+        fun_l5_n211(x)
+    else
+        fun_l5_n963(x)
+    end
+end
+
+def fun_l4_n146(x)
+    if (x < 1)
+        fun_l5_n534(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n147(x)
+    if (x < 1)
+        fun_l5_n409(x)
+    else
+        fun_l5_n298(x)
+    end
+end
+
+def fun_l4_n148(x)
+    if (x < 1)
+        fun_l5_n447(x)
+    else
+        fun_l5_n474(x)
+    end
+end
+
+def fun_l4_n149(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n150(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n201(x)
+    end
+end
+
+def fun_l4_n151(x)
+    if (x < 1)
+        fun_l5_n539(x)
+    else
+        fun_l5_n855(x)
+    end
+end
+
+def fun_l4_n152(x)
+    if (x < 1)
+        fun_l5_n387(x)
+    else
+        fun_l5_n730(x)
+    end
+end
+
+def fun_l4_n153(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n774(x)
+    end
+end
+
+def fun_l4_n154(x)
+    if (x < 1)
+        fun_l5_n924(x)
+    else
+        fun_l5_n414(x)
+    end
+end
+
+def fun_l4_n155(x)
+    if (x < 1)
+        fun_l5_n110(x)
+    else
+        fun_l5_n669(x)
+    end
+end
+
+def fun_l4_n156(x)
+    if (x < 1)
+        fun_l5_n551(x)
+    else
+        fun_l5_n456(x)
+    end
+end
+
+def fun_l4_n157(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n397(x)
+    end
+end
+
+def fun_l4_n158(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n159(x)
+    if (x < 1)
+        fun_l5_n236(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n160(x)
+    if (x < 1)
+        fun_l5_n820(x)
+    else
+        fun_l5_n146(x)
+    end
+end
+
+def fun_l4_n161(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n162(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n309(x)
+    end
+end
+
+def fun_l4_n163(x)
+    if (x < 1)
+        fun_l5_n201(x)
+    else
+        fun_l5_n728(x)
+    end
+end
+
+def fun_l4_n164(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n156(x)
+    end
+end
+
+def fun_l4_n165(x)
+    if (x < 1)
+        fun_l5_n984(x)
+    else
+        fun_l5_n996(x)
+    end
+end
+
+def fun_l4_n166(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n167(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n168(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n841(x)
+    end
+end
+
+def fun_l4_n169(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n193(x)
+    end
+end
+
+def fun_l4_n170(x)
+    if (x < 1)
+        fun_l5_n638(x)
+    else
+        fun_l5_n252(x)
+    end
+end
+
+def fun_l4_n171(x)
+    if (x < 1)
+        fun_l5_n166(x)
+    else
+        fun_l5_n134(x)
+    end
+end
+
+def fun_l4_n172(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n179(x)
+    end
+end
+
+def fun_l4_n173(x)
+    if (x < 1)
+        fun_l5_n218(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n174(x)
+    if (x < 1)
+        fun_l5_n370(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n175(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n542(x)
+    end
+end
+
+def fun_l4_n176(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n606(x)
+    end
+end
+
+def fun_l4_n177(x)
+    if (x < 1)
+        fun_l5_n316(x)
+    else
+        fun_l5_n92(x)
+    end
+end
+
+def fun_l4_n178(x)
+    if (x < 1)
+        fun_l5_n222(x)
+    else
+        fun_l5_n461(x)
+    end
+end
+
+def fun_l4_n179(x)
+    if (x < 1)
+        fun_l5_n244(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n180(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n905(x)
+    end
+end
+
+def fun_l4_n181(x)
+    if (x < 1)
+        fun_l5_n601(x)
+    else
+        fun_l5_n62(x)
+    end
+end
+
+def fun_l4_n182(x)
+    if (x < 1)
+        fun_l5_n701(x)
+    else
+        fun_l5_n25(x)
+    end
+end
+
+def fun_l4_n183(x)
+    if (x < 1)
+        fun_l5_n361(x)
+    else
+        fun_l5_n433(x)
+    end
+end
+
+def fun_l4_n184(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n302(x)
+    end
+end
+
+def fun_l4_n185(x)
+    if (x < 1)
+        fun_l5_n697(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n186(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n402(x)
+    end
+end
+
+def fun_l4_n187(x)
+    if (x < 1)
+        fun_l5_n38(x)
+    else
+        fun_l5_n818(x)
+    end
+end
+
+def fun_l4_n188(x)
+    if (x < 1)
+        fun_l5_n730(x)
+    else
+        fun_l5_n456(x)
+    end
+end
+
+def fun_l4_n189(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n796(x)
+    end
+end
+
+def fun_l4_n190(x)
+    if (x < 1)
+        fun_l5_n86(x)
+    else
+        fun_l5_n976(x)
+    end
+end
+
+def fun_l4_n191(x)
+    if (x < 1)
+        fun_l5_n267(x)
+    else
+        fun_l5_n497(x)
+    end
+end
+
+def fun_l4_n192(x)
+    if (x < 1)
+        fun_l5_n534(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n193(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n194(x)
+    if (x < 1)
+        fun_l5_n821(x)
+    else
+        fun_l5_n823(x)
+    end
+end
+
+def fun_l4_n195(x)
+    if (x < 1)
+        fun_l5_n936(x)
+    else
+        fun_l5_n490(x)
+    end
+end
+
+def fun_l4_n196(x)
+    if (x < 1)
+        fun_l5_n579(x)
+    else
+        fun_l5_n684(x)
+    end
+end
+
+def fun_l4_n197(x)
+    if (x < 1)
+        fun_l5_n742(x)
+    else
+        fun_l5_n874(x)
+    end
+end
+
+def fun_l4_n198(x)
+    if (x < 1)
+        fun_l5_n904(x)
+    else
+        fun_l5_n394(x)
+    end
+end
+
+def fun_l4_n199(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n200(x)
+    if (x < 1)
+        fun_l5_n332(x)
+    else
+        fun_l5_n803(x)
+    end
+end
+
+def fun_l4_n201(x)
+    if (x < 1)
+        fun_l5_n635(x)
+    else
+        fun_l5_n294(x)
+    end
+end
+
+def fun_l4_n202(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n924(x)
+    end
+end
+
+def fun_l4_n203(x)
+    if (x < 1)
+        fun_l5_n199(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n204(x)
+    if (x < 1)
+        fun_l5_n570(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n205(x)
+    if (x < 1)
+        fun_l5_n344(x)
+    else
+        fun_l5_n713(x)
+    end
+end
+
+def fun_l4_n206(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n40(x)
+    end
+end
+
+def fun_l4_n207(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n208(x)
+    if (x < 1)
+        fun_l5_n995(x)
+    else
+        fun_l5_n147(x)
+    end
+end
+
+def fun_l4_n209(x)
+    if (x < 1)
+        fun_l5_n295(x)
+    else
+        fun_l5_n752(x)
+    end
+end
+
+def fun_l4_n210(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n555(x)
+    end
+end
+
+def fun_l4_n211(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n418(x)
+    end
+end
+
+def fun_l4_n212(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n66(x)
+    end
+end
+
+def fun_l4_n213(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n521(x)
+    end
+end
+
+def fun_l4_n214(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n431(x)
+    end
+end
+
+def fun_l4_n215(x)
+    if (x < 1)
+        fun_l5_n450(x)
+    else
+        fun_l5_n58(x)
+    end
+end
+
+def fun_l4_n216(x)
+    if (x < 1)
+        fun_l5_n576(x)
+    else
+        fun_l5_n675(x)
+    end
+end
+
+def fun_l4_n217(x)
+    if (x < 1)
+        fun_l5_n764(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n218(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n398(x)
+    end
+end
+
+def fun_l4_n219(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n220(x)
+    if (x < 1)
+        fun_l5_n13(x)
+    else
+        fun_l5_n117(x)
+    end
+end
+
+def fun_l4_n221(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n799(x)
+    end
+end
+
+def fun_l4_n222(x)
+    if (x < 1)
+        fun_l5_n692(x)
+    else
+        fun_l5_n99(x)
+    end
+end
+
+def fun_l4_n223(x)
+    if (x < 1)
+        fun_l5_n861(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n224(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n955(x)
+    end
+end
+
+def fun_l4_n225(x)
+    if (x < 1)
+        fun_l5_n305(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n226(x)
+    if (x < 1)
+        fun_l5_n128(x)
+    else
+        fun_l5_n662(x)
+    end
+end
+
+def fun_l4_n227(x)
+    if (x < 1)
+        fun_l5_n858(x)
+    else
+        fun_l5_n323(x)
+    end
+end
+
+def fun_l4_n228(x)
+    if (x < 1)
+        fun_l5_n923(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n229(x)
+    if (x < 1)
+        fun_l5_n486(x)
+    else
+        fun_l5_n603(x)
+    end
+end
+
+def fun_l4_n230(x)
+    if (x < 1)
+        fun_l5_n116(x)
+    else
+        fun_l5_n887(x)
+    end
+end
+
+def fun_l4_n231(x)
+    if (x < 1)
+        fun_l5_n791(x)
+    else
+        fun_l5_n762(x)
+    end
+end
+
+def fun_l4_n232(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n890(x)
+    end
+end
+
+def fun_l4_n233(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n777(x)
+    end
+end
+
+def fun_l4_n234(x)
+    if (x < 1)
+        fun_l5_n458(x)
+    else
+        fun_l5_n379(x)
+    end
+end
+
+def fun_l4_n235(x)
+    if (x < 1)
+        fun_l5_n907(x)
+    else
+        fun_l5_n463(x)
+    end
+end
+
+def fun_l4_n236(x)
+    if (x < 1)
+        fun_l5_n177(x)
+    else
+        fun_l5_n732(x)
+    end
+end
+
+def fun_l4_n237(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n936(x)
+    end
+end
+
+def fun_l4_n238(x)
+    if (x < 1)
+        fun_l5_n757(x)
+    else
+        fun_l5_n733(x)
+    end
+end
+
+def fun_l4_n239(x)
+    if (x < 1)
+        fun_l5_n844(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n240(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n620(x)
+    end
+end
+
+def fun_l4_n241(x)
+    if (x < 1)
+        fun_l5_n722(x)
+    else
+        fun_l5_n779(x)
+    end
+end
+
+def fun_l4_n242(x)
+    if (x < 1)
+        fun_l5_n663(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n243(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n244(x)
+    if (x < 1)
+        fun_l5_n614(x)
+    else
+        fun_l5_n895(x)
+    end
+end
+
+def fun_l4_n245(x)
+    if (x < 1)
+        fun_l5_n459(x)
+    else
+        fun_l5_n193(x)
+    end
+end
+
+def fun_l4_n246(x)
+    if (x < 1)
+        fun_l5_n780(x)
+    else
+        fun_l5_n175(x)
+    end
+end
+
+def fun_l4_n247(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n488(x)
+    end
+end
+
+def fun_l4_n248(x)
+    if (x < 1)
+        fun_l5_n156(x)
+    else
+        fun_l5_n807(x)
+    end
+end
+
+def fun_l4_n249(x)
+    if (x < 1)
+        fun_l5_n862(x)
+    else
+        fun_l5_n537(x)
+    end
+end
+
+def fun_l4_n250(x)
+    if (x < 1)
+        fun_l5_n880(x)
+    else
+        fun_l5_n528(x)
+    end
+end
+
+def fun_l4_n251(x)
+    if (x < 1)
+        fun_l5_n163(x)
+    else
+        fun_l5_n94(x)
+    end
+end
+
+def fun_l4_n252(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n582(x)
+    end
+end
+
+def fun_l4_n253(x)
+    if (x < 1)
+        fun_l5_n368(x)
+    else
+        fun_l5_n584(x)
+    end
+end
+
+def fun_l4_n254(x)
+    if (x < 1)
+        fun_l5_n566(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n255(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n0(x)
+    end
+end
+
+def fun_l4_n256(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n469(x)
+    end
+end
+
+def fun_l4_n257(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n961(x)
+    end
+end
+
+def fun_l4_n258(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n893(x)
+    end
+end
+
+def fun_l4_n259(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n630(x)
+    end
+end
+
+def fun_l4_n260(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n715(x)
+    end
+end
+
+def fun_l4_n261(x)
+    if (x < 1)
+        fun_l5_n423(x)
+    else
+        fun_l5_n910(x)
+    end
+end
+
+def fun_l4_n262(x)
+    if (x < 1)
+        fun_l5_n505(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n263(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n236(x)
+    end
+end
+
+def fun_l4_n264(x)
+    if (x < 1)
+        fun_l5_n140(x)
+    else
+        fun_l5_n295(x)
+    end
+end
+
+def fun_l4_n265(x)
+    if (x < 1)
+        fun_l5_n554(x)
+    else
+        fun_l5_n88(x)
+    end
+end
+
+def fun_l4_n266(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n307(x)
+    end
+end
+
+def fun_l4_n267(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n960(x)
+    end
+end
+
+def fun_l4_n268(x)
+    if (x < 1)
+        fun_l5_n322(x)
+    else
+        fun_l5_n264(x)
+    end
+end
+
+def fun_l4_n269(x)
+    if (x < 1)
+        fun_l5_n823(x)
+    else
+        fun_l5_n374(x)
+    end
+end
+
+def fun_l4_n270(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n918(x)
+    end
+end
+
+def fun_l4_n271(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n45(x)
+    end
+end
+
+def fun_l4_n272(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n836(x)
+    end
+end
+
+def fun_l4_n273(x)
+    if (x < 1)
+        fun_l5_n13(x)
+    else
+        fun_l5_n676(x)
+    end
+end
+
+def fun_l4_n274(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n180(x)
+    end
+end
+
+def fun_l4_n275(x)
+    if (x < 1)
+        fun_l5_n901(x)
+    else
+        fun_l5_n101(x)
+    end
+end
+
+def fun_l4_n276(x)
+    if (x < 1)
+        fun_l5_n289(x)
+    else
+        fun_l5_n238(x)
+    end
+end
+
+def fun_l4_n277(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n887(x)
+    end
+end
+
+def fun_l4_n278(x)
+    if (x < 1)
+        fun_l5_n799(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n279(x)
+    if (x < 1)
+        fun_l5_n628(x)
+    else
+        fun_l5_n373(x)
+    end
+end
+
+def fun_l4_n280(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n826(x)
+    end
+end
+
+def fun_l4_n281(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n409(x)
+    end
+end
+
+def fun_l4_n282(x)
+    if (x < 1)
+        fun_l5_n721(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n283(x)
+    if (x < 1)
+        fun_l5_n729(x)
+    else
+        fun_l5_n901(x)
+    end
+end
+
+def fun_l4_n284(x)
+    if (x < 1)
+        fun_l5_n17(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n285(x)
+    if (x < 1)
+        fun_l5_n166(x)
+    else
+        fun_l5_n53(x)
+    end
+end
+
+def fun_l4_n286(x)
+    if (x < 1)
+        fun_l5_n873(x)
+    else
+        fun_l5_n383(x)
+    end
+end
+
+def fun_l4_n287(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n49(x)
+    end
+end
+
+def fun_l4_n288(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n289(x)
+    if (x < 1)
+        fun_l5_n651(x)
+    else
+        fun_l5_n606(x)
+    end
+end
+
+def fun_l4_n290(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n444(x)
+    end
+end
+
+def fun_l4_n291(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n195(x)
+    end
+end
+
+def fun_l4_n292(x)
+    if (x < 1)
+        fun_l5_n20(x)
+    else
+        fun_l5_n58(x)
+    end
+end
+
+def fun_l4_n293(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n294(x)
+    if (x < 1)
+        fun_l5_n938(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n295(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n469(x)
+    end
+end
+
+def fun_l4_n296(x)
+    if (x < 1)
+        fun_l5_n516(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n297(x)
+    if (x < 1)
+        fun_l5_n585(x)
+    else
+        fun_l5_n344(x)
+    end
+end
+
+def fun_l4_n298(x)
+    if (x < 1)
+        fun_l5_n637(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n299(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n593(x)
+    end
+end
+
+def fun_l4_n300(x)
+    if (x < 1)
+        fun_l5_n773(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n301(x)
+    if (x < 1)
+        fun_l5_n444(x)
+    else
+        fun_l5_n945(x)
+    end
+end
+
+def fun_l4_n302(x)
+    if (x < 1)
+        fun_l5_n728(x)
+    else
+        fun_l5_n484(x)
+    end
+end
+
+def fun_l4_n303(x)
+    if (x < 1)
+        fun_l5_n412(x)
+    else
+        fun_l5_n106(x)
+    end
+end
+
+def fun_l4_n304(x)
+    if (x < 1)
+        fun_l5_n399(x)
+    else
+        fun_l5_n234(x)
+    end
+end
+
+def fun_l4_n305(x)
+    if (x < 1)
+        fun_l5_n886(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n306(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n338(x)
+    end
+end
+
+def fun_l4_n307(x)
+    if (x < 1)
+        fun_l5_n898(x)
+    else
+        fun_l5_n859(x)
+    end
+end
+
+def fun_l4_n308(x)
+    if (x < 1)
+        fun_l5_n25(x)
+    else
+        fun_l5_n476(x)
+    end
+end
+
+def fun_l4_n309(x)
+    if (x < 1)
+        fun_l5_n451(x)
+    else
+        fun_l5_n665(x)
+    end
+end
+
+def fun_l4_n310(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n555(x)
+    end
+end
+
+def fun_l4_n311(x)
+    if (x < 1)
+        fun_l5_n982(x)
+    else
+        fun_l5_n89(x)
+    end
+end
+
+def fun_l4_n312(x)
+    if (x < 1)
+        fun_l5_n32(x)
+    else
+        fun_l5_n908(x)
+    end
+end
+
+def fun_l4_n313(x)
+    if (x < 1)
+        fun_l5_n963(x)
+    else
+        fun_l5_n267(x)
+    end
+end
+
+def fun_l4_n314(x)
+    if (x < 1)
+        fun_l5_n3(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n315(x)
+    if (x < 1)
+        fun_l5_n763(x)
+    else
+        fun_l5_n488(x)
+    end
+end
+
+def fun_l4_n316(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n663(x)
+    end
+end
+
+def fun_l4_n317(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n487(x)
+    end
+end
+
+def fun_l4_n318(x)
+    if (x < 1)
+        fun_l5_n327(x)
+    else
+        fun_l5_n433(x)
+    end
+end
+
+def fun_l4_n319(x)
+    if (x < 1)
+        fun_l5_n242(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n320(x)
+    if (x < 1)
+        fun_l5_n786(x)
+    else
+        fun_l5_n622(x)
+    end
+end
+
+def fun_l4_n321(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n934(x)
+    end
+end
+
+def fun_l4_n322(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n386(x)
+    end
+end
+
+def fun_l4_n323(x)
+    if (x < 1)
+        fun_l5_n96(x)
+    else
+        fun_l5_n466(x)
+    end
+end
+
+def fun_l4_n324(x)
+    if (x < 1)
+        fun_l5_n394(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n325(x)
+    if (x < 1)
+        fun_l5_n544(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n326(x)
+    if (x < 1)
+        fun_l5_n295(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n327(x)
+    if (x < 1)
+        fun_l5_n128(x)
+    else
+        fun_l5_n607(x)
+    end
+end
+
+def fun_l4_n328(x)
+    if (x < 1)
+        fun_l5_n987(x)
+    else
+        fun_l5_n109(x)
+    end
+end
+
+def fun_l4_n329(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n330(x)
+    if (x < 1)
+        fun_l5_n92(x)
+    else
+        fun_l5_n774(x)
+    end
+end
+
+def fun_l4_n331(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n332(x)
+    if (x < 1)
+        fun_l5_n867(x)
+    else
+        fun_l5_n645(x)
+    end
+end
+
+def fun_l4_n333(x)
+    if (x < 1)
+        fun_l5_n273(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n334(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n335(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n346(x)
+    end
+end
+
+def fun_l4_n336(x)
+    if (x < 1)
+        fun_l5_n367(x)
+    else
+        fun_l5_n686(x)
+    end
+end
+
+def fun_l4_n337(x)
+    if (x < 1)
+        fun_l5_n868(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n338(x)
+    if (x < 1)
+        fun_l5_n998(x)
+    else
+        fun_l5_n64(x)
+    end
+end
+
+def fun_l4_n339(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n340(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n573(x)
+    end
+end
+
+def fun_l4_n341(x)
+    if (x < 1)
+        fun_l5_n590(x)
+    else
+        fun_l5_n923(x)
+    end
+end
+
+def fun_l4_n342(x)
+    if (x < 1)
+        fun_l5_n538(x)
+    else
+        fun_l5_n118(x)
+    end
+end
+
+def fun_l4_n343(x)
+    if (x < 1)
+        fun_l5_n322(x)
+    else
+        fun_l5_n970(x)
+    end
+end
+
+def fun_l4_n344(x)
+    if (x < 1)
+        fun_l5_n809(x)
+    else
+        fun_l5_n958(x)
+    end
+end
+
+def fun_l4_n345(x)
+    if (x < 1)
+        fun_l5_n613(x)
+    else
+        fun_l5_n199(x)
+    end
+end
+
+def fun_l4_n346(x)
+    if (x < 1)
+        fun_l5_n298(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n347(x)
+    if (x < 1)
+        fun_l5_n560(x)
+    else
+        fun_l5_n803(x)
+    end
+end
+
+def fun_l4_n348(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l4_n349(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n267(x)
+    end
+end
+
+def fun_l4_n350(x)
+    if (x < 1)
+        fun_l5_n933(x)
+    else
+        fun_l5_n773(x)
+    end
+end
+
+def fun_l4_n351(x)
+    if (x < 1)
+        fun_l5_n574(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n352(x)
+    if (x < 1)
+        fun_l5_n537(x)
+    else
+        fun_l5_n312(x)
+    end
+end
+
+def fun_l4_n353(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n739(x)
+    end
+end
+
+def fun_l4_n354(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n86(x)
+    end
+end
+
+def fun_l4_n355(x)
+    if (x < 1)
+        fun_l5_n3(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n356(x)
+    if (x < 1)
+        fun_l5_n560(x)
+    else
+        fun_l5_n45(x)
+    end
+end
+
+def fun_l4_n357(x)
+    if (x < 1)
+        fun_l5_n666(x)
+    else
+        fun_l5_n874(x)
+    end
+end
+
+def fun_l4_n358(x)
+    if (x < 1)
+        fun_l5_n457(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n359(x)
+    if (x < 1)
+        fun_l5_n674(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n360(x)
+    if (x < 1)
+        fun_l5_n960(x)
+    else
+        fun_l5_n228(x)
+    end
+end
+
+def fun_l4_n361(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n487(x)
+    end
+end
+
+def fun_l4_n362(x)
+    if (x < 1)
+        fun_l5_n145(x)
+    else
+        fun_l5_n278(x)
+    end
+end
+
+def fun_l4_n363(x)
+    if (x < 1)
+        fun_l5_n949(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n364(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n250(x)
+    end
+end
+
+def fun_l4_n365(x)
+    if (x < 1)
+        fun_l5_n347(x)
+    else
+        fun_l5_n964(x)
+    end
+end
+
+def fun_l4_n366(x)
+    if (x < 1)
+        fun_l5_n331(x)
+    else
+        fun_l5_n657(x)
+    end
+end
+
+def fun_l4_n367(x)
+    if (x < 1)
+        fun_l5_n74(x)
+    else
+        fun_l5_n504(x)
+    end
+end
+
+def fun_l4_n368(x)
+    if (x < 1)
+        fun_l5_n9(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n369(x)
+    if (x < 1)
+        fun_l5_n492(x)
+    else
+        fun_l5_n155(x)
+    end
+end
+
+def fun_l4_n370(x)
+    if (x < 1)
+        fun_l5_n848(x)
+    else
+        fun_l5_n178(x)
+    end
+end
+
+def fun_l4_n371(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n837(x)
+    end
+end
+
+def fun_l4_n372(x)
+    if (x < 1)
+        fun_l5_n834(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n373(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n374(x)
+    if (x < 1)
+        fun_l5_n293(x)
+    else
+        fun_l5_n385(x)
+    end
+end
+
+def fun_l4_n375(x)
+    if (x < 1)
+        fun_l5_n487(x)
+    else
+        fun_l5_n61(x)
+    end
+end
+
+def fun_l4_n376(x)
+    if (x < 1)
+        fun_l5_n493(x)
+    else
+        fun_l5_n629(x)
+    end
+end
+
+def fun_l4_n377(x)
+    if (x < 1)
+        fun_l5_n429(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n378(x)
+    if (x < 1)
+        fun_l5_n145(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n379(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n380(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n284(x)
+    end
+end
+
+def fun_l4_n381(x)
+    if (x < 1)
+        fun_l5_n278(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n382(x)
+    if (x < 1)
+        fun_l5_n999(x)
+    else
+        fun_l5_n907(x)
+    end
+end
+
+def fun_l4_n383(x)
+    if (x < 1)
+        fun_l5_n979(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n384(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n385(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n524(x)
+    end
+end
+
+def fun_l4_n386(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n799(x)
+    end
+end
+
+def fun_l4_n387(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n463(x)
+    end
+end
+
+def fun_l4_n388(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n943(x)
+    end
+end
+
+def fun_l4_n389(x)
+    if (x < 1)
+        fun_l5_n21(x)
+    else
+        fun_l5_n663(x)
+    end
+end
+
+def fun_l4_n390(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n348(x)
+    end
+end
+
+def fun_l4_n391(x)
+    if (x < 1)
+        fun_l5_n908(x)
+    else
+        fun_l5_n695(x)
+    end
+end
+
+def fun_l4_n392(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n466(x)
+    end
+end
+
+def fun_l4_n393(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n972(x)
+    end
+end
+
+def fun_l4_n394(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n395(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n13(x)
+    end
+end
+
+def fun_l4_n396(x)
+    if (x < 1)
+        fun_l5_n628(x)
+    else
+        fun_l5_n743(x)
+    end
+end
+
+def fun_l4_n397(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n185(x)
+    end
+end
+
+def fun_l4_n398(x)
+    if (x < 1)
+        fun_l5_n464(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n399(x)
+    if (x < 1)
+        fun_l5_n348(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n400(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n132(x)
+    end
+end
+
+def fun_l4_n401(x)
+    if (x < 1)
+        fun_l5_n433(x)
+    else
+        fun_l5_n77(x)
+    end
+end
+
+def fun_l4_n402(x)
+    if (x < 1)
+        fun_l5_n24(x)
+    else
+        fun_l5_n160(x)
+    end
+end
+
+def fun_l4_n403(x)
+    if (x < 1)
+        fun_l5_n738(x)
+    else
+        fun_l5_n174(x)
+    end
+end
+
+def fun_l4_n404(x)
+    if (x < 1)
+        fun_l5_n585(x)
+    else
+        fun_l5_n670(x)
+    end
+end
+
+def fun_l4_n405(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n406(x)
+    if (x < 1)
+        fun_l5_n357(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n407(x)
+    if (x < 1)
+        fun_l5_n16(x)
+    else
+        fun_l5_n227(x)
+    end
+end
+
+def fun_l4_n408(x)
+    if (x < 1)
+        fun_l5_n360(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n409(x)
+    if (x < 1)
+        fun_l5_n210(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n410(x)
+    if (x < 1)
+        fun_l5_n915(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n411(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n118(x)
+    end
+end
+
+def fun_l4_n412(x)
+    if (x < 1)
+        fun_l5_n680(x)
+    else
+        fun_l5_n445(x)
+    end
+end
+
+def fun_l4_n413(x)
+    if (x < 1)
+        fun_l5_n722(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n414(x)
+    if (x < 1)
+        fun_l5_n382(x)
+    else
+        fun_l5_n380(x)
+    end
+end
+
+def fun_l4_n415(x)
+    if (x < 1)
+        fun_l5_n548(x)
+    else
+        fun_l5_n462(x)
+    end
+end
+
+def fun_l4_n416(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l4_n417(x)
+    if (x < 1)
+        fun_l5_n814(x)
+    else
+        fun_l5_n720(x)
+    end
+end
+
+def fun_l4_n418(x)
+    if (x < 1)
+        fun_l5_n804(x)
+    else
+        fun_l5_n243(x)
+    end
+end
+
+def fun_l4_n419(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n420(x)
+    if (x < 1)
+        fun_l5_n998(x)
+    else
+        fun_l5_n937(x)
+    end
+end
+
+def fun_l4_n421(x)
+    if (x < 1)
+        fun_l5_n476(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n422(x)
+    if (x < 1)
+        fun_l5_n778(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n423(x)
+    if (x < 1)
+        fun_l5_n255(x)
+    else
+        fun_l5_n438(x)
+    end
+end
+
+def fun_l4_n424(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n329(x)
+    end
+end
+
+def fun_l4_n425(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n512(x)
+    end
+end
+
+def fun_l4_n426(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n925(x)
+    end
+end
+
+def fun_l4_n427(x)
+    if (x < 1)
+        fun_l5_n745(x)
+    else
+        fun_l5_n168(x)
+    end
+end
+
+def fun_l4_n428(x)
+    if (x < 1)
+        fun_l5_n682(x)
+    else
+        fun_l5_n298(x)
+    end
+end
+
+def fun_l4_n429(x)
+    if (x < 1)
+        fun_l5_n211(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n430(x)
+    if (x < 1)
+        fun_l5_n100(x)
+    else
+        fun_l5_n287(x)
+    end
+end
+
+def fun_l4_n431(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n764(x)
+    end
+end
+
+def fun_l4_n432(x)
+    if (x < 1)
+        fun_l5_n925(x)
+    else
+        fun_l5_n857(x)
+    end
+end
+
+def fun_l4_n433(x)
+    if (x < 1)
+        fun_l5_n279(x)
+    else
+        fun_l5_n429(x)
+    end
+end
+
+def fun_l4_n434(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n811(x)
+    end
+end
+
+def fun_l4_n435(x)
+    if (x < 1)
+        fun_l5_n893(x)
+    else
+        fun_l5_n136(x)
+    end
+end
+
+def fun_l4_n436(x)
+    if (x < 1)
+        fun_l5_n283(x)
+    else
+        fun_l5_n508(x)
+    end
+end
+
+def fun_l4_n437(x)
+    if (x < 1)
+        fun_l5_n478(x)
+    else
+        fun_l5_n589(x)
+    end
+end
+
+def fun_l4_n438(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n589(x)
+    end
+end
+
+def fun_l4_n439(x)
+    if (x < 1)
+        fun_l5_n745(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n440(x)
+    if (x < 1)
+        fun_l5_n601(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n441(x)
+    if (x < 1)
+        fun_l5_n703(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n442(x)
+    if (x < 1)
+        fun_l5_n810(x)
+    else
+        fun_l5_n363(x)
+    end
+end
+
+def fun_l4_n443(x)
+    if (x < 1)
+        fun_l5_n62(x)
+    else
+        fun_l5_n995(x)
+    end
+end
+
+def fun_l4_n444(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n156(x)
+    end
+end
+
+def fun_l4_n445(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n820(x)
+    end
+end
+
+def fun_l4_n446(x)
+    if (x < 1)
+        fun_l5_n592(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n447(x)
+    if (x < 1)
+        fun_l5_n44(x)
+    else
+        fun_l5_n769(x)
+    end
+end
+
+def fun_l4_n448(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n449(x)
+    if (x < 1)
+        fun_l5_n297(x)
+    else
+        fun_l5_n134(x)
+    end
+end
+
+def fun_l4_n450(x)
+    if (x < 1)
+        fun_l5_n878(x)
+    else
+        fun_l5_n475(x)
+    end
+end
+
+def fun_l4_n451(x)
+    if (x < 1)
+        fun_l5_n338(x)
+    else
+        fun_l5_n700(x)
+    end
+end
+
+def fun_l4_n452(x)
+    if (x < 1)
+        fun_l5_n813(x)
+    else
+        fun_l5_n41(x)
+    end
+end
+
+def fun_l4_n453(x)
+    if (x < 1)
+        fun_l5_n176(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n454(x)
+    if (x < 1)
+        fun_l5_n60(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n455(x)
+    if (x < 1)
+        fun_l5_n550(x)
+    else
+        fun_l5_n607(x)
+    end
+end
+
+def fun_l4_n456(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n478(x)
+    end
+end
+
+def fun_l4_n457(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n613(x)
+    end
+end
+
+def fun_l4_n458(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n459(x)
+    if (x < 1)
+        fun_l5_n167(x)
+    else
+        fun_l5_n875(x)
+    end
+end
+
+def fun_l4_n460(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n461(x)
+    if (x < 1)
+        fun_l5_n64(x)
+    else
+        fun_l5_n845(x)
+    end
+end
+
+def fun_l4_n462(x)
+    if (x < 1)
+        fun_l5_n914(x)
+    else
+        fun_l5_n699(x)
+    end
+end
+
+def fun_l4_n463(x)
+    if (x < 1)
+        fun_l5_n204(x)
+    else
+        fun_l5_n723(x)
+    end
+end
+
+def fun_l4_n464(x)
+    if (x < 1)
+        fun_l5_n549(x)
+    else
+        fun_l5_n375(x)
+    end
+end
+
+def fun_l4_n465(x)
+    if (x < 1)
+        fun_l5_n610(x)
+    else
+        fun_l5_n596(x)
+    end
+end
+
+def fun_l4_n466(x)
+    if (x < 1)
+        fun_l5_n571(x)
+    else
+        fun_l5_n618(x)
+    end
+end
+
+def fun_l4_n467(x)
+    if (x < 1)
+        fun_l5_n428(x)
+    else
+        fun_l5_n315(x)
+    end
+end
+
+def fun_l4_n468(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n301(x)
+    end
+end
+
+def fun_l4_n469(x)
+    if (x < 1)
+        fun_l5_n38(x)
+    else
+        fun_l5_n895(x)
+    end
+end
+
+def fun_l4_n470(x)
+    if (x < 1)
+        fun_l5_n815(x)
+    else
+        fun_l5_n303(x)
+    end
+end
+
+def fun_l4_n471(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n221(x)
+    end
+end
+
+def fun_l4_n472(x)
+    if (x < 1)
+        fun_l5_n199(x)
+    else
+        fun_l5_n354(x)
+    end
+end
+
+def fun_l4_n473(x)
+    if (x < 1)
+        fun_l5_n56(x)
+    else
+        fun_l5_n197(x)
+    end
+end
+
+def fun_l4_n474(x)
+    if (x < 1)
+        fun_l5_n573(x)
+    else
+        fun_l5_n616(x)
+    end
+end
+
+def fun_l4_n475(x)
+    if (x < 1)
+        fun_l5_n313(x)
+    else
+        fun_l5_n209(x)
+    end
+end
+
+def fun_l4_n476(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n51(x)
+    end
+end
+
+def fun_l4_n477(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n368(x)
+    end
+end
+
+def fun_l4_n478(x)
+    if (x < 1)
+        fun_l5_n80(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n479(x)
+    if (x < 1)
+        fun_l5_n221(x)
+    else
+        fun_l5_n266(x)
+    end
+end
+
+def fun_l4_n480(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n71(x)
+    end
+end
+
+def fun_l4_n481(x)
+    if (x < 1)
+        fun_l5_n446(x)
+    else
+        fun_l5_n610(x)
+    end
+end
+
+def fun_l4_n482(x)
+    if (x < 1)
+        fun_l5_n402(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n483(x)
+    if (x < 1)
+        fun_l5_n497(x)
+    else
+        fun_l5_n521(x)
+    end
+end
+
+def fun_l4_n484(x)
+    if (x < 1)
+        fun_l5_n895(x)
+    else
+        fun_l5_n361(x)
+    end
+end
+
+def fun_l4_n485(x)
+    if (x < 1)
+        fun_l5_n254(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n486(x)
+    if (x < 1)
+        fun_l5_n179(x)
+    else
+        fun_l5_n154(x)
+    end
+end
+
+def fun_l4_n487(x)
+    if (x < 1)
+        fun_l5_n905(x)
+    else
+        fun_l5_n30(x)
+    end
+end
+
+def fun_l4_n488(x)
+    if (x < 1)
+        fun_l5_n989(x)
+    else
+        fun_l5_n640(x)
+    end
+end
+
+def fun_l4_n489(x)
+    if (x < 1)
+        fun_l5_n664(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n490(x)
+    if (x < 1)
+        fun_l5_n518(x)
+    else
+        fun_l5_n986(x)
+    end
+end
+
+def fun_l4_n491(x)
+    if (x < 1)
+        fun_l5_n443(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n492(x)
+    if (x < 1)
+        fun_l5_n349(x)
+    else
+        fun_l5_n373(x)
+    end
+end
+
+def fun_l4_n493(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n404(x)
+    end
+end
+
+def fun_l4_n494(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n495(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n42(x)
+    end
+end
+
+def fun_l4_n496(x)
+    if (x < 1)
+        fun_l5_n442(x)
+    else
+        fun_l5_n809(x)
+    end
+end
+
+def fun_l4_n497(x)
+    if (x < 1)
+        fun_l5_n266(x)
+    else
+        fun_l5_n259(x)
+    end
+end
+
+def fun_l4_n498(x)
+    if (x < 1)
+        fun_l5_n342(x)
+    else
+        fun_l5_n275(x)
+    end
+end
+
+def fun_l4_n499(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n797(x)
+    end
+end
+
+def fun_l4_n500(x)
+    if (x < 1)
+        fun_l5_n646(x)
+    else
+        fun_l5_n426(x)
+    end
+end
+
+def fun_l4_n501(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n860(x)
+    end
+end
+
+def fun_l4_n502(x)
+    if (x < 1)
+        fun_l5_n355(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n503(x)
+    if (x < 1)
+        fun_l5_n602(x)
+    else
+        fun_l5_n26(x)
+    end
+end
+
+def fun_l4_n504(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n716(x)
+    end
+end
+
+def fun_l4_n505(x)
+    if (x < 1)
+        fun_l5_n248(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n506(x)
+    if (x < 1)
+        fun_l5_n273(x)
+    else
+        fun_l5_n11(x)
+    end
+end
+
+def fun_l4_n507(x)
+    if (x < 1)
+        fun_l5_n291(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n508(x)
+    if (x < 1)
+        fun_l5_n309(x)
+    else
+        fun_l5_n198(x)
+    end
+end
+
+def fun_l4_n509(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n375(x)
+    end
+end
+
+def fun_l4_n510(x)
+    if (x < 1)
+        fun_l5_n993(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n511(x)
+    if (x < 1)
+        fun_l5_n824(x)
+    else
+        fun_l5_n936(x)
+    end
+end
+
+def fun_l4_n512(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n995(x)
+    end
+end
+
+def fun_l4_n513(x)
+    if (x < 1)
+        fun_l5_n443(x)
+    else
+        fun_l5_n511(x)
+    end
+end
+
+def fun_l4_n514(x)
+    if (x < 1)
+        fun_l5_n965(x)
+    else
+        fun_l5_n506(x)
+    end
+end
+
+def fun_l4_n515(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n516(x)
+    if (x < 1)
+        fun_l5_n396(x)
+    else
+        fun_l5_n355(x)
+    end
+end
+
+def fun_l4_n517(x)
+    if (x < 1)
+        fun_l5_n782(x)
+    else
+        fun_l5_n624(x)
+    end
+end
+
+def fun_l4_n518(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n920(x)
+    end
+end
+
+def fun_l4_n519(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n296(x)
+    end
+end
+
+def fun_l4_n520(x)
+    if (x < 1)
+        fun_l5_n344(x)
+    else
+        fun_l5_n180(x)
+    end
+end
+
+def fun_l4_n521(x)
+    if (x < 1)
+        fun_l5_n489(x)
+    else
+        fun_l5_n818(x)
+    end
+end
+
+def fun_l4_n522(x)
+    if (x < 1)
+        fun_l5_n246(x)
+    else
+        fun_l5_n25(x)
+    end
+end
+
+def fun_l4_n523(x)
+    if (x < 1)
+        fun_l5_n165(x)
+    else
+        fun_l5_n835(x)
+    end
+end
+
+def fun_l4_n524(x)
+    if (x < 1)
+        fun_l5_n836(x)
+    else
+        fun_l5_n838(x)
+    end
+end
+
+def fun_l4_n525(x)
+    if (x < 1)
+        fun_l5_n781(x)
+    else
+        fun_l5_n183(x)
+    end
+end
+
+def fun_l4_n526(x)
+    if (x < 1)
+        fun_l5_n335(x)
+    else
+        fun_l5_n809(x)
+    end
+end
+
+def fun_l4_n527(x)
+    if (x < 1)
+        fun_l5_n748(x)
+    else
+        fun_l5_n674(x)
+    end
+end
+
+def fun_l4_n528(x)
+    if (x < 1)
+        fun_l5_n612(x)
+    else
+        fun_l5_n933(x)
+    end
+end
+
+def fun_l4_n529(x)
+    if (x < 1)
+        fun_l5_n781(x)
+    else
+        fun_l5_n174(x)
+    end
+end
+
+def fun_l4_n530(x)
+    if (x < 1)
+        fun_l5_n299(x)
+    else
+        fun_l5_n677(x)
+    end
+end
+
+def fun_l4_n531(x)
+    if (x < 1)
+        fun_l5_n455(x)
+    else
+        fun_l5_n211(x)
+    end
+end
+
+def fun_l4_n532(x)
+    if (x < 1)
+        fun_l5_n981(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n533(x)
+    if (x < 1)
+        fun_l5_n299(x)
+    else
+        fun_l5_n30(x)
+    end
+end
+
+def fun_l4_n534(x)
+    if (x < 1)
+        fun_l5_n642(x)
+    else
+        fun_l5_n652(x)
+    end
+end
+
+def fun_l4_n535(x)
+    if (x < 1)
+        fun_l5_n904(x)
+    else
+        fun_l5_n133(x)
+    end
+end
+
+def fun_l4_n536(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n330(x)
+    end
+end
+
+def fun_l4_n537(x)
+    if (x < 1)
+        fun_l5_n357(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n538(x)
+    if (x < 1)
+        fun_l5_n484(x)
+    else
+        fun_l5_n438(x)
+    end
+end
+
+def fun_l4_n539(x)
+    if (x < 1)
+        fun_l5_n200(x)
+    else
+        fun_l5_n235(x)
+    end
+end
+
+def fun_l4_n540(x)
+    if (x < 1)
+        fun_l5_n929(x)
+    else
+        fun_l5_n875(x)
+    end
+end
+
+def fun_l4_n541(x)
+    if (x < 1)
+        fun_l5_n237(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n542(x)
+    if (x < 1)
+        fun_l5_n723(x)
+    else
+        fun_l5_n308(x)
+    end
+end
+
+def fun_l4_n543(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n93(x)
+    end
+end
+
+def fun_l4_n544(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n205(x)
+    end
+end
+
+def fun_l4_n545(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n529(x)
+    end
+end
+
+def fun_l4_n546(x)
+    if (x < 1)
+        fun_l5_n255(x)
+    else
+        fun_l5_n262(x)
+    end
+end
+
+def fun_l4_n547(x)
+    if (x < 1)
+        fun_l5_n674(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n548(x)
+    if (x < 1)
+        fun_l5_n9(x)
+    else
+        fun_l5_n709(x)
+    end
+end
+
+def fun_l4_n549(x)
+    if (x < 1)
+        fun_l5_n146(x)
+    else
+        fun_l5_n801(x)
+    end
+end
+
+def fun_l4_n550(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n428(x)
+    end
+end
+
+def fun_l4_n551(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n238(x)
+    end
+end
+
+def fun_l4_n552(x)
+    if (x < 1)
+        fun_l5_n900(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n553(x)
+    if (x < 1)
+        fun_l5_n400(x)
+    else
+        fun_l5_n150(x)
+    end
+end
+
+def fun_l4_n554(x)
+    if (x < 1)
+        fun_l5_n697(x)
+    else
+        fun_l5_n681(x)
+    end
+end
+
+def fun_l4_n555(x)
+    if (x < 1)
+        fun_l5_n487(x)
+    else
+        fun_l5_n784(x)
+    end
+end
+
+def fun_l4_n556(x)
+    if (x < 1)
+        fun_l5_n485(x)
+    else
+        fun_l5_n984(x)
+    end
+end
+
+def fun_l4_n557(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n864(x)
+    end
+end
+
+def fun_l4_n558(x)
+    if (x < 1)
+        fun_l5_n823(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n559(x)
+    if (x < 1)
+        fun_l5_n204(x)
+    else
+        fun_l5_n114(x)
+    end
+end
+
+def fun_l4_n560(x)
+    if (x < 1)
+        fun_l5_n835(x)
+    else
+        fun_l5_n930(x)
+    end
+end
+
+def fun_l4_n561(x)
+    if (x < 1)
+        fun_l5_n481(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n562(x)
+    if (x < 1)
+        fun_l5_n459(x)
+    else
+        fun_l5_n526(x)
+    end
+end
+
+def fun_l4_n563(x)
+    if (x < 1)
+        fun_l5_n148(x)
+    else
+        fun_l5_n473(x)
+    end
+end
+
+def fun_l4_n564(x)
+    if (x < 1)
+        fun_l5_n448(x)
+    else
+        fun_l5_n389(x)
+    end
+end
+
+def fun_l4_n565(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n405(x)
+    end
+end
+
+def fun_l4_n566(x)
+    if (x < 1)
+        fun_l5_n67(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n567(x)
+    if (x < 1)
+        fun_l5_n63(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n568(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n288(x)
+    end
+end
+
+def fun_l4_n569(x)
+    if (x < 1)
+        fun_l5_n143(x)
+    else
+        fun_l5_n879(x)
+    end
+end
+
+def fun_l4_n570(x)
+    if (x < 1)
+        fun_l5_n552(x)
+    else
+        fun_l5_n517(x)
+    end
+end
+
+def fun_l4_n571(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n680(x)
+    end
+end
+
+def fun_l4_n572(x)
+    if (x < 1)
+        fun_l5_n853(x)
+    else
+        fun_l5_n97(x)
+    end
+end
+
+def fun_l4_n573(x)
+    if (x < 1)
+        fun_l5_n277(x)
+    else
+        fun_l5_n329(x)
+    end
+end
+
+def fun_l4_n574(x)
+    if (x < 1)
+        fun_l5_n952(x)
+    else
+        fun_l5_n515(x)
+    end
+end
+
+def fun_l4_n575(x)
+    if (x < 1)
+        fun_l5_n64(x)
+    else
+        fun_l5_n576(x)
+    end
+end
+
+def fun_l4_n576(x)
+    if (x < 1)
+        fun_l5_n57(x)
+    else
+        fun_l5_n499(x)
+    end
+end
+
+def fun_l4_n577(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n578(x)
+    if (x < 1)
+        fun_l5_n361(x)
+    else
+        fun_l5_n447(x)
+    end
+end
+
+def fun_l4_n579(x)
+    if (x < 1)
+        fun_l5_n788(x)
+    else
+        fun_l5_n299(x)
+    end
+end
+
+def fun_l4_n580(x)
+    if (x < 1)
+        fun_l5_n973(x)
+    else
+        fun_l5_n753(x)
+    end
+end
+
+def fun_l4_n581(x)
+    if (x < 1)
+        fun_l5_n862(x)
+    else
+        fun_l5_n110(x)
+    end
+end
+
+def fun_l4_n582(x)
+    if (x < 1)
+        fun_l5_n760(x)
+    else
+        fun_l5_n256(x)
+    end
+end
+
+def fun_l4_n583(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n922(x)
+    end
+end
+
+def fun_l4_n584(x)
+    if (x < 1)
+        fun_l5_n100(x)
+    else
+        fun_l5_n230(x)
+    end
+end
+
+def fun_l4_n585(x)
+    if (x < 1)
+        fun_l5_n183(x)
+    else
+        fun_l5_n350(x)
+    end
+end
+
+def fun_l4_n586(x)
+    if (x < 1)
+        fun_l5_n294(x)
+    else
+        fun_l5_n673(x)
+    end
+end
+
+def fun_l4_n587(x)
+    if (x < 1)
+        fun_l5_n51(x)
+    else
+        fun_l5_n718(x)
+    end
+end
+
+def fun_l4_n588(x)
+    if (x < 1)
+        fun_l5_n257(x)
+    else
+        fun_l5_n111(x)
+    end
+end
+
+def fun_l4_n589(x)
+    if (x < 1)
+        fun_l5_n727(x)
+    else
+        fun_l5_n585(x)
+    end
+end
+
+def fun_l4_n590(x)
+    if (x < 1)
+        fun_l5_n205(x)
+    else
+        fun_l5_n308(x)
+    end
+end
+
+def fun_l4_n591(x)
+    if (x < 1)
+        fun_l5_n618(x)
+    else
+        fun_l5_n970(x)
+    end
+end
+
+def fun_l4_n592(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n513(x)
+    end
+end
+
+def fun_l4_n593(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n737(x)
+    end
+end
+
+def fun_l4_n594(x)
+    if (x < 1)
+        fun_l5_n464(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n595(x)
+    if (x < 1)
+        fun_l5_n650(x)
+    else
+        fun_l5_n616(x)
+    end
+end
+
+def fun_l4_n596(x)
+    if (x < 1)
+        fun_l5_n542(x)
+    else
+        fun_l5_n613(x)
+    end
+end
+
+def fun_l4_n597(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n598(x)
+    if (x < 1)
+        fun_l5_n164(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n599(x)
+    if (x < 1)
+        fun_l5_n326(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n600(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n233(x)
+    end
+end
+
+def fun_l4_n601(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n602(x)
+    if (x < 1)
+        fun_l5_n334(x)
+    else
+        fun_l5_n282(x)
+    end
+end
+
+def fun_l4_n603(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n252(x)
+    end
+end
+
+def fun_l4_n604(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n685(x)
+    end
+end
+
+def fun_l4_n605(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n416(x)
+    end
+end
+
+def fun_l4_n606(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n372(x)
+    end
+end
+
+def fun_l4_n607(x)
+    if (x < 1)
+        fun_l5_n723(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n608(x)
+    if (x < 1)
+        fun_l5_n690(x)
+    else
+        fun_l5_n26(x)
+    end
+end
+
+def fun_l4_n609(x)
+    if (x < 1)
+        fun_l5_n555(x)
+    else
+        fun_l5_n717(x)
+    end
+end
+
+def fun_l4_n610(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n106(x)
+    end
+end
+
+def fun_l4_n611(x)
+    if (x < 1)
+        fun_l5_n405(x)
+    else
+        fun_l5_n588(x)
+    end
+end
+
+def fun_l4_n612(x)
+    if (x < 1)
+        fun_l5_n41(x)
+    else
+        fun_l5_n558(x)
+    end
+end
+
+def fun_l4_n613(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n492(x)
+    end
+end
+
+def fun_l4_n614(x)
+    if (x < 1)
+        fun_l5_n605(x)
+    else
+        fun_l5_n461(x)
+    end
+end
+
+def fun_l4_n615(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n534(x)
+    end
+end
+
+def fun_l4_n616(x)
+    if (x < 1)
+        fun_l5_n919(x)
+    else
+        fun_l5_n404(x)
+    end
+end
+
+def fun_l4_n617(x)
+    if (x < 1)
+        fun_l5_n383(x)
+    else
+        fun_l5_n324(x)
+    end
+end
+
+def fun_l4_n618(x)
+    if (x < 1)
+        fun_l5_n286(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n619(x)
+    if (x < 1)
+        fun_l5_n713(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n620(x)
+    if (x < 1)
+        fun_l5_n773(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n621(x)
+    if (x < 1)
+        fun_l5_n797(x)
+    else
+        fun_l5_n720(x)
+    end
+end
+
+def fun_l4_n622(x)
+    if (x < 1)
+        fun_l5_n799(x)
+    else
+        fun_l5_n423(x)
+    end
+end
+
+def fun_l4_n623(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n941(x)
+    end
+end
+
+def fun_l4_n624(x)
+    if (x < 1)
+        fun_l5_n584(x)
+    else
+        fun_l5_n191(x)
+    end
+end
+
+def fun_l4_n625(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n626(x)
+    if (x < 1)
+        fun_l5_n136(x)
+    else
+        fun_l5_n791(x)
+    end
+end
+
+def fun_l4_n627(x)
+    if (x < 1)
+        fun_l5_n684(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n628(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n27(x)
+    end
+end
+
+def fun_l4_n629(x)
+    if (x < 1)
+        fun_l5_n18(x)
+    else
+        fun_l5_n867(x)
+    end
+end
+
+def fun_l4_n630(x)
+    if (x < 1)
+        fun_l5_n4(x)
+    else
+        fun_l5_n871(x)
+    end
+end
+
+def fun_l4_n631(x)
+    if (x < 1)
+        fun_l5_n578(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n632(x)
+    if (x < 1)
+        fun_l5_n388(x)
+    else
+        fun_l5_n258(x)
+    end
+end
+
+def fun_l4_n633(x)
+    if (x < 1)
+        fun_l5_n680(x)
+    else
+        fun_l5_n814(x)
+    end
+end
+
+def fun_l4_n634(x)
+    if (x < 1)
+        fun_l5_n857(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n635(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n725(x)
+    end
+end
+
+def fun_l4_n636(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n485(x)
+    end
+end
+
+def fun_l4_n637(x)
+    if (x < 1)
+        fun_l5_n528(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n638(x)
+    if (x < 1)
+        fun_l5_n924(x)
+    else
+        fun_l5_n956(x)
+    end
+end
+
+def fun_l4_n639(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n979(x)
+    end
+end
+
+def fun_l4_n640(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n778(x)
+    end
+end
+
+def fun_l4_n641(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n682(x)
+    end
+end
+
+def fun_l4_n642(x)
+    if (x < 1)
+        fun_l5_n559(x)
+    else
+        fun_l5_n812(x)
+    end
+end
+
+def fun_l4_n643(x)
+    if (x < 1)
+        fun_l5_n970(x)
+    else
+        fun_l5_n43(x)
+    end
+end
+
+def fun_l4_n644(x)
+    if (x < 1)
+        fun_l5_n222(x)
+    else
+        fun_l5_n741(x)
+    end
+end
+
+def fun_l4_n645(x)
+    if (x < 1)
+        fun_l5_n788(x)
+    else
+        fun_l5_n72(x)
+    end
+end
+
+def fun_l4_n646(x)
+    if (x < 1)
+        fun_l5_n877(x)
+    else
+        fun_l5_n371(x)
+    end
+end
+
+def fun_l4_n647(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n783(x)
+    end
+end
+
+def fun_l4_n648(x)
+    if (x < 1)
+        fun_l5_n957(x)
+    else
+        fun_l5_n801(x)
+    end
+end
+
+def fun_l4_n649(x)
+    if (x < 1)
+        fun_l5_n127(x)
+    else
+        fun_l5_n664(x)
+    end
+end
+
+def fun_l4_n650(x)
+    if (x < 1)
+        fun_l5_n176(x)
+    else
+        fun_l5_n511(x)
+    end
+end
+
+def fun_l4_n651(x)
+    if (x < 1)
+        fun_l5_n830(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n652(x)
+    if (x < 1)
+        fun_l5_n207(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n653(x)
+    if (x < 1)
+        fun_l5_n611(x)
+    else
+        fun_l5_n443(x)
+    end
+end
+
+def fun_l4_n654(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n655(x)
+    if (x < 1)
+        fun_l5_n109(x)
+    else
+        fun_l5_n706(x)
+    end
+end
+
+def fun_l4_n656(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n914(x)
+    end
+end
+
+def fun_l4_n657(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n530(x)
+    end
+end
+
+def fun_l4_n658(x)
+    if (x < 1)
+        fun_l5_n79(x)
+    else
+        fun_l5_n303(x)
+    end
+end
+
+def fun_l4_n659(x)
+    if (x < 1)
+        fun_l5_n718(x)
+    else
+        fun_l5_n196(x)
+    end
+end
+
+def fun_l4_n660(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n661(x)
+    end
+end
+
+def fun_l4_n661(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n662(x)
+    if (x < 1)
+        fun_l5_n413(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n663(x)
+    if (x < 1)
+        fun_l5_n491(x)
+    else
+        fun_l5_n927(x)
+    end
+end
+
+def fun_l4_n664(x)
+    if (x < 1)
+        fun_l5_n671(x)
+    else
+        fun_l5_n611(x)
+    end
+end
+
+def fun_l4_n665(x)
+    if (x < 1)
+        fun_l5_n153(x)
+    else
+        fun_l5_n127(x)
+    end
+end
+
+def fun_l4_n666(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n667(x)
+    if (x < 1)
+        fun_l5_n539(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n668(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n423(x)
+    end
+end
+
+def fun_l4_n669(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n670(x)
+    if (x < 1)
+        fun_l5_n49(x)
+    else
+        fun_l5_n632(x)
+    end
+end
+
+def fun_l4_n671(x)
+    if (x < 1)
+        fun_l5_n891(x)
+    else
+        fun_l5_n915(x)
+    end
+end
+
+def fun_l4_n672(x)
+    if (x < 1)
+        fun_l5_n257(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n673(x)
+    if (x < 1)
+        fun_l5_n620(x)
+    else
+        fun_l5_n473(x)
+    end
+end
+
+def fun_l4_n674(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n675(x)
+    if (x < 1)
+        fun_l5_n973(x)
+    else
+        fun_l5_n32(x)
+    end
+end
+
+def fun_l4_n676(x)
+    if (x < 1)
+        fun_l5_n434(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n677(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n702(x)
+    end
+end
+
+def fun_l4_n678(x)
+    if (x < 1)
+        fun_l5_n698(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n679(x)
+    if (x < 1)
+        fun_l5_n365(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n680(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n356(x)
+    end
+end
+
+def fun_l4_n681(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n458(x)
+    end
+end
+
+def fun_l4_n682(x)
+    if (x < 1)
+        fun_l5_n205(x)
+    else
+        fun_l5_n693(x)
+    end
+end
+
+def fun_l4_n683(x)
+    if (x < 1)
+        fun_l5_n971(x)
+    else
+        fun_l5_n656(x)
+    end
+end
+
+def fun_l4_n684(x)
+    if (x < 1)
+        fun_l5_n147(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n685(x)
+    if (x < 1)
+        fun_l5_n347(x)
+    else
+        fun_l5_n281(x)
+    end
+end
+
+def fun_l4_n686(x)
+    if (x < 1)
+        fun_l5_n259(x)
+    else
+        fun_l5_n395(x)
+    end
+end
+
+def fun_l4_n687(x)
+    if (x < 1)
+        fun_l5_n899(x)
+    else
+        fun_l5_n319(x)
+    end
+end
+
+def fun_l4_n688(x)
+    if (x < 1)
+        fun_l5_n293(x)
+    else
+        fun_l5_n831(x)
+    end
+end
+
+def fun_l4_n689(x)
+    if (x < 1)
+        fun_l5_n88(x)
+    else
+        fun_l5_n938(x)
+    end
+end
+
+def fun_l4_n690(x)
+    if (x < 1)
+        fun_l5_n72(x)
+    else
+        fun_l5_n172(x)
+    end
+end
+
+def fun_l4_n691(x)
+    if (x < 1)
+        fun_l5_n330(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n692(x)
+    if (x < 1)
+        fun_l5_n901(x)
+    else
+        fun_l5_n984(x)
+    end
+end
+
+def fun_l4_n693(x)
+    if (x < 1)
+        fun_l5_n528(x)
+    else
+        fun_l5_n659(x)
+    end
+end
+
+def fun_l4_n694(x)
+    if (x < 1)
+        fun_l5_n522(x)
+    else
+        fun_l5_n219(x)
+    end
+end
+
+def fun_l4_n695(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n997(x)
+    end
+end
+
+def fun_l4_n696(x)
+    if (x < 1)
+        fun_l5_n248(x)
+    else
+        fun_l5_n508(x)
+    end
+end
+
+def fun_l4_n697(x)
+    if (x < 1)
+        fun_l5_n71(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n698(x)
+    if (x < 1)
+        fun_l5_n398(x)
+    else
+        fun_l5_n125(x)
+    end
+end
+
+def fun_l4_n699(x)
+    if (x < 1)
+        fun_l5_n405(x)
+    else
+        fun_l5_n129(x)
+    end
+end
+
+def fun_l4_n700(x)
+    if (x < 1)
+        fun_l5_n818(x)
+    else
+        fun_l5_n792(x)
+    end
+end
+
+def fun_l4_n701(x)
+    if (x < 1)
+        fun_l5_n530(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n702(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n558(x)
+    end
+end
+
+def fun_l4_n703(x)
+    if (x < 1)
+        fun_l5_n717(x)
+    else
+        fun_l5_n113(x)
+    end
+end
+
+def fun_l4_n704(x)
+    if (x < 1)
+        fun_l5_n139(x)
+    else
+        fun_l5_n743(x)
+    end
+end
+
+def fun_l4_n705(x)
+    if (x < 1)
+        fun_l5_n720(x)
+    else
+        fun_l5_n713(x)
+    end
+end
+
+def fun_l4_n706(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n90(x)
+    end
+end
+
+def fun_l4_n707(x)
+    if (x < 1)
+        fun_l5_n579(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n708(x)
+    if (x < 1)
+        fun_l5_n448(x)
+    else
+        fun_l5_n146(x)
+    end
+end
+
+def fun_l4_n709(x)
+    if (x < 1)
+        fun_l5_n249(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n710(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n711(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n424(x)
+    end
+end
+
+def fun_l4_n712(x)
+    if (x < 1)
+        fun_l5_n700(x)
+    else
+        fun_l5_n761(x)
+    end
+end
+
+def fun_l4_n713(x)
+    if (x < 1)
+        fun_l5_n403(x)
+    else
+        fun_l5_n941(x)
+    end
+end
+
+def fun_l4_n714(x)
+    if (x < 1)
+        fun_l5_n724(x)
+    else
+        fun_l5_n863(x)
+    end
+end
+
+def fun_l4_n715(x)
+    if (x < 1)
+        fun_l5_n392(x)
+    else
+        fun_l5_n617(x)
+    end
+end
+
+def fun_l4_n716(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n896(x)
+    end
+end
+
+def fun_l4_n717(x)
+    if (x < 1)
+        fun_l5_n355(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n718(x)
+    if (x < 1)
+        fun_l5_n225(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n719(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n720(x)
+    if (x < 1)
+        fun_l5_n309(x)
+    else
+        fun_l5_n702(x)
+    end
+end
+
+def fun_l4_n721(x)
+    if (x < 1)
+        fun_l5_n959(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n722(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n96(x)
+    end
+end
+
+def fun_l4_n723(x)
+    if (x < 1)
+        fun_l5_n590(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n724(x)
+    if (x < 1)
+        fun_l5_n14(x)
+    else
+        fun_l5_n161(x)
+    end
+end
+
+def fun_l4_n725(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n643(x)
+    end
+end
+
+def fun_l4_n726(x)
+    if (x < 1)
+        fun_l5_n885(x)
+    else
+        fun_l5_n142(x)
+    end
+end
+
+def fun_l4_n727(x)
+    if (x < 1)
+        fun_l5_n994(x)
+    else
+        fun_l5_n823(x)
+    end
+end
+
+def fun_l4_n728(x)
+    if (x < 1)
+        fun_l5_n825(x)
+    else
+        fun_l5_n315(x)
+    end
+end
+
+def fun_l4_n729(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n28(x)
+    end
+end
+
+def fun_l4_n730(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n731(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n732(x)
+    if (x < 1)
+        fun_l5_n21(x)
+    else
+        fun_l5_n170(x)
+    end
+end
+
+def fun_l4_n733(x)
+    if (x < 1)
+        fun_l5_n662(x)
+    else
+        fun_l5_n407(x)
+    end
+end
+
+def fun_l4_n734(x)
+    if (x < 1)
+        fun_l5_n808(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n735(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n925(x)
+    end
+end
+
+def fun_l4_n736(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n817(x)
+    end
+end
+
+def fun_l4_n737(x)
+    if (x < 1)
+        fun_l5_n360(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n738(x)
+    if (x < 1)
+        fun_l5_n278(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n739(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n740(x)
+    if (x < 1)
+        fun_l5_n770(x)
+    else
+        fun_l5_n382(x)
+    end
+end
+
+def fun_l4_n741(x)
+    if (x < 1)
+        fun_l5_n969(x)
+    else
+        fun_l5_n583(x)
+    end
+end
+
+def fun_l4_n742(x)
+    if (x < 1)
+        fun_l5_n653(x)
+    else
+        fun_l5_n258(x)
+    end
+end
+
+def fun_l4_n743(x)
+    if (x < 1)
+        fun_l5_n966(x)
+    else
+        fun_l5_n705(x)
+    end
+end
+
+def fun_l4_n744(x)
+    if (x < 1)
+        fun_l5_n454(x)
+    else
+        fun_l5_n748(x)
+    end
+end
+
+def fun_l4_n745(x)
+    if (x < 1)
+        fun_l5_n595(x)
+    else
+        fun_l5_n865(x)
+    end
+end
+
+def fun_l4_n746(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n615(x)
+    end
+end
+
+def fun_l4_n747(x)
+    if (x < 1)
+        fun_l5_n638(x)
+    else
+        fun_l5_n651(x)
+    end
+end
+
+def fun_l4_n748(x)
+    if (x < 1)
+        fun_l5_n331(x)
+    else
+        fun_l5_n847(x)
+    end
+end
+
+def fun_l4_n749(x)
+    if (x < 1)
+        fun_l5_n59(x)
+    else
+        fun_l5_n805(x)
+    end
+end
+
+def fun_l4_n750(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n904(x)
+    end
+end
+
+def fun_l4_n751(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n459(x)
+    end
+end
+
+def fun_l4_n752(x)
+    if (x < 1)
+        fun_l5_n581(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n753(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n745(x)
+    end
+end
+
+def fun_l4_n754(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n604(x)
+    end
+end
+
+def fun_l4_n755(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n756(x)
+    if (x < 1)
+        fun_l5_n986(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n757(x)
+    if (x < 1)
+        fun_l5_n946(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n758(x)
+    if (x < 1)
+        fun_l5_n571(x)
+    else
+        fun_l5_n919(x)
+    end
+end
+
+def fun_l4_n759(x)
+    if (x < 1)
+        fun_l5_n129(x)
+    else
+        fun_l5_n191(x)
+    end
+end
+
+def fun_l4_n760(x)
+    if (x < 1)
+        fun_l5_n838(x)
+    else
+        fun_l5_n29(x)
+    end
+end
+
+def fun_l4_n761(x)
+    if (x < 1)
+        fun_l5_n250(x)
+    else
+        fun_l5_n892(x)
+    end
+end
+
+def fun_l4_n762(x)
+    if (x < 1)
+        fun_l5_n588(x)
+    else
+        fun_l5_n59(x)
+    end
+end
+
+def fun_l4_n763(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n668(x)
+    end
+end
+
+def fun_l4_n764(x)
+    if (x < 1)
+        fun_l5_n337(x)
+    else
+        fun_l5_n514(x)
+    end
+end
+
+def fun_l4_n765(x)
+    if (x < 1)
+        fun_l5_n56(x)
+    else
+        fun_l5_n718(x)
+    end
+end
+
+def fun_l4_n766(x)
+    if (x < 1)
+        fun_l5_n189(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n767(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n313(x)
+    end
+end
+
+def fun_l4_n768(x)
+    if (x < 1)
+        fun_l5_n388(x)
+    else
+        fun_l5_n757(x)
+    end
+end
+
+def fun_l4_n769(x)
+    if (x < 1)
+        fun_l5_n933(x)
+    else
+        fun_l5_n979(x)
+    end
+end
+
+def fun_l4_n770(x)
+    if (x < 1)
+        fun_l5_n765(x)
+    else
+        fun_l5_n472(x)
+    end
+end
+
+def fun_l4_n771(x)
+    if (x < 1)
+        fun_l5_n381(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n772(x)
+    if (x < 1)
+        fun_l5_n314(x)
+    else
+        fun_l5_n990(x)
+    end
+end
+
+def fun_l4_n773(x)
+    if (x < 1)
+        fun_l5_n457(x)
+    else
+        fun_l5_n413(x)
+    end
+end
+
+def fun_l4_n774(x)
+    if (x < 1)
+        fun_l5_n245(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n775(x)
+    if (x < 1)
+        fun_l5_n432(x)
+    else
+        fun_l5_n987(x)
+    end
+end
+
+def fun_l4_n776(x)
+    if (x < 1)
+        fun_l5_n588(x)
+    else
+        fun_l5_n352(x)
+    end
+end
+
+def fun_l4_n777(x)
+    if (x < 1)
+        fun_l5_n414(x)
+    else
+        fun_l5_n586(x)
+    end
+end
+
+def fun_l4_n778(x)
+    if (x < 1)
+        fun_l5_n290(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n779(x)
+    if (x < 1)
+        fun_l5_n324(x)
+    else
+        fun_l5_n918(x)
+    end
+end
+
+def fun_l4_n780(x)
+    if (x < 1)
+        fun_l5_n928(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n781(x)
+    if (x < 1)
+        fun_l5_n244(x)
+    else
+        fun_l5_n434(x)
+    end
+end
+
+def fun_l4_n782(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n141(x)
+    end
+end
+
+def fun_l4_n783(x)
+    if (x < 1)
+        fun_l5_n634(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n784(x)
+    if (x < 1)
+        fun_l5_n387(x)
+    else
+        fun_l5_n57(x)
+    end
+end
+
+def fun_l4_n785(x)
+    if (x < 1)
+        fun_l5_n731(x)
+    else
+        fun_l5_n670(x)
+    end
+end
+
+def fun_l4_n786(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n657(x)
+    end
+end
+
+def fun_l4_n787(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n286(x)
+    end
+end
+
+def fun_l4_n788(x)
+    if (x < 1)
+        fun_l5_n364(x)
+    else
+        fun_l5_n520(x)
+    end
+end
+
+def fun_l4_n789(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n417(x)
+    end
+end
+
+def fun_l4_n790(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n550(x)
+    end
+end
+
+def fun_l4_n791(x)
+    if (x < 1)
+        fun_l5_n873(x)
+    else
+        fun_l5_n321(x)
+    end
+end
+
+def fun_l4_n792(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n793(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n400(x)
+    end
+end
+
+def fun_l4_n794(x)
+    if (x < 1)
+        fun_l5_n670(x)
+    else
+        fun_l5_n535(x)
+    end
+end
+
+def fun_l4_n795(x)
+    if (x < 1)
+        fun_l5_n911(x)
+    else
+        fun_l5_n786(x)
+    end
+end
+
+def fun_l4_n796(x)
+    if (x < 1)
+        fun_l5_n247(x)
+    else
+        fun_l5_n775(x)
+    end
+end
+
+def fun_l4_n797(x)
+    if (x < 1)
+        fun_l5_n944(x)
+    else
+        fun_l5_n14(x)
+    end
+end
+
+def fun_l4_n798(x)
+    if (x < 1)
+        fun_l5_n57(x)
+    else
+        fun_l5_n644(x)
+    end
+end
+
+def fun_l4_n799(x)
+    if (x < 1)
+        fun_l5_n583(x)
+    else
+        fun_l5_n599(x)
+    end
+end
+
+def fun_l4_n800(x)
+    if (x < 1)
+        fun_l5_n685(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n801(x)
+    if (x < 1)
+        fun_l5_n671(x)
+    else
+        fun_l5_n386(x)
+    end
+end
+
+def fun_l4_n802(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n403(x)
+    end
+end
+
+def fun_l4_n803(x)
+    if (x < 1)
+        fun_l5_n952(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n804(x)
+    if (x < 1)
+        fun_l5_n929(x)
+    else
+        fun_l5_n737(x)
+    end
+end
+
+def fun_l4_n805(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n806(x)
+    if (x < 1)
+        fun_l5_n966(x)
+    else
+        fun_l5_n531(x)
+    end
+end
+
+def fun_l4_n807(x)
+    if (x < 1)
+        fun_l5_n928(x)
+    else
+        fun_l5_n802(x)
+    end
+end
+
+def fun_l4_n808(x)
+    if (x < 1)
+        fun_l5_n34(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n809(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n628(x)
+    end
+end
+
+def fun_l4_n810(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n424(x)
+    end
+end
+
+def fun_l4_n811(x)
+    if (x < 1)
+        fun_l5_n189(x)
+    else
+        fun_l5_n639(x)
+    end
+end
+
+def fun_l4_n812(x)
+    if (x < 1)
+        fun_l5_n177(x)
+    else
+        fun_l5_n580(x)
+    end
+end
+
+def fun_l4_n813(x)
+    if (x < 1)
+        fun_l5_n699(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n814(x)
+    if (x < 1)
+        fun_l5_n44(x)
+    else
+        fun_l5_n966(x)
+    end
+end
+
+def fun_l4_n815(x)
+    if (x < 1)
+        fun_l5_n883(x)
+    else
+        fun_l5_n580(x)
+    end
+end
+
+def fun_l4_n816(x)
+    if (x < 1)
+        fun_l5_n306(x)
+    else
+        fun_l5_n564(x)
+    end
+end
+
+def fun_l4_n817(x)
+    if (x < 1)
+        fun_l5_n337(x)
+    else
+        fun_l5_n912(x)
+    end
+end
+
+def fun_l4_n818(x)
+    if (x < 1)
+        fun_l5_n36(x)
+    else
+        fun_l5_n164(x)
+    end
+end
+
+def fun_l4_n819(x)
+    if (x < 1)
+        fun_l5_n987(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n820(x)
+    if (x < 1)
+        fun_l5_n656(x)
+    else
+        fun_l5_n647(x)
+    end
+end
+
+def fun_l4_n821(x)
+    if (x < 1)
+        fun_l5_n364(x)
+    else
+        fun_l5_n838(x)
+    end
+end
+
+def fun_l4_n822(x)
+    if (x < 1)
+        fun_l5_n301(x)
+    else
+        fun_l5_n850(x)
+    end
+end
+
+def fun_l4_n823(x)
+    if (x < 1)
+        fun_l5_n191(x)
+    else
+        fun_l5_n812(x)
+    end
+end
+
+def fun_l4_n824(x)
+    if (x < 1)
+        fun_l5_n148(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n825(x)
+    if (x < 1)
+        fun_l5_n315(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n826(x)
+    if (x < 1)
+        fun_l5_n612(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n827(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n828(x)
+    if (x < 1)
+        fun_l5_n131(x)
+    else
+        fun_l5_n283(x)
+    end
+end
+
+def fun_l4_n829(x)
+    if (x < 1)
+        fun_l5_n59(x)
+    else
+        fun_l5_n280(x)
+    end
+end
+
+def fun_l4_n830(x)
+    if (x < 1)
+        fun_l5_n993(x)
+    else
+        fun_l5_n160(x)
+    end
+end
+
+def fun_l4_n831(x)
+    if (x < 1)
+        fun_l5_n394(x)
+    else
+        fun_l5_n528(x)
+    end
+end
+
+def fun_l4_n832(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n201(x)
+    end
+end
+
+def fun_l4_n833(x)
+    if (x < 1)
+        fun_l5_n890(x)
+    else
+        fun_l5_n867(x)
+    end
+end
+
+def fun_l4_n834(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n835(x)
+    if (x < 1)
+        fun_l5_n771(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n836(x)
+    if (x < 1)
+        fun_l5_n751(x)
+    else
+        fun_l5_n2(x)
+    end
+end
+
+def fun_l4_n837(x)
+    if (x < 1)
+        fun_l5_n825(x)
+    else
+        fun_l5_n930(x)
+    end
+end
+
+def fun_l4_n838(x)
+    if (x < 1)
+        fun_l5_n968(x)
+    else
+        fun_l5_n136(x)
+    end
+end
+
+def fun_l4_n839(x)
+    if (x < 1)
+        fun_l5_n529(x)
+    else
+        fun_l5_n626(x)
+    end
+end
+
+def fun_l4_n840(x)
+    if (x < 1)
+        fun_l5_n228(x)
+    else
+        fun_l5_n915(x)
+    end
+end
+
+def fun_l4_n841(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n842(x)
+    if (x < 1)
+        fun_l5_n392(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n843(x)
+    if (x < 1)
+        fun_l5_n470(x)
+    else
+        fun_l5_n699(x)
+    end
+end
+
+def fun_l4_n844(x)
+    if (x < 1)
+        fun_l5_n68(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n845(x)
+    if (x < 1)
+        fun_l5_n469(x)
+    else
+        fun_l5_n472(x)
+    end
+end
+
+def fun_l4_n846(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n847(x)
+    if (x < 1)
+        fun_l5_n968(x)
+    else
+        fun_l5_n414(x)
+    end
+end
+
+def fun_l4_n848(x)
+    if (x < 1)
+        fun_l5_n111(x)
+    else
+        fun_l5_n340(x)
+    end
+end
+
+def fun_l4_n849(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n278(x)
+    end
+end
+
+def fun_l4_n850(x)
+    if (x < 1)
+        fun_l5_n353(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n851(x)
+    if (x < 1)
+        fun_l5_n218(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n852(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n853(x)
+    if (x < 1)
+        fun_l5_n589(x)
+    else
+        fun_l5_n417(x)
+    end
+end
+
+def fun_l4_n854(x)
+    if (x < 1)
+        fun_l5_n411(x)
+    else
+        fun_l5_n848(x)
+    end
+end
+
+def fun_l4_n855(x)
+    if (x < 1)
+        fun_l5_n607(x)
+    else
+        fun_l5_n65(x)
+    end
+end
+
+def fun_l4_n856(x)
+    if (x < 1)
+        fun_l5_n240(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n857(x)
+    if (x < 1)
+        fun_l5_n165(x)
+    else
+        fun_l5_n362(x)
+    end
+end
+
+def fun_l4_n858(x)
+    if (x < 1)
+        fun_l5_n559(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n859(x)
+    if (x < 1)
+        fun_l5_n834(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n860(x)
+    if (x < 1)
+        fun_l5_n891(x)
+    else
+        fun_l5_n369(x)
+    end
+end
+
+def fun_l4_n861(x)
+    if (x < 1)
+        fun_l5_n676(x)
+    else
+        fun_l5_n614(x)
+    end
+end
+
+def fun_l4_n862(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n863(x)
+    if (x < 1)
+        fun_l5_n991(x)
+    else
+        fun_l5_n997(x)
+    end
+end
+
+def fun_l4_n864(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n865(x)
+    if (x < 1)
+        fun_l5_n623(x)
+    else
+        fun_l5_n741(x)
+    end
+end
+
+def fun_l4_n866(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n953(x)
+    end
+end
+
+def fun_l4_n867(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n868(x)
+    if (x < 1)
+        fun_l5_n814(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n869(x)
+    if (x < 1)
+        fun_l5_n163(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n870(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n524(x)
+    end
+end
+
+def fun_l4_n871(x)
+    if (x < 1)
+        fun_l5_n589(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n872(x)
+    if (x < 1)
+        fun_l5_n922(x)
+    else
+        fun_l5_n401(x)
+    end
+end
+
+def fun_l4_n873(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n184(x)
+    end
+end
+
+def fun_l4_n874(x)
+    if (x < 1)
+        fun_l5_n424(x)
+    else
+        fun_l5_n627(x)
+    end
+end
+
+def fun_l4_n875(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n127(x)
+    end
+end
+
+def fun_l4_n876(x)
+    if (x < 1)
+        fun_l5_n687(x)
+    else
+        fun_l5_n451(x)
+    end
+end
+
+def fun_l4_n877(x)
+    if (x < 1)
+        fun_l5_n849(x)
+    else
+        fun_l5_n480(x)
+    end
+end
+
+def fun_l4_n878(x)
+    if (x < 1)
+        fun_l5_n801(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n879(x)
+    if (x < 1)
+        fun_l5_n964(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n880(x)
+    if (x < 1)
+        fun_l5_n483(x)
+    else
+        fun_l5_n817(x)
+    end
+end
+
+def fun_l4_n881(x)
+    if (x < 1)
+        fun_l5_n91(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n882(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n726(x)
+    end
+end
+
+def fun_l4_n883(x)
+    if (x < 1)
+        fun_l5_n63(x)
+    else
+        fun_l5_n570(x)
+    end
+end
+
+def fun_l4_n884(x)
+    if (x < 1)
+        fun_l5_n691(x)
+    else
+        fun_l5_n117(x)
+    end
+end
+
+def fun_l4_n885(x)
+    if (x < 1)
+        fun_l5_n262(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n886(x)
+    if (x < 1)
+        fun_l5_n678(x)
+    else
+        fun_l5_n108(x)
+    end
+end
+
+def fun_l4_n887(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n888(x)
+    if (x < 1)
+        fun_l5_n917(x)
+    else
+        fun_l5_n769(x)
+    end
+end
+
+def fun_l4_n889(x)
+    if (x < 1)
+        fun_l5_n191(x)
+    else
+        fun_l5_n662(x)
+    end
+end
+
+def fun_l4_n890(x)
+    if (x < 1)
+        fun_l5_n34(x)
+    else
+        fun_l5_n806(x)
+    end
+end
+
+def fun_l4_n891(x)
+    if (x < 1)
+        fun_l5_n705(x)
+    else
+        fun_l5_n198(x)
+    end
+end
+
+def fun_l4_n892(x)
+    if (x < 1)
+        fun_l5_n647(x)
+    else
+        fun_l5_n0(x)
+    end
+end
+
+def fun_l4_n893(x)
+    if (x < 1)
+        fun_l5_n336(x)
+    else
+        fun_l5_n795(x)
+    end
+end
+
+def fun_l4_n894(x)
+    if (x < 1)
+        fun_l5_n984(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n895(x)
+    if (x < 1)
+        fun_l5_n373(x)
+    else
+        fun_l5_n12(x)
+    end
+end
+
+def fun_l4_n896(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n897(x)
+    if (x < 1)
+        fun_l5_n67(x)
+    else
+        fun_l5_n183(x)
+    end
+end
+
+def fun_l4_n898(x)
+    if (x < 1)
+        fun_l5_n557(x)
+    else
+        fun_l5_n43(x)
+    end
+end
+
+def fun_l4_n899(x)
+    if (x < 1)
+        fun_l5_n210(x)
+    else
+        fun_l5_n904(x)
+    end
+end
+
+def fun_l4_n900(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n173(x)
+    end
+end
+
+def fun_l4_n901(x)
+    if (x < 1)
+        fun_l5_n268(x)
+    else
+        fun_l5_n907(x)
+    end
+end
+
+def fun_l4_n902(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n903(x)
+    if (x < 1)
+        fun_l5_n158(x)
+    else
+        fun_l5_n261(x)
+    end
+end
+
+def fun_l4_n904(x)
+    if (x < 1)
+        fun_l5_n677(x)
+    else
+        fun_l5_n880(x)
+    end
+end
+
+def fun_l4_n905(x)
+    if (x < 1)
+        fun_l5_n262(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n906(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n785(x)
+    end
+end
+
+def fun_l4_n907(x)
+    if (x < 1)
+        fun_l5_n629(x)
+    else
+        fun_l5_n312(x)
+    end
+end
+
+def fun_l4_n908(x)
+    if (x < 1)
+        fun_l5_n84(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n909(x)
+    if (x < 1)
+        fun_l5_n346(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n910(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n47(x)
+    end
+end
+
+def fun_l4_n911(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n912(x)
+    if (x < 1)
+        fun_l5_n493(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n913(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n176(x)
+    end
+end
+
+def fun_l4_n914(x)
+    if (x < 1)
+        fun_l5_n201(x)
+    else
+        fun_l5_n233(x)
+    end
+end
+
+def fun_l4_n915(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n916(x)
+    if (x < 1)
+        fun_l5_n734(x)
+    else
+        fun_l5_n685(x)
+    end
+end
+
+def fun_l4_n917(x)
+    if (x < 1)
+        fun_l5_n132(x)
+    else
+        fun_l5_n112(x)
+    end
+end
+
+def fun_l4_n918(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n196(x)
+    end
+end
+
+def fun_l4_n919(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n186(x)
+    end
+end
+
+def fun_l4_n920(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n810(x)
+    end
+end
+
+def fun_l4_n921(x)
+    if (x < 1)
+        fun_l5_n546(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n922(x)
+    if (x < 1)
+        fun_l5_n863(x)
+    else
+        fun_l5_n928(x)
+    end
+end
+
+def fun_l4_n923(x)
+    if (x < 1)
+        fun_l5_n485(x)
+    else
+        fun_l5_n182(x)
+    end
+end
+
+def fun_l4_n924(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n925(x)
+    if (x < 1)
+        fun_l5_n78(x)
+    else
+        fun_l5_n816(x)
+    end
+end
+
+def fun_l4_n926(x)
+    if (x < 1)
+        fun_l5_n797(x)
+    else
+        fun_l5_n761(x)
+    end
+end
+
+def fun_l4_n927(x)
+    if (x < 1)
+        fun_l5_n975(x)
+    else
+        fun_l5_n220(x)
+    end
+end
+
+def fun_l4_n928(x)
+    if (x < 1)
+        fun_l5_n213(x)
+    else
+        fun_l5_n815(x)
+    end
+end
+
+def fun_l4_n929(x)
+    if (x < 1)
+        fun_l5_n280(x)
+    else
+        fun_l5_n551(x)
+    end
+end
+
+def fun_l4_n930(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n629(x)
+    end
+end
+
+def fun_l4_n931(x)
+    if (x < 1)
+        fun_l5_n60(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n932(x)
+    if (x < 1)
+        fun_l5_n336(x)
+    else
+        fun_l5_n733(x)
+    end
+end
+
+def fun_l4_n933(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n48(x)
+    end
+end
+
+def fun_l4_n934(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n108(x)
+    end
+end
+
+def fun_l4_n935(x)
+    if (x < 1)
+        fun_l5_n994(x)
+    else
+        fun_l5_n95(x)
+    end
+end
+
+def fun_l4_n936(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n310(x)
+    end
+end
+
+def fun_l4_n937(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n380(x)
+    end
+end
+
+def fun_l4_n938(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n231(x)
+    end
+end
+
+def fun_l4_n939(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n940(x)
+    if (x < 1)
+        fun_l5_n311(x)
+    else
+        fun_l5_n611(x)
+    end
+end
+
+def fun_l4_n941(x)
+    if (x < 1)
+        fun_l5_n770(x)
+    else
+        fun_l5_n306(x)
+    end
+end
+
+def fun_l4_n942(x)
+    if (x < 1)
+        fun_l5_n649(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n943(x)
+    if (x < 1)
+        fun_l5_n935(x)
+    else
+        fun_l5_n991(x)
+    end
+end
+
+def fun_l4_n944(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n131(x)
+    end
+end
+
+def fun_l4_n945(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n309(x)
+    end
+end
+
+def fun_l4_n946(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n798(x)
+    end
+end
+
+def fun_l4_n947(x)
+    if (x < 1)
+        fun_l5_n817(x)
+    else
+        fun_l5_n122(x)
+    end
+end
+
+def fun_l4_n948(x)
+    if (x < 1)
+        fun_l5_n233(x)
+    else
+        fun_l5_n600(x)
+    end
+end
+
+def fun_l4_n949(x)
+    if (x < 1)
+        fun_l5_n908(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n950(x)
+    if (x < 1)
+        fun_l5_n71(x)
+    else
+        fun_l5_n893(x)
+    end
+end
+
+def fun_l4_n951(x)
+    if (x < 1)
+        fun_l5_n281(x)
+    else
+        fun_l5_n281(x)
+    end
+end
+
+def fun_l4_n952(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n164(x)
+    end
+end
+
+def fun_l4_n953(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n954(x)
+    if (x < 1)
+        fun_l5_n271(x)
+    else
+        fun_l5_n635(x)
+    end
+end
+
+def fun_l4_n955(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n202(x)
+    end
+end
+
+def fun_l4_n956(x)
+    if (x < 1)
+        fun_l5_n574(x)
+    else
+        fun_l5_n29(x)
+    end
+end
+
+def fun_l4_n957(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n96(x)
+    end
+end
+
+def fun_l4_n958(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n509(x)
+    end
+end
+
+def fun_l4_n959(x)
+    if (x < 1)
+        fun_l5_n400(x)
+    else
+        fun_l5_n195(x)
+    end
+end
+
+def fun_l4_n960(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n165(x)
+    end
+end
+
+def fun_l4_n961(x)
+    if (x < 1)
+        fun_l5_n276(x)
+    else
+        fun_l5_n935(x)
+    end
+end
+
+def fun_l4_n962(x)
+    if (x < 1)
+        fun_l5_n504(x)
+    else
+        fun_l5_n480(x)
+    end
+end
+
+def fun_l4_n963(x)
+    if (x < 1)
+        fun_l5_n152(x)
+    else
+        fun_l5_n397(x)
+    end
+end
+
+def fun_l4_n964(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n481(x)
+    end
+end
+
+def fun_l4_n965(x)
+    if (x < 1)
+        fun_l5_n882(x)
+    else
+        fun_l5_n116(x)
+    end
+end
+
+def fun_l4_n966(x)
+    if (x < 1)
+        fun_l5_n329(x)
+    else
+        fun_l5_n484(x)
+    end
+end
+
+def fun_l4_n967(x)
+    if (x < 1)
+        fun_l5_n369(x)
+    else
+        fun_l5_n680(x)
+    end
+end
+
+def fun_l4_n968(x)
+    if (x < 1)
+        fun_l5_n30(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n969(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n793(x)
+    end
+end
+
+def fun_l4_n970(x)
+    if (x < 1)
+        fun_l5_n796(x)
+    else
+        fun_l5_n387(x)
+    end
+end
+
+def fun_l4_n971(x)
+    if (x < 1)
+        fun_l5_n735(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n972(x)
+    if (x < 1)
+        fun_l5_n925(x)
+    else
+        fun_l5_n689(x)
+    end
+end
+
+def fun_l4_n973(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n998(x)
+    end
+end
+
+def fun_l4_n974(x)
+    if (x < 1)
+        fun_l5_n708(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n975(x)
+    if (x < 1)
+        fun_l5_n716(x)
+    else
+        fun_l5_n958(x)
+    end
+end
+
+def fun_l4_n976(x)
+    if (x < 1)
+        fun_l5_n488(x)
+    else
+        fun_l5_n299(x)
+    end
+end
+
+def fun_l4_n977(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n276(x)
+    end
+end
+
+def fun_l4_n978(x)
+    if (x < 1)
+        fun_l5_n219(x)
+    else
+        fun_l5_n76(x)
+    end
+end
+
+def fun_l4_n979(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n980(x)
+    if (x < 1)
+        fun_l5_n681(x)
+    else
+        fun_l5_n264(x)
+    end
+end
+
+def fun_l4_n981(x)
+    if (x < 1)
+        fun_l5_n630(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n982(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n97(x)
+    end
+end
+
+def fun_l4_n983(x)
+    if (x < 1)
+        fun_l5_n551(x)
+    else
+        fun_l5_n429(x)
+    end
+end
+
+def fun_l4_n984(x)
+    if (x < 1)
+        fun_l5_n304(x)
+    else
+        fun_l5_n192(x)
+    end
+end
+
+def fun_l4_n985(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n986(x)
+    if (x < 1)
+        fun_l5_n603(x)
+    else
+        fun_l5_n967(x)
+    end
+end
+
+def fun_l4_n987(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n785(x)
+    end
+end
+
+def fun_l4_n988(x)
+    if (x < 1)
+        fun_l5_n762(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n989(x)
+    if (x < 1)
+        fun_l5_n61(x)
+    else
+        fun_l5_n474(x)
+    end
+end
+
+def fun_l4_n990(x)
+    if (x < 1)
+        fun_l5_n465(x)
+    else
+        fun_l5_n878(x)
+    end
+end
+
+def fun_l4_n991(x)
+    if (x < 1)
+        fun_l5_n907(x)
+    else
+        fun_l5_n259(x)
+    end
+end
+
+def fun_l4_n992(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n378(x)
+    end
+end
+
+def fun_l4_n993(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n490(x)
+    end
+end
+
+def fun_l4_n994(x)
+    if (x < 1)
+        fun_l5_n105(x)
+    else
+        fun_l5_n675(x)
+    end
+end
+
+def fun_l4_n995(x)
+    if (x < 1)
+        fun_l5_n99(x)
+    else
+        fun_l5_n21(x)
+    end
+end
+
+def fun_l4_n996(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n997(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n427(x)
+    end
+end
+
+def fun_l4_n998(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n978(x)
+    end
+end
+
+def fun_l4_n999(x)
+    if (x < 1)
+        fun_l5_n537(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l5_n0(x)
+    if (x < 1)
+        fun_l6_n104(x)
+    else
+        fun_l6_n249(x)
+    end
+end
+
+def fun_l5_n1(x)
+    if (x < 1)
+        fun_l6_n260(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n2(x)
+    if (x < 1)
+        fun_l6_n974(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n3(x)
+    if (x < 1)
+        fun_l6_n883(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n4(x)
+    if (x < 1)
+        fun_l6_n134(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n5(x)
+    if (x < 1)
+        fun_l6_n573(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n6(x)
+    if (x < 1)
+        fun_l6_n221(x)
+    else
+        fun_l6_n843(x)
+    end
+end
+
+def fun_l5_n7(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n435(x)
+    end
+end
+
+def fun_l5_n8(x)
+    if (x < 1)
+        fun_l6_n43(x)
+    else
+        fun_l6_n598(x)
+    end
+end
+
+def fun_l5_n9(x)
+    if (x < 1)
+        fun_l6_n352(x)
+    else
+        fun_l6_n894(x)
+    end
+end
+
+def fun_l5_n10(x)
+    if (x < 1)
+        fun_l6_n161(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n11(x)
+    if (x < 1)
+        fun_l6_n432(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n12(x)
+    if (x < 1)
+        fun_l6_n863(x)
+    else
+        fun_l6_n940(x)
+    end
+end
+
+def fun_l5_n13(x)
+    if (x < 1)
+        fun_l6_n478(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n14(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n808(x)
+    end
+end
+
+def fun_l5_n15(x)
+    if (x < 1)
+        fun_l6_n86(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n16(x)
+    if (x < 1)
+        fun_l6_n492(x)
+    else
+        fun_l6_n704(x)
+    end
+end
+
+def fun_l5_n17(x)
+    if (x < 1)
+        fun_l6_n196(x)
+    else
+        fun_l6_n970(x)
+    end
+end
+
+def fun_l5_n18(x)
+    if (x < 1)
+        fun_l6_n325(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n19(x)
+    if (x < 1)
+        fun_l6_n559(x)
+    else
+        fun_l6_n269(x)
+    end
+end
+
+def fun_l5_n20(x)
+    if (x < 1)
+        fun_l6_n716(x)
+    else
+        fun_l6_n783(x)
+    end
+end
+
+def fun_l5_n21(x)
+    if (x < 1)
+        fun_l6_n978(x)
+    else
+        fun_l6_n306(x)
+    end
+end
+
+def fun_l5_n22(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n823(x)
+    end
+end
+
+def fun_l5_n23(x)
+    if (x < 1)
+        fun_l6_n675(x)
+    else
+        fun_l6_n684(x)
+    end
+end
+
+def fun_l5_n24(x)
+    if (x < 1)
+        fun_l6_n851(x)
+    else
+        fun_l6_n450(x)
+    end
+end
+
+def fun_l5_n25(x)
+    if (x < 1)
+        fun_l6_n745(x)
+    else
+        fun_l6_n370(x)
+    end
+end
+
+def fun_l5_n26(x)
+    if (x < 1)
+        fun_l6_n431(x)
+    else
+        fun_l6_n130(x)
+    end
+end
+
+def fun_l5_n27(x)
+    if (x < 1)
+        fun_l6_n105(x)
+    else
+        fun_l6_n205(x)
+    end
+end
+
+def fun_l5_n28(x)
+    if (x < 1)
+        fun_l6_n718(x)
+    else
+        fun_l6_n742(x)
+    end
+end
+
+def fun_l5_n29(x)
+    if (x < 1)
+        fun_l6_n977(x)
+    else
+        fun_l6_n63(x)
+    end
+end
+
+def fun_l5_n30(x)
+    if (x < 1)
+        fun_l6_n902(x)
+    else
+        fun_l6_n471(x)
+    end
+end
+
+def fun_l5_n31(x)
+    if (x < 1)
+        fun_l6_n76(x)
+    else
+        fun_l6_n960(x)
+    end
+end
+
+def fun_l5_n32(x)
+    if (x < 1)
+        fun_l6_n75(x)
+    else
+        fun_l6_n640(x)
+    end
+end
+
+def fun_l5_n33(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n769(x)
+    end
+end
+
+def fun_l5_n34(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n771(x)
+    end
+end
+
+def fun_l5_n35(x)
+    if (x < 1)
+        fun_l6_n734(x)
+    else
+        fun_l6_n370(x)
+    end
+end
+
+def fun_l5_n36(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n994(x)
+    end
+end
+
+def fun_l5_n37(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n392(x)
+    end
+end
+
+def fun_l5_n38(x)
+    if (x < 1)
+        fun_l6_n120(x)
+    else
+        fun_l6_n774(x)
+    end
+end
+
+def fun_l5_n39(x)
+    if (x < 1)
+        fun_l6_n402(x)
+    else
+        fun_l6_n572(x)
+    end
+end
+
+def fun_l5_n40(x)
+    if (x < 1)
+        fun_l6_n911(x)
+    else
+        fun_l6_n968(x)
+    end
+end
+
+def fun_l5_n41(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n656(x)
+    end
+end
+
+def fun_l5_n42(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n426(x)
+    end
+end
+
+def fun_l5_n43(x)
+    if (x < 1)
+        fun_l6_n650(x)
+    else
+        fun_l6_n932(x)
+    end
+end
+
+def fun_l5_n44(x)
+    if (x < 1)
+        fun_l6_n365(x)
+    else
+        fun_l6_n755(x)
+    end
+end
+
+def fun_l5_n45(x)
+    if (x < 1)
+        fun_l6_n738(x)
+    else
+        fun_l6_n432(x)
+    end
+end
+
+def fun_l5_n46(x)
+    if (x < 1)
+        fun_l6_n82(x)
+    else
+        fun_l6_n484(x)
+    end
+end
+
+def fun_l5_n47(x)
+    if (x < 1)
+        fun_l6_n64(x)
+    else
+        fun_l6_n610(x)
+    end
+end
+
+def fun_l5_n48(x)
+    if (x < 1)
+        fun_l6_n875(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n49(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n50(x)
+    if (x < 1)
+        fun_l6_n76(x)
+    else
+        fun_l6_n462(x)
+    end
+end
+
+def fun_l5_n51(x)
+    if (x < 1)
+        fun_l6_n225(x)
+    else
+        fun_l6_n526(x)
+    end
+end
+
+def fun_l5_n52(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n167(x)
+    end
+end
+
+def fun_l5_n53(x)
+    if (x < 1)
+        fun_l6_n270(x)
+    else
+        fun_l6_n821(x)
+    end
+end
+
+def fun_l5_n54(x)
+    if (x < 1)
+        fun_l6_n790(x)
+    else
+        fun_l6_n95(x)
+    end
+end
+
+def fun_l5_n55(x)
+    if (x < 1)
+        fun_l6_n38(x)
+    else
+        fun_l6_n32(x)
+    end
+end
+
+def fun_l5_n56(x)
+    if (x < 1)
+        fun_l6_n400(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n57(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n16(x)
+    end
+end
+
+def fun_l5_n58(x)
+    if (x < 1)
+        fun_l6_n303(x)
+    else
+        fun_l6_n858(x)
+    end
+end
+
+def fun_l5_n59(x)
+    if (x < 1)
+        fun_l6_n173(x)
+    else
+        fun_l6_n38(x)
+    end
+end
+
+def fun_l5_n60(x)
+    if (x < 1)
+        fun_l6_n466(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n61(x)
+    if (x < 1)
+        fun_l6_n687(x)
+    else
+        fun_l6_n208(x)
+    end
+end
+
+def fun_l5_n62(x)
+    if (x < 1)
+        fun_l6_n891(x)
+    else
+        fun_l6_n789(x)
+    end
+end
+
+def fun_l5_n63(x)
+    if (x < 1)
+        fun_l6_n664(x)
+    else
+        fun_l6_n133(x)
+    end
+end
+
+def fun_l5_n64(x)
+    if (x < 1)
+        fun_l6_n121(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n65(x)
+    if (x < 1)
+        fun_l6_n411(x)
+    else
+        fun_l6_n264(x)
+    end
+end
+
+def fun_l5_n66(x)
+    if (x < 1)
+        fun_l6_n528(x)
+    else
+        fun_l6_n662(x)
+    end
+end
+
+def fun_l5_n67(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n410(x)
+    end
+end
+
+def fun_l5_n68(x)
+    if (x < 1)
+        fun_l6_n29(x)
+    else
+        fun_l6_n946(x)
+    end
+end
+
+def fun_l5_n69(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n797(x)
+    end
+end
+
+def fun_l5_n70(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n71(x)
+    if (x < 1)
+        fun_l6_n920(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n72(x)
+    if (x < 1)
+        fun_l6_n725(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n73(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n555(x)
+    end
+end
+
+def fun_l5_n74(x)
+    if (x < 1)
+        fun_l6_n527(x)
+    else
+        fun_l6_n991(x)
+    end
+end
+
+def fun_l5_n75(x)
+    if (x < 1)
+        fun_l6_n46(x)
+    else
+        fun_l6_n440(x)
+    end
+end
+
+def fun_l5_n76(x)
+    if (x < 1)
+        fun_l6_n242(x)
+    else
+        fun_l6_n488(x)
+    end
+end
+
+def fun_l5_n77(x)
+    if (x < 1)
+        fun_l6_n211(x)
+    else
+        fun_l6_n760(x)
+    end
+end
+
+def fun_l5_n78(x)
+    if (x < 1)
+        fun_l6_n821(x)
+    else
+        fun_l6_n653(x)
+    end
+end
+
+def fun_l5_n79(x)
+    if (x < 1)
+        fun_l6_n559(x)
+    else
+        fun_l6_n425(x)
+    end
+end
+
+def fun_l5_n80(x)
+    if (x < 1)
+        fun_l6_n792(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n81(x)
+    if (x < 1)
+        fun_l6_n463(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n82(x)
+    if (x < 1)
+        fun_l6_n731(x)
+    else
+        fun_l6_n718(x)
+    end
+end
+
+def fun_l5_n83(x)
+    if (x < 1)
+        fun_l6_n377(x)
+    else
+        fun_l6_n137(x)
+    end
+end
+
+def fun_l5_n84(x)
+    if (x < 1)
+        fun_l6_n829(x)
+    else
+        fun_l6_n77(x)
+    end
+end
+
+def fun_l5_n85(x)
+    if (x < 1)
+        fun_l6_n714(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n86(x)
+    if (x < 1)
+        fun_l6_n47(x)
+    else
+        fun_l6_n527(x)
+    end
+end
+
+def fun_l5_n87(x)
+    if (x < 1)
+        fun_l6_n976(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n88(x)
+    if (x < 1)
+        fun_l6_n710(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n89(x)
+    if (x < 1)
+        fun_l6_n222(x)
+    else
+        fun_l6_n97(x)
+    end
+end
+
+def fun_l5_n90(x)
+    if (x < 1)
+        fun_l6_n862(x)
+    else
+        fun_l6_n627(x)
+    end
+end
+
+def fun_l5_n91(x)
+    if (x < 1)
+        fun_l6_n642(x)
+    else
+        fun_l6_n720(x)
+    end
+end
+
+def fun_l5_n92(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n93(x)
+    if (x < 1)
+        fun_l6_n776(x)
+    else
+        fun_l6_n879(x)
+    end
+end
+
+def fun_l5_n94(x)
+    if (x < 1)
+        fun_l6_n629(x)
+    else
+        fun_l6_n322(x)
+    end
+end
+
+def fun_l5_n95(x)
+    if (x < 1)
+        fun_l6_n119(x)
+    else
+        fun_l6_n134(x)
+    end
+end
+
+def fun_l5_n96(x)
+    if (x < 1)
+        fun_l6_n385(x)
+    else
+        fun_l6_n343(x)
+    end
+end
+
+def fun_l5_n97(x)
+    if (x < 1)
+        fun_l6_n110(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n98(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n762(x)
+    end
+end
+
+def fun_l5_n99(x)
+    if (x < 1)
+        fun_l6_n811(x)
+    else
+        fun_l6_n404(x)
+    end
+end
+
+def fun_l5_n100(x)
+    if (x < 1)
+        fun_l6_n893(x)
+    else
+        fun_l6_n120(x)
+    end
+end
+
+def fun_l5_n101(x)
+    if (x < 1)
+        fun_l6_n755(x)
+    else
+        fun_l6_n611(x)
+    end
+end
+
+def fun_l5_n102(x)
+    if (x < 1)
+        fun_l6_n65(x)
+    else
+        fun_l6_n897(x)
+    end
+end
+
+def fun_l5_n103(x)
+    if (x < 1)
+        fun_l6_n629(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n104(x)
+    if (x < 1)
+        fun_l6_n211(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n105(x)
+    if (x < 1)
+        fun_l6_n650(x)
+    else
+        fun_l6_n348(x)
+    end
+end
+
+def fun_l5_n106(x)
+    if (x < 1)
+        fun_l6_n966(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n107(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n668(x)
+    end
+end
+
+def fun_l5_n108(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n629(x)
+    end
+end
+
+def fun_l5_n109(x)
+    if (x < 1)
+        fun_l6_n96(x)
+    else
+        fun_l6_n578(x)
+    end
+end
+
+def fun_l5_n110(x)
+    if (x < 1)
+        fun_l6_n88(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n111(x)
+    if (x < 1)
+        fun_l6_n622(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n112(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n373(x)
+    end
+end
+
+def fun_l5_n113(x)
+    if (x < 1)
+        fun_l6_n464(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n114(x)
+    if (x < 1)
+        fun_l6_n703(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n115(x)
+    if (x < 1)
+        fun_l6_n63(x)
+    else
+        fun_l6_n260(x)
+    end
+end
+
+def fun_l5_n116(x)
+    if (x < 1)
+        fun_l6_n935(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n117(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n734(x)
+    end
+end
+
+def fun_l5_n118(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n163(x)
+    end
+end
+
+def fun_l5_n119(x)
+    if (x < 1)
+        fun_l6_n134(x)
+    else
+        fun_l6_n586(x)
+    end
+end
+
+def fun_l5_n120(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n121(x)
+    if (x < 1)
+        fun_l6_n585(x)
+    else
+        fun_l6_n793(x)
+    end
+end
+
+def fun_l5_n122(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n12(x)
+    end
+end
+
+def fun_l5_n123(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n386(x)
+    end
+end
+
+def fun_l5_n124(x)
+    if (x < 1)
+        fun_l6_n891(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n125(x)
+    if (x < 1)
+        fun_l6_n389(x)
+    else
+        fun_l6_n154(x)
+    end
+end
+
+def fun_l5_n126(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n127(x)
+    if (x < 1)
+        fun_l6_n646(x)
+    else
+        fun_l6_n661(x)
+    end
+end
+
+def fun_l5_n128(x)
+    if (x < 1)
+        fun_l6_n662(x)
+    else
+        fun_l6_n527(x)
+    end
+end
+
+def fun_l5_n129(x)
+    if (x < 1)
+        fun_l6_n329(x)
+    else
+        fun_l6_n310(x)
+    end
+end
+
+def fun_l5_n130(x)
+    if (x < 1)
+        fun_l6_n352(x)
+    else
+        fun_l6_n820(x)
+    end
+end
+
+def fun_l5_n131(x)
+    if (x < 1)
+        fun_l6_n551(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n132(x)
+    if (x < 1)
+        fun_l6_n586(x)
+    else
+        fun_l6_n340(x)
+    end
+end
+
+def fun_l5_n133(x)
+    if (x < 1)
+        fun_l6_n111(x)
+    else
+        fun_l6_n188(x)
+    end
+end
+
+def fun_l5_n134(x)
+    if (x < 1)
+        fun_l6_n261(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n135(x)
+    if (x < 1)
+        fun_l6_n540(x)
+    else
+        fun_l6_n854(x)
+    end
+end
+
+def fun_l5_n136(x)
+    if (x < 1)
+        fun_l6_n120(x)
+    else
+        fun_l6_n230(x)
+    end
+end
+
+def fun_l5_n137(x)
+    if (x < 1)
+        fun_l6_n837(x)
+    else
+        fun_l6_n606(x)
+    end
+end
+
+def fun_l5_n138(x)
+    if (x < 1)
+        fun_l6_n663(x)
+    else
+        fun_l6_n195(x)
+    end
+end
+
+def fun_l5_n139(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n768(x)
+    end
+end
+
+def fun_l5_n140(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n304(x)
+    end
+end
+
+def fun_l5_n141(x)
+    if (x < 1)
+        fun_l6_n927(x)
+    else
+        fun_l6_n122(x)
+    end
+end
+
+def fun_l5_n142(x)
+    if (x < 1)
+        fun_l6_n311(x)
+    else
+        fun_l6_n920(x)
+    end
+end
+
+def fun_l5_n143(x)
+    if (x < 1)
+        fun_l6_n887(x)
+    else
+        fun_l6_n598(x)
+    end
+end
+
+def fun_l5_n144(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n894(x)
+    end
+end
+
+def fun_l5_n145(x)
+    if (x < 1)
+        fun_l6_n333(x)
+    else
+        fun_l6_n385(x)
+    end
+end
+
+def fun_l5_n146(x)
+    if (x < 1)
+        fun_l6_n926(x)
+    else
+        fun_l6_n310(x)
+    end
+end
+
+def fun_l5_n147(x)
+    if (x < 1)
+        fun_l6_n754(x)
+    else
+        fun_l6_n354(x)
+    end
+end
+
+def fun_l5_n148(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n634(x)
+    end
+end
+
+def fun_l5_n149(x)
+    if (x < 1)
+        fun_l6_n5(x)
+    else
+        fun_l6_n67(x)
+    end
+end
+
+def fun_l5_n150(x)
+    if (x < 1)
+        fun_l6_n766(x)
+    else
+        fun_l6_n237(x)
+    end
+end
+
+def fun_l5_n151(x)
+    if (x < 1)
+        fun_l6_n277(x)
+    else
+        fun_l6_n692(x)
+    end
+end
+
+def fun_l5_n152(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n216(x)
+    end
+end
+
+def fun_l5_n153(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n154(x)
+    if (x < 1)
+        fun_l6_n884(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n155(x)
+    if (x < 1)
+        fun_l6_n376(x)
+    else
+        fun_l6_n188(x)
+    end
+end
+
+def fun_l5_n156(x)
+    if (x < 1)
+        fun_l6_n276(x)
+    else
+        fun_l6_n19(x)
+    end
+end
+
+def fun_l5_n157(x)
+    if (x < 1)
+        fun_l6_n443(x)
+    else
+        fun_l6_n815(x)
+    end
+end
+
+def fun_l5_n158(x)
+    if (x < 1)
+        fun_l6_n610(x)
+    else
+        fun_l6_n341(x)
+    end
+end
+
+def fun_l5_n159(x)
+    if (x < 1)
+        fun_l6_n147(x)
+    else
+        fun_l6_n289(x)
+    end
+end
+
+def fun_l5_n160(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n161(x)
+    if (x < 1)
+        fun_l6_n544(x)
+    else
+        fun_l6_n621(x)
+    end
+end
+
+def fun_l5_n162(x)
+    if (x < 1)
+        fun_l6_n119(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n163(x)
+    if (x < 1)
+        fun_l6_n297(x)
+    else
+        fun_l6_n915(x)
+    end
+end
+
+def fun_l5_n164(x)
+    if (x < 1)
+        fun_l6_n782(x)
+    else
+        fun_l6_n499(x)
+    end
+end
+
+def fun_l5_n165(x)
+    if (x < 1)
+        fun_l6_n660(x)
+    else
+        fun_l6_n227(x)
+    end
+end
+
+def fun_l5_n166(x)
+    if (x < 1)
+        fun_l6_n820(x)
+    else
+        fun_l6_n822(x)
+    end
+end
+
+def fun_l5_n167(x)
+    if (x < 1)
+        fun_l6_n878(x)
+    else
+        fun_l6_n642(x)
+    end
+end
+
+def fun_l5_n168(x)
+    if (x < 1)
+        fun_l6_n123(x)
+    else
+        fun_l6_n451(x)
+    end
+end
+
+def fun_l5_n169(x)
+    if (x < 1)
+        fun_l6_n741(x)
+    else
+        fun_l6_n35(x)
+    end
+end
+
+def fun_l5_n170(x)
+    if (x < 1)
+        fun_l6_n522(x)
+    else
+        fun_l6_n546(x)
+    end
+end
+
+def fun_l5_n171(x)
+    if (x < 1)
+        fun_l6_n555(x)
+    else
+        fun_l6_n667(x)
+    end
+end
+
+def fun_l5_n172(x)
+    if (x < 1)
+        fun_l6_n760(x)
+    else
+        fun_l6_n292(x)
+    end
+end
+
+def fun_l5_n173(x)
+    if (x < 1)
+        fun_l6_n375(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n174(x)
+    if (x < 1)
+        fun_l6_n382(x)
+    else
+        fun_l6_n693(x)
+    end
+end
+
+def fun_l5_n175(x)
+    if (x < 1)
+        fun_l6_n728(x)
+    else
+        fun_l6_n378(x)
+    end
+end
+
+def fun_l5_n176(x)
+    if (x < 1)
+        fun_l6_n79(x)
+    else
+        fun_l6_n402(x)
+    end
+end
+
+def fun_l5_n177(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n500(x)
+    end
+end
+
+def fun_l5_n178(x)
+    if (x < 1)
+        fun_l6_n535(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n179(x)
+    if (x < 1)
+        fun_l6_n831(x)
+    else
+        fun_l6_n206(x)
+    end
+end
+
+def fun_l5_n180(x)
+    if (x < 1)
+        fun_l6_n878(x)
+    else
+        fun_l6_n715(x)
+    end
+end
+
+def fun_l5_n181(x)
+    if (x < 1)
+        fun_l6_n433(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n182(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n258(x)
+    end
+end
+
+def fun_l5_n183(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n29(x)
+    end
+end
+
+def fun_l5_n184(x)
+    if (x < 1)
+        fun_l6_n838(x)
+    else
+        fun_l6_n918(x)
+    end
+end
+
+def fun_l5_n185(x)
+    if (x < 1)
+        fun_l6_n307(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n186(x)
+    if (x < 1)
+        fun_l6_n564(x)
+    else
+        fun_l6_n73(x)
+    end
+end
+
+def fun_l5_n187(x)
+    if (x < 1)
+        fun_l6_n871(x)
+    else
+        fun_l6_n669(x)
+    end
+end
+
+def fun_l5_n188(x)
+    if (x < 1)
+        fun_l6_n546(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n189(x)
+    if (x < 1)
+        fun_l6_n312(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n190(x)
+    if (x < 1)
+        fun_l6_n519(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n191(x)
+    if (x < 1)
+        fun_l6_n525(x)
+    else
+        fun_l6_n228(x)
+    end
+end
+
+def fun_l5_n192(x)
+    if (x < 1)
+        fun_l6_n115(x)
+    else
+        fun_l6_n790(x)
+    end
+end
+
+def fun_l5_n193(x)
+    if (x < 1)
+        fun_l6_n976(x)
+    else
+        fun_l6_n219(x)
+    end
+end
+
+def fun_l5_n194(x)
+    if (x < 1)
+        fun_l6_n785(x)
+    else
+        fun_l6_n834(x)
+    end
+end
+
+def fun_l5_n195(x)
+    if (x < 1)
+        fun_l6_n238(x)
+    else
+        fun_l6_n471(x)
+    end
+end
+
+def fun_l5_n196(x)
+    if (x < 1)
+        fun_l6_n275(x)
+    else
+        fun_l6_n218(x)
+    end
+end
+
+def fun_l5_n197(x)
+    if (x < 1)
+        fun_l6_n590(x)
+    else
+        fun_l6_n458(x)
+    end
+end
+
+def fun_l5_n198(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n906(x)
+    end
+end
+
+def fun_l5_n199(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n885(x)
+    end
+end
+
+def fun_l5_n200(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n0(x)
+    end
+end
+
+def fun_l5_n201(x)
+    if (x < 1)
+        fun_l6_n31(x)
+    else
+        fun_l6_n729(x)
+    end
+end
+
+def fun_l5_n202(x)
+    if (x < 1)
+        fun_l6_n303(x)
+    else
+        fun_l6_n847(x)
+    end
+end
+
+def fun_l5_n203(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n346(x)
+    end
+end
+
+def fun_l5_n204(x)
+    if (x < 1)
+        fun_l6_n153(x)
+    else
+        fun_l6_n831(x)
+    end
+end
+
+def fun_l5_n205(x)
+    if (x < 1)
+        fun_l6_n424(x)
+    else
+        fun_l6_n836(x)
+    end
+end
+
+def fun_l5_n206(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n207(x)
+    end
+end
+
+def fun_l5_n207(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n241(x)
+    end
+end
+
+def fun_l5_n208(x)
+    if (x < 1)
+        fun_l6_n796(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n209(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n210(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n755(x)
+    end
+end
+
+def fun_l5_n211(x)
+    if (x < 1)
+        fun_l6_n345(x)
+    else
+        fun_l6_n747(x)
+    end
+end
+
+def fun_l5_n212(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n576(x)
+    end
+end
+
+def fun_l5_n213(x)
+    if (x < 1)
+        fun_l6_n713(x)
+    else
+        fun_l6_n678(x)
+    end
+end
+
+def fun_l5_n214(x)
+    if (x < 1)
+        fun_l6_n470(x)
+    else
+        fun_l6_n877(x)
+    end
+end
+
+def fun_l5_n215(x)
+    if (x < 1)
+        fun_l6_n78(x)
+    else
+        fun_l6_n315(x)
+    end
+end
+
+def fun_l5_n216(x)
+    if (x < 1)
+        fun_l6_n281(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n217(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n218(x)
+    if (x < 1)
+        fun_l6_n483(x)
+    else
+        fun_l6_n938(x)
+    end
+end
+
+def fun_l5_n219(x)
+    if (x < 1)
+        fun_l6_n102(x)
+    else
+        fun_l6_n690(x)
+    end
+end
+
+def fun_l5_n220(x)
+    if (x < 1)
+        fun_l6_n740(x)
+    else
+        fun_l6_n684(x)
+    end
+end
+
+def fun_l5_n221(x)
+    if (x < 1)
+        fun_l6_n366(x)
+    else
+        fun_l6_n138(x)
+    end
+end
+
+def fun_l5_n222(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n874(x)
+    end
+end
+
+def fun_l5_n223(x)
+    if (x < 1)
+        fun_l6_n828(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n224(x)
+    if (x < 1)
+        fun_l6_n739(x)
+    else
+        fun_l6_n569(x)
+    end
+end
+
+def fun_l5_n225(x)
+    if (x < 1)
+        fun_l6_n332(x)
+    else
+        fun_l6_n49(x)
+    end
+end
+
+def fun_l5_n226(x)
+    if (x < 1)
+        fun_l6_n783(x)
+    else
+        fun_l6_n20(x)
+    end
+end
+
+def fun_l5_n227(x)
+    if (x < 1)
+        fun_l6_n774(x)
+    else
+        fun_l6_n346(x)
+    end
+end
+
+def fun_l5_n228(x)
+    if (x < 1)
+        fun_l6_n637(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n229(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n697(x)
+    end
+end
+
+def fun_l5_n230(x)
+    if (x < 1)
+        fun_l6_n804(x)
+    else
+        fun_l6_n141(x)
+    end
+end
+
+def fun_l5_n231(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n88(x)
+    end
+end
+
+def fun_l5_n232(x)
+    if (x < 1)
+        fun_l6_n248(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n233(x)
+    if (x < 1)
+        fun_l6_n287(x)
+    else
+        fun_l6_n315(x)
+    end
+end
+
+def fun_l5_n234(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n235(x)
+    if (x < 1)
+        fun_l6_n162(x)
+    else
+        fun_l6_n710(x)
+    end
+end
+
+def fun_l5_n236(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n262(x)
+    end
+end
+
+def fun_l5_n237(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n238(x)
+    if (x < 1)
+        fun_l6_n578(x)
+    else
+        fun_l6_n792(x)
+    end
+end
+
+def fun_l5_n239(x)
+    if (x < 1)
+        fun_l6_n685(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n240(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n737(x)
+    end
+end
+
+def fun_l5_n241(x)
+    if (x < 1)
+        fun_l6_n360(x)
+    else
+        fun_l6_n751(x)
+    end
+end
+
+def fun_l5_n242(x)
+    if (x < 1)
+        fun_l6_n823(x)
+    else
+        fun_l6_n888(x)
+    end
+end
+
+def fun_l5_n243(x)
+    if (x < 1)
+        fun_l6_n743(x)
+    else
+        fun_l6_n705(x)
+    end
+end
+
+def fun_l5_n244(x)
+    if (x < 1)
+        fun_l6_n340(x)
+    else
+        fun_l6_n541(x)
+    end
+end
+
+def fun_l5_n245(x)
+    if (x < 1)
+        fun_l6_n324(x)
+    else
+        fun_l6_n121(x)
+    end
+end
+
+def fun_l5_n246(x)
+    if (x < 1)
+        fun_l6_n241(x)
+    else
+        fun_l6_n584(x)
+    end
+end
+
+def fun_l5_n247(x)
+    if (x < 1)
+        fun_l6_n468(x)
+    else
+        fun_l6_n673(x)
+    end
+end
+
+def fun_l5_n248(x)
+    if (x < 1)
+        fun_l6_n595(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n249(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n766(x)
+    end
+end
+
+def fun_l5_n250(x)
+    if (x < 1)
+        fun_l6_n322(x)
+    else
+        fun_l6_n904(x)
+    end
+end
+
+def fun_l5_n251(x)
+    if (x < 1)
+        fun_l6_n273(x)
+    else
+        fun_l6_n353(x)
+    end
+end
+
+def fun_l5_n252(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n253(x)
+    if (x < 1)
+        fun_l6_n552(x)
+    else
+        fun_l6_n649(x)
+    end
+end
+
+def fun_l5_n254(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n803(x)
+    end
+end
+
+def fun_l5_n255(x)
+    if (x < 1)
+        fun_l6_n763(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n256(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n70(x)
+    end
+end
+
+def fun_l5_n257(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n943(x)
+    end
+end
+
+def fun_l5_n258(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n761(x)
+    end
+end
+
+def fun_l5_n259(x)
+    if (x < 1)
+        fun_l6_n284(x)
+    else
+        fun_l6_n223(x)
+    end
+end
+
+def fun_l5_n260(x)
+    if (x < 1)
+        fun_l6_n189(x)
+    else
+        fun_l6_n455(x)
+    end
+end
+
+def fun_l5_n261(x)
+    if (x < 1)
+        fun_l6_n632(x)
+    else
+        fun_l6_n245(x)
+    end
+end
+
+def fun_l5_n262(x)
+    if (x < 1)
+        fun_l6_n940(x)
+    else
+        fun_l6_n38(x)
+    end
+end
+
+def fun_l5_n263(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n264(x)
+    if (x < 1)
+        fun_l6_n268(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n265(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n858(x)
+    end
+end
+
+def fun_l5_n266(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n809(x)
+    end
+end
+
+def fun_l5_n267(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n260(x)
+    end
+end
+
+def fun_l5_n268(x)
+    if (x < 1)
+        fun_l6_n442(x)
+    else
+        fun_l6_n738(x)
+    end
+end
+
+def fun_l5_n269(x)
+    if (x < 1)
+        fun_l6_n663(x)
+    else
+        fun_l6_n109(x)
+    end
+end
+
+def fun_l5_n270(x)
+    if (x < 1)
+        fun_l6_n302(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n271(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n251(x)
+    end
+end
+
+def fun_l5_n272(x)
+    if (x < 1)
+        fun_l6_n776(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n273(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n233(x)
+    end
+end
+
+def fun_l5_n274(x)
+    if (x < 1)
+        fun_l6_n530(x)
+    else
+        fun_l6_n487(x)
+    end
+end
+
+def fun_l5_n275(x)
+    if (x < 1)
+        fun_l6_n848(x)
+    else
+        fun_l6_n99(x)
+    end
+end
+
+def fun_l5_n276(x)
+    if (x < 1)
+        fun_l6_n126(x)
+    else
+        fun_l6_n914(x)
+    end
+end
+
+def fun_l5_n277(x)
+    if (x < 1)
+        fun_l6_n304(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n278(x)
+    if (x < 1)
+        fun_l6_n47(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n279(x)
+    if (x < 1)
+        fun_l6_n846(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n280(x)
+    if (x < 1)
+        fun_l6_n576(x)
+    else
+        fun_l6_n561(x)
+    end
+end
+
+def fun_l5_n281(x)
+    if (x < 1)
+        fun_l6_n307(x)
+    else
+        fun_l6_n545(x)
+    end
+end
+
+def fun_l5_n282(x)
+    if (x < 1)
+        fun_l6_n434(x)
+    else
+        fun_l6_n669(x)
+    end
+end
+
+def fun_l5_n283(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n147(x)
+    end
+end
+
+def fun_l5_n284(x)
+    if (x < 1)
+        fun_l6_n212(x)
+    else
+        fun_l6_n504(x)
+    end
+end
+
+def fun_l5_n285(x)
+    if (x < 1)
+        fun_l6_n193(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n286(x)
+    if (x < 1)
+        fun_l6_n569(x)
+    else
+        fun_l6_n100(x)
+    end
+end
+
+def fun_l5_n287(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n288(x)
+    if (x < 1)
+        fun_l6_n544(x)
+    else
+        fun_l6_n923(x)
+    end
+end
+
+def fun_l5_n289(x)
+    if (x < 1)
+        fun_l6_n317(x)
+    else
+        fun_l6_n255(x)
+    end
+end
+
+def fun_l5_n290(x)
+    if (x < 1)
+        fun_l6_n476(x)
+    else
+        fun_l6_n789(x)
+    end
+end
+
+def fun_l5_n291(x)
+    if (x < 1)
+        fun_l6_n324(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n292(x)
+    if (x < 1)
+        fun_l6_n704(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n293(x)
+    if (x < 1)
+        fun_l6_n994(x)
+    else
+        fun_l6_n637(x)
+    end
+end
+
+def fun_l5_n294(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n913(x)
+    end
+end
+
+def fun_l5_n295(x)
+    if (x < 1)
+        fun_l6_n579(x)
+    else
+        fun_l6_n795(x)
+    end
+end
+
+def fun_l5_n296(x)
+    if (x < 1)
+        fun_l6_n689(x)
+    else
+        fun_l6_n546(x)
+    end
+end
+
+def fun_l5_n297(x)
+    if (x < 1)
+        fun_l6_n971(x)
+    else
+        fun_l6_n493(x)
+    end
+end
+
+def fun_l5_n298(x)
+    if (x < 1)
+        fun_l6_n67(x)
+    else
+        fun_l6_n372(x)
+    end
+end
+
+def fun_l5_n299(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n921(x)
+    end
+end
+
+def fun_l5_n300(x)
+    if (x < 1)
+        fun_l6_n402(x)
+    else
+        fun_l6_n437(x)
+    end
+end
+
+def fun_l5_n301(x)
+    if (x < 1)
+        fun_l6_n448(x)
+    else
+        fun_l6_n177(x)
+    end
+end
+
+def fun_l5_n302(x)
+    if (x < 1)
+        fun_l6_n308(x)
+    else
+        fun_l6_n869(x)
+    end
+end
+
+def fun_l5_n303(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n848(x)
+    end
+end
+
+def fun_l5_n304(x)
+    if (x < 1)
+        fun_l6_n735(x)
+    else
+        fun_l6_n653(x)
+    end
+end
+
+def fun_l5_n305(x)
+    if (x < 1)
+        fun_l6_n393(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n306(x)
+    if (x < 1)
+        fun_l6_n821(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n307(x)
+    if (x < 1)
+        fun_l6_n734(x)
+    else
+        fun_l6_n498(x)
+    end
+end
+
+def fun_l5_n308(x)
+    if (x < 1)
+        fun_l6_n833(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n309(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n544(x)
+    end
+end
+
+def fun_l5_n310(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n823(x)
+    end
+end
+
+def fun_l5_n311(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n98(x)
+    end
+end
+
+def fun_l5_n312(x)
+    if (x < 1)
+        fun_l6_n78(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n313(x)
+    if (x < 1)
+        fun_l6_n286(x)
+    else
+        fun_l6_n230(x)
+    end
+end
+
+def fun_l5_n314(x)
+    if (x < 1)
+        fun_l6_n613(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n315(x)
+    if (x < 1)
+        fun_l6_n0(x)
+    else
+        fun_l6_n579(x)
+    end
+end
+
+def fun_l5_n316(x)
+    if (x < 1)
+        fun_l6_n991(x)
+    else
+        fun_l6_n379(x)
+    end
+end
+
+def fun_l5_n317(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n964(x)
+    end
+end
+
+def fun_l5_n318(x)
+    if (x < 1)
+        fun_l6_n707(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n319(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n320(x)
+    if (x < 1)
+        fun_l6_n684(x)
+    else
+        fun_l6_n333(x)
+    end
+end
+
+def fun_l5_n321(x)
+    if (x < 1)
+        fun_l6_n165(x)
+    else
+        fun_l6_n586(x)
+    end
+end
+
+def fun_l5_n322(x)
+    if (x < 1)
+        fun_l6_n28(x)
+    else
+        fun_l6_n53(x)
+    end
+end
+
+def fun_l5_n323(x)
+    if (x < 1)
+        fun_l6_n693(x)
+    else
+        fun_l6_n84(x)
+    end
+end
+
+def fun_l5_n324(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n445(x)
+    end
+end
+
+def fun_l5_n325(x)
+    if (x < 1)
+        fun_l6_n189(x)
+    else
+        fun_l6_n756(x)
+    end
+end
+
+def fun_l5_n326(x)
+    if (x < 1)
+        fun_l6_n147(x)
+    else
+        fun_l6_n709(x)
+    end
+end
+
+def fun_l5_n327(x)
+    if (x < 1)
+        fun_l6_n893(x)
+    else
+        fun_l6_n851(x)
+    end
+end
+
+def fun_l5_n328(x)
+    if (x < 1)
+        fun_l6_n685(x)
+    else
+        fun_l6_n399(x)
+    end
+end
+
+def fun_l5_n329(x)
+    if (x < 1)
+        fun_l6_n281(x)
+    else
+        fun_l6_n284(x)
+    end
+end
+
+def fun_l5_n330(x)
+    if (x < 1)
+        fun_l6_n579(x)
+    else
+        fun_l6_n671(x)
+    end
+end
+
+def fun_l5_n331(x)
+    if (x < 1)
+        fun_l6_n176(x)
+    else
+        fun_l6_n829(x)
+    end
+end
+
+def fun_l5_n332(x)
+    if (x < 1)
+        fun_l6_n209(x)
+    else
+        fun_l6_n91(x)
+    end
+end
+
+def fun_l5_n333(x)
+    if (x < 1)
+        fun_l6_n302(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n334(x)
+    if (x < 1)
+        fun_l6_n701(x)
+    else
+        fun_l6_n438(x)
+    end
+end
+
+def fun_l5_n335(x)
+    if (x < 1)
+        fun_l6_n923(x)
+    else
+        fun_l6_n613(x)
+    end
+end
+
+def fun_l5_n336(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n405(x)
+    end
+end
+
+def fun_l5_n337(x)
+    if (x < 1)
+        fun_l6_n187(x)
+    else
+        fun_l6_n953(x)
+    end
+end
+
+def fun_l5_n338(x)
+    if (x < 1)
+        fun_l6_n396(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n339(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n939(x)
+    end
+end
+
+def fun_l5_n340(x)
+    if (x < 1)
+        fun_l6_n665(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n341(x)
+    if (x < 1)
+        fun_l6_n125(x)
+    else
+        fun_l6_n817(x)
+    end
+end
+
+def fun_l5_n342(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n853(x)
+    end
+end
+
+def fun_l5_n343(x)
+    if (x < 1)
+        fun_l6_n724(x)
+    else
+        fun_l6_n633(x)
+    end
+end
+
+def fun_l5_n344(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n345(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n346(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n856(x)
+    end
+end
+
+def fun_l5_n347(x)
+    if (x < 1)
+        fun_l6_n617(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n348(x)
+    if (x < 1)
+        fun_l6_n560(x)
+    else
+        fun_l6_n24(x)
+    end
+end
+
+def fun_l5_n349(x)
+    if (x < 1)
+        fun_l6_n758(x)
+    else
+        fun_l6_n297(x)
+    end
+end
+
+def fun_l5_n350(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n673(x)
+    end
+end
+
+def fun_l5_n351(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n512(x)
+    end
+end
+
+def fun_l5_n352(x)
+    if (x < 1)
+        fun_l6_n250(x)
+    else
+        fun_l6_n819(x)
+    end
+end
+
+def fun_l5_n353(x)
+    if (x < 1)
+        fun_l6_n186(x)
+    else
+        fun_l6_n787(x)
+    end
+end
+
+def fun_l5_n354(x)
+    if (x < 1)
+        fun_l6_n217(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n355(x)
+    if (x < 1)
+        fun_l6_n827(x)
+    else
+        fun_l6_n439(x)
+    end
+end
+
+def fun_l5_n356(x)
+    if (x < 1)
+        fun_l6_n456(x)
+    else
+        fun_l6_n352(x)
+    end
+end
+
+def fun_l5_n357(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n236(x)
+    end
+end
+
+def fun_l5_n358(x)
+    if (x < 1)
+        fun_l6_n515(x)
+    else
+        fun_l6_n100(x)
+    end
+end
+
+def fun_l5_n359(x)
+    if (x < 1)
+        fun_l6_n28(x)
+    else
+        fun_l6_n820(x)
+    end
+end
+
+def fun_l5_n360(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n361(x)
+    if (x < 1)
+        fun_l6_n573(x)
+    else
+        fun_l6_n699(x)
+    end
+end
+
+def fun_l5_n362(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n548(x)
+    end
+end
+
+def fun_l5_n363(x)
+    if (x < 1)
+        fun_l6_n712(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n364(x)
+    if (x < 1)
+        fun_l6_n457(x)
+    else
+        fun_l6_n447(x)
+    end
+end
+
+def fun_l5_n365(x)
+    if (x < 1)
+        fun_l6_n684(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n366(x)
+    if (x < 1)
+        fun_l6_n217(x)
+    else
+        fun_l6_n344(x)
+    end
+end
+
+def fun_l5_n367(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n368(x)
+    if (x < 1)
+        fun_l6_n224(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n369(x)
+    if (x < 1)
+        fun_l6_n517(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n370(x)
+    if (x < 1)
+        fun_l6_n511(x)
+    else
+        fun_l6_n27(x)
+    end
+end
+
+def fun_l5_n371(x)
+    if (x < 1)
+        fun_l6_n485(x)
+    else
+        fun_l6_n288(x)
+    end
+end
+
+def fun_l5_n372(x)
+    if (x < 1)
+        fun_l6_n931(x)
+    else
+        fun_l6_n473(x)
+    end
+end
+
+def fun_l5_n373(x)
+    if (x < 1)
+        fun_l6_n381(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n374(x)
+    if (x < 1)
+        fun_l6_n132(x)
+    else
+        fun_l6_n243(x)
+    end
+end
+
+def fun_l5_n375(x)
+    if (x < 1)
+        fun_l6_n900(x)
+    else
+        fun_l6_n322(x)
+    end
+end
+
+def fun_l5_n376(x)
+    if (x < 1)
+        fun_l6_n787(x)
+    else
+        fun_l6_n588(x)
+    end
+end
+
+def fun_l5_n377(x)
+    if (x < 1)
+        fun_l6_n233(x)
+    else
+        fun_l6_n358(x)
+    end
+end
+
+def fun_l5_n378(x)
+    if (x < 1)
+        fun_l6_n601(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n379(x)
+    if (x < 1)
+        fun_l6_n682(x)
+    else
+        fun_l6_n63(x)
+    end
+end
+
+def fun_l5_n380(x)
+    if (x < 1)
+        fun_l6_n279(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n381(x)
+    if (x < 1)
+        fun_l6_n83(x)
+    else
+        fun_l6_n538(x)
+    end
+end
+
+def fun_l5_n382(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n194(x)
+    end
+end
+
+def fun_l5_n383(x)
+    if (x < 1)
+        fun_l6_n55(x)
+    else
+        fun_l6_n140(x)
+    end
+end
+
+def fun_l5_n384(x)
+    if (x < 1)
+        fun_l6_n165(x)
+    else
+        fun_l6_n784(x)
+    end
+end
+
+def fun_l5_n385(x)
+    if (x < 1)
+        fun_l6_n582(x)
+    else
+        fun_l6_n97(x)
+    end
+end
+
+def fun_l5_n386(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n935(x)
+    end
+end
+
+def fun_l5_n387(x)
+    if (x < 1)
+        fun_l6_n496(x)
+    else
+        fun_l6_n512(x)
+    end
+end
+
+def fun_l5_n388(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n389(x)
+    if (x < 1)
+        fun_l6_n172(x)
+    else
+        fun_l6_n731(x)
+    end
+end
+
+def fun_l5_n390(x)
+    if (x < 1)
+        fun_l6_n895(x)
+    else
+        fun_l6_n694(x)
+    end
+end
+
+def fun_l5_n391(x)
+    if (x < 1)
+        fun_l6_n336(x)
+    else
+        fun_l6_n551(x)
+    end
+end
+
+def fun_l5_n392(x)
+    if (x < 1)
+        fun_l6_n453(x)
+    else
+        fun_l6_n83(x)
+    end
+end
+
+def fun_l5_n393(x)
+    if (x < 1)
+        fun_l6_n571(x)
+    else
+        fun_l6_n293(x)
+    end
+end
+
+def fun_l5_n394(x)
+    if (x < 1)
+        fun_l6_n872(x)
+    else
+        fun_l6_n519(x)
+    end
+end
+
+def fun_l5_n395(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n396(x)
+    if (x < 1)
+        fun_l6_n961(x)
+    else
+        fun_l6_n367(x)
+    end
+end
+
+def fun_l5_n397(x)
+    if (x < 1)
+        fun_l6_n255(x)
+    else
+        fun_l6_n639(x)
+    end
+end
+
+def fun_l5_n398(x)
+    if (x < 1)
+        fun_l6_n970(x)
+    else
+        fun_l6_n465(x)
+    end
+end
+
+def fun_l5_n399(x)
+    if (x < 1)
+        fun_l6_n625(x)
+    else
+        fun_l6_n387(x)
+    end
+end
+
+def fun_l5_n400(x)
+    if (x < 1)
+        fun_l6_n537(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n401(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n0(x)
+    end
+end
+
+def fun_l5_n402(x)
+    if (x < 1)
+        fun_l6_n358(x)
+    else
+        fun_l6_n715(x)
+    end
+end
+
+def fun_l5_n403(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n729(x)
+    end
+end
+
+def fun_l5_n404(x)
+    if (x < 1)
+        fun_l6_n393(x)
+    else
+        fun_l6_n962(x)
+    end
+end
+
+def fun_l5_n405(x)
+    if (x < 1)
+        fun_l6_n995(x)
+    else
+        fun_l6_n835(x)
+    end
+end
+
+def fun_l5_n406(x)
+    if (x < 1)
+        fun_l6_n605(x)
+    else
+        fun_l6_n732(x)
+    end
+end
+
+def fun_l5_n407(x)
+    if (x < 1)
+        fun_l6_n132(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n408(x)
+    if (x < 1)
+        fun_l6_n311(x)
+    else
+        fun_l6_n972(x)
+    end
+end
+
+def fun_l5_n409(x)
+    if (x < 1)
+        fun_l6_n460(x)
+    else
+        fun_l6_n750(x)
+    end
+end
+
+def fun_l5_n410(x)
+    if (x < 1)
+        fun_l6_n237(x)
+    else
+        fun_l6_n463(x)
+    end
+end
+
+def fun_l5_n411(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n944(x)
+    end
+end
+
+def fun_l5_n412(x)
+    if (x < 1)
+        fun_l6_n123(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n413(x)
+    if (x < 1)
+        fun_l6_n371(x)
+    else
+        fun_l6_n589(x)
+    end
+end
+
+def fun_l5_n414(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n354(x)
+    end
+end
+
+def fun_l5_n415(x)
+    if (x < 1)
+        fun_l6_n580(x)
+    else
+        fun_l6_n330(x)
+    end
+end
+
+def fun_l5_n416(x)
+    if (x < 1)
+        fun_l6_n483(x)
+    else
+        fun_l6_n446(x)
+    end
+end
+
+def fun_l5_n417(x)
+    if (x < 1)
+        fun_l6_n834(x)
+    else
+        fun_l6_n284(x)
+    end
+end
+
+def fun_l5_n418(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n419(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n680(x)
+    end
+end
+
+def fun_l5_n420(x)
+    if (x < 1)
+        fun_l6_n101(x)
+    else
+        fun_l6_n4(x)
+    end
+end
+
+def fun_l5_n421(x)
+    if (x < 1)
+        fun_l6_n628(x)
+    else
+        fun_l6_n303(x)
+    end
+end
+
+def fun_l5_n422(x)
+    if (x < 1)
+        fun_l6_n521(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n423(x)
+    if (x < 1)
+        fun_l6_n589(x)
+    else
+        fun_l6_n134(x)
+    end
+end
+
+def fun_l5_n424(x)
+    if (x < 1)
+        fun_l6_n161(x)
+    else
+        fun_l6_n347(x)
+    end
+end
+
+def fun_l5_n425(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n988(x)
+    end
+end
+
+def fun_l5_n426(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n427(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n536(x)
+    end
+end
+
+def fun_l5_n428(x)
+    if (x < 1)
+        fun_l6_n792(x)
+    else
+        fun_l6_n253(x)
+    end
+end
+
+def fun_l5_n429(x)
+    if (x < 1)
+        fun_l6_n774(x)
+    else
+        fun_l6_n997(x)
+    end
+end
+
+def fun_l5_n430(x)
+    if (x < 1)
+        fun_l6_n876(x)
+    else
+        fun_l6_n798(x)
+    end
+end
+
+def fun_l5_n431(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n403(x)
+    end
+end
+
+def fun_l5_n432(x)
+    if (x < 1)
+        fun_l6_n920(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n433(x)
+    if (x < 1)
+        fun_l6_n887(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n434(x)
+    if (x < 1)
+        fun_l6_n413(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n435(x)
+    if (x < 1)
+        fun_l6_n474(x)
+    else
+        fun_l6_n107(x)
+    end
+end
+
+def fun_l5_n436(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n636(x)
+    end
+end
+
+def fun_l5_n437(x)
+    if (x < 1)
+        fun_l6_n616(x)
+    else
+        fun_l6_n615(x)
+    end
+end
+
+def fun_l5_n438(x)
+    if (x < 1)
+        fun_l6_n384(x)
+    else
+        fun_l6_n535(x)
+    end
+end
+
+def fun_l5_n439(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n929(x)
+    end
+end
+
+def fun_l5_n440(x)
+    if (x < 1)
+        fun_l6_n852(x)
+    else
+        fun_l6_n597(x)
+    end
+end
+
+def fun_l5_n441(x)
+    if (x < 1)
+        fun_l6_n246(x)
+    else
+        fun_l6_n991(x)
+    end
+end
+
+def fun_l5_n442(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n140(x)
+    end
+end
+
+def fun_l5_n443(x)
+    if (x < 1)
+        fun_l6_n815(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n444(x)
+    if (x < 1)
+        fun_l6_n153(x)
+    else
+        fun_l6_n902(x)
+    end
+end
+
+def fun_l5_n445(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n240(x)
+    end
+end
+
+def fun_l5_n446(x)
+    if (x < 1)
+        fun_l6_n398(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n447(x)
+    if (x < 1)
+        fun_l6_n537(x)
+    else
+        fun_l6_n8(x)
+    end
+end
+
+def fun_l5_n448(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n389(x)
+    end
+end
+
+def fun_l5_n449(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n17(x)
+    end
+end
+
+def fun_l5_n450(x)
+    if (x < 1)
+        fun_l6_n511(x)
+    else
+        fun_l6_n151(x)
+    end
+end
+
+def fun_l5_n451(x)
+    if (x < 1)
+        fun_l6_n640(x)
+    else
+        fun_l6_n785(x)
+    end
+end
+
+def fun_l5_n452(x)
+    if (x < 1)
+        fun_l6_n961(x)
+    else
+        fun_l6_n567(x)
+    end
+end
+
+def fun_l5_n453(x)
+    if (x < 1)
+        fun_l6_n608(x)
+    else
+        fun_l6_n910(x)
+    end
+end
+
+def fun_l5_n454(x)
+    if (x < 1)
+        fun_l6_n898(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n455(x)
+    if (x < 1)
+        fun_l6_n205(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n456(x)
+    if (x < 1)
+        fun_l6_n374(x)
+    else
+        fun_l6_n544(x)
+    end
+end
+
+def fun_l5_n457(x)
+    if (x < 1)
+        fun_l6_n514(x)
+    else
+        fun_l6_n522(x)
+    end
+end
+
+def fun_l5_n458(x)
+    if (x < 1)
+        fun_l6_n385(x)
+    else
+        fun_l6_n808(x)
+    end
+end
+
+def fun_l5_n459(x)
+    if (x < 1)
+        fun_l6_n525(x)
+    else
+        fun_l6_n144(x)
+    end
+end
+
+def fun_l5_n460(x)
+    if (x < 1)
+        fun_l6_n781(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n461(x)
+    if (x < 1)
+        fun_l6_n681(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n462(x)
+    if (x < 1)
+        fun_l6_n497(x)
+    else
+        fun_l6_n399(x)
+    end
+end
+
+def fun_l5_n463(x)
+    if (x < 1)
+        fun_l6_n261(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n464(x)
+    if (x < 1)
+        fun_l6_n64(x)
+    else
+        fun_l6_n253(x)
+    end
+end
+
+def fun_l5_n465(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n300(x)
+    end
+end
+
+def fun_l5_n466(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n277(x)
+    end
+end
+
+def fun_l5_n467(x)
+    if (x < 1)
+        fun_l6_n909(x)
+    else
+        fun_l6_n605(x)
+    end
+end
+
+def fun_l5_n468(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n870(x)
+    end
+end
+
+def fun_l5_n469(x)
+    if (x < 1)
+        fun_l6_n351(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n470(x)
+    if (x < 1)
+        fun_l6_n202(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n471(x)
+    if (x < 1)
+        fun_l6_n782(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n472(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n868(x)
+    end
+end
+
+def fun_l5_n473(x)
+    if (x < 1)
+        fun_l6_n556(x)
+    else
+        fun_l6_n722(x)
+    end
+end
+
+def fun_l5_n474(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n994(x)
+    end
+end
+
+def fun_l5_n475(x)
+    if (x < 1)
+        fun_l6_n266(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n476(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n477(x)
+    if (x < 1)
+        fun_l6_n284(x)
+    else
+        fun_l6_n90(x)
+    end
+end
+
+def fun_l5_n478(x)
+    if (x < 1)
+        fun_l6_n716(x)
+    else
+        fun_l6_n125(x)
+    end
+end
+
+def fun_l5_n479(x)
+    if (x < 1)
+        fun_l6_n136(x)
+    else
+        fun_l6_n232(x)
+    end
+end
+
+def fun_l5_n480(x)
+    if (x < 1)
+        fun_l6_n627(x)
+    else
+        fun_l6_n641(x)
+    end
+end
+
+def fun_l5_n481(x)
+    if (x < 1)
+        fun_l6_n411(x)
+    else
+        fun_l6_n943(x)
+    end
+end
+
+def fun_l5_n482(x)
+    if (x < 1)
+        fun_l6_n86(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n483(x)
+    if (x < 1)
+        fun_l6_n988(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n484(x)
+    if (x < 1)
+        fun_l6_n595(x)
+    else
+        fun_l6_n499(x)
+    end
+end
+
+def fun_l5_n485(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n267(x)
+    end
+end
+
+def fun_l5_n486(x)
+    if (x < 1)
+        fun_l6_n334(x)
+    else
+        fun_l6_n459(x)
+    end
+end
+
+def fun_l5_n487(x)
+    if (x < 1)
+        fun_l6_n771(x)
+    else
+        fun_l6_n458(x)
+    end
+end
+
+def fun_l5_n488(x)
+    if (x < 1)
+        fun_l6_n609(x)
+    else
+        fun_l6_n280(x)
+    end
+end
+
+def fun_l5_n489(x)
+    if (x < 1)
+        fun_l6_n564(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n490(x)
+    if (x < 1)
+        fun_l6_n271(x)
+    else
+        fun_l6_n904(x)
+    end
+end
+
+def fun_l5_n491(x)
+    if (x < 1)
+        fun_l6_n338(x)
+    else
+        fun_l6_n694(x)
+    end
+end
+
+def fun_l5_n492(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n191(x)
+    end
+end
+
+def fun_l5_n493(x)
+    if (x < 1)
+        fun_l6_n369(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n494(x)
+    if (x < 1)
+        fun_l6_n972(x)
+    else
+        fun_l6_n945(x)
+    end
+end
+
+def fun_l5_n495(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n96(x)
+    end
+end
+
+def fun_l5_n496(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n665(x)
+    end
+end
+
+def fun_l5_n497(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n468(x)
+    end
+end
+
+def fun_l5_n498(x)
+    if (x < 1)
+        fun_l6_n227(x)
+    else
+        fun_l6_n576(x)
+    end
+end
+
+def fun_l5_n499(x)
+    if (x < 1)
+        fun_l6_n356(x)
+    else
+        fun_l6_n614(x)
+    end
+end
+
+def fun_l5_n500(x)
+    if (x < 1)
+        fun_l6_n256(x)
+    else
+        fun_l6_n237(x)
+    end
+end
+
+def fun_l5_n501(x)
+    if (x < 1)
+        fun_l6_n503(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n502(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n503(x)
+    if (x < 1)
+        fun_l6_n778(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n504(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n950(x)
+    end
+end
+
+def fun_l5_n505(x)
+    if (x < 1)
+        fun_l6_n105(x)
+    else
+        fun_l6_n881(x)
+    end
+end
+
+def fun_l5_n506(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n71(x)
+    end
+end
+
+def fun_l5_n507(x)
+    if (x < 1)
+        fun_l6_n33(x)
+    else
+        fun_l6_n431(x)
+    end
+end
+
+def fun_l5_n508(x)
+    if (x < 1)
+        fun_l6_n587(x)
+    else
+        fun_l6_n1(x)
+    end
+end
+
+def fun_l5_n509(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n510(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n558(x)
+    end
+end
+
+def fun_l5_n511(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n10(x)
+    end
+end
+
+def fun_l5_n512(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n466(x)
+    end
+end
+
+def fun_l5_n513(x)
+    if (x < 1)
+        fun_l6_n580(x)
+    else
+        fun_l6_n398(x)
+    end
+end
+
+def fun_l5_n514(x)
+    if (x < 1)
+        fun_l6_n495(x)
+    else
+        fun_l6_n407(x)
+    end
+end
+
+def fun_l5_n515(x)
+    if (x < 1)
+        fun_l6_n639(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n516(x)
+    if (x < 1)
+        fun_l6_n15(x)
+    else
+        fun_l6_n716(x)
+    end
+end
+
+def fun_l5_n517(x)
+    if (x < 1)
+        fun_l6_n645(x)
+    else
+        fun_l6_n645(x)
+    end
+end
+
+def fun_l5_n518(x)
+    if (x < 1)
+        fun_l6_n615(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n519(x)
+    if (x < 1)
+        fun_l6_n399(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n520(x)
+    if (x < 1)
+        fun_l6_n85(x)
+    else
+        fun_l6_n870(x)
+    end
+end
+
+def fun_l5_n521(x)
+    if (x < 1)
+        fun_l6_n14(x)
+    else
+        fun_l6_n965(x)
+    end
+end
+
+def fun_l5_n522(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n581(x)
+    end
+end
+
+def fun_l5_n523(x)
+    if (x < 1)
+        fun_l6_n501(x)
+    else
+        fun_l6_n913(x)
+    end
+end
+
+def fun_l5_n524(x)
+    if (x < 1)
+        fun_l6_n772(x)
+    else
+        fun_l6_n999(x)
+    end
+end
+
+def fun_l5_n525(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n422(x)
+    end
+end
+
+def fun_l5_n526(x)
+    if (x < 1)
+        fun_l6_n377(x)
+    else
+        fun_l6_n986(x)
+    end
+end
+
+def fun_l5_n527(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n528(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n577(x)
+    end
+end
+
+def fun_l5_n529(x)
+    if (x < 1)
+        fun_l6_n101(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n530(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n958(x)
+    end
+end
+
+def fun_l5_n531(x)
+    if (x < 1)
+        fun_l6_n72(x)
+    else
+        fun_l6_n887(x)
+    end
+end
+
+def fun_l5_n532(x)
+    if (x < 1)
+        fun_l6_n467(x)
+    else
+        fun_l6_n740(x)
+    end
+end
+
+def fun_l5_n533(x)
+    if (x < 1)
+        fun_l6_n264(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n534(x)
+    if (x < 1)
+        fun_l6_n953(x)
+    else
+        fun_l6_n560(x)
+    end
+end
+
+def fun_l5_n535(x)
+    if (x < 1)
+        fun_l6_n854(x)
+    else
+        fun_l6_n59(x)
+    end
+end
+
+def fun_l5_n536(x)
+    if (x < 1)
+        fun_l6_n940(x)
+    else
+        fun_l6_n832(x)
+    end
+end
+
+def fun_l5_n537(x)
+    if (x < 1)
+        fun_l6_n297(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n538(x)
+    if (x < 1)
+        fun_l6_n188(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n539(x)
+    if (x < 1)
+        fun_l6_n992(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n540(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n850(x)
+    end
+end
+
+def fun_l5_n541(x)
+    if (x < 1)
+        fun_l6_n858(x)
+    else
+        fun_l6_n948(x)
+    end
+end
+
+def fun_l5_n542(x)
+    if (x < 1)
+        fun_l6_n923(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n543(x)
+    if (x < 1)
+        fun_l6_n419(x)
+    else
+        fun_l6_n4(x)
+    end
+end
+
+def fun_l5_n544(x)
+    if (x < 1)
+        fun_l6_n766(x)
+    else
+        fun_l6_n147(x)
+    end
+end
+
+def fun_l5_n545(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n327(x)
+    end
+end
+
+def fun_l5_n546(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n662(x)
+    end
+end
+
+def fun_l5_n547(x)
+    if (x < 1)
+        fun_l6_n764(x)
+    else
+        fun_l6_n521(x)
+    end
+end
+
+def fun_l5_n548(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n549(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n599(x)
+    end
+end
+
+def fun_l5_n550(x)
+    if (x < 1)
+        fun_l6_n710(x)
+    else
+        fun_l6_n104(x)
+    end
+end
+
+def fun_l5_n551(x)
+    if (x < 1)
+        fun_l6_n677(x)
+    else
+        fun_l6_n184(x)
+    end
+end
+
+def fun_l5_n552(x)
+    if (x < 1)
+        fun_l6_n700(x)
+    else
+        fun_l6_n299(x)
+    end
+end
+
+def fun_l5_n553(x)
+    if (x < 1)
+        fun_l6_n688(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n554(x)
+    if (x < 1)
+        fun_l6_n771(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n555(x)
+    if (x < 1)
+        fun_l6_n164(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n556(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n235(x)
+    end
+end
+
+def fun_l5_n557(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n490(x)
+    end
+end
+
+def fun_l5_n558(x)
+    if (x < 1)
+        fun_l6_n476(x)
+    else
+        fun_l6_n612(x)
+    end
+end
+
+def fun_l5_n559(x)
+    if (x < 1)
+        fun_l6_n761(x)
+    else
+        fun_l6_n3(x)
+    end
+end
+
+def fun_l5_n560(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n832(x)
+    end
+end
+
+def fun_l5_n561(x)
+    if (x < 1)
+        fun_l6_n206(x)
+    else
+        fun_l6_n815(x)
+    end
+end
+
+def fun_l5_n562(x)
+    if (x < 1)
+        fun_l6_n180(x)
+    else
+        fun_l6_n640(x)
+    end
+end
+
+def fun_l5_n563(x)
+    if (x < 1)
+        fun_l6_n612(x)
+    else
+        fun_l6_n900(x)
+    end
+end
+
+def fun_l5_n564(x)
+    if (x < 1)
+        fun_l6_n31(x)
+    else
+        fun_l6_n290(x)
+    end
+end
+
+def fun_l5_n565(x)
+    if (x < 1)
+        fun_l6_n322(x)
+    else
+        fun_l6_n136(x)
+    end
+end
+
+def fun_l5_n566(x)
+    if (x < 1)
+        fun_l6_n657(x)
+    else
+        fun_l6_n649(x)
+    end
+end
+
+def fun_l5_n567(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n568(x)
+    if (x < 1)
+        fun_l6_n391(x)
+    else
+        fun_l6_n117(x)
+    end
+end
+
+def fun_l5_n569(x)
+    if (x < 1)
+        fun_l6_n868(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n570(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n638(x)
+    end
+end
+
+def fun_l5_n571(x)
+    if (x < 1)
+        fun_l6_n207(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n572(x)
+    if (x < 1)
+        fun_l6_n575(x)
+    else
+        fun_l6_n421(x)
+    end
+end
+
+def fun_l5_n573(x)
+    if (x < 1)
+        fun_l6_n757(x)
+    else
+        fun_l6_n515(x)
+    end
+end
+
+def fun_l5_n574(x)
+    if (x < 1)
+        fun_l6_n619(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n575(x)
+    if (x < 1)
+        fun_l6_n91(x)
+    else
+        fun_l6_n79(x)
+    end
+end
+
+def fun_l5_n576(x)
+    if (x < 1)
+        fun_l6_n492(x)
+    else
+        fun_l6_n938(x)
+    end
+end
+
+def fun_l5_n577(x)
+    if (x < 1)
+        fun_l6_n181(x)
+    else
+        fun_l6_n98(x)
+    end
+end
+
+def fun_l5_n578(x)
+    if (x < 1)
+        fun_l6_n823(x)
+    else
+        fun_l6_n528(x)
+    end
+end
+
+def fun_l5_n579(x)
+    if (x < 1)
+        fun_l6_n218(x)
+    else
+        fun_l6_n613(x)
+    end
+end
+
+def fun_l5_n580(x)
+    if (x < 1)
+        fun_l6_n81(x)
+    else
+        fun_l6_n318(x)
+    end
+end
+
+def fun_l5_n581(x)
+    if (x < 1)
+        fun_l6_n953(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n582(x)
+    if (x < 1)
+        fun_l6_n225(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n583(x)
+    if (x < 1)
+        fun_l6_n862(x)
+    else
+        fun_l6_n939(x)
+    end
+end
+
+def fun_l5_n584(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n585(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n320(x)
+    end
+end
+
+def fun_l5_n586(x)
+    if (x < 1)
+        fun_l6_n609(x)
+    else
+        fun_l6_n524(x)
+    end
+end
+
+def fun_l5_n587(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n350(x)
+    end
+end
+
+def fun_l5_n588(x)
+    if (x < 1)
+        fun_l6_n874(x)
+    else
+        fun_l6_n217(x)
+    end
+end
+
+def fun_l5_n589(x)
+    if (x < 1)
+        fun_l6_n989(x)
+    else
+        fun_l6_n62(x)
+    end
+end
+
+def fun_l5_n590(x)
+    if (x < 1)
+        fun_l6_n91(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n591(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n530(x)
+    end
+end
+
+def fun_l5_n592(x)
+    if (x < 1)
+        fun_l6_n635(x)
+    else
+        fun_l6_n268(x)
+    end
+end
+
+def fun_l5_n593(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n345(x)
+    end
+end
+
+def fun_l5_n594(x)
+    if (x < 1)
+        fun_l6_n450(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n595(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n596(x)
+    if (x < 1)
+        fun_l6_n724(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n597(x)
+    if (x < 1)
+        fun_l6_n809(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n598(x)
+    if (x < 1)
+        fun_l6_n799(x)
+    else
+        fun_l6_n59(x)
+    end
+end
+
+def fun_l5_n599(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n868(x)
+    end
+end
+
+def fun_l5_n600(x)
+    if (x < 1)
+        fun_l6_n459(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n601(x)
+    if (x < 1)
+        fun_l6_n321(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n602(x)
+    if (x < 1)
+        fun_l6_n561(x)
+    else
+        fun_l6_n413(x)
+    end
+end
+
+def fun_l5_n603(x)
+    if (x < 1)
+        fun_l6_n173(x)
+    else
+        fun_l6_n324(x)
+    end
+end
+
+def fun_l5_n604(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n605(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n996(x)
+    end
+end
+
+def fun_l5_n606(x)
+    if (x < 1)
+        fun_l6_n465(x)
+    else
+        fun_l6_n777(x)
+    end
+end
+
+def fun_l5_n607(x)
+    if (x < 1)
+        fun_l6_n744(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n608(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n751(x)
+    end
+end
+
+def fun_l5_n609(x)
+    if (x < 1)
+        fun_l6_n357(x)
+    else
+        fun_l6_n889(x)
+    end
+end
+
+def fun_l5_n610(x)
+    if (x < 1)
+        fun_l6_n534(x)
+    else
+        fun_l6_n628(x)
+    end
+end
+
+def fun_l5_n611(x)
+    if (x < 1)
+        fun_l6_n242(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n612(x)
+    if (x < 1)
+        fun_l6_n426(x)
+    else
+        fun_l6_n295(x)
+    end
+end
+
+def fun_l5_n613(x)
+    if (x < 1)
+        fun_l6_n218(x)
+    else
+        fun_l6_n194(x)
+    end
+end
+
+def fun_l5_n614(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n615(x)
+    if (x < 1)
+        fun_l6_n708(x)
+    else
+        fun_l6_n187(x)
+    end
+end
+
+def fun_l5_n616(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n384(x)
+    end
+end
+
+def fun_l5_n617(x)
+    if (x < 1)
+        fun_l6_n149(x)
+    else
+        fun_l6_n741(x)
+    end
+end
+
+def fun_l5_n618(x)
+    if (x < 1)
+        fun_l6_n889(x)
+    else
+        fun_l6_n768(x)
+    end
+end
+
+def fun_l5_n619(x)
+    if (x < 1)
+        fun_l6_n144(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n620(x)
+    if (x < 1)
+        fun_l6_n338(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n621(x)
+    if (x < 1)
+        fun_l6_n623(x)
+    else
+        fun_l6_n432(x)
+    end
+end
+
+def fun_l5_n622(x)
+    if (x < 1)
+        fun_l6_n139(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n623(x)
+    if (x < 1)
+        fun_l6_n371(x)
+    else
+        fun_l6_n297(x)
+    end
+end
+
+def fun_l5_n624(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n172(x)
+    end
+end
+
+def fun_l5_n625(x)
+    if (x < 1)
+        fun_l6_n506(x)
+    else
+        fun_l6_n7(x)
+    end
+end
+
+def fun_l5_n626(x)
+    if (x < 1)
+        fun_l6_n334(x)
+    else
+        fun_l6_n631(x)
+    end
+end
+
+def fun_l5_n627(x)
+    if (x < 1)
+        fun_l6_n209(x)
+    else
+        fun_l6_n316(x)
+    end
+end
+
+def fun_l5_n628(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n34(x)
+    end
+end
+
+def fun_l5_n629(x)
+    if (x < 1)
+        fun_l6_n6(x)
+    else
+        fun_l6_n818(x)
+    end
+end
+
+def fun_l5_n630(x)
+    if (x < 1)
+        fun_l6_n265(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n631(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n632(x)
+    if (x < 1)
+        fun_l6_n513(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n633(x)
+    if (x < 1)
+        fun_l6_n295(x)
+    else
+        fun_l6_n295(x)
+    end
+end
+
+def fun_l5_n634(x)
+    if (x < 1)
+        fun_l6_n158(x)
+    else
+        fun_l6_n971(x)
+    end
+end
+
+def fun_l5_n635(x)
+    if (x < 1)
+        fun_l6_n171(x)
+    else
+        fun_l6_n337(x)
+    end
+end
+
+def fun_l5_n636(x)
+    if (x < 1)
+        fun_l6_n943(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n637(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n638(x)
+    end
+end
+
+def fun_l5_n638(x)
+    if (x < 1)
+        fun_l6_n155(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n639(x)
+    if (x < 1)
+        fun_l6_n29(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n640(x)
+    if (x < 1)
+        fun_l6_n677(x)
+    else
+        fun_l6_n606(x)
+    end
+end
+
+def fun_l5_n641(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n571(x)
+    end
+end
+
+def fun_l5_n642(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n281(x)
+    end
+end
+
+def fun_l5_n643(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n686(x)
+    end
+end
+
+def fun_l5_n644(x)
+    if (x < 1)
+        fun_l6_n257(x)
+    else
+        fun_l6_n358(x)
+    end
+end
+
+def fun_l5_n645(x)
+    if (x < 1)
+        fun_l6_n949(x)
+    else
+        fun_l6_n15(x)
+    end
+end
+
+def fun_l5_n646(x)
+    if (x < 1)
+        fun_l6_n866(x)
+    else
+        fun_l6_n657(x)
+    end
+end
+
+def fun_l5_n647(x)
+    if (x < 1)
+        fun_l6_n624(x)
+    else
+        fun_l6_n390(x)
+    end
+end
+
+def fun_l5_n648(x)
+    if (x < 1)
+        fun_l6_n394(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n649(x)
+    if (x < 1)
+        fun_l6_n99(x)
+    else
+        fun_l6_n160(x)
+    end
+end
+
+def fun_l5_n650(x)
+    if (x < 1)
+        fun_l6_n84(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n651(x)
+    if (x < 1)
+        fun_l6_n635(x)
+    else
+        fun_l6_n507(x)
+    end
+end
+
+def fun_l5_n652(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n501(x)
+    end
+end
+
+def fun_l5_n653(x)
+    if (x < 1)
+        fun_l6_n171(x)
+    else
+        fun_l6_n645(x)
+    end
+end
+
+def fun_l5_n654(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n152(x)
+    end
+end
+
+def fun_l5_n655(x)
+    if (x < 1)
+        fun_l6_n210(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n656(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n657(x)
+    if (x < 1)
+        fun_l6_n671(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n658(x)
+    if (x < 1)
+        fun_l6_n939(x)
+    else
+        fun_l6_n580(x)
+    end
+end
+
+def fun_l5_n659(x)
+    if (x < 1)
+        fun_l6_n152(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n660(x)
+    if (x < 1)
+        fun_l6_n50(x)
+    else
+        fun_l6_n911(x)
+    end
+end
+
+def fun_l5_n661(x)
+    if (x < 1)
+        fun_l6_n700(x)
+    else
+        fun_l6_n972(x)
+    end
+end
+
+def fun_l5_n662(x)
+    if (x < 1)
+        fun_l6_n22(x)
+    else
+        fun_l6_n82(x)
+    end
+end
+
+def fun_l5_n663(x)
+    if (x < 1)
+        fun_l6_n51(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n664(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n289(x)
+    end
+end
+
+def fun_l5_n665(x)
+    if (x < 1)
+        fun_l6_n666(x)
+    else
+        fun_l6_n775(x)
+    end
+end
+
+def fun_l5_n666(x)
+    if (x < 1)
+        fun_l6_n373(x)
+    else
+        fun_l6_n175(x)
+    end
+end
+
+def fun_l5_n667(x)
+    if (x < 1)
+        fun_l6_n551(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n668(x)
+    if (x < 1)
+        fun_l6_n107(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n669(x)
+    if (x < 1)
+        fun_l6_n244(x)
+    else
+        fun_l6_n968(x)
+    end
+end
+
+def fun_l5_n670(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n671(x)
+    if (x < 1)
+        fun_l6_n48(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n672(x)
+    if (x < 1)
+        fun_l6_n373(x)
+    else
+        fun_l6_n937(x)
+    end
+end
+
+def fun_l5_n673(x)
+    if (x < 1)
+        fun_l6_n759(x)
+    else
+        fun_l6_n92(x)
+    end
+end
+
+def fun_l5_n674(x)
+    if (x < 1)
+        fun_l6_n380(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n675(x)
+    if (x < 1)
+        fun_l6_n916(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n676(x)
+    if (x < 1)
+        fun_l6_n110(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n677(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n35(x)
+    end
+end
+
+def fun_l5_n678(x)
+    if (x < 1)
+        fun_l6_n484(x)
+    else
+        fun_l6_n492(x)
+    end
+end
+
+def fun_l5_n679(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n279(x)
+    end
+end
+
+def fun_l5_n680(x)
+    if (x < 1)
+        fun_l6_n499(x)
+    else
+        fun_l6_n561(x)
+    end
+end
+
+def fun_l5_n681(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n682(x)
+    if (x < 1)
+        fun_l6_n191(x)
+    else
+        fun_l6_n686(x)
+    end
+end
+
+def fun_l5_n683(x)
+    if (x < 1)
+        fun_l6_n318(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n684(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n914(x)
+    end
+end
+
+def fun_l5_n685(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n945(x)
+    end
+end
+
+def fun_l5_n686(x)
+    if (x < 1)
+        fun_l6_n602(x)
+    else
+        fun_l6_n291(x)
+    end
+end
+
+def fun_l5_n687(x)
+    if (x < 1)
+        fun_l6_n999(x)
+    else
+        fun_l6_n86(x)
+    end
+end
+
+def fun_l5_n688(x)
+    if (x < 1)
+        fun_l6_n106(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n689(x)
+    if (x < 1)
+        fun_l6_n452(x)
+    else
+        fun_l6_n229(x)
+    end
+end
+
+def fun_l5_n690(x)
+    if (x < 1)
+        fun_l6_n672(x)
+    else
+        fun_l6_n587(x)
+    end
+end
+
+def fun_l5_n691(x)
+    if (x < 1)
+        fun_l6_n532(x)
+    else
+        fun_l6_n56(x)
+    end
+end
+
+def fun_l5_n692(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n552(x)
+    end
+end
+
+def fun_l5_n693(x)
+    if (x < 1)
+        fun_l6_n742(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n694(x)
+    if (x < 1)
+        fun_l6_n964(x)
+    else
+        fun_l6_n475(x)
+    end
+end
+
+def fun_l5_n695(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n947(x)
+    end
+end
+
+def fun_l5_n696(x)
+    if (x < 1)
+        fun_l6_n563(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n697(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n698(x)
+    if (x < 1)
+        fun_l6_n178(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n699(x)
+    if (x < 1)
+        fun_l6_n248(x)
+    else
+        fun_l6_n288(x)
+    end
+end
+
+def fun_l5_n700(x)
+    if (x < 1)
+        fun_l6_n262(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n701(x)
+    if (x < 1)
+        fun_l6_n90(x)
+    else
+        fun_l6_n964(x)
+    end
+end
+
+def fun_l5_n702(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n743(x)
+    end
+end
+
+def fun_l5_n703(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n704(x)
+    if (x < 1)
+        fun_l6_n590(x)
+    else
+        fun_l6_n434(x)
+    end
+end
+
+def fun_l5_n705(x)
+    if (x < 1)
+        fun_l6_n875(x)
+    else
+        fun_l6_n539(x)
+    end
+end
+
+def fun_l5_n706(x)
+    if (x < 1)
+        fun_l6_n964(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n707(x)
+    if (x < 1)
+        fun_l6_n315(x)
+    else
+        fun_l6_n460(x)
+    end
+end
+
+def fun_l5_n708(x)
+    if (x < 1)
+        fun_l6_n139(x)
+    else
+        fun_l6_n210(x)
+    end
+end
+
+def fun_l5_n709(x)
+    if (x < 1)
+        fun_l6_n593(x)
+    else
+        fun_l6_n933(x)
+    end
+end
+
+def fun_l5_n710(x)
+    if (x < 1)
+        fun_l6_n37(x)
+    else
+        fun_l6_n459(x)
+    end
+end
+
+def fun_l5_n711(x)
+    if (x < 1)
+        fun_l6_n768(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n712(x)
+    if (x < 1)
+        fun_l6_n506(x)
+    else
+        fun_l6_n936(x)
+    end
+end
+
+def fun_l5_n713(x)
+    if (x < 1)
+        fun_l6_n971(x)
+    else
+        fun_l6_n575(x)
+    end
+end
+
+def fun_l5_n714(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n932(x)
+    end
+end
+
+def fun_l5_n715(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n949(x)
+    end
+end
+
+def fun_l5_n716(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n788(x)
+    end
+end
+
+def fun_l5_n717(x)
+    if (x < 1)
+        fun_l6_n405(x)
+    else
+        fun_l6_n803(x)
+    end
+end
+
+def fun_l5_n718(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n719(x)
+    if (x < 1)
+        fun_l6_n899(x)
+    else
+        fun_l6_n836(x)
+    end
+end
+
+def fun_l5_n720(x)
+    if (x < 1)
+        fun_l6_n805(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n721(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n722(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n533(x)
+    end
+end
+
+def fun_l5_n723(x)
+    if (x < 1)
+        fun_l6_n480(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n724(x)
+    if (x < 1)
+        fun_l6_n951(x)
+    else
+        fun_l6_n793(x)
+    end
+end
+
+def fun_l5_n725(x)
+    if (x < 1)
+        fun_l6_n951(x)
+    else
+        fun_l6_n771(x)
+    end
+end
+
+def fun_l5_n726(x)
+    if (x < 1)
+        fun_l6_n435(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n727(x)
+    if (x < 1)
+        fun_l6_n222(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n728(x)
+    if (x < 1)
+        fun_l6_n988(x)
+    else
+        fun_l6_n402(x)
+    end
+end
+
+def fun_l5_n729(x)
+    if (x < 1)
+        fun_l6_n9(x)
+    else
+        fun_l6_n46(x)
+    end
+end
+
+def fun_l5_n730(x)
+    if (x < 1)
+        fun_l6_n722(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n731(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n732(x)
+    if (x < 1)
+        fun_l6_n337(x)
+    else
+        fun_l6_n245(x)
+    end
+end
+
+def fun_l5_n733(x)
+    if (x < 1)
+        fun_l6_n84(x)
+    else
+        fun_l6_n335(x)
+    end
+end
+
+def fun_l5_n734(x)
+    if (x < 1)
+        fun_l6_n697(x)
+    else
+        fun_l6_n498(x)
+    end
+end
+
+def fun_l5_n735(x)
+    if (x < 1)
+        fun_l6_n2(x)
+    else
+        fun_l6_n895(x)
+    end
+end
+
+def fun_l5_n736(x)
+    if (x < 1)
+        fun_l6_n619(x)
+    else
+        fun_l6_n163(x)
+    end
+end
+
+def fun_l5_n737(x)
+    if (x < 1)
+        fun_l6_n237(x)
+    else
+        fun_l6_n6(x)
+    end
+end
+
+def fun_l5_n738(x)
+    if (x < 1)
+        fun_l6_n259(x)
+    else
+        fun_l6_n95(x)
+    end
+end
+
+def fun_l5_n739(x)
+    if (x < 1)
+        fun_l6_n98(x)
+    else
+        fun_l6_n331(x)
+    end
+end
+
+def fun_l5_n740(x)
+    if (x < 1)
+        fun_l6_n489(x)
+    else
+        fun_l6_n305(x)
+    end
+end
+
+def fun_l5_n741(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n525(x)
+    end
+end
+
+def fun_l5_n742(x)
+    if (x < 1)
+        fun_l6_n269(x)
+    else
+        fun_l6_n742(x)
+    end
+end
+
+def fun_l5_n743(x)
+    if (x < 1)
+        fun_l6_n194(x)
+    else
+        fun_l6_n254(x)
+    end
+end
+
+def fun_l5_n744(x)
+    if (x < 1)
+        fun_l6_n247(x)
+    else
+        fun_l6_n909(x)
+    end
+end
+
+def fun_l5_n745(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n657(x)
+    end
+end
+
+def fun_l5_n746(x)
+    if (x < 1)
+        fun_l6_n27(x)
+    else
+        fun_l6_n286(x)
+    end
+end
+
+def fun_l5_n747(x)
+    if (x < 1)
+        fun_l6_n659(x)
+    else
+        fun_l6_n895(x)
+    end
+end
+
+def fun_l5_n748(x)
+    if (x < 1)
+        fun_l6_n538(x)
+    else
+        fun_l6_n667(x)
+    end
+end
+
+def fun_l5_n749(x)
+    if (x < 1)
+        fun_l6_n208(x)
+    else
+        fun_l6_n493(x)
+    end
+end
+
+def fun_l5_n750(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n570(x)
+    end
+end
+
+def fun_l5_n751(x)
+    if (x < 1)
+        fun_l6_n437(x)
+    else
+        fun_l6_n716(x)
+    end
+end
+
+def fun_l5_n752(x)
+    if (x < 1)
+        fun_l6_n957(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n753(x)
+    if (x < 1)
+        fun_l6_n846(x)
+    else
+        fun_l6_n900(x)
+    end
+end
+
+def fun_l5_n754(x)
+    if (x < 1)
+        fun_l6_n81(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n755(x)
+    if (x < 1)
+        fun_l6_n735(x)
+    else
+        fun_l6_n232(x)
+    end
+end
+
+def fun_l5_n756(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n804(x)
+    end
+end
+
+def fun_l5_n757(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n155(x)
+    end
+end
+
+def fun_l5_n758(x)
+    if (x < 1)
+        fun_l6_n534(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n759(x)
+    if (x < 1)
+        fun_l6_n711(x)
+    else
+        fun_l6_n53(x)
+    end
+end
+
+def fun_l5_n760(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n734(x)
+    end
+end
+
+def fun_l5_n761(x)
+    if (x < 1)
+        fun_l6_n811(x)
+    else
+        fun_l6_n691(x)
+    end
+end
+
+def fun_l5_n762(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n570(x)
+    end
+end
+
+def fun_l5_n763(x)
+    if (x < 1)
+        fun_l6_n30(x)
+    else
+        fun_l6_n283(x)
+    end
+end
+
+def fun_l5_n764(x)
+    if (x < 1)
+        fun_l6_n270(x)
+    else
+        fun_l6_n965(x)
+    end
+end
+
+def fun_l5_n765(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n766(x)
+    if (x < 1)
+        fun_l6_n181(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n767(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n5(x)
+    end
+end
+
+def fun_l5_n768(x)
+    if (x < 1)
+        fun_l6_n296(x)
+    else
+        fun_l6_n940(x)
+    end
+end
+
+def fun_l5_n769(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n871(x)
+    end
+end
+
+def fun_l5_n770(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n128(x)
+    end
+end
+
+def fun_l5_n771(x)
+    if (x < 1)
+        fun_l6_n184(x)
+    else
+        fun_l6_n794(x)
+    end
+end
+
+def fun_l5_n772(x)
+    if (x < 1)
+        fun_l6_n571(x)
+    else
+        fun_l6_n337(x)
+    end
+end
+
+def fun_l5_n773(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n712(x)
+    end
+end
+
+def fun_l5_n774(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n944(x)
+    end
+end
+
+def fun_l5_n775(x)
+    if (x < 1)
+        fun_l6_n122(x)
+    else
+        fun_l6_n897(x)
+    end
+end
+
+def fun_l5_n776(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n202(x)
+    end
+end
+
+def fun_l5_n777(x)
+    if (x < 1)
+        fun_l6_n99(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n778(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n138(x)
+    end
+end
+
+def fun_l5_n779(x)
+    if (x < 1)
+        fun_l6_n56(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n780(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n238(x)
+    end
+end
+
+def fun_l5_n781(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n590(x)
+    end
+end
+
+def fun_l5_n782(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n522(x)
+    end
+end
+
+def fun_l5_n783(x)
+    if (x < 1)
+        fun_l6_n255(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n784(x)
+    if (x < 1)
+        fun_l6_n755(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n785(x)
+    if (x < 1)
+        fun_l6_n39(x)
+    else
+        fun_l6_n296(x)
+    end
+end
+
+def fun_l5_n786(x)
+    if (x < 1)
+        fun_l6_n17(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n787(x)
+    if (x < 1)
+        fun_l6_n814(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n788(x)
+    if (x < 1)
+        fun_l6_n791(x)
+    else
+        fun_l6_n688(x)
+    end
+end
+
+def fun_l5_n789(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n218(x)
+    end
+end
+
+def fun_l5_n790(x)
+    if (x < 1)
+        fun_l6_n227(x)
+    else
+        fun_l6_n391(x)
+    end
+end
+
+def fun_l5_n791(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n792(x)
+    if (x < 1)
+        fun_l6_n325(x)
+    else
+        fun_l6_n740(x)
+    end
+end
+
+def fun_l5_n793(x)
+    if (x < 1)
+        fun_l6_n926(x)
+    else
+        fun_l6_n133(x)
+    end
+end
+
+def fun_l5_n794(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n76(x)
+    end
+end
+
+def fun_l5_n795(x)
+    if (x < 1)
+        fun_l6_n332(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n796(x)
+    if (x < 1)
+        fun_l6_n584(x)
+    else
+        fun_l6_n298(x)
+    end
+end
+
+def fun_l5_n797(x)
+    if (x < 1)
+        fun_l6_n966(x)
+    else
+        fun_l6_n956(x)
+    end
+end
+
+def fun_l5_n798(x)
+    if (x < 1)
+        fun_l6_n604(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n799(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n800(x)
+    if (x < 1)
+        fun_l6_n805(x)
+    else
+        fun_l6_n83(x)
+    end
+end
+
+def fun_l5_n801(x)
+    if (x < 1)
+        fun_l6_n996(x)
+    else
+        fun_l6_n282(x)
+    end
+end
+
+def fun_l5_n802(x)
+    if (x < 1)
+        fun_l6_n759(x)
+    else
+        fun_l6_n681(x)
+    end
+end
+
+def fun_l5_n803(x)
+    if (x < 1)
+        fun_l6_n480(x)
+    else
+        fun_l6_n536(x)
+    end
+end
+
+def fun_l5_n804(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n805(x)
+    if (x < 1)
+        fun_l6_n992(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n806(x)
+    if (x < 1)
+        fun_l6_n446(x)
+    else
+        fun_l6_n553(x)
+    end
+end
+
+def fun_l5_n807(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n80(x)
+    end
+end
+
+def fun_l5_n808(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n525(x)
+    end
+end
+
+def fun_l5_n809(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n810(x)
+    if (x < 1)
+        fun_l6_n144(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n811(x)
+    if (x < 1)
+        fun_l6_n27(x)
+    else
+        fun_l6_n810(x)
+    end
+end
+
+def fun_l5_n812(x)
+    if (x < 1)
+        fun_l6_n244(x)
+    else
+        fun_l6_n696(x)
+    end
+end
+
+def fun_l5_n813(x)
+    if (x < 1)
+        fun_l6_n408(x)
+    else
+        fun_l6_n46(x)
+    end
+end
+
+def fun_l5_n814(x)
+    if (x < 1)
+        fun_l6_n496(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n815(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n765(x)
+    end
+end
+
+def fun_l5_n816(x)
+    if (x < 1)
+        fun_l6_n731(x)
+    else
+        fun_l6_n953(x)
+    end
+end
+
+def fun_l5_n817(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n849(x)
+    end
+end
+
+def fun_l5_n818(x)
+    if (x < 1)
+        fun_l6_n570(x)
+    else
+        fun_l6_n918(x)
+    end
+end
+
+def fun_l5_n819(x)
+    if (x < 1)
+        fun_l6_n473(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n820(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n271(x)
+    end
+end
+
+def fun_l5_n821(x)
+    if (x < 1)
+        fun_l6_n935(x)
+    else
+        fun_l6_n386(x)
+    end
+end
+
+def fun_l5_n822(x)
+    if (x < 1)
+        fun_l6_n210(x)
+    else
+        fun_l6_n871(x)
+    end
+end
+
+def fun_l5_n823(x)
+    if (x < 1)
+        fun_l6_n907(x)
+    else
+        fun_l6_n596(x)
+    end
+end
+
+def fun_l5_n824(x)
+    if (x < 1)
+        fun_l6_n701(x)
+    else
+        fun_l6_n541(x)
+    end
+end
+
+def fun_l5_n825(x)
+    if (x < 1)
+        fun_l6_n477(x)
+    else
+        fun_l6_n207(x)
+    end
+end
+
+def fun_l5_n826(x)
+    if (x < 1)
+        fun_l6_n95(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n827(x)
+    if (x < 1)
+        fun_l6_n908(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n828(x)
+    if (x < 1)
+        fun_l6_n213(x)
+    else
+        fun_l6_n607(x)
+    end
+end
+
+def fun_l5_n829(x)
+    if (x < 1)
+        fun_l6_n763(x)
+    else
+        fun_l6_n753(x)
+    end
+end
+
+def fun_l5_n830(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n157(x)
+    end
+end
+
+def fun_l5_n831(x)
+    if (x < 1)
+        fun_l6_n262(x)
+    else
+        fun_l6_n826(x)
+    end
+end
+
+def fun_l5_n832(x)
+    if (x < 1)
+        fun_l6_n743(x)
+    else
+        fun_l6_n37(x)
+    end
+end
+
+def fun_l5_n833(x)
+    if (x < 1)
+        fun_l6_n532(x)
+    else
+        fun_l6_n31(x)
+    end
+end
+
+def fun_l5_n834(x)
+    if (x < 1)
+        fun_l6_n309(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n835(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n721(x)
+    end
+end
+
+def fun_l5_n836(x)
+    if (x < 1)
+        fun_l6_n376(x)
+    else
+        fun_l6_n758(x)
+    end
+end
+
+def fun_l5_n837(x)
+    if (x < 1)
+        fun_l6_n558(x)
+    else
+        fun_l6_n474(x)
+    end
+end
+
+def fun_l5_n838(x)
+    if (x < 1)
+        fun_l6_n436(x)
+    else
+        fun_l6_n675(x)
+    end
+end
+
+def fun_l5_n839(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n12(x)
+    end
+end
+
+def fun_l5_n840(x)
+    if (x < 1)
+        fun_l6_n957(x)
+    else
+        fun_l6_n200(x)
+    end
+end
+
+def fun_l5_n841(x)
+    if (x < 1)
+        fun_l6_n180(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n842(x)
+    if (x < 1)
+        fun_l6_n510(x)
+    else
+        fun_l6_n73(x)
+    end
+end
+
+def fun_l5_n843(x)
+    if (x < 1)
+        fun_l6_n812(x)
+    else
+        fun_l6_n954(x)
+    end
+end
+
+def fun_l5_n844(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n866(x)
+    end
+end
+
+def fun_l5_n845(x)
+    if (x < 1)
+        fun_l6_n641(x)
+    else
+        fun_l6_n11(x)
+    end
+end
+
+def fun_l5_n846(x)
+    if (x < 1)
+        fun_l6_n607(x)
+    else
+        fun_l6_n884(x)
+    end
+end
+
+def fun_l5_n847(x)
+    if (x < 1)
+        fun_l6_n479(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n848(x)
+    if (x < 1)
+        fun_l6_n365(x)
+    else
+        fun_l6_n285(x)
+    end
+end
+
+def fun_l5_n849(x)
+    if (x < 1)
+        fun_l6_n296(x)
+    else
+        fun_l6_n708(x)
+    end
+end
+
+def fun_l5_n850(x)
+    if (x < 1)
+        fun_l6_n429(x)
+    else
+        fun_l6_n758(x)
+    end
+end
+
+def fun_l5_n851(x)
+    if (x < 1)
+        fun_l6_n881(x)
+    else
+        fun_l6_n848(x)
+    end
+end
+
+def fun_l5_n852(x)
+    if (x < 1)
+        fun_l6_n257(x)
+    else
+        fun_l6_n51(x)
+    end
+end
+
+def fun_l5_n853(x)
+    if (x < 1)
+        fun_l6_n441(x)
+    else
+        fun_l6_n445(x)
+    end
+end
+
+def fun_l5_n854(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n767(x)
+    end
+end
+
+def fun_l5_n855(x)
+    if (x < 1)
+        fun_l6_n196(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n856(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n860(x)
+    end
+end
+
+def fun_l5_n857(x)
+    if (x < 1)
+        fun_l6_n380(x)
+    else
+        fun_l6_n601(x)
+    end
+end
+
+def fun_l5_n858(x)
+    if (x < 1)
+        fun_l6_n272(x)
+    else
+        fun_l6_n376(x)
+    end
+end
+
+def fun_l5_n859(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n978(x)
+    end
+end
+
+def fun_l5_n860(x)
+    if (x < 1)
+        fun_l6_n52(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n861(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n929(x)
+    end
+end
+
+def fun_l5_n862(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n171(x)
+    end
+end
+
+def fun_l5_n863(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n864(x)
+    if (x < 1)
+        fun_l6_n539(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n865(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n866(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n761(x)
+    end
+end
+
+def fun_l5_n867(x)
+    if (x < 1)
+        fun_l6_n818(x)
+    else
+        fun_l6_n500(x)
+    end
+end
+
+def fun_l5_n868(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n661(x)
+    end
+end
+
+def fun_l5_n869(x)
+    if (x < 1)
+        fun_l6_n628(x)
+    else
+        fun_l6_n765(x)
+    end
+end
+
+def fun_l5_n870(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n181(x)
+    end
+end
+
+def fun_l5_n871(x)
+    if (x < 1)
+        fun_l6_n70(x)
+    else
+        fun_l6_n157(x)
+    end
+end
+
+def fun_l5_n872(x)
+    if (x < 1)
+        fun_l6_n133(x)
+    else
+        fun_l6_n806(x)
+    end
+end
+
+def fun_l5_n873(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n479(x)
+    end
+end
+
+def fun_l5_n874(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n567(x)
+    end
+end
+
+def fun_l5_n875(x)
+    if (x < 1)
+        fun_l6_n399(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n876(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n877(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n192(x)
+    end
+end
+
+def fun_l5_n878(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n473(x)
+    end
+end
+
+def fun_l5_n879(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n880(x)
+    if (x < 1)
+        fun_l6_n616(x)
+    else
+        fun_l6_n28(x)
+    end
+end
+
+def fun_l5_n881(x)
+    if (x < 1)
+        fun_l6_n315(x)
+    else
+        fun_l6_n92(x)
+    end
+end
+
+def fun_l5_n882(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n883(x)
+    if (x < 1)
+        fun_l6_n279(x)
+    else
+        fun_l6_n72(x)
+    end
+end
+
+def fun_l5_n884(x)
+    if (x < 1)
+        fun_l6_n206(x)
+    else
+        fun_l6_n384(x)
+    end
+end
+
+def fun_l5_n885(x)
+    if (x < 1)
+        fun_l6_n191(x)
+    else
+        fun_l6_n84(x)
+    end
+end
+
+def fun_l5_n886(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n495(x)
+    end
+end
+
+def fun_l5_n887(x)
+    if (x < 1)
+        fun_l6_n459(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n888(x)
+    if (x < 1)
+        fun_l6_n634(x)
+    else
+        fun_l6_n463(x)
+    end
+end
+
+def fun_l5_n889(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n469(x)
+    end
+end
+
+def fun_l5_n890(x)
+    if (x < 1)
+        fun_l6_n787(x)
+    else
+        fun_l6_n707(x)
+    end
+end
+
+def fun_l5_n891(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n223(x)
+    end
+end
+
+def fun_l5_n892(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n303(x)
+    end
+end
+
+def fun_l5_n893(x)
+    if (x < 1)
+        fun_l6_n85(x)
+    else
+        fun_l6_n802(x)
+    end
+end
+
+def fun_l5_n894(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n325(x)
+    end
+end
+
+def fun_l5_n895(x)
+    if (x < 1)
+        fun_l6_n491(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n896(x)
+    if (x < 1)
+        fun_l6_n809(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n897(x)
+    if (x < 1)
+        fun_l6_n739(x)
+    else
+        fun_l6_n192(x)
+    end
+end
+
+def fun_l5_n898(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n594(x)
+    end
+end
+
+def fun_l5_n899(x)
+    if (x < 1)
+        fun_l6_n256(x)
+    else
+        fun_l6_n521(x)
+    end
+end
+
+def fun_l5_n900(x)
+    if (x < 1)
+        fun_l6_n6(x)
+    else
+        fun_l6_n127(x)
+    end
+end
+
+def fun_l5_n901(x)
+    if (x < 1)
+        fun_l6_n655(x)
+    else
+        fun_l6_n426(x)
+    end
+end
+
+def fun_l5_n902(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n903(x)
+    if (x < 1)
+        fun_l6_n738(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n904(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n905(x)
+    if (x < 1)
+        fun_l6_n228(x)
+    else
+        fun_l6_n591(x)
+    end
+end
+
+def fun_l5_n906(x)
+    if (x < 1)
+        fun_l6_n292(x)
+    else
+        fun_l6_n55(x)
+    end
+end
+
+def fun_l5_n907(x)
+    if (x < 1)
+        fun_l6_n457(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n908(x)
+    if (x < 1)
+        fun_l6_n542(x)
+    else
+        fun_l6_n593(x)
+    end
+end
+
+def fun_l5_n909(x)
+    if (x < 1)
+        fun_l6_n478(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n910(x)
+    if (x < 1)
+        fun_l6_n780(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n911(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n912(x)
+    if (x < 1)
+        fun_l6_n17(x)
+    else
+        fun_l6_n837(x)
+    end
+end
+
+def fun_l5_n913(x)
+    if (x < 1)
+        fun_l6_n607(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n914(x)
+    if (x < 1)
+        fun_l6_n23(x)
+    else
+        fun_l6_n70(x)
+    end
+end
+
+def fun_l5_n915(x)
+    if (x < 1)
+        fun_l6_n778(x)
+    else
+        fun_l6_n643(x)
+    end
+end
+
+def fun_l5_n916(x)
+    if (x < 1)
+        fun_l6_n707(x)
+    else
+        fun_l6_n121(x)
+    end
+end
+
+def fun_l5_n917(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n67(x)
+    end
+end
+
+def fun_l5_n918(x)
+    if (x < 1)
+        fun_l6_n963(x)
+    else
+        fun_l6_n520(x)
+    end
+end
+
+def fun_l5_n919(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n920(x)
+    if (x < 1)
+        fun_l6_n198(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n921(x)
+    if (x < 1)
+        fun_l6_n364(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n922(x)
+    if (x < 1)
+        fun_l6_n7(x)
+    else
+        fun_l6_n314(x)
+    end
+end
+
+def fun_l5_n923(x)
+    if (x < 1)
+        fun_l6_n578(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n924(x)
+    if (x < 1)
+        fun_l6_n450(x)
+    else
+        fun_l6_n680(x)
+    end
+end
+
+def fun_l5_n925(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n973(x)
+    end
+end
+
+def fun_l5_n926(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n927(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n861(x)
+    end
+end
+
+def fun_l5_n928(x)
+    if (x < 1)
+        fun_l6_n40(x)
+    else
+        fun_l6_n665(x)
+    end
+end
+
+def fun_l5_n929(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n137(x)
+    end
+end
+
+def fun_l5_n930(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n931(x)
+    if (x < 1)
+        fun_l6_n310(x)
+    else
+        fun_l6_n986(x)
+    end
+end
+
+def fun_l5_n932(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n933(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n418(x)
+    end
+end
+
+def fun_l5_n934(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n589(x)
+    end
+end
+
+def fun_l5_n935(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n936(x)
+    if (x < 1)
+        fun_l6_n530(x)
+    else
+        fun_l6_n841(x)
+    end
+end
+
+def fun_l5_n937(x)
+    if (x < 1)
+        fun_l6_n431(x)
+    else
+        fun_l6_n531(x)
+    end
+end
+
+def fun_l5_n938(x)
+    if (x < 1)
+        fun_l6_n791(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n939(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n940(x)
+    if (x < 1)
+        fun_l6_n925(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n941(x)
+    if (x < 1)
+        fun_l6_n995(x)
+    else
+        fun_l6_n29(x)
+    end
+end
+
+def fun_l5_n942(x)
+    if (x < 1)
+        fun_l6_n984(x)
+    else
+        fun_l6_n455(x)
+    end
+end
+
+def fun_l5_n943(x)
+    if (x < 1)
+        fun_l6_n660(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n944(x)
+    if (x < 1)
+        fun_l6_n625(x)
+    else
+        fun_l6_n523(x)
+    end
+end
+
+def fun_l5_n945(x)
+    if (x < 1)
+        fun_l6_n407(x)
+    else
+        fun_l6_n766(x)
+    end
+end
+
+def fun_l5_n946(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n75(x)
+    end
+end
+
+def fun_l5_n947(x)
+    if (x < 1)
+        fun_l6_n465(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n948(x)
+    if (x < 1)
+        fun_l6_n750(x)
+    else
+        fun_l6_n278(x)
+    end
+end
+
+def fun_l5_n949(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n472(x)
+    end
+end
+
+def fun_l5_n950(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n71(x)
+    end
+end
+
+def fun_l5_n951(x)
+    if (x < 1)
+        fun_l6_n420(x)
+    else
+        fun_l6_n132(x)
+    end
+end
+
+def fun_l5_n952(x)
+    if (x < 1)
+        fun_l6_n112(x)
+    else
+        fun_l6_n396(x)
+    end
+end
+
+def fun_l5_n953(x)
+    if (x < 1)
+        fun_l6_n705(x)
+    else
+        fun_l6_n978(x)
+    end
+end
+
+def fun_l5_n954(x)
+    if (x < 1)
+        fun_l6_n761(x)
+    else
+        fun_l6_n136(x)
+    end
+end
+
+def fun_l5_n955(x)
+    if (x < 1)
+        fun_l6_n518(x)
+    else
+        fun_l6_n687(x)
+    end
+end
+
+def fun_l5_n956(x)
+    if (x < 1)
+        fun_l6_n308(x)
+    else
+        fun_l6_n34(x)
+    end
+end
+
+def fun_l5_n957(x)
+    if (x < 1)
+        fun_l6_n904(x)
+    else
+        fun_l6_n129(x)
+    end
+end
+
+def fun_l5_n958(x)
+    if (x < 1)
+        fun_l6_n271(x)
+    else
+        fun_l6_n444(x)
+    end
+end
+
+def fun_l5_n959(x)
+    if (x < 1)
+        fun_l6_n690(x)
+    else
+        fun_l6_n118(x)
+    end
+end
+
+def fun_l5_n960(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n957(x)
+    end
+end
+
+def fun_l5_n961(x)
+    if (x < 1)
+        fun_l6_n889(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n962(x)
+    if (x < 1)
+        fun_l6_n802(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n963(x)
+    if (x < 1)
+        fun_l6_n368(x)
+    else
+        fun_l6_n580(x)
+    end
+end
+
+def fun_l5_n964(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n925(x)
+    end
+end
+
+def fun_l5_n965(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n882(x)
+    end
+end
+
+def fun_l5_n966(x)
+    if (x < 1)
+        fun_l6_n9(x)
+    else
+        fun_l6_n5(x)
+    end
+end
+
+def fun_l5_n967(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n251(x)
+    end
+end
+
+def fun_l5_n968(x)
+    if (x < 1)
+        fun_l6_n804(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n969(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n235(x)
+    end
+end
+
+def fun_l5_n970(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n971(x)
+    if (x < 1)
+        fun_l6_n342(x)
+    else
+        fun_l6_n126(x)
+    end
+end
+
+def fun_l5_n972(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n674(x)
+    end
+end
+
+def fun_l5_n973(x)
+    if (x < 1)
+        fun_l6_n853(x)
+    else
+        fun_l6_n714(x)
+    end
+end
+
+def fun_l5_n974(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n905(x)
+    end
+end
+
+def fun_l5_n975(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n976(x)
+    if (x < 1)
+        fun_l6_n603(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n977(x)
+    if (x < 1)
+        fun_l6_n474(x)
+    else
+        fun_l6_n108(x)
+    end
+end
+
+def fun_l5_n978(x)
+    if (x < 1)
+        fun_l6_n347(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n979(x)
+    if (x < 1)
+        fun_l6_n593(x)
+    else
+        fun_l6_n575(x)
+    end
+end
+
+def fun_l5_n980(x)
+    if (x < 1)
+        fun_l6_n692(x)
+    else
+        fun_l6_n262(x)
+    end
+end
+
+def fun_l5_n981(x)
+    if (x < 1)
+        fun_l6_n226(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n982(x)
+    if (x < 1)
+        fun_l6_n357(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n983(x)
+    if (x < 1)
+        fun_l6_n784(x)
+    else
+        fun_l6_n584(x)
+    end
+end
+
+def fun_l5_n984(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n985(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n986(x)
+    if (x < 1)
+        fun_l6_n239(x)
+    else
+        fun_l6_n723(x)
+    end
+end
+
+def fun_l5_n987(x)
+    if (x < 1)
+        fun_l6_n928(x)
+    else
+        fun_l6_n403(x)
+    end
+end
+
+def fun_l5_n988(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n551(x)
+    end
+end
+
+def fun_l5_n989(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n475(x)
+    end
+end
+
+def fun_l5_n990(x)
+    if (x < 1)
+        fun_l6_n405(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n991(x)
+    if (x < 1)
+        fun_l6_n705(x)
+    else
+        fun_l6_n281(x)
+    end
+end
+
+def fun_l5_n992(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n465(x)
+    end
+end
+
+def fun_l5_n993(x)
+    if (x < 1)
+        fun_l6_n828(x)
+    else
+        fun_l6_n705(x)
+    end
+end
+
+def fun_l5_n994(x)
+    if (x < 1)
+        fun_l6_n687(x)
+    else
+        fun_l6_n451(x)
+    end
+end
+
+def fun_l5_n995(x)
+    if (x < 1)
+        fun_l6_n600(x)
+    else
+        fun_l6_n9(x)
+    end
+end
+
+def fun_l5_n996(x)
+    if (x < 1)
+        fun_l6_n205(x)
+    else
+        fun_l6_n242(x)
+    end
+end
+
+def fun_l5_n997(x)
+    if (x < 1)
+        fun_l6_n438(x)
+    else
+        fun_l6_n108(x)
+    end
+end
+
+def fun_l5_n998(x)
+    if (x < 1)
+        fun_l6_n164(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n999(x)
+    if (x < 1)
+        fun_l6_n533(x)
+    else
+        fun_l6_n685(x)
+    end
+end
+
+def fun_l6_n0(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n45(x)
+    end
+end
+
+def fun_l6_n1(x)
+    if (x < 1)
+        fun_l7_n685(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n2(x)
+    if (x < 1)
+        fun_l7_n325(x)
+    else
+        fun_l7_n365(x)
+    end
+end
+
+def fun_l6_n3(x)
+    if (x < 1)
+        fun_l7_n855(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n4(x)
+    if (x < 1)
+        fun_l7_n939(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n5(x)
+    if (x < 1)
+        fun_l7_n689(x)
+    else
+        fun_l7_n681(x)
+    end
+end
+
+def fun_l6_n6(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n307(x)
+    end
+end
+
+def fun_l6_n7(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n765(x)
+    end
+end
+
+def fun_l6_n8(x)
+    if (x < 1)
+        fun_l7_n85(x)
+    else
+        fun_l7_n967(x)
+    end
+end
+
+def fun_l6_n9(x)
+    if (x < 1)
+        fun_l7_n539(x)
+    else
+        fun_l7_n5(x)
+    end
+end
+
+def fun_l6_n10(x)
+    if (x < 1)
+        fun_l7_n503(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n11(x)
+    if (x < 1)
+        fun_l7_n24(x)
+    else
+        fun_l7_n374(x)
+    end
+end
+
+def fun_l6_n12(x)
+    if (x < 1)
+        fun_l7_n633(x)
+    else
+        fun_l7_n395(x)
+    end
+end
+
+def fun_l6_n13(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n7(x)
+    end
+end
+
+def fun_l6_n14(x)
+    if (x < 1)
+        fun_l7_n22(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n15(x)
+    if (x < 1)
+        fun_l7_n209(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n16(x)
+    if (x < 1)
+        fun_l7_n770(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n17(x)
+    if (x < 1)
+        fun_l7_n976(x)
+    else
+        fun_l7_n712(x)
+    end
+end
+
+def fun_l6_n18(x)
+    if (x < 1)
+        fun_l7_n762(x)
+    else
+        fun_l7_n307(x)
+    end
+end
+
+def fun_l6_n19(x)
+    if (x < 1)
+        fun_l7_n911(x)
+    else
+        fun_l7_n788(x)
+    end
+end
+
+def fun_l6_n20(x)
+    if (x < 1)
+        fun_l7_n40(x)
+    else
+        fun_l7_n269(x)
+    end
+end
+
+def fun_l6_n21(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n861(x)
+    end
+end
+
+def fun_l6_n22(x)
+    if (x < 1)
+        fun_l7_n591(x)
+    else
+        fun_l7_n557(x)
+    end
+end
+
+def fun_l6_n23(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n142(x)
+    end
+end
+
+def fun_l6_n24(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n25(x)
+    if (x < 1)
+        fun_l7_n630(x)
+    else
+        fun_l7_n784(x)
+    end
+end
+
+def fun_l6_n26(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n826(x)
+    end
+end
+
+def fun_l6_n27(x)
+    if (x < 1)
+        fun_l7_n223(x)
+    else
+        fun_l7_n800(x)
+    end
+end
+
+def fun_l6_n28(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n29(x)
+    if (x < 1)
+        fun_l7_n603(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n30(x)
+    if (x < 1)
+        fun_l7_n258(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n31(x)
+    if (x < 1)
+        fun_l7_n649(x)
+    else
+        fun_l7_n772(x)
+    end
+end
+
+def fun_l6_n32(x)
+    if (x < 1)
+        fun_l7_n999(x)
+    else
+        fun_l7_n592(x)
+    end
+end
+
+def fun_l6_n33(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n801(x)
+    end
+end
+
+def fun_l6_n34(x)
+    if (x < 1)
+        fun_l7_n905(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n35(x)
+    if (x < 1)
+        fun_l7_n142(x)
+    else
+        fun_l7_n933(x)
+    end
+end
+
+def fun_l6_n36(x)
+    if (x < 1)
+        fun_l7_n987(x)
+    else
+        fun_l7_n305(x)
+    end
+end
+
+def fun_l6_n37(x)
+    if (x < 1)
+        fun_l7_n360(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n38(x)
+    if (x < 1)
+        fun_l7_n799(x)
+    else
+        fun_l7_n938(x)
+    end
+end
+
+def fun_l6_n39(x)
+    if (x < 1)
+        fun_l7_n921(x)
+    else
+        fun_l7_n739(x)
+    end
+end
+
+def fun_l6_n40(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n236(x)
+    end
+end
+
+def fun_l6_n41(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n335(x)
+    end
+end
+
+def fun_l6_n42(x)
+    if (x < 1)
+        fun_l7_n33(x)
+    else
+        fun_l7_n521(x)
+    end
+end
+
+def fun_l6_n43(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n866(x)
+    end
+end
+
+def fun_l6_n44(x)
+    if (x < 1)
+        fun_l7_n808(x)
+    else
+        fun_l7_n394(x)
+    end
+end
+
+def fun_l6_n45(x)
+    if (x < 1)
+        fun_l7_n556(x)
+    else
+        fun_l7_n462(x)
+    end
+end
+
+def fun_l6_n46(x)
+    if (x < 1)
+        fun_l7_n72(x)
+    else
+        fun_l7_n558(x)
+    end
+end
+
+def fun_l6_n47(x)
+    if (x < 1)
+        fun_l7_n583(x)
+    else
+        fun_l7_n472(x)
+    end
+end
+
+def fun_l6_n48(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n264(x)
+    end
+end
+
+def fun_l6_n49(x)
+    if (x < 1)
+        fun_l7_n167(x)
+    else
+        fun_l7_n570(x)
+    end
+end
+
+def fun_l6_n50(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n127(x)
+    end
+end
+
+def fun_l6_n51(x)
+    if (x < 1)
+        fun_l7_n151(x)
+    else
+        fun_l7_n82(x)
+    end
+end
+
+def fun_l6_n52(x)
+    if (x < 1)
+        fun_l7_n729(x)
+    else
+        fun_l7_n785(x)
+    end
+end
+
+def fun_l6_n53(x)
+    if (x < 1)
+        fun_l7_n236(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n54(x)
+    if (x < 1)
+        fun_l7_n573(x)
+    else
+        fun_l7_n92(x)
+    end
+end
+
+def fun_l6_n55(x)
+    if (x < 1)
+        fun_l7_n601(x)
+    else
+        fun_l7_n531(x)
+    end
+end
+
+def fun_l6_n56(x)
+    if (x < 1)
+        fun_l7_n623(x)
+    else
+        fun_l7_n522(x)
+    end
+end
+
+def fun_l6_n57(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n830(x)
+    end
+end
+
+def fun_l6_n58(x)
+    if (x < 1)
+        fun_l7_n240(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n59(x)
+    if (x < 1)
+        fun_l7_n233(x)
+    else
+        fun_l7_n595(x)
+    end
+end
+
+def fun_l6_n60(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n605(x)
+    end
+end
+
+def fun_l6_n61(x)
+    if (x < 1)
+        fun_l7_n721(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n62(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n934(x)
+    end
+end
+
+def fun_l6_n63(x)
+    if (x < 1)
+        fun_l7_n724(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n64(x)
+    if (x < 1)
+        fun_l7_n144(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n65(x)
+    if (x < 1)
+        fun_l7_n618(x)
+    else
+        fun_l7_n19(x)
+    end
+end
+
+def fun_l6_n66(x)
+    if (x < 1)
+        fun_l7_n128(x)
+    else
+        fun_l7_n257(x)
+    end
+end
+
+def fun_l6_n67(x)
+    if (x < 1)
+        fun_l7_n623(x)
+    else
+        fun_l7_n182(x)
+    end
+end
+
+def fun_l6_n68(x)
+    if (x < 1)
+        fun_l7_n256(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n69(x)
+    if (x < 1)
+        fun_l7_n360(x)
+    else
+        fun_l7_n34(x)
+    end
+end
+
+def fun_l6_n70(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n813(x)
+    end
+end
+
+def fun_l6_n71(x)
+    if (x < 1)
+        fun_l7_n533(x)
+    else
+        fun_l7_n94(x)
+    end
+end
+
+def fun_l6_n72(x)
+    if (x < 1)
+        fun_l7_n245(x)
+    else
+        fun_l7_n548(x)
+    end
+end
+
+def fun_l6_n73(x)
+    if (x < 1)
+        fun_l7_n919(x)
+    else
+        fun_l7_n295(x)
+    end
+end
+
+def fun_l6_n74(x)
+    if (x < 1)
+        fun_l7_n925(x)
+    else
+        fun_l7_n965(x)
+    end
+end
+
+def fun_l6_n75(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n79(x)
+    end
+end
+
+def fun_l6_n76(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n96(x)
+    end
+end
+
+def fun_l6_n77(x)
+    if (x < 1)
+        fun_l7_n688(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n78(x)
+    if (x < 1)
+        fun_l7_n171(x)
+    else
+        fun_l7_n728(x)
+    end
+end
+
+def fun_l6_n79(x)
+    if (x < 1)
+        fun_l7_n786(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n80(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n3(x)
+    end
+end
+
+def fun_l6_n81(x)
+    if (x < 1)
+        fun_l7_n386(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n82(x)
+    if (x < 1)
+        fun_l7_n192(x)
+    else
+        fun_l7_n253(x)
+    end
+end
+
+def fun_l6_n83(x)
+    if (x < 1)
+        fun_l7_n534(x)
+    else
+        fun_l7_n4(x)
+    end
+end
+
+def fun_l6_n84(x)
+    if (x < 1)
+        fun_l7_n198(x)
+    else
+        fun_l7_n455(x)
+    end
+end
+
+def fun_l6_n85(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n86(x)
+    if (x < 1)
+        fun_l7_n147(x)
+    else
+        fun_l7_n893(x)
+    end
+end
+
+def fun_l6_n87(x)
+    if (x < 1)
+        fun_l7_n424(x)
+    else
+        fun_l7_n713(x)
+    end
+end
+
+def fun_l6_n88(x)
+    if (x < 1)
+        fun_l7_n867(x)
+    else
+        fun_l7_n561(x)
+    end
+end
+
+def fun_l6_n89(x)
+    if (x < 1)
+        fun_l7_n64(x)
+    else
+        fun_l7_n662(x)
+    end
+end
+
+def fun_l6_n90(x)
+    if (x < 1)
+        fun_l7_n849(x)
+    else
+        fun_l7_n105(x)
+    end
+end
+
+def fun_l6_n91(x)
+    if (x < 1)
+        fun_l7_n564(x)
+    else
+        fun_l7_n758(x)
+    end
+end
+
+def fun_l6_n92(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n713(x)
+    end
+end
+
+def fun_l6_n93(x)
+    if (x < 1)
+        fun_l7_n283(x)
+    else
+        fun_l7_n577(x)
+    end
+end
+
+def fun_l6_n94(x)
+    if (x < 1)
+        fun_l7_n951(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n95(x)
+    if (x < 1)
+        fun_l7_n966(x)
+    else
+        fun_l7_n789(x)
+    end
+end
+
+def fun_l6_n96(x)
+    if (x < 1)
+        fun_l7_n954(x)
+    else
+        fun_l7_n431(x)
+    end
+end
+
+def fun_l6_n97(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n847(x)
+    end
+end
+
+def fun_l6_n98(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n378(x)
+    end
+end
+
+def fun_l6_n99(x)
+    if (x < 1)
+        fun_l7_n951(x)
+    else
+        fun_l7_n688(x)
+    end
+end
+
+def fun_l6_n100(x)
+    if (x < 1)
+        fun_l7_n163(x)
+    else
+        fun_l7_n540(x)
+    end
+end
+
+def fun_l6_n101(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n10(x)
+    end
+end
+
+def fun_l6_n102(x)
+    if (x < 1)
+        fun_l7_n346(x)
+    else
+        fun_l7_n409(x)
+    end
+end
+
+def fun_l6_n103(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n432(x)
+    end
+end
+
+def fun_l6_n104(x)
+    if (x < 1)
+        fun_l7_n144(x)
+    else
+        fun_l7_n510(x)
+    end
+end
+
+def fun_l6_n105(x)
+    if (x < 1)
+        fun_l7_n568(x)
+    else
+        fun_l7_n756(x)
+    end
+end
+
+def fun_l6_n106(x)
+    if (x < 1)
+        fun_l7_n708(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n107(x)
+    if (x < 1)
+        fun_l7_n823(x)
+    else
+        fun_l7_n969(x)
+    end
+end
+
+def fun_l6_n108(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n211(x)
+    end
+end
+
+def fun_l6_n109(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n791(x)
+    end
+end
+
+def fun_l6_n110(x)
+    if (x < 1)
+        fun_l7_n392(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n111(x)
+    if (x < 1)
+        fun_l7_n355(x)
+    else
+        fun_l7_n222(x)
+    end
+end
+
+def fun_l6_n112(x)
+    if (x < 1)
+        fun_l7_n683(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n113(x)
+    if (x < 1)
+        fun_l7_n38(x)
+    else
+        fun_l7_n874(x)
+    end
+end
+
+def fun_l6_n114(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n209(x)
+    end
+end
+
+def fun_l6_n115(x)
+    if (x < 1)
+        fun_l7_n544(x)
+    else
+        fun_l7_n267(x)
+    end
+end
+
+def fun_l6_n116(x)
+    if (x < 1)
+        fun_l7_n701(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n117(x)
+    if (x < 1)
+        fun_l7_n283(x)
+    else
+        fun_l7_n979(x)
+    end
+end
+
+def fun_l6_n118(x)
+    if (x < 1)
+        fun_l7_n902(x)
+    else
+        fun_l7_n897(x)
+    end
+end
+
+def fun_l6_n119(x)
+    if (x < 1)
+        fun_l7_n115(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n120(x)
+    if (x < 1)
+        fun_l7_n804(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n121(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n666(x)
+    end
+end
+
+def fun_l6_n122(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n572(x)
+    end
+end
+
+def fun_l6_n123(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n124(x)
+    if (x < 1)
+        fun_l7_n0(x)
+    else
+        fun_l7_n514(x)
+    end
+end
+
+def fun_l6_n125(x)
+    if (x < 1)
+        fun_l7_n916(x)
+    else
+        fun_l7_n633(x)
+    end
+end
+
+def fun_l6_n126(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n379(x)
+    end
+end
+
+def fun_l6_n127(x)
+    if (x < 1)
+        fun_l7_n316(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n128(x)
+    if (x < 1)
+        fun_l7_n402(x)
+    else
+        fun_l7_n237(x)
+    end
+end
+
+def fun_l6_n129(x)
+    if (x < 1)
+        fun_l7_n303(x)
+    else
+        fun_l7_n61(x)
+    end
+end
+
+def fun_l6_n130(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n732(x)
+    end
+end
+
+def fun_l6_n131(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n472(x)
+    end
+end
+
+def fun_l6_n132(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n546(x)
+    end
+end
+
+def fun_l6_n133(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n134(x)
+    if (x < 1)
+        fun_l7_n594(x)
+    else
+        fun_l7_n607(x)
+    end
+end
+
+def fun_l6_n135(x)
+    if (x < 1)
+        fun_l7_n642(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n136(x)
+    if (x < 1)
+        fun_l7_n879(x)
+    else
+        fun_l7_n521(x)
+    end
+end
+
+def fun_l6_n137(x)
+    if (x < 1)
+        fun_l7_n362(x)
+    else
+        fun_l7_n564(x)
+    end
+end
+
+def fun_l6_n138(x)
+    if (x < 1)
+        fun_l7_n590(x)
+    else
+        fun_l7_n59(x)
+    end
+end
+
+def fun_l6_n139(x)
+    if (x < 1)
+        fun_l7_n464(x)
+    else
+        fun_l7_n563(x)
+    end
+end
+
+def fun_l6_n140(x)
+    if (x < 1)
+        fun_l7_n710(x)
+    else
+        fun_l7_n890(x)
+    end
+end
+
+def fun_l6_n141(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n470(x)
+    end
+end
+
+def fun_l6_n142(x)
+    if (x < 1)
+        fun_l7_n160(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n143(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n286(x)
+    end
+end
+
+def fun_l6_n144(x)
+    if (x < 1)
+        fun_l7_n193(x)
+    else
+        fun_l7_n657(x)
+    end
+end
+
+def fun_l6_n145(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n146(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n147(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n299(x)
+    end
+end
+
+def fun_l6_n148(x)
+    if (x < 1)
+        fun_l7_n239(x)
+    else
+        fun_l7_n70(x)
+    end
+end
+
+def fun_l6_n149(x)
+    if (x < 1)
+        fun_l7_n864(x)
+    else
+        fun_l7_n131(x)
+    end
+end
+
+def fun_l6_n150(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n112(x)
+    end
+end
+
+def fun_l6_n151(x)
+    if (x < 1)
+        fun_l7_n466(x)
+    else
+        fun_l7_n672(x)
+    end
+end
+
+def fun_l6_n152(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n8(x)
+    end
+end
+
+def fun_l6_n153(x)
+    if (x < 1)
+        fun_l7_n408(x)
+    else
+        fun_l7_n538(x)
+    end
+end
+
+def fun_l6_n154(x)
+    if (x < 1)
+        fun_l7_n984(x)
+    else
+        fun_l7_n134(x)
+    end
+end
+
+def fun_l6_n155(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n62(x)
+    end
+end
+
+def fun_l6_n156(x)
+    if (x < 1)
+        fun_l7_n576(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n157(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n470(x)
+    end
+end
+
+def fun_l6_n158(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n11(x)
+    end
+end
+
+def fun_l6_n159(x)
+    if (x < 1)
+        fun_l7_n45(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n160(x)
+    if (x < 1)
+        fun_l7_n659(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n161(x)
+    if (x < 1)
+        fun_l7_n586(x)
+    else
+        fun_l7_n617(x)
+    end
+end
+
+def fun_l6_n162(x)
+    if (x < 1)
+        fun_l7_n844(x)
+    else
+        fun_l7_n831(x)
+    end
+end
+
+def fun_l6_n163(x)
+    if (x < 1)
+        fun_l7_n14(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n164(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n837(x)
+    end
+end
+
+def fun_l6_n165(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n902(x)
+    end
+end
+
+def fun_l6_n166(x)
+    if (x < 1)
+        fun_l7_n490(x)
+    else
+        fun_l7_n724(x)
+    end
+end
+
+def fun_l6_n167(x)
+    if (x < 1)
+        fun_l7_n612(x)
+    else
+        fun_l7_n792(x)
+    end
+end
+
+def fun_l6_n168(x)
+    if (x < 1)
+        fun_l7_n344(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n169(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n456(x)
+    end
+end
+
+def fun_l6_n170(x)
+    if (x < 1)
+        fun_l7_n893(x)
+    else
+        fun_l7_n358(x)
+    end
+end
+
+def fun_l6_n171(x)
+    if (x < 1)
+        fun_l7_n926(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n172(x)
+    if (x < 1)
+        fun_l7_n856(x)
+    else
+        fun_l7_n553(x)
+    end
+end
+
+def fun_l6_n173(x)
+    if (x < 1)
+        fun_l7_n694(x)
+    else
+        fun_l7_n918(x)
+    end
+end
+
+def fun_l6_n174(x)
+    if (x < 1)
+        fun_l7_n884(x)
+    else
+        fun_l7_n711(x)
+    end
+end
+
+def fun_l6_n175(x)
+    if (x < 1)
+        fun_l7_n884(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n176(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n14(x)
+    end
+end
+
+def fun_l6_n177(x)
+    if (x < 1)
+        fun_l7_n844(x)
+    else
+        fun_l7_n549(x)
+    end
+end
+
+def fun_l6_n178(x)
+    if (x < 1)
+        fun_l7_n396(x)
+    else
+        fun_l7_n802(x)
+    end
+end
+
+def fun_l6_n179(x)
+    if (x < 1)
+        fun_l7_n407(x)
+    else
+        fun_l7_n612(x)
+    end
+end
+
+def fun_l6_n180(x)
+    if (x < 1)
+        fun_l7_n403(x)
+    else
+        fun_l7_n768(x)
+    end
+end
+
+def fun_l6_n181(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n301(x)
+    end
+end
+
+def fun_l6_n182(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n923(x)
+    end
+end
+
+def fun_l6_n183(x)
+    if (x < 1)
+        fun_l7_n664(x)
+    else
+        fun_l7_n451(x)
+    end
+end
+
+def fun_l6_n184(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n438(x)
+    end
+end
+
+def fun_l6_n185(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n726(x)
+    end
+end
+
+def fun_l6_n186(x)
+    if (x < 1)
+        fun_l7_n128(x)
+    else
+        fun_l7_n166(x)
+    end
+end
+
+def fun_l6_n187(x)
+    if (x < 1)
+        fun_l7_n515(x)
+    else
+        fun_l7_n21(x)
+    end
+end
+
+def fun_l6_n188(x)
+    if (x < 1)
+        fun_l7_n487(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n189(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n579(x)
+    end
+end
+
+def fun_l6_n190(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n191(x)
+    if (x < 1)
+        fun_l7_n737(x)
+    else
+        fun_l7_n436(x)
+    end
+end
+
+def fun_l6_n192(x)
+    if (x < 1)
+        fun_l7_n260(x)
+    else
+        fun_l7_n657(x)
+    end
+end
+
+def fun_l6_n193(x)
+    if (x < 1)
+        fun_l7_n722(x)
+    else
+        fun_l7_n489(x)
+    end
+end
+
+def fun_l6_n194(x)
+    if (x < 1)
+        fun_l7_n53(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n195(x)
+    if (x < 1)
+        fun_l7_n91(x)
+    else
+        fun_l7_n597(x)
+    end
+end
+
+def fun_l6_n196(x)
+    if (x < 1)
+        fun_l7_n980(x)
+    else
+        fun_l7_n498(x)
+    end
+end
+
+def fun_l6_n197(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n328(x)
+    end
+end
+
+def fun_l6_n198(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n761(x)
+    end
+end
+
+def fun_l6_n199(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n200(x)
+    if (x < 1)
+        fun_l7_n597(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n201(x)
+    if (x < 1)
+        fun_l7_n973(x)
+    else
+        fun_l7_n453(x)
+    end
+end
+
+def fun_l6_n202(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n794(x)
+    end
+end
+
+def fun_l6_n203(x)
+    if (x < 1)
+        fun_l7_n294(x)
+    else
+        fun_l7_n271(x)
+    end
+end
+
+def fun_l6_n204(x)
+    if (x < 1)
+        fun_l7_n783(x)
+    else
+        fun_l7_n20(x)
+    end
+end
+
+def fun_l6_n205(x)
+    if (x < 1)
+        fun_l7_n941(x)
+    else
+        fun_l7_n517(x)
+    end
+end
+
+def fun_l6_n206(x)
+    if (x < 1)
+        fun_l7_n306(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n207(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n313(x)
+    end
+end
+
+def fun_l6_n208(x)
+    if (x < 1)
+        fun_l7_n766(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n209(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n210(x)
+    if (x < 1)
+        fun_l7_n279(x)
+    else
+        fun_l7_n695(x)
+    end
+end
+
+def fun_l6_n211(x)
+    if (x < 1)
+        fun_l7_n981(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n212(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n752(x)
+    end
+end
+
+def fun_l6_n213(x)
+    if (x < 1)
+        fun_l7_n238(x)
+    else
+        fun_l7_n322(x)
+    end
+end
+
+def fun_l6_n214(x)
+    if (x < 1)
+        fun_l7_n832(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n215(x)
+    if (x < 1)
+        fun_l7_n369(x)
+    else
+        fun_l7_n793(x)
+    end
+end
+
+def fun_l6_n216(x)
+    if (x < 1)
+        fun_l7_n897(x)
+    else
+        fun_l7_n22(x)
+    end
+end
+
+def fun_l6_n217(x)
+    if (x < 1)
+        fun_l7_n94(x)
+    else
+        fun_l7_n93(x)
+    end
+end
+
+def fun_l6_n218(x)
+    if (x < 1)
+        fun_l7_n638(x)
+    else
+        fun_l7_n267(x)
+    end
+end
+
+def fun_l6_n219(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n162(x)
+    end
+end
+
+def fun_l6_n220(x)
+    if (x < 1)
+        fun_l7_n969(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n221(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n421(x)
+    end
+end
+
+def fun_l6_n222(x)
+    if (x < 1)
+        fun_l7_n312(x)
+    else
+        fun_l7_n475(x)
+    end
+end
+
+def fun_l6_n223(x)
+    if (x < 1)
+        fun_l7_n566(x)
+    else
+        fun_l7_n497(x)
+    end
+end
+
+def fun_l6_n224(x)
+    if (x < 1)
+        fun_l7_n560(x)
+    else
+        fun_l7_n60(x)
+    end
+end
+
+def fun_l6_n225(x)
+    if (x < 1)
+        fun_l7_n484(x)
+    else
+        fun_l7_n602(x)
+    end
+end
+
+def fun_l6_n226(x)
+    if (x < 1)
+        fun_l7_n399(x)
+    else
+        fun_l7_n614(x)
+    end
+end
+
+def fun_l6_n227(x)
+    if (x < 1)
+        fun_l7_n344(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n228(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n211(x)
+    end
+end
+
+def fun_l6_n229(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n51(x)
+    end
+end
+
+def fun_l6_n230(x)
+    if (x < 1)
+        fun_l7_n978(x)
+    else
+        fun_l7_n334(x)
+    end
+end
+
+def fun_l6_n231(x)
+    if (x < 1)
+        fun_l7_n136(x)
+    else
+        fun_l7_n296(x)
+    end
+end
+
+def fun_l6_n232(x)
+    if (x < 1)
+        fun_l7_n24(x)
+    else
+        fun_l7_n282(x)
+    end
+end
+
+def fun_l6_n233(x)
+    if (x < 1)
+        fun_l7_n803(x)
+    else
+        fun_l7_n623(x)
+    end
+end
+
+def fun_l6_n234(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n235(x)
+    if (x < 1)
+        fun_l7_n627(x)
+    else
+        fun_l7_n260(x)
+    end
+end
+
+def fun_l6_n236(x)
+    if (x < 1)
+        fun_l7_n460(x)
+    else
+        fun_l7_n693(x)
+    end
+end
+
+def fun_l6_n237(x)
+    if (x < 1)
+        fun_l7_n635(x)
+    else
+        fun_l7_n745(x)
+    end
+end
+
+def fun_l6_n238(x)
+    if (x < 1)
+        fun_l7_n76(x)
+    else
+        fun_l7_n283(x)
+    end
+end
+
+def fun_l6_n239(x)
+    if (x < 1)
+        fun_l7_n183(x)
+    else
+        fun_l7_n515(x)
+    end
+end
+
+def fun_l6_n240(x)
+    if (x < 1)
+        fun_l7_n266(x)
+    else
+        fun_l7_n34(x)
+    end
+end
+
+def fun_l6_n241(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n242(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n669(x)
+    end
+end
+
+def fun_l6_n243(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n244(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n659(x)
+    end
+end
+
+def fun_l6_n245(x)
+    if (x < 1)
+        fun_l7_n881(x)
+    else
+        fun_l7_n229(x)
+    end
+end
+
+def fun_l6_n246(x)
+    if (x < 1)
+        fun_l7_n328(x)
+    else
+        fun_l7_n935(x)
+    end
+end
+
+def fun_l6_n247(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n565(x)
+    end
+end
+
+def fun_l6_n248(x)
+    if (x < 1)
+        fun_l7_n161(x)
+    else
+        fun_l7_n760(x)
+    end
+end
+
+def fun_l6_n249(x)
+    if (x < 1)
+        fun_l7_n115(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n250(x)
+    if (x < 1)
+        fun_l7_n350(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n251(x)
+    if (x < 1)
+        fun_l7_n920(x)
+    else
+        fun_l7_n51(x)
+    end
+end
+
+def fun_l6_n252(x)
+    if (x < 1)
+        fun_l7_n132(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n253(x)
+    if (x < 1)
+        fun_l7_n618(x)
+    else
+        fun_l7_n325(x)
+    end
+end
+
+def fun_l6_n254(x)
+    if (x < 1)
+        fun_l7_n682(x)
+    else
+        fun_l7_n840(x)
+    end
+end
+
+def fun_l6_n255(x)
+    if (x < 1)
+        fun_l7_n462(x)
+    else
+        fun_l7_n780(x)
+    end
+end
+
+def fun_l6_n256(x)
+    if (x < 1)
+        fun_l7_n712(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n257(x)
+    if (x < 1)
+        fun_l7_n111(x)
+    else
+        fun_l7_n121(x)
+    end
+end
+
+def fun_l6_n258(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n384(x)
+    end
+end
+
+def fun_l6_n259(x)
+    if (x < 1)
+        fun_l7_n610(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n260(x)
+    if (x < 1)
+        fun_l7_n778(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n261(x)
+    if (x < 1)
+        fun_l7_n376(x)
+    else
+        fun_l7_n892(x)
+    end
+end
+
+def fun_l6_n262(x)
+    if (x < 1)
+        fun_l7_n454(x)
+    else
+        fun_l7_n468(x)
+    end
+end
+
+def fun_l6_n263(x)
+    if (x < 1)
+        fun_l7_n708(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n264(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n299(x)
+    end
+end
+
+def fun_l6_n265(x)
+    if (x < 1)
+        fun_l7_n987(x)
+    else
+        fun_l7_n318(x)
+    end
+end
+
+def fun_l6_n266(x)
+    if (x < 1)
+        fun_l7_n372(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n267(x)
+    if (x < 1)
+        fun_l7_n493(x)
+    else
+        fun_l7_n288(x)
+    end
+end
+
+def fun_l6_n268(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n10(x)
+    end
+end
+
+def fun_l6_n269(x)
+    if (x < 1)
+        fun_l7_n417(x)
+    else
+        fun_l7_n703(x)
+    end
+end
+
+def fun_l6_n270(x)
+    if (x < 1)
+        fun_l7_n410(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n271(x)
+    if (x < 1)
+        fun_l7_n281(x)
+    else
+        fun_l7_n447(x)
+    end
+end
+
+def fun_l6_n272(x)
+    if (x < 1)
+        fun_l7_n263(x)
+    else
+        fun_l7_n374(x)
+    end
+end
+
+def fun_l6_n273(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n274(x)
+    if (x < 1)
+        fun_l7_n176(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n275(x)
+    if (x < 1)
+        fun_l7_n848(x)
+    else
+        fun_l7_n416(x)
+    end
+end
+
+def fun_l6_n276(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n969(x)
+    end
+end
+
+def fun_l6_n277(x)
+    if (x < 1)
+        fun_l7_n356(x)
+    else
+        fun_l7_n722(x)
+    end
+end
+
+def fun_l6_n278(x)
+    if (x < 1)
+        fun_l7_n888(x)
+    else
+        fun_l7_n156(x)
+    end
+end
+
+def fun_l6_n279(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n123(x)
+    end
+end
+
+def fun_l6_n280(x)
+    if (x < 1)
+        fun_l7_n393(x)
+    else
+        fun_l7_n765(x)
+    end
+end
+
+def fun_l6_n281(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n277(x)
+    end
+end
+
+def fun_l6_n282(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n643(x)
+    end
+end
+
+def fun_l6_n283(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n449(x)
+    end
+end
+
+def fun_l6_n284(x)
+    if (x < 1)
+        fun_l7_n200(x)
+    else
+        fun_l7_n806(x)
+    end
+end
+
+def fun_l6_n285(x)
+    if (x < 1)
+        fun_l7_n575(x)
+    else
+        fun_l7_n409(x)
+    end
+end
+
+def fun_l6_n286(x)
+    if (x < 1)
+        fun_l7_n377(x)
+    else
+        fun_l7_n456(x)
+    end
+end
+
+def fun_l6_n287(x)
+    if (x < 1)
+        fun_l7_n519(x)
+    else
+        fun_l7_n473(x)
+    end
+end
+
+def fun_l6_n288(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n45(x)
+    end
+end
+
+def fun_l6_n289(x)
+    if (x < 1)
+        fun_l7_n678(x)
+    else
+        fun_l7_n910(x)
+    end
+end
+
+def fun_l6_n290(x)
+    if (x < 1)
+        fun_l7_n628(x)
+    else
+        fun_l7_n939(x)
+    end
+end
+
+def fun_l6_n291(x)
+    if (x < 1)
+        fun_l7_n967(x)
+    else
+        fun_l7_n927(x)
+    end
+end
+
+def fun_l6_n292(x)
+    if (x < 1)
+        fun_l7_n634(x)
+    else
+        fun_l7_n184(x)
+    end
+end
+
+def fun_l6_n293(x)
+    if (x < 1)
+        fun_l7_n857(x)
+    else
+        fun_l7_n625(x)
+    end
+end
+
+def fun_l6_n294(x)
+    if (x < 1)
+        fun_l7_n105(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n295(x)
+    if (x < 1)
+        fun_l7_n642(x)
+    else
+        fun_l7_n566(x)
+    end
+end
+
+def fun_l6_n296(x)
+    if (x < 1)
+        fun_l7_n173(x)
+    else
+        fun_l7_n619(x)
+    end
+end
+
+def fun_l6_n297(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n298(x)
+    if (x < 1)
+        fun_l7_n447(x)
+    else
+        fun_l7_n808(x)
+    end
+end
+
+def fun_l6_n299(x)
+    if (x < 1)
+        fun_l7_n838(x)
+    else
+        fun_l7_n856(x)
+    end
+end
+
+def fun_l6_n300(x)
+    if (x < 1)
+        fun_l7_n893(x)
+    else
+        fun_l7_n99(x)
+    end
+end
+
+def fun_l6_n301(x)
+    if (x < 1)
+        fun_l7_n180(x)
+    else
+        fun_l7_n126(x)
+    end
+end
+
+def fun_l6_n302(x)
+    if (x < 1)
+        fun_l7_n62(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n303(x)
+    if (x < 1)
+        fun_l7_n709(x)
+    else
+        fun_l7_n196(x)
+    end
+end
+
+def fun_l6_n304(x)
+    if (x < 1)
+        fun_l7_n408(x)
+    else
+        fun_l7_n730(x)
+    end
+end
+
+def fun_l6_n305(x)
+    if (x < 1)
+        fun_l7_n736(x)
+    else
+        fun_l7_n673(x)
+    end
+end
+
+def fun_l6_n306(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n519(x)
+    end
+end
+
+def fun_l6_n307(x)
+    if (x < 1)
+        fun_l7_n629(x)
+    else
+        fun_l7_n670(x)
+    end
+end
+
+def fun_l6_n308(x)
+    if (x < 1)
+        fun_l7_n839(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n309(x)
+    if (x < 1)
+        fun_l7_n123(x)
+    else
+        fun_l7_n553(x)
+    end
+end
+
+def fun_l6_n310(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n815(x)
+    end
+end
+
+def fun_l6_n311(x)
+    if (x < 1)
+        fun_l7_n860(x)
+    else
+        fun_l7_n519(x)
+    end
+end
+
+def fun_l6_n312(x)
+    if (x < 1)
+        fun_l7_n181(x)
+    else
+        fun_l7_n674(x)
+    end
+end
+
+def fun_l6_n313(x)
+    if (x < 1)
+        fun_l7_n654(x)
+    else
+        fun_l7_n500(x)
+    end
+end
+
+def fun_l6_n314(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n315(x)
+    if (x < 1)
+        fun_l7_n944(x)
+    else
+        fun_l7_n956(x)
+    end
+end
+
+def fun_l6_n316(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n245(x)
+    end
+end
+
+def fun_l6_n317(x)
+    if (x < 1)
+        fun_l7_n520(x)
+    else
+        fun_l7_n919(x)
+    end
+end
+
+def fun_l6_n318(x)
+    if (x < 1)
+        fun_l7_n843(x)
+    else
+        fun_l7_n793(x)
+    end
+end
+
+def fun_l6_n319(x)
+    if (x < 1)
+        fun_l7_n765(x)
+    else
+        fun_l7_n363(x)
+    end
+end
+
+def fun_l6_n320(x)
+    if (x < 1)
+        fun_l7_n483(x)
+    else
+        fun_l7_n439(x)
+    end
+end
+
+def fun_l6_n321(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n322(x)
+    if (x < 1)
+        fun_l7_n398(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n323(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n324(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n325(x)
+    if (x < 1)
+        fun_l7_n512(x)
+    else
+        fun_l7_n303(x)
+    end
+end
+
+def fun_l6_n326(x)
+    if (x < 1)
+        fun_l7_n86(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n327(x)
+    if (x < 1)
+        fun_l7_n857(x)
+    else
+        fun_l7_n751(x)
+    end
+end
+
+def fun_l6_n328(x)
+    if (x < 1)
+        fun_l7_n341(x)
+    else
+        fun_l7_n208(x)
+    end
+end
+
+def fun_l6_n329(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n330(x)
+    if (x < 1)
+        fun_l7_n217(x)
+    else
+        fun_l7_n604(x)
+    end
+end
+
+def fun_l6_n331(x)
+    if (x < 1)
+        fun_l7_n607(x)
+    else
+        fun_l7_n471(x)
+    end
+end
+
+def fun_l6_n332(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n787(x)
+    end
+end
+
+def fun_l6_n333(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n334(x)
+    if (x < 1)
+        fun_l7_n666(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n335(x)
+    if (x < 1)
+        fun_l7_n3(x)
+    else
+        fun_l7_n970(x)
+    end
+end
+
+def fun_l6_n336(x)
+    if (x < 1)
+        fun_l7_n977(x)
+    else
+        fun_l7_n77(x)
+    end
+end
+
+def fun_l6_n337(x)
+    if (x < 1)
+        fun_l7_n54(x)
+    else
+        fun_l7_n814(x)
+    end
+end
+
+def fun_l6_n338(x)
+    if (x < 1)
+        fun_l7_n129(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n339(x)
+    if (x < 1)
+        fun_l7_n866(x)
+    else
+        fun_l7_n821(x)
+    end
+end
+
+def fun_l6_n340(x)
+    if (x < 1)
+        fun_l7_n912(x)
+    else
+        fun_l7_n24(x)
+    end
+end
+
+def fun_l6_n341(x)
+    if (x < 1)
+        fun_l7_n684(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n342(x)
+    if (x < 1)
+        fun_l7_n816(x)
+    else
+        fun_l7_n826(x)
+    end
+end
+
+def fun_l6_n343(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n344(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n345(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n346(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n353(x)
+    end
+end
+
+def fun_l6_n347(x)
+    if (x < 1)
+        fun_l7_n905(x)
+    else
+        fun_l7_n422(x)

path: root/spec/ruby/core/enumerable/include_spec.rb

require_relative '../../spec_helper'
require_relative 'fixtures/classes'
require_relative 'shared/include'

describe "Enumerable#include?" do
  it_behaves_like :enumerable_include, :include?
end